Cross Reference: /openjdk7/hotspot/src/share/vm/c1/c1

Lines Matching defs:be
9  * This code is distributed in the hope that it will be useful, but WITHOUT
58 // Returns whether a particular exception type can be caught.  Also
61 // is known to be exactly that class or it might throw a subtype.
63   // the type is unknown so be conservative
75     // if it's unknown it might be catchable
80     // then it can be caught.
85       // If the type isn't exactly known then it can also be caught by
89       // throw bar can be caught by catch foo, catch bar, and catch
90       // Exception, however it can't be caught by any handlers without
119   assert(entry_block() == other->entry_block(), "entry_block must be equal when entry_pco is equal");
154   assert(method->holder()->is_loaded() , "method holder must be loaded");
184 // Stack must be NON-null
192   assert(_stack != NULL, "must be non null");
286     BlockEnd* be = bb->end();
287     int nos = be->number_of_sux();
290         BlockBegin* sux = be->sux_at(i);
337       // note: a) if the instruction is pinned, it will be handled by compute_use_count
541     assert(is_visited(cur), "block must be visisted when block is active");
550     // an exception edge. Because such edges are usually critical edges which cannot be split, the
551     // loop must be excluded here from processing.
616     assert(loop_end->is_set(BlockBegin::linear_scan_loop_end_flag), "loop end flag must be set");
618     assert(loop_start->is_set(BlockBegin::linear_scan_loop_header_flag), "loop header flag must be set");
620     assert(_work_list.is_empty(), "work list must be empty before processing");
629       assert(is_block_in_loop(loop_idx, cur), "bit in loop map must be set when block is in work list");
671   assert(_work_list.is_empty(), "work list must be empty before processing");
713     assert(a->dominator() != NULL || a == _linear_scan_order->at(0), "dominator must be initialized");
717     assert(b->dominator() != NULL || b == _linear_scan_order->at(0), "dominator must be initialized");
744   // limit loop-depth to 15 bit (only for security reason, it will never be so big)
762   // proability to be completely empty
765   // exceptions should not be thrown in normal control flow, so these blocks
790   assert(_linear_scan_order->index_of(cur) == -1, "block already processed (block can be ready only once)");
791   assert(_work_list.index_of(cur) == -1, "block already in work-list (block can be ready only once)");
836   // be equal.
869   assert(_work_list.is_empty(), "list must be empty before processing");
874     assert(false, "the std_entry must be ready for processing (otherwise, the method has no start block)");
1054       assert(cur->dominator()->linear_scan_number() <= cur->pred_at(j)->linear_scan_number(), "dominator must be before predecessors");
1063     assert(cur->number_of_preds() != 1 || cur->dominator() == cur->pred_at(0), "Single predecessor must also be dominator");
1069     assert(!is_block_in_loop(loop_idx, _linear_scan_order->at(block_idx)), "the first block must not be present in any loop");
1079     // after the first non-loop block, there must not be another loop-block
1090   assert(is_valid(), "IR must be valid");
1111   assert(is_valid(), "IR must be valid");
1117   assert(is_valid(), "IR must be valid");
1190         assert(hir->code()->contains(_blocks->at(i)), "should be in both lists");
1198         assert(block->number_of_preds() == 0, "should be the same");
1216       assert(preds->length() == block->number_of_preds(), "should be the same");
1222     BlockEnd* be = block->end();
1223     int n = be->number_of_sux();
1226       BlockBegin* sux = be->sux_at(i);
1227       assert(!sux->is_set(BlockBegin::exception_entry_flag), "must not be xhandler");
1240       assert(sux->is_set(BlockBegin::exception_entry_flag), "must be xhandler");