make.h revision 1.280 1 1.280 rillig /* $NetBSD: make.h,v 1.280 2021/12/28 14:06:42 rillig Exp $ */
2 1.6 christos
3 1.1 cgd /*
4 1.6 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.6 christos * The Regents of the University of California. All rights reserved.
6 1.47 agc *
7 1.47 agc * This code is derived from software contributed to Berkeley by
8 1.47 agc * Adam de Boor.
9 1.47 agc *
10 1.47 agc * Redistribution and use in source and binary forms, with or without
11 1.47 agc * modification, are permitted provided that the following conditions
12 1.47 agc * are met:
13 1.47 agc * 1. Redistributions of source code must retain the above copyright
14 1.47 agc * notice, this list of conditions and the following disclaimer.
15 1.47 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.47 agc * notice, this list of conditions and the following disclaimer in the
17 1.47 agc * documentation and/or other materials provided with the distribution.
18 1.47 agc * 3. Neither the name of the University nor the names of its contributors
19 1.47 agc * may be used to endorse or promote products derived from this software
20 1.47 agc * without specific prior written permission.
21 1.47 agc *
22 1.47 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.47 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.47 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.47 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.47 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.47 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.47 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.47 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.47 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.47 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.47 agc * SUCH DAMAGE.
33 1.47 agc *
34 1.47 agc * from: @(#)make.h 8.3 (Berkeley) 6/13/95
35 1.47 agc */
36 1.47 agc
37 1.47 agc /*
38 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
39 1.1 cgd * All rights reserved.
40 1.1 cgd *
41 1.1 cgd * This code is derived from software contributed to Berkeley by
42 1.1 cgd * Adam de Boor.
43 1.1 cgd *
44 1.1 cgd * Redistribution and use in source and binary forms, with or without
45 1.1 cgd * modification, are permitted provided that the following conditions
46 1.1 cgd * are met:
47 1.1 cgd * 1. Redistributions of source code must retain the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer.
49 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
50 1.1 cgd * notice, this list of conditions and the following disclaimer in the
51 1.1 cgd * documentation and/or other materials provided with the distribution.
52 1.1 cgd * 3. All advertising materials mentioning features or use of this software
53 1.1 cgd * must display the following acknowledgement:
54 1.1 cgd * This product includes software developed by the University of
55 1.1 cgd * California, Berkeley and its contributors.
56 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
57 1.1 cgd * may be used to endorse or promote products derived from this software
58 1.1 cgd * without specific prior written permission.
59 1.1 cgd *
60 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
61 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
62 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
63 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
64 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
65 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
66 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
67 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
68 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
69 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
70 1.1 cgd * SUCH DAMAGE.
71 1.1 cgd *
72 1.11 christos * from: @(#)make.h 8.3 (Berkeley) 6/13/95
73 1.1 cgd */
74 1.1 cgd
75 1.244 rillig /*
76 1.1 cgd * make.h --
77 1.1 cgd * The global definitions for pmake
78 1.1 cgd */
79 1.1 cgd
80 1.116 rillig #ifndef MAKE_MAKE_H
81 1.116 rillig #define MAKE_MAKE_H
82 1.1 cgd
83 1.1 cgd #include <sys/types.h>
84 1.13 christos #include <sys/param.h>
85 1.135 rillig #include <sys/stat.h>
86 1.44 wiz
87 1.123 rillig #include <assert.h>
88 1.44 wiz #include <ctype.h>
89 1.97 christos #include <fcntl.h>
90 1.150 rillig #include <stdarg.h>
91 1.3 cgd #include <stdio.h>
92 1.44 wiz #include <stdlib.h>
93 1.1 cgd #include <string.h>
94 1.44 wiz #include <unistd.h>
95 1.12 christos
96 1.19 tv #ifdef BSD4_4
97 1.12 christos # include <sys/cdefs.h>
98 1.4 glass #endif
99 1.12 christos
100 1.97 christos #ifndef FD_CLOEXEC
101 1.97 christos #define FD_CLOEXEC 1
102 1.97 christos #endif
103 1.97 christos
104 1.259 rillig #if defined(__GNUC__)
105 1.230 rillig #define MAKE_GNUC_PREREQ(x, y) \
106 1.52 yamt ((__GNUC__ == (x) && __GNUC_MINOR__ >= (y)) || \
107 1.52 yamt (__GNUC__ > (x)))
108 1.278 rillig #else
109 1.230 rillig #define MAKE_GNUC_PREREQ(x, y) 0
110 1.278 rillig #endif
111 1.52 yamt
112 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
113 1.230 rillig #define MAKE_ATTR_UNUSED __attribute__((__unused__))
114 1.51 jmc #else
115 1.230 rillig #define MAKE_ATTR_UNUSED /* delete */
116 1.51 jmc #endif
117 1.89 joerg
118 1.89 joerg #if MAKE_GNUC_PREREQ(2, 5)
119 1.230 rillig #define MAKE_ATTR_DEAD __attribute__((__noreturn__))
120 1.89 joerg #elif defined(__GNUC__)
121 1.230 rillig #define MAKE_ATTR_DEAD __volatile
122 1.89 joerg #else
123 1.230 rillig #define MAKE_ATTR_DEAD /* delete */
124 1.51 jmc #endif
125 1.44 wiz
126 1.89 joerg #if MAKE_GNUC_PREREQ(2, 7)
127 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) \
128 1.89 joerg __attribute__((__format__ (__printf__, fmtarg, firstvararg)))
129 1.89 joerg #else
130 1.89 joerg #define MAKE_ATTR_PRINTFLIKE(fmtarg, firstvararg) /* delete */
131 1.87 joerg #endif
132 1.87 joerg
133 1.273 rillig #if MAKE_GNUC_PREREQ(4, 0)
134 1.278 rillig #define MAKE_ATTR_USE __attribute__((__warn_unused_result__))
135 1.273 rillig #else
136 1.278 rillig #define MAKE_ATTR_USE /* delete */
137 1.273 rillig #endif
138 1.273 rillig
139 1.205 rillig #define MAKE_INLINE static inline MAKE_ATTR_UNUSED
140 1.264 rillig
141 1.264 rillig /* MAKE_STATIC marks a function that may or may not be inlined. */
142 1.264 rillig #if defined(lint)
143 1.264 rillig /* As of 2021-07-31, NetBSD lint ignores __attribute__((unused)). */
144 1.264 rillig #define MAKE_STATIC MAKE_INLINE
145 1.264 rillig #else
146 1.262 rillig #define MAKE_STATIC static MAKE_ATTR_UNUSED
147 1.264 rillig #endif
148 1.205 rillig
149 1.257 rillig #if __STDC_VERSION__ >= 199901L || defined(lint) || defined(USE_C99_BOOLEAN)
150 1.235 rillig #include <stdbool.h>
151 1.265 rillig #elif defined(__bool_true_false_are_defined)
152 1.265 rillig /*
153 1.265 rillig * All files of make must be compiled with the same definition of bool.
154 1.265 rillig * Since one of the files includes <stdbool.h>, that means the header is
155 1.265 rillig * available on this platform. Recompile everything with -DUSE_C99_BOOLEAN.
156 1.265 rillig */
157 1.265 rillig #error "<stdbool.h> is included in pre-C99 mode"
158 1.265 rillig #elif defined(bool) || defined(true) || defined(false)
159 1.265 rillig /*
160 1.265 rillig * In pre-C99 mode, make does not expect that bool is already defined.
161 1.265 rillig * You need to ensure that all translation units use the same definition for
162 1.265 rillig * bool.
163 1.265 rillig */
164 1.265 rillig #error "bool/true/false is defined in pre-C99 mode"
165 1.130 rillig #else
166 1.265 rillig typedef unsigned char bool;
167 1.257 rillig #define true 1
168 1.257 rillig #define false 0
169 1.140 rillig #endif
170 1.127 rillig
171 1.1 cgd #include "lst.h"
172 1.261 rillig #include "make_malloc.h"
173 1.261 rillig #include "str.h"
174 1.22 mycroft #include "hash.h"
175 1.1 cgd #include "config.h"
176 1.3 cgd #include "buf.h"
177 1.1 cgd
178 1.216 rillig /*
179 1.216 rillig * The typical flow of states is:
180 1.216 rillig *
181 1.216 rillig * The direct successful path:
182 1.216 rillig * UNMADE -> BEINGMADE -> MADE.
183 1.216 rillig *
184 1.216 rillig * The direct error path:
185 1.216 rillig * UNMADE -> BEINGMADE -> ERROR.
186 1.216 rillig *
187 1.216 rillig * The successful path when dependencies need to be made first:
188 1.216 rillig * UNMADE -> DEFERRED -> REQUESTED -> BEINGMADE -> MADE.
189 1.216 rillig *
190 1.216 rillig * A node that has dependencies, and one of the dependencies cannot be made:
191 1.216 rillig * UNMADE -> DEFERRED -> ABORTED.
192 1.216 rillig *
193 1.216 rillig * A node that turns out to be up-to-date:
194 1.216 rillig * UNMADE -> BEINGMADE -> UPTODATE.
195 1.216 rillig */
196 1.181 rillig typedef enum GNodeMade {
197 1.219 rillig /* Not examined yet. */
198 1.219 rillig UNMADE,
199 1.277 rillig /*
200 1.277 rillig * The node has been examined but is not yet ready since its
201 1.277 rillig * dependencies have to be made first.
202 1.277 rillig */
203 1.219 rillig DEFERRED,
204 1.219 rillig
205 1.219 rillig /* The node is on the toBeMade list. */
206 1.219 rillig REQUESTED,
207 1.219 rillig
208 1.277 rillig /*
209 1.277 rillig * The node is already being made. Trying to build a node in this
210 1.277 rillig * state indicates a cycle in the graph.
211 1.277 rillig */
212 1.219 rillig BEINGMADE,
213 1.219 rillig
214 1.219 rillig /* Was out-of-date and has been made. */
215 1.219 rillig MADE,
216 1.219 rillig /* Was already up-to-date, does not need to be made. */
217 1.219 rillig UPTODATE,
218 1.277 rillig /*
219 1.277 rillig * An error occurred while it was being made. Used only in compat
220 1.277 rillig * mode.
221 1.277 rillig */
222 1.219 rillig ERROR,
223 1.277 rillig /*
224 1.277 rillig * The target was aborted due to an error making a dependency. Used
225 1.277 rillig * only in compat mode.
226 1.277 rillig */
227 1.219 rillig ABORTED
228 1.119 rillig } GNodeMade;
229 1.1 cgd
230 1.241 rillig /*
231 1.241 rillig * The OP_ constants are used when parsing a dependency line as a way of
232 1.120 rillig * communicating to other parts of the program the way in which a target
233 1.120 rillig * should be made.
234 1.120 rillig *
235 1.241 rillig * Some of the OP_ constants can be combined, others cannot.
236 1.263 rillig *
237 1.263 rillig * See the tests depsrc-*.mk and deptgt-*.mk.
238 1.241 rillig */
239 1.159 rillig typedef enum GNodeType {
240 1.219 rillig OP_NONE = 0,
241 1.209 rillig
242 1.277 rillig /*
243 1.277 rillig * The dependency operator ':' is the most common one. The commands
244 1.277 rillig * of this node are executed if any child is out-of-date.
245 1.277 rillig */
246 1.219 rillig OP_DEPENDS = 1 << 0,
247 1.277 rillig /*
248 1.277 rillig * The dependency operator '!' always executes its commands, even if
249 1.277 rillig * its children are up-to-date.
250 1.277 rillig */
251 1.219 rillig OP_FORCE = 1 << 1,
252 1.277 rillig /*
253 1.277 rillig * The dependency operator '::' behaves like ':', except that it
254 1.219 rillig * allows multiple dependency groups to be defined. Each of these
255 1.277 rillig * groups is executed on its own, independently from the others. Each
256 1.277 rillig * individual dependency group is called a cohort.
257 1.277 rillig */
258 1.219 rillig OP_DOUBLEDEP = 1 << 2,
259 1.219 rillig
260 1.219 rillig /* Matches the dependency operators ':', '!' and '::'. */
261 1.219 rillig OP_OPMASK = OP_DEPENDS | OP_FORCE | OP_DOUBLEDEP,
262 1.219 rillig
263 1.219 rillig /* Don't care if the target doesn't exist and can't be created. */
264 1.219 rillig OP_OPTIONAL = 1 << 3,
265 1.219 rillig /* Use associated commands for parents. */
266 1.219 rillig OP_USE = 1 << 4,
267 1.277 rillig /*
268 1.277 rillig * Target is never out of date, but always execute commands anyway.
269 1.277 rillig * Its time doesn't matter, so it has none...sort of.
270 1.277 rillig */
271 1.219 rillig OP_EXEC = 1 << 5,
272 1.277 rillig /*
273 1.277 rillig * Ignore non-zero exit status from shell commands when creating the
274 1.277 rillig * node.
275 1.277 rillig */
276 1.219 rillig OP_IGNORE = 1 << 6,
277 1.219 rillig /* Don't remove the target when interrupted. */
278 1.219 rillig OP_PRECIOUS = 1 << 7,
279 1.219 rillig /* Don't echo commands when executed. */
280 1.219 rillig OP_SILENT = 1 << 8,
281 1.277 rillig /*
282 1.277 rillig * Target is a recursive make so its commands should always be
283 1.277 rillig * executed when it is out of date, regardless of the state of the -n
284 1.277 rillig * or -t flags.
285 1.277 rillig */
286 1.219 rillig OP_MAKE = 1 << 9,
287 1.277 rillig /*
288 1.277 rillig * Target is out-of-date only if any of its children was out-of-date.
289 1.277 rillig */
290 1.219 rillig OP_JOIN = 1 << 10,
291 1.219 rillig /* Assume the children of the node have been already made. */
292 1.219 rillig OP_MADE = 1 << 11,
293 1.219 rillig /* Special .BEGIN, .END or .INTERRUPT. */
294 1.219 rillig OP_SPECIAL = 1 << 12,
295 1.219 rillig /* Like .USE, only prepend commands. */
296 1.219 rillig OP_USEBEFORE = 1 << 13,
297 1.277 rillig /*
298 1.277 rillig * The node is invisible to its parents. I.e. it doesn't show up in
299 1.277 rillig * the parents' local variables (.IMPSRC, .ALLSRC).
300 1.277 rillig */
301 1.219 rillig OP_INVISIBLE = 1 << 14,
302 1.277 rillig /*
303 1.277 rillig * The node does not become the main target, even if it is the first
304 1.277 rillig * target in the first makefile.
305 1.277 rillig */
306 1.219 rillig OP_NOTMAIN = 1 << 15,
307 1.219 rillig /* Not a file target; run always. */
308 1.219 rillig OP_PHONY = 1 << 16,
309 1.219 rillig /* Don't search for the file in the path. */
310 1.219 rillig OP_NOPATH = 1 << 17,
311 1.277 rillig /*
312 1.277 rillig * In a dependency line "target: source1 .WAIT source2", source1 is
313 1.219 rillig * made first, including its children. Once that is finished,
314 1.219 rillig * source2 is made, including its children. The .WAIT keyword may
315 1.277 rillig * appear more than once in a single dependency declaration.
316 1.277 rillig */
317 1.219 rillig OP_WAIT = 1 << 18,
318 1.219 rillig /* .NOMETA do not create a .meta file */
319 1.219 rillig OP_NOMETA = 1 << 19,
320 1.219 rillig /* .META we _do_ want a .meta file */
321 1.219 rillig OP_META = 1 << 20,
322 1.219 rillig /* Do not compare commands in .meta file */
323 1.219 rillig OP_NOMETA_CMP = 1 << 21,
324 1.219 rillig /* Possibly a submake node */
325 1.219 rillig OP_SUBMAKE = 1 << 22,
326 1.219 rillig
327 1.219 rillig /* Attributes applied by PMake */
328 1.219 rillig
329 1.219 rillig /* The node is a transformation rule, such as ".c.o". */
330 1.219 rillig OP_TRANSFORM = 1 << 30,
331 1.219 rillig /* Target is a member of an archive */
332 1.219 rillig /* XXX: How does this differ from OP_ARCHV? */
333 1.219 rillig OP_MEMBER = 1 << 29,
334 1.277 rillig /*
335 1.277 rillig * The node is a library, its name has the form "-l<libname>".
336 1.277 rillig */
337 1.219 rillig OP_LIB = 1 << 28,
338 1.277 rillig /*
339 1.277 rillig * The node is an archive member, its name has the form
340 1.277 rillig * "archive(member)".
341 1.277 rillig */
342 1.219 rillig /* XXX: How does this differ from OP_MEMBER? */
343 1.219 rillig OP_ARCHV = 1 << 27,
344 1.277 rillig /*
345 1.277 rillig * Target has all the commands it should. Used when parsing to catch
346 1.219 rillig * multiple command groups for a target. Only applies to the
347 1.277 rillig * dependency operators ':' and '!', but not to '::'.
348 1.277 rillig */
349 1.219 rillig OP_HAS_COMMANDS = 1 << 26,
350 1.277 rillig /*
351 1.277 rillig * The special command "..." has been seen. All further commands from
352 1.277 rillig * this node will be saved on the .END node instead, to be executed
353 1.277 rillig * at the very end.
354 1.277 rillig */
355 1.219 rillig OP_SAVE_CMDS = 1 << 25,
356 1.277 rillig /*
357 1.277 rillig * Already processed by Suff_FindDeps, to find dependencies from
358 1.277 rillig * suffix transformation rules.
359 1.277 rillig */
360 1.219 rillig OP_DEPS_FOUND = 1 << 24,
361 1.219 rillig /* Node found while expanding .ALLSRC */
362 1.219 rillig OP_MARK = 1 << 23,
363 1.120 rillig } GNodeType;
364 1.120 rillig
365 1.269 rillig typedef struct GNodeFlags {
366 1.219 rillig /* this target needs to be (re)made */
367 1.268 rillig bool remake:1;
368 1.219 rillig /* children of this target were made */
369 1.268 rillig bool childMade:1;
370 1.219 rillig /* children don't exist, and we pretend made */
371 1.268 rillig bool force:1;
372 1.219 rillig /* Set by Make_ProcessWait() */
373 1.268 rillig bool doneWait:1;
374 1.219 rillig /* Build requested by .ORDER processing */
375 1.268 rillig bool doneOrder:1;
376 1.219 rillig /* Node created from .depend */
377 1.268 rillig bool fromDepend:1;
378 1.219 rillig /* We do it once only */
379 1.268 rillig bool doneAllsrc:1;
380 1.219 rillig /* Used by MakePrintStatus */
381 1.268 rillig bool cycle:1;
382 1.219 rillig /* Used by MakePrintStatus */
383 1.268 rillig bool doneCycle:1;
384 1.119 rillig } GNodeFlags;
385 1.1 cgd
386 1.143 rillig typedef struct List StringList;
387 1.143 rillig typedef struct ListNode StringListNode;
388 1.144 rillig
389 1.143 rillig typedef struct List GNodeList;
390 1.143 rillig typedef struct ListNode GNodeListNode;
391 1.143 rillig
392 1.246 rillig typedef struct SearchPath {
393 1.246 rillig List /* of CachedDir */ dirs;
394 1.246 rillig } SearchPath;
395 1.144 rillig
396 1.241 rillig /*
397 1.241 rillig * A graph node represents a target that can possibly be made, including its
398 1.241 rillig * relation to other targets and a lot of other details.
399 1.241 rillig */
400 1.119 rillig typedef struct GNode {
401 1.219 rillig /* The target's name, such as "clean" or "make.c" */
402 1.219 rillig char *name;
403 1.219 rillig /* The unexpanded name of a .USE node */
404 1.219 rillig char *uname;
405 1.277 rillig /*
406 1.277 rillig * The full pathname of the file belonging to the target.
407 1.277 rillig *
408 1.219 rillig * XXX: What about .PHONY targets? These don't have an associated
409 1.277 rillig * path.
410 1.277 rillig */
411 1.219 rillig char *path;
412 1.219 rillig
413 1.277 rillig /*
414 1.277 rillig * The type of operator used to define the sources (see the OP flags
415 1.219 rillig * below).
416 1.277 rillig *
417 1.277 rillig * XXX: This looks like a wild mixture of type and flags.
418 1.277 rillig */
419 1.219 rillig GNodeType type;
420 1.219 rillig GNodeFlags flags;
421 1.219 rillig
422 1.219 rillig /* The state of processing on this node */
423 1.219 rillig GNodeMade made;
424 1.219 rillig /* The number of unmade children */
425 1.219 rillig int unmade;
426 1.219 rillig
427 1.277 rillig /*
428 1.277 rillig * The modification time; 0 means the node does not have a
429 1.277 rillig * corresponding file; see GNode_IsOODate.
430 1.277 rillig */
431 1.219 rillig time_t mtime;
432 1.219 rillig struct GNode *youngestChild;
433 1.219 rillig
434 1.277 rillig /*
435 1.277 rillig * The GNodes for which this node is an implied source. May be empty.
436 1.277 rillig * For example, when there is an inference rule for .c.o, the node
437 1.277 rillig * for file.c has the node for file.o in this list.
438 1.277 rillig */
439 1.225 rillig GNodeList implicitParents;
440 1.219 rillig
441 1.277 rillig /*
442 1.277 rillig * The nodes that depend on this one, or in other words, the nodes
443 1.277 rillig * for which this is a source.
444 1.277 rillig */
445 1.222 rillig GNodeList parents;
446 1.219 rillig /* The nodes on which this one depends. */
447 1.222 rillig GNodeList children;
448 1.219 rillig
449 1.277 rillig /*
450 1.277 rillig * .ORDER nodes we need made. The nodes that must be made (if they're
451 1.219 rillig * made) before this node can be made, but that do not enter into the
452 1.277 rillig * datedness of this node.
453 1.277 rillig */
454 1.223 rillig GNodeList order_pred;
455 1.277 rillig /*
456 1.277 rillig * .ORDER nodes who need us. The nodes that must be made (if they're
457 1.219 rillig * made at all) after this node is made, but that do not depend on
458 1.277 rillig * this node, in the normal sense.
459 1.277 rillig */
460 1.223 rillig GNodeList order_succ;
461 1.219 rillig
462 1.245 rillig /*
463 1.245 rillig * Other nodes of the same name, for targets that were defined using
464 1.245 rillig * the '::' dependency operator (OP_DOUBLEDEP).
465 1.245 rillig */
466 1.224 rillig GNodeList cohorts;
467 1.219 rillig /* The "#n" suffix for this cohort, or "" for other nodes */
468 1.219 rillig char cohort_num[8];
469 1.219 rillig /* The number of unmade instances on the cohorts list */
470 1.219 rillig int unmade_cohorts;
471 1.277 rillig /*
472 1.277 rillig * Pointer to the first instance of a '::' node; only set when on a
473 1.277 rillig * cohorts list
474 1.277 rillig */
475 1.219 rillig struct GNode *centurion;
476 1.219 rillig
477 1.219 rillig /* Last time (sequence number) we tried to make this node */
478 1.219 rillig unsigned int checked_seqno;
479 1.219 rillig
480 1.252 rillig /*
481 1.252 rillig * The "local" variables that are specific to this target and this
482 1.219 rillig * target only, such as $@, $<, $?.
483 1.219 rillig *
484 1.252 rillig * Also used for the global variable scopes SCOPE_GLOBAL,
485 1.252 rillig * SCOPE_CMDLINE, SCOPE_INTERNAL, which contain variables with
486 1.252 rillig * arbitrary names.
487 1.252 rillig */
488 1.219 rillig HashTable /* of Var pointer */ vars;
489 1.219 rillig
490 1.219 rillig /* The commands to be given to a shell to create this target. */
491 1.221 rillig StringList commands;
492 1.219 rillig
493 1.277 rillig /*
494 1.277 rillig * Suffix for the node (determined by Suff_FindDeps and opaque to
495 1.277 rillig * everyone but the Suff module)
496 1.277 rillig */
497 1.219 rillig struct Suffix *suffix;
498 1.219 rillig
499 1.271 rillig /* Filename where the GNode got defined, unlimited lifetime */
500 1.219 rillig const char *fname;
501 1.219 rillig /* Line number where the GNode got defined */
502 1.219 rillig int lineno;
503 1.1 cgd } GNode;
504 1.1 cgd
505 1.188 rillig /* Error levels for diagnostics during parsing. */
506 1.167 rillig typedef enum ParseErrorLevel {
507 1.277 rillig /*
508 1.277 rillig * Exit when the current top-level makefile has been parsed
509 1.277 rillig * completely.
510 1.277 rillig */
511 1.219 rillig PARSE_FATAL = 1,
512 1.219 rillig /* Print "warning"; may be upgraded to fatal by the -w option. */
513 1.219 rillig PARSE_WARNING,
514 1.219 rillig /* Informational, mainly used during development of makefiles. */
515 1.219 rillig PARSE_INFO
516 1.167 rillig } ParseErrorLevel;
517 1.1 cgd
518 1.1 cgd /*
519 1.141 rillig * Values returned by Cond_EvalLine and Cond_EvalCondition.
520 1.1 cgd */
521 1.159 rillig typedef enum CondEvalResult {
522 1.219 rillig COND_PARSE, /* Parse the next lines */
523 1.219 rillig COND_SKIP, /* Skip the next lines */
524 1.219 rillig COND_INVALID /* Not a conditional statement */
525 1.113 rillig } CondEvalResult;
526 1.1 cgd
527 1.190 rillig /* Names of the variables that are "local" to a specific target. */
528 1.277 rillig #define TARGET "@" /* Target of dependency */
529 1.277 rillig #define OODATE "?" /* All out-of-date sources */
530 1.277 rillig #define ALLSRC ">" /* All sources */
531 1.277 rillig #define IMPSRC "<" /* Source implied by transformation */
532 1.277 rillig #define PREFIX "*" /* Common prefix */
533 1.277 rillig #define ARCHIVE "!" /* Archive in "archive(member)" syntax */
534 1.277 rillig #define MEMBER "%" /* Member in "archive(member)" syntax */
535 1.148 rillig
536 1.1 cgd /*
537 1.11 christos * Global Variables
538 1.1 cgd */
539 1.1 cgd
540 1.190 rillig /* True if every target is precious */
541 1.257 rillig extern bool allPrecious;
542 1.190 rillig /* True if failed targets should be deleted */
543 1.257 rillig extern bool deleteOnError;
544 1.257 rillig /* true while processing .depend */
545 1.257 rillig extern bool doing_depend;
546 1.190 rillig /* .DEFAULT rule */
547 1.207 rillig extern GNode *defaultNode;
548 1.190 rillig
549 1.241 rillig /*
550 1.241 rillig * Variables defined internally by make which should not override those set
551 1.241 rillig * by makefiles.
552 1.241 rillig */
553 1.252 rillig extern GNode *SCOPE_INTERNAL;
554 1.255 rillig /* Variables defined in a global scope, e.g in the makefile itself. */
555 1.252 rillig extern GNode *SCOPE_GLOBAL;
556 1.190 rillig /* Variables defined on the command line. */
557 1.252 rillig extern GNode *SCOPE_CMDLINE;
558 1.190 rillig
559 1.241 rillig /*
560 1.241 rillig * Value returned by Var_Parse when an error is encountered. It actually
561 1.241 rillig * points to an empty string, so naive callers needn't worry about it.
562 1.241 rillig */
563 1.190 rillig extern char var_Error[];
564 1.190 rillig
565 1.190 rillig /* The time at the start of this whole process */
566 1.190 rillig extern time_t now;
567 1.1 cgd
568 1.241 rillig /*
569 1.241 rillig * The list of directories to search when looking for targets (set by the
570 1.241 rillig * special target .PATH).
571 1.241 rillig */
572 1.229 rillig extern SearchPath dirSearchPath;
573 1.186 rillig /* Used for .include "...". */
574 1.186 rillig extern SearchPath *parseIncPath;
575 1.241 rillig /*
576 1.249 rillig * Used for .include <...>, for the built-in sys.mk and for makefiles from
577 1.249 rillig * the command line arguments.
578 1.241 rillig */
579 1.186 rillig extern SearchPath *sysIncPath;
580 1.186 rillig /* The default for sysIncPath. */
581 1.186 rillig extern SearchPath *defSysIncPath;
582 1.32 christos
583 1.191 rillig /* Startup directory */
584 1.191 rillig extern char curdir[];
585 1.191 rillig /* The basename of the program name, suffixed with [n] for sub-makes. */
586 1.234 rillig extern const char *progname;
587 1.248 rillig extern int makelevel;
588 1.191 rillig /* Name of the .depend makefile */
589 1.191 rillig extern char *makeDependfile;
590 1.187 rillig /* If we replaced environ, this will be non-NULL. */
591 1.187 rillig extern char **savedEnv;
592 1.30 sommerfe
593 1.190 rillig extern pid_t myPid;
594 1.82 sjg
595 1.219 rillig #define MAKEFLAGS ".MAKEFLAGS"
596 1.219 rillig #define MAKEOVERRIDES ".MAKEOVERRIDES"
597 1.219 rillig /* prefix when printing the target of a job */
598 1.219 rillig #define MAKE_JOB_PREFIX ".MAKE.JOB.PREFIX"
599 1.219 rillig #define MAKE_EXPORTED ".MAKE.EXPORTED" /* exported variables */
600 1.219 rillig #define MAKE_MAKEFILES ".MAKE.MAKEFILES" /* all loaded makefiles */
601 1.219 rillig #define MAKE_LEVEL ".MAKE.LEVEL" /* recursion level */
602 1.185 rillig #define MAKE_MAKEFILE_PREFERENCE ".MAKE.MAKEFILE_PREFERENCE"
603 1.215 rillig #define MAKE_DEPENDFILE ".MAKE.DEPENDFILE" /* .depend */
604 1.80 sjg #define MAKE_MODE ".MAKE.MODE"
605 1.91 sjg #ifndef MAKE_LEVEL_ENV
606 1.91 sjg # define MAKE_LEVEL_ENV "MAKELEVEL"
607 1.91 sjg #endif
608 1.1 cgd
609 1.272 rillig typedef struct DebugFlags {
610 1.275 rillig bool DEBUG_ARCH:1;
611 1.275 rillig bool DEBUG_COND:1;
612 1.275 rillig bool DEBUG_CWD:1;
613 1.275 rillig bool DEBUG_DIR:1;
614 1.275 rillig bool DEBUG_ERROR:1;
615 1.275 rillig bool DEBUG_FOR:1;
616 1.275 rillig bool DEBUG_GRAPH1:1;
617 1.275 rillig bool DEBUG_GRAPH2:1;
618 1.275 rillig bool DEBUG_GRAPH3:1;
619 1.275 rillig bool DEBUG_HASH:1;
620 1.275 rillig bool DEBUG_JOB:1;
621 1.275 rillig bool DEBUG_LOUD:1;
622 1.275 rillig bool DEBUG_MAKE:1;
623 1.275 rillig bool DEBUG_META:1;
624 1.275 rillig bool DEBUG_PARSE:1;
625 1.275 rillig bool DEBUG_SCRIPT:1;
626 1.275 rillig bool DEBUG_SHELL:1;
627 1.275 rillig bool DEBUG_SUFF:1;
628 1.275 rillig bool DEBUG_TARG:1;
629 1.275 rillig bool DEBUG_VAR:1;
630 1.170 rillig } DebugFlags;
631 1.170 rillig
632 1.219 rillig #define CONCAT(a, b) a##b
633 1.1 cgd
634 1.272 rillig #define DEBUG(module) (opts.debug.CONCAT(DEBUG_, module))
635 1.1 cgd
636 1.151 rillig void debug_printf(const char *, ...) MAKE_ATTR_PRINTFLIKE(1, 2);
637 1.150 rillig
638 1.232 rillig #define DEBUG_IMPL(module, args) \
639 1.232 rillig do { \
640 1.232 rillig if (DEBUG(module)) \
641 1.232 rillig debug_printf args; \
642 1.266 rillig } while (false)
643 1.232 rillig
644 1.149 rillig #define DEBUG0(module, text) \
645 1.232 rillig DEBUG_IMPL(module, ("%s", text))
646 1.149 rillig #define DEBUG1(module, fmt, arg1) \
647 1.232 rillig DEBUG_IMPL(module, (fmt, arg1))
648 1.149 rillig #define DEBUG2(module, fmt, arg1, arg2) \
649 1.232 rillig DEBUG_IMPL(module, (fmt, arg1, arg2))
650 1.149 rillig #define DEBUG3(module, fmt, arg1, arg2, arg3) \
651 1.232 rillig DEBUG_IMPL(module, (fmt, arg1, arg2, arg3))
652 1.149 rillig #define DEBUG4(module, fmt, arg1, arg2, arg3, arg4) \
653 1.232 rillig DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4))
654 1.149 rillig #define DEBUG5(module, fmt, arg1, arg2, arg3, arg4, arg5) \
655 1.232 rillig DEBUG_IMPL(module, (fmt, arg1, arg2, arg3, arg4, arg5))
656 1.149 rillig
657 1.173 rillig typedef enum PrintVarsMode {
658 1.219 rillig PVM_NONE,
659 1.219 rillig PVM_UNEXPANDED,
660 1.219 rillig PVM_EXPANDED
661 1.173 rillig } PrintVarsMode;
662 1.173 rillig
663 1.173 rillig /* Command line options */
664 1.173 rillig typedef struct CmdOpts {
665 1.219 rillig /* -B: whether we are make compatible */
666 1.257 rillig bool compatMake;
667 1.173 rillig
668 1.277 rillig /*
669 1.277 rillig * -d: debug control: There is one bit per module. It is up to the
670 1.277 rillig * module what debug information to print.
671 1.277 rillig */
672 1.219 rillig DebugFlags debug;
673 1.173 rillig
674 1.219 rillig /* -df: debug output is written here - default stderr */
675 1.219 rillig FILE *debug_file;
676 1.173 rillig
677 1.277 rillig /*
678 1.277 rillig * -dL: lint mode
679 1.219 rillig *
680 1.219 rillig * Runs make in strict mode, with additional checks and better error
681 1.277 rillig * handling.
682 1.277 rillig */
683 1.257 rillig bool strict;
684 1.204 rillig
685 1.219 rillig /* -dV: for the -V option, print unexpanded variable values */
686 1.257 rillig bool debugVflag;
687 1.174 rillig
688 1.219 rillig /* -e: check environment variables before global variables */
689 1.257 rillig bool checkEnvFirst;
690 1.173 rillig
691 1.219 rillig /* -f: the makefiles to read */
692 1.226 rillig StringList makefiles;
693 1.173 rillig
694 1.219 rillig /* -i: if true, ignore all errors from shell commands */
695 1.257 rillig bool ignoreErrors;
696 1.173 rillig
697 1.277 rillig /*
698 1.277 rillig * -j: the maximum number of jobs that can run in parallel; this is
699 1.277 rillig * coordinated with the submakes
700 1.277 rillig */
701 1.219 rillig int maxJobs;
702 1.173 rillig
703 1.277 rillig /*
704 1.277 rillig * -k: if true and an error occurs while making a node, continue
705 1.277 rillig * making nodes that do not depend on the erroneous node
706 1.277 rillig */
707 1.257 rillig bool keepgoing;
708 1.173 rillig
709 1.219 rillig /* -N: execute no commands from the targets */
710 1.257 rillig bool noRecursiveExecute;
711 1.173 rillig
712 1.219 rillig /* -n: execute almost no commands from the targets */
713 1.257 rillig bool noExecute;
714 1.173 rillig
715 1.250 rillig /*
716 1.250 rillig * -q: if true, do not really make anything, just see if the targets
717 1.250 rillig * are out-of-date
718 1.250 rillig */
719 1.279 rillig bool query;
720 1.173 rillig
721 1.250 rillig /* -r: raw mode, do not load the builtin rules. */
722 1.257 rillig bool noBuiltins;
723 1.173 rillig
724 1.219 rillig /* -s: don't echo the shell commands before executing them */
725 1.279 rillig bool silent;
726 1.173 rillig
727 1.277 rillig /*
728 1.277 rillig * -t: touch the targets if they are out-of-date, but don't actually
729 1.277 rillig * make them
730 1.277 rillig */
731 1.279 rillig bool touch;
732 1.173 rillig
733 1.219 rillig /* -[Vv]: print expanded or unexpanded selected variables */
734 1.219 rillig PrintVarsMode printVars;
735 1.219 rillig /* -[Vv]: the variables to print */
736 1.227 rillig StringList variables;
737 1.173 rillig
738 1.219 rillig /* -W: if true, makefile parsing warnings are treated as errors */
739 1.257 rillig bool parseWarnFatal;
740 1.173 rillig
741 1.250 rillig /* -w: print 'Entering' and 'Leaving' for submakes */
742 1.257 rillig bool enterFlag;
743 1.173 rillig
744 1.277 rillig /*
745 1.277 rillig * -X: if true, do not export variables set on the command line to
746 1.277 rillig * the environment.
747 1.277 rillig */
748 1.257 rillig bool varNoExportEnv;
749 1.173 rillig
750 1.277 rillig /*
751 1.277 rillig * The target names specified on the command line. Used to resolve
752 1.277 rillig * .if make(...) statements.
753 1.277 rillig */
754 1.228 rillig StringList create;
755 1.173 rillig
756 1.173 rillig } CmdOpts;
757 1.173 rillig
758 1.173 rillig extern CmdOpts opts;
759 1.173 rillig
760 1.1 cgd #include "nonints.h"
761 1.1 cgd
762 1.199 rillig void GNode_UpdateYoungestChild(GNode *, GNode *);
763 1.274 rillig bool GNode_IsOODate(GNode *) MAKE_ATTR_USE;
764 1.144 rillig void Make_ExpandUse(GNodeList *);
765 1.274 rillig time_t Make_Recheck(GNode *) MAKE_ATTR_USE;
766 1.44 wiz void Make_HandleUse(GNode *, GNode *);
767 1.44 wiz void Make_Update(GNode *);
768 1.260 rillig void GNode_SetLocalVars(GNode *);
769 1.257 rillig bool Make_Run(GNodeList *);
770 1.274 rillig bool shouldDieQuietly(GNode *, int) MAKE_ATTR_USE;
771 1.80 sjg void PrintOnError(GNode *, const char *);
772 1.257 rillig void Main_ExportMAKEFLAGS(bool);
773 1.257 rillig bool Main_SetObjdir(bool, const char *, ...) MAKE_ATTR_PRINTFLIKE(2, 3);
774 1.274 rillig int mkTempFile(const char *, char *, size_t) MAKE_ATTR_USE;
775 1.208 rillig int str2Lst_Append(StringList *, char *);
776 1.126 rillig void GNode_FprintDetails(FILE *, const char *, const GNode *, const char *);
777 1.274 rillig bool GNode_ShouldExecute(GNode *gn) MAKE_ATTR_USE;
778 1.155 rillig
779 1.164 rillig /* See if the node was seen on the left-hand side of a dependency operator. */
780 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
781 1.164 rillig GNode_IsTarget(const GNode *gn)
782 1.155 rillig {
783 1.270 rillig return (gn->type & OP_OPMASK) != OP_NONE;
784 1.155 rillig }
785 1.155 rillig
786 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
787 1.172 rillig GNode_Path(const GNode *gn)
788 1.172 rillig {
789 1.219 rillig return gn->path != NULL ? gn->path : gn->name;
790 1.172 rillig }
791 1.172 rillig
792 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
793 1.218 rillig GNode_IsWaitingFor(const GNode *gn)
794 1.218 rillig {
795 1.268 rillig return gn->flags.remake && gn->made <= REQUESTED;
796 1.218 rillig }
797 1.218 rillig
798 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
799 1.218 rillig GNode_IsReady(const GNode *gn)
800 1.218 rillig {
801 1.218 rillig return gn->made > DEFERRED;
802 1.218 rillig }
803 1.218 rillig
804 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
805 1.218 rillig GNode_IsDone(const GNode *gn)
806 1.218 rillig {
807 1.218 rillig return gn->made >= MADE;
808 1.218 rillig }
809 1.218 rillig
810 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
811 1.217 rillig GNode_IsError(const GNode *gn)
812 1.217 rillig {
813 1.217 rillig return gn->made == ERROR || gn->made == ABORTED;
814 1.217 rillig }
815 1.217 rillig
816 1.280 rillig MAKE_INLINE bool MAKE_ATTR_USE
817 1.280 rillig GNode_IsMainCandidate(const GNode *gn)
818 1.280 rillig {
819 1.280 rillig /* XXX: What about OP_USEBEFORE? */
820 1.280 rillig return (gn->type & (OP_NOTMAIN | OP_USE | OP_EXEC | OP_TRANSFORM)) ==
821 1.280 rillig 0;
822 1.280 rillig }
823 1.280 rillig
824 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
825 1.254 rillig GNode_VarTarget(GNode *gn) { return GNode_ValueDirect(gn, TARGET); }
826 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
827 1.254 rillig GNode_VarOodate(GNode *gn) { return GNode_ValueDirect(gn, OODATE); }
828 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
829 1.254 rillig GNode_VarAllsrc(GNode *gn) { return GNode_ValueDirect(gn, ALLSRC); }
830 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
831 1.254 rillig GNode_VarImpsrc(GNode *gn) { return GNode_ValueDirect(gn, IMPSRC); }
832 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
833 1.254 rillig GNode_VarPrefix(GNode *gn) { return GNode_ValueDirect(gn, PREFIX); }
834 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
835 1.254 rillig GNode_VarArchive(GNode *gn) { return GNode_ValueDirect(gn, ARCHIVE); }
836 1.274 rillig MAKE_INLINE const char * MAKE_ATTR_USE
837 1.254 rillig GNode_VarMember(GNode *gn) { return GNode_ValueDirect(gn, MEMBER); }
838 1.178 rillig
839 1.274 rillig MAKE_INLINE void * MAKE_ATTR_USE
840 1.264 rillig UNCONST(const void *ptr)
841 1.264 rillig {
842 1.264 rillig void *ret;
843 1.264 rillig memcpy(&ret, &ptr, sizeof(ret));
844 1.264 rillig return ret;
845 1.264 rillig }
846 1.49 sjg
847 1.96 pooka /* At least GNU/Hurd systems lack hardcoded MAXPATHLEN/PATH_MAX */
848 1.96 pooka #include <limits.h>
849 1.96 pooka #ifndef MAXPATHLEN
850 1.96 pooka #define MAXPATHLEN 4096
851 1.96 pooka #endif
852 1.96 pooka #ifndef PATH_MAX
853 1.96 pooka #define PATH_MAX MAXPATHLEN
854 1.96 pooka #endif
855 1.96 pooka
856 1.103 sjg #if defined(SYSV)
857 1.219 rillig #define KILLPG(pid, sig) kill(-(pid), (sig))
858 1.103 sjg #else
859 1.219 rillig #define KILLPG(pid, sig) killpg((pid), (sig))
860 1.103 sjg #endif
861 1.103 sjg
862 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
863 1.195 rillig ch_isalnum(char ch) { return isalnum((unsigned char)ch) != 0; }
864 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
865 1.195 rillig ch_isalpha(char ch) { return isalpha((unsigned char)ch) != 0; }
866 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
867 1.195 rillig ch_isdigit(char ch) { return isdigit((unsigned char)ch) != 0; }
868 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
869 1.195 rillig ch_isspace(char ch) { return isspace((unsigned char)ch) != 0; }
870 1.274 rillig MAKE_INLINE bool MAKE_ATTR_USE
871 1.195 rillig ch_isupper(char ch) { return isupper((unsigned char)ch) != 0; }
872 1.274 rillig MAKE_INLINE char MAKE_ATTR_USE
873 1.195 rillig ch_tolower(char ch) { return (char)tolower((unsigned char)ch); }
874 1.274 rillig MAKE_INLINE char MAKE_ATTR_USE
875 1.195 rillig ch_toupper(char ch) { return (char)toupper((unsigned char)ch); }
876 1.139 rillig
877 1.205 rillig MAKE_INLINE void
878 1.155 rillig cpp_skip_whitespace(const char **pp)
879 1.155 rillig {
880 1.219 rillig while (ch_isspace(**pp))
881 1.219 rillig (*pp)++;
882 1.155 rillig }
883 1.155 rillig
884 1.205 rillig MAKE_INLINE void
885 1.196 rillig cpp_skip_hspace(const char **pp)
886 1.196 rillig {
887 1.219 rillig while (**pp == ' ' || **pp == '\t')
888 1.219 rillig (*pp)++;
889 1.196 rillig }
890 1.196 rillig
891 1.205 rillig MAKE_INLINE void
892 1.155 rillig pp_skip_whitespace(char **pp)
893 1.155 rillig {
894 1.219 rillig while (ch_isspace(**pp))
895 1.219 rillig (*pp)++;
896 1.155 rillig }
897 1.155 rillig
898 1.205 rillig MAKE_INLINE void
899 1.197 rillig pp_skip_hspace(char **pp)
900 1.197 rillig {
901 1.219 rillig while (**pp == ' ' || **pp == '\t')
902 1.219 rillig (*pp)++;
903 1.197 rillig }
904 1.197 rillig
905 1.238 rillig #if defined(lint)
906 1.249 rillig # define MAKE_RCSID(id) extern void do_not_define_rcsid(void)
907 1.238 rillig #elif defined(MAKE_NATIVE)
908 1.249 rillig # include <sys/cdefs.h>
909 1.249 rillig # define MAKE_RCSID(id) __RCSID(id)
910 1.238 rillig #elif defined(MAKE_ALL_IN_ONE) && defined(__COUNTER__)
911 1.249 rillig # define MAKE_RCSID_CONCAT(x, y) CONCAT(x, y)
912 1.249 rillig # define MAKE_RCSID(id) static volatile char \
913 1.238 rillig MAKE_RCSID_CONCAT(rcsid_, __COUNTER__)[] = id
914 1.220 rillig #elif defined(MAKE_ALL_IN_ONE)
915 1.249 rillig # define MAKE_RCSID(id) extern void do_not_define_rcsid(void)
916 1.142 rillig #else
917 1.249 rillig # define MAKE_RCSID(id) static volatile char rcsid[] = id
918 1.142 rillig #endif
919 1.142 rillig
920 1.276 rillig #endif
921