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>
28 /* User and group names. */
30 /* Make sure you link with the proper libraries if you are running the
31 Yellow Peril (thanks for the good laugh, Ian J.!), or, euh... NIS.
32 This code should also be modified for non-UNIX systems to do something
35 static char *cached_uname;
36 static char *cached_gname;
38 static uid_t cached_uid; /* valid only if cached_uname is not empty */
39 static gid_t cached_gid; /* valid only if cached_gname is not empty */
41 /* These variables are valid only if nonempty. */
42 static char *cached_no_such_uname;
43 static char *cached_no_such_gname;
45 /* These variables are valid only if nonzero. It's not worth optimizing
46 the case for weird systems where 0 is not a valid uid or gid. */
47 static uid_t cached_no_such_uid;
48 static gid_t cached_no_such_gid;
50 /* Given UID, find the corresponding UNAME. */
52 uid_to_uname (uid_t uid, char **uname)
54 struct passwd *passwd;
56 if (uid != 0 && uid == cached_no_such_uid)
58 *uname = xstrdup ("");
62 if (!cached_uname || uid != cached_uid)
64 passwd = getpwuid (uid);
68 assign_string (&cached_uname, passwd->pw_name);
72 cached_no_such_uid = uid;
73 *uname = xstrdup ("");
77 *uname = xstrdup (cached_uname);
80 /* Given GID, find the corresponding GNAME. */
82 gid_to_gname (gid_t gid, char **gname)
86 if (gid != 0 && gid == cached_no_such_gid)
88 *gname = xstrdup ("");
92 if (!cached_gname || gid != cached_gid)
94 group = getgrgid (gid);
98 assign_string (&cached_gname, group->gr_name);
102 cached_no_such_gid = gid;
103 *gname = xstrdup ("");
107 *gname = xstrdup (cached_gname);
110 /* Given UNAME, set the corresponding UID and return 1, or else, return 0. */
112 uname_to_uid (char const *uname, uid_t *uidp)
114 struct passwd *passwd;
116 if (cached_no_such_uname
117 && strcmp (uname, cached_no_such_uname) == 0)
121 || uname[0] != cached_uname[0]
122 || strcmp (uname, cached_uname) != 0)
124 passwd = getpwnam (uname);
127 cached_uid = passwd->pw_uid;
128 assign_string (&cached_uname, passwd->pw_name);
132 assign_string (&cached_no_such_uname, uname);
140 /* Given GNAME, set the corresponding GID and return 1, or else, return 0. */
142 gname_to_gid (char const *gname, gid_t *gidp)
146 if (cached_no_such_gname
147 && strcmp (gname, cached_no_such_gname) == 0)
151 || gname[0] != cached_gname[0]
152 || strcmp (gname, cached_gname) != 0)
154 group = getgrnam (gname);
157 cached_gid = group->gr_gid;
158 assign_string (&cached_gname, gname);
162 assign_string (&cached_no_such_gname, gname);
172 make_name (const char *file_name)
174 struct name *p = xzalloc (sizeof (*p));
177 p->name = xstrdup (file_name);
178 p->length = strlen (p->name);
183 free_name (struct name *p)
194 /* Names from the command call. */
196 static struct name *namelist; /* first name in list, if any */
197 static struct name *nametail; /* end of name list */
199 /* File name arguments are processed in two stages: first a
200 name element list (see below) is filled, then the names from it
201 are moved into the namelist.
203 This awkward process is needed only to implement --same-order option,
204 which is meant to help process large archives on machines with
205 limited memory. With this option on, namelist contains at most one
206 entry, which diminishes the memory consumption.
208 However, I very much doubt if we still need this -- Sergey */
210 /* A name_list element contains entries of three types: */
212 #define NELT_NAME 0 /* File name */
213 #define NELT_CHDIR 1 /* Change directory request */
214 #define NELT_FMASK 2 /* Change fnmatch options request */
215 #define NELT_FILE 3 /* Read file names from that file */
216 #define NELT_NOOP 4 /* No operation */
218 struct name_elt /* A name_array element. */
220 struct name_elt *next, *prev;
221 char type; /* Element type, see NELT_* constants above */
224 const char *name; /* File or directory name */
225 int matching_flags;/* fnmatch options if type == NELT_FMASK */
226 struct /* File, if type == NELT_FILE */
228 const char *name;/* File name */
229 int term; /* File name terminator in the list */
235 static struct name_elt *name_head; /* store a list of names */
236 size_t name_count; /* how many of the entries are names? */
238 static struct name_elt *
239 name_elt_alloc (void)
241 struct name_elt *elt;
243 elt = xmalloc (sizeof (*elt));
247 name_head->prev = name_head->next = NULL;
248 name_head->type = NELT_NOOP;
249 elt = xmalloc (sizeof (*elt));
252 elt->prev = name_head->prev;
254 name_head->prev->next = elt;
255 elt->next = name_head;
256 name_head->prev = elt;
261 name_list_adjust (void)
264 while (name_head->prev)
265 name_head = name_head->prev;
269 name_list_advance (void)
271 struct name_elt *elt = name_head;
272 name_head = elt->next;
274 name_head->prev = NULL;
278 /* Add to name_array the file NAME with fnmatch options MATCHING_FLAGS */
280 name_add_name (const char *name, int matching_flags)
282 static int prev_flags = 0; /* FIXME: Or EXCLUDE_ANCHORED? */
283 struct name_elt *ep = name_elt_alloc ();
285 if (prev_flags != matching_flags)
287 ep->type = NELT_FMASK;
288 ep->v.matching_flags = matching_flags;
289 prev_flags = matching_flags;
290 ep = name_elt_alloc ();
292 ep->type = NELT_NAME;
297 /* Add to name_array a chdir request for the directory NAME */
299 name_add_dir (const char *name)
301 struct name_elt *ep = name_elt_alloc ();
302 ep->type = NELT_CHDIR;
307 name_add_file (const char *name, int term)
309 struct name_elt *ep = name_elt_alloc ();
310 ep->type = NELT_FILE;
311 ep->v.file.name = name;
312 ep->v.file.term = term;
313 ep->v.file.fp = NULL;
316 /* Names from external name file. */
318 static char *name_buffer; /* buffer to hold the current file name */
319 static size_t name_buffer_length; /* allocated length of name_buffer */
321 /* Set up to gather file names for tar. They can either come from a
322 file or were saved from decoding arguments. */
326 name_buffer = xmalloc (NAME_FIELD_SIZE + 2);
327 name_buffer_length = NAME_FIELD_SIZE;
337 /* Prevent recursive inclusion of the same file */
340 struct file_id_list *next;
343 const char *from_file;
346 static struct file_id_list *file_id_list;
348 /* Return the name of the file from which the file names and options
352 file_list_name (void)
354 struct name_elt *elt;
356 for (elt = name_head; elt; elt = elt->next)
357 if (elt->type == NELT_FILE && elt->v.file.fp)
358 return elt->v.file.name;
359 return _("command line");
363 add_file_id (const char *filename)
365 struct file_id_list *p;
367 const char *reading_from;
369 if (stat (filename, &st))
370 stat_fatal (filename);
371 reading_from = file_list_name ();
372 for (p = file_id_list; p; p = p->next)
373 if (p->ino == st.st_ino && p->dev == st.st_dev)
375 int oldc = set_char_quoting (NULL, ':', 1);
377 _("%s: file list requested from %s already read from %s"),
378 quotearg_n (0, filename),
379 reading_from, p->from_file));
380 set_char_quoting (NULL, ':', oldc);
383 p = xmalloc (sizeof *p);
384 p->next = file_id_list;
387 p->from_file = reading_from;
392 enum read_file_list_state /* Result of reading file name from the list file */
394 file_list_success, /* OK, name read successfully */
395 file_list_end, /* End of list file */
396 file_list_zero, /* Zero separator encountered where it should not */
397 file_list_skip /* Empty (zero-length) entry encountered, skip it */
400 /* Read from FP a sequence of characters up to TERM and put them
403 static enum read_file_list_state
404 read_name_from_file (struct name_elt *ent)
408 FILE *fp = ent->v.file.fp;
409 int term = ent->v.file.term;
411 for (c = getc (fp); c != EOF && c != term; c = getc (fp))
413 if (counter == name_buffer_length)
414 name_buffer = x2realloc (name_buffer, &name_buffer_length);
415 name_buffer[counter++] = c;
418 /* We have read a zero separator. The file possibly is
420 return file_list_zero;
424 if (counter == 0 && c != EOF)
425 return file_list_skip;
427 if (counter == name_buffer_length)
428 name_buffer = x2realloc (name_buffer, &name_buffer_length);
429 name_buffer[counter] = 0;
431 return (counter == 0 && c == EOF) ? file_list_end : file_list_success;
435 handle_option (const char *str)
440 while (*str && isspace (*str))
446 if (wordsplit (str, &ws, WRDSF_DEFFLAGS|WRDSF_DOOFFS))
447 FATAL_ERROR ((0, 0, _("cannot split string '%s': %s"),
448 str, wordsplit_strerror (&ws)));
449 ws.ws_wordv[0] = program_invocation_short_name;
450 more_options (ws.ws_wordc+ws.ws_offs, ws.ws_wordv);
451 for (i = 0; i < ws.ws_wordc+ws.ws_offs; i++)
452 ws.ws_wordv[i] = NULL;
454 wordsplit_free (&ws);
459 read_next_name (struct name_elt *ent, struct name_elt *ret)
463 if (!strcmp (ent->v.file.name, "-"))
465 request_stdin ("-T");
466 ent->v.file.fp = stdin;
470 if (add_file_id (ent->v.file.name))
472 name_list_advance ();
475 if ((ent->v.file.fp = fopen (ent->v.file.name, "r")) == NULL)
476 open_fatal (ent->v.file.name);
482 switch (read_name_from_file (ent))
488 WARNOPT (WARN_FILENAME_WITH_NULS,
489 (0, 0, N_("%s: file name read contains nul character"),
490 quotearg_colon (ent->v.file.name)));
491 ent->v.file.term = 0;
493 case file_list_success:
494 if (handle_option (name_buffer) == 0)
499 ret->type = NELT_NAME;
500 ret->v.name = name_buffer;
504 if (strcmp (ent->v.file.name, "-"))
505 fclose (ent->v.file.fp);
506 ent->v.file.fp = NULL;
507 name_list_advance ();
514 copy_name (struct name_elt *ep)
521 source_len = strlen (source);
522 if (name_buffer_length < source_len)
526 name_buffer_length *= 2;
527 if (! name_buffer_length)
530 while (name_buffer_length < source_len);
533 name_buffer = xmalloc(name_buffer_length + 2);
535 strcpy (name_buffer, source);
537 /* Zap trailing slashes. */
538 cursor = name_buffer + strlen (name_buffer) - 1;
539 while (cursor > name_buffer && ISSLASH (*cursor))
544 static int matching_flags; /* exclude_fnmatch options */
546 /* Get the next NELT_NAME element from name_array. Result is in
547 static storage and can't be relied upon across two calls.
549 If CHANGE_DIRS is true, treat any entries of type NELT_CHDIR as
550 the request to change to the given directory.
552 Entries of type NELT_FMASK cause updates of the matching_flags
554 static struct name_elt *
555 name_next_elt (int change_dirs)
557 static struct name_elt entry;
560 while ((ep = name_head) != NULL)
565 name_list_advance ();
569 matching_flags = ep->v.matching_flags;
570 name_list_advance ();
574 if (read_next_name (ep, &entry) == 0)
581 chdir_do (chdir_arg (xstrdup (ep->v.name)));
582 name_list_advance ();
589 unquote_string (name_buffer);
590 entry.type = ep->type;
591 entry.v.name = name_buffer;
592 name_list_advance ();
601 name_next (int change_dirs)
603 struct name_elt *nelt = name_next_elt (change_dirs);
604 return nelt ? nelt->v.name : NULL;
607 /* Gather names in a list for scanning. Could hash them later if we
610 If the names are already sorted to match the archive, we just read
611 them one by one. name_gather reads the first one, and it is called
612 by name_match as appropriate to read the next ones. At EOF, the
613 last name read is just left in the buffer. This option lets users
614 of small machines extract an arbitrary number of files by doing
615 "tar t" and editing down the list of files. */
620 /* Buffer able to hold a single name. */
621 static struct name *buffer = NULL;
625 if (same_order_option)
627 static int change_dir;
629 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
630 change_dir = chdir_arg (xstrdup (ep->v.name));
635 buffer = make_name (ep->v.name);
636 buffer->change_dir = change_dir;
638 buffer->found_count = 0;
639 buffer->matching_flags = matching_flags;
640 buffer->directory = NULL;
641 buffer->parent = NULL;
642 buffer->cmdline = true;
644 namelist = nametail = buffer;
647 addname (0, change_dir, false, NULL);
651 /* Non sorted names -- read them all in. */
656 int change_dir0 = change_dir;
657 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
658 change_dir = chdir_arg (xstrdup (ep->v.name));
661 addname (ep->v.name, change_dir, true, NULL);
664 if (change_dir != change_dir0)
665 addname (NULL, change_dir, false, NULL);
672 /* Add a name to the namelist. */
674 addname (char const *string, int change_dir, bool cmdline, struct name *parent)
676 struct name *name = make_name (string);
678 name->prev = nametail;
680 name->found_count = 0;
681 name->matching_flags = matching_flags;
682 name->change_dir = change_dir;
683 name->directory = NULL;
684 name->parent = parent;
685 name->cmdline = cmdline;
688 nametail->next = name;
695 /* Find a match for FILE_NAME (whose string length is LENGTH) in the name
698 namelist_match (char const *file_name, size_t length)
702 for (p = namelist; p; p = p->next)
705 && exclude_fnmatch (p->name, file_name, p->matching_flags))
713 remname (struct name *name)
717 if ((p = name->prev) != NULL)
718 p->next = name->next;
720 namelist = name->next;
722 if ((p = name->next) != NULL)
723 p->prev = name->prev;
725 nametail = name->prev;
728 /* Return true if and only if name FILE_NAME (from an archive) matches any
729 name from the namelist. */
731 name_match (const char *file_name)
733 size_t length = strlen (file_name);
737 struct name *cursor = namelist;
742 if (cursor->name[0] == 0)
744 chdir_do (cursor->change_dir);
750 cursor = namelist_match (file_name, length);
753 if (!(ISSLASH (file_name[cursor->length]) && recursion_option)
754 || cursor->found_count == 0)
755 cursor->found_count++; /* remember it matched */
756 if (starting_file_option)
762 chdir_do (cursor->change_dir);
764 /* We got a match. */
765 return ISFOUND (cursor);
768 /* Filename from archive not found in namelist. If we have the whole
769 namelist here, just return 0. Otherwise, read the next name in and
770 compare it. If this was the last name, namelist->found_count will
771 remain on. If not, we loop to compare the newly read name. */
773 if (same_order_option && namelist->found_count)
775 name_gather (); /* read one more */
776 if (namelist->found_count)
784 /* Returns true if all names from the namelist were processed.
785 P is the stat_info of the most recently processed entry.
786 The decision is postponed until the next entry is read if:
788 1) P ended with a slash (i.e. it was a directory)
789 2) P matches any entry from the namelist *and* represents a subdirectory
790 or a file lying under this entry (in the terms of directory structure).
792 This is necessary to handle contents of directories. */
794 all_names_found (struct tar_stat_info *p)
796 struct name const *cursor;
799 if (!p->file_name || occurrence_option == 0 || p->had_trailing_slash)
801 len = strlen (p->file_name);
802 for (cursor = namelist; cursor; cursor = cursor->next)
804 if ((cursor->name[0] && !WASFOUND (cursor))
805 || (len >= cursor->length && ISSLASH (p->file_name[cursor->length])))
812 regex_usage_warning (const char *name)
814 static int warned_once = 0;
816 if (warn_regex_usage && fnmatch_pattern_has_wildcards (name, 0))
820 _("Pattern matching characters used in file names")));
822 _("Use --wildcards to enable pattern matching,"
823 " or --no-wildcards to suppress this warning")));
828 /* Print the names of things in the namelist that were not matched. */
830 names_notfound (void)
832 struct name const *cursor;
834 for (cursor = namelist; cursor; cursor = cursor->next)
835 if (!WASFOUND (cursor) && cursor->name[0])
837 regex_usage_warning (cursor->name);
839 (cursor->found_count == 0) ?
840 _("%s: Not found in archive") :
841 _("%s: Required occurrence not found in archive"),
842 quotearg_colon (cursor->name)));
845 /* Don't bother freeing the name list; we're about to exit. */
849 if (same_order_option)
853 while ((name = name_next (1)) != NULL)
855 regex_usage_warning (name);
856 ERROR ((0, 0, _("%s: Not found in archive"),
857 quotearg_colon (name)));
863 label_notfound (void)
865 struct name const *cursor;
870 for (cursor = namelist; cursor; cursor = cursor->next)
871 if (WASFOUND (cursor))
875 error (0, 0, _("Archive label mismatch"));
876 set_exit_status (TAREXIT_DIFFERS);
878 for (cursor = namelist; cursor; cursor = cursor->next)
880 if (regex_usage_warning (cursor->name))
884 /* Don't bother freeing the name list; we're about to exit. */
888 if (same_order_option)
892 while ((name = name_next (1)) != NULL
893 && regex_usage_warning (name) == 0)
898 /* Sorting name lists. */
900 /* Sort *singly* linked LIST of names, of given LENGTH, using COMPARE
901 to order names. Return the sorted list. Note that after calling
902 this function, the 'prev' links in list elements are messed up.
904 Apart from the type 'struct name' and the definition of SUCCESSOR,
905 this is a generic list-sorting function, but it's too painful to
906 make it both generic and portable
910 merge_sort_sll (struct name *list, int length,
911 int (*compare) (struct name const*, struct name const*))
913 struct name *first_list;
914 struct name *second_list;
918 struct name **merge_point;
922 # define SUCCESSOR(name) ((name)->next)
929 if ((*compare) (list, SUCCESSOR (list)) > 0)
931 result = SUCCESSOR (list);
932 SUCCESSOR (result) = list;
933 SUCCESSOR (list) = 0;
940 first_length = (length + 1) / 2;
941 second_length = length / 2;
942 for (cursor = list, counter = first_length - 1;
944 cursor = SUCCESSOR (cursor), counter--)
946 second_list = SUCCESSOR (cursor);
947 SUCCESSOR (cursor) = 0;
949 first_list = merge_sort_sll (first_list, first_length, compare);
950 second_list = merge_sort_sll (second_list, second_length, compare);
952 merge_point = &result;
953 while (first_list && second_list)
954 if ((*compare) (first_list, second_list) < 0)
956 cursor = SUCCESSOR (first_list);
957 *merge_point = first_list;
958 merge_point = &SUCCESSOR (first_list);
963 cursor = SUCCESSOR (second_list);
964 *merge_point = second_list;
965 merge_point = &SUCCESSOR (second_list);
966 second_list = cursor;
969 *merge_point = first_list;
971 *merge_point = second_list;
978 /* Sort doubly linked LIST of names, of given LENGTH, using COMPARE
979 to order names. Return the sorted list. */
981 merge_sort (struct name *list, int length,
982 int (*compare) (struct name const*, struct name const*))
984 struct name *head, *p, *prev;
985 head = merge_sort_sll (list, length, compare);
986 /* Fixup prev pointers */
987 for (prev = NULL, p = head; p; prev = p, p = p->next)
992 /* A comparison function for sorting names. Put found names last;
993 break ties by string comparison. */
996 compare_names_found (struct name const *n1, struct name const *n2)
998 int found_diff = WASFOUND (n2) - WASFOUND (n1);
999 return found_diff ? found_diff : strcmp (n1->name, n2->name);
1002 /* Simple comparison by names. */
1004 compare_names (struct name const *n1, struct name const *n2)
1006 return strcmp (n1->name, n2->name);
1010 /* Add all the dirs under ST to the namelist NAME, descending the
1011 directory hierarchy recursively. */
1014 add_hierarchy_to_namelist (struct tar_stat_info *st, struct name *name)
1018 name->directory = scan_directory (st);
1019 buffer = directory_contents (name->directory);
1022 struct name *child_head = NULL, *child_tail = NULL;
1023 size_t name_length = name->length;
1024 size_t allocated_length = (name_length >= NAME_FIELD_SIZE
1025 ? name_length + NAME_FIELD_SIZE
1027 char *namebuf = xmalloc (allocated_length + 1);
1028 /* FIXME: + 2 above? */
1030 size_t string_length;
1031 int change_dir = name->change_dir;
1033 strcpy (namebuf, name->name);
1034 if (! ISSLASH (namebuf[name_length - 1]))
1036 namebuf[name_length++] = '/';
1037 namebuf[name_length] = '\0';
1040 for (string = buffer; *string; string += string_length + 1)
1042 string_length = strlen (string);
1046 struct tar_stat_info subdir;
1049 if (allocated_length <= name_length + string_length)
1053 allocated_length *= 2;
1054 if (! allocated_length)
1057 while (allocated_length <= name_length + string_length);
1059 namebuf = xrealloc (namebuf, allocated_length + 1);
1061 strcpy (namebuf + name_length, string + 1);
1062 np = addname (namebuf, change_dir, false, name);
1066 child_tail->sibling = np;
1069 tar_stat_init (&subdir);
1077 subfd = subfile_open (st, string + 1,
1078 open_read_flags | O_DIRECTORY);
1080 open_diag (namebuf);
1084 if (fstat (subfd, &subdir.stat) != 0)
1085 stat_diag (namebuf);
1086 else if (! (O_DIRECTORY || S_ISDIR (subdir.stat.st_mode)))
1089 open_diag (namebuf);
1093 subdir.orig_file_name = xstrdup (namebuf);
1094 add_hierarchy_to_namelist (&subdir, np);
1095 restore_parent_fd (&subdir);
1099 tar_stat_destroy (&subdir);
1104 name->child = child_head;
1108 /* Auxiliary functions for hashed table of struct name's. */
1111 name_hash (void const *entry, size_t n_buckets)
1113 struct name const *name = entry;
1114 return hash_string (name->caname, n_buckets);
1117 /* Compare two directories for equality of their names. */
1119 name_compare (void const *entry1, void const *entry2)
1121 struct name const *name1 = entry1;
1122 struct name const *name2 = entry2;
1123 return strcmp (name1->caname, name2->caname) == 0;
1127 /* Rebase 'name' member of CHILD and all its siblings to
1130 rebase_child_list (struct name *child, struct name *parent)
1132 size_t old_prefix_len = child->parent->length;
1133 size_t new_prefix_len = parent->length;
1134 char *new_prefix = parent->name;
1136 for (; child; child = child->sibling)
1138 size_t size = child->length - old_prefix_len + new_prefix_len;
1139 char *newp = xmalloc (size + 1);
1140 strcpy (newp, new_prefix);
1141 strcat (newp, child->name + old_prefix_len);
1144 child->length = size;
1146 rebase_directory (child->directory,
1147 child->parent->name, old_prefix_len,
1148 new_prefix, new_prefix_len);
1152 /* Collect all the names from argv[] (or whatever), expand them into a
1153 directory tree, and sort them. This gets only subdirectories, not
1157 collect_and_sort_names (void)
1160 struct name *next_name, *prev_name = NULL;
1162 Hash_table *nametab;
1167 addname (".", 0, false, NULL);
1169 if (listed_incremental_option)
1171 switch (chdir_count ())
1177 if (namelist->change_dir == 0)
1179 _("Using -C option inside file list is not "
1180 "allowed with --listed-incremental")));
1185 _("Only one -C option is allowed with "
1186 "--listed-incremental")));
1189 read_directory_file ();
1193 for (name = namelist; name; name = name->next, num_names++)
1195 struct tar_stat_info st;
1197 if (name->found_count || name->directory)
1199 if (name->matching_flags & EXCLUDE_WILDCARDS)
1200 /* NOTE: EXCLUDE_ANCHORED is not relevant here */
1201 /* FIXME: just skip regexps for now */
1203 chdir_do (name->change_dir);
1205 if (name->name[0] == 0)
1208 tar_stat_init (&st);
1210 if (deref_stat (name->name, &st.stat) != 0)
1212 stat_diag (name->name);
1215 if (S_ISDIR (st.stat.st_mode))
1217 int dir_fd = openat (chdir_fd, name->name,
1218 open_read_flags | O_DIRECTORY);
1220 open_diag (name->name);
1224 if (fstat (dir_fd, &st.stat) != 0)
1225 stat_diag (name->name);
1226 else if (O_DIRECTORY || S_ISDIR (st.stat.st_mode))
1228 st.orig_file_name = xstrdup (name->name);
1229 name->found_count++;
1230 add_hierarchy_to_namelist (&st, name);
1235 tar_stat_destroy (&st);
1238 namelist = merge_sort (namelist, num_names, compare_names);
1241 nametab = hash_initialize (0, 0, name_hash, name_compare, NULL);
1242 for (name = namelist; name; name = next_name)
1244 next_name = name->next;
1245 name->caname = normalize_filename (name->change_dir, name->name);
1248 struct name *p = hash_lookup (nametab, name);
1251 /* Keep the one listed in the command line */
1255 rebase_child_list (p->child, name);
1256 hash_delete (nametab, name);
1257 /* FIXME: remove_directory (p->caname); ? */
1265 rebase_child_list (name->child, p);
1266 /* FIXME: remove_directory (name->caname); ? */
1273 name->found_count = 0;
1274 if (!hash_insert (nametab, name))
1279 nametail = prev_name;
1280 hash_free (nametab);
1282 namelist = merge_sort (namelist, num_names, compare_names_found);
1284 if (listed_incremental_option)
1286 for (name = namelist; name && name->name[0] == 0; name++)
1289 append_incremental_renames (name->directory);
1293 /* This is like name_match, except that
1294 1. It returns a pointer to the name it matched, and doesn't set FOUND
1295 in structure. The caller will have to do that if it wants to.
1296 2. If the namelist is empty, it returns null, unlike name_match, which
1299 name_scan (const char *file_name)
1301 size_t length = strlen (file_name);
1305 struct name *cursor = namelist_match (file_name, length);
1309 /* Filename from archive not found in namelist. If we have the whole
1310 namelist here, just return 0. Otherwise, read the next name in and
1311 compare it. If this was the last name, namelist->found_count will
1312 remain on. If not, we loop to compare the newly read name. */
1314 if (same_order_option && namelist && namelist->found_count)
1316 name_gather (); /* read one more */
1317 if (namelist->found_count)
1325 /* This returns a name from the namelist which doesn't have ->found
1326 set. It sets ->found before returning, so successive calls will
1327 find and return all the non-found names in the namelist. */
1328 struct name *gnu_list_name;
1331 name_from_list (void)
1334 gnu_list_name = namelist;
1335 while (gnu_list_name
1336 && (gnu_list_name->found_count || gnu_list_name->name[0] == 0))
1337 gnu_list_name = gnu_list_name->next;
1340 gnu_list_name->found_count++;
1341 chdir_do (gnu_list_name->change_dir);
1342 return gnu_list_name;
1348 blank_name_list (void)
1353 for (name = namelist; name; name = name->next)
1354 name->found_count = 0;
1357 /* Yield a newly allocated file name consisting of FILE_NAME concatenated to
1358 NAME, with an intervening slash if FILE_NAME does not already end in one. */
1360 new_name (const char *file_name, const char *name)
1362 size_t file_name_len = strlen (file_name);
1363 size_t namesize = strlen (name) + 1;
1364 int slash = file_name_len && ! ISSLASH (file_name[file_name_len - 1]);
1365 char *buffer = xmalloc (file_name_len + slash + namesize);
1366 memcpy (buffer, file_name, file_name_len);
1367 buffer[file_name_len] = '/';
1368 memcpy (buffer + file_name_len + slash, name, namesize);
1372 /* Return nonzero if file NAME is excluded. */
1374 excluded_name (char const *name)
1376 return excluded_file_name (excluded, name + FILE_SYSTEM_PREFIX_LEN (name));
1380 /* Return the size of the prefix of FILE_NAME that is removed after
1381 stripping NUM leading file name components. NUM must be
1385 stripped_prefix_len (char const *file_name, size_t num)
1387 char const *p = file_name + FILE_SYSTEM_PREFIX_LEN (file_name);
1388 while (ISSLASH (*p))
1392 bool slash = ISSLASH (*p);
1397 return p - file_name;
1398 while (ISSLASH (*p))
1405 /* Return nonzero if NAME contains ".." as a file name component. */
1407 contains_dot_dot (char const *name)
1409 char const *p = name + FILE_SYSTEM_PREFIX_LEN (name);
1413 if (p[0] == '.' && p[1] == '.' && (ISSLASH (p[2]) || !p[2]))
1416 while (! ISSLASH (*p))