1 | /* Miscellaneous generic support functions for GNU Make.
|
---|
2 | Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
|
---|
3 | 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software
|
---|
4 | Foundation, Inc.
|
---|
5 | This file is part of GNU Make.
|
---|
6 |
|
---|
7 | GNU Make is free software; you can redistribute it and/or modify it under the
|
---|
8 | terms of the GNU General Public License as published by the Free Software
|
---|
9 | Foundation; either version 2, or (at your option) any later version.
|
---|
10 |
|
---|
11 | GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
|
---|
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
|
---|
13 | A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
---|
14 |
|
---|
15 | You should have received a copy of the GNU General Public License along with
|
---|
16 | GNU Make; see the file COPYING. If not, write to the Free Software
|
---|
17 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. */
|
---|
18 |
|
---|
19 | #include "make.h"
|
---|
20 | #include "dep.h"
|
---|
21 | #include "debug.h"
|
---|
22 | #ifdef CONFIG_WITH_VALUE_LENGTH
|
---|
23 | # include <assert.h>
|
---|
24 | #endif
|
---|
25 |
|
---|
26 | /* All bcopy calls in this file can be replaced by memcpy and save a tick or two. */
|
---|
27 | #ifdef CONFIG_WITH_OPTIMIZATION_HACKS
|
---|
28 | # undef bcopy
|
---|
29 | # if defined(__GNUC__) && defined(CONFIG_WITH_OPTIMIZATION_HACKS)
|
---|
30 | # define bcopy(src, dst, size) __builtin_memcpy ((dst), (src), (size))
|
---|
31 | # else
|
---|
32 | # define bcopy(src, dst, size) memcpy ((dst), (src), (size))
|
---|
33 | # endif
|
---|
34 | #endif
|
---|
35 |
|
---|
36 | /* Variadic functions. We go through contortions to allow proper function
|
---|
37 | prototypes for both ANSI and pre-ANSI C compilers, and also for those
|
---|
38 | which support stdarg.h vs. varargs.h, and finally those which have
|
---|
39 | vfprintf(), etc. and those who have _doprnt... or nothing.
|
---|
40 |
|
---|
41 | This fancy stuff all came from GNU fileutils, except for the VA_PRINTF and
|
---|
42 | VA_END macros used here since we have multiple print functions. */
|
---|
43 |
|
---|
44 | #if USE_VARIADIC
|
---|
45 | # if HAVE_STDARG_H
|
---|
46 | # include <stdarg.h>
|
---|
47 | # define VA_START(args, lastarg) va_start(args, lastarg)
|
---|
48 | # else
|
---|
49 | # include <varargs.h>
|
---|
50 | # define VA_START(args, lastarg) va_start(args)
|
---|
51 | # endif
|
---|
52 | # if HAVE_VPRINTF
|
---|
53 | # define VA_PRINTF(fp, lastarg, args) vfprintf((fp), (lastarg), (args))
|
---|
54 | # else
|
---|
55 | # define VA_PRINTF(fp, lastarg, args) _doprnt((lastarg), (args), (fp))
|
---|
56 | # endif
|
---|
57 | # define VA_END(args) va_end(args)
|
---|
58 | #else
|
---|
59 | /* We can't use any variadic interface! */
|
---|
60 | # define va_alist a1, a2, a3, a4, a5, a6, a7, a8
|
---|
61 | # define va_dcl char *a1, *a2, *a3, *a4, *a5, *a6, *a7, *a8;
|
---|
62 | # define VA_START(args, lastarg)
|
---|
63 | # define VA_PRINTF(fp, lastarg, args) fprintf((fp), (lastarg), va_alist)
|
---|
64 | # define VA_END(args)
|
---|
65 | #endif
|
---|
66 |
|
---|
67 |
|
---|
68 | /* Compare strings *S1 and *S2.
|
---|
69 | Return negative if the first is less, positive if it is greater,
|
---|
70 | zero if they are equal. */
|
---|
71 |
|
---|
72 | int
|
---|
73 | alpha_compare (const void *v1, const void *v2)
|
---|
74 | {
|
---|
75 | const char *s1 = *((char **)v1);
|
---|
76 | const char *s2 = *((char **)v2);
|
---|
77 |
|
---|
78 | if (*s1 != *s2)
|
---|
79 | return *s1 - *s2;
|
---|
80 | return strcmp (s1, s2);
|
---|
81 | }
|
---|
82 | |
---|
83 |
|
---|
84 | /* Discard each backslash-newline combination from LINE.
|
---|
85 | Backslash-backslash-newline combinations become backslash-newlines.
|
---|
86 | This is done by copying the text at LINE into itself. */
|
---|
87 |
|
---|
88 | #ifndef CONFIG_WITH_VALUE_LENGTH
|
---|
89 | void
|
---|
90 | collapse_continuations (char *line)
|
---|
91 | #else
|
---|
92 | char *
|
---|
93 | collapse_continuations (char *line, unsigned int linelen)
|
---|
94 | #endif
|
---|
95 | {
|
---|
96 | register char *in, *out, *p;
|
---|
97 | register int backslash;
|
---|
98 | register unsigned int bs_write;
|
---|
99 |
|
---|
100 | #ifndef CONFIG_WITH_VALUE_LENGTH
|
---|
101 | in = strchr (line, '\n');
|
---|
102 | if (in == 0)
|
---|
103 | return;
|
---|
104 | #else
|
---|
105 | assert (strlen (line) == linelen);
|
---|
106 | in = memchr (line, '\n', linelen);
|
---|
107 | if (in == 0)
|
---|
108 | return line + linelen;
|
---|
109 | #endif
|
---|
110 |
|
---|
111 | out = in;
|
---|
112 | while (out > line && out[-1] == '\\')
|
---|
113 | --out;
|
---|
114 |
|
---|
115 | while (*in != '\0')
|
---|
116 | {
|
---|
117 | /* BS_WRITE gets the number of quoted backslashes at
|
---|
118 | the end just before IN, and BACKSLASH gets nonzero
|
---|
119 | if the next character is quoted. */
|
---|
120 | backslash = 0;
|
---|
121 | bs_write = 0;
|
---|
122 | for (p = in - 1; p >= line && *p == '\\'; --p)
|
---|
123 | {
|
---|
124 | if (backslash)
|
---|
125 | ++bs_write;
|
---|
126 | backslash = !backslash;
|
---|
127 |
|
---|
128 | /* It should be impossible to go back this far without exiting,
|
---|
129 | but if we do, we can't get the right answer. */
|
---|
130 | if (in == out - 1)
|
---|
131 | abort ();
|
---|
132 | }
|
---|
133 |
|
---|
134 | /* Output the appropriate number of backslashes. */
|
---|
135 | while (bs_write-- > 0)
|
---|
136 | *out++ = '\\';
|
---|
137 |
|
---|
138 | /* Skip the newline. */
|
---|
139 | ++in;
|
---|
140 |
|
---|
141 | /* If the newline is quoted, discard following whitespace
|
---|
142 | and any preceding whitespace; leave just one space. */
|
---|
143 | if (backslash)
|
---|
144 | {
|
---|
145 | in = next_token (in);
|
---|
146 | while (out > line && isblank ((unsigned char)out[-1]))
|
---|
147 | --out;
|
---|
148 | *out++ = ' ';
|
---|
149 | }
|
---|
150 | else
|
---|
151 | /* If the newline isn't quoted, put it in the output. */
|
---|
152 | *out++ = '\n';
|
---|
153 |
|
---|
154 | /* Now copy the following line to the output.
|
---|
155 | Stop when we find backslashes followed by a newline. */
|
---|
156 | while (*in != '\0')
|
---|
157 | if (*in == '\\')
|
---|
158 | {
|
---|
159 | p = in + 1;
|
---|
160 | while (*p == '\\')
|
---|
161 | ++p;
|
---|
162 | if (*p == '\n')
|
---|
163 | {
|
---|
164 | in = p;
|
---|
165 | break;
|
---|
166 | }
|
---|
167 | while (in < p)
|
---|
168 | *out++ = *in++;
|
---|
169 | }
|
---|
170 | else
|
---|
171 | *out++ = *in++;
|
---|
172 | }
|
---|
173 |
|
---|
174 | *out = '\0';
|
---|
175 | #ifdef CONFIG_WITH_VALUE_LENGTH
|
---|
176 | assert (strchr (line, '\0') == out);
|
---|
177 | return out;
|
---|
178 | #endif
|
---|
179 | }
|
---|
180 | |
---|
181 |
|
---|
182 | /* Print N spaces (used in debug for target-depth). */
|
---|
183 |
|
---|
184 | void
|
---|
185 | print_spaces (unsigned int n)
|
---|
186 | {
|
---|
187 | while (n-- > 0)
|
---|
188 | putchar (' ');
|
---|
189 | }
|
---|
190 |
|
---|
191 | |
---|
192 |
|
---|
193 | /* Return a string whose contents concatenate those of s1, s2, s3.
|
---|
194 | This string lives in static, re-used memory. */
|
---|
195 |
|
---|
196 | char *
|
---|
197 | concat (const char *s1, const char *s2, const char *s3)
|
---|
198 | {
|
---|
199 | unsigned int len1, len2, len3;
|
---|
200 | static unsigned int rlen = 0;
|
---|
201 | static char *result = NULL;
|
---|
202 |
|
---|
203 | len1 = (s1 && *s1 != '\0') ? strlen (s1) : 0;
|
---|
204 | len2 = (s2 && *s2 != '\0') ? strlen (s2) : 0;
|
---|
205 | len3 = (s3 && *s3 != '\0') ? strlen (s3) : 0;
|
---|
206 |
|
---|
207 | if (len1 + len2 + len3 + 1 > rlen)
|
---|
208 | result = xrealloc (result, (rlen = len1 + len2 + len3 + 10));
|
---|
209 |
|
---|
210 | if (len1)
|
---|
211 | memcpy (result, s1, len1);
|
---|
212 | if (len2)
|
---|
213 | memcpy (result + len1, s2, len2);
|
---|
214 | if (len3)
|
---|
215 | memcpy (result + len1 + len2, s3, len3);
|
---|
216 |
|
---|
217 | result[len1+len2+len3] = '\0';
|
---|
218 |
|
---|
219 | return result;
|
---|
220 | }
|
---|
221 | |
---|
222 |
|
---|
223 | /* Print a message on stdout. */
|
---|
224 |
|
---|
225 | void
|
---|
226 | #if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
|
---|
227 | message (int prefix, const char *fmt, ...)
|
---|
228 | #else
|
---|
229 | message (prefix, fmt, va_alist)
|
---|
230 | int prefix;
|
---|
231 | const char *fmt;
|
---|
232 | va_dcl
|
---|
233 | #endif
|
---|
234 | {
|
---|
235 | #if USE_VARIADIC
|
---|
236 | va_list args;
|
---|
237 | #endif
|
---|
238 |
|
---|
239 | log_working_directory (1);
|
---|
240 |
|
---|
241 | if (fmt != 0)
|
---|
242 | {
|
---|
243 | if (prefix)
|
---|
244 | {
|
---|
245 | if (makelevel == 0)
|
---|
246 | printf ("%s: ", program);
|
---|
247 | else
|
---|
248 | printf ("%s[%u]: ", program, makelevel);
|
---|
249 | }
|
---|
250 | VA_START (args, fmt);
|
---|
251 | VA_PRINTF (stdout, fmt, args);
|
---|
252 | VA_END (args);
|
---|
253 | putchar ('\n');
|
---|
254 | }
|
---|
255 |
|
---|
256 | fflush (stdout);
|
---|
257 | }
|
---|
258 |
|
---|
259 | /* Print an error message. */
|
---|
260 |
|
---|
261 | void
|
---|
262 | #if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
|
---|
263 | error (const struct floc *flocp, const char *fmt, ...)
|
---|
264 | #else
|
---|
265 | error (flocp, fmt, va_alist)
|
---|
266 | const struct floc *flocp;
|
---|
267 | const char *fmt;
|
---|
268 | va_dcl
|
---|
269 | #endif
|
---|
270 | {
|
---|
271 | #if USE_VARIADIC
|
---|
272 | va_list args;
|
---|
273 | #endif
|
---|
274 |
|
---|
275 | log_working_directory (1);
|
---|
276 |
|
---|
277 | if (flocp && flocp->filenm)
|
---|
278 | fprintf (stderr, "%s:%lu: ", flocp->filenm, flocp->lineno);
|
---|
279 | else if (makelevel == 0)
|
---|
280 | fprintf (stderr, "%s: ", program);
|
---|
281 | else
|
---|
282 | fprintf (stderr, "%s[%u]: ", program, makelevel);
|
---|
283 |
|
---|
284 | VA_START(args, fmt);
|
---|
285 | VA_PRINTF (stderr, fmt, args);
|
---|
286 | VA_END (args);
|
---|
287 |
|
---|
288 | putc ('\n', stderr);
|
---|
289 | fflush (stderr);
|
---|
290 | }
|
---|
291 |
|
---|
292 | /* Print an error message and exit. */
|
---|
293 |
|
---|
294 | void
|
---|
295 | #if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
|
---|
296 | fatal (const struct floc *flocp, const char *fmt, ...)
|
---|
297 | #else
|
---|
298 | fatal (flocp, fmt, va_alist)
|
---|
299 | const struct floc *flocp;
|
---|
300 | const char *fmt;
|
---|
301 | va_dcl
|
---|
302 | #endif
|
---|
303 | {
|
---|
304 | #if USE_VARIADIC
|
---|
305 | va_list args;
|
---|
306 | #endif
|
---|
307 |
|
---|
308 | log_working_directory (1);
|
---|
309 |
|
---|
310 | if (flocp && flocp->filenm)
|
---|
311 | fprintf (stderr, "%s:%lu: *** ", flocp->filenm, flocp->lineno);
|
---|
312 | else if (makelevel == 0)
|
---|
313 | fprintf (stderr, "%s: *** ", program);
|
---|
314 | else
|
---|
315 | fprintf (stderr, "%s[%u]: *** ", program, makelevel);
|
---|
316 |
|
---|
317 | VA_START(args, fmt);
|
---|
318 | VA_PRINTF (stderr, fmt, args);
|
---|
319 | VA_END (args);
|
---|
320 |
|
---|
321 | fputs (_(". Stop.\n"), stderr);
|
---|
322 |
|
---|
323 | die (2);
|
---|
324 | }
|
---|
325 |
|
---|
326 | #ifndef HAVE_STRERROR
|
---|
327 |
|
---|
328 | #undef strerror
|
---|
329 |
|
---|
330 | char *
|
---|
331 | strerror (int errnum)
|
---|
332 | {
|
---|
333 | extern int errno, sys_nerr;
|
---|
334 | #ifndef __DECC
|
---|
335 | extern char *sys_errlist[];
|
---|
336 | #endif
|
---|
337 | static char buf[] = "Unknown error 12345678901234567890";
|
---|
338 |
|
---|
339 | if (errno < sys_nerr)
|
---|
340 | return sys_errlist[errnum];
|
---|
341 |
|
---|
342 | sprintf (buf, _("Unknown error %d"), errnum);
|
---|
343 | return buf;
|
---|
344 | }
|
---|
345 | #endif
|
---|
346 |
|
---|
347 | /* Print an error message from errno. */
|
---|
348 |
|
---|
349 | void
|
---|
350 | perror_with_name (const char *str, const char *name)
|
---|
351 | {
|
---|
352 | error (NILF, _("%s%s: %s"), str, name, strerror (errno));
|
---|
353 | }
|
---|
354 |
|
---|
355 | /* Print an error message from errno and exit. */
|
---|
356 |
|
---|
357 | void
|
---|
358 | pfatal_with_name (const char *name)
|
---|
359 | {
|
---|
360 | fatal (NILF, _("%s: %s"), name, strerror (errno));
|
---|
361 |
|
---|
362 | /* NOTREACHED */
|
---|
363 | }
|
---|
364 | |
---|
365 |
|
---|
366 | /* Like malloc but get fatal error if memory is exhausted. */
|
---|
367 | /* Don't bother if we're using dmalloc; it provides these for us. */
|
---|
368 |
|
---|
369 | #if !defined(HAVE_DMALLOC_H) && !defined(ELECTRIC_HEAP) /* bird */
|
---|
370 |
|
---|
371 | #undef xmalloc
|
---|
372 | #undef xrealloc
|
---|
373 | #undef xstrdup
|
---|
374 |
|
---|
375 | void *
|
---|
376 | xmalloc (unsigned int size)
|
---|
377 | {
|
---|
378 | /* Make sure we don't allocate 0, for pre-ANSI libraries. */
|
---|
379 | void *result = malloc (size ? size : 1);
|
---|
380 | if (result == 0)
|
---|
381 | fatal (NILF, _("virtual memory exhausted"));
|
---|
382 | #ifdef CONFIG_WITH_MAKE_STATS
|
---|
383 | make_stats_allocations++;
|
---|
384 | if (make_expensive_statistics)
|
---|
385 | {
|
---|
386 | unsigned int actual_size = SIZE_OF_HEAP_BLOCK (result);
|
---|
387 | make_stats_allocated += actual_size;
|
---|
388 | make_stats_allocated_sum += actual_size;
|
---|
389 | }
|
---|
390 | #endif
|
---|
391 | return result;
|
---|
392 | }
|
---|
393 |
|
---|
394 |
|
---|
395 | void *
|
---|
396 | xrealloc (void *ptr, unsigned int size)
|
---|
397 | {
|
---|
398 | void *result;
|
---|
399 | #ifdef CONFIG_WITH_MAKE_STATS
|
---|
400 | if (make_expensive_statistics && ptr != NULL)
|
---|
401 | {
|
---|
402 | unsigned int actual_size = SIZE_OF_HEAP_BLOCK (ptr);
|
---|
403 | make_stats_allocated -= actual_size;
|
---|
404 | make_stats_allocated_sum -= actual_size;
|
---|
405 | }
|
---|
406 | #endif
|
---|
407 |
|
---|
408 | /* Some older implementations of realloc() don't conform to ANSI. */
|
---|
409 | if (! size)
|
---|
410 | size = 1;
|
---|
411 | result = ptr ? realloc (ptr, size) : malloc (size);
|
---|
412 | if (result == 0)
|
---|
413 | fatal (NILF, _("virtual memory exhausted"));
|
---|
414 | #ifdef CONFIG_WITH_MAKE_STATS
|
---|
415 | if (!ptr)
|
---|
416 | make_stats_allocations++;
|
---|
417 | if (make_expensive_statistics)
|
---|
418 | {
|
---|
419 | unsigned int actual_size = SIZE_OF_HEAP_BLOCK (result);
|
---|
420 | make_stats_allocated += actual_size;
|
---|
421 | make_stats_allocated_sum += actual_size;
|
---|
422 | }
|
---|
423 | #endif
|
---|
424 | return result;
|
---|
425 | }
|
---|
426 |
|
---|
427 |
|
---|
428 | char *
|
---|
429 | xstrdup (const char *ptr)
|
---|
430 | {
|
---|
431 | char *result;
|
---|
432 |
|
---|
433 | #ifdef HAVE_STRDUP
|
---|
434 | result = strdup (ptr);
|
---|
435 | #else
|
---|
436 | result = malloc (strlen (ptr) + 1);
|
---|
437 | #endif
|
---|
438 |
|
---|
439 | if (result == 0)
|
---|
440 | fatal (NILF, _("virtual memory exhausted"));
|
---|
441 |
|
---|
442 | #ifdef CONFIG_WITH_MAKE_STATS
|
---|
443 | make_stats_allocations++;
|
---|
444 | if (make_expensive_statistics)
|
---|
445 | {
|
---|
446 | unsigned int actual_size = SIZE_OF_HEAP_BLOCK (result);
|
---|
447 | make_stats_allocated += actual_size;
|
---|
448 | make_stats_allocated_sum += actual_size;
|
---|
449 | }
|
---|
450 | #endif
|
---|
451 | #ifdef HAVE_STRDUP
|
---|
452 | return result;
|
---|
453 | #else
|
---|
454 | return strcpy (result, ptr);
|
---|
455 | #endif
|
---|
456 | }
|
---|
457 |
|
---|
458 | #endif /* HAVE_DMALLOC_H */
|
---|
459 |
|
---|
460 | char *
|
---|
461 | savestring (const char *str, unsigned int length)
|
---|
462 | {
|
---|
463 | char *out = xmalloc (length + 1);
|
---|
464 | if (length > 0)
|
---|
465 | memcpy (out, str, length);
|
---|
466 | out[length] = '\0';
|
---|
467 | return out;
|
---|
468 | }
|
---|
469 | |
---|
470 |
|
---|
471 |
|
---|
472 | #ifndef CONFIG_WITH_OPTIMIZATION_HACKS /* This is really a reimplemntation of
|
---|
473 | memchr, only slower. It's been replaced by a macro in the header file. */
|
---|
474 |
|
---|
475 | /* Limited INDEX:
|
---|
476 | Search through the string STRING, which ends at LIMIT, for the character C.
|
---|
477 | Returns a pointer to the first occurrence, or nil if none is found.
|
---|
478 | Like INDEX except that the string searched ends where specified
|
---|
479 | instead of at the first null. */
|
---|
480 |
|
---|
481 | char *
|
---|
482 | lindex (const char *s, const char *limit, int c)
|
---|
483 | {
|
---|
484 | while (s < limit)
|
---|
485 | if (*s++ == c)
|
---|
486 | return (char *)(s - 1);
|
---|
487 |
|
---|
488 | return 0;
|
---|
489 | }
|
---|
490 | #endif /* CONFIG_WITH_OPTIMIZATION_HACKS */
|
---|
491 | |
---|
492 |
|
---|
493 | /* Return the address of the first whitespace or null in the string S. */
|
---|
494 |
|
---|
495 | char *
|
---|
496 | end_of_token (const char *s)
|
---|
497 | {
|
---|
498 | #ifdef KMK
|
---|
499 | for (;;)
|
---|
500 | {
|
---|
501 | unsigned char ch0, ch1, ch2, ch3;
|
---|
502 |
|
---|
503 | ch0 = *s;
|
---|
504 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch0)))
|
---|
505 | return (char *)s;
|
---|
506 | ch1 = s[1];
|
---|
507 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch1)))
|
---|
508 | return (char *)s + 1;
|
---|
509 | ch2 = s[2];
|
---|
510 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch2)))
|
---|
511 | return (char *)s + 2;
|
---|
512 | ch3 = s[3];
|
---|
513 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch3)))
|
---|
514 | return (char *)s + 3;
|
---|
515 |
|
---|
516 | s += 4;
|
---|
517 | }
|
---|
518 |
|
---|
519 | #else
|
---|
520 | while (*s != '\0' && !isblank ((unsigned char)*s))
|
---|
521 | ++s;
|
---|
522 | return (char *)s;
|
---|
523 | #endif
|
---|
524 | }
|
---|
525 |
|
---|
526 | #ifdef WINDOWS32
|
---|
527 | /*
|
---|
528 | * Same as end_of_token, but take into account a stop character
|
---|
529 | */
|
---|
530 | char *
|
---|
531 | end_of_token_w32 (const char *s, char stopchar)
|
---|
532 | {
|
---|
533 | const char *p = s;
|
---|
534 | int backslash = 0;
|
---|
535 |
|
---|
536 | while (*p != '\0' && *p != stopchar
|
---|
537 | && (backslash || !isblank ((unsigned char)*p)))
|
---|
538 | {
|
---|
539 | if (*p++ == '\\')
|
---|
540 | {
|
---|
541 | backslash = !backslash;
|
---|
542 | while (*p == '\\')
|
---|
543 | {
|
---|
544 | backslash = !backslash;
|
---|
545 | ++p;
|
---|
546 | }
|
---|
547 | }
|
---|
548 | else
|
---|
549 | backslash = 0;
|
---|
550 | }
|
---|
551 |
|
---|
552 | return (char *)p;
|
---|
553 | }
|
---|
554 | #endif
|
---|
555 |
|
---|
556 | /* Return the address of the first nonwhitespace or null in the string S. */
|
---|
557 |
|
---|
558 | char *
|
---|
559 | next_token (const char *s)
|
---|
560 | {
|
---|
561 | #ifdef KMK
|
---|
562 | for (;;)
|
---|
563 | {
|
---|
564 | unsigned char ch0, ch1, ch2, ch3;
|
---|
565 |
|
---|
566 | ch0 = *s;
|
---|
567 | if (MY_PREDICT_FALSE(!MY_IS_BLANK(ch0)))
|
---|
568 | return (char *)s;
|
---|
569 | ch1 = s[1];
|
---|
570 | if (MY_PREDICT_TRUE(!MY_IS_BLANK(ch1)))
|
---|
571 | return (char *)s + 1;
|
---|
572 | ch2 = s[2];
|
---|
573 | if (MY_PREDICT_FALSE(!MY_IS_BLANK(ch2)))
|
---|
574 | return (char *)s + 2;
|
---|
575 | ch3 = s[3];
|
---|
576 | if (MY_PREDICT_TRUE(!MY_IS_BLANK(ch3)))
|
---|
577 | return (char *)s + 3;
|
---|
578 |
|
---|
579 | s += 4;
|
---|
580 | }
|
---|
581 |
|
---|
582 | #else /* !KMK */
|
---|
583 | while (isblank ((unsigned char)*s))
|
---|
584 | ++s;
|
---|
585 | return (char *)s;
|
---|
586 | #endif /* !KMK */
|
---|
587 | }
|
---|
588 |
|
---|
589 | /* Find the next token in PTR; return the address of it, and store the length
|
---|
590 | of the token into *LENGTHPTR if LENGTHPTR is not nil. Set *PTR to the end
|
---|
591 | of the token, so this function can be called repeatedly in a loop. */
|
---|
592 |
|
---|
593 | char *
|
---|
594 | find_next_token (const char **ptr, unsigned int *lengthptr)
|
---|
595 | {
|
---|
596 | #ifdef KMK
|
---|
597 | const char *p = *ptr;
|
---|
598 | const char *e;
|
---|
599 |
|
---|
600 | /* skip blanks */
|
---|
601 | # if 0 /* a moderate version */
|
---|
602 | for (;; p++)
|
---|
603 | {
|
---|
604 | unsigned char ch = *p;
|
---|
605 | if (!MY_IS_BLANK(ch))
|
---|
606 | {
|
---|
607 | if (!ch)
|
---|
608 | return NULL;
|
---|
609 | break;
|
---|
610 | }
|
---|
611 | }
|
---|
612 |
|
---|
613 | # else /* (too) big unroll */
|
---|
614 | for (;; p += 4)
|
---|
615 | {
|
---|
616 | unsigned char ch0, ch1, ch2, ch3;
|
---|
617 |
|
---|
618 | ch0 = *p;
|
---|
619 | if (MY_PREDICT_FALSE(!MY_IS_BLANK(ch0)))
|
---|
620 | {
|
---|
621 | if (!ch0)
|
---|
622 | return NULL;
|
---|
623 | break;
|
---|
624 | }
|
---|
625 | ch1 = p[1];
|
---|
626 | if (MY_PREDICT_TRUE(!MY_IS_BLANK(ch1)))
|
---|
627 | {
|
---|
628 | if (!ch1)
|
---|
629 | return NULL;
|
---|
630 | p += 1;
|
---|
631 | break;
|
---|
632 | }
|
---|
633 | ch2 = p[2];
|
---|
634 | if (MY_PREDICT_FALSE(!MY_IS_BLANK(ch2)))
|
---|
635 | {
|
---|
636 | if (!ch2)
|
---|
637 | return NULL;
|
---|
638 | p += 2;
|
---|
639 | break;
|
---|
640 | }
|
---|
641 | ch3 = p[3];
|
---|
642 | if (MY_PREDICT_TRUE(!MY_IS_BLANK(ch3)))
|
---|
643 | {
|
---|
644 | if (!ch3)
|
---|
645 | return NULL;
|
---|
646 | p += 3;
|
---|
647 | break;
|
---|
648 | }
|
---|
649 | }
|
---|
650 | # endif
|
---|
651 |
|
---|
652 | /* skip ahead until EOS or blanks. */
|
---|
653 | # if 0 /* a moderate version */
|
---|
654 | for (e = p + 1; ; e++)
|
---|
655 | {
|
---|
656 | unsigned char ch = *e;
|
---|
657 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch)))
|
---|
658 | break;
|
---|
659 | }
|
---|
660 | # else /* (too) big unroll */
|
---|
661 | for (e = p + 1; ; e += 4)
|
---|
662 | {
|
---|
663 | unsigned char ch0, ch1, ch2, ch3;
|
---|
664 |
|
---|
665 | ch0 = *e;
|
---|
666 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch0)))
|
---|
667 | break;
|
---|
668 | ch1 = e[1];
|
---|
669 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch1)))
|
---|
670 | {
|
---|
671 | e += 1;
|
---|
672 | break;
|
---|
673 | }
|
---|
674 | ch2 = e[2];
|
---|
675 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch2)))
|
---|
676 | {
|
---|
677 | e += 2;
|
---|
678 | break;
|
---|
679 | }
|
---|
680 | ch3 = e[3];
|
---|
681 | if (MY_PREDICT_FALSE(MY_IS_BLANK_OR_EOS(ch3)))
|
---|
682 | {
|
---|
683 | e += 3;
|
---|
684 | break;
|
---|
685 | }
|
---|
686 | }
|
---|
687 | # endif
|
---|
688 | *ptr = e;
|
---|
689 |
|
---|
690 | if (lengthptr != 0)
|
---|
691 | *lengthptr = e - p;
|
---|
692 |
|
---|
693 | return (char *)p;
|
---|
694 |
|
---|
695 | #else
|
---|
696 | const char *p = next_token (*ptr);
|
---|
697 |
|
---|
698 | if (*p == '\0')
|
---|
699 | return 0;
|
---|
700 |
|
---|
701 | *ptr = end_of_token (p);
|
---|
702 | if (lengthptr != 0)
|
---|
703 | *lengthptr = *ptr - p;
|
---|
704 |
|
---|
705 | return (char *)p;
|
---|
706 | #endif
|
---|
707 | }
|
---|
708 | |
---|
709 |
|
---|
710 |
|
---|
711 | /* Allocate a new `struct dep' with all fields initialized to 0. */
|
---|
712 |
|
---|
713 | struct dep *
|
---|
714 | alloc_dep ()
|
---|
715 | {
|
---|
716 | struct dep *d = xmalloc (sizeof (struct dep));
|
---|
717 | memset (d, '\0', sizeof (struct dep));
|
---|
718 | return d;
|
---|
719 | }
|
---|
720 |
|
---|
721 |
|
---|
722 | /* Free `struct dep' along with `name' and `stem'. */
|
---|
723 |
|
---|
724 | void
|
---|
725 | free_dep (struct dep *d)
|
---|
726 | {
|
---|
727 | free (d);
|
---|
728 | }
|
---|
729 |
|
---|
730 | /* Copy a chain of `struct dep', making a new chain
|
---|
731 | with the same contents as the old one. */
|
---|
732 |
|
---|
733 | struct dep *
|
---|
734 | copy_dep_chain (const struct dep *d)
|
---|
735 | {
|
---|
736 | struct dep *firstnew = 0;
|
---|
737 | struct dep *lastnew = 0;
|
---|
738 |
|
---|
739 | while (d != 0)
|
---|
740 | {
|
---|
741 | struct dep *c = xmalloc (sizeof (struct dep));
|
---|
742 | memcpy (c, d, sizeof (struct dep));
|
---|
743 |
|
---|
744 | c->next = 0;
|
---|
745 | if (firstnew == 0)
|
---|
746 | firstnew = lastnew = c;
|
---|
747 | else
|
---|
748 | lastnew = lastnew->next = c;
|
---|
749 |
|
---|
750 | d = d->next;
|
---|
751 | }
|
---|
752 |
|
---|
753 | return firstnew;
|
---|
754 | }
|
---|
755 |
|
---|
756 | /* Free a chain of 'struct dep'. */
|
---|
757 |
|
---|
758 | void
|
---|
759 | free_dep_chain (struct dep *d)
|
---|
760 | {
|
---|
761 | while (d != 0)
|
---|
762 | {
|
---|
763 | struct dep *df = d;
|
---|
764 | d = d->next;
|
---|
765 | free_dep (df);
|
---|
766 | }
|
---|
767 | }
|
---|
768 |
|
---|
769 | /* Free a chain of struct nameseq.
|
---|
770 | For struct dep chains use free_dep_chain. */
|
---|
771 |
|
---|
772 | void
|
---|
773 | free_ns_chain (struct nameseq *ns)
|
---|
774 | {
|
---|
775 | while (ns != 0)
|
---|
776 | {
|
---|
777 | struct nameseq *t = ns;
|
---|
778 | ns = ns->next;
|
---|
779 | free (t);
|
---|
780 | }
|
---|
781 | }
|
---|
782 | |
---|
783 |
|
---|
784 |
|
---|
785 | #if !HAVE_STRCASECMP && !HAVE_STRICMP && !HAVE_STRCMPI
|
---|
786 |
|
---|
787 | /* If we don't have strcasecmp() (from POSIX), or anything that can substitute
|
---|
788 | for it, define our own version. */
|
---|
789 |
|
---|
790 | int
|
---|
791 | strcasecmp (const char *s1, const char *s2)
|
---|
792 | {
|
---|
793 | while (1)
|
---|
794 | {
|
---|
795 | int c1 = (int) *(s1++);
|
---|
796 | int c2 = (int) *(s2++);
|
---|
797 |
|
---|
798 | if (isalpha (c1))
|
---|
799 | c1 = tolower (c1);
|
---|
800 | if (isalpha (c2))
|
---|
801 | c2 = tolower (c2);
|
---|
802 |
|
---|
803 | if (c1 != '\0' && c1 == c2)
|
---|
804 | continue;
|
---|
805 |
|
---|
806 | return (c1 - c2);
|
---|
807 | }
|
---|
808 | }
|
---|
809 | #endif
|
---|
810 | |
---|
811 |
|
---|
812 | #ifdef GETLOADAVG_PRIVILEGED
|
---|
813 |
|
---|
814 | #ifdef POSIX
|
---|
815 |
|
---|
816 | /* Hopefully if a system says it's POSIX.1 and has the setuid and setgid
|
---|
817 | functions, they work as POSIX.1 says. Some systems (Alpha OSF/1 1.2,
|
---|
818 | for example) which claim to be POSIX.1 also have the BSD setreuid and
|
---|
819 | setregid functions, but they don't work as in BSD and only the POSIX.1
|
---|
820 | way works. */
|
---|
821 |
|
---|
822 | #undef HAVE_SETREUID
|
---|
823 | #undef HAVE_SETREGID
|
---|
824 |
|
---|
825 | #else /* Not POSIX. */
|
---|
826 |
|
---|
827 | /* Some POSIX.1 systems have the seteuid and setegid functions. In a
|
---|
828 | POSIX-like system, they are the best thing to use. However, some
|
---|
829 | non-POSIX systems have them too but they do not work in the POSIX style
|
---|
830 | and we must use setreuid and setregid instead. */
|
---|
831 |
|
---|
832 | #undef HAVE_SETEUID
|
---|
833 | #undef HAVE_SETEGID
|
---|
834 |
|
---|
835 | #endif /* POSIX. */
|
---|
836 |
|
---|
837 | #ifndef HAVE_UNISTD_H
|
---|
838 | extern int getuid (), getgid (), geteuid (), getegid ();
|
---|
839 | extern int setuid (), setgid ();
|
---|
840 | #ifdef HAVE_SETEUID
|
---|
841 | extern int seteuid ();
|
---|
842 | #else
|
---|
843 | #ifdef HAVE_SETREUID
|
---|
844 | extern int setreuid ();
|
---|
845 | #endif /* Have setreuid. */
|
---|
846 | #endif /* Have seteuid. */
|
---|
847 | #ifdef HAVE_SETEGID
|
---|
848 | extern int setegid ();
|
---|
849 | #else
|
---|
850 | #ifdef HAVE_SETREGID
|
---|
851 | extern int setregid ();
|
---|
852 | #endif /* Have setregid. */
|
---|
853 | #endif /* Have setegid. */
|
---|
854 | #endif /* No <unistd.h>. */
|
---|
855 |
|
---|
856 | /* Keep track of the user and group IDs for user- and make- access. */
|
---|
857 | static int user_uid = -1, user_gid = -1, make_uid = -1, make_gid = -1;
|
---|
858 | #define access_inited (user_uid != -1)
|
---|
859 | static enum { make, user } current_access;
|
---|
860 |
|
---|
861 |
|
---|
862 | /* Under -d, write a message describing the current IDs. */
|
---|
863 |
|
---|
864 | static void
|
---|
865 | log_access (const char *flavor)
|
---|
866 | {
|
---|
867 | if (! ISDB (DB_JOBS))
|
---|
868 | return;
|
---|
869 |
|
---|
870 | /* All the other debugging messages go to stdout,
|
---|
871 | but we write this one to stderr because it might be
|
---|
872 | run in a child fork whose stdout is piped. */
|
---|
873 |
|
---|
874 | fprintf (stderr, _("%s: user %lu (real %lu), group %lu (real %lu)\n"),
|
---|
875 | flavor, (unsigned long) geteuid (), (unsigned long) getuid (),
|
---|
876 | (unsigned long) getegid (), (unsigned long) getgid ());
|
---|
877 | fflush (stderr);
|
---|
878 | }
|
---|
879 |
|
---|
880 |
|
---|
881 | static void
|
---|
882 | init_access (void)
|
---|
883 | {
|
---|
884 | #ifndef VMS
|
---|
885 | user_uid = getuid ();
|
---|
886 | user_gid = getgid ();
|
---|
887 |
|
---|
888 | make_uid = geteuid ();
|
---|
889 | make_gid = getegid ();
|
---|
890 |
|
---|
891 | /* Do these ever fail? */
|
---|
892 | if (user_uid == -1 || user_gid == -1 || make_uid == -1 || make_gid == -1)
|
---|
893 | pfatal_with_name ("get{e}[gu]id");
|
---|
894 |
|
---|
895 | log_access (_("Initialized access"));
|
---|
896 |
|
---|
897 | current_access = make;
|
---|
898 | #endif
|
---|
899 | }
|
---|
900 |
|
---|
901 | #endif /* GETLOADAVG_PRIVILEGED */
|
---|
902 |
|
---|
903 | /* Give the process appropriate permissions for access to
|
---|
904 | user data (i.e., to stat files, or to spawn a child process). */
|
---|
905 | void
|
---|
906 | user_access (void)
|
---|
907 | {
|
---|
908 | #ifdef GETLOADAVG_PRIVILEGED
|
---|
909 |
|
---|
910 | if (!access_inited)
|
---|
911 | init_access ();
|
---|
912 |
|
---|
913 | if (current_access == user)
|
---|
914 | return;
|
---|
915 |
|
---|
916 | /* We are in "make access" mode. This means that the effective user and
|
---|
917 | group IDs are those of make (if it was installed setuid or setgid).
|
---|
918 | We now want to set the effective user and group IDs to the real IDs,
|
---|
919 | which are the IDs of the process that exec'd make. */
|
---|
920 |
|
---|
921 | #ifdef HAVE_SETEUID
|
---|
922 |
|
---|
923 | /* Modern systems have the seteuid/setegid calls which set only the
|
---|
924 | effective IDs, which is ideal. */
|
---|
925 |
|
---|
926 | if (seteuid (user_uid) < 0)
|
---|
927 | pfatal_with_name ("user_access: seteuid");
|
---|
928 |
|
---|
929 | #else /* Not HAVE_SETEUID. */
|
---|
930 |
|
---|
931 | #ifndef HAVE_SETREUID
|
---|
932 |
|
---|
933 | /* System V has only the setuid/setgid calls to set user/group IDs.
|
---|
934 | There is an effective ID, which can be set by setuid/setgid.
|
---|
935 | It can be set (unless you are root) only to either what it already is
|
---|
936 | (returned by geteuid/getegid, now in make_uid/make_gid),
|
---|
937 | the real ID (return by getuid/getgid, now in user_uid/user_gid),
|
---|
938 | or the saved set ID (what the effective ID was before this set-ID
|
---|
939 | executable (make) was exec'd). */
|
---|
940 |
|
---|
941 | if (setuid (user_uid) < 0)
|
---|
942 | pfatal_with_name ("user_access: setuid");
|
---|
943 |
|
---|
944 | #else /* HAVE_SETREUID. */
|
---|
945 |
|
---|
946 | /* In 4BSD, the setreuid/setregid calls set both the real and effective IDs.
|
---|
947 | They may be set to themselves or each other. So you have two alternatives
|
---|
948 | at any one time. If you use setuid/setgid, the effective will be set to
|
---|
949 | the real, leaving only one alternative. Using setreuid/setregid, however,
|
---|
950 | you can toggle between your two alternatives by swapping the values in a
|
---|
951 | single setreuid or setregid call. */
|
---|
952 |
|
---|
953 | if (setreuid (make_uid, user_uid) < 0)
|
---|
954 | pfatal_with_name ("user_access: setreuid");
|
---|
955 |
|
---|
956 | #endif /* Not HAVE_SETREUID. */
|
---|
957 | #endif /* HAVE_SETEUID. */
|
---|
958 |
|
---|
959 | #ifdef HAVE_SETEGID
|
---|
960 | if (setegid (user_gid) < 0)
|
---|
961 | pfatal_with_name ("user_access: setegid");
|
---|
962 | #else
|
---|
963 | #ifndef HAVE_SETREGID
|
---|
964 | if (setgid (user_gid) < 0)
|
---|
965 | pfatal_with_name ("user_access: setgid");
|
---|
966 | #else
|
---|
967 | if (setregid (make_gid, user_gid) < 0)
|
---|
968 | pfatal_with_name ("user_access: setregid");
|
---|
969 | #endif
|
---|
970 | #endif
|
---|
971 |
|
---|
972 | current_access = user;
|
---|
973 |
|
---|
974 | log_access (_("User access"));
|
---|
975 |
|
---|
976 | #endif /* GETLOADAVG_PRIVILEGED */
|
---|
977 | }
|
---|
978 |
|
---|
979 | /* Give the process appropriate permissions for access to
|
---|
980 | make data (i.e., the load average). */
|
---|
981 | void
|
---|
982 | make_access (void)
|
---|
983 | {
|
---|
984 | #ifdef GETLOADAVG_PRIVILEGED
|
---|
985 |
|
---|
986 | if (!access_inited)
|
---|
987 | init_access ();
|
---|
988 |
|
---|
989 | if (current_access == make)
|
---|
990 | return;
|
---|
991 |
|
---|
992 | /* See comments in user_access, above. */
|
---|
993 |
|
---|
994 | #ifdef HAVE_SETEUID
|
---|
995 | if (seteuid (make_uid) < 0)
|
---|
996 | pfatal_with_name ("make_access: seteuid");
|
---|
997 | #else
|
---|
998 | #ifndef HAVE_SETREUID
|
---|
999 | if (setuid (make_uid) < 0)
|
---|
1000 | pfatal_with_name ("make_access: setuid");
|
---|
1001 | #else
|
---|
1002 | if (setreuid (user_uid, make_uid) < 0)
|
---|
1003 | pfatal_with_name ("make_access: setreuid");
|
---|
1004 | #endif
|
---|
1005 | #endif
|
---|
1006 |
|
---|
1007 | #ifdef HAVE_SETEGID
|
---|
1008 | if (setegid (make_gid) < 0)
|
---|
1009 | pfatal_with_name ("make_access: setegid");
|
---|
1010 | #else
|
---|
1011 | #ifndef HAVE_SETREGID
|
---|
1012 | if (setgid (make_gid) < 0)
|
---|
1013 | pfatal_with_name ("make_access: setgid");
|
---|
1014 | #else
|
---|
1015 | if (setregid (user_gid, make_gid) < 0)
|
---|
1016 | pfatal_with_name ("make_access: setregid");
|
---|
1017 | #endif
|
---|
1018 | #endif
|
---|
1019 |
|
---|
1020 | current_access = make;
|
---|
1021 |
|
---|
1022 | log_access (_("Make access"));
|
---|
1023 |
|
---|
1024 | #endif /* GETLOADAVG_PRIVILEGED */
|
---|
1025 | }
|
---|
1026 |
|
---|
1027 | /* Give the process appropriate permissions for a child process.
|
---|
1028 | This is like user_access, but you can't get back to make_access. */
|
---|
1029 | void
|
---|
1030 | child_access (void)
|
---|
1031 | {
|
---|
1032 | #ifdef GETLOADAVG_PRIVILEGED
|
---|
1033 |
|
---|
1034 | if (!access_inited)
|
---|
1035 | abort ();
|
---|
1036 |
|
---|
1037 | /* Set both the real and effective UID and GID to the user's.
|
---|
1038 | They cannot be changed back to make's. */
|
---|
1039 |
|
---|
1040 | #ifndef HAVE_SETREUID
|
---|
1041 | if (setuid (user_uid) < 0)
|
---|
1042 | pfatal_with_name ("child_access: setuid");
|
---|
1043 | #else
|
---|
1044 | if (setreuid (user_uid, user_uid) < 0)
|
---|
1045 | pfatal_with_name ("child_access: setreuid");
|
---|
1046 | #endif
|
---|
1047 |
|
---|
1048 | #ifndef HAVE_SETREGID
|
---|
1049 | if (setgid (user_gid) < 0)
|
---|
1050 | pfatal_with_name ("child_access: setgid");
|
---|
1051 | #else
|
---|
1052 | if (setregid (user_gid, user_gid) < 0)
|
---|
1053 | pfatal_with_name ("child_access: setregid");
|
---|
1054 | #endif
|
---|
1055 |
|
---|
1056 | log_access (_("Child access"));
|
---|
1057 |
|
---|
1058 | #endif /* GETLOADAVG_PRIVILEGED */
|
---|
1059 | }
|
---|
1060 | |
---|
1061 |
|
---|
1062 | #ifdef NEED_GET_PATH_MAX
|
---|
1063 | unsigned int
|
---|
1064 | get_path_max (void)
|
---|
1065 | {
|
---|
1066 | static unsigned int value;
|
---|
1067 |
|
---|
1068 | if (value == 0)
|
---|
1069 | {
|
---|
1070 | long int x = pathconf ("/", _PC_PATH_MAX);
|
---|
1071 | if (x > 0)
|
---|
1072 | value = x;
|
---|
1073 | else
|
---|
1074 | return MAXPATHLEN;
|
---|
1075 | }
|
---|
1076 |
|
---|
1077 | return value;
|
---|
1078 | }
|
---|
1079 | #endif
|
---|
1080 | |
---|
1081 |
|
---|
1082 |
|
---|
1083 | /* This code is stolen from gnulib.
|
---|
1084 | If/when we abandon the requirement to work with K&R compilers, we can
|
---|
1085 | remove this (and perhaps other parts of GNU make!) and migrate to using
|
---|
1086 | gnulib directly.
|
---|
1087 |
|
---|
1088 | This is called only through atexit(), which means die() has already been
|
---|
1089 | invoked. So, call exit() here directly. Apparently that works...?
|
---|
1090 | */
|
---|
1091 |
|
---|
1092 | /* Close standard output, exiting with status 'exit_failure' on failure.
|
---|
1093 | If a program writes *anything* to stdout, that program should close
|
---|
1094 | stdout and make sure that it succeeds before exiting. Otherwise,
|
---|
1095 | suppose that you go to the extreme of checking the return status
|
---|
1096 | of every function that does an explicit write to stdout. The last
|
---|
1097 | printf can succeed in writing to the internal stream buffer, and yet
|
---|
1098 | the fclose(stdout) could still fail (due e.g., to a disk full error)
|
---|
1099 | when it tries to write out that buffered data. Thus, you would be
|
---|
1100 | left with an incomplete output file and the offending program would
|
---|
1101 | exit successfully. Even calling fflush is not always sufficient,
|
---|
1102 | since some file systems (NFS and CODA) buffer written/flushed data
|
---|
1103 | until an actual close call.
|
---|
1104 |
|
---|
1105 | Besides, it's wasteful to check the return value from every call
|
---|
1106 | that writes to stdout -- just let the internal stream state record
|
---|
1107 | the failure. That's what the ferror test is checking below.
|
---|
1108 |
|
---|
1109 | It's important to detect such failures and exit nonzero because many
|
---|
1110 | tools (most notably `make' and other build-management systems) depend
|
---|
1111 | on being able to detect failure in other tools via their exit status. */
|
---|
1112 |
|
---|
1113 | void
|
---|
1114 | close_stdout (void)
|
---|
1115 | {
|
---|
1116 | int prev_fail = ferror (stdout);
|
---|
1117 | int fclose_fail = fclose (stdout);
|
---|
1118 |
|
---|
1119 | if (prev_fail || fclose_fail)
|
---|
1120 | {
|
---|
1121 | if (fclose_fail)
|
---|
1122 | error (NILF, _("write error: %s"), strerror (errno));
|
---|
1123 | else
|
---|
1124 | error (NILF, _("write error"));
|
---|
1125 | exit (EXIT_FAILURE);
|
---|
1126 | }
|
---|
1127 | }
|
---|
1128 |
|
---|
1129 | #if defined(CONFIG_WITH_MAKE_STATS) && !defined(ELECTRIC_HEAP)
|
---|
1130 | #undef free
|
---|
1131 | void xfree(void *ptr)
|
---|
1132 | {
|
---|
1133 | if (ptr)
|
---|
1134 | {
|
---|
1135 | make_stats_allocations--;
|
---|
1136 | if (make_expensive_statistics)
|
---|
1137 | make_stats_allocated -= SIZE_OF_HEAP_BLOCK (ptr);
|
---|
1138 | free (ptr);
|
---|
1139 | }
|
---|
1140 | }
|
---|
1141 | #endif
|
---|
1142 |
|
---|