1 | /* Pattern and suffix rule internals for GNU Make.
|
---|
2 | Copyright (C) 1988-2016 Free Software Foundation, Inc.
|
---|
3 | This file is part of GNU Make.
|
---|
4 |
|
---|
5 | GNU Make is free software; you can redistribute it and/or modify it under the
|
---|
6 | terms of the GNU General Public License as published by the Free Software
|
---|
7 | Foundation; either version 3 of the License, or (at your option) any later
|
---|
8 | version.
|
---|
9 |
|
---|
10 | GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
|
---|
11 | WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
|
---|
12 | A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
---|
13 |
|
---|
14 | You should have received a copy of the GNU General Public License along with
|
---|
15 | this program. If not, see <http://www.gnu.org/licenses/>. */
|
---|
16 |
|
---|
17 | #include "makeint.h"
|
---|
18 |
|
---|
19 | #include <assert.h>
|
---|
20 |
|
---|
21 | #include "filedef.h"
|
---|
22 | #include "dep.h"
|
---|
23 | #include "job.h"
|
---|
24 | #include "commands.h"
|
---|
25 | #include "variable.h"
|
---|
26 | #include "rule.h"
|
---|
27 |
|
---|
28 | static void freerule (struct rule *rule, struct rule *lastrule);
|
---|
29 | |
---|
30 |
|
---|
31 | /* Chain of all pattern rules. */
|
---|
32 |
|
---|
33 | struct rule *pattern_rules;
|
---|
34 |
|
---|
35 | /* Pointer to last rule in the chain, so we can add onto the end. */
|
---|
36 |
|
---|
37 | struct rule *last_pattern_rule;
|
---|
38 |
|
---|
39 | /* Number of rules in the chain. */
|
---|
40 |
|
---|
41 | unsigned int num_pattern_rules;
|
---|
42 |
|
---|
43 | /* Maximum number of target patterns of any pattern rule. */
|
---|
44 |
|
---|
45 | unsigned int max_pattern_targets;
|
---|
46 |
|
---|
47 | /* Maximum number of dependencies of any pattern rule. */
|
---|
48 |
|
---|
49 | unsigned int max_pattern_deps;
|
---|
50 |
|
---|
51 | /* Maximum length of the name of a dependencies of any pattern rule. */
|
---|
52 |
|
---|
53 | unsigned int max_pattern_dep_length;
|
---|
54 |
|
---|
55 | /* Pointer to structure for the file .SUFFIXES
|
---|
56 | whose dependencies are the suffixes to be searched. */
|
---|
57 |
|
---|
58 | struct file *suffix_file;
|
---|
59 |
|
---|
60 | /* Maximum length of a suffix. */
|
---|
61 |
|
---|
62 | unsigned int maxsuffix;
|
---|
63 | |
---|
64 |
|
---|
65 | /* Compute the maximum dependency length and maximum number of
|
---|
66 | dependencies of all implicit rules. Also sets the subdir
|
---|
67 | flag for a rule when appropriate, possibly removing the rule
|
---|
68 | completely when appropriate. */
|
---|
69 |
|
---|
70 | void
|
---|
71 | count_implicit_rule_limits (void)
|
---|
72 | {
|
---|
73 | char *name;
|
---|
74 | int namelen;
|
---|
75 | struct rule *rule;
|
---|
76 |
|
---|
77 | num_pattern_rules = max_pattern_targets = max_pattern_deps = 0;
|
---|
78 | max_pattern_dep_length = 0;
|
---|
79 |
|
---|
80 | name = 0;
|
---|
81 | namelen = 0;
|
---|
82 | rule = pattern_rules;
|
---|
83 | while (rule != 0)
|
---|
84 | {
|
---|
85 | unsigned int ndeps = 0;
|
---|
86 | struct dep *dep;
|
---|
87 | struct rule *next = rule->next;
|
---|
88 |
|
---|
89 | ++num_pattern_rules;
|
---|
90 |
|
---|
91 | if (rule->num > max_pattern_targets)
|
---|
92 | max_pattern_targets = rule->num;
|
---|
93 |
|
---|
94 | for (dep = rule->deps; dep != 0; dep = dep->next)
|
---|
95 | {
|
---|
96 | const char *dname = dep_name (dep);
|
---|
97 | unsigned int len = strlen (dname);
|
---|
98 |
|
---|
99 | #ifdef VMS
|
---|
100 | const char *p = strrchr (dname, ']');
|
---|
101 | const char *p2;
|
---|
102 | if (p == 0)
|
---|
103 | p = strrchr (dname, ':');
|
---|
104 | p2 = p != 0 ? strchr (dname, '%') : 0;
|
---|
105 | #else
|
---|
106 | const char *p = strrchr (dname, '/');
|
---|
107 | const char *p2 = p != 0 ? strchr (dname, '%') : 0;
|
---|
108 | #endif
|
---|
109 | ndeps++;
|
---|
110 |
|
---|
111 | if (len > max_pattern_dep_length)
|
---|
112 | max_pattern_dep_length = len;
|
---|
113 |
|
---|
114 | if (p != 0 && p2 > p)
|
---|
115 | {
|
---|
116 | /* There is a slash before the % in the dep name.
|
---|
117 | Extract the directory name. */
|
---|
118 | if (p == dname)
|
---|
119 | ++p;
|
---|
120 | if (p - dname > namelen)
|
---|
121 | {
|
---|
122 | namelen = p - dname;
|
---|
123 | name = xrealloc (name, namelen + 1);
|
---|
124 | }
|
---|
125 | memcpy (name, dname, p - dname);
|
---|
126 | name[p - dname] = '\0';
|
---|
127 |
|
---|
128 | /* In the deps of an implicit rule the 'changed' flag
|
---|
129 | actually indicates that the dependency is in a
|
---|
130 | nonexistent subdirectory. */
|
---|
131 |
|
---|
132 | dep->changed = !dir_file_exists_p (name, "");
|
---|
133 | }
|
---|
134 | else
|
---|
135 | /* This dependency does not reside in a subdirectory. */
|
---|
136 | dep->changed = 0;
|
---|
137 | }
|
---|
138 |
|
---|
139 | if (ndeps > max_pattern_deps)
|
---|
140 | max_pattern_deps = ndeps;
|
---|
141 |
|
---|
142 | rule = next;
|
---|
143 | }
|
---|
144 |
|
---|
145 | free (name);
|
---|
146 | }
|
---|
147 | |
---|
148 |
|
---|
149 | /* Create a pattern rule from a suffix rule.
|
---|
150 | TARGET is the target suffix; SOURCE is the source suffix.
|
---|
151 | CMDS are the commands.
|
---|
152 | If TARGET is nil, it means the target pattern should be '(%.o)'.
|
---|
153 | If SOURCE is nil, it means there should be no deps. */
|
---|
154 |
|
---|
155 | static void
|
---|
156 | convert_suffix_rule (const char *target, const char *source,
|
---|
157 | struct commands *cmds)
|
---|
158 | {
|
---|
159 | const char **names, **percents;
|
---|
160 | struct dep *deps;
|
---|
161 |
|
---|
162 | names = xmalloc (sizeof (const char *));
|
---|
163 | percents = xmalloc (sizeof (const char *));
|
---|
164 |
|
---|
165 | if (target == 0)
|
---|
166 | {
|
---|
167 | /* Special case: TARGET being nil means we are defining a '.X.a' suffix
|
---|
168 | rule; the target pattern is always '(%.o)'. */
|
---|
169 | #ifdef VMS
|
---|
170 | *names = strcache_add_len ("(%.obj)", 7);
|
---|
171 | #else
|
---|
172 | *names = strcache_add_len ("(%.o)", 5);
|
---|
173 | #endif
|
---|
174 | *percents = *names + 1;
|
---|
175 | }
|
---|
176 | else
|
---|
177 | {
|
---|
178 | /* Construct the target name. */
|
---|
179 | unsigned int len = strlen (target);
|
---|
180 | char *p = alloca (1 + len + 1);
|
---|
181 | p[0] = '%';
|
---|
182 | memcpy (p + 1, target, len + 1);
|
---|
183 | *names = strcache_add_len (p, len + 1);
|
---|
184 | *percents = *names;
|
---|
185 | }
|
---|
186 |
|
---|
187 | if (source == 0)
|
---|
188 | deps = 0;
|
---|
189 | else
|
---|
190 | {
|
---|
191 | /* Construct the dependency name. */
|
---|
192 | unsigned int len = strlen (source);
|
---|
193 | char *p = alloca (1 + len + 1);
|
---|
194 | p[0] = '%';
|
---|
195 | memcpy (p + 1, source, len + 1);
|
---|
196 | deps = alloc_dep ();
|
---|
197 | deps->name = strcache_add_len (p, len + 1);
|
---|
198 | }
|
---|
199 |
|
---|
200 | create_pattern_rule (names, percents, 1, 0, deps, cmds, 0);
|
---|
201 | }
|
---|
202 |
|
---|
203 | /* Convert old-style suffix rules to pattern rules.
|
---|
204 | All rules for the suffixes on the .SUFFIXES list are converted and added to
|
---|
205 | the chain of pattern rules. */
|
---|
206 |
|
---|
207 | void
|
---|
208 | convert_to_pattern (void)
|
---|
209 | {
|
---|
210 | struct dep *d, *d2;
|
---|
211 | char *rulename;
|
---|
212 |
|
---|
213 | /* We will compute every potential suffix rule (.x.y) from the list of
|
---|
214 | suffixes in the .SUFFIXES target's dependencies and see if it exists.
|
---|
215 | First find the longest of the suffixes. */
|
---|
216 |
|
---|
217 | maxsuffix = 0;
|
---|
218 | for (d = suffix_file->deps; d != 0; d = d->next)
|
---|
219 | {
|
---|
220 | unsigned int l = strlen (dep_name (d));
|
---|
221 | if (l > maxsuffix)
|
---|
222 | maxsuffix = l;
|
---|
223 | }
|
---|
224 |
|
---|
225 | /* Space to construct the suffix rule target name. */
|
---|
226 | rulename = alloca ((maxsuffix * 2) + 1);
|
---|
227 |
|
---|
228 | for (d = suffix_file->deps; d != 0; d = d->next)
|
---|
229 | {
|
---|
230 | unsigned int slen;
|
---|
231 |
|
---|
232 | /* Make a rule that is just the suffix, with no deps or commands.
|
---|
233 | This rule exists solely to disqualify match-anything rules. */
|
---|
234 | convert_suffix_rule (dep_name (d), 0, 0);
|
---|
235 |
|
---|
236 | if (d->file->cmds != 0)
|
---|
237 | /* Record a pattern for this suffix's null-suffix rule. */
|
---|
238 | convert_suffix_rule ("", dep_name (d), d->file->cmds);
|
---|
239 |
|
---|
240 | /* Add every other suffix to this one and see if it exists as a
|
---|
241 | two-suffix rule. */
|
---|
242 | slen = strlen (dep_name (d));
|
---|
243 | memcpy (rulename, dep_name (d), slen);
|
---|
244 |
|
---|
245 | for (d2 = suffix_file->deps; d2 != 0; d2 = d2->next)
|
---|
246 | {
|
---|
247 | struct file *f;
|
---|
248 | unsigned int s2len;
|
---|
249 |
|
---|
250 | s2len = strlen (dep_name (d2));
|
---|
251 |
|
---|
252 | /* Can't build something from itself. */
|
---|
253 | if (slen == s2len && streq (dep_name (d), dep_name (d2)))
|
---|
254 | continue;
|
---|
255 |
|
---|
256 | memcpy (rulename + slen, dep_name (d2), s2len + 1);
|
---|
257 | f = lookup_file (rulename);
|
---|
258 | if (f == 0 || f->cmds == 0)
|
---|
259 | continue;
|
---|
260 |
|
---|
261 | if (s2len == 2 && rulename[slen] == '.' && rulename[slen + 1] == 'a')
|
---|
262 | /* A suffix rule '.X.a:' generates the pattern rule '(%.o): %.X'.
|
---|
263 | It also generates a normal '%.a: %.X' rule below. */
|
---|
264 | convert_suffix_rule (NULL, /* Indicates '(%.o)'. */
|
---|
265 | dep_name (d),
|
---|
266 | f->cmds);
|
---|
267 |
|
---|
268 | /* The suffix rule '.X.Y:' is converted
|
---|
269 | to the pattern rule '%.Y: %.X'. */
|
---|
270 | convert_suffix_rule (dep_name (d2), dep_name (d), f->cmds);
|
---|
271 | }
|
---|
272 | }
|
---|
273 | }
|
---|
274 |
|
---|
275 |
|
---|
276 | /* Install the pattern rule RULE (whose fields have been filled in) at the end
|
---|
277 | of the list (so that any rules previously defined will take precedence).
|
---|
278 | If this rule duplicates a previous one (identical target and dependencies),
|
---|
279 | the old one is replaced if OVERRIDE is nonzero, otherwise this new one is
|
---|
280 | thrown out. When an old rule is replaced, the new one is put at the end of
|
---|
281 | the list. Return nonzero if RULE is used; zero if not. */
|
---|
282 |
|
---|
283 | static int
|
---|
284 | new_pattern_rule (struct rule *rule, int override)
|
---|
285 | {
|
---|
286 | struct rule *r, *lastrule;
|
---|
287 | unsigned int i, j;
|
---|
288 |
|
---|
289 | rule->in_use = 0;
|
---|
290 | rule->terminal = 0;
|
---|
291 |
|
---|
292 | rule->next = 0;
|
---|
293 |
|
---|
294 | /* Search for an identical rule. */
|
---|
295 | lastrule = 0;
|
---|
296 | for (r = pattern_rules; r != 0; lastrule = r, r = r->next)
|
---|
297 | for (i = 0; i < rule->num; ++i)
|
---|
298 | {
|
---|
299 | for (j = 0; j < r->num; ++j)
|
---|
300 | if (!streq (rule->targets[i], r->targets[j]))
|
---|
301 | break;
|
---|
302 | /* If all the targets matched... */
|
---|
303 | if (j == r->num)
|
---|
304 | {
|
---|
305 | struct dep *d, *d2;
|
---|
306 | for (d = rule->deps, d2 = r->deps;
|
---|
307 | d != 0 && d2 != 0; d = d->next, d2 = d2->next)
|
---|
308 | if (!streq (dep_name (d), dep_name (d2)))
|
---|
309 | break;
|
---|
310 | if (d == 0 && d2 == 0)
|
---|
311 | {
|
---|
312 | /* All the dependencies matched. */
|
---|
313 | if (override)
|
---|
314 | {
|
---|
315 | /* Remove the old rule. */
|
---|
316 | freerule (r, lastrule);
|
---|
317 | /* Install the new one. */
|
---|
318 | if (pattern_rules == 0)
|
---|
319 | pattern_rules = rule;
|
---|
320 | else
|
---|
321 | last_pattern_rule->next = rule;
|
---|
322 | last_pattern_rule = rule;
|
---|
323 |
|
---|
324 | /* We got one. Stop looking. */
|
---|
325 | goto matched;
|
---|
326 | }
|
---|
327 | else
|
---|
328 | {
|
---|
329 | /* The old rule stays intact. Destroy the new one. */
|
---|
330 | freerule (rule, (struct rule *) 0);
|
---|
331 | return 0;
|
---|
332 | }
|
---|
333 | }
|
---|
334 | }
|
---|
335 | }
|
---|
336 |
|
---|
337 | matched:;
|
---|
338 |
|
---|
339 | if (r == 0)
|
---|
340 | {
|
---|
341 | /* There was no rule to replace. */
|
---|
342 | if (pattern_rules == 0)
|
---|
343 | pattern_rules = rule;
|
---|
344 | else
|
---|
345 | last_pattern_rule->next = rule;
|
---|
346 | last_pattern_rule = rule;
|
---|
347 | }
|
---|
348 |
|
---|
349 | return 1;
|
---|
350 | }
|
---|
351 |
|
---|
352 |
|
---|
353 | /* Install an implicit pattern rule based on the three text strings
|
---|
354 | in the structure P points to. These strings come from one of
|
---|
355 | the arrays of default implicit pattern rules.
|
---|
356 | TERMINAL specifies what the 'terminal' field of the rule should be. */
|
---|
357 |
|
---|
358 | void
|
---|
359 | install_pattern_rule (struct pspec *p, int terminal)
|
---|
360 | {
|
---|
361 | struct rule *r;
|
---|
362 | const char *ptr;
|
---|
363 |
|
---|
364 | r = xmalloc (sizeof (struct rule));
|
---|
365 |
|
---|
366 | r->num = 1;
|
---|
367 | r->targets = xmalloc (sizeof (const char *));
|
---|
368 | r->suffixes = xmalloc (sizeof (const char *));
|
---|
369 | r->lens = xmalloc (sizeof (unsigned int));
|
---|
370 |
|
---|
371 | r->lens[0] = strlen (p->target);
|
---|
372 | r->targets[0] = p->target;
|
---|
373 | r->suffixes[0] = find_percent_cached (&r->targets[0]);
|
---|
374 | assert (r->suffixes[0] != NULL);
|
---|
375 | ++r->suffixes[0];
|
---|
376 |
|
---|
377 | ptr = p->dep;
|
---|
378 | r->deps = PARSE_SIMPLE_SEQ ((char **)&ptr, struct dep);
|
---|
379 |
|
---|
380 | if (new_pattern_rule (r, 0))
|
---|
381 | {
|
---|
382 | r->terminal = terminal;
|
---|
383 | r->cmds = xmalloc (sizeof (struct commands));
|
---|
384 | r->cmds->fileinfo.filenm = 0;
|
---|
385 | r->cmds->fileinfo.lineno = 0;
|
---|
386 | r->cmds->fileinfo.offset = 0;
|
---|
387 | /* These will all be string literals, but we malloc space for them
|
---|
388 | anyway because somebody might want to free them later. */
|
---|
389 | r->cmds->commands = xstrdup (p->commands);
|
---|
390 | r->cmds->command_lines = 0;
|
---|
391 | r->cmds->recipe_prefix = RECIPEPREFIX_DEFAULT;
|
---|
392 | }
|
---|
393 | }
|
---|
394 |
|
---|
395 |
|
---|
396 | /* Free all the storage used in RULE and take it out of the
|
---|
397 | pattern_rules chain. LASTRULE is the rule whose next pointer
|
---|
398 | points to RULE. */
|
---|
399 |
|
---|
400 | static void
|
---|
401 | freerule (struct rule *rule, struct rule *lastrule)
|
---|
402 | {
|
---|
403 | struct rule *next = rule->next;
|
---|
404 |
|
---|
405 | free_dep_chain (rule->deps);
|
---|
406 |
|
---|
407 | /* MSVC erroneously warns without a cast here. */
|
---|
408 | free ((void *)rule->targets);
|
---|
409 | free ((void *)rule->suffixes);
|
---|
410 | free (rule->lens);
|
---|
411 |
|
---|
412 | /* We can't free the storage for the commands because there
|
---|
413 | are ways that they could be in more than one place:
|
---|
414 | * If the commands came from a suffix rule, they could also be in
|
---|
415 | the 'struct file's for other suffix rules or plain targets given
|
---|
416 | on the same makefile line.
|
---|
417 | * If two suffixes that together make a two-suffix rule were each
|
---|
418 | given twice in the .SUFFIXES list, and in the proper order, two
|
---|
419 | identical pattern rules would be created and the second one would
|
---|
420 | be discarded here, but both would contain the same 'struct commands'
|
---|
421 | pointer from the 'struct file' for the suffix rule. */
|
---|
422 |
|
---|
423 | free (rule);
|
---|
424 |
|
---|
425 | if (pattern_rules == rule)
|
---|
426 | if (lastrule != 0)
|
---|
427 | abort ();
|
---|
428 | else
|
---|
429 | pattern_rules = next;
|
---|
430 | else if (lastrule != 0)
|
---|
431 | lastrule->next = next;
|
---|
432 | if (last_pattern_rule == rule)
|
---|
433 | last_pattern_rule = lastrule;
|
---|
434 | }
|
---|
435 | |
---|
436 |
|
---|
437 | /* Create a new pattern rule with the targets in the nil-terminated array
|
---|
438 | TARGETS. TARGET_PERCENTS is an array of pointers to the % in each element
|
---|
439 | of TARGETS. N is the number of items in the array (not counting the nil
|
---|
440 | element). The new rule has dependencies DEPS and commands from COMMANDS.
|
---|
441 | It is a terminal rule if TERMINAL is nonzero. This rule overrides
|
---|
442 | identical rules with different commands if OVERRIDE is nonzero.
|
---|
443 |
|
---|
444 | The storage for TARGETS and its elements and TARGET_PERCENTS is used and
|
---|
445 | must not be freed until the rule is destroyed. */
|
---|
446 |
|
---|
447 | void
|
---|
448 | create_pattern_rule (const char **targets, const char **target_percents,
|
---|
449 | unsigned int n, int terminal, struct dep *deps,
|
---|
450 | struct commands *commands, int override)
|
---|
451 | {
|
---|
452 | unsigned int i;
|
---|
453 | struct rule *r = xmalloc (sizeof (struct rule));
|
---|
454 |
|
---|
455 | r->num = n;
|
---|
456 | r->cmds = commands;
|
---|
457 | r->deps = deps;
|
---|
458 | r->targets = targets;
|
---|
459 | r->suffixes = target_percents;
|
---|
460 | r->lens = xmalloc (n * sizeof (unsigned int));
|
---|
461 |
|
---|
462 | for (i = 0; i < n; ++i)
|
---|
463 | {
|
---|
464 | r->lens[i] = strlen (targets[i]);
|
---|
465 | assert (r->suffixes[i] != NULL);
|
---|
466 | ++r->suffixes[i];
|
---|
467 | }
|
---|
468 |
|
---|
469 | if (new_pattern_rule (r, override))
|
---|
470 | r->terminal = terminal;
|
---|
471 | }
|
---|
472 | |
---|
473 |
|
---|
474 | /* Print the data base of rules. */
|
---|
475 |
|
---|
476 | static void /* Useful to call from gdb. */
|
---|
477 | print_rule (struct rule *r)
|
---|
478 | {
|
---|
479 | unsigned int i;
|
---|
480 |
|
---|
481 | for (i = 0; i < r->num; ++i)
|
---|
482 | {
|
---|
483 | fputs (r->targets[i], stdout);
|
---|
484 | putchar ((i + 1 == r->num) ? ':' : ' ');
|
---|
485 | }
|
---|
486 | if (r->terminal)
|
---|
487 | putchar (':');
|
---|
488 |
|
---|
489 | print_prereqs (r->deps);
|
---|
490 |
|
---|
491 | if (r->cmds != 0)
|
---|
492 | print_commands (r->cmds);
|
---|
493 | }
|
---|
494 |
|
---|
495 | void
|
---|
496 | print_rule_data_base (void)
|
---|
497 | {
|
---|
498 | unsigned int rules, terminal;
|
---|
499 | struct rule *r;
|
---|
500 |
|
---|
501 | puts (_("\n# Implicit Rules"));
|
---|
502 |
|
---|
503 | rules = terminal = 0;
|
---|
504 | for (r = pattern_rules; r != 0; r = r->next)
|
---|
505 | {
|
---|
506 | ++rules;
|
---|
507 |
|
---|
508 | putchar ('\n');
|
---|
509 | print_rule (r);
|
---|
510 |
|
---|
511 | if (r->terminal)
|
---|
512 | ++terminal;
|
---|
513 | }
|
---|
514 |
|
---|
515 | if (rules == 0)
|
---|
516 | puts (_("\n# No implicit rules."));
|
---|
517 | else
|
---|
518 | {
|
---|
519 | printf (_("\n# %u implicit rules, %u"), rules, terminal);
|
---|
520 | #ifndef NO_FLOAT
|
---|
521 | printf (" (%.1f%%)", (double) terminal / (double) rules * 100.0);
|
---|
522 | #else
|
---|
523 | {
|
---|
524 | int f = (terminal * 1000 + 5) / rules;
|
---|
525 | printf (" (%d.%d%%)", f/10, f%10);
|
---|
526 | }
|
---|
527 | #endif
|
---|
528 | puts (_(" terminal."));
|
---|
529 | }
|
---|
530 |
|
---|
531 | if (num_pattern_rules != rules)
|
---|
532 | {
|
---|
533 | /* This can happen if a fatal error was detected while reading the
|
---|
534 | makefiles and thus count_implicit_rule_limits wasn't called yet. */
|
---|
535 | if (num_pattern_rules != 0)
|
---|
536 | ONN (fatal, NILF, _("BUG: num_pattern_rules is wrong! %u != %u"),
|
---|
537 | num_pattern_rules, rules);
|
---|
538 | }
|
---|
539 | }
|
---|