| /src/external/apache2/llvm/dist/llvm/include/llvm/MC/MCParser/ |
| MCParsedAsmOperand.h | 39 MCParsedAsmOperand(const MCParsedAsmOperand &RHS) = default;
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 32 changeset_ty LHS, RHS;
36 ((idx < N) ? LHS : RHS).insert(*it);
39 if (!RHS.empty())
40 Res.push_back(RHS);
|
| /src/external/bsd/libbind/dist/irs/ |
| hesiod_p.h | 40 char * RHS; /*%< AKA the default hesiod domain */
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaConcept.cpp | 35 const Expr *RHS = nullptr;
42 RHS = BO->getRHS();
46 RHS = OO->getArg(1);
55 const Expr *getRHS() const { return RHS; }
532 // Or evaluated to false - meaning both RHS and LHS evaluated to false.
541 // LHS is true, so RHS must be false.
548 // RHS might also be false
773 auto RHS = fromConstraintExpr(S, D, BO.getRHS());
774 if (!RHS)
777 return NormalizedConstraint(S.Context, std::move(*LHS), std::move(*RHS),
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| CheckerHelpers.cpp | 79 // Extract lhs and rhs from assignment statement
83 const Expr *RHS = nullptr;
88 RHS = Assign->getRHS();
96 RHS = VD->getAnyInitializer();
99 return std::make_pair(VD, RHS);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 31 /// Logical implication. Returns true if the LExpr implies RHS, i.e. if
32 /// the LExpr holds, then RHS must hold. For example, (A & B) implies A.
33 inline bool implies(const LExpr *RHS) const;
55 LExpr *LHS, *RHS;
58 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
64 const LExpr *right() const { return RHS; }
65 LExpr *right() { return RHS; }
70 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Interp.h | 103 const T &RHS) {
106 if (!OpFW(LHS, RHS, Bits, &Result)) {
115 APSInt Value = OpAP<APSInt>()(LHS.toAPSInt(Bits), RHS.toAPSInt(Bits));
133 const T &RHS = S.Stk.pop<T>();
135 const unsigned Bits = RHS.bitWidth() + 1;
136 return AddSubMulHelper<T, T::add, std::plus>(S, OpPC, Bits, LHS, RHS);
141 const T &RHS = S.Stk.pop<T>();
143 const unsigned Bits = RHS.bitWidth() + 1;
144 return AddSubMulHelper<T, T::sub, std::minus>(S, OpPC, Bits, LHS, RHS);
149 const T &RHS = S.Stk.pop<T>()
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| UndefResultChecker.cpp | 71 const llvm::APSInt *RHS = SB.getKnownValue(State, C.getSVal(B->getRHS()));
72 assert(LHS && RHS && "Values unknown, inconsistent state");
73 return (unsigned)RHS->getZExtValue() > LHS->countLeadingZeros();
160 const llvm::APSInt *RHS =
163 << LHS->getSExtValue() << "\' by \'" << RHS->getZExtValue()
|
| DeadStoresChecker.cpp | 299 const Expr *RHS = B->getRHS()->IgnoreParenCasts();
300 const BinaryOperator* BRHS = dyn_cast<BinaryOperator>(RHS);
336 const Expr *RHS =
338 RHS = RHS->IgnoreParenCasts();
344 if (RHS->isNullPointerConstant(Ctx, Expr::NPC_ValueDependentIsNull))
350 if (const DeclRefExpr *RhsDR = dyn_cast<DeclRefExpr>(RHS))
|
| IdenticalExprChecker.cpp | 82 const Expr *RHS = B->getRHS();
91 if (isIdenticalStmt(AC->getASTContext(), RHS, B2->getRHS())) {
92 Sr[0] = RHS->getSourceRange();
99 if (isIdenticalStmt(AC->getASTContext(), RHS, LHS)) {
100 Sr[0] = RHS->getSourceRange();
223 const Expr *RHS = B->getRHS()->IgnoreParenImpCasts();
226 const DeclRefExpr *DeclRef2 = dyn_cast<DeclRefExpr>(RHS);
228 const FloatingLiteral *FloatLit2 = dyn_cast<FloatingLiteral>(RHS);
247 // Here only LHS is checked since RHS will be implicit casted to float.
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| LoopUnrollAnalyzer.cpp | 75 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
79 if (!isa<Constant>(RHS))
80 if (Constant *SimpleRHS = SimplifiedValues.lookup(RHS))
81 RHS = SimpleRHS;
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);
179 if (!isa<Constant>(RHS))
180 if (Constant *SimpleRHS = SimplifiedValues.lookup(RHS))
181 RHS = SimpleRHS
[all...] |
| PHITransAddr.cpp | 252 // Handle add with a constant RHS.
256 Constant *RHS = cast<ConstantInt>(Inst->getOperand(1));
268 RHS = ConstantExpr::getAdd(RHS, CI);
279 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, {DL, TLI, DT, AC})) {
287 if (LHS == Inst->getOperand(0) && RHS == Inst->getOperand(1))
294 BO->getOperand(0) == LHS && BO->getOperand(1) == RHS &&
420 // Handle add with a constant RHS.
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| VPlanPredicator.cpp | 95 VPValue *RHS = Worklist.front();
99 VPValue *Or = Builder.createOr(LHS, RHS);
|
| /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/ |
| TransZeroOutPropsInDealloc.cpp | 69 // Remove the setter message if RHS is null
71 Expr *RHS = ME->getArg(0);
73 RHS->isNullPointerConstant(Ctx,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| simple_ilist.h | 255 /// \pre \c this and \p RHS are sorted.
257 void merge(simple_ilist &RHS) { merge(RHS, std::less<T>()); }
258 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
270 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) {
271 if (this == &RHS || RHS.empty())
274 iterator RI = RHS.begin(), RE = RHS.end();
277 // Transfer a run of at least size 1 from RHS to LHS
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/MC/ |
| SubtargetFeature.h | 105 constexpr FeatureBitset &operator^=(const FeatureBitset &RHS) {
107 Bits[I] ^= RHS.Bits[I];
111 constexpr FeatureBitset operator^(const FeatureBitset &RHS) const {
113 Result ^= RHS;
117 constexpr FeatureBitset &operator&=(const FeatureBitset &RHS) {
119 Bits[I] &= RHS.Bits[I];
123 constexpr FeatureBitset operator&(const FeatureBitset &RHS) const {
125 Result &= RHS;
129 constexpr FeatureBitset &operator|=(const FeatureBitset &RHS) {
131 Bits[I] |= RHS.Bits[I]
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/ |
| GsymReader.cpp | 30 GsymReader::GsymReader(GsymReader &&RHS) = default;
|
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Interpreter/ |
| Interpreter.h | 44 AllocaHolder &operator=(AllocaHolder &&RHS) = default;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| TruncInstCombine.cpp | 361 Value *RHS = getReducedOperand(I->getOperand(1), SclTy);
362 Res = Builder.CreateBinOp((Instruction::BinaryOps)Opc, LHS, RHS);
368 Value *RHS = getReducedOperand(I->getOperand(2), SclTy);
369 Res = Builder.CreateSelect(Op0, LHS, RHS);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| PoisonChecking.cpp | 110 Value *RHS = I.getOperand(1);
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),
165 B.CreateICmp(ICmpInst::ICMP_NE, B.CreateSRem(LHS, RHS),
175 B.CreateICmp(ICmpInst::ICMP_UGE, RHS,
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SMTConstraintManager.h | 170 const llvm::APSInt *LHS, *RHS;
173 RHS = &SIE->getRHS();
176 RHS = getSymVal(State, ISE->getRHS());
180 RHS = LHS ? getSymVal(State, SSM->getRHS()) : nullptr;
185 if (!LHS || !RHS)
191 std::tie(ConvertedRHS, RTy) = SMTConv::fixAPSInt(Ctx, *RHS);
|
| SMTConv.h | 93 const llvm::SMTExprRef &RHS,
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/Lex/ |
| PreprocessingRecord.cpp | 188 SourceLocation RHS = getLoc(R);
189 return SM.isBeforeInTranslationUnit(LHS, RHS);
192 bool operator()(PreprocessedEntity *L, SourceLocation RHS) const {
194 return SM.isBeforeInTranslationUnit(LHS, RHS);
198 SourceLocation RHS = getLoc(R);
199 return SM.isBeforeInTranslationUnit(LHS, RHS);
|
| /src/external/apache2/llvm/dist/clang/lib/Rewrite/ |
| DeltaTree.cpp | 58 DeltaTreeNode *LHS, *RHS;
139 Children[1] = IR.RHS;
141 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
226 InsertRes->RHS->DoInsertion(FileIndex, Delta, nullptr /*can't fail*/);
245 IN->Children[i+1] = InsertRes->RHS;
258 DeltaTreeNode *SubRHS = InsertRes->RHS;
269 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->RHS);
304 // into the RHS child.
332 InsertRes.RHS = NewNode;
394 DeltaTree::DeltaTree(const DeltaTree &RHS) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 113 std::unique_ptr<ExprAST> LHS, RHS;
117 std::unique_ptr<ExprAST> RHS)
118 : Op(Op), LHS(std::move(LHS)), RHS(std::move(RHS)) {}
288 auto RHS = ParsePrimary();
289 if (!RHS)
292 // If BinOp binds less tightly with RHS than the operator after RHS, let
293 // the pending operator take RHS as its LHS.
296 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS))
[all...] |
