11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "memory/allocation.inline.hpp"
27 #include "opto/block.hpp"
28 #include "opto/cfgnode.hpp"
29 #include "opto/chaitin.hpp"
30 #include "opto/coalesce.hpp"
31 #include "opto/connode.hpp"
32 #include "opto/indexSet.hpp"
33 #include "opto/machnode.hpp"
34 #include "opto/matcher.hpp"
35 #include "opto/regmask.hpp"
36
37 #ifndef PRODUCT
38 void PhaseCoalesce::dump(Node *n) const {
39 // Being a const function means I cannot use 'Find'
40 uint r = _phc._lrg_map.find(n);
41 tty->print("L%d/N%d ",r,n->_idx);
42 }
43
44 void PhaseCoalesce::dump() const {
45 // I know I have a block layout now, so I can print blocks in a loop
46 for( uint i=0; i<_phc._cfg.number_of_blocks(); i++ ) {
47 uint j;
48 Block* b = _phc._cfg.get_block(i);
49 // Print a nice block header
50 tty->print("B%d: ",b->_pre_order);
51 for( j=1; j<b->num_preds(); j++ )
|
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "memory/allocation.inline.hpp"
27 #include "opto/block.hpp"
28 #include "opto/cfgnode.hpp"
29 #include "opto/chaitin.hpp"
30 #include "opto/coalesce.hpp"
31 #include "opto/constnode.hpp"
32 #include "opto/indexSet.hpp"
33 #include "opto/machnode.hpp"
34 #include "opto/matcher.hpp"
35 #include "opto/regmask.hpp"
36
37 #ifndef PRODUCT
38 void PhaseCoalesce::dump(Node *n) const {
39 // Being a const function means I cannot use 'Find'
40 uint r = _phc._lrg_map.find(n);
41 tty->print("L%d/N%d ",r,n->_idx);
42 }
43
44 void PhaseCoalesce::dump() const {
45 // I know I have a block layout now, so I can print blocks in a loop
46 for( uint i=0; i<_phc._cfg.number_of_blocks(); i++ ) {
47 uint j;
48 Block* b = _phc._cfg.get_block(i);
49 // Print a nice block header
50 tty->print("B%d: ",b->_pre_order);
51 for( j=1; j<b->num_preds(); j++ )
|