2 * Copyright (c) 2003-2007 Tim Kientzle
3 * Copyright (c) 2008 Joerg Sonnenberger
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include "archive_platform.h"
28 __FBSDID("$FreeBSD: src/lib/libarchive/archive_read_support_format_mtree.c,v 1.11 2008/12/06 06:45:15 kientzle Exp $");
30 #ifdef HAVE_SYS_STAT_H
40 /* #include <stdint.h> */ /* See archive_platform.h */
49 #include "archive_entry.h"
50 #include "archive_private.h"
51 #include "archive_read_private.h"
52 #include "archive_string.h"
58 #define MTREE_HAS_DEVICE 0x0001
59 #define MTREE_HAS_FFLAGS 0x0002
60 #define MTREE_HAS_GID 0x0004
61 #define MTREE_HAS_GNAME 0x0008
62 #define MTREE_HAS_MTIME 0x0010
63 #define MTREE_HAS_NLINK 0x0020
64 #define MTREE_HAS_PERM 0x0040
65 #define MTREE_HAS_SIZE 0x0080
66 #define MTREE_HAS_TYPE 0x0100
67 #define MTREE_HAS_UID 0x0200
68 #define MTREE_HAS_UNAME 0x0400
70 #define MTREE_HAS_OPTIONAL 0x0800
73 struct mtree_option *next;
78 struct mtree_entry *next;
79 struct mtree_option *options;
86 struct archive_string line;
93 const char *archive_format_name;
94 struct mtree_entry *entries;
95 struct mtree_entry *this_entry;
96 struct archive_string current_dir;
97 struct archive_string contents_name;
99 struct archive_entry_linkresolver *resolver;
101 off_t cur_size, cur_offset;
104 static int cleanup(struct archive_read *);
105 static int mtree_bid(struct archive_read *);
106 static int parse_file(struct archive_read *, struct archive_entry *,
107 struct mtree *, struct mtree_entry *, int *);
108 static void parse_escapes(char *, struct mtree_entry *);
109 static int parse_line(struct archive_read *, struct archive_entry *,
110 struct mtree *, struct mtree_entry *, int *);
111 static int parse_keyword(struct archive_read *, struct mtree *,
112 struct archive_entry *, struct mtree_option *, int *);
113 static int read_data(struct archive_read *a,
114 const void **buff, size_t *size, off_t *offset);
115 static ssize_t readline(struct archive_read *, struct mtree *, char **, ssize_t);
116 static int skip(struct archive_read *a);
117 static int read_header(struct archive_read *,
118 struct archive_entry *);
119 static int64_t mtree_atol10(char **);
120 static int64_t mtree_atol8(char **);
121 static int64_t mtree_atol(char **);
124 free_options(struct mtree_option *head)
126 struct mtree_option *next;
128 for (; head != NULL; head = next) {
136 archive_read_support_format_mtree(struct archive *_a)
138 struct archive_read *a = (struct archive_read *)_a;
142 mtree = (struct mtree *)malloc(sizeof(*mtree));
144 archive_set_error(&a->archive, ENOMEM,
145 "Can't allocate mtree data");
146 return (ARCHIVE_FATAL);
148 memset(mtree, 0, sizeof(*mtree));
151 r = __archive_read_register_format(a, mtree, "mtree",
152 mtree_bid, NULL, read_header, read_data, skip, cleanup);
160 cleanup(struct archive_read *a)
163 struct mtree_entry *p, *q;
165 mtree = (struct mtree *)(a->format->data);
171 free_options(p->options);
175 archive_string_free(&mtree->line);
176 archive_string_free(&mtree->current_dir);
177 archive_string_free(&mtree->contents_name);
178 archive_entry_linkresolver_free(mtree->resolver);
182 (a->format->data) = NULL;
188 mtree_bid(struct archive_read *a)
190 const char *signature = "#mtree";
193 /* Now let's look at the actual header and see if it matches. */
194 p = __archive_read_ahead(a, strlen(signature), NULL);
198 if (strncmp(p, signature, strlen(signature)) == 0)
199 return (8 * strlen(signature));
204 * The extended mtree format permits multiple lines specifying
205 * attributes for each file. For those entries, only the last line
206 * is actually used. Practically speaking, that means we have
207 * to read the entire mtree file into memory up front.
209 * The parsing is done in two steps. First, it is decided if a line
210 * changes the global defaults and if it is, processed accordingly.
211 * Otherwise, the options of the line are merged with the current
215 add_option(struct archive_read *a, struct mtree_option **global,
216 const char *value, size_t len)
218 struct mtree_option *option;
220 if ((option = malloc(sizeof(*option))) == NULL) {
221 archive_set_error(&a->archive, errno, "Can't allocate memory");
222 return (ARCHIVE_FATAL);
224 if ((option->value = malloc(len + 1)) == NULL) {
226 archive_set_error(&a->archive, errno, "Can't allocate memory");
227 return (ARCHIVE_FATAL);
229 memcpy(option->value, value, len);
230 option->value[len] = '\0';
231 option->next = *global;
237 remove_option(struct mtree_option **global, const char *value, size_t len)
239 struct mtree_option *iter, *last;
242 for (iter = *global; iter != NULL; last = iter, iter = iter->next) {
243 if (strncmp(iter->value, value, len) == 0 &&
244 (iter->value[len] == '\0' ||
245 iter->value[len] == '='))
251 *global = iter->next;
253 last->next = iter->next;
260 process_global_set(struct archive_read *a,
261 struct mtree_option **global, const char *line)
263 const char *next, *eq;
269 next = line + strspn(line, " \t\r\n");
273 next = line + strcspn(line, " \t\r\n");
274 eq = strchr(line, '=');
280 remove_option(global, line, len);
281 r = add_option(a, global, line, next - line);
289 process_global_unset(struct archive_read *a,
290 struct mtree_option **global, const char *line)
296 if (strchr(line, '=') != NULL) {
297 archive_set_error(&a->archive, ARCHIVE_ERRNO_MISC,
298 "/unset shall not contain `='");
299 return ARCHIVE_FATAL;
303 next = line + strspn(line, " \t\r\n");
307 len = strcspn(line, " \t\r\n");
309 if (len == 3 && strncmp(line, "all", 3) == 0) {
310 free_options(*global);
313 remove_option(global, line, len);
321 process_add_entry(struct archive_read *a, struct mtree *mtree,
322 struct mtree_option **global, const char *line,
323 struct mtree_entry **last_entry)
325 struct mtree_entry *entry;
326 struct mtree_option *iter;
327 const char *next, *eq;
331 if ((entry = malloc(sizeof(*entry))) == NULL) {
332 archive_set_error(&a->archive, errno, "Can't allocate memory");
333 return (ARCHIVE_FATAL);
336 entry->options = NULL;
341 /* Add this entry to list. */
342 if (*last_entry == NULL)
343 mtree->entries = entry;
345 (*last_entry)->next = entry;
348 len = strcspn(line, " \t\r\n");
349 if ((entry->name = malloc(len + 1)) == NULL) {
350 archive_set_error(&a->archive, errno, "Can't allocate memory");
351 return (ARCHIVE_FATAL);
354 memcpy(entry->name, line, len);
355 entry->name[len] = '\0';
356 parse_escapes(entry->name, entry);
359 for (iter = *global; iter != NULL; iter = iter->next) {
360 r = add_option(a, &entry->options, iter->value,
361 strlen(iter->value));
367 next = line + strspn(line, " \t\r\n");
371 next = line + strcspn(line, " \t\r\n");
372 eq = strchr(line, '=');
378 remove_option(&entry->options, line, len);
379 r = add_option(a, &entry->options, line, next - line);
387 read_mtree(struct archive_read *a, struct mtree *mtree)
392 struct mtree_option *global;
393 struct mtree_entry *last_entry;
396 mtree->archive_format = ARCHIVE_FORMAT_MTREE;
397 mtree->archive_format_name = "mtree";
403 for (counter = 1; ; ++counter) {
404 len = readline(a, mtree, &p, 256);
406 mtree->this_entry = mtree->entries;
407 free_options(global);
411 free_options(global);
414 /* Leading whitespace is never significant, ignore it. */
415 while (*p == ' ' || *p == '\t') {
419 /* Skip content lines and blank lines. */
422 if (*p == '\r' || *p == '\n' || *p == '\0')
425 r = process_add_entry(a, mtree, &global, p,
427 } else if (strncmp(p, "/set", 4) == 0) {
428 if (p[4] != ' ' && p[4] != '\t')
430 r = process_global_set(a, &global, p);
431 } else if (strncmp(p, "/unset", 6) == 0) {
432 if (p[6] != ' ' && p[6] != '\t')
434 r = process_global_unset(a, &global, p);
438 if (r != ARCHIVE_OK) {
439 free_options(global);
444 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
445 "Can't parse line %ju", counter);
446 free_options(global);
447 return (ARCHIVE_FATAL);
451 * Read in the entire mtree file into memory on the first request.
452 * Then use the next unused file to satisfy each header request.
455 read_header(struct archive_read *a, struct archive_entry *entry)
461 mtree = (struct mtree *)(a->format->data);
463 if (mtree->fd >= 0) {
468 if (mtree->entries == NULL) {
469 mtree->resolver = archive_entry_linkresolver_new();
470 if (mtree->resolver == NULL)
471 return ARCHIVE_FATAL;
472 archive_entry_linkresolver_set_strategy(mtree->resolver,
473 ARCHIVE_FORMAT_MTREE);
474 r = read_mtree(a, mtree);
479 a->archive.archive_format = mtree->archive_format;
480 a->archive.archive_format_name = mtree->archive_format_name;
483 if (mtree->this_entry == NULL)
484 return (ARCHIVE_EOF);
485 if (strcmp(mtree->this_entry->name, "..") == 0) {
486 mtree->this_entry->used = 1;
487 if (archive_strlen(&mtree->current_dir) > 0) {
488 /* Roll back current path. */
489 p = mtree->current_dir.s
490 + mtree->current_dir.length - 1;
491 while (p >= mtree->current_dir.s && *p != '/')
493 if (p >= mtree->current_dir.s)
495 mtree->current_dir.length
496 = p - mtree->current_dir.s + 1;
499 if (!mtree->this_entry->used) {
501 r = parse_file(a, entry, mtree, mtree->this_entry, &use_next);
505 mtree->this_entry = mtree->this_entry->next;
510 * A single file can have multiple lines contribute specifications.
511 * Parse as many lines as necessary, then pull additional information
512 * from a backing file on disk as necessary.
515 parse_file(struct archive_read *a, struct archive_entry *entry,
516 struct mtree *mtree, struct mtree_entry *mentry, int *use_next)
519 struct stat st_storage, *st;
520 struct mtree_entry *mp;
521 struct archive_entry *sparse_entry;
522 int r = ARCHIVE_OK, r1, parsed_kws, mismatched_type;
526 /* Initialize reasonable defaults. */
527 mtree->filetype = AE_IFREG;
528 archive_entry_set_size(entry, 0);
530 /* Parse options from this line. */
532 r = parse_line(a, entry, mtree, mentry, &parsed_kws);
535 archive_entry_copy_pathname(entry, mentry->name);
537 * "Full" entries are allowed to have multiple lines
538 * and those lines aren't required to be adjacent. We
539 * don't support multiple lines for "relative" entries
540 * nor do we make any attempt to merge data from
541 * separate "relative" and "full" entries. (Merging
542 * "relative" and "full" entries would require dealing
543 * with pathname canonicalization, which is a very
546 for (mp = mentry->next; mp != NULL; mp = mp->next) {
547 if (mp->full && !mp->used
548 && strcmp(mentry->name, mp->name) == 0) {
549 /* Later lines override earlier ones. */
551 r1 = parse_line(a, entry, mtree, mp,
559 * Relative entries require us to construct
560 * the full path and possibly update the
563 size_t n = archive_strlen(&mtree->current_dir);
565 archive_strcat(&mtree->current_dir, "/");
566 archive_strcat(&mtree->current_dir, mentry->name);
567 archive_entry_copy_pathname(entry, mtree->current_dir.s);
568 if (archive_entry_filetype(entry) != AE_IFDIR)
569 mtree->current_dir.length = n;
573 * Try to open and stat the file to get the real size
574 * and other file info. It would be nice to avoid
575 * this here so that getting a listing of an mtree
576 * wouldn't require opening every referenced contents
577 * file. But then we wouldn't know the actual
578 * contents size, so I don't see a really viable way
579 * around this. (Also, we may want to someday pull
580 * other unspecified info from the contents file on
584 if (archive_strlen(&mtree->contents_name) > 0)
585 path = mtree->contents_name.s;
587 path = archive_entry_pathname(entry);
589 if (archive_entry_filetype(entry) == AE_IFREG ||
590 archive_entry_filetype(entry) == AE_IFDIR) {
591 mtree->fd = open(path,
592 O_RDONLY | O_BINARY);
593 if (mtree->fd == -1 &&
595 archive_strlen(&mtree->contents_name) > 0)) {
596 archive_set_error(&a->archive, errno,
597 "Can't open %s", path);
603 if (mtree->fd >= 0) {
604 if (fstat(mtree->fd, st) == -1) {
605 archive_set_error(&a->archive, errno,
606 "Could not fstat %s", path);
608 /* If we can't stat it, don't keep it open. */
613 } else if (lstat(path, st) == -1) {
618 * If there is a contents file on disk, use that size;
619 * otherwise leave it as-is (it might have been set from
620 * the mtree size= keyword).
624 if ((st->st_mode & S_IFMT) == S_IFREG &&
625 archive_entry_filetype(entry) != AE_IFREG)
627 if ((st->st_mode & S_IFMT) == S_IFLNK &&
628 archive_entry_filetype(entry) != AE_IFLNK)
630 if ((st->st_mode & S_IFSOCK) == S_IFSOCK &&
631 archive_entry_filetype(entry) != AE_IFSOCK)
633 if ((st->st_mode & S_IFMT) == S_IFCHR &&
634 archive_entry_filetype(entry) != AE_IFCHR)
636 if ((st->st_mode & S_IFMT) == S_IFBLK &&
637 archive_entry_filetype(entry) != AE_IFBLK)
639 if ((st->st_mode & S_IFMT) == S_IFDIR &&
640 archive_entry_filetype(entry) != AE_IFDIR)
642 if ((st->st_mode & S_IFMT) == S_IFIFO &&
643 archive_entry_filetype(entry) != AE_IFIFO)
646 if (mismatched_type) {
647 if ((parsed_kws & MTREE_HAS_OPTIONAL) == 0) {
648 archive_set_error(&a->archive,
650 "mtree specification has different type for %s",
651 archive_entry_pathname(entry));
656 /* Don't hold a non-regular file open. */
666 if ((parsed_kws & MTREE_HAS_DEVICE) == 0 &&
667 (archive_entry_filetype(entry) == AE_IFCHR ||
668 archive_entry_filetype(entry) == AE_IFBLK))
669 archive_entry_set_rdev(entry, st->st_rdev);
670 if ((parsed_kws & (MTREE_HAS_GID | MTREE_HAS_GNAME)) == 0)
671 archive_entry_set_gid(entry, st->st_gid);
672 if ((parsed_kws & (MTREE_HAS_UID | MTREE_HAS_UNAME)) == 0)
673 archive_entry_set_uid(entry, st->st_uid);
674 if ((parsed_kws & MTREE_HAS_MTIME) == 0) {
675 #if HAVE_STRUCT_STAT_ST_MTIMESPEC_TV_NSEC
676 archive_entry_set_mtime(entry, st->st_mtime,
677 st->st_mtimespec.tv_nsec);
678 #elif HAVE_STRUCT_STAT_ST_MTIM_TV_NSEC
679 archive_entry_set_mtime(entry, st->st_mtime,
680 st->st_mtim.tv_nsec);
681 #elif HAVE_STRUCT_STAT_ST_MTIME_N
682 archive_entry_set_mtime(entry, st->st_mtime,
684 #elif HAVE_STRUCT_STAT_ST_UMTIME
685 archive_entry_set_mtime(entry, st->st_mtime,
687 #elif HAVE_STRUCT_STAT_ST_MTIME_USEC
688 archive_entry_set_mtime(entry, st->st_mtime,
689 st->st_mtime_usec*1000);
691 archive_entry_set_mtime(entry, st->st_mtime, 0);
694 if ((parsed_kws & MTREE_HAS_NLINK) == 0)
695 archive_entry_set_nlink(entry, st->st_nlink);
696 if ((parsed_kws & MTREE_HAS_PERM) == 0)
697 archive_entry_set_perm(entry, st->st_mode);
698 if ((parsed_kws & MTREE_HAS_SIZE) == 0)
699 archive_entry_set_size(entry, st->st_size);
700 archive_entry_set_ino(entry, st->st_ino);
701 archive_entry_set_dev(entry, st->st_dev);
703 archive_entry_linkify(mtree->resolver, &entry, &sparse_entry);
704 } else if (parsed_kws & MTREE_HAS_OPTIONAL) {
706 * Couldn't open the entry, stat it or the on-disk type
707 * didn't match. If this entry is optional, just ignore it
708 * and read the next header entry.
714 mtree->cur_size = archive_entry_size(entry);
721 * Each line contains a sequence of keywords.
724 parse_line(struct archive_read *a, struct archive_entry *entry,
725 struct mtree *mtree, struct mtree_entry *mp, int *parsed_kws)
727 struct mtree_option *iter;
728 int r = ARCHIVE_OK, r1;
730 for (iter = mp->options; iter != NULL; iter = iter->next) {
731 r1 = parse_keyword(a, mtree, entry, iter, parsed_kws);
735 if ((*parsed_kws & MTREE_HAS_TYPE) == 0) {
736 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
737 "Missing type keyword in mtree specification");
738 return (ARCHIVE_WARN);
744 * Device entries have one of the following forms:
746 * format,major,minor[,subdevice]
748 * Just use major and minor, no translation etc is done
752 parse_device(struct archive *a, struct archive_entry *entry, char *val)
754 char *comma1, *comma2;
756 comma1 = strchr(val, ',');
757 if (comma1 == NULL) {
758 archive_entry_set_dev(entry, mtree_atol10(&val));
762 comma2 = strchr(comma1, ',');
763 if (comma2 == NULL) {
764 archive_set_error(a, ARCHIVE_ERRNO_FILE_FORMAT,
765 "Malformed device attribute");
766 return (ARCHIVE_WARN);
769 archive_entry_set_rdevmajor(entry, mtree_atol(&comma1));
770 archive_entry_set_rdevminor(entry, mtree_atol(&comma2));
775 * Parse a single keyword and its value.
778 parse_keyword(struct archive_read *a, struct mtree *mtree,
779 struct archive_entry *entry, struct mtree_option *option, int *parsed_kws)
788 if (strcmp(key, "optional") == 0) {
789 *parsed_kws |= MTREE_HAS_OPTIONAL;
792 if (strcmp(key, "ignore") == 0) {
794 * The mtree processing is not recursive, so
795 * recursion will only happen for explicitly listed
801 val = strchr(key, '=');
803 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
804 "Malformed attribute \"%s\" (%d)", key, key[0]);
805 return (ARCHIVE_WARN);
813 if (strcmp(key, "content") == 0
814 || strcmp(key, "contents") == 0) {
815 parse_escapes(val, NULL);
816 archive_strcpy(&mtree->contents_name, val);
819 if (strcmp(key, "cksum") == 0)
822 if (strcmp(key, "device") == 0) {
823 *parsed_kws |= MTREE_HAS_DEVICE;
824 return parse_device(&a->archive, entry, val);
827 if (strcmp(key, "flags") == 0) {
828 *parsed_kws |= MTREE_HAS_FFLAGS;
829 archive_entry_copy_fflags_text(entry, val);
833 if (strcmp(key, "gid") == 0) {
834 *parsed_kws |= MTREE_HAS_GID;
835 archive_entry_set_gid(entry, mtree_atol10(&val));
838 if (strcmp(key, "gname") == 0) {
839 *parsed_kws |= MTREE_HAS_GNAME;
840 archive_entry_copy_gname(entry, val);
844 if (strcmp(key, "link") == 0) {
845 archive_entry_copy_symlink(entry, val);
849 if (strcmp(key, "md5") == 0 || strcmp(key, "md5digest") == 0)
851 if (strcmp(key, "mode") == 0) {
852 if (val[0] >= '0' && val[0] <= '9') {
853 *parsed_kws |= MTREE_HAS_PERM;
854 archive_entry_set_perm(entry,
857 archive_set_error(&a->archive,
858 ARCHIVE_ERRNO_FILE_FORMAT,
859 "Symbolic mode \"%s\" unsupported", val);
865 if (strcmp(key, "nlink") == 0) {
866 *parsed_kws |= MTREE_HAS_NLINK;
867 archive_entry_set_nlink(entry, mtree_atol10(&val));
871 if (strcmp(key, "rmd160") == 0 ||
872 strcmp(key, "rmd160digest") == 0)
875 if (strcmp(key, "sha1") == 0 || strcmp(key, "sha1digest") == 0)
877 if (strcmp(key, "sha256") == 0 ||
878 strcmp(key, "sha256digest") == 0)
880 if (strcmp(key, "sha384") == 0 ||
881 strcmp(key, "sha384digest") == 0)
883 if (strcmp(key, "sha512") == 0 ||
884 strcmp(key, "sha512digest") == 0)
886 if (strcmp(key, "size") == 0) {
887 archive_entry_set_size(entry, mtree_atol10(&val));
891 if (strcmp(key, "tags") == 0) {
893 * Comma delimited list of tags.
894 * Ignore the tags for now, but the interface
895 * should be extended to allow inclusion/exclusion.
899 if (strcmp(key, "time") == 0) {
903 *parsed_kws |= MTREE_HAS_MTIME;
904 m = (time_t)mtree_atol10(&val);
907 ns = (long)mtree_atol10(&val);
910 archive_entry_set_mtime(entry, m, ns);
913 if (strcmp(key, "type") == 0) {
914 *parsed_kws |= MTREE_HAS_TYPE;
917 if (strcmp(val, "block") == 0) {
918 mtree->filetype = AE_IFBLK;
922 if (strcmp(val, "char") == 0) {
923 mtree->filetype = AE_IFCHR;
927 if (strcmp(val, "dir") == 0) {
928 mtree->filetype = AE_IFDIR;
932 if (strcmp(val, "fifo") == 0) {
933 mtree->filetype = AE_IFIFO;
936 if (strcmp(val, "file") == 0) {
937 mtree->filetype = AE_IFREG;
941 if (strcmp(val, "link") == 0) {
942 mtree->filetype = AE_IFLNK;
946 archive_set_error(&a->archive,
947 ARCHIVE_ERRNO_FILE_FORMAT,
948 "Unrecognized file type \"%s\"", val);
949 return (ARCHIVE_WARN);
951 archive_entry_set_filetype(entry, mtree->filetype);
955 if (strcmp(key, "uid") == 0) {
956 *parsed_kws |= MTREE_HAS_UID;
957 archive_entry_set_uid(entry, mtree_atol10(&val));
960 if (strcmp(key, "uname") == 0) {
961 *parsed_kws |= MTREE_HAS_UNAME;
962 archive_entry_copy_uname(entry, val);
966 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
967 "Unrecognized key %s=%s", key, val);
968 return (ARCHIVE_WARN);
974 read_data(struct archive_read *a, const void **buff, size_t *size, off_t *offset)
976 size_t bytes_to_read;
980 mtree = (struct mtree *)(a->format->data);
985 return (ARCHIVE_EOF);
987 if (mtree->buff == NULL) {
988 mtree->buffsize = 64 * 1024;
989 mtree->buff = malloc(mtree->buffsize);
990 if (mtree->buff == NULL) {
991 archive_set_error(&a->archive, ENOMEM,
992 "Can't allocate memory");
993 return (ARCHIVE_FATAL);
998 *offset = mtree->offset;
999 if ((off_t)mtree->buffsize > mtree->cur_size - mtree->offset)
1000 bytes_to_read = mtree->cur_size - mtree->offset;
1002 bytes_to_read = mtree->buffsize;
1003 bytes_read = read(mtree->fd, mtree->buff, bytes_to_read);
1004 if (bytes_read < 0) {
1005 archive_set_error(&a->archive, errno, "Can't read");
1006 return (ARCHIVE_WARN);
1008 if (bytes_read == 0) {
1010 return (ARCHIVE_EOF);
1012 mtree->offset += bytes_read;
1014 return (ARCHIVE_OK);
1017 /* Skip does nothing except possibly close the contents file. */
1019 skip(struct archive_read *a)
1021 struct mtree *mtree;
1023 mtree = (struct mtree *)(a->format->data);
1024 if (mtree->fd >= 0) {
1028 return (ARCHIVE_OK);
1032 * Since parsing backslash sequences always makes strings shorter,
1033 * we can always do this conversion in-place.
1036 parse_escapes(char *src, struct mtree_entry *mentry)
1042 * The current directory is somewhat special, it should be archived
1043 * only once as it will confuse extraction otherwise.
1045 if (strcmp(src, ".") == 0)
1048 while (*src != '\0') {
1050 if (c == '/' && mentry != NULL)
1055 if (src[1] < '0' || src[1] > '7') {
1064 if (src[1] >= '0' && src[1] <= '7' &&
1065 src[2] >= '0' && src[2] <= '7') {
1066 c = (src[0] - '0') << 6;
1067 c |= (src[1] - '0') << 3;
1068 c |= (src[2] - '0');
1112 * Note that this implementation does not (and should not!) obey
1113 * locale settings; you cannot simply substitute strtol here, since
1114 * it does obey locale.
1117 mtree_atol8(char **p)
1119 int64_t l, limit, last_digit_limit;
1123 limit = INT64_MAX / base;
1124 last_digit_limit = INT64_MAX % base;
1128 while (digit >= 0 && digit < base) {
1129 if (l>limit || (l == limit && digit > last_digit_limit)) {
1130 l = INT64_MAX; /* Truncate on overflow. */
1133 l = (l * base) + digit;
1134 digit = *++(*p) - '0';
1140 * Note that this implementation does not (and should not!) obey
1141 * locale settings; you cannot simply substitute strtol here, since
1142 * it does obey locale.
1145 mtree_atol10(char **p)
1147 int64_t l, limit, last_digit_limit;
1148 int base, digit, sign;
1151 limit = INT64_MAX / base;
1152 last_digit_limit = INT64_MAX % base;
1162 while (digit >= 0 && digit < base) {
1163 if (l > limit || (l == limit && digit > last_digit_limit)) {
1164 l = UINT64_MAX; /* Truncate on overflow. */
1167 l = (l * base) + digit;
1168 digit = *++(*p) - '0';
1170 return (sign < 0) ? -l : l;
1174 * Note that this implementation does not (and should not!) obey
1175 * locale settings; you cannot simply substitute strtol here, since
1176 * it does obey locale.
1179 mtree_atol16(char **p)
1181 int64_t l, limit, last_digit_limit;
1182 int base, digit, sign;
1185 limit = INT64_MAX / base;
1186 last_digit_limit = INT64_MAX % base;
1195 if (**p >= '0' && **p <= '9')
1197 else if (**p >= 'a' && **p <= 'f')
1198 digit = **p - 'a' + 10;
1199 else if (**p >= 'A' && **p <= 'F')
1200 digit = **p - 'A' + 10;
1203 while (digit >= 0 && digit < base) {
1204 if (l > limit || (l == limit && digit > last_digit_limit)) {
1205 l = UINT64_MAX; /* Truncate on overflow. */
1208 l = (l * base) + digit;
1209 if (**p >= '0' && **p <= '9')
1211 else if (**p >= 'a' && **p <= 'f')
1212 digit = **p - 'a' + 10;
1213 else if (**p >= 'A' && **p <= 'F')
1214 digit = **p - 'A' + 10;
1218 return (sign < 0) ? -l : l;
1222 mtree_atol(char **p)
1225 return mtree_atol10(p);
1226 if ((*p)[1] == 'x' || (*p)[1] == 'X') {
1228 return mtree_atol16(p);
1230 return mtree_atol8(p);
1234 * Returns length of line (including trailing newline)
1235 * or negative on error. 'start' argument is updated to
1236 * point to first character of line.
1239 readline(struct archive_read *a, struct mtree *mtree, char **start, ssize_t limit)
1242 ssize_t total_size = 0;
1243 ssize_t find_off = 0;
1249 /* Accumulate line in a line buffer. */
1251 /* Read some more. */
1252 t = __archive_read_ahead(a, 1, &bytes_read);
1256 return (ARCHIVE_FATAL);
1257 s = t; /* Start of line? */
1258 p = memchr(t, '\n', bytes_read);
1259 /* If we found '\n', trim the read. */
1261 bytes_read = 1 + ((const char *)p) - s;
1263 if (total_size + bytes_read + 1 > limit) {
1264 archive_set_error(&a->archive,
1265 ARCHIVE_ERRNO_FILE_FORMAT,
1267 return (ARCHIVE_FATAL);
1269 if (archive_string_ensure(&mtree->line,
1270 total_size + bytes_read + 1) == NULL) {
1271 archive_set_error(&a->archive, ENOMEM,
1272 "Can't allocate working buffer");
1273 return (ARCHIVE_FATAL);
1275 memcpy(mtree->line.s + total_size, t, bytes_read);
1276 __archive_read_consume(a, bytes_read);
1277 total_size += bytes_read;
1278 /* Null terminate. */
1279 mtree->line.s[total_size] = '\0';
1280 /* If we found an unescaped '\n', clean up and return. */
1281 for (u = mtree->line.s + find_off; *u; ++u) {
1283 *start = mtree->line.s;
1289 *start = mtree->line.s;
1300 total_size - (u - mtree->line.s) + 1);
1308 find_off = u - mtree->line.s;