Searched refs:BlockList (Results 1 - 16 of 16) sorted by relevance

/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_CFGPrinter.hpp47 static void print_cfg(BlockList* blocks, const char* name, bool do_print_HIR, bool do_print_LIR);
H A Dc1_GraphBuilder.hpp48 BlockList* _bci2block;
57 BlockList* _work_list;
67 // get the continuation point from the BlockList instead of
108 BlockList* bci2block() const { return _bci2block; }
109 void set_bci2block(BlockList* bci2block) { _bci2block = bci2block; }
191 BlockList* bci2block() const { return scope_data()->bci2block(); }
359 void push_root_scope(IRScope* scope, BlockList* bci2block, BlockBegin* start);
403 static void sort_top_into_worklist(BlockList* worklist, BlockBegin* top);
H A Dc1_IR.cpp399 static void compute(BlockList* blocks) {
423 BlockList* _linear_scan_order; // the resulting list of blocks in correct order
429 BlockList _loop_end_blocks; // list of all loop end blocks collected during count_edges
431 BlockList _work_list; // temporary list (used in mark_loops and compute_order)
482 BlockList* linear_scan_order() const { return _linear_scan_order; }
845 _linear_scan_order = new BlockList(_num_blocks);
1167 define_array(BlockListArray, BlockList*)
1173 BlockList* _blocks;
1183 _blocks = new BlockList();
1196 BlockList* pred
[all...]
H A Dc1_Instruction.hpp141 class BlockList: public _BlockList { class in inherits:_BlockList
143 BlockList(): _BlockList() {} function in class:BlockList
144 BlockList(const int size): _BlockList(size) {} function in class:BlockList
145 BlockList(const int size, BlockBegin* init): _BlockList(size, init) {} function in class:BlockList
1141 static void substitute(BlockList& list, BlockBegin* old_block, BlockBegin* new_block);
1536 BlockList _successors; // the successors of this block
1537 BlockList _predecessors; // the predecessors of this block
1541 BlockList _exception_handlers; // the exception handlers potentially invoked by this block
1614 BlockList* successors() { return &_successors; }
1732 BlockList* _su
[all...]
H A Dc1_Instruction.cpp311 void StateSplit::substitute(BlockList& list, BlockBegin* old_block, BlockBegin* new_block) {
636 BlockList& list = sux->_predecessors;
892 // Implementation of BlockList
894 void BlockList::iterate_forward (BlockClosure* closure) {
900 void BlockList::iterate_backward(BlockClosure* closure) {
905 void BlockList::blocks_do(void f(BlockBegin*)) {
910 void BlockList::values_do(ValueVisitor* f) {
916 void BlockList::print(bool cfg_only, bool live_only) {
933 BlockList* sux = NULL;
938 BlockList* su
[all...]
H A Dc1_LinearScan.hpp141 BlockList _cached_blocks; // cached list with all blocks in linear-scan order (only correct if original list keeps unchanged)
827 static void optimize(BlockList* code);
834 BlockList _original_preds;
839 void reorder_short_loop(BlockList* code, BlockBegin* header_block, int header_idx);
840 void reorder_short_loops(BlockList* code);
844 void delete_empty_blocks(BlockList* code);
846 void delete_unnecessary_jumps(BlockList* code);
847 void delete_jumps_to_return(BlockList* code);
849 DEBUG_ONLY(void verify(BlockList* code);)
853 static void optimize(BlockList* cod
[all...]
H A Dc1_CFGPrinter.cpp74 void print_cfg(BlockList* blocks, const char* name);
91 void CFGPrinter::print_cfg(BlockList* blocks, const char* name, bool do_print_HIR, bool do_print_LIR) {
346 void CFGPrinterOutput::print_cfg(BlockList* blocks, const char* name) {
H A Dc1_IR.hpp290 BlockList* _code; // the blocks in code generation order w/ use counts
307 BlockList* code() const { return _code; }
320 BlockList* linear_scan_order() { assert(_code != NULL, "not computed"); return _code; }
H A Dc1_LIRAssembler.hpp53 BlockList _branch_target_blocks;
150 void emit_code(BlockList* hir);
H A Dc1_ValueMap.cpp275 BlockList _loop_blocks;
353 BlockList* blocks = ir->linear_scan_order();
H A Dc1_Optimizer.cpp547 BlockList* _work_list; // Basic blocks to visit
575 BlockList* work_list() { return _work_list; }
595 , _work_list(new BlockList()) {
1148 BlockList blocks(nblocks);
H A Dc1_GraphBuilder.cpp46 BlockList _blocks; // internal list of all blocks
47 BlockList* _bci2block; // mapping from bci to blocks for GraphBuilder
89 BlockList* bci2block() const { return _bci2block; }
99 , _bci2block(new BlockList(scope->method()->code_size(), NULL))
769 _work_list = new BlockList();
792 void GraphBuilder::sort_top_into_worklist(BlockList* worklist, BlockBegin* top) {
1301 BlockList* sux = new BlockList(l + 1, NULL);
1343 BlockList* sux = new BlockList(
[all...]
H A Dc1_LinearScan.cpp3390 BlockList _work_list; // all blocks that must be processed
5800 void EdgeMoveOptimizer::optimize(BlockList* code) {
6044 void ControlFlowOptimizer::optimize(BlockList* code) {
6062 void ControlFlowOptimizer::reorder_short_loop(BlockList* code, BlockBegin* header_block, int header_idx) {
6093 void ControlFlowOptimizer::reorder_short_loops(BlockList* code) {
6152 void ControlFlowOptimizer::delete_empty_blocks(BlockList* code) {
6200 void ControlFlowOptimizer::delete_unnecessary_jumps(BlockList* code) {
6258 void ControlFlowOptimizer::delete_jumps_to_return(BlockList* code) {
6312 void ControlFlowOptimizer::verify(BlockList* code) {
H A Dc1_LIRAssembler.cpp207 void LIR_Assembler::emit_code(BlockList* hir) {
H A Dc1_LIR.cpp1483 void print_LIR(BlockList* blocks) {
1620 void print_LIR(BlockList* blocks) {
H A Dc1_LIR.hpp32 class BlockList;
2163 void print_LIR(BlockList* blocks);

Completed in 154 milliseconds