/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineMulDivRem.cpp | 601 Value *LHS = Op0, *RHS = Op1; local 604 std::swap(LHS, RHS); 608 B = LHS; 616 Value *LHS = Op0, *RHS = Op1; local 619 std::swap(LHS, RHS); 623 A = LHS; 729 if (Instruction *LHS = dyn_cast<Instruction>(Op0)) 730 if (Instruction::BinaryOps(LHS->getOpcode()) == I.getOpcode()) 731 if (ConstantInt *LHSRHS = dyn_cast<ConstantInt>(LHS->getOperand(1))) { 735 return BinaryOperator::Create(I.getOpcode(), LHS [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 446 // If we already inferred a value for this block on the LHS, don't 504 Value *LHS = PN->getIncomingValue(i); local 507 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, DL); 513 ResT = LVI->getPredicateOnEdge(Cmp->getPredicate(), LHS, 517 Res = ConstantInt::get(Type::getInt1Ty(LHS->getContext()), ResT); 552 // Try to find a constant value for the LHS of a comparison, 759 // For a comparison where the LHS is outside this block, it's possible 1229 // If either the LHS or RHS of the xor is a constant, don't do this 1241 // LHS or RHS of the xor in any predecessor is true/false, then we can clone 1304 // help us. However, we can just replace the LHS o [all...] |
H A D | Reassociate.cpp | 56 inline bool operator<(const ValueEntry &LHS, const ValueEntry &RHS) { argument 57 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start. 87 bool operator()(const Factor &LHS, const Factor &RHS) { argument 88 return LHS.Base < RHS.Base; 94 bool operator()(const Factor &LHS, const Factor &RHS) { argument 95 return LHS.Base == RHS.Base; 101 bool operator()(const Factor &LHS, const Factor &RHS) { argument 102 return LHS.Power > RHS.Power; 108 bool operator()(const Factor &LHS, const Factor &RHS) { argument 109 return LHS 146 operator ()(XorOpnd * const &LHS, XorOpnd * const &RHS) argument 349 IncorporateWeight(APInt &LHS, const APInt &RHS, unsigned Opcode) argument [all...] |
H A D | SampleProfile.cpp | 100 static inline bool isEqual(InstructionLocation LHS, InstructionLocation RHS) { argument 101 return LHS.LineOffset == RHS.LineOffset && 102 LHS.Discriminator == RHS.Discriminator;
|
/external/llvm/utils/TableGen/ |
H A D | AsmWriterEmitter.cpp | 756 bool operator()(const ValueType &LHS, const ValueType &RHS) { argument 757 if (LHS.second == RHS.second) { 760 return LHS.first->TheDef->getName() < RHS.first->TheDef->getName(); 764 return LHS.second > RHS.second; 957 IAPrinter *LHS = *II; local 962 if (LHS != RHS && *LHS == *RHS) { 968 if (!IsDup) UniqueIAPs.push_back(LHS);
|
H A D | SubtargetEmitter.cpp | 55 bool operator()(const MCWriteProcResEntry &LHS, argument 57 return LHS.ProcResourceIdx < RHS.ProcResourceIdx;
|
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDILPeepholeOptimizer.cpp | 497 Instruction *LHS = dyn_cast<Instruction>(inst->getOperand(0)); local 499 if (!setupBitInsert(LHS, LHSSrc, LHSMask, LHSShift)) { 503 if (LHS) { LHS->dump(); } 526 dbgs() << "LHS: "; if (LHS) { LHS->dump(); } else { dbgs() << "(None)\n"; } 527 dbgs() << "LHS Src: "; if (LHSSrc) { LHSSrc->dump(); } else { dbgs() << "(None)\n"; } 528 dbgs() << "LHS Mask: "; if (LHSMask) { LHSMask->dump(); } else { dbgs() << "(None)\n"; } 529 dbgs() << "LHS Shif 847 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 886 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 982 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 999 Value *LHS = CI->getOperand(CI->getNumOperands()-1); local [all...] |
/external/clang/include/clang/Basic/ |
H A D | SourceManager.h | 488 /// the specified LHS/RHS query. 491 bool isCacheValid(FileID LHS, FileID RHS) const { argument 492 return LQueryFID == LHS && RQueryFID == RHS; 496 /// specified offsets in the LHS/RHS FileID's. 515 void setQueryFIDs(FileID LHS, FileID RHS, bool isLFIDBeforeRFID) { argument 516 assert(LHS != RHS); 517 LQueryFID = LHS; 1200 /// \brief Return true if both \p LHS and \p RHS are in the local source 1204 /// offset of \p RHS relative to \p LHS. 1205 bool isInSameSLocAddrSpace(SourceLocation LHS, SourceLocatio argument 1439 isBeforeInSLocAddrSpace(SourceLocation LHS, SourceLocation RHS) const argument 1447 isBeforeInSLocAddrSpace(SourceLocation LHS, unsigned RHS) const argument [all...] |
/external/clang/include/clang/Sema/ |
H A D | ScopeInfo.h | 242 static bool isEqual(const WeakObjectProfileTy &LHS, argument 244 return LHS == RHS;
|
/external/clang/lib/AST/ |
H A D | DeclObjC.cpp | 1227 bool operator<(const SynthesizeIvarChunk & LHS, argument 1229 return LHS.Size < RHS.Size; 1365 // also allowed assigning a protocol-qualified 'id' type to a LHS object 1366 // when protocol in qualified LHS is in list of protocols in the rhs 'id'
|
/external/clang/lib/Basic/ |
H A D | SourceManager.cpp | 2027 /// \returns true if LHS source location comes before RHS, false otherwise. 2028 bool SourceManager::isBeforeInTranslationUnit(SourceLocation LHS, argument 2030 assert(LHS.isValid() && RHS.isValid() && "Passed invalid source location!"); 2031 if (LHS == RHS) 2034 std::pair<FileID, unsigned> LOffs = getDecomposedLoc(LHS);
|
H A D | VirtualFileSystem.cpp | 349 static bool isEqual(StringRef LHS, StringRef RHS) { return LHS == RHS; } argument 1138 [](const YAMLVFSEntry &LHS, const YAMLVFSEntry &RHS) { 1139 return LHS.VPath < RHS.VPath;
|
/external/clang/lib/CodeGen/ |
H A D | CGExprAgg.cpp | 299 // If the result of the assignment is used, copy the LHS there also. 793 // about the LHS. 849 // If the LHS might be a __block variable, and the RHS can 859 // Now emit the LHS and copy into it. 860 LValue LHS = CGF.EmitCheckedLValue(E->getLHS(), CodeGenFunction::TCK_Store); local 862 // That copy is an atomic copy if the LHS is atomic. 863 if (LHS.getType()->isAtomicType()) { 864 CGF.EmitAtomicStore(Dest.asRValue(), LHS, /*isInit*/ false); 869 AggValueSlot::forLValue(LHS, AggValueSlot::IsDestructed, 876 LValue LHS local [all...] |
H A D | CGExprComplex.cpp | 214 ComplexPairTy LHS; member in struct:__anon17835::ComplexExprEmitter::BinOpInfo 529 if (Op.LHS.first->getType()->isFloatingPointTy()) { 530 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r"); 531 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i"); 533 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r"); 534 ResI = Builder.CreateAdd(Op.LHS.second, Op.RHS.second, "add.i"); 541 if (Op.LHS.first->getType()->isFloatingPointTy()) { 542 ResR = Builder.CreateFSub(Op.LHS.first, Op.RHS.first, "sub.r"); 543 ResI = Builder.CreateFSub(Op.LHS.second, Op.RHS.second, "sub.i"); 545 ResR = Builder.CreateSub(Op.LHS 657 LValue LHS = CGF.EmitLValue(E->getLHS()); local 716 LValue LHS = CGF.EmitLValue(E->getLHS()); local 762 ComplexPairTy LHS = Visit(E->getTrueExpr()); local [all...] |
H A D | CGExprConstant.cpp | 1151 llvm::Constant *LHS = EmitConstantExpr(LHSExpr, LHSExpr->getType(), CGF); local 1156 LHS = llvm::ConstantExpr::getPtrToInt(LHS, IntPtrTy); 1158 llvm::Constant *AddrLabelDiff = llvm::ConstantExpr::getSub(LHS, RHS);
|
H A D | CGStmt.cpp | 1092 llvm::APSInt LHS = S.getLHS()->EvaluateKnownConstInt(getContext()); local 1105 if (LHS.isSigned() ? RHS.slt(LHS) : RHS.ult(LHS)) 1108 llvm::APInt Range = RHS - LHS; 1124 SwitchInsn->addCase(Builder.getInt(LHS), CaseDest); 1125 LHS++; 1145 Builder.CreateSub(SwitchInsn->getCondition(), Builder.getInt(LHS));
|
H A D | CodeGenModule.h | 403 bool operator()(const GlobalInitData &LHS, argument 405 return LHS.first.priority < RHS.first.priority;
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 146 ExprAST *LHS, *RHS; member in class:__anon25455::BinaryExprAST 149 : Op(op), LHS(lhs), RHS(rhs) {} 471 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 479 return LHS; 490 // the pending operator take RHS as its LHS. 497 // Merge LHS/RHS. 498 LHS = new BinaryExprAST(BinOp, LHS, RHS); 506 ExprAST *LHS = ParseUnary(); local 507 if (!LHS) retur [all...] |
/external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
H A D | toy-jit.cpp | 164 ExprAST *LHS, *RHS; member in class:BinaryExprAST 167 : Op(op), LHS(lhs), RHS(rhs) {} 488 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 496 return LHS; 507 // the pending operator take RHS as its LHS. 514 // Merge LHS/RHS. 515 LHS = new BinaryExprAST(BinOp, LHS, RHS); 523 ExprAST *LHS = ParseUnary(); local 524 if (!LHS) retur [all...] |
H A D | toy.cpp | 170 ExprAST *LHS, *RHS; member in class:BinaryExprAST 173 : Op(op), LHS(lhs), RHS(rhs) {} 494 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 502 return LHS; 513 // the pending operator take RHS as its LHS. 520 // Merge LHS/RHS. 521 LHS = new BinaryExprAST(BinOp, LHS, RHS); 529 ExprAST *LHS = ParseUnary(); local 530 if (!LHS) retur [all...] |
/external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
H A D | toy.cpp | 194 ExprAST *LHS, *RHS; member in class:BinaryExprAST 197 : Op(op), LHS(lhs), RHS(rhs) {} 518 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 526 return LHS; 537 // the pending operator take RHS as its LHS. 544 // Merge LHS/RHS. 545 LHS = new BinaryExprAST(BinOp, LHS, RHS); 553 ExprAST *LHS = ParseUnary(); local 554 if (!LHS) retur [all...] |
/external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
H A D | toy.cpp | 147 ExprAST *LHS, *RHS; member in class:BinaryExprAST 150 : Op(op), LHS(lhs), RHS(rhs) {} 471 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 479 return LHS; 490 // the pending operator take RHS as its LHS. 497 // Merge LHS/RHS. 498 LHS = new BinaryExprAST(BinOp, LHS, RHS); 506 ExprAST *LHS = ParseUnary(); local 507 if (!LHS) retur [all...] |
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
H A D | toy-jit.cpp | 149 ExprAST *LHS, *RHS; member in class:BinaryExprAST 152 : Op(op), LHS(lhs), RHS(rhs) {} 473 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 481 return LHS; 492 // the pending operator take RHS as its LHS. 499 // Merge LHS/RHS. 500 LHS = new BinaryExprAST(BinOp, LHS, RHS); 508 ExprAST *LHS = ParseUnary(); local 509 if (!LHS) retur [all...] |
H A D | toy.cpp | 149 ExprAST *LHS, *RHS; member in class:BinaryExprAST 152 : Op(op), LHS(lhs), RHS(rhs) {} 473 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 481 return LHS; 492 // the pending operator take RHS as its LHS. 499 // Merge LHS/RHS. 500 LHS = new BinaryExprAST(BinOp, LHS, RHS); 508 ExprAST *LHS = ParseUnary(); local 509 if (!LHS) retur [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableSet.h | 896 static inline bool isEqual(key_type_ref LHS, key_type_ref RHS) { argument 897 return std::equal_to<key_type>()(LHS,RHS); 900 static inline bool isLess(key_type_ref LHS, key_type_ref RHS) { argument 901 return std::less<key_type>()(LHS,RHS); 922 static inline bool isEqual(key_type_ref LHS, key_type_ref RHS) { argument 923 return LHS == RHS; 926 static inline bool isLess(key_type_ref LHS, key_type_ref RHS) { argument 927 return LHS < RHS;
|