Mercurial > hg > truffle

comparison src/share/vm/c1/c1_IR.cpp @ 10973:ef57c43512d6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8014431: cleanup warnings indicated by the -Wunused-value compiler option on linux Reviewed-by: dholmes, coleenp Contributed-by: jeremymanson@google.com, calvin.cheung@oracle.com
author ccheung
date Thu, 13 Jun 2013 22:02:40 -0700
parents 46f6f063b272
children 6b0fd0964b87 de6a9e811145
comparison
equal deleted inserted replaced
10969:a837fa3d3f86 10973:ef57c43512d6
504 _work_list(8), 504 _work_list(8),
505 _linear_scan_order(NULL), // initialized later with correct size 505 _linear_scan_order(NULL), // initialized later with correct size
506 _loop_map(0, 0), // initialized later with correct size 506 _loop_map(0, 0), // initialized later with correct size
507 _compilation(c) 507 _compilation(c)
508 { 508 {
509 TRACE_LINEAR_SCAN(2, "***** computing linear-scan block order"); 509 TRACE_LINEAR_SCAN(2, tty->print_cr("***** computing linear-scan block order"));
510 510
511 init_visited(); 511 init_visited();
512 count_edges(start_block, NULL); 512 count_edges(start_block, NULL);
513 513
514 if (compilation()->is_profiling()) { 514 if (compilation()->is_profiling()) {
681 } 681 }
682 } 682 }
683 } 683 }
684 684
685 void ComputeLinearScanOrder::assign_loop_depth(BlockBegin* start_block) { 685 void ComputeLinearScanOrder::assign_loop_depth(BlockBegin* start_block) {
686 TRACE_LINEAR_SCAN(3, "----- computing loop-depth and weight"); 686 TRACE_LINEAR_SCAN(3, tty->print_cr("----- computing loop-depth and weight"));
687 init_visited(); 687 init_visited();
688 688
689 assert(_work_list.is_empty(), "work list must be empty before processing"); 689 assert(_work_list.is_empty(), "work list must be empty before processing");
690 _work_list.append(start_block); 690 _work_list.append(start_block);
691 691
866 cur->set_linear_scan_number(_linear_scan_order->length()); 866 cur->set_linear_scan_number(_linear_scan_order->length());
867 _linear_scan_order->append(cur); 867 _linear_scan_order->append(cur);
868 } 868 }
869 869
870 void ComputeLinearScanOrder::compute_order(BlockBegin* start_block) { 870 void ComputeLinearScanOrder::compute_order(BlockBegin* start_block) {
871 TRACE_LINEAR_SCAN(3, "----- computing final block order"); 871 TRACE_LINEAR_SCAN(3, tty->print_cr("----- computing final block order"));
872 872
873 // the start block is always the first block in the linear scan order 873 // the start block is always the first block in the linear scan order
874 _linear_scan_order = new BlockList(_num_blocks); 874 _linear_scan_order = new BlockList(_num_blocks);
875 append_block(start_block); 875 append_block(start_block);
876 876