1 /*
2 * Copyright (c) 2019, 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 #ifndef SHARE_CDS_ARCHIVEUTILS_INLINE_HPP
26 #define SHARE_CDS_ARCHIVEUTILS_INLINE_HPP
27
28 #include "cds/archiveUtils.hpp"
29
30 #include "cds/archiveBuilder.hpp"
31 #include "cds/cdsConfig.hpp"
32 #include "cds/metaspaceShared.hpp"
33 #include "oops/array.hpp"
34 #include "utilities/bitMap.inline.hpp"
35 #include "utilities/growableArray.hpp"
36
37 inline bool SharedDataRelocator::do_bit(size_t offset) {
38 address* p = _patch_base + offset;
39 assert(_patch_base <= p && p < _patch_end, "must be");
40
41 address old_ptr = *p;
42 assert(_valid_old_base <= old_ptr && old_ptr < _valid_old_end, "must be");
43 assert(old_ptr != nullptr, "bits for null pointers should have been cleaned at dump time");
44
45 address new_ptr = old_ptr + _delta;
46 assert(new_ptr != nullptr, "don't point to the bottom of the archive"); // See ArchivePtrMarker::mark_pointer().
47 assert(_valid_new_base <= new_ptr && new_ptr < _valid_new_end, "must be");
48
49 DEBUG_ONLY(log_trace(cds, reloc)("Patch2: @%8d [" PTR_FORMAT "] " PTR_FORMAT " -> " PTR_FORMAT,
50 (int)offset, p2i(p), p2i(old_ptr), p2i(new_ptr)));
51 *p = new_ptr;
52 return true; // keep iterating
53 }
54
55 // Returns the address of an Array<T> that's allocated in the ArchiveBuilder "buffer" space.
56 template <typename T>
57 Array<T>* ArchiveUtils::archive_non_ptr_array(GrowableArray<T>* tmp_array) {
58 ArchiveBuilder* builder = ArchiveBuilder::current();
59
60 Array<T>* archived_array = ArchiveBuilder::new_ro_array<T>(tmp_array->length());
61 for (int i = 0; i < tmp_array->length(); i++) {
62 archived_array->at_put(i, tmp_array->at(i));
63 }
64
65 return archived_array;
66 }
67
68 // Returns the address of an Array<T> that's allocated in the ArchiveBuilder "buffer" space.
69 // All pointers in tmp_array must point to:
70 // - a buffered object; or
71 // - a source object that has been archived; or
72 // - (only when dumping dynamic archive) an object in the static archive.
73 template <typename T>
74 Array<T>* ArchiveUtils::archive_ptr_array(GrowableArray<T>* tmp_array) {
75 ArchiveBuilder* builder = ArchiveBuilder::current();
76 const bool is_dynamic_dump = CDSConfig::is_dumping_dynamic_archive();
77
78 Array<T>* archived_array = ArchiveBuilder::new_ro_array<T>(tmp_array->length());
79 for (int i = 0; i < tmp_array->length(); i++) {
80 T ptr = tmp_array->at(i);
81 if (!builder->is_in_buffer_space(ptr)) {
82 if (is_dynamic_dump && MetaspaceShared::is_in_shared_metaspace(ptr)) {
83 // We have a pointer that lives in the dynamic archive but points into
84 // the static archive.
85 } else {
86 ptr = builder->get_buffered_addr(ptr);
87 }
88 }
89 archived_array->at_put(i, ptr);
90 ArchivePtrMarker::mark_pointer(archived_array->adr_at(i));
91 }
92
93 return archived_array;
94 }
95
96
97 #endif // SHARE_CDS_ARCHIVEUTILS_INLINE_HPP