/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() 567 for (i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 625 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in ExpungeNode() 729 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith() 731 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith() 965 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 | 180 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) in TranslateLegalizeResults() 215 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 | 1826 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse() 1936 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 1942 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2049 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChainsAndGlue() 2051 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChainsAndGlue() 2073 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue && in UpdateChainsAndGlue() 2075 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), in UpdateChainsAndGlue() 2282 unsigned NTMNumResults = Node->getNumValues(); in MorphNode() 2304 unsigned ResNumResults = Res->getNumValues(); in MorphNode() 3328 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon() [all …]
|
D | SelectionDAGPrinter.cpp | 44 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
|
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() 1930 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() 2182 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode() 2431 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort() 2435 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort() 2772 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
|
D | InstrEmitter.cpp | 45 unsigned N = Node->getNumValues(); in CountResults() 846 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
|
D | LegalizeDAG.cpp | 175 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode() 179 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) in ReplaceNode() 199 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode() 1209 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 1407 if (Node->getNumValues() == 1) { in LegalizeOp() 1414 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 3028 Results.append(Node->getNumValues() - 1, in ExpandNode() 3090 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
|
D | SelectionDAG.cpp | 586 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE() 706 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 719 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 800 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps() 6306 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith() 6353 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 6399 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith() 6441 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith() 6796 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue() 6815 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue() [all …]
|
D | SelectionDAGDumper.cpp | 388 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
|
D | LegalizeTypes.h | 156 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) in NoteDeletion()
|
D | LegalizeFloatTypes.cpp | 766 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand() 1507 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
|
D | LegalizeVectorTypes.cpp | 472 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ScalarizeVectorOperand() 1462 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SplitVectorOperand() 2997 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in WidenVectorOperand()
|
D | LegalizeIntegerTypes.cpp | 239 for (unsigned i = 1, NumResults = N->getNumValues(); i < NumResults; ++i) in PromoteIntRes_AtomicCmpSwap() 928 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in PromoteIntegerOperand() 2691 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandIntegerOperand()
|
D | DAGCombiner.cpp | 559 if (Op->hasOneUse() || Op->getNumValues() > 1) in deleteAndRecombine() 872 assert(N->getNumValues() == NumTo && "Broken CombineTo call!"); in CombineTo() 1331 if (N->getNumValues() == RV.getNode()->getNumValues()) in Run() 1335 N->getNumValues() == 1 && "Type mismatch"); in Run() 1504 N->getNumValues() == 1) { in combine() 3174 if (Load->getNumValues() == 3) { in visitAND() 6817 if (LN0->getNumValues() > 2) in ReduceLoadWidth()
|
/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 | 458 if (Arg->getNumValues() == 1 && in SanitizerArgs() 651 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues() 674 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures() 718 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()
|
/external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/ |
D | btTriangleInfoMapData.java | 163 public int getNumValues() { in getNumValues() method in btTriangleInfoMapData
|
/external/llvm/lib/Target/AMDGPU/ |
D | SIISelLowering.cpp | 959 Result.getNode()->getNumValues() == 2) && in LowerOperation() 1076 SDValue Chain = SDValue(Result, Result->getNumValues() - 1); in LowerBRCOND() 1079 for (unsigned i = 1, e = Intr->getNumValues() - 1; i != e; ++i) { in LowerBRCOND() 1095 SDValue(Intr, Intr->getNumValues() - 1), in LowerBRCOND()
|
/external/llvm/lib/Target/SystemZ/ |
D | SystemZISelLowering.cpp | 1418 assert(Op->getNumValues() == 2 && "Expected only CC result and chain"); in emitIntrinsicWithChainAndGlue() 1437 if (Op->getNumValues() == 1) in emitIntrinsicWithGlue() 1439 assert(Op->getNumValues() == 2 && "Expected exactly one non-CC result"); in emitIntrinsicWithGlue() 2048 CmpOp0.getResNo() == CmpOp0->getNumValues() - 1 && in getCmp() 2105 return SDValue(Op.getNode(), Op->getNumValues() - 1); in emitCmp() 3252 SDValue Glue = SDValue(After, After->getNumValues() - 1); in getCCResult() 3263 assert(Op->getNumValues() == 2 && "Expected only CC result and chain"); in lowerINTRINSIC_W_CHAIN() 3280 if (Op->getNumValues() == 1) in lowerINTRINSIC_WO_CHAIN() 3282 assert(Op->getNumValues() == 2 && "Expected a CC and non-CC result"); in lowerINTRINSIC_WO_CHAIN()
|
/external/llvm/include/llvm/CodeGen/ |
D | SelectionDAGNodes.h | 686 unsigned getNumValues() const { return NumValues; } 927 assert((!Node || ResNo < Node->getNumValues()) &&
|
/external/llvm/lib/Target/XCore/ |
D | XCoreISelLowering.cpp | 1344 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCCCArguments() 1396 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCCCArguments()
|