suff.c revision 1.265 1 1.265 rillig /* $NetBSD: suff.c,v 1.265 2020/11/21 18:12:55 rillig Exp $ */
2 1.8 christos
3 1.1 cgd /*
4 1.13 christos * Copyright (c) 1988, 1989, 1990, 1993
5 1.13 christos * The Regents of the University of California. All rights reserved.
6 1.42 agc *
7 1.42 agc * This code is derived from software contributed to Berkeley by
8 1.42 agc * Adam de Boor.
9 1.42 agc *
10 1.42 agc * Redistribution and use in source and binary forms, with or without
11 1.42 agc * modification, are permitted provided that the following conditions
12 1.42 agc * are met:
13 1.42 agc * 1. Redistributions of source code must retain the above copyright
14 1.42 agc * notice, this list of conditions and the following disclaimer.
15 1.42 agc * 2. Redistributions in binary form must reproduce the above copyright
16 1.42 agc * notice, this list of conditions and the following disclaimer in the
17 1.42 agc * documentation and/or other materials provided with the distribution.
18 1.42 agc * 3. Neither the name of the University nor the names of its contributors
19 1.42 agc * may be used to endorse or promote products derived from this software
20 1.42 agc * without specific prior written permission.
21 1.42 agc *
22 1.42 agc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.42 agc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.42 agc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.42 agc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.42 agc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.42 agc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.42 agc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.42 agc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.42 agc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.42 agc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.42 agc * SUCH DAMAGE.
33 1.42 agc */
34 1.42 agc
35 1.42 agc /*
36 1.1 cgd * Copyright (c) 1989 by Berkeley Softworks
37 1.1 cgd * All rights reserved.
38 1.1 cgd *
39 1.1 cgd * This code is derived from software contributed to Berkeley by
40 1.1 cgd * Adam de Boor.
41 1.1 cgd *
42 1.1 cgd * Redistribution and use in source and binary forms, with or without
43 1.1 cgd * modification, are permitted provided that the following conditions
44 1.1 cgd * are met:
45 1.1 cgd * 1. Redistributions of source code must retain the above copyright
46 1.1 cgd * notice, this list of conditions and the following disclaimer.
47 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
48 1.1 cgd * notice, this list of conditions and the following disclaimer in the
49 1.1 cgd * documentation and/or other materials provided with the distribution.
50 1.1 cgd * 3. All advertising materials mentioning features or use of this software
51 1.1 cgd * must display the following acknowledgement:
52 1.1 cgd * This product includes software developed by the University of
53 1.1 cgd * California, Berkeley and its contributors.
54 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
55 1.1 cgd * may be used to endorse or promote products derived from this software
56 1.1 cgd * without specific prior written permission.
57 1.1 cgd *
58 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
59 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
60 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
61 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
62 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
63 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
64 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
65 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
66 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
67 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
68 1.1 cgd * SUCH DAMAGE.
69 1.1 cgd */
70 1.1 cgd
71 1.238 rillig /*
72 1.238 rillig * Maintain suffix lists and find implicit dependents using suffix
73 1.238 rillig * transformation rules such as ".c.o".
74 1.1 cgd *
75 1.1 cgd * Interface:
76 1.238 rillig * Suff_Init Initialize the module.
77 1.1 cgd *
78 1.238 rillig * Suff_End Clean up the module.
79 1.6 jtc *
80 1.238 rillig * Suff_DoPaths Extend the search path of each suffix to include the
81 1.238 rillig * default search path.
82 1.170 rillig *
83 1.170 rillig * Suff_ClearSuffixes
84 1.238 rillig * Clear out all the suffixes and transformations.
85 1.170 rillig *
86 1.170 rillig * Suff_IsTransform
87 1.238 rillig * See if the passed string is a transformation rule.
88 1.170 rillig *
89 1.170 rillig * Suff_AddSuffix Add the passed string as another known suffix.
90 1.170 rillig *
91 1.170 rillig * Suff_GetPath Return the search path for the given suffix.
92 1.170 rillig *
93 1.170 rillig * Suff_AddInclude
94 1.170 rillig * Mark the given suffix as denoting an include file.
95 1.170 rillig *
96 1.170 rillig * Suff_AddLib Mark the given suffix as denoting a library.
97 1.170 rillig *
98 1.170 rillig * Suff_AddTransform
99 1.238 rillig * Add another transformation to the suffix graph.
100 1.170 rillig *
101 1.170 rillig * Suff_SetNull Define the suffix to consider the suffix of
102 1.170 rillig * any file that doesn't have a known one.
103 1.170 rillig *
104 1.170 rillig * Suff_FindDeps Find implicit sources for and the location of
105 1.170 rillig * a target based on its suffix. Returns the
106 1.170 rillig * bottom-most node added to the graph or NULL
107 1.170 rillig * if the target had no implicit sources.
108 1.1 cgd *
109 1.170 rillig * Suff_FindPath Return the appropriate path to search in order to
110 1.170 rillig * find the node.
111 1.1 cgd */
112 1.1 cgd
113 1.176 rillig #include "make.h"
114 1.176 rillig #include "dir.h"
115 1.1 cgd
116 1.155 rillig /* "@(#)suff.c 8.4 (Berkeley) 3/21/94" */
117 1.265 rillig MAKE_RCSID("$NetBSD: suff.c,v 1.265 2020/11/21 18:12:55 rillig Exp $");
118 1.155 rillig
119 1.171 rillig #define SUFF_DEBUG0(text) DEBUG0(SUFF, text)
120 1.171 rillig #define SUFF_DEBUG1(fmt, arg1) DEBUG1(SUFF, fmt, arg1)
121 1.171 rillig #define SUFF_DEBUG2(fmt, arg1, arg2) DEBUG2(SUFF, fmt, arg1, arg2)
122 1.140 rillig
123 1.157 rillig typedef List SuffList;
124 1.157 rillig typedef ListNode SuffListNode;
125 1.157 rillig
126 1.157 rillig typedef List SrcList;
127 1.157 rillig typedef ListNode SrcListNode;
128 1.157 rillig
129 1.157 rillig static SuffList *sufflist; /* List of suffixes */
130 1.73 joerg #ifdef CLEANUP
131 1.157 rillig static SuffList *suffClean; /* List of suffixes to be cleaned */
132 1.73 joerg #endif
133 1.250 rillig
134 1.250 rillig /* XXX: What exactly is this variable used for? */
135 1.250 rillig /* XXX: Does it really have to be a global variable? */
136 1.250 rillig static SrcList *srclist;
137 1.1 cgd
138 1.238 rillig /* List of transformation rules, such as ".c.o" */
139 1.238 rillig static GNodeList *transforms;
140 1.238 rillig
141 1.238 rillig static int sNum = 0; /* Counter for assigning suffix numbers */
142 1.1 cgd
143 1.189 rillig typedef enum SuffFlags {
144 1.96 rillig SUFF_INCLUDE = 0x01, /* One which is #include'd */
145 1.96 rillig SUFF_LIBRARY = 0x02, /* One which contains a library */
146 1.96 rillig SUFF_NULL = 0x04 /* The empty suffix */
147 1.122 rillig /* XXX: Why is SUFF_NULL needed? Wouldn't nameLen == 0 mean the same? */
148 1.96 rillig } SuffFlags;
149 1.96 rillig
150 1.122 rillig ENUM_FLAGS_RTTI_3(SuffFlags,
151 1.122 rillig SUFF_INCLUDE, SUFF_LIBRARY, SUFF_NULL);
152 1.122 rillig
153 1.157 rillig typedef List SuffListList;
154 1.157 rillig
155 1.96 rillig typedef struct Suff {
156 1.238 rillig /* The suffix itself, such as ".c" */
157 1.238 rillig char *name;
158 1.238 rillig /* Length of the name, to avoid strlen calls */
159 1.238 rillig size_t nameLen;
160 1.238 rillig /* Type of suffix */
161 1.238 rillig SuffFlags flags;
162 1.238 rillig /* The path along which files of this suffix may be found */
163 1.238 rillig SearchPath *searchPath;
164 1.238 rillig /* The suffix number; TODO: document the purpose of this number */
165 1.238 rillig int sNum;
166 1.238 rillig /* Reference count of list membership and several other places */
167 1.238 rillig int refCount;
168 1.238 rillig /* Suffixes we have a transformation to */
169 1.238 rillig SuffList *parents;
170 1.238 rillig /* Suffixes we have a transformation from */
171 1.238 rillig SuffList *children;
172 1.237 rillig
173 1.237 rillig /* Lists in which this suffix is referenced.
174 1.237 rillig * XXX: These lists are used nowhere, they are just appended to, for no
175 1.237 rillig * apparent reason. They do have the side effect of increasing refCount
176 1.237 rillig * though. */
177 1.237 rillig SuffListList *ref;
178 1.1 cgd } Suff;
179 1.1 cgd
180 1.1 cgd /*
181 1.1 cgd * Structure used in the search for implied sources.
182 1.1 cgd */
183 1.163 rillig typedef struct Src {
184 1.170 rillig char *file; /* The file to look for */
185 1.170 rillig char *pref; /* Prefix from which file was formed */
186 1.170 rillig Suff *suff; /* The suffix on the file */
187 1.170 rillig struct Src *parent; /* The Src for which this is a source */
188 1.170 rillig GNode *node; /* The node describing the file */
189 1.234 rillig int numChildren; /* Count of existing children (so we don't free
190 1.73 joerg * this thing too early or never nuke it) */
191 1.73 joerg #ifdef DEBUG_SRC
192 1.211 rillig SrcList *childrenList;
193 1.73 joerg #endif
194 1.1 cgd } Src;
195 1.1 cgd
196 1.238 rillig /* TODO: Document the difference between suffNull and emptySuff. */
197 1.238 rillig /* The NULL suffix for this run */
198 1.238 rillig static Suff *suffNull;
199 1.238 rillig /* The empty suffix required for POSIX single-suffix transformation rules */
200 1.238 rillig static Suff *emptySuff;
201 1.1 cgd
202 1.4 cgd
203 1.160 rillig static void SuffFindDeps(GNode *, SrcList *);
204 1.157 rillig static void SuffExpandWildcards(GNodeListNode *, GNode *);
205 1.4 cgd
206 1.260 rillig static Suff *
207 1.260 rillig SuffRef(Suff *suff)
208 1.260 rillig {
209 1.260 rillig suff->refCount++;
210 1.260 rillig return suff;
211 1.260 rillig }
212 1.260 rillig
213 1.259 rillig /* Change the value of a Suff variable, adjusting the reference counts. */
214 1.259 rillig static void
215 1.259 rillig SuffReassign(Suff **var, Suff *suff)
216 1.259 rillig {
217 1.259 rillig if (*var != NULL)
218 1.259 rillig (*var)->refCount--;
219 1.259 rillig *var = suff;
220 1.259 rillig suff->refCount++;
221 1.259 rillig }
222 1.259 rillig
223 1.259 rillig /* Set a Suff variable to NULL, adjusting the reference count. */
224 1.259 rillig static void
225 1.259 rillig SuffUnassign(Suff **var)
226 1.259 rillig {
227 1.259 rillig if (*var != NULL)
228 1.259 rillig (*var)->refCount--;
229 1.259 rillig *var = NULL;
230 1.259 rillig }
231 1.259 rillig
232 1.238 rillig /*
233 1.238 rillig * See if pref is a prefix of str.
234 1.238 rillig * Return NULL if it ain't, pointer to character in str after prefix if so.
235 1.1 cgd */
236 1.67 dsl static const char *
237 1.67 dsl SuffStrIsPrefix(const char *pref, const char *str)
238 1.1 cgd {
239 1.1 cgd while (*str && *pref == *str) {
240 1.1 cgd pref++;
241 1.1 cgd str++;
242 1.1 cgd }
243 1.1 cgd
244 1.239 rillig return *pref != '\0' ? NULL : str;
245 1.1 cgd }
246 1.1 cgd
247 1.238 rillig /*
248 1.238 rillig * See if suff is a suffix of name.
249 1.238 rillig * Return NULL if it ain't, pointer to the start of suffix in name if it is.
250 1.1 cgd */
251 1.221 rillig static const char *
252 1.255 rillig SuffSuffGetSuffix(const Suff *suff, size_t nameLen, const char *nameEnd)
253 1.1 cgd {
254 1.221 rillig const char *p1; /* Pointer into suffix name */
255 1.221 rillig const char *p2; /* Pointer into string being examined */
256 1.1 cgd
257 1.255 rillig if (nameLen < suff->nameLen)
258 1.22 itohy return NULL; /* this string is shorter than the suffix */
259 1.22 itohy
260 1.255 rillig p1 = suff->name + suff->nameLen;
261 1.207 rillig p2 = nameEnd;
262 1.1 cgd
263 1.255 rillig while (p1 >= suff->name && *p1 == *p2) {
264 1.1 cgd p1--;
265 1.1 cgd p2--;
266 1.1 cgd }
267 1.1 cgd
268 1.207 rillig /* XXX: s->name - 1 invokes undefined behavior */
269 1.255 rillig return p1 == suff->name - 1 ? p2 + 1 : NULL;
270 1.1 cgd }
271 1.1 cgd
272 1.129 rillig static Boolean
273 1.227 rillig SuffSuffIsSuffix(const Suff *suff, size_t nameLen, const char *nameEnd)
274 1.1 cgd {
275 1.207 rillig return SuffSuffGetSuffix(suff, nameLen, nameEnd) != NULL;
276 1.1 cgd }
277 1.1 cgd
278 1.166 rillig static Suff *
279 1.221 rillig FindSuffByNameLen(const char *name, size_t nameLen)
280 1.1 cgd {
281 1.162 rillig SuffListNode *ln;
282 1.162 rillig
283 1.162 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next) {
284 1.178 rillig Suff *suff = ln->datum;
285 1.221 rillig if (suff->nameLen == nameLen && memcmp(suff->name, name, nameLen) == 0)
286 1.178 rillig return suff;
287 1.162 rillig }
288 1.162 rillig return NULL;
289 1.1 cgd }
290 1.1 cgd
291 1.221 rillig static Suff *
292 1.221 rillig FindSuffByName(const char *name)
293 1.221 rillig {
294 1.221 rillig return FindSuffByNameLen(name, strlen(name));
295 1.221 rillig }
296 1.221 rillig
297 1.210 rillig static GNode *
298 1.210 rillig FindTransformByName(const char *name)
299 1.1 cgd {
300 1.210 rillig GNodeListNode *ln;
301 1.210 rillig for (ln = transforms->first; ln != NULL; ln = ln->next) {
302 1.228 rillig GNode *gn = ln->datum;
303 1.228 rillig if (strcmp(gn->name, name) == 0)
304 1.228 rillig return gn;
305 1.210 rillig }
306 1.210 rillig return NULL;
307 1.1 cgd }
308 1.1 cgd
309 1.73 joerg static void
310 1.247 rillig SuffList_Unref(SuffList *list, Suff *suff)
311 1.73 joerg {
312 1.198 rillig SuffListNode *ln = Lst_FindDatum(list, suff);
313 1.73 joerg if (ln != NULL) {
314 1.198 rillig Lst_Remove(list, ln);
315 1.198 rillig suff->refCount--;
316 1.73 joerg }
317 1.73 joerg }
318 1.73 joerg
319 1.134 rillig /* Free up all memory associated with the given suffix structure. */
320 1.73 joerg static void
321 1.73 joerg SuffFree(void *sp)
322 1.71 christos {
323 1.233 rillig Suff *suff = sp;
324 1.6 jtc
325 1.233 rillig if (suff == suffNull)
326 1.73 joerg suffNull = NULL;
327 1.6 jtc
328 1.233 rillig if (suff == emptySuff)
329 1.73 joerg emptySuff = NULL;
330 1.6 jtc
331 1.198 rillig #if 0
332 1.73 joerg /* We don't delete suffixes in order, so we cannot use this */
333 1.239 rillig if (suff->refCount != 0)
334 1.233 rillig Punt("Internal error deleting suffix `%s' with refcount = %d",
335 1.233 rillig suff->name, suff->refCount);
336 1.73 joerg #endif
337 1.6 jtc
338 1.233 rillig Lst_Free(suff->ref);
339 1.233 rillig Lst_Free(suff->children);
340 1.233 rillig Lst_Free(suff->parents);
341 1.233 rillig Lst_Destroy(suff->searchPath, Dir_Destroy);
342 1.19 christos
343 1.233 rillig free(suff->name);
344 1.233 rillig free(suff);
345 1.1 cgd }
346 1.1 cgd
347 1.134 rillig /* Remove the suffix from the list, and free if it is otherwise unused. */
348 1.6 jtc static void
349 1.247 rillig SuffList_Remove(SuffList *list, Suff *suff)
350 1.6 jtc {
351 1.247 rillig SuffList_Unref(list, suff);
352 1.198 rillig if (suff->refCount == 0) {
353 1.238 rillig /* XXX: can lead to suff->refCount == -1 */
354 1.247 rillig SuffList_Unref(sufflist, suff);
355 1.257 rillig DEBUG1(SUFF, "Removing suffix \"%s\"\n", suff->name);
356 1.198 rillig SuffFree(suff);
357 1.73 joerg }
358 1.6 jtc }
359 1.101 rillig
360 1.198 rillig /* Insert the suffix into the list, keeping the list ordered by suffix
361 1.238 rillig * number. */
362 1.73 joerg static void
363 1.246 rillig SuffList_Insert(SuffList *list, Suff *suff)
364 1.1 cgd {
365 1.198 rillig SuffListNode *ln;
366 1.198 rillig Suff *listSuff = NULL;
367 1.71 christos
368 1.198 rillig for (ln = list->first; ln != NULL; ln = ln->next) {
369 1.198 rillig listSuff = ln->datum;
370 1.198 rillig if (listSuff->sNum >= suff->sNum)
371 1.73 joerg break;
372 1.73 joerg }
373 1.71 christos
374 1.73 joerg if (ln == NULL) {
375 1.198 rillig SUFF_DEBUG2("inserting \"%s\" (%d) at end of list\n",
376 1.198 rillig suff->name, suff->sNum);
377 1.261 rillig Lst_Append(list, SuffRef(suff));
378 1.198 rillig Lst_Append(suff->ref, list);
379 1.198 rillig } else if (listSuff->sNum != suff->sNum) {
380 1.243 rillig DEBUG4(SUFF, "inserting \"%s\" (%d) before \"%s\" (%d)\n",
381 1.243 rillig suff->name, suff->sNum, listSuff->name, listSuff->sNum);
382 1.261 rillig Lst_InsertBefore(list, ln, SuffRef(suff));
383 1.198 rillig Lst_Append(suff->ref, list);
384 1.140 rillig } else {
385 1.198 rillig SUFF_DEBUG2("\"%s\" (%d) is already there\n", suff->name, suff->sNum);
386 1.73 joerg }
387 1.71 christos }
388 1.1 cgd
389 1.246 rillig static void
390 1.246 rillig SuffRelate(Suff *srcSuff, Suff *targSuff)
391 1.246 rillig {
392 1.246 rillig SuffList_Insert(targSuff->children, srcSuff);
393 1.246 rillig SuffList_Insert(srcSuff->parents, targSuff);
394 1.246 rillig }
395 1.246 rillig
396 1.117 rillig static Suff *
397 1.117 rillig SuffNew(const char *name)
398 1.117 rillig {
399 1.233 rillig Suff *suff = bmake_malloc(sizeof *suff);
400 1.117 rillig
401 1.233 rillig suff->name = bmake_strdup(name);
402 1.233 rillig suff->nameLen = strlen(suff->name);
403 1.233 rillig suff->searchPath = Lst_New();
404 1.233 rillig suff->children = Lst_New();
405 1.233 rillig suff->parents = Lst_New();
406 1.233 rillig suff->ref = Lst_New();
407 1.233 rillig suff->sNum = sNum++;
408 1.233 rillig suff->flags = 0;
409 1.238 rillig suff->refCount = 1; /* XXX: why 1? It's not assigned anywhere yet. */
410 1.117 rillig
411 1.233 rillig return suff;
412 1.117 rillig }
413 1.117 rillig
414 1.238 rillig /*
415 1.238 rillig * Nuke the list of suffixes but keep all transformation rules around. The
416 1.238 rillig * transformation graph is destroyed in this process, but we leave the list
417 1.238 rillig * of rules so when a new graph is formed, the rules will remain. This
418 1.238 rillig * function is called when a line '.SUFFIXES:' with an empty suffixes list is
419 1.238 rillig * encountered in a makefile.
420 1.238 rillig */
421 1.73 joerg void
422 1.73 joerg Suff_ClearSuffixes(void)
423 1.71 christos {
424 1.73 joerg #ifdef CLEANUP
425 1.125 rillig Lst_MoveAll(suffClean, sufflist);
426 1.73 joerg #endif
427 1.257 rillig DEBUG0(SUFF, "Clearing all suffixes\n");
428 1.180 rillig sufflist = Lst_New();
429 1.73 joerg sNum = 0;
430 1.249 rillig if (suffNull != NULL)
431 1.75 sjg SuffFree(suffNull);
432 1.117 rillig emptySuff = suffNull = SuffNew("");
433 1.75 sjg
434 1.75 sjg Dir_Concat(suffNull->searchPath, dirSearchPath);
435 1.170 rillig suffNull->flags = SUFF_NULL;
436 1.1 cgd }
437 1.1 cgd
438 1.196 rillig /* Parse a transformation string such as ".c.o" to find its two component
439 1.196 rillig * suffixes (the source ".c" and the target ".o"). If there are no such
440 1.196 rillig * suffixes, try a single-suffix transformation as well.
441 1.1 cgd *
442 1.196 rillig * Return TRUE if the string is a valid transformation.
443 1.1 cgd */
444 1.73 joerg static Boolean
445 1.167 rillig SuffParseTransform(const char *str, Suff **out_src, Suff **out_targ)
446 1.39 wiz {
447 1.196 rillig SuffListNode *ln;
448 1.196 rillig Suff *singleSrc = NULL;
449 1.73 joerg
450 1.73 joerg /*
451 1.73 joerg * Loop looking first for a suffix that matches the start of the
452 1.73 joerg * string and then for one that exactly matches the rest of it. If
453 1.73 joerg * we can find two that meet these criteria, we've successfully
454 1.73 joerg * parsed the string.
455 1.73 joerg */
456 1.196 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next) {
457 1.196 rillig Suff *src = ln->datum;
458 1.197 rillig
459 1.197 rillig if (SuffStrIsPrefix(src->name, str) == NULL)
460 1.196 rillig continue;
461 1.196 rillig
462 1.196 rillig if (str[src->nameLen] == '\0') {
463 1.196 rillig singleSrc = src;
464 1.73 joerg } else {
465 1.196 rillig Suff *targ = FindSuffByName(str + src->nameLen);
466 1.166 rillig if (targ != NULL) {
467 1.134 rillig *out_src = src;
468 1.166 rillig *out_targ = targ;
469 1.88 rillig return TRUE;
470 1.73 joerg }
471 1.73 joerg }
472 1.73 joerg }
473 1.196 rillig
474 1.196 rillig if (singleSrc != NULL) {
475 1.196 rillig /*
476 1.196 rillig * Not so fast Mr. Smith! There was a suffix that encompassed
477 1.196 rillig * the entire string, so we assume it was a transformation
478 1.196 rillig * to the null suffix (thank you POSIX). We still prefer to
479 1.196 rillig * find a double rule over a singleton, hence we leave this
480 1.196 rillig * check until the end.
481 1.196 rillig *
482 1.196 rillig * XXX: Use emptySuff over suffNull?
483 1.196 rillig */
484 1.196 rillig *out_src = singleSrc;
485 1.196 rillig *out_targ = suffNull;
486 1.196 rillig return TRUE;
487 1.196 rillig }
488 1.196 rillig return FALSE;
489 1.1 cgd }
490 1.1 cgd
491 1.134 rillig /* Return TRUE if the given string is a transformation rule, that is, a
492 1.238 rillig * concatenation of two known suffixes such as ".c.o" or a single suffix
493 1.238 rillig * such as ".o". */
494 1.73 joerg Boolean
495 1.167 rillig Suff_IsTransform(const char *str)
496 1.1 cgd {
497 1.170 rillig Suff *src, *targ;
498 1.1 cgd
499 1.88 rillig return SuffParseTransform(str, &src, &targ);
500 1.1 cgd }
501 1.1 cgd
502 1.210 rillig /* Add the transformation rule to the list of rules and place the
503 1.210 rillig * transformation itself in the graph.
504 1.210 rillig *
505 1.210 rillig * The transformation is linked to the two suffixes mentioned in the name.
506 1.1 cgd *
507 1.73 joerg * Input:
508 1.210 rillig * name must have the form ".from.to" or just ".from"
509 1.39 wiz *
510 1.73 joerg * Results:
511 1.210 rillig * The created or existing transformation node in the transforms list
512 1.1 cgd */
513 1.73 joerg GNode *
514 1.210 rillig Suff_AddTransform(const char *name)
515 1.1 cgd {
516 1.233 rillig Suff *srcSuff;
517 1.233 rillig Suff *targSuff;
518 1.1 cgd
519 1.233 rillig GNode *gn = FindTransformByName(name);
520 1.210 rillig if (gn == NULL) {
521 1.73 joerg /*
522 1.73 joerg * Make a new graph node for the transformation. It will be filled in
523 1.73 joerg * by the Parse module.
524 1.73 joerg */
525 1.244 rillig gn = GNode_New(name);
526 1.125 rillig Lst_Append(transforms, gn);
527 1.73 joerg } else {
528 1.73 joerg /*
529 1.73 joerg * New specification for transformation rule. Just nuke the old list
530 1.73 joerg * of commands so they can be filled in again... We don't actually
531 1.73 joerg * free the commands themselves, because a given command can be
532 1.73 joerg * attached to several different transformations.
533 1.73 joerg */
534 1.125 rillig Lst_Free(gn->commands);
535 1.125 rillig Lst_Free(gn->children);
536 1.180 rillig gn->commands = Lst_New();
537 1.180 rillig gn->children = Lst_New();
538 1.73 joerg }
539 1.1 cgd
540 1.73 joerg gn->type = OP_TRANSFORM;
541 1.1 cgd
542 1.233 rillig {
543 1.233 rillig Boolean ok = SuffParseTransform(name, &srcSuff, &targSuff);
544 1.233 rillig assert(ok);
545 1.233 rillig (void)ok;
546 1.233 rillig }
547 1.1 cgd
548 1.73 joerg /*
549 1.73 joerg * link the two together in the proper relationship and order
550 1.73 joerg */
551 1.140 rillig SUFF_DEBUG2("defining transformation from `%s' to `%s'\n",
552 1.233 rillig srcSuff->name, targSuff->name);
553 1.246 rillig SuffRelate(srcSuff, targSuff);
554 1.1 cgd
555 1.88 rillig return gn;
556 1.1 cgd }
557 1.1 cgd
558 1.134 rillig /* Handle the finish of a transformation definition, removing the
559 1.134 rillig * transformation from the graph if it has neither commands nor sources.
560 1.134 rillig *
561 1.134 rillig * If the node has no commands or children, the children and parents lists
562 1.134 rillig * of the affected suffixes are altered.
563 1.71 christos *
564 1.73 joerg * Input:
565 1.150 rillig * gn Node for transformation
566 1.1 cgd */
567 1.150 rillig void
568 1.150 rillig Suff_EndTransform(GNode *gn)
569 1.1 cgd {
570 1.253 rillig Suff *srcSuff, *targSuff;
571 1.253 rillig SuffList *srcSuffParents;
572 1.253 rillig
573 1.125 rillig if ((gn->type & OP_DOUBLEDEP) && !Lst_IsEmpty(gn->cohorts))
574 1.195 rillig gn = gn->cohorts->last->datum;
575 1.238 rillig
576 1.253 rillig if (!(gn->type & OP_TRANSFORM))
577 1.253 rillig return;
578 1.253 rillig
579 1.253 rillig if (!Lst_IsEmpty(gn->commands) || !Lst_IsEmpty(gn->children)) {
580 1.253 rillig SUFF_DEBUG1("transformation %s complete\n", gn->name);
581 1.253 rillig return;
582 1.253 rillig }
583 1.73 joerg
584 1.253 rillig /*
585 1.253 rillig * SuffParseTransform() may fail for special rules which are not
586 1.253 rillig * actual transformation rules. (e.g. .DEFAULT)
587 1.253 rillig */
588 1.253 rillig if (!SuffParseTransform(gn->name, &srcSuff, &targSuff))
589 1.253 rillig return;
590 1.233 rillig
591 1.254 rillig SUFF_DEBUG2("deleting incomplete transformation from `%s' to `%s'\n",
592 1.254 rillig srcSuff->name, targSuff->name);
593 1.254 rillig
594 1.253 rillig /* Remember parents since srcSuff could be deleted in SuffList_Remove. */
595 1.253 rillig srcSuffParents = srcSuff->parents;
596 1.253 rillig SuffList_Remove(targSuff->children, srcSuff);
597 1.253 rillig SuffList_Remove(srcSuffParents, targSuff);
598 1.1 cgd }
599 1.1 cgd
600 1.217 rillig /* Called from Suff_AddSuffix to search through the list of
601 1.134 rillig * existing transformation rules and rebuild the transformation graph when
602 1.134 rillig * it has been destroyed by Suff_ClearSuffixes. If the given rule is a
603 1.134 rillig * transformation involving this suffix and another, existing suffix, the
604 1.134 rillig * proper relationship is established between the two.
605 1.134 rillig *
606 1.134 rillig * The appropriate links will be made between this suffix and others if
607 1.134 rillig * transformation rules exist for it.
608 1.1 cgd *
609 1.39 wiz * Input:
610 1.192 rillig * transform Transformation to test
611 1.219 rillig * suff Suffix to rebuild
612 1.1 cgd */
613 1.165 rillig static void
614 1.219 rillig SuffRebuildGraph(GNode *transform, Suff *suff)
615 1.6 jtc {
616 1.221 rillig const char *name = transform->name;
617 1.207 rillig size_t nameLen = strlen(name);
618 1.221 rillig const char *toName;
619 1.73 joerg
620 1.73 joerg /*
621 1.73 joerg * First see if it is a transformation from this suffix.
622 1.73 joerg */
623 1.221 rillig toName = SuffStrIsPrefix(suff->name, name);
624 1.221 rillig if (toName != NULL) {
625 1.221 rillig Suff *to = FindSuffByName(toName);
626 1.219 rillig if (to != NULL) {
627 1.166 rillig /* Link in and return, since it can't be anything else. */
628 1.246 rillig SuffRelate(suff, to);
629 1.165 rillig return;
630 1.73 joerg }
631 1.73 joerg }
632 1.1 cgd
633 1.73 joerg /*
634 1.73 joerg * Not from, maybe to?
635 1.73 joerg */
636 1.221 rillig toName = SuffSuffGetSuffix(suff, nameLen, name + nameLen);
637 1.221 rillig if (toName != NULL) {
638 1.221 rillig Suff *from = FindSuffByNameLen(name, (size_t)(toName - name));
639 1.246 rillig if (from != NULL)
640 1.246 rillig SuffRelate(from, suff);
641 1.1 cgd }
642 1.71 christos }
643 1.71 christos
644 1.186 rillig /* During Suff_AddSuffix, search through the list of existing targets and find
645 1.186 rillig * if any of the existing targets can be turned into a transformation rule.
646 1.134 rillig *
647 1.134 rillig * If such a target is found and the target is the current main target, the
648 1.134 rillig * main target is set to NULL and the next target examined (if that exists)
649 1.134 rillig * becomes the main target.
650 1.71 christos *
651 1.73 joerg * Results:
652 1.186 rillig * TRUE iff a new main target has been selected.
653 1.71 christos */
654 1.186 rillig static Boolean
655 1.264 rillig SuffUpdateTarget(GNode *target, GNode **inout_main, Suff *suff,
656 1.264 rillig Boolean *inout_removedMain)
657 1.71 christos {
658 1.233 rillig Suff *srcSuff, *targSuff;
659 1.170 rillig char *ptr;
660 1.73 joerg
661 1.264 rillig if (*inout_main == NULL && *inout_removedMain &&
662 1.264 rillig !(target->type & OP_NOTARGET)) {
663 1.188 rillig *inout_main = target;
664 1.73 joerg Targ_SetMain(target);
665 1.186 rillig return TRUE;
666 1.73 joerg }
667 1.73 joerg
668 1.108 rillig if (target->type == OP_TRANSFORM)
669 1.186 rillig return FALSE;
670 1.73 joerg
671 1.258 rillig /*
672 1.258 rillig * XXX: What about a transformation ".cpp.c"? If ".c" is added as a new
673 1.258 rillig * suffix, it seems wrong that this transformation would be skipped just
674 1.258 rillig * because ".c" happens to be a prefix of ".cpp".
675 1.258 rillig */
676 1.263 rillig ptr = strstr(target->name, suff->name);
677 1.263 rillig if (ptr == NULL)
678 1.263 rillig return FALSE;
679 1.263 rillig
680 1.263 rillig /*
681 1.263 rillig * XXX: In suff-rebuild.mk, in the line '.SUFFIXES: .c .b .a', this
682 1.263 rillig * condition prevents the rule '.b.c' from being added again during
683 1.263 rillig * Suff_AddSuffix(".b").
684 1.263 rillig *
685 1.263 rillig * XXX: Removing this paragraph makes suff-add-later.mk use massive
686 1.263 rillig * amounts of memory.
687 1.263 rillig */
688 1.263 rillig if (ptr == target->name)
689 1.186 rillig return FALSE;
690 1.73 joerg
691 1.233 rillig if (SuffParseTransform(target->name, &srcSuff, &targSuff)) {
692 1.188 rillig if (*inout_main == target) {
693 1.264 rillig *inout_removedMain = TRUE;
694 1.188 rillig *inout_main = NULL;
695 1.73 joerg Targ_SetMain(NULL);
696 1.71 christos }
697 1.125 rillig Lst_Free(target->children);
698 1.180 rillig target->children = Lst_New();
699 1.73 joerg target->type = OP_TRANSFORM;
700 1.73 joerg /*
701 1.73 joerg * link the two together in the proper relationship and order
702 1.73 joerg */
703 1.140 rillig SUFF_DEBUG2("defining transformation from `%s' to `%s'\n",
704 1.233 rillig srcSuff->name, targSuff->name);
705 1.246 rillig SuffRelate(srcSuff, targSuff);
706 1.71 christos }
707 1.186 rillig return FALSE;
708 1.14 christos }
709 1.14 christos
710 1.187 rillig /* Look at all existing targets to see if adding this suffix will make one
711 1.187 rillig * of the current targets mutate into a suffix rule.
712 1.187 rillig *
713 1.187 rillig * This is ugly, but other makes treat all targets that start with a '.' as
714 1.187 rillig * suffix rules. */
715 1.187 rillig static void
716 1.255 rillig UpdateTargets(GNode **inout_main, Suff *suff)
717 1.187 rillig {
718 1.187 rillig Boolean r = FALSE;
719 1.187 rillig GNodeListNode *ln;
720 1.187 rillig for (ln = Targ_List()->first; ln != NULL; ln = ln->next) {
721 1.187 rillig GNode *gn = ln->datum;
722 1.255 rillig if (SuffUpdateTarget(gn, inout_main, suff, &r))
723 1.187 rillig break;
724 1.187 rillig }
725 1.187 rillig }
726 1.187 rillig
727 1.134 rillig /* Add the suffix to the end of the list of known suffixes.
728 1.134 rillig * Should we restructure the suffix graph? Make doesn't...
729 1.134 rillig *
730 1.134 rillig * A GNode is created for the suffix and a Suff structure is created and
731 1.134 rillig * added to the suffixes list unless the suffix was already known.
732 1.134 rillig * The mainNode passed can be modified if a target mutated into a
733 1.134 rillig * transform and that target happened to be the main target.
734 1.1 cgd *
735 1.39 wiz * Input:
736 1.134 rillig * name the name of the suffix to add
737 1.1 cgd */
738 1.1 cgd void
739 1.188 rillig Suff_AddSuffix(const char *name, GNode **inout_main)
740 1.1 cgd {
741 1.192 rillig GNodeListNode *ln;
742 1.192 rillig
743 1.255 rillig Suff *suff = FindSuffByName(name);
744 1.255 rillig if (suff != NULL)
745 1.166 rillig return;
746 1.166 rillig
747 1.255 rillig suff = SuffNew(name);
748 1.255 rillig Lst_Append(sufflist, suff);
749 1.256 rillig DEBUG1(SUFF, "Adding suffix \"%s\"\n", suff->name);
750 1.73 joerg
751 1.255 rillig UpdateTargets(inout_main, suff);
752 1.71 christos
753 1.166 rillig /*
754 1.166 rillig * Look for any existing transformations from or to this suffix.
755 1.166 rillig * XXX: Only do this after a Suff_ClearSuffixes?
756 1.166 rillig */
757 1.192 rillig for (ln = transforms->first; ln != NULL; ln = ln->next)
758 1.255 rillig SuffRebuildGraph(ln->datum, suff);
759 1.1 cgd }
760 1.1 cgd
761 1.134 rillig /* Return the search path for the given suffix, or NULL. */
762 1.157 rillig SearchPath *
763 1.167 rillig Suff_GetPath(const char *sname)
764 1.1 cgd {
765 1.255 rillig Suff *suff = FindSuffByName(sname);
766 1.255 rillig return suff != NULL ? suff->searchPath : NULL;
767 1.1 cgd }
768 1.1 cgd
769 1.238 rillig /*
770 1.238 rillig * Extend the search paths for all suffixes to include the default search
771 1.238 rillig * path (dirSearchPath).
772 1.1 cgd *
773 1.238 rillig * The default search path can be defined using the special target '.PATH'.
774 1.238 rillig * The search path of each suffix can be defined using the special target
775 1.238 rillig * '.PATH<suffix>'.
776 1.238 rillig *
777 1.238 rillig * If paths were specified for the ".h" suffix, the directories are stuffed
778 1.238 rillig * into a global variable called ".INCLUDES" with each directory preceded by
779 1.238 rillig * '-I'. The same is done for the ".a" suffix, except the variable is called
780 1.238 rillig * ".LIBS" and the flag is '-L'.
781 1.1 cgd */
782 1.1 cgd void
783 1.39 wiz Suff_DoPaths(void)
784 1.1 cgd {
785 1.157 rillig SuffListNode *ln;
786 1.157 rillig char *ptr;
787 1.157 rillig SearchPath *inIncludes; /* Cumulative .INCLUDES path */
788 1.157 rillig SearchPath *inLibs; /* Cumulative .LIBS path */
789 1.1 cgd
790 1.180 rillig inIncludes = Lst_New();
791 1.180 rillig inLibs = Lst_New();
792 1.1 cgd
793 1.181 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next) {
794 1.255 rillig Suff *suff = ln->datum;
795 1.255 rillig if (!Lst_IsEmpty(suff->searchPath)) {
796 1.1 cgd #ifdef INCLUDES
797 1.255 rillig if (suff->flags & SUFF_INCLUDE)
798 1.255 rillig Dir_Concat(inIncludes, suff->searchPath);
799 1.154 rillig #endif
800 1.1 cgd #ifdef LIBRARIES
801 1.255 rillig if (suff->flags & SUFF_LIBRARY)
802 1.255 rillig Dir_Concat(inLibs, suff->searchPath);
803 1.154 rillig #endif
804 1.255 rillig Dir_Concat(suff->searchPath, dirSearchPath);
805 1.1 cgd } else {
806 1.255 rillig Lst_Destroy(suff->searchPath, Dir_Destroy);
807 1.255 rillig suff->searchPath = Dir_CopyDirSearchPath();
808 1.1 cgd }
809 1.1 cgd }
810 1.1 cgd
811 1.87 rillig Var_Set(".INCLUDES", ptr = Dir_MakeFlags("-I", inIncludes), VAR_GLOBAL);
812 1.6 jtc free(ptr);
813 1.87 rillig Var_Set(".LIBS", ptr = Dir_MakeFlags("-L", inLibs), VAR_GLOBAL);
814 1.6 jtc free(ptr);
815 1.1 cgd
816 1.125 rillig Lst_Destroy(inIncludes, Dir_Destroy);
817 1.125 rillig Lst_Destroy(inLibs, Dir_Destroy);
818 1.1 cgd }
819 1.1 cgd
820 1.134 rillig /* Add the given suffix as a type of file which gets included.
821 1.134 rillig * Called from the parse module when a .INCLUDES line is parsed.
822 1.134 rillig * The suffix must have already been defined.
823 1.134 rillig * The SUFF_INCLUDE bit is set in the suffix's flags field.
824 1.1 cgd *
825 1.39 wiz * Input:
826 1.39 wiz * sname Name of the suffix to mark
827 1.1 cgd */
828 1.1 cgd void
829 1.167 rillig Suff_AddInclude(const char *sname)
830 1.1 cgd {
831 1.166 rillig Suff *suff = FindSuffByName(sname);
832 1.166 rillig if (suff != NULL)
833 1.166 rillig suff->flags |= SUFF_INCLUDE;
834 1.1 cgd }
835 1.1 cgd
836 1.134 rillig /* Add the given suffix as a type of file which is a library.
837 1.134 rillig * Called from the parse module when parsing a .LIBS line.
838 1.134 rillig * The suffix must have been defined via .SUFFIXES before this is called.
839 1.134 rillig * The SUFF_LIBRARY bit is set in the suffix's flags field.
840 1.1 cgd *
841 1.39 wiz * Input:
842 1.39 wiz * sname Name of the suffix to mark
843 1.1 cgd */
844 1.1 cgd void
845 1.134 rillig Suff_AddLib(const char *sname)
846 1.1 cgd {
847 1.166 rillig Suff *suff = FindSuffByName(sname);
848 1.166 rillig if (suff != NULL)
849 1.166 rillig suff->flags |= SUFF_LIBRARY;
850 1.1 cgd }
851 1.1 cgd
852 1.93 rillig /********** Implicit Source Search Functions *********/
853 1.1 cgd
854 1.149 rillig #ifdef DEBUG_SRC
855 1.165 rillig static void
856 1.193 rillig SrcList_PrintAddrs(SrcList *srcList)
857 1.149 rillig {
858 1.193 rillig SrcListNode *ln;
859 1.194 rillig for (ln = srcList->first; ln != NULL; ln = ln->next)
860 1.194 rillig debug_printf(" %p", ln->datum);
861 1.200 rillig debug_printf("\n");
862 1.149 rillig }
863 1.149 rillig #endif
864 1.149 rillig
865 1.209 rillig static Src *
866 1.209 rillig SrcNew(char *name, char *pref, Suff *suff, Src *parent, GNode *gn)
867 1.209 rillig {
868 1.209 rillig Src *src = bmake_malloc(sizeof *src);
869 1.209 rillig
870 1.209 rillig src->file = name;
871 1.209 rillig src->pref = pref;
872 1.260 rillig src->suff = SuffRef(suff);
873 1.209 rillig src->parent = parent;
874 1.209 rillig src->node = gn;
875 1.234 rillig src->numChildren = 0;
876 1.209 rillig #ifdef DEBUG_SRC
877 1.211 rillig src->childrenList = Lst_New();
878 1.209 rillig #endif
879 1.209 rillig
880 1.209 rillig return src;
881 1.209 rillig }
882 1.209 rillig
883 1.190 rillig static void
884 1.265 rillig SrcList_Add(SrcList *srcList, char *srcName, Src *targ, Suff *suff,
885 1.265 rillig const char *debug_tag)
886 1.190 rillig {
887 1.209 rillig Src *s2 = SrcNew(srcName, targ->pref, suff, targ, NULL);
888 1.234 rillig targ->numChildren++;
889 1.190 rillig Lst_Append(srcList, s2);
890 1.190 rillig #ifdef DEBUG_SRC
891 1.211 rillig Lst_Append(targ->childrenList, s2);
892 1.224 rillig debug_printf("%s add suff %p src %p to list %p:",
893 1.224 rillig debug_tag, targ, s2, srcList);
894 1.193 rillig SrcList_PrintAddrs(srcList);
895 1.190 rillig #endif
896 1.190 rillig }
897 1.190 rillig
898 1.134 rillig /* Add a suffix as a Src structure to the given list with its parent
899 1.134 rillig * being the given Src structure. If the suffix is the null suffix,
900 1.238 rillig * the prefix is used unaltered as the filename in the Src structure.
901 1.1 cgd *
902 1.39 wiz * Input:
903 1.184 rillig * suff suffix for which to create a Src structure
904 1.184 rillig * srcList list for the new Src
905 1.184 rillig * targ parent for the new Src
906 1.1 cgd */
907 1.165 rillig static void
908 1.190 rillig SuffAddSources(Suff *suff, SrcList *srcList, Src *targ)
909 1.1 cgd {
910 1.184 rillig if ((suff->flags & SUFF_NULL) && suff->name[0] != '\0') {
911 1.73 joerg /*
912 1.73 joerg * If the suffix has been marked as the NULL suffix, also create a Src
913 1.73 joerg * structure for a file with no suffix attached. Two birds, and all
914 1.73 joerg * that...
915 1.73 joerg */
916 1.265 rillig SrcList_Add(srcList, bmake_strdup(targ->pref), targ, suff, "1");
917 1.1 cgd }
918 1.265 rillig SrcList_Add(srcList, str_concat2(targ->pref, suff->name), targ, suff, "2");
919 1.1 cgd }
920 1.1 cgd
921 1.238 rillig /* Add all the children of targ to the list. */
922 1.1 cgd static void
923 1.241 rillig SuffAddLevel(SrcList *srcs, Src *targ)
924 1.1 cgd {
925 1.183 rillig SrcListNode *ln;
926 1.183 rillig for (ln = targ->suff->children->first; ln != NULL; ln = ln->next) {
927 1.183 rillig Suff *childSuff = ln->datum;
928 1.241 rillig SuffAddSources(childSuff, srcs, targ);
929 1.183 rillig }
930 1.1 cgd }
931 1.1 cgd
932 1.214 rillig /* Free the first Src in the list that is not referenced anymore.
933 1.134 rillig * Return whether a Src was removed. */
934 1.134 rillig static Boolean
935 1.157 rillig SuffRemoveSrc(SrcList *l)
936 1.73 joerg {
937 1.157 rillig SrcListNode *ln;
938 1.73 joerg
939 1.73 joerg #ifdef DEBUG_SRC
940 1.224 rillig debug_printf("cleaning list %p:", l);
941 1.193 rillig SrcList_PrintAddrs(l);
942 1.73 joerg #endif
943 1.73 joerg
944 1.214 rillig for (ln = l->first; ln != NULL; ln = ln->next) {
945 1.233 rillig Src *src = ln->datum;
946 1.214 rillig
947 1.234 rillig if (src->numChildren == 0) {
948 1.233 rillig free(src->file);
949 1.233 rillig if (src->parent == NULL)
950 1.233 rillig free(src->pref);
951 1.73 joerg else {
952 1.73 joerg #ifdef DEBUG_SRC
953 1.233 rillig SrcListNode *ln2 = Lst_FindDatum(src->parent->childrenList, src);
954 1.84 dholland if (ln2 != NULL)
955 1.233 rillig Lst_Remove(src->parent->childrenList, ln2);
956 1.73 joerg #endif
957 1.234 rillig src->parent->numChildren--;
958 1.73 joerg }
959 1.73 joerg #ifdef DEBUG_SRC
960 1.224 rillig debug_printf("free: list %p src %p children %d\n",
961 1.248 rillig l, src, src->numChildren);
962 1.233 rillig Lst_Free(src->childrenList);
963 1.73 joerg #endif
964 1.125 rillig Lst_Remove(l, ln);
965 1.233 rillig free(src);
966 1.73 joerg return TRUE;
967 1.73 joerg }
968 1.73 joerg #ifdef DEBUG_SRC
969 1.73 joerg else {
970 1.224 rillig debug_printf("keep: list %p src %p children %d:",
971 1.248 rillig l, src, src->numChildren);
972 1.233 rillig SrcList_PrintAddrs(src->childrenList);
973 1.73 joerg }
974 1.73 joerg #endif
975 1.73 joerg }
976 1.6 jtc
977 1.134 rillig return FALSE;
978 1.1 cgd }
979 1.1 cgd
980 1.238 rillig /* Find the first existing file/target in srcs. */
981 1.1 cgd static Src *
982 1.157 rillig SuffFindThem(SrcList *srcs, SrcList *slst)
983 1.1 cgd {
984 1.220 rillig Src *retsrc = NULL;
985 1.1 cgd
986 1.125 rillig while (!Lst_IsEmpty(srcs)) {
987 1.220 rillig Src *src = Lst_Dequeue(srcs);
988 1.1 cgd
989 1.220 rillig SUFF_DEBUG1("\ttrying %s...", src->file);
990 1.6 jtc
991 1.1 cgd /*
992 1.73 joerg * A file is considered to exist if either a node exists in the
993 1.73 joerg * graph for it or the file actually exists.
994 1.1 cgd */
995 1.220 rillig if (Targ_FindNode(src->file) != NULL) {
996 1.6 jtc #ifdef DEBUG_SRC
997 1.224 rillig debug_printf("remove from list %p src %p\n", srcs, src);
998 1.6 jtc #endif
999 1.220 rillig retsrc = src;
1000 1.73 joerg break;
1001 1.73 joerg }
1002 1.73 joerg
1003 1.220 rillig {
1004 1.220 rillig char *file = Dir_FindFile(src->file, src->suff->searchPath);
1005 1.220 rillig if (file != NULL) {
1006 1.220 rillig retsrc = src;
1007 1.6 jtc #ifdef DEBUG_SRC
1008 1.224 rillig debug_printf("remove from list %p src %p\n", srcs, src);
1009 1.6 jtc #endif
1010 1.220 rillig free(file);
1011 1.220 rillig break;
1012 1.220 rillig }
1013 1.1 cgd }
1014 1.6 jtc
1015 1.140 rillig SUFF_DEBUG0("not there\n");
1016 1.6 jtc
1017 1.220 rillig SuffAddLevel(srcs, src);
1018 1.220 rillig Lst_Append(slst, src);
1019 1.6 jtc }
1020 1.6 jtc
1021 1.220 rillig if (retsrc) {
1022 1.140 rillig SUFF_DEBUG0("got it\n");
1023 1.73 joerg }
1024 1.220 rillig return retsrc;
1025 1.1 cgd }
1026 1.1 cgd
1027 1.134 rillig /* See if any of the children of the target in the Src structure is one from
1028 1.134 rillig * which the target can be transformed. If there is one, a Src structure is
1029 1.134 rillig * put together for it and returned.
1030 1.1 cgd *
1031 1.39 wiz * Input:
1032 1.134 rillig * targ Src to play with
1033 1.73 joerg *
1034 1.73 joerg * Results:
1035 1.134 rillig * The Src of the "winning" child, or NULL.
1036 1.1 cgd */
1037 1.73 joerg static Src *
1038 1.157 rillig SuffFindCmds(Src *targ, SrcList *slst)
1039 1.1 cgd {
1040 1.157 rillig GNodeListNode *gln;
1041 1.215 rillig GNode *tgn; /* Target GNode */
1042 1.215 rillig GNode *sgn; /* Source GNode */
1043 1.170 rillig size_t prefLen; /* The length of the defined prefix */
1044 1.170 rillig Suff *suff; /* Suffix on matching beastie */
1045 1.170 rillig Src *ret; /* Return value */
1046 1.170 rillig char *cp;
1047 1.73 joerg
1048 1.215 rillig tgn = targ->node;
1049 1.73 joerg prefLen = strlen(targ->pref);
1050 1.73 joerg
1051 1.216 rillig for (gln = tgn->children->first; gln != NULL; gln = gln->next) {
1052 1.215 rillig sgn = gln->datum;
1053 1.73 joerg
1054 1.215 rillig if (sgn->type & OP_OPTIONAL && Lst_IsEmpty(tgn->commands)) {
1055 1.73 joerg /*
1056 1.73 joerg * We haven't looked to see if .OPTIONAL files exist yet, so
1057 1.73 joerg * don't use one as the implicit source.
1058 1.73 joerg * This allows us to use .OPTIONAL in .depend files so make won't
1059 1.73 joerg * complain "don't know how to make xxx.h' when a dependent file
1060 1.73 joerg * has been moved/deleted.
1061 1.73 joerg */
1062 1.73 joerg continue;
1063 1.73 joerg }
1064 1.73 joerg
1065 1.215 rillig cp = strrchr(sgn->name, '/');
1066 1.73 joerg if (cp == NULL) {
1067 1.215 rillig cp = sgn->name;
1068 1.73 joerg } else {
1069 1.73 joerg cp++;
1070 1.73 joerg }
1071 1.73 joerg if (strncmp(cp, targ->pref, prefLen) != 0)
1072 1.73 joerg continue;
1073 1.238 rillig /* The node matches the prefix ok, see if it has a known suffix. */
1074 1.166 rillig suff = FindSuffByName(cp + prefLen);
1075 1.166 rillig if (suff == NULL)
1076 1.73 joerg continue;
1077 1.166 rillig
1078 1.73 joerg /*
1079 1.73 joerg * It even has a known suffix, see if there's a transformation
1080 1.73 joerg * defined between the node's suffix and the target's suffix.
1081 1.73 joerg *
1082 1.73 joerg * XXX: Handle multi-stage transformations here, too.
1083 1.73 joerg */
1084 1.73 joerg
1085 1.107 rillig /* XXX: Can targ->suff be NULL here? */
1086 1.107 rillig if (targ->suff != NULL &&
1087 1.137 rillig Lst_FindDatum(suff->parents, targ->suff) != NULL)
1088 1.73 joerg break;
1089 1.73 joerg }
1090 1.1 cgd
1091 1.216 rillig if (gln == NULL)
1092 1.216 rillig return NULL;
1093 1.216 rillig
1094 1.43 dsl /*
1095 1.73 joerg * Hot Damn! Create a new Src structure to describe
1096 1.73 joerg * this transformation (making sure to duplicate the
1097 1.73 joerg * source node's name so Suff_FindDeps can free it
1098 1.73 joerg * again (ick)), and return the new structure.
1099 1.73 joerg */
1100 1.215 rillig ret = SrcNew(bmake_strdup(sgn->name), targ->pref, suff, targ, sgn);
1101 1.234 rillig targ->numChildren++;
1102 1.73 joerg #ifdef DEBUG_SRC
1103 1.224 rillig debug_printf("3 add targ %p ret %p\n", targ, ret);
1104 1.211 rillig Lst_Append(targ->childrenList, ret);
1105 1.73 joerg #endif
1106 1.125 rillig Lst_Append(slst, ret);
1107 1.215 rillig SUFF_DEBUG1("\tusing existing source %s\n", sgn->name);
1108 1.88 rillig return ret;
1109 1.1 cgd }
1110 1.1 cgd
1111 1.134 rillig /* Expand the names of any children of a given node that contain variable
1112 1.153 rillig * expressions or file wildcards into actual targets.
1113 1.134 rillig *
1114 1.134 rillig * The expanded node is removed from the parent's list of children, and the
1115 1.134 rillig * parent's unmade counter is decremented, but other nodes may be added.
1116 1.1 cgd *
1117 1.39 wiz * Input:
1118 1.73 joerg * cln Child to examine
1119 1.73 joerg * pgn Parent node being processed
1120 1.1 cgd */
1121 1.56 dsl static void
1122 1.157 rillig SuffExpandChildren(GNodeListNode *cln, GNode *pgn)
1123 1.1 cgd {
1124 1.195 rillig GNode *cgn = cln->datum;
1125 1.170 rillig GNode *gn; /* New source 8) */
1126 1.170 rillig char *cp; /* Expanded value */
1127 1.1 cgd
1128 1.125 rillig if (!Lst_IsEmpty(cgn->order_pred) || !Lst_IsEmpty(cgn->order_succ))
1129 1.61 dsl /* It is all too hard to process the result of .ORDER */
1130 1.61 dsl return;
1131 1.61 dsl
1132 1.61 dsl if (cgn->type & OP_WAIT)
1133 1.61 dsl /* Ignore these (& OP_PHONY ?) */
1134 1.61 dsl return;
1135 1.61 dsl
1136 1.1 cgd /*
1137 1.1 cgd * First do variable expansion -- this takes precedence over
1138 1.1 cgd * wildcard expansion. If the result contains wildcards, they'll be gotten
1139 1.1 cgd * to later since the resulting words are tacked on to the end of
1140 1.1 cgd * the children list.
1141 1.1 cgd */
1142 1.56 dsl if (strchr(cgn->name, '$') == NULL) {
1143 1.56 dsl SuffExpandWildcards(cln, pgn);
1144 1.56 dsl return;
1145 1.56 dsl }
1146 1.56 dsl
1147 1.140 rillig SUFF_DEBUG1("Expanding \"%s\"...", cgn->name);
1148 1.235 rillig (void)Var_Subst(cgn->name, pgn, VARE_WANTRES | VARE_UNDEFERR, &cp);
1149 1.158 rillig /* TODO: handle errors */
1150 1.1 cgd
1151 1.135 rillig {
1152 1.180 rillig GNodeList *members = Lst_New();
1153 1.13 christos
1154 1.56 dsl if (cgn->type & OP_ARCHV) {
1155 1.56 dsl /*
1156 1.56 dsl * Node was an archive(member) target, so we want to call
1157 1.56 dsl * on the Arch module to find the nodes for us, expanding
1158 1.56 dsl * variables in the parent's context.
1159 1.56 dsl */
1160 1.56 dsl char *sacrifice = cp;
1161 1.1 cgd
1162 1.56 dsl (void)Arch_ParseArchive(&sacrifice, members, pgn);
1163 1.56 dsl } else {
1164 1.56 dsl /*
1165 1.56 dsl * Break the result into a vector of strings whose nodes
1166 1.56 dsl * we can find, then add those nodes to the members list.
1167 1.245 rillig * Unfortunately, we can't use Str_Words because it
1168 1.56 dsl * doesn't understand about variable specifications with
1169 1.56 dsl * spaces in them...
1170 1.56 dsl */
1171 1.56 dsl char *start;
1172 1.73 joerg char *initcp = cp; /* For freeing... */
1173 1.1 cgd
1174 1.232 rillig start = cp;
1175 1.232 rillig pp_skip_hspace(&start);
1176 1.145 rillig cp = start;
1177 1.145 rillig while (*cp != '\0') {
1178 1.56 dsl if (*cp == ' ' || *cp == '\t') {
1179 1.56 dsl /*
1180 1.56 dsl * White-space -- terminate element, find the node,
1181 1.56 dsl * add it, skip any further spaces.
1182 1.56 dsl */
1183 1.56 dsl *cp++ = '\0';
1184 1.168 rillig gn = Targ_GetNode(start);
1185 1.125 rillig Lst_Append(members, gn);
1186 1.232 rillig pp_skip_hspace(&cp);
1187 1.145 rillig start = cp; /* Continue at the next non-space. */
1188 1.56 dsl } else if (*cp == '$') {
1189 1.262 rillig /* Skip over the variable expression. */
1190 1.144 rillig const char *nested_p = cp;
1191 1.90 rillig const char *junk;
1192 1.56 dsl void *freeIt;
1193 1.56 dsl
1194 1.262 rillig (void)Var_Parse(&nested_p, pgn, VARE_NONE, &junk, &freeIt);
1195 1.156 rillig /* TODO: handle errors */
1196 1.145 rillig if (junk == var_Error) {
1197 1.145 rillig Parse_Error(PARSE_FATAL,
1198 1.145 rillig "Malformed variable expression at \"%s\"",
1199 1.145 rillig cp);
1200 1.148 rillig cp++;
1201 1.145 rillig } else {
1202 1.144 rillig cp += nested_p - cp;
1203 1.56 dsl }
1204 1.1 cgd
1205 1.77 christos free(freeIt);
1206 1.242 rillig } else if (cp[0] == '\\' && cp[1] != '\0') {
1207 1.1 cgd /*
1208 1.56 dsl * Escaped something -- skip over it
1209 1.1 cgd */
1210 1.145 rillig /* XXX: In other places, escaping at this syntactical
1211 1.145 rillig * position is done by a '$', not a '\'. The '\' is only
1212 1.145 rillig * used in variable modifiers. */
1213 1.145 rillig cp += 2;
1214 1.145 rillig } else {
1215 1.56 dsl cp++;
1216 1.1 cgd }
1217 1.56 dsl }
1218 1.56 dsl
1219 1.56 dsl if (cp != start) {
1220 1.1 cgd /*
1221 1.56 dsl * Stuff left over -- add it to the list too
1222 1.1 cgd */
1223 1.168 rillig gn = Targ_GetNode(start);
1224 1.125 rillig Lst_Append(members, gn);
1225 1.1 cgd }
1226 1.73 joerg /*
1227 1.73 joerg * Point cp back at the beginning again so the variable value
1228 1.73 joerg * can be freed.
1229 1.73 joerg */
1230 1.73 joerg cp = initcp;
1231 1.56 dsl }
1232 1.1 cgd
1233 1.1 cgd /*
1234 1.56 dsl * Add all elements of the members list to the parent node.
1235 1.1 cgd */
1236 1.125 rillig while(!Lst_IsEmpty(members)) {
1237 1.125 rillig gn = Lst_Dequeue(members);
1238 1.56 dsl
1239 1.140 rillig SUFF_DEBUG1("%s...", gn->name);
1240 1.56 dsl /* Add gn to the parents child list before the original child */
1241 1.125 rillig Lst_InsertBefore(pgn->children, cln, gn);
1242 1.125 rillig Lst_Append(gn->parents, pgn);
1243 1.56 dsl pgn->unmade++;
1244 1.56 dsl /* Expand wildcards on new node */
1245 1.169 rillig SuffExpandWildcards(cln->prev, pgn);
1246 1.1 cgd }
1247 1.125 rillig Lst_Free(members);
1248 1.1 cgd
1249 1.73 joerg /*
1250 1.73 joerg * Free the result
1251 1.73 joerg */
1252 1.73 joerg free(cp);
1253 1.73 joerg }
1254 1.135 rillig
1255 1.140 rillig SUFF_DEBUG0("\n");
1256 1.1 cgd
1257 1.56 dsl /*
1258 1.56 dsl * Now the source is expanded, remove it from the list of children to
1259 1.56 dsl * keep it from being processed.
1260 1.56 dsl */
1261 1.56 dsl pgn->unmade--;
1262 1.125 rillig Lst_Remove(pgn->children, cln);
1263 1.137 rillig Lst_Remove(cgn->parents, Lst_FindDatum(cgn->parents, pgn));
1264 1.56 dsl }
1265 1.56 dsl
1266 1.56 dsl static void
1267 1.157 rillig SuffExpandWildcards(GNodeListNode *cln, GNode *pgn)
1268 1.56 dsl {
1269 1.195 rillig GNode *cgn = cln->datum;
1270 1.241 rillig StringList *expansions;
1271 1.1 cgd
1272 1.56 dsl if (!Dir_HasWildcards(cgn->name))
1273 1.56 dsl return;
1274 1.1 cgd
1275 1.56 dsl /*
1276 1.56 dsl * Expand the word along the chosen path
1277 1.56 dsl */
1278 1.241 rillig expansions = Lst_New();
1279 1.241 rillig Dir_Expand(cgn->name, Suff_FindPath(cgn), expansions);
1280 1.1 cgd
1281 1.241 rillig while (!Lst_IsEmpty(expansions)) {
1282 1.157 rillig GNode *gn;
1283 1.1 cgd /*
1284 1.56 dsl * Fetch next expansion off the list and find its GNode
1285 1.1 cgd */
1286 1.241 rillig char *cp = Lst_Dequeue(expansions);
1287 1.13 christos
1288 1.140 rillig SUFF_DEBUG1("%s...", cp);
1289 1.168 rillig gn = Targ_GetNode(cp);
1290 1.56 dsl
1291 1.56 dsl /* Add gn to the parents child list before the original child */
1292 1.125 rillig Lst_InsertBefore(pgn->children, cln, gn);
1293 1.125 rillig Lst_Append(gn->parents, pgn);
1294 1.56 dsl pgn->unmade++;
1295 1.1 cgd }
1296 1.1 cgd
1297 1.241 rillig Lst_Free(expansions);
1298 1.56 dsl
1299 1.140 rillig SUFF_DEBUG0("\n");
1300 1.73 joerg
1301 1.56 dsl /*
1302 1.56 dsl * Now the source is expanded, remove it from the list of children to
1303 1.56 dsl * keep it from being processed.
1304 1.56 dsl */
1305 1.56 dsl pgn->unmade--;
1306 1.125 rillig Lst_Remove(pgn->children, cln);
1307 1.137 rillig Lst_Remove(cgn->parents, Lst_FindDatum(cgn->parents, pgn));
1308 1.1 cgd }
1309 1.1 cgd
1310 1.134 rillig /* Find a path along which to expand the node.
1311 1.47 christos *
1312 1.238 rillig * If the node has a known suffix, use that path.
1313 1.134 rillig * If it has no known suffix, use the default system search path.
1314 1.47 christos *
1315 1.47 christos * Input:
1316 1.47 christos * gn Node being examined
1317 1.47 christos *
1318 1.47 christos * Results:
1319 1.47 christos * The appropriate path to search for the GNode.
1320 1.46 christos */
1321 1.157 rillig SearchPath *
1322 1.46 christos Suff_FindPath(GNode* gn)
1323 1.46 christos {
1324 1.46 christos Suff *suff = gn->suffix;
1325 1.46 christos
1326 1.46 christos if (suff == NULL) {
1327 1.228 rillig char *name = gn->name;
1328 1.207 rillig size_t nameLen = strlen(gn->name);
1329 1.157 rillig SuffListNode *ln;
1330 1.207 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next)
1331 1.207 rillig if (SuffSuffIsSuffix(ln->datum, nameLen, name + nameLen))
1332 1.207 rillig break;
1333 1.46 christos
1334 1.140 rillig SUFF_DEBUG1("Wildcard expanding \"%s\"...", gn->name);
1335 1.65 dsl if (ln != NULL)
1336 1.195 rillig suff = ln->datum;
1337 1.46 christos /* XXX: Here we can save the suffix so we don't have to do this again */
1338 1.46 christos }
1339 1.46 christos
1340 1.73 joerg if (suff != NULL) {
1341 1.226 rillig SUFF_DEBUG1("suffix is \"%s\"...\n", suff->name);
1342 1.46 christos return suff->searchPath;
1343 1.73 joerg } else {
1344 1.228 rillig SUFF_DEBUG0("\n");
1345 1.226 rillig return dirSearchPath; /* Use default search path */
1346 1.46 christos }
1347 1.46 christos }
1348 1.46 christos
1349 1.134 rillig /* Apply a transformation rule, given the source and target nodes and
1350 1.134 rillig * suffixes.
1351 1.1 cgd *
1352 1.238 rillig * The source and target are linked and the commands from the transformation
1353 1.238 rillig * are added to the target node's commands list. The target also inherits all
1354 1.238 rillig * the sources for the transformation rule.
1355 1.39 wiz *
1356 1.1 cgd * Results:
1357 1.1 cgd * TRUE if successful, FALSE if not.
1358 1.1 cgd */
1359 1.1 cgd static Boolean
1360 1.241 rillig SuffApplyTransform(GNode *tgn, GNode *sgn, Suff *tsuff, Suff *ssuff)
1361 1.1 cgd {
1362 1.242 rillig GNodeListNode *ln;
1363 1.170 rillig char *tname; /* Name of transformation rule */
1364 1.170 rillig GNode *gn; /* Node for same */
1365 1.1 cgd
1366 1.31 mycroft /*
1367 1.31 mycroft * Form the proper links between the target and source.
1368 1.31 mycroft */
1369 1.241 rillig Lst_Append(tgn->children, sgn);
1370 1.241 rillig Lst_Append(sgn->parents, tgn);
1371 1.241 rillig tgn->unmade++;
1372 1.1 cgd
1373 1.1 cgd /*
1374 1.1 cgd * Locate the transformation rule itself
1375 1.1 cgd */
1376 1.241 rillig tname = str_concat2(ssuff->name, tsuff->name);
1377 1.210 rillig gn = FindTransformByName(tname);
1378 1.1 cgd free(tname);
1379 1.1 cgd
1380 1.210 rillig if (gn == NULL) {
1381 1.238 rillig /* This can happen when linking an OP_MEMBER and OP_ARCHV node. */
1382 1.88 rillig return FALSE;
1383 1.73 joerg }
1384 1.73 joerg
1385 1.243 rillig DEBUG3(SUFF,"\tapplying %s -> %s to \"%s\"\n",
1386 1.241 rillig ssuff->name, tsuff->name, tgn->name);
1387 1.1 cgd
1388 1.238 rillig /* Record last child; Make_HandleUse may add child nodes. */
1389 1.241 rillig ln = tgn->children->last;
1390 1.13 christos
1391 1.238 rillig /* Apply the rule. */
1392 1.242 rillig Make_HandleUse(gn, tgn);
1393 1.1 cgd
1394 1.238 rillig /* Deal with wildcards and variables in any acquired sources. */
1395 1.242 rillig ln = ln != NULL ? ln->next : NULL;
1396 1.242 rillig while (ln != NULL) {
1397 1.242 rillig GNodeListNode *nln = ln->next;
1398 1.241 rillig SuffExpandChildren(ln, tgn);
1399 1.242 rillig ln = nln;
1400 1.73 joerg }
1401 1.1 cgd
1402 1.73 joerg /*
1403 1.238 rillig * Keep track of another parent to which this node is transformed so
1404 1.73 joerg * the .IMPSRC variable can be set correctly for the parent.
1405 1.73 joerg */
1406 1.241 rillig Lst_Append(sgn->implicitParents, tgn);
1407 1.1 cgd
1408 1.88 rillig return TRUE;
1409 1.1 cgd }
1410 1.1 cgd
1411 1.1 cgd
1412 1.134 rillig /* Locate dependencies for an OP_ARCHV node.
1413 1.1 cgd *
1414 1.39 wiz * Input:
1415 1.73 joerg * gn Node for which to locate dependencies
1416 1.39 wiz *
1417 1.1 cgd * Side Effects:
1418 1.73 joerg * Same as Suff_FindDeps
1419 1.1 cgd */
1420 1.1 cgd static void
1421 1.157 rillig SuffFindArchiveDeps(GNode *gn, SrcList *slst)
1422 1.1 cgd {
1423 1.157 rillig char *eoarch; /* End of archive portion */
1424 1.157 rillig char *eoname; /* End of member portion */
1425 1.157 rillig GNode *mem; /* Node for member */
1426 1.157 rillig SuffListNode *ln, *nln; /* Next suffix node to check */
1427 1.157 rillig Suff *ms; /* Suffix descriptor for member */
1428 1.157 rillig char *name; /* Start of member's name */
1429 1.71 christos
1430 1.73 joerg /*
1431 1.73 joerg * The node is an archive(member) pair. so we must find a
1432 1.73 joerg * suffix for both of them.
1433 1.73 joerg */
1434 1.73 joerg eoarch = strchr(gn->name, '(');
1435 1.73 joerg eoname = strchr(eoarch, ')');
1436 1.13 christos
1437 1.86 riastrad /*
1438 1.86 riastrad * Caller guarantees the format `libname(member)', via
1439 1.86 riastrad * Arch_ParseArchive.
1440 1.86 riastrad */
1441 1.86 riastrad assert(eoarch != NULL);
1442 1.86 riastrad assert(eoname != NULL);
1443 1.86 riastrad
1444 1.73 joerg *eoname = '\0'; /* Nuke parentheses during suffix search */
1445 1.73 joerg *eoarch = '\0'; /* So a suffix can be found */
1446 1.1 cgd
1447 1.73 joerg name = eoarch + 1;
1448 1.1 cgd
1449 1.73 joerg /*
1450 1.73 joerg * To simplify things, call Suff_FindDeps recursively on the member now,
1451 1.73 joerg * so we can simply compare the member's .PREFIX and .TARGET variables
1452 1.73 joerg * to locate its suffix. This allows us to figure out the suffix to
1453 1.73 joerg * use for the archive without having to do a quadratic search over the
1454 1.73 joerg * suffix list, backtracking for each one...
1455 1.73 joerg */
1456 1.168 rillig mem = Targ_GetNode(name);
1457 1.73 joerg SuffFindDeps(mem, slst);
1458 1.13 christos
1459 1.1 cgd /*
1460 1.73 joerg * Create the link between the two nodes right off
1461 1.1 cgd */
1462 1.125 rillig Lst_Append(gn->children, mem);
1463 1.125 rillig Lst_Append(mem->parents, gn);
1464 1.173 rillig gn->unmade++;
1465 1.13 christos
1466 1.1 cgd /*
1467 1.73 joerg * Copy in the variables from the member node to this one.
1468 1.1 cgd */
1469 1.230 rillig Var_Set(PREFIX, GNode_VarPrefix(mem), gn);
1470 1.230 rillig Var_Set(TARGET, GNode_VarTarget(mem), gn);
1471 1.1 cgd
1472 1.73 joerg ms = mem->suffix;
1473 1.238 rillig if (ms == NULL) { /* Didn't know what it was. */
1474 1.140 rillig SUFF_DEBUG0("using null suffix\n");
1475 1.73 joerg ms = suffNull;
1476 1.1 cgd }
1477 1.1 cgd
1478 1.73 joerg
1479 1.1 cgd /*
1480 1.73 joerg * Set the other two local variables required for this target.
1481 1.1 cgd */
1482 1.87 rillig Var_Set(MEMBER, name, gn);
1483 1.87 rillig Var_Set(ARCHIVE, gn->name, gn);
1484 1.73 joerg
1485 1.79 matthias /*
1486 1.79 matthias * Set $@ for compatibility with other makes
1487 1.79 matthias */
1488 1.87 rillig Var_Set(TARGET, gn->name, gn);
1489 1.80 matthias
1490 1.80 matthias /*
1491 1.80 matthias * Now we've got the important local variables set, expand any sources
1492 1.80 matthias * that still contain variables or wildcards in their names.
1493 1.80 matthias */
1494 1.195 rillig for (ln = gn->children->first; ln != NULL; ln = nln) {
1495 1.169 rillig nln = ln->next;
1496 1.80 matthias SuffExpandChildren(ln, gn);
1497 1.80 matthias }
1498 1.80 matthias
1499 1.73 joerg if (ms != NULL) {
1500 1.73 joerg /*
1501 1.73 joerg * Member has a known suffix, so look for a transformation rule from
1502 1.73 joerg * it to a possible suffix of the archive. Rather than searching
1503 1.73 joerg * through the entire list, we just look at suffixes to which the
1504 1.73 joerg * member's suffix may be transformed...
1505 1.73 joerg */
1506 1.207 rillig size_t nameLen = (size_t)(eoarch - gn->name);
1507 1.73 joerg
1508 1.207 rillig /* Use first matching suffix... */
1509 1.207 rillig for (ln = ms->parents->first; ln != NULL; ln = ln->next)
1510 1.207 rillig if (SuffSuffIsSuffix(ln->datum, nameLen, eoarch))
1511 1.207 rillig break;
1512 1.73 joerg
1513 1.73 joerg if (ln != NULL) {
1514 1.73 joerg /*
1515 1.73 joerg * Got one -- apply it
1516 1.73 joerg */
1517 1.195 rillig Suff *suff = ln->datum;
1518 1.140 rillig if (!SuffApplyTransform(gn, mem, suff, ms)) {
1519 1.140 rillig SUFF_DEBUG2("\tNo transformation from %s -> %s\n",
1520 1.140 rillig ms->name, suff->name);
1521 1.1 cgd }
1522 1.1 cgd }
1523 1.1 cgd }
1524 1.1 cgd
1525 1.73 joerg /*
1526 1.73 joerg * Replace the opening and closing parens now we've no need of the separate
1527 1.73 joerg * pieces.
1528 1.73 joerg */
1529 1.242 rillig *eoarch = '(';
1530 1.242 rillig *eoname = ')';
1531 1.71 christos
1532 1.1 cgd /*
1533 1.73 joerg * Pretend gn appeared to the left of a dependency operator so
1534 1.73 joerg * the user needn't provide a transformation from the member to the
1535 1.73 joerg * archive.
1536 1.1 cgd */
1537 1.240 rillig if (!GNode_IsTarget(gn))
1538 1.73 joerg gn->type |= OP_DEPENDS;
1539 1.71 christos
1540 1.73 joerg /*
1541 1.73 joerg * Flag the member as such so we remember to look in the archive for
1542 1.81 matthias * its modification time. The OP_JOIN | OP_MADE is needed because this
1543 1.81 matthias * target should never get made.
1544 1.73 joerg */
1545 1.81 matthias mem->type |= OP_MEMBER | OP_JOIN | OP_MADE;
1546 1.1 cgd }
1547 1.1 cgd
1548 1.201 rillig static void
1549 1.227 rillig SuffFindNormalDepsKnown(const char *name, size_t nameLen, GNode *gn,
1550 1.208 rillig SrcList *srcs, SrcList *targs)
1551 1.201 rillig {
1552 1.203 rillig SuffListNode *ln;
1553 1.203 rillig Src *targ;
1554 1.209 rillig char *pref;
1555 1.201 rillig
1556 1.203 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next) {
1557 1.209 rillig Suff *suff = ln->datum;
1558 1.209 rillig if (!SuffSuffIsSuffix(suff, nameLen, name + nameLen))
1559 1.203 rillig continue;
1560 1.201 rillig
1561 1.209 rillig pref = bmake_strldup(name, (size_t)(nameLen - suff->nameLen));
1562 1.209 rillig targ = SrcNew(bmake_strdup(gn->name), pref, suff, NULL, gn);
1563 1.201 rillig
1564 1.203 rillig /*
1565 1.203 rillig * Add nodes from which the target can be made
1566 1.203 rillig */
1567 1.203 rillig SuffAddLevel(srcs, targ);
1568 1.201 rillig
1569 1.203 rillig /*
1570 1.203 rillig * Record the target so we can nuke it
1571 1.203 rillig */
1572 1.203 rillig Lst_Append(targs, targ);
1573 1.201 rillig }
1574 1.201 rillig }
1575 1.201 rillig
1576 1.202 rillig static void
1577 1.202 rillig SuffFindNormalDepsUnknown(GNode *gn, const char *sopref,
1578 1.202 rillig SrcList *srcs, SrcList *targs)
1579 1.202 rillig {
1580 1.202 rillig Src *targ;
1581 1.202 rillig
1582 1.204 rillig if (!Lst_IsEmpty(targs) || suffNull == NULL)
1583 1.228 rillig return;
1584 1.202 rillig
1585 1.204 rillig SUFF_DEBUG1("\tNo known suffix on %s. Using .NULL suffix\n", gn->name);
1586 1.204 rillig
1587 1.209 rillig targ = SrcNew(bmake_strdup(gn->name), bmake_strdup(sopref),
1588 1.209 rillig suffNull, NULL, gn);
1589 1.202 rillig
1590 1.204 rillig /*
1591 1.204 rillig * Only use the default suffix rules if we don't have commands
1592 1.204 rillig * defined for this gnode; traditional make programs used to
1593 1.204 rillig * not define suffix rules if the gnode had children but we
1594 1.204 rillig * don't do this anymore.
1595 1.204 rillig */
1596 1.204 rillig if (Lst_IsEmpty(gn->commands))
1597 1.204 rillig SuffAddLevel(srcs, targ);
1598 1.204 rillig else {
1599 1.204 rillig SUFF_DEBUG0("not ");
1600 1.204 rillig }
1601 1.202 rillig
1602 1.204 rillig SUFF_DEBUG0("adding suffix rules\n");
1603 1.202 rillig
1604 1.204 rillig Lst_Append(targs, targ);
1605 1.202 rillig }
1606 1.202 rillig
1607 1.205 rillig /*
1608 1.205 rillig * Deal with finding the thing on the default search path. We
1609 1.205 rillig * always do that, not only if the node is only a source (not
1610 1.205 rillig * on the lhs of a dependency operator or [XXX] it has neither
1611 1.205 rillig * children or commands) as the old pmake did.
1612 1.205 rillig */
1613 1.205 rillig static void
1614 1.205 rillig SuffFindNormalDepsPath(GNode *gn, Src *targ)
1615 1.205 rillig {
1616 1.206 rillig if (gn->type & (OP_PHONY | OP_NOPATH))
1617 1.228 rillig return;
1618 1.206 rillig
1619 1.206 rillig free(gn->path);
1620 1.206 rillig gn->path = Dir_FindFile(gn->name,
1621 1.206 rillig (targ == NULL ? dirSearchPath :
1622 1.206 rillig targ->suff->searchPath));
1623 1.206 rillig if (gn->path == NULL)
1624 1.228 rillig return;
1625 1.205 rillig
1626 1.206 rillig Var_Set(TARGET, gn->path, gn);
1627 1.206 rillig
1628 1.206 rillig if (targ != NULL) {
1629 1.206 rillig /*
1630 1.206 rillig * Suffix known for the thing -- trim the suffix off
1631 1.206 rillig * the path to form the proper .PREFIX variable.
1632 1.206 rillig */
1633 1.206 rillig size_t savep = strlen(gn->path) - targ->suff->nameLen;
1634 1.206 rillig char savec;
1635 1.206 rillig char *ptr;
1636 1.206 rillig
1637 1.259 rillig SuffReassign(&gn->suffix, targ->suff);
1638 1.206 rillig
1639 1.206 rillig savec = gn->path[savep];
1640 1.206 rillig gn->path[savep] = '\0';
1641 1.205 rillig
1642 1.206 rillig if ((ptr = strrchr(gn->path, '/')) != NULL)
1643 1.206 rillig ptr++;
1644 1.206 rillig else
1645 1.206 rillig ptr = gn->path;
1646 1.205 rillig
1647 1.206 rillig Var_Set(PREFIX, ptr, gn);
1648 1.205 rillig
1649 1.206 rillig gn->path[savep] = savec;
1650 1.206 rillig } else {
1651 1.206 rillig char *ptr;
1652 1.205 rillig
1653 1.206 rillig /* The .PREFIX gets the full path if the target has no known suffix. */
1654 1.259 rillig SuffUnassign(&gn->suffix);
1655 1.205 rillig
1656 1.206 rillig if ((ptr = strrchr(gn->path, '/')) != NULL)
1657 1.206 rillig ptr++;
1658 1.206 rillig else
1659 1.206 rillig ptr = gn->path;
1660 1.205 rillig
1661 1.206 rillig Var_Set(PREFIX, ptr, gn);
1662 1.205 rillig }
1663 1.205 rillig }
1664 1.205 rillig
1665 1.134 rillig /* Locate implicit dependencies for regular targets.
1666 1.1 cgd *
1667 1.39 wiz * Input:
1668 1.73 joerg * gn Node for which to find sources
1669 1.39 wiz *
1670 1.1 cgd * Side Effects:
1671 1.134 rillig * Same as Suff_FindDeps
1672 1.1 cgd */
1673 1.1 cgd static void
1674 1.157 rillig SuffFindNormalDeps(GNode *gn, SrcList *slst)
1675 1.1 cgd {
1676 1.170 rillig SrcList *srcs; /* List of sources at which to look */
1677 1.170 rillig SrcList *targs; /* List of targets to which things can be
1678 1.170 rillig * transformed. They all have the same file,
1679 1.170 rillig * but different suff and pref fields */
1680 1.170 rillig Src *bottom; /* Start of found transformation path */
1681 1.170 rillig Src *src; /* General Src pointer */
1682 1.170 rillig char *pref; /* Prefix to use */
1683 1.170 rillig Src *targ; /* General Src target pointer */
1684 1.73 joerg
1685 1.227 rillig const char *name = gn->name;
1686 1.208 rillig size_t nameLen = strlen(name);
1687 1.73 joerg
1688 1.73 joerg /*
1689 1.73 joerg * Begin at the beginning...
1690 1.73 joerg */
1691 1.180 rillig srcs = Lst_New();
1692 1.180 rillig targs = Lst_New();
1693 1.73 joerg
1694 1.73 joerg /*
1695 1.73 joerg * We're caught in a catch-22 here. On the one hand, we want to use any
1696 1.73 joerg * transformation implied by the target's sources, but we can't examine
1697 1.73 joerg * the sources until we've expanded any variables/wildcards they may hold,
1698 1.73 joerg * and we can't do that until we've set up the target's local variables
1699 1.73 joerg * and we can't do that until we know what the proper suffix for the
1700 1.73 joerg * target is (in case there are two suffixes one of which is a suffix of
1701 1.73 joerg * the other) and we can't know that until we've found its implied
1702 1.73 joerg * source, which we may not want to use if there's an existing source
1703 1.73 joerg * that implies a different transformation.
1704 1.73 joerg *
1705 1.73 joerg * In an attempt to get around this, which may not work all the time,
1706 1.73 joerg * but should work most of the time, we look for implied sources first,
1707 1.73 joerg * checking transformations to all possible suffixes of the target,
1708 1.73 joerg * use what we find to set the target's local variables, expand the
1709 1.73 joerg * children, then look for any overriding transformations they imply.
1710 1.73 joerg * Should we find one, we discard the one we found before.
1711 1.73 joerg */
1712 1.73 joerg bottom = NULL;
1713 1.73 joerg targ = NULL;
1714 1.71 christos
1715 1.73 joerg if (!(gn->type & OP_PHONY)) {
1716 1.73 joerg
1717 1.208 rillig SuffFindNormalDepsKnown(name, nameLen, gn, srcs, targs);
1718 1.73 joerg
1719 1.202 rillig /* Handle target of unknown suffix... */
1720 1.208 rillig SuffFindNormalDepsUnknown(gn, name, srcs, targs);
1721 1.73 joerg
1722 1.73 joerg /*
1723 1.73 joerg * Using the list of possible sources built up from the target
1724 1.73 joerg * suffix(es), try and find an existing file/target that matches.
1725 1.73 joerg */
1726 1.73 joerg bottom = SuffFindThem(srcs, slst);
1727 1.73 joerg
1728 1.73 joerg if (bottom == NULL) {
1729 1.73 joerg /*
1730 1.73 joerg * No known transformations -- use the first suffix found
1731 1.73 joerg * for setting the local variables.
1732 1.73 joerg */
1733 1.240 rillig if (targs->first != NULL)
1734 1.195 rillig targ = targs->first->datum;
1735 1.240 rillig else
1736 1.73 joerg targ = NULL;
1737 1.73 joerg } else {
1738 1.73 joerg /*
1739 1.73 joerg * Work up the transformation path to find the suffix of the
1740 1.73 joerg * target to which the transformation was made.
1741 1.73 joerg */
1742 1.73 joerg for (targ = bottom; targ->parent != NULL; targ = targ->parent)
1743 1.73 joerg continue;
1744 1.73 joerg }
1745 1.73 joerg }
1746 1.73 joerg
1747 1.225 rillig Var_Set(TARGET, GNode_Path(gn), gn);
1748 1.73 joerg
1749 1.240 rillig pref = targ != NULL ? targ->pref : gn->name;
1750 1.87 rillig Var_Set(PREFIX, pref, gn);
1751 1.1 cgd
1752 1.1 cgd /*
1753 1.73 joerg * Now we've got the important local variables set, expand any sources
1754 1.73 joerg * that still contain variables or wildcards in their names.
1755 1.1 cgd */
1756 1.201 rillig {
1757 1.201 rillig SuffListNode *ln, *nln;
1758 1.201 rillig for (ln = gn->children->first; ln != NULL; ln = nln) {
1759 1.201 rillig nln = ln->next;
1760 1.201 rillig SuffExpandChildren(ln, gn);
1761 1.201 rillig }
1762 1.73 joerg }
1763 1.73 joerg
1764 1.73 joerg if (targ == NULL) {
1765 1.140 rillig SUFF_DEBUG1("\tNo valid suffix on %s\n", gn->name);
1766 1.73 joerg
1767 1.73 joerg sfnd_abort:
1768 1.205 rillig SuffFindNormalDepsPath(gn, targ);
1769 1.73 joerg goto sfnd_return;
1770 1.1 cgd }
1771 1.1 cgd
1772 1.1 cgd /*
1773 1.73 joerg * If the suffix indicates that the target is a library, mark that in
1774 1.73 joerg * the node's type field.
1775 1.1 cgd */
1776 1.236 rillig if (targ->suff->flags & SUFF_LIBRARY)
1777 1.73 joerg gn->type |= OP_LIB;
1778 1.1 cgd
1779 1.73 joerg /*
1780 1.73 joerg * Check for overriding transformation rule implied by sources
1781 1.73 joerg */
1782 1.125 rillig if (!Lst_IsEmpty(gn->children)) {
1783 1.73 joerg src = SuffFindCmds(targ, slst);
1784 1.1 cgd
1785 1.73 joerg if (src != NULL) {
1786 1.73 joerg /*
1787 1.73 joerg * Free up all the Src structures in the transformation path
1788 1.73 joerg * up to, but not including, the parent node.
1789 1.73 joerg */
1790 1.239 rillig while (bottom != NULL && bottom->parent != NULL) {
1791 1.240 rillig if (Lst_FindDatum(slst, bottom) == NULL)
1792 1.125 rillig Lst_Append(slst, bottom);
1793 1.73 joerg bottom = bottom->parent;
1794 1.1 cgd }
1795 1.73 joerg bottom = src;
1796 1.1 cgd }
1797 1.73 joerg }
1798 1.1 cgd
1799 1.73 joerg if (bottom == NULL) {
1800 1.73 joerg /*
1801 1.73 joerg * No idea from where it can come -- return now.
1802 1.73 joerg */
1803 1.73 joerg goto sfnd_abort;
1804 1.73 joerg }
1805 1.73 joerg
1806 1.73 joerg /*
1807 1.73 joerg * We now have a list of Src structures headed by 'bottom' and linked via
1808 1.73 joerg * their 'parent' pointers. What we do next is create links between
1809 1.73 joerg * source and target nodes (which may or may not have been created)
1810 1.73 joerg * and set the necessary local variables in each target. The
1811 1.73 joerg * commands for each target are set from the commands of the
1812 1.73 joerg * transformation rule used to get from the src suffix to the targ
1813 1.73 joerg * suffix. Note that this causes the commands list of the original
1814 1.73 joerg * node, gn, to be replaced by the commands of the final
1815 1.73 joerg * transformation rule. Also, the unmade field of gn is incremented.
1816 1.73 joerg * Etc.
1817 1.73 joerg */
1818 1.240 rillig if (bottom->node == NULL)
1819 1.168 rillig bottom->node = Targ_GetNode(bottom->file);
1820 1.1 cgd
1821 1.73 joerg for (src = bottom; src->parent != NULL; src = src->parent) {
1822 1.73 joerg targ = src->parent;
1823 1.73 joerg
1824 1.259 rillig SuffReassign(&src->node->suffix, src->suff);
1825 1.73 joerg
1826 1.240 rillig if (targ->node == NULL)
1827 1.168 rillig targ->node = Targ_GetNode(targ->file);
1828 1.73 joerg
1829 1.73 joerg SuffApplyTransform(targ->node, src->node,
1830 1.73 joerg targ->suff, src->suff);
1831 1.73 joerg
1832 1.73 joerg if (targ->node != gn) {
1833 1.73 joerg /*
1834 1.73 joerg * Finish off the dependency-search process for any nodes
1835 1.73 joerg * between bottom and gn (no point in questing around the
1836 1.73 joerg * filesystem for their implicit source when it's already
1837 1.73 joerg * known). Note that the node can't have any sources that
1838 1.73 joerg * need expanding, since SuffFindThem will stop on an existing
1839 1.238 rillig * node, so all we need to do is set the standard variables.
1840 1.73 joerg */
1841 1.73 joerg targ->node->type |= OP_DEPS_FOUND;
1842 1.87 rillig Var_Set(PREFIX, targ->pref, targ->node);
1843 1.87 rillig Var_Set(TARGET, targ->node->name, targ->node);
1844 1.1 cgd }
1845 1.1 cgd }
1846 1.1 cgd
1847 1.259 rillig SuffReassign(&gn->suffix, src->suff);
1848 1.73 joerg
1849 1.73 joerg /*
1850 1.73 joerg * Nuke the transformation path and the Src structures left over in the
1851 1.73 joerg * two lists.
1852 1.73 joerg */
1853 1.73 joerg sfnd_return:
1854 1.242 rillig if (bottom != NULL && Lst_FindDatum(slst, bottom) == NULL)
1855 1.242 rillig Lst_Append(slst, bottom);
1856 1.1 cgd
1857 1.73 joerg while (SuffRemoveSrc(srcs) || SuffRemoveSrc(targs))
1858 1.73 joerg continue;
1859 1.1 cgd
1860 1.125 rillig Lst_MoveAll(slst, srcs);
1861 1.125 rillig Lst_MoveAll(slst, targs);
1862 1.1 cgd }
1863 1.13 christos
1864 1.13 christos
1865 1.238 rillig /* Find implicit sources for the target.
1866 1.1 cgd *
1867 1.134 rillig * Nodes are added to the graph below the passed-in node. The nodes are
1868 1.134 rillig * marked to have their IMPSRC variable filled in. The PREFIX variable is set
1869 1.134 rillig * for the given node and all its implied children.
1870 1.134 rillig *
1871 1.134 rillig * The path found by this target is the shortest path in the transformation
1872 1.134 rillig * graph, which may pass through non-existent targets, to an existing target.
1873 1.134 rillig * The search continues on all paths from the root suffix until a file is
1874 1.134 rillig * found. I.e. if there's a path .o -> .c -> .l -> .l,v from the root and the
1875 1.134 rillig * .l,v file exists but the .c and .l files don't, the search will branch out
1876 1.134 rillig * in all directions from .o and again from all the nodes on the next level
1877 1.134 rillig * until the .l,v node is encountered.
1878 1.1 cgd */
1879 1.1 cgd void
1880 1.73 joerg Suff_FindDeps(GNode *gn)
1881 1.6 jtc {
1882 1.13 christos
1883 1.73 joerg SuffFindDeps(gn, srclist);
1884 1.73 joerg while (SuffRemoveSrc(srclist))
1885 1.73 joerg continue;
1886 1.73 joerg }
1887 1.73 joerg
1888 1.73 joerg static void
1889 1.157 rillig SuffFindDeps(GNode *gn, SrcList *slst)
1890 1.73 joerg {
1891 1.127 rillig if (gn->type & OP_DEPS_FOUND)
1892 1.1 cgd return;
1893 1.127 rillig gn->type |= OP_DEPS_FOUND;
1894 1.127 rillig
1895 1.69 sjg /*
1896 1.69 sjg * Make sure we have these set, may get revised below.
1897 1.69 sjg */
1898 1.225 rillig Var_Set(TARGET, GNode_Path(gn), gn);
1899 1.87 rillig Var_Set(PREFIX, gn->name, gn);
1900 1.70 sjg
1901 1.140 rillig SUFF_DEBUG1("SuffFindDeps (%s)\n", gn->name);
1902 1.13 christos
1903 1.73 joerg if (gn->type & OP_ARCHV) {
1904 1.73 joerg SuffFindArchiveDeps(gn, slst);
1905 1.73 joerg } else if (gn->type & OP_LIB) {
1906 1.1 cgd /*
1907 1.1 cgd * If the node is a library, it is the arch module's job to find it
1908 1.1 cgd * and set the TARGET variable accordingly. We merely provide the
1909 1.1 cgd * search path, assuming all libraries end in ".a" (if the suffix
1910 1.1 cgd * hasn't been defined, there's nothing we can do for it, so we just
1911 1.1 cgd * set the TARGET variable to the node's name in order to give it a
1912 1.1 cgd * value).
1913 1.1 cgd */
1914 1.255 rillig Suff *suff = FindSuffByName(LIBSUFF);
1915 1.255 rillig if (suff != NULL) {
1916 1.259 rillig SuffReassign(&gn->suffix, suff);
1917 1.255 rillig Arch_FindLib(gn, suff->searchPath);
1918 1.73 joerg } else {
1919 1.259 rillig SuffUnassign(&gn->suffix);
1920 1.87 rillig Var_Set(TARGET, gn->name, gn);
1921 1.73 joerg }
1922 1.1 cgd /*
1923 1.1 cgd * Because a library (-lfoo) target doesn't follow the standard
1924 1.1 cgd * filesystem conventions, we don't set the regular variables for
1925 1.1 cgd * the thing. .PREFIX is simply made empty...
1926 1.1 cgd */
1927 1.87 rillig Var_Set(PREFIX, "", gn);
1928 1.73 joerg } else {
1929 1.73 joerg SuffFindNormalDeps(gn, slst);
1930 1.73 joerg }
1931 1.73 joerg }
1932 1.71 christos
1933 1.134 rillig /* Define which suffix is the null suffix.
1934 1.134 rillig *
1935 1.134 rillig * Need to handle the changing of the null suffix gracefully so the old
1936 1.134 rillig * transformation rules don't just go away.
1937 1.1 cgd *
1938 1.39 wiz * Input:
1939 1.73 joerg * name Name of null suffix
1940 1.1 cgd */
1941 1.1 cgd void
1942 1.167 rillig Suff_SetNull(const char *name)
1943 1.1 cgd {
1944 1.241 rillig Suff *suff = FindSuffByName(name);
1945 1.241 rillig if (suff == NULL) {
1946 1.166 rillig Parse_Error(PARSE_WARNING, "Desired null suffix %s not defined.",
1947 1.166 rillig name);
1948 1.166 rillig return;
1949 1.166 rillig }
1950 1.1 cgd
1951 1.240 rillig if (suffNull != NULL)
1952 1.177 rillig suffNull->flags &= ~(unsigned)SUFF_NULL;
1953 1.241 rillig suff->flags |= SUFF_NULL;
1954 1.166 rillig /*
1955 1.166 rillig * XXX: Here's where the transformation mangling would take place
1956 1.166 rillig */
1957 1.241 rillig suffNull = suff;
1958 1.1 cgd }
1959 1.1 cgd
1960 1.127 rillig /* Initialize the suffixes module. */
1961 1.1 cgd void
1962 1.39 wiz Suff_Init(void)
1963 1.1 cgd {
1964 1.73 joerg #ifdef CLEANUP
1965 1.180 rillig suffClean = Lst_New();
1966 1.180 rillig sufflist = Lst_New();
1967 1.73 joerg #endif
1968 1.180 rillig srclist = Lst_New();
1969 1.180 rillig transforms = Lst_New();
1970 1.1 cgd
1971 1.73 joerg /*
1972 1.73 joerg * Create null suffix for single-suffix rules (POSIX). The thing doesn't
1973 1.73 joerg * actually go on the suffix list or everyone will think that's its
1974 1.73 joerg * suffix.
1975 1.73 joerg */
1976 1.75 sjg Suff_ClearSuffixes();
1977 1.1 cgd }
1978 1.5 jtc
1979 1.5 jtc
1980 1.127 rillig /* Clean up the suffixes module. */
1981 1.6 jtc void
1982 1.39 wiz Suff_End(void)
1983 1.5 jtc {
1984 1.25 mycroft #ifdef CLEANUP
1985 1.125 rillig Lst_Destroy(sufflist, SuffFree);
1986 1.125 rillig Lst_Destroy(suffClean, SuffFree);
1987 1.249 rillig if (suffNull != NULL)
1988 1.73 joerg SuffFree(suffNull);
1989 1.125 rillig Lst_Free(srclist);
1990 1.125 rillig Lst_Free(transforms);
1991 1.25 mycroft #endif
1992 1.5 jtc }
1993 1.5 jtc
1994 1.1 cgd
1995 1.165 rillig static void
1996 1.191 rillig PrintSuffNames(const char *prefix, SuffList *suffs)
1997 1.6 jtc {
1998 1.191 rillig SuffListNode *ln;
1999 1.191 rillig
2000 1.191 rillig debug_printf("#\t%s: ", prefix);
2001 1.191 rillig for (ln = suffs->first; ln != NULL; ln = ln->next) {
2002 1.191 rillig Suff *suff = ln->datum;
2003 1.191 rillig debug_printf("%s ", suff->name);
2004 1.191 rillig }
2005 1.191 rillig debug_printf("\n");
2006 1.6 jtc }
2007 1.1 cgd
2008 1.165 rillig static void
2009 1.233 rillig PrintSuff(Suff *suff)
2010 1.1 cgd {
2011 1.233 rillig debug_printf("# \"%s\" (num %d, ref %d)",
2012 1.233 rillig suff->name, suff->sNum, suff->refCount);
2013 1.233 rillig if (suff->flags != 0) {
2014 1.122 rillig char flags_buf[SuffFlags_ToStringSize];
2015 1.122 rillig
2016 1.172 rillig debug_printf(" (%s)",
2017 1.172 rillig Enum_FlagsToString(flags_buf, sizeof flags_buf,
2018 1.233 rillig suff->flags, SuffFlags_ToStringSpecs));
2019 1.1 cgd }
2020 1.191 rillig debug_printf("\n");
2021 1.191 rillig
2022 1.233 rillig PrintSuffNames("To", suff->parents);
2023 1.233 rillig PrintSuffNames("From", suff->children);
2024 1.191 rillig
2025 1.172 rillig debug_printf("#\tSearch Path: ");
2026 1.233 rillig Dir_PrintPath(suff->searchPath);
2027 1.191 rillig debug_printf("\n");
2028 1.1 cgd }
2029 1.1 cgd
2030 1.165 rillig static void
2031 1.191 rillig PrintTransformation(GNode *t)
2032 1.1 cgd {
2033 1.172 rillig debug_printf("%-16s:", t->name);
2034 1.48 christos Targ_PrintType(t->type);
2035 1.191 rillig debug_printf("\n");
2036 1.151 rillig Targ_PrintCmds(t);
2037 1.191 rillig debug_printf("\n");
2038 1.1 cgd }
2039 1.1 cgd
2040 1.4 cgd void
2041 1.39 wiz Suff_PrintAll(void)
2042 1.1 cgd {
2043 1.172 rillig debug_printf("#*** Suffixes:\n");
2044 1.191 rillig {
2045 1.191 rillig SuffListNode *ln;
2046 1.191 rillig for (ln = sufflist->first; ln != NULL; ln = ln->next)
2047 1.191 rillig PrintSuff(ln->datum);
2048 1.191 rillig }
2049 1.1 cgd
2050 1.172 rillig debug_printf("#*** Transformations:\n");
2051 1.191 rillig {
2052 1.191 rillig GNodeListNode *ln;
2053 1.191 rillig for (ln = transforms->first; ln != NULL; ln = ln->next)
2054 1.191 rillig PrintTransformation(ln->datum);
2055 1.191 rillig }
2056 1.1 cgd }
2057