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.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 void Parse::do_field_access(bool is_get, bool is_field) {
44 bool will_link;
45 ciField* field = iter().get_field(will_link);
46 assert(will_link, "getfield: typeflow responsibility");
47
48 ciInstanceKlass* field_holder = field->holder();
49
50 if (is_field == field->is_static()) {
51 // Interpreter will throw java_lang_IncompatibleClassChangeError
52 // Check this before allowing <clinit> methods to access static fields
53 uncommon_trap(Deoptimization::Reason_unhandled,
54 Deoptimization::Action_none);
55 return;
56 }
57
58 // Deoptimize on putfield writes to call site target field.
59 if (!is_get && field->is_call_site_target()) {
60 uncommon_trap(Deoptimization::Reason_unhandled,
61 Deoptimization::Action_reinterpret,
62 NULL, "put to call site target field");
63 return;
64 }
65
66 if (C->needs_clinit_barrier(field, method())) {
67 clinit_barrier(field_holder, method());
68 if (stopped()) return;
69 }
70
71 assert(field->will_link(method(), bc()), "getfield: typeflow responsibility");
72
73 // Note: We do not check for an unloaded field type here any more.
74
75 // Generate code for the object pointer.
76 Node* obj;
77 if (is_field) {
78 int obj_depth = is_get ? 0 : field->type()->size();
79 obj = null_check(peek(obj_depth));
80 // Compile-time detect of null-exception?
81 if (stopped()) return;
82
83 #ifdef ASSERT
84 const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder());
85 assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed");
86 #endif
87
88 if (is_get) {
89 (void) pop(); // pop receiver before getting
90 do_get_xxx(obj, field, is_field);
91 } else {
92 do_put_xxx(obj, field, is_field);
93 (void) pop(); // pop receiver after putting
94 }
95 } else {
96 const TypeInstPtr* tip = TypeInstPtr::make(field_holder->java_mirror());
97 obj = _gvn.makecon(tip);
98 if (is_get) {
99 do_get_xxx(obj, field, is_field);
100 } else {
101 do_put_xxx(obj, field, is_field);
102 }
103 }
104 }
105
106
107 void Parse::do_get_xxx(Node* obj, ciField* field, bool is_field) {
108 BasicType bt = field->layout_type();
109
110 // Does this field have a constant value? If so, just push the value.
111 if (field->is_constant() &&
112 // Keep consistent with types found by ciTypeFlow: for an
113 // unloaded field type, ciTypeFlow::StateVector::do_getstatic()
114 // speculates the field is null. The code in the rest of this
115 // method does the same. We must not bypass it and use a non
116 // null constant here.
117 (bt != T_OBJECT || field->type()->is_loaded())) {
118 // final or stable field
119 Node* con = make_constant_from_field(field, obj);
120 if (con != NULL) {
121 push_node(field->layout_type(), con);
122 return;
123 }
124 }
125
126 ciType* field_klass = field->type();
127 bool is_vol = field->is_volatile();
128
129 // Compute address and memory type.
130 int offset = field->offset_in_bytes();
131 const TypePtr* adr_type = C->alias_type(field)->adr_type();
132 Node *adr = basic_plus_adr(obj, obj, offset);
133
134 // Build the resultant type of the load
135 const Type *type;
136
137 bool must_assert_null = false;
138
139 DecoratorSet decorators = IN_HEAP;
140 decorators |= is_vol ? MO_SEQ_CST : MO_UNORDERED;
141
142 bool is_obj = bt == T_OBJECT || bt == T_ARRAY;
143
144 if (is_obj) {
145 if (!field->type()->is_loaded()) {
146 type = TypeInstPtr::BOTTOM;
147 must_assert_null = true;
148 } else if (field->is_static_constant()) {
149 // This can happen if the constant oop is non-perm.
150 ciObject* con = field->constant_value().as_object();
151 // Do not "join" in the previous type; it doesn't add value,
152 // and may yield a vacuous result if the field is of interface type.
153 if (con->is_null_object()) {
154 type = TypePtr::NULL_PTR;
155 } else {
156 type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
157 }
158 assert(type != NULL, "field singleton type must be consistent");
159 } else {
160 type = TypeOopPtr::make_from_klass(field_klass->as_klass());
161 }
162 } else {
163 type = Type::get_const_basic_type(bt);
164 }
165
166 Node* ld = access_load_at(obj, adr, adr_type, type, bt, decorators);
167
168 // Adjust Java stack
169 if (type2size[bt] == 1)
170 push(ld);
171 else
172 push_pair(ld);
173
174 if (must_assert_null) {
175 // Do not take a trap here. It's possible that the program
176 // will never load the field's class, and will happily see
177 // null values in this field forever. Don't stumble into a
178 // trap for such a program, or we might get a long series
179 // of useless recompilations. (Or, we might load a class
180 // which should not be loaded.) If we ever see a non-null
181 // value, we will then trap and recompile. (The trap will
182 // not need to mention the class index, since the class will
183 // already have been loaded if we ever see a non-null value.)
184 // uncommon_trap(iter().get_field_signature_index());
185 if (PrintOpto && (Verbose || WizardMode)) {
186 method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci());
193 set_bci(iter().next_bci());
194 null_assert(peek());
195 set_bci(iter().cur_bci()); // put it back
196 }
197 }
198
199 void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) {
200 bool is_vol = field->is_volatile();
201
202 // Compute address and memory type.
203 int offset = field->offset_in_bytes();
204 const TypePtr* adr_type = C->alias_type(field)->adr_type();
205 Node* adr = basic_plus_adr(obj, obj, offset);
206 BasicType bt = field->layout_type();
207 // Value to be stored
208 Node* val = type2size[bt] == 1 ? pop() : pop_pair();
209
210 DecoratorSet decorators = IN_HEAP;
211 decorators |= is_vol ? MO_SEQ_CST : MO_UNORDERED;
212
213 bool is_obj = bt == T_OBJECT || bt == T_ARRAY;
214
215 // Store the value.
216 const Type* field_type;
217 if (!field->type()->is_loaded()) {
218 field_type = TypeInstPtr::BOTTOM;
219 } else {
220 if (is_obj) {
221 field_type = TypeOopPtr::make_from_klass(field->type()->as_klass());
222 } else {
223 field_type = Type::BOTTOM;
224 }
225 }
226 access_store_at(obj, adr, adr_type, val, field_type, bt, decorators);
227
228 if (is_field) {
229 // Remember we wrote a volatile field.
230 // For not multiple copy atomic cpu (ppc64) a barrier should be issued
231 // in constructors which have such stores. See do_exits() in parse1.cpp.
232 if (is_vol) {
233 set_wrote_volatile(true);
234 }
235 set_wrote_fields(true);
236
237 // If the field is final, the rules of Java say we are in <init> or <clinit>.
238 // Note the presence of writes to final non-static fields, so that we
239 // can insert a memory barrier later on to keep the writes from floating
240 // out of the constructor.
241 // Any method can write a @Stable field; insert memory barriers after those also.
242 if (field->is_final()) {
243 set_wrote_final(true);
244 if (AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) {
245 // Preserve allocation ptr to create precedent edge to it in membar
246 // generated on exit from constructor.
247 // Can't bind stable with its allocation, only record allocation for final field.
248 set_alloc_with_final(obj);
249 }
250 }
251 if (field->is_stable()) {
252 set_wrote_stable(true);
253 }
254 }
255 }
256
257 //=============================================================================
258 void Parse::do_anewarray() {
259 bool will_link;
260 ciKlass* klass = iter().get_klass(will_link);
261
262 // Uncommon Trap when class that array contains is not loaded
263 // we need the loaded class for the rest of graph; do not
264 // initialize the container class (see Java spec)!!!
265 assert(will_link, "anewarray: typeflow responsibility");
266
267 ciObjArrayKlass* array_klass = ciObjArrayKlass::make(klass);
268 // Check that array_klass object is loaded
269 if (!array_klass->is_loaded()) {
270 // Generate uncommon_trap for unloaded array_class
271 uncommon_trap(Deoptimization::Reason_unloaded,
272 Deoptimization::Action_reinterpret,
273 array_klass);
274 return;
275 }
276
277 kill_dead_locals();
278
279 const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass);
280 Node* count_val = pop();
281 Node* obj = new_array(makecon(array_klass_type), count_val, 1);
282 push(obj);
283 }
284
285
286 void Parse::do_newarray(BasicType elem_type) {
287 kill_dead_locals();
288
289 Node* count_val = pop();
290 const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type));
291 Node* obj = new_array(makecon(array_klass), count_val, 1);
292 // Push resultant oop onto stack
293 push(obj);
|
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.hpp"
29 #include "oops/objArrayKlass.hpp"
30 #include "oops/valueArrayKlass.hpp"
31 #include "opto/addnode.hpp"
32 #include "opto/castnode.hpp"
33 #include "opto/memnode.hpp"
34 #include "opto/parse.hpp"
35 #include "opto/rootnode.hpp"
36 #include "opto/runtime.hpp"
37 #include "opto/subnode.hpp"
38 #include "opto/valuetypenode.hpp"
39 #include "runtime/deoptimization.hpp"
40 #include "runtime/handles.inline.hpp"
41
42 //=============================================================================
43 // Helper methods for _get* and _put* bytecodes
44 //=============================================================================
45
46 void Parse::do_field_access(bool is_get, bool is_field) {
47 bool will_link;
48 ciField* field = iter().get_field(will_link);
49 assert(will_link, "getfield: typeflow responsibility");
50
51 ciInstanceKlass* field_holder = field->holder();
52
53 if (is_field && field_holder->is_valuetype() && peek()->is_ValueType()) {
54 assert(is_get, "value type field store not supported");
55 ValueTypeNode* vt = pop()->as_ValueType();
56 Node* value = vt->field_value_by_offset(field->offset());
57 push_node(field->layout_type(), value);
58 return;
59 }
60
61 if (is_field == field->is_static()) {
62 // Interpreter will throw java_lang_IncompatibleClassChangeError
63 // Check this before allowing <clinit> methods to access static fields
64 uncommon_trap(Deoptimization::Reason_unhandled,
65 Deoptimization::Action_none);
66 return;
67 }
68
69 // Deoptimize on putfield writes to call site target field.
70 if (!is_get && field->is_call_site_target()) {
71 uncommon_trap(Deoptimization::Reason_unhandled,
72 Deoptimization::Action_reinterpret,
73 NULL, "put to call site target field");
74 return;
75 }
76
77 if (C->needs_clinit_barrier(field, method())) {
78 clinit_barrier(field_holder, method());
79 if (stopped()) return;
80 }
81
82 assert(field->will_link(method(), bc()), "getfield: typeflow responsibility");
83
84 // Note: We do not check for an unloaded field type here any more.
85
86 // Generate code for the object pointer.
87 Node* obj;
88 if (is_field) {
89 int obj_depth = is_get ? 0 : field->type()->size();
90 obj = null_check(peek(obj_depth));
91 // Compile-time detect of null-exception?
92 if (stopped()) return;
93
94 #ifdef ASSERT
95 const TypeInstPtr *tjp = TypeInstPtr::make(TypePtr::NotNull, iter().get_declared_field_holder());
96 assert(_gvn.type(obj)->higher_equal(tjp), "cast_up is no longer needed");
97 #endif
98
99 if (is_get) {
100 (void) pop(); // pop receiver before getting
101 do_get_xxx(obj, field);
102 } else {
103 do_put_xxx(obj, field, is_field);
104 if (stopped()) {
105 return;
106 }
107 (void) pop(); // pop receiver after putting
108 }
109 } else {
110 const TypeInstPtr* tip = TypeInstPtr::make(field_holder->java_mirror());
111 obj = _gvn.makecon(tip);
112 if (is_get) {
113 do_get_xxx(obj, field);
114 } else {
115 do_put_xxx(obj, field, is_field);
116 }
117 }
118 }
119
120 void Parse::do_get_xxx(Node* obj, ciField* field) {
121 BasicType bt = field->layout_type();
122
123 // Does this field have a constant value? If so, just push the value.
124 if (field->is_constant() &&
125 // Keep consistent with types found by ciTypeFlow: for an
126 // unloaded field type, ciTypeFlow::StateVector::do_getstatic()
127 // speculates the field is null. The code in the rest of this
128 // method does the same. We must not bypass it and use a non
129 // null constant here.
130 (bt != T_OBJECT || field->type()->is_loaded())) {
131 // final or stable field
132 Node* con = make_constant_from_field(field, obj);
133 if (con != NULL) {
134 push_node(field->layout_type(), con);
135 return;
136 }
137 }
138
139 ciType* field_klass = field->type();
140 bool is_vol = field->is_volatile();
141 bool flattened = field->is_flattened();
142 bool flattenable = field->is_flattenable();
143
144 // Compute address and memory type.
145 int offset = field->offset_in_bytes();
146 const TypePtr* adr_type = C->alias_type(field)->adr_type();
147 Node *adr = basic_plus_adr(obj, obj, offset);
148
149 // Build the resultant type of the load
150 const Type *type;
151
152 bool must_assert_null = false;
153
154 if (bt == T_OBJECT || bt == T_ARRAY || bt == T_VALUETYPE) {
155 if (!field->type()->is_loaded()) {
156 type = TypeInstPtr::BOTTOM;
157 must_assert_null = true;
158 } else if (field->is_static_constant()) {
159 // This can happen if the constant oop is non-perm.
160 ciObject* con = field->constant_value().as_object();
161 // Do not "join" in the previous type; it doesn't add value,
162 // and may yield a vacuous result if the field is of interface type.
163 if (con->is_null_object()) {
164 type = TypePtr::NULL_PTR;
165 } else {
166 type = TypeOopPtr::make_from_constant(con)->isa_oopptr();
167 }
168 assert(type != NULL, "field singleton type must be consistent");
169 } else {
170 type = TypeOopPtr::make_from_klass(field_klass->as_klass());
171 if (bt == T_VALUETYPE && field->is_static() && flattenable) {
172 // Check if static value type field is already initialized
173 assert(!flattened, "static fields should not be flattened");
174 ciInstance* mirror = field->holder()->java_mirror();
175 ciObject* val = mirror->field_value(field).as_object();
176 if (!val->is_null_object()) {
177 type = type->join_speculative(TypePtr::NOTNULL);
178 }
179 }
180 }
181 } else {
182 type = Type::get_const_basic_type(bt);
183 }
184
185 Node* ld = NULL;
186 if (flattened) {
187 // Load flattened value type
188 ld = ValueTypeNode::make_from_flattened(this, field_klass->as_value_klass(), obj, obj, field->holder(), offset);
189 } else {
190 DecoratorSet decorators = IN_HEAP;
191 decorators |= is_vol ? MO_SEQ_CST : MO_UNORDERED;
192 ld = access_load_at(obj, adr, adr_type, type, bt, decorators);
193 if (flattenable) {
194 // Load a non-flattened but flattenable value type from memory
195 if (field_klass->as_value_klass()->is_scalarizable()) {
196 ld = ValueTypeNode::make_from_oop(this, ld, field_klass->as_value_klass());
197 } else {
198 ld = null2default(ld, field_klass->as_value_klass());
199 }
200 }
201 }
202
203 // Adjust Java stack
204 if (type2size[bt] == 1)
205 push(ld);
206 else
207 push_pair(ld);
208
209 if (must_assert_null) {
210 // Do not take a trap here. It's possible that the program
211 // will never load the field's class, and will happily see
212 // null values in this field forever. Don't stumble into a
213 // trap for such a program, or we might get a long series
214 // of useless recompilations. (Or, we might load a class
215 // which should not be loaded.) If we ever see a non-null
216 // value, we will then trap and recompile. (The trap will
217 // not need to mention the class index, since the class will
218 // already have been loaded if we ever see a non-null value.)
219 // uncommon_trap(iter().get_field_signature_index());
220 if (PrintOpto && (Verbose || WizardMode)) {
221 method()->print_name(); tty->print_cr(" asserting nullness of field at bci: %d", bci());
228 set_bci(iter().next_bci());
229 null_assert(peek());
230 set_bci(iter().cur_bci()); // put it back
231 }
232 }
233
234 void Parse::do_put_xxx(Node* obj, ciField* field, bool is_field) {
235 bool is_vol = field->is_volatile();
236
237 // Compute address and memory type.
238 int offset = field->offset_in_bytes();
239 const TypePtr* adr_type = C->alias_type(field)->adr_type();
240 Node* adr = basic_plus_adr(obj, obj, offset);
241 BasicType bt = field->layout_type();
242 // Value to be stored
243 Node* val = type2size[bt] == 1 ? pop() : pop_pair();
244
245 DecoratorSet decorators = IN_HEAP;
246 decorators |= is_vol ? MO_SEQ_CST : MO_UNORDERED;
247
248 // Store the value.
249 const Type* field_type;
250 if (!field->type()->is_loaded()) {
251 field_type = TypeInstPtr::BOTTOM;
252 } else {
253 if (bt == T_OBJECT || bt == T_ARRAY || bt == T_VALUETYPE) {
254 field_type = TypeOopPtr::make_from_klass(field->type()->as_klass());
255 } else {
256 field_type = Type::BOTTOM;
257 }
258 }
259
260 if (field->is_flattenable() && !val->is_ValueType()) {
261 inc_sp(1);
262 val = null_check(val);
263 dec_sp(1);
264 if (stopped()) return;
265 }
266
267 if (field->is_flattened()) {
268 // Store flattened value type to a non-static field
269 if (!val->is_ValueType()) {
270 assert(!gvn().type(val)->maybe_null(), "should never be null");
271 val = ValueTypeNode::make_from_oop(this, val, field->type()->as_value_klass());
272 }
273 val->as_ValueType()->store_flattened(this, obj, obj, field->holder(), offset);
274 } else {
275 access_store_at(obj, adr, adr_type, val, field_type, bt, decorators);
276 }
277
278 if (is_field) {
279 // Remember we wrote a volatile field.
280 // For not multiple copy atomic cpu (ppc64) a barrier should be issued
281 // in constructors which have such stores. See do_exits() in parse1.cpp.
282 if (is_vol) {
283 set_wrote_volatile(true);
284 }
285 set_wrote_fields(true);
286
287 // If the field is final, the rules of Java say we are in <init> or <clinit>.
288 // Note the presence of writes to final non-static fields, so that we
289 // can insert a memory barrier later on to keep the writes from floating
290 // out of the constructor.
291 // Any method can write a @Stable field; insert memory barriers after those also.
292 if (field->is_final()) {
293 set_wrote_final(true);
294 if (AllocateNode::Ideal_allocation(obj, &_gvn) != NULL) {
295 // Preserve allocation ptr to create precedent edge to it in membar
296 // generated on exit from constructor.
297 // Can't bind stable with its allocation, only record allocation for final field.
298 set_alloc_with_final(obj);
299 }
300 }
301 if (field->is_stable()) {
302 set_wrote_stable(true);
303 }
304 }
305 }
306
307 //=============================================================================
308
309 void Parse::do_newarray() {
310 bool will_link;
311 ciKlass* klass = iter().get_klass(will_link);
312 bool never_null = iter().is_klass_never_null();
313
314 // Uncommon Trap when class that array contains is not loaded
315 // we need the loaded class for the rest of graph; do not
316 // initialize the container class (see Java spec)!!!
317 assert(will_link, "newarray: typeflow responsibility");
318
319 ciArrayKlass* array_klass = ciArrayKlass::make(klass, never_null);
320
321 // Check that array_klass object is loaded
322 if (!array_klass->is_loaded()) {
323 // Generate uncommon_trap for unloaded array_class
324 uncommon_trap(Deoptimization::Reason_unloaded,
325 Deoptimization::Action_reinterpret,
326 array_klass);
327 return;
328 } else if (array_klass->element_klass() != NULL &&
329 array_klass->element_klass()->is_valuetype() &&
330 !array_klass->element_klass()->as_value_klass()->is_initialized()) {
331 uncommon_trap(Deoptimization::Reason_uninitialized,
332 Deoptimization::Action_reinterpret,
333 NULL);
334 return;
335 }
336
337 kill_dead_locals();
338
339 const TypeKlassPtr* array_klass_type = TypeKlassPtr::make(array_klass);
340 Node* count_val = pop();
341 Node* obj = new_array(makecon(array_klass_type), count_val, 1);
342 push(obj);
343 }
344
345
346 void Parse::do_newarray(BasicType elem_type) {
347 kill_dead_locals();
348
349 Node* count_val = pop();
350 const TypeKlassPtr* array_klass = TypeKlassPtr::make(ciTypeArrayKlass::make(elem_type));
351 Node* obj = new_array(makecon(array_klass), count_val, 1);
352 // Push resultant oop onto stack
353 push(obj);
|