Lines Matching refs:ChainNodesMatched
1507 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1517 if (!ChainNodesMatched.empty()) {
1522 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1523 SDNode *ChainNode = ChainNodesMatched[i];
1707 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1713 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1714 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1722 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1725 SDNode *N = ChainNodesMatched[i];
1731 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1740 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1749 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1995 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2064 // ChainNodesMatched - If a pattern matches nodes that have input/output
2068 SmallVector<SDNode*, 3> ChainNodesMatched;
2174 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2419 assert(ChainNodesMatched.empty() &&
2425 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2429 if (ChainNodesMatched.back() != NodeToMatch &&
2431 ChainNodesMatched.clear();
2436 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2455 assert(ChainNodesMatched.empty() &&
2462 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2466 if (ChainNodesMatched.back() != NodeToMatch &&
2468 ChainNodesMatched.clear();
2474 if (ChainNodesMatched.empty())
2478 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2660 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2715 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2755 ChainNodesMatched.clear();
