1 /*
2 * Copyright (c) 1998, 2013, 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 "compiler/compileLog.hpp"
27 #include "interpreter/linkResolver.hpp"
28 #include "memory/universe.inline.hpp"
29 #include "oops/objArrayKlass.hpp"
30 #include "opto/addnode.hpp"
31 #include "opto/castnode.hpp"
32 #include "opto/memnode.hpp"
33 #include "opto/parse.hpp"
34 #include "opto/rootnode.hpp"
35 #include "opto/runtime.hpp"
36 #include "opto/subnode.hpp"
37 #include "runtime/deoptimization.hpp"
38 #include "runtime/handles.inline.hpp"
39
40 //=============================================================================
41 // Helper methods for _get* and _put* bytecodes
42 //=============================================================================
43 bool Parse::static_field_ok_in_clinit(ciField *field, ciMethod *method) {
44 // Could be the field_holder's <clinit> method, or <clinit> for a subklass.
45 // Better to check now than to Deoptimize as soon as we execute
46 assert( field->is_static(), "Only check if field is static");
47 // is_being_initialized() is too generous. It allows access to statics
48 // by threads that are not running the <clinit> before the <clinit> finishes.
49 // return field->holder()->is_being_initialized();
50
51 // The following restriction is correct but conservative.
52 // It is also desirable to allow compilation of methods called from <clinit>
53 // but this generated code will need to be made safe for execution by
54 // other threads, or the transition from interpreted to compiled code would
55 // need to be guarded.
56 ciInstanceKlass *field_holder = field->holder();
57
58 bool access_OK = false;
59 if (method->holder()->is_subclass_of(field_holder)) {
60 if (method->is_static()) {
61 if (method->name() == ciSymbol::class_initializer_name()) {
62 // OK to access static fields inside initializer
63 access_OK = true;
64 }
65 } else {
66 if (method->name() == ciSymbol::object_initializer_name()) {
67 // It's also OK to access static fields inside a constructor,
68 // because any thread calling the constructor must first have
69 // synchronized on the class by executing a '_new' bytecode.
70 access_OK = true;
71 }
72 }
73 }
74
75 return access_OK;
76
77 }
78
79
80 void Parse::do_field_access(bool is_get, bool is_field) {
81 bool will_link;
82 ciField* field = iter().get_field(will_link);
83 assert(will_link, "getfield: typeflow responsibility");
84
85 ciInstanceKlass* field_holder = field->holder();
86
87 if (is_field == field->is_static()) {
88 // Interpreter will throw java_lang_IncompatibleClassChangeError
89 // Check this before allowing <clinit> methods to access static fields
90 uncommon_trap(Deoptimization::Reason_unhandled,
91 Deoptimization::Action_none);
92 return;
93 }
94
95 if (!is_field && !field_holder->is_initialized()) {
96 if (!static_field_ok_in_clinit(field, method())) {
97 uncommon_trap(Deoptimization::Reason_uninitialized,
98 Deoptimization::Action_reinterpret,
99 NULL, "!static_field_ok_in_clinit");
100 return;
101 }
102 }
103
104 // Deoptimize on putfield writes to call site target field.
105 if (!is_get && field->is_call_site_target()) {
106 uncommon_trap(Deoptimization::Reason_unhandled,
107 Deoptimization::Action_reinterpret,
108 NULL, "put to call site target field");
109 return;
110 }
111
112 assert(field->will_link(method(), bc()), "getfield: typeflow responsibility");
113
114 // Note: We do not check for an unloaded field type here any more.
115
116 // Generate code for the object pointer.
117 Node* obj;
118 if (is_field) {
119 int obj_depth = is_get ? 0 : field->type()->size();
120 obj = null_check(peek(obj_depth));
121 // Compile-time detect of null-exception?
122 if (stopped()) return;
123
124 #ifdef ASSERT
125 const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder());
126 assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed");
127 #endif
128
129 if (is_get) {
130 (void) pop(); // pop receiver before getting
131 do_get_xxx(obj, field, is_field);
132 } else {
133 do_put_xxx(obj, field, is_field);
134 (void) pop(); // pop receiver after putting
135 }
136 } else {
137 const TypeInstPtr* tip = TypeInstPtr::make(field_holder->java_mirror());
138 obj = _gvn.makecon(tip);
139 if (is_get) {
140 do_get_xxx(obj, field, is_field);
141 } else {
142 do_put_xxx(obj, field, is_field);
143 }
144 }
145 }
146
147
148 void Parse::do_get_xxx(Node* obj, ciField* field, bool is_field) {
149 // Does this field have a constant value? If so, just push the value.
150 if (field->is_constant()) {
151 // final or stable field
152 Node* con = make_constant_from_field(field, obj);
153 if (con != NULL) {
154 push_node(field->layout_type(), con);
155 return;
156 }
157 }
158
159 ciType* field_klass = field->type();
160 bool is_vol = field->is_volatile();
161
162 // Compute address and memory type.
163 int offset = field->offset_in_bytes();
164 const TypePtr* adr_type = C->alias_type(field)->adr_type();
165 Node *adr = basic_plus_adr(obj, obj, offset);
166 BasicType bt = field->layout_type();
167
168 // Build the resultant type of the load
169 const Type *type;
170
171 bool must_assert_null = false;
172
173 C2DecoratorSet decorators = C2_ACCESS_ON_HEAP | C2_ACCESS_FREE_CONTROL;
174 decorators |= is_vol ? C2_MO_VOLATILE : C2_MO_RELAXED;
175
176 bool is_obj = bt == T_OBJECT || bt == T_ARRAY;
177
178 if (is_obj) {
179 if (!field->type()->is_loaded()) {
180 type = TypeInstPtr::BOTTOM;
181 must_assert_null = true;
182 } else if (field->is_static_constant()) {
183 // This can happen if the constant oop is non-perm.
184 ciObject* con = field->constant_value().as_object();
185 // Do not "join" in the previous type; it doesn't add value,
186 // and may yield a vacuous result if the field is of interface type.
187 if (con->is_null_object()) {
188 type = TypePtr::NULL_PTR;
189 } else {
190 type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
191 }
192 assert(type != NULL, "field singleton type must be consistent");
193 } else {
194 type = TypeOopPtr::make_from_klass(field_klass->as_klass());
195 }
196 } else {
197 type = Type::get_const_basic_type(bt);
198 }
199
200 Node* ld = access_load_at(obj, adr, adr_type, type, bt, decorators);
201
202 // Adjust Java stack
203 if (type2size[bt] == 1)
204 push(ld);
205 else
206 push_pair(ld);
207
208 if (must_assert_null) {
209 // Do not take a trap here. It's possible that the program
210 // will never load the field's class, and will happily see
211 // null values in this field forever. Don't stumble into a
212 // trap for such a program, or we might get a long series
213 // of useless recompilations. (Or, we might load a class
214 // which should not be loaded.) If we ever see a non-null
215 // value, we will then trap and recompile. (The trap will
216 // not need to mention the class index, since the class will
217 // already have been loaded if we ever see a non-null value.)
218 // uncommon_trap(iter().get_field_signature_index());
219 if (PrintOpto && (Verbose || WizardMode)) {
220 method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci());
221 }
222 if (C->log() != NULL) {
223 C->log()->elem("assert_null reason='field' klass='%d'",
224 C->log()->identify(field->type()));
225 }
226 // If there is going to be a trap, put it at the next bytecode:
227 set_bci(iter().next_bci());
228 null_assert(peek());
229 set_bci(iter().cur_bci()); // put it back
230 }
231 }
232
233 void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) {
234 bool is_vol = field->is_volatile();
235
236 // Compute address and memory type.
237 int offset = field->offset_in_bytes();
238 const TypePtr* adr_type = C->alias_type(field)->adr_type();
239 Node* adr = basic_plus_adr(obj, obj, offset);
240 BasicType bt = field->layout_type();
241 // Value to be stored
242 Node* val = type2size[bt] == 1 ? pop() : pop_pair();
243
244 C2DecoratorSet decorators = C2_ACCESS_ON_HEAP;
245 decorators |= is_vol ? C2_MO_VOLATILE : C2_MO_RELAXED;
246
247 bool is_obj = bt == T_OBJECT || bt == T_ARRAY;
248
249 // Store the value.
250 const Type* field_type;
251 if (!field->type()->is_loaded()) {
252 field_type = TypeInstPtr::BOTTOM;
253 } else {
254 if (is_obj) {
255 field_type = TypeOopPtr::make_from_klass(field->type()->as_klass());
256 } else {
257 field_type = Type::BOTTOM;
258 }
259 }
260 access_store_at(control(), obj, adr, adr_type, val, field_type, bt, decorators);
261
262 if (is_field) {
263 // Remember we wrote a volatile field.
264 // For not multiple copy atomic cpu (ppc64) a barrier should be issued
265 // in constructors which have such stores. See do_exits() in parse1.cpp.
266 if (is_vol) {
267 set_wrote_volatile(true);
268 }
269 set_wrote_fields(true);
270
271 // If the field is final, the rules of Java say we are in <init> or <clinit>.
272 // Note the presence of writes to final non-static fields, so that we
273 // can insert a memory barrier later on to keep the writes from floating
274 // out of the constructor.
275 // Any method can write a @Stable field; insert memory barriers after those also.
276 if (field->is_final()) {
277 set_wrote_final(true);
278 if (AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) {
279 // Preserve allocation ptr to create precedent edge to it in membar
280 // generated on exit from constructor.
281 // Can't bind stable with its allocation, only record allocation for final field.
282 set_alloc_with_final(obj);
283 }
284 }
285 if (field->is_stable()) {
286 set_wrote_stable(true);
287 }
288 }
289 }
290
291 //=============================================================================
292 void Parse::do_anewarray() {
293 bool will_link;
294 ciKlass* klass = iter().get_klass(will_link);
295
296 // Uncommon Trap when class that array contains is not loaded
297 // we need the loaded class for the rest of graph; do not
298 // initialize the container class (see Java spec)!!!
299 assert(will_link, "anewarray: typeflow responsibility");
300
301 ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass);
302 // Check that array_klass object is loaded
303 if (!array_klass->is_loaded()) {
304 // Generate uncommon_trap for unloaded array_class
305 uncommon_trap(Deoptimization::Reason_unloaded,
306 Deoptimization::Action_reinterpret,
307 array_klass);
308 return;
309 }
310
311 kill_dead_locals();
312
313 const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass);
314 Node* count_val = pop();
315 Node* obj = new_array(makecon(array_klass_type), count_val, 1);
316 push(obj);
317 }
318
319
320 void Parse::do_newarray(BasicType elem_type) {
321 kill_dead_locals();
322
323 Node* count_val = pop();
324 const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type));
325 Node* obj = new_array(makecon(array_klass), count_val, 1);
326 // Push resultant oop onto stack
327 push(obj);
328 }
329
330 // Expand simple expressions like new int[3][5] and new Object[2][nonConLen].
331 // Also handle the degenerate 1-dimensional case of anewarray.
332 Node* Parse::expand_multianewarray(ciArrayKlass* array_klass, Node* *lengths, int ndimensions, int nargs) {
333 Node* length = lengths[0];
334 assert(length != NULL, "");
335 Node* array = new_array(makecon(TypeKlassPtr::make(array_klass)), length, nargs);
336 if (ndimensions > 1) {
337 jint length_con = find_int_con(length, -1);
338 guarantee(length_con >= 0, "non-constant multianewarray");
339 ciArrayKlass* array_klass_1 = array_klass->as_obj_array_klass()->element_klass()->as_array_klass();
340 const TypePtr* adr_type = TypeAryPtr::OOPS;
341 const TypeOopPtr* elemtype = _gvn.type(array)->is_aryptr()->elem()->make_oopptr();
342 const intptr_t header = arrayOopDesc::base_offset_in_bytes(T_OBJECT);
343 for (jint i = 0; i < length_con; i++) {
344 Node* elem = expand_multianewarray(array_klass_1, &lengths[1], ndimensions-1, nargs);
345 intptr_t offset = header + ((intptr_t)i << LogBytesPerHeapOop);
346 Node* eaddr = basic_plus_adr(array, offset);
347 access_store_at(control(), array, eaddr, adr_type, elem, elemtype, T_OBJECT, C2_ACCESS_ON_HEAP | C2_ACCESS_ON_ARRAY);
348 }
349 }
350 return array;
351 }
352
353 void Parse::do_multianewarray() {
354 int ndimensions = iter().get_dimensions();
355
356 // the m-dimensional array
357 bool will_link;
358 ciArrayKlass* array_klass = iter().get_klass(will_link)->as_array_klass();
359 assert(will_link, "multianewarray: typeflow responsibility");
360
361 // Note: Array classes are always initialized; no is_initialized check.
362
363 kill_dead_locals();
364
365 // get the lengths from the stack (first dimension is on top)
366 Node** length = NEW_RESOURCE_ARRAY(Node*, ndimensions + 1);
367 length[ndimensions] = NULL; // terminating null for make_runtime_call
368 int j;
369 for (j = ndimensions-1; j >= 0 ; j--) length[j] = pop();
370
371 // The original expression was of this form: new T[length0][length1]...
372 // It is often the case that the lengths are small (except the last).
373 // If that happens, use the fast 1-d creator a constant number of times.
374 const jint expand_limit = MIN2((jint)MultiArrayExpandLimit, 100);
375 jint expand_count = 1; // count of allocations in the expansion
376 jint expand_fanout = 1; // running total fanout
377 for (j = 0; j < ndimensions-1; j++) {
378 jint dim_con = find_int_con(length[j], -1);
379 expand_fanout *= dim_con;
380 expand_count += expand_fanout; // count the level-J sub-arrays
381 if (dim_con <= 0
382 || dim_con > expand_limit
383 || expand_count > expand_limit) {
384 expand_count = 0;
385 break;
386 }
387 }
388
389 // Can use multianewarray instead of [a]newarray if only one dimension,
390 // or if all non-final dimensions are small constants.
391 if (ndimensions == 1 || (1 <= expand_count && expand_count <= expand_limit)) {
392 Node* obj = NULL;
393 // Set the original stack and the reexecute bit for the interpreter
394 // to reexecute the multianewarray bytecode if deoptimization happens.
395 // Do it unconditionally even for one dimension multianewarray.
396 // Note: the reexecute bit will be set in GraphKit::add_safepoint_edges()
397 // when AllocateArray node for newarray is created.
398 { PreserveReexecuteState preexecs(this);
399 inc_sp(ndimensions);
400 // Pass 0 as nargs since uncommon trap code does not need to restore stack.
401 obj = expand_multianewarray(array_klass, &length[0], ndimensions, 0);
402 } //original reexecute and sp are set back here
403 push(obj);
404 return;
405 }
406
407 address fun = NULL;
408 switch (ndimensions) {
409 case 1: ShouldNotReachHere(); break;
410 case 2: fun = OptoRuntime::multianewarray2_Java(); break;
411 case 3: fun = OptoRuntime::multianewarray3_Java(); break;
412 case 4: fun = OptoRuntime::multianewarray4_Java(); break;
413 case 5: fun = OptoRuntime::multianewarray5_Java(); break;
414 };
415 Node* c = NULL;
416
417 if (fun != NULL) {
418 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
419 OptoRuntime::multianewarray_Type(ndimensions),
420 fun, NULL, TypeRawPtr::BOTTOM,
421 makecon(TypeKlassPtr::make(array_klass)),
422 length[0], length[1], length[2],
423 (ndimensions > 2) ? length[3] : NULL,
424 (ndimensions > 3) ? length[4] : NULL);
425 } else {
426 // Create a java array for dimension sizes
427 Node* dims = NULL;
428 { PreserveReexecuteState preexecs(this);
429 inc_sp(ndimensions);
430 Node* dims_array_klass = makecon(TypeKlassPtr::make(ciArrayKlass::make(ciType::make(T_INT))));
431 dims = new_array(dims_array_klass, intcon(ndimensions), 0);
432
433 // Fill-in it with values
434 for (j = 0; j < ndimensions; j++) {
435 Node *dims_elem = array_element_address(dims, intcon(j), T_INT);
436 store_to_memory(control(), dims_elem, length[j], T_INT, TypeAryPtr::INTS, MemNode::unordered);
437 }
438 }
439
440 c = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
441 OptoRuntime::multianewarrayN_Type(),
442 OptoRuntime::multianewarrayN_Java(), NULL, TypeRawPtr::BOTTOM,
443 makecon(TypeKlassPtr::make(array_klass)),
444 dims);
445 }
446 make_slow_call_ex(c, env()->Throwable_klass(), false);
447
448 Node* res = _gvn.transform(new ProjNode(c, TypeFunc::Parms));
449
450 const Type* type = TypeOopPtr::make_from_klass_raw(array_klass);
451
452 // Improve the type: We know it's not null, exact, and of a given length.
453 type = type->is_ptr()->cast_to_ptr_type(TypePtr::NotNull);
454 type = type->is_aryptr()->cast_to_exactness(true);
455
456 const TypeInt* ltype = _gvn.find_int_type(length[0]);
457 if (ltype != NULL)
458 type = type->is_aryptr()->cast_to_size(ltype);
459
460 // We cannot sharpen the nested sub-arrays, since the top level is mutable.
461
462 Node* cast = _gvn.transform( new CheckCastPPNode(control(), res, type) );
463 push(cast);
464
465 // Possible improvements:
466 // - Make a fast path for small multi-arrays. (W/ implicit init. loops.)
467 // - Issue CastII against length[*] values, to TypeInt::POS.
468 }