Mercurial > hg > truffle

comparison src/share/vm/opto/compile.hpp @ 1397:b4776199210f

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6943485: JVMTI always on capabilities change code generation too much Reviewed-by: twisti, dcubed
author never
date Mon, 26 Apr 2010 23:59:45 -0700
parents b4b440360f1e
children c18cbe5936b8
comparison
equal deleted inserted replaced
1396:d7f654633cfe 1397:b4776199210f
144 // For deopt 144 // For deopt
145 int _orig_pc_slot; 145 int _orig_pc_slot;
146 int _orig_pc_slot_offset_in_bytes; 146 int _orig_pc_slot_offset_in_bytes;
147 147
148 int _major_progress; // Count of something big happening 148 int _major_progress; // Count of something big happening
149 bool _deopt_happens; // TRUE if de-optimization CAN happen
150 bool _has_loops; // True if the method _may_ have some loops 149 bool _has_loops; // True if the method _may_ have some loops
151 bool _has_split_ifs; // True if the method _may_ have some split-if 150 bool _has_split_ifs; // True if the method _may_ have some split-if
152 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores. 151 bool _has_unsafe_access; // True if the method _may_ produce faults in unsafe loads or stores.
153 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated 152 bool _has_stringbuilder; // True StringBuffers or StringBuilders are allocated
154 uint _trap_hist[trapHistLength]; // Cumulative traps 153 uint _trap_hist[trapHistLength]; // Cumulative traps
298 void set_num_loop_opts(int n) { _num_loop_opts = n; } 297 void set_num_loop_opts(int n) { _num_loop_opts = n; }
299 int max_inline_size() const { return _max_inline_size; } 298 int max_inline_size() const { return _max_inline_size; }
300 void set_freq_inline_size(int n) { _freq_inline_size = n; } 299 void set_freq_inline_size(int n) { _freq_inline_size = n; }
301 int freq_inline_size() const { return _freq_inline_size; } 300 int freq_inline_size() const { return _freq_inline_size; }
302 void set_max_inline_size(int n) { _max_inline_size = n; } 301 void set_max_inline_size(int n) { _max_inline_size = n; }
303 bool deopt_happens() const { return _deopt_happens; }
304 bool has_loops() const { return _has_loops; } 302 bool has_loops() const { return _has_loops; }
305 void set_has_loops(bool z) { _has_loops = z; } 303 void set_has_loops(bool z) { _has_loops = z; }
306 bool has_split_ifs() const { return _has_split_ifs; } 304 bool has_split_ifs() const { return _has_split_ifs; }
307 void set_has_split_ifs(bool z) { _has_split_ifs = z; } 305 void set_has_split_ifs(bool z) { _has_split_ifs = z; }
308 bool has_unsafe_access() const { return _has_unsafe_access; } 306 bool has_unsafe_access() const { return _has_unsafe_access; }