HomeSort by relevance Sort by last modified time
    Searched refs:MatchedComplexPatterns (Results 1 - 2 of 2) sorted by null

  /external/swiftshader/third_party/LLVM/utils/TableGen/
DAGISelMatcherGen.cpp 77 /// MatchedComplexPatterns - This maintains a list of all of the
83 unsigned>, 2> MatchedComplexPatterns;
259 MatchedComplexPatterns.push_back(std::make_pair(N, 0));
486 for (unsigned i = 0, e = MatchedComplexPatterns.size(); i != e; ++i) {
487 const TreePatternNode *N = MatchedComplexPatterns[i].first;
490 MatchedComplexPatterns[i].second = NextRecordedOperandNo;
540 for (unsigned i = 0, e = MatchedComplexPatterns.size(); i != e; ++i)
541 if (MatchedComplexPatterns[i].first->getName() == N->getName()) {
542 SlotNo = MatchedComplexPatterns[i].second;
    [all...]
  /external/llvm/utils/TableGen/
DAGISelMatcherGen.cpp 78 /// MatchedComplexPatterns - This maintains a list of all of the
82 unsigned>, 2> MatchedComplexPatterns;
275 MatchedComplexPatterns.push_back(std::make_pair(N, InputOperand));
299 MatchedComplexPatterns.push_back(NodeAndOpNum);
523 for (unsigned i = 0, e = MatchedComplexPatterns.size(); i != e; ++i) {
524 const TreePatternNode *N = MatchedComplexPatterns[i].first;
538 unsigned RecNodeEntry = MatchedComplexPatterns[i].second;
    [all...]

Completed in 8271 milliseconds