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

Lines Matching defs:igvn
1782 void Compile::cleanup_loop_predicates(PhaseIterGVN &igvn) {
1787     igvn.replace_node(n, n->in(1));
1820 void Compile::inline_incrementally_one(PhaseIterGVN& igvn) {
1826   gvn->replace_with(&igvn);
1847   igvn = PhaseIterGVN(gvn);
1851 void Compile::inline_incrementally(PhaseIterGVN& igvn) {
1865         PhaseIdealLoop ideal_loop( igvn, false, true );
1876     inline_incrementally_one(igvn);
1880     igvn.optimize();
1885   assert( igvn._worklist.size() == 0, "should be done with igvn" );
1890     initial_gvn()->replace_with(&igvn);
1901     igvn = PhaseIterGVN(gvn);
1903     igvn.optimize();
1932   PhaseIterGVN igvn(initial_gvn());
1935     igvn.optimize();
1942   inline_incrementally(igvn);
1950   cleanup_expensive_nodes(igvn);
1957       PhaseIdealLoop ideal_loop( igvn, false, true );
1961     ConnectionGraph::do_analysis(this, &igvn);
1966     igvn.optimize();
1973       PhaseMacroExpand mexp(igvn);
1975       igvn.set_delay_transform(false);
1977       igvn.optimize();
1992       PhaseIdealLoop ideal_loop( igvn, true );
2000       PhaseIdealLoop ideal_loop( igvn, false );
2008       PhaseIdealLoop ideal_loop( igvn, false );
2015       PhaseIdealLoop::verify(igvn);
2021   PhaseCCP ccp( &igvn );
2034     igvn = ccp;
2035     igvn.optimize();
2049       PhaseIdealLoop ideal_loop( igvn, true);
2060     PhaseIdealLoop::verify(igvn);
2065     PhaseMacroExpand  mex(igvn);
2072  } // (End scope of igvn; run destructor if necessary for asserts.)
3577 bool Compile::should_optimize_expensive_nodes(PhaseIterGVN &igvn) {
3588     if (!n->is_unreachable(igvn)) {
3610 void Compile::cleanup_expensive_nodes(PhaseIterGVN &igvn) {
3636       igvn.hash_delete(n);
3638       igvn.hash_insert(n);
3645     igvn.hash_delete(n);
3647     igvn.hash_insert(n);