Lines Matching defs:RootNode

134     cl::desc("Limit the number of times for the same StoreNode and RootNode "
186     /// Map from candidate StoreNode to the pair of RootNode and count.
188     /// with the same RootNode bail out in dependence check. If we have seen
190     /// consider the StoreNode with the same RootNode as store merging
801     /// have indirect dependency through their operands. RootNode is the
806         SDNode *RootNode);
20940   SDNode *RootNode = St->getChain().getNode();
20942   if (ChainsWithoutMergeableStores.contains(RootNode))
20945   // Check if the pair of StoreNode and the RootNode already bail out many
20948                                         SDNode *RootNode) -> bool {
20951            RootCount->second.first == RootNode &&
20963           !OverLimitInDependenceCheck(OtherStore, RootNode))
20970   if (auto *Ldn = dyn_cast<LoadSDNode>(RootNode)) {
20971     RootNode = Ldn->getChain().getNode();
20973     if (ChainsWithoutMergeableStores.contains(RootNode))
20975     for (auto I = RootNode->use_begin(), E = RootNode->use_end();
20988     for (auto I = RootNode->use_begin(), E = RootNode->use_end();
20993   return RootNode;
21001     SDNode *RootNode) {
21010   // RootNode is a predecessor to all candidates so we need not search
21011   // past it. Add RootNode (peeking through TokenFactors). Do not count
21014   Worklist.push_back(RootNode);
21053       // If the searching bail out, record the StoreNode and RootNode in the
21058         if (RootCount.first == RootNode)
21061           RootCount = {RootNode, 1};
21110     EVT MemVT, SDNode *RootNode, bool AllowVectors) {
21219                                                   RootNode)) {
21238     EVT MemVT, SDNode *RootNode) {
21289                                                   RootNode)) {
21308                                        SDNode *RootNode, bool AllowVectors,
21495                                                   RootNode)) {
21625   SDNode *RootNode = getStoreMergeCandidates(St, StoreNodes);
21663                                              MemVT, RootNode, AllowVectors);
21668                                             MemVT, RootNode);
21673                                          MemVT, RootNode, AllowVectors,
21684     ChainsWithoutMergeableStores.insert(RootNode);