| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| CodeBeadsGen.cpp | 98 unsigned Right = 8 * p;
99 unsigned Left = Right + 8;
102 for (unsigned i = Right; i != Left; ++i) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| FormatAdapters.h | 45 size_t Right;
48 PadAdapter(T &&Item, size_t Left, size_t Right)
49 : FormatAdapter<T>(std::forward<T>(Item)), Left(Left), Right(Right) {}
55 Stream.indent(Right);
92 detail::PadAdapter<T> fmt_pad(T &&Item, size_t Left, size_t Right) {
93 return detail::PadAdapter<T>(std::forward<T>(Item), Left, Right);
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| FormatVariadic.cpp | 20 return AlignStyle::Right;
29 Where = AlignStyle::Right;
65 AlignStyle Where = AlignStyle::Right;
107 StringRef Right = Fmt.drop_front(NumEscapedBraces * 2);
108 return std::make_pair(ReplacementItem{Middle}, Right);
130 StringRef Right = Fmt.substr(BC + 1);
134 return std::make_pair(*RI, Right);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| ProfileGenerator.h | 94 // skipping the right half part of the window, otherwise just copy back
104 // right half of the window(End = 0), then slide the window.
105 // Result: [a1], a2, b1, b2 (End points to the element right before ],
108 // 2) Next window is [a1, a2]. Since a1 == a2, then skip the right half of
112 // 3) Next window is [a2, b1], copy the right half of the window(b1 is
123 // LeftBoundary Left Right Left+I Right+I
126 int32_t Right = I - 1;
129 while (Right + I < Context.size()) {
140 // 1) For the window [a, b1, c1, b2], non-common-suffix for the right
[all...] |
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| PRBTree.h | 65 Right
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| PRBTree.h | 65 Right
|
| /src/sys/external/bsd/acpica/dist/namespace/ |
| nsnames.c | 265 char c, *Left, *Right;
328 Right = FullPath+Length - 1;
330 while (Left < Right)
333 *Left++ = *Right;
334 *Right-- = c;
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
| casts.cc | 44 struct Right
46 int right; member in struct:Right
49 struct LeftRight : public Left, public Right
64 int right; member in struct:VirtualRight
87 gd.right = 27;
89 unsigned long long r_value = (unsigned long long) (Right *) &gd;
93 Right *r = lr;
97 Right *r_lr = reinterpret_cast<Right *>(lr);
|
| member-ptr.cc | 123 class Right : public Base {
128 int Right::vget ()
133 class Diamond : public Padding, public Left, public Right
190 diamond.Right::x = 88;
195 right_pmf = (int (Diamond::*) ()) (int (Right::*) ()) (&Base::get_x);
198 right_vpmf = &Right::vget;
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
| casts.cc | 44 struct Right
46 int right; member in struct:Right
49 struct LeftRight : public Left, public Right
64 int right; member in struct:VirtualRight
87 gd.right = 27;
89 unsigned long long r_value = (unsigned long long) (Right *) &gd;
93 Right *r = lr;
97 Right *r_lr = reinterpret_cast<Right *>(lr);
|
| member-ptr.cc | 123 class Right : public Base {
128 int Right::vget ()
133 class Diamond : public Padding, public Left, public Right
190 diamond.Right::x = 88;
195 right_pmf = (int (Diamond::*) ()) (int (Right::*) ()) (&Base::get_x);
198 right_vpmf = &Right::vget;
|
| /src/games/atc/ |
| input.c | 77 static const char *right(int);
79 static const char *Right(int);
149 { 'r', 6, " right", right },
151 { 'R', 4, " right 90", Right },
448 right(int c __unused) function
469 Right(int c __unused)
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/GISel/ |
| AArch64PostLegalizerLowering.cpp | 422 /// %shuf = G_SHUFFLE_VECTOR %left, %right, shufflemask(0, 0)
442 Register Right = MI.getOperand(2).getReg();
443 Register DstVec = DstIsLeft ? Left : Right;
448 SrcVec = Right;
474 /// operand of a vector shift right operation. The value must be in the range:
475 /// 1 <= Value <= ElementBits for a right shift.
513 /// G_ICMP instruction such that the right-hand side is an arithmetic immediate.
|
| /src/external/apache2/llvm/dist/clang/lib/Format/ |
| Format.cpp | 356 IO.enumCase(Value, "Right", FormatStyle::ENAS_Right);
381 IO.enumCase(Value, "Right", FormatStyle::PAS_Right);
1945 // right token has \p RK token kind. If \p DeleteLeft is true, the left token
1946 // is deleted on match; otherwise, the right token is deleted.
1958 auto *Right = NextNotDeleted(*Left);
1959 if (!Right)
1961 if (Left->is(LK) && Right->is(RK)) {
1962 deleteToken(DeleteLeft ? Left : Right);
1963 for (auto *Tok = Left->Next; Tok && Tok != Right; Tok = Tok->Next)
1965 // If the right token is deleted, we should keep the left toke
[all...] |
| TokenAnnotator.cpp | 120 // tokens to prevent splitting right bitshift operators and potentially
318 // categorize it as an unary operator, so set the right type here.
1814 // If there is an identifier (or with a few exceptions a keyword) right
1821 // Certain other tokens right before the parentheses are also signals that
1987 // declarations. Thus, having an identifier on the right-hand side
2599 const FormatToken &Right = Tok;
2605 if (Right.isOneOf(Keywords.kw_extends, Keywords.kw_throws))
2607 if (Right.is(Keywords.kw_implements))
2612 if (Right.is(Keywords.kw_function) && Left.isNot(tok::comma))
2617 (Right.is(TT_TemplateString) && Right.TokenText.startswith("}"))
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 62 /// Return a pointer to the right subtree. This value is
63 /// NULL if there is no right subtree.
64 ImutAVLTree *getRight() const { return right; }
93 ImutAVLTree *Right = T->getRight();
94 while (Right) { T = Right; Right = T->getRight(); }
212 "Current value is not less that value of right child");
224 ImutAVLTree *right; member in class:llvm::ImutAVLTree
246 : factory(f), left(l), right(r), height(height), IsMutable(true)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonSplitDouble.cpp | 793 bool Right = (Opc == S2_lsr_i_p || Opc == S2_asr_i_p);
794 bool Left = !Right;
819 // Shift right: DR = shr R, #s
826 // Shift right:
871 else // Must be right shift.
|
| HexagonConstExtenders.cpp | 129 Node *Left = nullptr, *Right = nullptr;
172 N->Height = 1 + std::max(height(N->Left), height(N->Right));
175 if (N->Right)
176 N->MaxEnd = std::max(N->MaxEnd, N->Right->MaxEnd);
181 int32_t Balance = height(N->Right) - height(N->Left);
185 return rotateLeft(N->Right, N);
592 dbgs() << " Right: " << N->Right << "\n\n";
596 if (N->Right)
597 dump(N->Right);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFastISel.cpp | 112 /// right decision when generating code for different targets.
502 unsigned Right = createResultReg(&WebAssembly::I32RegClass);
504 TII.get(WebAssembly::SHR_S_I32), Right)
508 return Right;
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| StdLibraryFunctionsChecker.cpp | 759 const llvm::APSInt &Right = BVF.getValue(R[E - 1].second + 1ULL, T);
760 if (Right != MinusInf) {
761 assert(Right <= PlusInf);
762 State = CM.assumeInclusiveRange(State, *N, Right, PlusInf, false);
|
| CStringChecker.cpp | 263 NonLoc right) const;
645 NonLoc right) const {
662 if (right.getAs<nonloc::ConcreteInt>()) {
663 maxMinusRight = svalBuilder.evalBinOpNN(state, BO_Sub, maxVal, right,
670 left = right;
675 // If left > max - right, we have an overflow.
1281 AnyArgExpr Right = {CE->getArg(1), 1};
1313 State->getSVal(Right.Expression, LCtx).castAs<DefinedOrUnknownSVal>();
1336 State = CheckBufferAccess(C, State, Right, Size, AccessKind::read);
1955 AnyArgExpr Right = {CE->getArg(1), 1}
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| MipsFastISel.cpp | 136 /// make the right decision when generating code for different targets.
638 const Value *Left = CI->getOperand(0), *Right = CI->getOperand(1);
643 unsigned RightReg = getRegEnsuringSimpleIntegerWidening(Right, IsUnsigned);
1249 // for now (will return false). We need to determine the right alignment
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaChecking.cpp | 228 // FIXME: this is not quite the right error message since we don't allow
690 // diagnostic isn't quite right. We should still diagnose passing a buffer
994 // check that the last argument is the right block type.
5033 // Check we have the right number of arguments.
5727 // Okay, we have something that *can* be converted to the right type. Check
6693 // then shifting the value right by 8 bits won't affect whether it's a
7058 // read from TypeStr. So we need to read them all to ensure we have the right
7182 "operator must be add or sub with addend on the right");
7315 // We need to maintain the offsets for the right and the left hand side
7333 StringLiteralCheckType Right = checkFormatStringExpr
[all...] |
