/external/llvm/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.cpp | 81 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) { in PerformExpensiveChecks() 222 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run() 340 assert(N->getNumValues() == M->getNumValues() && in run() 342 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run() 424 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i) in run() 566 for (i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 624 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 727 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith() 729 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith() 962 if (Results.size() == N->getNumValues() + 1 && LegalizeResult) { in CustomLowerNode() [all …]
|
D | ScheduleDAGSDNodes.cpp | 175 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() 362 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits() 363 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits() 553 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
|
D | ResourcePriorityQueue.cpp | 95 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()
|
D | ScheduleDAGFast.cpp | 223 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 246 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 247 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors() 734 unsigned NumVals = N->getNumValues(); in Schedule()
|
D | LegalizeVectorOps.cpp | 181 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) in TranslateLegalizeResults() 216 if (Lowered->getNumValues() != Op->getNumValues()) { in LegalizeOp() 403 assert(Op.getNode()->getNumValues() == 1 && in Promote() 436 assert(Op.getNode()->getNumValues() == 1 && in PromoteINT_TO_FP() 469 assert(Op.getNode()->getNumValues() == 1 && in PromoteFP_TO_INT()
|
D | SelectionDAGISel.cpp | 1977 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse() 2087 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2093 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2193 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains() 2195 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains() 2417 unsigned NTMNumResults = Node->getNumValues(); in MorphNode() 2439 unsigned ResNumResults = Res->getNumValues(); in MorphNode() 3482 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon() 3502 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon() 3506 SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), InputGlue); in SelectCodeCommon()
|
D | ScheduleDAGRRList.cpp | 956 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 984 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 985 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors() 1917 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() 2165 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode() 2407 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort() 2411 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort() 2745 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
|
D | SelectionDAGPrinter.cpp | 44 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
|
D | InstrEmitter.cpp | 46 unsigned N = Node->getNumValues(); in CountResults() 848 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
|
D | SelectionDAG.cpp | 559 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE() 680 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 693 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 774 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps() 6274 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith() 6324 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 6335 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 6337 assert((i < To->getNumValues()) && "Invalid To location"); in ReplaceAllUsesWith() 6377 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith() 6381 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() [all …]
|
D | LegalizeDAG.cpp | 177 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode() 198 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode() 929 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 1126 if (Node->getNumValues() == 1) { in LegalizeOp() 1133 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 2781 Results.append(Node->getNumValues() - 1, in ExpandNode() 2871 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
|
D | SelectionDAGDumper.cpp | 389 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.cpp | 80 for (unsigned i = 0, e = I->getNumValues(); i != e; ++i) { in PerformExpensiveChecks() 222 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run() 332 assert(N->getNumValues() == M->getNumValues() && in run() 334 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run() 412 for (unsigned i = 0, NumVals = I->getNumValues(); i < NumVals; ++i) in run() 551 for (i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 609 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 709 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith() 711 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith() 919 assert(Results.size() == N->getNumValues() && in CustomLowerNode() [all …]
|
D | ScheduleDAGSDNodes.cpp | 134 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return; in AddGlue() 136 for (unsigned I = 0, E = N->getNumValues(); I != E; ++I) in AddGlue() 235 SDValue InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads() 243 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads() 324 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits() 325 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits() 506 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
|
D | SelectionDAGISel.cpp | 1355 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse() 1465 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 1471 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 1551 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChainsAndGlue() 1553 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChainsAndGlue() 1575 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue && in UpdateChainsAndGlue() 1577 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), in UpdateChainsAndGlue() 1782 unsigned NTMNumResults = Node->getNumValues(); in MorphNode() 1804 unsigned ResNumResults = Res->getNumValues(); in MorphNode() 2714 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon() [all …]
|
D | ScheduleDAGFast.cpp | 217 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 241 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 242 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors()
|
D | LegalizeVectorOps.cpp | 106 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) in TranslateLegalizeResults() 247 assert(Op.getNode()->getNumValues() == 1 && in PromoteVectorOp()
|
D | InstrEmitter.cpp | 43 unsigned N = Node->getNumValues(); in CountResults() 706 Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode() 764 else if (Node->getValueType(Node->getNumValues()-1) != MVT::Glue) in EmitMachineNode() 772 if (Node->getValueType(Node->getNumValues()-1) != MVT::Glue) in EmitMachineNode()
|
D | SelectionDAGPrinter.cpp | 46 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
|
D | ScheduleDAGRRList.cpp | 789 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 813 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 814 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors() 1808 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() 2058 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in UnscheduledNode() 2319 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort() 2323 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort() 2674 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
|
D | LegalizeDAG.cpp | 240 SDValue TheChain(Node, Node->getNumValues()-1); in FindCallEndFromCallStart() 246 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i) in FindCallEndFromCallStart() 773 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 948 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 956 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp() 1066 if (Node->getNumValues() == 2) // If this has a flag result, remember it. in LegalizeOp() 1125 if (Node->getNumValues() == 2) in LegalizeOp() 3066 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode() 3820 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in ExpandNode()
|
D | SelectionDAG.cpp | 506 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE() 653 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps() 756 assert(N->getNumValues() == 1 && "Too many results!"); in VerifyNodeCommon() 769 assert(N->getNumValues() == 1 && "Too many results!"); in VerifyNodeCommon() 5260 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith() 5304 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 5348 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith() 5387 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith() 5717 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue() 5736 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue() [all …]
|
/external/llvm/include/llvm/Option/ |
D | Arg.h | 91 unsigned getNumValues() const { return Values.size(); } in getNumValues() function 100 for (unsigned i = 0, e = getNumValues(); i != e; ++i) in containsValue()
|
/external/clang/lib/Driver/ |
D | SanitizerArgs.cpp | 453 if (Arg->getNumValues() == 1 && in SanitizerArgs() 719 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues() 746 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures() 791 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
|
/external/llvm/lib/Option/ |
D | Arg.cpp | 101 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
|