Mercurial > hg > graal-compiler
comparison src/share/vm/opto/idealGraphPrinter.cpp @ 12071:adb9a7d94cb5
8023003: Cleanup the public interface to PhaseCFG
Summary: public methods that don't need to be public should be private.
Reviewed-by: kvn, twisti
author | adlertz |
---|---|
date | Fri, 16 Aug 2013 10:23:55 +0200 |
parents | d1034bd8cefc |
children | 650868c062a9 |
comparison
equal
deleted
inserted
replaced
12070:afbe18ae0905 | 12071:adb9a7d94cb5 |
---|---|
414 #endif | 414 #endif |
415 | 415 |
416 if (C->cfg() != NULL) { | 416 if (C->cfg() != NULL) { |
417 Block* block = C->cfg()->get_block_for_node(node); | 417 Block* block = C->cfg()->get_block_for_node(node); |
418 if (block == NULL) { | 418 if (block == NULL) { |
419 print_prop("block", C->cfg()->_blocks[0]->_pre_order); | 419 print_prop("block", C->cfg()->get_block(0)->_pre_order); |
420 } else { | 420 } else { |
421 print_prop("block", block->_pre_order); | 421 print_prop("block", block->_pre_order); |
422 } | 422 } |
423 } | 423 } |
424 | 424 |
635 nodeStack.push(start); | 635 nodeStack.push(start); |
636 visited.test_set(start->_idx); | 636 visited.test_set(start->_idx); |
637 if (C->cfg() != NULL) { | 637 if (C->cfg() != NULL) { |
638 // once we have a CFG there are some nodes that aren't really | 638 // once we have a CFG there are some nodes that aren't really |
639 // reachable but are in the CFG so add them here. | 639 // reachable but are in the CFG so add them here. |
640 for (uint i = 0; i < C->cfg()->_blocks.size(); i++) { | 640 for (uint i = 0; i < C->cfg()->number_of_blocks(); i++) { |
641 Block *b = C->cfg()->_blocks[i]; | 641 Block* block = C->cfg()->get_block(i); |
642 for (uint s = 0; s < b->_nodes.size(); s++) { | 642 for (uint s = 0; s < block->_nodes.size(); s++) { |
643 nodeStack.push(b->_nodes[s]); | 643 nodeStack.push(block->_nodes[s]); |
644 } | 644 } |
645 } | 645 } |
646 } | 646 } |
647 | 647 |
648 while(nodeStack.length() > 0) { | 648 while(nodeStack.length() > 0) { |
696 head(EDGES_ELEMENT); | 696 head(EDGES_ELEMENT); |
697 walk_nodes(node, true, &temp_set); | 697 walk_nodes(node, true, &temp_set); |
698 tail(EDGES_ELEMENT); | 698 tail(EDGES_ELEMENT); |
699 if (C->cfg() != NULL) { | 699 if (C->cfg() != NULL) { |
700 head(CONTROL_FLOW_ELEMENT); | 700 head(CONTROL_FLOW_ELEMENT); |
701 for (uint i = 0; i < C->cfg()->_blocks.size(); i++) { | 701 for (uint i = 0; i < C->cfg()->number_of_blocks(); i++) { |
702 Block *b = C->cfg()->_blocks[i]; | 702 Block* block = C->cfg()->get_block(i); |
703 begin_head(BLOCK_ELEMENT); | 703 begin_head(BLOCK_ELEMENT); |
704 print_attr(BLOCK_NAME_PROPERTY, b->_pre_order); | 704 print_attr(BLOCK_NAME_PROPERTY, block->_pre_order); |
705 end_head(); | 705 end_head(); |
706 | 706 |
707 head(SUCCESSORS_ELEMENT); | 707 head(SUCCESSORS_ELEMENT); |
708 for (uint s = 0; s < b->_num_succs; s++) { | 708 for (uint s = 0; s < block->_num_succs; s++) { |
709 begin_elem(SUCCESSOR_ELEMENT); | 709 begin_elem(SUCCESSOR_ELEMENT); |
710 print_attr(BLOCK_NAME_PROPERTY, b->_succs[s]->_pre_order); | 710 print_attr(BLOCK_NAME_PROPERTY, block->_succs[s]->_pre_order); |
711 end_elem(); | 711 end_elem(); |
712 } | 712 } |
713 tail(SUCCESSORS_ELEMENT); | 713 tail(SUCCESSORS_ELEMENT); |
714 | 714 |
715 head(NODES_ELEMENT); | 715 head(NODES_ELEMENT); |
716 for (uint s = 0; s < b->_nodes.size(); s++) { | 716 for (uint s = 0; s < block->_nodes.size(); s++) { |
717 begin_elem(NODE_ELEMENT); | 717 begin_elem(NODE_ELEMENT); |
718 print_attr(NODE_ID_PROPERTY, get_node_id(b->_nodes[s])); | 718 print_attr(NODE_ID_PROPERTY, get_node_id(block->_nodes[s])); |
719 end_elem(); | 719 end_elem(); |
720 } | 720 } |
721 tail(NODES_ELEMENT); | 721 tail(NODES_ELEMENT); |
722 | 722 |
723 tail(BLOCK_ELEMENT); | 723 tail(BLOCK_ELEMENT); |