Lines Matching refs:ChainNodesMatched
1524 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1534 if (!ChainNodesMatched.empty()) {
1539 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1540 SDNode *ChainNode = ChainNodesMatched[i];
1724 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1730 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1731 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1739 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1742 SDNode *N = ChainNodesMatched[i];
1748 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1757 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1766 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
2012 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2081 // ChainNodesMatched - If a pattern matches nodes that have input/output
2085 SmallVector<SDNode*, 3> ChainNodesMatched;
2191 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2436 assert(ChainNodesMatched.empty() &&
2442 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2446 if (ChainNodesMatched.back() != NodeToMatch &&
2448 ChainNodesMatched.clear();
2453 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2472 assert(ChainNodesMatched.empty() &&
2479 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2483 if (ChainNodesMatched.back() != NodeToMatch &&
2485 ChainNodesMatched.clear();
2491 if (ChainNodesMatched.empty())
2495 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2677 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2732 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2772 ChainNodesMatched.clear();
