1 /*
2 * Copyright (c) 2001, 2024, 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 #ifndef SHARE_OPTO_GRAPHKIT_HPP
26 #define SHARE_OPTO_GRAPHKIT_HPP
27
28 #include "ci/ciEnv.hpp"
29 #include "ci/ciMethodData.hpp"
30 #include "gc/shared/c2/barrierSetC2.hpp"
31 #include "opto/addnode.hpp"
32 #include "opto/callnode.hpp"
33 #include "opto/cfgnode.hpp"
34 #include "opto/compile.hpp"
35 #include "opto/divnode.hpp"
36 #include "opto/mulnode.hpp"
37 #include "opto/phaseX.hpp"
38 #include "opto/subnode.hpp"
39 #include "opto/type.hpp"
40 #include "runtime/deoptimization.hpp"
41
42 class BarrierSetC2;
43 class FastLockNode;
44 class FastUnlockNode;
45 class IdealKit;
46 class LibraryCallKit;
47 class Parse;
48 class RootNode;
49
50 //-----------------------------------------------------------------------------
51 //----------------------------GraphKit-----------------------------------------
52 // Toolkit for building the common sorts of subgraphs.
53 // Does not know about bytecode parsing or type-flow results.
54 // It is able to create graphs implementing the semantics of most
55 // or all bytecodes, so that it can expand intrinsics and calls.
56 // It may depend on JVMState structure, but it must not depend
57 // on specific bytecode streams.
58 class GraphKit : public Phase {
59 friend class PreserveJVMState;
60
61 protected:
62 ciEnv* _env; // Compilation environment
63 PhaseGVN &_gvn; // Some optimizations while parsing
64 SafePointNode* _map; // Parser map from JVM to Nodes
65 SafePointNode* _exceptions;// Parser map(s) for exception state(s)
66 int _bci; // JVM Bytecode Pointer
67 ciMethod* _method; // JVM Current Method
68 BarrierSetC2* _barrier_set;
69
70 private:
71 int _sp; // JVM Expression Stack Pointer; don't modify directly!
72
73 private:
74 SafePointNode* map_not_null() const {
75 assert(_map != nullptr, "must call stopped() to test for reset compiler map");
76 return _map;
77 }
78
79 public:
80 GraphKit(); // empty constructor
81 GraphKit(JVMState* jvms); // the JVM state on which to operate
82
83 #ifdef ASSERT
84 ~GraphKit() {
85 assert(failing_internal() || !has_exceptions(),
86 "unless compilation failed, user must call transfer_exceptions_into_jvms");
87 }
88 #endif
89
90 virtual Parse* is_Parse() const { return nullptr; }
91 virtual LibraryCallKit* is_LibraryCallKit() const { return nullptr; }
92
93 ciEnv* env() const { return _env; }
94 PhaseGVN& gvn() const { return _gvn; }
95 void* barrier_set_state() const { return C->barrier_set_state(); }
96
97 void record_for_igvn(Node* n) const { C->record_for_igvn(n); } // delegate to Compile
98 void remove_for_igvn(Node* n) const { C->remove_for_igvn(n); }
99
100 // Handy well-known nodes:
101 Node* null() const { return zerocon(T_OBJECT); }
102 Node* top() const { return C->top(); }
103 RootNode* root() const { return C->root(); }
104
105 // Create or find a constant node
106 Node* intcon(jint con) const { return _gvn.intcon(con); }
107 Node* longcon(jlong con) const { return _gvn.longcon(con); }
108 Node* integercon(jlong con, BasicType bt) const {
109 if (bt == T_INT) {
110 return intcon(checked_cast<jint>(con));
111 }
112 assert(bt == T_LONG, "basic type not an int or long");
113 return longcon(con);
114 }
115 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
116 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); }
117 // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
118
119 jint find_int_con(Node* n, jint value_if_unknown) {
120 return _gvn.find_int_con(n, value_if_unknown);
121 }
122 jlong find_long_con(Node* n, jlong value_if_unknown) {
123 return _gvn.find_long_con(n, value_if_unknown);
124 }
125 // (See also macro find_intptr_t_con in type.hpp, which uses one of these.)
126
127 // JVM State accessors:
128 // Parser mapping from JVM indices into Nodes.
129 // Low slots are accessed by the StartNode::enum.
130 // Then come the locals at StartNode::Parms to StartNode::Parms+max_locals();
131 // Then come JVM stack slots.
132 // Finally come the monitors, if any.
133 // See layout accessors in class JVMState.
134
135 SafePointNode* map() const { return _map; }
136 bool has_exceptions() const { return _exceptions != nullptr; }
137 JVMState* jvms() const { return map_not_null()->_jvms; }
138 int sp() const { return _sp; }
139 int bci() const { return _bci; }
140 Bytecodes::Code java_bc() const;
141 ciMethod* method() const { return _method; }
142
143 void set_jvms(JVMState* jvms) { set_map(jvms->map());
144 assert(jvms == this->jvms(), "sanity");
145 _sp = jvms->sp();
146 _bci = jvms->bci();
147 _method = jvms->has_method() ? jvms->method() : nullptr; }
148 void set_map(SafePointNode* m) { _map = m; debug_only(verify_map()); }
149 void set_sp(int sp) { assert(sp >= 0, "sp must be non-negative: %d", sp); _sp = sp; }
150 void clean_stack(int from_sp); // clear garbage beyond from_sp to top
151
152 void inc_sp(int i) { set_sp(sp() + i); }
153 void dec_sp(int i) { set_sp(sp() - i); }
154 void set_bci(int bci) { _bci = bci; }
155
156 // Make sure jvms has current bci & sp.
157 JVMState* sync_jvms() const;
158 JVMState* sync_jvms_for_reexecute();
159
160 #ifdef ASSERT
161 // Make sure JVMS has an updated copy of bci and sp.
162 // Also sanity-check method, depth, and monitor depth.
163 bool jvms_in_sync() const;
164
165 // Make sure the map looks OK.
166 void verify_map() const;
167
168 // Make sure a proposed exception state looks OK.
169 static void verify_exception_state(SafePointNode* ex_map);
170 #endif
171
172 // Clone the existing map state. (Implements PreserveJVMState.)
173 SafePointNode* clone_map();
174
175 // Reverses the work done by clone_map(). Should only be used when the node returned by
176 // clone_map() is ultimately not used. Calling Node::destruct directly in the previously
177 // mentioned circumstance instead of this method may result in use-after-free.
178 void destruct_map_clone(SafePointNode* sfp);
179
180 // Set the map to a clone of the given one.
181 void set_map_clone(SafePointNode* m);
182
183 // Tell if the compilation is failing.
184 bool failing() const { return C->failing(); }
185 bool failing_internal() const { return C->failing_internal(); }
186
187 // Set _map to null, signalling a stop to further bytecode execution.
188 // Preserve the map intact for future use, and return it back to the caller.
189 SafePointNode* stop() { SafePointNode* m = map(); set_map(nullptr); return m; }
190
191 // Stop, but first smash the map's inputs to null, to mark it dead.
192 void stop_and_kill_map();
193
194 // Tell if _map is null, or control is top.
195 bool stopped();
196
197 // Tell if this method or any caller method has exception handlers.
198 bool has_exception_handler();
199
200 // Save an exception without blowing stack contents or other JVM state.
201 // (The extra pointer is stuck with add_req on the map, beyond the JVMS.)
202 static void set_saved_ex_oop(SafePointNode* ex_map, Node* ex_oop);
203
204 // Recover a saved exception from its map.
205 static Node* saved_ex_oop(SafePointNode* ex_map);
206
207 // Recover a saved exception from its map, and remove it from the map.
208 static Node* clear_saved_ex_oop(SafePointNode* ex_map);
209
210 #ifdef ASSERT
211 // Recover a saved exception from its map, and remove it from the map.
212 static bool has_saved_ex_oop(SafePointNode* ex_map);
213 #endif
214
215 // Push an exception in the canonical position for handlers (stack(0)).
216 void push_ex_oop(Node* ex_oop) {
217 ensure_stack(1); // ensure room to push the exception
218 set_stack(0, ex_oop);
219 set_sp(1);
220 clean_stack(1);
221 }
222
223 // Detach and return an exception state.
224 SafePointNode* pop_exception_state() {
225 SafePointNode* ex_map = _exceptions;
226 if (ex_map != nullptr) {
227 _exceptions = ex_map->next_exception();
228 ex_map->set_next_exception(nullptr);
229 debug_only(verify_exception_state(ex_map));
230 }
231 return ex_map;
232 }
233
234 // Add an exception, using the given JVM state, without commoning.
235 void push_exception_state(SafePointNode* ex_map) {
236 debug_only(verify_exception_state(ex_map));
237 ex_map->set_next_exception(_exceptions);
238 _exceptions = ex_map;
239 }
240
241 // Turn the current JVM state into an exception state, appending the ex_oop.
242 SafePointNode* make_exception_state(Node* ex_oop);
243
244 // Add an exception, using the given JVM state.
245 // Combine all exceptions with a common exception type into a single state.
246 // (This is done via combine_exception_states.)
247 void add_exception_state(SafePointNode* ex_map);
248
249 // Combine all exceptions of any sort whatever into a single master state.
250 SafePointNode* combine_and_pop_all_exception_states() {
251 if (_exceptions == nullptr) return nullptr;
252 SafePointNode* phi_map = pop_exception_state();
253 SafePointNode* ex_map;
254 while ((ex_map = pop_exception_state()) != nullptr) {
255 combine_exception_states(ex_map, phi_map);
256 }
257 return phi_map;
258 }
259
260 // Combine the two exception states, building phis as necessary.
261 // The second argument is updated to include contributions from the first.
262 void combine_exception_states(SafePointNode* ex_map, SafePointNode* phi_map);
263
264 // Reset the map to the given state. If there are any half-finished phis
265 // in it (created by combine_exception_states), transform them now.
266 // Returns the exception oop. (Caller must call push_ex_oop if required.)
267 Node* use_exception_state(SafePointNode* ex_map);
268
269 // Collect exceptions from a given JVM state into my exception list.
270 void add_exception_states_from(JVMState* jvms);
271
272 // Collect all raised exceptions into the current JVM state.
273 // Clear the current exception list and map, returns the combined states.
274 JVMState* transfer_exceptions_into_jvms();
275
276 // Helper to throw a built-in exception.
277 // The JVMS must allow the bytecode to be re-executed via an uncommon trap.
278 void builtin_throw(Deoptimization::DeoptReason reason);
279 void builtin_throw(Deoptimization::DeoptReason reason,
280 ciInstance* exception_object,
281 bool allow_too_many_traps);
282 bool builtin_throw_too_many_traps(Deoptimization::DeoptReason reason,
283 ciInstance* exception_object);
284 private:
285 bool is_builtin_throw_hot(Deoptimization::DeoptReason reason);
286 ciInstance* builtin_throw_exception(Deoptimization::DeoptReason reason) const;
287
288 public:
289
290 // Helper to check the JavaThread::_should_post_on_exceptions flag
291 // and branch to an uncommon_trap if it is true (with the specified reason and must_throw)
292 void uncommon_trap_if_should_post_on_exceptions(Deoptimization::DeoptReason reason,
293 bool must_throw) ;
294
295 // Helper Functions for adding debug information
296 void kill_dead_locals();
297 #ifdef ASSERT
298 bool dead_locals_are_killed();
299 #endif
300 // The call may deoptimize. Supply required JVM state as debug info.
301 // If must_throw is true, the call is guaranteed not to return normally.
302 void add_safepoint_edges(SafePointNode* call,
303 bool must_throw = false);
304
305 // How many stack inputs does the current BC consume?
306 // And, how does the stack change after the bytecode?
307 // Returns false if unknown.
308 bool compute_stack_effects(int& inputs, int& depth);
309
310 // Add a fixed offset to a pointer
311 Node* basic_plus_adr(Node* base, Node* ptr, intptr_t offset) {
312 return basic_plus_adr(base, ptr, MakeConX(offset));
313 }
314 Node* basic_plus_adr(Node* base, intptr_t offset) {
315 return basic_plus_adr(base, base, MakeConX(offset));
316 }
317 // Add a variable offset to a pointer
318 Node* basic_plus_adr(Node* base, Node* offset) {
319 return basic_plus_adr(base, base, offset);
320 }
321 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset);
322
323
324 // Some convenient shortcuts for common nodes
325 Node* IfTrue(IfNode* iff) { return _gvn.transform(new IfTrueNode(iff)); }
326 Node* IfFalse(IfNode* iff) { return _gvn.transform(new IfFalseNode(iff)); }
327
328 Node* AddI(Node* l, Node* r) { return _gvn.transform(new AddINode(l, r)); }
329 Node* SubI(Node* l, Node* r) { return _gvn.transform(new SubINode(l, r)); }
330 Node* MulI(Node* l, Node* r) { return _gvn.transform(new MulINode(l, r)); }
331 Node* DivI(Node* ctl, Node* l, Node* r) { return _gvn.transform(new DivINode(ctl, l, r)); }
332
333 Node* AndI(Node* l, Node* r) { return _gvn.transform(new AndINode(l, r)); }
334 Node* OrI(Node* l, Node* r) { return _gvn.transform(new OrINode(l, r)); }
335 Node* XorI(Node* l, Node* r) { return _gvn.transform(new XorINode(l, r)); }
336
337 Node* MaxI(Node* l, Node* r) { return _gvn.transform(new MaxINode(l, r)); }
338 Node* MinI(Node* l, Node* r) { return _gvn.transform(new MinINode(l, r)); }
339
340 Node* LShiftI(Node* l, Node* r) { return _gvn.transform(new LShiftINode(l, r)); }
341 Node* RShiftI(Node* l, Node* r) { return _gvn.transform(new RShiftINode(l, r)); }
342 Node* URShiftI(Node* l, Node* r) { return _gvn.transform(new URShiftINode(l, r)); }
343
344 Node* CmpI(Node* l, Node* r) { return _gvn.transform(new CmpINode(l, r)); }
345 Node* CmpL(Node* l, Node* r) { return _gvn.transform(new CmpLNode(l, r)); }
346 Node* CmpP(Node* l, Node* r) { return _gvn.transform(new CmpPNode(l, r)); }
347 Node* Bool(Node* cmp, BoolTest::mask relop) { return _gvn.transform(new BoolNode(cmp, relop)); }
348
349 Node* AddP(Node* b, Node* a, Node* o) { return _gvn.transform(new AddPNode(b, a, o)); }
350
351 // Convert between int and long, and size_t.
352 // (See macros ConvI2X, etc., in type.hpp for ConvI2X, etc.)
353 Node* ConvI2L(Node* offset);
354 Node* ConvI2UL(Node* offset);
355 Node* ConvL2I(Node* offset);
356 // Find out the klass of an object.
357 Node* load_object_klass(Node* object);
358 // Find out the length of an array.
359 Node* load_array_length(Node* array);
360 // Cast array allocation's length as narrow as possible.
361 // If replace_length_in_map is true, replace length with CastIINode in map.
362 // This method is invoked after creating/moving ArrayAllocationNode or in load_array_length
363 Node* array_ideal_length(AllocateArrayNode* alloc,
364 const TypeOopPtr* oop_type,
365 bool replace_length_in_map);
366
367
368 // Helper function to do a null pointer check or ZERO check based on type.
369 // Throw an exception if a given value is null.
370 // Return the value cast to not-null.
371 // Be clever about equivalent dominating null checks.
372 Node* null_check_common(Node* value, BasicType type,
373 bool assert_null = false,
374 Node* *null_control = nullptr,
375 bool speculative = false);
376 Node* null_check(Node* value, BasicType type = T_OBJECT) {
377 return null_check_common(value, type, false, nullptr, !_gvn.type(value)->speculative_maybe_null());
378 }
379 Node* null_check_receiver() {
380 assert(argument(0)->bottom_type()->isa_ptr(), "must be");
381 return null_check(argument(0));
382 }
383 Node* zero_check_int(Node* value) {
384 assert(value->bottom_type()->basic_type() == T_INT,
385 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
386 return null_check_common(value, T_INT);
387 }
388 Node* zero_check_long(Node* value) {
389 assert(value->bottom_type()->basic_type() == T_LONG,
390 "wrong type: %s", type2name(value->bottom_type()->basic_type()));
391 return null_check_common(value, T_LONG);
392 }
393 // Throw an uncommon trap if a given value is __not__ null.
394 // Return the value cast to null, and be clever about dominating checks.
395 Node* null_assert(Node* value, BasicType type = T_OBJECT) {
396 return null_check_common(value, type, true, nullptr, _gvn.type(value)->speculative_always_null());
397 }
398
399 // Check if value is null and abort if it is
400 Node* must_be_not_null(Node* value, bool do_replace_in_map);
401
402 // Null check oop. Return null-path control into (*null_control).
403 // Return a cast-not-null node which depends on the not-null control.
404 // If never_see_null, use an uncommon trap (*null_control sees a top).
405 // The cast is not valid along the null path; keep a copy of the original.
406 // If safe_for_replace, then we can replace the value with the cast
407 // in the parsing map (the cast is guaranteed to dominate the map)
408 Node* null_check_oop(Node* value, Node* *null_control,
409 bool never_see_null = false,
410 bool safe_for_replace = false,
411 bool speculative = false);
412
413 // Check the null_seen bit.
414 bool seems_never_null(Node* obj, ciProfileData* data, bool& speculating);
415
416 void guard_klass_is_initialized(Node* klass);
417 void guard_klass_being_initialized(Node* klass);
418 void guard_init_thread(Node* klass);
419
420 void clinit_barrier(ciInstanceKlass* ik, ciMethod* context);
421
422 // Check for unique class for receiver at call
423 ciKlass* profile_has_unique_klass() {
424 ciCallProfile profile = method()->call_profile_at_bci(bci());
425 if (profile.count() >= 0 && // no cast failures here
426 profile.has_receiver(0) &&
427 profile.morphism() == 1) {
428 return profile.receiver(0);
429 }
430 return nullptr;
431 }
432
433 // record type from profiling with the type system
434 Node* record_profile_for_speculation(Node* n, ciKlass* exact_kls, ProfilePtrKind ptr_kind);
435 void record_profiled_arguments_for_speculation(ciMethod* dest_method, Bytecodes::Code bc);
436 void record_profiled_parameters_for_speculation();
437 void record_profiled_return_for_speculation();
438 Node* record_profiled_receiver_for_speculation(Node* n);
439
440 // Use the type profile to narrow an object type.
441 Node* maybe_cast_profiled_receiver(Node* not_null_obj,
442 const TypeKlassPtr* require_klass,
443 ciKlass* spec,
444 bool safe_for_replace);
445
446 // Cast obj to type and emit guard unless we had too many traps here already
447 Node* maybe_cast_profiled_obj(Node* obj,
448 ciKlass* type,
449 bool not_null = false);
450
451 // Cast obj to not-null on this path
452 Node* cast_not_null(Node* obj, bool do_replace_in_map = true);
453 // Replace all occurrences of one node by another.
454 void replace_in_map(Node* old, Node* neww);
455
456 Node* maybe_narrow_object_type(Node* obj, ciKlass* type);
457
458 void push(Node* n) { map_not_null(); _map->set_stack(_map->_jvms, _sp++ , n); }
459 Node* pop() { map_not_null(); return _map->stack( _map->_jvms, --_sp ); }
460 Node* peek(int off = 0) { map_not_null(); return _map->stack( _map->_jvms, _sp - off - 1 ); }
461
462 void push_pair(Node* ldval) {
463 push(ldval);
464 push(top()); // the halfword is merely a placeholder
465 }
466 void push_pair_local(int i) {
467 // longs are stored in locals in "push" order
468 push( local(i+0) ); // the real value
469 assert(local(i+1) == top(), "");
470 push(top()); // halfword placeholder
471 }
472 Node* pop_pair() {
473 // the second half is pushed last & popped first; it contains exactly nothing
474 Node* halfword = pop();
475 assert(halfword == top(), "");
476 // the long bits are pushed first & popped last:
477 return pop();
478 }
479 void set_pair_local(int i, Node* lval) {
480 // longs are stored in locals as a value/half pair (like doubles)
481 set_local(i+0, lval);
482 set_local(i+1, top());
483 }
484
485 // Push the node, which may be zero, one, or two words.
486 void push_node(BasicType n_type, Node* n) {
487 int n_size = type2size[n_type];
488 if (n_size == 1) push( n ); // T_INT, ...
489 else if (n_size == 2) push_pair( n ); // T_DOUBLE, T_LONG
490 else { assert(n_size == 0, "must be T_VOID"); }
491 }
492
493 Node* pop_node(BasicType n_type) {
494 int n_size = type2size[n_type];
495 if (n_size == 1) return pop();
496 else if (n_size == 2) return pop_pair();
497 else return nullptr;
498 }
499
500 Node* control() const { return map_not_null()->control(); }
501 Node* i_o() const { return map_not_null()->i_o(); }
502 Node* returnadr() const { return map_not_null()->returnadr(); }
503 Node* frameptr() const { return map_not_null()->frameptr(); }
504 Node* local(uint idx) const { map_not_null(); return _map->local( _map->_jvms, idx); }
505 Node* stack(uint idx) const { map_not_null(); return _map->stack( _map->_jvms, idx); }
506 Node* argument(uint idx) const { map_not_null(); return _map->argument( _map->_jvms, idx); }
507 Node* monitor_box(uint idx) const { map_not_null(); return _map->monitor_box(_map->_jvms, idx); }
508 Node* monitor_obj(uint idx) const { map_not_null(); return _map->monitor_obj(_map->_jvms, idx); }
509
510 void set_control (Node* c) { map_not_null()->set_control(c); }
511 void set_i_o (Node* c) { map_not_null()->set_i_o(c); }
512 void set_local(uint idx, Node* c) { map_not_null(); _map->set_local( _map->_jvms, idx, c); }
513 void set_stack(uint idx, Node* c) { map_not_null(); _map->set_stack( _map->_jvms, idx, c); }
514 void set_argument(uint idx, Node* c){ map_not_null(); _map->set_argument(_map->_jvms, idx, c); }
515 void ensure_stack(uint stk_size) { map_not_null(); _map->ensure_stack(_map->_jvms, stk_size); }
516
517 // Access unaliased memory
518 Node* memory(uint alias_idx);
519 Node* memory(const TypePtr *tp) { return memory(C->get_alias_index(tp)); }
520 Node* memory(Node* adr) { return memory(_gvn.type(adr)->is_ptr()); }
521
522 // Access immutable memory
523 Node* immutable_memory() { return C->immutable_memory(); }
524
525 // Set unaliased memory
526 void set_memory(Node* c, uint alias_idx) { merged_memory()->set_memory_at(alias_idx, c); }
527 void set_memory(Node* c, const TypePtr *tp) { set_memory(c,C->get_alias_index(tp)); }
528 void set_memory(Node* c, Node* adr) { set_memory(c,_gvn.type(adr)->is_ptr()); }
529
530 // Get the entire memory state (probably a MergeMemNode), and reset it
531 // (The resetting prevents somebody from using the dangling Node pointer.)
532 Node* reset_memory();
533
534 // Get the entire memory state, asserted to be a MergeMemNode.
535 MergeMemNode* merged_memory() {
536 Node* mem = map_not_null()->memory();
537 assert(mem->is_MergeMem(), "parse memory is always pre-split");
538 return mem->as_MergeMem();
539 }
540
541 // Set the entire memory state; produce a new MergeMemNode.
542 void set_all_memory(Node* newmem);
543
544 // Create a memory projection from the call, then set_all_memory.
545 void set_all_memory_call(Node* call, bool separate_io_proj = false);
546
547 // Create a LoadNode, reading from the parser's memory state.
548 // (Note: require_atomic_access is useful only with T_LONG.)
549 //
550 // We choose the unordered semantics by default because we have
551 // adapted the `do_put_xxx' and `do_get_xxx' procedures for the case
552 // of volatile fields.
553 Node* make_load(Node* ctl, Node* adr, const Type* t, BasicType bt,
554 MemNode::MemOrd mo, LoadNode::ControlDependency control_dependency = LoadNode::DependsOnlyOnTest,
555 bool require_atomic_access = false, bool unaligned = false,
556 bool mismatched = false, bool unsafe = false, uint8_t barrier_data = 0);
557
558 // Create & transform a StoreNode and store the effect into the
559 // parser's memory state.
560 //
561 // We must ensure that stores of object references will be visible
562 // only after the object's initialization. So the clients of this
563 // procedure must indicate that the store requires `release'
564 // semantics, if the stored value is an object reference that might
565 // point to a new object and may become externally visible.
566 // Return the new StoreXNode
567 Node* store_to_memory(Node* ctl, Node* adr, Node* val, BasicType bt,
568 MemNode::MemOrd,
569 bool require_atomic_access = false,
570 bool unaligned = false,
571 bool mismatched = false,
572 bool unsafe = false,
573 int barrier_data = 0);
574
575 // Perform decorated accesses
576
577 Node* access_store_at(Node* obj, // containing obj
578 Node* adr, // actual address to store val at
579 const TypePtr* adr_type,
580 Node* val,
581 const Type* val_type,
582 BasicType bt,
583 DecoratorSet decorators);
584
585 Node* access_load_at(Node* obj, // containing obj
586 Node* adr, // actual address to load val at
587 const TypePtr* adr_type,
588 const Type* val_type,
589 BasicType bt,
590 DecoratorSet decorators);
591
592 Node* access_load(Node* adr, // actual address to load val at
593 const Type* val_type,
594 BasicType bt,
595 DecoratorSet decorators);
596
597 Node* access_atomic_cmpxchg_val_at(Node* obj,
598 Node* adr,
599 const TypePtr* adr_type,
600 int alias_idx,
601 Node* expected_val,
602 Node* new_val,
603 const Type* value_type,
604 BasicType bt,
605 DecoratorSet decorators);
606
607 Node* access_atomic_cmpxchg_bool_at(Node* obj,
608 Node* adr,
609 const TypePtr* adr_type,
610 int alias_idx,
611 Node* expected_val,
612 Node* new_val,
613 const Type* value_type,
614 BasicType bt,
615 DecoratorSet decorators);
616
617 Node* access_atomic_xchg_at(Node* obj,
618 Node* adr,
619 const TypePtr* adr_type,
620 int alias_idx,
621 Node* new_val,
622 const Type* value_type,
623 BasicType bt,
624 DecoratorSet decorators);
625
626 Node* access_atomic_add_at(Node* obj,
627 Node* adr,
628 const TypePtr* adr_type,
629 int alias_idx,
630 Node* new_val,
631 const Type* value_type,
632 BasicType bt,
633 DecoratorSet decorators);
634
635 void access_clone(Node* src, Node* dst, Node* size, bool is_array);
636
637 // Return addressing for an array element.
638 Node* array_element_address(Node* ary, Node* idx, BasicType elembt,
639 // Optional constraint on the array size:
640 const TypeInt* sizetype = nullptr,
641 // Optional control dependency (for example, on range check)
642 Node* ctrl = nullptr);
643
644 // Return a load of array element at idx.
645 Node* load_array_element(Node* ary, Node* idx, const TypeAryPtr* arytype, bool set_ctrl);
646
647 //----------- runtime upcalls support ----------------
648 void install_on_method_entry_runtime_upcalls(ciMethod* method);
649
650 //---------------- Dtrace support --------------------
651 void make_dtrace_method_entry_exit(ciMethod* method, bool is_entry);
652 void make_dtrace_method_entry(ciMethod* method) {
653 make_dtrace_method_entry_exit(method, true);
654 }
655 void make_dtrace_method_exit(ciMethod* method) {
656 make_dtrace_method_entry_exit(method, false);
657 }
658
659 //--------------- stub generation -------------------
660 public:
661 void gen_stub(address C_function,
662 const char *name,
663 int is_fancy_jump,
664 bool pass_tls,
665 bool return_pc);
666
667 //---------- help for generating calls --------------
668
669 // Do a null check on the receiver as it would happen before the call to
670 // callee (with all arguments still on the stack).
671 Node* null_check_receiver_before_call(ciMethod* callee) {
672 assert(!callee->is_static(), "must be a virtual method");
673 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
674 // Use callsite signature always.
675 ciMethod* declared_method = method()->get_method_at_bci(bci());
676 const int nargs = declared_method->arg_size();
677 inc_sp(nargs);
678 Node* n = null_check_receiver();
679 dec_sp(nargs);
680 return n;
681 }
682
683 // Fill in argument edges for the call from argument(0), argument(1), ...
684 // (The next step is to call set_edges_for_java_call.)
685 void set_arguments_for_java_call(CallJavaNode* call);
686
687 // Fill in non-argument edges for the call.
688 // Transform the call, and update the basics: control, i_o, memory.
689 // (The next step is usually to call set_results_for_java_call.)
690 void set_edges_for_java_call(CallJavaNode* call,
691 bool must_throw = false, bool separate_io_proj = false);
692
693 // Finish up a java call that was started by set_edges_for_java_call.
694 // Call add_exception on any throw arising from the call.
695 // Return the call result (transformed).
696 Node* set_results_for_java_call(CallJavaNode* call, bool separate_io_proj = false, bool deoptimize = false);
697
698 // Similar to set_edges_for_java_call, but simplified for runtime calls.
699 void set_predefined_output_for_runtime_call(Node* call) {
700 set_predefined_output_for_runtime_call(call, nullptr, nullptr);
701 }
702 void set_predefined_output_for_runtime_call(Node* call,
703 Node* keep_mem,
704 const TypePtr* hook_mem);
705 Node* set_predefined_input_for_runtime_call(SafePointNode* call, Node* narrow_mem = nullptr);
706
707 // Replace the call with the current state of the kit. Requires
708 // that the call was generated with separate io_projs so that
709 // exceptional control flow can be handled properly.
710 void replace_call(CallNode* call, Node* result, bool do_replaced_nodes = false, bool do_asserts = true);
711
712 // helper functions for statistics
713 void increment_counter(address counter_addr); // increment a debug counter
714 void increment_counter(Node* counter_addr); // increment a debug counter
715
716 // Bail out to the interpreter right now
717 // The optional klass is the one causing the trap.
718 // The optional reason is debug information written to the compile log.
719 // Optional must_throw is the same as with add_safepoint_edges.
720 Node* uncommon_trap(int trap_request,
721 ciKlass* klass = nullptr, const char* reason_string = nullptr,
722 bool must_throw = false, bool keep_exact_action = false);
723
724 // Shorthand, to avoid saying "Deoptimization::" so many times.
725 Node* uncommon_trap(Deoptimization::DeoptReason reason,
726 Deoptimization::DeoptAction action,
727 ciKlass* klass = nullptr, const char* reason_string = nullptr,
728 bool must_throw = false, bool keep_exact_action = false) {
729 return uncommon_trap(Deoptimization::make_trap_request(reason, action),
730 klass, reason_string, must_throw, keep_exact_action);
731 }
732
733 // Bail out to the interpreter and keep exact action (avoid switching to Action_none).
734 Node* uncommon_trap_exact(Deoptimization::DeoptReason reason,
735 Deoptimization::DeoptAction action,
736 ciKlass* klass = nullptr, const char* reason_string = nullptr,
737 bool must_throw = false) {
738 return uncommon_trap(Deoptimization::make_trap_request(reason, action),
739 klass, reason_string, must_throw, /*keep_exact_action=*/true);
740 }
741
742 // SP when bytecode needs to be reexecuted.
743 virtual int reexecute_sp() { return sp(); }
744
745 // Report if there were too many traps at the current method and bci.
746 // Report if a trap was recorded, and/or PerMethodTrapLimit was exceeded.
747 // If there is no MDO at all, report no trap unless told to assume it.
748 bool too_many_traps(Deoptimization::DeoptReason reason) {
749 return C->too_many_traps(method(), bci(), reason);
750 }
751
752 // Report if there were too many recompiles at the current method and bci.
753 bool too_many_recompiles(Deoptimization::DeoptReason reason) {
754 return C->too_many_recompiles(method(), bci(), reason);
755 }
756
757 bool too_many_traps_or_recompiles(Deoptimization::DeoptReason reason) {
758 return C->too_many_traps_or_recompiles(method(), bci(), reason);
759 }
760
761 // Returns the object (if any) which was created the moment before.
762 Node* just_allocated_object(Node* current_control);
763
764 // Sync Ideal and Graph kits.
765 void sync_kit(IdealKit& ideal);
766 void final_sync(IdealKit& ideal);
767
768 public:
769 // Helper functions for fast/slow path codes
770 Node* opt_iff(Node* region, Node* iff);
771 Node* make_runtime_call(int flags,
772 const TypeFunc* call_type, address call_addr,
773 const char* call_name,
774 const TypePtr* adr_type, // null if no memory effects
775 Node* parm0 = nullptr, Node* parm1 = nullptr,
776 Node* parm2 = nullptr, Node* parm3 = nullptr,
777 Node* parm4 = nullptr, Node* parm5 = nullptr,
778 Node* parm6 = nullptr, Node* parm7 = nullptr);
779
780 Node* sign_extend_byte(Node* in);
781 Node* sign_extend_short(Node* in);
782
783 enum { // flag values for make_runtime_call
784 RC_NO_FP = 1, // CallLeafNoFPNode
785 RC_NO_IO = 2, // do not hook IO edges
786 RC_NO_LEAF = 4, // CallStaticJavaNode
787 RC_MUST_THROW = 8, // flag passed to add_safepoint_edges
788 RC_NARROW_MEM = 16, // input memory is same as output
789 RC_UNCOMMON = 32, // freq. expected to be like uncommon trap
790 RC_VECTOR = 64, // CallLeafVectorNode
791 RC_LEAF = 0 // null value: no flags set
792 };
793
794 // merge in all memory slices from new_mem, along the given path
795 void merge_memory(Node* new_mem, Node* region, int new_path);
796 void make_slow_call_ex(Node* call, ciInstanceKlass* ex_klass, bool separate_io_proj, bool deoptimize = false);
797
798 // Helper functions to build synchronizations
799 int next_monitor();
800 Node* insert_mem_bar(int opcode, Node* precedent = nullptr);
801 Node* insert_mem_bar_volatile(int opcode, int alias_idx, Node* precedent = nullptr);
802 // Optional 'precedent' is appended as an extra edge, to force ordering.
803 FastLockNode* shared_lock(Node* obj);
804 void shared_unlock(Node* box, Node* obj);
805
806 // helper functions for the fast path/slow path idioms
807 Node* fast_and_slow(Node* in, const Type *result_type, Node* null_result, IfNode* fast_test, Node* fast_result, address slow_call, const TypeFunc *slow_call_type, Node* slow_arg, Klass* ex_klass, Node* slow_result);
808
809 // Generate an instance-of idiom. Used by both the instance-of bytecode
810 // and the reflective instance-of call.
811 Node* gen_instanceof(Node *subobj, Node* superkls, bool safe_for_replace = false);
812
813 // Generate a check-cast idiom. Used by both the check-cast bytecode
814 // and the array-store bytecode
815 Node* gen_checkcast( Node *subobj, Node* superkls,
816 Node* *failure_control = nullptr );
817
818 Node* gen_subtype_check(Node* obj, Node* superklass);
819
820 // Exact type check used for predicted calls and casts.
821 // Rewrites (*casted_receiver) to be casted to the stronger type.
822 // (Caller is responsible for doing replace_in_map.)
823 Node* type_check_receiver(Node* receiver, ciKlass* klass, float prob,
824 Node* *casted_receiver);
825
826 // Inexact type check used for predicted calls.
827 Node* subtype_check_receiver(Node* receiver, ciKlass* klass,
828 Node** casted_receiver);
829
830 // implementation of object creation
831 Node* set_output_for_allocation(AllocateNode* alloc,
832 const TypeOopPtr* oop_type,
833 bool deoptimize_on_exception=false);
834 Node* get_layout_helper(Node* klass_node, jint& constant_value);
835 Node* new_instance(Node* klass_node,
836 Node* slow_test = nullptr,
837 Node* *return_size_val = nullptr,
838 bool deoptimize_on_exception = false);
839 Node* new_array(Node* klass_node, Node* count_val, int nargs,
840 Node* *return_size_val = nullptr,
841 bool deoptimize_on_exception = false);
842
843 // java.lang.String helpers
844 Node* load_String_length(Node* str, bool set_ctrl);
845 Node* load_String_value(Node* str, bool set_ctrl);
846 Node* load_String_coder(Node* str, bool set_ctrl);
847 void store_String_value(Node* str, Node* value);
848 void store_String_coder(Node* str, Node* value);
849 Node* capture_memory(const TypePtr* src_type, const TypePtr* dst_type);
850 Node* compress_string(Node* src, const TypeAryPtr* src_type, Node* dst, Node* count);
851 void inflate_string(Node* src, Node* dst, const TypeAryPtr* dst_type, Node* count);
852 void inflate_string_slow(Node* src, Node* dst, Node* start, Node* count);
853
854 // Handy for making control flow
855 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
856 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
857 _gvn.set_type(iff, iff->Value(&_gvn)); // Value may be known at parse-time
858 // Place 'if' on worklist if it will be in graph
859 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
860 return iff;
861 }
862
863 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
864 IfNode* iff = new IfNode(ctrl, tst, prob, cnt);// New IfNode's
865 _gvn.transform(iff); // Value may be known at parse-time
866 // Place 'if' on worklist if it will be in graph
867 if (!tst->is_Con()) record_for_igvn(iff); // Range-check and Null-check removal is later
868 return iff;
869 }
870
871 void add_parse_predicates(int nargs = 0);
872 void add_parse_predicate(Deoptimization::DeoptReason reason, int nargs);
873
874 Node* make_constant_from_field(ciField* field, Node* obj);
875
876 // Vector API support (implemented in vectorIntrinsics.cpp)
877 Node* box_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem, bool deoptimize_on_exception = false);
878 Node* unbox_vector(Node* in, const TypeInstPtr* vbox_type, BasicType elem_bt, int num_elem);
879 Node* vector_shift_count(Node* cnt, int shift_op, BasicType bt, int num_elem);
880 };
881
882 // Helper class to support building of control flow branches. Upon
883 // creation the map and sp at bci are cloned and restored upon de-
884 // struction. Typical use:
885 //
886 // { PreserveJVMState pjvms(this);
887 // // code of new branch
888 // }
889 // // here the JVM state at bci is established
890
891 class PreserveJVMState: public StackObj {
892 protected:
893 GraphKit* _kit;
894 #ifdef ASSERT
895 int _block; // PO of current block, if a Parse
896 int _bci;
897 #endif
898 SafePointNode* _map;
899 uint _sp;
900
901 public:
902 PreserveJVMState(GraphKit* kit, bool clone_map = true);
903 ~PreserveJVMState();
904 };
905
906 // Helper class to build cutouts of the form if (p) ; else {x...}.
907 // The code {x...} must not fall through.
908 // The kit's main flow of control is set to the "then" continuation of if(p).
909 class BuildCutout: public PreserveJVMState {
910 public:
911 BuildCutout(GraphKit* kit, Node* p, float prob, float cnt = COUNT_UNKNOWN);
912 ~BuildCutout();
913 };
914
915 // Helper class to preserve the original _reexecute bit and _sp and restore
916 // them back
917 class PreserveReexecuteState: public StackObj {
918 protected:
919 GraphKit* _kit;
920 uint _sp;
921 JVMState::ReexecuteState _reexecute;
922
923 public:
924 PreserveReexecuteState(GraphKit* kit);
925 ~PreserveReexecuteState();
926 };
927
928 #endif // SHARE_OPTO_GRAPHKIT_HPP