Lines Matching defs:ChainNodesMatched

2635     SmallVectorImpl<SDNode *> &ChainNodesMatched, bool isMorphNodeTo) {
2640   if (!ChainNodesMatched.empty()) {
2645     for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2646       SDNode *ChainNode = ChainNodesMatched[i];
2666             std::replace(ChainNodesMatched.begin(), ChainNodesMatched.end(), N,
2692 HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
2701   if (ChainNodesMatched.size() == 1)
2702     return ChainNodesMatched[0]->getOperand(0);
2720   for (auto *N : ChainNodesMatched) {
2739   for (auto *N : ChainNodesMatched)
2746   return CurDAG->getNode(ISD::TokenFactor, SDLoc(ChainNodesMatched[0]),
3137   /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
3291   // ChainNodesMatched - If a pattern matches nodes that have input/output
3295   SmallVector<SDNode*, 3> ChainNodesMatched;
3400       NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
3876       assert(ChainNodesMatched.empty() &&
3882       ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3888       if (ChainNodesMatched.back() != NodeToMatch &&
3890         ChainNodesMatched.clear();
3895       InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
3914       assert(ChainNodesMatched.empty() &&
3921         ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode());
3927         if (ChainNodesMatched.back() != NodeToMatch &&
3929           ChainNodesMatched.clear();
3935       if (ChainNodesMatched.empty())
3939       InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
4128       // such nodes must have a chain, it suffices to check ChainNodesMatched.
4132           llvm::any_of(ChainNodesMatched, [this](SDNode *N) {
4159           auto &Chain = ChainNodesMatched;
4225         UpdateChains(Res, InputChain, ChainNodesMatched, true);
4259       UpdateChains(NodeToMatch, InputChain, ChainNodesMatched, false);
4308         ChainNodesMatched.clear();