1 /* Various processing of names.
3 Copyright 1988, 1992, 1994, 1996-2001, 2003-2007, 2009, 2013 Free
4 Software Foundation, Inc.
6 This program is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 3, or (at your option) any later
11 This program is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
14 Public License for more details.
16 You should have received a copy of the GNU General Public License along
17 with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include <wordsplit.h>
29 /* User and group names. */
31 /* Make sure you link with the proper libraries if you are running the
32 Yellow Peril (thanks for the good laugh, Ian J.!), or, euh... NIS.
33 This code should also be modified for non-UNIX systems to do something
36 static char *cached_uname;
37 static char *cached_gname;
39 static uid_t cached_uid; /* valid only if cached_uname is not empty */
40 static gid_t cached_gid; /* valid only if cached_gname is not empty */
42 /* These variables are valid only if nonempty. */
43 static char *cached_no_such_uname;
44 static char *cached_no_such_gname;
46 /* These variables are valid only if nonzero. It's not worth optimizing
47 the case for weird systems where 0 is not a valid uid or gid. */
48 static uid_t cached_no_such_uid;
49 static gid_t cached_no_such_gid;
51 /* Given UID, find the corresponding UNAME. */
53 uid_to_uname (uid_t uid, char **uname)
55 struct passwd *passwd;
57 if (uid != 0 && uid == cached_no_such_uid)
59 *uname = xstrdup ("");
63 if (!cached_uname || uid != cached_uid)
65 passwd = getpwuid (uid);
69 assign_string (&cached_uname, passwd->pw_name);
73 cached_no_such_uid = uid;
74 *uname = xstrdup ("");
78 *uname = xstrdup (cached_uname);
81 /* Given GID, find the corresponding GNAME. */
83 gid_to_gname (gid_t gid, char **gname)
87 if (gid != 0 && gid == cached_no_such_gid)
89 *gname = xstrdup ("");
93 if (!cached_gname || gid != cached_gid)
95 group = getgrgid (gid);
99 assign_string (&cached_gname, group->gr_name);
103 cached_no_such_gid = gid;
104 *gname = xstrdup ("");
108 *gname = xstrdup (cached_gname);
111 /* Given UNAME, set the corresponding UID and return 1, or else, return 0. */
113 uname_to_uid (char const *uname, uid_t *uidp)
115 struct passwd *passwd;
117 if (cached_no_such_uname
118 && strcmp (uname, cached_no_such_uname) == 0)
122 || uname[0] != cached_uname[0]
123 || strcmp (uname, cached_uname) != 0)
125 passwd = getpwnam (uname);
128 cached_uid = passwd->pw_uid;
129 assign_string (&cached_uname, passwd->pw_name);
133 assign_string (&cached_no_such_uname, uname);
141 /* Given GNAME, set the corresponding GID and return 1, or else, return 0. */
143 gname_to_gid (char const *gname, gid_t *gidp)
147 if (cached_no_such_gname
148 && strcmp (gname, cached_no_such_gname) == 0)
152 || gname[0] != cached_gname[0]
153 || strcmp (gname, cached_gname) != 0)
155 group = getgrnam (gname);
158 cached_gid = group->gr_gid;
159 assign_string (&cached_gname, gname);
163 assign_string (&cached_no_such_gname, gname);
173 make_name (const char *file_name)
175 struct name *p = xzalloc (sizeof (*p));
178 p->name = xstrdup (file_name);
179 p->length = strlen (p->name);
184 free_name (struct name *p)
195 /* Names from the command call. */
197 static struct name *namelist; /* first name in list, if any */
198 static struct name *nametail; /* end of name list */
200 /* File name arguments are processed in two stages: first a
201 name element list (see below) is filled, then the names from it
202 are moved into the namelist.
204 This awkward process is needed only to implement --same-order option,
205 which is meant to help process large archives on machines with
206 limited memory. With this option on, namelist contains at most one
207 entry, which diminishes the memory consumption.
209 However, I very much doubt if we still need this -- Sergey */
211 /* A name_list element contains entries of three types: */
213 #define NELT_NAME 0 /* File name */
214 #define NELT_CHDIR 1 /* Change directory request */
215 #define NELT_FMASK 2 /* Change fnmatch options request */
216 #define NELT_FILE 3 /* Read file names from that file */
217 #define NELT_NOOP 4 /* No operation */
219 struct name_elt /* A name_array element. */
221 struct name_elt *next, *prev;
222 char type; /* Element type, see NELT_* constants above */
225 const char *name; /* File or directory name */
226 int matching_flags;/* fnmatch options if type == NELT_FMASK */
227 struct /* File, if type == NELT_FILE */
229 const char *name;/* File name */
230 int term; /* File name terminator in the list */
236 static struct name_elt *name_head; /* store a list of names */
237 size_t name_count; /* how many of the entries are names? */
239 static struct name_elt *
240 name_elt_alloc (void)
242 struct name_elt *elt;
244 elt = xmalloc (sizeof (*elt));
248 name_head->prev = name_head->next = NULL;
249 name_head->type = NELT_NOOP;
250 elt = xmalloc (sizeof (*elt));
253 elt->prev = name_head->prev;
255 name_head->prev->next = elt;
256 elt->next = name_head;
257 name_head->prev = elt;
262 name_list_adjust (void)
265 while (name_head->prev)
266 name_head = name_head->prev;
270 name_list_advance (void)
272 struct name_elt *elt = name_head;
273 name_head = elt->next;
275 name_head->prev = NULL;
279 /* Add to name_array the file NAME with fnmatch options MATCHING_FLAGS */
281 name_add_name (const char *name, int matching_flags)
283 static int prev_flags = 0; /* FIXME: Or EXCLUDE_ANCHORED? */
284 struct name_elt *ep = name_elt_alloc ();
286 if (prev_flags != matching_flags)
288 ep->type = NELT_FMASK;
289 ep->v.matching_flags = matching_flags;
290 prev_flags = matching_flags;
291 ep = name_elt_alloc ();
293 ep->type = NELT_NAME;
298 /* Add to name_array a chdir request for the directory NAME */
300 name_add_dir (const char *name)
302 struct name_elt *ep = name_elt_alloc ();
303 ep->type = NELT_CHDIR;
308 name_add_file (const char *name, int term)
310 struct name_elt *ep = name_elt_alloc ();
311 ep->type = NELT_FILE;
312 ep->v.file.name = name;
313 ep->v.file.term = term;
314 ep->v.file.fp = NULL;
317 /* Names from external name file. */
319 static char *name_buffer; /* buffer to hold the current file name */
320 static size_t name_buffer_length; /* allocated length of name_buffer */
322 /* Set up to gather file names for tar. They can either come from a
323 file or were saved from decoding arguments. */
327 name_buffer = xmalloc (NAME_FIELD_SIZE + 2);
328 name_buffer_length = NAME_FIELD_SIZE;
338 /* Prevent recursive inclusion of the same file */
341 struct file_id_list *next;
344 const char *from_file;
347 static struct file_id_list *file_id_list;
349 /* Return the name of the file from which the file names and options
353 file_list_name (void)
355 struct name_elt *elt;
357 for (elt = name_head; elt; elt = elt->next)
358 if (elt->type == NELT_FILE && elt->v.file.fp)
359 return elt->v.file.name;
360 return _("command line");
364 add_file_id (const char *filename)
366 struct file_id_list *p;
368 const char *reading_from;
370 if (stat (filename, &st))
371 stat_fatal (filename);
372 reading_from = file_list_name ();
373 for (p = file_id_list; p; p = p->next)
374 if (p->ino == st.st_ino && p->dev == st.st_dev)
376 int oldc = set_char_quoting (NULL, ':', 1);
378 _("%s: file list requested from %s already read from %s"),
379 quotearg_n (0, filename),
380 reading_from, p->from_file));
381 set_char_quoting (NULL, ':', oldc);
384 p = xmalloc (sizeof *p);
385 p->next = file_id_list;
388 p->from_file = reading_from;
393 enum read_file_list_state /* Result of reading file name from the list file */
395 file_list_success, /* OK, name read successfully */
396 file_list_end, /* End of list file */
397 file_list_zero, /* Zero separator encountered where it should not */
398 file_list_skip /* Empty (zero-length) entry encountered, skip it */
401 /* Read from FP a sequence of characters up to TERM and put them
404 static enum read_file_list_state
405 read_name_from_file (struct name_elt *ent)
409 FILE *fp = ent->v.file.fp;
410 int term = ent->v.file.term;
412 for (c = getc (fp); c != EOF && c != term; c = getc (fp))
414 if (counter == name_buffer_length)
415 name_buffer = x2realloc (name_buffer, &name_buffer_length);
416 name_buffer[counter++] = c;
419 /* We have read a zero separator. The file possibly is
421 return file_list_zero;
425 if (counter == 0 && c != EOF)
426 return file_list_skip;
428 if (counter == name_buffer_length)
429 name_buffer = x2realloc (name_buffer, &name_buffer_length);
430 name_buffer[counter] = 0;
432 return (counter == 0 && c == EOF) ? file_list_end : file_list_success;
436 handle_option (const char *str)
441 while (*str && isspace (*str))
447 if (wordsplit (str, &ws, WRDSF_DEFFLAGS|WRDSF_DOOFFS))
448 FATAL_ERROR ((0, 0, _("cannot split string '%s': %s"),
449 str, wordsplit_strerror (&ws)));
450 ws.ws_wordv[0] = program_invocation_short_name;
451 more_options (ws.ws_wordc+ws.ws_offs, ws.ws_wordv);
452 for (i = 0; i < ws.ws_wordc+ws.ws_offs; i++)
453 ws.ws_wordv[i] = NULL;
455 wordsplit_free (&ws);
460 read_next_name (struct name_elt *ent, struct name_elt *ret)
464 if (!strcmp (ent->v.file.name, "-"))
466 request_stdin ("-T");
467 ent->v.file.fp = stdin;
471 if (add_file_id (ent->v.file.name))
473 name_list_advance ();
476 if ((ent->v.file.fp = fopen (ent->v.file.name, "r")) == NULL)
477 open_fatal (ent->v.file.name);
483 switch (read_name_from_file (ent))
489 WARNOPT (WARN_FILENAME_WITH_NULS,
490 (0, 0, N_("%s: file name read contains nul character"),
491 quotearg_colon (ent->v.file.name)));
492 ent->v.file.term = 0;
494 case file_list_success:
495 if (handle_option (name_buffer) == 0)
500 ret->type = NELT_NAME;
501 ret->v.name = name_buffer;
505 if (strcmp (ent->v.file.name, "-"))
506 fclose (ent->v.file.fp);
507 ent->v.file.fp = NULL;
508 name_list_advance ();
515 copy_name (struct name_elt *ep)
522 source_len = strlen (source);
523 if (name_buffer_length < source_len)
527 name_buffer_length *= 2;
528 if (! name_buffer_length)
531 while (name_buffer_length < source_len);
534 name_buffer = xmalloc(name_buffer_length + 2);
536 strcpy (name_buffer, source);
538 /* Zap trailing slashes. */
539 cursor = name_buffer + strlen (name_buffer) - 1;
540 while (cursor > name_buffer && ISSLASH (*cursor))
545 static int matching_flags; /* exclude_fnmatch options */
547 /* Get the next NELT_NAME element from name_array. Result is in
548 static storage and can't be relied upon across two calls.
550 If CHANGE_DIRS is true, treat any entries of type NELT_CHDIR as
551 the request to change to the given directory.
553 Entries of type NELT_FMASK cause updates of the matching_flags
555 static struct name_elt *
556 name_next_elt (int change_dirs)
558 static struct name_elt entry;
561 while ((ep = name_head) != NULL)
566 name_list_advance ();
570 matching_flags = ep->v.matching_flags;
571 name_list_advance ();
575 if (read_next_name (ep, &entry) == 0)
582 chdir_do (chdir_arg (xstrdup (ep->v.name)));
583 name_list_advance ();
590 unquote_string (name_buffer);
591 entry.type = ep->type;
592 entry.v.name = name_buffer;
593 name_list_advance ();
602 name_next (int change_dirs)
604 struct name_elt *nelt = name_next_elt (change_dirs);
605 return nelt ? nelt->v.name : NULL;
608 /* Gather names in a list for scanning. Could hash them later if we
611 If the names are already sorted to match the archive, we just read
612 them one by one. name_gather reads the first one, and it is called
613 by name_match as appropriate to read the next ones. At EOF, the
614 last name read is just left in the buffer. This option lets users
615 of small machines extract an arbitrary number of files by doing
616 "tar t" and editing down the list of files. */
621 /* Buffer able to hold a single name. */
622 static struct name *buffer = NULL;
626 if (same_order_option)
628 static int change_dir;
630 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
631 change_dir = chdir_arg (xstrdup (ep->v.name));
636 buffer = make_name (ep->v.name);
637 buffer->change_dir = change_dir;
639 buffer->found_count = 0;
640 buffer->matching_flags = matching_flags;
641 buffer->directory = NULL;
642 buffer->parent = NULL;
643 buffer->cmdline = true;
645 namelist = nametail = buffer;
648 addname (0, change_dir, false, NULL);
652 /* Non sorted names -- read them all in. */
657 int change_dir0 = change_dir;
658 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
659 change_dir = chdir_arg (xstrdup (ep->v.name));
662 addname (ep->v.name, change_dir, true, NULL);
665 if (change_dir != change_dir0)
666 addname (NULL, change_dir, false, NULL);
673 /* Add a name to the namelist. */
675 addname (char const *string, int change_dir, bool cmdline, struct name *parent)
677 struct name *name = make_name (string);
679 name->prev = nametail;
681 name->found_count = 0;
682 name->matching_flags = matching_flags;
683 name->change_dir = change_dir;
684 name->directory = NULL;
685 name->parent = parent;
686 name->cmdline = cmdline;
689 nametail->next = name;
696 /* Find a match for FILE_NAME (whose string length is LENGTH) in the name
699 namelist_match (char const *file_name, size_t length)
703 for (p = namelist; p; p = p->next)
706 && exclude_fnmatch (p->name, file_name, p->matching_flags))
714 remname (struct name *name)
718 if ((p = name->prev) != NULL)
719 p->next = name->next;
721 namelist = name->next;
723 if ((p = name->next) != NULL)
724 p->prev = name->prev;
726 nametail = name->prev;
729 /* Return true if and only if name FILE_NAME (from an archive) matches any
730 name from the namelist. */
732 name_match (const char *file_name)
734 size_t length = strlen (file_name);
738 struct name *cursor = namelist;
743 if (cursor->name[0] == 0)
745 chdir_do (cursor->change_dir);
751 cursor = namelist_match (file_name, length);
754 if (!(ISSLASH (file_name[cursor->length]) && recursion_option)
755 || cursor->found_count == 0)
756 cursor->found_count++; /* remember it matched */
757 if (starting_file_option)
763 chdir_do (cursor->change_dir);
765 /* We got a match. */
766 return ISFOUND (cursor);
769 /* Filename from archive not found in namelist. If we have the whole
770 namelist here, just return 0. Otherwise, read the next name in and
771 compare it. If this was the last name, namelist->found_count will
772 remain on. If not, we loop to compare the newly read name. */
774 if (same_order_option && namelist->found_count)
776 name_gather (); /* read one more */
777 if (namelist->found_count)
785 /* Returns true if all names from the namelist were processed.
786 P is the stat_info of the most recently processed entry.
787 The decision is postponed until the next entry is read if:
789 1) P ended with a slash (i.e. it was a directory)
790 2) P matches any entry from the namelist *and* represents a subdirectory
791 or a file lying under this entry (in the terms of directory structure).
793 This is necessary to handle contents of directories. */
795 all_names_found (struct tar_stat_info *p)
797 struct name const *cursor;
800 if (!p->file_name || occurrence_option == 0 || p->had_trailing_slash)
802 len = strlen (p->file_name);
803 for (cursor = namelist; cursor; cursor = cursor->next)
805 if ((cursor->name[0] && !WASFOUND (cursor))
806 || (len >= cursor->length && ISSLASH (p->file_name[cursor->length])))
813 regex_usage_warning (const char *name)
815 static int warned_once = 0;
817 if (warn_regex_usage && fnmatch_pattern_has_wildcards (name, 0))
821 _("Pattern matching characters used in file names")));
823 _("Use --wildcards to enable pattern matching,"
824 " or --no-wildcards to suppress this warning")));
829 /* Print the names of things in the namelist that were not matched. */
831 names_notfound (void)
833 struct name const *cursor;
835 for (cursor = namelist; cursor; cursor = cursor->next)
836 if (!WASFOUND (cursor) && cursor->name[0])
838 regex_usage_warning (cursor->name);
840 (cursor->found_count == 0) ?
841 _("%s: Not found in archive") :
842 _("%s: Required occurrence not found in archive"),
843 quotearg_colon (cursor->name)));
846 /* Don't bother freeing the name list; we're about to exit. */
850 if (same_order_option)
854 while ((name = name_next (1)) != NULL)
856 regex_usage_warning (name);
857 ERROR ((0, 0, _("%s: Not found in archive"),
858 quotearg_colon (name)));
864 label_notfound (void)
866 struct name const *cursor;
871 for (cursor = namelist; cursor; cursor = cursor->next)
872 if (WASFOUND (cursor))
876 error (0, 0, _("Archive label mismatch"));
877 set_exit_status (TAREXIT_DIFFERS);
879 for (cursor = namelist; cursor; cursor = cursor->next)
881 if (regex_usage_warning (cursor->name))
885 /* Don't bother freeing the name list; we're about to exit. */
889 if (same_order_option)
893 while ((name = name_next (1)) != NULL
894 && regex_usage_warning (name) == 0)
899 /* Sorting name lists. */
901 /* Sort *singly* linked LIST of names, of given LENGTH, using COMPARE
902 to order names. Return the sorted list. Note that after calling
903 this function, the 'prev' links in list elements are messed up.
905 Apart from the type 'struct name' and the definition of SUCCESSOR,
906 this is a generic list-sorting function, but it's too painful to
907 make it both generic and portable
911 merge_sort_sll (struct name *list, int length,
912 int (*compare) (struct name const*, struct name const*))
914 struct name *first_list;
915 struct name *second_list;
919 struct name **merge_point;
923 # define SUCCESSOR(name) ((name)->next)
930 if ((*compare) (list, SUCCESSOR (list)) > 0)
932 result = SUCCESSOR (list);
933 SUCCESSOR (result) = list;
934 SUCCESSOR (list) = 0;
941 first_length = (length + 1) / 2;
942 second_length = length / 2;
943 for (cursor = list, counter = first_length - 1;
945 cursor = SUCCESSOR (cursor), counter--)
947 second_list = SUCCESSOR (cursor);
948 SUCCESSOR (cursor) = 0;
950 first_list = merge_sort_sll (first_list, first_length, compare);
951 second_list = merge_sort_sll (second_list, second_length, compare);
953 merge_point = &result;
954 while (first_list && second_list)
955 if ((*compare) (first_list, second_list) < 0)
957 cursor = SUCCESSOR (first_list);
958 *merge_point = first_list;
959 merge_point = &SUCCESSOR (first_list);
964 cursor = SUCCESSOR (second_list);
965 *merge_point = second_list;
966 merge_point = &SUCCESSOR (second_list);
967 second_list = cursor;
970 *merge_point = first_list;
972 *merge_point = second_list;
979 /* Sort doubly linked LIST of names, of given LENGTH, using COMPARE
980 to order names. Return the sorted list. */
982 merge_sort (struct name *list, int length,
983 int (*compare) (struct name const*, struct name const*))
985 struct name *head, *p, *prev;
986 head = merge_sort_sll (list, length, compare);
987 /* Fixup prev pointers */
988 for (prev = NULL, p = head; p; prev = p, p = p->next)
993 /* A comparison function for sorting names. Put found names last;
994 break ties by string comparison. */
997 compare_names_found (struct name const *n1, struct name const *n2)
999 int found_diff = WASFOUND (n2) - WASFOUND (n1);
1000 return found_diff ? found_diff : strcmp (n1->name, n2->name);
1003 /* Simple comparison by names. */
1005 compare_names (struct name const *n1, struct name const *n2)
1007 return strcmp (n1->name, n2->name);
1011 /* Add all the dirs under ST to the namelist NAME, descending the
1012 directory hierarchy recursively. */
1015 add_hierarchy_to_namelist (struct tar_stat_info *st, struct name *name)
1019 name->directory = scan_directory (st);
1020 buffer = directory_contents (name->directory);
1023 struct name *child_head = NULL, *child_tail = NULL;
1024 size_t name_length = name->length;
1025 size_t allocated_length = (name_length >= NAME_FIELD_SIZE
1026 ? name_length + NAME_FIELD_SIZE
1028 char *namebuf = xmalloc (allocated_length + 1);
1029 /* FIXME: + 2 above? */
1031 size_t string_length;
1032 int change_dir = name->change_dir;
1034 strcpy (namebuf, name->name);
1035 if (! ISSLASH (namebuf[name_length - 1]))
1037 namebuf[name_length++] = '/';
1038 namebuf[name_length] = '\0';
1041 for (string = buffer; *string; string += string_length + 1)
1043 string_length = strlen (string);
1047 struct tar_stat_info subdir;
1050 if (allocated_length <= name_length + string_length)
1054 allocated_length *= 2;
1055 if (! allocated_length)
1058 while (allocated_length <= name_length + string_length);
1060 namebuf = xrealloc (namebuf, allocated_length + 1);
1062 strcpy (namebuf + name_length, string + 1);
1063 np = addname (namebuf, change_dir, false, name);
1067 child_tail->sibling = np;
1070 tar_stat_init (&subdir);
1078 subfd = subfile_open (st, string + 1,
1079 open_read_flags | O_DIRECTORY);
1081 open_diag (namebuf);
1085 if (fstat (subfd, &subdir.stat) != 0)
1086 stat_diag (namebuf);
1087 else if (! (O_DIRECTORY || S_ISDIR (subdir.stat.st_mode)))
1090 open_diag (namebuf);
1094 subdir.orig_file_name = xstrdup (namebuf);
1095 add_hierarchy_to_namelist (&subdir, np);
1096 restore_parent_fd (&subdir);
1100 tar_stat_destroy (&subdir);
1105 name->child = child_head;
1109 /* Auxiliary functions for hashed table of struct name's. */
1112 name_hash (void const *entry, size_t n_buckets)
1114 struct name const *name = entry;
1115 return hash_string (name->caname, n_buckets);
1118 /* Compare two directories for equality of their names. */
1120 name_compare (void const *entry1, void const *entry2)
1122 struct name const *name1 = entry1;
1123 struct name const *name2 = entry2;
1124 return strcmp (name1->caname, name2->caname) == 0;
1128 /* Rebase 'name' member of CHILD and all its siblings to
1131 rebase_child_list (struct name *child, struct name *parent)
1133 size_t old_prefix_len = child->parent->length;
1134 size_t new_prefix_len = parent->length;
1135 char *new_prefix = parent->name;
1137 for (; child; child = child->sibling)
1139 size_t size = child->length - old_prefix_len + new_prefix_len;
1140 char *newp = xmalloc (size + 1);
1141 strcpy (newp, new_prefix);
1142 strcat (newp, child->name + old_prefix_len);
1145 child->length = size;
1147 rebase_directory (child->directory,
1148 child->parent->name, old_prefix_len,
1149 new_prefix, new_prefix_len);
1153 /* Collect all the names from argv[] (or whatever), expand them into a
1154 directory tree, and sort them. This gets only subdirectories, not
1158 collect_and_sort_names (void)
1161 struct name *next_name, *prev_name = NULL;
1163 Hash_table *nametab;
1168 addname (".", 0, false, NULL);
1170 if (listed_incremental_option)
1172 switch (chdir_count ())
1178 if (namelist->change_dir == 0)
1180 _("Using -C option inside file list is not "
1181 "allowed with --listed-incremental")));
1186 _("Only one -C option is allowed with "
1187 "--listed-incremental")));
1190 read_directory_file ();
1194 for (name = namelist; name; name = name->next, num_names++)
1196 struct tar_stat_info st;
1198 if (name->found_count || name->directory)
1200 if (name->matching_flags & EXCLUDE_WILDCARDS)
1201 /* NOTE: EXCLUDE_ANCHORED is not relevant here */
1202 /* FIXME: just skip regexps for now */
1204 chdir_do (name->change_dir);
1206 if (name->name[0] == 0)
1209 tar_stat_init (&st);
1211 if (deref_stat (name->name, &st.stat) != 0)
1213 stat_diag (name->name);
1216 if (S_ISDIR (st.stat.st_mode))
1218 int dir_fd = openat (chdir_fd, name->name,
1219 open_read_flags | O_DIRECTORY);
1221 open_diag (name->name);
1225 if (fstat (dir_fd, &st.stat) != 0)
1226 stat_diag (name->name);
1227 else if (O_DIRECTORY || S_ISDIR (st.stat.st_mode))
1229 st.orig_file_name = xstrdup (name->name);
1230 name->found_count++;
1231 add_hierarchy_to_namelist (&st, name);
1236 tar_stat_destroy (&st);
1239 namelist = merge_sort (namelist, num_names, compare_names);
1242 nametab = hash_initialize (0, 0, name_hash, name_compare, NULL);
1243 for (name = namelist; name; name = next_name)
1245 next_name = name->next;
1246 name->caname = normalize_filename (name->change_dir, name->name);
1249 struct name *p = hash_lookup (nametab, name);
1252 /* Keep the one listed in the command line */
1256 rebase_child_list (p->child, name);
1257 hash_delete (nametab, name);
1258 /* FIXME: remove_directory (p->caname); ? */
1266 rebase_child_list (name->child, p);
1267 /* FIXME: remove_directory (name->caname); ? */
1274 name->found_count = 0;
1275 if (!hash_insert (nametab, name))
1280 nametail = prev_name;
1281 hash_free (nametab);
1283 namelist = merge_sort (namelist, num_names, compare_names_found);
1285 if (listed_incremental_option)
1287 for (name = namelist; name && name->name[0] == 0; name++)
1290 append_incremental_renames (name->directory);
1294 /* This is like name_match, except that
1295 1. It returns a pointer to the name it matched, and doesn't set FOUND
1296 in structure. The caller will have to do that if it wants to.
1297 2. If the namelist is empty, it returns null, unlike name_match, which
1300 name_scan (const char *file_name)
1302 size_t length = strlen (file_name);
1306 struct name *cursor = namelist_match (file_name, length);
1310 /* Filename from archive not found in namelist. If we have the whole
1311 namelist here, just return 0. Otherwise, read the next name in and
1312 compare it. If this was the last name, namelist->found_count will
1313 remain on. If not, we loop to compare the newly read name. */
1315 if (same_order_option && namelist && namelist->found_count)
1317 name_gather (); /* read one more */
1318 if (namelist->found_count)
1326 /* This returns a name from the namelist which doesn't have ->found
1327 set. It sets ->found before returning, so successive calls will
1328 find and return all the non-found names in the namelist. */
1329 struct name *gnu_list_name;
1332 name_from_list (void)
1335 gnu_list_name = namelist;
1336 while (gnu_list_name
1337 && (gnu_list_name->found_count || gnu_list_name->name[0] == 0))
1338 gnu_list_name = gnu_list_name->next;
1341 gnu_list_name->found_count++;
1342 chdir_do (gnu_list_name->change_dir);
1343 return gnu_list_name;
1349 blank_name_list (void)
1354 for (name = namelist; name; name = name->next)
1355 name->found_count = 0;
1358 /* Yield a newly allocated file name consisting of FILE_NAME concatenated to
1359 NAME, with an intervening slash if FILE_NAME does not already end in one. */
1361 new_name (const char *file_name, const char *name)
1363 size_t file_name_len = strlen (file_name);
1364 size_t namesize = strlen (name) + 1;
1365 int slash = file_name_len && ! ISSLASH (file_name[file_name_len - 1]);
1366 char *buffer = xmalloc (file_name_len + slash + namesize);
1367 memcpy (buffer, file_name, file_name_len);
1368 buffer[file_name_len] = '/';
1369 memcpy (buffer + file_name_len + slash, name, namesize);
1373 /* Return nonzero if file NAME is excluded. */
1375 excluded_name (char const *name)
1377 return excluded_file_name (excluded, name + FILE_SYSTEM_PREFIX_LEN (name));
1381 /* Return the size of the prefix of FILE_NAME that is removed after
1382 stripping NUM leading file name components. NUM must be
1386 stripped_prefix_len (char const *file_name, size_t num)
1388 char const *p = file_name + FILE_SYSTEM_PREFIX_LEN (file_name);
1389 while (ISSLASH (*p))
1393 bool slash = ISSLASH (*p);
1398 return p - file_name;
1399 while (ISSLASH (*p))
1406 /* Return nonzero if NAME contains ".." as a file name component. */
1408 contains_dot_dot (char const *name)
1410 char const *p = name + FILE_SYSTEM_PREFIX_LEN (name);
1414 if (p[0] == '.' && p[1] == '.' && (ISSLASH (p[2]) || !p[2]))
1417 while (! ISSLASH (*p))