/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | namelist_19.f90 | 8 character*80 wrong, right variable in program:namelist_19 12 right = "&z i = 1,2 /" 13 call test_err(wrong, right) 17 right = "&z i = 1,2 &end" 18 call test_err(wrong, right) 22 right = "&z i = 1,2 /" 23 call test_err(wrong, right) 27 right = "&z i = 1,2 /" 28 call test_err(wrong, right) 32 right 112 character*80 wrong, right local in subroutine:test_err [all...] |
H A D | associated_6.f90 | 10 type(treeNode), pointer :: right => null()
component in type:treeNode 16 allocate(n%right)
18 deallocate(n%right)
25 RightOf => theNode%right
|
H A D | data_initialized_3.f90 | 17 INTEGER :: right(4) local in function:d1mach 24 EQUIVALENCE (dmach(3),right(1)) 30 DATA right(1),right(2) / 0, 1017118720 /
|
H A D | defined_assignment_9.f90 | 31 type(parent) :: right 32 ! print *, right%foo 33 left = right 39 type(parent) :: right(5) variable 40 ! print *, right%foo 41 left = right
|
/haiku-buildtools/legacy/gcc/libchill/ |
H A D | ltps.c | 39 * right powerset 43 * int 1 .. left is proper subset of right 44 * (excludes case where left == right) 52 __ltpowerset (left, right, bitlength) 54 SET_WORD *right; 59 if ((*((SET_CHAR *)left) & *((SET_CHAR *)right)) 62 if (*((SET_CHAR *)left) != *((SET_CHAR *)right)) 68 if ((*((SET_SHORT *)left) & *((SET_SHORT *)right)) 71 if (*((SET_SHORT *)left) != *((SET_SHORT *)right)) 82 if ((*right [all...] |
H A D | neps.c | 39 * right right powerset 53 __nepowerset (left, right, bitlength) 55 SET_WORD *right; 58 return ! __eqpowerset (left, right, bitlength);
|
H A D | leps.c | 39 * right powerset 43 * int 1 .. left is included in right 51 __lepowerset (left, right, bitlength) 53 SET_WORD *right; 58 if ((*((SET_CHAR *)left) & *((SET_CHAR *)right)) 65 if ((*((SET_SHORT *)left) & *((SET_SHORT *)right)) 76 if ((*right & *left) != *left) 79 right++;
|
H A D | eqps.c | 39 * right right powerset 53 __eqpowerset (left, right, bitlength) 55 SET_WORD *right; 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 | 42 * RIGHT - pointer to right PS 43 * RIGHTLEN - length of right PS in bits 66 __concatps (out, left, leftlen, right, rightlen) 70 SET_WORD *right; 82 if (rightlen == 0 || !right) 85 right, rightlen, (unsigned long)0, rightlen); 87 else if (rightlen == 0 || !right) 98 /* copy the right powerset into bits leftlen..leftlen+rightlen-1 */ 100 right, rightlen, (unsigned long)0, rightlen);
|
H A D | andps.c | 40 * right right powerset 55 __andpowerset (out, left, right, bitlength) 58 SET_WORD *right; 64 *((SET_CHAR *)right); 70 *((SET_SHORT *)right); 79 out[i] = left[i] & right[i];
|
H A D | diffps.c | 40 * right powerset 50 * makes a difference of 2 powersets (out = left - right) 54 __diffpowerset (out, left, right, bitlength) 57 SET_WORD *right; 63 *((SET_CHAR *)right); 69 *((SET_SHORT *)right); 78 out[i] = left[i] & ~right[i];
|
/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; 32 base operator! (const base& right) argument 34 if (right.i < 2) 35 return right; 37 return ((!(right-1)) + (!(right-2)));
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.bugs/ |
H A D | 900324_05.C | 15 int_array &right = int_array_object; variable 19 left = right; // { dg-error "" } causes segfault
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | union1.C | 9 A& operator = (int right) {myInt = right; return *this;} argument
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 20031125-2.c | 2 int right; member in struct:BlobSpan 11 if (blobdata.right)
|
H A D | PYRBUG.c | 9 int top, left, bottom, right; member in struct:__anon1143 16 && pt.h >= r->left && pt.h < r->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);
|
/haiku-buildtools/gcc/libgomp/ |
H A D | splay-tree.c | 51 tmp = n->right; 52 n->right = p; 57 /* Rotate the edge joining the right child N with its parent P. PP is the 66 p->right = tmp; 89 /* Left or right? If no child, then we're done. */ 93 c = n->right; 97 /* Next one left or right? If found or no child, we're done 102 || (cmp2 > 0 && !c->right)) 119 rotate_right (&n->right, c, c->right); 180 splay_tree_node left, right; local [all...] |
/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/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.dg/torture/ |
H A D | pr51070-2.c | 11 func_14 (int left, int right) argument 17 func_37 (int left, int right) argument
|
H A D | pr51070.c | 10 func_14 (int left, int right) argument 16 func_37 (int left, int right) argument
|
/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;
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/chan/ |
H A D | goroutines.go | 17 func f(left, right chan int) { 18 left <- <-right 32 right := leftmost 35 right = make(chan int) 36 go f(left, right) 37 left = right 39 go func(c chan int) { c <- 1 }(right)
|
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | bbt.c | 70 temp = t->right; 71 t->right = t->right->left; 78 /* Rotate the treap right. */ 86 t->left = t->left->right; 87 temp->right = t; 114 t->right = insert (new_bbt, t->right, compare); 115 if (t->priority < t->right->priority) 146 return t->right; [all...] |