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_array (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_array 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 */
217 struct name_elt /* A name_array element. */
219 char type; /* Element type, see NELT_* constants above */
222 const char *name; /* File or directory name */
223 int matching_flags;/* fnmatch options if type == NELT_FMASK */
226 const char *name;/* File name */
227 int term; /* File name terminator in the list */
233 static struct name_elt *name_array; /* store an array of names */
234 static size_t allocated_entries; /* how big is the array? */
235 static size_t entries; /* how many entries does it have? */
236 static size_t scanned; /* how many of the entries have we scanned? */
237 size_t name_count; /* how many of the entries are names? */
239 /* Check the size of name_array, reallocating it as necessary. */
241 check_name_alloc (void)
243 if (entries == allocated_entries)
245 if (allocated_entries == 0)
246 allocated_entries = 10; /* Set initial allocation */
247 name_array = x2nrealloc (name_array, &allocated_entries,
248 sizeof (name_array[0]));
252 /* Add to name_array the file NAME with fnmatch options MATCHING_FLAGS */
254 name_add_name (const char *name, int matching_flags)
256 static int prev_flags = 0; /* FIXME: Or EXCLUDE_ANCHORED? */
260 ep = &name_array[entries++];
261 if (prev_flags != matching_flags)
263 ep->type = NELT_FMASK;
264 ep->v.matching_flags = matching_flags;
265 prev_flags = matching_flags;
267 ep = &name_array[entries++];
269 ep->type = NELT_NAME;
274 /* Add to name_array a chdir request for the directory NAME */
276 name_add_dir (const char *name)
280 ep = &name_array[entries++];
281 ep->type = NELT_CHDIR;
286 name_add_file (const char *name, int term)
290 ep = &name_array[entries++];
291 ep->type = NELT_FILE;
292 ep->v.file.name = name;
293 ep->v.file.term = term;
294 ep->v.file.fp = NULL;
297 /* Names from external name file. */
299 static char *name_buffer; /* buffer to hold the current file name */
300 static size_t name_buffer_length; /* allocated length of name_buffer */
302 /* Set up to gather file names for tar. They can either come from a
303 file or were saved from decoding arguments. */
307 name_buffer = xmalloc (NAME_FIELD_SIZE + 2);
308 name_buffer_length = NAME_FIELD_SIZE;
318 /* Prevent recursive inclusion of the same file */
321 struct file_id_list *next;
326 static struct file_id_list *file_id_list;
329 add_file_id (const char *filename)
331 struct file_id_list *p;
334 if (stat (filename, &st))
335 stat_fatal (filename);
336 for (p = file_id_list; p; p = p->next)
337 if (p->ino == st.st_ino && p->dev == st.st_dev)
339 FATAL_ERROR ((0, 0, _("%s: file list already read"),
340 quotearg_colon (filename)));
342 p = xmalloc (sizeof *p);
343 p->next = file_id_list;
349 enum read_file_list_state /* Result of reading file name from the list file */
351 file_list_success, /* OK, name read successfully */
352 file_list_end, /* End of list file */
353 file_list_zero, /* Zero separator encountered where it should not */
354 file_list_skip /* Empty (zero-length) entry encountered, skip it */
357 /* Read from FP a sequence of characters up to TERM and put them
360 static enum read_file_list_state
361 read_name_from_file (struct name_elt *ent)
365 FILE *fp = ent->v.file.fp;
366 int term = ent->v.file.term;
368 for (c = getc (fp); c != EOF && c != term; c = getc (fp))
370 if (counter == name_buffer_length)
371 name_buffer = x2realloc (name_buffer, &name_buffer_length);
372 name_buffer[counter++] = c;
375 /* We have read a zero separator. The file possibly is
377 return file_list_zero;
381 if (counter == 0 && c != EOF)
382 return file_list_skip;
384 if (counter == name_buffer_length)
385 name_buffer = x2realloc (name_buffer, &name_buffer_length);
386 name_buffer[counter] = 0;
388 return (counter == 0 && c == EOF) ? file_list_end : file_list_success;
392 handle_option (const char *str)
397 while (*str && isspace (*str))
403 if (wordsplit (str, &ws, WRDSF_DEFFLAGS|WRDSF_DOOFFS))
404 FATAL_ERROR ((0, 0, _("cannot split string '%s': %s"),
405 str, wordsplit_strerror (&ws)));
406 ws.ws_wordv[0] = program_invocation_short_name;
407 more_options (ws.ws_wordc+ws.ws_offs, ws.ws_wordv);
408 for (i = 0; i < ws.ws_wordc+ws.ws_offs; i++)
409 ws.ws_wordv[i] = NULL;
411 wordsplit_free (&ws);
416 read_next_name (struct name_elt *ent, struct name_elt *ret)
420 if (!strcmp (ent->v.file.name, "-"))
422 request_stdin ("-T");
423 ent->v.file.fp = stdin;
427 add_file_id (ent->v.file.name);
428 if ((ent->v.file.fp = fopen (ent->v.file.name, "r")) == NULL)
429 open_fatal (ent->v.file.name);
435 switch (read_name_from_file (ent))
441 WARNOPT (WARN_FILENAME_WITH_NULS,
442 (0, 0, N_("%s: file name read contains nul character"),
443 quotearg_colon (ent->v.file.name)));
444 ent->v.file.term = 0;
446 case file_list_success:
447 if (handle_option (name_buffer) == 0)
449 ret->type = NELT_NAME;
450 ret->v.name = name_buffer;
454 if (strcmp (ent->v.file.name, "-"))
455 fclose (ent->v.file.fp);
456 ent->v.file.fp = NULL;
463 copy_name (struct name_elt *ep)
470 source_len = strlen (source);
471 if (name_buffer_length < source_len)
475 name_buffer_length *= 2;
476 if (! name_buffer_length)
479 while (name_buffer_length < source_len);
482 name_buffer = xmalloc(name_buffer_length + 2);
484 strcpy (name_buffer, source);
486 /* Zap trailing slashes. */
487 cursor = name_buffer + strlen (name_buffer) - 1;
488 while (cursor > name_buffer && ISSLASH (*cursor))
493 static int matching_flags; /* exclude_fnmatch options */
495 /* Get the next NELT_NAME element from name_array. Result is in
496 static storage and can't be relied upon across two calls.
498 If CHANGE_DIRS is true, treat any entries of type NELT_CHDIR as
499 the request to change to the given directory.
501 Entries of type NELT_FMASK cause updates of the matching_flags
503 static struct name_elt *
504 name_next_elt (int change_dirs)
506 static struct name_elt entry;
508 while (scanned != entries)
512 ep = &name_array[scanned];
513 if (ep->type == NELT_FMASK)
515 matching_flags = ep->v.matching_flags;
523 if (read_next_name (ep, &entry) == 0)
533 if (chdir (name_buffer) < 0)
534 chdir_fatal (name_buffer);
542 unquote_string (name_buffer);
543 entry.type = ep->type;
544 entry.v.name = name_buffer;
553 name_next (int change_dirs)
555 struct name_elt *nelt = name_next_elt (change_dirs);
556 return nelt ? nelt->v.name : NULL;
559 /* Gather names in a list for scanning. Could hash them later if we
562 If the names are already sorted to match the archive, we just read
563 them one by one. name_gather reads the first one, and it is called
564 by name_match as appropriate to read the next ones. At EOF, the
565 last name read is just left in the buffer. This option lets users
566 of small machines extract an arbitrary number of files by doing
567 "tar t" and editing down the list of files. */
572 /* Buffer able to hold a single name. */
573 static struct name *buffer = NULL;
577 if (same_order_option)
579 static int change_dir;
581 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
582 change_dir = chdir_arg (xstrdup (ep->v.name));
587 buffer = make_name (ep->v.name);
588 buffer->change_dir = change_dir;
590 buffer->found_count = 0;
591 buffer->matching_flags = matching_flags;
592 buffer->directory = NULL;
593 buffer->parent = NULL;
594 buffer->cmdline = true;
596 namelist = nametail = buffer;
599 addname (0, change_dir, false, NULL);
603 /* Non sorted names -- read them all in. */
608 int change_dir0 = change_dir;
609 while ((ep = name_next_elt (0)) && ep->type == NELT_CHDIR)
610 change_dir = chdir_arg (xstrdup (ep->v.name));
613 addname (ep->v.name, change_dir, true, NULL);
616 if (change_dir != change_dir0)
617 addname (NULL, change_dir, false, NULL);
624 /* Add a name to the namelist. */
626 addname (char const *string, int change_dir, bool cmdline, struct name *parent)
628 struct name *name = make_name (string);
630 name->prev = nametail;
632 name->found_count = 0;
633 name->matching_flags = matching_flags;
634 name->change_dir = change_dir;
635 name->directory = NULL;
636 name->parent = parent;
637 name->cmdline = cmdline;
640 nametail->next = name;
647 /* Find a match for FILE_NAME (whose string length is LENGTH) in the name
650 namelist_match (char const *file_name, size_t length)
654 for (p = namelist; p; p = p->next)
657 && exclude_fnmatch (p->name, file_name, p->matching_flags))
665 remname (struct name *name)
669 if ((p = name->prev) != NULL)
670 p->next = name->next;
672 namelist = name->next;
674 if ((p = name->next) != NULL)
675 p->prev = name->prev;
677 nametail = name->prev;
680 /* Return true if and only if name FILE_NAME (from an archive) matches any
681 name from the namelist. */
683 name_match (const char *file_name)
685 size_t length = strlen (file_name);
689 struct name *cursor = namelist;
694 if (cursor->name[0] == 0)
696 chdir_do (cursor->change_dir);
702 cursor = namelist_match (file_name, length);
705 if (!(ISSLASH (file_name[cursor->length]) && recursion_option)
706 || cursor->found_count == 0)
707 cursor->found_count++; /* remember it matched */
708 if (starting_file_option)
714 chdir_do (cursor->change_dir);
716 /* We got a match. */
717 return ISFOUND (cursor);
720 /* Filename from archive not found in namelist. If we have the whole
721 namelist here, just return 0. Otherwise, read the next name in and
722 compare it. If this was the last name, namelist->found_count will
723 remain on. If not, we loop to compare the newly read name. */
725 if (same_order_option && namelist->found_count)
727 name_gather (); /* read one more */
728 if (namelist->found_count)
736 /* Returns true if all names from the namelist were processed.
737 P is the stat_info of the most recently processed entry.
738 The decision is postponed until the next entry is read if:
740 1) P ended with a slash (i.e. it was a directory)
741 2) P matches any entry from the namelist *and* represents a subdirectory
742 or a file lying under this entry (in the terms of directory structure).
744 This is necessary to handle contents of directories. */
746 all_names_found (struct tar_stat_info *p)
748 struct name const *cursor;
751 if (!p->file_name || occurrence_option == 0 || p->had_trailing_slash)
753 len = strlen (p->file_name);
754 for (cursor = namelist; cursor; cursor = cursor->next)
756 if ((cursor->name[0] && !WASFOUND (cursor))
757 || (len >= cursor->length && ISSLASH (p->file_name[cursor->length])))
764 regex_usage_warning (const char *name)
766 static int warned_once = 0;
768 if (warn_regex_usage && fnmatch_pattern_has_wildcards (name, 0))
772 _("Pattern matching characters used in file names")));
774 _("Use --wildcards to enable pattern matching,"
775 " or --no-wildcards to suppress this warning")));
780 /* Print the names of things in the namelist that were not matched. */
782 names_notfound (void)
784 struct name const *cursor;
786 for (cursor = namelist; cursor; cursor = cursor->next)
787 if (!WASFOUND (cursor) && cursor->name[0])
789 regex_usage_warning (cursor->name);
791 (cursor->found_count == 0) ?
792 _("%s: Not found in archive") :
793 _("%s: Required occurrence not found in archive"),
794 quotearg_colon (cursor->name)));
797 /* Don't bother freeing the name list; we're about to exit. */
801 if (same_order_option)
805 while ((name = name_next (1)) != NULL)
807 regex_usage_warning (name);
808 ERROR ((0, 0, _("%s: Not found in archive"),
809 quotearg_colon (name)));
815 label_notfound (void)
817 struct name const *cursor;
822 for (cursor = namelist; cursor; cursor = cursor->next)
823 if (WASFOUND (cursor))
827 error (0, 0, _("Archive label mismatch"));
828 set_exit_status (TAREXIT_DIFFERS);
830 for (cursor = namelist; cursor; cursor = cursor->next)
832 if (regex_usage_warning (cursor->name))
836 /* Don't bother freeing the name list; we're about to exit. */
840 if (same_order_option)
844 while ((name = name_next (1)) != NULL
845 && regex_usage_warning (name) == 0)
850 /* Sorting name lists. */
852 /* Sort *singly* linked LIST of names, of given LENGTH, using COMPARE
853 to order names. Return the sorted list. Note that after calling
854 this function, the 'prev' links in list elements are messed up.
856 Apart from the type 'struct name' and the definition of SUCCESSOR,
857 this is a generic list-sorting function, but it's too painful to
858 make it both generic and portable
862 merge_sort_sll (struct name *list, int length,
863 int (*compare) (struct name const*, struct name const*))
865 struct name *first_list;
866 struct name *second_list;
870 struct name **merge_point;
874 # define SUCCESSOR(name) ((name)->next)
881 if ((*compare) (list, SUCCESSOR (list)) > 0)
883 result = SUCCESSOR (list);
884 SUCCESSOR (result) = list;
885 SUCCESSOR (list) = 0;
892 first_length = (length + 1) / 2;
893 second_length = length / 2;
894 for (cursor = list, counter = first_length - 1;
896 cursor = SUCCESSOR (cursor), counter--)
898 second_list = SUCCESSOR (cursor);
899 SUCCESSOR (cursor) = 0;
901 first_list = merge_sort_sll (first_list, first_length, compare);
902 second_list = merge_sort_sll (second_list, second_length, compare);
904 merge_point = &result;
905 while (first_list && second_list)
906 if ((*compare) (first_list, second_list) < 0)
908 cursor = SUCCESSOR (first_list);
909 *merge_point = first_list;
910 merge_point = &SUCCESSOR (first_list);
915 cursor = SUCCESSOR (second_list);
916 *merge_point = second_list;
917 merge_point = &SUCCESSOR (second_list);
918 second_list = cursor;
921 *merge_point = first_list;
923 *merge_point = second_list;
930 /* Sort doubly linked LIST of names, of given LENGTH, using COMPARE
931 to order names. Return the sorted list. */
933 merge_sort (struct name *list, int length,
934 int (*compare) (struct name const*, struct name const*))
936 struct name *head, *p, *prev;
937 head = merge_sort_sll (list, length, compare);
938 /* Fixup prev pointers */
939 for (prev = NULL, p = head; p; prev = p, p = p->next)
944 /* A comparison function for sorting names. Put found names last;
945 break ties by string comparison. */
948 compare_names_found (struct name const *n1, struct name const *n2)
950 int found_diff = WASFOUND (n2) - WASFOUND (n1);
951 return found_diff ? found_diff : strcmp (n1->name, n2->name);
954 /* Simple comparison by names. */
956 compare_names (struct name const *n1, struct name const *n2)
958 return strcmp (n1->name, n2->name);
962 /* Add all the dirs under ST to the namelist NAME, descending the
963 directory hierarchy recursively. */
966 add_hierarchy_to_namelist (struct tar_stat_info *st, struct name *name)
970 name->directory = scan_directory (st);
971 buffer = directory_contents (name->directory);
974 struct name *child_head = NULL, *child_tail = NULL;
975 size_t name_length = name->length;
976 size_t allocated_length = (name_length >= NAME_FIELD_SIZE
977 ? name_length + NAME_FIELD_SIZE
979 char *namebuf = xmalloc (allocated_length + 1);
980 /* FIXME: + 2 above? */
982 size_t string_length;
983 int change_dir = name->change_dir;
985 strcpy (namebuf, name->name);
986 if (! ISSLASH (namebuf[name_length - 1]))
988 namebuf[name_length++] = '/';
989 namebuf[name_length] = '\0';
992 for (string = buffer; *string; string += string_length + 1)
994 string_length = strlen (string);
998 struct tar_stat_info subdir;
1001 if (allocated_length <= name_length + string_length)
1005 allocated_length *= 2;
1006 if (! allocated_length)
1009 while (allocated_length <= name_length + string_length);
1011 namebuf = xrealloc (namebuf, allocated_length + 1);
1013 strcpy (namebuf + name_length, string + 1);
1014 np = addname (namebuf, change_dir, false, name);
1018 child_tail->sibling = np;
1021 tar_stat_init (&subdir);
1029 subfd = subfile_open (st, string + 1,
1030 open_read_flags | O_DIRECTORY);
1032 open_diag (namebuf);
1036 if (fstat (subfd, &subdir.stat) != 0)
1037 stat_diag (namebuf);
1038 else if (! (O_DIRECTORY || S_ISDIR (subdir.stat.st_mode)))
1041 open_diag (namebuf);
1045 subdir.orig_file_name = xstrdup (namebuf);
1046 add_hierarchy_to_namelist (&subdir, np);
1047 restore_parent_fd (&subdir);
1051 tar_stat_destroy (&subdir);
1056 name->child = child_head;
1060 /* Auxiliary functions for hashed table of struct name's. */
1063 name_hash (void const *entry, size_t n_buckets)
1065 struct name const *name = entry;
1066 return hash_string (name->caname, n_buckets);
1069 /* Compare two directories for equality of their names. */
1071 name_compare (void const *entry1, void const *entry2)
1073 struct name const *name1 = entry1;
1074 struct name const *name2 = entry2;
1075 return strcmp (name1->caname, name2->caname) == 0;
1079 /* Rebase 'name' member of CHILD and all its siblings to
1082 rebase_child_list (struct name *child, struct name *parent)
1084 size_t old_prefix_len = child->parent->length;
1085 size_t new_prefix_len = parent->length;
1086 char *new_prefix = parent->name;
1088 for (; child; child = child->sibling)
1090 size_t size = child->length - old_prefix_len + new_prefix_len;
1091 char *newp = xmalloc (size + 1);
1092 strcpy (newp, new_prefix);
1093 strcat (newp, child->name + old_prefix_len);
1096 child->length = size;
1098 rebase_directory (child->directory,
1099 child->parent->name, old_prefix_len,
1100 new_prefix, new_prefix_len);
1104 /* Collect all the names from argv[] (or whatever), expand them into a
1105 directory tree, and sort them. This gets only subdirectories, not
1109 collect_and_sort_names (void)
1112 struct name *next_name, *prev_name = NULL;
1114 Hash_table *nametab;
1119 addname (".", 0, false, NULL);
1121 if (listed_incremental_option)
1123 switch (chdir_count ())
1129 if (namelist->change_dir == 0)
1131 _("Using -C option inside file list is not "
1132 "allowed with --listed-incremental")));
1137 _("Only one -C option is allowed with "
1138 "--listed-incremental")));
1141 read_directory_file ();
1145 for (name = namelist; name; name = name->next, num_names++)
1147 struct tar_stat_info st;
1149 if (name->found_count || name->directory)
1151 if (name->matching_flags & EXCLUDE_WILDCARDS)
1152 /* NOTE: EXCLUDE_ANCHORED is not relevant here */
1153 /* FIXME: just skip regexps for now */
1155 chdir_do (name->change_dir);
1157 if (name->name[0] == 0)
1160 tar_stat_init (&st);
1162 if (deref_stat (name->name, &st.stat) != 0)
1164 stat_diag (name->name);
1167 if (S_ISDIR (st.stat.st_mode))
1169 int dir_fd = openat (chdir_fd, name->name,
1170 open_read_flags | O_DIRECTORY);
1172 open_diag (name->name);
1176 if (fstat (dir_fd, &st.stat) != 0)
1177 stat_diag (name->name);
1178 else if (O_DIRECTORY || S_ISDIR (st.stat.st_mode))
1180 st.orig_file_name = xstrdup (name->name);
1181 name->found_count++;
1182 add_hierarchy_to_namelist (&st, name);
1187 tar_stat_destroy (&st);
1190 namelist = merge_sort (namelist, num_names, compare_names);
1193 nametab = hash_initialize (0, 0,
1195 name_compare, NULL);
1196 for (name = namelist; name; name = next_name)
1198 next_name = name->next;
1199 name->caname = normalize_filename (name->name);
1202 struct name *p = hash_lookup (nametab, name);
1205 /* Keep the one listed in the command line */
1209 rebase_child_list (p->child, name);
1210 hash_delete (nametab, name);
1211 /* FIXME: remove_directory (p->caname); ? */
1219 rebase_child_list (name->child, p);
1220 /* FIXME: remove_directory (name->caname); ? */
1227 name->found_count = 0;
1228 if (!hash_insert (nametab, name))
1233 nametail = prev_name;
1234 hash_free (nametab);
1236 namelist = merge_sort (namelist, num_names, compare_names_found);
1238 if (listed_incremental_option)
1240 for (name = namelist; name && name->name[0] == 0; name++)
1243 append_incremental_renames (name->directory);
1247 /* This is like name_match, except that
1248 1. It returns a pointer to the name it matched, and doesn't set FOUND
1249 in structure. The caller will have to do that if it wants to.
1250 2. If the namelist is empty, it returns null, unlike name_match, which
1253 name_scan (const char *file_name)
1255 size_t length = strlen (file_name);
1259 struct name *cursor = namelist_match (file_name, length);
1263 /* Filename from archive not found in namelist. If we have the whole
1264 namelist here, just return 0. Otherwise, read the next name in and
1265 compare it. If this was the last name, namelist->found_count will
1266 remain on. If not, we loop to compare the newly read name. */
1268 if (same_order_option && namelist && namelist->found_count)
1270 name_gather (); /* read one more */
1271 if (namelist->found_count)
1279 /* This returns a name from the namelist which doesn't have ->found
1280 set. It sets ->found before returning, so successive calls will
1281 find and return all the non-found names in the namelist. */
1282 struct name *gnu_list_name;
1285 name_from_list (void)
1288 gnu_list_name = namelist;
1289 while (gnu_list_name
1290 && (gnu_list_name->found_count || gnu_list_name->name[0] == 0))
1291 gnu_list_name = gnu_list_name->next;
1294 gnu_list_name->found_count++;
1295 chdir_do (gnu_list_name->change_dir);
1296 return gnu_list_name;
1302 blank_name_list (void)
1307 for (name = namelist; name; name = name->next)
1308 name->found_count = 0;
1311 /* Yield a newly allocated file name consisting of FILE_NAME concatenated to
1312 NAME, with an intervening slash if FILE_NAME does not already end in one. */
1314 new_name (const char *file_name, const char *name)
1316 size_t file_name_len = strlen (file_name);
1317 size_t namesize = strlen (name) + 1;
1318 int slash = file_name_len && ! ISSLASH (file_name[file_name_len - 1]);
1319 char *buffer = xmalloc (file_name_len + slash + namesize);
1320 memcpy (buffer, file_name, file_name_len);
1321 buffer[file_name_len] = '/';
1322 memcpy (buffer + file_name_len + slash, name, namesize);
1326 /* Return nonzero if file NAME is excluded. */
1328 excluded_name (char const *name)
1330 return excluded_file_name (excluded, name + FILE_SYSTEM_PREFIX_LEN (name));
1334 /* Return the size of the prefix of FILE_NAME that is removed after
1335 stripping NUM leading file name components. NUM must be
1339 stripped_prefix_len (char const *file_name, size_t num)
1341 char const *p = file_name + FILE_SYSTEM_PREFIX_LEN (file_name);
1342 while (ISSLASH (*p))
1346 bool slash = ISSLASH (*p);
1351 return p - file_name;
1352 while (ISSLASH (*p))
1359 /* Return nonzero if NAME contains ".." as a file name component. */
1361 contains_dot_dot (char const *name)
1363 char const *p = name + FILE_SYSTEM_PREFIX_LEN (name);
1367 if (p[0] == '.' && p[1] == '.' && (ISSLASH (p[2]) || !p[2]))
1370 while (! ISSLASH (*p))