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$");
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 * (int)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, '=');
373 if (eq == NULL || eq > next)
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";
402 for (counter = 1; ; ++counter) {
403 len = readline(a, mtree, &p, 256);
405 mtree->this_entry = mtree->entries;
406 free_options(global);
410 free_options(global);
413 /* Leading whitespace is never significant, ignore it. */
414 while (*p == ' ' || *p == '\t') {
418 /* Skip content lines and blank lines. */
421 if (*p == '\r' || *p == '\n' || *p == '\0')
424 r = process_add_entry(a, mtree, &global, p,
426 } else if (strncmp(p, "/set", 4) == 0) {
427 if (p[4] != ' ' && p[4] != '\t')
429 r = process_global_set(a, &global, p);
430 } else if (strncmp(p, "/unset", 6) == 0) {
431 if (p[6] != ' ' && p[6] != '\t')
433 r = process_global_unset(a, &global, p);
437 if (r != ARCHIVE_OK) {
438 free_options(global);
443 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
444 "Can't parse line %ju", counter);
445 free_options(global);
446 return (ARCHIVE_FATAL);
450 * Read in the entire mtree file into memory on the first request.
451 * Then use the next unused file to satisfy each header request.
454 read_header(struct archive_read *a, struct archive_entry *entry)
460 mtree = (struct mtree *)(a->format->data);
462 if (mtree->fd >= 0) {
467 if (mtree->entries == NULL) {
468 mtree->resolver = archive_entry_linkresolver_new();
469 if (mtree->resolver == NULL)
470 return ARCHIVE_FATAL;
471 archive_entry_linkresolver_set_strategy(mtree->resolver,
472 ARCHIVE_FORMAT_MTREE);
473 r = read_mtree(a, mtree);
478 a->archive.archive_format = mtree->archive_format;
479 a->archive.archive_format_name = mtree->archive_format_name;
482 if (mtree->this_entry == NULL)
483 return (ARCHIVE_EOF);
484 if (strcmp(mtree->this_entry->name, "..") == 0) {
485 mtree->this_entry->used = 1;
486 if (archive_strlen(&mtree->current_dir) > 0) {
487 /* Roll back current path. */
488 p = mtree->current_dir.s
489 + mtree->current_dir.length - 1;
490 while (p >= mtree->current_dir.s && *p != '/')
492 if (p >= mtree->current_dir.s)
494 mtree->current_dir.length
495 = p - mtree->current_dir.s + 1;
498 if (!mtree->this_entry->used) {
500 r = parse_file(a, entry, mtree, mtree->this_entry, &use_next);
504 mtree->this_entry = mtree->this_entry->next;
509 * A single file can have multiple lines contribute specifications.
510 * Parse as many lines as necessary, then pull additional information
511 * from a backing file on disk as necessary.
514 parse_file(struct archive_read *a, struct archive_entry *entry,
515 struct mtree *mtree, struct mtree_entry *mentry, int *use_next)
518 struct stat st_storage, *st;
519 struct mtree_entry *mp;
520 struct archive_entry *sparse_entry;
521 int r = ARCHIVE_OK, r1, parsed_kws, mismatched_type;
525 /* Initialize reasonable defaults. */
526 mtree->filetype = AE_IFREG;
527 archive_entry_set_size(entry, 0);
528 archive_string_empty(&mtree->contents_name);
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, O_RDONLY | O_BINARY);
592 if (mtree->fd == -1 &&
594 archive_strlen(&mtree->contents_name) > 0)) {
595 archive_set_error(&a->archive, errno,
596 "Can't open %s", path);
602 if (mtree->fd >= 0) {
603 if (fstat(mtree->fd, st) == -1) {
604 archive_set_error(&a->archive, errno,
605 "Could not fstat %s", path);
607 /* If we can't stat it, don't keep it open. */
612 } else if (lstat(path, st) == -1) {
617 * Check for a mismatch between the type in the specification and
618 * the type of the contents object on disk.
622 if ((st->st_mode & S_IFMT) == S_IFREG &&
623 archive_entry_filetype(entry) != AE_IFREG)
625 if ((st->st_mode & S_IFMT) == S_IFLNK &&
626 archive_entry_filetype(entry) != AE_IFLNK)
628 if ((st->st_mode & S_IFSOCK) == S_IFSOCK &&
629 archive_entry_filetype(entry) != AE_IFSOCK)
631 if ((st->st_mode & S_IFMT) == S_IFCHR &&
632 archive_entry_filetype(entry) != AE_IFCHR)
634 if ((st->st_mode & S_IFMT) == S_IFBLK &&
635 archive_entry_filetype(entry) != AE_IFBLK)
637 if ((st->st_mode & S_IFMT) == S_IFDIR &&
638 archive_entry_filetype(entry) != AE_IFDIR)
640 if ((st->st_mode & S_IFMT) == S_IFIFO &&
641 archive_entry_filetype(entry) != AE_IFIFO)
644 if (mismatched_type) {
645 if ((parsed_kws & MTREE_HAS_OPTIONAL) == 0) {
646 archive_set_error(&a->archive,
648 "mtree specification has different type for %s",
649 archive_entry_pathname(entry));
654 /* Don't hold a non-regular file open. */
664 * If there is a contents file on disk, pick some of the metadata
665 * from that file. For most of these, we only set it from the contents
666 * if it wasn't already parsed from the specification.
669 if ((parsed_kws & MTREE_HAS_DEVICE) == 0 &&
670 (archive_entry_filetype(entry) == AE_IFCHR ||
671 archive_entry_filetype(entry) == AE_IFBLK))
672 archive_entry_set_rdev(entry, st->st_rdev);
673 if ((parsed_kws & (MTREE_HAS_GID | MTREE_HAS_GNAME)) == 0)
674 archive_entry_set_gid(entry, st->st_gid);
675 if ((parsed_kws & (MTREE_HAS_UID | MTREE_HAS_UNAME)) == 0)
676 archive_entry_set_uid(entry, st->st_uid);
677 if ((parsed_kws & MTREE_HAS_MTIME) == 0) {
678 #if HAVE_STRUCT_STAT_ST_MTIMESPEC_TV_NSEC
679 archive_entry_set_mtime(entry, st->st_mtime,
680 st->st_mtimespec.tv_nsec);
681 #elif HAVE_STRUCT_STAT_ST_MTIM_TV_NSEC
682 archive_entry_set_mtime(entry, st->st_mtime,
683 st->st_mtim.tv_nsec);
684 #elif HAVE_STRUCT_STAT_ST_MTIME_N
685 archive_entry_set_mtime(entry, st->st_mtime,
687 #elif HAVE_STRUCT_STAT_ST_UMTIME
688 archive_entry_set_mtime(entry, st->st_mtime,
690 #elif HAVE_STRUCT_STAT_ST_MTIME_USEC
691 archive_entry_set_mtime(entry, st->st_mtime,
692 st->st_mtime_usec*1000);
694 archive_entry_set_mtime(entry, st->st_mtime, 0);
697 if ((parsed_kws & MTREE_HAS_NLINK) == 0)
698 archive_entry_set_nlink(entry, st->st_nlink);
699 if ((parsed_kws & MTREE_HAS_PERM) == 0)
700 archive_entry_set_perm(entry, st->st_mode);
701 if ((parsed_kws & MTREE_HAS_SIZE) == 0)
702 archive_entry_set_size(entry, st->st_size);
703 archive_entry_set_ino(entry, st->st_ino);
704 archive_entry_set_dev(entry, st->st_dev);
706 archive_entry_linkify(mtree->resolver, &entry, &sparse_entry);
707 } else if (parsed_kws & MTREE_HAS_OPTIONAL) {
709 * Couldn't open the entry, stat it or the on-disk type
710 * didn't match. If this entry is optional, just ignore it
711 * and read the next header entry.
717 mtree->cur_size = archive_entry_size(entry);
724 * Each line contains a sequence of keywords.
727 parse_line(struct archive_read *a, struct archive_entry *entry,
728 struct mtree *mtree, struct mtree_entry *mp, int *parsed_kws)
730 struct mtree_option *iter;
731 int r = ARCHIVE_OK, r1;
733 for (iter = mp->options; iter != NULL; iter = iter->next) {
734 r1 = parse_keyword(a, mtree, entry, iter, parsed_kws);
738 if ((*parsed_kws & MTREE_HAS_TYPE) == 0) {
739 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
740 "Missing type keyword in mtree specification");
741 return (ARCHIVE_WARN);
747 * Device entries have one of the following forms:
749 * format,major,minor[,subdevice]
751 * Just use major and minor, no translation etc is done
755 parse_device(struct archive *a, struct archive_entry *entry, char *val)
757 char *comma1, *comma2;
759 comma1 = strchr(val, ',');
760 if (comma1 == NULL) {
761 archive_entry_set_dev(entry, mtree_atol10(&val));
765 comma2 = strchr(comma1, ',');
766 if (comma2 == NULL) {
767 archive_set_error(a, ARCHIVE_ERRNO_FILE_FORMAT,
768 "Malformed device attribute");
769 return (ARCHIVE_WARN);
772 archive_entry_set_rdevmajor(entry, mtree_atol(&comma1));
773 archive_entry_set_rdevminor(entry, mtree_atol(&comma2));
778 * Parse a single keyword and its value.
781 parse_keyword(struct archive_read *a, struct mtree *mtree,
782 struct archive_entry *entry, struct mtree_option *option, int *parsed_kws)
791 if (strcmp(key, "optional") == 0) {
792 *parsed_kws |= MTREE_HAS_OPTIONAL;
795 if (strcmp(key, "ignore") == 0) {
797 * The mtree processing is not recursive, so
798 * recursion will only happen for explicitly listed
804 val = strchr(key, '=');
806 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
807 "Malformed attribute \"%s\" (%d)", key, key[0]);
808 return (ARCHIVE_WARN);
816 if (strcmp(key, "content") == 0
817 || strcmp(key, "contents") == 0) {
818 parse_escapes(val, NULL);
819 archive_strcpy(&mtree->contents_name, val);
822 if (strcmp(key, "cksum") == 0)
825 if (strcmp(key, "device") == 0) {
826 *parsed_kws |= MTREE_HAS_DEVICE;
827 return parse_device(&a->archive, entry, val);
830 if (strcmp(key, "flags") == 0) {
831 *parsed_kws |= MTREE_HAS_FFLAGS;
832 archive_entry_copy_fflags_text(entry, val);
836 if (strcmp(key, "gid") == 0) {
837 *parsed_kws |= MTREE_HAS_GID;
838 archive_entry_set_gid(entry, mtree_atol10(&val));
841 if (strcmp(key, "gname") == 0) {
842 *parsed_kws |= MTREE_HAS_GNAME;
843 archive_entry_copy_gname(entry, val);
847 if (strcmp(key, "link") == 0) {
848 archive_entry_copy_symlink(entry, val);
852 if (strcmp(key, "md5") == 0 || strcmp(key, "md5digest") == 0)
854 if (strcmp(key, "mode") == 0) {
855 if (val[0] >= '0' && val[0] <= '9') {
856 *parsed_kws |= MTREE_HAS_PERM;
857 archive_entry_set_perm(entry,
860 archive_set_error(&a->archive,
861 ARCHIVE_ERRNO_FILE_FORMAT,
862 "Symbolic mode \"%s\" unsupported", val);
868 if (strcmp(key, "nlink") == 0) {
869 *parsed_kws |= MTREE_HAS_NLINK;
870 archive_entry_set_nlink(entry, mtree_atol10(&val));
874 if (strcmp(key, "rmd160") == 0 ||
875 strcmp(key, "rmd160digest") == 0)
878 if (strcmp(key, "sha1") == 0 || strcmp(key, "sha1digest") == 0)
880 if (strcmp(key, "sha256") == 0 ||
881 strcmp(key, "sha256digest") == 0)
883 if (strcmp(key, "sha384") == 0 ||
884 strcmp(key, "sha384digest") == 0)
886 if (strcmp(key, "sha512") == 0 ||
887 strcmp(key, "sha512digest") == 0)
889 if (strcmp(key, "size") == 0) {
890 archive_entry_set_size(entry, mtree_atol10(&val));
894 if (strcmp(key, "tags") == 0) {
896 * Comma delimited list of tags.
897 * Ignore the tags for now, but the interface
898 * should be extended to allow inclusion/exclusion.
902 if (strcmp(key, "time") == 0) {
906 *parsed_kws |= MTREE_HAS_MTIME;
907 m = (time_t)mtree_atol10(&val);
910 ns = (long)mtree_atol10(&val);
913 archive_entry_set_mtime(entry, m, ns);
916 if (strcmp(key, "type") == 0) {
917 *parsed_kws |= MTREE_HAS_TYPE;
920 if (strcmp(val, "block") == 0) {
921 mtree->filetype = AE_IFBLK;
925 if (strcmp(val, "char") == 0) {
926 mtree->filetype = AE_IFCHR;
930 if (strcmp(val, "dir") == 0) {
931 mtree->filetype = AE_IFDIR;
935 if (strcmp(val, "fifo") == 0) {
936 mtree->filetype = AE_IFIFO;
939 if (strcmp(val, "file") == 0) {
940 mtree->filetype = AE_IFREG;
944 if (strcmp(val, "link") == 0) {
945 mtree->filetype = AE_IFLNK;
949 archive_set_error(&a->archive,
950 ARCHIVE_ERRNO_FILE_FORMAT,
951 "Unrecognized file type \"%s\"", val);
952 return (ARCHIVE_WARN);
954 archive_entry_set_filetype(entry, mtree->filetype);
958 if (strcmp(key, "uid") == 0) {
959 *parsed_kws |= MTREE_HAS_UID;
960 archive_entry_set_uid(entry, mtree_atol10(&val));
963 if (strcmp(key, "uname") == 0) {
964 *parsed_kws |= MTREE_HAS_UNAME;
965 archive_entry_copy_uname(entry, val);
969 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
970 "Unrecognized key %s=%s", key, val);
971 return (ARCHIVE_WARN);
977 read_data(struct archive_read *a, const void **buff, size_t *size, off_t *offset)
979 size_t bytes_to_read;
983 mtree = (struct mtree *)(a->format->data);
988 return (ARCHIVE_EOF);
990 if (mtree->buff == NULL) {
991 mtree->buffsize = 64 * 1024;
992 mtree->buff = malloc(mtree->buffsize);
993 if (mtree->buff == NULL) {
994 archive_set_error(&a->archive, ENOMEM,
995 "Can't allocate memory");
996 return (ARCHIVE_FATAL);
1000 *buff = mtree->buff;
1001 *offset = mtree->offset;
1002 if ((off_t)mtree->buffsize > mtree->cur_size - mtree->offset)
1003 bytes_to_read = mtree->cur_size - mtree->offset;
1005 bytes_to_read = mtree->buffsize;
1006 bytes_read = read(mtree->fd, mtree->buff, bytes_to_read);
1007 if (bytes_read < 0) {
1008 archive_set_error(&a->archive, errno, "Can't read");
1009 return (ARCHIVE_WARN);
1011 if (bytes_read == 0) {
1013 return (ARCHIVE_EOF);
1015 mtree->offset += bytes_read;
1017 return (ARCHIVE_OK);
1020 /* Skip does nothing except possibly close the contents file. */
1022 skip(struct archive_read *a)
1024 struct mtree *mtree;
1026 mtree = (struct mtree *)(a->format->data);
1027 if (mtree->fd >= 0) {
1031 return (ARCHIVE_OK);
1035 * Since parsing backslash sequences always makes strings shorter,
1036 * we can always do this conversion in-place.
1039 parse_escapes(char *src, struct mtree_entry *mentry)
1044 if (mentry != NULL && strcmp(src, ".") == 0)
1047 while (*src != '\0') {
1049 if (c == '/' && mentry != NULL)
1054 if (src[1] < '0' || src[1] > '7') {
1063 if (src[1] >= '0' && src[1] <= '7' &&
1064 src[2] >= '0' && src[2] <= '7') {
1065 c = (src[0] - '0') << 6;
1066 c |= (src[1] - '0') << 3;
1067 c |= (src[2] - '0');
1111 * Note that this implementation does not (and should not!) obey
1112 * locale settings; you cannot simply substitute strtol here, since
1113 * it does obey locale.
1116 mtree_atol8(char **p)
1118 int64_t l, limit, last_digit_limit;
1122 limit = INT64_MAX / base;
1123 last_digit_limit = INT64_MAX % base;
1127 while (digit >= 0 && digit < base) {
1128 if (l>limit || (l == limit && digit > last_digit_limit)) {
1129 l = INT64_MAX; /* Truncate on overflow. */
1132 l = (l * base) + digit;
1133 digit = *++(*p) - '0';
1139 * Note that this implementation does not (and should not!) obey
1140 * locale settings; you cannot simply substitute strtol here, since
1141 * it does obey locale.
1144 mtree_atol10(char **p)
1146 int64_t l, limit, last_digit_limit;
1147 int base, digit, sign;
1150 limit = INT64_MAX / base;
1151 last_digit_limit = INT64_MAX % base;
1161 while (digit >= 0 && digit < base) {
1162 if (l > limit || (l == limit && digit > last_digit_limit)) {
1163 l = INT64_MAX; /* Truncate on overflow. */
1166 l = (l * base) + digit;
1167 digit = *++(*p) - '0';
1169 return (sign < 0) ? -l : l;
1173 * Note that this implementation does not (and should not!) obey
1174 * locale settings; you cannot simply substitute strtol here, since
1175 * it does obey locale.
1178 mtree_atol16(char **p)
1180 int64_t l, limit, last_digit_limit;
1181 int base, digit, sign;
1184 limit = INT64_MAX / base;
1185 last_digit_limit = INT64_MAX % base;
1194 if (**p >= '0' && **p <= '9')
1196 else if (**p >= 'a' && **p <= 'f')
1197 digit = **p - 'a' + 10;
1198 else if (**p >= 'A' && **p <= 'F')
1199 digit = **p - 'A' + 10;
1202 while (digit >= 0 && digit < base) {
1203 if (l > limit || (l == limit && digit > last_digit_limit)) {
1204 l = INT64_MAX; /* Truncate on overflow. */
1207 l = (l * base) + digit;
1208 if (**p >= '0' && **p <= '9')
1210 else if (**p >= 'a' && **p <= 'f')
1211 digit = **p - 'a' + 10;
1212 else if (**p >= 'A' && **p <= 'F')
1213 digit = **p - 'A' + 10;
1217 return (sign < 0) ? -l : l;
1221 mtree_atol(char **p)
1224 return mtree_atol10(p);
1225 if ((*p)[1] == 'x' || (*p)[1] == 'X') {
1227 return mtree_atol16(p);
1229 return mtree_atol8(p);
1233 * Returns length of line (including trailing newline)
1234 * or negative on error. 'start' argument is updated to
1235 * point to first character of line.
1238 readline(struct archive_read *a, struct mtree *mtree, char **start, ssize_t limit)
1241 ssize_t total_size = 0;
1242 ssize_t find_off = 0;
1248 /* Accumulate line in a line buffer. */
1250 /* Read some more. */
1251 t = __archive_read_ahead(a, 1, &bytes_read);
1255 return (ARCHIVE_FATAL);
1256 s = t; /* Start of line? */
1257 p = memchr(t, '\n', bytes_read);
1258 /* If we found '\n', trim the read. */
1260 bytes_read = 1 + ((const char *)p) - s;
1262 if (total_size + bytes_read + 1 > limit) {
1263 archive_set_error(&a->archive,
1264 ARCHIVE_ERRNO_FILE_FORMAT,
1266 return (ARCHIVE_FATAL);
1268 if (archive_string_ensure(&mtree->line,
1269 total_size + bytes_read + 1) == NULL) {
1270 archive_set_error(&a->archive, ENOMEM,
1271 "Can't allocate working buffer");
1272 return (ARCHIVE_FATAL);
1274 memcpy(mtree->line.s + total_size, t, bytes_read);
1275 __archive_read_consume(a, bytes_read);
1276 total_size += bytes_read;
1277 /* Null terminate. */
1278 mtree->line.s[total_size] = '\0';
1279 /* If we found an unescaped '\n', clean up and return. */
1280 for (u = mtree->line.s + find_off; *u; ++u) {
1282 *start = mtree->line.s;
1288 *start = mtree->line.s;
1299 total_size - (u - mtree->line.s) + 1);
1307 find_off = u - mtree->line.s;