/external/clang/include/clang/Driver/ |
Arg.h | 85 unsigned getNumValues() const { return Values.size(); } 95 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
|
/external/clang/lib/Driver/ |
Arg.cpp | 85 for (unsigned i = 0, e = getNumValues(); i != e; ++i) 92 for (unsigned i = 0, e = getNumValues(); i != e; ++i) 100 for (unsigned i = 0, e = getNumValues(); i != e; ++i) { 111 for (unsigned i = 1, e = getNumValues(); i != e; ++i) 117 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
|
ArgList.cpp | 178 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
|
Driver.cpp | 178 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) 190 A->getNumValues() == 2 && 522 for (unsigned j = 0; j < A->getNumValues(); ++j) { [all...] |
Tools.cpp | [all...] |
ToolChains.cpp | 768 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) { [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypes.cpp | 80 for (unsigned i = 0, e = I->getNumValues(); i != e; ++i) { 222 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) { 332 assert(N->getNumValues() == M->getNumValues() && 334 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 412 for (unsigned i = 0, NumVals = I->getNumValues(); i < NumVals; ++i) 551 for (i = 0, e = N->getNumValues(); i != e; ++i) 609 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) 709 assert(N->getNumValues() == M->getNumValues() & [all...] |
ScheduleDAGSDNodes.cpp | 134 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return; 136 for (unsigned I = 0, E = N->getNumValues(); I != E; ++I) 235 SDValue InGlue = SDValue(Lead, Lead->getNumValues() - 1); 243 InGlue = SDValue(Load, Load->getNumValues() - 1); 324 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) { 325 SDValue GlueVal(N, N->getNumValues()-1); 506 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs);
|
ScheduleDAGFast.cpp | 217 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { 241 unsigned NumVals = N->getNumValues(); 242 unsigned OldNumVals = SU->getNode()->getNumValues();
|
SelectionDAGISel.cpp | [all...] |
InstrEmitter.cpp | 43 unsigned N = Node->getNumValues(); 706 Node->getValueType(Node->getNumValues()-1) == MVT::Glue) { 764 else if (Node->getValueType(Node->getNumValues()-1) != MVT::Glue) 772 if (Node->getValueType(Node->getNumValues()-1) != MVT::Glue) [all...] |
SelectionDAGPrinter.cpp | 46 return ((const SDNode *) Node)->getNumValues();
|
LegalizeVectorOps.cpp | 108 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i) 276 assert(Op.getNode()->getNumValues() == 1 &&
|
ScheduleDAGRRList.cpp | 789 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) { 813 unsigned NumVals = N->getNumValues(); 814 unsigned OldNumVals = SU->getNode()->getNumValues(); [all...] |
LegalizeDAG.cpp | 240 SDValue TheChain(Node, Node->getNumValues()-1); 246 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i) [all...] |
SelectionDAG.cpp | 506 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i) 653 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue && 756 assert(N->getNumValues() == 1 && "Too many results!"); 769 assert(N->getNumValues() == 1 && "Too many results!"); [all...] |
LegalizeTypes.h | 134 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) [all...] |
LegalizeFloatTypes.cpp | 603 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && [all...] |
LegalizeVectorTypes.cpp | 336 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && [all...] |
DAGCombiner.cpp | 575 assert(N->getNumValues() == NumTo && "Broken CombineTo call!"); [all...] |
LegalizeIntegerTypes.cpp | [all...] |
TargetLowering.cpp | [all...] |
SelectionDAGBuilder.cpp | [all...] |
/external/llvm/include/llvm/CodeGen/ |
SelectionDAGNodes.h | 581 /// getNumValues - Return the number of values defined/returned by this 584 unsigned getNumValues() const { return NumValues; } [all...] |
/external/llvm/lib/Target/ARM/ |
ARMISelDAGToDAG.cpp | [all...] |