Lines Matching defs:sux

73   void adjust_exception_edges(BlockBegin* block, BlockBegin* sux) {
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->state();
157 if (sux_phi == NULL || sux_phi->as_Phi() == NULL || sux_phi->as_Phi()->block() != sux) return;
171 for_each_phi_fun(sux, phi,
206 Goto* goto_ = new Goto(sux, state_before, if_->is_safepoint() || t_goto->is_safepoint() || f_goto->is_safepoint());
221 BlockBegin::disconnect_edge(t_block, sux);
225 BlockBegin::disconnect_edge(f_block, sux);
344 BlockBegin* sux = end->default_sux();
345 if (sux->number_of_preds() == 1 && !sux->is_entry_block() && !end->is_safepoint()) {
349 // verify that state at the end of block and at the beginning of sux are equal
350 // no phi functions must be present at beginning of sux
351 ValueStack* sux_state = sux->state();
369 // find instruction before end & append first instruction of sux block
371 Instruction* next = sux->next();
374 sux->disconnect_from_graph();
375 block->set_end(sux->end());
377 for (int k = 0; k < sux->number_of_exception_handlers(); k++) {
378 BlockBegin* xhandler = sux->exception_handler_at(k);
382 assert(xhandler->is_predecessor(sux), "missing predecessor");
383 xhandler->remove_predecessor(sux);
393 _merge_count, block->block_id(), sux->block_id(), sux->state()->stack_size());