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