Mercurial > hg > truffle

comparison src/share/vm/oops/arrayKlass.cpp @ 6725:da91efe96a93

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6964458: Reimplement class meta-data storage to use native memory Summary: Remove PermGen, allocate meta-data in metaspace linked to class loaders, rewrite GC walking, rewrite and rename metadata to be C++ classes Reviewed-by: jmasa, stefank, never, coleenp, kvn, brutisso, mgerdin, dholmes, jrose, twisti, roland Contributed-by: jmasa <jon.masamitsu@oracle.com>, stefank <stefan.karlsson@oracle.com>, mgerdin <mikael.gerdin@oracle.com>, never <tom.rodriguez@oracle.com>
author coleenp
date Sat, 01 Sep 2012 13:25:18 -0400
parents a735aec54ea4
children d8ce2825b193
comparison
equal deleted inserted replaced
6724:36d1d483d5d6 6725:da91efe96a93
29 #include "gc_interface/collectedHeap.inline.hpp" 29 #include "gc_interface/collectedHeap.inline.hpp"
30 #include "jvmtifiles/jvmti.h" 30 #include "jvmtifiles/jvmti.h"
31 #include "memory/gcLocker.hpp" 31 #include "memory/gcLocker.hpp"
32 #include "memory/universe.inline.hpp" 32 #include "memory/universe.inline.hpp"
33 #include "oops/arrayKlass.hpp" 33 #include "oops/arrayKlass.hpp"
34 #include "oops/arrayKlassKlass.hpp"
35 #include "oops/arrayOop.hpp" 34 #include "oops/arrayOop.hpp"
36 #include "oops/instanceKlass.hpp" 35 #include "oops/instanceKlass.hpp"
37 #include "oops/objArrayOop.hpp" 36 #include "oops/objArrayOop.hpp"
38 #include "oops/oop.inline.hpp" 37 #include "oops/oop.inline.hpp"
39 38
40 int arrayKlass::object_size(int header_size) const { 39 int arrayKlass::static_size(int header_size) {
41 // size of an array klass object 40 // size of an array klass object
42 assert(header_size <= instanceKlass::header_size(), "bad header size"); 41 assert(header_size <= InstanceKlass::header_size(), "bad header size");
43 // If this assert fails, see comments in base_create_array_klass. 42 // If this assert fails, see comments in base_create_array_klass.
44 header_size = instanceKlass::header_size(); 43 header_size = InstanceKlass::header_size();
44 int vtable_len = Universe::base_vtable_size();
45 #ifdef _LP64 45 #ifdef _LP64
46 int size = header_size + align_object_offset(vtable_length()); 46 int size = header_size + align_object_offset(vtable_len);
47 #else 47 #else
48 int size = header_size + vtable_length(); 48 int size = header_size + vtable_len;
49 #endif 49 #endif
50 return align_object_size(size); 50 return align_object_size(size);
51 } 51 }
52 52
53 53
54 klassOop arrayKlass::java_super() const { 54 Klass* arrayKlass::java_super() const {
55 if (super() == NULL) return NULL; // bootstrap case 55 if (super() == NULL) return NULL; // bootstrap case
56 // Array klasses have primary supertypes which are not reported to Java. 56 // Array klasses have primary supertypes which are not reported to Java.
57 // Example super chain: String[][] -> Object[][] -> Object[] -> Object 57 // Example super chain: String[][] -> Object[][] -> Object[] -> Object
58 return SystemDictionary::Object_klass(); 58 return SystemDictionary::Object_klass();
59 } 59 }
62 oop arrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) { 62 oop arrayKlass::multi_allocate(int rank, jint* sizes, TRAPS) {
63 ShouldNotReachHere(); 63 ShouldNotReachHere();
64 return NULL; 64 return NULL;
65 } 65 }
66 66
67 methodOop arrayKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const { 67 Method* arrayKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const {
68 // There are no methods in an array klass but the super class (Object) has some 68 // There are no methods in an array klass but the super class (Object) has some
69 assert(super(), "super klass must be present"); 69 assert(super(), "super klass must be present");
70 return Klass::cast(super())->uncached_lookup_method(name, signature); 70 return Klass::cast(super())->uncached_lookup_method(name, signature);
71 } 71 }
72 72
73 73 arrayKlass::arrayKlass(Symbol* name) {
74 arrayKlassHandle arrayKlass::base_create_array_klass( 74 set_alloc_size(0);
75 const Klass_vtbl& cplusplus_vtbl, int header_size, KlassHandle klass, TRAPS) { 75 set_name(name);
76 // Allocation 76
77 // Note: because the Java vtable must start at the same offset in all klasses, 77 set_super(Universe::is_bootstrapping() ? (Klass*)NULL : SystemDictionary::Object_klass());
78 // we must insert filler fields into arrayKlass to make it the same size as instanceKlass. 78 set_layout_helper(Klass::_lh_neutral_value);
79 // If this assert fails, add filler to instanceKlass to make it bigger. 79 set_dimension(1);
80 assert(header_size <= instanceKlass::header_size(), 80 set_higher_dimension(NULL);
81 "array klasses must be same size as instanceKlass"); 81 set_lower_dimension(NULL);
82 header_size = instanceKlass::header_size(); 82 set_component_mirror(NULL);
83 // Arrays don't add any new methods, so their vtable is the same size as 83 // Arrays don't add any new methods, so their vtable is the same size as
84 // the vtable of klass Object. 84 // the vtable of klass Object.
85 int vtable_size = Universe::base_vtable_size(); 85 int vtable_size = Universe::base_vtable_size();
86 arrayKlassHandle k; 86 set_vtable_length(vtable_size);
87 KlassHandle base_klass = Klass::base_create_klass(klass, 87 set_is_cloneable(); // All arrays are considered to be cloneable (See JLS 20.1.5)
88 header_size + vtable_size,
89 cplusplus_vtbl, CHECK_(k));
90
91 // No safepoint should be possible until the handle's
92 // target below becomes parsable
93 No_Safepoint_Verifier no_safepoint;
94 k = arrayKlassHandle(THREAD, base_klass());
95
96 assert(!k()->is_parsable(), "not expecting parsability yet.");
97 k->set_super(Universe::is_bootstrapping() ? (klassOop)NULL : SystemDictionary::Object_klass());
98 k->set_layout_helper(Klass::_lh_neutral_value);
99 k->set_dimension(1);
100 k->set_higher_dimension(NULL);
101 k->set_lower_dimension(NULL);
102 k->set_component_mirror(NULL);
103 k->set_vtable_length(vtable_size);
104 k->set_is_cloneable(); // All arrays are considered to be cloneable (See JLS 20.1.5)
105
106 assert(k()->is_parsable(), "should be parsable here.");
107 // Make sure size calculation is right
108 assert(k()->size() == align_object_size(header_size + vtable_size), "wrong size for object");
109
110 return k;
111 } 88 }
112 89
113 90
114 // Initialization of vtables and mirror object is done separatly from base_create_array_klass, 91 // Initialization of vtables and mirror object is done separatly from base_create_array_klass,
115 // since a GC can happen. At this point all instance variables of the arrayKlass must be setup. 92 // since a GC can happen. At this point all instance variables of the arrayKlass must be setup.
116 void arrayKlass::complete_create_array_klass(arrayKlassHandle k, KlassHandle super_klass, TRAPS) { 93 void arrayKlass::complete_create_array_klass(arrayKlass* k, KlassHandle super_klass, TRAPS) {
117 ResourceMark rm(THREAD); 94 ResourceMark rm(THREAD);
118 k->initialize_supers(super_klass(), CHECK); 95 k->initialize_supers(super_klass(), CHECK);
119 k->vtable()->initialize_vtable(false, CHECK); 96 k->vtable()->initialize_vtable(false, CHECK);
120 java_lang_Class::create_mirror(k, CHECK); 97 java_lang_Class::create_mirror(k, CHECK);
121 } 98 }
122 99
123 objArrayOop arrayKlass::compute_secondary_supers(int num_extra_slots, TRAPS) { 100 GrowableArray<Klass*>* arrayKlass::compute_secondary_supers(int num_extra_slots) {
124 // interfaces = { cloneable_klass, serializable_klass }; 101 // interfaces = { cloneable_klass, serializable_klass };
125 assert(num_extra_slots == 0, "sanity of primitive array type"); 102 assert(num_extra_slots == 0, "sanity of primitive array type");
126 // Must share this for correct bootstrapping! 103 // Must share this for correct bootstrapping!
127 return Universe::the_array_interfaces_array(); 104 set_secondary_supers(Universe::the_array_interfaces_array());
128 } 105 return NULL;
129 106 }
130 bool arrayKlass::compute_is_subtype_of(klassOop k) { 107
108 bool arrayKlass::compute_is_subtype_of(Klass* k) {
131 // An array is a subtype of Serializable, Clonable, and Object 109 // An array is a subtype of Serializable, Clonable, and Object
132 return k == SystemDictionary::Object_klass() 110 return k == SystemDictionary::Object_klass()
133 || k == SystemDictionary::Cloneable_klass() 111 || k == SystemDictionary::Cloneable_klass()
134 || k == SystemDictionary::Serializable_klass(); 112 || k == SystemDictionary::Serializable_klass();
135 } 113 }
136 114
137 115
138 inline intptr_t* arrayKlass::start_of_vtable() const { 116 inline intptr_t* arrayKlass::start_of_vtable() const {
139 // all vtables start at the same place, that's why we use instanceKlass::header_size here 117 // all vtables start at the same place, that's why we use InstanceKlass::header_size here
140 return ((intptr_t*)as_klassOop()) + instanceKlass::header_size(); 118 return ((intptr_t*)this) + InstanceKlass::header_size();
141 } 119 }
142 120
143 121
144 klassVtable* arrayKlass::vtable() const { 122 klassVtable* arrayKlass::vtable() const {
145 KlassHandle kh(Thread::current(), as_klassOop()); 123 KlassHandle kh(Thread::current(), this);
146 return new klassVtable(kh, start_of_vtable(), vtable_length() / vtableEntry::size()); 124 return new klassVtable(kh, start_of_vtable(), vtable_length() / vtableEntry::size());
147 } 125 }
148 126
149 127
150 objArrayOop arrayKlass::allocate_arrayArray(int n, int length, TRAPS) { 128 objArrayOop arrayKlass::allocate_arrayArray(int n, int length, TRAPS) {
155 report_java_out_of_memory("Requested array size exceeds VM limit"); 133 report_java_out_of_memory("Requested array size exceeds VM limit");
156 JvmtiExport::post_array_size_exhausted(); 134 JvmtiExport::post_array_size_exhausted();
157 THROW_OOP_0(Universe::out_of_memory_error_array_size()); 135 THROW_OOP_0(Universe::out_of_memory_error_array_size());
158 } 136 }
159 int size = objArrayOopDesc::object_size(length); 137 int size = objArrayOopDesc::object_size(length);
160 klassOop k = array_klass(n+dimension(), CHECK_0); 138 Klass* k = array_klass(n+dimension(), CHECK_0);
161 arrayKlassHandle ak (THREAD, k); 139 arrayKlass* ak = arrayKlass::cast(k);
162 objArrayOop o = 140 objArrayOop o =
163 (objArrayOop)CollectedHeap::array_allocate(ak, size, length, CHECK_0); 141 (objArrayOop)CollectedHeap::array_allocate(ak, size, length, CHECK_0);
164 // initialization to NULL not necessary, area already cleared 142 // initialization to NULL not necessary, area already cleared
165 return o; 143 return o;
166 } 144 }
167 145
168 146 void arrayKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
169 void arrayKlass::array_klasses_do(void f(klassOop k)) { 147 Klass* k = this;
170 klassOop k = as_klassOop(); 148 // Iterate over this array klass and all higher dimensions
149 while (k != NULL) {
150 f(k, CHECK);
151 k = arrayKlass::cast(k)->higher_dimension();
152 }
153 }
154
155 void arrayKlass::array_klasses_do(void f(Klass* k)) {
156 Klass* k = this;
171 // Iterate over this array klass and all higher dimensions 157 // Iterate over this array klass and all higher dimensions
172 while (k != NULL) { 158 while (k != NULL) {
173 f(k); 159 f(k);
174 k = arrayKlass::cast(k)->higher_dimension(); 160 k = arrayKlass::cast(k)->higher_dimension();
175 } 161 }
176 } 162 }
177 163
178 164
179 void arrayKlass::with_array_klasses_do(void f(klassOop k)) { 165 void arrayKlass::with_array_klasses_do(void f(Klass* k)) {
180 array_klasses_do(f); 166 array_klasses_do(f);
167 }
168
169
170 // GC support
171
172 void arrayKlass::oops_do(OopClosure* cl) {
173 Klass::oops_do(cl);
174
175 cl->do_oop(adr_component_mirror());
181 } 176 }
182 177
183 // JVM support 178 // JVM support
184 179
185 jint arrayKlass::compute_modifier_flags(TRAPS) const { 180 jint arrayKlass::compute_modifier_flags(TRAPS) const {
190 185
191 jint arrayKlass::jvmti_class_status() const { 186 jint arrayKlass::jvmti_class_status() const {
192 return JVMTI_CLASS_STATUS_ARRAY; 187 return JVMTI_CLASS_STATUS_ARRAY;
193 } 188 }
194 189
190 void arrayKlass::remove_unshareable_info() {
191 Klass::remove_unshareable_info();
192 // Clear the java mirror
193 set_component_mirror(NULL);
194 }
195
196 void arrayKlass::restore_unshareable_info(TRAPS) {
197 Klass::restore_unshareable_info(CHECK);
198 // Klass recreates the component mirror also
199 }
200
195 // Printing 201 // Printing
202
203 void arrayKlass::print_on(outputStream* st) const {
204 assert(is_klass(), "must be klass");
205 Klass::print_on(st);
206 }
207
208 void arrayKlass::print_value_on(outputStream* st) const {
209 assert(is_klass(), "must be klass");
210 for(int index = 0; index < dimension(); index++) {
211 st->print("[]");
212 }
213 }
196 214
197 void arrayKlass::oop_print_on(oop obj, outputStream* st) { 215 void arrayKlass::oop_print_on(oop obj, outputStream* st) {
198 assert(obj->is_array(), "must be array"); 216 assert(obj->is_array(), "must be array");
199 Klass::oop_print_on(obj, st); 217 Klass::oop_print_on(obj, st);
200 st->print_cr(" - length: %d", arrayOop(obj)->length()); 218 st->print_cr(" - length: %d", arrayOop(obj)->length());
201 } 219 }
202 220
221
203 // Verification 222 // Verification
223
224 void arrayKlass::verify_on(outputStream* st) {
225 Klass::verify_on(st);
226
227 if (component_mirror() != NULL) {
228 guarantee(component_mirror()->klass() != NULL, "should have a class");
229 }
230 }
204 231
205 void arrayKlass::oop_verify_on(oop obj, outputStream* st) { 232 void arrayKlass::oop_verify_on(oop obj, outputStream* st) {
206 guarantee(obj->is_array(), "must be array"); 233 guarantee(obj->is_array(), "must be array");
207 arrayOop a = arrayOop(obj); 234 arrayOop a = arrayOop(obj);
208 guarantee(a->length() >= 0, "array with negative length?"); 235 guarantee(a->length() >= 0, "array with negative length?");