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