| /external/llvm/lib/Analysis/ |
| PHITransAddr.cpp | 262 // PHI translate the LHS.
267 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
268 if (LHS == 0) return 0;
270 // If the PHI translated LHS is an add of a constant, fold the immediates.
271 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS))
274 LHS = BOp->getOperand(0);
278 // If the old 'LHS' was an input, add the new 'LHS' as an input.
281 AddAsInput(LHS);
286 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT))
[all...] |
| ScalarEvolution.cpp | 448 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less
456 // Return true or false if LHS is less than, or at least RHS, respectively.
457 bool operator()(const SCEV *LHS, const SCEV *RHS) const {
458 return compare(LHS, RHS) < 0;
461 // Return negative, zero, or positive, if LHS is less than, equal to, or
464 int compare(const SCEV *LHS, const SCEV *RHS) const {
466 if (LHS == RHS)
470 unsigned LType = LHS->getSCEVType(), RType = RHS->getSCEVType();
479 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS);
531 const SCEVConstant *LC = cast<SCEVConstant>(LHS);
[all...] |
| ScalarEvolutionExpander.cpp | 153 Value *LHS, Value *RHS) {
155 if (Constant *CLHS = dyn_cast<Constant>(LHS))
171 if (IP->getOpcode() == (unsigned)Opcode && IP->getOperand(0) == LHS &&
184 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break;
193 Instruction *BO = cast<Instruction>(Builder.CreateBinOp(Opcode, LHS, RHS));
683 bool operator()(std::pair<const Loop *, const SCEV *> LHS,
686 if (LHS.second->getType()->isPointerTy() !=
688 return LHS.second->getType()->isPointerTy();
691 if (LHS.first != RHS.first)
692 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first
[all...] |
| InlineCost.cpp | 485 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
487 if (!isa<Constant>(LHS))
488 if (Constant *SimpleLHS = SimplifiedValues.lookup(LHS))
489 LHS = SimpleLHS;
493 if (Constant *CLHS = dyn_cast<Constant>(LHS))
504 llvm::tie(LHSBase, LHSOffset) = ConstantOffsetPtrs.lookup(LHS);
510 Constant *CLHS = ConstantInt::get(LHS->getContext(), LHSOffset);
551 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
554 llvm::tie(LHSBase, LHSOffset) = ConstantOffsetPtrs.lookup(LHS);
560 Constant *CLHS = ConstantInt::get(LHS->getContext(), LHSOffset)
[all...] |
| /external/clang/lib/Rewrite/ |
| DeltaTree.cpp | 56 DeltaTreeNode *LHS, *RHS;
136 Children[0] = IR.LHS;
139 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
222 InsertRes->LHS->DoInsertion(FileIndex, Delta, 0 /*can't fail*/);
242 IN->Children[i] = InsertRes->LHS;
255 IN->Children[i] = InsertRes->LHS;
265 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->LHS);
300 // the first 'WidthFactor-1' values to the LHS child (which we leave in this
329 InsertRes.LHS = this;
|
| /external/llvm/include/llvm/ADT/ |
| SmallBitVector.h | 431 operator&(const SmallBitVector &LHS, const SmallBitVector &RHS) {
432 SmallBitVector Result(LHS);
438 operator|(const SmallBitVector &LHS, const SmallBitVector &RHS) {
439 SmallBitVector Result(LHS);
445 operator^(const SmallBitVector &LHS, const SmallBitVector &RHS) {
446 SmallBitVector Result(LHS);
456 swap(llvm::SmallBitVector &LHS, llvm::SmallBitVector &RHS) {
457 LHS.swap(RHS);
|
| BitVector.h | 311 // are already zero in the LHS.
475 inline BitVector operator&(const BitVector &LHS, const BitVector &RHS) {
476 BitVector Result(LHS);
481 inline BitVector operator|(const BitVector &LHS, const BitVector &RHS) {
482 BitVector Result(LHS);
487 inline BitVector operator^(const BitVector &LHS, const BitVector &RHS) {
488 BitVector Result(LHS);
498 swap(llvm::BitVector &LHS, llvm::BitVector &RHS) {
499 LHS.swap(RHS);
|
| ArrayRef.h | 282 inline bool operator==(ArrayRef<T> LHS, ArrayRef<T> RHS) {
283 return LHS.equals(RHS);
287 inline bool operator!=(ArrayRef<T> LHS, ArrayRef<T> RHS) {
288 return !(LHS == RHS);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.cpp | 212 static llvm::APSInt computeAdjustment(const SymExpr *LHS,
217 // First check if the LHS is a simple symbol reference.
218 if (isa<SymbolData>(LHS))
222 const SymIntExpr *SE = dyn_cast<SymIntExpr>(LHS);
243 const SymExpr *LHS,
256 SymbolRef Sym = LHS;
257 llvm::APSInt Adjustment = computeAdjustment(LHS, Sym);
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 54 inline bool operator<(const ValueEntry &LHS, const ValueEntry &RHS) {
55 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
122 Value *LHS = Op->getOperand(0), *RHS = Op->getOperand(1);
126 RemoveDeadBinaryOp(LHS);
180 // If this is an expression, return the 1+MAX(rank(LHS), rank(RHS)) so that
230 BinaryOperator *LHS = cast<BinaryOperator>(I->getOperand(0));
232 assert(isReassociableOp(LHS, I->getOpcode()) &&
236 DEBUG(dbgs() << "Linear" << *LHS << '\n' << *RHS << '\n' << *I << '\n');
244 RHS->setOperand(0, LHS);
250 LHS->clearSubclassOptionalData()
[all...] |
| EarlyCSE.cpp | 87 static bool isEqual(SimpleValue LHS, SimpleValue RHS);
124 bool DenseMapInfo<SimpleValue>::isEqual(SimpleValue LHS, SimpleValue RHS) {
125 Instruction *LHSI = LHS.Inst, *RHSI = RHS.Inst;
127 if (LHS.isSentinel() || RHS.isSentinel())
180 static bool isEqual(CallValue LHS, CallValue RHS);
197 bool DenseMapInfo<CallValue>::isEqual(CallValue LHS, CallValue RHS) {
198 Instruction *LHSI = LHS.Inst, *RHSI = RHS.Inst;
199 if (LHS.isSentinel() || RHS.isSentinel())
|
| /external/clang/lib/AST/ |
| DeclarationName.cpp | 80 int DeclarationName::compare(DeclarationName LHS, DeclarationName RHS) {
81 if (LHS.getNameKind() != RHS.getNameKind())
82 return (LHS.getNameKind() < RHS.getNameKind() ? -1 : 1);
84 switch (LHS.getNameKind()) {
86 IdentifierInfo *LII = LHS.getAsIdentifierInfo();
97 Selector LHSSelector = LHS.getObjCSelector();
115 if (QualTypeOrdering()(LHS.getCXXNameType(), RHS.getCXXNameType()))
117 if (QualTypeOrdering()(RHS.getCXXNameType(), LHS.getCXXNameType()))
122 return compareInt(LHS.getCXXOverloadedOperator(),
126 return LHS.getCXXLiteralIdentifier()->getName().compare
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| toy.cpp | 116 ExprAST *LHS, *RHS;
118 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs)
119 : Op(op), LHS(lhs), RHS(rhs) {}
259 static ExprAST *ParseBinOpRHS(int ExprPrec, ExprAST *LHS) {
267 return LHS;
278 // the pending operator take RHS as its LHS.
285 // Merge LHS/RHS.
286 LHS = new BinaryExprAST(BinOp, LHS, RHS)
[all...] |
| /external/llvm/include/llvm-c/ |
| Core.h | [all...] |
| /external/llvm/bindings/ocaml/llvm/ |
| llvm_ocaml.c | [all...] |
| /external/clang/include/clang/Driver/ |
| ArgList.h | 81 friend bool operator==(arg_iterator LHS, arg_iterator RHS) {
82 return LHS.Current == RHS.Current;
84 friend bool operator!=(arg_iterator LHS, arg_iterator RHS) {
85 return !(LHS == RHS);
281 /// \brief Create an arg string for (\arg LHS + \arg RHS), reusing the
283 const char *GetOrMakeJoinedArgString(unsigned Index, StringRef LHS,
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SymbolManager.h | 347 const SymExpr *LHS;
353 SymIntExpr(const SymExpr *lhs, BinaryOperator::Opcode op,
355 : SymExpr(SymIntKind), LHS(lhs), Op(op), RHS(rhs), T(t) {}
365 const SymExpr *getLHS() const { return LHS; }
368 static void Profile(llvm::FoldingSetNodeID& ID, const SymExpr *lhs,
372 ID.AddPointer(lhs);
379 Profile(ID, LHS, Op, RHS, T);
390 const llvm::APSInt& LHS;
396 IntSymExpr(const llvm::APSInt& lhs, BinaryOperator::Opcode op
[all...] |
| /external/clang/include/clang/Lex/ |
| PreprocessingRecord.h | 322 bool operator()(const CondDirectiveLoc &LHS,
324 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS.getLoc());
326 bool operator()(const CondDirectiveLoc &LHS, SourceLocation RHS) {
327 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS);
329 bool operator()(SourceLocation LHS, const CondDirectiveLoc &RHS) {
330 return SM.isBeforeInTranslationUnit(LHS, RHS.getLoc());
574 bool areInDifferentConditionalDirectiveRegion(SourceLocation LHS,
576 return findCondDirectiveIdx(LHS) != findCondDirectiveIdx(RHS);
|
| /external/llvm/lib/Support/ |
| TargetRegistry.cpp | 97 static int TargetArraySortFn(const void *LHS, const void *RHS) {
99 return ((const pair_ty*)LHS)->first.compare(((const pair_ty*)RHS)->first);
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombine.h | 111 Value *OptimizePointerDifference(Value *LHS, Value *RHS, Type *Ty);
127 Value *FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS);
128 Value *FoldAndOfFCmps(FCmpInst *LHS, FCmpInst *RHS);
130 Value *FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS);
131 Value *FoldOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS);
149 Instruction *LHS,
228 bool WillNotOverflowSignedAdd(Value *LHS, Value *RHS);
356 Value *FoldLogicalPlusAnd(Value *LHS, Value *RHS, ConstantInt *Mask,
|
| /external/llvm/lib/TableGen/ |
| Record.cpp | 72 static bool isEqual(const TableGenStringKey& LHS,
74 return LHS.str() == RHS.str();
195 Init *LHS = Tern->getLHS();
211 TernOpInit::get(TernOpInit::IF, LHS,
226 NewBits[i] = TernOpInit::get(TernOpInit::IF, LHS,
721 UnOpInit *UnOpInit::get(UnaryOp opc, Init *lhs, RecTy *Type) {
727 Key TheKey(std::make_pair(std::make_pair(opc, lhs), Type));
730 if (!I) I = new UnOpInit(opc, lhs, Type);
738 StringInit *LHSs = dynamic_cast<StringInit*>(LHS);
743 DefInit *LHSd = dynamic_cast<DefInit*>(LHS);
855 Init *lhs = LHS->resolveReferences(R, RV); local
965 Init *lhs = LHS->resolveReferences(R, RV); local
1219 Init *lhs = LHS->resolveReferences(R, RV); local
[all...] |
| /external/llvm/lib/ExecutionEngine/ |
| ExecutionEngine.cpp | 698 GenericValue LHS = getConstantValue(Op0);
706 case Instruction::Add: GV.IntVal = LHS.IntVal + RHS.IntVal; break;
707 case Instruction::Sub: GV.IntVal = LHS.IntVal - RHS.IntVal; break;
708 case Instruction::Mul: GV.IntVal = LHS.IntVal * RHS.IntVal; break;
709 case Instruction::UDiv:GV.IntVal = LHS.IntVal.udiv(RHS.IntVal); break;
710 case Instruction::SDiv:GV.IntVal = LHS.IntVal.sdiv(RHS.IntVal); break;
711 case Instruction::URem:GV.IntVal = LHS.IntVal.urem(RHS.IntVal); break;
712 case Instruction::SRem:GV.IntVal = LHS.IntVal.srem(RHS.IntVal); break;
713 case Instruction::And: GV.IntVal = LHS.IntVal & RHS.IntVal; break;
714 case Instruction::Or: GV.IntVal = LHS.IntVal | RHS.IntVal; break
[all...] |
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelLowering.cpp | 659 static SDValue EmitCMP(SDValue &LHS, SDValue &RHS, SDValue &TargetCC,
663 assert(!LHS.getValueType().isFloatingPoint() && "We don't handle FP yet");
671 // Minor optimization: if LHS is a constant, swap operands, then the
673 if (LHS.getOpcode() == ISD::Constant)
674 std::swap(LHS, RHS);
678 // Minor optimization: if LHS is a constant, swap operands, then the
680 if (LHS.getOpcode() == ISD::Constant)
681 std::swap(LHS, RHS);
684 std::swap(LHS, RHS); // FALLTHROUGH
686 // Turn lhs u>= rhs with lhs constant into rhs u< lhs+1, this allows us t
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ConstantFolding.h | 65 Constant *LHS, Constant *RHS,
|
| /external/llvm/include/llvm/Support/ |
| DebugLoc.h | 109 static bool isEqual(const DebugLoc &LHS, const DebugLoc &RHS);
|
