Lines Matching defs:ChainNodesMatched

2682     SmallVectorImpl<SDNode *> &ChainNodesMatched, bool isMorphNodeTo) {
2687   if (!ChainNodesMatched.empty()) {
2692     for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2693       SDNode *ChainNode = ChainNodesMatched[i];
2713             std::replace(ChainNodesMatched.begin(), ChainNodesMatched.end(), N,
2739 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
2748   if (ChainNodesMatched.size() == 1)
2749     return ChainNodesMatched[0]->getOperand(0);
2767   for (auto *N : ChainNodesMatched) {
2786   for (auto *N : ChainNodesMatched)
2793   return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
3182   /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
3339   // ChainNodesMatched - If a pattern matches nodes that have input/output
3343   SmallVector<SDNode*, 3> ChainNodesMatched;
3448       NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
3923       assert(ChainNodesMatched.empty() &&
3929       ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3935       if (ChainNodesMatched.back() != NodeToMatch &&
3937         ChainNodesMatched.clear();
3942       InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3961       assert(ChainNodesMatched.empty() &&
3968         ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3974         if (ChainNodesMatched.back() != NodeToMatch &&
3976           ChainNodesMatched.clear();
3982       if (ChainNodesMatched.empty())
3986       InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
4176       // such nodes must have a chain, it suffices to check ChainNodesMatched.
4180           llvm::any_of(ChainNodesMatched, [this](SDNode *N) {
4207           auto &Chain = ChainNodesMatched;
4271         UpdateChains(Res, InputChain, ChainNodesMatched, true);
4305       UpdateChains(NodeToMatch, InputChain, ChainNodesMatched, false);
4354         ChainNodesMatched.clear();