1 /*
2 * Copyright (c) 1997, 2019, 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 "precompiled.hpp"
26 #include "classfile/javaClasses.hpp"
27 #include "classfile/symbolTable.hpp"
28 #include "classfile/systemDictionary.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "gc/shared/collectedHeap.inline.hpp"
31 #include "jvmtifiles/jvmti.h"
32 #include "memory/metaspaceClosure.hpp"
33 #include "memory/resourceArea.hpp"
34 #include "memory/universe.hpp"
35 #include "oops/arrayKlass.hpp"
36 #include "oops/objArrayKlass.hpp"
37 #include "oops/arrayOop.hpp"
38 #include "oops/instanceKlass.hpp"
39 #include "oops/objArrayOop.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "runtime/handles.inline.hpp"
42
43 int ArrayKlass::static_size(int header_size) {
44 // size of an array klass object
45 assert(header_size <= InstanceKlass::header_size(), "bad header size");
46 // If this assert fails, see comments in base_create_array_klass.
47 header_size = InstanceKlass::header_size();
48 int vtable_len = Universe::base_vtable_size();
49 int size = header_size + vtable_len;
50 return align_metadata_size(size);
51 }
52
53
54 InstanceKlass* ArrayKlass::java_super() const {
55 if (super() == NULL) return NULL; // bootstrap case
56 // Array klasses have primary supertypes which are not reported to Java.
57 // Example super chain: String[][] -> Object[][] -> Object[] -> Object
58 return SystemDictionary::Object_klass();
59 }
60
61
62 oop ArrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
63 ShouldNotReachHere();
64 return NULL;
65 }
66
67 // find field according to JVM spec 5.4.3.2, returns the klass in which the field is defined
68 Klass* ArrayKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
69 // There are no fields in an array klass but look to the super class (Object)
70 assert(super(), "super klass must be present");
71 return super()->find_field(name, sig, fd);
72 }
73
74 Method* ArrayKlass::uncached_lookup_method(const Symbol* name,
75 const Symbol* signature,
76 OverpassLookupMode overpass_mode,
77 PrivateLookupMode private_mode) const {
78 // There are no methods in an array klass but the super class (Object) has some
79 assert(super(), "super klass must be present");
80 // Always ignore overpass methods in superclasses, although technically the
81 // super klass of an array, (j.l.Object) should not have
82 // any overpass methods present.
83 return super()->uncached_lookup_method(name, signature, Klass::skip_overpass, private_mode);
84 }
85
86 ArrayKlass::ArrayKlass(Symbol* name, KlassID id) :
87 Klass(id),
88 _dimension(1),
89 _higher_dimension(NULL),
90 _lower_dimension(NULL) {
91 // Arrays don't add any new methods, so their vtable is the same size as
92 // the vtable of klass Object.
93 set_vtable_length(Universe::base_vtable_size());
94 set_name(name);
95 set_super(Universe::is_bootstrapping() ? NULL : SystemDictionary::Object_klass());
96 set_layout_helper(Klass::_lh_neutral_value);
97 set_is_cloneable(); // All arrays are considered to be cloneable (See JLS 20.1.5)
98 JFR_ONLY(INIT_ID(this);)
99 }
100
101 Symbol* ArrayKlass::create_element_klass_array_name(Klass* element_klass, TRAPS) {
102 Symbol* name = NULL;
103 if (!element_klass->is_instance_klass() ||
104 (name = InstanceKlass::cast(element_klass)->array_name()) == NULL) {
105
106 ResourceMark rm(THREAD);
107 char *name_str = element_klass->name()->as_C_string();
108 int len = element_klass->name()->utf8_length();
109 char *new_str = NEW_RESOURCE_ARRAY(char, len + 4);
110 int idx = 0;
111 new_str[idx++] = '[';
112 if (element_klass->is_instance_klass()) { // it could be an array or simple type
113 // Temporary hack, for arrays of value types, this code should be removed
114 // once value types have their own array types
115 // With Q-descriptors, the code below needs to be reworked.
116 // It is still correct today because the only kind of value array supported
117 // is array of null-free values which map to the Q-signature.
118 // As soon as both arrays of null-free values and arrays of nullable values
119 // are supported, this code has to be rewritten to consider the kind of the
120 // array instead of the kind of the elements.
121 if (element_klass->is_value()) {
122 new_str[idx++] = 'Q';
123 } else {
124 new_str[idx++] = 'L';
125 }
126 }
127 memcpy(&new_str[idx], name_str, len * sizeof(char));
128 idx += len;
129 if (element_klass->is_instance_klass()) {
130 new_str[idx++] = ';';
131 }
132 new_str[idx++] = '\0';
133 name = SymbolTable::new_permanent_symbol(new_str, CHECK_NULL);
134 if (element_klass->is_instance_klass() || element_klass->is_value()) {
135 InstanceKlass* ik = InstanceKlass::cast(element_klass);
136 ik->set_array_name(name);
137 }
138 }
139
140 return name;
141 }
142
143 // Initialization of vtables and mirror object is done separatly from base_create_array_klass,
144 // since a GC can happen. At this point all instance variables of the ArrayKlass must be setup.
145 void ArrayKlass::complete_create_array_klass(ArrayKlass* k, Klass* super_klass, ModuleEntry* module_entry, TRAPS) {
146 k->initialize_supers(super_klass, NULL, CHECK);
147 k->vtable().initialize_vtable(false, CHECK);
148
149 // During bootstrapping, before java.base is defined, the module_entry may not be present yet.
150 // These classes will be put on a fixup list and their module fields will be patched once
151 // java.base is defined.
152 assert((module_entry != NULL) || ((module_entry == NULL) && !ModuleEntryTable::javabase_defined()),
153 "module entry not available post " JAVA_BASE_NAME " definition");
154 oop module = (module_entry != NULL) ? module_entry->module() : (oop)NULL;
155 java_lang_Class::create_mirror(k, Handle(THREAD, k->class_loader()), Handle(THREAD, module), Handle(), CHECK);
156 }
157
158 GrowableArray<Klass*>* ArrayKlass::compute_secondary_supers(int num_extra_slots,
159 Array<InstanceKlass*>* transitive_interfaces) {
160 // interfaces = { cloneable_klass, serializable_klass };
161 assert(num_extra_slots == 0, "sanity of primitive array type");
162 assert(transitive_interfaces == NULL, "sanity");
163 // Must share this for correct bootstrapping!
164 set_secondary_supers(Universe::the_array_interfaces_array());
165 return NULL;
166 }
167
168 objArrayOop ArrayKlass::allocate_arrayArray(int n, int length, TRAPS) {
169 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_ARRAY), CHECK_0);
170 int size = objArrayOopDesc::object_size(length);
171 Klass* k = array_klass(n+dimension(), CHECK_0);
172 ArrayKlass* ak = ArrayKlass::cast(k);
173 objArrayOop o = (objArrayOop)Universe::heap()->array_allocate(ak, size, length,
174 /* do_zero */ true, CHECK_0);
175 // initialization to NULL not necessary, area already cleared
176 return o;
177 }
178
179 void ArrayKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
180 Klass* k = this;
181 // Iterate over this array klass and all higher dimensions
182 while (k != NULL) {
183 f(k, CHECK);
184 k = ArrayKlass::cast(k)->higher_dimension();
185 }
186 }
187
188 void ArrayKlass::array_klasses_do(void f(Klass* k)) {
189 Klass* k = this;
190 // Iterate over this array klass and all higher dimensions
191 while (k != NULL) {
192 f(k);
193 k = ArrayKlass::cast(k)->higher_dimension();
194 }
195 }
196
197 // JVM support
198
199 jint ArrayKlass::compute_modifier_flags(TRAPS) const {
200 return JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC;
201 }
202
203 // JVMTI support
204
205 jint ArrayKlass::jvmti_class_status() const {
206 return JVMTI_CLASS_STATUS_ARRAY;
207 }
208
209 void ArrayKlass::metaspace_pointers_do(MetaspaceClosure* it) {
210 Klass::metaspace_pointers_do(it);
211
212 ResourceMark rm;
213 log_trace(cds)("Iter(ArrayKlass): %p (%s)", this, external_name());
214
215 // need to cast away volatile
216 it->push((Klass**)&_higher_dimension);
217 it->push((Klass**)&_lower_dimension);
218 }
219
220 void ArrayKlass::remove_unshareable_info() {
221 Klass::remove_unshareable_info();
222 if (_higher_dimension != NULL) {
223 ArrayKlass *ak = ArrayKlass::cast(higher_dimension());
224 ak->remove_unshareable_info();
225 }
226 }
227
228 void ArrayKlass::remove_java_mirror() {
229 Klass::remove_java_mirror();
230 if (_higher_dimension != NULL) {
231 ArrayKlass *ak = ArrayKlass::cast(higher_dimension());
232 ak->remove_java_mirror();
233 }
234 }
235
236 void ArrayKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
237 assert(loader_data == ClassLoaderData::the_null_class_loader_data(), "array classes belong to null loader");
238 Klass::restore_unshareable_info(loader_data, protection_domain, CHECK);
239 // Klass recreates the component mirror also
240
241 if (_higher_dimension != NULL) {
242 ArrayKlass *ak = ArrayKlass::cast(higher_dimension());
243 ak->restore_unshareable_info(loader_data, protection_domain, CHECK);
244 }
245 }
246
247 // Printing
248
249 void ArrayKlass::print_on(outputStream* st) const {
250 assert(is_klass(), "must be klass");
251 Klass::print_on(st);
252 }
253
254 void ArrayKlass::print_value_on(outputStream* st) const {
255 assert(is_klass(), "must be klass");
256 for(int index = 0; index < dimension(); index++) {
257 st->print("[]");
258 }
259 }
260
261 void ArrayKlass::oop_print_on(oop obj, outputStream* st) {
262 assert(obj->is_array(), "must be array");
263 Klass::oop_print_on(obj, st);
264 st->print_cr(" - length: %d", arrayOop(obj)->length());
265 }
266
267
268 // Verification
269
270 void ArrayKlass::verify_on(outputStream* st) {
271 Klass::verify_on(st);
272 }
273
274 void ArrayKlass::oop_verify_on(oop obj, outputStream* st) {
275 guarantee(obj->is_array(), "must be array");
276 arrayOop a = arrayOop(obj);
277 guarantee(a->length() >= 0, "array with negative length?");
278 }