| /external/clang/lib/AST/ |
| ExprConstant.cpp | 413 /// rules. For example, the RHS of (0 && foo()) is not evaluated. We can
414 /// evaluate the expression regardless of what the RHS is, but C only allows
[all...] |
| ASTContext.cpp | [all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExprEngineC.cpp | 27 Expr *RHS = B->getRHS()->IgnoreParens();
34 // With both the LHS and RHS evaluated, process the operation itself.
41 SVal RightV = state->getSVal(RHS, LCtx);
53 // Simulate the effects of a "store": bind the value of the RHS
72 RHS->getType()->isIntegralOrEnumerationType() &&
74 RightV = svalBuilder.conjureSymbolVal(RHS, LCtx, RHS->getType(),
557 const Expr *RHS = cast<Expr>(Elem.getStmt());
558 SVal RHSVal = N->getState()->getSVal(RHS, Pred->getLocationContext());
570 X = getSValBuilder().evalCast(RHSVal, B->getType(), RHS->getType())
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 24 // 1. If a binary operator has a constant operand, it is moved to the RHS
416 getBinOpsForFactorization(BinaryOperator *Op, Value *&LHS, Value *&RHS) {
423 RHS = ConstantExpr::getShl(ConstantInt::get(Op->getType(), 1), CST);
432 RHS = Op->getOperand(1);
449 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
467 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
468 V = Builder->CreateBinOp(TopLevelOpcode, B, D, RHS->getName());
487 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
510 if (BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS))
526 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1)
[all...] |
| InstCombineWorklist.h | 30 void operator=(const InstCombineWorklist&RHS) LLVM_DELETED_FUNCTION;
|
| /external/clang/include/clang/AST/ |
| CharUnits.h | 211 const clang::CharUnits &RHS) {
212 return LHS == RHS;
|
| /external/clang/include/clang/Basic/ |
| FileManager.h | 107 bool operator<(const FileEntry &RHS) const { return UniqueID < RHS.UniqueID; }
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| DebugCheckers.cpp | 165 const Table::MapEntryTy *const *RHS) {
166 return (*LHS)->getKey().compare((*RHS)->getKey());
|
| /external/llvm/include/llvm/CodeGen/ |
| SelectionDAGISel.h | 205 bool CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
207 bool CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
|
| /external/llvm/lib/Support/ |
| TargetRegistry.cpp | 120 const std::pair<StringRef, const Target *> *RHS) {
121 return LHS->first.compare(RHS->first);
|
| Twine.cpp | 154 printOneChild(OS, RHS, getRHSKind());
161 printOneChildRepr(OS, RHS, getRHSKind());
|
| /external/llvm/utils/TableGen/ |
| CodeGenDAGPatterns.h | 143 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
144 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
277 bool operator==(const TreePredicateFn &RHS) const {
278 return PatFragRec == RHS.PatFragRec;
281 bool operator!=(const TreePredicateFn &RHS) const { return !(*this == RHS); }
|
| /external/clang/lib/Parse/ |
| ParseInit.cpp | 323 ExprResult RHS(ParseConstantExpression());
324 if (RHS.isInvalid()) {
326 return RHS;
329 RHS.get(),
|
| /external/llvm/lib/Analysis/IPA/ |
| InlineCost.cpp | 497 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
502 if (!isa<Constant>(RHS))
503 if (Constant *SimpleRHS = SimplifiedValues.lookup(RHS))
504 RHS = SimpleRHS;
506 if (Constant *CRHS = dyn_cast<Constant>(RHS))
522 std::tie(RHSBase, RHSOffset) = ConstantOffsetPtrs.lookup(RHS);
527 Constant *CRHS = ConstantInt::get(RHS->getContext(), RHSOffset);
567 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
572 std::tie(RHSBase, RHSOffset) = ConstantOffsetPtrs.lookup(RHS);
577 Constant *CRHS = ConstantInt::get(RHS->getContext(), RHSOffset)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CwiseBinaryOp.h | 23 * \param Rhs the type of the right-hand side
37 template<typename BinaryOp, typename Lhs, typename Rhs>
38 struct traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >
51 // even though we require Lhs and Rhs to have the same scalar type (see CwiseBinaryOp constructor),
56 typename Rhs::Scalar
60 typename traits<Rhs>::StorageKind>::ret StorageKind;
62 typename traits<Rhs>::Index>::type Index;
64 typedef typename Rhs::Nested RhsNested;
73 StorageOrdersAgree = (int(Lhs::Flags)&RowMajorBit)==(int(Rhs::Flags)&RowMajorBit),
89 // we require Lhs and Rhs to have the same scalar type. Currently there is no example of a binary functo
152 const _RhsNested& rhs() const { return m_rhs; } function in class:Eigen::CwiseBinaryOp
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64ISelLowering.cpp | [all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| AMDILISelLowering.cpp | 305 // Only known if known in both the LHS and RHS
494 SDValue RHS = Op.getOperand(1);
509 SDValue jq = DAG.getNode(ISD::XOR, DL, OVT, LHS, RHS);
523 // int ib, (int)RHS;
524 SDValue ib = DAG.getSExtOrTrunc(RHS, DL, INTTY);
575 SDValue RHS = Op.getOperand(1);
578 // mov r1, RHS
593 // mov r1, RHS
594 SDValue r1 = RHS;
654 SDValue RHS = DAG.getSExtOrTrunc(Op.getOperand(1), DL, INTTY)
[all...] |
| /external/llvm/include/llvm/Support/ |
| ScaledNumber.h | 110 std::pair<uint64_t, int16_t> multiply64(uint64_t LHS, uint64_t RHS);
116 inline std::pair<DigitsT, int16_t> getProduct(DigitsT LHS, DigitsT RHS) {
119 if (getWidth<DigitsT>() <= 32 || (LHS <= UINT32_MAX && RHS <= UINT32_MAX))
120 return getAdjusted<DigitsT>(uint64_t(LHS) * RHS);
122 return multiply64(LHS, RHS);
126 inline std::pair<uint32_t, int16_t> getProduct32(uint32_t LHS, uint32_t RHS) {
127 return getProduct(LHS, RHS);
131 inline std::pair<uint64_t, int16_t> getProduct64(uint64_t LHS, uint64_t RHS) {
132 return getProduct(LHS, RHS);
370 /// Get LHS minus RHS with as much precision as possible
[all...] |
| /external/llvm/lib/IR/ |
| ConstantsContext.h | 248 unsigned short pred, Constant* LHS, Constant* RHS)
251 Op<1>() = RHS;
665 static bool isEqual(const ConstantClass *LHS, const ConstantClass *RHS) {
666 return LHS == RHS;
672 static bool isEqual(const LookupKey &LHS, const ConstantClass *RHS) {
673 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
675 if (LHS.first != RHS->getType()
676 || LHS.second.size() != RHS->getNumOperands())
678 for (unsigned I = 0, E = RHS->getNumOperands(); I < E; ++I)
[all...] |
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDILISelLowering.cpp | 305 // Only known if known in both the LHS and RHS
494 SDValue RHS = Op.getOperand(1);
509 SDValue jq = DAG.getNode(ISD::XOR, DL, OVT, LHS, RHS);
523 // int ib, (int)RHS;
524 SDValue ib = DAG.getSExtOrTrunc(RHS, DL, INTTY);
575 SDValue RHS = Op.getOperand(1);
578 // mov r1, RHS
593 // mov r1, RHS
594 SDValue r1 = RHS;
654 SDValue RHS = DAG.getSExtOrTrunc(Op.getOperand(1), DL, INTTY)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 118 Value *LHS, Value *RHS);
126 Value *LHS, Value *RHS);
153 static bool isEqual(const Expression &LHS, const Expression &RHS) {
154 return LHS == RHS;
200 Value *LHS, Value *RHS) {
206 e.varargs.push_back(lookup_or_add(RHS));
472 Value *LHS, Value *RHS) {
473 Expression exp = create_cmp_expression(Opcode, Predicate, LHS, RHS);
715 bool propagateEquality(Value *LHS, Value *RHS, const BasicBlockEdge &Root);
[all...] |
| SeparateConstOffsetFromGEP.cpp | 194 /// Returns true if LHS and RHS have no bits in common, i.e., LHS | RHS == 0.
195 bool NoCommonBits(Value *LHS, Value *RHS) const;
326 Value *LHS = BO->getOperand(0), *RHS = BO->getOperand(1);
327 // Do not trace into "or" unless it is equivalent to "add". If LHS and RHS
328 // don't have common bits, (LHS | RHS) is equivalent to (LHS + RHS).
329 if (BO->getOpcode() == Instruction::Or && !NoCommonBits(LHS, RHS))
356 if (ConstantInt *ConstRHS = dyn_cast<ConstantInt>(RHS)) {
589 bool ConstantOffsetExtractor::NoCommonBits(Value *LHS, Value *RHS) const
[all...] |
| /external/clang/lib/Sema/ |
| SemaExprCXX.cpp | [all...] |
| /external/llvm/lib/Analysis/ |
| 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));
676 std::pair<const Loop *, const SCEV *> RHS) const {
679 RHS.second->getType()->isPointerTy())
683 if (LHS.first != RHS.first)
684 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first;
690 if (!RHS.second->isNonConstantNegative()
[all...] |
| /external/clang/lib/ARCMigrate/ |
| TransformActions.cpp | 81 RangeComparison compareWith(const CharRange &RHS) const {
82 if (End.isBeforeInTranslationUnitThan(RHS.Begin))
84 if (RHS.End.isBeforeInTranslationUnitThan(Begin))
86 if (!Begin.isBeforeInTranslationUnitThan(RHS.Begin) &&
87 !RHS.End.isBeforeInTranslationUnitThan(End))
89 if (Begin.isBeforeInTranslationUnitThan(RHS.Begin) &&
90 RHS.End.isBeforeInTranslationUnitThan(End))
92 if (Begin.isBeforeInTranslationUnitThan(RHS.Begin))
98 static RangeComparison compare(SourceRange LHS, SourceRange RHS,
101 .compareWith(CharRange(CharSourceRange::getTokenRange(RHS),
[all...] |
