/netbsd-current/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleSValBuilder.cpp | 379 // Handle trivial case where left-side and right-side are the same. 494 // Swap the left and right sides and flip the operator if doing so 912 // Do the same for the right index. 923 // evalBinOpNN expects the two indexes to already be the right type. 946 int64_t right = RightOffset.getOffset(); local 952 return makeTruthVal(left < right, resultTy); 954 return makeTruthVal(left > right, resultTy); 956 return makeTruthVal(left <= right, resultTy); 958 return makeTruthVal(left >= right, resultTy); 960 return makeTruthVal(left == right, resultT [all...] |
/netbsd-current/external/gpl3/gdb/dist/gdb/ |
H A D | f-exp.y | 200 %right '=' ASSIGN_MODIFY 201 %right '?' 203 %right BOOL_NOT 214 %right STARSTAR 215 %right '%' 216 %right UNARY 217 %right '(' 1090 shifting right and seeing if anything remains, and the
|
H A D | m2-exp.y | 142 %right UNARY 143 %right '^' DOT '[' '(' 144 %right NOT '~' 147 %right QID
|
H A D | ada-exp.y | 468 %right STARSTAR ABS NOT 477 %right TICK_ACCESS TICK_ADDRESS TICK_FIRST TICK_LAST TICK_LENGTH 478 %right TICK_MAX TICK_MIN TICK_MODULUS 479 %right TICK_POS TICK_RANGE TICK_SIZE TICK_TAG TICK_VAL 480 %right TICK_COMPLETE 481 /* The following are right-associative only so that reductions at this 484 %right '.' '(' '[' DOT_ID DOT_COMPLETE
|
/netbsd-current/external/gpl2/groff/dist/src/utils/tfmtodit/ |
H A D | tfmtodit.cpp | 380 int right[256]; member in class:gf 389 int get_right_adjustment(int i) { return right[i]; } 395 left[i] = right[i] = 0; 471 right[code & 0377] = right_adj; 485 right[code] = right_adj;
|
/netbsd-current/external/gpl3/gdb.old/dist/sim/d10v/ |
H A D | interp.c | 131 leftright ? "left" : "right", ins2); 1055 unsigned long right = ins_type_counters[ (int)INS_RIGHT ] + ins_type_counters[ (int)INS_RIGHT_COND_EXE ]; local 1059 unsigned long right_total = right + right_parallel + right_cond + right_nops; 1077 int normal_size = strlen (add_commas (buf1, sizeof (buf1), (left > right) ? left : right)); 1088 "executed %*s right instruction(s), %*s normal, %*s parallel, %*s EXExxx, %*s nops\n", 1090 normal_size, add_commas (buf2, sizeof (buf2), right),
|
/netbsd-current/external/cddl/osnet/dev/cyclic/ |
H A D | cyclic.c | 167 * 2. The left and right children of the nth element are element 228 * miss on the left child will guarantee a hit on the right child; downheaps 427 cyc_index_t left, right, me; local 444 * Even if we don't have a right child, we still need to compare 450 right = heap[heap_right]; 453 * We have both a left and a right child. We need to compare 457 if (cyclics[right].cy_expire < cyclics[left].cy_expire) { 459 * Our right child is the earlier of our children. 463 if (cyclics[me].cy_expire <= cyclics[right].cy_expire) 467 * Our right chil [all...] |
/netbsd-current/external/gpl3/gdb.old/dist/gdb/ |
H A D | ada-exp.y | 163 %right STARSTAR ABS NOT 172 %right TICK_ACCESS TICK_ADDRESS TICK_FIRST TICK_LAST TICK_LENGTH 173 %right TICK_MAX TICK_MIN TICK_MODULUS 174 %right TICK_POS TICK_RANGE TICK_SIZE TICK_TAG TICK_VAL 175 /* The following are right-associative only so that reductions at this 178 %right '.' '(' '[' DOT_ID DOT_ALL
|
H A D | m2-exp.y | 140 %right UNARY 141 %right '^' DOT '[' '(' 142 %right NOT '~' 145 %right QID
|
/netbsd-current/external/gpl3/gdb/dist/sim/d10v/ |
H A D | interp.c | 130 leftright ? "left" : "right", ins2); 1057 unsigned long right = ins_type_counters[ (int)INS_RIGHT ] + ins_type_counters[ (int)INS_RIGHT_COND_EXE ]; local 1061 unsigned long right_total = right + right_parallel + right_cond + right_nops; 1079 int normal_size = strlen (add_commas (buf1, sizeof (buf1), (left > right) ? left : right)); 1090 "executed %*s right instruction(s), %*s normal, %*s parallel, %*s EXExxx, %*s nops\n", 1092 normal_size, add_commas (buf2, sizeof (buf2), right), 1152 /* Make sure we have the right structure for the following memset. */
|
/netbsd-current/external/bsd/unbound/dist/util/data/ |
H A D | msgencode.c | 80 /** right node in tree, all larger than this */ 81 struct compress_tree_node* right; member in struct:compress_tree_node 128 prev = &p->right; 129 p = p->right; 185 n->right = 0; 230 * so is larger than newnode, thus goes right. */ 231 newnode->right = prevnode;
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/Sema/ |
H A D | SemaDeclObjC.cpp | 783 // diagnostics to occur right after we parse the type parameter list. 1647 // right thing. 3146 const Type *left, const Type *right); 3152 const Type *right = local 3155 if (left == right) return true; 3160 if (left->isIncompleteType() || right->isIncompleteType()) return false; 3167 TypeInfo RightTI = Context.getTypeInfo(right); 3178 if (isa<VectorType>(left)) return isa<VectorType>(right); 3179 if (isa<VectorType>(right)) return false; 3185 if (!left->isScalarType() || !right 3212 RecordDecl *right = cast<RecordType>(rt)->getDecl(); local 3244 MatchTwoMethodDeclarations(const ObjCMethodDecl *left, const ObjCMethodDecl *right, MethodMatchStrategy strategy) argument [all...] |
/netbsd-current/external/gpl2/xcvs/dist/src/ |
H A D | modules.c | 804 const struct sortrec *right = (const struct sortrec *) r; 809 if ((i = strcmp (left->status, right->status)) != 0) 812 return (strcmp (left->modname, right->modname)); 802 const struct sortrec *right = (const struct sortrec *) r; local
|
/netbsd-current/external/lgpl3/gmp/dist/tests/cxx/ |
H A D | t-ostream.cc | 95 { "-1", " -1", ios::dec | ios::right, 5 }, 99 { "1", " 0x1", ios::hex | ios::showbase | ios::right, 6 }, 103 { "1", " +0x1", ios::hex | ios::showbase | ios::showpos | ios::right,
|
/netbsd-current/games/atc/ |
H A D | input.c | 77 static const char *right(int); 149 { 'r', 6, " right", right }, 151 { 'R', 4, " right 90", Right }, 448 right(int c __unused) function
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | ios_base.h | 329 * - right 356 /// generated output, or identical to @c right if no such point is 360 /// Adds fill characters on the right (final positions) of certain 368 /// generated output. (I.e., the thing you print is flush right.) 369 static const fmtflags right = _S_right; member in class:io_errc::ios_base 395 /// A mask of left|right|internal. Useful for the 2-arg form of @c setf. 1035 /// Calls base.setf(ios_base::right, ios_base::adjustfield). 1037 right(ios_base& __base) function in class:io_errc 1039 __base.setf(ios_base::right, ios_base::adjustfield);
|
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/base/ |
H A D | bsearch.c | 69 * right boundary falling in the middle of it -- the chosen solution to 70 * this makes left sub-tree searches slightly less efficient than right 78 * in the middle of a record. Here it is the right sub-tree searches 98 find_line(const char *buf, size_t i, size_t right) argument 102 for (; i < right; i++) { 104 if ((i + 1) < right) 145 * whether to read a block to the left or to the right and 161 size_t r; /* right side of buffer for binary search */ 162 size_t rmax; /* right side of buffer for binary search */ 183 * No new line found to the right; searc [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/cp/ |
H A D | logic.cc | 319 "left" and "right" refer to the position of formula in a 324 left, right enumerator in enum:rules 624 if (r == right) 807 x = rhs, y = lhs, r = right;
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | ios_base.h | 334 * - right 361 /// generated output, or identical to @c right if no such point is 365 /// Adds fill characters on the right (final positions) of certain 373 /// generated output. (I.e., the thing you print is flush right.) 374 static const fmtflags right = _S_right; member in class:io_errc::ios_base 400 /// A mask of left|right|internal. Useful for the 2-arg form of @c setf. 1048 /// Calls base.setf(ios_base::right, ios_base::adjustfield). 1050 right(ios_base& __base) function in class:io_errc 1052 __base.setf(ios_base::right, ios_base::adjustfield);
|
/netbsd-current/usr.bin/xlint/lint1/ |
H A D | debug.c | 266 lint_assert(is_binary(tn) == (tn->u.ops.right != NULL)); 267 if (tn->u.ops.right != NULL) 268 debug_node(tn->u.ops.right);
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/ |
H A D | rshift.asm | 1 dnl AMD K7 mpn_rshift -- mpn right shift. 51 C Shift src,size right by shift many bits and store the result in dst,size. 52 C Zeros are shifted in at the left. The bits shifted out at the right are
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/pentium/mmx/ |
H A D | rshift.asm | 1 dnl Intel P5 mpn_rshift -- mpn right shift. 40 C Shift src,size right by shift many bits and store the result in dst,size. 42 C right.
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | dominance.cc | 650 while (!n->right || n->right == n->father->son) 658 n = n->right; 906 for (ason = son->right; ason != son; ason = ason->right) 1602 struct et_node *next = bb->dom[dir_index]->right;
|
/netbsd-current/sys/external/bsd/acpica/dist/compiler/ |
H A D | asltokens.y | 444 %right <i> PARSEOP_EXP_EQUALS 475 %right <i> PARSEOP_EXP_NOT 487 %right <i> PARSEOP_EXP_INDEX_RIGHT
|
/netbsd-current/usr.bin/make/unit-tests/ |
H A D | varmod-subst.mk | 212 @echo ${:U1 2 3:S)2)two):Q} right parenthesis 230 @echo ${:U1 2 3:S]2]two]:Q} right square bracket 237 @echo ${:U1 2 3:S}2}two}:Q} right curly bracket
|