mirror of
https://github.com/mirror/make.git
synced 2024-12-28 22:00:33 +08:00
3f60c36245
* read.c (conditional_line): Strip ws in `ifeq (a , b)' so it is the same as `ifeq (a, b)'.
2208 lines
57 KiB
C
2208 lines
57 KiB
C
/* Reading and parsing of makefiles for GNU Make.
|
||
Copyright (C) 1988,89,90,91,92,93,94,95,96 Free Software Foundation, Inc.
|
||
This file is part of GNU Make.
|
||
|
||
GNU Make 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 Make 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 Make; see the file COPYING. If not, write to
|
||
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
|
||
|
||
#include "make.h"
|
||
#include "dep.h"
|
||
#include "filedef.h"
|
||
#include "job.h"
|
||
#include "commands.h"
|
||
#include "variable.h"
|
||
|
||
/* This is POSIX.2, but most systems using -DPOSIX probably don't have it. */
|
||
#ifdef HAVE_GLOB_H
|
||
#include <glob.h>
|
||
#else
|
||
#include "glob/glob.h"
|
||
#endif
|
||
|
||
#ifndef WIN32
|
||
#ifndef _AMIGA
|
||
#ifndef VMS
|
||
#include <pwd.h>
|
||
#else
|
||
struct passwd *getpwnam PARAMS ((char *name));
|
||
#endif
|
||
#endif
|
||
#endif /* !WIN32 */
|
||
|
||
/* A `struct linebuffer' is a structure which holds a line of text.
|
||
`readline' reads a line from a stream into a linebuffer
|
||
and works regardless of the length of the line. */
|
||
|
||
struct linebuffer
|
||
{
|
||
/* Note: This is the number of bytes malloc'ed for `buffer'
|
||
It does not indicate `buffer's real length.
|
||
Instead, a null char indicates end-of-string. */
|
||
unsigned int size;
|
||
char *buffer;
|
||
};
|
||
|
||
#define initbuffer(lb) (lb)->buffer = (char *) xmalloc ((lb)->size = 200)
|
||
#define freebuffer(lb) free ((lb)->buffer)
|
||
|
||
|
||
/* A `struct conditionals' contains the information describing
|
||
all the active conditionals in a makefile.
|
||
|
||
The global variable `conditionals' contains the conditionals
|
||
information for the current makefile. It is initialized from
|
||
the static structure `toplevel_conditionals' and is later changed
|
||
to new structures for included makefiles. */
|
||
|
||
struct conditionals
|
||
{
|
||
unsigned int if_cmds; /* Depth of conditional nesting. */
|
||
unsigned int allocated; /* Elts allocated in following arrays. */
|
||
char *ignoring; /* Are we ignoring or interepreting? */
|
||
char *seen_else; /* Have we already seen an `else'? */
|
||
};
|
||
|
||
static struct conditionals toplevel_conditionals;
|
||
static struct conditionals *conditionals = &toplevel_conditionals;
|
||
|
||
|
||
/* Default directories to search for include files in */
|
||
|
||
static char *default_include_directories[] =
|
||
{
|
||
#if defined(WIN32) && !defined(INCLUDEDIR)
|
||
/*
|
||
* This completly up to the user when they install MSVC or other packages.
|
||
* This is defined as a placeholder.
|
||
*/
|
||
#define INCLUDEDIR "."
|
||
#endif
|
||
INCLUDEDIR,
|
||
#ifndef _AMIGA
|
||
"/usr/gnu/include",
|
||
"/usr/local/include",
|
||
"/usr/include",
|
||
#endif
|
||
0
|
||
};
|
||
|
||
/* List of directories to search for include files in */
|
||
|
||
static char **include_directories;
|
||
|
||
/* Maximum length of an element of the above. */
|
||
|
||
static unsigned int max_incl_len;
|
||
|
||
/* The filename and pointer to line number of the
|
||
makefile currently being read in. */
|
||
|
||
char *reading_filename;
|
||
unsigned int *reading_lineno_ptr;
|
||
|
||
/* The chain of makefiles read by read_makefile. */
|
||
|
||
static struct dep *read_makefiles = 0;
|
||
|
||
static int read_makefile PARAMS ((char *filename, int flags));
|
||
static unsigned int readline PARAMS ((struct linebuffer *linebuffer, FILE *stream,
|
||
char *filename, unsigned int lineno));
|
||
static unsigned int do_define PARAMS ((char *name, unsigned int namelen, enum variable_origin origin,
|
||
unsigned int lineno, FILE *infile, char *filename));
|
||
static int conditional_line PARAMS ((char *line, char *filename, unsigned int lineno));
|
||
static void record_files PARAMS ((struct nameseq *filenames, char *pattern, char *pattern_percent,
|
||
struct dep *deps, unsigned int commands_started, char *commands,
|
||
unsigned int commands_idx, int two_colon, char *filename,
|
||
unsigned int lineno, int set_default));
|
||
|
||
/* Read in all the makefiles and return the chain of their names. */
|
||
|
||
struct dep *
|
||
read_all_makefiles (makefiles)
|
||
char **makefiles;
|
||
{
|
||
unsigned int num_makefiles = 0;
|
||
|
||
if (debug_flag)
|
||
puts ("Reading makefiles...");
|
||
|
||
/* If there's a non-null variable MAKEFILES, its value is a list of
|
||
files to read first thing. But don't let it prevent reading the
|
||
default makefiles and don't let the default goal come from there. */
|
||
|
||
{
|
||
char *value;
|
||
char *name, *p;
|
||
unsigned int length;
|
||
|
||
{
|
||
/* Turn off --warn-undefined-variables while we expand MAKEFILES. */
|
||
int save = warn_undefined_variables_flag;
|
||
warn_undefined_variables_flag = 0;
|
||
|
||
value = allocated_variable_expand ("$(MAKEFILES)");
|
||
|
||
warn_undefined_variables_flag = save;
|
||
}
|
||
|
||
/* Set NAME to the start of next token and LENGTH to its length.
|
||
MAKEFILES is updated for finding remaining tokens. */
|
||
p = value;
|
||
|
||
while ((name = find_next_token (&p, &length)) != 0)
|
||
{
|
||
if (*p != '\0')
|
||
*p++ = '\0';
|
||
(void) read_makefile (name,
|
||
RM_NO_DEFAULT_GOAL | RM_INCLUDED | RM_DONTCARE);
|
||
}
|
||
|
||
free (value);
|
||
}
|
||
|
||
/* Read makefiles specified with -f switches. */
|
||
|
||
if (makefiles != 0)
|
||
while (*makefiles != 0)
|
||
{
|
||
struct dep *tail = read_makefiles;
|
||
register struct dep *d;
|
||
|
||
if (! read_makefile (*makefiles, 0))
|
||
perror_with_name ("", *makefiles);
|
||
|
||
/* Find the right element of read_makefiles. */
|
||
d = read_makefiles;
|
||
while (d->next != tail)
|
||
d = d->next;
|
||
|
||
/* Use the storage read_makefile allocates. */
|
||
*makefiles = dep_name (d);
|
||
++num_makefiles;
|
||
++makefiles;
|
||
}
|
||
|
||
/* If there were no -f switches, try the default names. */
|
||
|
||
if (num_makefiles == 0)
|
||
{
|
||
static char *default_makefiles[] =
|
||
#ifdef VMS
|
||
/* all lower case since readdir() (the vms version) 'lowercasifies' */
|
||
{ "makefile.vms", "gnumakefile", "makefile", 0 };
|
||
#else
|
||
#ifdef _AMIGA
|
||
{ "GNUmakefile", "Makefile", "SMakefile", 0 };
|
||
#else /* !Amiga && !VMS */
|
||
{ "GNUmakefile", "makefile", "Makefile", 0 };
|
||
#endif /* AMIGA */
|
||
#endif /* VMS */
|
||
register char **p = default_makefiles;
|
||
while (*p != 0 && !file_exists_p (*p))
|
||
++p;
|
||
|
||
if (*p != 0)
|
||
{
|
||
if (! read_makefile (*p, 0))
|
||
perror_with_name ("", *p);
|
||
}
|
||
else
|
||
{
|
||
/* No default makefile was found. Add the default makefiles to the
|
||
`read_makefiles' chain so they will be updated if possible. */
|
||
struct dep *tail = read_makefiles;
|
||
/* Add them to the tail, after any MAKEFILES variable makefiles. */
|
||
while (tail != 0 && tail->next != 0)
|
||
tail = tail->next;
|
||
for (p = default_makefiles; *p != 0; ++p)
|
||
{
|
||
struct dep *d = (struct dep *) xmalloc (sizeof (struct dep));
|
||
d->name = 0;
|
||
d->file = enter_file (*p);
|
||
d->file->dontcare = 1;
|
||
/* Tell update_goal_chain to bail out as soon as this file is
|
||
made, and main not to die if we can't make this file. */
|
||
d->changed = RM_DONTCARE;
|
||
if (tail == 0)
|
||
read_makefiles = d;
|
||
else
|
||
tail->next = d;
|
||
tail = d;
|
||
}
|
||
if (tail != 0)
|
||
tail->next = 0;
|
||
}
|
||
}
|
||
|
||
return read_makefiles;
|
||
}
|
||
|
||
/* Read file FILENAME as a makefile and add its contents to the data base.
|
||
|
||
FLAGS contains bits as above.
|
||
|
||
FILENAME is added to the `read_makefiles' chain.
|
||
|
||
Returns 1 if a file was found and read, 0 if not. */
|
||
|
||
static int
|
||
read_makefile (filename, flags)
|
||
char *filename;
|
||
int flags;
|
||
{
|
||
static char *collapsed = 0;
|
||
static unsigned int collapsed_length = 0;
|
||
register FILE *infile;
|
||
struct linebuffer lb;
|
||
unsigned int commands_len = 200;
|
||
char *commands = (char *) xmalloc (200);
|
||
unsigned int commands_idx = 0;
|
||
unsigned int commands_started;
|
||
register char *p;
|
||
char *p2;
|
||
int ignoring = 0, in_ignored_define = 0;
|
||
int no_targets = 0; /* Set when reading a rule without targets. */
|
||
char *passed_filename = filename;
|
||
|
||
struct nameseq *filenames = 0;
|
||
struct dep *deps;
|
||
unsigned int lineno = 1;
|
||
unsigned int nlines = 0;
|
||
int two_colon;
|
||
char *pattern = 0, *pattern_percent;
|
||
|
||
int makefile_errno;
|
||
#ifdef WIN32
|
||
int check_again;
|
||
#endif
|
||
|
||
#define record_waiting_files() \
|
||
do \
|
||
{ \
|
||
if (filenames != 0) \
|
||
record_files (filenames, pattern, pattern_percent, deps, \
|
||
commands_started, commands, commands_idx, \
|
||
two_colon, filename, lineno, \
|
||
!(flags & RM_NO_DEFAULT_GOAL)); \
|
||
filenames = 0; \
|
||
commands_idx = 0; \
|
||
pattern = 0; \
|
||
} while (0)
|
||
|
||
#ifdef lint /* Suppress `used before set' messages. */
|
||
two_colon = 0;
|
||
pattern_percent = 0;
|
||
#endif
|
||
|
||
if (debug_flag)
|
||
{
|
||
printf ("Reading makefile `%s'", filename);
|
||
if (flags & RM_NO_DEFAULT_GOAL)
|
||
printf (" (no default goal)");
|
||
if (flags & RM_INCLUDED)
|
||
printf (" (search path)");
|
||
if (flags & RM_DONTCARE)
|
||
printf (" (don't care)");
|
||
if (flags & RM_NO_TILDE)
|
||
printf (" (no ~ expansion)");
|
||
puts ("...");
|
||
}
|
||
|
||
/* First, get a stream to read. */
|
||
|
||
/* Expand ~ in FILENAME unless it came from `include',
|
||
in which case it was already done. */
|
||
if (!(flags & RM_NO_TILDE) && filename[0] == '~')
|
||
{
|
||
char *expanded = tilde_expand (filename);
|
||
if (expanded != 0)
|
||
filename = expanded;
|
||
}
|
||
|
||
infile = fopen (filename, "r");
|
||
/* Save the error code so we print the right message later. */
|
||
makefile_errno = errno;
|
||
|
||
/* If the makefile wasn't found and it's either a makefile from
|
||
the `MAKEFILES' variable or an included makefile,
|
||
search the included makefile search path for this makefile. */
|
||
if (infile == 0 && (flags & RM_INCLUDED) && *filename != '/')
|
||
{
|
||
register unsigned int i;
|
||
for (i = 0; include_directories[i] != 0; ++i)
|
||
{
|
||
char *name = concat (include_directories[i], "/", filename);
|
||
infile = fopen (name, "r");
|
||
if (infile == 0)
|
||
free (name);
|
||
else
|
||
{
|
||
filename = name;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Add FILENAME to the chain of read makefiles. */
|
||
deps = (struct dep *) xmalloc (sizeof (struct dep));
|
||
deps->next = read_makefiles;
|
||
read_makefiles = deps;
|
||
deps->name = 0;
|
||
deps->file = lookup_file (filename);
|
||
if (deps->file == 0)
|
||
{
|
||
deps->file = enter_file (savestring (filename, strlen (filename)));
|
||
if (flags & RM_DONTCARE)
|
||
deps->file->dontcare = 1;
|
||
}
|
||
if (filename != passed_filename)
|
||
free (filename);
|
||
filename = deps->file->name;
|
||
deps->changed = flags;
|
||
deps = 0;
|
||
|
||
/* If the makefile can't be found at all, give up entirely. */
|
||
|
||
if (infile == 0)
|
||
{
|
||
/* If we did some searching, errno has the error from the last
|
||
attempt, rather from FILENAME itself. Restore it in case the
|
||
caller wants to use it in a message. */
|
||
errno = makefile_errno;
|
||
return 0;
|
||
}
|
||
|
||
reading_filename = filename;
|
||
reading_lineno_ptr = &lineno;
|
||
|
||
/* Loop over lines in the file.
|
||
The strategy is to accumulate target names in FILENAMES, dependencies
|
||
in DEPS and commands in COMMANDS. These are used to define a rule
|
||
when the start of the next rule (or eof) is encountered. */
|
||
|
||
initbuffer (&lb);
|
||
|
||
while (!feof (infile))
|
||
{
|
||
lineno += nlines;
|
||
nlines = readline (&lb, infile, filename, lineno);
|
||
|
||
/* Check for a shell command line first.
|
||
If it is not one, we can stop treating tab specially. */
|
||
if (lb.buffer[0] == '\t')
|
||
{
|
||
/* This line is a probably shell command. */
|
||
unsigned int len;
|
||
|
||
if (no_targets)
|
||
/* Ignore the commands in a rule with no targets. */
|
||
continue;
|
||
|
||
/* If there is no preceding rule line, don't treat this line
|
||
as a command, even though it begins with a tab character.
|
||
SunOS 4 make appears to behave this way. */
|
||
|
||
if (filenames != 0)
|
||
{
|
||
if (ignoring)
|
||
/* Yep, this is a shell command, and we don't care. */
|
||
continue;
|
||
|
||
/* Append this command line to the line being accumulated. */
|
||
p = lb.buffer;
|
||
if (commands_idx == 0)
|
||
commands_started = lineno;
|
||
len = strlen (p);
|
||
if (len + 1 + commands_idx > commands_len)
|
||
{
|
||
commands_len = (len + 1 + commands_idx) * 2;
|
||
commands = (char *) xrealloc (commands, commands_len);
|
||
}
|
||
bcopy (p, &commands[commands_idx], len);
|
||
commands_idx += len;
|
||
commands[commands_idx++] = '\n';
|
||
|
||
continue;
|
||
}
|
||
}
|
||
|
||
/* This line is not a shell command line. Don't worry about tabs. */
|
||
|
||
if (collapsed_length < lb.size)
|
||
{
|
||
collapsed_length = lb.size;
|
||
if (collapsed != 0)
|
||
free (collapsed);
|
||
collapsed = (char *) xmalloc (collapsed_length);
|
||
}
|
||
strcpy (collapsed, lb.buffer);
|
||
/* Collapse continuation lines. */
|
||
collapse_continuations (collapsed);
|
||
remove_comments (collapsed);
|
||
|
||
/* strncmp is first to avoid dereferencing out into space. */
|
||
#define word1eq(s, l) (!strncmp (s, p, l) \
|
||
&& (p[l] == '\0' || isblank (p[l])))
|
||
p = collapsed;
|
||
while (isspace (*p))
|
||
++p;
|
||
if (*p == '\0')
|
||
/* This line is completely empty. */
|
||
continue;
|
||
|
||
/* We must first check for conditional and `define' directives before
|
||
ignoring anything, since they control what we will do with
|
||
following lines. */
|
||
|
||
if (!in_ignored_define
|
||
&& (word1eq ("ifdef", 5) || word1eq ("ifndef", 6)
|
||
|| word1eq ("ifeq", 4) || word1eq ("ifneq", 5)
|
||
|| word1eq ("else", 4) || word1eq ("endif", 5)))
|
||
{
|
||
int i = conditional_line (p, filename, lineno);
|
||
if (i >= 0)
|
||
ignoring = i;
|
||
else
|
||
makefile_fatal (filename, lineno,
|
||
"invalid syntax in conditional");
|
||
continue;
|
||
}
|
||
else if (word1eq ("endef", 5))
|
||
{
|
||
if (in_ignored_define)
|
||
in_ignored_define = 0;
|
||
else
|
||
makefile_fatal (filename, lineno, "extraneous `endef'");
|
||
continue;
|
||
}
|
||
else if (word1eq ("define", 6))
|
||
{
|
||
if (ignoring)
|
||
in_ignored_define = 1;
|
||
else
|
||
{
|
||
p2 = next_token (p + 6);
|
||
/* Let the variable name be the whole rest of the line,
|
||
with trailing blanks stripped (comments have already been
|
||
removed), so it could be a complex variable/function
|
||
reference that might contain blanks. */
|
||
p = index (p2, '\0');
|
||
while (isblank (p[-1]))
|
||
--p;
|
||
lineno = do_define (p2, p - p2, o_file,
|
||
lineno, infile, filename);
|
||
}
|
||
continue;
|
||
}
|
||
else if (word1eq ("override", 8))
|
||
{
|
||
p2 = next_token (p + 8);
|
||
if (p2 == 0)
|
||
makefile_error (filename, lineno, "empty `override' directive");
|
||
if (!strncmp (p2, "define", 6) && (isblank (p2[6]) || p2[6] == '\0'))
|
||
{
|
||
if (ignoring)
|
||
in_ignored_define = 1;
|
||
else
|
||
{
|
||
p2 = next_token (p2 + 6);
|
||
/* Let the variable name be the whole rest of the line,
|
||
with trailing blanks stripped (comments have already been
|
||
removed), so it could be a complex variable/function
|
||
reference that might contain blanks. */
|
||
p = index (p2, '\0');
|
||
while (isblank (p[-1]))
|
||
--p;
|
||
lineno = do_define (p2, p - p2, o_override,
|
||
lineno, infile, filename);
|
||
}
|
||
}
|
||
else if (!ignoring
|
||
&& !try_variable_definition (filename, lineno,
|
||
p2, o_override))
|
||
makefile_error (filename, lineno, "empty `override' directive");
|
||
|
||
continue;
|
||
}
|
||
|
||
if (ignoring)
|
||
/* Ignore the line. We continue here so conditionals
|
||
can appear in the middle of a rule. */
|
||
continue;
|
||
else if (word1eq ("export", 6))
|
||
{
|
||
struct variable *v;
|
||
p2 = next_token (p + 6);
|
||
if (*p2 == '\0')
|
||
export_all_variables = 1;
|
||
v = try_variable_definition (filename, lineno, p2, o_file);
|
||
if (v != 0)
|
||
v->export = v_export;
|
||
else
|
||
{
|
||
unsigned int len;
|
||
for (p = find_next_token (&p2, &len); p != 0;
|
||
p = find_next_token (&p2, &len))
|
||
{
|
||
v = lookup_variable (p, len);
|
||
if (v == 0)
|
||
v = define_variable (p, len, "", o_file, 0);
|
||
v->export = v_export;
|
||
}
|
||
}
|
||
}
|
||
else if (word1eq ("unexport", 8))
|
||
{
|
||
unsigned int len;
|
||
struct variable *v;
|
||
p2 = next_token (p + 8);
|
||
if (*p2 == '\0')
|
||
export_all_variables = 0;
|
||
for (p = find_next_token (&p2, &len); p != 0;
|
||
p = find_next_token (&p2, &len))
|
||
{
|
||
v = lookup_variable (p, len);
|
||
if (v == 0)
|
||
v = define_variable (p, len, "", o_file, 0);
|
||
v->export = v_noexport;
|
||
}
|
||
}
|
||
else if (word1eq ("include", 7) || word1eq ("-include", 8)
|
||
|| word1eq ("sinclude", 8))
|
||
{
|
||
/* We have found an `include' line specifying a nested
|
||
makefile to be read at this point. */
|
||
struct conditionals *save, new_conditionals;
|
||
struct nameseq *files;
|
||
/* "-include" (vs "include") says no error if the file does not
|
||
exist. "sinclude" is an alias for this from SGI. */
|
||
int noerror = p[0] != 'i';
|
||
|
||
p = allocated_variable_expand (next_token (p + (noerror ? 9 : 8)));
|
||
if (*p == '\0')
|
||
{
|
||
makefile_error (filename, lineno,
|
||
"no file name for `%sinclude'",
|
||
noerror ? "-" : "");
|
||
continue;
|
||
}
|
||
|
||
/* Parse the list of file names. */
|
||
p2 = p;
|
||
files = multi_glob (parse_file_seq (&p2, '\0',
|
||
sizeof (struct nameseq),
|
||
1),
|
||
sizeof (struct nameseq));
|
||
free (p);
|
||
|
||
/* Save the state of conditionals and start
|
||
the included makefile with a clean slate. */
|
||
save = conditionals;
|
||
bzero ((char *) &new_conditionals, sizeof new_conditionals);
|
||
conditionals = &new_conditionals;
|
||
|
||
/* Record the rules that are waiting so they will determine
|
||
the default goal before those in the included makefile. */
|
||
record_waiting_files ();
|
||
|
||
/* Read each included makefile. */
|
||
while (files != 0)
|
||
{
|
||
struct nameseq *next = files->next;
|
||
char *name = files->name;
|
||
free ((char *)files);
|
||
files = next;
|
||
|
||
if (! read_makefile (name, (RM_INCLUDED | RM_NO_TILDE
|
||
| (noerror ? RM_DONTCARE : 0)))
|
||
&& ! noerror)
|
||
makefile_error (filename, lineno,
|
||
"%s: %s", name, strerror (errno));
|
||
}
|
||
|
||
/* Free any space allocated by conditional_line. */
|
||
if (conditionals->ignoring)
|
||
free (conditionals->ignoring);
|
||
if (conditionals->seen_else)
|
||
free (conditionals->seen_else);
|
||
|
||
/* Restore state. */
|
||
conditionals = save;
|
||
reading_filename = filename;
|
||
reading_lineno_ptr = &lineno;
|
||
}
|
||
else if (word1eq ("vpath", 5))
|
||
{
|
||
char *pattern;
|
||
unsigned int len;
|
||
p2 = variable_expand (p + 5);
|
||
p = find_next_token (&p2, &len);
|
||
if (p != 0)
|
||
{
|
||
pattern = savestring (p, len);
|
||
p = find_next_token (&p2, &len);
|
||
/* No searchpath means remove all previous
|
||
selective VPATH's with the same pattern. */
|
||
}
|
||
else
|
||
/* No pattern means remove all previous selective VPATH's. */
|
||
pattern = 0;
|
||
construct_vpath_list (pattern, p);
|
||
if (pattern != 0)
|
||
free (pattern);
|
||
}
|
||
#undef word1eq
|
||
else if (try_variable_definition (filename, lineno, p, o_file))
|
||
/* This line has been dealt with. */
|
||
;
|
||
else if (lb.buffer[0] == '\t')
|
||
{
|
||
p = collapsed; /* Ignore comments. */
|
||
while (isblank (*p))
|
||
++p;
|
||
if (*p == '\0')
|
||
/* The line is completely blank; that is harmless. */
|
||
continue;
|
||
/* This line starts with a tab but was not caught above
|
||
because there was no preceding target, and the line
|
||
might have been usable as a variable definition.
|
||
But now it is definitely lossage. */
|
||
makefile_fatal (filename, lineno,
|
||
"commands commence before first target");
|
||
}
|
||
else
|
||
{
|
||
/* This line describes some target files. */
|
||
|
||
char *cmdleft;
|
||
|
||
/* Record the previous rule. */
|
||
|
||
record_waiting_files ();
|
||
|
||
/* Search the line for an unquoted ; that is not after an
|
||
unquoted #. */
|
||
cmdleft = find_char_unquote (lb.buffer, ";#", 0);
|
||
if (cmdleft != 0 && *cmdleft == '#')
|
||
{
|
||
/* We found a comment before a semicolon. */
|
||
*cmdleft = '\0';
|
||
cmdleft = 0;
|
||
}
|
||
else if (cmdleft != 0)
|
||
/* Found one. Cut the line short there before expanding it. */
|
||
*cmdleft = '\0';
|
||
|
||
collapse_continuations (lb.buffer);
|
||
|
||
/* Expand variable and function references before doing anything
|
||
else so that special characters can be inside variables. */
|
||
p = variable_expand (lb.buffer);
|
||
|
||
if (cmdleft == 0)
|
||
/* Look for a semicolon in the expanded line. */
|
||
cmdleft = find_char_unquote (p, ";", 0);
|
||
|
||
if (cmdleft != 0)
|
||
/* Cut the line short at the semicolon. */
|
||
*cmdleft = '\0';
|
||
|
||
p2 = next_token (p);
|
||
if (*p2 == '\0')
|
||
{
|
||
if (cmdleft != 0)
|
||
makefile_fatal (filename, lineno,
|
||
"missing rule before commands");
|
||
else
|
||
/* This line contained a variable reference that
|
||
expanded to nothing but whitespace. */
|
||
continue;
|
||
}
|
||
else if (*p2 == ':')
|
||
{
|
||
/* We accept and ignore rules without targets for
|
||
compatibility with SunOS 4 make. */
|
||
no_targets = 1;
|
||
continue;
|
||
}
|
||
|
||
filenames = multi_glob (parse_file_seq (&p2, ':',
|
||
sizeof (struct nameseq),
|
||
1),
|
||
sizeof (struct nameseq));
|
||
if (*p2++ == '\0')
|
||
makefile_fatal (filename, lineno, "missing separator");
|
||
/* Is this a one-colon or two-colon entry? */
|
||
two_colon = *p2 == ':';
|
||
if (two_colon)
|
||
p2++;
|
||
|
||
/* We have some targets, so don't ignore the following commands. */
|
||
no_targets = 0;
|
||
|
||
/* Is this a static pattern rule: `target: %targ: %dep; ...'? */
|
||
p = index (p2, ':');
|
||
while (p != 0 && p[-1] == '\\')
|
||
{
|
||
register char *q = &p[-1];
|
||
register int backslash = 0;
|
||
while (*q-- == '\\')
|
||
backslash = !backslash;
|
||
if (backslash)
|
||
p = index (p + 1, ':');
|
||
else
|
||
break;
|
||
}
|
||
#ifdef __MSDOS__
|
||
/* For MS-DOS, skip a "C:\...". */
|
||
if (p != 0 && p[1] == '\\' && isalpha (p[-1]))
|
||
p = 0;
|
||
#endif
|
||
#ifdef _AMIGA
|
||
/* Here, the situation is quite complicated. Let's have a look
|
||
at a couple of targets:
|
||
|
||
install: dev:make
|
||
|
||
dev:make: make
|
||
|
||
dev:make:: xyz
|
||
|
||
The rule is that it's only a target, if there are TWO :'s
|
||
OR a space around the :.
|
||
*/
|
||
if (p && !(isspace(p[1]) || !p[1] || isspace(p[-1])))
|
||
p = 0;
|
||
#endif
|
||
#ifdef WIN32
|
||
do {
|
||
check_again = 0;
|
||
/* For WIN32, skip a "C:\..." or a "C:/..." */
|
||
if (p != 0 && (p[1] == '\\' || p[1] == '/') && isalpha (p[-1])) {
|
||
p = index(p + 1, ':');
|
||
check_again = 1;
|
||
}
|
||
} while (check_again);
|
||
#endif
|
||
if (p != 0)
|
||
{
|
||
struct nameseq *target;
|
||
target = parse_file_seq (&p2, ':', sizeof (struct nameseq), 1);
|
||
++p2;
|
||
if (target == 0)
|
||
makefile_fatal (filename, lineno, "missing target pattern");
|
||
else if (target->next != 0)
|
||
makefile_fatal (filename, lineno, "multiple target patterns");
|
||
pattern = target->name;
|
||
pattern_percent = find_percent (pattern);
|
||
if (pattern_percent == 0)
|
||
makefile_fatal (filename, lineno,
|
||
"target pattern contains no `%%'");
|
||
}
|
||
else
|
||
pattern = 0;
|
||
|
||
/* Parse the dependencies. */
|
||
deps = (struct dep *)
|
||
multi_glob (parse_file_seq (&p2, '\0', sizeof (struct dep), 1),
|
||
sizeof (struct dep));
|
||
|
||
commands_idx = 0;
|
||
if (cmdleft != 0)
|
||
{
|
||
/* Semicolon means rest of line is a command. */
|
||
unsigned int len = strlen (cmdleft + 1);
|
||
|
||
commands_started = lineno;
|
||
|
||
/* Add this command line to the buffer. */
|
||
if (len + 2 > commands_len)
|
||
{
|
||
commands_len = (len + 2) * 2;
|
||
commands = (char *) xrealloc (commands, commands_len);
|
||
}
|
||
bcopy (cmdleft + 1, commands, len);
|
||
commands_idx += len;
|
||
commands[commands_idx++] = '\n';
|
||
}
|
||
|
||
continue;
|
||
}
|
||
|
||
/* We get here except in the case that we just read a rule line.
|
||
Record now the last rule we read, so following spurious
|
||
commands are properly diagnosed. */
|
||
record_waiting_files ();
|
||
no_targets = 0;
|
||
}
|
||
|
||
if (conditionals->if_cmds)
|
||
makefile_fatal (filename, lineno, "missing `endif'");
|
||
|
||
/* At eof, record the last rule. */
|
||
record_waiting_files ();
|
||
|
||
freebuffer (&lb);
|
||
free ((char *) commands);
|
||
fclose (infile);
|
||
|
||
reading_filename = 0;
|
||
reading_lineno_ptr = 0;
|
||
|
||
return 1;
|
||
}
|
||
|
||
/* Execute a `define' directive.
|
||
The first line has already been read, and NAME is the name of
|
||
the variable to be defined. The following lines remain to be read.
|
||
LINENO, INFILE and FILENAME refer to the makefile being read.
|
||
The value returned is LINENO, updated for lines read here. */
|
||
|
||
static unsigned int
|
||
do_define (name, namelen, origin, lineno, infile, filename)
|
||
char *name;
|
||
unsigned int namelen;
|
||
enum variable_origin origin;
|
||
unsigned int lineno;
|
||
FILE *infile;
|
||
char *filename;
|
||
{
|
||
struct linebuffer lb;
|
||
unsigned int nlines = 0;
|
||
unsigned int length = 100;
|
||
char *definition = (char *) xmalloc (100);
|
||
register unsigned int idx = 0;
|
||
register char *p;
|
||
|
||
/* Expand the variable name. */
|
||
char *var = (char *) alloca (namelen + 1);
|
||
bcopy (name, var, namelen);
|
||
var[namelen] = '\0';
|
||
var = variable_expand (var);
|
||
|
||
initbuffer (&lb);
|
||
while (!feof (infile))
|
||
{
|
||
lineno += nlines;
|
||
nlines = readline (&lb, infile, filename, lineno);
|
||
|
||
collapse_continuations (lb.buffer);
|
||
|
||
p = next_token (lb.buffer);
|
||
if ((p[5] == '\0' || isblank (p[5])) && !strncmp (p, "endef", 5))
|
||
{
|
||
p += 5;
|
||
remove_comments (p);
|
||
if (*next_token (p) != '\0')
|
||
makefile_error (filename, lineno,
|
||
"Extraneous text after `endef' directive");
|
||
/* Define the variable. */
|
||
if (idx == 0)
|
||
definition[0] = '\0';
|
||
else
|
||
definition[idx - 1] = '\0';
|
||
(void) define_variable (var, strlen (var), definition, origin, 1);
|
||
free (definition);
|
||
freebuffer (&lb);
|
||
return lineno;
|
||
}
|
||
else
|
||
{
|
||
unsigned int len = strlen (lb.buffer);
|
||
|
||
/* Increase the buffer size if necessary. */
|
||
if (idx + len + 1 > length)
|
||
{
|
||
length = (idx + len) * 2;
|
||
definition = (char *) xrealloc (definition, length + 1);
|
||
}
|
||
|
||
bcopy (lb.buffer, &definition[idx], len);
|
||
idx += len;
|
||
/* Separate lines with a newline. */
|
||
definition[idx++] = '\n';
|
||
}
|
||
}
|
||
|
||
/* No `endef'!! */
|
||
makefile_fatal (filename, lineno, "missing `endef', unterminated `define'");
|
||
|
||
/* NOTREACHED */
|
||
return 0;
|
||
}
|
||
|
||
/* Interpret conditional commands "ifdef", "ifndef", "ifeq",
|
||
"ifneq", "else" and "endif".
|
||
LINE is the input line, with the command as its first word.
|
||
|
||
FILENAME and LINENO are the filename and line number in the
|
||
current makefile. They are used for error messages.
|
||
|
||
Value is -1 if the line is invalid,
|
||
0 if following text should be interpreted,
|
||
1 if following text should be ignored. */
|
||
|
||
static int
|
||
conditional_line (line, filename, lineno)
|
||
char *line;
|
||
char *filename;
|
||
unsigned int lineno;
|
||
{
|
||
int notdef;
|
||
char *cmdname;
|
||
register unsigned int i;
|
||
|
||
if (*line == 'i')
|
||
{
|
||
/* It's an "if..." command. */
|
||
notdef = line[2] == 'n';
|
||
if (notdef)
|
||
{
|
||
cmdname = line[3] == 'd' ? "ifndef" : "ifneq";
|
||
line += cmdname[3] == 'd' ? 7 : 6;
|
||
}
|
||
else
|
||
{
|
||
cmdname = line[2] == 'd' ? "ifdef" : "ifeq";
|
||
line += cmdname[2] == 'd' ? 6 : 5;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
/* It's an "else" or "endif" command. */
|
||
notdef = line[1] == 'n';
|
||
cmdname = notdef ? "endif" : "else";
|
||
line += notdef ? 5 : 4;
|
||
}
|
||
|
||
line = next_token (line);
|
||
|
||
if (*cmdname == 'e')
|
||
{
|
||
if (*line != '\0')
|
||
makefile_error (filename, lineno,
|
||
"Extraneous text after `%s' directive",
|
||
cmdname);
|
||
/* "Else" or "endif". */
|
||
if (conditionals->if_cmds == 0)
|
||
makefile_fatal (filename, lineno, "extraneous `%s'", cmdname);
|
||
/* NOTDEF indicates an `endif' command. */
|
||
if (notdef)
|
||
--conditionals->if_cmds;
|
||
else if (conditionals->seen_else[conditionals->if_cmds - 1])
|
||
makefile_fatal (filename, lineno, "only one `else' per conditional");
|
||
else
|
||
{
|
||
/* Toggle the state of ignorance. */
|
||
conditionals->ignoring[conditionals->if_cmds - 1]
|
||
= !conditionals->ignoring[conditionals->if_cmds - 1];
|
||
/* Record that we have seen an `else' in this conditional.
|
||
A second `else' will be erroneous. */
|
||
conditionals->seen_else[conditionals->if_cmds - 1] = 1;
|
||
}
|
||
for (i = 0; i < conditionals->if_cmds; ++i)
|
||
if (conditionals->ignoring[i])
|
||
return 1;
|
||
return 0;
|
||
}
|
||
|
||
if (conditionals->allocated == 0)
|
||
{
|
||
conditionals->allocated = 5;
|
||
conditionals->ignoring = (char *) xmalloc (conditionals->allocated);
|
||
conditionals->seen_else = (char *) xmalloc (conditionals->allocated);
|
||
}
|
||
|
||
++conditionals->if_cmds;
|
||
if (conditionals->if_cmds > conditionals->allocated)
|
||
{
|
||
conditionals->allocated += 5;
|
||
conditionals->ignoring = (char *)
|
||
xrealloc (conditionals->ignoring, conditionals->allocated);
|
||
conditionals->seen_else = (char *)
|
||
xrealloc (conditionals->seen_else, conditionals->allocated);
|
||
}
|
||
|
||
/* Record that we have seen an `if...' but no `else' so far. */
|
||
conditionals->seen_else[conditionals->if_cmds - 1] = 0;
|
||
|
||
/* Search through the stack to see if we're already ignoring. */
|
||
for (i = 0; i < conditionals->if_cmds - 1; ++i)
|
||
if (conditionals->ignoring[i])
|
||
{
|
||
/* We are already ignoring, so just push a level
|
||
to match the next "else" or "endif", and keep ignoring.
|
||
We don't want to expand variables in the condition. */
|
||
conditionals->ignoring[conditionals->if_cmds - 1] = 1;
|
||
return 1;
|
||
}
|
||
|
||
if (cmdname[notdef ? 3 : 2] == 'd')
|
||
{
|
||
/* "Ifdef" or "ifndef". */
|
||
struct variable *v;
|
||
register char *p = end_of_token (line);
|
||
i = p - line;
|
||
p = next_token (p);
|
||
if (*p != '\0')
|
||
return -1;
|
||
v = lookup_variable (line, i);
|
||
conditionals->ignoring[conditionals->if_cmds - 1]
|
||
= (v != 0 && *v->value != '\0') == notdef;
|
||
}
|
||
else
|
||
{
|
||
/* "Ifeq" or "ifneq". */
|
||
char *s1, *s2;
|
||
unsigned int len;
|
||
char termin = *line == '(' ? ',' : *line;
|
||
|
||
if (termin != ',' && termin != '"' && termin != '\'')
|
||
return -1;
|
||
|
||
s1 = ++line;
|
||
/* Find the end of the first string. */
|
||
if (termin == ',')
|
||
{
|
||
register int count = 0;
|
||
for (; *line != '\0'; ++line)
|
||
if (*line == '(')
|
||
++count;
|
||
else if (*line == ')')
|
||
--count;
|
||
else if (*line == ',' && count <= 0)
|
||
break;
|
||
}
|
||
else
|
||
while (*line != '\0' && *line != termin)
|
||
++line;
|
||
|
||
if (*line == '\0')
|
||
return -1;
|
||
|
||
if (termin == ',')
|
||
{
|
||
/* Strip blanks after the first string. */
|
||
char *p = line++;
|
||
while (isblank (p[-1]))
|
||
--p;
|
||
*p = '\0';
|
||
}
|
||
else
|
||
*line++ = '\0';
|
||
|
||
s2 = variable_expand (s1);
|
||
/* We must allocate a new copy of the expanded string because
|
||
variable_expand re-uses the same buffer. */
|
||
len = strlen (s2);
|
||
s1 = (char *) alloca (len + 1);
|
||
bcopy (s2, s1, len + 1);
|
||
|
||
if (termin != ',')
|
||
/* Find the start of the second string. */
|
||
line = next_token (line);
|
||
|
||
termin = termin == ',' ? ')' : *line;
|
||
if (termin != ')' && termin != '"' && termin != '\'')
|
||
return -1;
|
||
|
||
/* Find the end of the second string. */
|
||
if (termin == ')')
|
||
{
|
||
register int count = 0;
|
||
s2 = next_token (line);
|
||
for (line = s2; *line != '\0'; ++line)
|
||
{
|
||
if (*line == '(')
|
||
++count;
|
||
else if (*line == ')')
|
||
if (count <= 0)
|
||
break;
|
||
else
|
||
--count;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
++line;
|
||
s2 = line;
|
||
while (*line != '\0' && *line != termin)
|
||
++line;
|
||
}
|
||
|
||
if (*line == '\0')
|
||
return -1;
|
||
|
||
*line = '\0';
|
||
line = next_token (++line);
|
||
if (*line != '\0')
|
||
makefile_error (filename, lineno,
|
||
"Extraneous text after `%s' directive",
|
||
cmdname);
|
||
|
||
s2 = variable_expand (s2);
|
||
conditionals->ignoring[conditionals->if_cmds - 1]
|
||
= streq (s1, s2) == notdef;
|
||
}
|
||
|
||
/* Search through the stack to see if we're ignoring. */
|
||
for (i = 0; i < conditionals->if_cmds; ++i)
|
||
if (conditionals->ignoring[i])
|
||
return 1;
|
||
return 0;
|
||
}
|
||
|
||
/* Remove duplicate dependencies in CHAIN. */
|
||
|
||
void
|
||
uniquize_deps (chain)
|
||
struct dep *chain;
|
||
{
|
||
register struct dep *d;
|
||
|
||
/* Make sure that no dependencies are repeated. This does not
|
||
really matter for the purpose of updating targets, but it
|
||
might make some names be listed twice for $^ and $?. */
|
||
|
||
for (d = chain; d != 0; d = d->next)
|
||
{
|
||
struct dep *last, *next;
|
||
|
||
last = d;
|
||
next = d->next;
|
||
while (next != 0)
|
||
if (streq (dep_name (d), dep_name (next)))
|
||
{
|
||
struct dep *n = next->next;
|
||
last->next = n;
|
||
if (next->name != 0 && next->name != d->name)
|
||
free (next->name);
|
||
if (next != d)
|
||
free ((char *) next);
|
||
next = n;
|
||
}
|
||
else
|
||
{
|
||
last = next;
|
||
next = next->next;
|
||
}
|
||
}
|
||
}
|
||
|
||
/* Record a description line for files FILENAMES,
|
||
with dependencies DEPS, commands to execute described
|
||
by COMMANDS and COMMANDS_IDX, coming from FILENAME:COMMANDS_STARTED.
|
||
TWO_COLON is nonzero if a double colon was used.
|
||
If not nil, PATTERN is the `%' pattern to make this
|
||
a static pattern rule, and PATTERN_PERCENT is a pointer
|
||
to the `%' within it.
|
||
|
||
The links of FILENAMES are freed, and so are any names in it
|
||
that are not incorporated into other data structures. */
|
||
|
||
static void
|
||
record_files (filenames, pattern, pattern_percent, deps, commands_started,
|
||
commands, commands_idx, two_colon, filename, lineno, set_default)
|
||
struct nameseq *filenames;
|
||
char *pattern, *pattern_percent;
|
||
struct dep *deps;
|
||
unsigned int commands_started;
|
||
char *commands;
|
||
unsigned int commands_idx;
|
||
int two_colon;
|
||
char *filename;
|
||
unsigned int lineno;
|
||
int set_default;
|
||
{
|
||
struct nameseq *nextf;
|
||
int implicit = 0;
|
||
unsigned int max_targets, target_idx;
|
||
char **targets = 0, **target_percents = 0;
|
||
struct commands *cmds;
|
||
|
||
if (commands_idx > 0)
|
||
{
|
||
cmds = (struct commands *) xmalloc (sizeof (struct commands));
|
||
cmds->filename = filename;
|
||
cmds->lineno = commands_started;
|
||
cmds->commands = savestring (commands, commands_idx);
|
||
cmds->command_lines = 0;
|
||
}
|
||
else
|
||
cmds = 0;
|
||
|
||
for (; filenames != 0; filenames = nextf)
|
||
{
|
||
register char *name = filenames->name;
|
||
register struct file *f;
|
||
register struct dep *d;
|
||
struct dep *this;
|
||
char *implicit_percent;
|
||
|
||
nextf = filenames->next;
|
||
free ((char *) filenames);
|
||
|
||
implicit_percent = find_percent (name);
|
||
implicit |= implicit_percent != 0;
|
||
|
||
if (implicit && pattern != 0)
|
||
makefile_fatal (filename, lineno,
|
||
"mixed implicit and static pattern rules");
|
||
|
||
if (implicit && implicit_percent == 0)
|
||
makefile_fatal (filename, lineno, "mixed implicit and normal rules");
|
||
|
||
if (implicit)
|
||
{
|
||
if (targets == 0)
|
||
{
|
||
max_targets = 5;
|
||
targets = (char **) xmalloc (5 * sizeof (char *));
|
||
target_percents = (char **) xmalloc (5 * sizeof (char *));
|
||
target_idx = 0;
|
||
}
|
||
else if (target_idx == max_targets - 1)
|
||
{
|
||
max_targets += 5;
|
||
targets = (char **) xrealloc ((char *) targets,
|
||
max_targets * sizeof (char *));
|
||
target_percents
|
||
= (char **) xrealloc ((char *) target_percents,
|
||
max_targets * sizeof (char *));
|
||
}
|
||
targets[target_idx] = name;
|
||
target_percents[target_idx] = implicit_percent;
|
||
++target_idx;
|
||
continue;
|
||
}
|
||
|
||
/* If there are multiple filenames, copy the chain DEPS
|
||
for all but the last one. It is not safe for the same deps
|
||
to go in more than one place in the data base. */
|
||
this = nextf != 0 ? copy_dep_chain (deps) : deps;
|
||
|
||
if (pattern != 0)
|
||
/* If this is an extended static rule:
|
||
`targets: target%pattern: dep%pattern; cmds',
|
||
translate each dependency pattern into a plain filename
|
||
using the target pattern and this target's name. */
|
||
if (!pattern_matches (pattern, pattern_percent, name))
|
||
{
|
||
/* Give a warning if the rule is meaningless. */
|
||
makefile_error (filename, lineno,
|
||
"target `%s' doesn't match the target pattern",
|
||
name);
|
||
this = 0;
|
||
}
|
||
else
|
||
{
|
||
/* We use patsubst_expand to do the work of translating
|
||
the target pattern, the target's name and the dependencies'
|
||
patterns into plain dependency names. */
|
||
char *buffer = variable_expand ("");
|
||
|
||
for (d = this; d != 0; d = d->next)
|
||
{
|
||
char *o;
|
||
char *percent = find_percent (d->name);
|
||
if (percent == 0)
|
||
continue;
|
||
o = patsubst_expand (buffer, name, pattern, d->name,
|
||
pattern_percent, percent);
|
||
free (d->name);
|
||
d->name = savestring (buffer, o - buffer);
|
||
}
|
||
}
|
||
|
||
if (!two_colon)
|
||
{
|
||
/* Single-colon. Combine these dependencies
|
||
with others in file's existing record, if any. */
|
||
f = enter_file (name);
|
||
|
||
if (f->double_colon)
|
||
makefile_fatal (filename, lineno,
|
||
"target file `%s' has both : and :: entries",
|
||
f->name);
|
||
|
||
/* If CMDS == F->CMDS, this target was listed in this rule
|
||
more than once. Just give a warning since this is harmless. */
|
||
if (cmds != 0 && cmds == f->cmds)
|
||
makefile_error
|
||
(filename, lineno,
|
||
"target `%s' given more than once in the same rule.",
|
||
f->name);
|
||
|
||
/* Check for two single-colon entries both with commands.
|
||
Check is_target so that we don't lose on files such as .c.o
|
||
whose commands were preinitialized. */
|
||
else if (cmds != 0 && f->cmds != 0 && f->is_target)
|
||
{
|
||
makefile_error (cmds->filename, cmds->lineno,
|
||
"warning: overriding commands for target `%s'",
|
||
f->name);
|
||
makefile_error (f->cmds->filename, f->cmds->lineno,
|
||
"warning: ignoring old commands for target `%s'",
|
||
f->name);
|
||
}
|
||
|
||
f->is_target = 1;
|
||
|
||
/* Defining .DEFAULT with no deps or cmds clears it. */
|
||
if (f == default_file && this == 0 && cmds == 0)
|
||
f->cmds = 0;
|
||
if (cmds != 0)
|
||
f->cmds = cmds;
|
||
/* Defining .SUFFIXES with no dependencies
|
||
clears out the list of suffixes. */
|
||
if (f == suffix_file && this == 0)
|
||
{
|
||
d = f->deps;
|
||
while (d != 0)
|
||
{
|
||
struct dep *nextd = d->next;
|
||
free (d->name);
|
||
free ((char *)d);
|
||
d = nextd;
|
||
}
|
||
f->deps = 0;
|
||
}
|
||
else if (f->deps != 0)
|
||
{
|
||
/* Add the file's old deps and the new ones in THIS together. */
|
||
|
||
struct dep *firstdeps, *moredeps;
|
||
if (cmds != 0)
|
||
{
|
||
/* This is the rule with commands, so put its deps first.
|
||
The rationale behind this is that $< expands to the
|
||
first dep in the chain, and commands use $< expecting
|
||
to get the dep that rule specifies. */
|
||
firstdeps = this;
|
||
moredeps = f->deps;
|
||
}
|
||
else
|
||
{
|
||
/* Append the new deps to the old ones. */
|
||
firstdeps = f->deps;
|
||
moredeps = this;
|
||
}
|
||
|
||
if (firstdeps == 0)
|
||
firstdeps = moredeps;
|
||
else
|
||
{
|
||
d = firstdeps;
|
||
while (d->next != 0)
|
||
d = d->next;
|
||
d->next = moredeps;
|
||
}
|
||
|
||
f->deps = firstdeps;
|
||
}
|
||
else
|
||
f->deps = this;
|
||
|
||
/* If this is a static pattern rule, set the file's stem to
|
||
the part of its name that matched the `%' in the pattern,
|
||
so you can use $* in the commands. */
|
||
if (pattern != 0)
|
||
{
|
||
static char *percent = "%";
|
||
char *buffer = variable_expand ("");
|
||
char *o = patsubst_expand (buffer, name, pattern, percent,
|
||
pattern_percent, percent);
|
||
f->stem = savestring (buffer, o - buffer);
|
||
}
|
||
}
|
||
else
|
||
{
|
||
/* Double-colon. Make a new record
|
||
even if the file already has one. */
|
||
f = lookup_file (name);
|
||
/* Check for both : and :: rules. Check is_target so
|
||
we don't lose on default suffix rules or makefiles. */
|
||
if (f != 0 && f->is_target && !f->double_colon)
|
||
makefile_fatal (filename, lineno,
|
||
"target file `%s' has both : and :: entries",
|
||
f->name);
|
||
f = enter_file (name);
|
||
/* If there was an existing entry and it was a double-colon
|
||
entry, enter_file will have returned a new one, making it the
|
||
prev pointer of the old one, and setting its double_colon
|
||
pointer to the first one. */
|
||
if (f->double_colon == 0)
|
||
/* This is the first entry for this name, so we must
|
||
set its double_colon pointer to itself. */
|
||
f->double_colon = f;
|
||
f->is_target = 1;
|
||
f->deps = this;
|
||
f->cmds = cmds;
|
||
}
|
||
|
||
/* Free name if not needed further. */
|
||
if (f != 0 && name != f->name
|
||
&& (name < f->name || name > f->name + strlen (f->name)))
|
||
{
|
||
free (name);
|
||
name = f->name;
|
||
}
|
||
|
||
/* See if this is first target seen whose name does
|
||
not start with a `.', unless it contains a slash. */
|
||
if (default_goal_file == 0 && set_default
|
||
&& (*name != '.' || index (name, '/') != 0))
|
||
{
|
||
int reject = 0;
|
||
|
||
/* If this file is a suffix, don't
|
||
let it be the default goal file. */
|
||
|
||
for (d = suffix_file->deps; d != 0; d = d->next)
|
||
{
|
||
register struct dep *d2;
|
||
if (*dep_name (d) != '.' && streq (name, dep_name (d)))
|
||
{
|
||
reject = 1;
|
||
break;
|
||
}
|
||
for (d2 = suffix_file->deps; d2 != 0; d2 = d2->next)
|
||
{
|
||
register unsigned int len = strlen (dep_name (d2));
|
||
if (strncmp (name, dep_name (d2), len))
|
||
continue;
|
||
if (streq (name + len, dep_name (d)))
|
||
{
|
||
reject = 1;
|
||
break;
|
||
}
|
||
}
|
||
if (reject)
|
||
break;
|
||
}
|
||
|
||
if (!reject)
|
||
default_goal_file = f;
|
||
}
|
||
}
|
||
|
||
if (implicit)
|
||
{
|
||
targets[target_idx] = 0;
|
||
target_percents[target_idx] = 0;
|
||
create_pattern_rule (targets, target_percents, two_colon, deps, cmds, 1);
|
||
free ((char *) target_percents);
|
||
}
|
||
}
|
||
|
||
/* Search STRING for an unquoted STOPCHAR or blank (if BLANK is nonzero).
|
||
Backslashes quote STOPCHAR, blanks if BLANK is nonzero, and backslash.
|
||
Quoting backslashes are removed from STRING by compacting it into
|
||
itself. Returns a pointer to the first unquoted STOPCHAR if there is
|
||
one, or nil if there are none. */
|
||
|
||
char *
|
||
find_char_unquote (string, stopchars, blank)
|
||
char *string;
|
||
char *stopchars;
|
||
int blank;
|
||
{
|
||
unsigned int string_len = 0;
|
||
register char *p = string;
|
||
|
||
while (1)
|
||
{
|
||
while (*p != '\0' && index (stopchars, *p) == 0
|
||
&& (!blank || !isblank (*p)))
|
||
++p;
|
||
if (*p == '\0')
|
||
break;
|
||
|
||
if (p > string && p[-1] == '\\')
|
||
{
|
||
/* Search for more backslashes. */
|
||
register int i = -2;
|
||
while (&p[i] >= string && p[i] == '\\')
|
||
--i;
|
||
++i;
|
||
/* Only compute the length if really needed. */
|
||
if (string_len == 0)
|
||
string_len = strlen (string);
|
||
/* The number of backslashes is now -I.
|
||
Copy P over itself to swallow half of them. */
|
||
bcopy (&p[i / 2], &p[i], (string_len - (p - string)) - (i / 2) + 1);
|
||
p += i / 2;
|
||
if (i % 2 == 0)
|
||
/* All the backslashes quoted each other; the STOPCHAR was
|
||
unquoted. */
|
||
return p;
|
||
|
||
/* The STOPCHAR was quoted by a backslash. Look for another. */
|
||
}
|
||
else
|
||
/* No backslash in sight. */
|
||
return p;
|
||
}
|
||
|
||
/* Never hit a STOPCHAR or blank (with BLANK nonzero). */
|
||
return 0;
|
||
}
|
||
|
||
/* Search PATTERN for an unquoted %. */
|
||
|
||
char *
|
||
find_percent (pattern)
|
||
char *pattern;
|
||
{
|
||
return find_char_unquote (pattern, "%", 0);
|
||
}
|
||
|
||
/* Parse a string into a sequence of filenames represented as a
|
||
chain of struct nameseq's in reverse order and return that chain.
|
||
|
||
The string is passed as STRINGP, the address of a string pointer.
|
||
The string pointer is updated to point at the first character
|
||
not parsed, which either is a null char or equals STOPCHAR.
|
||
|
||
SIZE is how big to construct chain elements.
|
||
This is useful if we want them actually to be other structures
|
||
that have room for additional info.
|
||
|
||
If STRIP is nonzero, strip `./'s off the beginning. */
|
||
|
||
struct nameseq *
|
||
parse_file_seq (stringp, stopchar, size, strip)
|
||
char **stringp;
|
||
int stopchar;
|
||
unsigned int size;
|
||
int strip;
|
||
{
|
||
register struct nameseq *new = 0;
|
||
register struct nameseq *new1, *lastnew1;
|
||
register char *p = *stringp;
|
||
char *q;
|
||
char *name;
|
||
char stopchars[3];
|
||
|
||
#ifdef VMS
|
||
stopchars[0] = ',';
|
||
stopchars[1] = stopchar;
|
||
stopchars[2] = '\0';
|
||
#else
|
||
stopchars[0] = stopchar;
|
||
stopchars[1] = '\0';
|
||
#endif
|
||
|
||
while (1)
|
||
{
|
||
/* Skip whitespace; see if any more names are left. */
|
||
p = next_token (p);
|
||
if (*p == '\0')
|
||
break;
|
||
if (*p == stopchar)
|
||
break;
|
||
|
||
/* Yes, find end of next name. */
|
||
q = p;
|
||
p = find_char_unquote (q, stopchars, 1);
|
||
#ifdef VMS
|
||
/* convert comma separated list to space separated */
|
||
if (p && *p == ',')
|
||
*p =' ';
|
||
#endif
|
||
#ifdef __MSDOS__
|
||
/* For MS-DOS, skip a "C:\...". */
|
||
if (stopchar == ':' && p != 0 && p[1] == '\\' && isalpha (p[-1]))
|
||
p = 0;
|
||
#endif
|
||
#ifdef _AMIGA
|
||
if (stopchar == ':' && p && *p == ':' &&
|
||
!(isspace(p[1]) || !p[1] || isspace(p[-1])))
|
||
{
|
||
p = find_char_unquote (p+1, stopchars, 1);
|
||
}
|
||
#endif
|
||
#ifdef WIN32
|
||
/* For WIN32, skip a "C:\..." or "C:/...". */
|
||
if (stopchar == ':' &&
|
||
p != 0 &&
|
||
(p[1] == '\\' || p[1] == '/') &&
|
||
isalpha (p[-1])) {
|
||
p = end_of_token_w32(++p, ':');
|
||
if (*p == '\0' && p[-1] == ':')
|
||
p--;
|
||
}
|
||
#endif
|
||
if (p == 0)
|
||
p = q + strlen (q);
|
||
|
||
if (strip)
|
||
#ifdef VMS
|
||
/* Skip leading `[]'s. */
|
||
while (p - q > 2 && q[0] == '[' && q[1] == ']')
|
||
#else
|
||
/* Skip leading `./'s. */
|
||
while (p - q > 2 && q[0] == '.' && q[1] == '/')
|
||
#endif
|
||
{
|
||
q += 2; /* Skip "./". */
|
||
while (q < p && *q == '/')
|
||
/* Skip following slashes: ".//foo" is "foo", not "/foo". */
|
||
++q;
|
||
}
|
||
|
||
/* Extract the filename just found, and skip it. */
|
||
|
||
if (q == p)
|
||
/* ".///" was stripped to "". */
|
||
#ifdef VMS
|
||
continue;
|
||
#else
|
||
#ifdef _AMIGA
|
||
name = savestring ("", 0);
|
||
#else
|
||
name = savestring ("./", 2);
|
||
#endif
|
||
#endif
|
||
else
|
||
#ifdef VMS
|
||
/* VMS filenames can have a ':' in them but they have to be '\'ed but we need
|
||
* to remove this '\' before we can use the filename.
|
||
* Savestring called because q may be read-only string constant.
|
||
*/
|
||
{
|
||
char *qbase = savestring(q, strlen(q));
|
||
char *pbase = qbase + (p-q);
|
||
char *q1 = qbase;
|
||
char *q2 = q1;
|
||
char *p1 = pbase;
|
||
|
||
while (q1 != pbase)
|
||
{
|
||
if (*q1 == '\\' && *(q1+1) == ':')
|
||
{
|
||
q1++;
|
||
p1--;
|
||
}
|
||
*q2++ = *q1++;
|
||
}
|
||
name = savestring (qbase, p1 - qbase);
|
||
free (qbase);
|
||
}
|
||
#else
|
||
name = savestring (q, p - q);
|
||
#endif
|
||
|
||
/* Add it to the front of the chain. */
|
||
new1 = (struct nameseq *) xmalloc (size);
|
||
new1->name = name;
|
||
new1->next = new;
|
||
new = new1;
|
||
}
|
||
|
||
#ifndef NO_ARCHIVES
|
||
|
||
/* Look for multi-word archive references.
|
||
They are indicated by a elt ending with an unmatched `)' and
|
||
an elt further down the chain (i.e., previous in the file list)
|
||
with an unmatched `(' (e.g., "lib(mem"). */
|
||
|
||
new1 = new;
|
||
lastnew1 = 0;
|
||
while (new1 != 0)
|
||
if (new1->name[0] != '(' /* Don't catch "(%)" and suchlike. */
|
||
&& new1->name[strlen (new1->name) - 1] == ')'
|
||
&& index (new1->name, '(') == 0)
|
||
{
|
||
/* NEW1 ends with a `)' but does not contain a `('.
|
||
Look back for an elt with an opening `(' but no closing `)'. */
|
||
|
||
struct nameseq *n = new1->next, *lastn = new1;
|
||
char *paren;
|
||
while (n != 0 && (paren = index (n->name, '(')) == 0)
|
||
{
|
||
lastn = n;
|
||
n = n->next;
|
||
}
|
||
if (n != 0
|
||
/* Ignore something starting with `(', as that cannot actually
|
||
be an archive-member reference (and treating it as such
|
||
results in an empty file name, which causes much lossage). */
|
||
&& n->name[0] != '(')
|
||
{
|
||
/* N is the first element in the archive group.
|
||
Its name looks like "lib(mem" (with no closing `)'). */
|
||
|
||
char *libname;
|
||
|
||
/* Copy "lib(" into LIBNAME. */
|
||
++paren;
|
||
libname = (char *) alloca (paren - n->name + 1);
|
||
bcopy (n->name, libname, paren - n->name);
|
||
libname[paren - n->name] = '\0';
|
||
|
||
if (*paren == '\0')
|
||
{
|
||
/* N was just "lib(", part of something like "lib( a b)".
|
||
Edit it out of the chain and free its storage. */
|
||
lastn->next = n->next;
|
||
free (n->name);
|
||
free ((char *) n);
|
||
/* LASTN->next is the new stopping elt for the loop below. */
|
||
n = lastn->next;
|
||
}
|
||
else
|
||
{
|
||
/* Replace N's name with the full archive reference. */
|
||
name = concat (libname, paren, ")");
|
||
free (n->name);
|
||
n->name = name;
|
||
}
|
||
|
||
if (new1->name[1] == '\0')
|
||
{
|
||
/* NEW1 is just ")", part of something like "lib(a b )".
|
||
Omit it from the chain and free its storage. */
|
||
if (lastnew1 == 0)
|
||
new = new1->next;
|
||
else
|
||
lastnew1->next = new1->next;
|
||
lastn = new1;
|
||
new1 = new1->next;
|
||
free (lastn->name);
|
||
free ((char *) lastn);
|
||
}
|
||
else
|
||
{
|
||
/* Replace also NEW1->name, which already has closing `)'. */
|
||
name = concat (libname, new1->name, "");
|
||
free (new1->name);
|
||
new1->name = name;
|
||
new1 = new1->next;
|
||
}
|
||
|
||
/* Trace back from NEW1 (the end of the list) until N
|
||
(the beginning of the list), rewriting each name
|
||
with the full archive reference. */
|
||
|
||
while (new1 != n)
|
||
{
|
||
name = concat (libname, new1->name, ")");
|
||
free (new1->name);
|
||
new1->name = name;
|
||
lastnew1 = new1;
|
||
new1 = new1->next;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
/* No frobnication happening. Just step down the list. */
|
||
lastnew1 = new1;
|
||
new1 = new1->next;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
lastnew1 = new1;
|
||
new1 = new1->next;
|
||
}
|
||
|
||
#endif
|
||
|
||
*stringp = p;
|
||
return new;
|
||
}
|
||
|
||
/* Read a line of text from STREAM into LINEBUFFER.
|
||
Combine continuation lines into one line.
|
||
Return the number of actual lines read (> 1 if hacked continuation lines).
|
||
*/
|
||
|
||
static unsigned int
|
||
readline (linebuffer, stream, filename, lineno)
|
||
struct linebuffer *linebuffer;
|
||
FILE *stream;
|
||
char *filename;
|
||
unsigned int lineno;
|
||
{
|
||
char *buffer = linebuffer->buffer;
|
||
register char *p = linebuffer->buffer;
|
||
register char *end = p + linebuffer->size;
|
||
register int len, lastlen = 0;
|
||
register char *p2;
|
||
register unsigned int nlines = 0;
|
||
register int backslash;
|
||
|
||
*p = '\0';
|
||
|
||
while (fgets (p, end - p, stream) != 0)
|
||
{
|
||
len = strlen (p);
|
||
if (len == 0)
|
||
{
|
||
/* This only happens when the first thing on the line is a '\0'.
|
||
It is a pretty hopeless case, but (wonder of wonders) Athena
|
||
lossage strikes again! (xmkmf puts NULs in its makefiles.)
|
||
There is nothing really to be done; we synthesize a newline so
|
||
the following line doesn't appear to be part of this line. */
|
||
makefile_error (filename, lineno,
|
||
"warning: NUL character seen; rest of line ignored");
|
||
p[0] = '\n';
|
||
len = 1;
|
||
}
|
||
|
||
p += len;
|
||
if (p[-1] != '\n')
|
||
{
|
||
/* Probably ran out of buffer space. */
|
||
register unsigned int p_off = p - buffer;
|
||
linebuffer->size *= 2;
|
||
buffer = (char *) xrealloc (buffer, linebuffer->size);
|
||
p = buffer + p_off;
|
||
end = buffer + linebuffer->size;
|
||
linebuffer->buffer = buffer;
|
||
*p = '\0';
|
||
lastlen = len;
|
||
continue;
|
||
}
|
||
|
||
++nlines;
|
||
|
||
if (len == 1 && p > buffer)
|
||
/* P is pointing at a newline and it's the beginning of
|
||
the buffer returned by the last fgets call. However,
|
||
it is not necessarily the beginning of a line if P is
|
||
pointing past the beginning of the holding buffer.
|
||
If the buffer was just enlarged (right before the newline),
|
||
we must account for that, so we pretend that the two lines
|
||
were one line. */
|
||
len += lastlen;
|
||
lastlen = len;
|
||
backslash = 0;
|
||
for (p2 = p - 2; --len > 0; --p2)
|
||
{
|
||
if (*p2 == '\\')
|
||
backslash = !backslash;
|
||
else
|
||
break;
|
||
}
|
||
|
||
if (!backslash)
|
||
{
|
||
p[-1] = '\0';
|
||
break;
|
||
}
|
||
|
||
if (end - p <= 1)
|
||
{
|
||
/* Enlarge the buffer. */
|
||
register unsigned int p_off = p - buffer;
|
||
linebuffer->size *= 2;
|
||
buffer = (char *) xrealloc (buffer, linebuffer->size);
|
||
p = buffer + p_off;
|
||
end = buffer + linebuffer->size;
|
||
linebuffer->buffer = buffer;
|
||
}
|
||
}
|
||
|
||
if (ferror (stream))
|
||
pfatal_with_name (filename);
|
||
|
||
return nlines;
|
||
}
|
||
|
||
/* Construct the list of include directories
|
||
from the arguments and the default list. */
|
||
|
||
void
|
||
construct_include_path (arg_dirs)
|
||
char **arg_dirs;
|
||
{
|
||
register unsigned int i;
|
||
#ifdef VAXC /* just don't ask ... */
|
||
stat_t stbuf;
|
||
#else
|
||
struct stat stbuf;
|
||
#endif
|
||
/* Table to hold the dirs. */
|
||
|
||
register unsigned int defsize = (sizeof (default_include_directories)
|
||
/ sizeof (default_include_directories[0]));
|
||
register unsigned int max = 5;
|
||
register char **dirs = (char **) xmalloc ((5 + defsize) * sizeof (char *));
|
||
register unsigned int idx = 0;
|
||
|
||
/* First consider any dirs specified with -I switches.
|
||
Ignore dirs that don't exist. */
|
||
|
||
if (arg_dirs != 0)
|
||
while (*arg_dirs != 0)
|
||
{
|
||
char *dir = *arg_dirs++;
|
||
|
||
if (dir[0] == '~')
|
||
{
|
||
char *expanded = tilde_expand (dir);
|
||
if (expanded != 0)
|
||
dir = expanded;
|
||
}
|
||
|
||
if (stat (dir, &stbuf) == 0 && S_ISDIR (stbuf.st_mode))
|
||
{
|
||
if (idx == max - 1)
|
||
{
|
||
max += 5;
|
||
dirs = (char **)
|
||
xrealloc ((char *) dirs, (max + defsize) * sizeof (char *));
|
||
}
|
||
dirs[idx++] = dir;
|
||
}
|
||
else if (dir != arg_dirs[-1])
|
||
free (dir);
|
||
}
|
||
|
||
/* Now add at the end the standard default dirs. */
|
||
|
||
for (i = 0; default_include_directories[i] != 0; ++i)
|
||
if (stat (default_include_directories[i], &stbuf) == 0
|
||
&& S_ISDIR (stbuf.st_mode))
|
||
dirs[idx++] = default_include_directories[i];
|
||
|
||
dirs[idx] = 0;
|
||
|
||
/* Now compute the maximum length of any name in it. */
|
||
|
||
max_incl_len = 0;
|
||
for (i = 0; i < idx; ++i)
|
||
{
|
||
unsigned int len = strlen (dirs[i]);
|
||
/* If dir name is written with a trailing slash, discard it. */
|
||
if (dirs[i][len - 1] == '/')
|
||
/* We can't just clobber a null in because it may have come from
|
||
a literal string and literal strings may not be writable. */
|
||
dirs[i] = savestring (dirs[i], len - 1);
|
||
if (len > max_incl_len)
|
||
max_incl_len = len;
|
||
}
|
||
|
||
include_directories = dirs;
|
||
}
|
||
|
||
/* Expand ~ or ~USER at the beginning of NAME.
|
||
Return a newly malloc'd string or 0. */
|
||
|
||
char *
|
||
tilde_expand (name)
|
||
char *name;
|
||
{
|
||
#ifndef VMS
|
||
if (name[1] == '/' || name[1] == '\0')
|
||
{
|
||
extern char *getenv ();
|
||
char *home_dir;
|
||
int is_variable;
|
||
|
||
{
|
||
/* Turn off --warn-undefined-variables while we expand HOME. */
|
||
int save = warn_undefined_variables_flag;
|
||
warn_undefined_variables_flag = 0;
|
||
|
||
home_dir = allocated_variable_expand ("$(HOME)");
|
||
|
||
warn_undefined_variables_flag = save;
|
||
}
|
||
|
||
is_variable = home_dir[0] != '\0';
|
||
if (!is_variable)
|
||
{
|
||
free (home_dir);
|
||
home_dir = getenv ("HOME");
|
||
}
|
||
#if !defined(_AMIGA) && !defined(WIN32)
|
||
if (home_dir == 0 || home_dir[0] == '\0')
|
||
{
|
||
extern char *getlogin ();
|
||
char *name = getlogin ();
|
||
home_dir = 0;
|
||
if (name != 0)
|
||
{
|
||
struct passwd *p = getpwnam (name);
|
||
if (p != 0)
|
||
home_dir = p->pw_dir;
|
||
}
|
||
}
|
||
#endif /* !AMIGA && !WIN32 */
|
||
if (home_dir != 0)
|
||
{
|
||
char *new = concat (home_dir, "", name + 1);
|
||
if (is_variable)
|
||
free (home_dir);
|
||
return new;
|
||
}
|
||
}
|
||
#if !defined(_AMIGA) && !defined(WIN32)
|
||
else
|
||
{
|
||
struct passwd *pwent;
|
||
char *userend = index (name + 1, '/');
|
||
if (userend != 0)
|
||
*userend = '\0';
|
||
pwent = getpwnam (name + 1);
|
||
if (pwent != 0)
|
||
{
|
||
if (userend == 0)
|
||
return savestring (pwent->pw_dir, strlen (pwent->pw_dir));
|
||
else
|
||
return concat (pwent->pw_dir, "/", userend + 1);
|
||
}
|
||
else if (userend != 0)
|
||
*userend = '/';
|
||
}
|
||
#endif /* !AMIGA && !WIN32 */
|
||
#endif /* !VMS */
|
||
return 0;
|
||
}
|
||
|
||
/* Given a chain of struct nameseq's describing a sequence of filenames,
|
||
in reverse of the intended order, return a new chain describing the
|
||
result of globbing the filenames. The new chain is in forward order.
|
||
The links of the old chain are freed or used in the new chain.
|
||
Likewise for the names in the old chain.
|
||
|
||
SIZE is how big to construct chain elements.
|
||
This is useful if we want them actually to be other structures
|
||
that have room for additional info. */
|
||
|
||
struct nameseq *
|
||
multi_glob (chain, size)
|
||
struct nameseq *chain;
|
||
unsigned int size;
|
||
{
|
||
extern void dir_setup_glob ();
|
||
register struct nameseq *new = 0;
|
||
register struct nameseq *old;
|
||
struct nameseq *nexto;
|
||
glob_t gl;
|
||
|
||
dir_setup_glob (&gl);
|
||
|
||
for (old = chain; old != 0; old = nexto)
|
||
{
|
||
#ifndef NO_ARCHIVES
|
||
char *memname;
|
||
#endif
|
||
|
||
nexto = old->next;
|
||
|
||
if (old->name[0] == '~')
|
||
{
|
||
char *newname = tilde_expand (old->name);
|
||
if (newname != 0)
|
||
{
|
||
free (old->name);
|
||
old->name = newname;
|
||
}
|
||
}
|
||
|
||
#ifndef NO_ARCHIVES
|
||
if (ar_name (old->name))
|
||
{
|
||
/* OLD->name is an archive member reference.
|
||
Replace it with the archive file name,
|
||
and save the member name in MEMNAME.
|
||
We will glob on the archive name and then
|
||
reattach MEMNAME later. */
|
||
char *arname;
|
||
ar_parse_name (old->name, &arname, &memname);
|
||
free (old->name);
|
||
old->name = arname;
|
||
}
|
||
else
|
||
memname = 0;
|
||
#endif /* !NO_ARCHIVES */
|
||
|
||
switch (glob (old->name, GLOB_NOCHECK|GLOB_ALTDIRFUNC, NULL, &gl))
|
||
{
|
||
case 0: /* Success. */
|
||
{
|
||
register int i = gl.gl_pathc;
|
||
while (i-- > 0)
|
||
{
|
||
#ifndef NO_ARCHIVES
|
||
if (memname != 0)
|
||
{
|
||
/* Try to glob on MEMNAME within the archive. */
|
||
struct nameseq *found
|
||
= ar_glob (gl.gl_pathv[i], memname, size);
|
||
if (found == 0)
|
||
{
|
||
/* No matches. Use MEMNAME as-is. */
|
||
struct nameseq *elt
|
||
= (struct nameseq *) xmalloc (size);
|
||
unsigned int alen = strlen (gl.gl_pathv[i]);
|
||
unsigned int mlen = strlen (memname);
|
||
elt->name = (char *) xmalloc (alen + 1 + mlen + 2);
|
||
bcopy (gl.gl_pathv[i], elt->name, alen);
|
||
elt->name[alen] = '(';
|
||
bcopy (memname, &elt->name[alen + 1], mlen);
|
||
elt->name[alen + 1 + mlen] = ')';
|
||
elt->name[alen + 1 + mlen + 1] = '\0';
|
||
elt->next = new;
|
||
new = elt;
|
||
}
|
||
else
|
||
{
|
||
/* Find the end of the FOUND chain. */
|
||
struct nameseq *f = found;
|
||
while (f->next != 0)
|
||
f = f->next;
|
||
|
||
/* Attach the chain being built to the end of the FOUND
|
||
chain, and make FOUND the new NEW chain. */
|
||
f->next = new;
|
||
new = found;
|
||
}
|
||
|
||
free (memname);
|
||
}
|
||
else
|
||
#endif /* !NO_ARCHIVES */
|
||
{
|
||
struct nameseq *elt = (struct nameseq *) xmalloc (size);
|
||
elt->name = savestring (gl.gl_pathv[i],
|
||
strlen (gl.gl_pathv[i]));
|
||
elt->next = new;
|
||
new = elt;
|
||
}
|
||
}
|
||
globfree (&gl);
|
||
free (old->name);
|
||
free ((char *)old);
|
||
break;
|
||
}
|
||
|
||
case GLOB_NOSPACE:
|
||
fatal ("virtual memory exhausted");
|
||
break;
|
||
|
||
default:
|
||
old->next = new;
|
||
new = old;
|
||
break;
|
||
}
|
||
}
|
||
|
||
return new;
|
||
}
|