/openjdk7/hotspot/src/share/vm/opto/ |
H A D | ifnode.cpp | 69 static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) { argument 94 const TypePtr *tp = igvn->type(con1)->isa_ptr(); 100 igvn->C->set_has_split_ifs(true); // Has chance for split-if 106 const Type *t = cmp2->Value(igvn); 108 igvn->remove_dead_node(cmp2); 222 PhaseGVN *phase = igvn; 241 Node *region_c = new (igvn->C) RegionNode(req_c + 1); 244 Node *region_x = new (igvn->C) RegionNode(len - req_c); 270 igvn->register_new_node_with_optimizer( region_c ); 271 igvn 529 adjust_check(Node* proj, Node* range, Node* index, int flip, jint off_lo, PhaseIterGVN* igvn) argument 1105 PhaseIterGVN *igvn = phase->is_IterGVN(); local [all...] |
H A D | cfgnode.cpp | 73 PhaseIterGVN *igvn = phase->is_IterGVN(); local 86 // igvn->hash_delete( phi ); 88 igvn->hash_delete( region ); 91 igvn->hash_delete( r ); 478 PhaseIterGVN *igvn = phase->is_IterGVN(); local 490 igvn->hash_delete(n); // Yank from hash before hacking edges 491 n->set_req_X(i,NULL,igvn);// Correct DU info 526 PhaseIterGVN *igvn = phase->is_IterGVN(); local 533 assert( igvn->eqv(n->in(0), this), "" ); 537 igvn 559 PhaseIterGVN *igvn = phase->is_IterGVN(); local 1403 split_once(PhaseIterGVN *igvn, Node *phi, Node *val, Node *n, Node *newn) argument 1620 PhaseIterGVN *igvn = phase->is_IterGVN(); local 1951 PhaseIterGVN *igvn = phase->is_IterGVN(); local [all...] |
H A D | escape.cpp | 38 ConnectionGraph::ConnectionGraph(Compile * C, PhaseIterGVN *igvn) : argument 43 _igvn(igvn), 49 Node* oop_null = igvn->zerocon(T_OBJECT); 54 Node* noop_null = igvn->zerocon(T_NARROWOOP); 79 void ConnectionGraph::do_analysis(Compile *C, PhaseIterGVN *igvn) { argument 85 Node* oop_null = igvn->zerocon(T_OBJECT); 86 Node* noop_null = igvn->zerocon(T_NARROWOOP); 87 ConnectionGraph* congraph = new(C->comp_arena()) ConnectionGraph(C, igvn); 95 igvn->hash_delete(oop_null); 97 igvn 102 PhaseGVN* igvn = _igvn; local 309 PhaseGVN* igvn = _igvn; local 1685 PhaseIterGVN* igvn = _igvn; local 2216 PhaseGVN* igvn = _igvn; local 2297 PhaseGVN* igvn = _igvn; local 2349 PhaseGVN* igvn = _igvn; local 2430 PhaseGVN* igvn = _igvn; local 2508 PhaseGVN* igvn = _igvn; local 2703 PhaseIterGVN *igvn = _igvn; local [all...] |
H A D | addnode.cpp | 146 PhaseIterGVN *igvn = phase->is_IterGVN(); local 147 if( igvn ) { 148 set_req_X(2,x2,igvn); 149 set_req_X(1,x1,igvn); 192 PhaseIterGVN *igvn = phase->is_IterGVN(); local 193 if (add2->outcnt() == 0 && igvn) { 195 igvn->_worklist.push(add2); 601 PhaseIterGVN *igvn = phase->is_IterGVN(); local 602 if( igvn ) { 603 set_req_X(Address,address,igvn); 632 PhaseIterGVN *igvn = phase->is_IterGVN(); local [all...] |
H A D | macro.hpp | 120 PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn) { argument
|
H A D | loopPredicate.cpp | 300 PhaseIterGVN* igvn) { 305 new_predicate_proj = igvn->create_new_if_for_predicate(predicate_proj, new_entry, reason); 312 Node* opq = new (igvn->C) Opaque1Node(igvn->C, predicate_proj->in(0)->in(1)->in(1)->in(1)); 313 igvn->C->add_predicate_opaq(opq); 315 Node* bol = new (igvn->C) Conv2BNode(opq); 320 igvn->register_new_node_with_optimizer(opq); 321 igvn->register_new_node_with_optimizer(bol); 323 igvn->hash_delete(iff); 344 PhaseIterGVN* igvn) { 297 clone_predicate(ProjNode* predicate_proj, Node* new_entry, Deoptimization::DeoptReason reason, PhaseIdealLoop* loop_phase, PhaseIterGVN* igvn) argument 341 clone_loop_predicates(Node* old_entry, Node* new_entry, bool clone_limit_check, PhaseIdealLoop* loop_phase, PhaseIterGVN* igvn) argument [all...] |
H A D | compile.cpp | 1782 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) { argument 1787 igvn.replace_node(n, n->in(1)); 1820 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) { argument 1826 gvn->replace_with(&igvn); 1847 igvn = PhaseIterGVN(gvn); 1851 void Compile::inline_incrementally(PhaseIterGVN& igvn) { argument 1865 PhaseIdealLoop ideal_loop( igvn, false, true ); 1876 inline_incrementally_one(igvn); 1880 igvn.optimize(); 1885 assert( igvn 3577 should_optimize_expensive_nodes(PhaseIterGVN &igvn) argument 3610 cleanup_expensive_nodes(PhaseIterGVN &igvn) argument [all...] |
H A D | loopnode.hpp | 481 // Put loop body on igvn work list 756 PhaseIdealLoop( PhaseIterGVN &igvn) : argument 758 _igvn(igvn), 777 PhaseIdealLoop( PhaseIterGVN &igvn, bool do_split_ifs, bool skip_loop_opts = false) : argument 779 _igvn(igvn), 787 PhaseIdealLoop( PhaseIterGVN &igvn, const PhaseIdealLoop *verify_me) : argument 789 _igvn(igvn), 798 static void verify(PhaseIterGVN& igvn) { argument 800 PhaseIdealLoop v(igvn); 891 PhaseIterGVN* igvn); [all...] |
H A D | phaseX.cpp | 768 PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn, const char *dummy ) : PhaseGVN(igvn,dummy), _worklist( ), argument 775 PhaseIterGVN::PhaseIterGVN( PhaseIterGVN *igvn ) : PhaseGVN(igvn), 776 _worklist( igvn->_worklist ), 777 _stack( igvn->_stack ), 778 _delay_transform(igvn->_delay_transform) 1395 PhaseCCP::PhaseCCP( PhaseIterGVN *igvn ) : PhaseIterGVN(igvn) { 1590 // Put users of 'n' onto worklist for second igvn transfor [all...] |
H A D | node.cpp | 699 bool Node::is_unreachable(PhaseIterGVN &igvn) const { 701 return outcnt() == 0 || igvn.type(this) == Type::TOP || in(0)->is_top(); 1218 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) { 1222 // Can't put ResourceMark here since igvn->_worklist uses the same arena 1226 Node *top = igvn->C->top(); 1237 igvn->hash_delete(use); // Yank from hash table prior to mod 1248 igvn->_worklist.push(use); 1255 igvn->hash_delete(dead); 1256 igvn->_worklist.remove(dead); 1257 igvn [all...] |
H A D | phaseX.hpp | 429 PhaseIterGVN( PhaseIterGVN *igvn ); // Used by CCP constructor 431 PhaseIterGVN( PhaseIterGVN *igvn, const char *dummy ); // Used after +VerifyOpto 522 PhaseCCP( PhaseIterGVN *igvn ); // Compute conditional constants
|
H A D | memnode.cpp | 157 PhaseIterGVN *igvn = phase->is_IterGVN(); local 160 if (is_instance && igvn != NULL && result->is_Phi()) { 170 result = mphi->split_out_instance(t_adr, igvn); 243 PhaseIterGVN *igvn = phase->is_IterGVN(); 245 if (ctl && can_reshape && igvn != NULL) { 254 if (igvn->_worklist.member(ctl) || 255 (bol != NULL && igvn->_worklist.member(bol)) || 256 (cmp != NULL && igvn->_worklist.member(cmp)) ) { 268 if (can_reshape && igvn != NULL && igvn 1345 PhaseIterGVN *igvn = phase->is_IterGVN(); local 1470 PhaseIterGVN *igvn = phase->is_IterGVN(); local 2885 PhaseIterGVN* igvn = phase->is_IterGVN(); local 3055 PhaseIterGVN* igvn = phase->is_IterGVN(); local [all...] |
H A D | compile.hpp | 390 void cleanup_expensive_nodes(PhaseIterGVN &igvn); 631 void cleanup_loop_predicates(PhaseIterGVN &igvn); 637 bool should_optimize_expensive_nodes(PhaseIterGVN &igvn); 854 void inline_incrementally_one(PhaseIterGVN& igvn); 855 void inline_incrementally(PhaseIterGVN& igvn);
|
H A D | loopnode.cpp | 696 // Int to prevent (almost) infinite recursion in igvn 958 // and let igvn optimizer convert this division. 1186 PhaseIterGVN &igvn = phase->_igvn; local 1205 igvn.hash_delete(old_phi); // Yank from hash before hacking edges 1218 Node *p2 = igvn.hash_find_insert(p); // Look for a CSE 1223 igvn.register_new_node_with_optimizer(p, old_phi); 1231 Node *id_old_phi = old_phi->Identity( &igvn ); 1238 igvn.rehash_node_delayed(use); 1250 igvn._worklist.push(old_phi); 1260 igvn 1268 PhaseIterGVN &igvn = phase->_igvn; local 1386 PhaseIterGVN &igvn = phase->_igvn; local 1476 PhaseIterGVN &igvn = phase->_igvn; local [all...] |
H A D | cfgnode.hpp | 160 PhiNode* split_out_instance(const TypePtr* at, PhaseIterGVN *igvn) const; 349 void dominated_by(Node* prev_dom, PhaseIterGVN* igvn);
|
H A D | escape.hpp | 575 ConnectionGraph(Compile *C, PhaseIterGVN *igvn); 581 static void do_analysis(Compile *C, PhaseIterGVN *igvn);
|
H A D | divnode.cpp | 326 PhaseIterGVN* igvn = phase->is_IterGVN(); local 327 if (igvn != NULL) { 328 igvn->remove_dead_node(hook);
|
H A D | callnode.cpp | 1177 PhaseIterGVN *igvn = phase->is_IterGVN(); local 1196 igvn->register_new_node_with_optimizer(nproj); 1205 igvn->replace_node(catchproj, phase->C->top());
|
H A D | node.hpp | 378 bool is_unreachable(PhaseIterGVN &igvn) const; 463 void set_req_X( uint i, Node *n, PhaseIterGVN *igvn );
|