/openjdk7/hotspot/src/share/vm/opto/ |
H A D | regalloc.hpp | 64 debug_only( if( n->_idx >= _node_regs_max_index ) n->dump(); ); 65 assert( n->_idx < _node_regs_max_index, "Exceeded _node_regs array"); 66 return _node_regs[n->_idx].first(); 69 debug_only( if( n->_idx >= _node_regs_max_index ) n->dump(); ); 70 assert( n->_idx < _node_regs_max_index, "Exceeded _node_regs array"); 71 return _node_regs[n->_idx].second(); 117 assert( n->_idx < _node_regs_max_index, "Exceeded _node_regs array"); 118 OptoReg::Name first = _node_regs[n->_idx].first(); 119 OptoReg::Name second = _node_regs[n->_idx].second();
|
H A D | lcm.cpp | 237 Block *cb = cfg->_bbs[mach->_idx]; 262 Block *inb = cfg->_bbs[mach->in(j)->_idx]; 272 Block *mb = cfg->_bbs[mach->_idx]; 291 b = cfg->_bbs[b->pred(1)->_idx]; // Move up to predecessor block 304 cfg->_bbs[mach->_idx]->_dom_depth < cfg->_bbs[best->_idx]->_dom_depth ) { 319 Block *valb = cfg->_bbs[val->_idx]; 324 cfg->_bbs.map(val->_idx,this); 330 cfg->_bbs[n->_idx]->find_remove(n); 332 cfg->_bbs.map(n->_idx,thi [all...] |
H A D | loopUnswitch.cpp | 144 LoopNode* head_clone = old_new[head->_idx]->as_Loop(); 180 Node* use_clone = old_new[use->_idx]; 189 IfNode* unswitch_iff_clone = old_new[unswitch_iff->_idx]->as_If(); 197 Node *n_clone = old_new[n->_idx]; 204 head->_idx, unswitch_iff->_idx, 205 old_new[head->_idx]->_idx, unswitch_iff_clone->_idx); 241 assert(old_new[head->_idx] [all...] |
H A D | matcher.hpp | 103 return _nodes.at(n->_idx) != NULL; 107 return _nodes.at(n->_idx); 111 _nodes.map(n->_idx, nn); 140 bool is_shared( Node *n ) { return _shared.test(n->_idx) != 0; } 141 void set_shared( Node *n ) { _shared.set(n->_idx); } 142 bool is_visited( Node *n ) { return _visited.test(n->_idx) != 0; } 143 void set_visited( Node *n ) { _visited.set(n->_idx); } 144 bool is_dontcare( Node *n ) { return _dontcare.test(n->_idx) != 0; } 145 void set_dontcare( Node *n ) { _dontcare.set(n->_idx); } 465 return _new2old_map[new_node->_idx]; [all...] |
H A D | gcm.cpp | 69 _bbs.map(n->_idx, b); 78 Block* buse = _bbs[use->_idx]; 82 _bbs.map(use->_idx, b); // Re-insert in this block 100 Block *pb = _bbs[in0->_idx]; // Block-projection already has basic block 129 if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited 130 if( n->pinned() && !_bbs.lookup(n->_idx) ) { // Pinned? Nail it down! 137 Block *b = _bbs[input->_idx]; // Basic block of controlling input 165 Block* inb = bbs[inn->_idx]; 184 Block* inb = bbs[inn->_idx]; 209 visited.set(C->top()->_idx); [all...] |
H A D | output.hpp | 164 return (&_node_bundling_base[n->_idx]); 168 return (_node_bundling_limit > n->_idx); 172 return (_node_bundling_limit > n->_idx && _node_bundling_base[n->_idx].starts_bundle());
|
H A D | coalesce.cpp | 85 uint lrg = Find_compress(_names[n->_idx]); 86 _names.map(n->_idx,lrg); 109 if( n->_idx >= _names.Size() ) return 0; // not mapped, usual for debug dump 110 return Find_const( _names[n->_idx] ); 129 _names.extend(x->_idx,lrg); 139 Block *bcon = _cfg._bbs[con->_idx]; 149 _cfg._bbs.map( kills->_idx, b ); 191 tty->print("L%d/N%d ",r,n->_idx); 203 tty->print("B%d ", _phc._cfg._bbs[b->pred(j)->_idx]->_pre_order); 313 if( n->_idx < _uniqu [all...] |
H A D | loopnode.hpp | 212 void set_pre_loop (CountedLoopNode *main) { assert(is_normal_loop(),""); _loop_flags |= Pre ; _main_idx = main->_idx; } 214 void set_post_loop (CountedLoopNode *main) { assert(is_normal_loop(),""); _loop_flags |= Post; _main_idx = main->_idx; } 544 int is_visited( Node *n ) const { return _preorders[n->_idx]; } 548 _preorders[n->_idx] = (pre_order<<1); 551 int get_preorder( Node *n ) const { assert( is_visited(n), "" ); return _preorders[n->_idx]>>1; } 555 int is_postvisited( Node *n ) const { assert( is_visited(n), "" ); return _preorders[n->_idx]&1; } 558 void set_postvisited( Node *n ) { assert( !is_postvisited( n ), "" ); _preorders[n->_idx] |= 1; } 562 bool has_ctrl( Node *n ) const { return ((intptr_t)_nodes[n->_idx]) & 1; } 606 bool has_node( Node* n ) const { return _nodes[n->_idx] != NULL; } 617 _nodes.map( n->_idx, (Nod [all...] |
H A D | domgraph.cpp | 109 Block *b = _bbs[whead->in(j)->_idx]; 436 uint b = dfsorder[whead->in(j)->_idx]; 466 assert( !visited.test(whead->in(i)->_idx), 490 NTarjan *w = &ntarjan[dfsorder[C->root()->_idx]]; 501 _idom[t->_control->_idx] = tdom->_control; // Set immediate dominator 505 _idom[C->root()->_idx] = NULL; // Root 509 _idom [C->top()->_idx] = C->root(); 510 _dom_depth[C->top()->_idx] = 1; 528 dfsorder[b->_idx] = dfsnum; // Cache parent's dfsnum for a later use 533 if( !visited.test_set(b->_idx) ) { // Tes [all...] |
H A D | loopopts.cpp | 155 if (x->_idx >= old_unique) { // Found a new, unplaced node? 1031 visited.set(n->_idx); // first, mark node as visited 1041 if (use->outcnt() != 0 && !visited.test_set(use->_idx)) { 1260 old_new.map( old->_idx, nnn ); 1270 Node *nnn = old_new[old->_idx]; 1273 set_ctrl(nnn, old_new[get_ctrl(old)->_idx]); 1277 set_idom( nnn, old_new[idom(old)->_idx], dd ); 1286 nnn->set_req(j, old_new[n->_idx]); 1291 Node *newhead = old_new[loop->_head->_idx]; 1306 Node* nnn = old_new[old->_idx]; [all...] |
H A D | loopPredicate.cpp | 466 _invariant.set(n->_idx); 479 assert(_visited.test(n->_idx), "must be"); 491 assert(_visited.test(in->_idx), "must have visited input"); 492 if (!_invariant.test(in->_idx)) { // bad guy 498 _invariant.set(n->_idx); // I am a invariant too 503 if (m != NULL && !_visited.test_set(m->_idx)) { 514 assert(_invariant.test(n->_idx), "must be invariant"); 516 _old_new.map(n->_idx, n); 533 _old_new.map(n->_idx, n_cl); 538 n_cl->set_req(i, _old_new[in->_idx]); [all...] |
H A D | node.cpp | 60 // will repeat those of _idx. In case this is somehow pathological, 63 int bump = (int)(_idx - new_debug_idx) % mod; 71 if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) { 72 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx); 137 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range"); 143 // Fix up _idx to meet asserts. 144 if (_idx > _outcnt) _idx = _outcnt; 159 assert(that._idx [all...] |
H A D | block.cpp | 241 Block* guard = bbs[pred(i)->_idx]; 278 else st->print("N%d", head()->_idx); 291 Block *p = ((*bbs)[pred(i)->_idx]); 315 Block *p = (*bbs)[s->_idx]; 320 st->print("N%d ", s->_idx ); 331 const Block *bx = (*bbs)[loop->in(LoopNode::LoopBackControl)->_idx]; 333 bx = (*bbs)[bx->pred(1)->_idx]; 389 _broot = _bbs[_root->_idx]; 425 if (!visited.test_set(x->_idx)) { // Visit this block once 444 _bbs.map(p->_idx,b [all...] |
H A D | output.cpp | 81 bbs.map( prolog->_idx, entry ); 82 bbs.map( start->_idx, NULL ); // start is no longer in any block 121 bbs.map(epilog->_idx, b); 122 //_regalloc->set_bad(epilog->_idx); // Already initialized this way. 256 _cfg->_bbs.map( zap->_idx, b ); 634 ObjectValue* sv = Compile::sv_for_node_id(objs, spobj->_idx); 639 sv = new ObjectValue(spobj->_idx, 807 return (_node_bundling_limit > n->_idx && 808 _node_bundling_base[n->_idx].starts_bundle()); 909 scval = Compile::sv_for_node_id(objs, spobj->_idx); [all...] |
H A D | escape.hpp | 139 const int _idx; // Cached ideal node's _idx member in class:PointsToNode 172 _idx(n->_idx), 181 int idx() const { return _idx; } 371 _nodes.at_put(n->_idx, ptn); 506 PointsToNode* ptn = ptnode_adr(to->_idx); 516 add_edge(ptnode_adr(n->_idx), ptn); 555 _node_map.map(from->_idx, to);
|
H A D | regalloc.cpp | 99 _node_oops.set(n->_idx); 105 return _node_oops.test(n->_idx) != 0;
|
H A D | live.cpp | 96 uint r = _names[n->_idx]; 103 uint nkidx = nk->_idx; 117 uint r = _names[b->_nodes[k-1]->_idx]; 124 Block *p = _cfg._bbs[b->pred(l)->_idx]; 129 add_liveout( p, _names[b->_nodes[k-1]->in(l)->_idx], first_pass ); 146 add_liveout( _cfg._bbs[b->pred(l)->_idx], delta, first_pass ); 270 tty->print("L%d/", _names[b->_nodes[i]->_idx] );
|
H A D | phaseX.hpp | 198 const Type* t = _types.fast_lookup(n->_idx); 205 return _types.fast_lookup(n->_idx); 210 _types.map(n->_idx, t); 217 assert(_types[n->_idx] == NULL, "must set the initial type just once"); 218 _types.map(n->_idx, n->bottom_type()); 223 if (n->_idx >= _types.Size()) 224 _types.map(n->_idx, NULL); // Grow the types array as needed.
|
H A D | escape.cpp | 47 phantom_obj = ptnode_adr(C->top()->_idx)->as_JavaObject(); 50 assert(oop_null->_idx < nodes_size(), "should be created already"); 52 null_obj = ptnode_adr(oop_null->_idx)->as_JavaObject(); 55 assert(noop_null->_idx < nodes_size(), "should be created already"); 128 PointsToNode* ptn = ptnode_adr(n->_idx); 253 PointsToNode* ptn = ptnode_adr(n->_idx); 296 assert((ptnode_adr(adr->_idx) == NULL || 297 ptnode_adr(adr->_idx)->as_Field()->is_oop()), "sanity"); 310 uint n_idx = n->_idx; 349 PointsToNode* ptn_base = ptnode_adr(base->_idx); [all...] |
H A D | chaitin.cpp | 66 tty->print("N%d ", _defs->at(i)->_idx); 72 else tty->print("Def: N%d ",_def->_idx); 540 _names.map( n->_idx, rm.is_NotEmpty() ? lr_counter++ : 0 ); 590 if( _spilled_once.test(n->_idx) ) { 592 if( _spilled_twice.test(n->_idx) ) 808 _cfg._bbs[n->in(k)->_idx]->_freq > 1000*b->_freq ) { 1424 if( _spilled_once.test(src->_idx) ) { 1425 _spilled_once.set(dst->_idx); 1427 if( _spilled_twice.test(src->_idx) ) { 1428 _spilled_twice.set(dst->_idx); [all...] |
H A D | idealGraphPrinter.cpp | 411 print_prop("idx", node->_idx); 417 Block *block = C->cfg()->_bbs[node->_idx]; 469 print_prop("old_node_idx", old->_idx); 579 Node_Notes* notes = C->node_notes_at(node->_idx); 608 while (dorig && temp_set->test_set(dorig->_idx)) { 609 dorigStream.print("%d ", dorig->_idx); 636 visited.test_set(start->_idx); 656 if (!visited.test_set(p->_idx)) { 664 if (!visited.test_set(n->in(i)->_idx)) {
|
H A D | loopTransform.cpp | 164 tty->print_cr("compute_profile_trip_cnt lp: %d cnt: %f\n", head->_idx, trip_cnt); 321 dominated_by( old_new[prev->_idx], n ); 512 Node* new_entry = old_new[head->in(LoopNode::LoopBackControl)->_idx]; 518 Node* new_exit_value = old_new[old->in(LoopNode::LoopBackControl)->_idx]; 530 Node* new_head = old_new[head->_idx]; 547 Node *nnn = old_new[old->_idx]; 829 if (visited.test_set(n->_idx)) { 830 Node *x = clones.find(n->_idx); 839 assert(clones.find(n->_idx) == NULL, "dead loop"); 841 clones.push(x, n->_idx); [all...] |
H A D | node.hpp | 257 // Puts initial values in all Node fields except _idx. 258 // Returns the initial value for _idx, which cannot 296 const node_idx_t _idx; member in class:Node 478 const node_idx_t* ref = &_idx; 1014 tty->print("%4d: %-17s", _idx, Name()); 1017 tty->print(" %4d", in(i)->_idx); 1097 uint _idx; member in class:DUIterator 1112 { _idx = 0; debug_only(sample(node)); } 1120 { _idx++; VDUI_ONLY(verify_increment()); } 1123 { VDUI_ONLY(verify_resync()); --_idx; } [all...] |
H A D | loopnode.cpp | 250 if( _nodes[n->_idx] ) return; 603 //_loop.map(trip_count->_idx,loop(limit)); 612 //_loop.map(limit->_idx,limit_loop); 642 //_loop.map(limit->_idx,limit_loop); 866 if (is_main_loop()) st->print("main of N%d", _idx); 1553 visited.set(_tail->_idx); 1570 if (!visited.test_set(in->_idx) && is_member(_phase->get_loop(in))) { 1763 tty->print("Parallel IV: %d ", phi2->_idx); 1856 tty->print("Loop: N%d/N%d ",_head->_idx,_tail->_idx); [all...] |
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciMethodBlocks.hpp | 67 int _idx; member in class:ciBlock 97 int index() const { return _idx; }
|