Lines Matching defs:entry
135 // generate exception entry blocks
140 BlockBegin* entry = make_block_at(h->handler_bci(), NULL);
141 entry->set(BlockBegin::exception_entry_flag);
142 h->set_entry_block(entry);
191 BlockBegin* entry = h->entry_block();
192 assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set");
193 assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set");
196 if (!current->is_successor(entry)) {
197 current->add_successor(entry);
198 entry->increment_total_preds();
211 // start a new block at the subroutine entry at mark it with special flag
1912 // logic or the unverified entry point. Profiling of calls
2106 // found an entry in the value map, so just return it.
2217 BlockBegin* entry = h->entry_block();
2218 if (entry == block()) {
2224 assert(entry->bci() == h->handler_bci(), "must match");
2225 assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2229 assert(entry->state() == NULL || cur_state->total_locks_size() == entry->state()->total_locks_size(), "locks do not match");
2246 if (!entry->try_merge(cur_state)) {
2251 int phi_operand = entry->add_exception_state(cur_state);
2253 // add entry to the list of xhandlers of this block
2254 _block->add_exception_handler(entry);
2256 // add back-edge from xhandler entry to this block
2257 if (!entry->is_predecessor(_block)) {
2258 entry->add_predecessor(_block);
2268 assert(!entry->is_set(BlockBegin::was_visited_flag), "entry must not be visited yet");
2269 cur_scope_data->add_to_work_list(entry);
2463 // first thing in the exception entry block should be the exception object.
2751 // we're about to parse the osr entry block, so make sure
2755 // this is no longer the osr entry block, so clear it.
2830 BlockBegin* GraphBuilder::header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) {
2831 assert(entry->is_set(f), "entry/flag mismatch");
2833 BlockBegin* h = new BlockBegin(entry->bci());
2837 BlockEnd* g = new Goto(entry, false);
2838 l->set_next(g, entry->bci());
2842 ValueStack* s = state->copy(ValueStack::StateAfter, entry->bci()); // can use copy since stack is empty (=> no phis)
2843 assert(s->stack_is_empty(), "must have empty stack at entry point");
2905 // the osr entry has no values for locals
3012 // determine entry points and bci2block mapping
3021 // setup state for std entry
3129 assert(osr_block->is_set(BlockBegin::was_visited_flag),"osr entry must have been visited for osr compile");
3131 // check if osr entry point has empty stack - we cannot handle non-empty stacks at osr entry points
3133 BAILOUT("stack not empty at OSR entry point");
3551 // Inline the entry of a synchronized method as a monitor enter and
3806 // the entry bci for the callee instead of the call site bci.
3839 // one block (and we didn't have to Goto its entry), then we snip