Lines Matching defs:RootNode

135     cl::desc("Limit the number of times for the same StoreNode and RootNode "
183     /// Map from candidate StoreNode to the pair of RootNode and count.
185     /// with the same RootNode bail out in dependence check. If we have seen
187     /// consider the StoreNode with the same RootNode as store merging
790     /// have indirect dependency through their operands. RootNode is the
795         SDNode *RootNode);
20497   SDNode *RootNode = St->getChain().getNode();
20499   if (ChainsWithoutMergeableStores.contains(RootNode))
20502   // Check if the pair of StoreNode and the RootNode already bail out many
20505                                         SDNode *RootNode) -> bool {
20508            RootCount->second.first == RootNode &&
20520           !OverLimitInDependenceCheck(OtherStore, RootNode))
20527   if (auto *Ldn = dyn_cast<LoadSDNode>(RootNode)) {
20528     RootNode = Ldn->getChain().getNode();
20530     if (ChainsWithoutMergeableStores.contains(RootNode))
20532     for (auto I = RootNode->use_begin(), E = RootNode->use_end();
20544     for (auto I = RootNode->use_begin(), E = RootNode->use_end();
20549   return RootNode;
20557     SDNode *RootNode) {
20566   // RootNode is a predecessor to all candidates so we need not search
20567   // past it. Add RootNode (peeking through TokenFactors). Do not count
20570   Worklist.push_back(RootNode);
20609       // If the searching bail out, record the StoreNode and RootNode in the
20614         if (RootCount.first == RootNode)
20617           RootCount = {RootNode, 1};
20666     EVT MemVT, SDNode *RootNode, bool AllowVectors) {
20775                                                   RootNode)) {
20794     EVT MemVT, SDNode *RootNode) {
20845                                                   RootNode)) {
20864                                        SDNode *RootNode, bool AllowVectors,
21051                                                   RootNode)) {
21181   SDNode *RootNode = getStoreMergeCandidates(St, StoreNodes);
21219                                              MemVT, RootNode, AllowVectors);
21224                                             MemVT, RootNode);
21229                                          MemVT, RootNode, AllowVectors,
21240     ChainsWithoutMergeableStores.insert(RootNode);