| /src/external/apache2/llvm/dist/llvm/lib/MC/MCDisassembler/ |
| MCExternalSymbolizer.cpp | 117 const MCExpr *LHS;
119 LHS = MCBinaryExpr::createSub(Add, Sub, Ctx);
121 LHS = MCUnaryExpr::createMinus(Sub, Ctx);
123 Expr = MCBinaryExpr::createAdd(LHS, Off, Ctx);
125 Expr = LHS;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 32 changeset_ty LHS, RHS;
36 ((idx < N) ? LHS : RHS).insert(*it);
37 if (!LHS.empty())
38 Res.push_back(LHS);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/Disassembler/ |
| AArch64ExternalSymbolizer.cpp | 199 const MCExpr *LHS;
201 LHS = MCBinaryExpr::createSub(Add, Sub, Ctx);
203 LHS = MCUnaryExpr::createMinus(Sub, Ctx);
205 Expr = MCBinaryExpr::createAdd(LHS, Off, Ctx);
207 Expr = LHS;
|
| /src/external/bsd/libbind/dist/irs/ |
| hesiod_p.h | 39 char * LHS; /*%< normally ".ns" */
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaConcept.cpp | 34 const Expr *LHS = nullptr;
41 LHS = BO->getLHS();
45 LHS = OO->getArg(0);
54 const Expr *getLHS() const { return LHS; }
532 // Or evaluated to false - meaning both RHS and LHS evaluated to false.
541 // LHS is true, so RHS must be false.
545 // LHS is false
770 auto LHS = fromConstraintExpr(S, D, BO.getLHS());
771 if (!LHS)
777 return NormalizedConstraint(S.Context, std::move(*LHS), std::move(*RHS)
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/dsymutil/ |
| SymbolMap.cpp | 129 StringRef LHS;
130 std::tie(LHS, Data) = Data.split('\n');
134 if (!LHS.startswith("BCSymbolMap Version:")) {
138 UnobfuscatedStrings.emplace_back(LHS);
139 } else if (LHS.equals("BCSymbolMap Version: 1.0")) {
141 } else if (LHS.equals("BCSymbolMap Version: 2.0")) {
145 std::tie(LHS, VersionNum) = LHS.split(':');
153 std::tie(LHS, Data) = Data.split('\n');
154 UnobfuscatedStrings.emplace_back(LHS);
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 LExpr *LHS, *RHS;
58 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
61 const LExpr *left() const { return LHS; }
62 LExpr *left() { return LHS; }
70 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
77 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Interp.h | 102 bool AddSubMulHelper(InterpState &S, CodePtr OpPC, unsigned Bits, const T &LHS,
106 if (!OpFW(LHS, RHS, Bits, &Result)) {
115 APSInt Value = OpAP<APSInt>()(LHS.toAPSInt(Bits), RHS.toAPSInt(Bits));
134 const T &LHS = S.Stk.pop<T>();
136 return AddSubMulHelper<T, T::add, std::plus>(S, OpPC, Bits, LHS, RHS);
142 const T &LHS = S.Stk.pop<T>();
144 return AddSubMulHelper<T, T::sub, std::minus>(S, OpPC, Bits, LHS, RHS);
150 const T &LHS = S.Stk.pop<T>();
152 return AddSubMulHelper<T, T::mul, std::multiplies>(S, OpPC, Bits, LHS, RHS);
165 const T &LHS = S.Stk.pop<T>()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| UndefResultChecker.cpp | 70 const llvm::APSInt *LHS = SB.getKnownValue(State, C.getSVal(B->getLHS()));
72 assert(LHS && RHS && "Values unknown, inconsistent state");
73 return (unsigned)RHS->getZExtValue() > LHS->countLeadingZeros();
158 const llvm::APSInt *LHS =
163 << LHS->getSExtValue() << "\' by \'" << RHS->getZExtValue()
|
| MismatchedIteratorChecker.cpp | 170 SVal LHS = UndefinedVal();
182 if (LHS.isUndef()) {
183 LHS = Call.getArgSVal(J);
185 verifyMatch(C, LHS, Call.getArgSVal(J));
|
| IdenticalExprChecker.cpp | 81 const Expr *LHS = B->getLHS();
88 while (const BinaryOperator *B2 = dyn_cast<BinaryOperator>(LHS)) {
96 LHS = B2->getLHS();
99 if (isIdenticalStmt(AC->getASTContext(), RHS, LHS)) {
101 Sr[1] = LHS->getSourceRange();
222 const Expr *LHS = B->getLHS()->IgnoreParenImpCasts();
225 const DeclRefExpr *DeclRef1 = dyn_cast<DeclRefExpr>(LHS);
227 const FloatingLiteral *FloatLit1 = dyn_cast<FloatingLiteral>(LHS);
244 } else if (LHS->getType()->hasFloatingRepresentation()) {
247 // Here only LHS is checked since RHS will be implicit casted to float
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| LoopUnrollAnalyzer.cpp | 75 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
76 if (!isa<Constant>(LHS))
77 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS))
78 LHS = SimpleLHS;
87 SimplifyBinOp(I.getOpcode(), LHS, RHS, FI->getFastMathFlags(), DL);
89 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL);
173 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
176 if (!isa<Constant>(LHS))
177 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS))
178 LHS = SimpleLHS
[all...] |
| PHITransAddr.cpp | 255 // PHI translate the LHS.
260 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
261 if (!LHS) return nullptr;
263 // If the PHI translated LHS is an add of a constant, fold the immediates.
264 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS))
267 LHS = BOp->getOperand(0);
271 // If the old 'LHS' was an input, add the new 'LHS' as an input.
274 AddAsInput(LHS);
279 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, {DL, TLI, DT, AC}))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanPredicator.cpp | 93 VPValue *LHS = Worklist.front();
99 VPValue *Or = Builder.createOr(LHS, RHS);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/MC/ |
| SubtargetFeature.h | 156 bool LHS = test(I), RHS = Other.test(I);
157 if (LHS != RHS)
158 return LHS < RHS;
|
| /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/ |
| CoverageMapping.cpp | 67 extractTerms(E.LHS, Factor, Terms);
85 llvm::sort(Terms, [](const Term &LHS, const Term &RHS) {
86 return LHS.CounterID < RHS.CounterID;
126 Counter CounterExpressionBuilder::add(Counter LHS, Counter RHS) {
127 return simplify(get(CounterExpression(CounterExpression::Add, LHS, RHS)));
130 Counter CounterExpressionBuilder::subtract(Counter LHS, Counter RHS) {
132 get(CounterExpression(CounterExpression::Subtract, LHS, RHS)));
148 dump(E.LHS, OS);
177 Expected<int64_t> LHS = evaluate(E.LHS);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 360 Value *LHS = getReducedOperand(I->getOperand(0), SclTy);
362 Res = Builder.CreateBinOp((Instruction::BinaryOps)Opc, LHS, RHS);
367 Value *LHS = getReducedOperand(I->getOperand(1), SclTy);
369 Res = Builder.CreateSelect(Op0, LHS, RHS);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| PoisonChecking.cpp | 109 Value *LHS = I.getOperand(0);
117 B.CreateBinaryIntrinsic(Intrinsic::sadd_with_overflow, LHS, RHS);
122 B.CreateBinaryIntrinsic(Intrinsic::uadd_with_overflow, LHS, RHS);
130 B.CreateBinaryIntrinsic(Intrinsic::ssub_with_overflow, LHS, RHS);
135 B.CreateBinaryIntrinsic(Intrinsic::usub_with_overflow, LHS, RHS);
143 B.CreateBinaryIntrinsic(Intrinsic::smul_with_overflow, LHS, RHS);
148 B.CreateBinaryIntrinsic(Intrinsic::umul_with_overflow, LHS, RHS);
156 B.CreateICmp(ICmpInst::ICMP_NE, B.CreateURem(LHS, RHS),
157 ConstantInt::get(LHS->getType(), 0));
165 B.CreateICmp(ICmpInst::ICMP_NE, B.CreateSRem(LHS, RHS)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SMTConstraintManager.h | 170 const llvm::APSInt *LHS, *RHS;
172 LHS = getSymVal(State, SIE->getLHS());
175 LHS = &ISE->getLHS();
179 LHS = getSymVal(State, SSM->getLHS());
180 RHS = LHS ? getSymVal(State, SSM->getRHS()) : nullptr;
185 if (!LHS || !RHS)
190 std::tie(ConvertedLHS, LTy) = SMTConv::fixAPSInt(Ctx, *LHS);
|
| SMTConv.h | 91 const llvm::SMTExprRef &LHS,
95 assert(*Solver->getSort(LHS) == *Solver->getSort(RHS) &&
101 return Solver->mkBVMul(LHS, RHS);
104 return isSigned ? Solver->mkBVSDiv(LHS, RHS) : Solver->mkBVUDiv(LHS, RHS);
107 return isSigned ? Solver->mkBVSRem(LHS, RHS) : Solver->mkBVURem(LHS, RHS);
111 return Solver->mkBVAdd(LHS, RHS);
114 return Solver->mkBVSub(LHS, RHS);
118 return Solver->mkBVShl(LHS, RHS)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| CalledOnceCheck.cpp | 340 const DeclRefExpr *LHS = Visit(BO->getLHS());
341 return LHS ? LHS : Visit(BO->getRHS());
|
| /src/external/apache2/llvm/dist/clang/lib/Lex/ |
| PreprocessingRecord.cpp | 187 SourceLocation LHS = getLoc(L);
189 return SM.isBeforeInTranslationUnit(LHS, RHS);
193 SourceLocation LHS = getLoc(L);
194 return SM.isBeforeInTranslationUnit(LHS, RHS);
197 bool operator()(SourceLocation LHS, PreprocessedEntity *R) const {
199 return SM.isBeforeInTranslationUnit(LHS, RHS);
|
| /src/external/apache2/llvm/dist/clang/lib/Rewrite/ |
| DeltaTree.cpp | 58 DeltaTreeNode *LHS, *RHS;
138 Children[0] = IR.LHS;
141 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
224 InsertRes->LHS->DoInsertion(FileIndex, Delta, nullptr /*can't fail*/);
244 IN->Children[i] = InsertRes->LHS;
257 IN->Children[i] = InsertRes->LHS;
267 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->LHS);
302 // the first 'WidthFactor-1' values to the LHS child (which we leave in this
331 InsertRes.LHS = this;
|
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 113 std::unique_ptr<ExprAST> LHS, RHS;
116 BinaryExprAST(char Op, std::unique_ptr<ExprAST> LHS,
118 : Op(Op), LHS(std::move(LHS)), RHS(std::move(RHS)) {}
273 std::unique_ptr<ExprAST> LHS) {
281 return LHS;
293 // the pending operator take RHS as its LHS.
301 // Merge LHS/RHS.
302 LHS =
303 std::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS))
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| Twine.h | 154 /// LHS - The prefix in the concatenation, which may be uninitialized for
156 Child LHS;
174 explicit Twine(const Twine &LHS, const Twine &RHS)
176 this->LHS.twine = &LHS;
182 explicit Twine(Child LHS, NodeKind LHSKind, Child RHS, NodeKind RHSKind)
183 : LHS(LHS), RHS(RHS), LHSKind(LHSKind), RHSKind(RHSKind) {
223 // The RHS cannot be non-empty if the LHS is empty.
229 !LHS.twine->isBinary()
[all...] |
