-/* Look up user and/or group names.
- Copyright (C) 1988, 1992 Free Software Foundation
-
-This file is part of GNU Tar.
-
-GNU Tar is free software; you can redistribute it and/or modify
-it under the terms of the GNU General Public License as published by
-the Free Software Foundation; either version 2, or (at your option)
-any later version.
-
-GNU Tar is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-GNU General Public License for more details.
-
-You should have received a copy of the GNU General Public License
-along with GNU Tar; see the file COPYING. If not, write to
-the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
-
-/*
- * Look up user and/or group names.
- *
- * This file should be modified for non-unix systems to do something
- * reasonable.
- */
-
-#include <sys/types.h>
-#include "tar.h"
-#include "port.h"
-
-#ifndef NONAMES
-/* Whole module goes away if NONAMES defined. Otherwise... */
-#include <stdio.h>
+/* Various processing of names.
+ Copyright (C) 1988, 92, 94, 96, 97, 98, 1999 Free Software Foundation, Inc.
+
+ This program is free software; you can redistribute it and/or modify it
+ under the terms of the GNU General Public License as published by the
+ Free Software Foundation; either version 2, or (at your option) any later
+ version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+ Public License for more details.
+
+ You should have received a copy of the GNU General Public License along
+ with this program; if not, write to the Free Software Foundation, Inc.,
+ 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
+
+/* Enable GNU extensions in fnmatch.h. */
+#ifndef _GNU_SOURCE
+# define _GNU_SOURCE 1
+#endif
+
+#include "system.h"
+
#include <pwd.h>
#include <grp.h>
+#include <fnmatch.h>
+#include <quotearg.h>
+
+#include "common.h"
+\f
+/* User and group names. */
+
+extern struct group *getgrnam ();
+extern struct passwd *getpwnam ();
+#if !HAVE_GETPWUID
+extern struct passwd *getpwuid ();
+#endif
+#if !HAVE_GETGRGID
+extern struct group *getgrgid ();
+#endif
+
+/* Make sure you link with the proper libraries if you are running the
+ Yellow Peril (thanks for the good laugh, Ian J.!), or, euh... NIS.
+ This code should also be modified for non-UNIX systems to do something
+ reasonable. */
+
+static char cached_uname[UNAME_FIELD_SIZE];
+static char cached_gname[GNAME_FIELD_SIZE];
+
+static uid_t cached_uid; /* valid only if cached_uname is not empty */
+static gid_t cached_gid; /* valid only if cached_gname is not empty */
+
+/* These variables are valid only if nonempty. */
+static char cached_no_such_uname[UNAME_FIELD_SIZE];
+static char cached_no_such_gname[GNAME_FIELD_SIZE];
+
+/* These variables are valid only if nonzero. It's not worth optimizing
+ the case for weird systems where 0 is not a valid uid or gid. */
+static uid_t cached_no_such_uid;
+static gid_t cached_no_such_gid;
+
+/*------------------------------------------.
+| Given UID, find the corresponding UNAME. |
+`------------------------------------------*/
-static int saveuid = -993;
-static char saveuname[TUNMLEN];
-static int my_uid = -993;
-
-static int savegid = -993;
-static char savegname[TGNMLEN];
-static int my_gid = -993;
-
-#define myuid ( my_uid < 0? (my_uid = getuid()): my_uid )
-#define mygid ( my_gid < 0? (my_gid = getgid()): my_gid )
-
-/*
- * Look up a user or group name from a uid/gid, maintaining a cache.
- * FIXME, for now it's a one-entry cache.
- * FIXME2, the "-993" is to reduce the chance of a hit on the first lookup.
- *
- * This is ifdef'd because on Suns, it drags in about 38K of "yellow
- * pages" code, roughly doubling the program size. Thanks guys.
- */
void
-finduname (uname, uid)
- char uname[TUNMLEN];
- int uid;
+uid_to_uname (uid_t uid, char uname[UNAME_FIELD_SIZE])
{
- struct passwd *pw;
-#ifndef HAVE_GETPWUID
- extern struct passwd *getpwuid ();
-#endif
+ struct passwd *passwd;
+
+ if (uid != 0 && uid == cached_no_such_uid)
+ {
+ *uname = '\0';
+ return;
+ }
- if (uid != saveuid)
+ if (!cached_uname[0] || uid != cached_uid)
{
- saveuid = uid;
- saveuname[0] = '\0';
- pw = getpwuid (uid);
- if (pw)
- strncpy (saveuname, pw->pw_name, TUNMLEN);
+ passwd = getpwuid (uid);
+ if (passwd)
+ {
+ cached_uid = uid;
+ strncpy (cached_uname, passwd->pw_name, UNAME_FIELD_SIZE);
+ }
+ else
+ {
+ cached_no_such_uid = uid;
+ *uname = '\0';
+ return;
+ }
}
- strncpy (uname, saveuname, TUNMLEN);
+ strncpy (uname, cached_uname, UNAME_FIELD_SIZE);
}
+/*------------------------------------------.
+| Given GID, find the corresponding GNAME. |
+`------------------------------------------*/
+
+void
+gid_to_gname (gid_t gid, char gname[GNAME_FIELD_SIZE])
+{
+ struct group *group;
+
+ if (gid != 0 && gid == cached_no_such_gid)
+ {
+ *gname = '\0';
+ return;
+ }
+
+ if (!cached_gname[0] || gid != cached_gid)
+ {
+ setgrent (); /* FIXME: why?! */
+ group = getgrgid (gid);
+ if (group)
+ {
+ cached_gid = gid;
+ strncpy (cached_gname, group->gr_name, GNAME_FIELD_SIZE);
+ }
+ else
+ {
+ cached_no_such_gid = gid;
+ *gname = '\0';
+ return;
+ }
+ }
+ strncpy (gname, cached_gname, GNAME_FIELD_SIZE);
+}
+
+/*-------------------------------------------------------------------------.
+| Given UNAME, set the corresponding UID and return 1, or else, return 0. |
+`-------------------------------------------------------------------------*/
+
int
-finduid (uname)
- char uname[TUNMLEN];
+uname_to_uid (char uname[UNAME_FIELD_SIZE], uid_t *uidp)
{
- struct passwd *pw;
- extern struct passwd *getpwnam ();
+ struct passwd *passwd;
- if (uname[0] != saveuname[0] /* Quick test w/o proc call */
- || 0 != strncmp (uname, saveuname, TUNMLEN))
+ if (cached_no_such_uname[0]
+ && strncmp (uname, cached_no_such_uname, UNAME_FIELD_SIZE) == 0)
+ return 0;
+
+ if (!cached_uname[0]
+ || uname[0] != cached_uname[0]
+ || strncmp (uname, cached_uname, UNAME_FIELD_SIZE) != 0)
{
- strncpy (saveuname, uname, TUNMLEN);
- pw = getpwnam (uname);
- if (pw)
+ passwd = getpwnam (uname);
+ if (passwd)
{
- saveuid = pw->pw_uid;
+ cached_uid = passwd->pw_uid;
+ strncpy (cached_uname, uname, UNAME_FIELD_SIZE);
}
else
{
- saveuid = myuid;
+ strncpy (cached_no_such_uname, uname, UNAME_FIELD_SIZE);
+ return 0;
}
}
- return saveuid;
+ *uidp = cached_uid;
+ return 1;
}
+/*-------------------------------------------------------------------------.
+| Given GNAME, set the corresponding GID and return 1, or else, return 0. |
+`-------------------------------------------------------------------------*/
+
+int
+gname_to_gid (char gname[GNAME_FIELD_SIZE], gid_t *gidp)
+{
+ struct group *group;
+
+ if (cached_no_such_gname[0]
+ && strncmp (gname, cached_no_such_gname, GNAME_FIELD_SIZE) == 0)
+ return 0;
+
+ if (!cached_gname[0]
+ || gname[0] != cached_gname[0]
+ || strncmp (gname, cached_gname, GNAME_FIELD_SIZE) != 0)
+ {
+ group = getgrnam (gname);
+ if (group)
+ {
+ cached_gid = group->gr_gid;
+ strncpy (cached_gname, gname, GNAME_FIELD_SIZE);
+ }
+ else
+ {
+ strncpy (cached_no_such_gname, gname, GNAME_FIELD_SIZE);
+ return 0;
+ }
+ }
+ *gidp = cached_gid;
+ return 1;
+}
+\f
+/* Names from the command call. */
+
+static const char **name_array; /* store an array of names */
+static int allocated_names; /* how big is the array? */
+static int names; /* how many entries does it have? */
+static int name_index; /* how many of the entries have we scanned? */
+
+/*------------------------.
+| Initialize structures. |
+`------------------------*/
void
-findgname (gname, gid)
- char gname[TGNMLEN];
- int gid;
+init_names (void)
{
- struct group *gr;
-#ifndef HAVE_GETGRGID
- extern struct group *getgrgid ();
-#endif
+ allocated_names = 10;
+ name_array = xmalloc (sizeof (const char *) * allocated_names);
+ names = 0;
+}
+
+/*--------------------------------------------------------------.
+| Add NAME at end of name_array, reallocating it as necessary. |
+`--------------------------------------------------------------*/
- if (gid != savegid)
+void
+name_add (const char *name)
+{
+ if (names == allocated_names)
{
- savegid = gid;
- savegname[0] = '\0';
- (void) setgrent ();
- gr = getgrgid (gid);
- if (gr)
- strncpy (savegname, gr->gr_name, TGNMLEN);
+ allocated_names *= 2;
+ name_array =
+ xrealloc (name_array, sizeof (const char *) * allocated_names);
}
- (void) strncpy (gname, savegname, TGNMLEN);
+ name_array[names++] = name;
}
+\f
+/* Names from external name file. */
+static FILE *name_file; /* file to read names from */
+static char *name_buffer; /* buffer to hold the current file name */
+static size_t name_buffer_length; /* allocated length of name_buffer */
-int
-findgid (gname)
- char gname[TUNMLEN];
+/*---.
+| ? |
+`---*/
+
+/* FIXME: I should better check more closely. It seems at first glance that
+ is_pattern is only used when reading a file, and ignored for all
+ command line arguments. */
+
+static inline int
+is_pattern (const char *string)
+{
+ return strchr (string, '*') || strchr (string, '[') || strchr (string, '?');
+}
+
+/*-----------------------------------------------------------------------.
+| Set up to gather file names for tar. They can either come from a file |
+| or were saved from decoding arguments. |
+`-----------------------------------------------------------------------*/
+
+void
+name_init (int argc, char *const *argv)
+{
+ name_buffer = xmalloc (NAME_FIELD_SIZE + 2);
+ name_buffer_length = NAME_FIELD_SIZE;
+
+ if (files_from_option)
+ {
+ if (!strcmp (files_from_option, "-"))
+ {
+ request_stdin ("-T");
+ name_file = stdin;
+ }
+ else if (name_file = fopen (files_from_option, "r"), !name_file)
+ open_fatal (files_from_option);
+ }
+}
+
+/*---.
+| ? |
+`---*/
+
+void
+name_term (void)
+{
+ free (name_buffer);
+ free (name_array);
+}
+
+/*---------------------------------------------------------------------.
+| Read the next filename from name_file and null-terminate it. Put it |
+| into name_buffer, reallocating and adjusting name_buffer_length if |
+| necessary. Return 0 at end of file, 1 otherwise. |
+`---------------------------------------------------------------------*/
+
+static int
+read_name_from_file (void)
+{
+ int character;
+ size_t counter = 0;
+
+ /* FIXME: getc may be called even if character was EOF the last time here. */
+
+ /* FIXME: This + 2 allocation might serve no purpose. */
+
+ while (character = getc (name_file),
+ character != EOF && character != filename_terminator)
+ {
+ if (counter == name_buffer_length)
+ {
+ name_buffer_length += NAME_FIELD_SIZE;
+ name_buffer = xrealloc (name_buffer, name_buffer_length + 2);
+ }
+ name_buffer[counter++] = character;
+ }
+
+ if (counter == 0 && character == EOF)
+ return 0;
+
+ if (counter == name_buffer_length)
+ {
+ name_buffer_length += NAME_FIELD_SIZE;
+ name_buffer = xrealloc (name_buffer, name_buffer_length + 2);
+ }
+ name_buffer[counter] = '\0';
+
+ return 1;
+}
+
+/*------------------------------------------------------------------------.
+| Get the next name from ARGV or the file of names. Result is in static |
+| storage and can't be relied upon across two calls. |
+| |
+| If CHANGE_DIRS is true, treat a filename of the form "-C" as meaning |
+| that the next filename is the name of a directory to change to. If |
+| `filename_terminator' is NUL, CHANGE_DIRS is effectively always false. |
+`------------------------------------------------------------------------*/
+
+char *
+name_next (int change_dirs)
{
- struct group *gr;
- extern struct group *getgrnam ();
+ const char *source;
+ char *cursor;
+ int chdir_flag = 0;
- if (gname[0] != savegname[0] /* Quick test w/o proc call */
- || 0 != strncmp (gname, savegname, TUNMLEN))
+ if (filename_terminator == '\0')
+ change_dirs = 0;
+
+ while (1)
{
- strncpy (savegname, gname, TUNMLEN);
- gr = getgrnam (gname);
- if (gr)
+ /* Get a name, either from file or from saved arguments. */
+
+ if (name_index == names)
{
- savegid = gr->gr_gid;
+ if (! name_file)
+ break;
+ if (! read_name_from_file ())
+ break;
}
else
{
- savegid = mygid;
+ source = name_array[name_index++];
+ if (strlen (source) > name_buffer_length)
+ {
+ free (name_buffer);
+ name_buffer_length = strlen (source);
+ name_buffer = xmalloc (name_buffer_length + 2);
+ }
+ strcpy (name_buffer, source);
+ }
+
+ /* Zap trailing slashes. */
+
+ cursor = name_buffer + strlen (name_buffer) - 1;
+ while (cursor > name_buffer && *cursor == '/')
+ *cursor-- = '\0';
+
+ if (chdir_flag)
+ {
+ if (chdir (name_buffer) < 0)
+ chdir_fatal (name_buffer);
+ chdir_flag = 0;
+ }
+ else if (change_dirs && strcmp (name_buffer, "-C") == 0)
+ chdir_flag = 1;
+ else
+ {
+ unquote_string (name_buffer);
+ return name_buffer;
}
}
- return savegid;
+
+ /* No more names in file. */
+
+ if (name_file && chdir_flag)
+ FATAL_ERROR ((0, 0, _("Missing file name after -C")));
+
+ return 0;
+}
+
+/*------------------------------.
+| Close the name file, if any. |
+`------------------------------*/
+
+void
+name_close (void)
+{
+ if (name_file && name_file != stdin)
+ if (fclose (name_file) != 0)
+ close_error (name_buffer);
}
+/*-------------------------------------------------------------------------.
+| Gather names in a list for scanning. Could hash them later if we really |
+| care. |
+| |
+| If the names are already sorted to match the archive, we just read them |
+| one by one. name_gather reads the first one, and it is called by |
+| name_match as appropriate to read the next ones. At EOF, the last name |
+| read is just left in the buffer. This option lets users of small |
+| machines extract an arbitrary number of files by doing "tar t" and |
+| editing down the list of files. |
+`-------------------------------------------------------------------------*/
+
+void
+name_gather (void)
+{
+ /* Buffer able to hold a single name. */
+ static struct name *buffer;
+ static size_t allocated_length;
+
+ char const *name;
+
+ if (same_order_option)
+ {
+ static int change_dir;
+
+ if (allocated_length == 0)
+ {
+ allocated_length = sizeof (struct name) + NAME_FIELD_SIZE;
+ buffer = xmalloc (allocated_length);
+ /* FIXME: This memset is overkill, and ugly... */
+ memset (buffer, 0, allocated_length);
+ }
+
+ while ((name = name_next (0)) && strcmp (name, "-C") == 0)
+ {
+ char const *dir = name_next (0);
+ if (! dir)
+ FATAL_ERROR ((0, 0, _("Missing file name after -C")));
+ change_dir = chdir_arg (xstrdup (dir));
+ }
+
+ if (name)
+ {
+ buffer->length = strlen (name);
+ if (sizeof (struct name) + buffer->length >= allocated_length)
+ {
+ allocated_length = sizeof (struct name) + buffer->length;
+ buffer = xrealloc (buffer, allocated_length);
+ }
+ buffer->change_dir = change_dir;
+ strncpy (buffer->name, name, buffer->length);
+ buffer->name[buffer->length] = 0;
+ buffer->next = 0;
+ buffer->found = 0;
+
+ /* FIXME: Poorly named globals, indeed... */
+ namelist = buffer;
+ namelast = namelist;
+ }
+ }
+ else
+ {
+ /* Non sorted names -- read them all in. */
+ int change_dir = 0;
+
+ for (;;)
+ {
+ int change_dir0 = change_dir;
+ while ((name = name_next (0)) && strcmp (name, "-C") == 0)
+ {
+ char const *dir = name_next (0);
+ if (! dir)
+ FATAL_ERROR ((0, 0, _("Missing file name after -C")));
+ change_dir = chdir_arg (xstrdup (dir));
+ }
+ if (name)
+ addname (name, change_dir);
+ else
+ {
+ if (change_dir != change_dir0)
+ addname (0, change_dir);
+ break;
+ }
+ }
+ }
+}
+
+/*-----------------------------.
+| Add a name to the namelist. |
+`-----------------------------*/
+
+void
+addname (char const *string, int change_dir)
+{
+ struct name *name;
+ size_t length;
+
+ length = string ? strlen (string) : 0;
+ name = xmalloc (sizeof (struct name) + length);
+ memset (name, 0, sizeof (struct name) + length);
+ name->next = 0;
+
+ if (string)
+ {
+ name->fake = 0;
+ name->length = length;
+ memcpy (name->name, string, length + 1);
+ }
+ else
+ name->fake = 1;
+
+ name->found = 0;
+ name->regexp = 0; /* assume not a regular expression */
+ name->firstch = 1; /* assume first char is literal */
+ name->change_dir = change_dir;
+ name->dir_contents = 0;
+
+ if (string && is_pattern (string))
+ {
+ name->regexp = 1;
+ if (string[0] == '*' || string[0] == '[' || string[0] == '?')
+ name->firstch = 0;
+ }
+
+ if (namelast)
+ namelast->next = name;
+ namelast = name;
+ if (!namelist)
+ namelist = name;
+}
+
+/*------------------------------------------------------------------------.
+| Return true if and only if name PATH (from an archive) matches any name |
+| from the namelist. |
+`------------------------------------------------------------------------*/
+
+int
+name_match (const char *path)
+{
+ size_t length = strlen (path);
+
+ while (1)
+ {
+ struct name *cursor = namelist;
+
+ if (!cursor)
+ return ! files_from_option;
+
+ if (cursor->fake)
+ {
+ chdir_do (cursor->change_dir);
+ namelist = 0;
+ return ! files_from_option;
+ }
+
+ for (; cursor; cursor = cursor->next)
+ {
+ /* If first chars don't match, quick skip. */
+
+ if (cursor->firstch && cursor->name[0] != path[0])
+ continue;
+
+ if (cursor->regexp
+ ? fnmatch (cursor->name, path, FNM_LEADING_DIR) == 0
+ : (cursor->length <= length
+ && (path[cursor->length] == '\0'
+ || path[cursor->length] == '/')
+ && memcmp (path, cursor->name, cursor->length) == 0))
+ {
+ cursor->found = 1; /* remember it matched */
+ if (starting_file_option)
+ {
+ free (namelist);
+ namelist = 0;
+ }
+ chdir_do (cursor->change_dir);
+
+ /* We got a match. */
+ return 1;
+ }
+ }
+
+ /* Filename from archive not found in namelist. If we have the whole
+ namelist here, just return 0. Otherwise, read the next name in and
+ compare it. If this was the last name, namelist->found will remain
+ on. If not, we loop to compare the newly read name. */
+
+ if (same_order_option && namelist->found)
+ {
+ name_gather (); /* read one more */
+ if (namelist->found)
+ return 0;
+ }
+ else
+ return 0;
+ }
+}
+
+/*------------------------------------------------------------------.
+| Print the names of things in the namelist that were not matched. |
+`------------------------------------------------------------------*/
+
+void
+names_notfound (void)
+{
+ struct name *cursor;
+ struct name *next;
+
+ for (cursor = namelist; cursor; cursor = next)
+ {
+ next = cursor->next;
+ if (!cursor->found && !cursor->fake)
+ ERROR ((0, 0, _("%s: Not found in archive"),
+ quotearg_colon (cursor->name)));
+
+ /* We could free the list, but the process is about to die anyway, so
+ save some CPU time. Amigas and other similarly broken software
+ will need to waste the time, though. */
+
+#ifdef amiga
+ if (!same_order_option)
+ free (cursor);
#endif
+ }
+ namelist = 0;
+ namelast = 0;
+
+ if (same_order_option)
+ {
+ char *name;
+
+ while (name = name_next (1), name)
+ ERROR ((0, 0, _("%s: Not found in archive"),
+ quotearg_colon (name)));
+ }
+}
+\f
+/* Sorting name lists. */
+
+/* Sort linked LIST of names, of given LENGTH, using COMPARE to order
+ names. Return the sorted list. Apart from the type `struct name'
+ and the definition of SUCCESSOR, this is a generic list-sorting
+ function, but it's too painful to make it both generic and portable
+ in C. */
+
+static struct name *
+merge_sort (struct name *list, int length,
+ int (*compare) (struct name const*, struct name const*))
+{
+ struct name *first_list;
+ struct name *second_list;
+ int first_length;
+ int second_length;
+ struct name *result;
+ struct name **merge_point;
+ struct name *cursor;
+ int counter;
+
+# define SUCCESSOR(name) ((name)->next)
+
+ if (length == 1)
+ return list;
+
+ if (length == 2)
+ {
+ if ((*compare) (list, SUCCESSOR (list)) > 0)
+ {
+ result = SUCCESSOR (list);
+ SUCCESSOR (result) = list;
+ SUCCESSOR (list) = 0;
+ return result;
+ }
+ return list;
+ }
+
+ first_list = list;
+ first_length = (length + 1) / 2;
+ second_length = length / 2;
+ for (cursor = list, counter = first_length - 1;
+ counter;
+ cursor = SUCCESSOR (cursor), counter--)
+ continue;
+ second_list = SUCCESSOR (cursor);
+ SUCCESSOR (cursor) = 0;
+
+ first_list = merge_sort (first_list, first_length, compare);
+ second_list = merge_sort (second_list, second_length, compare);
+
+ merge_point = &result;
+ while (first_list && second_list)
+ if ((*compare) (first_list, second_list) < 0)
+ {
+ cursor = SUCCESSOR (first_list);
+ *merge_point = first_list;
+ merge_point = &SUCCESSOR (first_list);
+ first_list = cursor;
+ }
+ else
+ {
+ cursor = SUCCESSOR (second_list);
+ *merge_point = second_list;
+ merge_point = &SUCCESSOR (second_list);
+ second_list = cursor;
+ }
+ if (first_list)
+ *merge_point = first_list;
+ else
+ *merge_point = second_list;
+
+ return result;
+
+#undef SUCCESSOR
+}
+
+/* A comparison function for sorting names. Put found names last;
+ break ties by string comparison. */
+
+static int
+compare_names (struct name const *n1, struct name const *n2)
+{
+ int found_diff = n2->found - n1->found;
+ return found_diff ? found_diff : strcmp (n1->name, n2->name);
+}
+\f
+/* Add all the dirs in PATH, which is a directory, to the namelist.
+ If any of the files is a directory, recurse on the subdirectory.
+ CHANGE_DIR is the number of the directory that PATH is relative to.
+ DEVICE is the device not to leave, if the -l option is specified. */
+
+static void
+add_hierarchy_to_namelist (char *path, int change_dir, dev_t device)
+{
+ char *buffer = get_directory_contents (path, device);
+
+ {
+ struct name *name;
+
+ for (name = namelist; name; name = name->next)
+ if (strcmp (name->name, path) == 0)
+ break;
+ if (name)
+ name->dir_contents = buffer ? buffer : "\0\0\0\0";
+ }
+
+ if (buffer)
+ {
+ size_t name_length = strlen (path);
+ size_t allocated_length = (name_length >= NAME_FIELD_SIZE
+ ? name_length + NAME_FIELD_SIZE
+ : NAME_FIELD_SIZE);
+ char *name_buffer = xmalloc (allocated_length + 1);
+ /* FIXME: + 2 above? */
+ char *string;
+ size_t string_length;
+
+ strcpy (name_buffer, path);
+ if (name_buffer[name_length - 1] != '/')
+ {
+ name_buffer[name_length++] = '/';
+ name_buffer[name_length] = '\0';
+ }
+
+ for (string = buffer; *string; string += string_length + 1)
+ {
+ string_length = strlen (string);
+ if (*string == 'D')
+ {
+ if (name_length + string_length >= allocated_length)
+ {
+ while (name_length + string_length >= allocated_length)
+ allocated_length += NAME_FIELD_SIZE;
+ name_buffer = xrealloc (name_buffer, allocated_length + 1);
+ }
+ strcpy (name_buffer + name_length, string + 1);
+ addname (name_buffer, change_dir);
+ if (*string == 'D')
+ add_hierarchy_to_namelist (name_buffer, change_dir, device);
+ }
+ }
+
+ free (name_buffer);
+ }
+}
+\f
+/* Collect all the names from argv[] (or whatever), expand them into a
+ directory tree, and sort them. This gets only subdirectories, not
+ all files. */
+
+void
+collect_and_sort_names (void)
+{
+ struct name *name;
+ struct name *next_name;
+ int num_names;
+ struct stat statbuf;
+
+ name_gather ();
+
+ if (listed_incremental_option)
+ read_directory_file ();
+
+ if (!namelist)
+ addname (".", 0);
+
+ for (name = namelist; name; name = next_name)
+ {
+ next_name = name->next;
+ if (name->found || name->dir_contents)
+ continue;
+ if (name->regexp) /* FIXME: just skip regexps for now */
+ continue;
+ chdir_do (name->change_dir);
+ if (name->fake)
+ continue;
+
+ if (deref_stat (dereference_option, name->name, &statbuf) != 0)
+ {
+ stat_error (name->name);
+ continue;
+ }
+ if (S_ISDIR (statbuf.st_mode))
+ {
+ name->found = 1;
+ add_hierarchy_to_namelist (name->name, name->change_dir,
+ statbuf.st_dev);
+ }
+ }
+
+ num_names = 0;
+ for (name = namelist; name; name = name->next)
+ num_names++;
+ namelist = merge_sort (namelist, num_names, compare_names);
+
+ for (name = namelist; name; name = name->next)
+ name->found = 0;
+}
+
+/*-------------------------------------------------------------------------.
+| This is like name_match, except that it returns a pointer to the name it |
+| matched, and doesn't set FOUND in structure. The caller will have to do |
+| that if it wants to. Oh, and if the namelist is empty, it returns null, |
+| unlike name_match, which returns TRUE. |
+`-------------------------------------------------------------------------*/
+
+struct name *
+name_scan (const char *path)
+{
+ size_t length = strlen (path);
+
+ while (1)
+ {
+ struct name *cursor = namelist;
+
+ if (!cursor)
+ return 0;
+
+ for (; cursor; cursor = cursor->next)
+ {
+ /* If first chars don't match, quick skip. */
+
+ if (cursor->firstch && cursor->name[0] != path[0])
+ continue;
+
+ if (cursor->regexp
+ ? fnmatch (cursor->name, path, FNM_LEADING_DIR) == 0
+ : (cursor->length <= length
+ && (path[cursor->length] == '\0'
+ || path[cursor->length] == '/')
+ && memcmp (path, cursor->name, cursor->length) == 0))
+ return cursor; /* we got a match */
+ }
+
+ /* Filename from archive not found in namelist. If we have the whole
+ namelist here, just return 0. Otherwise, read the next name in and
+ compare it. If this was the last name, namelist->found will remain
+ on. If not, we loop to compare the newly read name. */
+
+ if (same_order_option && namelist->found)
+ {
+ name_gather (); /* read one more */
+ if (namelist->found)
+ return 0;
+ }
+ else
+ return 0;
+ }
+}
+
+/*-----------------------------------------------------------------------.
+| This returns a name from the namelist which doesn't have ->found set. |
+| It sets ->found before returning, so successive calls will find and |
+| return all the non-found names in the namelist |
+`-----------------------------------------------------------------------*/
+
+struct name *gnu_list_name;
+
+char *
+name_from_list (void)
+{
+ if (!gnu_list_name)
+ gnu_list_name = namelist;
+ while (gnu_list_name && (gnu_list_name->found | gnu_list_name->fake))
+ gnu_list_name = gnu_list_name->next;
+ if (gnu_list_name)
+ {
+ gnu_list_name->found = 1;
+ chdir_do (gnu_list_name->change_dir);
+ return gnu_list_name->name;
+ }
+ return 0;
+}
+
+/*---.
+| ? |
+`---*/
+
+void
+blank_name_list (void)
+{
+ struct name *name;
+
+ gnu_list_name = 0;
+ for (name = namelist; name; name = name->next)
+ name->found = 0;
+}
+
+/*---.
+| ? |
+`---*/
+
+char *
+new_name (const char *path, const char *name)
+{
+ char *buffer = xmalloc (strlen (path) + strlen (name) + 2);
+
+ sprintf (buffer, "%s/%s", path, name);
+ return buffer;
+}
+
+/* Return nonzero if file NAME is excluded. Exclude a name if its
+ prefix matches a pattern that contains slashes, or if one of its
+ components matches a pattern that contains no slashes. */
+int
+excluded_name (char const *name)
+{
+ char const *p;
+ name += FILESYSTEM_PREFIX_LEN (name);
+
+ if (excluded_filename (excluded_with_slash, name,
+ FNM_FILE_NAME | FNM_LEADING_DIR))
+ return 1;
+
+ for (p = name; *p; p++)
+ if (((p == name || ISSLASH (p[-1])) && !ISSLASH (p[0]))
+ && excluded_filename (excluded_without_slash, p,
+ FNM_FILE_NAME | FNM_LEADING_DIR))
+ return 1;
+
+ return 0;
+}
+\f
+/* Names to avoid dumping. */
+
+struct avoided_name
+{
+ struct avoided_name const *next;
+ char name[1];
+};
+
+static struct avoided_name *avoided_names;
+
+/* Remember to not archive NAME. */
+void
+add_avoided_name (char const *name)
+{
+ struct avoided_name *p = xmalloc (sizeof *p + strlen (name));
+ p->next = avoided_names;
+ avoided_names = p;
+ strcpy (p->name, name);
+}
+
+/* Should NAME be avoided when archiving? */
+int
+is_avoided_name (char const *name)
+{
+ struct avoided_name const *p;
+ for (p = avoided_names; p; p = p->next)
+ if (strcmp (p->name, name) == 0)
+ return 1;
+ return 0;
+}
projects / chaz / tar / blobdiff