Searched refs:LHS (Results 51 - 75 of 555) sorted by relevance

1234567891011>>

/external/llvm/lib/Analysis/
H A DLoopUnrollAnalyzer.cpp71 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local
72 if (!isa<Constant>(LHS))
73 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS))
74 LHS = SimpleLHS;
83 SimplifyFPBinOp(I.getOpcode(), LHS, RHS, FI->getFastMathFlags(), DL);
85 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL);
163 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local
166 if (!isa<Constant>(LHS))
167 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS))
168 LHS
[all...]
H A DInstructionSimplify.cpp90 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"?
91 static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, argument
98 if (CPred == Pred && CLHS == LHS && CRHS == RHS)
101 CRHS == LHS;
137 /// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS.
140 static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS, argument
149 if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS))
157 // If "L op' R" equals "A op' B" then "L op' R" is just the LHS.
161 return LHS;
175 Value *A = LHS, *
199 SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
298 ThreadBinOpOverSelect(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
369 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
451 ThreadBinOpOverPHI(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
493 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
644 computePointerDifference(const DataLayout &DL, Value *LHS, Value *RHS) argument
1929 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument
1975 computePointerICmp(const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, CmpInst::Predicate Pred, const Instruction *CxtI, Value *LHS, Value *RHS) argument
2155 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
3151 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument
3162 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const Query &Q, unsigned MaxRecurse) argument
3283 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument
3761 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
3827 SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const Query &Q, unsigned MaxRecurse) argument
3842 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument
3850 SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument
3860 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument
3867 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument
3972 Value *LHS = *ArgBegin; local
[all...]
H A DAliasAnalysisSummary.h184 static bool isEqual(const cflaa::InstantiatedValue &LHS, argument
186 return LHS.Val == RHS.Val && LHS.DerefLevel == RHS.DerefLevel;
/external/llvm/lib/Target/WebAssembly/
H A DWebAssemblyRegColoring.cpp119 [MRI](LiveInterval *LHS, LiveInterval *RHS) {
120 if (MRI->isLiveIn(LHS->reg) != MRI->isLiveIn(RHS->reg))
121 return MRI->isLiveIn(LHS->reg);
122 if (LHS->weight != RHS->weight)
123 return LHS->weight > RHS->weight;
124 if (LHS->empty() || RHS->empty())
125 return !LHS->empty() && RHS->empty();
126 return *LHS < *RHS;
/external/llvm/utils/TableGen/
H A DDAGISelEmitter.cpp75 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
82 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument
83 const TreePatternNode *LHSSrc = LHS->getSrcPattern();
97 int LHSSize = LHS->getPatternComplexity(CGP);
99 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
103 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
108 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);
115 assert(LHS == RHS || LHS->ID != RHS->ID);
116 return LHS
[all...]
/external/swiftshader/third_party/LLVM/utils/TableGen/
H A DDAGISelEmitter.cpp61 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
68 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument
69 const TreePatternNode *LHSSrc = LHS->getSrcPattern();
85 unsigned LHSSize = LHS->getPatternComplexity(CGP);
87 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
91 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
96 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);
103 assert(LHS == RHS || LHS->ID != RHS->ID);
104 return LHS
[all...]
/external/libcxx/test/std/utilities/any/any.class/any.assign/
H A Dvalue.pass.cpp29 template <class LHS, class RHS>
31 assert(LHS::count == 0);
33 LHS::reset();
36 any lhs(LHS(1));
39 assert(LHS::count == 1);
46 assert(LHS::count == 0);
52 assert(LHS::count == 0);
54 LHS::reset();
57 any lhs(LHS(1));
60 assert(LHS
[all...]
/external/llvm/lib/Transforms/Utils/
H A DCmpInstAnalysis.cpp72 Value *llvm::getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument
77 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
85 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 1);
/external/clang/lib/CodeGen/
H A DCGExprComplex.cpp221 ComplexPairTy LHS; member in struct:__anon1213::ComplexExprEmitter::BinOpInfo
538 if (Op.LHS.first->getType()->isFloatingPointTy()) {
539 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r");
540 if (Op.LHS.second && Op.RHS.second)
541 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i");
543 ResI = Op.LHS.second ? Op.LHS.second : Op.RHS.second;
546 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r");
547 assert(Op.LHS.second && Op.RHS.second &&
549 ResI = Builder.CreateAdd(Op.LHS
853 LValue LHS = CGF.EmitLValue(E->getLHS()); local
922 LValue LHS = CGF.EmitLValue(E->getLHS()); local
969 ComplexPairTy LHS = Visit(E->getTrueExpr()); local
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/
H A DInstCombineAndOrXor.cpp141 static Value *getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument
147 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
155 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 1);
157 return Builder->CreateICmp(Pred, LHS, RHS);
164 Value *LHS, Value *RHS,
177 if (!isordered) return ConstantInt::getTrue(LHS->getContext());
180 return Builder->CreateFCmp(Pred, LHS, RHS);
397 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
407 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS, argument
410 Instruction *LHSI = dyn_cast<Instruction>(LHS);
163 getFCmpValue(bool isordered, unsigned code, Value *LHS, Value *RHS, InstCombiner::BuilderTy *Builder) argument
565 foldLogOpOfMaskedICmpsHelper(Value*& A, Value*& B, Value*& C, Value*& D, Value*& E, ICmpInst *LHS, ICmpInst *RHS) argument
643 foldLogOpOfMaskedICmps(ICmpInst *LHS, ICmpInst *RHS, ICmpInst::Predicate NEWCC, llvm::InstCombiner::BuilderTy* Builder) argument
718 FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument
962 FoldAndOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument
1459 FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS) argument
1667 FoldOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS) argument
[all...]
H A DInstCombineAddSub.cpp61 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS))
64 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) { argument
69 // have one carry bit which can change a sign. As such, if LHS and RHS each
72 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1)
88 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local
90 if (Value *V = SimplifyAddInst(LHS, RHS, I.hasNoSignedWrap(),
102 return BinaryOperator::CreateXor(LHS, RHS);
110 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS))
115 if (match(LHS, m_Xo
326 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local
462 OptimizePointerDifference(Value *LHS, Value *RHS, Type *Ty) argument
[all...]
/external/compiler-rt/lib/ubsan/
H A Dubsan_handlers.h48 RECOVERABLE(add_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
51 RECOVERABLE(sub_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
54 RECOVERABLE(mul_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
61 ValueHandle LHS, ValueHandle RHS)
70 /// the LHS is negative or overflows.
72 ValueHandle LHS, ValueHandle RHS)
/external/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h51 Value *SimplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
60 Value *SimplifySubInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
69 Value *SimplifyFAddInst(Value *LHS, Value *RHS, FastMathFlags FMF,
78 Value *SimplifyFSubInst(Value *LHS, Value *RHS, FastMathFlags FMF,
87 Value *SimplifyFMulInst(Value *LHS, Value *RHS, FastMathFlags FMF,
96 Value *SimplifyMulInst(Value *LHS, Value *RHS, const DataLayout &DL,
104 Value *SimplifySDivInst(Value *LHS, Value *RHS, const DataLayout &DL,
112 Value *SimplifyUDivInst(Value *LHS, Value *RHS, const DataLayout &DL,
120 Value *SimplifyFDivInst(Value *LHS, Value *RHS, FastMathFlags FMF,
129 Value *SimplifySRemInst(Value *LHS, Valu
[all...]
/external/clang/lib/Tooling/Core/
H A DReplacement.cpp83 bool operator<(const Replacement &LHS, const Replacement &RHS) { argument
84 if (LHS.getOffset() != RHS.getOffset())
85 return LHS.getOffset() < RHS.getOffset();
90 if (LHS.getLength() != RHS.getLength())
91 return LHS.getLength() > RHS.getLength();
93 if (LHS.getFilePath() != RHS.getFilePath())
94 return LHS.getFilePath() < RHS.getFilePath();
95 return LHS.getReplacementText() < RHS.getReplacementText();
98 bool operator==(const Replacement &LHS, const Replacement &RHS) { argument
99 return LHS
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
H A DTriple.h244 unsigned LHS[3]; local
245 getOSVersion(LHS[0], LHS[1], LHS[2]);
247 if (LHS[0] != Major)
248 return LHS[0] < Major;
249 if (LHS[1] != Minor)
250 return LHS[1] < Minor;
251 if (LHS[2] != Micro)
252 return LHS[
[all...]
H A DStringRef.h366 /// If \arg Separator is in the string, then the result is a pair (LHS, RHS)
367 /// such that (*this == LHS + Separator + RHS) is true and RHS is
369 /// pair (LHS, RHS) where (*this == LHS) and (RHS == "").
383 /// If \arg Separator is in the string, then the result is a pair (LHS, RHS)
384 /// such that (*this == LHS + Separator + RHS) is true and RHS is
386 /// pair (LHS, RHS) where (*this == LHS) and (RHS == "").
419 /// If \arg Separator is in the string, then the result is a pair (LHS, RHS)
420 /// such that (*this == LHS
[all...]
/external/clang/include/clang/Basic/
H A DSourceLocation.h180 inline bool operator==(const SourceLocation &LHS, const SourceLocation &RHS) { argument
181 return LHS.getRawEncoding() == RHS.getRawEncoding();
184 inline bool operator!=(const SourceLocation &LHS, const SourceLocation &RHS) { argument
185 return !(LHS == RHS);
188 inline bool operator<(const SourceLocation &LHS, const SourceLocation &RHS) { argument
189 return LHS.getRawEncoding() < RHS.getRawEncoding();
337 operator==(const FullSourceLoc &LHS, const FullSourceLoc &RHS) { argument
338 return LHS.getRawEncoding() == RHS.getRawEncoding() &&
339 LHS.SrcMgr == RHS.SrcMgr;
343 operator!=(const FullSourceLoc &LHS, cons argument
413 isEqual(clang::FileID LHS, clang::FileID RHS) argument
[all...]
H A DDiagnosticOptions.h44 inline DiagnosticLevelMask operator|(DiagnosticLevelMask LHS, argument
48 static_cast<UT>(LHS) | static_cast<UT>(RHS));
51 inline DiagnosticLevelMask operator&(DiagnosticLevelMask LHS, argument
55 static_cast<UT>(LHS) & static_cast<UT>(RHS));
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DInstructionSimplify.cpp93 /// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS.
96 static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS, argument
105 if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS))
113 // If "L op' R" equals "A op' B" then "L op' R" is just the LHS.
117 return LHS;
132 Value *A = LHS, *B = Op1->getOperand(0), *C = Op1->getOperand(1);
155 /// FactorizeBinOp - Simplify "LHS Opcode RHS" by factorizing out a common term
159 static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS, argument
167 BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS);
187 // If V equals B then "A op' V" is just the LHS
229 SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
330 ThreadBinOpOverSelect(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
404 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
460 ThreadBinOpOverPHI(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
504 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
1402 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument
1421 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
2108 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT) argument
2115 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
2203 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT) argument
2342 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
2399 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT) argument
2406 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT, unsigned MaxRecurse) argument
2414 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const DominatorTree *DT) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/MC/
H A DMCExpr.cpp86 // Only print parens around the LHS if it is non-trivial.
125 // Only print parens around the LHS if it is non-trivial.
145 const MCBinaryExpr *MCBinaryExpr::Create(Opcode Opc, const MCExpr *LHS, argument
147 return new (Ctx) MCBinaryExpr(Opc, LHS, RHS);
349 /// from two MCValue's LHS and RHS where
350 /// Result = LHS + RHS
368 const MCValue &LHS,const MCSymbolRefExpr *RHS_A,
373 const MCSymbolRefExpr *LHS_A = LHS.getSymA();
374 const MCSymbolRefExpr *LHS_B = LHS.getSymB();
375 int64_t LHS_Cst = LHS
364 EvaluateSymbolicAdd(const MCAssembler *Asm, const MCAsmLayout *Layout, const SectionAddrMap *Addrs, bool InSet, const MCValue &LHS,const MCSymbolRefExpr *RHS_A, const MCSymbolRefExpr *RHS_B, int64_t RHS_Cst, MCValue &Res) argument
532 int64_t LHS = LHSValue.getConstant(), RHS = RHSValue.getConstant(); local
[all...]
/external/llvm/utils/PerfectShuffle/
H A DPerfectShuffle.cpp56 /// isOnlyLHSMask - Return true if this mask only refers to its LHS, not
62 /// getLHSOnlyMask - Given a mask that refers to its LHS and RHS, modify it to
63 /// refer to the LHS only (for when one argument value is passed into the same
67 return Mask & 0xBBBB; // Keep only LHS and Undefs.
149 return "LHS";
220 // Seed the table with accesses to the LHS and RHS.
294 for (unsigned LHS = 0; LHS != 0x8889; ++LHS) {
295 if (!isValidMask(LHS)) continu
[all...]
/external/swiftshader/third_party/LLVM/utils/PerfectShuffle/
H A DPerfectShuffle.cpp56 /// isOnlyLHSMask - Return true if this mask only refers to its LHS, not
62 /// getLHSOnlyMask - Given a mask that refers to its LHS and RHS, modify it to
63 /// refer to the LHS only (for when one argument value is passed into the same
67 return Mask & 0xBBBB; // Keep only LHS and Undefs.
149 return "LHS";
220 // Seed the table with accesses to the LHS and RHS.
294 for (unsigned LHS = 0; LHS != 0x8889; ++LHS) {
295 if (!isValidMask(LHS)) continu
[all...]
/external/swiftshader/third_party/LLVM/lib/DebugInfo/
H A DDWARFContext.cpp119 bool operator()(const DWARFCompileUnit &LHS, argument
121 return LHS.getOffset() < RHS.getOffset();
123 bool operator()(const DWARFCompileUnit &LHS, uint32_t RHS) const { argument
124 return LHS.getOffset() < RHS;
126 bool operator()(uint32_t LHS, const DWARFCompileUnit &RHS) const { argument
127 return LHS < RHS.getOffset();
/external/clang/lib/Parse/
H A DParseExpr.cpp39 /// production. C99 specifies that the LHS of an assignment operator should be
42 /// LHS of an assignment has to be an l-value, which productions between
44 /// consistency, we parse the LHS as a conditional-expression, then check for
121 ExprResult LHS(ParseAssignmentExpression(isTypeCast));
122 return ParseRHSOfBinaryExpression(LHS, prec::Comma);
132 ExprResult LHS(ParseObjCAtExpression(AtLoc));
133 return ParseRHSOfBinaryExpression(LHS, prec::Comma);
141 ExprResult LHS(true);
146 LHS = ParseCastExpression(false);
149 if (!LHS
249 ParseRHSOfBinaryExpression(ExprResult LHS, prec::Level MinPrec) argument
1404 ParsePostfixExpressionSuffix(ExprResult LHS) argument
2588 ParseFoldExpression(ExprResult LHS, BalancedDelimiterTracker &T) argument
[all...]
/external/clang/include/clang/AST/
H A DGlobalDecl.h74 friend bool operator==(const GlobalDecl &LHS, const GlobalDecl &RHS) { argument
75 return LHS.Value == RHS.Value;
112 static bool isEqual(clang::GlobalDecl LHS, argument
114 return LHS == RHS;

Completed in 858 milliseconds

1234567891011>>