Cross Reference: /openjdk7/hotspot/src/share/vm/opto/loopnode.cpp

Lines Matching refs:_child
1176   if( _child ) bits |= _child->set_nest(depth+1);
1307   if( loop->_child ) fix_parent( loop->_child, loop   );
1434   ilt->_child = _child;         // New guy has my children
1435   _child = ilt;                 // Self has new guy as only child
1441   IdealLoopTree **pilt = &_child;
1450         // ilt's '_child' list.  Move the ilt's _child up to replace ilt.
1451         IdealLoopTree **cp = &ilt->_child;
1454         *pilt = ilt->_child;    // Move child up to replace ilt
1456         ilt = ilt->_child;      // Repeat using new ilt
1457         continue;               // do not advance over ilt->_child
1462     pilt = &ilt->_child;        // Advance to next
1466   if( _child ) fix_parent( _child, this );
1541   if( _child ) result |= _child->beautify_loops( phase );
1634   IdealLoopTree* ch = _child;
1635   if (_child) _child->check_safepts(visited, stack);
1681     if (_child != NULL && !has_call && !has_local_ncsfpt) {
1801   if (!_child) {
1846   if (_child) _child->counted_loop( phase );
1903   if (_child) _child->dump();
1911     if (loop->_child != NULL) {
1914       if( loop->_child ) log_loop_tree(root, loop->_child, log);
1934     if( loop->_child ) log_loop_tree(root, loop->_child, log);
1945   if (loop->_child) { // child
1946     collect_potentially_useful_predicates(loop->_child, useful_predicates);
1982     collect_potentially_useful_predicates(_ltree_root->_child, useful_predicates);
2141   if( !_ltree_root->_child && !_verify_only ) C->set_has_loops(false);
2166   if( !_verify_me && !_verify_only && _ltree_root->_child ) {
2168     if( _ltree_root->_child->beautify_loops( this ) ) {
2170       _ltree_root->_child = NULL;
2335     _ltree_root->_child->loop_predication(this);
2351     _ltree_root->_child->iteration_split( this, worklist );
2538     IdealLoopTree **pp = &loop->_parent->_child;
2595   if (_child != NULL)  _child->verify_tree(loop->_child, this);
2600   if (!Compile::current()->major_progress() && _child == NULL) {
2963       l->_next = p->_child;     // Put self on parents 'next child'
2964       p->_child = l;            // Make self as first child of parent
3476       if( !chosen_loop->_child )       // Inner loop?
3558   if( !chosen_loop->_child )   // Inner loop?
3746   if (_curnt->_child != NULL) {
3747     _curnt = _curnt->_child;