| /openjdk7/hotspot/src/share/vm/c1/ |
| H A D | c1_Canonicalizer.cpp | 625 static bool is_safepoint(BlockEnd* x, BlockBegin* sux) { argument
627 // to a single successor, sux. Is a safepoint check needed = was the
630 return x->is_safepoint() && (sux->bci() < x->state_before()->bci());
642 BlockBegin* sux; local
644 case If::eql: sux = x->sux_for(true); break;
645 case If::neq: sux = x->sux_for(false); break;
646 case If::lss: sux = x->sux_for(false); break;
647 case If::leq: sux = x->sux_for(true); break;
648 case If::gtr: sux = x->sux_for(false); break;
649 case If::geq: sux
659 BlockBegin* sux = x->x()->as_Constant()->compare(x->cond(), x->y(), local
732 BlockBegin* sux = x->fsux(); local
736 BlockBegin* sux = x->tsux(); local
746 BlockBegin* sux = x->default_sux(); local
775 BlockBegin* sux = x->default_sux(); local
[all...] |
| H A D | c1_IR.cpp | 290 BlockBegin* sux = be->sux_at(i); local
291 if (sux->number_of_preds() >= 2) {
292 blocks.append(new BlockPair(bb, sux));
892 BlockBegin* sux = cur->sux_at(i); local
893 compute_dominator(sux, cur);
894 if (ready_for_processing(sux)) {
895 sort_into_work_list(sux);
900 BlockBegin* sux = cur->exception_handler_at(i); local
901 compute_dominator(sux, cur);
902 if (ready_for_processing(sux)) {
994 BlockBegin* sux = cur->sux_at(j); local
1032 BlockBegin* sux = cur->sux_at(j); local
1226 BlockBegin* sux = be->sux_at(i); local
1239 BlockBegin* sux = block->exception_handler_at(i); local
[all...] |
| H A D | c1_Optimizer.cpp | 73 void adjust_exception_edges(BlockBegin* block, BlockBegin* sux) { argument
74 int e = sux->number_of_exception_handlers();
76 BlockBegin* xhandler = sux->exception_handler_at(i);
79 assert(xhandler->is_predecessor(sux), "missing predecessor");
80 if (sux->number_of_preds() == 0) {
81 // sux is disconnected from graph so disconnect from exception handlers
82 xhandler->remove_predecessor(sux);
133 BlockBegin* sux = t_goto->default_sux();
134 if (sux != f_goto->default_sux()) return;
139 ValueStack* sux_state = sux
344 BlockBegin* sux = end->default_sux(); local
[all...] |
| H A D | c1_Instruction.cpp | 531 BlockBegin* sux = end->sux_at(i); local
532 _successors.append(sux);
533 sux->_predecessors.append(this);
563 BlockBegin* sux = from->sux_at(s); local
564 if (sux == to) {
565 int index = sux->_predecessors.index_of(from);
567 sux->_predecessors.remove_at(index);
606 BlockBegin* BlockBegin::insert_block_between(BlockBegin* sux) { argument
613 Goto* e = new Goto(sux, false);
625 end()->substitute_sux(sux, new_su
933 BlockList* sux = NULL; local
938 BlockList* sux = new BlockList(_begin->number_of_sux()); local
[all...] |
| H A D | c1_Instruction.hpp | 1643 BlockBegin* insert_block_between(BlockBegin* sux);
1664 void add_successor(BlockBegin* sux);
1666 bool is_successor(BlockBegin* sux) const { return _successors.contains(sux); }
1735 BlockList* sux() const { return _sux; }
1737 void set_sux(BlockList* sux) {
1739 assert(sux != NULL, "sux must exist");
1740 for (int i = sux->length() - 1; i >= 0; i--) assert(sux
[all...] |
| H A D | c1_LIRGenerator.cpp | 1015 BlockBegin* sux = bb->sux_at(0); local
1016 assert(sux->number_of_preds() > 0, "invalid CFG");
1019 if (sux->number_of_preds() > 1) {
1023 ValueStack* sux_state = sux->state();
2378 BlockBegin* dest = one_range->sux();
2404 BlockBegin* sux = x->sux_at(0); local
2407 SwitchRange* range = new SwitchRange(key, sux);
2410 if (sux == new_sux) {
2415 if (sux != default_sux) {
2420 sux
2435 BlockBegin* sux = x->sux_at(0); local
[all...] |
| H A D | c1_LIRGenerator.hpp | 51 SwitchRange(int start_key, BlockBegin* sux): _low_key(start_key), _high_key(start_key), _sux(sux) {} argument
56 BlockBegin* sux() const { return _sux; } function in class:SwitchRange
|
| H A D | c1_GraphBuilder.cpp | 466 tty->print(" sux: ");
468 BlockBegin* sux = cur->sux_at(j); local
469 tty->print("B%d ", sux->block_id());
1301 BlockList* sux = new BlockList(l + 1, NULL);
1305 sux->at_put(i, block_at(bci() + sw.dest_offset_at(i)));
1310 sux->at_put(i, block_at(bci() + sw.default_offset()));
1312 Instruction* res = append(new TableSwitch(ipop(), sux, sw.low_key(), state_before, has_bb));
1316 if (sux->at(i) == res->as_Goto()->sux_at(0)) {
1343 BlockList* sux = new BlockList(l + 1, NULL);
1350 sux
2727 BlockBegin* sux = end->sux_at(i); local
[all...] |
| H A D | c1_LinearScan.cpp | 773 // live_out(block) is the union of live_in(sux), for successors sux of block
1775 BlockBegin* sux = block->sux_at(0); local
1778 if (!block_completed.at(pred->linear_scan_number()) && !block_completed.at(sux->linear_scan_number())) {
1779 TRACE_LINEAR_SCAN(3, tty->print_cr("**** optimizing empty block B%d (pred: B%d, sux: B%d)", block->block_id(), pred->block_id(), sux->block_id()));
1782 // directly resolve between pred and sux (without looking at the empty block between)
1783 resolve_collect_mappings(pred, sux, move_resolver);
5995 BlockBegin* sux = block->sux_at(i);
5996 LIR_OpList* sux_instructions = sux
[all...] |
| /openjdk7/hotspot/src/cpu/x86/vm/ |
| H A D | c1_LinearScan_x86.cpp | 1007 tty->print(" sux: "); sux_sim->print(); tty->cr();
1019 // size difference between cur and sux that must be resolved by adding or removing values form the stack
1090 tty->print(" sux: "); sux_sim->print(); tty->cr();
1156 BlockBegin* sux = block->sux_at(0); local
1157 intArray* state = sux->fpu_stack_state();
1182 tty->print_cr("Setting FPU stack state of B%d (merge path)", sux->block_id());
1185 sux->set_fpu_stack_state(state);
1198 BlockBegin* sux = block->sux_at(i); local
1201 for (int j = 0; j < sux->number_of_preds(); j++) {
1202 assert(block == sux
1229 BlockBegin* sux = block->sux_at(i); local
[all...] |