/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | forgetcc.c | 1 foo (hp, p, a) 2 short *hp; 6 hp[10] = a; 8 if (hp[10] > 0)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | defarg3.C | 4 int* hp; variable 7 void f (int *ip, int kp = hp - jp)
|
H A D | rtti1.C | 37 int (*hp)(int); variable 112 if (typeid(gp) == typeid(hp)) error (104);
|
/haiku-buildtools/jam/ |
H A D | hash.h | 16 int hashitem( struct hash *hp, HASHDATA **data, int enter ); 17 void hashdone( struct hash *hp ); 19 # define hashenter( hp, data ) !hashitem( hp, data, !0 ) 20 # define hashcheck( hp, data ) hashitem( hp, data, 0 )
|
H A D | hash.c | 18 * hashrehash() - resize and rebuild hp->tab, the hash table 84 static void hashrehash( struct hash *hp ); 85 static void hashstat( struct hash *hp ); 93 register struct hash *hp, 102 if( enter && !hp->items.more ) 103 hashrehash( hp ); 105 if( !enter && !hp->items.nel ) 113 base = hp->tab.base + ( keyval % hp->tab.nel ); 125 i = (ITEM *)hp 92 hashitem( register struct hash *hp, HASHDATA **data, int enter ) argument 190 struct hash *hp = (struct hash *)malloc( sizeof( *hp ) ); local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr36339.c | 10 my_uintptr_t *hp = heap; local 12 hp[0] = x; 13 hp[1] = 0; 14 return check_a((my_uintptr_t)(void*)((char*)hp + 1)); 19 my_uintptr_t *hp = (my_uintptr_t*)(void*)((char*)tagged_ptr - 1); local 21 if (hp[0] == 42 && hp[1] == 0)
|
H A D | 960416-1.c | 28 t hp, lp, dp, m; \ 40 hp.d = (dt) afh.s.h * bfh.s.h; \ 43 hh.d = hp.d + hp.s.h + lp.s.h + dp.s.h; \ 44 m.d = (dt) lp.s.h + hp.s.l + lp.s.l + dp.s.l; \
|
/haiku-buildtools/gcc/mpfr/tests/ |
H A D | memory.c | 54 struct header **hp; local 56 for (hp = &tests_memory_list; *hp != NULL; hp = &((*hp)->next)) 57 if ((*hp)->ptr == ptr) 58 return hp; 94 struct header **hp, *h; local 103 hp = tests_memory_find (ptr); 104 if (hp 129 struct header **hp = tests_memory_find (ptr); local 142 struct header **hp = tests_free_find (ptr); local 154 struct header **hp = tests_free_find (ptr); local [all...] |
/haiku-buildtools/gcc/libquadmath/math/ |
H A D | remainderq.c | 31 int64_t hx,hp; local 36 GET_FLT128_WORDS64(hp,lp,p); 38 hp &= 0x7fffffffffffffffLL; 42 if((hp|lp)==0) return (x*p)/(x*p); /* p = 0 */ 44 ((hp>=0x7fff000000000000LL)&& /* p is NaN */ 45 (((hp-0x7fff000000000000LL)|lp)!=0))) 48 if (hp<=0x7ffdffffffffffffLL) x = fmodq (x,p+p); /* now x < 2p */ 49 if (((hx-hp)|(lx-lp))==0) return zero*x; 52 if (hp<0x0002000000000000LL) {
|
/haiku-buildtools/gcc/gmp/tests/ |
H A D | memory.c | 58 struct header **hp; local 60 for (hp = &tests_memory_list; *hp != NULL; hp = &((*hp)->next)) 61 if ((*hp)->ptr == ptr) 62 return hp; 106 struct header **hp, *h; local 117 hp = tests_memory_find (ptr); 118 if (hp 164 struct header **hp = tests_memory_find (ptr); local 177 struct header **hp = tests_free_find (ptr); local 204 struct header **hp = tests_free_find (ptr); local [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | cpphash.c | 158 delete_macro (hp) 159 HASHNODE *hp; 162 if (hp->prev != NULL) 163 hp->prev->next = hp->next; 164 if (hp->next != NULL) 165 hp->next->prev = hp->prev; 169 if (hp == *hp 212 register HASHNODE *hp; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/arm/ |
H A D | fp16-builtins-1.c | 32 hp = (p (h1) ? 1 : 0); \ 34 if (hp ^ fp) abort () 38 hp = (p (h1, h2) ? 1 : 0); \ 40 if (hp ^ fp) abort () 45 int hp, fp; local
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr45415.c | 31 t hp, lp, dp, m; \ 43 hp.d = (dt) afh.s.h * bfh.s.h; \ 46 hh.d = hp.d + hp.s.h + lp.s.h + dp.s.h; \ 47 m.d = (dt) lp.s.h + hp.s.l + lp.s.l + dp.s.l; \
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/abi/ |
H A D | dcast1.C | 27 H* hp = dynamic_cast<H*>(a1); local 28 return hp != 0;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/format/ |
H A D | ms_c99-scanf-1.c | 13 foo (int *ip, unsigned int *uip, short int *hp, unsigned short int *uhp, argument 39 scanf ("%hd%hi%ho%hu%hx%hX%hn", hp, hp, uhp, uhp, uhp, uhp, hn); 45 scanf ("%hs", hp); 48 scanf ("%hp", pp); /* { dg-warning "length" "bad use of %h" } */
|
H A D | ms_c90-scanf-1.c | 13 foo (int *ip, unsigned int *uip, short int *hp, unsigned short int *uhp, argument 26 scanf ("%hd", hp); 49 scanf ("%hd%hi%ho%hu%hx%hX%hn", hp, hp, uhp, uhp, uhp, uhp, hn); 55 scanf ("%hs", hp); 57 scanf ("%hc", hp); 58 scanf ("%hp", pp); /* { dg-warning "length" "bad use of %h" } */
|
H A D | c90-scanf-1.c | 12 foo (int *ip, unsigned int *uip, short int *hp, unsigned short int *uhp, argument 25 scanf ("%hd", hp); 48 scanf ("%hd%hi%ho%hu%hx%hX%hn", hp, hp, uhp, uhp, uhp, uhp, hn); 57 scanf ("%hp", pp); /* { dg-warning "length" "bad use of %h" } */
|
/haiku-buildtools/binutils/libiberty/ |
H A D | alloca.c | 176 register header *hp; /* Traverses linked list. */ local 178 for (hp = last_alloca_header; hp != NULL;) 179 if ((STACK_DIR > 0 && hp->h.deep > depth) 180 || (STACK_DIR < 0 && hp->h.deep < depth)) 182 register header *np = hp->h.next; 184 free ((PTR) hp); /* Collect garbage. */ 186 hp = np; /* -> next header. */ 191 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/gcc/libiberty/ |
H A D | alloca.c | 176 register header *hp; /* Traverses linked list. */ local 178 for (hp = last_alloca_header; hp != NULL;) 179 if ((STACK_DIR > 0 && hp->h.deep > depth) 180 || (STACK_DIR < 0 && hp->h.deep < depth)) 182 register header *np = hp->h.next; 184 free ((PTR) hp); /* Collect garbage. */ 186 hp = np; /* -> next header. */ 191 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/legacy/binutils/libiberty/ |
H A D | alloca.c | 176 register header *hp; /* Traverses linked list. */ local 178 for (hp = last_alloca_header; hp != NULL;) 179 if ((STACK_DIR > 0 && hp->h.deep > depth) 180 || (STACK_DIR < 0 && hp->h.deep < depth)) 182 register header *np = hp->h.next; 184 free ((PTR) hp); /* Collect garbage. */ 186 hp = np; /* -> next header. */ 191 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/legacy/gcc/libiberty/ |
H A D | alloca.c | 187 register header *hp; /* Traverses linked list. */ local 193 for (hp = last_alloca_header; hp != NULL;) 194 if ((STACK_DIR > 0 && hp->h.deep > depth) 195 || (STACK_DIR < 0 && hp->h.deep < depth)) 197 register header *np = hp->h.next; 199 free ((pointer) hp); /* Collect garbage. */ 201 hp = np; /* -> next header. */ 206 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/legacy/gcc/texinfo/lib/ |
H A D | alloca.c | 186 register header *hp; /* Traverses linked list. */ local 192 for (hp = last_alloca_header; hp != NULL;) 193 if ((STACK_DIR > 0 && hp->h.deep > depth) 194 || (STACK_DIR < 0 && hp->h.deep < depth)) 196 register header *np = hp->h.next; 198 free ((pointer) hp); /* Collect garbage. */ 200 hp = np; /* -> next header. */ 205 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/legacy/gcc/texinfo/libtxi/ |
H A D | alloca.c | 186 register header *hp; /* Traverses linked list. */ local 192 for (hp = last_alloca_header; hp != NULL;) 193 if ((STACK_DIR > 0 && hp->h.deep > depth) 194 || (STACK_DIR < 0 && hp->h.deep < depth)) 196 register header *np = hp->h.next; 198 free ((pointer) hp); /* Collect garbage. */ 200 hp = np; /* -> next header. */ 205 last_alloca_header = hp; /* -> last valid storage. */
|
/haiku-buildtools/gcc/gmp/tests/rand/ |
H A D | statlib.c | 498 mpz_t h, hp, r, s, p, pp, q, u, v; local 518 mpz_init (hp); 535 mpz_set (hp, m); 548 mpz_mul (tmp2, hp, p); 552 printf ("***BUG***: h*pp - hp*p = "); 559 printf ("hp = "); 560 mpz_out_str (stdout, 10, hp); 568 mpz_tdiv_q (q, hp, h); /* q = floor(hp/h) */ 581 mpz_sub (u, hp, tmp [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/sh/ |
H A D | pr51244-18.c | 58 Int32 i, j, h, bigN, hp; local 61 hp = 0;
|