Lines Matching refs:ChainNodesMatched
2295 SmallVectorImpl<SDNode *> &ChainNodesMatched, bool isMorphNodeTo) {
2300 if (!ChainNodesMatched.empty()) {
2305 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2306 SDNode *ChainNode = ChainNodesMatched[i];
2326 std::replace(ChainNodesMatched.begin(), ChainNodesMatched.end(), N,
2352 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
2361 if (ChainNodesMatched.size() == 1)
2362 return ChainNodesMatched[0]->getOperand(0);
2380 for (auto *N : ChainNodesMatched) {
2399 for (auto *N : ChainNodesMatched)
2406 return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
2711 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
2840 // ChainNodesMatched - If a pattern matches nodes that have input/output
2844 SmallVector<SDNode*, 3> ChainNodesMatched;
2948 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
3277 assert(ChainNodesMatched.empty() &&
3283 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3287 if (ChainNodesMatched.back() != NodeToMatch &&
3289 ChainNodesMatched.clear();
3294 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3313 assert(ChainNodesMatched.empty() &&
3320 ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3324 if (ChainNodesMatched.back() != NodeToMatch &&
3326 ChainNodesMatched.clear();
3332 if (ChainNodesMatched.empty())
3336 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3457 // such nodes must have a chain, it suffices to check ChainNodesMatched.
3461 for (auto *N : ChainNodesMatched)
3489 auto &Chain = ChainNodesMatched;
3555 UpdateChains(Res, InputChain, ChainNodesMatched, true);
3589 UpdateChains(NodeToMatch, InputChain, ChainNodesMatched, false);
3638 ChainNodesMatched.clear();