Mercurial > hg > truffle
annotate src/share/vm/interpreter/invocationCounter.hpp @ 20543:e7d0505c8a30
8059758: Footprint regressions with JDK-8038423
Summary: Changes in JDK-8038423 always initialize (zero out) virtual memory used for auxiliary data structures. This causes a footprint regression for G1 in startup benchmarks. This is because they do not touch that memory at all, so the operating system does not actually commit these pages. The fix is to, if the initialization value of the data structures matches the default value of just committed memory (=0), do not do anything.
Reviewed-by: jwilhelm, brutisso
| author | tschatzl |
|---|---|
| date | Fri, 10 Oct 2014 15:51:58 +0200 |
| parents | abe03600372a |
| children | d8041d695d19 |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6972
bd7a7ce2e264
6830717: replay of compilations would help with debugging
minqi
parents:
1972
diff
changeset
|
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_INTERPRETER_INVOCATIONCOUNTER_HPP |
| 26 #define SHARE_VM_INTERPRETER_INVOCATIONCOUNTER_HPP | |
| 27 | |
| 28 #include "memory/allocation.hpp" | |
| 29 #include "runtime/handles.hpp" | |
| 30 #include "utilities/exceptions.hpp" | |
| 31 | |
| 0 | 32 // InvocationCounters are used to trigger actions when a limit (threshold) is reached. |
| 33 // For different states, different limits and actions can be defined in the initialization | |
| 34 // routine of InvocationCounters. | |
| 35 // | |
| 36 // Implementation notes: For space reasons, state & counter are both encoded in one word, | |
| 37 // The state is encoded using some of the least significant bits, the counter is using the | |
| 38 // more significant bits. The counter is incremented before a method is activated and an | |
| 39 // action is triggered when when count() > limit(). | |
| 40 | |
| 41 class InvocationCounter VALUE_OBJ_CLASS_SPEC { | |
| 42 friend class VMStructs; | |
|
6972
bd7a7ce2e264
6830717: replay of compilations would help with debugging
minqi
parents:
1972
diff
changeset
|
43 friend class ciReplay; |
| 0 | 44 private: // bit no: |31 3| 2 | 1 0 | |
| 45 unsigned int _counter; // format: [count|carry|state] | |
| 46 | |
| 47 enum PrivateConstants { | |
| 48 number_of_state_bits = 2, | |
| 49 number_of_carry_bits = 1, | |
| 50 number_of_noncount_bits = number_of_state_bits + number_of_carry_bits, | |
| 51 number_of_count_bits = BitsPerInt - number_of_noncount_bits, | |
| 52 state_limit = nth_bit(number_of_state_bits), | |
| 53 count_grain = nth_bit(number_of_state_bits + number_of_carry_bits), | |
| 54 carry_mask = right_n_bits(number_of_carry_bits) << number_of_state_bits, | |
| 55 state_mask = right_n_bits(number_of_state_bits), | |
| 56 status_mask = right_n_bits(number_of_state_bits + number_of_carry_bits), | |
| 57 count_mask = ((int)(-1) ^ status_mask) | |
| 58 }; | |
| 59 | |
| 60 public: | |
| 61 static int InterpreterInvocationLimit; // CompileThreshold scaled for interpreter use | |
| 62 static int InterpreterBackwardBranchLimit; // A separate threshold for on stack replacement | |
| 63 static int InterpreterProfileLimit; // Profiling threshold scaled for interpreter use | |
| 64 | |
| 65 typedef address (*Action)(methodHandle method, TRAPS); | |
| 66 | |
| 67 enum PublicConstants { | |
| 68 count_increment = count_grain, // use this value to increment the 32bit _counter word | |
| 1783 | 69 count_mask_value = count_mask, // use this value to mask the backedge counter |
| 70 count_shift = number_of_noncount_bits, | |
| 71 count_limit = nth_bit(number_of_count_bits - 1) | |
| 0 | 72 }; |
| 73 | |
| 74 enum State { | |
| 75 wait_for_nothing, // do nothing when count() > limit() | |
| 76 wait_for_compile, // introduce nmethod when count() > limit() | |
| 77 number_of_states // must be <= state_limit | |
| 78 }; | |
| 79 | |
| 80 // Manipulation | |
| 81 void reset(); // sets state to wait state | |
| 82 void init(); // sets state into original state | |
| 83 void set_state(State state); // sets state and initializes counter correspondingly | |
| 84 inline void set(State state, int count); // sets state and counter | |
| 85 inline void decay(); // decay counter (divide by two) | |
| 86 void set_carry(); // set the sticky carry bit | |
| 1783 | 87 void set_carry_flag() { _counter |= carry_mask; } |
| 0 | 88 |
|
6972
bd7a7ce2e264
6830717: replay of compilations would help with debugging
minqi
parents:
1972
diff
changeset
|
89 int raw_counter() { return _counter; } |
|
bd7a7ce2e264
6830717: replay of compilations would help with debugging
minqi
parents:
1972
diff
changeset
|
90 |
| 0 | 91 // Accessors |
| 92 State state() const { return (State)(_counter & state_mask); } | |
| 93 bool carry() const { return (_counter & carry_mask) != 0; } | |
| 94 int limit() const { return CompileThreshold; } | |
| 95 Action action() const { return _action[state()]; } | |
| 96 int count() const { return _counter >> number_of_noncount_bits; } | |
| 97 | |
| 98 int get_InvocationLimit() const { return InterpreterInvocationLimit >> number_of_noncount_bits; } | |
| 99 int get_BackwardBranchLimit() const { return InterpreterBackwardBranchLimit >> number_of_noncount_bits; } | |
| 100 int get_ProfileLimit() const { return InterpreterProfileLimit >> number_of_noncount_bits; } | |
| 101 | |
|
14420
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
102 #ifdef CC_INTERP |
| 0 | 103 // Test counter using scaled limits like the asm interpreter would do rather than doing |
| 104 // the shifts to normalize the counter. | |
|
14420
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
105 // Checks sum of invocation_counter and backedge_counter as the template interpreter does. |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
106 bool reached_InvocationLimit(InvocationCounter *back_edge_count) const { |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
107 return (_counter & count_mask) + (back_edge_count->_counter & count_mask) >= |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
108 (unsigned int) InterpreterInvocationLimit; |
| 0 | 109 } |
|
14420
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
110 bool reached_BackwardBranchLimit(InvocationCounter *back_edge_count) const { |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
111 return (_counter & count_mask) + (back_edge_count->_counter & count_mask) >= |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
112 (unsigned int) InterpreterBackwardBranchLimit; |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
113 } |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
114 // Do this just like asm interpreter does for max speed. |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
115 bool reached_ProfileLimit(InvocationCounter *back_edge_count) const { |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
116 return (_counter & count_mask) + (back_edge_count->_counter & count_mask) >= |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
117 (unsigned int) InterpreterProfileLimit; |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
118 } |
|
abe03600372a
8024468: PPC64 (part 201): cppInterpreter: implement bytecode profiling
goetz
parents:
6972
diff
changeset
|
119 #endif // CC_INTERP |
| 0 | 120 |
| 121 void increment() { _counter += count_increment; } | |
| 122 | |
| 123 | |
| 124 // Printing | |
| 125 void print(); | |
| 126 void print_short(); | |
| 127 | |
| 128 // Miscellaneous | |
| 129 static ByteSize counter_offset() { return byte_offset_of(InvocationCounter, _counter); } | |
| 130 static void reinitialize(bool delay_overflow); | |
| 131 | |
| 132 private: | |
| 133 static int _init [number_of_states]; // the counter limits | |
| 134 static Action _action[number_of_states]; // the actions | |
| 135 | |
| 136 static void def(State state, int init, Action action); | |
| 137 static const char* state_as_string(State state); | |
| 138 static const char* state_as_short_string(State state); | |
| 139 }; | |
| 140 | |
| 141 inline void InvocationCounter::set(State state, int count) { | |
| 142 assert(0 <= state && state < number_of_states, "illegal state"); | |
| 143 int carry = (_counter & carry_mask); // the carry bit is sticky | |
| 144 _counter = (count << number_of_noncount_bits) | carry | state; | |
| 145 } | |
| 146 | |
| 147 inline void InvocationCounter::decay() { | |
| 148 int c = count(); | |
| 149 int new_count = c >> 1; | |
| 150 // prevent from going to zero, to distinguish from never-executed methods | |
| 151 if (c > 0 && new_count == 0) new_count = 1; | |
| 152 set(state(), new_count); | |
| 153 } | |
| 1783 | 154 |
| 1972 | 155 |
| 156 #endif // SHARE_VM_INTERPRETER_INVOCATIONCOUNTER_HPP |