Thu, 11 Jul 2013 12:56:29 -0700
Merge
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_INTERPRETER_REWRITER_HPP |
stefank@2314 | 26 | #define SHARE_VM_INTERPRETER_REWRITER_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "memory/allocation.hpp" |
stefank@2314 | 29 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 30 | #include "utilities/growableArray.hpp" |
stefank@2314 | 31 | |
duke@435 | 32 | // The Rewriter adds caches to the constant pool and rewrites bytecode indices |
duke@435 | 33 | // pointing into the constant pool for better interpreter performance. |
duke@435 | 34 | |
jrose@1161 | 35 | class Rewriter: public StackObj { |
duke@435 | 36 | private: |
jrose@1161 | 37 | instanceKlassHandle _klass; |
jrose@1161 | 38 | constantPoolHandle _pool; |
coleenp@4037 | 39 | Array<Method*>* _methods; |
jrose@1161 | 40 | intArray _cp_map; |
coleenp@4037 | 41 | intStack _cp_cache_map; // for Methodref, Fieldref, |
coleenp@4037 | 42 | // InterfaceMethodref and InvokeDynamic |
coleenp@4037 | 43 | intArray _reference_map; // maps from cp index to resolved_refs index (or -1) |
coleenp@4037 | 44 | intStack _resolved_references_map; // for strings, methodHandle, methodType |
coleenp@4037 | 45 | intStack _invokedynamic_references_map; // for invokedynamic resolved refs |
twisti@3969 | 46 | intArray _method_handle_invokers; |
coleenp@4037 | 47 | int _resolved_reference_limit; |
jrose@1161 | 48 | |
coleenp@4037 | 49 | void init_maps(int length) { |
jrose@1161 | 50 | _cp_map.initialize(length, -1); |
jrose@1161 | 51 | // Choose an initial value large enough that we don't get frequent |
jrose@1161 | 52 | // calls to grow(). |
jrose@1161 | 53 | _cp_cache_map.initialize(length / 2); |
coleenp@4037 | 54 | // Also cache resolved objects, in another different cache. |
coleenp@4037 | 55 | _reference_map.initialize(length, -1); |
coleenp@4037 | 56 | _resolved_references_map.initialize(length / 2); |
coleenp@4037 | 57 | _invokedynamic_references_map.initialize(length / 2); |
coleenp@4037 | 58 | _resolved_reference_limit = -1; |
coleenp@4037 | 59 | DEBUG_ONLY(_cp_cache_index_limit = -1); |
jrose@1161 | 60 | } |
coleenp@4037 | 61 | |
coleenp@4037 | 62 | int _cp_cache_index_limit; |
coleenp@4037 | 63 | void record_map_limits() { |
coleenp@4037 | 64 | #ifdef ASSERT |
coleenp@4037 | 65 | // Record initial size of the two arrays generated for the CP cache: |
coleenp@4037 | 66 | _cp_cache_index_limit = _cp_cache_map.length(); |
coleenp@4037 | 67 | #endif //ASSERT |
coleenp@4037 | 68 | _resolved_reference_limit = _resolved_references_map.length(); |
coleenp@4037 | 69 | } |
coleenp@4037 | 70 | |
jrose@1161 | 71 | int cp_entry_to_cp_cache(int i) { assert(has_cp_cache(i), "oob"); return _cp_map[i]; } |
jrose@1161 | 72 | bool has_cp_cache(int i) { return (uint)i < (uint)_cp_map.length() && _cp_map[i] >= 0; } |
coleenp@4037 | 73 | |
jrose@1161 | 74 | int add_cp_cache_entry(int cp_index) { |
coleenp@4037 | 75 | assert(_pool->tag_at(cp_index).value() != JVM_CONSTANT_InvokeDynamic, "use indy version"); |
jrose@1161 | 76 | assert(_cp_map[cp_index] == -1, "not twice on same cp_index"); |
coleenp@4037 | 77 | assert(_cp_cache_index_limit == -1, "do not add cache entries after first iteration"); |
jrose@1161 | 78 | int cache_index = _cp_cache_map.append(cp_index); |
jrose@1161 | 79 | _cp_map.at_put(cp_index, cache_index); |
jrose@1161 | 80 | assert(cp_entry_to_cp_cache(cp_index) == cache_index, ""); |
coleenp@4037 | 81 | assert(cp_cache_entry_pool_index(cache_index) == cp_index, ""); |
jrose@1161 | 82 | return cache_index; |
jrose@1161 | 83 | } |
coleenp@4037 | 84 | |
coleenp@4037 | 85 | // add a new CP cache entry beyond the normal cache (for invokedynamic only) |
coleenp@4037 | 86 | int add_invokedynamic_cp_cache_entry(int cp_index) { |
coleenp@4037 | 87 | assert(_pool->tag_at(cp_index).value() == JVM_CONSTANT_InvokeDynamic, "use non-indy version"); |
coleenp@4037 | 88 | assert(_cp_map[cp_index] == -1, "do not map from cp_index"); |
coleenp@4037 | 89 | assert(_cp_cache_index_limit >= 0, "add indy cache entries after first iteration"); |
coleenp@4037 | 90 | int cache_index = _cp_cache_map.append(cp_index); |
coleenp@4037 | 91 | assert(cache_index >= _cp_cache_index_limit, ""); |
coleenp@4037 | 92 | // do not update _cp_map, since the mapping is one-to-many |
coleenp@4037 | 93 | assert(cp_cache_entry_pool_index(cache_index) == cp_index, ""); |
jrose@1494 | 94 | return cache_index; |
jrose@1494 | 95 | } |
jrose@1161 | 96 | |
coleenp@4037 | 97 | // fix duplicated code later |
coleenp@4037 | 98 | int cp_entry_to_resolved_references(int cp_index) const { |
coleenp@4037 | 99 | assert(has_entry_in_resolved_references(cp_index), "oob"); |
coleenp@4037 | 100 | return _reference_map[cp_index]; |
coleenp@4037 | 101 | } |
coleenp@4037 | 102 | bool has_entry_in_resolved_references(int cp_index) const { |
coleenp@4037 | 103 | return (uint)cp_index < (uint)_reference_map.length() && _reference_map[cp_index] >= 0; |
coleenp@4037 | 104 | } |
coleenp@4037 | 105 | |
coleenp@4037 | 106 | // add a new entry to the resolved_references map |
coleenp@4037 | 107 | int add_resolved_references_entry(int cp_index) { |
coleenp@4037 | 108 | assert(_reference_map[cp_index] == -1, "not twice on same cp_index"); |
coleenp@4037 | 109 | assert(_resolved_reference_limit == -1, "do not add CP refs after first iteration"); |
coleenp@4037 | 110 | int ref_index = _resolved_references_map.append(cp_index); |
coleenp@4037 | 111 | _reference_map.at_put(cp_index, ref_index); |
coleenp@4037 | 112 | assert(cp_entry_to_resolved_references(cp_index) == ref_index, ""); |
coleenp@4037 | 113 | return ref_index; |
coleenp@4037 | 114 | } |
coleenp@4037 | 115 | |
twisti@4133 | 116 | // add a new entries to the resolved_references map (for invokedynamic and invokehandle only) |
twisti@4133 | 117 | int add_invokedynamic_resolved_references_entries(int cp_index, int cache_index) { |
coleenp@4037 | 118 | assert(_resolved_reference_limit >= 0, "must add indy refs after first iteration"); |
twisti@4133 | 119 | int ref_index = -1; |
twisti@4133 | 120 | for (int entry = 0; entry < ConstantPoolCacheEntry::_indy_resolved_references_entries; entry++) { |
twisti@4133 | 121 | const int index = _resolved_references_map.append(cp_index); // many-to-one |
twisti@4133 | 122 | assert(index >= _resolved_reference_limit, ""); |
twisti@4133 | 123 | if (entry == 0) { |
twisti@4133 | 124 | ref_index = index; |
twisti@4133 | 125 | } |
twisti@4133 | 126 | assert((index - entry) == ref_index, "entries must be consecutive"); |
twisti@4133 | 127 | _invokedynamic_references_map.at_put_grow(index, cache_index, -1); |
twisti@4133 | 128 | } |
coleenp@4037 | 129 | return ref_index; |
coleenp@4037 | 130 | } |
coleenp@4037 | 131 | |
coleenp@4037 | 132 | int resolved_references_entry_to_pool_index(int ref_index) { |
coleenp@4037 | 133 | int cp_index = _resolved_references_map[ref_index]; |
coleenp@4037 | 134 | return cp_index; |
coleenp@4037 | 135 | } |
coleenp@4037 | 136 | |
jrose@2015 | 137 | // Access the contents of _cp_cache_map to determine CP cache layout. |
jrose@2015 | 138 | int cp_cache_entry_pool_index(int cache_index) { |
jrose@2015 | 139 | int cp_index = _cp_cache_map[cache_index]; |
jrose@2015 | 140 | return cp_index; |
jrose@2015 | 141 | } |
jrose@2015 | 142 | |
jrose@1161 | 143 | // All the work goes in here: |
coleenp@4037 | 144 | Rewriter(instanceKlassHandle klass, constantPoolHandle cpool, Array<Method*>* methods, TRAPS); |
jrose@1161 | 145 | |
jrose@1161 | 146 | void compute_index_maps(); |
jrose@1161 | 147 | void make_constant_pool_cache(TRAPS); |
coleenp@4037 | 148 | void scan_method(Method* m, bool reverse = false); |
jrose@1161 | 149 | void rewrite_Object_init(methodHandle m, TRAPS); |
coleenp@2945 | 150 | void rewrite_member_reference(address bcp, int offset, bool reverse = false); |
coleenp@4037 | 151 | void maybe_rewrite_invokehandle(address opc, int cp_index, int cache_index, bool reverse = false); |
coleenp@2945 | 152 | void rewrite_invokedynamic(address bcp, int offset, bool reverse = false); |
coleenp@2945 | 153 | void maybe_rewrite_ldc(address bcp, int offset, bool is_wide, bool reverse = false); |
coleenp@2945 | 154 | // Revert bytecodes in case of an exception. |
coleenp@2945 | 155 | void restore_bytecodes(); |
duke@435 | 156 | |
coleenp@2945 | 157 | static methodHandle rewrite_jsrs(methodHandle m, TRAPS); |
duke@435 | 158 | public: |
jrose@1161 | 159 | // Driver routine: |
duke@435 | 160 | static void rewrite(instanceKlassHandle klass, TRAPS); |
duke@435 | 161 | }; |
stefank@2314 | 162 | |
stefank@2314 | 163 | #endif // SHARE_VM_INTERPRETER_REWRITER_HPP |