Searched defs:RHS (Results 151 - 175 of 262) sorted by relevance

1234567891011

/external/llvm/lib/Target/NVPTX/
H A DNVPTXISelDAGToDAG.cpp3268 SDValue RHS = N->getOperand(1); local
3277 if (isa<ConstantSDNode>(LHS) && !isa<ConstantSDNode>(RHS)) {
3278 std::swap(LHS, RHS);
3281 ConstantSDNode *Mask = dyn_cast<ConstantSDNode>(RHS);
3283 // We need a constant mask on the RHS of the AND
3332 ConstantSDNode *ShiftCnst = dyn_cast<ConstantSDNode>(RHS);
3343 // Canonicalize the AND to have the mask on the RHS
3401 SDValue ShrRHS = RHS;
/external/llvm/lib/Target/R600/
H A DAMDGPUISelDAGToDAG.cpp659 SDValue RHS = N->getOperand(1); local
672 DL, MVT::i32, RHS, Sub0);
674 DL, MVT::i32, RHS, Sub1);
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineMulDivRem.cpp190 // Simplify mul instructions with a constant RHS.
448 // Simplify mul instructions with a constant RHS.
601 Value *LHS = Op0, *RHS = Op1; local
603 if (!match(RHS, m_UIToFP(m_Value(C))))
604 std::swap(LHS, RHS);
606 if (match(RHS, m_UIToFP(m_Value(C))) &&
616 Value *LHS = Op0, *RHS = Op1; local
618 if (!match(RHS, m_FSub(m_FPOne(), m_UIToFP(m_Value(C)))))
619 std::swap(LHS, RHS);
621 if (match(RHS, m_FSu
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DJumpThreading.cpp505 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB); local
507 Value *Res = SimplifyCmpInst(Cmp->getPredicate(), LHS, RHS, DL);
509 if (!isa<Constant>(RHS))
514 cast<Constant>(RHS), PredBB, BB);
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 or RHS with the constant.
H A DReassociate.cpp56 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.Power == RHS
146 operator ()(XorOpnd * const &LHS, XorOpnd * const &RHS) argument
349 IncorporateWeight(APInt &LHS, const APInt &RHS, unsigned Opcode) argument
[all...]
H A DSampleProfile.cpp100 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 DAsmWriterEmitter.cpp729 bool operator==(const IAPrinter &RHS) { argument
730 if (Conds.size() != RHS.Conds.size())
736 if (*I != RHS.Conds[Idx++])
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;
961 IAPrinter *RHS = *III; local
962 if (LHS != RHS && *LHS == *RHS) {
[all...]
H A DSubtargetEmitter.cpp56 const MCWriteProcResEntry &RHS) {
57 return LHS.ProcResourceIdx < RHS.ProcResourceIdx;
55 operator ()(const MCWriteProcResEntry &LHS, const MCWriteProcResEntry &RHS) argument
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDILPeepholeOptimizer.cpp498 Instruction *RHS = dyn_cast<Instruction>(inst->getOperand(1)); local
511 if (!setupBitInsert(RHS, RHSSrc, RHSMask, RHSShift)) {
515 if (RHS) { RHS->dump(); }
530 dbgs() << "RHS: "; if (RHS) { RHS->dump(); } else { dbgs() << "(None)\n"; }
531 dbgs() << "RHS Src: "; if (RHSSrc) { RHSSrc->dump(); } else { dbgs() << "(None)\n"; }
532 dbgs() << "RHS Mask: "; if (RHSMask) { RHSMask->dump(); } else { dbgs() << "(None)\n"; }
533 dbgs() << "RHS Shif
[all...]
/external/clang/include/clang/Basic/
H A DSourceManager.h163 ContentCache(const ContentCache &RHS) argument
166 OrigEntry = RHS.OrigEntry;
167 ContentsEntry = RHS.ContentsEntry;
169 assert(RHS.Buffer.getPointer() == nullptr &&
170 RHS.SourceLineCache == nullptr &&
173 NumLines = RHS.NumLines;
234 ContentCache &operator=(const ContentCache& RHS) LLVM_DELETED_FUNCTION;
488 /// the specified LHS/RHS query.
491 bool isCacheValid(FileID LHS, FileID RHS) const {
492 return LQueryFID == LHS && RQueryFID == RHS;
515 setQueryFIDs(FileID LHS, FileID RHS, bool isLFIDBeforeRFID) argument
1205 isInSameSLocAddrSpace(SourceLocation LHS, SourceLocation RHS, int *RelativeOffset) const argument
[all...]
/external/clang/include/clang/Sema/
H A DScopeInfo.h243 const WeakObjectProfileTy &RHS) {
244 return LHS == RHS;
242 isEqual(const WeakObjectProfileTy &LHS, const WeakObjectProfileTy &RHS) argument
/external/clang/lib/AST/
H A DDeclObjC.cpp1228 const SynthesizeIvarChunk &RHS) {
1229 return LHS.Size < RHS.Size;
1227 operator <(const SynthesizeIvarChunk & LHS, const SynthesizeIvarChunk &RHS) argument
/external/clang/lib/Basic/
H A DVirtualFileSystem.cpp349 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 DCGExprCXX.cpp143 llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); local
144 EmitAggregateAssign(This, RHS, CE->getType());
151 llvm::Value *RHS = EmitLValue(*CE->arg_begin()).getAddress(); local
152 EmitSynthesizedCXXCopyCtorCall(cast<CXXConstructorDecl>(MD), This, RHS, local
H A DCGExprComplex.cpp215 ComplexPairTy RHS; member in struct:__anon17034::ComplexExprEmitter::BinOpInfo
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");
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.first, Op.RHS.first, "sub.r");
546 ResI = Builder.CreateSub(Op.LHS.second, Op.RHS.second, "sub.i");
557 Value *ResRl = Builder.CreateFMul(Op.LHS.first, Op.RHS
769 ComplexPairTy RHS = Visit(E->getFalseExpr()); local
[all...]
H A DCGExprConstant.cpp1152 llvm::Constant *RHS = EmitConstantExpr(RHSExpr, RHSExpr->getType(), CGF); local
1157 RHS = llvm::ConstantExpr::getPtrToInt(RHS, IntPtrTy);
1158 llvm::Constant *AddrLabelDiff = llvm::ConstantExpr::getSub(LHS, RHS);
H A DCGStmt.cpp1090 assert(S.getRHS() && "Expected RHS value in CaseStmt");
1093 llvm::APSInt RHS = S.getRHS()->EvaluateKnownConstInt(getContext()); local
1105 if (LHS.isSigned() ? RHS.slt(LHS) : RHS.ult(LHS))
1108 llvm::APInt Range = RHS - LHS;
/external/llvm/examples/Kaleidoscope/Chapter7/
H A Dtoy.cpp146 ExprAST *LHS, *RHS; member in class:__anon24619::BinaryExprAST
149 : Op(op), LHS(lhs), RHS(rhs) {}
486 ExprAST *RHS = ParseUnary(); local
487 if (!RHS) return 0;
489 // If BinOp binds less tightly with RHS than the operator after RHS, let
490 // the pending operator take RHS as its LHS.
493 RHS = ParseBinOpRHS(TokPrec+1, RHS);
494 if (RHS
[all...]
/external/llvm/examples/Kaleidoscope/MCJIT/cached/
H A Dtoy-jit.cpp164 ExprAST *LHS, *RHS; member in class:BinaryExprAST
167 : Op(op), LHS(lhs), RHS(rhs) {}
503 ExprAST *RHS = ParseUnary(); local
504 if (!RHS) return 0;
506 // If BinOp binds less tightly with RHS than the operator after RHS, let
507 // the pending operator take RHS as its LHS.
510 RHS = ParseBinOpRHS(TokPrec+1, RHS);
511 if (RHS
[all...]
H A Dtoy.cpp170 ExprAST *LHS, *RHS; member in class:BinaryExprAST
173 : Op(op), LHS(lhs), RHS(rhs) {}
509 ExprAST *RHS = ParseUnary(); local
510 if (!RHS) return 0;
512 // If BinOp binds less tightly with RHS than the operator after RHS, let
513 // the pending operator take RHS as its LHS.
516 RHS = ParseBinOpRHS(TokPrec+1, RHS);
517 if (RHS
[all...]
/external/llvm/examples/Kaleidoscope/MCJIT/complete/
H A Dtoy.cpp194 ExprAST *LHS, *RHS; member in class:BinaryExprAST
197 : Op(op), LHS(lhs), RHS(rhs) {}
533 ExprAST *RHS = ParseUnary(); local
534 if (!RHS) return 0;
536 // If BinOp binds less tightly with RHS than the operator after RHS, let
537 // the pending operator take RHS as its LHS.
540 RHS = ParseBinOpRHS(TokPrec+1, RHS);
541 if (RHS
[all...]
/external/llvm/examples/Kaleidoscope/MCJIT/initial/
H A Dtoy.cpp147 ExprAST *LHS, *RHS; member in class:BinaryExprAST
150 : Op(op), LHS(lhs), RHS(rhs) {}
486 ExprAST *RHS = ParseUnary(); local
487 if (!RHS) return 0;
489 // If BinOp binds less tightly with RHS than the operator after RHS, let
490 // the pending operator take RHS as its LHS.
493 RHS = ParseBinOpRHS(TokPrec+1, RHS);
494 if (RHS
[all...]
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/
H A Dtoy-jit.cpp149 ExprAST *LHS, *RHS; member in class:BinaryExprAST
152 : Op(op), LHS(lhs), RHS(rhs) {}
488 ExprAST *RHS = ParseUnary(); local
489 if (!RHS) return 0;
491 // If BinOp binds less tightly with RHS than the operator after RHS, let
492 // the pending operator take RHS as its LHS.
495 RHS = ParseBinOpRHS(TokPrec+1, RHS);
496 if (RHS
[all...]
H A Dtoy.cpp149 ExprAST *LHS, *RHS; member in class:BinaryExprAST
152 : Op(op), LHS(lhs), RHS(rhs) {}
488 ExprAST *RHS = ParseUnary(); local
489 if (!RHS) return 0;
491 // If BinOp binds less tightly with RHS than the operator after RHS, let
492 // the pending operator take RHS as its LHS.
495 RHS = ParseBinOpRHS(TokPrec+1, RHS);
496 if (RHS
[all...]
/external/llvm/include/llvm/ADT/
H A DImmutableSet.h130 bool isElementEqual(const ImutAVLTree* RHS) const {
131 return isElementEqual(RHS->getValue());
137 bool isEqual(const ImutAVLTree& RHS) const {
138 if (&RHS == this)
142 iterator RItr = RHS.begin(), REnd = RHS.end();
163 bool isNotEqual(const ImutAVLTree& RHS) const { return !isEqual(RHS); }
896 static inline bool isEqual(key_type_ref LHS, key_type_ref RHS) { argument
897 return std::equal_to<key_type>()(LHS,RHS);
900 isLess(key_type_ref LHS, key_type_ref RHS) argument
922 isEqual(key_type_ref LHS, key_type_ref RHS) argument
926 isLess(key_type_ref LHS, key_type_ref RHS) argument
[all...]

Completed in 2936 milliseconds

1234567891011