annotate src/hotspot/share/opto/graphKit.hpp @ 51514:1e332d63bd96

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