HomeSort by: relevance | last modified time | path
    Searched refs:getNumValues (Results 1 - 25 of 52) sorted by relevancy

1 2 3

  /src/external/apache2/llvm/dist/llvm/include/llvm/Option/
Arg.h 111 unsigned getNumValues() const { return Values.size(); }
121 for (unsigned i = 0, e = getNumValues(); i != e; ++i)
  /src/external/bsd/openldap/dist/contrib/ldapc++/src/
LDAPAttribute.h 147 int getNumValues() const;
LDAPAttribute.cpp 146 int LDAPAttribute::getNumValues() const{
147 DEBUG(LDAP_DEBUG_TRACE,"LDAPAttribute::getNumValues()" << endl);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
LegalizeTypes.cpp 82 for (unsigned i = 0, e = Node.getNumValues(); i != e; ++i) {
239 for (unsigned i = 0, NumResults = N->getNumValues(); i < NumResults; ++i) {
374 assert(N->getNumValues() == M->getNumValues() &&
376 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i)
452 for (unsigned i = 0, NumVals = Node.getNumValues(); i < NumVals; ++i)
676 assert(N->getNumValues() == M->getNumValues() &&
678 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
930 assert(Results.size() == N->getNumValues() &
    [all...]
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));
291 InGlue = SDValue(Lead, Lead->getNumValues() - 1);
300 InGlue = SDValue(Load, Load->getNumValues() - 1);
382 while (N->getValueType(N->getNumValues()-1) == MVT::Glue) {
383 SDValue GlueVal(N, N->getNumValues()-1);
574 NodeNumDefs = std::min(Node->getNumValues(), NRegDefs);
ResourcePriorityQueue.cpp 96 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
330 for (unsigned i = 0, e = SU->getNode()->getNumValues(); i != e; ++i) {
442 ResCount += (PriorityTwo + (ScaleThree*N->getNumValues()));
478 for (unsigned i = 0, e = ScegN->getNumValues(); i != e; ++i) {
548 NodeNumDefs = std::min(N->getNumValues(), TID.getNumDefs());
LegalizeVectorOps.cpp 222 assert(Op->getNumValues() == Result->getNumValues() &&
225 for (unsigned i = 0, e = Op->getNumValues(); i != e; ++i)
233 assert(Results.size() == Op->getNumValues() &&
554 if (Node->getNumValues() == 1) {
561 assert((Node->getNumValues() == Res->getNumValues()) &&
565 for (unsigned I = 0, E = Node->getNumValues(); I != E; ++I)
601 assert(Node->getNumValues() == 1 &&
736 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i
    [all...]
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();
SelectionDAGPrinter.cpp 41 return ((const SDNode *) Node)->getNumValues();
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());
2063 int NP = (int)Priority - SU->getNode()->getNumValues();
2310 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
2552 unsigned RNumVals = right->getNode()->getNumValues();
2556 unsigned LNumVals = left->getNode()->getNumValues();
2892 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
SelectionDAGISel.cpp 2143 unsigned FlagResNo = N->getNumValues()-1;
2251 EVT VT = Root->getValueType(Root->getNumValues()-1);
2257 VT = Root->getValueType(Root->getNumValues()-1);
2374 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
2376 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
2476 unsigned NTMNumResults = Node->getNumValues();
2498 unsigned ResNumResults = Res->getNumValues();
3646 assert(i < NodeToMatch->getNumValues() &&
3666 if (NodeToMatch->getValueType(NodeToMatch->getNumValues() - 1) ==
3669 ReplaceUses(SDValue(NodeToMatch, NodeToMatch->getNumValues() - 1)
    [all...]
LegalizeFloatTypes.cpp 849 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1795 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1823 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue();
1826 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue();
1831 OutputChain = Tmp1->getNumValues() > 1 ? Tmp1.getValue(1) : SDValue();
1834 OutputChain = Tmp2->getNumValues() > 1 ? Tmp2.getValue(1) : SDValue();
2895 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
InstrEmitter.cpp 48 unsigned N = Node->getNumValues();
1041 if (Node->getValueType(Node->getNumValues()-1) == MVT::Glue) {
LegalizeDAG.cpp 207 assert(Old->getNumValues() == New->getNumValues() &&
230 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i) {
967 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1257 if (Node->getNumValues() == 1) {
1270 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
2738 Results.append(Node->getNumValues() - 1,
2820 for (unsigned i = 0; i < Node->getNumValues(); i++)
SelectionDAGDumper.cpp 546 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
SelectionDAG.cpp 792 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
932 assert(N->getNumValues() == 1 && "Too many results!");
945 assert(N->getNumValues() == 1 && "Too many results!");
1027 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Glue &&
8465 assert(Node->getNumValues() == 2 && "Unexpected number of results!");
8936 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 &&
8987 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
8998 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
9000 assert((i < To->getNumValues()) && "Invalid To location");
9042 if (From->getNumValues() == 1) // Handle the simple case efficiently
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Option/
Arg.cpp 106 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
  /src/external/apache2/llvm/dist/clang/lib/Driver/
SanitizerArgs.cpp 678 if (Arg->getNumValues() == 1 &&
1170 for (int i = 0, n = A->getNumValues(); i != n; ++i) {
1193 for (int i = 0, n = A->getNumValues(); i != n; ++i) {
1246 for (int i = 0, n = A->getNumValues(); i != n; ++i) {
  /src/external/apache2/llvm/dist/llvm/lib/MC/
MCFragment.cpp 420 << " NumValues:" << FF->getNumValues();
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARC/
ARCISelLowering.cpp 495 CFRegNode.push_back(ArgIn.getValue(ArgIn->getNumValues() - 1));
540 CFRegNode.push_back(Val.getValue(Val->getNumValues() - 1));
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVISelDAGToDAG.cpp 166 unsigned NF = Node->getNumValues() - 1;
206 unsigned NF = Node->getNumValues() - 2; // Do not count VL and Chain.
251 unsigned NF = Node->getNumValues() - 1;
  /src/external/apache2/llvm/dist/llvm/include/llvm/MC/
MCFragment.h 354 const MCExpr &getNumValues() const { return NumValues; }
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsSEISelDAGToDAG.cpp 876 assert(Node->getNumValues() == 2);
948 assert(Node->getNumValues() == 1);
  /src/external/apache2/llvm/dist/clang/lib/Driver/ToolChains/
Hexagon.cpp 555 assert(A->getNumValues() != 0);
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SelectionDAGNodes.h 955 unsigned getNumValues() const { return NumValues; }
1104 assert((!Node || !ResNo || ResNo < Node->getNumValues()) &&

Completed in 93 milliseconds

1 2 3