/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 82 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) { in PerformExpensiveChecks() 239 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run() 374 assert(N->getNumValues() == M->getNumValues() && in run() 376 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run() 452 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i) in run() 676 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith() 678 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith() 930 assert(Results.size() == N->getNumValues() && in CustomLowerNode() 954 assert(Results.size() == N->getNumValues() && in CustomWidenLowerNode() 968 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in DisintegrateMERGE_VALUES()
|
H A D | ResourcePriorityQueue.cpp | 96 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in numberRCValPredInSU() 330 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) { in rawRegPressureDelta() 442 ResCount += (PriorityTwo + (ScaleThree*N->getNumValues())); in SUSchedulingCost() 478 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in scheduledNode() 548 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs()); in initNumRegDefsLeft()
|
H A D | ScheduleDAGSDNodes.cpp | 173 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue() 187 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue() 188 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue() 192 makeArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue() 291 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads() 300 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads() 382 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits() 383 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits() 574 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
|
H A D | LegalizeVectorOps.cpp | 222 assert(Op->getNumValues() == Result->getNumValues() && in TranslateLegalizeResults() 225 for (unsigned i = 0, e = Op->getNumValues(); i != e; ++i) in TranslateLegalizeResults() 233 assert(Results.size() == Op->getNumValues() && in RecursivelyLegalizeResults() 554 if (Node->getNumValues() == 1) { in LowerOperationWrapper() 561 assert((Node->getNumValues() == Res->getNumValues()) && in LowerOperationWrapper() 565 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I) in LowerOperationWrapper() 601 assert(Node->getNumValues() == 1 && in Promote() 736 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in Expand()
|
H A D | ScheduleDAGFast.cpp | 220 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 243 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 244 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors() 726 unsigned NumVals = N->getNumValues(); in Schedule()
|
H A D | ScheduleDAGRRList.cpp | 996 unsigned NumVals = N->getNumValues(); in TryUnfoldSU() 997 unsigned OldNumVals = SU->getNode()->getNumValues(); in TryUnfoldSU() 1153 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 1420 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues()); in DelayForLiveRegsBottomUp() 2063 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() 2310 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode() 2552 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort() 2556 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort() 2892 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
|
H A D | SelectionDAGISel.cpp | 2143 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse() 2251 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2257 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2374 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains() 2376 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains() 2476 unsigned NTMNumResults = Node->getNumValues(); in MorphNode() 2498 unsigned ResNumResults = Res->getNumValues(); in MorphNode() 3646 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon() 3666 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon() 3669 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
|
H A D | SelectionDAGPrinter.cpp | 41 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
|
H A D | LegalizeFloatTypes.cpp | 849 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand() 1795 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand() 1823 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands() 1826 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands() 1831 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands() 1834 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands() 2895 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
|
H A D | InstrEmitter.cpp | 48 unsigned N = Node->getNumValues(); in CountResults() 1041 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
|
H A D | SelectionDAG.cpp | 792 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE() 932 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 945 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 1027 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps() 8465 assert(Node->getNumValues() == 2 && "Unexpected number of results!"); in mutateStrictFPToFP() 8936 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith() 8987 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 8998 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 9000 assert((i < To->getNumValues()) && "Invalid To location"); in ReplaceAllUsesWith() 9042 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith() [all …]
|
H A D | LegalizeDAG.cpp | 207 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode() 230 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode() 967 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 1257 if (Node->getNumValues() == 1) { in LegalizeOp() 1270 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp() 2738 Results.append(Node->getNumValues() - 1, in ExpandNode() 2820 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
|
H A D | SelectionDAGDumper.cpp | 546 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Option/ |
H A D | Arg.h | 111 unsigned getNumValues() const { return Values.size(); } in getNumValues() function 121 for (unsigned i = 0, e = getNumValues(); i != e; ++i) in containsValue()
|
/netbsd-src/external/bsd/openldap/dist/contrib/ldapc++/src/ |
H A D | LDAPAttribute.h | 147 int getNumValues() const;
|
H A D | LDAPAttribute.cpp | 146 int LDAPAttribute::getNumValues() const{ in getNumValues() function in LDAPAttribute
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Option/ |
H A D | Arg.cpp | 106 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Driver/ |
H A D | SanitizerArgs.cpp | 678 if (Arg->getNumValues() == 1 && in SanitizerArgs() 1170 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues() 1193 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures() 1246 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/MC/ |
H A D | MCFragment.cpp | 420 << " NumValues:" << FF->getNumValues(); in dump()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARC/ |
H A D | ARCISelLowering.cpp | 495 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments() 540 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/ |
H A D | RISCVISelDAGToDAG.cpp | 166 unsigned NF = Node->getNumValues() - 1; in selectVLSEG() 206 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF() 251 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/MC/ |
H A D | MCFragment.h | 354 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
|
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
H A D | MipsSEISelDAGToDAG.cpp | 876 assert(Node->getNumValues() == 2); in trySelect() 948 assert(Node->getNumValues() == 1); in trySelect()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/ |
H A D | Hexagon.cpp | 555 assert(A->getNumValues() != 0); in getOptimizationLevel()
|
H A D | Clang.cpp | 196 unsigned NumOptions = A->getNumValues(); in ParseMRecip() 854 ProfileUseArg->getNumValues() == 0 ? "" : ProfileUseArg->getValue()); in addPGOAndCoverageFlags() 2548 if (A->getNumValues() != 2) { in CollectArgsForIntegratedAssembler() 2897 ((A->getNumValues() == 0) ? A->getSpelling() in RenderFloatingPointOptions() 5519 if (A->getNumValues()) { in ConstructJob() 6606 assert(Tgts && Tgts->getNumValues() && in ConstructJob() 6608 for (unsigned i = 0; i < Tgts->getNumValues(); ++i) { in ConstructJob()
|