Lines Matching defs:Root
1842 SDNode *Root, SmallPtrSetImpl<SDNode*> &Visited,
1867 if (Use == ImmedUse || Use == Root)
1869 assert(N != Root);
1874 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
1881 /// operand node N of U during instruction selection that starts at Root.
1883 SDNode *Root) const {
1889 /// U can be folded during instruction selection that starts at Root.
1890 bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
1895 // If Root use can somehow reach N through a path that that doesn't contain
1897 // diagram, Root can reach N through X. If N is folded into into Root, then
1907 // [Root*] //
1911 // If Root produces glue, then it gets (even more) interesting. Since it
1922 // [Root*] | //
1932 // If GU (glue use) indirectly reaches N (the load), and Root folds N
1939 EVT VT = Root->getValueType(Root->getNumValues()-1);
1941 SDNode *GU = findGlueUse(Root);
1944 Root = GU;
1945 VT = Root->getValueType(Root->getNumValues()-1);
1956 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
2122 if (User->getOpcode() == ISD::HANDLENODE) // Root of the graph.