Lines Matching defs:ChainNodesMatched
2309 SmallVectorImpl<SDNode *> &ChainNodesMatched, bool isMorphNodeTo) {
2314 if (!ChainNodesMatched.empty()) {
2319 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2320 SDNode *ChainNode = ChainNodesMatched[i];
2340 std::replace(ChainNodesMatched.begin(), ChainNodesMatched.end(), N,
2366 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
2375 if (ChainNodesMatched.size() == 1)
2376 return ChainNodesMatched[0]->getOperand(0);
2394 for (auto *N : ChainNodesMatched) {
2413 for (auto *N : ChainNodesMatched)
2420 return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
2725 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2851 // ChainNodesMatched - If a pattern matches nodes that have input/output
2855 SmallVector<SDNode*, 3> ChainNodesMatched;
2959 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
3288 assert(ChainNodesMatched.empty() &&
3294 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3298 if (ChainNodesMatched.back() != NodeToMatch &&
3300 ChainNodesMatched.clear();
3305 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3324 assert(ChainNodesMatched.empty() &&
3331 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3335 if (ChainNodesMatched.back() != NodeToMatch &&
3337 ChainNodesMatched.clear();
3343 if (ChainNodesMatched.empty())
3347 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3468 // such nodes must have a chain, it suffices to check ChainNodesMatched.
3472 for (auto *N : ChainNodesMatched)
3500 auto &Chain = ChainNodesMatched;
3566 UpdateChains(Res, InputChain, ChainNodesMatched, true);
3600 UpdateChains(NodeToMatch, InputChain, ChainNodesMatched, false);
3649 ChainNodesMatched.clear();