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)
1069 #define DI_SIZE (sizeof (DWtype) * BITS_PER_UNIT)
1070 #define DF_SIZE DBL_MANT_DIG
1071 #define SF_SIZE FLT_MANT_DIG
1074 __floatdisf (DWtype u
)
1076 /* Do the calculation in DFmode
1077 so that we don't lose any of the precision of the high word
1078 while multiplying it. */
1081 /* Protect against double-rounding error.
1082 Represent any low-order bits, that might be truncated in DFmode,
1083 by a bit that won't be lost. The bit can go in anywhere below the
1084 rounding position of the SFmode. A fixed mask and bit position
1085 handles all usual configurations. It doesn't handle the case
1086 of 128-bit DImode, however. */
1087 if (DF_SIZE
< DI_SIZE
1088 && DF_SIZE
> (DI_SIZE
- DF_SIZE
+ SF_SIZE
))
1090 #define REP_BIT ((UDWtype) 1 << (DI_SIZE - DF_SIZE))
1091 if (! (- ((DWtype
) 1 << DF_SIZE
) < u
1092 && u
< ((DWtype
) 1 << DF_SIZE
)))
1094 if ((UDWtype
) u
& (REP_BIT
- 1))
1098 f
= (Wtype
) (u
>> WORD_SIZE
);
1099 f
*= HIGH_HALFWORD_COEFF
;
1100 f
*= HIGH_HALFWORD_COEFF
;
1101 f
+= (UWtype
) (u
& (HIGH_WORD_COEFF
- 1));
1107 #if defined(L_fixunsxfsi) && LIBGCC2_LONG_DOUBLE_TYPE_SIZE == 96
1108 /* Reenable the normal types, in case limits.h needs them. */
1121 __fixunsxfSI (XFtype a
)
1123 if (a
>= - (DFtype
) Wtype_MIN
)
1124 return (Wtype
) (a
+ Wtype_MIN
) - Wtype_MIN
;
1130 /* Reenable the normal types, in case limits.h needs them. */
1143 __fixunsdfSI (DFtype a
)
1145 if (a
>= - (DFtype
) Wtype_MIN
)
1146 return (Wtype
) (a
+ Wtype_MIN
) - Wtype_MIN
;
1152 /* Reenable the normal types, in case limits.h needs them. */
1165 __fixunssfSI (SFtype a
)
1167 if (a
>= - (SFtype
) Wtype_MIN
)
1168 return (Wtype
) (a
+ Wtype_MIN
) - Wtype_MIN
;
1173 /* From here on down, the routines use normal data types. */
1175 #define SItype bogus_type
1176 #define USItype bogus_type
1177 #define DItype bogus_type
1178 #define UDItype bogus_type
1179 #define SFtype bogus_type
1180 #define DFtype bogus_type
1198 /* Like bcmp except the sign is meaningful.
1199 Result is negative if S1 is less than S2,
1200 positive if S1 is greater, 0 if S1 and S2 are equal. */
1203 __gcc_bcmp (const unsigned char *s1
, const unsigned char *s2
, size_t size
)
1207 unsigned char c1
= *s1
++, c2
= *s2
++;
1217 /* __eprintf used to be used by GCC's private version of <assert.h>.
1218 We no longer provide that header, but this routine remains in libgcc.a
1219 for binary backward compatibility. Note that it is not included in
1220 the shared version of libgcc. */
1222 #ifndef inhibit_libc
1224 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1228 __eprintf (const char *string
, const char *expression
,
1229 unsigned int line
, const char *filename
)
1231 fprintf (stderr
, string
, expression
, line
, filename
);
1241 struct bb_function_info
{
1247 /* Structure emitted by -a */
1251 const char *filename
;
1256 /* Older GCC's did not emit these fields. */
1258 struct bb_function_info
*function_infos
;
1261 #ifndef inhibit_libc
1263 /* Simple minded basic block profiling output dumper for
1264 systems that don't provide tcov support. At present,
1265 it requires atexit and stdio. */
1267 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1270 #include "gbl-ctors.h"
1271 #include "gcov-io.h"
1273 #ifdef TARGET_HAS_F_SETLKW
1280 static struct bb
*bb_head
;
1282 int __global_counters
= 0, __gthreads_active
= 0;
1285 __bb_exit_func (void)
1289 long n_counters_p
= 0;
1290 gcov_type max_counter_p
= 0;
1291 gcov_type sum_counters_p
= 0;
1296 /* Calculate overall "statistics". */
1298 for (ptr
= bb_head
; ptr
!= (struct bb
*) 0; ptr
= ptr
->next
)
1302 n_counters_p
+= ptr
->ncounts
;
1304 for (i
= 0; i
< ptr
->ncounts
; i
++)
1306 sum_counters_p
+= ptr
->counts
[i
];
1308 if (ptr
->counts
[i
] > max_counter_p
)
1309 max_counter_p
= ptr
->counts
[i
];
1313 for (ptr
= bb_head
; ptr
!= (struct bb
*) 0; ptr
= ptr
->next
)
1315 gcov_type max_counter_o
= 0;
1316 gcov_type sum_counters_o
= 0;
1319 /* Calculate the per-object statistics. */
1321 for (i
= 0; i
< ptr
->ncounts
; i
++)
1323 sum_counters_o
+= ptr
->counts
[i
];
1325 if (ptr
->counts
[i
] > max_counter_o
)
1326 max_counter_o
= ptr
->counts
[i
];
1329 /* open the file for appending, creating it if necessary. */
1330 da_file
= fopen (ptr
->filename
, "ab");
1331 /* Some old systems might not allow the 'b' mode modifier.
1332 Therefore, try to open without it. This can lead to a race
1333 condition so that when you delete and re-create the file, the
1334 file might be opened in text mode, but then, you shouldn't
1335 delete the file in the first place. */
1337 da_file
= fopen (ptr
->filename
, "a");
1340 fprintf (stderr
, "arc profiling: Can't open output file %s.\n",
1345 /* After a fork, another process might try to read and/or write
1346 the same file simultanously. So if we can, lock the file to
1347 avoid race conditions. */
1348 #if defined (TARGET_HAS_F_SETLKW)
1350 struct flock s_flock
;
1352 s_flock
.l_type
= F_WRLCK
;
1353 s_flock
.l_whence
= SEEK_SET
;
1354 s_flock
.l_start
= 0;
1356 s_flock
.l_pid
= getpid ();
1358 while (fcntl (fileno (da_file
), F_SETLKW
, &s_flock
)
1363 if (__write_long (-123, da_file
, 4) != 0) /* magic */
1365 fprintf (stderr
, "arc profiling: Error writing output file %s.\n",
1371 struct bb_function_info
*fn_info
;
1372 gcov_type
*count_ptr
= ptr
->counts
;
1374 int count_functions
= 0;
1376 for (fn_info
= ptr
->function_infos
; fn_info
->arc_count
!= -1;
1380 /* number of functions in this block. */
1381 __write_long (count_functions
, da_file
, 4);
1383 /* length of extra data in bytes. */
1384 __write_long ((4 + 8 + 8) + (4 + 8 + 8), da_file
, 4);
1386 /* overall statistics. */
1387 /* number of counters. */
1388 __write_long (n_counters_p
, da_file
, 4);
1389 /* sum of counters. */
1390 __write_gcov_type (sum_counters_p
, da_file
, 8);
1391 /* maximal counter. */
1392 __write_gcov_type (max_counter_p
, da_file
, 8);
1394 /* per-object statistics. */
1395 /* number of counters. */
1396 __write_long (ptr
->ncounts
, da_file
, 4);
1397 /* sum of counters. */
1398 __write_gcov_type (sum_counters_o
, da_file
, 8);
1399 /* maximal counter. */
1400 __write_gcov_type (max_counter_o
, da_file
, 8);
1402 /* write execution counts for each function. */
1404 for (fn_info
= ptr
->function_infos
; fn_info
->arc_count
!= -1;
1408 if (__write_gcov_string
1409 (fn_info
->name
, strlen (fn_info
->name
), da_file
, -1) != 0)
1412 "arc profiling: Error writing output file %s.\n",
1417 if (__write_long (fn_info
->checksum
, da_file
, 4) != 0)
1420 "arc profiling: Error writing output file %s.\n",
1425 if (__write_long (fn_info
->arc_count
, da_file
, 4) != 0)
1428 "arc profiling: Error writing output file %s.\n",
1433 for (i
= fn_info
->arc_count
; i
> 0; i
--, count_ptr
++)
1435 if (__write_gcov_type (*count_ptr
, da_file
, 8) != 0)
1439 if (i
) /* there was an error */
1442 "arc profiling: Error writing output file %s.\n",
1449 if (fclose (da_file
) != 0)
1450 fprintf (stderr
, "arc profiling: Error closing output file %s.\n",
1456 __bb_init_func (struct bb
*blocks
)
1458 /* User is supposed to check whether the first word is non-0,
1459 but just in case.... */
1461 if (blocks
->zero_word
)
1464 /* Initialize destructor and per-thread data. */
1466 atexit (__bb_exit_func
);
1468 /* Set up linked list. */
1469 blocks
->zero_word
= 1;
1470 blocks
->next
= bb_head
;
1474 /* Called before fork or exec - write out profile information gathered so
1475 far and reset it to zero. This avoids duplication or loss of the
1476 profile information gathered so far. */
1478 __bb_fork_func (void)
1483 for (ptr
= bb_head
; ptr
!= (struct bb
*) 0; ptr
= ptr
->next
)
1486 for (i
= ptr
->ncounts
- 1; i
>= 0; i
--)
1491 #endif /* not inhibit_libc */
1494 #ifdef L_clear_cache
1495 /* Clear part of an instruction cache. */
1497 #define INSN_CACHE_PLANE_SIZE (INSN_CACHE_SIZE / INSN_CACHE_DEPTH)
1500 __clear_cache (char *beg
__attribute__((__unused__
)),
1501 char *end
__attribute__((__unused__
)))
1503 #ifdef CLEAR_INSN_CACHE
1504 CLEAR_INSN_CACHE (beg
, end
);
1506 #ifdef INSN_CACHE_SIZE
1507 static char array
[INSN_CACHE_SIZE
+ INSN_CACHE_PLANE_SIZE
+ INSN_CACHE_LINE_WIDTH
];
1508 static int initialized
;
1512 typedef (*function_ptr
) (void);
1514 #if (INSN_CACHE_SIZE / INSN_CACHE_LINE_WIDTH) < 16
1515 /* It's cheaper to clear the whole cache.
1516 Put in a series of jump instructions so that calling the beginning
1517 of the cache will clear the whole thing. */
1521 int ptr
= (((int) array
+ INSN_CACHE_LINE_WIDTH
- 1)
1522 & -INSN_CACHE_LINE_WIDTH
);
1523 int end_ptr
= ptr
+ INSN_CACHE_SIZE
;
1525 while (ptr
< end_ptr
)
1527 *(INSTRUCTION_TYPE
*)ptr
1528 = JUMP_AHEAD_INSTRUCTION
+ INSN_CACHE_LINE_WIDTH
;
1529 ptr
+= INSN_CACHE_LINE_WIDTH
;
1531 *(INSTRUCTION_TYPE
*) (ptr
- INSN_CACHE_LINE_WIDTH
) = RETURN_INSTRUCTION
;
1536 /* Call the beginning of the sequence. */
1537 (((function_ptr
) (((int) array
+ INSN_CACHE_LINE_WIDTH
- 1)
1538 & -INSN_CACHE_LINE_WIDTH
))
1541 #else /* Cache is large. */
1545 int ptr
= (((int) array
+ INSN_CACHE_LINE_WIDTH
- 1)
1546 & -INSN_CACHE_LINE_WIDTH
);
1548 while (ptr
< (int) array
+ sizeof array
)
1550 *(INSTRUCTION_TYPE
*)ptr
= RETURN_INSTRUCTION
;
1551 ptr
+= INSN_CACHE_LINE_WIDTH
;
1557 /* Find the location in array that occupies the same cache line as BEG. */
1559 offset
= ((int) beg
& -INSN_CACHE_LINE_WIDTH
) & (INSN_CACHE_PLANE_SIZE
- 1);
1560 start_addr
= (((int) (array
+ INSN_CACHE_PLANE_SIZE
- 1)
1561 & -INSN_CACHE_PLANE_SIZE
)
1564 /* Compute the cache alignment of the place to stop clearing. */
1565 #if 0 /* This is not needed for gcc's purposes. */
1566 /* If the block to clear is bigger than a cache plane,
1567 we clear the entire cache, and OFFSET is already correct. */
1568 if (end
< beg
+ INSN_CACHE_PLANE_SIZE
)
1570 offset
= (((int) (end
+ INSN_CACHE_LINE_WIDTH
- 1)
1571 & -INSN_CACHE_LINE_WIDTH
)
1572 & (INSN_CACHE_PLANE_SIZE
- 1));
1574 #if INSN_CACHE_DEPTH > 1
1575 end_addr
= (start_addr
& -INSN_CACHE_PLANE_SIZE
) + offset
;
1576 if (end_addr
<= start_addr
)
1577 end_addr
+= INSN_CACHE_PLANE_SIZE
;
1579 for (plane
= 0; plane
< INSN_CACHE_DEPTH
; plane
++)
1581 int addr
= start_addr
+ plane
* INSN_CACHE_PLANE_SIZE
;
1582 int stop
= end_addr
+ plane
* INSN_CACHE_PLANE_SIZE
;
1584 while (addr
!= stop
)
1586 /* Call the return instruction at ADDR. */
1587 ((function_ptr
) addr
) ();
1589 addr
+= INSN_CACHE_LINE_WIDTH
;
1592 #else /* just one plane */
1595 /* Call the return instruction at START_ADDR. */
1596 ((function_ptr
) start_addr
) ();
1598 start_addr
+= INSN_CACHE_LINE_WIDTH
;
1600 while ((start_addr
% INSN_CACHE_SIZE
) != offset
);
1601 #endif /* just one plane */
1602 #endif /* Cache is large */
1603 #endif /* Cache exists */
1604 #endif /* CLEAR_INSN_CACHE */
1607 #endif /* L_clear_cache */
1611 /* Jump to a trampoline, loading the static chain address. */
1613 #if defined(WINNT) && ! defined(__CYGWIN__) && ! defined (_UWIN)
1626 extern int VirtualProtect (char *, int, int, int *) __attribute__((stdcall));
1630 mprotect (char *addr
, int len
, int prot
)
1647 if (VirtualProtect (addr
, len
, np
, &op
))
1653 #endif /* WINNT && ! __CYGWIN__ && ! _UWIN */
1655 #ifdef TRANSFER_FROM_TRAMPOLINE
1656 TRANSFER_FROM_TRAMPOLINE
1659 #if defined (NeXT) && defined (__MACH__)
1661 /* Make stack executable so we can call trampolines on stack.
1662 This is called from INITIALIZE_TRAMPOLINE in next.h. */
1666 #include <mach/mach.h>
1670 __enable_execute_stack (char *addr
)
1673 char *eaddr
= addr
+ TRAMPOLINE_SIZE
;
1674 vm_address_t a
= (vm_address_t
) addr
;
1676 /* turn on execute access on stack */
1677 r
= vm_protect (task_self (), a
, TRAMPOLINE_SIZE
, FALSE
, VM_PROT_ALL
);
1678 if (r
!= KERN_SUCCESS
)
1680 mach_error("vm_protect VM_PROT_ALL", r
);
1684 /* We inline the i-cache invalidation for speed */
1686 #ifdef CLEAR_INSN_CACHE
1687 CLEAR_INSN_CACHE (addr
, eaddr
);
1689 __clear_cache ((int) addr
, (int) eaddr
);
1693 #endif /* defined (NeXT) && defined (__MACH__) */
1697 /* Make stack executable so we can call trampolines on stack.
1698 This is called from INITIALIZE_TRAMPOLINE in convex.h. */
1700 #include <sys/mman.h>
1701 #include <sys/vmparam.h>
1702 #include <machine/machparam.h>
1705 __enable_execute_stack (void)
1708 static unsigned lowest
= USRSTACK
;
1709 unsigned current
= (unsigned) &fp
& -NBPG
;
1711 if (lowest
> current
)
1713 unsigned len
= lowest
- current
;
1714 mremap (current
, &len
, PROT_READ
| PROT_WRITE
| PROT_EXEC
, MAP_PRIVATE
);
1718 /* Clear instruction cache in case an old trampoline is in it. */
1721 #endif /* __convex__ */
1725 /* Modified from the convex -code above. */
1727 #include <sys/param.h>
1729 #include <sys/m88kbcs.h>
1732 __enable_execute_stack (void)
1735 static unsigned long lowest
= USRSTACK
;
1736 unsigned long current
= (unsigned long) &save_errno
& -NBPC
;
1738 /* Ignore errno being set. memctl sets errno to EINVAL whenever the
1739 address is seen as 'negative'. That is the case with the stack. */
1742 if (lowest
> current
)
1744 unsigned len
=lowest
-current
;
1745 memctl(current
,len
,MCT_TEXT
);
1749 memctl(current
,NBPC
,MCT_TEXT
);
1753 #endif /* __sysV88__ */
1757 #include <sys/signal.h>
1760 /* Motorola forgot to put memctl.o in the libp version of libc881.a,
1761 so define it here, because we need it in __clear_insn_cache below */
1762 /* On older versions of this OS, no memctl or MCT_TEXT are defined;
1763 hence we enable this stuff only if MCT_TEXT is #define'd. */
1778 /* Clear instruction cache so we can call trampolines on stack.
1779 This is called from FINALIZE_TRAMPOLINE in mot3300.h. */
1782 __clear_insn_cache (void)
1787 /* Preserve errno, because users would be surprised to have
1788 errno changing without explicitly calling any system-call. */
1791 /* Keep it simple : memctl (MCT_TEXT) always fully clears the insn cache.
1792 No need to use an address derived from _start or %sp, as 0 works also. */
1793 memctl(0, 4096, MCT_TEXT
);
1798 #endif /* __sysV68__ */
1802 #undef NULL /* Avoid errors if stdio.h and our stddef.h mismatch. */
1804 #include <sys/mman.h>
1805 #include <sys/types.h>
1806 #include <sys/param.h>
1807 #include <sys/vmmac.h>
1809 /* Modified from the convex -code above.
1810 mremap promises to clear the i-cache. */
1813 __enable_execute_stack (void)
1816 if (mprotect (((unsigned int)&fp
/PAGSIZ
)*PAGSIZ
, PAGSIZ
,
1817 PROT_READ
|PROT_WRITE
|PROT_EXEC
))
1819 perror ("mprotect in __enable_execute_stack");
1824 #endif /* __pyr__ */
1826 #if defined (sony_news) && defined (SYSTYPE_BSD)
1829 #include <sys/types.h>
1830 #include <sys/param.h>
1831 #include <syscall.h>
1832 #include <machine/sysnews.h>
1834 /* cacheflush function for NEWS-OS 4.2.
1835 This function is called from trampoline-initialize code
1836 defined in config/mips/mips.h. */
1839 cacheflush (char *beg
, int size
, int flag
)
1841 if (syscall (SYS_sysnews
, NEWS_CACHEFLUSH
, beg
, size
, FLUSH_BCACHE
))
1843 perror ("cache_flush");
1849 #endif /* sony_news */
1850 #endif /* L_trampoline */
1855 #include "gbl-ctors.h"
1856 /* Some systems use __main in a way incompatible with its use in gcc, in these
1857 cases use the macros NAME__MAIN to give a quoted symbol and SYMBOL__MAIN to
1858 give the same symbol without quotes for an alternative entry point. You
1859 must define both, or neither. */
1861 #define NAME__MAIN "__main"
1862 #define SYMBOL__MAIN __main
1865 #ifdef INIT_SECTION_ASM_OP
1866 #undef HAS_INIT_SECTION
1867 #define HAS_INIT_SECTION
1870 #if !defined (HAS_INIT_SECTION) || !defined (OBJECT_FORMAT_ELF)
1872 /* Some ELF crosses use crtstuff.c to provide __CTOR_LIST__, but use this
1873 code to run constructors. In that case, we need to handle EH here, too. */
1875 #ifdef EH_FRAME_SECTION_NAME
1876 #include "unwind-dw2-fde.h"
1877 extern unsigned char __EH_FRAME_BEGIN__
[];
1880 /* Run all the global destructors on exit from the program. */
1883 __do_global_dtors (void)
1885 #ifdef DO_GLOBAL_DTORS_BODY
1886 DO_GLOBAL_DTORS_BODY
;
1888 static func_ptr
*p
= __DTOR_LIST__
+ 1;
1895 #if defined (EH_FRAME_SECTION_NAME) && !defined (HAS_INIT_SECTION)
1897 static int completed
= 0;
1901 __deregister_frame_info (__EH_FRAME_BEGIN__
);
1908 #ifndef HAS_INIT_SECTION
1909 /* Run all the global constructors on entry to the program. */
1912 __do_global_ctors (void)
1914 #ifdef EH_FRAME_SECTION_NAME
1916 static struct object object
;
1917 __register_frame_info (__EH_FRAME_BEGIN__
, &object
);
1920 DO_GLOBAL_CTORS_BODY
;
1921 atexit (__do_global_dtors
);
1923 #endif /* no HAS_INIT_SECTION */
1925 #if !defined (HAS_INIT_SECTION) || defined (INVOKE__main)
1926 /* Subroutine called automatically by `main'.
1927 Compiling a global function named `main'
1928 produces an automatic call to this function at the beginning.
1930 For many systems, this routine calls __do_global_ctors.
1931 For systems which support a .init section we use the .init section
1932 to run __do_global_ctors, so we need not do anything here. */
1937 /* Support recursive calls to `main': run initializers just once. */
1938 static int initialized
;
1942 __do_global_ctors ();
1945 #endif /* no HAS_INIT_SECTION or INVOKE__main */
1947 #endif /* L__main */
1948 #endif /* __CYGWIN__ */
1952 #include "gbl-ctors.h"
1954 /* Provide default definitions for the lists of constructors and
1955 destructors, so that we don't get linker errors. These symbols are
1956 intentionally bss symbols, so that gld and/or collect will provide
1957 the right values. */
1959 /* We declare the lists here with two elements each,
1960 so that they are valid empty lists if no other definition is loaded.
1962 If we are using the old "set" extensions to have the gnu linker
1963 collect ctors and dtors, then we __CTOR_LIST__ and __DTOR_LIST__
1964 must be in the bss/common section.
1966 Long term no port should use those extensions. But many still do. */
1967 #if !defined(INIT_SECTION_ASM_OP) && !defined(CTOR_LISTS_DEFINED_EXTERNALLY)
1968 #if defined (TARGET_ASM_CONSTRUCTOR) || defined (USE_COLLECT2)
1969 func_ptr __CTOR_LIST__
[2] = {0, 0};
1970 func_ptr __DTOR_LIST__
[2] = {0, 0};
1972 func_ptr __CTOR_LIST__
[2];
1973 func_ptr __DTOR_LIST__
[2];
1975 #endif /* no INIT_SECTION_ASM_OP and not CTOR_LISTS_DEFINED_EXTERNALLY */
1976 #endif /* L_ctors */
1980 #include "gbl-ctors.h"
1988 static func_ptr
*atexit_chain
= 0;
1989 static long atexit_chain_length
= 0;
1990 static volatile long last_atexit_chain_slot
= -1;
1993 atexit (func_ptr func
)
1995 if (++last_atexit_chain_slot
== atexit_chain_length
)
1997 atexit_chain_length
+= 32;
1999 atexit_chain
= (func_ptr
*) realloc (atexit_chain
, atexit_chain_length
2000 * sizeof (func_ptr
));
2002 atexit_chain
= (func_ptr
*) malloc (atexit_chain_length
2003 * sizeof (func_ptr
));
2006 atexit_chain_length
= 0;
2007 last_atexit_chain_slot
= -1;
2012 atexit_chain
[last_atexit_chain_slot
] = func
;
2016 extern void _cleanup (void);
2017 extern void _exit (int) __attribute__ ((__noreturn__
));
2024 for ( ; last_atexit_chain_slot
-- >= 0; )
2026 (*atexit_chain
[last_atexit_chain_slot
+ 1]) ();
2027 atexit_chain
[last_atexit_chain_slot
+ 1] = 0;
2029 free (atexit_chain
);
2042 /* Simple; we just need a wrapper for ON_EXIT. */
2044 atexit (func_ptr func
)
2046 return ON_EXIT (func
);
2049 #endif /* ON_EXIT */
2050 #endif /* NEED_ATEXIT */