| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | LegalizeTypes.cpp | 83 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) { in PerformExpensiveChecks() 364 assert(N->getNumValues() == M->getNumValues() && in run() 366 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) in run() 449 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() 920 if (Results.size() == N->getNumValues() + 1 && LegalizeResult) { in CustomLowerNode() 924 if (N->getNumValues() > 1) in CustomLowerNode() 930 assert(Results.size() == N->getNumValues() && in CustomLowerNode() 954 assert(Results.size() == N->getNumValues() && in CustomWidenLowerNode() [all …]
|
| H A D | ScheduleDAGSDNodes.cpp | 174 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false; in AddGlue() 188 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue && in RemoveUnusedGlue() 189 !N->hasAnyUseOfValue(N->getNumValues() - 1)) && in RemoveUnusedGlue() 193 makeArrayRef(N->value_begin(), N->getNumValues() - 1)); in RemoveUnusedGlue() 270 InGlue = SDValue(Lead, Lead->getNumValues() - 1); in ClusterNeighboringLoads() 279 InGlue = SDValue(Load, Load->getNumValues() - 1); in ClusterNeighboringLoads() 361 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { in BuildSchedUnits() 362 SDValue GlueVal(N, N->getNumValues()-1); in BuildSchedUnits() 552 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs); in InitNodeNumDefs()
|
| H A D | ResourcePriorityQueue.cpp | 92 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() 472 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) { in scheduledNode() 542 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs()); in initNumRegDefsLeft()
|
| H A D | ScheduleDAGFast.cpp | 221 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 244 unsigned NumVals = N->getNumValues(); in CopyAndMoveSuccessors() 245 unsigned OldNumVals = SU->getNode()->getNumValues(); in CopyAndMoveSuccessors() 726 unsigned NumVals = N->getNumValues(); in Schedule()
|
| H A D | ScheduleDAGRRList.cpp | 990 unsigned NumVals = N->getNumValues(); in TryUnfoldSU() 991 unsigned OldNumVals = SU->getNode()->getNumValues(); in TryUnfoldSU() 1146 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { in CopyAndMoveSuccessors() 1408 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues()); in DelayForLiveRegsBottomUp() 2043 int NP = (int)Priority - SU->getNode()->getNumValues(); in getNodePriority() 2290 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in unscheduledNode() 2532 unsigned RNumVals = right->getNode()->getNumValues(); in BURRSort() 2536 unsigned LNumVals = left->getNode()->getNumValues(); in BURRSort() 2872 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) { in canClobberPhysRegDefs()
|
| H A D | SelectionDAGISel.cpp | 2290 unsigned FlagResNo = N->getNumValues()-1; in findGlueUse() 2398 EVT VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2404 VT = Root->getValueType(Root->getNumValues()-1); in IsLegalToFold() 2507 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); in UpdateChains() 2509 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); in UpdateChains() 2609 unsigned NTMNumResults = Node->getNumValues(); in MorphNode() 2631 unsigned ResNumResults = Res->getNumValues(); in MorphNode() 3709 assert(i < NodeToMatch->getNumValues() && in SelectCodeCommon() 3729 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) == in SelectCodeCommon() 3732 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1), in SelectCodeCommon()
|
| H A D | SelectionDAGPrinter.cpp | 42 return ((const SDNode *) Node)->getNumValues(); in numEdgeDestLabels()
|
| H A D | LegalizeVectorOps.cpp | 220 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) in TranslateLegalizeResults() 254 assert(Lowered->getNumValues() == Op->getNumValues() && in LegalizeOp() 502 assert(Op.getNode()->getNumValues() == 1 && in Promote()
|
| H A D | InstrEmitter.cpp | 46 unsigned N = Node->getNumValues(); in CountResults() 960 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { in EmitMachineNode()
|
| H A D | SelectionDAG.cpp | 666 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) in doNotCSE() 795 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 808 assert(N->getNumValues() == 1 && "Too many results!"); in VerifySDNode() 8043 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 && in ReplaceAllUsesWith() 8094 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 8105 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 8153 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i) in ReplaceAllUsesWith() 8200 if (From.getNode()->getNumValues() == 1) { in ReplaceAllUsesOfValueWith() 8718 assert(Value < getNumValues() && "Bad value!"); in hasNUsesOfValue() 8736 assert(Value < getNumValues() && "Bad value!"); in hasAnyUseOfValue() [all …]
|
| H A D | LegalizeDAG.cpp | 205 assert(Old->getNumValues() == New->getNumValues() && in ReplaceNode() 228 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) { in ReplaceNode() 958 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 1217 if (Node->getNumValues() == 1) { in LegalizeOp() 1225 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) in LegalizeOp() 2707 Results.append(Node->getNumValues() - 1, in ExpandNode() 2789 for (unsigned i = 0; i < Node->getNumValues(); i++) in ExpandNode()
|
| H A D | SelectionDAGDumper.cpp | 481 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in print_types()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Option/ |
| H A D | Arg.h | 94 unsigned getNumValues() const { return Values.size(); } in getNumValues() function 104 for (unsigned i = 0, e = getNumValues(); i != e; ++i) in containsValue()
|
| /freebsd-12.1/contrib/llvm/tools/lld/Common/ |
| H A D | Reproduce.cpp | 60 if (Arg.getNumValues() == 0) in toString()
|
| /freebsd-12.1/contrib/llvm/lib/Option/ |
| H A D | Arg.cpp | 104 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { in render()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Driver/ |
| H A D | SanitizerArgs.cpp | 619 if (Arg->getNumValues() == 1 && in SanitizerArgs() 964 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseArgValues() 991 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in parseCoverageFeatures() 1043 for (int i = 0, n = A->getNumValues(); i != n; ++i) { in describeSanitizeArg()
|
| /freebsd-12.1/contrib/llvm/lib/MC/ |
| H A D | MCFragment.cpp | 392 << " NumValues:" << FF->getNumValues(); in dump()
|
| H A D | MCAssembler.cpp | 300 if (!FF.getNumValues().evaluateAsAbsolute(NumValues, Layout)) { in computeFragmentSize()
|
| /freebsd-12.1/contrib/llvm/lib/Target/ARC/ |
| H A D | ARCISelLowering.cpp | 497 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1)); in LowerCallArguments() 542 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1)); in LowerCallArguments()
|
| /freebsd-12.1/contrib/llvm/include/llvm/MC/ |
| H A D | MCFragment.h | 446 const MCExpr &getNumValues() const { return NumValues; } in getNumValues() function
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Driver/ToolChains/ |
| H A D | Hexagon.cpp | 500 assert(A->getNumValues() != 0); in getOptimizationLevel()
|
| H A D | Clang.cpp | 196 unsigned NumOptions = A->getNumValues(); in ParseMRecip() 790 ProfileUseArg->getNumValues() == 0 ? "" : ProfileUseArg->getValue()); in addPGOAndCoverageFlags() 2153 if (A->getNumValues() != 2) { in CollectArgsForIntegratedAssembler() 4323 if (A->getNumValues()) { in ConstructJob() 5222 assert(Tgts && Tgts->getNumValues() && in ConstructJob() 5224 for (unsigned i = 0; i < Tgts->getNumValues(); ++i) { in ConstructJob()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 964 unsigned getNumValues() const { return NumValues; } 1106 assert((!Node || !ResNo || ResNo < Node->getNumValues()) &&
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SIISelLowering.cpp | 3627 Result.getNode()->getNumValues() == 2) && in LowerOperation() 4085 SDValue Chain = SDValue(Result, Result->getNumValues() - 1); in LowerBRCOND() 4088 for (unsigned i = 1, e = Intr->getNumValues() - 1; i != e; ++i) { in LowerBRCOND() 4104 SDValue(Intr, Intr->getNumValues() - 1), in LowerBRCOND() 4737 if (Result->getNumValues() > 1) in constructRetValue() 6648 if (GlueChain->getNumValues() <= 1) { in getFPBinOp() 6652 assert(GlueChain->getNumValues() == 3); in getFPBinOp() 6669 if (GlueChain->getNumValues() <= 1) { in getFPTernOp() 6673 assert(GlueChain->getNumValues() == 3); in getFPTernOp() 9043 bool HasChain = Node->getNumValues() > 1; in adjustWritemask() [all …]
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonISelDAGToDAG.cpp | 953 if (UUse->getNumValues() != 1) in isMemOPCandidate() 1163 if (U->getNumValues() != 1) in ppHoistZextI1()
|