VirtualBox

source: kBuild/trunk/src/kmk/misc.c@ 1840

Last change on this file since 1840 was 1840, checked in by bird, 16 years ago

better? predictions can do bad stuff...

  • Property svn:eol-style set to native
File size: 24.5 KB
Line 
1/* Miscellaneous generic support functions for GNU Make.
2Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997,
31998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006 Free Software
4Foundation, Inc.
5This file is part of GNU Make.
6
7GNU Make is free software; you can redistribute it and/or modify it under the
8terms of the GNU General Public License as published by the Free Software
9Foundation; either version 2, or (at your option) any later version.
10
11GNU Make is distributed in the hope that it will be useful, but WITHOUT ANY
12WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
13A PARTICULAR PURPOSE. See the GNU General Public License for more details.
14
15You should have received a copy of the GNU General Public License along with
16GNU Make; see the file COPYING. If not, write to the Free Software
17Foundation, 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
72int
73alpha_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
89void
90collapse_continuations (char *line)
91#else
92char *
93collapse_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
184void
185print_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
196char *
197concat (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
225void
226#if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
227message (int prefix, const char *fmt, ...)
228#else
229message (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
261void
262#if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
263error (const struct floc *flocp, const char *fmt, ...)
264#else
265error (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
294void
295#if HAVE_ANSI_COMPILER && USE_VARIADIC && HAVE_STDARG_H
296fatal (const struct floc *flocp, const char *fmt, ...)
297#else
298fatal (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
330char *
331strerror (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
349void
350perror_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
357void
358pfatal_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
375void *
376xmalloc (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
395void *
396xrealloc (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
428char *
429xstrdup (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
460char *
461savestring (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
481char *
482lindex (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
495char *
496end_of_token (const char *s)
497{
498 while (*s != '\0' && !isblank ((unsigned char)*s))
499 ++s;
500 return (char *)s;
501}
502
503#ifdef WINDOWS32
504/*
505 * Same as end_of_token, but take into account a stop character
506 */
507char *
508end_of_token_w32 (const char *s, char stopchar)
509{
510 const char *p = s;
511 int backslash = 0;
512
513 while (*p != '\0' && *p != stopchar
514 && (backslash || !isblank ((unsigned char)*p)))
515 {
516 if (*p++ == '\\')
517 {
518 backslash = !backslash;
519 while (*p == '\\')
520 {
521 backslash = !backslash;
522 ++p;
523 }
524 }
525 else
526 backslash = 0;
527 }
528
529 return (char *)p;
530}
531#endif
532
533/* Return the address of the first nonwhitespace or null in the string S. */
534
535char *
536next_token (const char *s)
537{
538 while (isblank ((unsigned char)*s))
539 ++s;
540 return (char *)s;
541}
542
543/* Find the next token in PTR; return the address of it, and store the length
544 of the token into *LENGTHPTR if LENGTHPTR is not nil. Set *PTR to the end
545 of the token, so this function can be called repeatedly in a loop. */
546
547char *
548find_next_token (const char **ptr, unsigned int *lengthptr)
549{
550#ifdef KMK
551 const char *p = *ptr;
552 const char *e;
553
554 /* skip blanks */
555 for (;;)
556 {
557 unsigned char ch0, ch1, ch2, ch3;
558
559 ch0 = *p;
560 if (MY_PREDICT_FALSE(!isblank(ch0)))
561 {
562 if (!ch0)
563 return NULL;
564 break;
565 }
566 ch1 = p[1];
567 if (MY_PREDICT_FALSE(!isblank(ch1)))
568 {
569 if (!ch1)
570 return NULL;
571 p += 1;
572 break;
573 }
574 ch2 = p[2];
575 if (MY_PREDICT_FALSE(!isblank(ch2)))
576 {
577 if (!ch2)
578 return NULL;
579 p += 2;
580 break;
581 }
582 ch3 = p[3];
583 if (MY_PREDICT_TRUE(!isblank(ch3)))
584 {
585 if (!ch3)
586 return NULL;
587 p += 3;
588 break;
589 }
590 p += 4;
591 }
592
593 /* skip ahead until EOS or blanks. */
594 e = p + 1;
595 for (;;)
596 {
597 unsigned char ch0, ch1, ch2, ch3;
598
599 ch0 = *e;
600 if (MY_PREDICT_FALSE(isblank(ch0) || ch0 == '\0'))
601 break;
602 ch1 = e[1];
603 if (MY_PREDICT_FALSE(isblank(ch1) || ch1 == '\0'))
604 {
605 e += 1;
606 break;
607 }
608 ch2 = e[2];
609 if (MY_PREDICT_FALSE(isblank(ch2) || ch2 == '\0'))
610 {
611 e += 2;
612 break;
613 }
614 ch3 = e[3];
615 if (MY_PREDICT_FALSE(isblank(ch3) || ch3 == '\0'))
616 {
617 e += 3;
618 break;
619 }
620 e += 4;
621 }
622
623 *ptr = e;
624 if (lengthptr != 0)
625 *lengthptr = e - p;
626
627 return (char *)p;
628
629#else
630 const char *p = next_token (*ptr);
631
632 if (*p == '\0')
633 return 0;
634
635 *ptr = end_of_token (p);
636 if (lengthptr != 0)
637 *lengthptr = *ptr - p;
638
639 return (char *)p;
640#endif
641}
642
643
644
645/* Allocate a new `struct dep' with all fields initialized to 0. */
646
647struct dep *
648alloc_dep ()
649{
650 struct dep *d = xmalloc (sizeof (struct dep));
651 memset (d, '\0', sizeof (struct dep));
652 return d;
653}
654
655
656/* Free `struct dep' along with `name' and `stem'. */
657
658void
659free_dep (struct dep *d)
660{
661 free (d);
662}
663
664/* Copy a chain of `struct dep', making a new chain
665 with the same contents as the old one. */
666
667struct dep *
668copy_dep_chain (const struct dep *d)
669{
670 struct dep *firstnew = 0;
671 struct dep *lastnew = 0;
672
673 while (d != 0)
674 {
675 struct dep *c = xmalloc (sizeof (struct dep));
676 memcpy (c, d, sizeof (struct dep));
677
678 c->next = 0;
679 if (firstnew == 0)
680 firstnew = lastnew = c;
681 else
682 lastnew = lastnew->next = c;
683
684 d = d->next;
685 }
686
687 return firstnew;
688}
689
690/* Free a chain of 'struct dep'. */
691
692void
693free_dep_chain (struct dep *d)
694{
695 while (d != 0)
696 {
697 struct dep *df = d;
698 d = d->next;
699 free_dep (df);
700 }
701}
702
703/* Free a chain of struct nameseq.
704 For struct dep chains use free_dep_chain. */
705
706void
707free_ns_chain (struct nameseq *ns)
708{
709 while (ns != 0)
710 {
711 struct nameseq *t = ns;
712 ns = ns->next;
713 free (t);
714 }
715}
716
717
718
719#if !HAVE_STRCASECMP && !HAVE_STRICMP && !HAVE_STRCMPI
720
721/* If we don't have strcasecmp() (from POSIX), or anything that can substitute
722 for it, define our own version. */
723
724int
725strcasecmp (const char *s1, const char *s2)
726{
727 while (1)
728 {
729 int c1 = (int) *(s1++);
730 int c2 = (int) *(s2++);
731
732 if (isalpha (c1))
733 c1 = tolower (c1);
734 if (isalpha (c2))
735 c2 = tolower (c2);
736
737 if (c1 != '\0' && c1 == c2)
738 continue;
739
740 return (c1 - c2);
741 }
742}
743#endif
744
745
746#ifdef GETLOADAVG_PRIVILEGED
747
748#ifdef POSIX
749
750/* Hopefully if a system says it's POSIX.1 and has the setuid and setgid
751 functions, they work as POSIX.1 says. Some systems (Alpha OSF/1 1.2,
752 for example) which claim to be POSIX.1 also have the BSD setreuid and
753 setregid functions, but they don't work as in BSD and only the POSIX.1
754 way works. */
755
756#undef HAVE_SETREUID
757#undef HAVE_SETREGID
758
759#else /* Not POSIX. */
760
761/* Some POSIX.1 systems have the seteuid and setegid functions. In a
762 POSIX-like system, they are the best thing to use. However, some
763 non-POSIX systems have them too but they do not work in the POSIX style
764 and we must use setreuid and setregid instead. */
765
766#undef HAVE_SETEUID
767#undef HAVE_SETEGID
768
769#endif /* POSIX. */
770
771#ifndef HAVE_UNISTD_H
772extern int getuid (), getgid (), geteuid (), getegid ();
773extern int setuid (), setgid ();
774#ifdef HAVE_SETEUID
775extern int seteuid ();
776#else
777#ifdef HAVE_SETREUID
778extern int setreuid ();
779#endif /* Have setreuid. */
780#endif /* Have seteuid. */
781#ifdef HAVE_SETEGID
782extern int setegid ();
783#else
784#ifdef HAVE_SETREGID
785extern int setregid ();
786#endif /* Have setregid. */
787#endif /* Have setegid. */
788#endif /* No <unistd.h>. */
789
790/* Keep track of the user and group IDs for user- and make- access. */
791static int user_uid = -1, user_gid = -1, make_uid = -1, make_gid = -1;
792#define access_inited (user_uid != -1)
793static enum { make, user } current_access;
794
795
796/* Under -d, write a message describing the current IDs. */
797
798static void
799log_access (const char *flavor)
800{
801 if (! ISDB (DB_JOBS))
802 return;
803
804 /* All the other debugging messages go to stdout,
805 but we write this one to stderr because it might be
806 run in a child fork whose stdout is piped. */
807
808 fprintf (stderr, _("%s: user %lu (real %lu), group %lu (real %lu)\n"),
809 flavor, (unsigned long) geteuid (), (unsigned long) getuid (),
810 (unsigned long) getegid (), (unsigned long) getgid ());
811 fflush (stderr);
812}
813
814
815static void
816init_access (void)
817{
818#ifndef VMS
819 user_uid = getuid ();
820 user_gid = getgid ();
821
822 make_uid = geteuid ();
823 make_gid = getegid ();
824
825 /* Do these ever fail? */
826 if (user_uid == -1 || user_gid == -1 || make_uid == -1 || make_gid == -1)
827 pfatal_with_name ("get{e}[gu]id");
828
829 log_access (_("Initialized access"));
830
831 current_access = make;
832#endif
833}
834
835#endif /* GETLOADAVG_PRIVILEGED */
836
837/* Give the process appropriate permissions for access to
838 user data (i.e., to stat files, or to spawn a child process). */
839void
840user_access (void)
841{
842#ifdef GETLOADAVG_PRIVILEGED
843
844 if (!access_inited)
845 init_access ();
846
847 if (current_access == user)
848 return;
849
850 /* We are in "make access" mode. This means that the effective user and
851 group IDs are those of make (if it was installed setuid or setgid).
852 We now want to set the effective user and group IDs to the real IDs,
853 which are the IDs of the process that exec'd make. */
854
855#ifdef HAVE_SETEUID
856
857 /* Modern systems have the seteuid/setegid calls which set only the
858 effective IDs, which is ideal. */
859
860 if (seteuid (user_uid) < 0)
861 pfatal_with_name ("user_access: seteuid");
862
863#else /* Not HAVE_SETEUID. */
864
865#ifndef HAVE_SETREUID
866
867 /* System V has only the setuid/setgid calls to set user/group IDs.
868 There is an effective ID, which can be set by setuid/setgid.
869 It can be set (unless you are root) only to either what it already is
870 (returned by geteuid/getegid, now in make_uid/make_gid),
871 the real ID (return by getuid/getgid, now in user_uid/user_gid),
872 or the saved set ID (what the effective ID was before this set-ID
873 executable (make) was exec'd). */
874
875 if (setuid (user_uid) < 0)
876 pfatal_with_name ("user_access: setuid");
877
878#else /* HAVE_SETREUID. */
879
880 /* In 4BSD, the setreuid/setregid calls set both the real and effective IDs.
881 They may be set to themselves or each other. So you have two alternatives
882 at any one time. If you use setuid/setgid, the effective will be set to
883 the real, leaving only one alternative. Using setreuid/setregid, however,
884 you can toggle between your two alternatives by swapping the values in a
885 single setreuid or setregid call. */
886
887 if (setreuid (make_uid, user_uid) < 0)
888 pfatal_with_name ("user_access: setreuid");
889
890#endif /* Not HAVE_SETREUID. */
891#endif /* HAVE_SETEUID. */
892
893#ifdef HAVE_SETEGID
894 if (setegid (user_gid) < 0)
895 pfatal_with_name ("user_access: setegid");
896#else
897#ifndef HAVE_SETREGID
898 if (setgid (user_gid) < 0)
899 pfatal_with_name ("user_access: setgid");
900#else
901 if (setregid (make_gid, user_gid) < 0)
902 pfatal_with_name ("user_access: setregid");
903#endif
904#endif
905
906 current_access = user;
907
908 log_access (_("User access"));
909
910#endif /* GETLOADAVG_PRIVILEGED */
911}
912
913/* Give the process appropriate permissions for access to
914 make data (i.e., the load average). */
915void
916make_access (void)
917{
918#ifdef GETLOADAVG_PRIVILEGED
919
920 if (!access_inited)
921 init_access ();
922
923 if (current_access == make)
924 return;
925
926 /* See comments in user_access, above. */
927
928#ifdef HAVE_SETEUID
929 if (seteuid (make_uid) < 0)
930 pfatal_with_name ("make_access: seteuid");
931#else
932#ifndef HAVE_SETREUID
933 if (setuid (make_uid) < 0)
934 pfatal_with_name ("make_access: setuid");
935#else
936 if (setreuid (user_uid, make_uid) < 0)
937 pfatal_with_name ("make_access: setreuid");
938#endif
939#endif
940
941#ifdef HAVE_SETEGID
942 if (setegid (make_gid) < 0)
943 pfatal_with_name ("make_access: setegid");
944#else
945#ifndef HAVE_SETREGID
946 if (setgid (make_gid) < 0)
947 pfatal_with_name ("make_access: setgid");
948#else
949 if (setregid (user_gid, make_gid) < 0)
950 pfatal_with_name ("make_access: setregid");
951#endif
952#endif
953
954 current_access = make;
955
956 log_access (_("Make access"));
957
958#endif /* GETLOADAVG_PRIVILEGED */
959}
960
961/* Give the process appropriate permissions for a child process.
962 This is like user_access, but you can't get back to make_access. */
963void
964child_access (void)
965{
966#ifdef GETLOADAVG_PRIVILEGED
967
968 if (!access_inited)
969 abort ();
970
971 /* Set both the real and effective UID and GID to the user's.
972 They cannot be changed back to make's. */
973
974#ifndef HAVE_SETREUID
975 if (setuid (user_uid) < 0)
976 pfatal_with_name ("child_access: setuid");
977#else
978 if (setreuid (user_uid, user_uid) < 0)
979 pfatal_with_name ("child_access: setreuid");
980#endif
981
982#ifndef HAVE_SETREGID
983 if (setgid (user_gid) < 0)
984 pfatal_with_name ("child_access: setgid");
985#else
986 if (setregid (user_gid, user_gid) < 0)
987 pfatal_with_name ("child_access: setregid");
988#endif
989
990 log_access (_("Child access"));
991
992#endif /* GETLOADAVG_PRIVILEGED */
993}
994
995
996#ifdef NEED_GET_PATH_MAX
997unsigned int
998get_path_max (void)
999{
1000 static unsigned int value;
1001
1002 if (value == 0)
1003 {
1004 long int x = pathconf ("/", _PC_PATH_MAX);
1005 if (x > 0)
1006 value = x;
1007 else
1008 return MAXPATHLEN;
1009 }
1010
1011 return value;
1012}
1013#endif
1014
1015
1016
1017/* This code is stolen from gnulib.
1018 If/when we abandon the requirement to work with K&R compilers, we can
1019 remove this (and perhaps other parts of GNU make!) and migrate to using
1020 gnulib directly.
1021
1022 This is called only through atexit(), which means die() has already been
1023 invoked. So, call exit() here directly. Apparently that works...?
1024*/
1025
1026/* Close standard output, exiting with status 'exit_failure' on failure.
1027 If a program writes *anything* to stdout, that program should close
1028 stdout and make sure that it succeeds before exiting. Otherwise,
1029 suppose that you go to the extreme of checking the return status
1030 of every function that does an explicit write to stdout. The last
1031 printf can succeed in writing to the internal stream buffer, and yet
1032 the fclose(stdout) could still fail (due e.g., to a disk full error)
1033 when it tries to write out that buffered data. Thus, you would be
1034 left with an incomplete output file and the offending program would
1035 exit successfully. Even calling fflush is not always sufficient,
1036 since some file systems (NFS and CODA) buffer written/flushed data
1037 until an actual close call.
1038
1039 Besides, it's wasteful to check the return value from every call
1040 that writes to stdout -- just let the internal stream state record
1041 the failure. That's what the ferror test is checking below.
1042
1043 It's important to detect such failures and exit nonzero because many
1044 tools (most notably `make' and other build-management systems) depend
1045 on being able to detect failure in other tools via their exit status. */
1046
1047void
1048close_stdout (void)
1049{
1050 int prev_fail = ferror (stdout);
1051 int fclose_fail = fclose (stdout);
1052
1053 if (prev_fail || fclose_fail)
1054 {
1055 if (fclose_fail)
1056 error (NILF, _("write error: %s"), strerror (errno));
1057 else
1058 error (NILF, _("write error"));
1059 exit (EXIT_FAILURE);
1060 }
1061}
1062
1063#if defined(CONFIG_WITH_MAKE_STATS) && !defined(ELECTRIC_HEAP)
1064#undef free
1065void xfree(void *ptr)
1066{
1067 if (ptr)
1068 {
1069 make_stats_allocations--;
1070 if (make_expensive_statistics)
1071 make_stats_allocated -= SIZE_OF_HEAP_BLOCK (ptr);
1072 free (ptr);
1073 }
1074}
1075#endif
1076
Note: See TracBrowser for help on using the repository browser.

© 2025 Oracle Support Privacy / Do Not Sell My Info Terms of Use Trademark Policy Automated Access Etiquette