Home
last modified time | relevance | path

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

123

/llvm-project-15.0.7/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()
381 assert(N->getNumValues() == M->getNumValues() && in run()
383 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run()
459 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i) in run()
684 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith()
686 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in ReplaceValueWith()
938 assert(Results.size() == N->getNumValues() && in CustomLowerNode()
962 assert(Results.size() == N->getNumValues() && in CustomWidenLowerNode()
976 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in DisintegrateMERGE_VALUES()
H A DScheduleDAGSDNodes.cpp172 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue()
186 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue()
187 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue()
191 makeArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue()
290 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads()
299 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads()
381 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits()
382 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits()
572 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
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 DLegalizeVectorOps.cpp221 assert(Op->getNumValues() == Result->getNumValues() && in TranslateLegalizeResults()
224 for (unsigned i = 0, e = Op->getNumValues(); i != e; ++i) in TranslateLegalizeResults()
232 assert(Results.size() == Op->getNumValues() && in RecursivelyLegalizeResults()
523 if (Node->getNumValues() == 1) { in LowerOperationWrapper()
530 assert((Node->getNumValues() == Res->getNumValues()) && in LowerOperationWrapper()
534 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I) in LowerOperationWrapper()
570 assert(Node->getNumValues() == 1 && in Promote()
713 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in Expand()
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()
743 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()
1433 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues()); in DelayForLiveRegsBottomUp()
2076 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority()
2323 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode()
2565 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort()
2569 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort()
2905 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
H A DSelectionDAGISel.cpp2006 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
2114 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2120 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2342 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains()
2344 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains()
2444 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2466 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
3625 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
3645 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon()
3648 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
H A DSelectionDAGPrinter.cpp37 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
H A DLegalizeFloatTypes.cpp871 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand()
1821 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
1849 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1852 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1857 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1860 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2931 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
3060 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_STACKMAP()
3075 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_PATCHPOINT()
H A DInstrEmitter.cpp44 unsigned N = Node->getNumValues(); in CountResults()
1101 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
H A DLegalizeDAG.cpp207 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()
1294 if (Node->getNumValues() == 1) { in LegalizeOp()
1307 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp()
2763 Results.append(Node->getNumValues() - 1, in ExpandNode()
2845 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
H A DSelectionDAG.cpp891 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
1031 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1044 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
10088 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
10139 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
10150 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
10198 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
10245 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith()
10854 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue()
10872 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue()
[all …]
/llvm-project-15.0.7/lld/Common/
H A DReproduce.cpp55 if (arg.getNumValues() == 0) in toString()
58 for (size_t i = 0; i < arg.getNumValues(); ++i) { in toString()
/llvm-project-15.0.7/llvm/include/llvm/Option/
H A DArg.h111 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
/llvm-project-15.0.7/llvm/lib/Option/
H A DArg.cpp106 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/llvm-project-15.0.7/clang/lib/Driver/
H A DSanitizerArgs.cpp738 if (Arg->getNumValues() == 1 && in SanitizerArgs()
1281 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
1305 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures()
1360 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
/llvm-project-15.0.7/llvm/lib/MC/
H A DMCFragment.cpp424 << " NumValues:" << FF->getNumValues(); in dump()
/llvm-project-15.0.7/llvm/lib/Target/ARC/
H A DARCISelLowering.cpp534 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments()
579 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
/llvm-project-15.0.7/llvm/tools/llvm-ml/
H A Dllvm-ml.cpp253 setCurrentDebugTypes(Arg->getValues().data(), Arg->getNumValues()); in main()
/llvm-project-15.0.7/llvm/include/llvm/MC/
H A DMCFragment.h361 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp299 unsigned NF = Node->getNumValues() - 1; in selectVLSEG()
341 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF()
387 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
2506 Ops.push_back(SDValue(TGlued, TGlued->getNumValues() - 1)); in doPeepholeMaskedRVV()
/llvm-project-15.0.7/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp876 assert(Node->getNumValues() == 2); in trySelect()
948 assert(Node->getNumValues() == 1); in trySelect()
/llvm-project-15.0.7/clang-tools-extra/clangd/
H A DCompileCommands.cpp240 for (auto I = 0U; I <= Input->getNumValues(); ++I) in adjust()
/llvm-project-15.0.7/clang/lib/Driver/ToolChains/
H A DHexagon.cpp649 assert(A->getNumValues() != 0); in getOptimizationLevel()
/llvm-project-15.0.7/lld/COFF/
H A DDriverUtils.cpp253 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseFunctionPadMin()

123