1 /* More subroutines needed by GCC output code on some machines. */
2 /* Compile this one with gcc. */
3 /* Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
4 2000, 2001 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 In addition to the permissions in the GNU General Public License, the
14 Free Software Foundation gives you unlimited permission to link the
15 compiled version of this file into combinations with other programs,
16 and to distribute those combinations without any restriction coming
17 from the use of this file. (The General Public License restrictions
18 do apply in other respects; for example, they cover modification of
19 the file, and distribution when not linked into a combine
22 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
23 WARRANTY; without even the implied warranty of MERCHANTABILITY or
24 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
27 You should have received a copy of the GNU General Public License
28 along with GCC; see the file COPYING. If not, write to the Free
29 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
32 /* It is incorrect to include config.h here, because this file is being
33 compiled for the target, and hence definitions concerning only the host
41 /* Don't use `fancy_abort' here even if config.h says to use it. */
48 #if defined (L_negdi2) || defined (L_divdi3) || defined (L_moddi3)
49 #if defined (L_divdi3) || defined (L_moddi3)
61 w.s.high = -uu.s.high - ((UWtype) w.s.low > 0);
69 __addvsi3 (Wtype a, Wtype b)
75 if (b >= 0 ? w < a : w > a)
84 __addvdi3 (DWtype a, DWtype b)
90 if (b >= 0 ? w < a : w > a)
99 __subvsi3 (Wtype a, Wtype b)
102 return __addvsi3 (a, (-b));
108 if (b >= 0 ? w > a : w < a)
118 __subvdi3 (DWtype a, DWtype b)
127 if (b >= 0 ? w > a : w < a)
137 __mulvsi3 (Wtype a, Wtype b)
143 if (((a >= 0) == (b >= 0)) ? w < 0 : w > 0)
158 if (a >= 0 ? w > 0 : w < 0)
173 if (a >= 0 ? w > 0 : w < 0)
222 __mulvdi3 (DWtype u, DWtype v)
228 if (((u >= 0) == (v >= 0)) ? w < 0 : w > 0)
236 /* Unless shift functions are defined whith full ANSI prototypes,
237 parameter b will be promoted to int if word_type is smaller than an int. */
240 __lshrdi3 (DWtype u, word_type b)
251 bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
255 w.s.low = (UWtype) uu.s.high >> -bm;
259 UWtype carries = (UWtype) uu.s.high << bm;
261 w.s.high = (UWtype) uu.s.high >> b;
262 w.s.low = ((UWtype) uu.s.low >> b) | carries;
271 __ashldi3 (DWtype u, word_type b)
282 bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
286 w.s.high = (UWtype) uu.s.low << -bm;
290 UWtype carries = (UWtype) uu.s.low >> bm;
292 w.s.low = (UWtype) uu.s.low << b;
293 w.s.high = ((UWtype) uu.s.high << b) | carries;
302 __ashrdi3 (DWtype u, word_type b)
313 bm = (sizeof (Wtype) * BITS_PER_UNIT) - b;
316 /* w.s.high = 1..1 or 0..0 */
317 w.s.high = uu.s.high >> (sizeof (Wtype) * BITS_PER_UNIT - 1);
318 w.s.low = uu.s.high >> -bm;
322 UWtype carries = (UWtype) uu.s.high << bm;
324 w.s.high = uu.s.high >> b;
325 w.s.low = ((UWtype) uu.s.low >> b) | carries;
337 UWtype word, count, add;
341 word = uu.s.low, add = 0;
342 else if (uu.s.high != 0)
343 word = uu.s.high, add = BITS_PER_UNIT * sizeof (Wtype);
347 count_trailing_zeros (count, word);
348 return count + add + 1;
354 __muldi3 (DWtype u, DWtype v)
362 w.ll = __umulsidi3 (uu.s.low, vv.s.low);
363 w.s.high += ((UWtype) uu.s.low * (UWtype) vv.s.high
364 + (UWtype) uu.s.high * (UWtype) vv.s.low);
371 #if defined (sdiv_qrnnd)
373 __udiv_w_sdiv (UWtype *rp, UWtype a1, UWtype a0, UWtype d)
380 if (a1 < d - a1 - (a0 >> (W_TYPE_SIZE - 1)))
382 /* dividend, divisor, and quotient are nonnegative */
383 sdiv_qrnnd (q, r, a1, a0, d);
387 /* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d */
388 sub_ddmmss (c1, c0, a1, a0, d >> 1, d << (W_TYPE_SIZE - 1));
389 /* Divide (c1*2^32 + c0) by d */
390 sdiv_qrnnd (q, r, c1, c0, d);
391 /* Add 2^31 to quotient */
392 q += (UWtype) 1 << (W_TYPE_SIZE - 1);
397 b1 = d >> 1; /* d/2, between 2^30 and 2^31 - 1 */
398 c1 = a1 >> 1; /* A/2 */
399 c0 = (a1 << (W_TYPE_SIZE - 1)) + (a0 >> 1);
401 if (a1 < b1) /* A < 2^32*b1, so A/2 < 2^31*b1 */
403 sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
405 r = 2*r + (a0 & 1); /* Remainder from A/(2*b1) */
422 else if (c1 < b1) /* So 2^31 <= (A/2)/b1 < 2^32 */
425 c0 = ~c0; /* logical NOT */
427 sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
429 q = ~q; /* (A/2)/b1 */
432 r = 2*r + (a0 & 1); /* A/(2*b1) */
450 else /* Implies c1 = b1 */
451 { /* Hence a1 = d - 1 = 2*b1 - 1 */
469 /* If sdiv_qrnnd doesn't exist, define dummy __udiv_w_sdiv. */
471 __udiv_w_sdiv (UWtype *rp __attribute__ ((__unused__)),
472 UWtype a1 __attribute__ ((__unused__)),
473 UWtype a0 __attribute__ ((__unused__)),
474 UWtype d __attribute__ ((__unused__)))
481 #if (defined (L_udivdi3) || defined (L_divdi3) || \
482 defined (L_umoddi3) || defined (L_moddi3))
487 const UQItype __clz_tab[] =
489 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
490 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
491 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
492 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
493 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
494 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
495 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
496 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
502 #if (defined (L_udivdi3) || defined (L_divdi3) || \
503 defined (L_umoddi3) || defined (L_moddi3))
507 __udivmoddi4 (UDWtype n, UDWtype d, UDWtype *rp)
512 UWtype d0, d1, n0, n1, n2;
524 #if !UDIV_NEEDS_NORMALIZATION
531 udiv_qrnnd (q0, n0, n1, n0, d0);
534 /* Remainder in n0. */
541 d0 = 1 / d0; /* Divide intentionally by zero. */
543 udiv_qrnnd (q1, n1, 0, n1, d0);
544 udiv_qrnnd (q0, n0, n1, n0, d0);
546 /* Remainder in n0. */
557 #else /* UDIV_NEEDS_NORMALIZATION */
565 count_leading_zeros (bm, d0);
569 /* Normalize, i.e. make the most significant bit of the
573 n1 = (n1 << bm) | (n0 >> (W_TYPE_SIZE - bm));
577 udiv_qrnnd (q0, n0, n1, n0, d0);
580 /* Remainder in n0 >> bm. */
587 d0 = 1 / d0; /* Divide intentionally by zero. */
589 count_leading_zeros (bm, d0);
593 /* From (n1 >= d0) /\ (the most significant bit of d0 is set),
594 conclude (the most significant bit of n1 is set) /\ (the
595 leading quotient digit q1 = 1).
597 This special case is necessary, not an optimization.
598 (Shifts counts of W_TYPE_SIZE are undefined.) */
607 b = W_TYPE_SIZE - bm;
611 n1 = (n1 << bm) | (n0 >> b);
614 udiv_qrnnd (q1, n1, n2, n1, d0);
619 udiv_qrnnd (q0, n0, n1, n0, d0);
621 /* Remainder in n0 >> bm. */
631 #endif /* UDIV_NEEDS_NORMALIZATION */
642 /* Remainder in n1n0. */
654 count_leading_zeros (bm, d1);
657 /* From (n1 >= d1) /\ (the most significant bit of d1 is set),
658 conclude (the most significant bit of n1 is set) /\ (the
659 quotient digit q0 = 0 or 1).
661 This special case is necessary, not an optimization. */
663 /* The condition on the next line takes advantage of that
664 n1 >= d1 (true due to program flow). */
665 if (n1 > d1 || n0 >= d0)
668 sub_ddmmss (n1, n0, n1, n0, d1, d0);
687 b = W_TYPE_SIZE - bm;
689 d1 = (d1 << bm) | (d0 >> b);
692 n1 = (n1 << bm) | (n0 >> b);
695 udiv_qrnnd (q0, n1, n2, n1, d1);
696 umul_ppmm (m1, m0, q0, d0);
698 if (m1 > n1 || (m1 == n1 && m0 > n0))
701 sub_ddmmss (m1, m0, m1, m0, d1, d0);
706 /* Remainder in (n1n0 - m1m0) >> bm. */
709 sub_ddmmss (n1, n0, n1, n0, m1, m0);
710 rr.s.low = (n1 << b) | (n0 >> bm);
711 rr.s.high = n1 >> bm;
726 __divdi3 (DWtype u, DWtype v)
737 uu.ll = __negdi2 (uu.ll);
740 vv.ll = __negdi2 (vv.ll);
742 w = __udivmoddi4 (uu.ll, vv.ll, (UDWtype *) 0);
752 __moddi3 (DWtype u, DWtype v)
763 uu.ll = __negdi2 (uu.ll);
765 vv.ll = __negdi2 (vv.ll);
767 (void) __udivmoddi4 (uu.ll, vv.ll, &w);
777 __umoddi3 (UDWtype u, UDWtype v)
781 (void) __udivmoddi4 (u, v, &w);
789 __udivdi3 (UDWtype n, UDWtype d)
791 return __udivmoddi4 (n, d, (UDWtype *) 0);
797 __cmpdi2 (DWtype a, DWtype b)
801 au.ll = a, bu.ll = b;
803 if (au.s.high < bu.s.high)
805 else if (au.s.high > bu.s.high)
807 if ((UWtype) au.s.low < (UWtype) bu.s.low)
809 else if ((UWtype) au.s.low > (UWtype) bu.s.low)
817 __ucmpdi2 (DWtype a, DWtype b)
821 au.ll = a, bu.ll = b;
823 if ((UWtype) au.s.high < (UWtype) bu.s.high)
825 else if ((UWtype) au.s.high > (UWtype) bu.s.high)
827 if ((UWtype) au.s.low < (UWtype) bu.s.low)
829 else if ((UWtype) au.s.low > (UWtype) bu.s.low)
835 #if defined(L_fixunstfdi) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 128)
836 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
837 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
840 __fixunstfDI (TFtype a)
848 /* Compute high word of result, as a flonum. */
849 b = (a / HIGH_WORD_COEFF);
850 /* Convert that to fixed (but not to DWtype!),
851 and shift it into the high word. */
854 /* Remove high part from the TFtype, leaving the low part as flonum. */
856 /* Convert that to fixed (but not to DWtype!) and add it in.
857 Sometimes A comes out negative. This is significant, since
858 A has more bits than a long int does. */
867 #if defined(L_fixtfdi) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 128)
872 return - __fixunstfDI (-a);
873 return __fixunstfDI (a);
877 #if defined(L_fixunsxfdi) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 96)
878 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
879 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
882 __fixunsxfDI (XFtype a)
890 /* Compute high word of result, as a flonum. */
891 b = (a / HIGH_WORD_COEFF);
892 /* Convert that to fixed (but not to DWtype!),
893 and shift it into the high word. */
896 /* Remove high part from the XFtype, leaving the low part as flonum. */
898 /* Convert that to fixed (but not to DWtype!) and add it in.
899 Sometimes A comes out negative. This is significant, since
900 A has more bits than a long int does. */
909 #if defined(L_fixxfdi) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 96)
914 return - __fixunsxfDI (-a);
915 return __fixunsxfDI (a);
920 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
921 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
924 __fixunsdfDI (DFtype a)
932 /* Compute high word of result, as a flonum. */
933 b = (a / HIGH_WORD_COEFF);
934 /* Convert that to fixed (but not to DWtype!),
935 and shift it into the high word. */
938 /* Remove high part from the DFtype, leaving the low part as flonum. */
940 /* Convert that to fixed (but not to DWtype!) and add it in.
941 Sometimes A comes out negative. This is significant, since
942 A has more bits than a long int does. */
956 return - __fixunsdfDI (-a);
957 return __fixunsdfDI (a);
962 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
963 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
966 __fixunssfDI (SFtype original_a)
968 /* Convert the SFtype to a DFtype, because that is surely not going
969 to lose any bits. Some day someone else can write a faster version
970 that avoids converting to DFtype, and verify it really works right. */
971 DFtype a = original_a;
978 /* Compute high word of result, as a flonum. */
979 b = (a / HIGH_WORD_COEFF);
980 /* Convert that to fixed (but not to DWtype!),
981 and shift it into the high word. */
984 /* Remove high part from the DFtype, leaving the low part as flonum. */
986 /* Convert that to fixed (but not to DWtype!) and add it in.
987 Sometimes A comes out negative. This is significant, since
988 A has more bits than a long int does. */
1002 return - __fixunssfDI (-a);
1003 return __fixunssfDI (a);
1007 #if defined(L_floatdixf) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 96)
1008 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
1009 #define HIGH_HALFWORD_COEFF (((UDWtype) 1) << (WORD_SIZE / 2))
1010 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
1013 __floatdixf (DWtype u)
1017 d = (Wtype) (u >> WORD_SIZE);
1018 d *= HIGH_HALFWORD_COEFF;
1019 d *= HIGH_HALFWORD_COEFF;
1020 d += (UWtype) (u & (HIGH_WORD_COEFF - 1));
1026 #if defined(L_floatditf) && (LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 128)
1027 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
1028 #define HIGH_HALFWORD_COEFF (((UDWtype) 1) << (WORD_SIZE / 2))
1029 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
1032 __floatditf (DWtype u)
1036 d = (Wtype) (u >> WORD_SIZE);
1037 d *= HIGH_HALFWORD_COEFF;
1038 d *= HIGH_HALFWORD_COEFF;
1039 d += (UWtype) (u & (HIGH_WORD_COEFF - 1));
1046 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
1047 #define HIGH_HALFWORD_COEFF (((UDWtype) 1) << (WORD_SIZE / 2))
1048 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
1051 __floatdidf (DWtype u)
1055 d = (Wtype) (u >> WORD_SIZE);
1056 d *= HIGH_HALFWORD_COEFF;
1057 d *= HIGH_HALFWORD_COEFF;
1058 d += (UWtype) (u & (HIGH_WORD_COEFF - 1));
1065 #define WORD_SIZE (sizeof (Wtype) * BITS_PER_UNIT)
1066 #define HIGH_HALFWORD_COEFF (((UDWtype) 1) << (WORD_SIZE / 2))
1067 #define HIGH_WORD_COEFF (((UDWtype) 1) << WORD_SIZE)
1068 #define DI_SIZE (sizeof (DWtype) * BITS_PER_UNIT)
1070 /* Define codes for all the float formats that we know of. Note
1071 that this is copied from real.h. */
1073 #define UNKNOWN_FLOAT_FORMAT 0
1074 #define IEEE_FLOAT_FORMAT 1
1075 #define VAX_FLOAT_FORMAT 2
1076 #define IBM_FLOAT_FORMAT 3
1078 /* Default to IEEE float if not specified. Nearly all machines use it. */
1079 #ifndef HOST_FLOAT_FORMAT
1080 #define HOST_FLOAT_FORMAT IEEE_FLOAT_FORMAT
1083 #if HOST_FLOAT_FORMAT == IEEE_FLOAT_FORMAT
1088 #if HOST_FLOAT_FORMAT == IBM_FLOAT_FORMAT
1093 #if HOST_FLOAT_FORMAT == VAX_FLOAT_FORMAT
1099 __floatdisf (DWtype u)
1101 /* Do the calculation in DFmode
1102 so that we don't lose any of the precision of the high word
1103 while multiplying it. */
1106 /* Protect against double-rounding error.
1107 Represent any low-order bits, that might be truncated in DFmode,
1108 by a bit that won't be lost. The bit can go in anywhere below the
1109 rounding position of the SFmode. A fixed mask and bit position
1110 handles all usual configurations. It doesn't handle the case
1111 of 128-bit DImode, however. */
1112 if (DF_SIZE < DI_SIZE
1113 && DF_SIZE > (DI_SIZE - DF_SIZE + SF_SIZE))
1115 #define REP_BIT ((UDWtype) 1 << (DI_SIZE - DF_SIZE))
1116 if (! (- ((DWtype) 1 << DF_SIZE) < u
1117 && u < ((DWtype) 1 << DF_SIZE)))
1119 if ((UDWtype) u & (REP_BIT - 1))
1123 f = (Wtype) (u >> WORD_SIZE);
1124 f *= HIGH_HALFWORD_COEFF;
1125 f *= HIGH_HALFWORD_COEFF;
1126 f += (UWtype) (u & (HIGH_WORD_COEFF - 1));
1132 #if defined(L_fixunsxfsi) && LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 96
1133 /* Reenable the normal types, in case limits.h needs them. */
1146 __fixunsxfSI (XFtype a)
1148 if (a >= - (DFtype) Wtype_MIN)
1149 return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
1155 /* Reenable the normal types, in case limits.h needs them. */
1168 __fixunsdfSI (DFtype a)
1170 if (a >= - (DFtype) Wtype_MIN)
1171 return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
1177 /* Reenable the normal types, in case limits.h needs them. */
1190 __fixunssfSI (SFtype a)
1192 if (a >= - (SFtype) Wtype_MIN)
1193 return (Wtype) (a + Wtype_MIN) - Wtype_MIN;
1198 /* From here on down, the routines use normal data types. */
1200 #define SItype bogus_type
1201 #define USItype bogus_type
1202 #define DItype bogus_type
1203 #define UDItype bogus_type
1204 #define SFtype bogus_type
1205 #define DFtype bogus_type
1223 /* Like bcmp except the sign is meaningful.
1224 Result is negative if S1 is less than S2,
1225 positive if S1 is greater, 0 if S1 and S2 are equal. */
1228 __gcc_bcmp (const unsigned char *s1, const unsigned char *s2, size_t size)
1232 unsigned char c1 = *s1++, c2 = *s2++;
1242 /* __eprintf used to be used by GCC's private version of <assert.h>.
1243 We no longer provide that header, but this routine remains in libgcc.a
1244 for binary backward compatibility. Note that it is not included in
1245 the shared version of libgcc. */
1247 #ifndef inhibit_libc
1249 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1253 __eprintf (const char *string, const char *expression,
1254 unsigned int line, const char *filename)
1256 fprintf (stderr, string, expression, line, filename);
1266 #if LONG_TYPE_SIZE == GCOV_TYPE_SIZE
1267 typedef long gcov_type;
1269 typedef long long gcov_type;
1273 /* Structure emitted by -a */
1277 const char *filename;
1281 const unsigned long *addresses;
1283 /* Older GCC's did not emit these fields. */
1285 const char **functions;
1286 const long *line_nums;
1287 const char **filenames;
1291 #ifdef BLOCK_PROFILER_CODE
1294 #ifndef inhibit_libc
1296 /* Simple minded basic block profiling output dumper for
1297 systems that don't provide tcov support. At present,
1298 it requires atexit and stdio. */
1300 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1302 char *ctime PARAMS ((const time_t *));
1304 #include "gbl-ctors.h"
1305 #include "gcov-io.h"
1307 #ifdef TARGET_HAS_F_SETLKW
1312 static struct bb *bb_head;
1314 static int num_digits (long long value, int base) __attribute__ ((const));
1316 /* Return the number of digits needed to print a value */
1317 /* __inline__ */ static int num_digits (long long value, int base)
1319 int minus = (value < 0 && base != 16);
1320 unsigned long long v = (minus) ? -value : value;
1334 __bb_exit_func (void)
1336 FILE *da_file, *file;
1343 i = strlen (bb_head->filename) - 3;
1345 if (!strcmp (bb_head->filename+i, ".da"))
1347 /* Must be -fprofile-arcs not -a.
1348 Dump data in a form that gcov expects. */
1352 for (ptr = bb_head; ptr != (struct bb *) 0; ptr = ptr->next)
1356 /* Make sure the output file exists -
1357 but don't clobber exiting data. */
1358 if ((da_file = fopen (ptr->filename, "a")) != 0)
1361 /* Need to re-open in order to be able to write from the start. */
1362 da_file = fopen (ptr->filename, "r+b");
1363 /* Some old systems might not allow the 'b' mode modifier.
1364 Therefore, try to open without it. This can lead to a race
1365 condition so that when you delete and re-create the file, the
1366 file might be opened in text mode, but then, you shouldn't
1367 delete the file in the first place. */
1369 da_file = fopen (ptr->filename, "r+");
1372 fprintf (stderr, "arc profiling: Can't open output file %s.\n",
1377 /* After a fork, another process might try to read and/or write
1378 the same file simultanously. So if we can, lock the file to
1379 avoid race conditions. */
1380 #if defined (TARGET_HAS_F_SETLKW)
1382 struct flock s_flock;
1384 s_flock.l_type = F_WRLCK;
1385 s_flock.l_whence = SEEK_SET;
1386 s_flock.l_start = 0;
1388 s_flock.l_pid = getpid ();
1390 while (fcntl (fileno (da_file), F_SETLKW, &s_flock)
1395 /* If the file is not empty, and the number of counts in it is the
1396 same, then merge them in. */
1397 firstchar = fgetc (da_file);
1398 if (firstchar == EOF)
1400 if (ferror (da_file))
1402 fprintf (stderr, "arc profiling: Can't read output file ");
1403 perror (ptr->filename);
1410 if (ungetc (firstchar, da_file) == EOF)
1412 if (__read_long (&n_counts, da_file, 8) != 0)
1414 fprintf (stderr, "arc profiling: Can't read output file %s.\n",
1419 if (n_counts == ptr->ncounts)
1423 for (i = 0; i < n_counts; i++)
1427 if (__read_gcov_type (&v, da_file, 8) != 0)
1429 fprintf (stderr, "arc profiling: Can't read output file %s.\n",
1433 ptr->counts[i] += v;
1441 /* ??? Should first write a header to the file. Preferably, a 4 byte
1442 magic number, 4 bytes containing the time the program was
1443 compiled, 4 bytes containing the last modification time of the
1444 source file, and 4 bytes indicating the compiler options used.
1446 That way we can easily verify that the proper source/executable/
1447 data file combination is being used from gcov. */
1449 if (__write_gcov_type (ptr->ncounts, da_file, 8) != 0)
1452 fprintf (stderr, "arc profiling: Error writing output file %s.\n",
1458 gcov_type *count_ptr = ptr->counts;
1460 for (j = ptr->ncounts; j > 0; j--)
1462 if (__write_gcov_type (*count_ptr, da_file, 8) != 0)
1470 fprintf (stderr, "arc profiling: Error writing output file %s.\n",
1474 if (fclose (da_file) == EOF)
1475 fprintf (stderr, "arc profiling: Error closing output file %s.\n",
1482 /* Must be basic block profiling. Emit a human readable output file. */
1484 file = fopen ("bb.out", "a");
1493 /* This is somewhat type incorrect, but it avoids worrying about
1494 exactly where time.h is included from. It should be ok unless
1495 a void * differs from other pointer formats, or if sizeof (long)
1496 is < sizeof (time_t). It would be nice if we could assume the
1497 use of rationale standards here. */
1499 time ((void *) &time_value);
1500 fprintf (file, "Basic block profiling finished on %s\n",
1501 ctime ((void *) &time_value));
1503 /* We check the length field explicitly in order to allow compatibility
1504 with older GCC's which did not provide it. */
1506 for (ptr = bb_head; ptr != (struct bb *) 0; ptr = ptr->next)
1509 int func_p = (ptr->nwords >= (long) sizeof (struct bb)
1510 && ptr->nwords <= 1000
1512 int line_p = (func_p && ptr->line_nums);
1513 int file_p = (func_p && ptr->filenames);
1514 int addr_p = (ptr->addresses != 0);
1515 long ncounts = ptr->ncounts;
1516 gcov_type cnt_max = 0;
1521 int blk_len = num_digits (ncounts, 10);
1526 fprintf (file, "File %s, %ld basic blocks \n\n",
1527 ptr->filename, ncounts);
1529 /* Get max values for each field. */
1530 for (i = 0; i < ncounts; i++)
1535 if (cnt_max < ptr->counts[i])
1536 cnt_max = ptr->counts[i];
1538 if (addr_p && (unsigned long) addr_max < ptr->addresses[i])
1539 addr_max = ptr->addresses[i];
1541 if (line_p && line_max < ptr->line_nums[i])
1542 line_max = ptr->line_nums[i];
1546 p = (ptr->functions[i]) ? (ptr->functions[i]) : "<none>";
1554 p = (ptr->filenames[i]) ? (ptr->filenames[i]) : "<none>";
1561 addr_len = num_digits (addr_max, 16);
1562 cnt_len = num_digits (cnt_max, 10);
1563 line_len = num_digits (line_max, 10);
1565 /* Now print out the basic block information. */
1566 for (i = 0; i < ncounts; i++)
1568 #if LONG_TYPE_SIZE == GCOV_TYPE_SIZE
1570 " Block #%*d: executed %*ld time(s)",
1572 cnt_len, ptr->counts[i]);
1575 " Block #%*d: executed %*lld time(s)",
1577 cnt_len, ptr->counts[i]);
1581 fprintf (file, " address= 0x%.*lx", addr_len,
1585 fprintf (file, " function= %-*s", func_len,
1586 (ptr->functions[i]) ? ptr->functions[i] : "<none>");
1589 fprintf (file, " line= %*ld", line_len, ptr->line_nums[i]);
1592 fprintf (file, " file= %s",
1593 (ptr->filenames[i]) ? ptr->filenames[i] : "<none>");
1595 fprintf (file, "\n");
1598 fprintf (file, "\n");
1602 fprintf (file, "\n\n");
1608 __bb_init_func (struct bb *blocks)
1610 /* User is supposed to check whether the first word is non-0,
1611 but just in case.... */
1613 if (blocks->zero_word)
1616 /* Initialize destructor. */
1618 atexit (__bb_exit_func);
1620 /* Set up linked list. */
1621 blocks->zero_word = 1;
1622 blocks->next = bb_head;
1626 /* Called before fork or exec - write out profile information gathered so
1627 far and reset it to zero. This avoids duplication or loss of the
1628 profile information gathered so far. */
1630 __bb_fork_func (void)
1635 for (ptr = bb_head; ptr != (struct bb *) 0; ptr = ptr->next)
1638 for (i = ptr->ncounts - 1; i >= 0; i--)
1643 #ifndef MACHINE_STATE_SAVE
1644 #define MACHINE_STATE_SAVE(ID)
1646 #ifndef MACHINE_STATE_RESTORE
1647 #define MACHINE_STATE_RESTORE(ID)
1650 /* Number of buckets in hashtable of basic block addresses. */
1652 #define BB_BUCKETS 311
1654 /* Maximum length of string in file bb.in. */
1656 #define BBINBUFSIZE 500
1660 struct bb_edge *next;
1661 unsigned long src_addr;
1662 unsigned long dst_addr;
1663 unsigned long count;
1668 TRACE_KEEP = 0, TRACE_ON = 1, TRACE_OFF = 2
1673 struct bb_func *next;
1676 enum bb_func_mode mode;
1679 /* This is the connection to the outside world.
1680 The BLOCK_PROFILER macro must set __bb.blocks
1681 and __bb.blockno. */
1684 unsigned long blockno;
1688 /* Vars to store addrs of source and destination basic blocks
1691 static unsigned long bb_src = 0;
1692 static unsigned long bb_dst = 0;
1694 static FILE *bb_tracefile = (FILE *) 0;
1695 static struct bb_edge **bb_hashbuckets = (struct bb_edge **) 0;
1696 static struct bb_func *bb_func_head = (struct bb_func *) 0;
1697 static unsigned long bb_callcount = 0;
1698 static int bb_mode = 0;
1700 static unsigned long *bb_stack = (unsigned long *) 0;
1701 static size_t bb_stacksize = 0;
1703 static int reported = 0;
1706 Always : Print execution frequencies of basic blocks
1708 bb_mode & 1 != 0 : Dump trace of basic blocks to file bbtrace[.gz]
1709 bb_mode & 2 != 0 : Print jump frequencies to file bb.out.
1710 bb_mode & 4 != 0 : Cut call instructions from basic block flow.
1711 bb_mode & 8 != 0 : Insert return instructions in basic block flow.
1716 /*#include <sys/types.h>*/
1717 #include <sys/stat.h>
1718 /*#include <malloc.h>*/
1720 /* Commands executed by gopen. */
1722 #define GOPENDECOMPRESS "gzip -cd "
1723 #define GOPENCOMPRESS "gzip -c >"
1725 /* Like fopen but pipes through gzip. mode may only be "r" or "w".
1726 If it does not compile, simply replace gopen by fopen and delete
1727 '.gz' from any first parameter to gopen. */
1730 gopen (char *fn, char *mode)
1738 if (mode[0] != 'r' && mode[0] != 'w')
1741 p = fn + strlen (fn)-1;
1742 use_gzip = ((p[-1] == '.' && (p[0] == 'Z' || p[0] == 'z'))
1743 || (p[-2] == '.' && p[-1] == 'g' && p[0] == 'z'));
1750 char *s = (char *) malloc (sizeof (char) * strlen (fn)
1751 + sizeof (GOPENDECOMPRESS));
1752 strcpy (s, GOPENDECOMPRESS);
1753 strcpy (s + (sizeof (GOPENDECOMPRESS)-1), fn);
1754 f = popen (s, mode);
1762 char *s = (char *) malloc (sizeof (char) * strlen (fn)
1763 + sizeof (GOPENCOMPRESS));
1764 strcpy (s, GOPENCOMPRESS);
1765 strcpy (s + (sizeof (GOPENCOMPRESS)-1), fn);
1766 if (!(f = popen (s, mode)))
1767 f = fopen (s, mode);
1774 return fopen (fn, mode);
1784 if (!fstat (fileno (f), &buf) && S_ISFIFO (buf.st_mode))
1792 #endif /* HAVE_POPEN */
1794 /* Called once per program. */
1797 __bb_exit_trace_func (void)
1799 FILE *file = fopen ("bb.out", "a");
1812 gclose (bb_tracefile);
1814 fclose (bb_tracefile);
1815 #endif /* HAVE_POPEN */
1818 /* Check functions in `bb.in'. */
1823 const struct bb_func *p;
1824 int printed_something = 0;
1828 /* This is somewhat type incorrect. */
1829 time ((void *) &time_value);
1831 for (p = bb_func_head; p != (struct bb_func *) 0; p = p->next)
1833 for (ptr = bb_head; ptr != (struct bb *) 0; ptr = ptr->next)
1835 if (!ptr->filename || (p->filename != (char *) 0 && strcmp (p->filename, ptr->filename)))
1837 for (blk = 0; blk < ptr->ncounts; blk++)
1839 if (!strcmp (p->funcname, ptr->functions[blk]))
1844 if (!printed_something)
1847 "Functions in `bb.in' not executed during basic block profiling on %s\n",
1848 ctime ((void *) &time_value));
1849 printed_something = 1;
1852 fprintf (file, "\tFunction %s", p->funcname);
1854 fprintf (file, " of file %s", p->filename);
1855 fprintf (file, "\n" );
1860 if (printed_something)
1861 fprintf (file, "\n");
1867 if (!bb_hashbuckets)
1871 fprintf (stderr, "Profiler: out of memory\n");
1881 unsigned long addr_max = 0;
1882 unsigned long cnt_max = 0;
1886 /* This is somewhat type incorrect, but it avoids worrying about
1887 exactly where time.h is included from. It should be ok unless
1888 a void * differs from other pointer formats, or if sizeof (long)
1889 is < sizeof (time_t). It would be nice if we could assume the
1890 use of rationale standards here. */
1892 time ((void *) &time_value);
1893 fprintf (file, "Basic block jump tracing");
1895 switch (bb_mode & 12)
1898 fprintf (file, " (with call)");
1902 /* Print nothing. */
1906 fprintf (file, " (with call & ret)");
1910 fprintf (file, " (with ret)");
1914 fprintf (file, " finished on %s\n", ctime ((void *) &time_value));
1916 for (i = 0; i < BB_BUCKETS; i++)
1918 struct bb_edge *bucket = bb_hashbuckets[i];
1919 for ( ; bucket; bucket = bucket->next )
1921 if (addr_max < bucket->src_addr)
1922 addr_max = bucket->src_addr;
1923 if (addr_max < bucket->dst_addr)
1924 addr_max = bucket->dst_addr;
1925 if (cnt_max < bucket->count)
1926 cnt_max = bucket->count;
1929 addr_len = num_digits (addr_max, 16);
1930 cnt_len = num_digits (cnt_max, 10);
1932 for ( i = 0; i < BB_BUCKETS; i++)
1934 struct bb_edge *bucket = bb_hashbuckets[i];
1935 for ( ; bucket; bucket = bucket->next )
1938 "Jump from block 0x%.*lx to block 0x%.*lx executed %*lu time(s)\n",
1939 addr_len, bucket->src_addr,
1940 addr_len, bucket->dst_addr,
1941 cnt_len, bucket->count);
1945 fprintf (file, "\n");
1953 /* Free allocated memory. */
1958 struct bb_func *old = f;
1961 if (old->funcname) free (old->funcname);
1962 if (old->filename) free (old->filename);
1973 for (i = 0; i < BB_BUCKETS; i++)
1975 struct bb_edge *old, *bucket = bb_hashbuckets[i];
1980 bucket = bucket->next;
1984 free (bb_hashbuckets);
1987 for (b = bb_head; b; b = b->next)
1988 if (b->flags) free (b->flags);
1991 /* Called once per program. */
1994 __bb_init_prg (void)
1997 char buf[BBINBUFSIZE];
2000 enum bb_func_mode m;
2003 /* Initialize destructor. */
2004 atexit (__bb_exit_func);
2006 if (!(file = fopen ("bb.in", "r")))
2009 while(fgets (buf, BBINBUFSIZE, file) != 0)
2025 if (!strcmp (p, "__bb_trace__"))
2027 else if (!strcmp (p, "__bb_jumps__"))
2029 else if (!strcmp (p, "__bb_hidecall__"))
2031 else if (!strcmp (p, "__bb_showret__"))
2035 struct bb_func *f = (struct bb_func *) malloc (sizeof (struct bb_func));
2039 f->next = bb_func_head;
2040 if ((pos = strchr (p, ':')))
2042 if (!(f->funcname = (char *) malloc (strlen (pos+1)+1)))
2044 strcpy (f->funcname, pos+1);
2046 if ((f->filename = (char *) malloc (l+1)))
2048 strncpy (f->filename, p, l);
2049 f->filename[l] = '\0';
2052 f->filename = (char *) 0;
2056 if (!(f->funcname = (char *) malloc (strlen (p)+1)))
2058 strcpy (f->funcname, p);
2059 f->filename = (char *) 0;
2071 bb_tracefile = gopen ("bbtrace.gz", "w");
2076 bb_tracefile = fopen ("bbtrace", "w");
2078 #endif /* HAVE_POPEN */
2082 bb_hashbuckets = (struct bb_edge **)
2083 malloc (BB_BUCKETS * sizeof (struct bb_edge *));
2085 /* Use a loop here rather than calling bzero to avoid having to
2086 conditionalize its existence. */
2087 for (i = 0; i < BB_BUCKETS; i++)
2088 bb_hashbuckets[i] = 0;
2094 bb_stack = (unsigned long *) malloc (bb_stacksize * sizeof (*bb_stack));
2097 /* Initialize destructor. */
2098 atexit (__bb_exit_trace_func);
2101 /* Called upon entering a basic block. */
2104 __bb_trace_func (void)
2106 struct bb_edge *bucket;
2108 MACHINE_STATE_SAVE("1")
2110 if (!bb_callcount || (__bb.blocks->flags && (__bb.blocks->flags[__bb.blockno] & TRACE_OFF)))
2113 bb_dst = __bb.blocks->addresses[__bb.blockno];
2114 __bb.blocks->counts[__bb.blockno]++;
2118 fwrite (&bb_dst, sizeof (unsigned long), 1, bb_tracefile);
2123 struct bb_edge **startbucket, **oldnext;
2125 oldnext = startbucket
2126 = & bb_hashbuckets[ (((int) bb_src*8) ^ (int) bb_dst) % BB_BUCKETS ];
2127 bucket = *startbucket;
2129 for (bucket = *startbucket; bucket;
2130 oldnext = &(bucket->next), bucket = *oldnext)
2132 if (bucket->src_addr == bb_src
2133 && bucket->dst_addr == bb_dst)
2136 *oldnext = bucket->next;
2137 bucket->next = *startbucket;
2138 *startbucket = bucket;
2143 bucket = (struct bb_edge *) malloc (sizeof (struct bb_edge));
2149 fprintf (stderr, "Profiler: out of memory\n");
2156 bucket->src_addr = bb_src;
2157 bucket->dst_addr = bb_dst;
2158 bucket->next = *startbucket;
2159 *startbucket = bucket;
2170 MACHINE_STATE_RESTORE("1")
2174 /* Called when returning from a function and `__bb_showret__' is set. */
2177 __bb_trace_func_ret (void)
2179 struct bb_edge *bucket;
2181 if (!bb_callcount || (__bb.blocks->flags && (__bb.blocks->flags[__bb.blockno] & TRACE_OFF)))
2186 struct bb_edge **startbucket, **oldnext;
2188 oldnext = startbucket
2189 = & bb_hashbuckets[ (((int) bb_dst * 8) ^ (int) bb_src) % BB_BUCKETS ];
2190 bucket = *startbucket;
2192 for (bucket = *startbucket; bucket;
2193 oldnext = &(bucket->next), bucket = *oldnext)
2195 if (bucket->src_addr == bb_dst
2196 && bucket->dst_addr == bb_src)
2199 *oldnext = bucket->next;
2200 bucket->next = *startbucket;
2201 *startbucket = bucket;
2206 bucket = (struct bb_edge *) malloc (sizeof (struct bb_edge));
2212 fprintf (stderr, "Profiler: out of memory\n");
2219 bucket->src_addr = bb_dst;
2220 bucket->dst_addr = bb_src;
2221 bucket->next = *startbucket;
2222 *startbucket = bucket;
2235 /* Called upon entering the first function of a file. */
2238 __bb_init_file (struct bb *blocks)
2241 const struct bb_func *p;
2242 long blk, ncounts = blocks->ncounts;
2243 const char **functions = blocks->functions;
2245 /* Set up linked list. */
2246 blocks->zero_word = 1;
2247 blocks->next = bb_head;
2252 || !(blocks->flags = (char *) malloc (sizeof (char) * blocks->ncounts)))
2255 for (blk = 0; blk < ncounts; blk++)
2256 blocks->flags[blk] = 0;
2258 for (blk = 0; blk < ncounts; blk++)
2260 for (p = bb_func_head; p; p = p->next)
2262 if (!strcmp (p->funcname, functions[blk])
2263 && (!p->filename || !strcmp (p->filename, blocks->filename)))
2265 blocks->flags[blk] |= p->mode;
2272 /* Called when exiting from a function. */
2275 __bb_trace_ret (void)
2278 MACHINE_STATE_SAVE("2")
2282 if ((bb_mode & 12) && bb_stacksize > bb_callcount)
2284 bb_src = bb_stack[bb_callcount];
2286 __bb_trace_func_ret ();
2292 MACHINE_STATE_RESTORE("2")
2296 /* Called when entering a function. */
2299 __bb_init_trace_func (struct bb *blocks, unsigned long blockno)
2301 static int trace_init = 0;
2303 MACHINE_STATE_SAVE("3")
2305 if (!blocks->zero_word)
2312 __bb_init_file (blocks);
2322 if (bb_callcount >= bb_stacksize)
2324 size_t newsize = bb_callcount + 100;
2326 bb_stack = (unsigned long *) realloc (bb_stack, newsize);
2331 fprintf (stderr, "Profiler: out of memory\n");
2335 goto stack_overflow;
2337 bb_stacksize = newsize;
2339 bb_stack[bb_callcount] = bb_src;
2350 else if (blocks->flags && (blocks->flags[blockno] & TRACE_ON))
2356 bb_stack[bb_callcount] = bb_src;
2359 MACHINE_STATE_RESTORE("3")
2362 #endif /* not inhibit_libc */
2363 #endif /* not BLOCK_PROFILER_CODE */
2366 #ifdef L_clear_cache
2367 /* Clear part of an instruction cache. */
2369 #define INSN_CACHE_PLANE_SIZE (INSN_CACHE_SIZE / INSN_CACHE_DEPTH)
2372 __clear_cache (char *beg __attribute__((__unused__)),
2373 char *end __attribute__((__unused__)))
2375 #ifdef CLEAR_INSN_CACHE
2376 CLEAR_INSN_CACHE (beg, end);
2378 #ifdef INSN_CACHE_SIZE
2379 static char array[INSN_CACHE_SIZE + INSN_CACHE_PLANE_SIZE + INSN_CACHE_LINE_WIDTH];
2380 static int initialized;
2384 typedef (*function_ptr) (void);
2386 #if (INSN_CACHE_SIZE / INSN_CACHE_LINE_WIDTH) < 16
2387 /* It's cheaper to clear the whole cache.
2388 Put in a series of jump instructions so that calling the beginning
2389 of the cache will clear the whole thing. */
2393 int ptr = (((int) array + INSN_CACHE_LINE_WIDTH - 1)
2394 & -INSN_CACHE_LINE_WIDTH);
2395 int end_ptr = ptr + INSN_CACHE_SIZE;
2397 while (ptr < end_ptr)
2399 *(INSTRUCTION_TYPE *)ptr
2400 = JUMP_AHEAD_INSTRUCTION + INSN_CACHE_LINE_WIDTH;
2401 ptr += INSN_CACHE_LINE_WIDTH;
2403 *(INSTRUCTION_TYPE *) (ptr - INSN_CACHE_LINE_WIDTH) = RETURN_INSTRUCTION;
2408 /* Call the beginning of the sequence. */
2409 (((function_ptr) (((int) array + INSN_CACHE_LINE_WIDTH - 1)
2410 & -INSN_CACHE_LINE_WIDTH))
2413 #else /* Cache is large. */
2417 int ptr = (((int) array + INSN_CACHE_LINE_WIDTH - 1)
2418 & -INSN_CACHE_LINE_WIDTH);
2420 while (ptr < (int) array + sizeof array)
2422 *(INSTRUCTION_TYPE *)ptr = RETURN_INSTRUCTION;
2423 ptr += INSN_CACHE_LINE_WIDTH;
2429 /* Find the location in array that occupies the same cache line as BEG. */
2431 offset = ((int) beg & -INSN_CACHE_LINE_WIDTH) & (INSN_CACHE_PLANE_SIZE - 1);
2432 start_addr = (((int) (array + INSN_CACHE_PLANE_SIZE - 1)
2433 & -INSN_CACHE_PLANE_SIZE)
2436 /* Compute the cache alignment of the place to stop clearing. */
2437 #if 0 /* This is not needed for gcc's purposes. */
2438 /* If the block to clear is bigger than a cache plane,
2439 we clear the entire cache, and OFFSET is already correct. */
2440 if (end < beg + INSN_CACHE_PLANE_SIZE)
2442 offset = (((int) (end + INSN_CACHE_LINE_WIDTH - 1)
2443 & -INSN_CACHE_LINE_WIDTH)
2444 & (INSN_CACHE_PLANE_SIZE - 1));
2446 #if INSN_CACHE_DEPTH > 1
2447 end_addr = (start_addr & -INSN_CACHE_PLANE_SIZE) + offset;
2448 if (end_addr <= start_addr)
2449 end_addr += INSN_CACHE_PLANE_SIZE;
2451 for (plane = 0; plane < INSN_CACHE_DEPTH; plane++)
2453 int addr = start_addr + plane * INSN_CACHE_PLANE_SIZE;
2454 int stop = end_addr + plane * INSN_CACHE_PLANE_SIZE;
2456 while (addr != stop)
2458 /* Call the return instruction at ADDR. */
2459 ((function_ptr) addr) ();
2461 addr += INSN_CACHE_LINE_WIDTH;
2464 #else /* just one plane */
2467 /* Call the return instruction at START_ADDR. */
2468 ((function_ptr) start_addr) ();
2470 start_addr += INSN_CACHE_LINE_WIDTH;
2472 while ((start_addr % INSN_CACHE_SIZE) != offset);
2473 #endif /* just one plane */
2474 #endif /* Cache is large */
2475 #endif /* Cache exists */
2476 #endif /* CLEAR_INSN_CACHE */
2479 #endif /* L_clear_cache */
2483 /* Jump to a trampoline, loading the static chain address. */
2485 #if defined(WINNT) && ! defined(__CYGWIN__) && ! defined (_UWIN)
2498 extern int VirtualProtect (char *, int, int, int *) __attribute__((stdcall));
2502 mprotect (char *addr, int len, int prot)
2519 if (VirtualProtect (addr, len, np, &op))
2525 #endif /* WINNT && ! __CYGWIN__ && ! _UWIN */
2527 #ifdef TRANSFER_FROM_TRAMPOLINE
2528 TRANSFER_FROM_TRAMPOLINE
2531 #if defined (NeXT) && defined (__MACH__)
2533 /* Make stack executable so we can call trampolines on stack.
2534 This is called from INITIALIZE_TRAMPOLINE in next.h. */
2538 #include <mach/mach.h>
2542 __enable_execute_stack (char *addr)
2545 char *eaddr = addr + TRAMPOLINE_SIZE;
2546 vm_address_t a = (vm_address_t) addr;
2548 /* turn on execute access on stack */
2549 r = vm_protect (task_self (), a, TRAMPOLINE_SIZE, FALSE, VM_PROT_ALL);
2550 if (r != KERN_SUCCESS)
2552 mach_error("vm_protect VM_PROT_ALL", r);
2556 /* We inline the i-cache invalidation for speed */
2558 #ifdef CLEAR_INSN_CACHE
2559 CLEAR_INSN_CACHE (addr, eaddr);
2561 __clear_cache ((int) addr, (int) eaddr);
2565 #endif /* defined (NeXT) && defined (__MACH__) */
2569 /* Make stack executable so we can call trampolines on stack.
2570 This is called from INITIALIZE_TRAMPOLINE in convex.h. */
2572 #include <sys/mman.h>
2573 #include <sys/vmparam.h>
2574 #include <machine/machparam.h>
2577 __enable_execute_stack (void)
2580 static unsigned lowest = USRSTACK;
2581 unsigned current = (unsigned) &fp & -NBPG;
2583 if (lowest > current)
2585 unsigned len = lowest - current;
2586 mremap (current, &len, PROT_READ | PROT_WRITE | PROT_EXEC, MAP_PRIVATE);
2590 /* Clear instruction cache in case an old trampoline is in it. */
2593 #endif /* __convex__ */
2597 /* Modified from the convex -code above. */
2599 #include <sys/param.h>
2601 #include <sys/m88kbcs.h>
2604 __enable_execute_stack (void)
2607 static unsigned long lowest = USRSTACK;
2608 unsigned long current = (unsigned long) &save_errno & -NBPC;
2610 /* Ignore errno being set. memctl sets errno to EINVAL whenever the
2611 address is seen as 'negative'. That is the case with the stack. */
2614 if (lowest > current)
2616 unsigned len=lowest-current;
2617 memctl(current,len,MCT_TEXT);
2621 memctl(current,NBPC,MCT_TEXT);
2625 #endif /* __sysV88__ */
2629 #include <sys/signal.h>
2632 /* Motorola forgot to put memctl.o in the libp version of libc881.a,
2633 so define it here, because we need it in __clear_insn_cache below */
2634 /* On older versions of this OS, no memctl or MCT_TEXT are defined;
2635 hence we enable this stuff only if MCT_TEXT is #define'd. */
2650 /* Clear instruction cache so we can call trampolines on stack.
2651 This is called from FINALIZE_TRAMPOLINE in mot3300.h. */
2654 __clear_insn_cache (void)
2659 /* Preserve errno, because users would be surprised to have
2660 errno changing without explicitly calling any system-call. */
2663 /* Keep it simple : memctl (MCT_TEXT) always fully clears the insn cache.
2664 No need to use an address derived from _start or %sp, as 0 works also. */
2665 memctl(0, 4096, MCT_TEXT);
2670 #endif /* __sysV68__ */
2674 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
2676 #include <sys/mman.h>
2677 #include <sys/types.h>
2678 #include <sys/param.h>
2679 #include <sys/vmmac.h>
2681 /* Modified from the convex -code above.
2682 mremap promises to clear the i-cache. */
2685 __enable_execute_stack (void)
2688 if (mprotect (((unsigned int)&fp/PAGSIZ)*PAGSIZ, PAGSIZ,
2689 PROT_READ|PROT_WRITE|PROT_EXEC))
2691 perror ("mprotect in __enable_execute_stack");
2696 #endif /* __pyr__ */
2698 #if defined (sony_news) && defined (SYSTYPE_BSD)
2701 #include <sys/types.h>
2702 #include <sys/param.h>
2703 #include <syscall.h>
2704 #include <machine/sysnews.h>
2706 /* cacheflush function for NEWS-OS 4.2.
2707 This function is called from trampoline-initialize code
2708 defined in config/mips/mips.h. */
2711 cacheflush (char *beg, int size, int flag)
2713 if (syscall (SYS_sysnews, NEWS_CACHEFLUSH, beg, size, FLUSH_BCACHE))
2715 perror ("cache_flush");
2721 #endif /* sony_news */
2722 #endif /* L_trampoline */
2727 #include "gbl-ctors.h"
2728 /* Some systems use __main in a way incompatible with its use in gcc, in these
2729 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
2730 give the same symbol without quotes for an alternative entry point. You
2731 must define both, or neither. */
2733 #define NAME__MAIN "__main"
2734 #define SYMBOL__MAIN __main
2737 #ifdef INIT_SECTION_ASM_OP
2738 #undef HAS_INIT_SECTION
2739 #define HAS_INIT_SECTION
2742 #if !defined (HAS_INIT_SECTION) || !defined (OBJECT_FORMAT_ELF)
2744 /* Some ELF crosses use crtstuff.c to provide __CTOR_LIST__, but use this
2745 code to run constructors. In that case, we need to handle EH here, too. */
2747 #ifdef EH_FRAME_SECTION_NAME
2748 #include "unwind-dw2-fde.h"
2749 extern unsigned char __EH_FRAME_BEGIN__[];
2752 /* Run all the global destructors on exit from the program. */
2755 __do_global_dtors (void)
2757 #ifdef DO_GLOBAL_DTORS_BODY
2758 DO_GLOBAL_DTORS_BODY;
2760 static func_ptr *p = __DTOR_LIST__ + 1;
2767 #if defined (EH_FRAME_SECTION_NAME) && !defined (HAS_INIT_SECTION)
2769 static int completed = 0;
2773 __deregister_frame_info (__EH_FRAME_BEGIN__);
2780 #ifndef HAS_INIT_SECTION
2781 /* Run all the global constructors on entry to the program. */
2784 __do_global_ctors (void)
2786 #ifdef EH_FRAME_SECTION_NAME
2788 static struct object object;
2789 __register_frame_info (__EH_FRAME_BEGIN__, &object);
2792 DO_GLOBAL_CTORS_BODY;
2793 atexit (__do_global_dtors);
2795 #endif /* no HAS_INIT_SECTION */
2797 #if !defined (HAS_INIT_SECTION) || defined (INVOKE__main)
2798 /* Subroutine called automatically by `main'.
2799 Compiling a global function named `main'
2800 produces an automatic call to this function at the beginning.
2802 For many systems, this routine calls __do_global_ctors.
2803 For systems which support a .init section we use the .init section
2804 to run __do_global_ctors, so we need not do anything here. */
2809 /* Support recursive calls to `main': run initializers just once. */
2810 static int initialized;
2814 __do_global_ctors ();
2817 #endif /* no HAS_INIT_SECTION or INVOKE__main */
2819 #endif /* L__main */
2820 #endif /* __CYGWIN__ */
2824 #include "gbl-ctors.h"
2826 /* Provide default definitions for the lists of constructors and
2827 destructors, so that we don't get linker errors. These symbols are
2828 intentionally bss symbols, so that gld and/or collect will provide
2829 the right values. */
2831 /* We declare the lists here with two elements each,
2832 so that they are valid empty lists if no other definition is loaded.
2834 If we are using the old "set" extensions to have the gnu linker
2835 collect ctors and dtors, then we __CTOR_LIST__ and __DTOR_LIST__
2836 must be in the bss/common section.
2838 Long term no port should use those extensions. But many still do. */
2839 #if !defined(INIT_SECTION_ASM_OP) && !defined(CTOR_LISTS_DEFINED_EXTERNALLY)
2840 #if defined (TARGET_ASM_CONSTRUCTOR) || defined (USE_COLLECT2)
2841 func_ptr __CTOR_LIST__[2] = {0, 0};
2842 func_ptr __DTOR_LIST__[2] = {0, 0};
2844 func_ptr __CTOR_LIST__[2];
2845 func_ptr __DTOR_LIST__[2];
2847 #endif /* no INIT_SECTION_ASM_OP and not CTOR_LISTS_DEFINED_EXTERNALLY */
2848 #endif /* L_ctors */
2852 #include "gbl-ctors.h"
2860 static func_ptr *atexit_chain = 0;
2861 static long atexit_chain_length = 0;
2862 static volatile long last_atexit_chain_slot = -1;
2865 atexit (func_ptr func)
2867 if (++last_atexit_chain_slot == atexit_chain_length)
2869 atexit_chain_length += 32;
2871 atexit_chain = (func_ptr *) realloc (atexit_chain, atexit_chain_length
2872 * sizeof (func_ptr));
2874 atexit_chain = (func_ptr *) malloc (atexit_chain_length
2875 * sizeof (func_ptr));
2878 atexit_chain_length = 0;
2879 last_atexit_chain_slot = -1;
2884 atexit_chain[last_atexit_chain_slot] = func;
2888 extern void _cleanup (void);
2889 extern void _exit (int) __attribute__ ((__noreturn__));
2896 for ( ; last_atexit_chain_slot-- >= 0; )
2898 (*atexit_chain[last_atexit_chain_slot + 1]) ();
2899 atexit_chain[last_atexit_chain_slot + 1] = 0;
2901 free (atexit_chain);
2914 /* Simple; we just need a wrapper for ON_EXIT. */
2916 atexit (func_ptr func)
2918 return ON_EXIT (func);
2921 #endif /* ON_EXIT */
2922 #endif /* NEED_ATEXIT */