annotate src/share/vm/oops/generateOopMap.hpp @ 7745:6dc8db7164d2

Added tag jdk9-b49 for changeset 360cd1fc42f1
author katleman
date Thu, 05 Feb 2015 11:43:29 -0800
parents da91efe96a93
children 6ab7e19c9220
rev   line source
duke@0 1 /*
drchase@6412 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1879 25 #ifndef SHARE_VM_OOPS_GENERATEOOPMAP_HPP
stefank@1879 26 #define SHARE_VM_OOPS_GENERATEOOPMAP_HPP
stefank@1879 27
stefank@1879 28 #include "interpreter/bytecodeStream.hpp"
stefank@1879 29 #include "memory/allocation.inline.hpp"
stefank@1879 30 #include "memory/universe.inline.hpp"
coleenp@3602 31 #include "oops/method.hpp"
stefank@1879 32 #include "oops/oopsHierarchy.hpp"
stefank@1879 33 #include "runtime/signature.hpp"
stefank@1879 34
duke@0 35 // Forward definition
duke@0 36 class GenerateOopMap;
duke@0 37 class BasicBlock;
duke@0 38 class CellTypeState;
duke@0 39 class StackMap;
duke@0 40
duke@0 41 // These two should be removed. But requires som code to be cleaned up
duke@0 42 #define MAXARGSIZE 256 // This should be enough
duke@0 43 #define MAX_LOCAL_VARS 65536 // 16-bit entry
duke@0 44
duke@0 45 typedef void (*jmpFct_t)(GenerateOopMap *c, int bcpDelta, int* data);
duke@0 46
duke@0 47
duke@0 48 // RetTable
duke@0 49 //
duke@0 50 // Contains maping between jsr targets and there return addresses. One-to-many mapping
duke@0 51 //
duke@0 52 class RetTableEntry : public ResourceObj {
duke@0 53 private:
duke@0 54 static int _init_nof_jsrs; // Default size of jsrs list
duke@0 55 int _target_bci; // Target PC address of jump (bytecode index)
duke@0 56 GrowableArray<intptr_t> * _jsrs; // List of return addresses (bytecode index)
duke@0 57 RetTableEntry *_next; // Link to next entry
duke@0 58 public:
duke@0 59 RetTableEntry(int target, RetTableEntry *next) { _target_bci=target; _jsrs = new GrowableArray<intptr_t>(_init_nof_jsrs); _next = next; }
duke@0 60
duke@0 61 // Query
duke@0 62 int target_bci() const { return _target_bci; }
duke@0 63 int nof_jsrs() const { return _jsrs->length(); }
duke@0 64 int jsrs(int i) const { assert(i>=0 && i<nof_jsrs(), "Index out of bounds"); return _jsrs->at(i); }
duke@0 65
duke@0 66 // Update entry
duke@0 67 void add_jsr (int return_bci) { _jsrs->append(return_bci); }
duke@0 68 void add_delta (int bci, int delta);
duke@0 69 RetTableEntry * next() const { return _next; }
duke@0 70 };
duke@0 71
duke@0 72
duke@0 73 class RetTable VALUE_OBJ_CLASS_SPEC {
duke@0 74 private:
duke@0 75 RetTableEntry *_first;
duke@0 76 static int _init_nof_entries;
duke@0 77
duke@0 78 void add_jsr(int return_bci, int target_bci); // Adds entry to list
duke@0 79 public:
duke@0 80 RetTable() { _first = NULL; }
duke@0 81 void compute_ret_table(methodHandle method);
duke@0 82 void update_ret_table(int bci, int delta);
duke@0 83 RetTableEntry* find_jsrs_for_target(int targBci);
duke@0 84 };
duke@0 85
duke@0 86 //
duke@0 87 // CellTypeState
duke@0 88 //
duke@0 89 class CellTypeState VALUE_OBJ_CLASS_SPEC {
duke@0 90 private:
duke@0 91 unsigned int _state;
duke@0 92
duke@0 93 // Masks for separating the BITS and INFO portions of a CellTypeState
duke@0 94 enum { info_mask = right_n_bits(28),
duke@0 95 bits_mask = (int)(~info_mask) };
duke@0 96
duke@0 97 // These constant are used for manipulating the BITS portion of a
duke@0 98 // CellTypeState
duke@0 99 enum { uninit_bit = (int)(nth_bit(31)),
duke@0 100 ref_bit = nth_bit(30),
duke@0 101 val_bit = nth_bit(29),
duke@0 102 addr_bit = nth_bit(28),
duke@0 103 live_bits_mask = (int)(bits_mask & ~uninit_bit) };
duke@0 104
duke@0 105 // These constants are used for manipulating the INFO portion of a
duke@0 106 // CellTypeState
duke@0 107 enum { top_info_bit = nth_bit(27),
duke@0 108 not_bottom_info_bit = nth_bit(26),
duke@0 109 info_data_mask = right_n_bits(26),
duke@0 110 info_conflict = info_mask };
duke@0 111
duke@0 112 // Within the INFO data, these values are used to distinguish different
duke@0 113 // kinds of references.
duke@0 114 enum { ref_not_lock_bit = nth_bit(25), // 0 if this reference is locked as a monitor
duke@0 115 ref_slot_bit = nth_bit(24), // 1 if this reference is a "slot" reference,
duke@0 116 // 0 if it is a "line" reference.
duke@0 117 ref_data_mask = right_n_bits(24) };
duke@0 118
duke@0 119
duke@0 120 // These values are used to initialize commonly used CellTypeState
duke@0 121 // constants.
duke@0 122 enum { bottom_value = 0,
duke@0 123 uninit_value = (int)(uninit_bit | info_conflict),
duke@0 124 ref_value = ref_bit,
duke@0 125 ref_conflict = ref_bit | info_conflict,
duke@0 126 val_value = val_bit | info_conflict,
duke@0 127 addr_value = addr_bit,
duke@0 128 addr_conflict = addr_bit | info_conflict };
duke@0 129
duke@0 130 public:
duke@0 131
duke@0 132 // Since some C++ constructors generate poor code for declarations of the
duke@0 133 // form...
duke@0 134 //
duke@0 135 // CellTypeState vector[length];
duke@0 136 //
duke@0 137 // ...we avoid making a constructor for this class. CellTypeState values
duke@0 138 // should be constructed using one of the make_* methods:
duke@0 139
duke@0 140 static CellTypeState make_any(int state) {
duke@0 141 CellTypeState s;
duke@0 142 s._state = state;
duke@0 143 // Causes SS10 warning.
duke@0 144 // assert(s.is_valid_state(), "check to see if CellTypeState is valid");
duke@0 145 return s;
duke@0 146 }
duke@0 147
duke@0 148 static CellTypeState make_bottom() {
duke@0 149 return make_any(0);
duke@0 150 }
duke@0 151
duke@0 152 static CellTypeState make_top() {
duke@0 153 return make_any(AllBits);
duke@0 154 }
duke@0 155
duke@0 156 static CellTypeState make_addr(int bci) {
duke@0 157 assert((bci >= 0) && (bci < info_data_mask), "check to see if ret addr is valid");
duke@0 158 return make_any(addr_bit | not_bottom_info_bit | (bci & info_data_mask));
duke@0 159 }
duke@0 160
duke@0 161 static CellTypeState make_slot_ref(int slot_num) {
duke@0 162 assert(slot_num >= 0 && slot_num < ref_data_mask, "slot out of range");
duke@0 163 return make_any(ref_bit | not_bottom_info_bit | ref_not_lock_bit | ref_slot_bit |
duke@0 164 (slot_num & ref_data_mask));
duke@0 165 }
duke@0 166
duke@0 167 static CellTypeState make_line_ref(int bci) {
duke@0 168 assert(bci >= 0 && bci < ref_data_mask, "line out of range");
duke@0 169 return make_any(ref_bit | not_bottom_info_bit | ref_not_lock_bit |
duke@0 170 (bci & ref_data_mask));
duke@0 171 }
duke@0 172
duke@0 173 static CellTypeState make_lock_ref(int bci) {
duke@0 174 assert(bci >= 0 && bci < ref_data_mask, "line out of range");
duke@0 175 return make_any(ref_bit | not_bottom_info_bit | (bci & ref_data_mask));
duke@0 176 }
duke@0 177
duke@0 178 // Query methods:
duke@0 179 bool is_bottom() const { return _state == 0; }
duke@0 180 bool is_live() const { return ((_state & live_bits_mask) != 0); }
duke@0 181 bool is_valid_state() const {
duke@0 182 // Uninitialized and value cells must contain no data in their info field:
duke@0 183 if ((can_be_uninit() || can_be_value()) && !is_info_top()) {
duke@0 184 return false;
duke@0 185 }
duke@0 186 // The top bit is only set when all info bits are set:
duke@0 187 if (is_info_top() && ((_state & info_mask) != info_mask)) {
duke@0 188 return false;
duke@0 189 }
duke@0 190 // The not_bottom_bit must be set when any other info bit is set:
duke@0 191 if (is_info_bottom() && ((_state & info_mask) != 0)) {
duke@0 192 return false;
duke@0 193 }
duke@0 194 return true;
duke@0 195 }
duke@0 196
duke@0 197 bool is_address() const { return ((_state & bits_mask) == addr_bit); }
duke@0 198 bool is_reference() const { return ((_state & bits_mask) == ref_bit); }
duke@0 199 bool is_value() const { return ((_state & bits_mask) == val_bit); }
duke@0 200 bool is_uninit() const { return ((_state & bits_mask) == (uint)uninit_bit); }
duke@0 201
duke@0 202 bool can_be_address() const { return ((_state & addr_bit) != 0); }
duke@0 203 bool can_be_reference() const { return ((_state & ref_bit) != 0); }
duke@0 204 bool can_be_value() const { return ((_state & val_bit) != 0); }
duke@0 205 bool can_be_uninit() const { return ((_state & uninit_bit) != 0); }
duke@0 206
duke@0 207 bool is_info_bottom() const { return ((_state & not_bottom_info_bit) == 0); }
duke@0 208 bool is_info_top() const { return ((_state & top_info_bit) != 0); }
duke@0 209 int get_info() const {
duke@0 210 assert((!is_info_top() && !is_info_bottom()),
duke@0 211 "check to make sure top/bottom info is not used");
duke@0 212 return (_state & info_data_mask);
duke@0 213 }
duke@0 214
duke@0 215 bool is_good_address() const { return is_address() && !is_info_top(); }
duke@0 216 bool is_lock_reference() const {
duke@0 217 return ((_state & (bits_mask | top_info_bit | ref_not_lock_bit)) == ref_bit);
duke@0 218 }
duke@0 219 bool is_nonlock_reference() const {
duke@0 220 return ((_state & (bits_mask | top_info_bit | ref_not_lock_bit)) == (ref_bit | ref_not_lock_bit));
duke@0 221 }
duke@0 222
duke@0 223 bool equal(CellTypeState a) const { return _state == a._state; }
duke@0 224 bool equal_kind(CellTypeState a) const {
duke@0 225 return (_state & bits_mask) == (a._state & bits_mask);
duke@0 226 }
duke@0 227
duke@0 228 char to_char() const;
duke@0 229
duke@0 230 // Merge
duke@0 231 CellTypeState merge (CellTypeState cts, int slot) const;
duke@0 232
duke@0 233 // Debugging output
duke@0 234 void print(outputStream *os);
duke@0 235
duke@0 236 // Default values of common values
duke@0 237 static CellTypeState bottom;
duke@0 238 static CellTypeState uninit;
duke@0 239 static CellTypeState ref;
duke@0 240 static CellTypeState value;
duke@0 241 static CellTypeState refUninit;
duke@0 242 static CellTypeState varUninit;
duke@0 243 static CellTypeState top;
duke@0 244 static CellTypeState addr;
duke@0 245 };
duke@0 246
duke@0 247
duke@0 248 //
duke@0 249 // BasicBlockStruct
duke@0 250 //
duke@0 251 class BasicBlock: ResourceObj {
duke@0 252 private:
duke@0 253 bool _changed; // Reached a fixpoint or not
duke@0 254 public:
duke@0 255 enum Constants {
duke@0 256 _dead_basic_block = -2,
duke@0 257 _unreached = -1 // Alive but not yet reached by analysis
duke@0 258 // >=0 // Alive and has a merged state
duke@0 259 };
duke@0 260
duke@0 261 int _bci; // Start of basic block
duke@0 262 int _end_bci; // Bci of last instruction in basicblock
duke@0 263 int _max_locals; // Determines split between vars and stack
duke@0 264 int _max_stack; // Determines split between stack and monitors
duke@0 265 CellTypeState* _state; // State (vars, stack) at entry.
duke@0 266 int _stack_top; // -1 indicates bottom stack value.
duke@0 267 int _monitor_top; // -1 indicates bottom monitor stack value.
duke@0 268
duke@0 269 CellTypeState* vars() { return _state; }
duke@0 270 CellTypeState* stack() { return _state + _max_locals; }
duke@0 271
duke@0 272 bool changed() { return _changed; }
duke@0 273 void set_changed(bool s) { _changed = s; }
duke@0 274
duke@0 275 bool is_reachable() const { return _stack_top >= 0; } // Analysis has reached this basicblock
duke@0 276
duke@0 277 // All basicblocks that are unreachable are going to have a _stack_top == _dead_basic_block.
duke@0 278 // This info. is setup in a pre-parse before the real abstract interpretation starts.
duke@0 279 bool is_dead() const { return _stack_top == _dead_basic_block; }
duke@0 280 bool is_alive() const { return _stack_top != _dead_basic_block; }
duke@0 281 void mark_as_alive() { assert(is_dead(), "must be dead"); _stack_top = _unreached; }
duke@0 282 };
duke@0 283
duke@0 284
duke@0 285 //
duke@0 286 // GenerateOopMap
duke@0 287 //
coleenp@3602 288 // Main class used to compute the pointer-maps in a Method
duke@0 289 //
duke@0 290 class GenerateOopMap VALUE_OBJ_CLASS_SPEC {
duke@0 291 protected:
duke@0 292
duke@0 293 // _monitor_top is set to this constant to indicate that a monitor matching
duke@0 294 // problem was encountered prior to this point in control flow.
duke@0 295 enum { bad_monitors = -1 };
duke@0 296
duke@0 297 // Main variables
duke@0 298 methodHandle _method; // The method we are examine
duke@0 299 RetTable _rt; // Contains the return address mappings
duke@0 300 int _max_locals; // Cached value of no. of locals
duke@0 301 int _max_stack; // Cached value of max. stack depth
duke@0 302 int _max_monitors; // Cached value of max. monitor stack depth
duke@0 303 int _has_exceptions; // True, if exceptions exist for method
twisti@605 304 bool _got_error; // True, if an error occurred during interpretation.
duke@0 305 Handle _exception; // Exception if got_error is true.
duke@0 306 bool _did_rewriting; // was bytecodes rewritten
duke@0 307 bool _did_relocation; // was relocation neccessary
duke@0 308 bool _monitor_safe; // The monitors in this method have been determined
duke@0 309 // to be safe.
duke@0 310
duke@0 311 // Working Cell type state
duke@0 312 int _state_len; // Size of states
duke@0 313 CellTypeState *_state; // list of states
duke@0 314 char *_state_vec_buf; // Buffer used to print a readable version of a state
duke@0 315 int _stack_top;
duke@0 316 int _monitor_top;
duke@0 317
duke@0 318 // Timing and statistics
duke@0 319 static elapsedTimer _total_oopmap_time; // Holds cumulative oopmap generation time
duke@0 320 static long _total_byte_count; // Holds cumulative number of bytes inspected
duke@0 321
duke@0 322 // Cell type methods
duke@0 323 void init_state();
duke@0 324 void make_context_uninitialized ();
coleenp@2062 325 int methodsig_to_effect (Symbol* signature, bool isStatic, CellTypeState* effect);
duke@0 326 bool merge_local_state_vectors (CellTypeState* cts, CellTypeState* bbts);
duke@0 327 bool merge_monitor_state_vectors(CellTypeState* cts, CellTypeState* bbts);
duke@0 328 void copy_state (CellTypeState *dst, CellTypeState *src);
duke@0 329 void merge_state_into_bb (BasicBlock *bb);
duke@0 330 static void merge_state (GenerateOopMap *gom, int bcidelta, int* data);
duke@0 331 void set_var (int localNo, CellTypeState cts);
duke@0 332 CellTypeState get_var (int localNo);
duke@0 333 CellTypeState pop ();
duke@0 334 void push (CellTypeState cts);
duke@0 335 CellTypeState monitor_pop ();
duke@0 336 void monitor_push (CellTypeState cts);
duke@0 337 CellTypeState * vars () { return _state; }
duke@0 338 CellTypeState * stack () { return _state+_max_locals; }
duke@0 339 CellTypeState * monitors () { return _state+_max_locals+_max_stack; }
duke@0 340
duke@0 341 void replace_all_CTS_matches (CellTypeState match,
duke@0 342 CellTypeState replace);
duke@0 343 void print_states (outputStream *os, CellTypeState *vector, int num);
duke@0 344 void print_current_state (outputStream *os,
duke@0 345 BytecodeStream *itr,
duke@0 346 bool detailed);
duke@0 347 void report_monitor_mismatch (const char *msg);
duke@0 348
duke@0 349 // Basicblock info
duke@0 350 BasicBlock * _basic_blocks; // Array of basicblock info
duke@0 351 int _gc_points;
duke@0 352 int _bb_count;
ysr@342 353 BitMap _bb_hdr_bits;
duke@0 354
duke@0 355 // Basicblocks methods
duke@0 356 void initialize_bb ();
duke@0 357 void mark_bbheaders_and_count_gc_points();
ysr@342 358 bool is_bb_header (int bci) const {
ysr@342 359 return _bb_hdr_bits.at(bci);
ysr@342 360 }
duke@0 361 int gc_points () const { return _gc_points; }
duke@0 362 int bb_count () const { return _bb_count; }
ysr@342 363 void set_bbmark_bit (int bci) {
ysr@342 364 _bb_hdr_bits.at_put(bci, true);
ysr@342 365 }
ysr@342 366 void clear_bbmark_bit (int bci) {
ysr@342 367 _bb_hdr_bits.at_put(bci, false);
ysr@342 368 }
duke@0 369 BasicBlock * get_basic_block_at (int bci) const;
duke@0 370 BasicBlock * get_basic_block_containing (int bci) const;
duke@0 371 void interp_bb (BasicBlock *bb);
duke@0 372 void restore_state (BasicBlock *bb);
duke@0 373 int next_bb_start_pc (BasicBlock *bb);
duke@0 374 void update_basic_blocks (int bci, int delta, int new_method_size);
duke@0 375 static void bb_mark_fct (GenerateOopMap *c, int deltaBci, int *data);
duke@0 376
duke@0 377 // Dead code detection
duke@0 378 void mark_reachable_code();
duke@0 379 static void reachable_basicblock (GenerateOopMap *c, int deltaBci, int *data);
duke@0 380
duke@0 381 // Interpretation methods (primary)
duke@0 382 void do_interpretation ();
duke@0 383 void init_basic_blocks ();
duke@0 384 void setup_method_entry_state ();
duke@0 385 void interp_all ();
duke@0 386
duke@0 387 // Interpretation methods (secondary)
duke@0 388 void interp1 (BytecodeStream *itr);
duke@0 389 void do_exception_edge (BytecodeStream *itr);
duke@0 390 void check_type (CellTypeState expected, CellTypeState actual);
duke@0 391 void ppstore (CellTypeState *in, int loc_no);
duke@0 392 void ppload (CellTypeState *out, int loc_no);
duke@0 393 void ppush1 (CellTypeState in);
duke@0 394 void ppush (CellTypeState *in);
duke@0 395 void ppop1 (CellTypeState out);
duke@0 396 void ppop (CellTypeState *out);
duke@0 397 void ppop_any (int poplen);
duke@0 398 void pp (CellTypeState *in, CellTypeState *out);
duke@0 399 void pp_new_ref (CellTypeState *in, int bci);
duke@0 400 void ppdupswap (int poplen, const char *out);
jrose@1830 401 void do_ldc (int bci);
duke@0 402 void do_astore (int idx);
duke@0 403 void do_jsr (int delta);
duke@0 404 void do_field (int is_get, int is_static, int idx, int bci);
duke@0 405 void do_method (int is_static, int is_interface, int idx, int bci);
duke@0 406 void do_multianewarray (int dims, int bci);
duke@0 407 void do_monitorenter (int bci);
duke@0 408 void do_monitorexit (int bci);
duke@0 409 void do_return_monitor_check ();
duke@0 410 void do_checkcast ();
duke@0 411 CellTypeState *sigchar_to_effect (char sigch, int bci, CellTypeState *out);
duke@0 412 int copy_cts (CellTypeState *dst, CellTypeState *src);
duke@0 413
duke@0 414 // Error handling
drchase@6412 415 void error_work (const char *format, va_list ap) ATTRIBUTE_PRINTF(2, 0);
drchase@6412 416 void report_error (const char *format, ...) ATTRIBUTE_PRINTF(2, 3);
drchase@6412 417 void verify_error (const char *format, ...) ATTRIBUTE_PRINTF(2, 3);
duke@0 418 bool got_error() { return _got_error; }
duke@0 419
duke@0 420 // Create result set
duke@0 421 bool _report_result;
duke@0 422 bool _report_result_for_send; // Unfortunatly, stackmaps for sends are special, so we need some extra
duke@0 423 BytecodeStream *_itr_send; // variables to handle them properly.
duke@0 424
duke@0 425 void report_result ();
duke@0 426
duke@0 427 // Initvars
duke@0 428 GrowableArray<intptr_t> * _init_vars;
duke@0 429
duke@0 430 void initialize_vars ();
duke@0 431 void add_to_ref_init_set (int localNo);
duke@0 432
duke@0 433 // Conflicts rewrite logic
twisti@605 434 bool _conflict; // True, if a conflict occurred during interpretation
duke@0 435 int _nof_refval_conflicts; // No. of conflicts that require rewrites
duke@0 436 int * _new_var_map;
duke@0 437
duke@0 438 void record_refval_conflict (int varNo);
duke@0 439 void rewrite_refval_conflicts ();
duke@0 440 void rewrite_refval_conflict (int from, int to);
duke@0 441 bool rewrite_refval_conflict_inst (BytecodeStream *i, int from, int to);
duke@0 442 bool rewrite_load_or_store (BytecodeStream *i, Bytecodes::Code bc, Bytecodes::Code bc0, unsigned int varNo);
duke@0 443
duke@0 444 void expand_current_instr (int bci, int ilen, int newIlen, u_char inst_buffer[]);
duke@0 445 bool is_astore (BytecodeStream *itr, int *index);
duke@0 446 bool is_aload (BytecodeStream *itr, int *index);
duke@0 447
duke@0 448 // List of bci's where a return address is on top of the stack
duke@0 449 GrowableArray<intptr_t> *_ret_adr_tos;
duke@0 450
duke@0 451 bool stack_top_holds_ret_addr (int bci);
duke@0 452 void compute_ret_adr_at_TOS ();
duke@0 453 void update_ret_adr_at_TOS (int bci, int delta);
duke@0 454
duke@0 455 int binsToHold (int no) { return ((no+(BitsPerWord-1))/BitsPerWord); }
duke@0 456 char *state_vec_to_string (CellTypeState* vec, int len);
duke@0 457
duke@0 458 // Helper method. Can be used in subclasses to fx. calculate gc_points. If the current instuction
duke@0 459 // is a control transfer, then calls the jmpFct all possible destinations.
duke@0 460 void ret_jump_targets_do (BytecodeStream *bcs, jmpFct_t jmpFct, int varNo,int *data);
duke@0 461 bool jump_targets_do (BytecodeStream *bcs, jmpFct_t jmpFct, int *data);
duke@0 462
duke@0 463 friend class RelocCallback;
duke@0 464 public:
duke@0 465 GenerateOopMap(methodHandle method);
duke@0 466
duke@0 467 // Compute the map.
duke@0 468 void compute_map(TRAPS);
duke@0 469 void result_for_basicblock(int bci); // Do a callback on fill_stackmap_for_opcodes for basicblock containing bci
duke@0 470
duke@0 471 // Query
duke@0 472 int max_locals() const { return _max_locals; }
coleenp@3602 473 Method* method() const { return _method(); }
duke@0 474 methodHandle method_as_handle() const { return _method; }
duke@0 475
duke@0 476 bool did_rewriting() { return _did_rewriting; }
duke@0 477 bool did_relocation() { return _did_relocation; }
duke@0 478
duke@0 479 static void print_time();
duke@0 480
duke@0 481 // Monitor query
duke@0 482 bool monitor_safe() { return _monitor_safe; }
duke@0 483
duke@0 484 // Specialization methods. Intended use:
duke@0 485 // - possible_gc_point must return true for every bci for which the stackmaps must be returned
duke@0 486 // - fill_stackmap_prolog is called just before the result is reported. The arguments tells the estimated
duke@0 487 // number of gc points
duke@0 488 // - fill_stackmap_for_opcodes is called once for each bytecode index in order (0...code_length-1)
duke@0 489 // - fill_stackmap_epilog is called after all results has been reported. Note: Since the algorithm does not report
duke@0 490 // stackmaps for deadcode, fewer gc_points might have been encounted than assumed during the epilog. It is the
duke@0 491 // responsibility of the subclass to count the correct number.
duke@0 492 // - fill_init_vars are called once with the result of the init_vars computation
duke@0 493 //
duke@0 494 // All these methods are used during a call to: compute_map. Note: Non of the return results are valid
duke@0 495 // after compute_map returns, since all values are allocated as resource objects.
duke@0 496 //
duke@0 497 // All virtual method must be implemented in subclasses
duke@0 498 virtual bool allow_rewrites () const { return false; }
duke@0 499 virtual bool report_results () const { return true; }
duke@0 500 virtual bool report_init_vars () const { return true; }
duke@0 501 virtual bool possible_gc_point (BytecodeStream *bcs) { ShouldNotReachHere(); return false; }
duke@0 502 virtual void fill_stackmap_prolog (int nof_gc_points) { ShouldNotReachHere(); }
duke@0 503 virtual void fill_stackmap_epilog () { ShouldNotReachHere(); }
duke@0 504 virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs,
duke@0 505 CellTypeState* vars,
duke@0 506 CellTypeState* stack,
duke@0 507 int stackTop) { ShouldNotReachHere(); }
duke@0 508 virtual void fill_init_vars (GrowableArray<intptr_t> *init_vars) { ShouldNotReachHere();; }
duke@0 509 };
duke@0 510
duke@0 511 //
duke@0 512 // Subclass of the GenerateOopMap Class that just do rewrites of the method, if needed.
duke@0 513 // It does not store any oopmaps.
duke@0 514 //
duke@0 515 class ResolveOopMapConflicts: public GenerateOopMap {
duke@0 516 private:
duke@0 517
duke@0 518 bool _must_clear_locals;
duke@0 519
duke@0 520 virtual bool report_results() const { return false; }
duke@0 521 virtual bool report_init_vars() const { return true; }
duke@0 522 virtual bool allow_rewrites() const { return true; }
duke@0 523 virtual bool possible_gc_point (BytecodeStream *bcs) { return false; }
duke@0 524 virtual void fill_stackmap_prolog (int nof_gc_points) {}
duke@0 525 virtual void fill_stackmap_epilog () {}
duke@0 526 virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs,
duke@0 527 CellTypeState* vars,
duke@0 528 CellTypeState* stack,
duke@0 529 int stack_top) {}
duke@0 530 virtual void fill_init_vars (GrowableArray<intptr_t> *init_vars) { _must_clear_locals = init_vars->length() > 0; }
duke@0 531
duke@0 532 #ifndef PRODUCT
duke@0 533 // Statistics
duke@0 534 static int _nof_invocations;
duke@0 535 static int _nof_rewrites;
duke@0 536 static int _nof_relocations;
duke@0 537 #endif
duke@0 538
duke@0 539 public:
duke@0 540 ResolveOopMapConflicts(methodHandle method) : GenerateOopMap(method) { _must_clear_locals = false; };
duke@0 541
duke@0 542 methodHandle do_potential_rewrite(TRAPS);
duke@0 543 bool must_clear_locals() const { return _must_clear_locals; }
duke@0 544 };
duke@0 545
duke@0 546
duke@0 547 //
duke@0 548 // Subclass used by the compiler to generate pairing infomation
duke@0 549 //
duke@0 550 class GeneratePairingInfo: public GenerateOopMap {
duke@0 551 private:
duke@0 552
duke@0 553 virtual bool report_results() const { return false; }
duke@0 554 virtual bool report_init_vars() const { return false; }
duke@0 555 virtual bool allow_rewrites() const { return false; }
duke@0 556 virtual bool possible_gc_point (BytecodeStream *bcs) { return false; }
duke@0 557 virtual void fill_stackmap_prolog (int nof_gc_points) {}
duke@0 558 virtual void fill_stackmap_epilog () {}
duke@0 559 virtual void fill_stackmap_for_opcodes (BytecodeStream *bcs,
duke@0 560 CellTypeState* vars,
duke@0 561 CellTypeState* stack,
duke@0 562 int stack_top) {}
duke@0 563 virtual void fill_init_vars (GrowableArray<intptr_t> *init_vars) {}
duke@0 564 public:
duke@0 565 GeneratePairingInfo(methodHandle method) : GenerateOopMap(method) {};
duke@0 566
duke@0 567 // Call compute_map(CHECK) to generate info.
duke@0 568 };
stefank@1879 569
stefank@1879 570 #endif // SHARE_VM_OOPS_GENERATEOOPMAP_HPP