annotate hotspot/src/share/vm/opto/graphKit.hpp @ 4450:6d700b859b3e

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