Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp79 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) { in PerformExpensiveChecks()
245 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { in run()
379 assert(N->getNumValues() == M->getNumValues() && in run()
381 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run()
456 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i) in run()
681 assert(N->getNumValues() == M->getNumValues() && in ReplaceValueWith()
683 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 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.cpp177 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue()
191 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue()
192 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue()
196 ArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue()
295 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads()
304 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads()
386 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits()
387 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits()
578 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
H A DLegalizeVectorOps.cpp240 assert(Op->getNumValues() == Result->getNumValues() && in TranslateLegalizeResults()
243 for (unsigned i = 0, e = Op->getNumValues(); i != e; ++i) in TranslateLegalizeResults()
251 assert(Results.size() == Op->getNumValues() && in RecursivelyLegalizeResults()
581 if (Node->getNumValues() == 1) { in LowerOperationWrapper()
588 assert((Node->getNumValues() == Res->getNumValues()) && in LowerOperationWrapper()
592 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I) in LowerOperationWrapper()
707 assert(Node->getNumValues() == 1 && in Promote()
854 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in Expand()
1133 if (Node->getNumValues() == 1) { in Expand()
1136 assert(Node->getNumValues() == Unrolled->getNumValues() && in Expand()
[all …]
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 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.cpp2296 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
2406 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2412 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2660 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains()
2662 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains()
2762 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2784 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
4245 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
4265 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon()
4268 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
H A DLegalizeFloatTypes.cpp1040 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftenFloatOperand()
2103 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
2131 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2134 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2139 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2142 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
3425 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
3586 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_STACKMAP()
3601 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_PATCHPOINT()
H A DInstrEmitter.cpp44 unsigned N = Node->getNumValues(); in CountResults()
1171 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
H A DSelectionDAG.cpp979 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
1124 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1137 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1219 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps()
10793 assert(Node->getNumValues() == 2 && "Unexpected number of results!"); in mutateStrictFPToFP()
11324 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
11377 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
11388 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
11390 assert((i < To->getNumValues()) && "Invalid To location"); in ReplaceAllUsesWith()
11434 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith()
[all …]
H A DLegalizeDAG.cpp217 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode()
240 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode()
964 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp()
1316 if (Node->getNumValues() == 1) { in LegalizeOp()
1329 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp()
3139 Results.append(Node->getNumValues() - 1, in ExpandNode()
3237 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
/freebsd/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/contrib/llvm-project/llvm/include/llvm/Option/
H A DArg.h123 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
/freebsd/contrib/llvm-project/llvm/lib/Option/
H A DArg.cpp104 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/freebsd/contrib/llvm-project/clang/lib/Driver/
H A DSanitizerArgs.cpp796 if (Arg->getNumValues() == 1 && in SanitizerArgs()
1410 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
1434 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures()
1472 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseBinaryMetadataFeatures()
1513 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
/freebsd/contrib/llvm-project/llvm/lib/MC/
H A DMCFragment.cpp188 << " NumValues:" << FF->getNumValues(); in dump()
H A DMCExpr.cpp706 FF && FF->getNumValues().evaluateAsAbsolute(Num)) { in AttemptToFoldSymbolOffsetDifference()
/freebsd/contrib/llvm-project/clang/lib/Driver/ToolChains/
H A DHIPUtility.cpp114 if (IA->getInputArg().getNumValues() == 0) in populateSymbols()
H A DHexagon.cpp671 assert(A->getNumValues() != 0); in getOptimizationLevel()
/freebsd/contrib/llvm-project/lld/COFF/
H A DDriverUtils.cpp251 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseFunctionPadMin()
272 StringRef arg = a->getNumValues() ? a->getValue() : ""; in parseDependentLoadFlags()
/freebsd/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/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCFragment.h352 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp885 assert(Node->getNumValues() == 2); in trySelect()
956 assert(Node->getNumValues() == 1); in trySelect()
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp342 unsigned NF = Node->getNumValues() - 1; in selectVLSEG()
381 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF()
424 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
3636 Ops.push_back(SDValue(TGlued, TGlued->getNumValues() - 1)); in doPeepholeMaskedRVV()
3942 for (unsigned Idx = 1; Idx < True->getNumValues(); ++Idx) in performCombineVMergeAndVOps()

123