Searched refs:getNumValues (Results 1 - 25 of 37) sorted by relevance

12

/freebsd-10.0-release/contrib/llvm/include/llvm/Option/
H A DArg.h96 unsigned getNumValues() const { return Values.size(); } function in class:llvm::opt::Arg
106 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Driver/
H A DArg.h97 unsigned getNumValues() const { return Values.size(); } function in class:clang::driver::Arg
107 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
/freebsd-10.0-release/contrib/llvm/lib/Option/
H A DArg.cpp86 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
93 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
101 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
112 for (unsigned i = 1, e = getNumValues(); i != e; ++i)
118 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
H A DArgList.cpp243 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/Driver/
H A DArg.cpp87 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
94 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
102 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
113 for (unsigned i = 1, e = getNumValues(); i != e; ++i)
119 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
H A DSanitizerArgs.h117 for (unsigned I = 0, N = A->getNumValues(); I != N; ++I) {
197 for (unsigned I = 0, N = A->getNumValues(); I != N; ++I)
H A DArgList.cpp273 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
H A DDriver.cpp174 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i)
193 if (A->getNumValues() == 2)
570 for (unsigned j = 0; j < A->getNumValues(); ++j) {
H A DToolChains.cpp659 for (unsigned i = 0, e = A->getNumValues(); i != e; ++i) {
1539 for (unsigned i = 0, e = (*it)->getNumValues(); i != e; ++i)
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp80 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)
709 assert(N->getNumValues() == M->getNumValues()
[all...]
H A DScheduleDAGSDNodes.cpp175 if (N->getValueType(N->getNumValues() - 1) == MVT::Glue) return false;
177 for (unsigned I = 0, E = N->getNumValues(); I != E; ++I)
191 assert((N->getValueType(N->getNumValues() - 1) == MVT::Glue &&
192 !N->hasAnyUseOfValue(N->getNumValues() - 1)) &&
196 for (unsigned I = 0, E = N->getNumValues()-1; I != E; ++I)
271 InGlue = SDValue(Lead, Lead->getNumValues() - 1);
280 InGlue = SDValue(Load, Load->getNumValues() - 1);
364 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) {
365 SDValue GlueVal(N, N->getNumValues()-1);
547 NodeNumDefs = std::min(Node->getNumValues(), NRegDef
[all...]
H A DResourcePriorityQueue.cpp96 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());
H A DSelectionDAGISel.cpp1477 unsigned FlagResNo = N->getNumValues()-1;
1587 EVT VT = Root->getValueType(Root->getNumValues()-1);
1593 VT = Root->getValueType(Root->getNumValues()-1);
1669 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
1671 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1693 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue &&
1695 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
1903 unsigned NTMNumResults = Node->getNumValues();
1925 unsigned ResNumResults = Res->getNumValues();
2844 assert(i < NodeToMatch->getNumValues()
[all...]
H A DScheduleDAGFast.cpp222 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
246 unsigned NumVals = N->getNumValues();
247 unsigned OldNumVals = SU->getNode()->getNumValues();
728 unsigned NumVals = N->getNumValues();
H A DSelectionDAGPrinter.cpp43 return ((const SDNode *) Node)->getNumValues();
H A DLegalizeVectorOps.cpp133 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i)
320 assert(Op.getNode()->getNumValues() == 1 &&
342 assert(Op.getNode()->getNumValues() == 1 &&
H A DScheduleDAGRRList.cpp946 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
975 unsigned NumVals = N->getNumValues();
976 unsigned OldNumVals = SU->getNode()->getNumValues();
1920 int NP = (int)Priority - SU->getNode()->getNumValues();
2172 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
2420 unsigned RNumVals = right->getNode()->getNumValues();
2424 unsigned LNumVals = left->getNode()->getNumValues();
2761 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
H A DSelectionDAGDumper.cpp338 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
H A DSelectionDAG.cpp541 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
693 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue &&
794 assert(N->getNumValues() == 1 && "Too many results!");
807 assert(N->getNumValues() == 1 && "Too many results!");
5499 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 &&
5546 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
5592 if (From->getNumValues() == 1) // Handle the simple case efficiently.
5634 if (From.getNode()->getNumValues() == 1) {
5967 assert(Value < getNumValues() && "Bad value!");
5986 assert(Value < getNumValues()
[all...]
H A DInstrEmitter.cpp43 unsigned N = Node->getNumValues();
792 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) {
H A DLegalizeFloatTypes.cpp628 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1271 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
H A DLegalizeTypes.h134 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
H A DLegalizeVectorTypes.cpp393 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1082 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
2267 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
H A DLegalizeDAG.cpp1140 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1310 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1324 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
1332 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2830 for (unsigned i = 0; i < Node->getNumValues(); i++)
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DSIISelLowering.cpp292 for (unsigned i = 1, e = Intr->getNumValues(); i != e; ++i)
316 SDValue Chain = SDValue(Result, Result->getNumValues() - 1);
319 for (unsigned i = 1, e = Intr->getNumValues() - 1; i != e; ++i) {
335 SDValue(Intr, Intr->getNumValues() - 1),

Completed in 320 milliseconds

12