Lines Matching refs:ChainNodesMatched
1649 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1657 if (!ChainNodesMatched.empty()) {
1662 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1663 SDNode *ChainNode = ChainNodesMatched[i];
1850 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
1856 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1857 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1865 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1868 SDNode *N = ChainNodesMatched[i];
1874 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1883 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
1892 return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
2138 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2210 // ChainNodesMatched - If a pattern matches nodes that have input/output
2214 SmallVector<SDNode*, 3> ChainNodesMatched;
2320 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
2567 assert(ChainNodesMatched.empty() &&
2573 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2577 if (ChainNodesMatched.back() != NodeToMatch &&
2579 ChainNodesMatched.clear();
2584 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2603 assert(ChainNodesMatched.empty() &&
2610 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
2614 if (ChainNodesMatched.back() != NodeToMatch &&
2616 ChainNodesMatched.clear();
2622 if (ChainNodesMatched.empty())
2626 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2813 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2868 UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched,
2908 ChainNodesMatched.clear();
