1 /*
2 * Copyright (c) 1997, 2026, Oracle and/or its affiliates. All rights reserved.
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 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_CODE_VTABLESTUBS_HPP
26 #define SHARE_CODE_VTABLESTUBS_HPP
27
28 #include "asm/macroAssembler.hpp"
29 #include "code/vmreg.hpp"
30 #include "memory/allStatic.hpp"
31 #include "runtime/atomicAccess.hpp"
32 #include "utilities/checkedCast.hpp"
33
34 // A VtableStub holds an individual code stub for a pair (vtable index, #args) for either itables or vtables
35 // There's a one-to-one relationship between a VtableStub and such a pair.
36
37 // A word on VtableStub sizing:
38 // Such a vtable/itable stub consists of the instance data
39 // and an immediately following CodeBuffer.
40 // Unfortunately, the required space for the code buffer varies, depending on
41 // the setting of compile time macros (PRODUCT, ASSERT, ...) and of command line
42 // parameters. Actual data may have an influence on the size as well.
43 //
44 // A simple approximation for the VtableStub size would be to just take a value
45 // "large enough" for all circumstances - a worst case estimate.
46 // As there can exist many stubs - and they never go away - we certainly don't
47 // want to waste more code cache space than absolutely necessary.
48 //
49 // We need a different approach which, as far as possible, should be independent
50 // from or adaptive to code size variations. These variations may be caused by
51 // changed compile time or run time switches as well as by changed emitter code.
52 //
53 // Here is the idea:
54 // For the first stub we generate, we allocate a "large enough" code buffer.
55 // Once all instructions are emitted, we know the actual size of the stub.
56 // Remembering that size allows us to allocate a tightly matching code buffer
57 // for all subsequent stubs. That covers all "static variance", i.e. all variance
58 // that is due to compile time macros, command line parameters, machine capabilities,
59 // and other influences which are immutable for the life span of the vm.
60 //
61 // Life isn't always that easy. Code size may depend on actual data, "load constant"
62 // being an example for that. All code segments with such "dynamic variance" require
63 // additional care. We need to know or estimate the worst case code size for each
64 // such segment. With that knowledge, we can maintain a "slop counter" in the
65 // platform-specific stub emitters. It accumulates the difference between worst-case
66 // and actual code size. When the stub is fully generated, the actual stub size is
67 // adjusted (increased) by the slop counter value.
68 //
69 // As a result, we allocate all but the first code buffers with the same, tightly matching size.
70 //
71
72 // VtableStubs creates the code stubs for compiled calls through vtables.
73 // There is one stub per (vtable index, args_size) pair, and the stubs are
74 // never deallocated. They don't need to be GCed because they contain no oops.
75 class VtableStub;
76
77 class VtableStubs : AllStatic {
78 public: // N must be public (some compilers need this for _table)
79 enum {
80 N = 256, // size of stub table; must be power of two
81 mask = N - 1
82 };
83
84 static_assert(is_power_of_2((int)N), "N must be a power of 2");
85
86 private:
87 friend class VtableStub;
88 static VtableStub* volatile _table[N]; // table of existing stubs
89 static int _vtab_stub_size; // current size estimate for vtable stub (quasi-constant)
90 static int _itab_stub_size; // current size estimate for itable stub (quasi-constant)
91
92 static VtableStub* create_vtable_stub(int vtable_index, bool caller_is_c1);
93 static VtableStub* create_itable_stub(int vtable_index, bool caller_is_c1);
94 static VtableStub* lookup (bool is_vtable_stub, int vtable_index, bool caller_is_c1);
95 static void enter (bool is_vtable_stub, int vtable_index, bool caller_is_c1, VtableStub* s);
96 static inline uint hash (bool is_vtable_stub, int vtable_index, bool caller_is_c1);
97 static inline uint unsafe_hash (address entry_point);
98 static address find_stub (bool is_vtable_stub, int vtable_index, bool caller_is_c1);
99 static void bookkeeping(MacroAssembler* masm, outputStream* out, VtableStub* s,
100 address npe_addr, address ame_addr, bool is_vtable_stub,
101 int index, int slop_bytes, int index_dependent_slop);
102 static int code_size_limit(bool is_vtable_stub);
103 static void check_and_set_size_limit(bool is_vtable_stub,
104 int code_size,
105 int padding);
106
107 public:
108 static address find_vtable_stub(int vtable_index, bool caller_is_c1) { return find_stub(true, vtable_index, caller_is_c1); }
109 static address find_itable_stub(int itable_index, bool caller_is_c1) { return find_stub(false, itable_index, caller_is_c1); }
110
111 static VtableStub* entry_point(address pc); // vtable stub entry point for a pc
112 static bool contains(address pc); // is pc within any stub?
113 static VtableStub* stub_containing(address pc); // stub containing pc or nullptr
114 static void initialize();
115
116 template <typename F>
117 static void vtable_stub_do(F f);
118 };
119
120
121 class VtableStub {
122 private:
123 friend class VtableStubs;
124
125 enum class Type : uint8_t {
126 itable_stub,
127 vtable_stub,
128 };
129
130 enum class CallerType : uint8_t {
131 c1,
132 unspecified,
133 };
134
135
136 static address _chunk; // For allocation
137 static address _chunk_end; // For allocation
138 static VMReg _receiver_location; // Where to find receiver
139
140 VtableStub* _next; // Pointer to next entry in hash table
141 const short _index; // vtable index
142 short _ame_offset; // Where an AbstractMethodError might occur
143 short _npe_offset; // Where a NullPointerException might occur
144 Type _type; // Type, either vtable stub or itable stub
145 CallerType _caller_type; // CallerType, either unspecified or C1,
146 // which doesn't scalarize parameters.
147 /* code follows here */ // The vtableStub code
148
149 void* operator new(size_t size, int code_size) throw();
150
151 VtableStub(bool is_vtable_stub, short index, bool caller_is_c1)
152 : _next(nullptr), _index(index), _ame_offset(-1), _npe_offset(-1),
153 _type(is_vtable_stub ? Type::vtable_stub : Type::itable_stub),
154 _caller_type(caller_is_c1 ? CallerType::c1 : CallerType::unspecified) {}
155 VtableStub* next() const { return _next; }
156 static VMReg receiver_location() { return _receiver_location; }
157 void set_next(VtableStub* n) { _next = n; }
158
159 public:
160 int index() const { return _index; }
161 int code_size() const { return VtableStubs::code_size_limit(is_vtable_stub()); }
162 address code_begin() const { return (address)(this + 1); }
163 address code_end() const { return code_begin() + code_size(); }
164 address entry_point() const { return code_begin(); }
165 static int entry_offset() { return sizeof(class VtableStub); }
166
167 bool matches(bool is_vtable_stub, int index, bool caller_is_c1) const {
168 return _index == index && this->is_vtable_stub() == is_vtable_stub && this->caller_is_c1() == caller_is_c1;
169 }
170 bool contains(address pc) const { return code_begin() <= pc && pc < code_end(); }
171
172 private:
173 void set_exception_points(address npe_addr, address ame_addr) {
174 _npe_offset = checked_cast<short>(npe_addr - code_begin());
175 _ame_offset = checked_cast<short>(ame_addr - code_begin());
176 assert(is_abstract_method_error(ame_addr), "offset must be correct");
177 assert(is_null_pointer_exception(npe_addr), "offset must be correct");
178 assert(!is_abstract_method_error(npe_addr), "offset must be correct");
179 assert(!is_null_pointer_exception(ame_addr), "offset must be correct");
180 }
181
182 // platform-dependent routines
183 static int pd_code_alignment();
184 // CNC: Removed because vtable stubs are now made with an ideal graph
185 // static bool pd_disregard_arg_size();
186
187 static void align_chunk() {
188 uintptr_t off = (uintptr_t)( _chunk + sizeof(VtableStub) ) % pd_code_alignment();
189 if (off != 0) _chunk += pd_code_alignment() - off;
190 }
191
192 public:
193 // Query
194 bool is_itable_stub() const { return _type == Type::itable_stub; }
195 bool is_vtable_stub() const { return _type == Type::vtable_stub; }
196 bool caller_is_c1() const { return _caller_type == CallerType::c1; }
197 bool is_abstract_method_error(address epc) { return epc == code_begin()+_ame_offset; }
198 bool is_null_pointer_exception(address epc) { return epc == code_begin()+_npe_offset; }
199
200 void print_on(outputStream* st) const;
201 void print() const;
202
203 };
204
205 template <typename F>
206 void VtableStubs::vtable_stub_do(F f) {
207 for (int i = 0; i < N; i++) {
208 for (VtableStub* s = AtomicAccess::load_acquire(&_table[i]); s != nullptr; s = s->next()) {
209 f(s);
210 }
211 }
212 }
213
214 #endif // SHARE_CODE_VTABLESTUBS_HPP