/netbsd-current/external/gpl3/gdb.old/dist/gdb/ |
H A D | rust-exp.y | 258 const struct rust_op *right); 338 RUSTSTYPE right; 419 %right '=' COMPOUND_ASSIGN 669 right thing for both bool and integral 844 $2->right.params); 883 $2->right.params); 1053 return ast_path (result, name->right.params); 1103 ident->right.params); 1714 const struct rust_op *right) 1720 result->right [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
H A D | rbtree.d | 120 * Get the right child 122 @property inout(RBNode)* right() inout 150 * Set the right child. Also updates the new child's parent node. This 155 @property Node right(Node newNode) 165 // performs rotate-right operation, where this is T, _right is R, _left is 177 * Rotate right. This performs the following operations: 179 * - This node becomes the new parent's right child. 180 * - The old right child of the new parent becomes the left child of this 194 parent.right = _left; 198 _left.right [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | et-forest.c | 470 nw->right = NULL; 519 struct et_node *left, *right; local 552 right = father->son; 553 if (right) 554 left = right->left; 556 left = right = t; 558 left->right = t; 559 right->left = t; 561 t->right = right; [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | et-forest.cc | 470 nw->right = NULL; 519 struct et_node *left, *right; 552 right = father->son; 553 if (right) 554 left = right->left; 556 left = right = t; 558 left->right = t; 559 right->left = t; 561 t->right = right; [all...] |
H A D | gimple-if-to-switch.cc | 152 range_entry *right = all_ranges[i + 1]; local 153 if (tree_int_cst_le (left->low, right->low) 154 && tree_int_cst_le (right->low, left->high)) 220 simple_cluster *right = static_cast<simple_cluster *> (clusters[i]); local 223 && !right->m_has_forward_bb 224 && left->m_case_bb == right->m_case_bb) 226 if (wi::eq_p (wi::to_wide (right->get_low ()) - wi::to_wide 229 left->set_high (right->get_high ()); 230 delete right;
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/container/ |
H A D | rbtree.d | 120 * Get the right child 122 @property inout(RBNode)* right() inout return scope 153 * Set the right child. Also updates the new child's parent node. This 161 @property Node right(return scope Node newNode) @trusted 171 // performs rotate-right operation, where this is T, _right is R, _left is 183 * Rotate right. This performs the following operations: 185 * - This node becomes the new parent's right child. 186 * - The old right child of the new parent becomes the left child of this 200 parent.right = _left; 204 _left.right [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/format/internal/ |
H A D | floats.d | 629 // consecutivly dividing by 10 and writing down the remainder from right to left. 637 // digit (from right to left). 644 // After that we decide on the rounding type, using the digits right of the position, 653 // (from left to right). This integer part is removed after each step. 685 size_t right = 1; 706 start = left = right = dec_buf.length; 766 if (start >= right) 773 foreach (i; start + 1 .. right) 781 if (start < right) right [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/fortran/ |
H A D | matchexp.c | 173 gfc_error ("Expected a right parenthesis in expression at %C"); 593 gfc_expr *left, *right, *r; local 623 m = match_level_3 (&right); 636 r = gfc_eq (left, right, i); 641 r = gfc_ne (left, right, i); 646 r = gfc_lt (left, right, i); 651 r = gfc_le (left, right, i); 656 r = gfc_gt (left, right, i); 661 r = gfc_ge (left, right, i); 671 gfc_free_expr (right); [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/fortran/ |
H A D | matchexp.cc | 173 gfc_error ("Expected a right parenthesis in expression at %C"); 593 gfc_expr *left, *right, *r; local 623 m = match_level_3 (&right); 636 r = gfc_eq (left, right, i); 641 r = gfc_ne (left, right, i); 646 r = gfc_lt (left, right, i); 651 r = gfc_le (left, right, i); 656 r = gfc_gt (left, right, i); 661 r = gfc_ge (left, right, i); 671 gfc_free_expr (right); [all...] |
/netbsd-current/sys/arch/hppa/spmath/ |
H A D | dbl_float.h | 123 #define Dbl_leftshiftby1_withextent(lefta,leftb,right,resulta,resultb) \ 125 Shiftdouble(Dallp2(leftb), Extall(right), 31, Dallp2(resultb)) 127 #define Dbl_rightshiftby1_withextent(leftb,right,dst) \ 128 Extall(dst) = (Dallp2(leftb) << 31) | ((unsigned)Extall(right) >> 1) | \ 129 Extlow(right) 409 * Here we need to shift the result right to correct for an overshift 422 /* The left argument is never smaller than the right argument */ 428 /* Subtract right augmented with extension from left augmented with zeros and 444 #define Dbl_xortointp1(left,right,result) \ 445 result = Dallp1(left) XOR Dallp1(right) [all...] |
H A D | impys.S | 51 * from right to left, to generate partial product. Execution speed is more 98 sh4n: shd pu,pl,4,pl ; shift product right 4 bits 114 shd pu,pl,4,pl ; product right 4 bits 119 shd pu,pl,4,pl ; product right 4 bits 124 addb,uv op1,pu,sh4c ; product right 4 bits 129 sh1add,nsv op1,pu,pu ; product right 4 bits 155 shd pu,pl,3,pl ; shift product right 3 bits 175 shd pu,pl,2,pl ; shift right 2 bits signed 180 shd pu,pl,2,pl ; right 2 unsigned, etc.
|
H A D | impyu.S | 50 * The algorithm uses the multiplier, four bits at a time, from right to left, 115 sh4n: shd pu,pl,4,pl ; shift product right 4 bits 131 shd pu,pl,4,pl ; product right 4 bits 136 shd pu,pl,4,pl ; product right 4 bits 141 addb,uv op1,pu,sh4c ; product right 4 bits 146 sh1add,nuv op1,pu,pu ; product right 4 bits 172 shd pu,pl,3,pl ; shift product right 3 bits 192 shd pu,pl,2,pl ; shift right 2 bits signed 197 shd pu,pl,2,pl ; right 2 unsigned, etc.
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/internal/math/ |
H A D | biguintcore.d | 56 // dipatchers to the right low-level primitives. Added to allow BigInt CTFE for 137 void multibyteMultiplyAccumulate()(uint[] dest, const(uint)[] left, const(uint)[] right) 140 std.internal.math.biguintnoasm.multibyteMultiplyAccumulate(dest, left, right); 142 std.internal.math.biguintx86.multibyteMultiplyAccumulate(dest, left, right); 144 std.internal.math.biguintnoasm.multibyteMultiplyAccumulate(dest, left, right); 716 assert(y > 0, "Can not right shift BigUint by 0"); 1019 * Method: Powers of 2 are removed from x, then left-to-right binary 1144 // It's not worth right shifting by evenbits unless we also shrink the length after each 2193 const(BigDigit)[] right) pure nothrow @safe 2196 assert(result.length == left.length + right [all...] |
/netbsd-current/external/bsd/less/dist/ |
H A D | search.c | 82 struct hilite_node *right; member in struct:hilite_node 428 * If we don't find the right node within a small 462 if (n->right != NULL) 464 n = n->right; 536 * we're filtered right to the beginning, otherwise just return pos. 655 struct hilite_node *nr = n->right; 656 struct hilite_node *nrl = n->right->left; 663 np->right = nr; 669 n->right = nrl; 678 * Rotate the tree right aroun [all...] |
/netbsd-current/external/bsd/cron/dist/ |
H A D | misc.c | 96 strcmp_until(const char *left, const char *right, char until) { argument 97 while (*left && *left != until && *left == *right) { 99 right++; 103 (*right=='\0' || *right == until)) { 106 return (*left - *right);
|
/netbsd-current/external/bsd/pcc/dist/pcc/arch/m16c/ |
H A D | local2.c | 535 NODE *q, *r, *s, *right; local 550 /* Must convert right into OREG */ 551 right = p->n_right; 552 q = mklnode(OREG, (freetemp(szty(right->n_type))), 553 FPREG, right->n_type); 554 s = mkbinode(ASSIGN, q, right, right->n_type);
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/ |
H A D | kernighan_ritchie.d | 116 bool adjacent(in Node* right) const 118 assert(right); 120 return p.ptr < right && right < p.ptr + p.length + Node.sizeof; 272 private Node* merge(Node* left, Node* right) 274 assert(left != right); 275 if (!left) return right; 276 if (!right) return left; 277 if (left < right) 280 result.next = merge(left.next, right); [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/building_blocks/ |
H A D | kernighan_ritchie.d | 119 bool adjacent(in Node* right) const 121 assert(right); 123 return p.ptr < right && right < p.ptr + p.length + Node.sizeof; 277 private Node* merge(Node* left, Node* right) 279 assert(left != right); 280 if (!left) return right; 281 if (!right) return left; 282 if (left < right) 285 result.next = merge(left.next, right); [all...] |
/netbsd-current/external/bsd/pcc/dist/pcc/cc/cpp/ |
H A D | cpy.y | 94 %right '?' ':' 104 %right '!' '~' UMINUS
|
/netbsd-current/sys/dev/isa/ |
H A D | ymvar.h | 185 #define YM_EQ_OFF(v) ((v)->left < YM_EQ_ON_MIN && (v)->right < YM_EQ_ON_MIN) 186 #define YM_WIDE_OFF(v) ((v)->left < YM_3D_ON_MIN && (v)->right < YM_3D_ON_MIN)
|
/netbsd-current/external/gpl3/gdb.old/dist/intl/ |
H A D | plural.c | 82 struct expression *right)); 85 struct expression *right)); 135 new_exp_1 (op, right) 137 struct expression *right; 141 args[0] = right; 146 new_exp_2 (op, left, right) 149 struct expression *right; 154 args[1] = right; 263 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ 523 /* YYLEX -- calling `yylex' with the right argument [all...] |
/netbsd-current/external/gpl2/grep/dist/intl/ |
H A D | plural.c | 81 struct expression *right)); 84 struct expression *right)); 134 new_exp_1 (op, right) 136 struct expression *right; 140 args[0] = right; 145 new_exp_2 (op, left, right) 148 struct expression *right; 153 args[1] = right;
|
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/asan/ |
H A D | asan_report.cc | 369 uptr right = a1 < a2 ? a2 : a1; 370 uptr offset = right - left; 378 uptr shadow_offset2 = t->GetStackVariableShadowStart(right); 386 return !GetHeapAddressInformation(right, 0, &hdesc2) || 393 return !GetGlobalAddressInformation(right - 1, 0, &gdesc2) || 396 if (t->GetStackVariableShadowStart(right) || 397 GetHeapAddressInformation(right, 0, &hdesc2) || 398 GetGlobalAddressInformation(right - 1, 0, &gdesc2))
|
/netbsd-current/external/gpl3/gcc.old/dist/libsanitizer/asan/ |
H A D | asan_report.cc | 367 uptr right = a1 < a2 ? a2 : a1; 368 uptr offset = right - left; 376 uptr shadow_offset2 = t->GetStackVariableShadowStart(right); 384 return !GetHeapAddressInformation(right, 0, &hdesc2) || 391 return !GetGlobalAddressInformation(right - 1, 0, &gdesc2) || 394 if (t->GetStackVariableShadowStart(right) || 395 GetHeapAddressInformation(right, 0, &hdesc2) || 396 GetGlobalAddressInformation(right - 1, 0, &gdesc2))
|
/netbsd-current/external/bsd/openldap/dist/servers/lloadd/ |
H A D | extended.c | 179 exop_handler_cmp( const void *left, const void *right ) 181 const struct lload_exop_handlers_t *l = left, *r = right;
|