| /external/clang/test/SemaCXX/ |
| warn-self-assign.cpp | 21 #define LHS a
26 LHS = a;
28 LHS OP RHS;
30 #undef LHS
|
| /external/llvm/lib/MC/MCDisassembler/ |
| MCExternalSymbolizer.cpp | 118 const MCExpr *LHS;
120 LHS = MCBinaryExpr::createSub(Add, Sub, Ctx);
122 LHS = MCUnaryExpr::createMinus(Sub, Ctx);
124 Expr = MCBinaryExpr::createAdd(LHS, Off, Ctx);
126 Expr = LHS;
|
| /external/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);
|
| /external/llvm/lib/Target/AArch64/Disassembler/ |
| AArch64ExternalSymbolizer.cpp | 196 const MCExpr *LHS;
198 LHS = MCBinaryExpr::createSub(Add, Sub, Ctx);
200 LHS = MCUnaryExpr::createMinus(Sub, Ctx);
202 Expr = MCBinaryExpr::createAdd(LHS, Off, Ctx);
204 Expr = LHS;
|
| /external/llvm/unittests/Analysis/ |
| ValueTrackingTest.cpp | 54 Value *LHS, *RHS;
56 SelectPatternResult R = matchSelectPattern(A, LHS, RHS, &CastOp);
|
| /external/llvm/lib/Target/X86/MCTargetDesc/ |
| X86MachORelocationInfo.cpp | 90 const MCExpr *LHS = MCSymbolRefExpr::create(Sym, Ctx);
104 Expr = MCBinaryExpr::createSub(LHS, RHS, Ctx);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 56 LExpr *LHS, *RHS;
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
62 const LExpr *left() const { return LHS; }
63 LExpr *left() { return LHS; }
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {
[all...] |
| /external/llvm/lib/Analysis/ |
| PHITransAddr.cpp | 257 // PHI translate the LHS.
262 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
263 if (!LHS) return nullptr;
265 // If the PHI translated LHS is an add of a constant, fold the immediates.
266 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS))
269 LHS = BOp->getOperand(0);
273 // If the old 'LHS' was an input, add the new 'LHS' as an input.
277 AddAsInput(LHS);
282 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, DL, TLI, DT, AC))
[all...] |
| /external/clang/lib/Lex/ |
| PreprocessingRecord.cpp | 177 SourceLocation LHS = getLoc(L);
179 return SM.isBeforeInTranslationUnit(LHS, RHS);
183 SourceLocation LHS = getLoc(L);
184 return SM.isBeforeInTranslationUnit(LHS, RHS);
187 bool operator()(SourceLocation LHS, PreprocessedEntity *R) const {
189 return SM.isBeforeInTranslationUnit(LHS, RHS);
|
| /external/clang/lib/Rewrite/ |
| DeltaTree.cpp | 56 DeltaTreeNode *LHS, *RHS;
134 Children[0] = IR.LHS;
137 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
219 InsertRes->LHS->DoInsertion(FileIndex, Delta, nullptr /*can't fail*/);
239 IN->Children[i] = InsertRes->LHS;
252 IN->Children[i] = InsertRes->LHS;
262 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->LHS);
297 // the first 'WidthFactor-1' values to the LHS child (which we leave in this
326 InsertRes.LHS = this;
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| IdenticalExprChecker.cpp | 82 const Expr *LHS = B->getLHS();
89 while (const BinaryOperator *B2 = dyn_cast<BinaryOperator>(LHS)) {
97 LHS = B2->getLHS();
100 if (isIdenticalStmt(AC->getASTContext(), RHS, LHS)) {
102 Sr[1] = LHS->getSourceRange();
223 const Expr *LHS = B->getLHS()->IgnoreParenImpCasts();
226 const DeclRefExpr *DeclRef1 = dyn_cast<DeclRefExpr>(LHS);
228 const FloatingLiteral *FloatLit1 = dyn_cast<FloatingLiteral>(LHS);
245 } else if (LHS->getType()->hasFloatingRepresentation()) {
248 // Here only LHS is checked since RHS will be implicit casted to float
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 121 std::unique_ptr<ExprAST> LHS, RHS;
124 BinaryExprAST(char Op, std::unique_ptr<ExprAST> LHS,
126 : Op(Op), LHS(std::move(LHS)), RHS(std::move(RHS)) {}
278 std::unique_ptr<ExprAST> LHS) {
286 return LHS;
298 // the pending operator take RHS as its LHS.
306 // Merge LHS/RHS.
307 LHS = helper::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
[all...] |
| /external/llvm/include/llvm/ADT/ |
| Twine.h | 152 /// LHS - The prefix in the concatenation, which may be uninitialized for
154 Child LHS;
171 explicit Twine(const Twine &LHS, const Twine &RHS)
173 this->LHS.twine = &LHS;
179 explicit Twine(Child LHS, NodeKind LHSKind, Child RHS, NodeKind RHSKind)
180 : LHS(LHS), RHS(RHS), LHSKind(LHSKind), RHSKind(RHSKind) {
224 // The RHS cannot be non-empty if the LHS is empty.
230 !LHS.twine->isBinary()
[all...] |
| /external/llvm/lib/CodeGen/ |
| IntrinsicLowering.cpp | 282 Value *LHS = Builder.CreateAnd(PartValue, MaskCst, "cppop.and1");
287 PartValue = Builder.CreateAdd(LHS, RHS, "ctpop.step");
|
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 75 // Only print parens around the LHS if it is non-trivial.
116 // Only print parens around the LHS if it is non-trivial.
140 const MCBinaryExpr *MCBinaryExpr::create(Opcode Opc, const MCExpr *LHS,
142 return new (Ctx) MCBinaryExpr(Opc, LHS, RHS);
532 /// from two MCValue's LHS and RHS where
533 /// Result = LHS + RHS
549 const SectionAddrMap *Addrs, bool InSet, const MCValue &LHS,
554 const MCSymbolRefExpr *LHS_A = LHS.getSymA();
555 const MCSymbolRefExpr *LHS_B = LHS.getSymB();
556 int64_t LHS_Cst = LHS.getConstant()
[all...] |
| /external/llvm/lib/ProfileData/ |
| CoverageMapping.cpp | 53 extractTerms(E.LHS, Sign, Terms);
72 [](const std::pair<unsigned, int> &LHS,
74 return LHS.first < RHS.first;
114 Counter CounterExpressionBuilder::add(Counter LHS, Counter RHS) {
115 return simplify(get(CounterExpression(CounterExpression::Add, LHS, RHS)));
118 Counter CounterExpressionBuilder::subtract(Counter LHS, Counter RHS) {
120 get(CounterExpression(CounterExpression::Subtract, LHS, RHS)));
137 dump(E.LHS, OS);
164 ErrorOr<int64_t> LHS = evaluate(E.LHS);
[all...] |
| /external/llvm/lib/Target/Mips/ |
| Mips16ISelDAGToDAG.cpp | 278 SDValue LHS = Node->getOperand(0);
281 EVT VT = LHS.getValueType();
289 SDNode *Result = CurDAG->SelectNodeTo(Node, MOp, VT, MVT::Glue, LHS,
|
| /external/llvm/lib/Transforms/Scalar/ |
| NaryReassociate.cpp | 142 // Given GEP's I-th index = LHS + RHS, see whether &Base[..][LHS][..] or
145 unsigned I, Value *LHS,
151 // A helper function for tryReassociateBinaryOp. LHS and RHS are explicitly
153 Instruction *tryReassociateBinaryOp(Value *LHS, Value *RHS,
155 // Rewrites I to (LHS op RHS) if LHS is computed already.
156 Instruction *tryReassociatedBinaryOp(const SCEV *LHS, Value *RHS,
162 // Gets SCEV for (LHS op RHS).
163 const SCEV *getBinarySCEV(BinaryOperator *I, const SCEV *LHS,
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 217 // We could not find an existing value to replace either LHS or RHS.
379 const SCEV *LHS = SE->getSCEV(BO->getOperand(0));
387 SE->getZeroExtendExpr(LHS, WideTy), SE->getZeroExtendExpr(RHS, WideTy),
399 SE->getSignExtendExpr(LHS, WideTy), SE->getSignExtendExpr(RHS, WideTy),
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| R600ISelLowering.cpp | 336 SDValue LHS = Op.getOperand(2);
345 LHS, RHS,
392 SDValue LHS = Op.getOperand(0);
400 // LHS and RHS are guaranteed to be the same value type
401 EVT CompareVT = LHS.getValueType();
404 // necessary we need to convert LHS and RHS to be the same type True and
422 // XXX Check the value of LHS and RHS and avoid creating sequences like
424 LHS = DAG.getNode(ConversionOp, DL, VT, LHS);
431 return DAG.getNode(ISD::SELECT_CC, DL, VT, LHS, RHS, True, False, CC)
[all...] |
| SIISelLowering.cpp | 312 SDValue LHS = Op.getOperand(2);
321 LHS, RHS,
376 SDValue LHS = Op.getOperand(0);
384 SDValue Cond = DAG.getNode(ISD::SETCC, DL, MVT::i1, LHS, RHS, CC);
|
| /frameworks/native/include/private/ui/ |
| RegionHelper.h | 40 static const uint32_t LHS = 0x5; // 0b101
43 op_nand = LHS & ~RHS,
44 op_and = LHS & RHS,
45 op_or = LHS | RHS,
46 op_xor = LHS ^ RHS
69 inline region_operator(int op, const region& lhs, const region& rhs)
70 : op_mask(op), spanner(lhs, rhs)
77 SpannerInner spannerInner(spanner.lhs, spanner.rhs);
161 region lhs; member in class:android::region_operator::Spanner
165 inline Spanner(const region& lhs, const region& rhs
222 region lhs; member in class:android::region_operator::SpannerInner
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter3/ |
| toy.cpp | 118 std::unique_ptr<ExprAST> LHS, RHS;
121 BinaryExprAST(char Op, std::unique_ptr<ExprAST> LHS,
123 : Op(Op), LHS(std::move(LHS)), RHS(std::move(RHS)) {}
281 std::unique_ptr<ExprAST> LHS) {
289 return LHS;
301 // the pending operator take RHS as its LHS.
309 // Merge LHS/RHS.
310 LHS =
311 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS))
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| toy.cpp | 124 std::unique_ptr<ExprAST> LHS, RHS;
127 BinaryExprAST(char Op, std::unique_ptr<ExprAST> LHS,
129 : Op(Op), LHS(std::move(LHS)), RHS(std::move(RHS)) {}
287 std::unique_ptr<ExprAST> LHS) {
295 return LHS;
307 // the pending operator take RHS as its LHS.
315 // Merge LHS/RHS.
316 LHS =
317 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS))
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCExpr.h | 437 const MCExpr *LHS, *RHS;
439 MCBinaryExpr(Opcode Op, const MCExpr *LHS, const MCExpr *RHS)
440 : MCExpr(MCExpr::Binary), Op(Op), LHS(LHS), RHS(RHS) {}
446 static const MCBinaryExpr *create(Opcode Op, const MCExpr *LHS,
448 static const MCBinaryExpr *createAdd(const MCExpr *LHS, const MCExpr *RHS,
450 return create(Add, LHS, RHS, Ctx);
452 static const MCBinaryExpr *createAnd(const MCExpr *LHS, const MCExpr *RHS,
454 return create(And, LHS, RHS, Ctx);
456 static const MCBinaryExpr *createDiv(const MCExpr *LHS, const MCExpr *RHS
[all...] |
