Home
last modified time | relevance | path

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

123

/freebsd-13.1/contrib/llvm-project/lld/Common/
H A DReproduce.cpp55 if (arg.getNumValues() == 0) in toString()
58 for (size_t i = 0; i < arg.getNumValues(); ++i) { in toString()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp82 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 DResourcePriorityQueue.cpp96 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 DScheduleDAGSDNodes.cpp173 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 DLegalizeVectorOps.cpp222 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()
555 if (Node->getNumValues() == 1) { in LowerOperationWrapper()
562 assert((Node->getNumValues() == Res->getNumValues()) && in LowerOperationWrapper()
566 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I) in LowerOperationWrapper()
602 assert(Node->getNumValues() == 1 && in Promote()
737 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in Expand()
H A DScheduleDAGFast.cpp220 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 DScheduleDAGRRList.cpp996 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 DSelectionDAGISel.cpp2152 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
2260 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2266 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2388 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains()
2390 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains()
2490 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2512 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
3663 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
3683 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon()
3686 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
H A DSelectionDAGPrinter.cpp41 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
H A DLegalizeFloatTypes.cpp857 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand()
1800 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
1828 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1831 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1836 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1839 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2900 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
H A DInstrEmitter.cpp48 unsigned N = Node->getNumValues(); in CountResults()
1080 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
H A DSelectionDAG.cpp793 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
933 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
946 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
9021 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
9072 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
9083 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
9131 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
9178 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith()
9763 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue()
9781 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue()
[all …]
H A DLegalizeDAG.cpp209 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode()
232 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode()
969 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp()
1259 if (Node->getNumValues() == 1) { in LegalizeOp()
1272 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp()
2725 Results.append(Node->getNumValues() - 1, in ExpandNode()
2807 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
H A DSelectionDAGDumper.cpp548 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Option/
H A DArg.h111 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
121 for (unsigned i = 0, e = getNumValues(); i != e; ++i) in containsValue()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Option/
H A DArg.cpp106 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/freebsd-13.1/contrib/llvm-project/clang/lib/Driver/
H A DSanitizerArgs.cpp679 if (Arg->getNumValues() == 1 && in SanitizerArgs()
1204 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
1227 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures()
1280 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
/freebsd-13.1/contrib/llvm-project/llvm/lib/MC/
H A DMCFragment.cpp420 << " NumValues:" << FF->getNumValues(); in dump()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARC/
H A DARCISelLowering.cpp495 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments()
540 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCFragment.h354 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp239 unsigned NF = Node->getNumValues() - 1; in selectVLSEG()
279 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF()
324 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp876 assert(Node->getNumValues() == 2); in trySelect()
948 assert(Node->getNumValues() == 1); in trySelect()
/freebsd-13.1/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DHexagon.cpp555 assert(A->getNumValues() != 0); in getOptimizationLevel()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h955 unsigned getNumValues() const { return NumValues; }
1104 assert((!Node || !ResNo || ResNo < Node->getNumValues()) &&
/freebsd-13.1/contrib/llvm-project/lld/COFF/
H A DDriverUtils.cpp238 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseFunctionPadMin()

123