/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineCalls.cpp | 320 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 332 ComputeMaskedBits(RHS, RHSKnownZero, RHSKnownOne); 338 Value *Add = Builder->CreateAdd(LHS, RHS); 352 Value *Add = Builder->CreateNUWAdd(LHS, RHS); 366 // Canonicalize constants into the RHS. 379 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) { 381 if (RHS->isZero()) { 400 if (ConstantInt *RHS = dyn_cast<ConstantInt>(II->getArgOperand(1))) { 402 if (RHS->isZero()) { 414 Value *LHS = II->getArgOperand(0), *RHS local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 480 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB); local 482 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, TD); 484 if (!isa<Constant>(RHS)) 489 cast<Constant>(RHS), PredBB, BB); 1195 // If either the LHS or RHS of the xor is a constant, don't do this 1207 // LHS or RHS of the xor in any predecessor is true/false, then we can clone 1270 // help us. However, we can just replace the LHS or RHS with the constant.
|
/external/llvm/lib/Transforms/Utils/ |
H A D | PromoteMemoryToRegister.cpp | 73 static bool isEqual(const EltTy &LHS, const EltTy &RHS) { argument 74 return LHS == RHS; 141 void swap(RenamePassData &RHS) { argument 142 std::swap(BB, RHS.BB); 143 std::swap(Pred, RHS.Pred); 144 Values.swap(RHS.Values); 355 bool operator()(const DomTreeNodePair &LHS, const DomTreeNodePair &RHS) { argument 356 return LHS.second < RHS.second; 901 const std::pair<unsigned, StoreInst*> &RHS) { 902 return LHS.first < RHS 900 operator ()(const std::pair<unsigned, StoreInst*> &LHS, const std::pair<unsigned, StoreInst*> &RHS) argument [all...] |
/external/llvm/lib/VMCore/ |
H A D | ConstantFold.cpp | 219 Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize); local 220 if (RHS == 0) 224 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) 231 return ConstantExpr::getOr(LHS, RHS); 234 Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize); local 235 if (RHS == 0) 239 if (RHS->isNullValue()) 240 return RHS; 245 return ConstantExpr::getAnd(LHS, RHS); 938 // Handle simplifications when the RHS i 1144 Constant *RHS = local [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGExprComplex.cpp | 211 ComplexPairTy RHS; member in struct:__anon45::ComplexExprEmitter::BinOpInfo 489 ResR = Builder.CreateFAdd(Op.LHS.first, Op.RHS.first, "add.r"); 490 ResI = Builder.CreateFAdd(Op.LHS.second, Op.RHS.second, "add.i"); 492 ResR = Builder.CreateAdd(Op.LHS.first, Op.RHS.first, "add.r"); 493 ResI = Builder.CreateAdd(Op.LHS.second, Op.RHS.second, "add.i"); 501 ResR = Builder.CreateFSub(Op.LHS.first, Op.RHS.first, "sub.r"); 502 ResI = Builder.CreateFSub(Op.LHS.second, Op.RHS.second, "sub.i"); 504 ResR = Builder.CreateSub(Op.LHS.first, Op.RHS.first, "sub.r"); 505 ResI = Builder.CreateSub(Op.LHS.second, Op.RHS.second, "sub.i"); 516 Value *ResRl = Builder.CreateFMul(Op.LHS.first, Op.RHS 717 ComplexPairTy RHS = Visit(E->getFalseExpr()); local [all...] |
/external/clang/lib/Parse/ |
H A D | ParseExpr.cpp | 297 // In particular, the RHS of the '?' is 'expression', not 352 // Parse another leaf here for the RHS of the operator. 353 // ParseCastExpression works here because all RHS expressions in C have it 359 // braced-init-list on the RHS of an assignment. For better diagnostics, 361 // they only appear on the RHS of assignments later. 362 ExprResult RHS; local 365 RHS = ParseBraceInitializer(); 368 RHS = ParseAssignmentExpression(); 370 RHS = ParseCastExpression(false); 372 if (RHS [all...] |
H A D | ParseStmt.cpp | 505 ExprResult RHS; local 510 RHS = ParseConstantExpression(); 511 if (RHS.isInvalid()) { 536 RHS.get(), ColonLoc);
|
/external/clang/lib/Sema/ |
H A D | SemaPseudoObject.cpp | 25 // [expr setProp: RHS] 184 Expr *LHS, Expr *RHS); 229 Expr *LHS, Expr *RHS); 265 Expr *LHS, Expr *RHS); 341 Expr *LHS, Expr *RHS) { 345 OpaqueValueExpr *capturedRHS = capture(RHS); 741 Expr *LHS, Expr *RHS) { 750 return S.BuildBinOp(Sc, opcLoc, opcode, result.take(), RHS); 757 << LHS->getSourceRange() << RHS->getSourceRange(); 766 << LHS->getSourceRange() << RHS 738 buildAssignmentOperation(Scope *Sc, SourceLocation opcLoc, BinaryOperatorKind opcode, Expr *LHS, Expr *RHS) argument 836 buildAssignmentOperation(Scope *Sc, SourceLocation opcLoc, BinaryOperatorKind opcode, Expr *LHS, Expr *RHS) argument 1329 checkPseudoObjectAssignment(Scope *S, SourceLocation opcLoc, BinaryOperatorKind opcode, Expr *LHS, Expr *RHS) argument [all...] |
/external/clang/include/clang/Basic/ |
H A D | SourceManager.h | 151 ContentCache(const ContentCache &RHS) argument 155 OrigEntry = RHS.OrigEntry; 156 ContentsEntry = RHS.ContentsEntry; 158 assert (RHS.Buffer.getPointer() == 0 && RHS.SourceLineCache == 0 && 161 NumLines = RHS.NumLines; 224 ContentCache &operator=(const ContentCache& RHS); 464 /// the specified LHS/RHS query. 467 bool isCacheValid(FileID LHS, FileID RHS) const { 468 return LQueryFID == LHS && RQueryFID == RHS; 491 setQueryFIDs(FileID LHS, FileID RHS, bool isLFIDBeforeRFID) argument 1107 isInSameSLocAddrSpace(SourceLocation LHS, SourceLocation RHS, int *RelativeOffset) const argument [all...] |
/external/clang/lib/AST/ |
H A D | VTableBuilder.cpp | 452 const CXXMethodDecl *RHS); 469 const CXXMethodDecl *RHS) { 473 cast<FunctionProtoType>(RHS->getType().getCanonicalType()); 491 const CXXMethodDecl *RHS) { 493 assert(RHS->isVirtual() && "LHS must be virtual!"); 497 return isa<CXXDestructorDecl>(RHS); 503 DeclarationName RHSName = RHS->getDeclName(); 508 return HasSameVirtualSignature(LHS, RHS); 468 HasSameVirtualSignature(const CXXMethodDecl *LHS, const CXXMethodDecl *RHS) argument 490 MethodsCanShareVCallOffset(const CXXMethodDecl *LHS, const CXXMethodDecl *RHS) argument
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 145 ExprAST *LHS, *RHS; member in class:BinaryExprAST 148 : Op(op), LHS(lhs), RHS(rhs) {} 484 ExprAST *RHS = ParseUnary(); local 485 if (!RHS) return 0; 487 // If BinOp binds less tightly with RHS than the operator after RHS, let 488 // the pending operator take RHS as its LHS. 491 RHS = ParseBinOpRHS(TokPrec+1, RHS); 492 if (RHS [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableSet.h | 131 bool isElementEqual(const ImutAVLTree* RHS) const { 132 return isElementEqual(RHS->getValue()); 138 bool isEqual(const ImutAVLTree& RHS) const { 139 if (&RHS == this) 143 iterator RItr = RHS.begin(), REnd = RHS.end(); 164 bool isNotEqual(const ImutAVLTree& RHS) const { return !isEqual(RHS); } 890 static inline bool isEqual(key_type_ref LHS, key_type_ref RHS) { argument 891 return std::equal_to<key_type>()(LHS,RHS); 894 isLess(key_type_ref LHS, key_type_ref RHS) argument 916 isEqual(key_type_ref LHS, key_type_ref RHS) argument 920 isLess(key_type_ref LHS, key_type_ref RHS) argument [all...] |
/external/llvm/include/llvm/TableGen/ |
H A D | Record.h | 81 virtual bool typeIsConvertibleTo(const RecTy *RHS) const = 0; 115 // all values of type 'RHS' can be converted to the 'this' type. 116 virtual bool baseClassOf(const BitRecTy *RHS) const { return false; } 117 virtual bool baseClassOf(const BitsRecTy *RHS) const { return false; } 118 virtual bool baseClassOf(const IntRecTy *RHS) const { return false; } 119 virtual bool baseClassOf(const StringRecTy *RHS) const { return false; } 120 virtual bool baseClassOf(const ListRecTy *RHS) const { return false; } 121 virtual bool baseClassOf(const DagRecTy *RHS) const { return false; } 122 virtual bool baseClassOf(const RecordRecTy *RHS) const { return false; } 157 bool typeIsConvertibleTo(const RecTy *RHS) cons 877 Init *LHS, *RHS; member in class:llvm::BinOpInit 926 Init *LHS, *MHS, *RHS; member in class:llvm::TernOpInit [all...] |
/external/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 78 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 80 Value *RHS) { 86 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 88 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS && 125 /// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS. 128 static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS, argument 140 Value *A = Op0->getOperand(0), *B = Op0->getOperand(1), *C = RHS; 160 if (BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS)) 168 // If "L op' R" equals "B op' C" then "L op' R" is just the RHS. 172 return RHS; 79 isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 189 FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS, unsigned OpcToExtract, const Query &Q, unsigned MaxRecurse) argument 259 SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 358 ThreadBinOpOverSelect(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 430 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 512 ThreadBinOpOverPHI(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 555 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 734 computePointerDifference(const TargetData &TD, Value *LHS, Value *RHS) argument 1577 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1594 computePointerICmp(const TargetData &TD, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 1636 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2401 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2411 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2498 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2677 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2732 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument 2740 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const Query &Q, unsigned MaxRecurse) argument 2747 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const TargetData *TD, const TargetLibraryInfo *TLI, const DominatorTree *DT) argument [all...] |
H A D | ScalarEvolution.cpp | 451 /// than the complexity of the RHS. This comparator is used to canonicalize 458 // Return true or false if LHS is less than, or at least RHS, respectively. 459 bool operator()(const SCEV *LHS, const SCEV *RHS) const { 460 return compare(LHS, RHS) < 0; 464 // greater than RHS, respectively. A three-way result allows recursive 466 int compare(const SCEV *LHS, const SCEV *RHS) const { 468 if (LHS == RHS) 472 unsigned LType = LHS->getSCEVType(), RType = RHS->getSCEVType(); 482 const SCEVUnknown *RU = cast<SCEVUnknown>(RHS); 534 const SCEVConstant *RC = cast<SCEVConstant>(RHS); 636 const SCEV *&LHS = Ops[0], *&RHS = Ops[1]; local [all...] |
H A D | ScalarEvolutionExpander.cpp | 153 Value *LHS, Value *RHS) { 156 if (Constant *CRHS = dyn_cast<Constant>(RHS)) 172 IP->getOperand(1) == RHS) 184 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break; 193 Instruction *BO = cast<Instruction>(Builder.CreateBinOp(Opcode, LHS, RHS)); 684 std::pair<const Loop *, const SCEV *> RHS) const { 687 RHS.second->getType()->isPointerTy()) 691 if (LHS.first != RHS.first) 692 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first; 698 if (!RHS 152 InsertBinop(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS) argument 828 const APInt &RHS = SC->getValue()->getValue(); local 834 Value *RHS = expandCodeFor(S->getRHS(), Ty); local 1440 Value *RHS = expandCodeFor(S->getOperand(i), Ty); local 1464 Value *RHS = expandCodeFor(S->getOperand(i), Ty); local [all...] |
/external/llvm/lib/Bitcode/Reader/ |
H A D | BitcodeReader.cpp | 1130 Constant *RHS = ValueList.getConstantFwdRef(Record[2], CurTy); local 1149 V = ConstantExpr::get(Opc, LHS, RHS, Flags); 2001 Value *LHS, *RHS; local 2003 getValue(Record, OpNum, LHS->getType(), RHS) || 2009 I = BinaryOperator::Create((Instruction::BinaryOps)Opc, LHS, RHS); 2200 Value *LHS, *RHS; local 2202 getValue(Record, OpNum, LHS->getType(), RHS) || 2207 I = new FCmpInst((FCmpInst::Predicate)Record[OpNum], LHS, RHS); 2209 I = new ICmpInst((ICmpInst::Predicate)Record[OpNum], LHS, RHS);
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | AsmPrinter.cpp | 1555 const MCExpr *RHS = lowerConstant(CE->getOperand(1), AP); local 1558 case Instruction::Add: return MCBinaryExpr::CreateAdd(LHS, RHS, Ctx); 1559 case Instruction::Sub: return MCBinaryExpr::CreateSub(LHS, RHS, Ctx); 1560 case Instruction::Mul: return MCBinaryExpr::CreateMul(LHS, RHS, Ctx); 1561 case Instruction::SDiv: return MCBinaryExpr::CreateDiv(LHS, RHS, Ctx); 1562 case Instruction::SRem: return MCBinaryExpr::CreateMod(LHS, RHS, Ctx); 1563 case Instruction::Shl: return MCBinaryExpr::CreateShl(LHS, RHS, Ctx); 1564 case Instruction::And: return MCBinaryExpr::CreateAnd(LHS, RHS, Ctx); 1565 case Instruction::Or: return MCBinaryExpr::CreateOr (LHS, RHS, Ctx); 1566 case Instruction::Xor: return MCBinaryExpr::CreateXor(LHS, RHS, Ct [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineScheduler.cpp | 1093 /// more desirable than RHS from scheduling standpoint. 1095 const RegPressureDelta &RHS) { 1101 if (LHS.Excess.UnitIncrease != RHS.Excess.UnitIncrease) 1102 return LHS.Excess.UnitIncrease < RHS.Excess.UnitIncrease; 1105 if (LHS.CriticalMax.UnitIncrease != RHS.CriticalMax.UnitIncrease) 1106 return LHS.CriticalMax.UnitIncrease < RHS.CriticalMax.UnitIncrease; 1109 if (LHS.CurrentMax.UnitIncrease != RHS.CurrentMax.UnitIncrease) 1110 return LHS.CurrentMax.UnitIncrease < RHS.CurrentMax.UnitIncrease; 1094 compareRPDelta(const RegPressureDelta &LHS, const RegPressureDelta &RHS) argument
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGISel.cpp | 1420 /// the dag combiner simplified the 255, we still want to match. RHS is the 1421 /// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1423 bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, argument 1425 const APInt &ActualMask = RHS->getAPIntValue(); 1449 /// the dag combiner simplified the 255, we still want to match. RHS is the 1450 /// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1452 bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, argument 1454 const APInt &ActualMask = RHS->getAPIntValue();
|
/external/llvm/lib/MC/ |
H A D | MCDwarf.cpp | 117 const MCExpr *RHS = local 120 MCBinaryExpr::Create(MCBinaryExpr::Sub, Res, RHS, MCOS.getContext()); 1370 const CIEKey &RHS) { 1371 return LHS.Personality == RHS.Personality && 1372 LHS.PersonalityEncoding == RHS.PersonalityEncoding && 1373 LHS.LsdaEncoding == RHS.LsdaEncoding && 1374 LHS.IsSignalFrame == RHS.IsSignalFrame; 1369 isEqual(const CIEKey &LHS, const CIEKey &RHS) argument
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 73 const TableGenStringKey& RHS) { 74 return LHS.str() == RHS.str(); 103 bool BitRecTy::baseClassOf(const BitsRecTy *RHS) const { 104 return RHS->getNumBits() == 1; 335 bool RecordRecTy::baseClassOf(const RecordRecTy *RHS) const { 336 if (Rec == RHS->getRecord() || RHS->getRecord()->isSubClassOf(Rec)) 341 if (RHS->getRecord()->isSubClassOf(SC[i])) 877 DagInit *RHSs = dynamic_cast<DagInit*>(RHS); 899 StringInit *RHSs = dynamic_cast<StringInit*>(RHS); 72 isEqual(const TableGenStringKey& LHS, const TableGenStringKey& RHS) argument 1041 ForeachHelper(Init *LHS, Init *MHS, Init *RHS, RecTy *Type, Record *CurRec, MultiClass *CurMultiClass) argument [all...] |
H A D | TGParser.cpp | 976 Init *RHS = InitList.pop_back_val(); local 977 RHS = (BinOpInit::get(Code, InitList.back(), RHS, Type)) 979 InitList.back() = RHS; 1035 Init *RHS = ParseValue(CurRec); local 1036 if (RHS == 0) return 0; 1057 if (TypedInit *RHSt = dynamic_cast<TypedInit*>(RHS)) 1059 if (BitsInit *RHSbits = dynamic_cast<BitsInit*>(RHS)) 1061 if (dynamic_cast<BitInit*>(RHS)) 1067 if (dynamic_cast<UnsetInit*>(RHS)) 1512 TypedInit *RHS = 0; local [all...] |
/external/llvm/lib/Target/ARM/ |
H A D | ARMConstantIslandPass.cpp | 844 const MachineBasicBlock *RHS) { 845 return LHS->getNumber() < RHS->getNumber(); 843 CompareMBBNumbers(const MachineBasicBlock *LHS, const MachineBasicBlock *RHS) argument
|
H A D | ARMISelDAGToDAG.cpp | 400 ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(N.getOperand(1)); local 401 if (!RHS) return false; 402 ShImmVal = RHS->getZExtValue() & 31; 424 ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(N.getOperand(1)); local 425 if (RHS) return false; 462 if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(N.getOperand(1))) { 463 int RHSC = (int)RHS->getZExtValue(); 490 if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(N.getOperand(1))) { 492 int RHSC = (int)RHS->getZExtValue(); 535 // Check to see if the RHS o 1067 ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(N.getOperand(1)); local [all...] |