Lines Matching refs:_ltree_root
1982 collect_potentially_useful_predicates(_ltree_root->_child, useful_predicates);
2118 _ltree_root = new IdealLoopTree( this, C->root(), C->root() );
2120 _ltree_root->_has_sfpt = 1;
2141 if( !_ltree_root->_child && !_verify_only ) C->set_has_loops(false);
2162 _ltree_root->set_nest( 0 );
2166 if( !_verify_me && !_verify_only && _ltree_root->_child ) {
2168 if( _ltree_root->_child->beautify_loops( this ) ) {
2170 _ltree_root->_child = NULL;
2179 _ltree_root->set_nest( 0 );
2211 _ltree_root->check_safepts(visited, cisstack);
2234 _ltree_root->counted_loop( this );
2288 _ltree_root->dump();
2297 log_loop_tree(_ltree_root, _ltree_root, C->log());
2304 for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
2335 _ltree_root->_child->loop_predication(this);
2351 _ltree_root->_child->iteration_split( this, worklist );
2394 for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
2410 log_loop_tree(_ltree_root, _ltree_root, C->log());
2435 _ltree_root->verify_tree(loop_verify._ltree_root, NULL);
2856 l = _ltree_root; // Root is the outermost LoopNode
2886 l = _ltree_root; // Oops, found infinite loop
2923 set_loop(C->root(), _ltree_root);
3655 dump( _ltree_root, rpo_list.size(), rpo_list );