/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr36300-1.c | 6 #define VALUE ((int)((long long)U1 * (long long)3) + 2) 12 int U1; local 14 long U1; local 17 U1 = -2147483647-1;
|
H A D | pr36300-2.c | 6 #define VALUE (unsigned int)((int)((long long)U1 * (long long)3) + 2) 12 int U1; local 14 long U1; local 18 U1 = -2147483647-1;
|
H A D | 20011021-1.c | 35 union u U1 = { .i = 1 }; /* { dg-bogus "initialization of union" } */ variable in typeref:union:u
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | friend10.C | 17 typedef Object<Tag1> U1; typedef in namespace:MySpace 22 Forgotten(U1()); 28 Forgotten(U1());
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/cpp0x/ |
H A D | gen-attrs-32.C | 14 typedef union U1 { int i; } U2 [[gnu::transparent_union]]; // { dg-warning "ignored" } union 16 static void foo2(U1) {} // { dg-message "previously defined" } 19 void bar2(U1 u1, U2 u2)
|
H A D | alias-decl-39.C | 5 struct U1 {}; struct 8 using U2 = U1<T1>;
|
H A D | sfinae2.C | 12 template<typename U1, typename U2, typename... Args2> 13 static decltype(declval<U1>().construct(declval<U2*>(), declval<Args2>()...), one()) test(int);
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ext/ |
H A D | attrib32.C | 13 typedef union U1 { int i; } U2 __attribute__((transparent_union)); // { dg-warning "ignored" } union 15 static void foo2(U1) {} // { dg-message "previously defined" } 18 void bar2(U1 u1, U2 u2)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/headers/tuple/ |
H A D | synopsis.cc | 55 template<class T1, class T2, ..., class TM, class U1, class U2, ..., class UM> 56 bool operator==(const tuple<T1, T2, ..., TM>&, const tuple<U1, U2, ..., UM>&); 57 template<class T1, class T2, ..., class TM, class U1, class U2, ..., class UM> 58 bool operator<(const tuple<T1, T2, ..., TM>&, const tuple<U1, U2, ..., UM>&); 59 template<class T1, class T2, ..., class TM, class U1, class U2, ..., class UM> 60 bool operator!=(const tuple<T1, T2, ..., TM>&, const tuple<U1, U2, ..., UM>&); 61 template<class T1, class T2, ..., class TM, class U1, class U2, ..., class UM> 62 bool operator>(const tuple<T1, T2, ..., TM>&, const tuple<U1, U2, ..., UM>&); 63 template<class T1, class T2, ..., class TM, class U1, class U2, ..., class UM> 64 bool operator<=(const tuple<T1, T2, ..., TM>&, const tuple<U1, U [all...] |
/haiku-buildtools/gcc/gmp/mpn/alpha/ |
H A D | bdiv_dbm1c.asm | 61 mulq r24, r19, r5 C U1 62 umulh r24, r19, r21 C U1 63 mulq r2, r19, r6 C U1 64 umulh r2, r19, r22 C U1 65 mulq r3, r19, r7 C U1 66 umulh r3, r19, r23 C U1 71 mulq r24, r19, r5 C U1 72 umulh r24, r19, r21 C U1 74 mulq r2, r19, r6 C U1 75 umulh r2, r19, r22 C U1 [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.abi/ |
H A D | layout1.C | 31 struct U1 struct 39 if (sizeof (U) != sizeof (U1)) 41 if (sizeof (V) != sizeof (U1))
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ipa/ |
H A D | pr64041.c | 8 union U1 union 28 fn2 (union U1 p1, union U2 p2) 46 union U1 f = { 0xFFFFFFFFU };
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | crash13.C | 32 gen_op U1; local 33 U1 = Fe();
|
/haiku-buildtools/gcc/gmp/mpn/alpha/ev5/ |
H A D | diveby3.asm | 117 mulq u0, xAAAAAAAAAAAAAAAB, q0 C U1 122 unop C U1 126 cmpult xAAAAAAAAAAAAAAAA, x, p7 C U1 132 and cymask, x5555555555555555, l0 C U1 148 mulq u1, xAAAAAAAAAAAAAAAB, q1 C U1 153 unop C U1 157 cmpult xAAAAAAAAAAAAAAAA, x, p7 C U1 163 and cymask, x5555555555555555, l0 C U1 179 mulq u2, xAAAAAAAAAAAAAAAB, q0 C U1 184 unop C U1 [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | typedef8.C | 5 template <class U1, class U2> 6 tuple& operator=(const pair<U1, U2>& k) { }
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/asan/ |
H A D | asan_oob_test.cc | 68 OOBTest<U1>(); 111 oob_test<U1>(10, -1); 115 oob_test<U1>(kLargeMalloc, -1); 119 oob_test<U1>(10, 10); 123 oob_test<U1>(kLargeMalloc, kLargeMalloc);
|
/haiku-buildtools/gcc/gmp/mpn/alpha/ev6/ |
H A D | mul_1.asm | 168 mulq r9, r19, r22 C U1 #07 170 umulh r9, r19, r23 C U1 #08 172 mulq r10, r19, r24 C U1 #09 177 umulh r10, r19, r25 C U1 #11 178 mulq r11, r19, r26 C U1 #12 179 umulh r11, r19, r27 C U1 #13 180 mulq r12, r19, r28 C U1 #14 182 umulh r12, r19, r1 C U1 #15 184 mulq r9, r19, r2 C U1 #16 186 umulh r9, r19, r3 C U1 #1 [all...] |
H A D | aorsmul_1.asm | 210 bis r31, r31, r31 C U1 mt 215 bis r31, r31, r31 C U1 mt 220 umulh v0, r1, r8 C U1 225 mulq v0, r0, r2 C U1 230 umulh v0, r0, r6 C U1 236 mulq v0, r1, r7 C U1 241 bis r31, r31, r31 C U1 mt 245 bis r31, r31, r31 C U1 mt 250 bis r31, r31, r31 C U1 mt 255 umulh v0, r1, r24 C U1 [all...] |
H A D | add_n.asm | 46 C U stays still, put code there where possible (note alternation of U1 and U0) 80 addq u0, v0, r8 C U1 add two data 83 cmpult r8, v0, r22 C U1 did it carry 88 addq r8, r23, r8 C U1 carry from last 91 beq r8, $fix6f C U1 fix exact zero 101 blt r19, $Lend C U1 loop control 106 $Loop: addq u0, v0, r2 C U1 add two data 111 cmpult r2, v0, cy1 C U1 did it carry 117 addq r2, r23, r2 C U1 carry from last 121 beq r2, $fix0 C U1 fi [all...] |
H A D | sub_n.asm | 46 C U stays still, put code there where possible (note alternation of U1 and U0) 80 subq u0, v0, r8 C U1 sub two data 83 cmpult u0, v0, r22 C U1 did it borrow 88 subq r8, r23, r25 C U1 borrow from last 91 beq r8, $fix6f C U1 fix exact zero 101 blt r19, $Lend C U1 loop control 106 $Loop: subq u0, v0, r2 C U1 sub two data 111 cmpult u0, v0, cy1 C U1 did it borrow 117 subq r2, r23, r25 C U1 borrow from last 121 beq r2, $fix0 C U1 fi [all...] |
/haiku-buildtools/gcc/gmp/mpn/alpha/ev6/nails/ |
H A D | addmul_3.asm | 80 mulq v0, ulimb, m0a C U1 81 umulh v0, ulimb, m0b C U1 82 mulq v1, ulimb, m1a C U1 83 umulh v1, ulimb, m1b C U1 85 mulq v2, ulimb, m2a C U1 86 umulh v2, ulimb, m2b C U1 93 addq r19, acc0, acc0 C U1 propagate nail 98 mulq v0, ulimb, m0a C U1 102 umulh v0, ulimb, m0b C U1 108 mulq v1, ulimb, m1a C U1 [all...] |
H A D | addmul_4.asm | 94 mulq v0, ulimb, m0a C U1 95 umulh v0, ulimb, m0b C U1 96 mulq v1, ulimb, m1a C U1 97 umulh v1, ulimb, m1b C U1 99 mulq v2, ulimb, m2a C U1 100 umulh v2, ulimb, m2b C U1 101 mulq v3, ulimb, m3a C U1 102 umulh v3, ulimb, m3b C U1 106 L(top): bis r31, r31, r31 C U1 nop 112 bis r31, r31, r31 C U1 no [all...] |
H A D | addmul_2.asm | 74 mulq v0, ulimb, m0a C U1 75 umulh v0, ulimb, m0b C U1 76 mulq v1, ulimb, m1a C U1 77 umulh v1, ulimb, m1b C U1 82 L(top): bis r31, r31, r31 C U1 nop 90 mulq v0, ulimb, m0a C U1 94 umulh v0, ulimb, m0b C U1 100 mulq v1, ulimb, m1a C U1 104 umulh v1, ulimb, m1b C U1 108 srl r19,NUMB_BITS, r19 C U1 extrac [all...] |
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/ |
H A D | raw-string-1.c | 62 const char32_t U1[] = U"a\\\n\\u010d\\U0000010D\\\\\\'\\\"\\?\\a\\b\\f\\n\\r\\t\\v\\0\\00\\000\\xa\\xabb\nc"; variable 119 if (sizeof (U0) != sizeof (U1) 120 || __builtin_memcmp (U0, U1, sizeof (U0)) != 0)
|
/haiku-buildtools/gcc/contrib/ |
H A D | paranoia.cc | 75 D4 FourD K PageNo U1 988 FLOAT OneUlp, UfThold, U1, U2; member in struct:Paranoia 1003 /*U1 gap below 1.0, i.e, 1.0-U1 is next number below 1.0 */ 1144 U1 = One / W; 1145 U2 = Radix * U1; 1146 printf ("Closest relative separation found is U1 = %s .\n\n", U1.str()); 1151 E1 = U1; 1179 if (X < U1) [all...] |