123     void getBlockTraversalOrder(BasicBlock *Root, ValueVect &Order);
179       Root      = 0x01,  enumerator
209       if (Flags & Root)  in GepNode()
221     if (GN.Flags & GepNode::Root) {  in operator <<()
247     if (GN.Flags & GepNode::Root)  in operator <<()
324 void HexagonCommonGEP::getBlockTraversalOrder(BasicBlock *Root,  in getBlockTraversalOrder()  argument
330   Order.push_back(Root);  in getBlockTraversalOrder()
331   for (auto *DTN : children<DomTreeNode*>(DT->getNode(Root)))  in getBlockTraversalOrder()
354     N->Flags |= GepNode::Root | InBounds;  in processGepInst()
434     if (N->Flags & GepNode::Root) {  in invert_find_roots()
443 static void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM,  in nodes_for_root()  argument
446     Work.push_back(Root);  in nodes_for_root()
447     Nodes.insert(Root);  in nodes_for_root()
510     bool Root1 = N1->Flags & GepNode::Root;  in node_eq()
511     uint32_t CmpFlags = GepNode::Root | GepNode::Pointer;  in node_eq()
625     if (N->Flags & GepNode::Root)  in common()
837   if (Node->Flags & GepNode::Root)  in isInvariantIn()
871   if (Node->Flags & GepNode::Root) {  in adjustForInvariance()
951   while (is_constant(N) && !(N->Flags & GepNode::Root)) {  in separateChainForNode()
1052   for (GepNode *Root : Roots)  in computeNodePlacement()
1053     recalculatePlacementRec(Root, NCM, Loc);  in computeNodePlacement()
1058     for (GepNode *Root : Roots)  in computeNodePlacement()
1059       adjustForInvariance(Root, NCM, Loc);  in computeNodePlacement()
1065     for (GepNode *Root : Roots)  in computeNodePlacement()
1066       separateConstantChains(Root, NCM, Loc);  in computeNodePlacement()
1084   assert((RN->Flags & GepNode::Root) && "Creating GEP for non-root");  in fabricateGEP()
1158     GepNode *Root = *First, *Last = *First;  in materialize()  local
1194       getAllUsersForNode(Root, Urs, NCM);  in materialize()
1209         CN->Flags |= GepNode::Root;  in materialize()