annotate hotspot/src/share/vm/opto/graphKit.hpp @ 13728:882756847a04

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