|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/CodeGen/SelectionDAGNodes.h 1153 assert((!Node || !ResNo || ResNo < Node->getNumValues()) &&
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 787 if (Op->hasOneUse() || Op->getNumValues() > 1)
991 assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
1464 if (N->getNumValues() == RV.getNode()->getNumValues())
1464 if (N->getNumValues() == RV.getNode()->getNumValues())
1468 N->getNumValues() == 1 && "Type mismatch");
1673 N->getNumValues() == 1) {
1917 assert(TLI.isBinOp(BO->getOpcode()) && BO->getNumValues() == 1 &&
4744 if (Load->getNumValues() > 2)
4841 if (NodeToMask->getNumValues() > 1) {
4843 for (unsigned i = 0, e = NodeToMask->getNumValues(); i < e; ++i) {
5212 if (Load->getNumValues() == 3) {
16768 Vec.getNode()->getNumValues() != 1)
18039 if (!TLI.isBinOp(BinOpcode) || BinOp.getNode()->getNumValues() != 1)
18087 if (!TLI.isBinOp(BOpcode) || BinOp.getNode()->getNumValues() != 1)
18902 TLI.isBinOp(N0.getOpcode()) && N0.getNode()->getNumValues() == 1) {
lib/CodeGen/SelectionDAG/InstrEmitter.cpp 45 unsigned N = Node->getNumValues();
944 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) {
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 210 assert(Old->getNumValues() == New->getNumValues() &&
210 assert(Old->getNumValues() == New->getNumValues() &&
233 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) {
972 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1230 if (Node->getNumValues() == 1) {
1238 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2719 Results.append(Node->getNumValues() - 1,
2801 for (unsigned i = 0; i < Node->getNumValues(); i++)
lib/CodeGen/SelectionDAG/LegalizeFloatTypes.cpp 863 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1669 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
lib/CodeGen/SelectionDAG/LegalizeIntegerTypes.cpp 277 for (unsigned i = 1, NumResults = N->getNumValues(); i < NumResults; ++i)
1234 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
3635 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 82 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) {
233 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) {
354 assert(N->getNumValues() == M->getNumValues() &&
354 assert(N->getNumValues() == M->getNumValues() &&
356 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i)
434 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i)
659 assert(N->getNumValues() == M->getNumValues() &&
659 assert(N->getNumValues() == M->getNumValues() &&
661 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
894 if (Results.size() == N->getNumValues() + 1 && LegalizeResult) {
898 if (N->getNumValues() > 1)
904 assert(Results.size() == N->getNumValues() &&
928 assert(Results.size() == N->getNumValues() &&
941 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i)
lib/CodeGen/SelectionDAG/LegalizeTypes.h 175 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) {
lib/CodeGen/SelectionDAG/LegalizeVectorOps.cpp 224 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i)
258 assert(Lowered->getNumValues() == Op->getNumValues() &&
258 assert(Lowered->getNumValues() == Op->getNumValues() &&
540 assert(Op.getNode()->getNumValues() == 1 &&
lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp 660 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
2063 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 2 &&
2066 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
4201 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 2 &&
4204 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
lib/CodeGen/SelectionDAG/ResourcePriorityQueue.cpp 92 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
326 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) {
438 ResCount += (PriorityTwo + (ScaleThree*N->getNumValues()));
474 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
544 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs());
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 220 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
243 unsigned NumVals = N->getNumValues();
244 unsigned OldNumVals = SU->getNode()->getNumValues();
726 unsigned NumVals = N->getNumValues();
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 996 unsigned NumVals = N->getNumValues();
997 unsigned OldNumVals = SU->getNode()->getNumValues();
1153 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
1420 const SDValue &OptionalDef = Node->getOperand(i - Node->getNumValues());
2307 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
2549 unsigned RNumVals = right->getNode()->getNumValues();
2553 unsigned LNumVals = left->getNode()->getNumValues();
2889 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 173 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false;
187 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue &&
188 !N->hasAnyUseOfValue(N->getNumValues() - 1)) &&
192 makeArrayRef(N->value_begin(), N->getNumValues() - 1));
288 InGlue = SDValue(Lead, Lead->getNumValues() - 1);
297 InGlue = SDValue(Load, Load->getNumValues() - 1);
379 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) {
380 SDValue GlueVal(N, N->getNumValues()-1);
570 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs);
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 668 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
797 assert(N->getNumValues() == 1 && "Too many results!");
810 assert(N->getNumValues() == 1 && "Too many results!");
892 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue &&
7788 assert(Node->getNumValues() == 2 && "Unexpected number of results!");
8162 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 &&
8213 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
8224 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
8226 assert((i < To->getNumValues()) && "Invalid To location");
8268 if (From->getNumValues() == 1) // Handle the simple case efficiently.
8272 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
8319 if (From.getNode()->getNumValues() == 1) {
8889 assert(Value < getNumValues() && "Bad value!");
8907 assert(Value < getNumValues() && "Bad value!");
9111 assert(N->getNumValues() == 1 &&
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 1480 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
1494 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i)
4840 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1);
7016 assert(Result.getNode()->getNumValues() == 2);
8601 unsigned NumVals = Op.getNode()->getNumValues();
lib/CodeGen/SelectionDAG/SelectionDAGDumper.cpp 501 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 2092 unsigned FlagResNo = N->getNumValues()-1;
2200 EVT VT = Root->getValueType(Root->getNumValues()-1);
2206 VT = Root->getValueType(Root->getNumValues()-1);
2309 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
2311 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
2411 unsigned NTMNumResults = Node->getNumValues();
2433 unsigned ResNumResults = Res->getNumValues();
3536 assert(i < NodeToMatch->getNumValues() &&
3556 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) ==
3559 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1),
lib/CodeGen/SelectionDAG/SelectionDAGPrinter.cpp 41 return ((const SDNode *) Node)->getNumValues();
lib/CodeGen/SelectionDAG/TargetLowering.cpp 515 assert(Op.getNode()->getNumValues() == 1 &&
lib/Target/AArch64/AArch64ISelLowering.cpp11817 if (N->getNumValues() != 1)
lib/Target/AMDGPU/R600ISelLowering.cpp 492 Result.getNode()->getNumValues() == 2) &&
lib/Target/AMDGPU/SIISelLowering.cpp 4021 Result.getNode()->getNumValues() == 2) &&
4508 SDValue Chain = SDValue(Result, Result->getNumValues() - 1);
4511 for (unsigned i = 1, e = Intr->getNumValues() - 1; i != e; ++i) {
4527 SDValue(Intr, Intr->getNumValues() - 1),
5284 if (Result->getNumValues() > 1)
7570 if (GlueChain->getNumValues() <= 1) {
7574 assert(GlueChain->getNumValues() == 3);
7591 if (GlueChain->getNumValues() <= 1) {
7595 assert(GlueChain->getNumValues() == 3);
10095 bool HasChain = Node->getNumValues() > 1;
10265 SDValue(Glued, Glued ? Glued->getNumValues() - 1 : 0));
lib/Target/ARC/ARCISelLowering.cpp 496 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1));
541 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1));
lib/Target/ARM/ARMISelDAGToDAG.cpp 3388 if (N->getNumValues() == 2) {
lib/Target/ARM/ARMISelLowering.cpp 1729 unsigned NumVals = N->getNumValues();
2869 if (N->getNumValues() != 1)
5063 if (!N->getNumValues())
11267 assert(AddcSubcNode->getNumValues() == 2 &&
lib/Target/AVR/AVRISelLowering.cpp 734 for (unsigned I = 0, E = Res->getNumValues(); I != E; ++I)
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 957 if (UUse->getNumValues() != 1)
1167 if (U->getNumValues() != 1)
lib/Target/Mips/MipsISelLowering.cpp 1205 for (unsigned I = 0, E = Res->getNumValues(); I != E; ++I)
lib/Target/PowerPC/PPCISelLowering.cpp 5056 SDValue LDChain = CallSeqStart.getValue(CallSeqStart->getNumValues()-1);
5058 LDChain = CallSeqStart.getValue(CallSeqStart->getNumValues()-2);
lib/Target/SystemZ/SystemZISelLowering.cpp 1905 assert(Op->getNumValues() == 2 && "Expected only CC result and chain");
2491 CmpOp0.getResNo() == CmpOp0->getNumValues() - 1 &&
2545 return SDValue(Node, Node->getNumValues() - 1);
3923 assert(Op->getNumValues() == 2 && "Expected only CC result and chain");
3939 if (Op->getNumValues() == 1)
3941 assert(Op->getNumValues() == 2 && "Expected a CC and non-CC result");
lib/Target/WebAssembly/WebAssemblyISelLowering.cpp 1038 return Op.getNode()->getNumValues() == 1
lib/Target/X86/X86ISelLowering.cpp 2670 if (N->getNumValues() != 1 || !N->hasNUsesOfValue(1, 0))
21930 assert(NewLd->getNumValues() == 2 && "Loads must carry a chain!");
27800 if (N->getNumValues() == 1) {
27807 assert((N->getNumValues() == Res->getNumValues()) &&
27807 assert((N->getNumValues() == Res->getNumValues()) &&
27811 for (unsigned I = 0, E = N->getNumValues(); I != E; ++I)
lib/Target/X86/X86InstrInfo.cpp 5667 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
lib/Target/XCore/XCoreISelLowering.cpp 1315 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1));
1366 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1));