/haiku-buildtools/legacy/gcc/libchill/ |
H A D | ltps.c | 38 * left powerset 43 * int 1 .. left is proper subset of right 44 * (excludes case where left == right) 52 __ltpowerset (left, right, bitlength) 53 SET_WORD *left; 59 if ((*((SET_CHAR *)left) & *((SET_CHAR *)right)) 60 != *((SET_CHAR *)left)) 62 if (*((SET_CHAR *)left) != *((SET_CHAR *)right)) 68 if ((*((SET_SHORT *)left) & *((SET_SHORT *)right)) 69 != *((SET_SHORT *)left)) [all...] |
H A D | leps.c | 38 * left powerset 43 * int 1 .. left is included in right 51 __lepowerset (left, right, bitlength) 52 SET_WORD *left; 58 if ((*((SET_CHAR *)left) & *((SET_CHAR *)right)) 59 != *((SET_CHAR *)left)) 65 if ((*((SET_SHORT *)left) & *((SET_SHORT *)right)) 66 != *((SET_SHORT *)left)) 72 SET_WORD *endp = left + BITS_TO_WORDS(bitlength); 74 while (left < end [all...] |
H A D | neps.c | 38 * left left powerset 53 __nepowerset (left, right, bitlength) 54 SET_WORD *left; 58 return ! __eqpowerset (left, right, bitlength);
|
H A D | notps.c | 39 * left input powerset 53 __notpowerset (out, left, bitlength) 55 SET_WORD *left; 60 *((SET_CHAR *)out) = ~ (*((SET_CHAR *)left)); 63 tmp = *((SET_CHAR *)left); 68 *((SET_CHAR *)out) = ~ *((SET_CHAR *)left); 70 *((SET_CHAR *)out) = (~(0)) ^ (*((SET_CHAR *)left)); 76 *((SET_SHORT *)out) = ~ (*((SET_SHORT *)left)); 85 out[i] = ~ left[i];
|
H A D | eqps.c | 38 * left left powerset 53 __eqpowerset (left, right, bitlength) 54 SET_WORD *left; 61 SET_CHAR c = *(SET_CHAR *)left ^ *(SET_CHAR *)right; 67 SET_SHORT c = *(SET_SHORT *)left ^ *(SET_SHORT *)right; 73 SET_WORD c = *(SET_WORD *)left ^ *(SET_WORD *)right; 85 if (left[i] != right[i]) 91 c = left[i] ^ right[i];
|
H A D | concatps.c | 40 * LEFT - pointer to left PS 41 * LEFTLEN - length of left PS in bits 66 __concatps (out, left, leftlen, right, rightlen) 68 SET_WORD *left; 80 else if (leftlen == 0 || !left) 89 if (leftlen == 0 || !left) 92 left, leftlen, (unsigned long)0, leftlen); 94 /* copy the left powerset into bits 0..leftlen - 1 */ 96 left, leftlen, (unsigned long)0, leftlen);
|
/haiku-buildtools/binutils/ld/testsuite/ld-pe/ |
H A D | exports.s | 1 # Deliberately left empty.
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | reassoc-19.c | 6 void foo(char* left, char* rite, int element) argument 8 while (left <= rite) 15 bar(left, rite, element);
|
H A D | pr43378.c | 5 void foo (int left, int rite, int element) argument 7 while (left <= rite) 10 bar (left, rite, element); 11 left += element; 16 /* { dg-final { scan-tree-dump-times "left_\[0-9\]* = left_\[0-9\]* \\+ element|left_\[0-9\]* = element_\[0-9\]*\\(D\\) \\+ left" 1 "ivopts"} } */
|
/haiku-buildtools/binutils/gas/testsuite/gas/arm/ |
H A D | blank.s | 1 @ this file left intentionally blank
|
/haiku-buildtools/binutils/ld/testsuite/ld-arm/ |
H A D | blank.s | 1 @ this file left intentionally blank
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20120917-1.c | 6 curl_off_t left = offset; local 7 while(left) 9 long step = (left > 0x7FFFFFFFLL - 0x1LL) ? 2147483647L - 1L : (long)left; 10 left -= step;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.bugs/ |
H A D | 900324_05.C | 14 int_array &left = int_array_object; variable 19 left = right; // { dg-error "" } causes segfault
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr24257.c | 5 int buf, left; member in struct:A 12 while (s->left < 32) { 14 s->left += 8; 23 s->left = n;
|
H A D | pr51070-2.c | 11 func_14 (int left, int right) argument 17 func_37 (int left, int right) argument 19 return left;
|
H A D | pr51070.c | 10 func_14 (int left, int right) argument 16 func_37 (int left, int right) argument 18 return left;
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | defined_assignment_9.f90 | 30 type(parent), allocatable :: left 33 left = right 34 ! print *, left%foo 35 if (left%foo%i /= 20) call abort() 38 type(parent), allocatable :: left(:) variable 41 left = right 42 ! print *, left%foo 43 if (any (left%foo%i /= 20)) call abort()
|
H A D | defined_assignment_8.f90 | 34 type(parent), allocatable :: left variable in program:main 37 left = right 38 print *, left%foo 39 if (left%foo%i /= 42) call abort()
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/ |
H A D | pr43842.c | 11 safe_rshift_func_int16_t_s_u (int16_t left, unsigned int right) argument 13 return left || right >= 1 * 8 ? left : left >> right; 17 safe_rshift_func_int8_t_s_u (int8_t left, unsigned int right) argument 19 return left || right >= 1 * 8 ? left : left >> right;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr42006.c | 10 my_shift(unsigned int left, unsigned int right) argument 12 return (right > 100) ? left : (left >> right);
|
H A D | pr63209.c | 12 __attribute__((noinline)) unsigned Predictor(unsigned left, const unsigned* const top) { argument 13 const unsigned pred = Select(top[1], left, top[0]); 19 const unsigned left = 0xff7b7b7b; local 20 const unsigned pred = Predictor(left, top /*+ 1*/); 21 if (pred == left)
|
/haiku-buildtools/gcc/libgomp/ |
H A D | splay-tree.c | 44 /* Rotate the edge joining the left child N with its parent P. PP is the 53 p->left = tmp; 64 tmp = n->left; 65 n->left = p; 91 c = n->left; 97 /* Next one left or right? If found or no child, we're done 101 || (cmp2 < 0 && !c->left) 114 rotate_left (&n->left, c, c->left); 115 rotate_left (&sp->root, n, n->left); 180 splay_tree_node left, right; local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | operators5.C | 13 base operator+ (const base& left, const base& right) argument 17 ret_val.i = left.i + right.i; 21 base operator- (const base& left, int right) argument 25 ret_val.i = left.i - right;
|
/haiku-buildtools/legacy/gcc/gcc/config/ns32k/ |
H A D | xm-ns32k.h | 42 #define memcmp(left,right,len) bcmp ((left),(right),(len))
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | pr37184.c | 8 rshift_u_s (unsigned int left, int right) argument 10 return left >> right;
|