/netbsd-current/external/lgpl3/gmp/dist/mpn/power/ |
H A D | rshift.asm | 1 dnl IBM POWER mpn_rshift -- Shift a number right.
|
/netbsd-current/external/bsd/pcc/dist/pcc/arch/vax/ |
H A D | local2.c | 516 case 'F': /* register type of right operand */ 549 case 'R': /* type of right operand */ 586 case 'U': /* 32 - n, for unsigned right shifts */ 695 if( (o==PLUS || o==MINUS) && p->left->op == REG && p->right->op==ICON) 713 (p->right->op==ICON && p->right->name[0]=='\0') 714 && (1<<p->right->lval)==tyl)) 1072 if( p->right ) temp = argsize( p->right ); 1085 if( p->right ){ /* mak [all...] |
/netbsd-current/external/gpl2/xcvs/dist/lib/ |
H A D | quotearg.c | 249 char const *right = gettext_quote (N_("'"), quoting_style); local 253 quote_string = right;
|
/netbsd-current/external/bsd/mdocml/dist/ |
H A D | tree.c | 354 if (ep->right) 355 printf(" right=\"%s\"", ep->right);
|
/netbsd-current/sys/external/bsd/drm2/dist/drm/ |
H A D | drm_atomic_state_helper.c | 451 state->tv.margins.right = cmdline->tv_margins.right;
|
/netbsd-current/usr.bin/make/unit-tests/ |
H A D | deptgt-end-fail.mk | 13 # stops right after the first error.
|
H A D | cond-token-var.mk | 32 # A variable that appears on the right-hand side must be defined.
|
H A D | var-op-expand.mk | 4 # right-hand side. 14 # If the right-hand side does not contain a dollar sign, the ':=' assignment 21 # When a ':=' assignment is performed, its right-hand side is evaluated and 153 # instead of ':='. The right-hand side of the assignment is not evaluated at
|
/netbsd-current/sys/external/bsd/acpica/dist/compiler/ |
H A D | prparser.y | 109 %right <op> EXPOP_ONES_COMPLIMENT EXPOP_LOGICAL_NOT
|
H A D | dtparser.y | 109 %right <op> OP_EXP_ONES_COMPLIMENT OP_EXP_LOGICAL_NOT
|
/netbsd-current/external/gpl3/binutils.old/dist/bfd/ |
H A D | elfxx-loongarch.c | 45 #define LOONGARCH_HOWTO(type, right, size, bits, pcrel, left, ovf, func, \ 47 { HOWTO(type, right, size, bits, pcrel, left, ovf, func, name, \
|
/netbsd-current/external/gpl3/binutils/dist/bfd/ |
H A D | elf64-bpf.c | 38 #define BPF_HOWTO(type, right, size, bits, pcrel, left, ovf, func, name, \ 57 #define BPF_HOWTO(type, right, size, bits, pcrel, left, ovf, func, name, \
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/libdruntime/core/sys/windows/ |
H A D | windef.d | 122 LONG right;
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/internal/math/ |
H A D | biguintnoasm.d | 260 Sets result = result[0 .. left.length] + left * right 265 for (size_t i = 0; i< right.length; ++i) 268 left, right[i], 0); 273 [] right) pure @nogc @safe 275 for (size_t i = 0; i < right.length; ++i) 278 left, right[i], 0);
|
/netbsd-current/sys/dev/pckbport/ |
H A D | alps.c | 825 int left, middle, right; local 841 right = (psc->packet[1] & 0x02) >> 1; 843 buttons = (u_int)((left << 0) | (middle << 1) | (right << 2)); 1035 u_int left, middle, right; local 1045 right = (psc->packet[3] & 0x02) >> 1; 1064 buttons |= right << 2;
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/ |
H A D | d-exp.y | 160 %right '=' ASSIGN_MODIFY 161 %right '?' 168 %right LSH RSH 171 %right HATHAT 173 %right INCREMENT DECREMENT 174 %right '.' '[' '(' 827 whether it fits, we shift it right and see whether anything remains. 1416 right point. */
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/internal/math/ |
H A D | biguintnoasm.d | 260 Sets result = result[0 .. left.length] + left * right 265 for (size_t i = 0; i< right.length; ++i) 268 left, right[i], 0); 273 [] right) pure @nogc @safe 275 for (size_t i = 0; i < right.length; ++i) 278 left, right[i], 0);
|
/netbsd-current/external/gpl3/gdb/dist/gdb/ |
H A D | d-exp.y | 163 %right '=' ASSIGN_MODIFY 164 %right '?' 171 %right LSH RSH 174 %right HATHAT 176 %right INCREMENT DECREMENT 177 %right '.' '[' '(' 818 whether it fits, we shift it right and see whether anything remains. 1406 right point. */
|
/netbsd-current/usr.bin/config/ |
H A D | gram.y | 564 * loclist order matters, must use right recursion 690 /* XXX why is this right-recursive? */ 860 /* XXX why is this right-recursive? */ 1005 * order of options is important, must use right recursion 1086 /* XXX why right-recursive? */ 1298 mk_cx_and(struct condexpr *left, struct condexpr *right) 1304 cx->cx_and.right = right; 1309 mk_cx_or(struct condexpr *left, struct condexpr *right) 1315 cx->cx_or.right [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/ |
H A D | package.d | 3395 Node* left, right; 3403 n.left = n.right = null; 3417 n = n.right; 3432 data.left = data.right = null; 3449 if (!n.right) 3452 return insert(data, n.right); 3454 n = n.right; 3480 n = n.right; 3494 assert(!parent || parent.left == n || parent.right == n); 3496 ? (parent.left == n ? &parent.left : &parent.right) [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/common/ |
H A D | outbuffer.d | 599 extern (C++) void bracket(char left, char right) pure nothrow 604 data[offset + 1] = right; 609 * Insert left at i, and right at j. 610 * Return index just past right. 612 extern (C++) size_t bracket(size_t i, const(char)* left, size_t j, const(char)* right) pure nothrow 615 size_t rightlen = strlen(right); 618 insert(j + leftlen, right, rightlen); 724 value >>= 7; // arithmetic right shift
|
/netbsd-current/external/mit/isl/dist/doc/ |
H A D | implementation.tex | 134 A_i \vec x + B_i \vec s + D_i \vec z + \vec c_i \geq \vec 0 \,\right\} 143 \,\right\} 242 \node (core) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)] {}; 424 \node (m) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)] {}; 434 \node (m2) [inner sep=0pt,fill=black!20,right delimiter=),left delimiter=(,fit=(top)(bottom)(left)] {}; 794 $\left| b_j(\vec p) - b_i(\vec p) \right|_+ = 820 $t = \left|-b(\vec p)\right|_+ = \max(-b(\vec p), 0)$. 868 R^+ \coloneqq R \cup \left(R \circ R^+\right) 932 K = P \cap \left(\domain R \to \range R\right) 985 \right) \ca [all...] |
/netbsd-current/external/bsd/tmux/dist/ |
H A D | window.c | 627 else if (strcasecmp(s, "right") == 0) 632 } else if (strcasecmp(s, "top-right") == 0) { 638 } else if (strcasecmp(s, "bottom-right") == 0) { 1299 u_int edge, left, right, end, size; local 1323 right = wp->xoff + wp->sx; 1333 if (next->xoff < left && end > right) 1335 else if (next->xoff >= left && next->xoff <= right) 1337 else if (end >= left && end <= right) 1356 u_int edge, left, right, end, size; local 1380 right [all...] |
/netbsd-current/external/gpl3/gcc/dist/libphobos/libdruntime/core/internal/ |
H A D | convert.d | 167 for (size_t left = 0, right = buff.length - 1; left < right; left++, right--) 170 buff[left] = buff[right]; 171 buff[right] = swap; 460 // right by offset.
|
/netbsd-current/bin/csh/ |
H A D | lex.c | 562 * if the :g modifier is followed by a newline, then error right away! 665 int c, dol, left, right; local 687 left = 0, right = dol; 695 left = right = -1; 701 left = 0, right = dol; 707 if (!getsel(&left, &right, dol)) 713 if (!getsel(&left, &right, dol)) 718 exclc = right - left + 1;
|