-
Notifications
You must be signed in to change notification settings - Fork 11
/
rules.c
220 lines (202 loc) · 4.67 KB
/
rules.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* Control of the implicit suffix rules
*/
#include "make.h"
/*
* Return a pointer to the suffix of a name (which may be the
* terminating NUL if there's no suffix).
*/
char *
suffix(const char *name)
{
char *p = strrchr(name, '.');
return p ? p : (char *)name + strlen(name);
}
/*
* Find a name structure whose name is formed by concatenating two
* strings. If 'create' is TRUE the name is created if necessary.
*/
static struct name *
namecat(const char *s, const char *t, int create)
{
char *p;
struct name *np;
p = xconcat3(s, t, "");
np = create ? newname(p) : findname(p);
free(p);
return np;
}
/*
* Dynamic dependency. This routine applies the suffix rules
* to try and find a source and a set of rules for a missing
* target. NULL is returned on failure. On success the name of
* the implicit prerequisite is returned and the details are
* placed in the imprule structure provided by the caller.
*/
struct name *
dyndep(struct name *np, struct rule *imprule)
{
char *suff, *newsuff;
char *base, *name, *member;
struct name *xp; // Suffixes
struct name *sp; // Suffix rule
struct name *pp = NULL; // Implicit prerequisite
struct rule *rp;
struct depend *dp;
IF_NOT_FEATURE_MAKE_EXTENSIONS(const) bool chain = FALSE;
member = NULL;
name = splitlib(np->n_name, &member);
suff = xstrdup(suffix(name));
base = member ? member : name;
*suffix(base) = '\0';
xp = newname(".SUFFIXES");
#if ENABLE_FEATURE_MAKE_EXTENSIONS
retry:
#endif
for (rp = xp->n_rule; rp; rp = rp->r_next) {
for (dp = rp->r_dep; dp; dp = dp->d_next) {
// Generate new suffix rule to try
newsuff = dp->d_name->n_name;
sp = namecat(newsuff, suff, FALSE);
if (sp && sp->n_rule) {
// Generate a name for an implicit prerequisite
struct name *ip = namecat(base, newsuff, TRUE);
if ((ip->n_flag & N_DOING))
continue;
if (!ip->n_tim.tv_sec)
modtime(ip);
if (!chain ? ip->n_tim.tv_sec || (ip->n_flag & N_TARGET) :
dyndep(ip, NULL) != NULL) {
// Prerequisite exists or we know how to make it
if (imprule) {
imprule->r_dep = newdep(ip, NULL);
imprule->r_cmd = sp->n_rule->r_cmd;
}
pp = ip;
goto finish;
}
}
}
}
#if ENABLE_FEATURE_MAKE_EXTENSIONS
// If we didn't find an existing file or an explicit rule try
// again, this time looking for a chained inference rule.
if (!posix && !chain) {
chain = TRUE;
goto retry;
}
#endif
finish:
free(suff);
free(name);
return pp;
}
#define RULES \
".c.o:\n" \
" $(CC) $(CFLAGS) -c $<\n" \
".y.o:\n" \
" $(YACC) $(YFLAGS) $<\n" \
" $(CC) $(CFLAGS) -c y.tab.c\n" \
" rm -f y.tab.c\n" \
" mv y.tab.o $@\n" \
".y.c:\n" \
" $(YACC) $(YFLAGS) $<\n" \
" mv y.tab.c $@\n" \
".l.o:\n" \
" $(LEX) $(LFLAGS) $<\n" \
" $(CC) $(CFLAGS) -c lex.yy.c\n" \
" rm -f lex.yy.c\n" \
" mv lex.yy.o $@\n" \
".l.c:\n" \
" $(LEX) $(LFLAGS) $<\n" \
" mv lex.yy.c $@\n" \
".c.a:\n" \
" $(CC) -c $(CFLAGS) $<\n" \
" $(AR) $(ARFLAGS) $@ $*.o\n" \
" rm -f $*.o\n" \
".c:\n" \
" $(CC) $(CFLAGS) $(LDFLAGS) -o $@ $<\n" \
".sh:\n" \
" cp $< $@\n" \
" chmod a+x $@\n"
#define RULES_2017 \
".SUFFIXES:.o .c .y .l .a .sh .f\n" \
".f.o:\n" \
" $(FC) $(FFLAGS) -c $<\n" \
".f.a:\n" \
" $(FC) -c $(FFLAGS) $<\n" \
" $(AR) $(ARFLAGS) $@ $*.o\n" \
" rm -f $*.o\n" \
".f:\n" \
" $(FC) $(FFLAGS) $(LDFLAGS) -o $@ $<\n"
#define RULES_2024 \
".SUFFIXES:.o .c .y .l .a .sh\n"
#define MACROS \
"CFLAGS=-O1\n" \
"YACC=yacc\n" \
"YFLAGS=\n" \
"LEX=lex\n" \
"LFLAGS=\n" \
"AR=ar\n" \
"ARFLAGS=-rv\n" \
"LDFLAGS=\n"
#define MACROS_2017 \
"CC=c99\n" \
"FC=fort77\n" \
"FFLAGS=-O1\n" \
#define MACROS_2024 \
"CC=c17\n"
#define MACROS_EXT \
"CC=cc\n"
/*
* Read the built-in rules using a fake fgets-like interface.
*/
char *
getrules(char *s, int size)
{
char *r = s;
static const char *rulepos = NULL;
static int rule_idx = 0;
if (rulepos == NULL || *rulepos == '\0') {
if (rule_idx == 0) {
rulepos = MACROS;
rule_idx++;
} else if (rule_idx == 1) {
#if ENABLE_FEATURE_MAKE_EXTENSIONS
if (POSIX_2017)
rulepos = MACROS_2017;
else if (posix)
rulepos = MACROS_2024;
else
rulepos = MACROS_EXT;
#elif ENABLE_FEATURE_MAKE_POSIX_2024
rulepos = MACROS_2024;
#else
rulepos = MACROS_2017;
#endif
rule_idx++;
} else if (!norules) {
if (rule_idx == 2) {
#if ENABLE_FEATURE_MAKE_EXTENSIONS
rulepos = POSIX_2017 ? RULES_2017 : RULES_2024;
#elif ENABLE_FEATURE_MAKE_POSIX_2024
rulepos = RULES_2024;
#else
rulepos = RULES_2017;
#endif
rule_idx++;
} else if (rule_idx == 3) {
rulepos = RULES;
rule_idx++;
}
}
}
if (*rulepos == '\0')
return NULL;
while (--size) {
if ((*r++ = *rulepos++) == '\n')
break;
}
*r = '\0';
return s;
}