Home
last modified time | relevance | path

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

123

/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp79 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) { in PerformExpensiveChecks()
246 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run()
380 assert(N->getNumValues() == M->getNumValues() && in run()
382 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run()
457 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i) in run()
682 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith()
684 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith()
939 assert(Results.size() == N->getNumValues() && in CustomLowerNode()
963 assert(Results.size() == N->getNumValues() && in CustomWidenLowerNode()
977 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in DisintegrateMERGE_VALUES()
H A DResourcePriorityQueue.cpp92 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in numberRCValPredInSU()
325 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) { in rawRegPressureDelta()
437 ResCount += (PriorityTwo + (ScaleThree*N->getNumValues())); in SUSchedulingCost()
473 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in scheduledNode()
543 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs()); in initNumRegDefsLeft()
H A DScheduleDAGSDNodes.cpp176 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue()
190 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue()
191 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue()
195 ArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue()
294 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads()
303 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads()
385 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits()
386 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits()
577 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
H A DScheduleDAGFast.cpp216 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors()
239 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors()
240 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors()
736 unsigned NumVals = N->getNumValues(); in Schedule()
H A DLegalizeVectorOps.cpp237 assert(Op->getNumValues() == Result->getNumValues() && in TranslateLegalizeResults()
240 for (unsigned i = 0, e = Op->getNumValues(); i != e; ++i) in TranslateLegalizeResults()
248 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()
742 assert(Node->getNumValues() == 1 && in Promote()
889 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in Expand()
1145 for (unsigned I = 0, E = Unrolled->getNumValues(); I != E; ++I) in Expand()
H A DScheduleDAGRRList.cpp993 unsigned NumVals = N->getNumValues(); in TryUnfoldSU()
994 unsigned OldNumVals = SU->getNode()->getNumValues(); in TryUnfoldSU()
1150 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors()
1430 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues()); in DelayForLiveRegsBottomUp()
2070 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority()
2326 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode()
2568 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort()
2572 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort()
2908 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
H A DSelectionDAGPrinter.cpp37 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
H A DSelectionDAGISel.cpp2177 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
2287 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2293 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2526 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains()
2528 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains()
2628 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2650 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
4102 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
4122 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon()
4125 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
H A DLegalizeFloatTypes.cpp954 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand()
1923 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
1951 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1954 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1959 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1962 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
3158 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
3300 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_STACKMAP()
3315 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_PATCHPOINT()
H A DInstrEmitter.cpp44 unsigned N = Node->getNumValues(); in CountResults()
1144 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
H A DSelectionDAG.cpp976 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
1119 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1132 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
10987 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
11040 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
11051 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
11151 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith()
11811 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue()
11829 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue()
12063 if (N->getNumValues() == 2) { in UnrollVectorOp()
[all …]
H A DLegalizeDAG.cpp216 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode()
239 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode()
985 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp()
1321 if (Node->getNumValues() == 1) { in LegalizeOp()
1334 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp()
3070 Results.append(Node->getNumValues() - 1, in ExpandNode()
3168 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/include/llvm/Option/
H A DArg.h123 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/Option/
H A DArg.cpp104 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/freebsd-14.2/contrib/llvm-project/clang/lib/Driver/
H A DSanitizerArgs.cpp785 if (Arg->getNumValues() == 1 && in SanitizerArgs()
1394 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
1418 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures()
1456 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseBinaryMetadataFeatures()
1497 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
/freebsd-14.2/contrib/llvm-project/llvm/lib/MC/
H A DMCFragment.cpp424 << " NumValues:" << FF->getNumValues(); in dump()
H A DMCExpr.cpp716 FF && FF->getNumValues().evaluateAsAbsolute(Num)) { in AttemptToFoldSymbolOffsetDifference()
/freebsd-14.2/contrib/llvm-project/lld/COFF/
H A DDriverUtils.cpp249 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseFunctionPadMin()
270 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseDependentLoadFlags()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARC/
H A DARCISelLowering.cpp534 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments()
578 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCFragment.h365 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp873 assert(Node->getNumValues() == 2); in trySelect()
944 assert(Node->getNumValues() == 1); in trySelect()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp343 unsigned NF = Node->getNumValues() - 1; in selectVLSEG()
382 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF()
425 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
3417 Ops.push_back(SDValue(TGlued, TGlued->getNumValues() - 1)); in doPeepholeMaskedRVV()
3711 for (unsigned Idx = 1; Idx < True->getNumValues(); ++Idx) in performCombineVMergeAndVOps()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAG.cpp912 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in Select()
1002 if (UUse->getNumValues() != 1) in isMemOPCandidate()
1208 if (U->getNumValues() != 1) in ppHoistZextI1()
/freebsd-14.2/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DHexagon.cpp659 assert(A->getNumValues() != 0); in getOptimizationLevel()

123