Mercurial > hg > graal-compiler
annotate src/share/vm/oops/typeArrayKlass.cpp @ 878:abe076e3636f
6864003: Modify JVM_FindClassFromBootLoader to return null if class not found
Summary: JVM_FindClassFromBootLoader returns null if class not found
Reviewed-by: acorn, alanb, dholmes
author | mchung |
---|---|
date | Mon, 27 Jul 2009 09:06:22 -0700 |
parents | 1413494da700 |
children | b5d78a3b8843 |
rev | line source |
---|---|
0 | 1 /* |
579 | 2 * Copyright 1997-2009 Sun Microsystems, Inc. All Rights Reserved. |
0 | 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 # include "incls/_precompiled.incl" | |
26 # include "incls/_typeArrayKlass.cpp.incl" | |
27 | |
28 bool typeArrayKlass::compute_is_subtype_of(klassOop k) { | |
29 if (!k->klass_part()->oop_is_typeArray()) { | |
30 return arrayKlass::compute_is_subtype_of(k); | |
31 } | |
32 | |
33 typeArrayKlass* tak = typeArrayKlass::cast(k); | |
34 if (dimension() != tak->dimension()) return false; | |
35 | |
36 return element_type() == tak->element_type(); | |
37 } | |
38 | |
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
0
diff
changeset
|
39 klassOop typeArrayKlass::create_klass(BasicType type, int scale, |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
0
diff
changeset
|
40 const char* name_str, TRAPS) { |
0 | 41 typeArrayKlass o; |
42 | |
43 symbolHandle sym(symbolOop(NULL)); | |
44 // bootstrapping: don't create sym if symbolKlass not created yet | |
481
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
0
diff
changeset
|
45 if (Universe::symbolKlassObj() != NULL && name_str != NULL) { |
7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
jcoomes
parents:
0
diff
changeset
|
46 sym = oopFactory::new_symbol_handle(name_str, CHECK_NULL); |
0 | 47 } |
48 KlassHandle klassklass (THREAD, Universe::typeArrayKlassKlassObj()); | |
49 | |
50 arrayKlassHandle k = base_create_array_klass(o.vtbl_value(), header_size(), klassklass, CHECK_NULL); | |
51 typeArrayKlass* ak = typeArrayKlass::cast(k()); | |
52 ak->set_name(sym()); | |
53 ak->set_layout_helper(array_layout_helper(type)); | |
54 assert(scale == (1 << ak->log2_element_size()), "scale must check out"); | |
55 assert(ak->oop_is_javaArray(), "sanity"); | |
56 assert(ak->oop_is_typeArray(), "sanity"); | |
57 ak->set_max_length(arrayOopDesc::max_array_length(type)); | |
58 assert(k()->size() > header_size(), "bad size"); | |
59 | |
60 // Call complete_create_array_klass after all instance variables have been initialized. | |
61 KlassHandle super (THREAD, k->super()); | |
62 complete_create_array_klass(k, super, CHECK_NULL); | |
63 | |
64 return k(); | |
65 } | |
66 | |
67 typeArrayOop typeArrayKlass::allocate(int length, TRAPS) { | |
68 assert(log2_element_size() >= 0, "bad scale"); | |
69 if (length >= 0) { | |
70 if (length <= max_length()) { | |
71 size_t size = typeArrayOopDesc::object_size(layout_helper(), length); | |
72 KlassHandle h_k(THREAD, as_klassOop()); | |
73 typeArrayOop t; | |
74 CollectedHeap* ch = Universe::heap(); | |
75 if (size < ch->large_typearray_limit()) { | |
76 t = (typeArrayOop)CollectedHeap::array_allocate(h_k, (int)size, length, CHECK_NULL); | |
77 } else { | |
78 t = (typeArrayOop)CollectedHeap::large_typearray_allocate(h_k, (int)size, length, CHECK_NULL); | |
79 } | |
80 assert(t->is_parsable(), "Don't publish unless parsable"); | |
81 return t; | |
82 } else { | |
876
1413494da700
6850957: Honor -XX:OnOutOfMemoryError when array size exceeds VM limit
martin
parents:
579
diff
changeset
|
83 report_java_out_of_memory("Requested array size exceeds VM limit"); |
0 | 84 THROW_OOP_0(Universe::out_of_memory_error_array_size()); |
85 } | |
86 } else { | |
87 THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); | |
88 } | |
89 } | |
90 | |
91 typeArrayOop typeArrayKlass::allocate_permanent(int length, TRAPS) { | |
92 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); | |
93 int size = typeArrayOopDesc::object_size(layout_helper(), length); | |
94 KlassHandle h_k(THREAD, as_klassOop()); | |
95 typeArrayOop t = (typeArrayOop) | |
96 CollectedHeap::permanent_array_allocate(h_k, size, length, CHECK_NULL); | |
97 assert(t->is_parsable(), "Can't publish until parsable"); | |
98 return t; | |
99 } | |
100 | |
101 oop typeArrayKlass::multi_allocate(int rank, jint* last_size, TRAPS) { | |
102 // For typeArrays this is only called for the last dimension | |
103 assert(rank == 1, "just checking"); | |
104 int length = *last_size; | |
105 return allocate(length, THREAD); | |
106 } | |
107 | |
108 | |
109 void typeArrayKlass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { | |
110 assert(s->is_typeArray(), "must be type array"); | |
111 | |
112 // Check destination | |
113 if (!d->is_typeArray() || element_type() != typeArrayKlass::cast(d->klass())->element_type()) { | |
114 THROW(vmSymbols::java_lang_ArrayStoreException()); | |
115 } | |
116 | |
117 // Check is all offsets and lengths are non negative | |
118 if (src_pos < 0 || dst_pos < 0 || length < 0) { | |
119 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); | |
120 } | |
121 // Check if the ranges are valid | |
122 if ( (((unsigned int) length + (unsigned int) src_pos) > (unsigned int) s->length()) | |
123 || (((unsigned int) length + (unsigned int) dst_pos) > (unsigned int) d->length()) ) { | |
124 THROW(vmSymbols::java_lang_ArrayIndexOutOfBoundsException()); | |
125 } | |
126 | |
127 // This is an attempt to make the copy_array fast. | |
128 // NB: memmove takes care of overlapping memory segments. | |
129 // Potential problem: memmove is not guaranteed to be word atomic | |
130 // Revisit in Merlin | |
131 int l2es = log2_element_size(); | |
132 int ihs = array_header_in_bytes() / wordSize; | |
133 char* src = (char*) ((oop*)s + ihs) + (src_pos << l2es); | |
134 char* dst = (char*) ((oop*)d + ihs) + (dst_pos << l2es); | |
135 memmove(dst, src, length << l2es); | |
136 } | |
137 | |
138 | |
139 // create a klass of array holding typeArrays | |
140 klassOop typeArrayKlass::array_klass_impl(bool or_null, int n, TRAPS) { | |
141 typeArrayKlassHandle h_this(THREAD, as_klassOop()); | |
142 return array_klass_impl(h_this, or_null, n, THREAD); | |
143 } | |
144 | |
145 klassOop typeArrayKlass::array_klass_impl(typeArrayKlassHandle h_this, bool or_null, int n, TRAPS) { | |
146 int dimension = h_this->dimension(); | |
147 assert(dimension <= n, "check order of chain"); | |
148 if (dimension == n) | |
149 return h_this(); | |
150 | |
151 objArrayKlassHandle h_ak(THREAD, h_this->higher_dimension()); | |
152 if (h_ak.is_null()) { | |
153 if (or_null) return NULL; | |
154 | |
155 ResourceMark rm; | |
156 JavaThread *jt = (JavaThread *)THREAD; | |
157 { | |
158 MutexLocker mc(Compile_lock, THREAD); // for vtables | |
159 // Atomic create higher dimension and link into list | |
160 MutexLocker mu(MultiArray_lock, THREAD); | |
161 | |
162 h_ak = objArrayKlassHandle(THREAD, h_this->higher_dimension()); | |
163 if (h_ak.is_null()) { | |
164 klassOop oak = objArrayKlassKlass::cast( | |
165 Universe::objArrayKlassKlassObj())->allocate_objArray_klass( | |
166 dimension + 1, h_this, CHECK_NULL); | |
167 h_ak = objArrayKlassHandle(THREAD, oak); | |
168 h_ak->set_lower_dimension(h_this()); | |
169 h_this->set_higher_dimension(h_ak()); | |
170 assert(h_ak->oop_is_objArray(), "incorrect initialization of objArrayKlass"); | |
171 } | |
172 } | |
173 } else { | |
174 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); | |
175 } | |
176 if (or_null) { | |
177 return h_ak->array_klass_or_null(n); | |
178 } | |
179 return h_ak->array_klass(n, CHECK_NULL); | |
180 } | |
181 | |
182 klassOop typeArrayKlass::array_klass_impl(bool or_null, TRAPS) { | |
183 return array_klass_impl(or_null, dimension() + 1, THREAD); | |
184 } | |
185 | |
186 int typeArrayKlass::oop_size(oop obj) const { | |
187 assert(obj->is_typeArray(),"must be a type array"); | |
188 typeArrayOop t = typeArrayOop(obj); | |
189 return t->object_size(); | |
190 } | |
191 | |
192 void typeArrayKlass::oop_follow_contents(oop obj) { | |
193 assert(obj->is_typeArray(),"must be a type array"); | |
194 // Performance tweak: We skip iterating over the klass pointer since we | |
195 // know that Universe::typeArrayKlass never moves. | |
196 } | |
197 | |
198 #ifndef SERIALGC | |
199 void typeArrayKlass::oop_follow_contents(ParCompactionManager* cm, oop obj) { | |
200 assert(obj->is_typeArray(),"must be a type array"); | |
201 // Performance tweak: We skip iterating over the klass pointer since we | |
202 // know that Universe::typeArrayKlass never moves. | |
203 } | |
204 #endif // SERIALGC | |
205 | |
206 int typeArrayKlass::oop_adjust_pointers(oop obj) { | |
207 assert(obj->is_typeArray(),"must be a type array"); | |
208 typeArrayOop t = typeArrayOop(obj); | |
209 // Performance tweak: We skip iterating over the klass pointer since we | |
210 // know that Universe::typeArrayKlass never moves. | |
211 return t->object_size(); | |
212 } | |
213 | |
214 int typeArrayKlass::oop_oop_iterate(oop obj, OopClosure* blk) { | |
215 assert(obj->is_typeArray(),"must be a type array"); | |
216 typeArrayOop t = typeArrayOop(obj); | |
217 // Performance tweak: We skip iterating over the klass pointer since we | |
218 // know that Universe::typeArrayKlass never moves. | |
219 return t->object_size(); | |
220 } | |
221 | |
222 int typeArrayKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { | |
223 assert(obj->is_typeArray(),"must be a type array"); | |
224 typeArrayOop t = typeArrayOop(obj); | |
225 // Performance tweak: We skip iterating over the klass pointer since we | |
226 // know that Universe::typeArrayKlass never moves. | |
227 return t->object_size(); | |
228 } | |
229 | |
230 #ifndef SERIALGC | |
231 void typeArrayKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) { | |
232 assert(obj->is_typeArray(),"must be a type array"); | |
233 } | |
234 | |
235 void typeArrayKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { | |
236 assert(obj->is_typeArray(),"must be a type array"); | |
237 } | |
238 | |
239 int | |
240 typeArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { | |
241 assert(obj->is_typeArray(),"must be a type array"); | |
242 return typeArrayOop(obj)->object_size(); | |
243 } | |
244 | |
245 int | |
246 typeArrayKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, | |
247 HeapWord* beg_addr, HeapWord* end_addr) { | |
248 assert(obj->is_typeArray(),"must be a type array"); | |
249 return typeArrayOop(obj)->object_size(); | |
250 } | |
251 #endif // SERIALGC | |
252 | |
253 void typeArrayKlass::initialize(TRAPS) { | |
254 // Nothing to do. Having this function is handy since objArrayKlasses can be | |
255 // initialized by calling initialize on their bottom_klass, see objArrayKlass::initialize | |
256 } | |
257 | |
258 const char* typeArrayKlass::external_name(BasicType type) { | |
259 switch (type) { | |
260 case T_BOOLEAN: return "[Z"; | |
261 case T_CHAR: return "[C"; | |
262 case T_FLOAT: return "[F"; | |
263 case T_DOUBLE: return "[D"; | |
264 case T_BYTE: return "[B"; | |
265 case T_SHORT: return "[S"; | |
266 case T_INT: return "[I"; | |
267 case T_LONG: return "[J"; | |
268 default: ShouldNotReachHere(); | |
269 } | |
270 return NULL; | |
271 } | |
272 | |
273 #ifndef PRODUCT | |
274 // Printing | |
275 | |
276 static void print_boolean_array(typeArrayOop ta, int print_len, outputStream* st) { | |
277 for (int index = 0; index < print_len; index++) { | |
278 st->print_cr(" - %3d: %s", index, (ta->bool_at(index) == 0) ? "false" : "true"); | |
279 } | |
280 } | |
281 | |
282 | |
283 static void print_char_array(typeArrayOop ta, int print_len, outputStream* st) { | |
284 for (int index = 0; index < print_len; index++) { | |
285 jchar c = ta->char_at(index); | |
286 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' '); | |
287 } | |
288 } | |
289 | |
290 | |
291 static void print_float_array(typeArrayOop ta, int print_len, outputStream* st) { | |
292 for (int index = 0; index < print_len; index++) { | |
293 st->print_cr(" - %3d: %g", index, ta->float_at(index)); | |
294 } | |
295 } | |
296 | |
297 | |
298 static void print_double_array(typeArrayOop ta, int print_len, outputStream* st) { | |
299 for (int index = 0; index < print_len; index++) { | |
300 st->print_cr(" - %3d: %g", index, ta->double_at(index)); | |
301 } | |
302 } | |
303 | |
304 | |
305 static void print_byte_array(typeArrayOop ta, int print_len, outputStream* st) { | |
306 for (int index = 0; index < print_len; index++) { | |
307 jbyte c = ta->byte_at(index); | |
308 st->print_cr(" - %3d: %x %c", index, c, isprint(c) ? c : ' '); | |
309 } | |
310 } | |
311 | |
312 | |
313 static void print_short_array(typeArrayOop ta, int print_len, outputStream* st) { | |
314 for (int index = 0; index < print_len; index++) { | |
315 int v = ta->ushort_at(index); | |
316 st->print_cr(" - %3d: 0x%x\t %d", index, v, v); | |
317 } | |
318 } | |
319 | |
320 | |
321 static void print_int_array(typeArrayOop ta, int print_len, outputStream* st) { | |
322 for (int index = 0; index < print_len; index++) { | |
323 jint v = ta->int_at(index); | |
324 st->print_cr(" - %3d: 0x%x %d", index, v, v); | |
325 } | |
326 } | |
327 | |
328 | |
329 static void print_long_array(typeArrayOop ta, int print_len, outputStream* st) { | |
330 for (int index = 0; index < print_len; index++) { | |
331 jlong v = ta->long_at(index); | |
332 st->print_cr(" - %3d: 0x%x 0x%x", index, high(v), low(v)); | |
333 } | |
334 } | |
335 | |
336 | |
337 void typeArrayKlass::oop_print_on(oop obj, outputStream* st) { | |
338 arrayKlass::oop_print_on(obj, st); | |
339 typeArrayOop ta = typeArrayOop(obj); | |
340 int print_len = MIN2((intx) ta->length(), MaxElementPrintSize); | |
341 switch (element_type()) { | |
342 case T_BOOLEAN: print_boolean_array(ta, print_len, st); break; | |
343 case T_CHAR: print_char_array(ta, print_len, st); break; | |
344 case T_FLOAT: print_float_array(ta, print_len, st); break; | |
345 case T_DOUBLE: print_double_array(ta, print_len, st); break; | |
346 case T_BYTE: print_byte_array(ta, print_len, st); break; | |
347 case T_SHORT: print_short_array(ta, print_len, st); break; | |
348 case T_INT: print_int_array(ta, print_len, st); break; | |
349 case T_LONG: print_long_array(ta, print_len, st); break; | |
350 default: ShouldNotReachHere(); | |
351 } | |
352 int remaining = ta->length() - print_len; | |
353 if (remaining > 0) { | |
354 tty->print_cr(" - <%d more elements, increase MaxElementPrintSize to print>", remaining); | |
355 } | |
356 } | |
357 | |
358 #endif // PRODUCT | |
359 | |
360 const char* typeArrayKlass::internal_name() const { | |
361 return Klass::external_name(); | |
362 } |