aboutsummaryrefslogtreecommitdiff
path: root/miscutils/make.c
diff options
context:
space:
mode:
Diffstat (limited to 'miscutils/make.c')
-rw-r--r--miscutils/make.c3563
1 files changed, 3563 insertions, 0 deletions
diff --git a/miscutils/make.c b/miscutils/make.c
new file mode 100644
index 000000000..8026917b3
--- /dev/null
+++ b/miscutils/make.c
@@ -0,0 +1,3563 @@
1/* vi: set sw=4 ts=4: */
2/*
3 * make implementation for BusyBox
4 *
5 * Based on public domain POSIX make: https://frippery.org/make
6 */
7//config:config MAKE
8//config: bool "make (18 kb)"
9//config: default n
10//config: help
11//config: The make command can be used to maintain files that depend on
12//config: other files. Normally it's used to build programs from source
13//config: code but it can be used in other situations too.
14//config:
15//config:config PDPMAKE
16//config: bool "pdpmake (18 kb)"
17//config: default n
18//config: help
19//config: Alias for "make"
20//config:
21//config:config FEATURE_MAKE_POSIX
22//config: bool "Runtime enforcement of POSIX"
23//config: default n
24//config: depends on MAKE || PDPMAKE
25//config: help
26//config: Allow strict enforcement of POSIX compliance at runtime by:
27//config: - .POSIX special target in makefile
28//config: - '--posix' command line option
29//config: - PDPMAKE_POSIXLY_CORRECT environment variable
30//config: Enable this if you want to check whether your makefiles are
31//config: POSIX compliant. This adds about 1.7 kb.
32//config:
33//config:choice
34//config: prompt "Default POSIX level to enforce"
35//config: depends on FEATURE_MAKE_POSIX
36//config: default FEATURE_MAKE_POSIX_2017
37//config:
38//config:config FEATURE_MAKE_POSIX_2017
39//config: bool "2017"
40//config:
41//config:config FEATURE_MAKE_POSIX_2024
42//config: bool "2024"
43//config:
44//config:endchoice
45
46//applet:IF_MAKE(APPLET(make, BB_DIR_USR_BIN, BB_SUID_DROP))
47//applet:IF_PDPMAKE(APPLET_ODDNAME(pdpmake, make, BB_DIR_USR_BIN, BB_SUID_DROP, make))
48
49//kbuild:lib-$(CONFIG_MAKE) += make.o
50//kbuild:lib-$(CONFIG_PDPMAKE) += make.o
51
52//usage:#define make_trivial_usage
53//usage: IF_FEATURE_MAKE_POSIX(
54//usage: "[--posix] [-C DIR] [-f FILE] [-j NUM] [-x PRAG] [-eiknpqrsSt] [MACRO[:[:[:]]]=VAL]... [TARGET]..."
55//usage: )
56//usage: IF_NOT_FEATURE_MAKE_POSIX(
57//usage: "[-C DIR] [-f FILE] [-j NUM] [-eiknpqrsSt] [MACRO[:[:[:]]]=VAL]... [TARGET]..."
58//usage: )
59//usage:#define make_full_usage "\n\n"
60//usage: "Maintain files based on their dependencies\n"
61//usage: IF_FEATURE_MAKE_POSIX(
62//usage: "\n --posix Enforce POSIX mode"
63//usage: )
64//usage: "\n -C DIR Change to DIR"
65//usage: "\n -f FILE Makefile"
66//usage: "\n -j NUM Jobs to run in parallel (not implemented)"
67//usage: IF_FEATURE_MAKE_POSIX(
68//usage: "\n -x PRAG Make POSIX mode less strict"
69//usage: )
70//usage: "\n -e Environment variables override macros in makefiles"
71//usage: "\n -i Ignore exit status"
72//usage: "\n -k Continue on error"
73//usage: "\n -n Dry run"
74//usage: "\n -p Print macros and targets"
75//usage: "\n -q Query target; exit status 1 if not up to date"
76//usage: "\n -r Don't use built-in rules"
77//usage: "\n -s Make silently"
78//usage: "\n -S Stop on error"
79//usage: "\n -t Touch files instead of making them"
80//usage: IF_FEATURE_MAKE_POSIX(
81//usage: "\n\nThis build supports: non-POSIX extensions, POSIX 2024, POSIX 2017"
82//usage: )
83//usage: IF_FEATURE_MAKE_POSIX_2017(
84//usage: "\nIn strict POSIX mode the 2017 standard is enforced by default"
85//usage: )
86//usage: IF_FEATURE_MAKE_POSIX_2024(
87//usage: "\nIn strict POSIX mode the 2024 standard is enforced by default"
88//usage: )
89
90#include "libbb.h"
91#include "bb_archive.h"
92#include "common_bufsiz.h"
93#include <glob.h>
94
95// Supported POSIX levels
96#define STD_POSIX_2017 0
97#define STD_POSIX_2024 1
98
99#define POSIX_2017 (posix && posix_level == STD_POSIX_2017)
100
101#if ENABLE_FEATURE_MAKE_POSIX_2017
102# define DEFAULT_POSIX_LEVEL STD_POSIX_2017
103#else
104# define DEFAULT_POSIX_LEVEL STD_POSIX_2024
105#endif
106
107#define OPTSTR1 "eij:+knqrsSt"
108#if ENABLE_FEATURE_MAKE_POSIX
109#define OPTSTR2 "pf:*C:*x:*"
110#else
111#define OPTSTR2 "pf:*C:*"
112#endif
113
114enum {
115 OPTBIT_e = 0,
116 OPTBIT_i,
117 OPTBIT_j,
118 OPTBIT_k,
119 OPTBIT_n,
120 OPTBIT_q,
121 OPTBIT_r,
122 OPTBIT_s,
123 OPTBIT_S,
124 OPTBIT_t,
125 OPTBIT_p,
126 OPTBIT_f,
127 OPTBIT_C,
128 IF_FEATURE_MAKE_POSIX(OPTBIT_x,)
129 OPTBIT_precious,
130 OPTBIT_phony,
131 OPTBIT_include,
132 OPTBIT_make,
133
134 OPT_e = (1 << OPTBIT_e),
135 OPT_i = (1 << OPTBIT_i),
136 OPT_j = (1 << OPTBIT_j),
137 OPT_k = (1 << OPTBIT_k),
138 OPT_n = (1 << OPTBIT_n),
139 OPT_q = (1 << OPTBIT_q),
140 OPT_r = (1 << OPTBIT_r),
141 OPT_s = (1 << OPTBIT_s),
142 OPT_S = (1 << OPTBIT_S),
143 OPT_t = (1 << OPTBIT_t),
144 // These options aren't allowed in MAKEFLAGS
145 OPT_p = (1 << OPTBIT_p),
146 OPT_f = (1 << OPTBIT_f),
147 OPT_C = (1 << OPTBIT_C),
148 OPT_x = IF_FEATURE_MAKE_POSIX((1 << OPTBIT_x)) + 0,
149 // The following aren't command line options and must be last
150 OPT_precious = (1 << OPTBIT_precious),
151 OPT_phony = (1 << OPTBIT_phony),
152 OPT_include = (1 << OPTBIT_include),
153 OPT_make = (1 << OPTBIT_make),
154};
155
156// Options in OPTSTR1 that aren't included in MAKEFLAGS
157#define OPT_MASK (~OPT_S)
158
159#define useenv (opts & OPT_e)
160#define ignore (opts & OPT_i)
161#define errcont (opts & OPT_k)
162#define dryrun (opts & OPT_n)
163#define print (opts & OPT_p)
164#define quest (opts & OPT_q)
165#define norules (opts & OPT_r)
166#define silent (opts & OPT_s)
167#define dotouch (opts & OPT_t)
168#define precious (opts & OPT_precious)
169#define doinclude (opts & OPT_include)
170#define domake (opts & OPT_make)
171
172// A name. This represents a file, either to be made, or pre-existing.
173struct name {
174 struct name *n_next; // Next in the list of names
175 char *n_name; // Called
176 struct rule *n_rule; // Rules to build this (prerequisites/commands)
177 struct timespec n_tim; // Modification time of this name
178 uint16_t n_flag; // Info about the name
179};
180
181#define N_DOING 0x01 // Name in process of being built
182#define N_DONE 0x02 // Name looked at
183#define N_TARGET 0x04 // Name is a target
184#define N_PRECIOUS 0x08 // Target is precious
185#define N_DOUBLE 0x10 // Double-colon target
186#define N_SILENT 0x20 // Build target silently
187#define N_IGNORE 0x40 // Ignore build errors
188#define N_SPECIAL 0x80 // Special target
189#define N_MARK 0x100 // Mark for deduplication
190#define N_PHONY 0x200 // Name is a phony target
191#define N_INFERENCE 0x400 // Inference rule
192
193// List of rules to build a target
194struct rule {
195 struct rule *r_next; // Next rule
196 struct depend *r_dep; // Prerequisites for this rule
197 struct cmd *r_cmd; // Commands for this rule
198};
199
200// NOTE: the layout of the following two structures must be compatible.
201// Also, their first two members must be compatible with llist_t.
202
203// List of prerequisites for a rule
204struct depend {
205 struct depend *d_next; // Next prerequisite
206 struct name *d_name; // Name of prerequisite
207 int d_refcnt; // Reference count
208};
209
210// List of commands for a rule
211struct cmd {
212 struct cmd *c_next; // Next command line
213 char *c_cmd; // Text of command line
214 int c_refcnt; // Reference count
215 const char *c_makefile; // Makefile in which command was defined
216 int c_dispno; // Line number within makefile
217};
218
219// Macro storage
220struct macro {
221 struct macro *m_next; // Next variable
222 char *m_name; // Its name
223 char *m_val; // Its value
224 bool m_immediate; // Immediate-expansion macro set using ::=
225 bool m_flag; // Infinite loop check
226 uint8_t m_level; // Level at which macro was created
227};
228
229// Flags passed to setmacro()
230#define M_IMMEDIATE 0x08 // immediate-expansion macro is being defined
231#define M_VALID 0x10 // assert macro name is valid
232#define M_ENVIRON 0x20 // macro imported from environment
233
234// Constants for PRAGMA. Order must match strings in set_pragma().
235enum {
236 BIT_MACRO_NAME = 0,
237 BIT_TARGET_NAME,
238 BIT_COMMAND_COMMENT,
239 BIT_EMPTY_SUFFIX,
240#if ENABLE_PLATFORM_MINGW32
241 BIT_WINDOWS,
242#endif
243 BIT_POSIX_2017,
244 BIT_POSIX_2024,
245 BIT_POSIX_202X,
246
247 P_MACRO_NAME = (1 << BIT_MACRO_NAME),
248 P_TARGET_NAME = (1 << BIT_TARGET_NAME),
249 P_COMMAND_COMMENT = (1 << BIT_COMMAND_COMMENT),
250 P_EMPTY_SUFFIX = (1 << BIT_EMPTY_SUFFIX),
251#if ENABLE_PLATFORM_MINGW32
252 P_WINDOWS = (1 << BIT_WINDOWS),
253#endif
254};
255
256// Status of make()
257#define MAKE_FAILURE 0x01
258#define MAKE_DIDSOMETHING 0x02
259
260// Return TRUE if c is allowed in a POSIX 2017 macro or target name
261#define ispname(c) (isalpha(c) || isdigit(c) || c == '.' || c == '_')
262// Return TRUE if c is in the POSIX 'portable filename character set'
263#define isfname(c) (ispname(c) || c == '-')
264
265#define HTABSIZE 39
266
267struct globals {
268 uint32_t opts;
269 const char *makefile;
270 llist_t *makefiles;
271 llist_t *dirs;
272 struct name *namehead[HTABSIZE];
273 struct macro *macrohead[HTABSIZE];
274 struct name *firstname;
275 struct name *target;
276 time_t ar_mtime;
277 int lineno; // Physical line number in file
278 int dispno; // Line number for display purposes
279 struct cmd *curr_cmd;
280 const char *rulepos;
281 int rule_idx;
282#define IF_MAX 10
283 uint8_t clevel;
284 uint8_t cstate[IF_MAX + 1];
285 int numjobs;
286#if ENABLE_FEATURE_MAKE_POSIX
287 bool posix;
288 bool seen_first;
289 llist_t *pragmas;
290 unsigned char pragma;
291 unsigned char posix_level;
292#endif
293} FIX_ALIASING;
294
295#define G (*(struct globals*)bb_common_bufsiz1)
296#define INIT_G() do { \
297 setup_common_bufsiz(); \
298} while (0)
299
300#define opts (G.opts)
301#define makefile (G.makefile)
302#define makefiles (G.makefiles)
303#define dirs (G.dirs)
304#define namehead (G.namehead)
305#define macrohead (G.macrohead)
306#define firstname (G.firstname)
307#define target (G.target)
308#define ar_mtime (G.ar_mtime)
309#define lineno (G.lineno)
310#define dispno (G.dispno)
311#define curr_cmd (G.curr_cmd)
312#define rulepos (G.rulepos)
313#define rule_idx (G.rule_idx)
314#define clevel (G.clevel)
315#define cstate (G.cstate)
316#define numjobs (G.numjobs)
317#if ENABLE_FEATURE_MAKE_POSIX
318#define posix (G.posix)
319#define seen_first (G.seen_first)
320#define pragmas (G.pragmas)
321#define pragma (G.pragma)
322#define posix_level (G.posix_level)
323#else
324#define posix 0
325#define pragma 0
326#define posix_level DEFAULT_POSIX_LEVEL
327#endif
328
329static int make(struct name *np, int level);
330static struct name *dyndep(struct name *np, struct rule *infrule,
331 const char **ptsuff);
332
333/*
334 * Utility functions.
335 */
336
337/*
338 * Print message, with makefile and line number if possible.
339 */
340static void
341vwarning(FILE *stream, const char *msg, va_list list)
342{
343 const char *m = NULL;
344 int d = 0;
345
346 if (curr_cmd) {
347 m = curr_cmd->c_makefile;
348 d = curr_cmd->c_dispno;
349 } else if (makefile) {
350 m = makefile;
351 d = dispno;
352 }
353
354 fprintf(stream, "%s: ", applet_name);
355 if (m)
356 fprintf(stream, "(%s:%d): ", m, d);
357 vfprintf(stream, msg, list);
358 fputc('\n', stream);
359}
360
361/*
362 * Diagnostic handler. Print message to standard error.
363 */
364static void
365diagnostic(const char *msg, ...)
366{
367 va_list list;
368
369 va_start(list, msg);
370 vwarning(stderr, msg, list);
371 va_end(list);
372}
373
374/*
375 * Error handler. Print message and exit.
376 */
377static void error(const char *msg, ...) NORETURN;
378static void
379error(const char *msg, ...)
380{
381 va_list list;
382
383 va_start(list, msg);
384 vwarning(stderr, msg, list);
385 va_end(list);
386 exit(2);
387}
388
389static void error_unexpected(const char *s) NORETURN;
390static void
391error_unexpected(const char *s)
392{
393 error("unexpected %s", s);
394}
395
396static void error_in_inference_rule(const char *s) NORETURN;
397static void
398error_in_inference_rule(const char *s)
399{
400 error("%s in inference rule", s);
401}
402
403static void
404error_not_allowed(const char *s, const char *t)
405{
406 error("%s not allowed for %s", s, t);
407}
408
409static void
410warning(const char *msg, ...)
411{
412 va_list list;
413
414 va_start(list, msg);
415 vwarning(stdout, msg, list);
416 va_end(list);
417}
418
419static char *
420auto_concat(const char *s1, const char *s2)
421{
422 return auto_string(xasprintf("%s%s", s1, s2));
423}
424
425#if !ENABLE_PLATFORM_MINGW32
426/*
427 * Append a word to a space-separated string of words. The first
428 * call should use a NULL pointer for str, subsequent calls should
429 * pass an allocated string which will be freed.
430 */
431static char *
432xappendword(const char *str, const char *word)
433{
434 char *newstr = str ? xasprintf("%s %s", str, word) : xstrdup(word);
435 free((void *)str);
436 return newstr;
437}
438#endif
439
440static unsigned int
441getbucket(const char *name)
442{
443 unsigned int hashval = 0;
444 const unsigned char *p = (unsigned char *)name;
445
446 while (*p)
447 hashval ^= (hashval << 5) + (hashval >> 2) + *p++;
448 return hashval % HTABSIZE;
449}
450
451/*
452 * Add a prerequisite to the end of the supplied list.
453 */
454static void
455newdep(struct depend **dphead, struct name *np)
456{
457 while (*dphead)
458 dphead = &(*dphead)->d_next;
459 *dphead = xzalloc(sizeof(struct depend));
460 /*(*dphead)->d_next = NULL; - xzalloc did it */
461 (*dphead)->d_name = np;
462 /*(*dphead)->d_refcnt = 0; */
463}
464
465static void
466freedeps(struct depend *dp)
467{
468 if (dp && --dp->d_refcnt <= 0)
469 llist_free((llist_t *)dp, NULL);
470}
471
472/*
473 * Add a command to the end of the supplied list of commands.
474 */
475static void
476newcmd(struct cmd **cphead, char *str)
477{
478 while (isspace(*str))
479 str++;
480
481 while (*cphead)
482 cphead = &(*cphead)->c_next;
483 *cphead = xzalloc(sizeof(struct cmd));
484 /*(*cphead)->c_next = NULL; - xzalloc did it */
485 (*cphead)->c_cmd = xstrdup(str);
486 /*(*cphead)->c_refcnt = 0; */
487 (*cphead)->c_makefile = xstrdup(makefile);
488 (*cphead)->c_dispno = dispno;
489}
490
491static void
492freecmds(struct cmd *cp)
493{
494 struct cmd *nextcp;
495
496 if (cp && --cp->c_refcnt <= 0) {
497 for (; cp; cp = nextcp) {
498 nextcp = cp->c_next;
499 free(cp->c_cmd);
500 free((void *)cp->c_makefile);
501 free(cp);
502 }
503 }
504}
505
506static struct name *
507findname(const char *name)
508{
509 struct name *np = namehead[getbucket(name)];
510 return (struct name *)llist_find_str((llist_t *)np, name);
511}
512
513static int
514check_name(const char *name)
515{
516 const char *s;
517
518#if ENABLE_PLATFORM_MINGW32
519 if (!posix || (pragma & P_WINDOWS)) {
520 if (isalpha(name[0]) && name[1] == ':' && name[2] == '/') {
521 name += 3;
522 }
523 }
524#endif
525 if (!posix) {
526 for (s = name; *s; ++s) {
527 if (*s == '=')
528 return FALSE;
529 }
530 return TRUE;
531 }
532
533 for (s = name; *s; ++s) {
534 if ((pragma & P_TARGET_NAME) || !POSIX_2017 ?
535 !(isfname(*s) || *s == '/') : !ispname(*s))
536 return FALSE;
537 }
538 return TRUE;
539}
540
541static char *splitlib(const char *name, char **member);
542
543static int
544is_valid_target(const char *name)
545{
546 char *archive, *member = NULL;
547 int ret;
548
549 /* Names of the form 'lib(member)' are referred to as 'expressions'
550 * in POSIX and are subjected to special treatment. The 'lib'
551 * and 'member' elements must each be a valid target name. */
552 archive = splitlib(name, &member);
553 ret = check_name(archive) && (member == NULL || check_name(member));
554 free(archive);
555
556 return ret;
557}
558
559#if ENABLE_FEATURE_MAKE_POSIX
560static int
561potentially_valid_target(const char *name)
562{
563 int ret = FALSE;
564
565 if (!(pragma & P_TARGET_NAME)) {
566 pragma |= P_TARGET_NAME;
567 ret = is_valid_target(name);
568 pragma &= ~P_TARGET_NAME;
569 }
570 return ret;
571}
572#endif
573
574/*
575 * Intern a name. Return a pointer to the name struct
576 */
577static struct name *
578newname(const char *name)
579{
580 struct name *np = findname(name);
581
582 if (np == NULL) {
583 unsigned int bucket;
584
585 if (!is_valid_target(name))
586#if ENABLE_FEATURE_MAKE_POSIX
587 error("invalid target name '%s'%s", name,
588 potentially_valid_target(name) ?
589 ": allow with pragma target_name" : "");
590#else
591 error("invalid target name '%s'", name);
592#endif
593
594 bucket = getbucket(name);
595 np = xzalloc(sizeof(struct name));
596 np->n_next = namehead[bucket];
597 namehead[bucket] = np;
598 np->n_name = xstrdup(name);
599 /*np->n_rule = NULL; - xzalloc did it */
600 /*np->n_tim = (struct timespec){0, 0}; */
601 /*np->n_flag = 0; */
602 }
603 return np;
604}
605
606/*
607 * Return the commands on the first rule that has them or NULL.
608 */
609static struct cmd *
610getcmd(struct name *np)
611{
612 struct rule *rp;
613
614 if (np == NULL)
615 return NULL;
616
617 for (rp = np->n_rule; rp; rp = rp->r_next)
618 if (rp->r_cmd)
619 return rp->r_cmd;
620 return NULL;
621}
622
623#if ENABLE_FEATURE_CLEAN_UP
624static void
625freenames(void)
626{
627 int i;
628 struct name *np, *nextnp;
629
630 for (i = 0; i < HTABSIZE; i++) {
631 for (np = namehead[i]; np; np = nextnp) {
632 nextnp = np->n_next;
633 free(np->n_name);
634 freerules(np->n_rule);
635 free(np);
636 }
637 }
638}
639#endif
640
641static void
642freerules(struct rule *rp)
643{
644 struct rule *nextrp;
645
646 for (; rp; rp = nextrp) {
647 nextrp = rp->r_next;
648 freedeps(rp->r_dep);
649 freecmds(rp->r_cmd);
650 free(rp);
651 }
652}
653
654static void *
655inc_ref(void *vp)
656{
657 if (vp) {
658 struct depend *dp = vp;
659 if (dp->d_refcnt == INT_MAX)
660 bb_die_memory_exhausted();
661 dp->d_refcnt++;
662 }
663 return vp;
664}
665
666#if ENABLE_FEATURE_MAKE_POSIX
667// Order must match constants above.
668// POSIX levels must be last and in increasing order
669static const char *p_name =
670 "macro_name\0"
671 "target_name\0"
672 "command_comment\0"
673 "empty_suffix\0"
674#if ENABLE_PLATFORM_MINGW32
675 "windows\0"
676#endif
677 "posix_2017\0"
678 "posix_2024\0"
679 "posix_202x\0";
680
681static void
682set_pragma(const char *name)
683{
684 int idx = index_in_strings(p_name, name);
685
686 if (idx != -1) {
687 if (idx >= BIT_POSIX_2017) {
688 // POSIX level is stored in a separate variable.
689 // No bits in 'pragma' are used.
690 if (posix_level == DEFAULT_POSIX_LEVEL) {
691 posix_level = idx - BIT_POSIX_2017;
692 if (posix_level > STD_POSIX_2024)
693 posix_level = STD_POSIX_2024;
694 } else if (posix_level != idx - BIT_POSIX_2017)
695 warning("unable to change POSIX level");
696 } else {
697 pragma |= 1 << idx;
698 }
699 return;
700 }
701 warning("invalid pragma '%s'", name);
702}
703
704static void
705pragmas_to_env(void)
706{
707 int i;
708 char *val = NULL;
709
710 for (i = 0; i < BIT_POSIX_2017; ++i) {
711 if ((pragma & (1 << i)))
712 val = xappendword(val, nth_string(p_name, i));
713 }
714
715 if (posix_level != DEFAULT_POSIX_LEVEL)
716 val = xappendword(val,
717 nth_string(p_name, BIT_POSIX_2017 + posix_level));
718
719 if (val) {
720 setenv("PDPMAKE_PRAGMAS", val, 1);
721 free(val);
722 }
723}
724#endif
725
726/*
727 * Add a new rule to a target. This checks to see if commands already
728 * exist for the target. If flag is TRUE the target can have multiple
729 * rules with commands (double-colon rules).
730 *
731 * i) If the name is a special target and there are no prerequisites
732 * or commands to be added remove all prerequisites and commands.
733 * This is necessary when clearing a built-in inference rule.
734 * ii) If name is a special target and has commands, replace them.
735 * This is for redefining commands for an inference rule.
736 */
737static void
738addrule(struct name *np, struct depend *dp, struct cmd *cp, int flag)
739{
740 struct rule *rp;
741 struct rule **rpp;
742 struct cmd *old_cp;
743
744 // Can't mix single-colon and double-colon rules
745 if (!posix && (np->n_flag & N_TARGET)) {
746 if (!(np->n_flag & N_DOUBLE) != !flag) // like xor
747 error("inconsistent rules for target %s", np->n_name);
748 }
749
750 // Clear out prerequisites and commands
751 if ((np->n_flag & N_SPECIAL) && !dp && !cp) {
752 if (strcmp(np->n_name, ".PHONY") == 0)
753 return;
754 freerules(np->n_rule);
755 np->n_rule = NULL;
756 return;
757 }
758
759 if (cp && !(np->n_flag & N_DOUBLE) && (old_cp = getcmd(np))) {
760 // Handle the inference rule redefinition case
761 // .DEFAULT rule can also be redefined (as an extension).
762 if ((np->n_flag & N_INFERENCE)
763 && !(posix && (np->n_flag & N_SPECIAL))
764 ) {
765 freerules(np->n_rule);
766 np->n_rule = NULL;
767 } else {
768 // We're adding commands to a single colon rule which
769 // already has some. Clear the old ones first.
770 warning("overriding rule for target %s", np->n_name);
771 curr_cmd = old_cp;
772 warning("previous rule for target %s", np->n_name);
773 curr_cmd = NULL;
774
775 for (rp = np->n_rule; rp; rp = rp->r_next) {
776 freecmds(rp->r_cmd);
777 rp->r_cmd = NULL;
778 }
779 }
780 }
781
782 rpp = &np->n_rule;
783 while (*rpp)
784 rpp = &(*rpp)->r_next;
785
786 *rpp = rp = xzalloc(sizeof(struct rule));
787 /*rp->r_next = NULL; - xzalloc did it */
788 rp->r_dep = inc_ref(dp);
789 rp->r_cmd = inc_ref(cp);
790
791 np->n_flag |= N_TARGET;
792 if (flag)
793 np->n_flag |= N_DOUBLE;
794#if ENABLE_FEATURE_MAKE_POSIX
795 if (strcmp(np->n_name, ".PRAGMA") == 0) {
796 for (; dp; dp = dp->d_next) {
797 set_pragma(dp->d_name->n_name);
798 }
799 pragmas_to_env();
800 }
801#endif
802}
803
804/*
805 * Macro control for make
806 */
807static struct macro *
808getmp(const char *name)
809{
810 struct macro *mp = macrohead[getbucket(name)];
811 return (struct macro *)llist_find_str((llist_t *)mp, name);
812}
813
814static int
815is_valid_macro(const char *name)
816{
817 const char *s;
818 for (s = name; *s; ++s) {
819 // In POSIX mode only a limited set of characters are guaranteed
820 // to be allowed in macro names.
821 if (posix) {
822 // Find the appropriate character set
823 if ((pragma & P_MACRO_NAME) || !POSIX_2017 ?
824 !isfname(*s) : !ispname(*s))
825 return FALSE;
826 }
827 // As an extension allow anything that can get through the
828 // input parser, apart from the following.
829 if (*s == '=' || isblank(*s) || iscntrl(*s))
830 return FALSE;
831 }
832 return TRUE;
833}
834
835#if ENABLE_FEATURE_MAKE_POSIX
836static int
837potentially_valid_macro(const char *name)
838{
839 int ret = FALSE;
840
841 if (!(pragma & P_MACRO_NAME)) {
842 pragma |= P_MACRO_NAME;
843 ret = is_valid_macro(name);
844 pragma &= ~P_MACRO_NAME;
845 }
846 return ret;
847}
848#endif
849
850static void
851setmacro(const char *name, const char *val, int level)
852{
853 struct macro *mp;
854 bool valid = level & M_VALID;
855 bool from_env = level & M_ENVIRON;
856 bool immediate = level & M_IMMEDIATE;
857
858 level &= ~(M_IMMEDIATE | M_VALID | M_ENVIRON);
859 mp = getmp(name);
860 if (mp) {
861 // Don't replace existing macro from a lower level
862 if (level > mp->m_level)
863 return;
864
865 // Replace existing macro
866 free(mp->m_val);
867 } else {
868 // If not defined, allocate space for new
869 unsigned int bucket;
870
871 if (!valid && !is_valid_macro(name)) {
872 // Silently drop invalid names from the environment
873 if (from_env)
874 return;
875#if ENABLE_FEATURE_MAKE_POSIX
876 error("invalid macro name '%s'%s", name,
877 potentially_valid_macro(name) ?
878 ": allow with pragma macro_name" : "");
879#else
880 error("invalid macro name '%s'", name);
881#endif
882 }
883
884 bucket = getbucket(name);
885 mp = xzalloc(sizeof(struct macro));
886 mp->m_next = macrohead[bucket];
887 macrohead[bucket] = mp;
888 /* mp->m_flag = FALSE; - xzalloc did it */
889 mp->m_name = xstrdup(name);
890 }
891 mp->m_immediate = immediate;
892 mp->m_level = level;
893 mp->m_val = xstrdup(val ? val : "");
894}
895
896#if ENABLE_FEATURE_CLEAN_UP
897static void
898freemacros(void)
899{
900 int i;
901 struct macro *mp, *nextmp;
902
903 for (i = 0; i < HTABSIZE; i++) {
904 for (mp = macrohead[i]; mp; mp = nextmp) {
905 nextmp = mp->m_next;
906 free(mp->m_name);
907 free(mp->m_val);
908 free(mp);
909 }
910 }
911}
912#endif
913
914/*
915 * Get modification time of file or archive member
916 */
917static void FAST_FUNC
918record_mtime(const file_header_t *file_header)
919{
920 ar_mtime = file_header->mtime;
921}
922
923static time_t
924artime(const char *archive, const char *member)
925{
926 archive_handle_t *archive_handle;
927
928 ar_mtime = 0;
929 archive_handle = init_handle();
930 archive_handle->src_fd = open(archive, O_RDONLY);
931 if (archive_handle->src_fd != -1) {
932 archive_handle->action_header = record_mtime;
933 archive_handle->filter = filter_accept_list;
934 llist_add_to_end(&archive_handle->accept, (void *)member);
935 unpack_ar_archive(archive_handle);
936 close(archive_handle->src_fd);
937 }
938
939#if ENABLE_FEATURE_AR_LONG_FILENAMES
940 free(archive_handle->ar__long_names);
941#endif
942 llist_free(archive_handle->accept, NULL);
943 free(archive_handle->file_header);
944 free(archive_handle);
945
946 return ar_mtime;
947}
948
949/*
950 * If the name is of the form 'libname(member.o)' split it into its
951 * name and member parts and set the member pointer to point to the
952 * latter. Otherwise just take a copy of the name and don't alter
953 * the member pointer.
954 *
955 * In either case the return value is an allocated string which must
956 * be freed by the caller.
957 */
958static char *
959splitlib(const char *name, char **member)
960{
961 char *s, *t;
962 size_t len;
963
964 t = xstrdup(name);
965 s = strchr(t, '(');
966 if (s) {
967 // We have 'libname(member.o)'
968 *s++ = '\0';
969 len = strlen(s);
970 if (len <= 1 || s[len - 1] != ')' || *t == '\0')
971 error("invalid name '%s'", name);
972 s[len - 1] = '\0';
973 *member = s;
974 }
975 return t;
976}
977
978/*
979 * Get the modification time of a file. Set it to 0 if the file
980 * doesn't exist.
981 */
982static void
983modtime(struct name *np)
984{
985 char *name, *member = NULL;
986 struct stat info;
987
988 name = splitlib(np->n_name, &member);
989 if (member) {
990 // Looks like library(member)
991 np->n_tim.tv_sec = artime(name, member);
992 np->n_tim.tv_nsec = 0;
993 } else if (stat(name, &info) < 0) {
994 if (errno != ENOENT)
995 bb_perror_msg("can't open %s", name);
996 np->n_tim.tv_sec = 0;
997 np->n_tim.tv_nsec = 0;
998 } else {
999 np->n_tim.tv_sec = info.st_mtim.tv_sec;
1000 np->n_tim.tv_nsec = info.st_mtim.tv_nsec;
1001 }
1002 free(name);
1003}
1004
1005/*
1006 * Control of the implicit suffix rules
1007 */
1008
1009/*
1010 * Return a pointer to the suffix of a name (which may be the
1011 * terminating NUL if there's no suffix).
1012 */
1013static char *
1014suffix(const char *name)
1015{
1016 char *p = strrchr(name, '.');
1017 return p ? p : (char *)name + strlen(name);
1018}
1019
1020/*
1021 * Search for an inference rule to convert some suffix ('psuff')
1022 * to the target suffix 'tsuff'. The basename of the prerequisite
1023 * is 'base'.
1024 */
1025static struct name *
1026dyndep0(char *base, const char *tsuff, struct rule *infrule)
1027{
1028 char *psuff;
1029 struct name *xp; // Suffixes
1030 struct name *sp; // Suffix rule
1031 struct rule *rp;
1032 struct depend *dp;
1033 bool chain = FALSE;
1034
1035 xp = newname(".SUFFIXES");
1036 retry:
1037 for (rp = xp->n_rule; rp; rp = rp->r_next) {
1038 for (dp = rp->r_dep; dp; dp = dp->d_next) {
1039 // Generate new suffix rule to try
1040 psuff = dp->d_name->n_name;
1041 sp = findname(auto_concat(psuff, tsuff));
1042 if (sp && sp->n_rule) {
1043 struct name *ip;
1044 int got_ip;
1045
1046 // Has rule already been used in this chain?
1047 if ((sp->n_flag & N_MARK))
1048 continue;
1049 // Generate a name for an implicit prerequisite
1050 ip = newname(auto_concat(base, psuff));
1051 if ((ip->n_flag & N_DOING))
1052 continue;
1053
1054 if (!ip->n_tim.tv_sec)
1055 modtime(ip);
1056
1057 if (!chain) {
1058 got_ip = ip->n_tim.tv_sec || (ip->n_flag & N_TARGET);
1059 } else {
1060 sp->n_flag |= N_MARK;
1061 got_ip = dyndep(ip, NULL, NULL) != NULL;
1062 sp->n_flag &= ~N_MARK;
1063 }
1064
1065 if (got_ip) {
1066 // Prerequisite exists or we know how to make it
1067 if (infrule) {
1068 dp = NULL;
1069 newdep(&dp, ip);
1070 infrule->r_dep = dp;
1071 infrule->r_cmd = sp->n_rule->r_cmd;
1072 }
1073 return ip;
1074 }
1075 }
1076 }
1077 }
1078 // If we didn't find an existing file or an explicit rule try
1079 // again, this time looking for a chained inference rule.
1080 if (!posix && !chain) {
1081 chain = TRUE;
1082 goto retry;
1083 }
1084 return NULL;
1085}
1086
1087/*
1088 * If 'name' ends with 'suffix' return an allocated string containing
1089 * the name with the suffix removed, else return NULL.
1090 */
1091static char *
1092has_suffix(const char *name, const char *suffix)
1093{
1094 ssize_t delta = strlen(name) - strlen(suffix);
1095 char *base = NULL;
1096
1097 if (delta > 0 && strcmp(name + delta, suffix) == 0) {
1098 base = xstrdup(name);
1099 base[delta] = '\0';
1100 }
1101
1102 return base;
1103}
1104
1105/*
1106 * Dynamic dependency. This routine applies the suffix rules
1107 * to try and find a source and a set of rules for a missing
1108 * target. NULL is returned on failure. On success the name of
1109 * the implicit prerequisite is returned and the rule used is
1110 * placed in the infrule structure provided by the caller.
1111 */
1112static struct name *
1113dyndep(struct name *np, struct rule *infrule, const char **ptsuff)
1114{
1115 const char *tsuff;
1116 char *base, *name, *member;
1117 struct name *pp = NULL; // Implicit prerequisite
1118
1119 member = NULL;
1120 name = splitlib(np->n_name, &member);
1121
1122 // POSIX only allows inference rules with one or two periods.
1123 // As an extension this restriction is lifted, but not for
1124 // targets of the form lib.a(member.o).
1125 if (!posix && member == NULL) {
1126 struct name *xp = newname(".SUFFIXES");
1127 int found_suffix = FALSE;
1128
1129 for (struct rule *rp = xp->n_rule; rp; rp = rp->r_next) {
1130 for (struct depend *dp = rp->r_dep; dp; dp = dp->d_next) {
1131 tsuff = dp->d_name->n_name;
1132 base = has_suffix(name, tsuff);
1133 if (base) {
1134 found_suffix = TRUE;
1135 pp = dyndep0(base, tsuff, infrule);
1136 free(base);
1137 if (pp) {
1138 goto done;
1139 }
1140 }
1141 }
1142 }
1143
1144 if (!found_suffix) {
1145 // The name didn't have a known suffix. Try single-suffix rule.
1146 tsuff = "";
1147 pp = dyndep0(name, tsuff, infrule);
1148 if (pp) {
1149 done:
1150 if (ptsuff) {
1151 *ptsuff = tsuff;
1152 }
1153 }
1154 }
1155 } else {
1156 tsuff = xstrdup(suffix(name));
1157 base = member ? member : name;
1158 *suffix(base) = '\0';
1159
1160 pp = dyndep0(base, tsuff, infrule);
1161 free((void *)tsuff);
1162 }
1163 free(name);
1164
1165 return pp;
1166}
1167
1168#define RULES \
1169 ".c.o:\n" \
1170 " $(CC) $(CFLAGS) -c $<\n" \
1171 ".y.o:\n" \
1172 " $(YACC) $(YFLAGS) $<\n" \
1173 " $(CC) $(CFLAGS) -c y.tab.c\n" \
1174 " rm -f y.tab.c\n" \
1175 " mv y.tab.o $@\n" \
1176 ".y.c:\n" \
1177 " $(YACC) $(YFLAGS) $<\n" \
1178 " mv y.tab.c $@\n" \
1179 ".l.o:\n" \
1180 " $(LEX) $(LFLAGS) $<\n" \
1181 " $(CC) $(CFLAGS) -c lex.yy.c\n" \
1182 " rm -f lex.yy.c\n" \
1183 " mv lex.yy.o $@\n" \
1184 ".l.c:\n" \
1185 " $(LEX) $(LFLAGS) $<\n" \
1186 " mv lex.yy.c $@\n" \
1187 ".c.a:\n" \
1188 " $(CC) -c $(CFLAGS) $<\n" \
1189 " $(AR) $(ARFLAGS) $@ $*.o\n" \
1190 " rm -f $*.o\n" \
1191 ".c:\n" \
1192 " $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $<\n" \
1193 ".sh:\n" \
1194 " cp $< $@\n" \
1195 " chmod a+x $@\n"
1196
1197#define RULES_2017 \
1198 ".SUFFIXES:.o .c .y .l .a .sh .f\n" \
1199 ".f.o:\n" \
1200 " $(FC) $(FFLAGS) -c $<\n" \
1201 ".f.a:\n" \
1202 " $(FC) -c $(FFLAGS) $<\n" \
1203 " $(AR) $(ARFLAGS) $@ $*.o\n" \
1204 " rm -f $*.o\n" \
1205 ".f:\n" \
1206 " $(FC) $(FFLAGS) $(LDFLAGS) -o $@ $<\n"
1207
1208#define RULES_2024 \
1209 ".SUFFIXES:.o .c .y .l .a .sh\n"
1210
1211#define MACROS \
1212 "CFLAGS=-O1\n" \
1213 "YACC=yacc\n" \
1214 "YFLAGS=\n" \
1215 "LEX=lex\n" \
1216 "LFLAGS=\n" \
1217 "AR=ar\n" \
1218 "ARFLAGS=-rv\n" \
1219 "LDFLAGS=\n"
1220
1221#define MACROS_2017 \
1222 "CC=c99\n" \
1223 "FC=fort77\n" \
1224 "FFLAGS=-O1\n" \
1225
1226#define MACROS_2024 \
1227 "CC=c17\n"
1228
1229#define MACROS_EXT \
1230 "CC=cc\n"
1231
1232/*
1233 * Read the built-in rules using a fake fgets-like interface.
1234 */
1235static char *
1236getrules(char *s, int size)
1237{
1238 char *r = s;
1239
1240 if (rulepos == NULL || *rulepos == '\0') {
1241 if (rule_idx == 0) {
1242 rulepos = MACROS;
1243 rule_idx++;
1244 } else if (rule_idx == 1) {
1245 if (POSIX_2017)
1246 rulepos = MACROS_2017;
1247 else if (posix)
1248 rulepos = MACROS_2024;
1249 else
1250 rulepos = MACROS_EXT;
1251 rule_idx++;
1252 } else if (!norules) {
1253 if (rule_idx == 2) {
1254 rulepos = POSIX_2017 ? RULES_2017 : RULES_2024;
1255 rule_idx++;
1256 } else if (rule_idx == 3) {
1257 rulepos = RULES;
1258 rule_idx++;
1259 }
1260 }
1261 }
1262
1263 if (*rulepos == '\0')
1264 return NULL;
1265
1266 while (--size) {
1267 if ((*r++ = *rulepos++) == '\n')
1268 break;
1269 }
1270 *r = '\0';
1271 return s;
1272}
1273
1274/*
1275 * Parse a makefile
1276 */
1277
1278/*
1279 * Return a pointer to the next blank-delimited word or NULL if
1280 * there are none left.
1281 */
1282static char *
1283gettok(char **ptr)
1284{
1285 char *p;
1286
1287 while (isblank(**ptr)) // Skip blanks
1288 (*ptr)++;
1289
1290 if (**ptr == '\0') // Nothing after blanks
1291 return NULL;
1292
1293 p = *ptr; // Word starts here
1294
1295 while (**ptr != '\0' && !isblank(**ptr))
1296 (*ptr)++; // Find end of word
1297
1298 // Terminate token and move on unless already at end of string
1299 if (**ptr != '\0')
1300 *(*ptr)++ = '\0';
1301
1302 return(p);
1303}
1304
1305/*
1306 * Skip over (possibly adjacent or nested) macro expansions.
1307 */
1308static char *
1309skip_macro(const char *s)
1310{
1311 while (*s && s[0] == '$') {
1312 if (s[1] == '(' || s[1] == '{') {
1313 char end = *++s == '(' ? ')' : '}';
1314 while (*s && *s != end)
1315 s = skip_macro(s + 1);
1316 if (*s == end)
1317 ++s;
1318 } else if (s[1] != '\0') {
1319 s += 2;
1320 } else {
1321 break;
1322 }
1323 }
1324 return (char *)s;
1325}
1326
1327/*
1328 * Process each whitespace-separated word in the input string:
1329 *
1330 * - replace paths with their directory or filename part
1331 * - replace prefixes and suffixes
1332 *
1333 * Returns an allocated string or NULL if the input is unmodified.
1334 */
1335static char *
1336modify_words(const char *val, int modifier, size_t lenf, size_t lenr,
1337 const char *find_pref, const char *repl_pref,
1338 const char *find_suff, const char *repl_suff)
1339{
1340 char *s, *copy, *word, *sep, *buf = NULL;
1341 size_t find_pref_len = 0, find_suff_len = 0;
1342
1343 if (!modifier && lenf == 0 && lenr == 0)
1344 return buf;
1345
1346 if (find_pref) {
1347 // get length of find prefix, e.g: src/
1348 find_pref_len = strlen(find_pref);
1349 // get length of find suffix, e.g: .c
1350 find_suff_len = lenf - find_pref_len - 1;
1351 }
1352
1353 s = copy = xstrdup(val);
1354 while ((word = gettok(&s)) != NULL) {
1355 if (modifier) {
1356 sep = strrchr(word, '/');
1357 if (modifier == 'D') {
1358 if (!sep) {
1359 word[0] = '.'; // no '/', return "."
1360 sep = word + 1;
1361 } else if (sep == word) {
1362 // '/' at start of word, return "/"
1363 sep = word + 1;
1364 }
1365 // else terminate at separator
1366 *sep = '\0';
1367 } else if (/* modifier == 'F' && */ sep) {
1368 word = sep + 1;
1369 }
1370 }
1371 if (find_pref != NULL || lenf != 0 || lenr != 0) {
1372 size_t lenw = strlen(word);
1373 // This code implements pattern macro expansions:
1374 // https://austingroupbugs.net/view.php?id=519
1375 //
1376 // find: <prefix>%<suffix>
1377 // example: src/%.c
1378 //
1379 // For a pattern of the form:
1380 // $(string1:[op]%[os]=[np][%][ns])
1381 // lenf is the length of [op]%[os]. So lenf >= 1.
1382 if (find_pref != NULL && lenw + 1 >= lenf) {
1383 // If prefix and suffix of word match find_pref and
1384 // find_suff, then do substitution.
1385 if (strncmp(word, find_pref, find_pref_len) == 0 &&
1386 strcmp(word + lenw - find_suff_len, find_suff) == 0) {
1387 // replace: <prefix>[%<suffix>]
1388 // example: build/%.o or build/all.o (notice no %)
1389 // If repl_suff is NULL, replace whole word with repl_pref.
1390 if (!repl_suff) {
1391 word = xstrdup(repl_pref);
1392 } else {
1393 word[lenw - find_suff_len] = '\0';
1394 word = xasprintf("%s%s%s", repl_pref,
1395 word + find_pref_len, repl_suff);
1396 }
1397 word = auto_string(word);
1398 }
1399 } else if (lenw >= lenf &&
1400 strcmp(word + lenw - lenf, find_suff) == 0) {
1401 word[lenw - lenf] = '\0';
1402 word = auto_concat(word, repl_suff);
1403 }
1404 }
1405 buf = xappendword(buf, word);
1406 }
1407 free(copy);
1408 return buf;
1409}
1410
1411/*
1412 * Return a pointer to the next instance of a given character. Macro
1413 * expansions are skipped so the ':' and '=' in $(VAR:.s1=.s2) aren't
1414 * detected as separators in macro definitions. Some other situations
1415 * also require skipping the internals of a macro expansion.
1416 */
1417static char *
1418find_char(const char *str, int c)
1419{
1420 const char *s;
1421
1422 for (s = skip_macro(str); *s; s = skip_macro(s + 1)) {
1423 if (*s == c)
1424 return (char *)s;
1425 }
1426 return NULL;
1427}
1428
1429#if ENABLE_PLATFORM_MINGW32
1430/*
1431 * Check for a target rule by searching for a colon that isn't
1432 * part of a Windows path. Return a pointer to the colon or NULL.
1433 */
1434static char *
1435find_colon(char *p)
1436{
1437 char *q;
1438
1439 for (q = p; (q = strchr(q, ':')); ++q) {
1440 if (posix && !(pragma & P_WINDOWS))
1441 break;
1442 if (q == p || !isalpha(q[-1]) || q[1] != '/')
1443 break;
1444 }
1445 return q;
1446}
1447#else
1448# define find_colon(s) strchr(s, ':')
1449#endif
1450
1451/*
1452 * Recursively expand any macros in str to an allocated string.
1453 */
1454static char *
1455expand_macros(const char *str, int except_dollar)
1456{
1457 char *exp, *newexp, *s, *t, *p, *q, *name;
1458 char *find, *replace, *modified;
1459 char *expval, *expfind, *find_suff, *repl_suff;
1460 char *find_pref = NULL, *repl_pref = NULL;
1461 size_t lenf, lenr;
1462 char modifier;
1463 struct macro *mp;
1464
1465 exp = xstrdup(str);
1466 for (t = exp; *t; t++) {
1467 if (*t == '$') {
1468 if (t[1] == '\0') {
1469 break;
1470 }
1471 if (t[1] == '$' && except_dollar) {
1472 t++;
1473 continue;
1474 }
1475 // Need to expand a macro. Find its extent (s to t inclusive)
1476 // and take a copy of its content.
1477 s = t;
1478 t++;
1479 if (*t == '{' || *t == '(') {
1480 t = find_char(t, *t == '{' ? '}' : ')');
1481 if (t == NULL)
1482 error("unterminated variable '%s'", s);
1483 name = xstrndup(s + 2, t - s - 2);
1484 } else {
1485 name = xzalloc(2);
1486 name[0] = *t;
1487 /*name[1] = '\0'; - xzalloc did it */
1488 }
1489
1490 // Only do suffix replacement or pattern macro expansion
1491 // if both ':' and '=' are found, plus a '%' for the latter.
1492 // Suffix replacement is indicated by
1493 // find_pref == NULL && (lenf != 0 || lenr != 0);
1494 // pattern macro expansion by find_pref != NULL.
1495 expfind = NULL;
1496 find_suff = repl_suff = NULL;
1497 lenf = lenr = 0;
1498 if ((find = find_char(name, ':'))) {
1499 *find++ = '\0';
1500 expfind = expand_macros(find, FALSE);
1501 if ((replace = find_char(expfind, '='))) {
1502 *replace++ = '\0';
1503 lenf = strlen(expfind);
1504 if (!POSIX_2017 && (find_suff = strchr(expfind, '%'))) {
1505 find_pref = expfind;
1506 repl_pref = replace;
1507 *find_suff++ = '\0';
1508 if ((repl_suff = strchr(replace, '%')))
1509 *repl_suff++ = '\0';
1510 } else {
1511 if (posix && !(pragma & P_EMPTY_SUFFIX) && lenf == 0)
1512 error("empty suffix%s",
1513 !ENABLE_FEATURE_MAKE_POSIX ? "" :
1514 ": allow with pragma empty_suffix");
1515 find_suff = expfind;
1516 repl_suff = replace;
1517 lenr = strlen(repl_suff);
1518 }
1519 }
1520 }
1521
1522 p = q = name;
1523 // If not in POSIX mode expand macros in the name.
1524 if (!POSIX_2017) {
1525 char *expname = expand_macros(name, FALSE);
1526 free(name);
1527 name = expname;
1528 } else {
1529 // Skip over nested expansions in name
1530 do {
1531 *q++ = *p;
1532 } while ((p = skip_macro(p + 1)) && *p);
1533 }
1534
1535 // The internal macros support 'D' and 'F' modifiers
1536 modifier = '\0';
1537 switch (name[0]) {
1538 case '^':
1539 case '+':
1540 if (POSIX_2017)
1541 break;
1542 // fall through
1543 case '@': case '%': case '?': case '<': case '*':
1544 if ((name[1] == 'D' || name[1] == 'F') && name[2] == '\0') {
1545 modifier = name[1];
1546 name[1] = '\0';
1547 }
1548 break;
1549 }
1550
1551 modified = NULL;
1552 if ((mp = getmp(name))) {
1553 // Recursive expansion
1554 if (mp->m_flag)
1555 error("recursive macro %s", name);
1556 // Note if we've expanded $(MAKE)
1557 if (strcmp(name, "MAKE") == 0)
1558 opts |= OPT_make;
1559 mp->m_flag = TRUE;
1560 expval = expand_macros(mp->m_val, FALSE);
1561 mp->m_flag = FALSE;
1562 modified = modify_words(expval, modifier, lenf, lenr,
1563 find_pref, repl_pref, find_suff, repl_suff);
1564 if (modified)
1565 free(expval);
1566 else
1567 modified = expval;
1568 }
1569 free(name);
1570 free(expfind);
1571
1572 if (modified && *modified) {
1573 // The text to be replaced by the macro expansion is
1574 // from s to t inclusive.
1575 *s = '\0';
1576 newexp = xasprintf("%s%s%s", exp, modified, t + 1);
1577 t = newexp + (s - exp) + strlen(modified) - 1;
1578 free(exp);
1579 exp = newexp;
1580 } else {
1581 // Macro wasn't expanded or expanded to nothing.
1582 // Close the space occupied by the macro reference.
1583 q = t + 1;
1584 t = s - 1;
1585 while ((*s++ = *q++))
1586 continue;
1587 }
1588 free(modified);
1589 }
1590 }
1591 return exp;
1592}
1593
1594/*
1595 * Process a non-command line
1596 */
1597static void
1598process_line(char *s)
1599{
1600 char *t;
1601
1602 // Strip comment
1603 // don't treat '#' in macro expansion as a comment
1604 // nor '#' outside macro expansion preceded by backslash
1605 if (!posix) {
1606 char *u = s;
1607 while ((t = find_char(u, '#')) && t > u && t[-1] == '\\') {
1608 for (u = t; *u; ++u) {
1609 u[-1] = u[0];
1610 }
1611 *u = '\0';
1612 u = t;
1613 }
1614 } else
1615 t = strchr(s, '#');
1616 if (t)
1617 *t = '\0';
1618
1619 // Replace escaped newline and any leading white space on the
1620 // following line with a single space. Stop processing at a
1621 // non-escaped newline.
1622 for (t = s; *s && *s != '\n'; ) {
1623 if (s[0] == '\\' && s[1] == '\n') {
1624 s += 2;
1625 while (isspace(*s))
1626 ++s;
1627 *t++ = ' ';
1628 } else {
1629 *t++ = *s++;
1630 }
1631 }
1632 *t = '\0';
1633}
1634
1635enum {
1636 INITIAL = 0,
1637 SKIP_LINE = 1 << 0,
1638 EXPECT_ELSE = 1 << 1,
1639 GOT_MATCH = 1 << 2
1640};
1641
1642#define IFDEF 0
1643#define IFNDEF 1
1644#define IFEQ 2
1645#define IFNEQ 3
1646#define ELSE 0
1647#define ENDIF 1
1648
1649/*
1650 * Extract strings following ifeq/ifneq and compare them.
1651 * Return -1 on error.
1652 */
1653static int
1654compare_strings(char *arg1)
1655{
1656 char *arg2, *end, term, *t1, *t2;
1657 int ret;
1658
1659 // Get first string terminator.
1660 if (arg1[0] == '(')
1661 term = ',';
1662 else if (arg1[0] == '"' || arg1[0] == '\'')
1663 term = arg1[0];
1664 else
1665 return -1;
1666
1667 arg2 = find_char(++arg1, term);
1668 if (arg2 == NULL)
1669 return -1;
1670 *arg2++ = '\0';
1671
1672 // Get second string terminator.
1673 if (term == ',') {
1674 term = ')';
1675 } else {
1676 // Skip spaces between quoted strings.
1677 while (isspace(arg2[0]))
1678 arg2++;
1679 if (arg2[0] == '"' || arg2[0] == '\'')
1680 term = arg2[0];
1681 else
1682 return -1;
1683 ++arg2;
1684 }
1685
1686 end = find_char(arg2, term);
1687 if (end == NULL)
1688 return -1;
1689 *end++ = '\0';
1690
1691 if (gettok(&end) != NULL) {
1692 warning("unexpected text");
1693 }
1694
1695 t1 = expand_macros(arg1, FALSE);
1696 t2 = expand_macros(arg2, FALSE);
1697
1698 ret = strcmp(t1, t2) == 0;
1699 free(t1);
1700 free(t2);
1701 return ret;
1702}
1703
1704/*
1705 * Process conditional directives and return TRUE if the current line
1706 * should be skipped.
1707 */
1708static int
1709skip_line(const char *str1)
1710{
1711 char *copy, *q, *token;
1712 bool new_level = TRUE;
1713 // Default is to return skip flag for current level
1714 int ret = cstate[clevel] & SKIP_LINE;
1715 int key;
1716
1717 q = copy = xstrdup(str1);
1718 process_line(copy);
1719 if ((token = gettok(&q)) != NULL) {
1720 switch (index_in_strings("else\0endif\0", token)) {
1721 case ENDIF:
1722 if (gettok(&q) != NULL)
1723 error_unexpected("text");
1724 if (clevel == 0)
1725 error_unexpected(token);
1726 --clevel;
1727 ret = TRUE;
1728 goto end;
1729 case ELSE:
1730 if (!(cstate[clevel] & EXPECT_ELSE))
1731 error_unexpected(token);
1732
1733 // If an earlier condition matched we'll now skip lines.
1734 // If not we don't, though an 'else if' may override this.
1735 if ((cstate[clevel] & GOT_MATCH))
1736 cstate[clevel] |= SKIP_LINE;
1737 else
1738 cstate[clevel] &= ~SKIP_LINE;
1739
1740 token = gettok(&q);
1741 if (token == NULL) {
1742 // Simple else with no conditional directive
1743 cstate[clevel] &= ~EXPECT_ELSE;
1744 ret = TRUE;
1745 goto end;
1746 } else {
1747 // A conditional directive is now required ('else if').
1748 new_level = FALSE;
1749 }
1750 }
1751
1752 key = index_in_strings("ifdef\0ifndef\0ifeq\0ifneq\0", token);
1753 if (key != -1) {
1754 int match;
1755
1756 if (key == IFDEF || key == IFNDEF) {
1757 // ifdef/ifndef: find out if macro is defined.
1758 char *name = gettok(&q);
1759 if (name != NULL && gettok(&q) == NULL) {
1760 char *t = expand_macros(name, FALSE);
1761 struct macro *mp = getmp(t);
1762 match = mp != NULL && mp->m_val[0] != '\0';
1763 free(t);
1764 } else {
1765 match = -1;
1766 }
1767 } else {
1768 // ifeq/ifneq: compare strings.
1769 match = compare_strings(q);
1770 }
1771
1772 if (match >= 0) {
1773 if (new_level) {
1774 // Start a new level.
1775 if (clevel == IF_MAX)
1776 error("nesting too deep");
1777 ++clevel;
1778 cstate[clevel] = EXPECT_ELSE | SKIP_LINE;
1779 // If we were skipping lines at the previous level
1780 // we need to continue doing that unconditionally
1781 // at the new level.
1782 if ((cstate[clevel - 1] & SKIP_LINE))
1783 cstate[clevel] |= GOT_MATCH;
1784 }
1785
1786 if (!(cstate[clevel] & GOT_MATCH)) {
1787 if (key == IFNDEF || key == IFNEQ)
1788 match = !match;
1789 if (match) {
1790 cstate[clevel] &= ~SKIP_LINE;
1791 cstate[clevel] |= GOT_MATCH;
1792 }
1793 }
1794 } else {
1795 error("invalid condition");
1796 }
1797 ret = TRUE;
1798 } else if (!new_level) {
1799 error("missing conditional");
1800 }
1801 }
1802 end:
1803 free(copy);
1804 return ret;
1805}
1806
1807/*
1808 * If fd is NULL read the built-in rules. Otherwise read from the
1809 * specified file descriptor.
1810 */
1811static char *
1812make_fgets(char *s, int size, FILE *fd)
1813{
1814 return fd ? fgets(s, size, fd) : getrules(s, size);
1815}
1816
1817/*
1818 * Read a newline-terminated line into an allocated string.
1819 * Backslash-escaped newlines don't terminate the line.
1820 * Ignore comment lines. Return NULL on EOF.
1821 */
1822static char *
1823readline(FILE *fd, int want_command)
1824{
1825 char *p, *str = NULL;
1826 int pos = 0;
1827 int len = 0;
1828
1829 for (;;) {
1830 // We need room for at least one character and a NUL terminator
1831 if (len - pos > 1 &&
1832 make_fgets(str + pos, len - pos, fd) == NULL) {
1833 if (pos)
1834 return str;
1835 free(str);
1836 return NULL; // EOF
1837 }
1838
1839 if (len - pos < 2 || (p = strchr(str + pos, '\n')) == NULL) {
1840 // Need more room
1841 if (len)
1842 pos = len - 1;
1843 len += 256;
1844 str = xrealloc(str, len);
1845 continue;
1846 }
1847 lineno++;
1848
1849#if ENABLE_PLATFORM_MINGW32
1850 // Remove CR before LF
1851 if (p != str && p[-1] == '\r') {
1852 p[-1] = '\n';
1853 *p-- = '\0';
1854 }
1855#endif
1856 // Keep going if newline has been escaped
1857 if (p != str && p[-1] == '\\') {
1858 pos = p - str + 1;
1859 continue;
1860 }
1861 dispno = lineno;
1862
1863 // Check for lines that are conditionally skipped.
1864 if (posix || !skip_line(str)) {
1865 if (want_command && *str == '\t')
1866 return str;
1867
1868 // Check for comment lines
1869 p = str;
1870 while (isblank(*p))
1871 p++;
1872
1873 if (*p != '\n' && (posix ? *str != '#' : *p != '#'))
1874 return str;
1875 }
1876
1877 pos = 0;
1878 }
1879}
1880
1881/*
1882 * Return a pointer to the suffix name if the argument is a known suffix
1883 * or NULL if it isn't.
1884 */
1885static const char *
1886is_suffix(const char *s)
1887{
1888 struct name *np;
1889 struct rule *rp;
1890 struct depend *dp;
1891
1892 np = newname(".SUFFIXES");
1893 for (rp = np->n_rule; rp; rp = rp->r_next) {
1894 for (dp = rp->r_dep; dp; dp = dp->d_next) {
1895 if (strcmp(s, dp->d_name->n_name) == 0) {
1896 return dp->d_name->n_name;
1897 }
1898 }
1899 }
1900 return NULL;
1901}
1902
1903/*
1904 * Return TRUE if the argument is formed by concatenating two
1905 * known suffixes.
1906 */
1907static int
1908is_inference_target(const char *s)
1909{
1910 struct name *np;
1911 struct rule *rp1, *rp2;
1912 struct depend *dp1, *dp2;
1913
1914 np = newname(".SUFFIXES");
1915 for (rp1 = np->n_rule; rp1; rp1 = rp1->r_next) {
1916 for (dp1 = rp1->r_dep; dp1; dp1 = dp1->d_next) {
1917 const char *suff1 = dp1->d_name->n_name;
1918 size_t len = strlen(suff1);
1919
1920 if (strncmp(s, suff1, len) == 0) {
1921 for (rp2 = np->n_rule; rp2; rp2 = rp2->r_next) {
1922 for (dp2 = rp2->r_dep; dp2; dp2 = dp2->d_next) {
1923 const char *suff2 = dp2->d_name->n_name;
1924 if (strcmp(s + len, suff2) == 0) {
1925 return TRUE;
1926 }
1927 }
1928 }
1929 }
1930 }
1931 }
1932 return FALSE;
1933}
1934
1935enum {
1936 T_NORMAL = 0,
1937 T_SPECIAL = (1 << 0),
1938 T_INFERENCE = (1 << 1), // Inference rule
1939 T_NOPREREQ = (1 << 2), // If set must not have prerequisites
1940 T_COMMAND = (1 << 3), // If set must have commands, if unset must not
1941};
1942
1943/*
1944 * Determine if the argument is a special target and return a set
1945 * of flags indicating its properties.
1946 */
1947static int
1948target_type(char *s)
1949{
1950 int ret;
1951 static const char *s_name =
1952 ".DEFAULT\0"
1953 ".POSIX\0"
1954 ".IGNORE\0"
1955 ".PRECIOUS\0"
1956 ".SILENT\0"
1957 ".SUFFIXES\0"
1958 ".PHONY\0"
1959 ".NOTPARALLEL\0"
1960 ".WAIT\0"
1961#if ENABLE_FEATURE_MAKE_POSIX
1962 ".PRAGMA\0"
1963#endif
1964 ;
1965
1966 static const uint8_t s_type[] = {
1967 T_SPECIAL | T_NOPREREQ | T_COMMAND,
1968 T_SPECIAL | T_NOPREREQ,
1969 T_SPECIAL,
1970 T_SPECIAL,
1971 T_SPECIAL,
1972 T_SPECIAL,
1973 T_SPECIAL,
1974 T_SPECIAL | T_NOPREREQ,
1975 T_SPECIAL | T_NOPREREQ,
1976 T_SPECIAL,
1977 };
1978
1979 // Check for one of the known special targets
1980 ret = index_in_strings(s_name, s);
1981 if (ret >= 0)
1982 return s_type[ret];
1983
1984 // Check for an inference rule
1985 ret = T_NORMAL;
1986 if (!posix) {
1987 if (is_suffix(s) || is_inference_target(s)) {
1988 ret = T_INFERENCE | T_NOPREREQ | T_COMMAND;
1989 }
1990 } else {
1991 // In POSIX inference rule targets must contain one or two dots
1992 char *sfx = suffix(s);
1993 if (*s == '.' && is_suffix(sfx)) {
1994 if (s == sfx) { // Single suffix rule
1995 ret = T_INFERENCE | T_NOPREREQ | T_COMMAND;
1996 } else {
1997 // Suffix is valid, check that prefix is too
1998 *sfx = '\0';
1999 if (is_suffix(s))
2000 ret = T_INFERENCE | T_NOPREREQ | T_COMMAND;
2001 *sfx = '.';
2002 }
2003 }
2004 }
2005 return ret;
2006}
2007
2008static int
2009ends_with_bracket(const char *s)
2010{
2011 return last_char_is(s, ')') != NULL;
2012}
2013
2014/*
2015 * Process a command line
2016 */
2017static char *
2018process_command(char *s)
2019{
2020 char *t, *u;
2021 int len;
2022 char *outside;
2023
2024 if (!(pragma & P_COMMAND_COMMENT) && posix) {
2025 // POSIX strips comments from command lines
2026 t = strchr(s, '#');
2027 if (t) {
2028 *t = '\0';
2029 warning("comment in command removed: keep with pragma command_comment");
2030 }
2031 }
2032
2033 len = strlen(s) + 1;
2034 outside = xzalloc(len);
2035 for (t = skip_macro(s); *t; t = skip_macro(t + 1)) {
2036 outside[t - s] = 1;
2037 }
2038
2039 // Process escaped newlines. Stop at first non-escaped newline.
2040 for (t = u = s; *u && *u != '\n'; ) {
2041 if (u[0] == '\\' && u[1] == '\n') {
2042 if (POSIX_2017 || outside[u - s]) {
2043 // Outside macro: remove tab following escaped newline.
2044 *t++ = *u++;
2045 *t++ = *u++;
2046 u += (*u == '\t');
2047 } else {
2048 // Inside macro: replace escaped newline and any leading
2049 // whitespace on the following line with a single space.
2050 u += 2;
2051 while (isspace(*u))
2052 ++u;
2053 *t++ = ' ';
2054 }
2055 } else {
2056 *t++ = *u++;
2057 }
2058 }
2059 *t = '\0';
2060 free(outside);
2061 return s;
2062}
2063
2064static char *
2065run_command(const char *cmd)
2066{
2067 FILE *fd;
2068 char *s, *val = NULL;
2069 char buf[256];
2070 size_t len = 0, nread;
2071
2072 if ((fd = popen(cmd, "r")) == NULL)
2073 return val;
2074
2075 for (;;) {
2076 nread = fread(buf, 1, sizeof(buf), fd);
2077 if (nread == 0)
2078 break;
2079
2080 val = xrealloc(val, len + nread + 1);
2081 memcpy(val + len, buf, nread);
2082 len += nread;
2083 val[len] = '\0';
2084 }
2085 pclose(fd);
2086
2087 if (val == NULL)
2088 return NULL;
2089
2090 // Strip leading whitespace in POSIX 2024 mode
2091 if (posix) {
2092 s = val;
2093 while (isspace(*s)) {
2094 ++s;
2095 --len;
2096 }
2097
2098 if (len == 0) {
2099 free(val);
2100 return NULL;
2101 }
2102 memmove(val, s, len + 1);
2103 }
2104
2105#if ENABLE_PLATFORM_MINGW32
2106 len = remove_cr(val, len + 1) - 1;
2107 if (len == 0) {
2108 free(val);
2109 return NULL;
2110 }
2111#endif
2112
2113 // Remove one newline from the end (BSD compatibility)
2114 if (val[len - 1] == '\n')
2115 val[len - 1] = '\0';
2116 // Other newlines are changed to spaces
2117 for (s = val; *s; ++s) {
2118 if (*s == '\n')
2119 *s = ' ';
2120 }
2121 return val;
2122}
2123
2124/*
2125 * Check for an unescaped wildcard character
2126 */
2127static int wildchar(const char *p)
2128{
2129 while (*p) {
2130 switch (*p) {
2131 case '?':
2132 case '*':
2133 case '[':
2134 return 1;
2135 case '\\':
2136 if (p[1] != '\0')
2137 ++p;
2138 break;
2139 }
2140 ++p;
2141 }
2142 return 0;
2143}
2144
2145/*
2146 * Expand any wildcards in a pattern. Return TRUE if a match is
2147 * found, in which case the caller should call globfree() on the
2148 * glob_t structure.
2149 */
2150static int
2151wildcard(char *p, glob_t *gd)
2152{
2153 int ret;
2154 char *s;
2155
2156 // Don't call glob() if there are no wildcards.
2157 if (!wildchar(p)) {
2158 nomatch:
2159 // Remove backslashes from the name.
2160 for (s = p; *p; ++p) {
2161 if (*p == '\\' && p[1] != '\0')
2162 continue;
2163 *s++ = *p;
2164 }
2165 *s = '\0';
2166 return 0;
2167 }
2168
2169 memset(gd, 0, sizeof(*gd));
2170 ret = glob(p, GLOB_NOSORT, NULL, gd);
2171 if (ret == GLOB_NOMATCH) {
2172 globfree(gd);
2173 goto nomatch;
2174 } else if (ret != 0) {
2175 error("glob error for '%s'", p);
2176 }
2177 return 1;
2178}
2179
2180#if ENABLE_FEATURE_MAKE_POSIX
2181static void
2182pragmas_from_env(void)
2183{
2184 char *p, *q, *var;
2185 const char *env = getenv("PDPMAKE_PRAGMAS");
2186
2187 if (env == NULL)
2188 return;
2189
2190 q = var = xstrdup(env);
2191 while ((p = gettok(&q)) != NULL)
2192 set_pragma(p);
2193 free(var);
2194}
2195#endif
2196
2197/*
2198 * Determine if a line is a target rule with an inline command.
2199 * Return a pointer to the semicolon separator if it is, else NULL.
2200 */
2201static char *
2202inline_command(char *line)
2203{
2204 char *p = find_char(line, ':');
2205
2206 if (p)
2207 p = strchr(p, ';');
2208 return p;
2209}
2210
2211/*
2212 * Parse input from the makefile and construct a tree structure of it.
2213 */
2214static void
2215input(FILE *fd, int ilevel)
2216{
2217 char *p, *q, *s, *a, *str, *expanded, *copy;
2218 char *str1, *str2;
2219 struct name *np;
2220 struct depend *dp;
2221 struct cmd *cp;
2222 int startno, count;
2223 bool semicolon_cmd, seen_inference;
2224 uint8_t old_clevel = clevel;
2225 bool dbl;
2226 char *lib = NULL;
2227 glob_t gd;
2228 int nfile, i;
2229 char **files;
2230 bool minus;
2231
2232 lineno = 0;
2233 str1 = readline(fd, FALSE);
2234 while (str1) {
2235 str2 = NULL;
2236
2237 // Newlines and comments are handled differently in command lines
2238 // and other types of line. Take a copy of the current line before
2239 // processing it as a non-command line in case it contains a
2240 // rule with a command line. That is, a line of the form:
2241 //
2242 // target: prereq; command
2243 //
2244 copy = xstrdup(str1);
2245 process_line(str1);
2246 str = str1;
2247
2248 // Check for an include line
2249 if (!posix)
2250 while (isblank(*str))
2251 ++str;
2252 minus = !POSIX_2017 && *str == '-';
2253 p = str + minus;
2254 if (strncmp(p, "include", 7) == 0 && isblank(p[7])) {
2255 const char *old_makefile = makefile;
2256 int old_lineno = lineno;
2257
2258 if (ilevel > 16)
2259 error("too many includes");
2260
2261 count = 0;
2262 q = expanded = expand_macros(p + 7, FALSE);
2263 while ((p = gettok(&q)) != NULL) {
2264 FILE *ifd;
2265
2266 ++count;
2267 if (!POSIX_2017) {
2268 // Try to create include file or bring it up-to-date
2269 opts |= OPT_include;
2270 make(newname(p), 1);
2271 opts &= ~OPT_include;
2272 }
2273 if ((ifd = fopen(p, "r")) == NULL) {
2274 if (!minus)
2275 error("can't open include file '%s'", p);
2276 } else {
2277 makefile = p;
2278 input(ifd, ilevel + 1);
2279 fclose(ifd);
2280 makefile = old_makefile;
2281 lineno = old_lineno;
2282 }
2283 if (POSIX_2017)
2284 break;
2285 }
2286 if (POSIX_2017) {
2287 // In POSIX 2017 zero or more than one include file is
2288 // unspecified behaviour.
2289 if (p == NULL || gettok(&q)) {
2290 error("one include file per line");
2291 }
2292 } else if (count == 0) {
2293 // In POSIX 2024 no include file is unspecified behaviour.
2294 if (posix)
2295 error("no include file");
2296 }
2297 goto end_loop;
2298 }
2299
2300 // Check for a macro definition
2301 str = str1;
2302 // POSIX 2024 seems to allow a tab as the first character of
2303 // a macro definition, though most implementations don't.
2304 if (POSIX_2017 && *str == '\t')
2305 error("command not allowed here");
2306 if (find_char(str, '=') != NULL) {
2307 int level = (useenv || fd == NULL) ? 4 : 3;
2308 // Use a copy of the line: we might need the original
2309 // if this turns out to be a target rule.
2310 char *copy2 = xstrdup(str);
2311 char *newq = NULL;
2312 char eq = '\0';
2313 q = find_char(copy2, '='); // q can't be NULL
2314
2315 if (q - 1 > copy2) {
2316 switch (q[-1]) {
2317 case ':':
2318 // '::=' and ':::=' are from POSIX 2024.
2319 if (!POSIX_2017 && q - 2 > copy2 && q[-2] == ':') {
2320 if (q - 3 > copy2 && q[-3] == ':') {
2321 eq = 'B'; // BSD-style ':='
2322 q[-3] = '\0';
2323 } else {
2324 eq = ':'; // GNU-style ':='
2325 q[-2] = '\0';
2326 }
2327 break;
2328 }
2329 // ':=' is a non-POSIX extension.
2330 if (posix)
2331 break;
2332 goto set_eq;
2333 case '+':
2334 case '?':
2335 case '!':
2336 // '+=', '?=' and '!=' are from POSIX 2024.
2337 if (POSIX_2017)
2338 break;
2339 set_eq:
2340 eq = q[-1];
2341 q[-1] = '\0';
2342 break;
2343 }
2344 }
2345 *q++ = '\0'; // Separate name and value
2346 while (isblank(*q))
2347 q++;
2348 if ((p = strrchr(q, '\n')) != NULL)
2349 *p = '\0';
2350
2351 // Expand left-hand side of assignment
2352 p = expanded = expand_macros(copy2, FALSE);
2353 if ((a = gettok(&p)) == NULL)
2354 error("invalid macro assignment");
2355
2356 // If the expanded LHS contains ':' and ';' it can't be a
2357 // macro assignment but it might be a target rule.
2358 if ((s = strchr(a, ':')) != NULL && strchr(s, ';') != NULL) {
2359 free(expanded);
2360 free(copy2);
2361 goto try_target;
2362 }
2363
2364 if (gettok(&p))
2365 error("invalid macro assignment");
2366
2367 if (eq == ':') {
2368 // GNU-style ':='. Expand right-hand side of assignment.
2369 // Macro is of type immediate-expansion.
2370 q = newq = expand_macros(q, FALSE);
2371 level |= M_IMMEDIATE;
2372 }
2373 else if (eq == 'B') {
2374 // BSD-style ':='. Expand right-hand side of assignment,
2375 // though not '$$'. Macro is of type delayed-expansion.
2376 q = newq = expand_macros(q, TRUE);
2377 } else if (eq == '?' && getmp(a) != NULL) {
2378 // Skip assignment if macro is already set
2379 goto end_loop;
2380 } else if (eq == '+') {
2381 // Append to current value
2382 struct macro *mp = getmp(a);
2383 char *rhs;
2384 newq = mp && mp->m_val[0] ? xstrdup(mp->m_val) : NULL;
2385 if (mp && mp->m_immediate) {
2386 // Expand right-hand side of assignment (GNU make
2387 // compatibility)
2388 rhs = expand_macros(q, FALSE);
2389 level |= M_IMMEDIATE;
2390 } else {
2391 rhs = q;
2392 }
2393 newq = xappendword(newq, rhs);
2394 if (rhs != q)
2395 free(rhs);
2396 q = newq;
2397 } else if (eq == '!') {
2398 char *cmd = expand_macros(q, FALSE);
2399 q = newq = run_command(cmd);
2400 free(cmd);
2401 }
2402 setmacro(a, q, level);
2403 free(newq);
2404 free(copy2);
2405 goto end_loop;
2406 }
2407
2408 // If we get here it must be a target rule
2409 try_target:
2410 if (*str == '\t') // Command without target
2411 error("command not allowed here");
2412 p = expanded = expand_macros(str, FALSE);
2413
2414 // Look for colon separator
2415 q = find_colon(p);
2416 if (q == NULL)
2417 error("expected separator");
2418
2419 *q++ = '\0'; // Separate targets and prerequisites
2420
2421 // Double colon
2422 dbl = !posix && *q == ':';
2423 if (dbl)
2424 q++;
2425
2426 // Look for semicolon separator
2427 cp = NULL;
2428 s = strchr(q, ';');
2429 if (s) {
2430 // Retrieve command from original or expanded copy of line
2431 char *copy3 = expand_macros(copy, FALSE);
2432 if ((p = inline_command(copy)) || (p = inline_command(copy3)))
2433 newcmd(&cp, process_command(p + 1));
2434 free(copy3);
2435 *s = '\0';
2436 }
2437 semicolon_cmd = cp != NULL && cp->c_cmd[0] != '\0';
2438
2439 // Create list of prerequisites
2440 dp = NULL;
2441 while (((p = gettok(&q)) != NULL)) {
2442 char *newp = NULL;
2443
2444 if (!posix) {
2445 // Allow prerequisites of form library(member1 member2).
2446 // Leading and trailing spaces in the brackets are skipped.
2447 if (!lib) {
2448 s = strchr(p, '(');
2449 if (s && !ends_with_bracket(s) && strchr(q, ')')) {
2450 // Looks like an unterminated archive member
2451 // with a terminator later on the line.
2452 lib = p;
2453 if (s[1] != '\0') {
2454 p = newp = auto_concat(lib, ")");
2455 s[1] = '\0';
2456 } else {
2457 continue;
2458 }
2459 }
2460 } else if (ends_with_bracket(p)) {
2461 if (*p != ')')
2462 p = newp = auto_concat(lib, p);
2463 lib = NULL;
2464 if (newp == NULL)
2465 continue;
2466 } else {
2467 p = newp = auto_string(xasprintf("%s%s)", lib, p));
2468 }
2469 }
2470
2471 // If not in POSIX mode expand wildcards in the name.
2472 nfile = 1;
2473 files = &p;
2474 if (!posix && wildcard(p, &gd)) {
2475 nfile = gd.gl_pathc;
2476 files = gd.gl_pathv;
2477 }
2478 for (i = 0; i < nfile; ++i) {
2479 if (!POSIX_2017 && strcmp(files[i], ".WAIT") == 0)
2480 continue;
2481 np = newname(files[i]);
2482 newdep(&dp, np);
2483 }
2484 if (files != &p)
2485 globfree(&gd);
2486 free(newp);
2487 }
2488 lib = NULL;
2489
2490 // Create list of commands
2491 startno = dispno;
2492 while ((str2 = readline(fd, TRUE)) && *str2 == '\t') {
2493 newcmd(&cp, process_command(str2));
2494 free(str2);
2495 }
2496 dispno = startno;
2497
2498 // Create target names and attach rule to them
2499 q = expanded;
2500 count = 0;
2501 seen_inference = FALSE;
2502 while ((p = gettok(&q)) != NULL) {
2503 // If not in POSIX mode expand wildcards in the name.
2504 nfile = 1;
2505 files = &p;
2506 if (!posix && wildcard(p, &gd)) {
2507 nfile = gd.gl_pathc;
2508 files = gd.gl_pathv;
2509 }
2510 for (i = 0; i < nfile; ++i) {
2511 int ttype = target_type(files[i]);
2512
2513 np = newname(files[i]);
2514 if (ttype != T_NORMAL) {
2515 // Enforce prerequisites/commands in POSIX mode
2516 if (posix) {
2517 if ((ttype & T_NOPREREQ) && dp)
2518 error_not_allowed("prerequisites", p);
2519 if ((ttype & T_INFERENCE)) {
2520 if (semicolon_cmd)
2521 error_in_inference_rule("'; command'");
2522 seen_inference = TRUE;
2523 }
2524 if ((ttype & T_COMMAND) && !cp &&
2525 !((ttype & T_INFERENCE) && !semicolon_cmd))
2526 error("commands required for %s", p);
2527 if (!(ttype & T_COMMAND) && cp)
2528 error_not_allowed("commands", p);
2529 }
2530
2531 if ((ttype & T_INFERENCE)) {
2532 np->n_flag |= N_INFERENCE;
2533 } else if (strcmp(p, ".DEFAULT") == 0) {
2534 // .DEFAULT rule is a special case
2535 np->n_flag |= N_SPECIAL | N_INFERENCE;
2536 } else {
2537 np->n_flag |= N_SPECIAL;
2538 }
2539 } else if (!firstname) {
2540 firstname = np;
2541 }
2542 addrule(np, dp, cp, dbl);
2543 count++;
2544 }
2545 if (files != &p)
2546 globfree(&gd);
2547 }
2548 if (posix && seen_inference && count != 1)
2549 error_in_inference_rule("multiple targets");
2550
2551 // Prerequisites and commands will be unused if there were
2552 // no targets. Avoid leaking memory.
2553 if (count == 0) {
2554 freedeps(dp);
2555 freecmds(cp);
2556 }
2557
2558 end_loop:
2559 free(str1);
2560 dispno = lineno;
2561 str1 = str2 ? str2 : readline(fd, FALSE);
2562 free(copy);
2563 free(expanded);
2564#if ENABLE_FEATURE_MAKE_POSIX
2565 if (!seen_first && fd) {
2566 if (findname(".POSIX")) {
2567 // The first non-comment line from a real makefile
2568 // defined the .POSIX special target.
2569 setenv("PDPMAKE_POSIXLY_CORRECT", "", 1);
2570 posix = TRUE;
2571 }
2572 seen_first = TRUE;
2573 }
2574#endif
2575 }
2576 // Conditionals aren't allowed to span files
2577 if (clevel != old_clevel)
2578 error("invalid conditional");
2579}
2580
2581static void
2582remove_target(void)
2583{
2584 if (!dryrun && !print && !precious &&
2585 target && !(target->n_flag & (N_PRECIOUS | N_PHONY)) &&
2586 unlink(target->n_name) == 0) {
2587 diagnostic("'%s' removed", target->n_name);
2588 }
2589}
2590
2591/*
2592 * Update the modification time of a file to now.
2593 */
2594static void
2595touch(struct name *np)
2596{
2597 if (dryrun || !silent)
2598 printf("touch %s\n", np->n_name);
2599
2600 if (!dryrun) {
2601 const struct timespec timebuf[2] = {{0, UTIME_NOW}, {0, UTIME_NOW}};
2602
2603 if (utimensat(AT_FDCWD, np->n_name, timebuf, 0) < 0) {
2604 if (errno == ENOENT) {
2605 int fd = open(np->n_name, O_RDWR | O_CREAT, 0666);
2606 if (fd >= 0) {
2607 close(fd);
2608 return;
2609 }
2610 }
2611 warning("touch %s failed", np->n_name);
2612 }
2613 }
2614}
2615
2616/*
2617 * Do commands to make a target
2618 */
2619static int
2620docmds(struct name *np, struct cmd *cp)
2621{
2622 int estat = 0;
2623 char *q, *command;
2624
2625 for (; cp; cp = cp->c_next) {
2626 uint32_t ssilent, signore, sdomake;
2627
2628 // Location of command in makefile (for use in error messages)
2629 curr_cmd = cp;
2630 opts &= ~OPT_make; // We want to know if $(MAKE) is expanded
2631 q = command = expand_macros(cp->c_cmd, FALSE);
2632 ssilent = silent || (np->n_flag & N_SILENT) || dotouch;
2633 signore = ignore || (np->n_flag & N_IGNORE);
2634 sdomake = (!dryrun || doinclude || domake) && !dotouch;
2635 for (;;) {
2636 if (*q == '@') // Specific silent
2637 ssilent = TRUE + 1;
2638 else if (*q == '-') // Specific ignore
2639 signore = TRUE;
2640 else if (*q == '+') // Specific domake
2641 sdomake = TRUE + 1;
2642 else
2643 break;
2644 do {
2645 q++;
2646 } while (isblank(*q));
2647 }
2648
2649 if (sdomake > TRUE) {
2650 // '+' must not override '@' or .SILENT
2651 if (ssilent != TRUE + 1 && !(np->n_flag & N_SILENT))
2652 ssilent = FALSE;
2653 } else if (!sdomake)
2654 ssilent = dotouch;
2655
2656 if (!ssilent && *q != '\0') { // Ignore empty commands
2657 puts(q);
2658 fflush_all();
2659 }
2660
2661 if (quest && sdomake != TRUE + 1) {
2662 // MAKE_FAILURE means rebuild is needed
2663 estat |= MAKE_FAILURE | MAKE_DIDSOMETHING;
2664 continue;
2665 }
2666
2667 if (sdomake && *q != '\0') { // Ignore empty commands
2668 // Get the shell to execute it
2669 int status;
2670 char *cmd = !signore && posix ? auto_concat("set -e;", q) : q;
2671
2672 target = np;
2673 status = system(cmd);
2674 // If this command was being run to create an include file
2675 // or bring it up-to-date errors should be ignored and a
2676 // failure status returned.
2677 if (status == -1 && !doinclude) {
2678 error("couldn't execute '%s'", q);
2679 } else if (status != 0 && !signore) {
2680 if (!posix && WIFSIGNALED(status))
2681 remove_target();
2682 if (doinclude) {
2683 warning("failed to build '%s'", np->n_name);
2684 } else {
2685 const char *err_type = NULL;
2686 int err_value = 1;
2687
2688 if (WIFEXITED(status)) {
2689 err_type = "exit";
2690 err_value = WEXITSTATUS(status);
2691 } else if (WIFSIGNALED(status)) {
2692 err_type = "signal";
2693 err_value = WTERMSIG(status);
2694 }
2695
2696 if (!quest || err_value == 127) {
2697 if (err_type)
2698 diagnostic("failed to build '%s' %s %d",
2699 np->n_name, err_type, err_value);
2700 else
2701 diagnostic("failed to build '%s'", np->n_name);
2702 }
2703
2704 if (errcont) {
2705 estat |= MAKE_FAILURE;
2706 free(command);
2707 break;
2708 }
2709 exit(2);
2710 }
2711 }
2712 }
2713 if (sdomake || dryrun)
2714 estat = MAKE_DIDSOMETHING;
2715 free(command);
2716 }
2717
2718 if (dotouch && !(np->n_flag & N_PHONY) && !(estat & MAKE_DIDSOMETHING)) {
2719 touch(np);
2720 estat = MAKE_DIDSOMETHING;
2721 }
2722
2723 curr_cmd = NULL;
2724 return estat;
2725}
2726
2727/*
2728 * Remove the suffix from a name, either the one provided in 'tsuff'
2729 * or, if 'tsuff' is NULL, one of the known suffixes.
2730 */
2731static char *
2732remove_suffix(const char *name, const char *tsuff)
2733{
2734 char *base = NULL;
2735
2736 if (tsuff != NULL) {
2737 base = has_suffix(name, tsuff);
2738 } else {
2739 struct name *xp = newname(".SUFFIXES");
2740 for (struct rule *rp = xp->n_rule; rp; rp = rp->r_next) {
2741 for (struct depend *dp = rp->r_dep; dp; dp = dp->d_next) {
2742 base = has_suffix(name, dp->d_name->n_name);
2743 if (base) {
2744 return base;
2745 }
2746 }
2747 }
2748 }
2749 return base;
2750}
2751
2752static int
2753make1(struct name *np, struct cmd *cp, char *oodate, char *allsrc,
2754 char *dedup, struct name *implicit, const char *tsuff)
2755{
2756 char *name, *member = NULL, *base = NULL, *prereq = NULL;
2757
2758 name = splitlib(np->n_name, &member);
2759 setmacro("?", oodate, 0 | M_VALID);
2760 if (!POSIX_2017) {
2761 setmacro("+", allsrc, 0 | M_VALID);
2762 setmacro("^", dedup, 0 | M_VALID);
2763 }
2764 setmacro("%", member, 0 | M_VALID);
2765 setmacro("@", name, 0 | M_VALID);
2766 if (implicit || !posix) {
2767 char *s;
2768
2769 // As an extension, if we're not dealing with an implicit
2770 // prerequisite set $< to the first out-of-date prerequisite.
2771 if (implicit == NULL) {
2772 if (oodate) {
2773 s = strchr(oodate, ' ');
2774 if (s)
2775 *s = '\0';
2776 prereq = oodate;
2777 }
2778 } else
2779 prereq = implicit->n_name;
2780
2781 if (!posix && member == NULL) {
2782 // As an extension remove a suffix that doesn't necessarily
2783 // start with a period from a target, but not for targets
2784 // of the form lib.a(member.o).
2785 base = remove_suffix(name, tsuff);
2786 if (base) {
2787 free(name);
2788 name = base;
2789 }
2790 } else {
2791 base = member ? member : name;
2792 s = suffix(base);
2793 // As an extension, if we're not dealing with an implicit
2794 // prerequisite and the target ends with a known suffix,
2795 // remove it and set $* to the stem, else to an empty string.
2796 if (implicit == NULL && !is_suffix(s))
2797 base = NULL;
2798 else
2799 *s = '\0';
2800 }
2801 }
2802 setmacro("<", prereq, 0 | M_VALID);
2803 setmacro("*", base, 0 | M_VALID);
2804 free(name);
2805
2806 return docmds(np, cp);
2807}
2808
2809/*
2810 * Determine if the modification time of a target, t, is less than
2811 * that of a prerequisite, p. If the tv_nsec member of either is
2812 * exactly 0 we assume (possibly incorrectly) that the time resolution
2813 * is 1 second and only compare tv_sec values.
2814 */
2815static int
2816timespec_le(const struct timespec *t, const struct timespec *p)
2817{
2818 if (t->tv_nsec == 0 || p->tv_nsec == 0)
2819 return t->tv_sec <= p->tv_sec;
2820 else if (t->tv_sec < p->tv_sec)
2821 return TRUE;
2822 else if (t->tv_sec == p->tv_sec)
2823 return t->tv_nsec <= p->tv_nsec;
2824 return FALSE;
2825}
2826
2827/*
2828 * Return the greater of two struct timespecs
2829 */
2830static const struct timespec *
2831timespec_max(const struct timespec *t, const struct timespec *p)
2832{
2833 return timespec_le(t, p) ? p : t;
2834}
2835
2836/*
2837 * Recursive routine to make a target.
2838 */
2839static int
2840make(struct name *np, int level)
2841{
2842 struct depend *dp;
2843 struct rule *rp;
2844 struct name *impdep = NULL; // implicit prerequisite
2845 struct rule infrule;
2846 struct cmd *sc_cmd = NULL; // commands for single-colon rule
2847 char *oodate = NULL;
2848 char *allsrc = NULL;
2849 char *dedup = NULL;
2850 const char *tsuff = NULL;
2851 struct timespec dtim = {1, 0};
2852 int estat = 0;
2853
2854 if (np->n_flag & N_DONE)
2855 return 0;
2856 if (np->n_flag & N_DOING)
2857 error("circular dependency for %s", np->n_name);
2858 np->n_flag |= N_DOING;
2859
2860 if (!np->n_tim.tv_sec)
2861 modtime(np); // Get modtime of this file
2862
2863 if (!(np->n_flag & N_DOUBLE)) {
2864 // Find the commands needed for a single-colon rule, using
2865 // an inference rule or .DEFAULT rule if necessary (but,
2866 // as an extension, not for phony targets)
2867 sc_cmd = getcmd(np);
2868 if (!sc_cmd && (posix || !(np->n_flag & N_PHONY))) {
2869 impdep = dyndep(np, &infrule, &tsuff);
2870 if (impdep) {
2871 sc_cmd = infrule.r_cmd;
2872 addrule(np, infrule.r_dep, NULL, FALSE);
2873 }
2874 }
2875
2876 // As a last resort check for a default rule
2877 if (!(np->n_flag & N_TARGET) && np->n_tim.tv_sec == 0) {
2878 if (posix || !(np->n_flag & N_PHONY))
2879 sc_cmd = getcmd(findname(".DEFAULT"));
2880 if (!sc_cmd) {
2881 if (doinclude)
2882 return 1;
2883 error("don't know how to make %s", np->n_name);
2884 }
2885 impdep = np;
2886 }
2887 } else {
2888 // If any double-colon rule has no commands we need
2889 // an inference rule.
2890 for (rp = np->n_rule; rp; rp = rp->r_next) {
2891 if (!rp->r_cmd) {
2892 // Phony targets don't need an inference rule.
2893 if (!posix && (np->n_flag & N_PHONY))
2894 continue;
2895 impdep = dyndep(np, &infrule, &tsuff);
2896 if (!impdep) {
2897 if (doinclude)
2898 return 1;
2899 error("don't know how to make %s", np->n_name);
2900 }
2901 break;
2902 }
2903 }
2904 }
2905
2906 // Reset flag to detect duplicate prerequisites
2907 if (!(np->n_flag & N_DOUBLE)) {
2908 for (rp = np->n_rule; rp; rp = rp->r_next) {
2909 for (dp = rp->r_dep; dp; dp = dp->d_next) {
2910 dp->d_name->n_flag &= ~N_MARK;
2911 }
2912 }
2913 }
2914
2915 for (rp = np->n_rule; rp; rp = rp->r_next) {
2916 struct name *locdep = NULL;
2917
2918 // Each double-colon rule is handled separately.
2919 if ((np->n_flag & N_DOUBLE)) {
2920 // If the rule has no commands use the inference rule.
2921 // Unless there isn't one, as allowed for phony targets.
2922 if (!rp->r_cmd) {
2923 if (impdep) {
2924 locdep = impdep;
2925 infrule.r_dep->d_next = rp->r_dep;
2926 rp->r_dep = infrule.r_dep;
2927 rp->r_cmd = infrule.r_cmd;
2928 }
2929 }
2930 // A rule with no prerequisities is executed unconditionally.
2931 if (!rp->r_dep)
2932 dtim = np->n_tim;
2933 // Reset flag to detect duplicate prerequisites
2934 for (dp = rp->r_dep; dp; dp = dp->d_next) {
2935 dp->d_name->n_flag &= ~N_MARK;
2936 }
2937 }
2938 for (dp = rp->r_dep; dp; dp = dp->d_next) {
2939 // Make prerequisite
2940 estat |= make(dp->d_name, level + 1);
2941
2942 // Make strings of out-of-date prerequisites (for $?),
2943 // all prerequisites (for $+) and deduplicated prerequisites
2944 // (for $^).
2945 if (timespec_le(&np->n_tim, &dp->d_name->n_tim)) {
2946 if (posix || !(dp->d_name->n_flag & N_MARK))
2947 oodate = xappendword(oodate, dp->d_name->n_name);
2948 }
2949 allsrc = xappendword(allsrc, dp->d_name->n_name);
2950 if (!(dp->d_name->n_flag & N_MARK))
2951 dedup = xappendword(dedup, dp->d_name->n_name);
2952 dp->d_name->n_flag |= N_MARK;
2953 dtim = *timespec_max(&dtim, &dp->d_name->n_tim);
2954 }
2955 if ((np->n_flag & N_DOUBLE)) {
2956 if (((np->n_flag & N_PHONY) || timespec_le(&np->n_tim, &dtim))) {
2957 if (!(estat & MAKE_FAILURE)) {
2958 estat |= make1(np, rp->r_cmd, oodate, allsrc,
2959 dedup, locdep, tsuff);
2960 dtim = (struct timespec){1, 0};
2961 }
2962 free(oodate);
2963 oodate = NULL;
2964 }
2965 free(allsrc);
2966 free(dedup);
2967 allsrc = dedup = NULL;
2968 if (locdep) {
2969 rp->r_dep = rp->r_dep->d_next;
2970 rp->r_cmd = NULL;
2971 }
2972 }
2973 }
2974 if ((np->n_flag & N_DOUBLE) && impdep)
2975 free(infrule.r_dep);
2976
2977 np->n_flag |= N_DONE;
2978 np->n_flag &= ~N_DOING;
2979
2980 if (!(np->n_flag & N_DOUBLE) &&
2981 ((np->n_flag & N_PHONY) || (timespec_le(&np->n_tim, &dtim)))) {
2982 if (!(estat & MAKE_FAILURE)) {
2983 if (sc_cmd)
2984 estat |= make1(np, sc_cmd, oodate, allsrc, dedup,
2985 impdep, tsuff);
2986 else if (!doinclude && level == 0 && !(estat & MAKE_DIDSOMETHING))
2987 warning("nothing to be done for %s", np->n_name);
2988 } else if (!doinclude && !quest) {
2989 diagnostic("'%s' not built due to errors", np->n_name);
2990 }
2991 free(oodate);
2992 }
2993
2994 if (estat & MAKE_DIDSOMETHING) {
2995 modtime(np);
2996 if (!np->n_tim.tv_sec)
2997 clock_gettime(CLOCK_REALTIME, &np->n_tim);
2998 } else if (!quest && level == 0 && !timespec_le(&np->n_tim, &dtim))
2999 printf("%s: '%s' is up to date\n", applet_name, np->n_name);
3000
3001 free(allsrc);
3002 free(dedup);
3003 return estat;
3004}
3005
3006/*
3007 * Check structures for make.
3008 */
3009
3010static void
3011print_name(struct name *np)
3012{
3013 if (np == firstname)
3014 printf("# default target\n");
3015 printf("%s:", np->n_name);
3016 if ((np->n_flag & N_DOUBLE))
3017 putchar(':');
3018}
3019
3020static void
3021print_prerequisites(struct rule *rp)
3022{
3023 struct depend *dp;
3024
3025 for (dp = rp->r_dep; dp; dp = dp->d_next)
3026 printf(" %s", dp->d_name->n_name);
3027}
3028
3029static void
3030print_commands(struct rule *rp)
3031{
3032 struct cmd *cp;
3033
3034 for (cp = rp->r_cmd; cp; cp = cp->c_next)
3035 printf("\t%s\n", cp->c_cmd);
3036}
3037
3038static void
3039print_details(void)
3040{
3041 int i;
3042 struct macro *mp;
3043 struct name *np;
3044 struct rule *rp;
3045
3046 for (i = 0; i < HTABSIZE; i++)
3047 for (mp = macrohead[i]; mp; mp = mp->m_next)
3048 printf("%s = %s\n", mp->m_name, mp->m_val);
3049 putchar('\n');
3050
3051 for (i = 0; i < HTABSIZE; i++) {
3052 for (np = namehead[i]; np; np = np->n_next) {
3053 if (!(np->n_flag & N_DOUBLE)) {
3054 print_name(np);
3055 for (rp = np->n_rule; rp; rp = rp->r_next) {
3056 print_prerequisites(rp);
3057 }
3058 putchar('\n');
3059
3060 for (rp = np->n_rule; rp; rp = rp->r_next) {
3061 print_commands(rp);
3062 }
3063 putchar('\n');
3064 } else {
3065 for (rp = np->n_rule; rp; rp = rp->r_next) {
3066 print_name(np);
3067 print_prerequisites(rp);
3068 putchar('\n');
3069
3070 print_commands(rp);
3071 putchar('\n');
3072 }
3073 }
3074 }
3075 }
3076}
3077
3078/*
3079 * Process options from an argv array. If from_env is non-zero we're
3080 * handling options from MAKEFLAGS so skip '-C', '-f', '-p' and '-x'.
3081 */
3082static uint32_t
3083process_options(char **argv, int from_env)
3084{
3085 uint32_t flags;
3086
3087 flags = getopt32(argv, "^" OPTSTR1 OPTSTR2 "\0k-S:S-k",
3088 &numjobs, &makefiles, &dirs
3089 IF_FEATURE_MAKE_POSIX(, &pragmas));
3090 if (from_env && (flags & (OPT_C | OPT_f | OPT_p | OPT_x)))
3091 error("invalid MAKEFLAGS");
3092 if (posix && (flags & OPT_C))
3093 error("-C not allowed");
3094
3095 return flags;
3096}
3097
3098/*
3099 * Split the contents of MAKEFLAGS into an argv array. If the return
3100 * value (call it fargv) isn't NULL the caller should free fargv[1] and
3101 * fargv.
3102 */
3103static char **
3104expand_makeflags(void)
3105{
3106 const char *m, *makeflags = getenv("MAKEFLAGS");
3107 char *p, *argstr;
3108 int argc;
3109 char **argv;
3110
3111 if (makeflags == NULL)
3112 return NULL;
3113
3114 while (isblank(*makeflags))
3115 makeflags++;
3116
3117 if (*makeflags == '\0')
3118 return NULL;
3119
3120 p = argstr = xzalloc(strlen(makeflags) + 2);
3121
3122 // If MAKEFLAGS doesn't start with a hyphen, doesn't look like
3123 // a macro definition and only contains valid option characters,
3124 // add a hyphen.
3125 argc = 3;
3126 if (makeflags[0] != '-' && strchr(makeflags, '=') == NULL) {
3127 if (strspn(makeflags, OPTSTR1) != strlen(makeflags))
3128 error("invalid MAKEFLAGS");
3129 *p++ = '-';
3130 } else {
3131 // MAKEFLAGS may need to be split, estimate size of argv array.
3132 for (m = makeflags; *m; ++m) {
3133 if (isblank(*m))
3134 argc++;
3135 }
3136 }
3137
3138 argv = xzalloc(argc * sizeof(char *));
3139 argc = 0;
3140 argv[argc++] = (char *)applet_name;
3141 argv[argc++] = argstr;
3142
3143 // Copy MAKEFLAGS into argstr, splitting at non-escaped blanks.
3144 m = makeflags;
3145 do {
3146 if (*m == '\\' && m[1] != '\0')
3147 m++; // Skip backslash, copy next character unconditionally.
3148 else if (isblank(*m)) {
3149 // Terminate current argument and start a new one.
3150 /* *p = '\0'; - xzalloc did it */
3151 argv[argc++] = ++p;
3152 do {
3153 m++;
3154 } while (isblank(*m));
3155 continue;
3156 }
3157 *p++ = *m++;
3158 } while (*m != '\0');
3159 /* *p = '\0'; - xzalloc did it */
3160 /* argv[argc] = NULL; - and this */
3161
3162 return argv;
3163}
3164
3165// These macros require special treatment
3166#define SPECIAL_MACROS "MAKEFLAGS\0SHELL\0CURDIR\0"
3167#define MAKEFLAGS 0
3168#define SHELL 1
3169#define CURDIR 2
3170
3171/*
3172 * Instantiate all macros in an argv-style array of pointers. Stop
3173 * processing at the first string that doesn't contain an equal sign.
3174 * As an extension, target arguments on the command line (level 1)
3175 * are skipped and will be processed later.
3176 */
3177static char **
3178process_macros(char **argv, int level)
3179{
3180 char *equal;
3181
3182 for (; *argv; argv++) {
3183 char *colon = NULL;
3184 int idx, immediate = 0;
3185 int except_dollar = FALSE;
3186
3187 if (!(equal = strchr(*argv, '='))) {
3188 // Skip targets on the command line
3189 if (!posix && level == 1)
3190 continue;
3191 else
3192 // Stop at first target
3193 break;
3194 }
3195
3196 if (equal - 1 > *argv && equal[-1] == ':') {
3197 if (equal - 2 > *argv && equal[-2] == ':') {
3198 if (POSIX_2017)
3199 error("invalid macro assignment");
3200 if (equal - 3 > *argv && equal[-3] == ':') {
3201 // BSD-style ':='. Expand RHS, but not '$$',
3202 // resulting macro is delayed expansion.
3203 colon = equal - 3;
3204 except_dollar = TRUE;
3205 } else {
3206 // GNU-style ':='. Expand RHS, including '$$',
3207 // resulting macro is immediate expansion.
3208 colon = equal - 2;
3209 immediate = M_IMMEDIATE;
3210 }
3211 *colon = '\0';
3212 } else {
3213 if (posix)
3214 error("invalid macro assignment");
3215 colon = equal - 1;
3216 immediate = M_IMMEDIATE;
3217 *colon = '\0';
3218 }
3219 } else
3220 *equal = '\0';
3221
3222 /* We want to process _most_ macro assignments.
3223 * There are exceptions for particular values from the
3224 * environment. */
3225 idx = index_in_strings(SPECIAL_MACROS, *argv);
3226 if (!((level & M_ENVIRON) &&
3227 (idx == MAKEFLAGS || idx == SHELL ||
3228 (idx == CURDIR && !useenv && !POSIX_2017)))) {
3229 if (colon) {
3230 char *exp = expand_macros(equal + 1, except_dollar);
3231 setmacro(*argv, exp, level | immediate);
3232 free(exp);
3233 } else
3234 setmacro(*argv, equal + 1, level);
3235 }
3236
3237 if (colon)
3238 *colon = ':';
3239 else
3240 *equal = '=';
3241 }
3242 return argv;
3243}
3244
3245/*
3246 * Update the MAKEFLAGS macro and environment variable to include any
3247 * command line options that don't have their default value (apart from
3248 * -f, -p and -S). Also add any macros defined on the command line or
3249 * by the MAKEFLAGS environment variable (apart from MAKEFLAGS itself).
3250 * Add macros that were defined on the command line to the environment.
3251 */
3252static void
3253update_makeflags(void)
3254{
3255 int i;
3256 char optbuf[] = "-?";
3257 char *makeflags = NULL;
3258 char *macro, *s;
3259 const char *t;
3260 struct macro *mp;
3261
3262 t = OPTSTR1;
3263 for (i = 0; *t; t++) {
3264 if (*t == ':' || *t == '+')
3265 continue;
3266 if ((opts & OPT_MASK & (1 << i))) {
3267 optbuf[1] = *t;
3268 makeflags = xappendword(makeflags, optbuf);
3269 if (*t == 'j') {
3270 s = auto_string(xasprintf("%d", numjobs));
3271 makeflags = xappendword(makeflags, s);
3272 }
3273 }
3274 i++;
3275 }
3276
3277 for (i = 0; i < HTABSIZE; ++i) {
3278 for (mp = macrohead[i]; mp; mp = mp->m_next) {
3279 if (mp->m_level == 1 || mp->m_level == 2) {
3280 int idx = index_in_strings(SPECIAL_MACROS, mp->m_name);
3281 if (idx == MAKEFLAGS)
3282 continue;
3283 macro = xzalloc(strlen(mp->m_name) + 2 * strlen(mp->m_val) + 1);
3284 s = stpcpy(macro, mp->m_name);
3285 *s++ = '=';
3286 for (t = mp->m_val; *t; t++) {
3287 if (*t == '\\' || isblank(*t))
3288 *s++ = '\\';
3289 *s++ = *t;
3290 }
3291 /* *s = '\0'; - xzalloc did it */
3292
3293 makeflags = xappendword(makeflags, macro);
3294 free(macro);
3295
3296 // Add command line macro definitions to the environment
3297 if (mp->m_level == 1 && idx != SHELL)
3298 setenv(mp->m_name, mp->m_val, 1);
3299 }
3300 }
3301 }
3302
3303 if (makeflags) {
3304 setmacro("MAKEFLAGS", makeflags, 0);
3305 setenv("MAKEFLAGS", makeflags, 1);
3306 free(makeflags);
3307 }
3308}
3309
3310#if !ENABLE_PLATFORM_MINGW32
3311static void
3312make_handler(int sig)
3313{
3314 signal(sig, SIG_DFL);
3315 remove_target();
3316 kill(getpid(), sig);
3317}
3318
3319static void
3320init_signal(int sig)
3321{
3322 struct sigaction sa, new_action;
3323
3324 sigemptyset(&new_action.sa_mask);
3325 new_action.sa_flags = 0;
3326 new_action.sa_handler = make_handler;
3327
3328 sigaction(sig, NULL, &sa);
3329 if (sa.sa_handler != SIG_IGN)
3330 sigaction_set(sig, &new_action);
3331}
3332#endif
3333
3334/*
3335 * If the global option flag associated with a special target hasn't
3336 * been set mark all prerequisites of the target with a flag. If the
3337 * target had no prerequisites set the global option flag.
3338 */
3339static void
3340mark_special(const char *special, uint32_t oflag, uint16_t nflag)
3341{
3342 struct name *np;
3343 struct rule *rp;
3344 struct depend *dp;
3345 int marked = FALSE;
3346
3347 if (!(opts & oflag) && (np = findname(special))) {
3348 for (rp = np->n_rule; rp; rp = rp->r_next) {
3349 for (dp = rp->r_dep; dp; dp = dp->d_next) {
3350 dp->d_name->n_flag |= nflag;
3351 marked = TRUE;
3352 }
3353 }
3354
3355 if (!marked)
3356 opts |= oflag;
3357 }
3358}
3359
3360int make_main(int argc, char **argv) MAIN_EXTERNALLY_VISIBLE;
3361int make_main(int argc UNUSED_PARAM, char **argv)
3362{
3363 const char *path, *newpath = NULL;
3364 char **fargv, **fargv0;
3365 const char *dir, *file;
3366#if ENABLE_FEATURE_MAKE_POSIX
3367 const char *prag;
3368#endif
3369 int estat;
3370 bool found_target;
3371 FILE *ifd;
3372
3373 INIT_G();
3374
3375#if ENABLE_FEATURE_MAKE_POSIX
3376 if (argv[1] && strcmp(argv[1], "--posix") == 0) {
3377 argv[1] = argv[0];
3378 ++argv;
3379 --argc;
3380 setenv("PDPMAKE_POSIXLY_CORRECT", "", 1);
3381 posix = TRUE;
3382 } else {
3383 posix = getenv("PDPMAKE_POSIXLY_CORRECT") != NULL;
3384 }
3385 posix_level = DEFAULT_POSIX_LEVEL;
3386 pragmas_from_env();
3387#endif
3388
3389 if (!POSIX_2017) {
3390 path = argv[0];
3391#if ENABLE_PLATFORM_MINGW32
3392 if (has_path(argv[0])) {
3393 // Add extension if necessary, else realpath() will fail
3394 char *p = alloc_ext_space(argv[0]);
3395 add_win32_extension(p);
3396 path = newpath = xmalloc_realpath(p);
3397 free(p);
3398 if (!path) {
3399 if (unix_path(argv[0]))
3400 path = argv[0];
3401 else
3402 bb_perror_msg("can't resolve path for %s", argv[0]);
3403 }
3404 }
3405#else
3406 if (argv[0][0] != '/' && strchr(argv[0], '/')) {
3407 // Make relative path absolute
3408 path = newpath = realpath(argv[0], NULL);
3409 if (!path) {
3410 bb_perror_msg("can't resolve path for %s", argv[0]);
3411 }
3412 }
3413#endif
3414 } else {
3415 path = "make";
3416 }
3417
3418 // Process options from MAKEFLAGS
3419 fargv = fargv0 = expand_makeflags();
3420 if (fargv0) {
3421 opts = process_options(fargv, TRUE);
3422 fargv = fargv0 + optind;
3423 // Reset getopt(3) so we can call it again
3424 GETOPT_RESET();
3425 }
3426
3427 // Process options from the command line
3428 opts |= process_options(argv, FALSE);
3429 argv += optind;
3430
3431 while ((dir = llist_pop(&dirs))) {
3432 if (chdir(dir) == -1) {
3433 bb_perror_msg("can't chdir to %s", dir);
3434 }
3435 }
3436
3437#if ENABLE_FEATURE_MAKE_POSIX
3438 while ((prag = llist_pop(&pragmas)))
3439 set_pragma(prag);
3440 pragmas_to_env();
3441#endif
3442
3443#if !ENABLE_PLATFORM_MINGW32
3444 init_signal(SIGHUP);
3445 init_signal(SIGTERM);
3446#endif
3447
3448 setmacro("$", "$", 0 | M_VALID);
3449
3450 // Process macro definitions from the command line
3451 if (!posix)
3452 process_macros(argv, 1);
3453 else
3454 // In POSIX mode macros must appear before targets.
3455 // argv should now point to targets only.
3456 argv = process_macros(argv, 1);
3457
3458 // Process macro definitions from MAKEFLAGS
3459 if (fargv) {
3460 process_macros(fargv, 2);
3461 free(fargv0[1]);
3462 free(fargv0);
3463 }
3464
3465 // Process macro definitions from the environment
3466 process_macros(environ, 3 | M_ENVIRON);
3467
3468 // Update MAKEFLAGS and environment
3469 update_makeflags();
3470
3471 // Read built-in rules
3472 input(NULL, 0);
3473
3474 setmacro("SHELL", DEFAULT_SHELL, 4);
3475 setmacro("MAKE", path, 4);
3476 if (!POSIX_2017) {
3477 char *cwd = xrealloc_getcwd_or_warn(NULL);
3478
3479 if (cwd) {
3480 if (!useenv) {
3481 // Export cwd to environment, if necessary
3482 char *envcwd = getenv("CURDIR");
3483 if (envcwd && strcmp(cwd, envcwd) != 0)
3484 setenv("CURDIR", cwd, 1);
3485 }
3486 setmacro("CURDIR", cwd, 4);
3487 }
3488 free(cwd);
3489 }
3490 free((void *)newpath);
3491
3492 if (!makefiles) { // Look for a default Makefile
3493 if (!posix && (ifd = fopen("PDPmakefile", "r")) != NULL)
3494 makefile = "PDPmakefile";
3495 else if ((ifd = fopen("PDPmakefile" + 3, "r")) != NULL)
3496 makefile = "PDPmakefile" + 3;
3497#if !ENABLE_PLATFORM_MINGW32
3498 else if ((ifd = fopen("Makefile", "r")) != NULL)
3499 makefile = "Makefile";
3500#endif
3501 else
3502 error("no makefile found");
3503 goto read_makefile;
3504 }
3505
3506 while ((file = llist_pop(&makefiles))) {
3507 if (strcmp(file, "-") == 0) { // Can use stdin as makefile
3508 ifd = stdin;
3509 makefile = "stdin";
3510 } else {
3511 ifd = xfopen_for_read(file);
3512 makefile = file;
3513 }
3514 read_makefile:
3515 input(ifd, 0);
3516 fclose(ifd);
3517 makefile = NULL;
3518 }
3519
3520 if (print)
3521 print_details();
3522
3523 mark_special(".SILENT", OPT_s, N_SILENT);
3524 mark_special(".IGNORE", OPT_i, N_IGNORE);
3525 mark_special(".PRECIOUS", OPT_precious, N_PRECIOUS);
3526 if (!POSIX_2017)
3527 mark_special(".PHONY", OPT_phony, N_PHONY);
3528
3529 if (posix) {
3530 // In POSIX mode only targets should now be in argv.
3531 found_target = FALSE;
3532 for (char **a = argv; *a; a++) {
3533 if (!strchr(*a, '='))
3534 found_target = TRUE;
3535 else if (found_target)
3536 error("macro assignments must precede targets");
3537 }
3538 }
3539
3540 estat = 0;
3541 found_target = FALSE;
3542 for (; *argv; argv++) {
3543 // Skip macro assignments.
3544 if (strchr(*argv, '='))
3545 continue;
3546 found_target = TRUE;
3547 estat |= make(newname(*argv), 0);
3548 }
3549 if (!found_target) {
3550 if (!firstname)
3551 error("no targets defined");
3552 estat = make(firstname, 0);
3553 }
3554
3555#if ENABLE_FEATURE_CLEAN_UP
3556 freenames();
3557 freemacros();
3558 llist_free(makefiles, NULL);
3559 llist_free(dirs, NULL);
3560#endif
3561
3562 return estat & MAKE_FAILURE;
3563}
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-11-23 01:52:37 +0000