1 /*
2 * Copyright (c) 1997, 2025, 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 #include "asm/codeBuffer.hpp"
26 #include "asm/macroAssembler.inline.hpp"
27 #include "memory/resourceArea.hpp"
28 #include "oops/access.inline.hpp"
29 #include "oops/klass.hpp"
30 #include "oops/oop.inline.hpp"
31 #include "prims/vectorSupport.hpp"
32 #include "runtime/continuation.hpp"
33 #include "runtime/interfaceSupport.inline.hpp"
34 #include "runtime/timerTrace.hpp"
35 #include "runtime/sharedRuntime.hpp"
36 #include "runtime/stubRoutines.hpp"
37 #include "utilities/align.hpp"
38 #include "utilities/copy.hpp"
39 #ifdef COMPILER2
40 #include "opto/runtime.hpp"
41 #endif
42
43 UnsafeMemoryAccess* UnsafeMemoryAccess::_table = nullptr;
44 int UnsafeMemoryAccess::_table_length = 0;
45 int UnsafeMemoryAccess::_table_max_length = 0;
46 address UnsafeMemoryAccess::_common_exit_stub_pc = nullptr;
47
48 // Implementation of StubRoutines - for a description of how to
49 // declare new blobs, stubs and entries , see stubDefinitions.hpp.
50
51 // define arrays to hold stub and blob names
52
53 // use a template to generate the initializer for the blob names array
54
55 #define DEFINE_BLOB_NAME(blob_name) \
56 # blob_name,
57
58 const char* StubRoutines::_blob_names[StubGenBlobId::NUM_BLOBIDS] = {
59 STUBGEN_BLOBS_DO(DEFINE_BLOB_NAME)
60 };
61
62 #undef DEFINE_BLOB_NAME
63
64 #define DEFINE_STUB_NAME(blob_name, stub_name) \
65 # stub_name , \
66
67 // use a template to generate the initializer for the stub names array
68 const char* StubRoutines::_stub_names[StubGenStubId::NUM_STUBIDS] = {
69 STUBGEN_STUBS_DO(DEFINE_STUB_NAME)
70 };
71
72 #undef DEFINE_STUB_NAME
73
74 // Define fields used to store blobs
75
76 #define DEFINE_BLOB_FIELD(blob_name) \
77 BufferBlob* StubRoutines:: STUBGEN_BLOB_FIELD_NAME(blob_name) = nullptr;
78
79 STUBGEN_BLOBS_DO(DEFINE_BLOB_FIELD)
80
81 #undef DEFINE_BLOB_FIELD
82
83 // Define fields used to store stub entries
84
85 #define DEFINE_ENTRY_FIELD(blob_name, stub_name, field_name, getter_name) \
86 address StubRoutines:: STUB_FIELD_NAME(field_name) = nullptr;
87
88 #define DEFINE_ENTRY_FIELD_INIT(blob_name, stub_name, field_name, getter_name, init_function) \
89 address StubRoutines:: STUB_FIELD_NAME(field_name) = CAST_FROM_FN_PTR(address, init_function);
90
91 #define DEFINE_ENTRY_FIELD_ARRAY(blob_name, stub_name, field_name, getter_name, count) \
92 address StubRoutines:: STUB_FIELD_NAME(field_name)[count] = { nullptr };
93
94 STUBGEN_ENTRIES_DO(DEFINE_ENTRY_FIELD, DEFINE_ENTRY_FIELD_INIT, DEFINE_ENTRY_FIELD_ARRAY)
95
96 #undef DEFINE_ENTRY_FIELD_ARRAY
97 #undef DEFINE_ENTRY_FIELD_INIT
98 #undef DEFINE_ENTRY_FIELD
99
100 jint StubRoutines::_verify_oop_count = 0;
101
102
103 address StubRoutines::_string_indexof_array[4] = { nullptr };
104
105 const char* StubRoutines::get_blob_name(StubGenBlobId id) {
106 assert(0 <= id && id < StubGenBlobId::NUM_BLOBIDS, "invalid blob id");
107 return _blob_names[id];
108 }
109
110 const char* StubRoutines::get_stub_name(StubGenStubId id) {
111 assert(0 <= id && id < StubGenStubId::NUM_STUBIDS, "invalid stub id");
112 return _stub_names[id];
113 }
114
115 #ifdef ASSERT
116
117 // array holding start and end indices for stub ids associated with a
118 // given blob. Given a blob with id (StubGenBlobId) blob_id for any
119 // stub with id (StubGenStubId) stub_id declared within the blob:
120 // _blob_offsets[blob_id] <= stub_id < _blob_offsets[blob_id+1]
121
122 static int _blob_limits[StubGenBlobId::NUM_BLOBIDS + 1];
123
124 // macro used to compute blob limits
125 #define BLOB_COUNT(blob_name) \
126 counter += StubGenStubId_ ## blob_name :: NUM_STUBIDS_ ## blob_name; \
127 _blob_limits[++index] = counter; \
128
129 // macro that checks stubs are associated with the correct blobs
130 #define STUB_VERIFY(blob_name, stub_name) \
131 localStubId = (int) (StubGenStubId_ ## blob_name :: blob_name ## _ ## stub_name ## _id); \
132 globalStubId = (int) (StubGenStubId:: stub_name ## _id); \
133 blobId = (int) (StubGenBlobId:: blob_name ## _id); \
134 assert((globalStubId >= _blob_limits[blobId] && \
135 globalStubId < _blob_limits[blobId+1]), \
136 "stub " # stub_name " uses incorrect blob name " # blob_name); \
137 assert(globalStubId == _blob_limits[blobId] + localStubId, \
138 "stub " # stub_name " id found at wrong offset!"); \
139
140 bool verifyStubIds() {
141 // first compute the blob limits
142 int counter = 0;
143 int index = 0;
144 // populate offsets table with cumulative total of local enum counts
145 STUBGEN_BLOBS_DO(BLOB_COUNT);
146
147 // ensure 1) global stub ids lie in the range of the associated blob
148 // and 2) each blob's base + local stub id == global stub id
149 int globalStubId, blobId, localStubId;
150 STUBGEN_STUBS_DO(STUB_VERIFY);
151 return true;
152 }
153
154 #undef BLOB_COUNT
155 #undef STUB_VERIFY
156
157 // ensure we verify the blob ids when this compile unit is first entered
158 bool _verified_stub_ids = verifyStubIds();
159
160
161 // macro used by stub to blob translation
162
163 #define BLOB_CHECK_OFFSET(blob_name) \
164 if (id < _blob_limits[((int)blobId) + 1]) { return blobId; } \
165 blobId = StubGenBlobId:: blob_name ## _id; \
166
167 // translate a global stub id to an associated blob id based on the
168 // computed blob limits
169
170 StubGenBlobId StubRoutines::stub_to_blob(StubGenStubId stubId) {
171 int id = (int)stubId;
172 assert(id > ((int)StubGenStubId::NO_STUBID) && id < ((int)StubGenStubId::NUM_STUBIDS), "stub id out of range!");
173 // start with no blob to catch stub id == -1
174 StubGenBlobId blobId = StubGenBlobId::NO_BLOBID;
175 STUBGEN_BLOBS_DO(BLOB_CHECK_OFFSET);
176 // if we reach here we should have the last blob id
177 assert(blobId == StubGenBlobId::NUM_BLOBIDS - 1, "unexpected blob id");
178 return blobId;
179 }
180
181 #endif // ASSERT
182
183 // TODO: update with 8343767
184 address StubRoutines::_load_inline_type_fields_in_regs = nullptr;
185 address StubRoutines::_store_inline_type_fields_to_buf = nullptr;
186
187
188 // Initialization
189 //
190 // Note: to break cycle with universe initialization, stubs are generated in two phases.
191 // The first one generates stubs needed during universe init (e.g., _handle_must_compile_first_entry).
192 // The second phase includes all other stubs (which may depend on universe being initialized.)
193
194 extern void StubGenerator_generate(CodeBuffer* code, StubGenBlobId blob_id); // only interface to generators
195
196 void UnsafeMemoryAccess::create_table(int max_size) {
197 UnsafeMemoryAccess::_table = new UnsafeMemoryAccess[max_size];
198 UnsafeMemoryAccess::_table_max_length = max_size;
199 }
200
201 bool UnsafeMemoryAccess::contains_pc(address pc) {
202 for (int i = 0; i < UnsafeMemoryAccess::_table_length; i++) {
203 UnsafeMemoryAccess* entry = &UnsafeMemoryAccess::_table[i];
204 if (pc >= entry->start_pc() && pc < entry->end_pc()) {
205 return true;
206 }
207 }
208 return false;
209 }
210
211 address UnsafeMemoryAccess::page_error_continue_pc(address pc) {
212 for (int i = 0; i < UnsafeMemoryAccess::_table_length; i++) {
213 UnsafeMemoryAccess* entry = &UnsafeMemoryAccess::_table[i];
214 if (pc >= entry->start_pc() && pc < entry->end_pc()) {
215 return entry->error_exit_pc();
216 }
217 }
218 return nullptr;
219 }
220
221
222 static BufferBlob* initialize_stubs(StubGenBlobId blob_id,
223 int code_size, int max_aligned_stubs,
224 const char* timer_msg,
225 const char* buffer_name,
226 const char* assert_msg) {
227 ResourceMark rm;
228 TraceTime timer(timer_msg, TRACETIME_LOG(Info, startuptime));
229 // Add extra space for large CodeEntryAlignment
230 int size = code_size + CodeEntryAlignment * max_aligned_stubs;
231 BufferBlob* stubs_code = BufferBlob::create(buffer_name, size);
232 if (stubs_code == nullptr) {
233 vm_exit_out_of_memory(code_size, OOM_MALLOC_ERROR, "CodeCache: no room for %s", buffer_name);
234 }
235 CodeBuffer buffer(stubs_code);
236 StubGenerator_generate(&buffer, blob_id);
237 // When new stubs added we need to make sure there is some space left
238 // to catch situation when we should increase size again.
239 assert(code_size == 0 || buffer.insts_remaining() > 200, "increase %s", assert_msg);
240
241 LogTarget(Info, stubs) lt;
242 if (lt.is_enabled()) {
243 LogStream ls(lt);
244 ls.print_cr("%s\t [" INTPTR_FORMAT ", " INTPTR_FORMAT "] used: %d, free: %d",
245 buffer_name, p2i(stubs_code->content_begin()), p2i(stubs_code->content_end()),
246 buffer.total_content_size(), buffer.insts_remaining());
247 }
248 return stubs_code;
249 }
250
251 #define DEFINE_BLOB_INIT_METHOD(blob_name) \
252 void StubRoutines::initialize_ ## blob_name ## _stubs() { \
253 if (STUBGEN_BLOB_FIELD_NAME(blob_name) == nullptr) { \
254 StubGenBlobId blob_id = StubGenBlobId:: STUB_ID_NAME(blob_name); \
255 int size = _ ## blob_name ## _code_size; \
256 int max_aligned_size = 10; \
257 const char* timer_msg = "StubRoutines generation " # blob_name " stubs"; \
258 const char* name = "StubRoutines (" # blob_name "stubs)"; \
259 const char* assert_msg = "_" # blob_name "_code_size"; \
260 STUBGEN_BLOB_FIELD_NAME(blob_name) = \
261 initialize_stubs(blob_id, size, max_aligned_size, timer_msg, \
262 name, assert_msg); \
263 } \
264 }
265
266
267 STUBGEN_BLOBS_DO(DEFINE_BLOB_INIT_METHOD)
268
269 #undef DEFINE_BLOB_INIT_METHOD
270
271
272 #define DEFINE_BLOB_INIT_FUNCTION(blob_name) \
273 void blob_name ## _stubs_init() { \
274 StubRoutines::initialize_ ## blob_name ## _stubs(); \
275 }
276
277 STUBGEN_BLOBS_DO(DEFINE_BLOB_INIT_FUNCTION)
278
279 #undef DEFINE_BLOB_INIT_FUNCTION
280
281 /*
282 * we generate the underlying driver method but this wrapper is needed
283 * to perform special handling depending on where the compiler init
284 * gets called from. it ought to be possible to remove this at some
285 * point and have adeterminate ordered init.
286 */
287
288 void compiler_stubs_init(bool in_compiler_thread) {
289 if (in_compiler_thread && DelayCompilerStubsGeneration) {
290 // Temporarily revert state of stubs generation because
291 // it is called after final_stubs_init() finished
292 // during compiler runtime initialization.
293 // It is fine because these stubs are only used by
294 // compiled code and compiler is not running yet.
295 StubCodeDesc::unfreeze();
296 StubRoutines::initialize_compiler_stubs();
297 StubCodeDesc::freeze();
298 } else if (!in_compiler_thread && !DelayCompilerStubsGeneration) {
299 StubRoutines::initialize_compiler_stubs();
300 }
301 }
302
303
304 //
305 // Default versions of arraycopy functions
306 //
307
308 JRT_LEAF(void, StubRoutines::jbyte_copy(jbyte* src, jbyte* dest, size_t count))
309 #ifndef PRODUCT
310 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
311 #endif // !PRODUCT
312 Copy::conjoint_jbytes_atomic(src, dest, count);
313 JRT_END
314
315 JRT_LEAF(void, StubRoutines::jshort_copy(jshort* src, jshort* dest, size_t count))
316 #ifndef PRODUCT
317 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
318 #endif // !PRODUCT
319 Copy::conjoint_jshorts_atomic(src, dest, count);
320 JRT_END
321
322 JRT_LEAF(void, StubRoutines::jint_copy(jint* src, jint* dest, size_t count))
323 #ifndef PRODUCT
324 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
325 #endif // !PRODUCT
326 Copy::conjoint_jints_atomic(src, dest, count);
327 JRT_END
328
329 JRT_LEAF(void, StubRoutines::jlong_copy(jlong* src, jlong* dest, size_t count))
330 #ifndef PRODUCT
331 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path long/double array copy
332 #endif // !PRODUCT
333 Copy::conjoint_jlongs_atomic(src, dest, count);
334 JRT_END
335
336 JRT_LEAF(void, StubRoutines::oop_copy(oop* src, oop* dest, size_t count))
337 #ifndef PRODUCT
338 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
339 #endif // !PRODUCT
340 assert(count != 0, "count should be non-zero");
341 ArrayAccess<>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)dest, count);
342 JRT_END
343
344 JRT_LEAF(void, StubRoutines::oop_copy_uninit(oop* src, oop* dest, size_t count))
345 #ifndef PRODUCT
346 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
347 #endif // !PRODUCT
348 assert(count != 0, "count should be non-zero");
349 ArrayAccess<IS_DEST_UNINITIALIZED>::oop_arraycopy_raw((HeapWord*)src, (HeapWord*)dest, count);
350 JRT_END
351
352 JRT_LEAF(void, StubRoutines::arrayof_jbyte_copy(HeapWord* src, HeapWord* dest, size_t count))
353 #ifndef PRODUCT
354 SharedRuntime::_jbyte_array_copy_ctr++; // Slow-path byte array copy
355 #endif // !PRODUCT
356 Copy::arrayof_conjoint_jbytes(src, dest, count);
357 JRT_END
358
359 JRT_LEAF(void, StubRoutines::arrayof_jshort_copy(HeapWord* src, HeapWord* dest, size_t count))
360 #ifndef PRODUCT
361 SharedRuntime::_jshort_array_copy_ctr++; // Slow-path short/char array copy
362 #endif // !PRODUCT
363 Copy::arrayof_conjoint_jshorts(src, dest, count);
364 JRT_END
365
366 JRT_LEAF(void, StubRoutines::arrayof_jint_copy(HeapWord* src, HeapWord* dest, size_t count))
367 #ifndef PRODUCT
368 SharedRuntime::_jint_array_copy_ctr++; // Slow-path int/float array copy
369 #endif // !PRODUCT
370 Copy::arrayof_conjoint_jints(src, dest, count);
371 JRT_END
372
373 JRT_LEAF(void, StubRoutines::arrayof_jlong_copy(HeapWord* src, HeapWord* dest, size_t count))
374 #ifndef PRODUCT
375 SharedRuntime::_jlong_array_copy_ctr++; // Slow-path int/float array copy
376 #endif // !PRODUCT
377 Copy::arrayof_conjoint_jlongs(src, dest, count);
378 JRT_END
379
380 JRT_LEAF(void, StubRoutines::arrayof_oop_copy(HeapWord* src, HeapWord* dest, size_t count))
381 #ifndef PRODUCT
382 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
383 #endif // !PRODUCT
384 assert(count != 0, "count should be non-zero");
385 ArrayAccess<ARRAYCOPY_ARRAYOF>::oop_arraycopy_raw(src, dest, count);
386 JRT_END
387
388 JRT_LEAF(void, StubRoutines::arrayof_oop_copy_uninit(HeapWord* src, HeapWord* dest, size_t count))
389 #ifndef PRODUCT
390 SharedRuntime::_oop_array_copy_ctr++; // Slow-path oop array copy
391 #endif // !PRODUCT
392 assert(count != 0, "count should be non-zero");
393 ArrayAccess<ARRAYCOPY_ARRAYOF | IS_DEST_UNINITIALIZED>::oop_arraycopy_raw(src, dest, count);
394 JRT_END
395
396 address StubRoutines::select_fill_function(BasicType t, bool aligned, const char* &name) {
397 #define RETURN_STUB(xxx_fill) { \
398 name = #xxx_fill; \
399 return StubRoutines::xxx_fill(); }
400
401 switch (t) {
402 case T_BYTE:
403 case T_BOOLEAN:
404 if (!aligned) RETURN_STUB(jbyte_fill);
405 RETURN_STUB(arrayof_jbyte_fill);
406 case T_CHAR:
407 case T_SHORT:
408 if (!aligned) RETURN_STUB(jshort_fill);
409 RETURN_STUB(arrayof_jshort_fill);
410 case T_INT:
411 case T_FLOAT:
412 if (!aligned) RETURN_STUB(jint_fill);
413 RETURN_STUB(arrayof_jint_fill);
414 case T_DOUBLE:
415 case T_LONG:
416 case T_ARRAY:
417 case T_OBJECT:
418 case T_NARROWOOP:
419 case T_NARROWKLASS:
420 case T_ADDRESS:
421 case T_VOID:
422 // Currently unsupported
423 return nullptr;
424
425 default:
426 ShouldNotReachHere();
427 return nullptr;
428 }
429
430 #undef RETURN_STUB
431 }
432
433 // constants for computing the copy function
434 enum {
435 COPYFUNC_UNALIGNED = 0,
436 COPYFUNC_ALIGNED = 1, // src, dest aligned to HeapWordSize
437 COPYFUNC_CONJOINT = 0,
438 COPYFUNC_DISJOINT = 2 // src != dest, or transfer can descend
439 };
440
441 // Note: The condition "disjoint" applies also for overlapping copies
442 // where an descending copy is permitted (i.e., dest_offset <= src_offset).
443 address
444 StubRoutines::select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name, bool dest_uninitialized) {
445 int selector =
446 (aligned ? COPYFUNC_ALIGNED : COPYFUNC_UNALIGNED) +
447 (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
448
449 #define RETURN_STUB(xxx_arraycopy) { \
450 name = #xxx_arraycopy; \
451 return StubRoutines::xxx_arraycopy(); }
452
453 #define RETURN_STUB_PARM(xxx_arraycopy, parm) { \
454 name = parm ? #xxx_arraycopy "_uninit": #xxx_arraycopy; \
455 return StubRoutines::xxx_arraycopy(parm); }
456
457 switch (t) {
458 case T_BYTE:
459 case T_BOOLEAN:
460 switch (selector) {
461 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_arraycopy);
462 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_arraycopy);
463 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jbyte_disjoint_arraycopy);
464 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
465 }
466 case T_CHAR:
467 case T_SHORT:
468 switch (selector) {
469 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_arraycopy);
470 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_arraycopy);
471 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jshort_disjoint_arraycopy);
472 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
473 }
474 case T_INT:
475 case T_FLOAT:
476 switch (selector) {
477 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_arraycopy);
478 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_arraycopy);
479 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jint_disjoint_arraycopy);
480 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jint_disjoint_arraycopy);
481 }
482 case T_DOUBLE:
483 case T_LONG:
484 switch (selector) {
485 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_arraycopy);
486 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_arraycopy);
487 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB(jlong_disjoint_arraycopy);
488 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
489 }
490 case T_ARRAY:
491 case T_OBJECT:
492 switch (selector) {
493 case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_arraycopy, dest_uninitialized);
494 case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_arraycopy, dest_uninitialized);
495 case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED: RETURN_STUB_PARM(oop_disjoint_arraycopy, dest_uninitialized);
496 case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED: RETURN_STUB_PARM(arrayof_oop_disjoint_arraycopy, dest_uninitialized);
497 }
498 default:
499 ShouldNotReachHere();
500 return nullptr;
501 }
502
503 #undef RETURN_STUB
504 #undef RETURN_STUB_PARM
505 }
506
507 UnsafeMemoryAccessMark::UnsafeMemoryAccessMark(StubCodeGenerator* cgen, bool add_entry, bool continue_at_scope_end, address error_exit_pc) {
508 _cgen = cgen;
509 _ucm_entry = nullptr;
510 if (add_entry) {
511 address err_exit_pc = nullptr;
512 if (!continue_at_scope_end) {
513 err_exit_pc = error_exit_pc != nullptr ? error_exit_pc : UnsafeMemoryAccess::common_exit_stub_pc();
514 }
515 assert(err_exit_pc != nullptr || continue_at_scope_end, "error exit not set");
516 _ucm_entry = UnsafeMemoryAccess::add_to_table(_cgen->assembler()->pc(), nullptr, err_exit_pc);
517 }
518 }
519
520 UnsafeMemoryAccessMark::~UnsafeMemoryAccessMark() {
521 if (_ucm_entry != nullptr) {
522 _ucm_entry->set_end_pc(_cgen->assembler()->pc());
523 if (_ucm_entry->error_exit_pc() == nullptr) {
524 _ucm_entry->set_error_exit_pc(_cgen->assembler()->pc());
525 }
526 }
527 }