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