Home
last modified time | relevance | path

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

123

/openbsd-src/gnu/llvm/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()
942 assert(Results.size() == N->getNumValues() && in CustomLowerNode()
966 assert(Results.size() == N->getNumValues() && in CustomWidenLowerNode()
980 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 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()
524 if (Node->getNumValues() == 1) { in LowerOperationWrapper()
531 assert((Node->getNumValues() == Res->getNumValues()) && in LowerOperationWrapper()
535 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I) in LowerOperationWrapper()
571 assert(Node->getNumValues() == 1 && in Promote()
715 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()
741 unsigned NumVals = N->getNumValues(); in Schedule()
H A DScheduleDAGRRList.cpp999 unsigned NumVals = N->getNumValues(); in TryUnfoldSU()
1000 unsigned OldNumVals = SU->getNode()->getNumValues(); in TryUnfoldSU()
1156 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors()
1437 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues()); in DelayForLiveRegsBottomUp()
2077 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority()
2334 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode()
2576 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort()
2580 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort()
2916 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
H A DSelectionDAGISel.cpp2055 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse()
2163 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2169 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold()
2396 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains()
2398 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains()
2498 unsigned NTMNumResults = Node->getNumValues(); in MorphNode()
2520 unsigned ResNumResults = Res->getNumValues(); in MorphNode()
3682 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon()
3702 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon()
3705 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()
1822 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in ExpandFloatOperand()
1850 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1853 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1858 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
1861 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue(); in FloatExpandSetCCOperands()
2946 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && in SoftPromoteHalfOperand()
3088 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_STACKMAP()
3103 for (unsigned ResNum = 0; ResNum < N->getNumValues(); ResNum++) in SoftPromoteHalfOp_PATCHPOINT()
H A DInstrEmitter.cpp44 unsigned N = Node->getNumValues(); in CountResults()
1141 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
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()
1298 if (Node->getNumValues() == 1) { in LegalizeOp()
1311 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { in LegalizeOp()
2760 Results.append(Node->getNumValues() - 1, in ExpandNode()
2842 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
H A DSelectionDAG.cpp934 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE()
1077 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1090 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode()
1172 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && in RemoveNodeFromCSEMaps()
9868 assert(Node->getNumValues() == 2 && "Unexpected number of results!"); in mutateStrictFPToFP()
10339 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith()
10392 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
10403 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith()
10405 assert((i < To->getNumValues()) && "Invalid To location"); in ReplaceAllUsesWith()
10449 if (From->getNumValues() == 1) // Handle the simple case efficiently. in ReplaceAllUsesWith()
[all …]
H A DSelectionDAGDumper.cpp563 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
/openbsd-src/gnu/llvm/lld/Common/
H A DReproduce.cpp55 if (arg.getNumValues() == 0) in toString()
58 for (size_t i = 0; i < arg.getNumValues(); ++i) { in toString()
/openbsd-src/gnu/llvm/llvm/include/llvm/Option/
H A DArg.h111 unsigned getNumValues() const { return Values.size(); } in getNumValues() function
/openbsd-src/gnu/llvm/llvm/lib/Option/
H A DArg.cpp106 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
/openbsd-src/gnu/llvm/clang/lib/Driver/
H A DSanitizerArgs.cpp756 if (Arg->getNumValues() == 1 && in SanitizerArgs()
1334 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues()
1358 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures()
1396 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseBinaryMetadataFeatures()
1437 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
/openbsd-src/gnu/llvm/llvm/lib/MC/
H A DMCFragment.cpp424 << " NumValues:" << FF->getNumValues(); in dump()
/openbsd-src/gnu/llvm/llvm/lib/Target/ARC/
H A DARCISelLowering.cpp532 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments()
576 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
/openbsd-src/gnu/llvm/llvm/tools/llvm-ml/
H A Dllvm-ml.cpp257 setCurrentDebugTypes(Arg->getValues().data(), Arg->getNumValues()); in main()
/openbsd-src/gnu/llvm/llvm/include/llvm/MC/
H A DMCFragment.h361 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
/openbsd-src/gnu/llvm/llvm/lib/Target/RISCV/
H A DRISCVISelDAGToDAG.cpp316 unsigned NF = Node->getNumValues() - 1; in selectVLSEG()
358 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain. in selectVLSEGFF()
404 unsigned NF = Node->getNumValues() - 1; in selectVLXSEG()
2732 Ops.push_back(SDValue(TGlued, TGlued->getNumValues() - 1)); in doPeepholeMaskedRVV()
2845 for (unsigned Idx = 1; Idx < True->getNumValues(); ++Idx) in performCombineVMergeAndVOps()
/openbsd-src/gnu/llvm/llvm/lib/Target/Mips/
H A DMipsSEISelDAGToDAG.cpp876 assert(Node->getNumValues() == 2); in trySelect()
948 assert(Node->getNumValues() == 1); in trySelect()
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAG.cpp913 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in Select()
1004 if (UUse->getNumValues() != 1) in isMemOPCandidate()
1214 if (U->getNumValues() != 1) in ppHoistZextI1()
/openbsd-src/gnu/llvm/clang/lib/Driver/ToolChains/
H A DHexagon.cpp650 assert(A->getNumValues() != 0); in getOptimizationLevel()

123