ar.c

   1 /* Interface to `ar' archives for GNU Make.
   2 Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1997,
   3 2002 Free Software Foundation, Inc.
   4 This file is part of GNU Make.
   5
   6 GNU Make is free software; you can redistribute it and/or modify
   7 it under the terms of the GNU General Public License as published by
   8 the Free Software Foundation; either version 2, or (at your option)
   9 any later version.
  10
  11 GNU Make is distributed in the hope that it will be useful,
  12 but WITHOUT ANY WARRANTY; without even the implied warranty of
  13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14 GNU General Public License for more details.
  15
  16 You should have received a copy of the GNU General Public License
  17 along with GNU Make; see the file COPYING.  If not, write to
  18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19 Boston, MA 02111-1307, USA.  */
  20
  21 #include "make.h"
  22
  23 #ifndef NO_ARCHIVES
  24
  25 #include "filedef.h"
  26 #include "dep.h"
  27 #include <fnmatch.h>
  28
  29 /* Defined in arscan.c.  */
  30 extern long int ar_scan PARAMS ((char *archive, long int (*function) (), long int arg));
  31 extern int ar_name_equal PARAMS ((char *name, char *mem, int truncated));
  32 #ifndef VMS
  33 extern int ar_member_touch PARAMS ((char *arname, char *memname));
  34 #endif
  35
  36 /* Return nonzero if NAME is an archive-member reference, zero if not.
  37    An archive-member reference is a name like `lib(member)'.
  38    If a name like `lib((entry))' is used, a fatal error is signaled at
  39    the attempt to use this unsupported feature.  */
  40
  41 int
  42 ar_name (char *name)
  43 {
  44   char *p = strchr (name, '(');
  45   char *end;
  46
  47   if (p == 0 || p == name)
  48     return 0;
  49
  50   end = p + strlen (p) - 1;
  51   if (*end != ')')
  52     return 0;
  53
  54   if (p[1] == '(' && end[-1] == ')')
  55     fatal (NILF, _("attempt to use unsupported feature: `%s'"), name);
  56
  57   return 1;
  58 }
  59
  60
  61 /* Parse the archive-member reference NAME into the archive and member names.
  62    Put the malloc'd archive name in *ARNAME_P if ARNAME_P is non-nil;
  63    put the malloc'd member name in *MEMNAME_P if MEMNAME_P is non-nil.  */
  64
  65 void
  66 ar_parse_name (char *name, char **arname_p, char **memname_p)
  67 {
  68   char *p = strchr (name, '('), *end = name + strlen (name) - 1;
  69
  70   if (arname_p != 0)
  71     *arname_p = savestring (name, p - name);
  72
  73   if (memname_p != 0)
  74     *memname_p = savestring (p + 1, end - (p + 1));
  75 }
  76 \f
  77 static long int ar_member_date_1 PARAMS ((int desc, char *mem, int truncated, long int hdrpos,
  78         long int datapos, long int size, long int date, int uid, int gid, int mode, char *name));
  79
  80 /* Return the modtime of NAME.  */
  81
  82 time_t
  83 ar_member_date (char *name)
  84 {
  85   char *arname;
  86   int arname_used = 0;
  87   char *memname;
  88   long int val;
  89
  90   ar_parse_name (name, &arname, &memname);
  91
  92   /* Make sure we know the modtime of the archive itself because we are
  93      likely to be called just before commands to remake a member are run,
  94      and they will change the archive itself.
  95
  96      But we must be careful not to enter_file the archive itself if it does
  97      not exist, because pattern_search assumes that files found in the data
  98      base exist or can be made.  */
  99   {
 100     struct file *arfile;
 101     arfile = lookup_file (arname);
 102     if (arfile == 0 && file_exists_p (arname))
 103       {
 104         arfile = enter_file (arname);
 105         arname_used = 1;
 106       }
 107
 108     if (arfile != 0)
 109       (void) f_mtime (arfile, 0);
 110   }
 111
 112   val = ar_scan (arname, ar_member_date_1, (long int) memname);
 113
 114   if (!arname_used)
 115     free (arname);
 116   free (memname);
 117
 118   return (val <= 0 ? (time_t) -1 : (time_t) val);
 119 }
 120
 121 /* This function is called by `ar_scan' to find which member to look at.  */
 122
 123 /* ARGSUSED */
 124 static long int
 125 ar_member_date_1 (int desc, char *mem, int truncated,
 126                   long int hdrpos, long int datapos, long int size,
 127                   long int date, int uid, int gid, int mode, char *name)
 128 {
 129   return ar_name_equal (name, mem, truncated) ? date : 0;
 130 }
 131 \f
 132 /* Set the archive-member NAME's modtime to now.  */
 133
 134 #ifdef VMS
 135 int
 136 ar_touch (char *name)
 137 {
 138   error (NILF, _("touch archive member is not available on VMS"));
 139   return -1;
 140 }
 141 #else
 142 int
 143 ar_touch (char *name)
 144 {
 145   char *arname, *memname;
 146   int arname_used = 0;
 147   register int val;
 148
 149   ar_parse_name (name, &arname, &memname);
 150
 151   /* Make sure we know the modtime of the archive itself before we
 152      touch the member, since this will change the archive itself.  */
 153   {
 154     struct file *arfile;
 155     arfile = lookup_file (arname);
 156     if (arfile == 0)
 157       {
 158         arfile = enter_file (arname);
 159         arname_used = 1;
 160       }
 161
 162     (void) f_mtime (arfile, 0);
 163   }
 164
 165   val = 1;
 166   switch (ar_member_touch (arname, memname))
 167     {
 168     case -1:
 169       error (NILF, _("touch: Archive `%s' does not exist"), arname);
 170       break;
 171     case -2:
 172       error (NILF, _("touch: `%s' is not a valid archive"), arname);
 173       break;
 174     case -3:
 175       perror_with_name ("touch: ", arname);
 176       break;
 177     case 1:
 178       error (NILF,
 179              _("touch: Member `%s' does not exist in `%s'"), memname, arname);
 180       break;
 181     case 0:
 182       val = 0;
 183       break;
 184     default:
 185       error (NILF,
 186              _("touch: Bad return code from ar_member_touch on `%s'"), name);
 187     }
 188
 189   if (!arname_used)
 190     free (arname);
 191   free (memname);
 192
 193   return val;
 194 }
 195 #endif /* !VMS */
 196 \f
 197 /* State of an `ar_glob' run, passed to `ar_glob_match'.  */
 198
 199 struct ar_glob_state
 200   {
 201     char *arname;
 202     char *pattern;
 203     unsigned int size;
 204     struct nameseq *chain;
 205     unsigned int n;
 206   };
 207
 208 /* This function is called by `ar_scan' to match one archive
 209    element against the pattern in STATE.  */
 210
 211 static long int
 212 ar_glob_match (int desc, char *mem, int truncated,
 213                long int hdrpos, long int datapos, long int size,
 214                long int date, int uid, int gid, int mode,
 215                struct ar_glob_state *state)
 216 {
 217   if (fnmatch (state->pattern, mem, FNM_PATHNAME|FNM_PERIOD) == 0)
 218     {
 219       /* We have a match.  Add it to the chain.  */
 220       struct nameseq *new = (struct nameseq *) xmalloc (state->size);
 221       new->name = concat (state->arname, mem, ")");
 222       new->next = state->chain;
 223       state->chain = new;
 224       ++state->n;
 225     }
 226
 227   return 0L;
 228 }
 229
 230 /* Return nonzero if PATTERN contains any metacharacters.
 231    Metacharacters can be quoted with backslashes if QUOTE is nonzero.  */
 232 static int
 233 glob_pattern_p (const char *pattern, int quote)
 234 {
 235   const char *p;
 236   int open = 0;
 237
 238   for (p = pattern; *p != '\0'; ++p)
 239     switch (*p)
 240       {
 241       case '?':
 242       case '*':
 243         return 1;
 244
 245       case '\\':
 246         if (quote)
 247           ++p;
 248         break;
 249
 250       case '[':
 251         open = 1;
 252         break;
 253
 254       case ']':
 255         if (open)
 256           return 1;
 257         break;
 258       }
 259
 260   return 0;
 261 }
 262
 263 /* Glob for MEMBER_PATTERN in archive ARNAME.
 264    Return a malloc'd chain of matching elements (or nil if none).  */
 265
 266 struct nameseq *
 267 ar_glob (char *arname, char *member_pattern, unsigned int size)
 268 {
 269   struct ar_glob_state state;
 270   char **names;
 271   struct nameseq *n;
 272   unsigned int i;
 273
 274   if (! glob_pattern_p (member_pattern, 1))
 275     return 0;
 276
 277   /* Scan the archive for matches.
 278      ar_glob_match will accumulate them in STATE.chain.  */
 279   i = strlen (arname);
 280   state.arname = (char *) alloca (i + 2);
 281   bcopy (arname, state.arname, i);
 282   state.arname[i] = '(';
 283   state.arname[i + 1] = '\0';
 284   state.pattern = member_pattern;
 285   state.size = size;
 286   state.chain = 0;
 287   state.n = 0;
 288   (void) ar_scan (arname, ar_glob_match, (long int) &state);
 289
 290   if (state.chain == 0)
 291     return 0;
 292
 293   /* Now put the names into a vector for sorting.  */
 294   names = (char **) alloca (state.n * sizeof (char *));
 295   i = 0;
 296   for (n = state.chain; n != 0; n = n->next)
 297     names[i++] = n->name;
 298
 299   /* Sort them alphabetically.  */
 300   qsort ((char *) names, i, sizeof (*names), alpha_compare);
 301
 302   /* Put them back into the chain in the sorted order.  */
 303   i = 0;
 304   for (n = state.chain; n != 0; n = n->next)
 305     n->name = names[i++];
 306
 307   return state.chain;
 308 }
 309
 310 #endif  /* Not NO_ARCHIVES.  */