annotate hotspot/src/share/vm/opto/graphKit.hpp @ 29081:c61eb4914428

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