1 /* More subroutines needed by GCC output code on some machines. */
2 /* Compile this one with gcc. */
3 /* Copyright (C) 1989, 1992 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* As a special exception, if you link this library with files
22 compiled with GCC to produce an executable, this does not cause
23 the resulting executable to be covered by the GNU General Public License.
24 This exception does not however invalidate any other reasons why
25 the executable file might be covered by the GNU General Public License. */
27 /* It is incorrect to include config.h here, because this file is being
28 compiled for the target, and hence definitions concerning only the host
37 /* Don't use `fancy_abort' here even if config.h says to use it. */
42 /* In the first part of this file, we are interfacing to calls generated
43 by the compiler itself. These calls pass values into these routines
44 which have very specific modes (rather than very specific types), and
45 these compiler-generated calls also expect any return values to have
46 very specific modes (rather than very specific types). Thus, we need
47 to avoid using regular C language type names in this part of the file
48 because the sizes for those types can be configured to be anything.
49 Instead we use the following special type names. */
51 typedef unsigned int UQItype __attribute__ ((mode (QI)));
52 typedef int SItype __attribute__ ((mode (SI)));
53 typedef unsigned int USItype __attribute__ ((mode (SI)));
54 typedef int DItype __attribute__ ((mode (DI)));
55 typedef unsigned int UDItype __attribute__ ((mode (DI)));
56 typedef float SFtype __attribute__ ((mode (SF)));
57 typedef float DFtype __attribute__ ((mode (DF)));
58 #if LONG_DOUBLE_TYPE_SIZE == 96
59 typedef float XFtype __attribute__ ((mode (XF)));
61 #if LONG_DOUBLE_TYPE_SIZE == 128
62 typedef float TFtype __attribute__ ((mode (TF)));
66 typedef int word_type __attribute__ ((mode (HI)));
69 typedef int word_type __attribute__ ((mode (SI)));
72 typedef int word_type __attribute__ ((mode (DI)));
75 /* Make sure that we don't accidentally use any normal C language built-in
76 type names in the first part of this file. Instead we want to use *only*
77 the type names defined above. The following macro definitions insure
78 that if we *do* accidentally use some normal C language built-in type name,
79 we will get a syntax error. */
81 #define char bogus_type
82 #define short bogus_type
83 #define int bogus_type
84 #define long bogus_type
85 #define unsigned bogus_type
86 #define float bogus_type
87 #define double bogus_type
89 #define SI_TYPE_SIZE (sizeof (SItype) * BITS_PER_UNIT)
91 /* DIstructs are pairs of SItype values in the order determined by
95 struct DIstruct {SItype high, low;};
97 struct DIstruct {SItype low, high;};
100 /* We need this union to unpack/pack DImode values, since we don't have
101 any arithmetic yet. Incoming DImode parameters are stored into the
102 `ll' field, and the unpacked result is read from the struct `s'. */
110 #if defined (L_udivmoddi4) || defined (L_muldi3) || defined (L_udiv_w_sdiv)
112 #include "longlong.h"
114 #endif /* udiv or mul */
116 extern DItype __fixunssfdi (SFtype a);
117 extern DItype __fixunsdfdi (DFtype a);
118 #if LONG_DOUBLE_TYPE_SIZE == 96
119 extern DItype __fixunsxfdi (XFtype a);
121 #if LONG_DOUBLE_TYPE_SIZE == 128
122 extern DItype __fixunstfdi (TFtype a);
125 #if defined (L_negdi2) || defined (L_divdi3) || defined (L_moddi3)
126 #if defined (L_divdi3) || defined (L_moddi3)
139 w.s.high = -uu.s.high - ((USItype) w.s.low > 0);
160 bm = (sizeof (SItype) * BITS_PER_UNIT) - b;
164 w.s.high = (USItype)uu.s.low << -bm;
168 USItype carries = (USItype)uu.s.low >> bm;
169 w.s.low = (USItype)uu.s.low << b;
170 w.s.high = ((USItype)uu.s.high << b) | carries;
192 bm = (sizeof (SItype) * BITS_PER_UNIT) - b;
196 w.s.low = (USItype)uu.s.high >> -bm;
200 USItype carries = (USItype)uu.s.high << bm;
201 w.s.high = (USItype)uu.s.high >> b;
202 w.s.low = ((USItype)uu.s.low >> b) | carries;
224 bm = (sizeof (SItype) * BITS_PER_UNIT) - b;
228 w.s.high = (USItype)uu.s.low << -bm;
232 USItype carries = (USItype)uu.s.low >> bm;
233 w.s.low = (USItype)uu.s.low << b;
234 w.s.high = ((USItype)uu.s.high << b) | carries;
256 bm = (sizeof (SItype) * BITS_PER_UNIT) - b;
259 /* w.s.high = 1..1 or 0..0 */
260 w.s.high = uu.s.high >> (sizeof (SItype) * BITS_PER_UNIT - 1);
261 w.s.low = uu.s.high >> -bm;
265 USItype carries = (USItype)uu.s.high << bm;
266 w.s.high = uu.s.high >> b;
267 w.s.low = ((USItype)uu.s.low >> b) | carries;
282 w.s.low = ffs (uu.s.low);
285 w.s.low = ffs (uu.s.high);
288 w.s.low += BITS_PER_UNIT * sizeof (SItype);
306 w.ll = __umulsidi3 (uu.s.low, vv.s.low);
307 w.s.high += ((USItype) uu.s.low * (USItype) vv.s.high
308 + (USItype) uu.s.high * (USItype) vv.s.low);
316 __udiv_w_sdiv (rp, a1, a0, d)
317 USItype *rp, a1, a0, d;
324 if (a1 < d - a1 - (a0 >> (SI_TYPE_SIZE - 1)))
326 /* dividend, divisor, and quotient are nonnegative */
327 sdiv_qrnnd (q, r, a1, a0, d);
331 /* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d */
332 sub_ddmmss (c1, c0, a1, a0, d >> 1, d << (SI_TYPE_SIZE - 1));
333 /* Divide (c1*2^32 + c0) by d */
334 sdiv_qrnnd (q, r, c1, c0, d);
335 /* Add 2^31 to quotient */
336 q += (USItype) 1 << (SI_TYPE_SIZE - 1);
341 b1 = d >> 1; /* d/2, between 2^30 and 2^31 - 1 */
342 c1 = a1 >> 1; /* A/2 */
343 c0 = (a1 << (SI_TYPE_SIZE - 1)) + (a0 >> 1);
345 if (a1 < b1) /* A < 2^32*b1, so A/2 < 2^31*b1 */
347 sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
349 r = 2*r + (a0 & 1); /* Remainder from A/(2*b1) */
366 else if (c1 < b1) /* So 2^31 <= (A/2)/b1 < 2^32 */
369 c0 = ~c0; /* logical NOT */
371 sdiv_qrnnd (q, r, c1, c0, b1); /* (A/2) / (d/2) */
373 q = ~q; /* (A/2)/b1 */
376 r = 2*r + (a0 & 1); /* A/(2*b1) */
394 else /* Implies c1 = b1 */
395 { /* Hence a1 = d - 1 = 2*b1 - 1 */
415 static const UQItype __clz_tab[] =
417 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,
418 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,
419 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,
420 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,
421 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,
422 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,
423 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,
424 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,
428 __udivmoddi4 (n, d, rp)
435 USItype d0, d1, n0, n1, n2;
447 #if !UDIV_NEEDS_NORMALIZATION
454 udiv_qrnnd (q0, n0, n1, n0, d0);
457 /* Remainder in n0. */
464 d0 = 1 / d0; /* Divide intentionally by zero. */
466 udiv_qrnnd (q1, n1, 0, n1, d0);
467 udiv_qrnnd (q0, n0, n1, n0, d0);
469 /* Remainder in n0. */
480 #else /* UDIV_NEEDS_NORMALIZATION */
488 count_leading_zeros (bm, d0);
492 /* Normalize, i.e. make the most significant bit of the
496 n1 = (n1 << bm) | (n0 >> (SI_TYPE_SIZE - bm));
500 udiv_qrnnd (q0, n0, n1, n0, d0);
503 /* Remainder in n0 >> bm. */
510 d0 = 1 / d0; /* Divide intentionally by zero. */
512 count_leading_zeros (bm, d0);
516 /* From (n1 >= d0) /\ (the most significant bit of d0 is set),
517 conclude (the most significant bit of n1 is set) /\ (the
518 leading quotient digit q1 = 1).
520 This special case is necessary, not an optimization.
521 (Shifts counts of SI_TYPE_SIZE are undefined.) */
530 b = SI_TYPE_SIZE - bm;
534 n1 = (n1 << bm) | (n0 >> b);
537 udiv_qrnnd (q1, n1, n2, n1, d0);
542 udiv_qrnnd (q0, n0, n1, n0, d0);
544 /* Remainder in n0 >> bm. */
554 #endif /* UDIV_NEEDS_NORMALIZATION */
565 /* Remainder in n1n0. */
577 count_leading_zeros (bm, d1);
580 /* From (n1 >= d1) /\ (the most significant bit of d1 is set),
581 conclude (the most significant bit of n1 is set) /\ (the
582 quotient digit q0 = 0 or 1).
584 This special case is necessary, not an optimization. */
586 /* The condition on the next line takes advantage of that
587 n1 >= d1 (true due to program flow). */
588 if (n1 > d1 || n0 >= d0)
591 sub_ddmmss (n1, n0, n1, n0, d1, d0);
610 b = SI_TYPE_SIZE - bm;
612 d1 = (d1 << bm) | (d0 >> b);
615 n1 = (n1 << bm) | (n0 >> b);
618 udiv_qrnnd (q0, n1, n2, n1, d1);
619 umul_ppmm (m1, m0, q0, d0);
621 if (m1 > n1 || (m1 == n1 && m0 > n0))
624 sub_ddmmss (m1, m0, m1, m0, d1, d0);
629 /* Remainder in (n1n0 - m1m0) >> bm. */
632 sub_ddmmss (n1, n0, n1, n0, m1, m0);
633 rr.s.low = (n1 << b) | (n0 >> bm);
634 rr.s.high = n1 >> bm;
648 UDItype __udivmoddi4 ();
663 uu.ll = __negdi2 (uu.ll);
666 vv.ll = __negdi2 (vv.ll);
668 w = __udivmoddi4 (uu.ll, vv.ll, (UDItype *) 0);
677 UDItype __udivmoddi4 ();
691 uu.ll = __negdi2 (uu.ll);
693 vv.ll = __negdi2 (vv.ll);
695 (void) __udivmoddi4 (uu.ll, vv.ll, &w);
704 UDItype __udivmoddi4 ();
711 (void) __udivmoddi4 (u, v, &w);
718 UDItype __udivmoddi4 ();
723 return __udivmoddi4 (n, d, (UDItype *) 0);
734 au.ll = a, bu.ll = b;
736 if (au.s.high < bu.s.high)
738 else if (au.s.high > bu.s.high)
740 if ((USItype) au.s.low < (USItype) bu.s.low)
742 else if ((USItype) au.s.low > (USItype) bu.s.low)
755 au.ll = a, bu.ll = b;
757 if ((USItype) au.s.high < (USItype) bu.s.high)
759 else if ((USItype) au.s.high > (USItype) bu.s.high)
761 if ((USItype) au.s.low < (USItype) bu.s.low)
763 else if ((USItype) au.s.low > (USItype) bu.s.low)
769 #if defined(L_fixunstfdi) && (LONG_DOUBLE_TYPE_SIZE == 128)
770 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
771 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
783 /* Compute high word of result, as a flonum. */
784 b = (a / HIGH_WORD_COEFF);
785 /* Convert that to fixed (but not to DItype!),
786 and shift it into the high word. */
789 /* Remove high part from the TFtype, leaving the low part as flonum. */
791 /* Convert that to fixed (but not to DItype!) and add it in.
792 Sometimes A comes out negative. This is significant, since
793 A has more bits than a long int does. */
795 v -= (USItype) (- a);
802 #if defined(L_fixtfdi) && (LONG_DOUBLE_TYPE_SIZE == 128)
808 return - __fixunstfdi (-a);
809 return __fixunstfdi (a);
813 #if defined(L_fixunsxfdi) && (LONG_DOUBLE_TYPE_SIZE == 96)
814 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
815 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
827 /* Compute high word of result, as a flonum. */
828 b = (a / HIGH_WORD_COEFF);
829 /* Convert that to fixed (but not to DItype!),
830 and shift it into the high word. */
833 /* Remove high part from the XFtype, leaving the low part as flonum. */
835 /* Convert that to fixed (but not to DItype!) and add it in.
836 Sometimes A comes out negative. This is significant, since
837 A has more bits than a long int does. */
839 v -= (USItype) (- a);
846 #if defined(L_fixxfdi) && (LONG_DOUBLE_TYPE_SIZE == 96)
852 return - __fixunsxfdi (-a);
853 return __fixunsxfdi (a);
858 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
859 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
871 /* Compute high word of result, as a flonum. */
872 b = (a / HIGH_WORD_COEFF);
873 /* Convert that to fixed (but not to DItype!),
874 and shift it into the high word. */
877 /* Remove high part from the DFtype, leaving the low part as flonum. */
879 /* Convert that to fixed (but not to DItype!) and add it in.
880 Sometimes A comes out negative. This is significant, since
881 A has more bits than a long int does. */
883 v -= (USItype) (- a);
896 return - __fixunsdfdi (-a);
897 return __fixunsdfdi (a);
902 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
903 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
906 __fixunssfdi (SFtype original_a)
908 /* Convert the SFtype to a DFtype, because that is surely not going
909 to lose any bits. Some day someone else can write a faster version
910 that avoids converting to DFtype, and verify it really works right. */
911 DFtype a = original_a;
918 /* Compute high word of result, as a flonum. */
919 b = (a / HIGH_WORD_COEFF);
920 /* Convert that to fixed (but not to DItype!),
921 and shift it into the high word. */
924 /* Remove high part from the DFtype, leaving the low part as flonum. */
926 /* Convert that to fixed (but not to DItype!) and add it in.
927 Sometimes A comes out negative. This is significant, since
928 A has more bits than a long int does. */
930 v -= (USItype) (- a);
942 return - __fixunssfdi (-a);
943 return __fixunssfdi (a);
947 #if defined(L_floatdixf) && (LONG_DOUBLE_TYPE_SIZE == 96)
948 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
949 #define HIGH_HALFWORD_COEFF (((UDItype) 1) << (WORD_SIZE / 2))
950 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
962 d = (USItype) (u >> WORD_SIZE);
963 d *= HIGH_HALFWORD_COEFF;
964 d *= HIGH_HALFWORD_COEFF;
965 d += (USItype) (u & (HIGH_WORD_COEFF - 1));
967 return (negate ? -d : d);
971 #if defined(L_floatditf) && (LONG_DOUBLE_TYPE_SIZE == 128)
972 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
973 #define HIGH_HALFWORD_COEFF (((UDItype) 1) << (WORD_SIZE / 2))
974 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
986 d = (USItype) (u >> WORD_SIZE);
987 d *= HIGH_HALFWORD_COEFF;
988 d *= HIGH_HALFWORD_COEFF;
989 d += (USItype) (u & (HIGH_WORD_COEFF - 1));
991 return (negate ? -d : d);
996 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
997 #define HIGH_HALFWORD_COEFF (((UDItype) 1) << (WORD_SIZE / 2))
998 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
1010 d = (USItype) (u >> WORD_SIZE);
1011 d *= HIGH_HALFWORD_COEFF;
1012 d *= HIGH_HALFWORD_COEFF;
1013 d += (USItype) (u & (HIGH_WORD_COEFF - 1));
1015 return (negate ? -d : d);
1020 #define WORD_SIZE (sizeof (SItype) * BITS_PER_UNIT)
1021 #define HIGH_HALFWORD_COEFF (((UDItype) 1) << (WORD_SIZE / 2))
1022 #define HIGH_WORD_COEFF (((UDItype) 1) << WORD_SIZE)
1028 /* Do the calculation in DFmode
1029 so that we don't lose any of the precision of the high word
1030 while multiplying it. */
1037 f = (USItype) (u >> WORD_SIZE);
1038 f *= HIGH_HALFWORD_COEFF;
1039 f *= HIGH_HALFWORD_COEFF;
1040 f += (USItype) (u & (HIGH_WORD_COEFF - 1));
1042 return (SFtype) (negate ? -f : f);
1046 #if defined(L_fixunsxfsi) && LONG_DOUBLE_TYPE_SIZE == 96
1047 #include "glimits.h"
1053 if (a >= - (DFtype) LONG_MIN)
1054 return (SItype) (a + LONG_MIN) - LONG_MIN;
1060 #include "glimits.h"
1066 if (a >= - (DFtype) LONG_MIN)
1067 return (SItype) (a + LONG_MIN) - LONG_MIN;
1073 #include "glimits.h"
1076 __fixunssfsi (SFtype a)
1078 if (a >= - (SFtype) LONG_MIN)
1079 return (SItype) (a + LONG_MIN) - LONG_MIN;
1084 /* From here on down, the routines use normal data types. */
1086 #define SItype bogus_type
1087 #define USItype bogus_type
1088 #define DItype bogus_type
1089 #define UDItype bogus_type
1090 #define SFtype bogus_type
1091 #define DFtype bogus_type
1103 /* Like bcmp except the sign is meaningful.
1104 Reult is negative if S1 is less than S2,
1105 positive if S1 is greater, 0 if S1 and S2 are equal. */
1108 __gcc_bcmp (s1, s2, size)
1109 unsigned char *s1, *s2;
1114 unsigned char c1 = *s1++, c2 = *s2++;
1126 #if defined(__svr4__) || defined(__alliant__)
1130 /* The Alliant needs the added underscore. */
1131 asm (".globl __builtin_saveregs");
1132 asm ("__builtin_saveregs:");
1133 asm (".globl ___builtin_saveregs");
1134 asm ("___builtin_saveregs:");
1136 asm (" andnot 0x0f,%sp,%sp"); /* round down to 16-byte boundary */
1137 asm (" adds -96,%sp,%sp"); /* allocate stack space for reg save
1138 area and also for a new va_list
1140 /* Save all argument registers in the arg reg save area. The
1141 arg reg save area must have the following layout (according
1153 asm (" fst.q %f8, 0(%sp)"); /* save floating regs (f8-f15) */
1154 asm (" fst.q %f12,16(%sp)");
1156 asm (" st.l %r16,32(%sp)"); /* save integer regs (r16-r27) */
1157 asm (" st.l %r17,36(%sp)");
1158 asm (" st.l %r18,40(%sp)");
1159 asm (" st.l %r19,44(%sp)");
1160 asm (" st.l %r20,48(%sp)");
1161 asm (" st.l %r21,52(%sp)");
1162 asm (" st.l %r22,56(%sp)");
1163 asm (" st.l %r23,60(%sp)");
1164 asm (" st.l %r24,64(%sp)");
1165 asm (" st.l %r25,68(%sp)");
1166 asm (" st.l %r26,72(%sp)");
1167 asm (" st.l %r27,76(%sp)");
1169 asm (" adds 80,%sp,%r16"); /* compute the address of the new
1170 va_list structure. Put in into
1171 r16 so that it will be returned
1174 /* Initialize all fields of the new va_list structure. This
1175 structure looks like:
1178 unsigned long ireg_used;
1179 unsigned long freg_used;
1185 asm (" st.l %r0, 0(%r16)"); /* nfixed */
1186 asm (" st.l %r0, 4(%r16)"); /* nfloating */
1187 asm (" st.l %sp, 8(%r16)"); /* __va_ctl points to __va_struct. */
1188 asm (" bri %r1"); /* delayed return */
1189 asm (" st.l %r28,12(%r16)"); /* pointer to overflow args */
1191 #else /* not __svr4__ */
1195 asm (".globl ___builtin_saveregs");
1196 asm ("___builtin_saveregs:");
1197 asm (" mov sp,r30");
1198 asm (" andnot 0x0f,sp,sp");
1199 asm (" adds -96,sp,sp"); /* allocate sufficient space on the stack */
1201 /* Fill in the __va_struct. */
1202 asm (" st.l r16, 0(sp)"); /* save integer regs (r16-r27) */
1203 asm (" st.l r17, 4(sp)"); /* int fixed[12] */
1204 asm (" st.l r18, 8(sp)");
1205 asm (" st.l r19,12(sp)");
1206 asm (" st.l r20,16(sp)");
1207 asm (" st.l r21,20(sp)");
1208 asm (" st.l r22,24(sp)");
1209 asm (" st.l r23,28(sp)");
1210 asm (" st.l r24,32(sp)");
1211 asm (" st.l r25,36(sp)");
1212 asm (" st.l r26,40(sp)");
1213 asm (" st.l r27,44(sp)");
1215 asm (" fst.q f8, 48(sp)"); /* save floating regs (f8-f15) */
1216 asm (" fst.q f12,64(sp)"); /* int floating[8] */
1218 /* Fill in the __va_ctl. */
1219 asm (" st.l sp, 80(sp)"); /* __va_ctl points to __va_struct. */
1220 asm (" st.l r28,84(sp)"); /* pointer to more args */
1221 asm (" st.l r0, 88(sp)"); /* nfixed */
1222 asm (" st.l r0, 92(sp)"); /* nfloating */
1224 asm (" adds 80,sp,r16"); /* return address of the __va_ctl. */
1226 asm (" mov r30,sp");
1227 /* recover stack and pass address to start
1229 #endif /* not __svr4__ */
1230 #else /* not __i860__ */
1232 asm (".global __builtin_saveregs");
1233 asm ("__builtin_saveregs:");
1234 asm (".global ___builtin_saveregs");
1235 asm ("___builtin_saveregs:");
1236 #ifdef NEED_PROC_COMMAND
1239 asm ("st %i0,[%fp+68]");
1240 asm ("st %i1,[%fp+72]");
1241 asm ("st %i2,[%fp+76]");
1242 asm ("st %i3,[%fp+80]");
1243 asm ("st %i4,[%fp+84]");
1245 asm ("st %i5,[%fp+88]");
1246 #ifdef NEED_TYPE_COMMAND
1247 asm (".type __builtin_saveregs,#function");
1248 asm (".size __builtin_saveregs,.-__builtin_saveregs");
1250 #else /* not __sparc__ */
1251 #if defined(__MIPSEL__) | defined(__R3000__) | defined(__R2000__) | defined(__mips__)
1254 asm (" .ent __builtin_saveregs");
1255 asm (" .globl __builtin_saveregs");
1256 asm ("__builtin_saveregs:");
1257 asm (" sw $4,0($30)");
1258 asm (" sw $5,4($30)");
1259 asm (" sw $6,8($30)");
1260 asm (" sw $7,12($30)");
1262 asm (" .end __builtin_saveregs");
1263 #else /* not __mips__, etc. */
1264 __builtin_saveregs ()
1268 #endif /* not __mips__ */
1269 #endif /* not __sparc__ */
1270 #endif /* not __i860__ */
1274 #ifndef inhibit_libc
1276 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1278 /* This is used by the `assert' macro. */
1280 __eprintf (string, expression, line, filename)
1282 const char *expression;
1284 const char *filename;
1286 fprintf (stderr, string, expression, line, filename);
1296 /* Structure emitted by -a */
1300 const char *filename;
1304 const unsigned long *addresses;
1306 /* Older GCC's did not emit these fields. */
1308 const char **functions;
1309 const long *line_nums;
1310 const char **filenames;
1313 #ifdef BLOCK_PROFILER_CODE
1317 /* Simple minded basic block profiling output dumper for
1318 systems that don't provde tcov support. At present,
1319 it requires atexit and stdio. */
1324 extern void atexit (void (*) (void));
1325 #define ON_EXIT(FUNC,ARG) atexit ((FUNC))
1328 extern void on_exit (void*, void*);
1329 #define ON_EXIT(FUNC,ARG) on_exit ((FUNC), (ARG))
1333 static struct bb *bb_head = (struct bb *)0;
1335 /* Return the number of digits needed to print a value */
1336 /* __inline__ */ static int num_digits (long value, int base)
1338 int minus = (value < 0 && base != 16);
1339 unsigned long v = (minus) ? -value : value;
1353 __bb_exit_func (void)
1355 FILE *file = fopen ("bb.out", "a");
1365 /* This is somewhat type incorrect, but it avoids worrying about
1366 exactly where time.h is included from. It should be ok unless
1367 a void * differs from other pointer formats, or if sizeof(long)
1368 is < sizeof (time_t). It would be nice if we could assume the
1369 use of rationale standards here. */
1371 time((void *) &time_value);
1372 fprintf (file, "Basic block profiling finished on %s\n", ctime ((void *) &time_value));
1374 /* We check the length field explicitly in order to allow compatibility
1375 with older GCC's which did not provide it. */
1377 for (ptr = bb_head; ptr != (struct bb *)0; ptr = ptr->next)
1380 int func_p = (ptr->nwords >= sizeof (struct bb) && ptr->nwords <= 1000);
1381 int line_p = (func_p && ptr->line_nums);
1382 int file_p = (func_p && ptr->filenames);
1383 long ncounts = ptr->ncounts;
1389 int blk_len = num_digits (ncounts, 10);
1394 fprintf (file, "File %s, %ld basic blocks \n\n",
1395 ptr->filename, ncounts);
1397 /* Get max values for each field. */
1398 for (i = 0; i < ncounts; i++)
1403 if (cnt_max < ptr->counts[i])
1404 cnt_max = ptr->counts[i];
1406 if (addr_max < ptr->addresses[i])
1407 addr_max = ptr->addresses[i];
1409 if (line_p && line_max < ptr->line_nums[i])
1410 line_max = ptr->line_nums[i];
1414 p = (ptr->functions[i]) ? (ptr->functions[i]) : "<none>";
1422 p = (ptr->filenames[i]) ? (ptr->filenames[i]) : "<none>";
1429 addr_len = num_digits (addr_max, 16);
1430 cnt_len = num_digits (cnt_max, 10);
1431 line_len = num_digits (line_max, 10);
1433 /* Now print out the basic block information. */
1434 for (i = 0; i < ncounts; i++)
1437 " Block #%*d: executed %*ld time(s) address= 0x%.*lx",
1439 cnt_len, ptr->counts[i],
1440 addr_len, ptr->addresses[i]);
1443 fprintf (file, " function= %-*s", func_len,
1444 (ptr->functions[i]) ? ptr->functions[i] : "<none>");
1447 fprintf (file, " line= %*d", line_len, ptr->line_nums[i]);
1450 fprintf (file, " file= %s",
1451 (ptr->filenames[i]) ? ptr->filenames[i] : "<none>");
1453 fprintf (file, "\n");
1456 fprintf (file, "\n");
1460 fprintf (file, "\n\n");
1466 __bb_init_func (struct bb *blocks)
1468 /* User is supposed to check whether the first word is non-0,
1469 but just in case.... */
1471 if (blocks->zero_word)
1475 /* Initialize destructor. */
1477 ON_EXIT (__bb_exit_func, 0);
1480 /* Set up linked list. */
1481 blocks->zero_word = 1;
1482 blocks->next = bb_head;
1486 #endif /* !BLOCK_PROFILER_CODE */
1489 /* frills for C++ */
1492 typedef void (*vfp)(void);
1494 extern vfp __new_handler;
1496 /* void * operator new (size_t sz) */
1498 __builtin_new (size_t sz)
1502 /* malloc (0) is unpredictable; avoid it. */
1505 p = (void *) malloc (sz);
1507 (*__new_handler) ();
1510 #endif /* L_op_new */
1512 #ifdef L_new_handler
1514 #ifndef inhibit_libc
1515 /* This gets us __GNU_LIBRARY__. */
1516 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1519 #ifdef __GNU_LIBRARY__
1520 /* Avoid forcing the library's meaning of `write' on the user program
1521 by using the "internal" name (for use within the library) */
1522 #define write(fd, buf, n) __write((fd), (buf), (n))
1524 #endif /* inhibit_libc */
1526 typedef void (*vfp)(void);
1528 extern void *__builtin_new (size_t);
1529 static void default_new_handler (void);
1531 vfp __new_handler = default_new_handler;
1534 __set_new_handler (handler)
1539 prev_handler = __new_handler;
1540 if (handler == 0) handler = default_new_handler;
1541 __new_handler = handler;
1542 return prev_handler;
1546 set_new_handler (handler)
1549 return __set_new_handler (handler);
1552 #define MESSAGE "Virtual memory exceeded in `new'\n"
1555 default_new_handler ()
1557 /* don't use fprintf (stderr, ...) because it may need to call malloc. */
1558 /* This should really print the name of the program, but that is hard to
1559 do. We need a standard, clean way to get at the name. */
1560 write (2, MESSAGE, sizeof (MESSAGE));
1561 /* don't call exit () because that may call global destructors which
1562 may cause a loop. */
1568 /* void operator delete (void *ptr) */
1570 __builtin_delete (void *ptr)
1578 unsigned int __shtab[] = {
1579 0x00000001, 0x00000002, 0x00000004, 0x00000008,
1580 0x00000010, 0x00000020, 0x00000040, 0x00000080,
1581 0x00000100, 0x00000200, 0x00000400, 0x00000800,
1582 0x00001000, 0x00002000, 0x00004000, 0x00008000,
1583 0x00010000, 0x00020000, 0x00040000, 0x00080000,
1584 0x00100000, 0x00200000, 0x00400000, 0x00800000,
1585 0x01000000, 0x02000000, 0x04000000, 0x08000000,
1586 0x10000000, 0x20000000, 0x40000000, 0x80000000
1590 #ifdef L_clear_cache
1591 /* Clear part of an instruction cache. */
1593 #define INSN_CACHE_PLANE_SIZE (INSN_CACHE_SIZE / INSN_CACHE_DEPTH)
1596 __clear_cache (beg, end)
1599 #ifdef INSN_CACHE_SIZE
1600 static char array[INSN_CACHE_SIZE + INSN_CACHE_PLANE_SIZE + INSN_CACHE_LINE_WIDTH];
1601 static int initialized = 0;
1605 typedef (*function_ptr) ();
1607 #if (INSN_CACHE_SIZE / INSN_CACHE_LINE_WIDTH) < 16
1608 /* It's cheaper to clear the whole cache.
1609 Put in a series of jump instructions so that calling the beginning
1610 of the cache will clear the whole thing. */
1614 int ptr = (((int) array + INSN_CACHE_LINE_WIDTH - 1)
1615 & -INSN_CACHE_LINE_WIDTH);
1616 int end_ptr = ptr + INSN_CACHE_SIZE;
1618 while (ptr < end_ptr)
1620 *(INSTRUCTION_TYPE *)ptr
1621 = JUMP_AHEAD_INSTRUCTION + INSN_CACHE_LINE_WIDTH;
1622 ptr += INSN_CACHE_LINE_WIDTH;
1624 *(INSTRUCTION_TYPE *)(ptr - INSN_CACHE_LINE_WIDTH) = RETURN_INSTRUCTION;
1629 /* Call the beginning of the sequence. */
1630 (((function_ptr) (((int) array + INSN_CACHE_LINE_WIDTH - 1)
1631 & -INSN_CACHE_LINE_WIDTH))
1634 #else /* Cache is large. */
1638 int ptr = (((int) array + INSN_CACHE_LINE_WIDTH - 1)
1639 & -INSN_CACHE_LINE_WIDTH);
1641 while (ptr < (int) array + sizeof array)
1643 *(INSTRUCTION_TYPE *)ptr = RETURN_INSTRUCTION;
1644 ptr += INSN_CACHE_LINE_WIDTH;
1650 /* Find the location in array that occupies the same cache line as BEG. */
1652 offset = ((int) beg & -INSN_CACHE_LINE_WIDTH) & (INSN_CACHE_PLANE_SIZE - 1);
1653 start_addr = (((int) (array + INSN_CACHE_PLANE_SIZE - 1)
1654 & -INSN_CACHE_PLANE_SIZE)
1657 /* Compute the cache alignment of the place to stop clearing. */
1658 #if 0 /* This is not needed for gcc's purposes. */
1659 /* If the block to clear is bigger than a cache plane,
1660 we clear the entire cache, and OFFSET is already correct. */
1661 if (end < beg + INSN_CACHE_PLANE_SIZE)
1663 offset = (((int) (end + INSN_CACHE_LINE_WIDTH - 1)
1664 & -INSN_CACHE_LINE_WIDTH)
1665 & (INSN_CACHE_PLANE_SIZE - 1));
1667 #if INSN_CACHE_DEPTH > 1
1668 end_addr = (start_addr & -INSN_CACHE_PLANE_SIZE) + offset;
1669 if (end_addr <= start_addr)
1670 end_addr += INSN_CACHE_PLANE_SIZE;
1672 for (plane = 0; plane < INSN_CACHE_DEPTH; plane++)
1674 int addr = start_addr + plane * INSN_CACHE_PLANE_SIZE;
1675 int stop = end_addr + plane * INSN_CACHE_PLANE_SIZE;
1677 while (addr != stop)
1679 /* Call the return instruction at ADDR. */
1680 ((function_ptr) addr) ();
1682 addr += INSN_CACHE_LINE_WIDTH;
1685 #else /* just one plane */
1688 /* Call the return instruction at START_ADDR. */
1689 ((function_ptr) start_addr) ();
1691 start_addr += INSN_CACHE_LINE_WIDTH;
1693 while ((start_addr % INSN_CACHE_SIZE) != offset);
1694 #endif /* just one plane */
1695 #endif /* Cache is large */
1696 #endif /* Cache exists */
1699 #endif /* L_clear_cache */
1703 /* Jump to a trampoline, loading the static chain address. */
1705 #ifdef TRANSFER_FROM_TRAMPOLINE
1706 TRANSFER_FROM_TRAMPOLINE
1711 /* Make stack executable so we can call trampolines on stack.
1712 This is called from INITIALIZE_TRAMPOLINE in convex.h. */
1714 #include <sys/mman.h>
1715 #include <sys/vmparam.h>
1716 #include <machine/machparam.h>
1719 __enable_execute_stack ()
1722 static unsigned lowest = USRSTACK;
1723 unsigned current = (unsigned) &fp & -NBPG;
1725 if (lowest > current)
1727 unsigned len = lowest - current;
1728 mremap (current, &len, PROT_READ | PROT_WRITE | PROT_EXEC, MAP_PRIVATE);
1732 /* Clear instruction cache in case an old trampoline is in it. */
1735 #endif /* __convex__ */
1739 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1741 #include <sys/mman.h>
1742 #include <sys/types.h>
1743 #include <sys/param.h>
1744 #include <sys/vmmac.h>
1746 /* Modified from the convex -code above.
1747 mremap promises to clear the i-cache. */
1750 __enable_execute_stack ()
1753 if (mprotect (((unsigned int)&fp/PAGSIZ)*PAGSIZ, PAGSIZ,
1754 PROT_READ|PROT_WRITE|PROT_EXEC))
1756 perror ("mprotect in __enable_execute_stack");
1761 #endif /* __pyr__ */
1762 #endif /* L_trampoline */
1766 #include "gbl-ctors.h"
1767 /* Some systems use __main in a way incompatible with its use in gcc, in these
1768 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
1769 give the same symbol without quotes for an alternative entry point. You
1770 must define both, or niether. */
1772 #define NAME__MAIN "__main"
1773 #define SYMBOL__MAIN __main
1776 /* Run all the global destructors on exit from the program. */
1779 __do_global_dtors ()
1781 #ifdef DO_GLOBAL_DTORS_BODY
1782 DO_GLOBAL_DTORS_BODY;
1784 unsigned nptrs = (unsigned HOST_WIDE_INT) __DTOR_LIST__[0];
1787 /* Some systems place the number of pointers
1788 in the first word of the table.
1789 On other systems, that word is -1.
1790 In all cases, the table is null-terminated. */
1792 /* If the length is not recorded, count up to the null. */
1794 for (nptrs = 0; __DTOR_LIST__[nptrs + 1] != 0; nptrs++);
1796 /* GNU LD format. */
1797 for (i = nptrs; i >= 1; i--)
1798 __DTOR_LIST__[i] ();
1802 #ifndef INIT_SECTION_ASM_OP
1803 /* Run all the global constructors on entry to the program. */
1806 #define ON_EXIT(a, b)
1808 /* Make sure the exit routine is pulled in to define the globals as
1809 bss symbols, just in case the linker does not automatically pull
1810 bss definitions from the library. */
1812 extern int _exit_dummy_decl;
1813 int *_exit_dummy_ref = &_exit_dummy_decl;
1814 #endif /* ON_EXIT */
1817 __do_global_ctors ()
1819 DO_GLOBAL_CTORS_BODY;
1820 ON_EXIT (__do_global_dtors, 0);
1822 #endif /* no INIT_SECTION_ASM_OP */
1824 #if !defined (INIT_SECTION_ASM_OP) || defined (INVOKE__main)
1825 /* Subroutine called automatically by `main'.
1826 Compiling a global function named `main'
1827 produces an automatic call to this function at the beginning.
1829 For many systems, this routine calls __do_global_ctors.
1830 For systems which support a .init section we use the .init section
1831 to run __do_global_ctors, so we need not do anything here. */
1836 /* Support recursive calls to `main': run initializers just once. */
1837 static int initialized = 0;
1841 __do_global_ctors ();
1844 #endif /* no INIT_SECTION_ASM_OP or INVOKE__main */
1846 #endif /* L__main */
1850 #include "gbl-ctors.h"
1852 /* Provide default definitions for the lists of constructors and
1853 destructors, so that we don't get linker errors. These symbols are
1854 intentionally bss symbols, so that gld and/or collect will provide
1855 the right values. */
1857 /* We declare the lists here with two elements each,
1858 so that they are valid empty lists if no other definition is loaded. */
1859 #if !defined(INIT_SECTION_ASM_OP) && !defined(CTOR_LISTS_DEFINED_EXTERNALLY)
1861 /* After 2.3, try this definition on all systems. */
1862 func_ptr __CTOR_LIST__[2] = {0, 0};
1863 func_ptr __DTOR_LIST__[2] = {0, 0};
1865 func_ptr __CTOR_LIST__[2];
1866 func_ptr __DTOR_LIST__[2];
1868 #endif /* no INIT_SECTION_ASM_OP and not CTOR_LISTS_DEFINED_EXTERNALLY */
1869 #endif /* L_ctors */
1873 #include "gbl-ctors.h"
1877 /* If we have no known way of registering our own __do_global_dtors
1878 routine so that it will be invoked at program exit time, then we
1879 have to define our own exit routine which will get this to happen. */
1881 extern void __do_global_dtors ();
1882 extern void _cleanup ();
1883 extern volatile void _exit ();
1889 __do_global_dtors ();
1899 int _exit_dummy_decl = 0; /* prevent compiler & linker warnings */
1904 /* In a.out systems, we need to have these dummy constructor and destructor
1905 lists in the library.
1907 When using `collect', the first link will resolve __CTOR_LIST__
1908 and __DTOR_LIST__ to these symbols. We will then run "nm" on the
1909 result, build the correct __CTOR_LIST__ and __DTOR_LIST__, and relink.
1910 Since we don't do the second link if no constructors existed, these
1911 dummies must be fully functional empty lists.
1913 When using `gnu ld', these symbols will be used if there are no
1914 constructors. If there are constructors, the N_SETV symbol defined
1915 by the linker from the N_SETT's in input files will define __CTOR_LIST__
1916 and __DTOR_LIST__ rather than its being allocated as common storage
1917 by the definitions below.
1919 When using a linker that supports constructor and destructor segments,
1920 these definitions will not be used, since crtbegin.o and crtend.o
1921 (from crtstuff.c) will have already defined __CTOR_LIST__ and
1922 __DTOR_LIST__. The crt*.o files are passed directly to the linker
1923 on its command line, by gcc. */
1925 /* The list needs two elements: one is ignored (the old count); the
1926 second is the terminating zero. Since both values are zero, this
1927 declaration is not initialized, and it becomes `common'. */
1930 #include "gbl-ctors.h"
1931 func_ptr __CTOR_LIST__[2];
1935 #include "gbl-ctors.h"
1936 func_ptr __DTOR_LIST__[2];