Home
last modified time | relevance | path

Searched refs:getNumValues (Results 1 – 25 of 37) sorted by relevance

12

/external/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.cpp82 for (unsigned i = 0, e = I->getNumValues(); i != e; ++i) { in PerformExpensiveChecks()
224 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run()
338 assert(N->getNumValues() == M->getNumValues() && in run()
340 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run()
418 for (unsigned i = 0, NumVals = I->getNumValues(); i < NumVals; ++i) in run()
557 for (i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode()
615 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode()
719 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith()
721 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith()
945 if (Results.size() == N->getNumValues() + 1 && LegalizeResult) { in CustomLowerNode()
[all …]
DScheduleDAGSDNodes.cpp175 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue()
189 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue()
190 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue()
194 makeArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue()
271 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads()
280 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads()
364 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits()
365 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits()
555 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
DResourcePriorityQueue.cpp95 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in numberRCValPredInSU()
333 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) { in rawRegPressureDelta()
450 ResCount += (PriorityTwo + (ScaleThree*N->getNumValues())); in SUSchedulingCost()
485 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in scheduledNode()
557 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs()); in initNumRegDefsLeft()
DScheduleDAGFast.cpp223 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors()
247 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors()
248 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors()
736 unsigned NumVals = N->getNumValues(); in Schedule()
DLegalizeVectorOps.cpp179 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) in TranslateLegalizeResults()
213 if (Lowered->getNumValues() != Op->getNumValues()) { in LegalizeOp()
386 assert(Op.getNode()->getNumValues() == 1 && in Promote()
419 assert(Op.getNode()->getNumValues() == 1 && in PromoteINT_TO_FP()
452 assert(Op.getNode()->getNumValues() == 1 && in PromoteFP_TO_INT()
DSelectionDAGISel.cpp1850 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
1960 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
1966 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2069 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChainsAndGlue()
2071 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChainsAndGlue()
2093 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue && in UpdateChainsAndGlue()
2095 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), in UpdateChainsAndGlue()
2302 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2324 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
3337 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
[all …]
DSelectionDAGPrinter.cpp44 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
DScheduleDAGRRList.cpp947 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors()
976 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors()
977 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors()
1921 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority()
2173 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode()
2422 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort()
2426 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort()
2763 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
DInstrEmitter.cpp45 unsigned N = Node->getNumValues(); in CountResults()
844 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
DSelectionDAGDumper.cpp355 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
DSelectionDAG.cpp618 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
738 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
751 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
826 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps()
5966 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
6013 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
6059 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith()
6101 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith()
6435 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue()
6454 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue()
[all …]
DLegalizeDAG.cpp166 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode()
170 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) in ReplaceNode()
190 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode()
1163 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp()
1354 if (Node->getNumValues() == 1) { in LegalizeOp()
1361 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp()
2968 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
DLegalizeTypes.h142 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) in NoteDeletion()
DLegalizeVectorTypes.cpp462 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ScalarizeVectorOperand()
1345 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SplitVectorOperand()
2656 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in WidenVectorOperand()
DLegalizeIntegerTypes.cpp230 for (unsigned i = 1, NumResults = N->getNumValues(); i < NumResults; ++i) in PromoteIntRes_AtomicCmpSwap()
881 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in PromoteIntegerOperand()
2548 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandIntegerOperand()
DLegalizeFloatTypes.cpp702 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand()
1392 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
/external/llvm/include/llvm/Option/
DArg.h91 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
101 for (unsigned i = 0, e = getNumValues(); i != e; ++i) in containsValue()
/external/llvm/lib/Option/
DArg.cpp98 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/external/clang/lib/Driver/
DSanitizerArgs.cpp522 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
564 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
DDriver.cpp224 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) in TranslateInputArgs()
243 if (A->getNumValues() == 2) in TranslateInputArgs()
271 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) in TranslateInputArgs()
DToolChains.cpp707 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) { in TranslateArgs()
2138 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i) in GetHexagonLibraryPaths()
/external/llvm/lib/Target/R600/
DSIISelLowering.cpp690 Result.getNode()->getNumValues() == 2) && in LowerOperation()
788 SDValue Chain = SDValue(Result, Result->getNumValues() - 1); in LowerBRCOND()
791 for (unsigned i = 1, e = Intr->getNumValues() - 1; i != e; ++i) { in LowerBRCOND()
807 SDValue(Intr, Intr->getNumValues() - 1), in LowerBRCOND()
/external/llvm/include/llvm/CodeGen/
DSelectionDAGNodes.h622 unsigned getNumValues() const { return NumValues; }
863 assert((!Node || ResNo < Node->getNumValues()) &&
/external/llvm/lib/Target/SystemZ/
DSystemZISelLowering.cpp1076 assert(Op->getNumValues() == 2 && "Expected only CC result and chain"); in emitIntrinsicWithChainAndGlue()
1739 return SDValue(Op.getNode(), Op->getNumValues() - 1); in emitCmp()
2674 SDValue Glue = SDValue(After, After->getNumValues() - 1); in getCCResult()
2685 assert(Op->getNumValues() == 2 && "Expected only CC result and chain"); in lowerINTRINSIC_W_CHAIN()
/external/llvm/lib/Target/XCore/
DXCoreISelLowering.cpp1340 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCCCArguments()
1392 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCCCArguments()

12