| /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 | 198 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
|
| Driver.cpp | 187 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i)
199 A->getNumValues() == 2 &&
572 for (unsigned j = 0; j < A->getNumValues(); ++j) {
[all...] |
| Tools.cpp | [all...] |
| ToolChains.cpp | 810 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) {
328 assert(N->getNumValues() == M->getNumValues() &&
330 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i)
408 for (unsigned i = 0, NumVals = I->getNumValues(); i < NumVals; ++i)
547 for (i = 0, e = N->getNumValues(); i != e; ++i)
605 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i)
705 assert(N->getNumValues() == M->getNumValues() &
[all...] |
| ResourcePriorityQueue.cpp | 96 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
334 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) {
452 ResCount += (PriorityThree + (ScaleThree*N->getNumValues()));
487 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
559 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs());
|
| ScheduleDAGSDNodes.cpp | 142 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return;
144 for (unsigned I = 0, E = N->getNumValues(); I != E; ++I)
243 SDValue InGlue = SDValue(Lead, Lead->getNumValues() - 1);
251 InGlue = SDValue(Load, Load->getNumValues() - 1);
332 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) {
333 SDValue GlueVal(N, N->getNumValues()-1);
514 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...] |
| SelectionDAGPrinter.cpp | 44 return ((const SDNode *) Node)->getNumValues();
|
| LegalizeVectorOps.cpp | 108 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i)
278 assert(Op.getNode()->getNumValues() == 1 &&
|
| ScheduleDAGRRList.cpp | [all...] |
| InstrEmitter.cpp | 43 unsigned N = Node->getNumValues();
764 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) {
[all...] |
| SelectionDAGDumper.cpp | 334 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
|
| SelectionDAG.cpp | 518 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
671 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue &&
774 assert(N->getNumValues() == 1 && "Too many results!");
787 assert(N->getNumValues() == 1 && "Too many results!");
[all...] |
| LegalizeDAG.cpp | 699 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
[all...] |
| LegalizeFloatTypes.cpp | 603 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
[all...] |
| LegalizeTypes.h | 134 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
[all...] |
| LegalizeVectorTypes.cpp | 367 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
[all...] |
| LegalizeIntegerTypes.cpp | [all...] |
| DAGCombiner.cpp | 610 assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
[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...] |
