/external/clang/tools/libclang/ |
H A D | CXComment.cpp | 365 bool operator()(const ParamCommandComment *LHS, argument 369 if (LHS->isParamIndexValid()) 370 LHSIndex = LHS->getParamIndex(); 384 bool operator()(const TParamCommandComment *LHS, argument 387 if (!LHS->isPositionValid()) 392 if (LHS->getDepth() > 1) 398 if (LHS->getDepth() == 1 && RHS->getDepth() == 1) 399 return LHS->getIndex(0) < RHS->getIndex(0);
|
H A D | IndexingContext.h | 544 static bool isEqual(clang::cxindex::RefFileOccurence LHS, argument 546 return LHS.File == RHS.File && LHS.Dcl == RHS.Dcl;
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
H A D | toy.cpp | 125 ExprAST *LHS, *RHS; member in class:BinaryExprAST 128 : Op(op), LHS(lhs), RHS(rhs) {} 360 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 368 return LHS; 379 // the pending operator take RHS as its LHS. 386 // Merge LHS/RHS. 387 LHS = new BinaryExprAST(BinOp, LHS, RHS); 395 ExprAST *LHS = ParsePrimary(); local 396 if (!LHS) retur [all...] |
/external/llvm/examples/Kaleidoscope/Chapter6/ |
H A D | toy.cpp | 140 ExprAST *LHS, *RHS; member in class:BinaryExprAST 143 : Op(op), LHS(lhs), RHS(rhs) {} 404 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) { argument 412 return LHS; 423 // the pending operator take RHS as its LHS. 430 // Merge LHS/RHS. 431 LHS = new BinaryExprAST(BinOp, LHS, RHS); 439 ExprAST *LHS = ParseUnary(); local 440 if (!LHS) retur [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ilist.h | 252 bool operator!=(const T* LHS, const ilist_iterator<const T> &RHS) { argument 253 return LHS != RHS.getNodePtrUnchecked(); 256 bool operator==(const T* LHS, const ilist_iterator<const T> &RHS) { argument 257 return LHS == RHS.getNodePtrUnchecked(); 260 bool operator!=(T* LHS, const ilist_iterator<T> &RHS) { argument 261 return LHS != RHS.getNodePtrUnchecked(); 264 bool operator==(T* LHS, const ilist_iterator<T> &RHS) { argument 265 return LHS == RHS.getNodePtrUnchecked();
|
/external/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAG.h | 611 SDValue getSetCC(DebugLoc DL, EVT VT, SDValue LHS, SDValue RHS, argument 613 assert(LHS.getValueType().isVector() == RHS.getValueType().isVector() && 615 assert(LHS.getValueType().isVector() == VT.isVector() && 617 return getNode(ISD::SETCC, DL, VT, LHS, RHS, getCondCode(Cond)); 623 SDValue getSelectCC(DebugLoc DL, SDValue LHS, SDValue RHS, argument 626 LHS, RHS, True, False, getCondCode(Cond));
|
/external/llvm/include/llvm/Support/ |
H A D | PatternMatch.h | 378 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} argument 393 template<typename LHS, typename RHS> 394 inline BinaryOp_match<LHS, RHS, Instruction::Add> 395 m_Add(const LHS &L, const RHS &R) { 396 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); 399 template<typename LHS, typename RHS> 400 inline BinaryOp_match<LHS, RHS, Instruction::FAdd> 401 m_FAdd(const LHS &L, const RHS &R) { 402 return BinaryOp_match<LHS, RH 509 BinOp2_match(const LHS_t &LHS, const RHS_t &RHS) argument 576 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 614 SelectClass_match(const Cond_t &Cond, const LHS_t &LHS, const RHS_t &RHS) argument 705 not_match(const LHS_t &LHS) argument 715 matchIfNot(Value *LHS, Value *RHS) argument 732 neg_match(const LHS_t &LHS) argument 742 matchIfNeg(Value *LHS, Value *RHS) argument 758 fneg_match(const LHS_t &LHS) argument 768 matchIfFNeg(Value *LHS, Value *RHS) argument 838 MaxMin_match(const LHS_t &LHS, const RHS_t &RHS) argument 854 Value *LHS = Cmp->getOperand(0); local [all...] |
/external/llvm/lib/Analysis/ |
H A D | ConstantFolding.cpp | 1063 Constant *LHS = local 1071 Constant *Ops[] = { LHS, RHS }; 1072 return ConstantFoldInstOperands(OpC, LHS->getType(), Ops, TD, TLI);
|
/external/llvm/lib/Analysis/IPA/ |
H A D | InlineCost.cpp | 494 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 496 if (!isa<Constant>(LHS)) 497 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS)) 498 LHS = SimpleLHS; 502 if (Constant *CLHS = dyn_cast<Constant>(LHS)) 513 llvm::tie(LHSBase, LHSOffset) = ConstantOffsetPtrs.lookup(LHS); 519 Constant *CLHS = ConstantInt::get(LHS->getContext(), LHSOffset); 560 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 563 llvm::tie(LHSBase, LHSOffset) = ConstantOffsetPtrs.lookup(LHS); 569 Constant *CLHS = ConstantInt::get(LHS 585 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeFloatTypes.cpp | 179 SDValue LHS = GetSoftenedFloat(N->getOperand(0)); local 183 EVT LVT = LHS.getValueType(); 214 LHS = DAG.getNode(ISD::AND, dl, LVT, LHS, Mask); 217 return DAG.getNode(ISD::OR, dl, LVT, LHS, SignBit); 527 SDValue LHS = GetSoftenedFloat(N->getOperand(1)); local 530 LHS.getValueType(), N->getOperand(0),LHS,RHS); 534 SDValue LHS = GetSoftenedFloat(N->getOperand(2)); local 537 LHS [all...] |
/external/llvm/lib/ExecutionEngine/ |
H A D | ExecutionEngine.cpp | 701 GenericValue LHS = getConstantValue(Op0); local 709 case Instruction::Add: GV.IntVal = LHS.IntVal + RHS.IntVal; break; 710 case Instruction::Sub: GV.IntVal = LHS.IntVal - RHS.IntVal; break; 711 case Instruction::Mul: GV.IntVal = LHS.IntVal * RHS.IntVal; break; 712 case Instruction::UDiv:GV.IntVal = LHS.IntVal.udiv(RHS.IntVal); break; 713 case Instruction::SDiv:GV.IntVal = LHS.IntVal.sdiv(RHS.IntVal); break; 714 case Instruction::URem:GV.IntVal = LHS.IntVal.urem(RHS.IntVal); break; 715 case Instruction::SRem:GV.IntVal = LHS.IntVal.srem(RHS.IntVal); break; 716 case Instruction::And: GV.IntVal = LHS.IntVal & RHS.IntVal; break; 717 case Instruction::Or: GV.IntVal = LHS [all...] |
/external/llvm/lib/IR/ |
H A D | ConstantFold.cpp | 232 Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize); 233 if (LHS == 0) 235 return ConstantExpr::getOr(LHS, RHS); 246 Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize); 247 if (LHS == 0) 249 return ConstantExpr::getAnd(LHS, RHS); 1140 Constant *LHS = local 1145 Result.push_back(ConstantExpr::get(Opcode, LHS, RHS)); 1303 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a 1421 // Ok, the LHS i [all...] |
H A D | ConstantsContext.h | 245 unsigned short pred, Constant* LHS, Constant* RHS) 247 Op<0>() = LHS; 673 static bool isEqual(const ConstantClass *LHS, const ConstantClass *RHS) { argument 674 return LHS == RHS; 680 static bool isEqual(const LookupKey &LHS, const ConstantClass *RHS) { argument 683 if (LHS.first != RHS->getType() 684 || LHS.second.size() != RHS->getNumOperands()) 687 if (LHS.second[I] != RHS->getOperand(I)) 244 CompareConstantExpr(Type *ty, Instruction::OtherOps opc, unsigned short pred, Constant* LHS, Constant* RHS) argument
|
H A D | LLVMContextImpl.h | 64 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) { argument 65 return LHS == RHS; 92 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) { argument 93 return LHS == RHS; 131 static bool isEqual(const KeyTy& LHS, const StructType *RHS) { argument 134 return LHS == KeyTy(RHS); 136 static bool isEqual(const StructType *LHS, const StructType *RHS) { argument 137 return LHS == RHS; 180 static bool isEqual(const KeyTy& LHS, const FunctionType *RHS) { argument 183 return LHS 185 isEqual(const FunctionType *LHS, const FunctionType *RHS) argument [all...] |
/external/llvm/lib/Support/ |
H A D | CommandLine.cpp | 199 StringRef &LHS = SplitArg.first; // LHS == Arg when no '=' is present. local 214 StringRef Flag = PermitValue ? LHS : Arg; 1187 static int OptNameCompare(const void *LHS, const void *RHS) { argument 1190 return strcmp(((const pair_ty*)LHS)->first, ((const pair_ty*)RHS)->first);
|
/external/llvm/lib/Target/MBlaze/ |
H A D | MBlazeISelLowering.cpp | 574 SDValue LHS = Op.getOperand(0); local 582 if (LHS.getValueType() == MVT::i32) { 584 CompareFlag = DAG.getNode(MBlazeISD::ICmp, dl, MVT::i32, LHS, RHS)
|
/external/llvm/lib/Target/MSP430/ |
H A D | MSP430ISelLowering.cpp | 696 static SDValue EmitCMP(SDValue &LHS, SDValue &RHS, SDValue &TargetCC, argument 700 assert(!LHS.getValueType().isFloatingPoint() && "We don't handle FP yet"); 708 // Minor optimization: if LHS is a constant, swap operands, then the 710 if (LHS.getOpcode() == ISD::Constant) 711 std::swap(LHS, RHS); 715 // Minor optimization: if LHS is a constant, swap operands, then the 717 if (LHS.getOpcode() == ISD::Constant) 718 std::swap(LHS, RHS); 721 std::swap(LHS, RHS); // FALLTHROUGH 725 if (const ConstantSDNode * C = dyn_cast<ConstantSDNode>(LHS)) { 782 SDValue LHS = Op.getOperand(2); local 795 SDValue LHS = Op.getOperand(0); local 876 SDValue LHS = Op.getOperand(0); local [all...] |
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCISelDAGToDAG.cpp | 113 SDValue SelectCC(SDValue LHS, SDValue RHS, ISD::CondCode CC, DebugLoc dl); 422 // If the LHS has a foldable shift and the RHS does not, then swap it to the 474 SDValue PPCDAGToDAGISel::SelectCC(SDValue LHS, SDValue RHS, argument 476 // Always select the LHS. 479 if (LHS.getValueType() == MVT::i32) { 485 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS, 489 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS, 501 SDValue Xor(CurDAG->getMachineNode(PPC::XORIS, dl, MVT::i32, LHS, 509 return SDValue(CurDAG->getMachineNode(PPC::CMPLWI, dl, MVT::i32, LHS, 515 return SDValue(CurDAG->getMachineNode(PPC::CMPWI, dl, MVT::i32, LHS, 798 SDValue LHS = N->getOperand(0); local [all...] |
/external/llvm/lib/Target/R600/ |
H A D | AMDILPeepholeOptimizer.cpp | 492 Instruction *LHS = dyn_cast<Instruction>(inst->getOperand(0)); local 494 if (!setupBitInsert(LHS, LHSSrc, LHSMask, LHSShift)) { 498 if (LHS) { LHS->dump(); } 521 dbgs() << "LHS: "; if (LHS) { LHS->dump(); } else { dbgs() << "(None)\n"; } 522 dbgs() << "LHS Src: "; if (LHSSrc) { LHSSrc->dump(); } else { dbgs() << "(None)\n"; } 523 dbgs() << "LHS Mask: "; if (LHSMask) { LHSMask->dump(); } else { dbgs() << "(None)\n"; } 524 dbgs() << "LHS Shif 799 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 837 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 930 Value *LHS = CI->getOperand(CI->getNumOperands() - 1); local 946 Value *LHS = CI->getOperand(CI->getNumOperands()-1); local [all...] |
H A D | R600ISelLowering.cpp | 532 SDValue LHS = Op.getOperand(0); local 539 // LHS and RHS are guaranteed to be the same value type 540 EVT CompareVT = LHS.getValueType(); 563 return DAG.getNode(ISD::SELECT_CC, DL, VT, LHS, RHS, True, False, CC); 575 if (isZero(LHS) || isZero(RHS)) { 576 SDValue Cond = (isZero(LHS) ? RHS : LHS); 577 SDValue Zero = (isZero(LHS) ? LHS : RHS); 587 if (isZero(LHS)) { 1047 SDValue LHS = N->getOperand(0); local [all...] |
/external/llvm/lib/Target/Sparc/ |
H A D | SparcISelLowering.cpp | 855 // Only known if known in both the LHS and RHS. 862 // Look at LHS/RHS/CC and see if they are a lowered setcc instruction. If so 863 // set LHS/RHS and SPCC to the LHS/RHS of the setcc and SPCC to the condition. 864 static void LookThroughSetCC(SDValue &LHS, SDValue &RHS, argument 869 ((LHS.getOpcode() == SPISD::SELECT_ICC && 870 LHS.getOperand(3).getOpcode() == SPISD::CMPICC) || 871 (LHS.getOpcode() == SPISD::SELECT_FCC && 872 LHS.getOperand(3).getOpcode() == SPISD::CMPFCC)) && 873 isa<ConstantSDNode>(LHS 945 SDValue LHS = Op.getOperand(2); local 973 SDValue LHS = Op.getOperand(0); local [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineAddSub.cpp | 852 /// (sext (add LHS, RHS)) === (add (sext LHS), (sext RHS)) 855 bool InstCombiner::WillNotOverflowSignedAdd(Value *LHS, Value *RHS) { argument 860 // have one carry bit which can change a sign. As such, if LHS and RHS each 863 if (ComputeNumSignBits(LHS) > 1 && ComputeNumSignBits(RHS) > 1) 879 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 881 if (Value *V = SimplifyAddInst(LHS, RHS, I.hasNoSignedWrap(), 893 return BinaryOperator::CreateXor(LHS, RHS); 901 if (ZExtInst *ZI = dyn_cast<ZExtInst>(LHS)) 906 if (match(LHS, m_Xo 1143 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 1213 OptimizePointerDifference(Value *LHS, Value *RHS, Type *Ty) argument [all...] |
H A D | InstCombineCalls.cpp | 351 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 356 ComputeMaskedBits(LHS, LHSKnownZero, LHSKnownOne); 369 Value *Add = Builder->CreateAdd(LHS, RHS); 372 UndefValue::get(LHS->getType()), 383 Value *Add = Builder->CreateNUWAdd(LHS, RHS); 386 UndefValue::get(LHS->getType()), 400 Value *LHS = II->getArgOperand(0); local 402 II->setArgOperand(1, LHS); 445 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1); local 446 unsigned BitWidth = cast<IntegerType>(LHS 477 Value *LHS = II->getArgOperand(0); local [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 430 // If we already inferred a value for this block on the LHS, don't 488 Value *LHS = PN->getIncomingValue(i); local 491 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, TD); 497 ResT = LVI->getPredicateOnEdge(Cmp->getPredicate(), LHS, 501 Res = ConstantInt::get(Type::getInt1Ty(LHS->getContext()), ResT); 536 // Try to find a constant value for the LHS of a comparison, 743 // For a comparison where the LHS is outside this block, it's possible 1204 // If either the LHS or RHS of the xor is a constant, don't do this 1216 // LHS or RHS of the xor in any predecessor is true/false, then we can clone 1279 // help us. However, we can just replace the LHS o [all...] |
H A D | SROA.cpp | 98 friend bool operator<(const ByteRange &LHS, uint64_t RHSOffset) { argument 99 return LHS.BeginOffset < RHSOffset;
|