/netbsd-current/tests/usr.bin/xlint/lint1/ |
H A D | msg_118.c | 9 int_shl_uint(int left, unsigned int right) argument 11 return left << right; 15 int_shr_uint(int left, unsigned int right) argument 18 return left >> right; 22 int_shl_int(int left, int right) argument 24 return left << right;
|
H A D | gcc_init_compound_literal.c | 35 struct node *right; member in struct:node
|
/netbsd-current/external/bsd/tradcpp/dist/tests/ |
H A D | t24.c | 6 right 10 right 18 right 58 right 62 right
|
H A D | t28.c | 2 . right 5 .. right
|
/netbsd-current/sys/arch/hppa/spmath/ |
H A D | hppa.h | 44 #define Shiftdouble(left,right,amount,dest) \ 45 /* int left, right, amount, dest; */ \ 46 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount)) 49 #define Variableshiftdouble(left,right,amount,dest) \ 50 /* unsigned int left, right; int amount, dest; */ \ 51 if (amount == 0) dest = right; \ 53 ((unsigned) right >> (amount)) 56 #define Variable_shift_double(left,right,amount,dest) \ 57 /* unsigned int left, right; int amount, dest; */ \ 58 dest = (left << (32-(amount))) | ((unsigned) right >> (amoun [all...] |
H A D | sfcmp.c | 57 register unsigned int left, right; local 62 right = *rightptr; 67 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) ) 76 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) 77 && Sgl_isnotzero_mantissa(right) 78 && (Exception(cond) || Sgl_isone_signaling(right)) ) ) 93 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT) 94 && Sgl_isnotzero_mantissa(right)) ) 104 Sgl_xortointp1(left,right,xorresult); 110 && Sgl_iszero_exponentmantissa(right) ) [all...] |
H A D | sfsub.c | 57 register unsigned int left, right, result, extent; local 66 right = *rightptr; 70 Sgl_xortointp1(left,right,/*to*/save); 79 if (Sgl_isnotnan(right)) 81 if (Sgl_isinfinity(right) && save==0) 115 else if (Sgl_is_signalingnan(right)) 121 Sgl_set_quiet(right); 122 *dstptr = right; 135 if (Sgl_isinfinity_exponent(right)) 137 if (Sgl_iszero_mantissa(right)) [all...] |
H A D | sfadd.c | 57 register unsigned int left, right, result, extent; local 68 right = *rightptr; 72 Sgl_xortointp1(left,right,/*to*/save); 81 if (Sgl_isnotnan(right)) 83 if (Sgl_isinfinity(right) && save!=0) 117 else if (Sgl_is_signalingnan(right)) 123 Sgl_set_quiet(right); 124 *dstptr = right; 137 if (Sgl_isinfinity_exponent(right)) 139 if (Sgl_iszero_mantissa(right)) [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libgomp/ |
H A D | splay-tree.c | 48 tmp = n->right; 49 n->right = p; 54 /* Rotate the edge joining the right child N with its parent P. PP is the 63 p->right = tmp; 86 /* Left or right? If no child, then we're done. */ 90 c = n->right; 94 /* Next one left or right? If found or no child, we're done 99 || (cmp2 > 0 && !c->right)) 116 rotate_right (&n->right, c, c->right); 177 splay_tree_node left, right; local [all...] |
/netbsd-current/external/gpl3/gcc/dist/libgomp/ |
H A D | splay-tree.c | 48 tmp = n->right; 49 n->right = p; 54 /* Rotate the edge joining the right child N with its parent P. PP is the 63 p->right = tmp; 86 /* Left or right? If no child, then we're done. */ 90 c = n->right; 94 /* Next one left or right? If found or no child, we're done 99 || (cmp2 > 0 && !c->right)) 116 rotate_right (&n->right, c, c->right); 177 splay_tree_node left, right; local [all...] |
/netbsd-current/usr.bin/msgc/ |
H A D | msgdb.h | 48 struct id_rec *left, *right; member in struct:id_rec
|
/netbsd-current/external/bsd/byacc/dist/test/ |
H A D | err_syntax11.y | 9 %right '|'
|
/netbsd-current/usr.bin/make/unit-tests/ |
H A D | deptgt-suffixes.exp | 7 # To: .tgt-right 10 # ".tgt-right" (num 3, ref 2) 16 # From: .src-right 18 # ".src-right" (num 5, ref 2) 23 .src-left.tgt-right: 26 .src-right.tgt-left: 30 : Making deptgt-suffixes.tgt-right from deptgt-suffixes.src-left. 31 : Making deptgt-suffixes.src-right out of nothing. 32 : Making deptgt-suffixes.tgt-left from deptgt-suffixes.src-right.
|
/netbsd-current/usr.bin/menuc/ |
H A D | avl.c | 43 * struct id_rec *left, *right; / * Tree pointers. * / 83 return find_id (tree->right, id); 101 new_id->right = NULL; 127 A->left = B->right; 128 B->right = A; 136 *root = B->right; 137 B->right = (*root)->left; 138 A->left = (*root)->right; 140 (*root)->right = A; 163 /* Insert it on the right [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/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...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/fortran/ |
H A D | bbt.cc | 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...] |
/netbsd-current/crypto/external/bsd/openssl.old/dist/test/testutil/ |
H A D | tu_local.h | 21 const char *left, const char *right, 26 const char *left, const char *right, 32 const char *left, const char *right, 37 const char *left, const char *right, 42 const char *left, const char *right,
|
/netbsd-current/external/gpl2/mkhybrid/dist/libhfs_iso/ |
H A D | node.c | 202 node right; local 206 right = *left; 207 right.nd.ndBLink = left->nnum; 209 if (n_new(&right) < 0) 212 left->nd.ndFLink = right.nnum; 221 n_search(&right, record); 225 if (right.rnum < mid) 238 && right.roff[nrecs] - right.roff[mid] + left->roff[0] + *reclen + 2 > HFS_BLOCKSZ - 2 * (mid + 1)) 251 rec = HFS_NODEREC(right, 369 n_merge(node *right, node *left, unsigned char *record, int *flag) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/config/rs6000/ |
H A D | rbtree.cc | 45 nodeptr->right = t->rbt_nil; 55 struct rbt_string_node *right = node->right; local 56 assert (right); 58 /* Turn RIGHT's left subtree into NODE's right subtree. */ 59 node->right = right->left; 60 if (right->left != t->rbt_nil) 61 right->left->par = node; 64 right [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
H A D | dw5-rnglist-test.cc | 24 node *right; member in struct:node 36 new_node->right = NULL; 55 if (root->right) 56 tree_insert (root->right, val); 58 root->right = make_node(val); 76 if (curr->right) 77 todo.push_back (curr->right);
|
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
H A D | dw5-rnglist-test.cc | 24 node *right; member in struct:node 36 new_node->right = NULL; 55 if (root->right) 56 tree_insert (root->right, val); 58 root->right = make_node(val); 76 if (curr->right) 77 todo.push_back (curr->right);
|
/netbsd-current/external/bsd/unbound/dist/util/ |
H A D | rbtree.c | 63 /** rotate subtree right (to preserve redblack property) */ 110 rbnode_type *right = node->right; local 111 node->right = right->left; 112 if (right->left != RBTREE_NULL) 113 right->left->parent = node; 115 right->parent = node->parent; 119 node->parent->left = right; 121 node->parent->right [all...] |
/netbsd-current/external/bsd/nsd/dist/ |
H A D | rbtree.c | 66 rbnode_type *right = node->right; local 67 node->right = right->left; 68 if (right->left != RBTREE_NULL) 69 right->left->parent = node; 71 right->parent = node->parent; 75 node->parent->left = right; 77 node->parent->right = right; [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | GCNILPSched.cpp | 42 const SUnit *pickBest(const SUnit *left, const SUnit *right); 92 // scheduled right before its predecessors that it doesn't lengthen 130 // Return -1 if left has higher priority, 1 if right has higher priority. 132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { argument 136 int RHeight = (int)right->getHeight(); 149 int RDepth = right->getDepth(); 152 << ") depth " << LDepth << " vs SU (" << right->NodeNum 156 if (left->Latency != right->Latency) 157 return left->Latency > right->Latency ? 1 : -1; 162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) argument [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/mmix/ |
H A D | loc-2.s | 1 # Check that a LOC before any code gets translated into the right
|