1 /* 2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_OPTO_MEMNODE_HPP 26 #define SHARE_VM_OPTO_MEMNODE_HPP 27 28 #include "opto/multnode.hpp" 29 #include "opto/node.hpp" 30 #include "opto/opcodes.hpp" 31 #include "opto/type.hpp" 32 33 // Portions of code courtesy of Clifford Click 34 35 class MultiNode; 36 class PhaseCCP; 37 class PhaseTransform; 38 39 //------------------------------MemNode---------------------------------------- 40 // Load or Store, possibly throwing a NULL pointer exception 41 class MemNode : public Node { 42 protected: 43 #ifdef ASSERT 44 const TypePtr* _adr_type; // What kind of memory is being addressed? 45 #endif 46 virtual uint size_of() const; // Size is bigger (ASSERT only) 47 public: 48 enum { Control, // When is it safe to do this load? 49 Memory, // Chunk of memory is being loaded from 50 Address, // Actually address, derived from base 51 ValueIn, // Value to store 52 OopStore // Preceeding oop store, only in StoreCM 53 }; 54 protected: 55 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at ) 56 : Node(c0,c1,c2 ) { 57 init_class_id(Class_Mem); 58 debug_only(_adr_type=at; adr_type();) 59 } 60 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at, Node *c3 ) 61 : Node(c0,c1,c2,c3) { 62 init_class_id(Class_Mem); 63 debug_only(_adr_type=at; adr_type();) 64 } 65 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at, Node *c3, Node *c4) 66 : Node(c0,c1,c2,c3,c4) { 67 init_class_id(Class_Mem); 68 debug_only(_adr_type=at; adr_type();) 69 } 70 71 public: 72 // Helpers for the optimizer. Documented in memnode.cpp. 73 static bool detect_ptr_independence(Node* p1, AllocateNode* a1, 74 Node* p2, AllocateNode* a2, 75 PhaseTransform* phase); 76 static bool adr_phi_is_loop_invariant(Node* adr_phi, Node* cast); 77 78 static Node *optimize_simple_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase); 79 static Node *optimize_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase); 80 // This one should probably be a phase-specific function: 81 static bool all_controls_dominate(Node* dom, Node* sub); 82 83 // Find any cast-away of null-ness and keep its control. 84 static Node *Ideal_common_DU_postCCP( PhaseCCP *ccp, Node* n, Node* adr ); 85 virtual Node *Ideal_DU_postCCP( PhaseCCP *ccp ); 86 87 virtual const class TypePtr *adr_type() const; // returns bottom_type of address 88 89 // Shared code for Ideal methods: 90 Node *Ideal_common(PhaseGVN *phase, bool can_reshape); // Return -1 for short-circuit NULL. 91 92 // Helper function for adr_type() implementations. 93 static const TypePtr* calculate_adr_type(const Type* t, const TypePtr* cross_check = NULL); 94 95 // Raw access function, to allow copying of adr_type efficiently in 96 // product builds and retain the debug info for debug builds. 97 const TypePtr *raw_adr_type() const { 98 #ifdef ASSERT 99 return _adr_type; 100 #else 101 return 0; 102 #endif 103 } 104 105 // Map a load or store opcode to its corresponding store opcode. 106 // (Return -1 if unknown.) 107 virtual int store_Opcode() const { return -1; } 108 109 // What is the type of the value in memory? (T_VOID mean "unspecified".) 110 virtual BasicType memory_type() const = 0; 111 virtual int memory_size() const { 112 #ifdef ASSERT 113 return type2aelembytes(memory_type(), true); 114 #else 115 return type2aelembytes(memory_type()); 116 #endif 117 } 118 119 // Search through memory states which precede this node (load or store). 120 // Look for an exact match for the address, with no intervening 121 // aliased stores. 122 Node* find_previous_store(PhaseTransform* phase); 123 124 // Can this node (load or store) accurately see a stored value in 125 // the given memory state? (The state may or may not be in(Memory).) 126 Node* can_see_stored_value(Node* st, PhaseTransform* phase) const; 127 128 #ifndef PRODUCT 129 static void dump_adr_type(const Node* mem, const TypePtr* adr_type, outputStream *st); 130 virtual void dump_spec(outputStream *st) const; 131 #endif 132 }; 133 134 //------------------------------LoadNode--------------------------------------- 135 // Load value; requires Memory and Address 136 class LoadNode : public MemNode { 137 protected: 138 virtual uint cmp( const Node &n ) const; 139 virtual uint size_of() const; // Size is bigger 140 const Type* const _type; // What kind of value is loaded? 141 public: 142 143 LoadNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *rt ) 144 : MemNode(c,mem,adr,at), _type(rt) { 145 init_class_id(Class_Load); 146 } 147 148 // Polymorphic factory method: 149 static Node* make( PhaseGVN& gvn, Node *c, Node *mem, Node *adr, 150 const TypePtr* at, const Type *rt, BasicType bt ); 151 152 virtual uint hash() const; // Check the type 153 154 // Handle algebraic identities here. If we have an identity, return the Node 155 // we are equivalent to. We look for Load of a Store. 156 virtual Node *Identity( PhaseTransform *phase ); 157 158 // If the load is from Field memory and the pointer is non-null, we can 159 // zero out the control input. 160 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 161 162 // Split instance field load through Phi. 163 Node* split_through_phi(PhaseGVN *phase); 164 165 // Recover original value from boxed values 166 Node *eliminate_autobox(PhaseGVN *phase); 167 168 // Compute a new Type for this node. Basically we just do the pre-check, 169 // then call the virtual add() to set the type. 170 virtual const Type *Value( PhaseTransform *phase ) const; 171 172 // Common methods for LoadKlass and LoadNKlass nodes. 173 const Type *klass_value_common( PhaseTransform *phase ) const; 174 Node *klass_identity_common( PhaseTransform *phase ); 175 176 virtual uint ideal_reg() const; 177 virtual const Type *bottom_type() const; 178 // Following method is copied from TypeNode: 179 void set_type(const Type* t) { 180 assert(t != NULL, "sanity"); 181 debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH); 182 *(const Type**)&_type = t; // cast away const-ness 183 // If this node is in the hash table, make sure it doesn't need a rehash. 184 assert(check_hash == NO_HASH || check_hash == hash(), "type change must preserve hash code"); 185 } 186 const Type* type() const { assert(_type != NULL, "sanity"); return _type; }; 187 188 // Do not match memory edge 189 virtual uint match_edge(uint idx) const; 190 191 // Map a load opcode to its corresponding store opcode. 192 virtual int store_Opcode() const = 0; 193 194 // Check if the load's memory input is a Phi node with the same control. 195 bool is_instance_field_load_with_local_phi(Node* ctrl); 196 197 #ifndef PRODUCT 198 virtual void dump_spec(outputStream *st) const; 199 #endif 200 #ifdef ASSERT 201 // Helper function to allow a raw load without control edge for some cases 202 static bool is_immutable_value(Node* adr); 203 #endif 204 protected: 205 const Type* load_array_final_field(const TypeKlassPtr *tkls, 206 ciKlass* klass) const; 207 }; 208 209 //------------------------------LoadBNode-------------------------------------- 210 // Load a byte (8bits signed) from memory 211 class LoadBNode : public LoadNode { 212 public: 213 LoadBNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti = TypeInt::BYTE ) 214 : LoadNode(c,mem,adr,at,ti) {} 215 virtual int Opcode() const; 216 virtual uint ideal_reg() const { return Op_RegI; } 217 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 218 virtual const Type *Value(PhaseTransform *phase) const; 219 virtual int store_Opcode() const { return Op_StoreB; } 220 virtual BasicType memory_type() const { return T_BYTE; } 221 }; 222 223 //------------------------------LoadUBNode------------------------------------- 224 // Load a unsigned byte (8bits unsigned) from memory 225 class LoadUBNode : public LoadNode { 226 public: 227 LoadUBNode(Node* c, Node* mem, Node* adr, const TypePtr* at, const TypeInt* ti = TypeInt::UBYTE ) 228 : LoadNode(c, mem, adr, at, ti) {} 229 virtual int Opcode() const; 230 virtual uint ideal_reg() const { return Op_RegI; } 231 virtual Node* Ideal(PhaseGVN *phase, bool can_reshape); 232 virtual const Type *Value(PhaseTransform *phase) const; 233 virtual int store_Opcode() const { return Op_StoreB; } 234 virtual BasicType memory_type() const { return T_BYTE; } 235 }; 236 237 //------------------------------LoadUSNode------------------------------------- 238 // Load an unsigned short/char (16bits unsigned) from memory 239 class LoadUSNode : public LoadNode { 240 public: 241 LoadUSNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti = TypeInt::CHAR ) 242 : LoadNode(c,mem,adr,at,ti) {} 243 virtual int Opcode() const; 244 virtual uint ideal_reg() const { return Op_RegI; } 245 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 246 virtual const Type *Value(PhaseTransform *phase) const; 247 virtual int store_Opcode() const { return Op_StoreC; } 248 virtual BasicType memory_type() const { return T_CHAR; } 249 }; 250 251 //------------------------------LoadSNode-------------------------------------- 252 // Load a short (16bits signed) from memory 253 class LoadSNode : public LoadNode { 254 public: 255 LoadSNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti = TypeInt::SHORT ) 256 : LoadNode(c,mem,adr,at,ti) {} 257 virtual int Opcode() const; 258 virtual uint ideal_reg() const { return Op_RegI; } 259 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 260 virtual const Type *Value(PhaseTransform *phase) const; 261 virtual int store_Opcode() const { return Op_StoreC; } 262 virtual BasicType memory_type() const { return T_SHORT; } 263 }; 264 265 //------------------------------LoadINode-------------------------------------- 266 // Load an integer from memory 267 class LoadINode : public LoadNode { 268 public: 269 LoadINode( Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti = TypeInt::INT ) 270 : LoadNode(c,mem,adr,at,ti) {} 271 virtual int Opcode() const; 272 virtual uint ideal_reg() const { return Op_RegI; } 273 virtual int store_Opcode() const { return Op_StoreI; } 274 virtual BasicType memory_type() const { return T_INT; } 275 }; 276 277 //------------------------------LoadUI2LNode----------------------------------- 278 // Load an unsigned integer into long from memory 279 class LoadUI2LNode : public LoadNode { 280 public: 281 LoadUI2LNode(Node* c, Node* mem, Node* adr, const TypePtr* at, const TypeLong* t = TypeLong::UINT) 282 : LoadNode(c, mem, adr, at, t) {} 283 virtual int Opcode() const; 284 virtual uint ideal_reg() const { return Op_RegL; } 285 virtual int store_Opcode() const { return Op_StoreL; } 286 virtual BasicType memory_type() const { return T_LONG; } 287 }; 288 289 //------------------------------LoadRangeNode---------------------------------- 290 // Load an array length from the array 291 class LoadRangeNode : public LoadINode { 292 public: 293 LoadRangeNode( Node *c, Node *mem, Node *adr, const TypeInt *ti = TypeInt::POS ) 294 : LoadINode(c,mem,adr,TypeAryPtr::RANGE,ti) {} 295 virtual int Opcode() const; 296 virtual const Type *Value( PhaseTransform *phase ) const; 297 virtual Node *Identity( PhaseTransform *phase ); 298 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 299 }; 300 301 //------------------------------LoadLNode-------------------------------------- 302 // Load a long from memory 303 class LoadLNode : public LoadNode { 304 virtual uint hash() const { return LoadNode::hash() + _require_atomic_access; } 305 virtual uint cmp( const Node &n ) const { 306 return _require_atomic_access == ((LoadLNode&)n)._require_atomic_access 307 && LoadNode::cmp(n); 308 } 309 virtual uint size_of() const { return sizeof(*this); } 310 const bool _require_atomic_access; // is piecewise load forbidden? 311 312 public: 313 LoadLNode( Node *c, Node *mem, Node *adr, const TypePtr* at, 314 const TypeLong *tl = TypeLong::LONG, 315 bool require_atomic_access = false ) 316 : LoadNode(c,mem,adr,at,tl) 317 , _require_atomic_access(require_atomic_access) 318 {} 319 virtual int Opcode() const; 320 virtual uint ideal_reg() const { return Op_RegL; } 321 virtual int store_Opcode() const { return Op_StoreL; } 322 virtual BasicType memory_type() const { return T_LONG; } 323 bool require_atomic_access() { return _require_atomic_access; } 324 static LoadLNode* make_atomic(Compile *C, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, const Type* rt); 325 #ifndef PRODUCT 326 virtual void dump_spec(outputStream *st) const { 327 LoadNode::dump_spec(st); 328 if (_require_atomic_access) st->print(" Atomic!"); 329 } 330 #endif 331 }; 332 333 //------------------------------LoadL_unalignedNode---------------------------- 334 // Load a long from unaligned memory 335 class LoadL_unalignedNode : public LoadLNode { 336 public: 337 LoadL_unalignedNode( Node *c, Node *mem, Node *adr, const TypePtr* at ) 338 : LoadLNode(c,mem,adr,at) {} 339 virtual int Opcode() const; 340 }; 341 342 //------------------------------LoadFNode-------------------------------------- 343 // Load a float (64 bits) from memory 344 class LoadFNode : public LoadNode { 345 public: 346 LoadFNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t = Type::FLOAT ) 347 : LoadNode(c,mem,adr,at,t) {} 348 virtual int Opcode() const; 349 virtual uint ideal_reg() const { return Op_RegF; } 350 virtual int store_Opcode() const { return Op_StoreF; } 351 virtual BasicType memory_type() const { return T_FLOAT; } 352 }; 353 354 //------------------------------LoadDNode-------------------------------------- 355 // Load a double (64 bits) from memory 356 class LoadDNode : public LoadNode { 357 public: 358 LoadDNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t = Type::DOUBLE ) 359 : LoadNode(c,mem,adr,at,t) {} 360 virtual int Opcode() const; 361 virtual uint ideal_reg() const { return Op_RegD; } 362 virtual int store_Opcode() const { return Op_StoreD; } 363 virtual BasicType memory_type() const { return T_DOUBLE; } 364 }; 365 366 //------------------------------LoadD_unalignedNode---------------------------- 367 // Load a double from unaligned memory 368 class LoadD_unalignedNode : public LoadDNode { 369 public: 370 LoadD_unalignedNode( Node *c, Node *mem, Node *adr, const TypePtr* at ) 371 : LoadDNode(c,mem,adr,at) {} 372 virtual int Opcode() const; 373 }; 374 375 //------------------------------LoadPNode-------------------------------------- 376 // Load a pointer from memory (either object or array) 377 class LoadPNode : public LoadNode { 378 public: 379 LoadPNode( Node *c, Node *mem, Node *adr, const TypePtr *at, const TypePtr* t ) 380 : LoadNode(c,mem,adr,at,t) {} 381 virtual int Opcode() const; 382 virtual uint ideal_reg() const { return Op_RegP; } 383 virtual int store_Opcode() const { return Op_StoreP; } 384 virtual BasicType memory_type() const { return T_ADDRESS; } 385 // depends_only_on_test is almost always true, and needs to be almost always 386 // true to enable key hoisting & commoning optimizations. However, for the 387 // special case of RawPtr loads from TLS top & end, the control edge carries 388 // the dependence preventing hoisting past a Safepoint instead of the memory 389 // edge. (An unfortunate consequence of having Safepoints not set Raw 390 // Memory; itself an unfortunate consequence of having Nodes which produce 391 // results (new raw memory state) inside of loops preventing all manner of 392 // other optimizations). Basically, it's ugly but so is the alternative. 393 // See comment in macro.cpp, around line 125 expand_allocate_common(). 394 virtual bool depends_only_on_test() const { return adr_type() != TypeRawPtr::BOTTOM; } 395 }; 396 397 398 //------------------------------LoadNNode-------------------------------------- 399 // Load a narrow oop from memory (either object or array) 400 class LoadNNode : public LoadNode { 401 public: 402 LoadNNode( Node *c, Node *mem, Node *adr, const TypePtr *at, const Type* t ) 403 : LoadNode(c,mem,adr,at,t) {} 404 virtual int Opcode() const; 405 virtual uint ideal_reg() const { return Op_RegN; } 406 virtual int store_Opcode() const { return Op_StoreN; } 407 virtual BasicType memory_type() const { return T_NARROWOOP; } 408 // depends_only_on_test is almost always true, and needs to be almost always 409 // true to enable key hoisting & commoning optimizations. However, for the 410 // special case of RawPtr loads from TLS top & end, the control edge carries 411 // the dependence preventing hoisting past a Safepoint instead of the memory 412 // edge. (An unfortunate consequence of having Safepoints not set Raw 413 // Memory; itself an unfortunate consequence of having Nodes which produce 414 // results (new raw memory state) inside of loops preventing all manner of 415 // other optimizations). Basically, it's ugly but so is the alternative. 416 // See comment in macro.cpp, around line 125 expand_allocate_common(). 417 virtual bool depends_only_on_test() const { return adr_type() != TypeRawPtr::BOTTOM; } 418 }; 419 420 //------------------------------LoadKlassNode---------------------------------- 421 // Load a Klass from an object 422 class LoadKlassNode : public LoadPNode { 423 public: 424 LoadKlassNode( Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeKlassPtr *tk ) 425 : LoadPNode(c,mem,adr,at,tk) {} 426 virtual int Opcode() const; 427 virtual const Type *Value( PhaseTransform *phase ) const; 428 virtual Node *Identity( PhaseTransform *phase ); 429 virtual bool depends_only_on_test() const { return true; } 430 431 // Polymorphic factory method: 432 static Node* make( PhaseGVN& gvn, Node *mem, Node *adr, const TypePtr* at, 433 const TypeKlassPtr *tk = TypeKlassPtr::OBJECT ); 434 }; 435 436 //------------------------------LoadNKlassNode--------------------------------- 437 // Load a narrow Klass from an object. 438 class LoadNKlassNode : public LoadNNode { 439 public: 440 LoadNKlassNode( Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeNarrowKlass *tk ) 441 : LoadNNode(c,mem,adr,at,tk) {} 442 virtual int Opcode() const; 443 virtual uint ideal_reg() const { return Op_RegN; } 444 virtual int store_Opcode() const { return Op_StoreNKlass; } 445 virtual BasicType memory_type() const { return T_NARROWKLASS; } 446 447 virtual const Type *Value( PhaseTransform *phase ) const; 448 virtual Node *Identity( PhaseTransform *phase ); 449 virtual bool depends_only_on_test() const { return true; } 450 }; 451 452 453 //------------------------------StoreNode-------------------------------------- 454 // Store value; requires Store, Address and Value 455 class StoreNode : public MemNode { 456 protected: 457 virtual uint cmp( const Node &n ) const; 458 virtual bool depends_only_on_test() const { return false; } 459 460 Node *Ideal_masked_input (PhaseGVN *phase, uint mask); 461 Node *Ideal_sign_extended_input(PhaseGVN *phase, int num_bits); 462 463 public: 464 StoreNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) 465 : MemNode(c,mem,adr,at,val) { 466 init_class_id(Class_Store); 467 } 468 StoreNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store ) 469 : MemNode(c,mem,adr,at,val,oop_store) { 470 init_class_id(Class_Store); 471 } 472 473 // Polymorphic factory method: 474 static StoreNode* make( PhaseGVN& gvn, Node *c, Node *mem, Node *adr, 475 const TypePtr* at, Node *val, BasicType bt ); 476 477 virtual uint hash() const; // Check the type 478 479 // If the store is to Field memory and the pointer is non-null, we can 480 // zero out the control input. 481 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 482 483 // Compute a new Type for this node. Basically we just do the pre-check, 484 // then call the virtual add() to set the type. 485 virtual const Type *Value( PhaseTransform *phase ) const; 486 487 // Check for identity function on memory (Load then Store at same address) 488 virtual Node *Identity( PhaseTransform *phase ); 489 490 // Do not match memory edge 491 virtual uint match_edge(uint idx) const; 492 493 virtual const Type *bottom_type() const; // returns Type::MEMORY 494 495 // Map a store opcode to its corresponding own opcode, trivially. 496 virtual int store_Opcode() const { return Opcode(); } 497 498 // have all possible loads of the value stored been optimized away? 499 bool value_never_loaded(PhaseTransform *phase) const; 500 }; 501 502 //------------------------------StoreBNode------------------------------------- 503 // Store byte to memory 504 class StoreBNode : public StoreNode { 505 public: 506 StoreBNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 507 virtual int Opcode() const; 508 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 509 virtual BasicType memory_type() const { return T_BYTE; } 510 }; 511 512 //------------------------------StoreCNode------------------------------------- 513 // Store char/short to memory 514 class StoreCNode : public StoreNode { 515 public: 516 StoreCNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 517 virtual int Opcode() const; 518 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 519 virtual BasicType memory_type() const { return T_CHAR; } 520 }; 521 522 //------------------------------StoreINode------------------------------------- 523 // Store int to memory 524 class StoreINode : public StoreNode { 525 public: 526 StoreINode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 527 virtual int Opcode() const; 528 virtual BasicType memory_type() const { return T_INT; } 529 }; 530 531 //------------------------------StoreLNode------------------------------------- 532 // Store long to memory 533 class StoreLNode : public StoreNode { 534 virtual uint hash() const { return StoreNode::hash() + _require_atomic_access; } 535 virtual uint cmp( const Node &n ) const { 536 return _require_atomic_access == ((StoreLNode&)n)._require_atomic_access 537 && StoreNode::cmp(n); 538 } 539 virtual uint size_of() const { return sizeof(*this); } 540 const bool _require_atomic_access; // is piecewise store forbidden? 541 542 public: 543 StoreLNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, 544 bool require_atomic_access = false ) 545 : StoreNode(c,mem,adr,at,val) 546 , _require_atomic_access(require_atomic_access) 547 {} 548 virtual int Opcode() const; 549 virtual BasicType memory_type() const { return T_LONG; } 550 bool require_atomic_access() { return _require_atomic_access; } 551 static StoreLNode* make_atomic(Compile *C, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val); 552 #ifndef PRODUCT 553 virtual void dump_spec(outputStream *st) const { 554 StoreNode::dump_spec(st); 555 if (_require_atomic_access) st->print(" Atomic!"); 556 } 557 #endif 558 }; 559 560 //------------------------------StoreFNode------------------------------------- 561 // Store float to memory 562 class StoreFNode : public StoreNode { 563 public: 564 StoreFNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 565 virtual int Opcode() const; 566 virtual BasicType memory_type() const { return T_FLOAT; } 567 }; 568 569 //------------------------------StoreDNode------------------------------------- 570 // Store double to memory 571 class StoreDNode : public StoreNode { 572 public: 573 StoreDNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 574 virtual int Opcode() const; 575 virtual BasicType memory_type() const { return T_DOUBLE; } 576 }; 577 578 //------------------------------StorePNode------------------------------------- 579 // Store pointer to memory 580 class StorePNode : public StoreNode { 581 public: 582 StorePNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 583 virtual int Opcode() const; 584 virtual BasicType memory_type() const { return T_ADDRESS; } 585 }; 586 587 //------------------------------StoreNNode------------------------------------- 588 // Store narrow oop to memory 589 class StoreNNode : public StoreNode { 590 public: 591 StoreNNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNode(c,mem,adr,at,val) {} 592 virtual int Opcode() const; 593 virtual BasicType memory_type() const { return T_NARROWOOP; } 594 }; 595 596 //------------------------------StoreNKlassNode-------------------------------------- 597 // Store narrow klass to memory 598 class StoreNKlassNode : public StoreNNode { 599 public: 600 StoreNKlassNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val ) : StoreNNode(c,mem,adr,at,val) {} 601 virtual int Opcode() const; 602 virtual BasicType memory_type() const { return T_NARROWKLASS; } 603 }; 604 605 //------------------------------StoreCMNode----------------------------------- 606 // Store card-mark byte to memory for CM 607 // The last StoreCM before a SafePoint must be preserved and occur after its "oop" store 608 // Preceeding equivalent StoreCMs may be eliminated. 609 class StoreCMNode : public StoreNode { 610 private: 611 virtual uint hash() const { return StoreNode::hash() + _oop_alias_idx; } 612 virtual uint cmp( const Node &n ) const { 613 return _oop_alias_idx == ((StoreCMNode&)n)._oop_alias_idx 614 && StoreNode::cmp(n); 615 } 616 virtual uint size_of() const { return sizeof(*this); } 617 int _oop_alias_idx; // The alias_idx of OopStore 618 619 public: 620 StoreCMNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store, int oop_alias_idx ) : 621 StoreNode(c,mem,adr,at,val,oop_store), 622 _oop_alias_idx(oop_alias_idx) { 623 assert(_oop_alias_idx >= Compile::AliasIdxRaw || 624 _oop_alias_idx == Compile::AliasIdxBot && Compile::current()->AliasLevel() == 0, 625 "bad oop alias idx"); 626 } 627 virtual int Opcode() const; 628 virtual Node *Identity( PhaseTransform *phase ); 629 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 630 virtual const Type *Value( PhaseTransform *phase ) const; 631 virtual BasicType memory_type() const { return T_VOID; } // unspecific 632 int oop_alias_idx() const { return _oop_alias_idx; } 633 }; 634 635 //------------------------------LoadPLockedNode--------------------------------- 636 // Load-locked a pointer from memory (either object or array). 637 // On Sparc & Intel this is implemented as a normal pointer load. 638 // On PowerPC and friends it's a real load-locked. 639 class LoadPLockedNode : public LoadPNode { 640 public: 641 LoadPLockedNode( Node *c, Node *mem, Node *adr ) 642 : LoadPNode(c,mem,adr,TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM) {} 643 virtual int Opcode() const; 644 virtual int store_Opcode() const { return Op_StorePConditional; } 645 virtual bool depends_only_on_test() const { return true; } 646 }; 647 648 //------------------------------SCMemProjNode--------------------------------------- 649 // This class defines a projection of the memory state of a store conditional node. 650 // These nodes return a value, but also update memory. 651 class SCMemProjNode : public ProjNode { 652 public: 653 enum {SCMEMPROJCON = (uint)-2}; 654 SCMemProjNode( Node *src) : ProjNode( src, SCMEMPROJCON) { } 655 virtual int Opcode() const; 656 virtual bool is_CFG() const { return false; } 657 virtual const Type *bottom_type() const {return Type::MEMORY;} 658 virtual const TypePtr *adr_type() const { return in(0)->in(MemNode::Memory)->adr_type();} 659 virtual uint ideal_reg() const { return 0;} // memory projections don't have a register 660 virtual const Type *Value( PhaseTransform *phase ) const; 661 #ifndef PRODUCT 662 virtual void dump_spec(outputStream *st) const {}; 663 #endif 664 }; 665 666 //------------------------------LoadStoreNode--------------------------- 667 // Note: is_Mem() method returns 'true' for this class. 668 class LoadStoreNode : public Node { 669 private: 670 const Type* const _type; // What kind of value is loaded? 671 const TypePtr* _adr_type; // What kind of memory is being addressed? 672 virtual uint size_of() const; // Size is bigger 673 public: 674 LoadStoreNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* rt, uint required ); 675 virtual bool depends_only_on_test() const { return false; } 676 virtual uint match_edge(uint idx) const { return idx == MemNode::Address || idx == MemNode::ValueIn; } 677 678 virtual const Type *bottom_type() const { return _type; } 679 virtual uint ideal_reg() const; 680 virtual const class TypePtr *adr_type() const { return _adr_type; } // returns bottom_type of address 681 682 bool result_not_used() const; 683 }; 684 685 class LoadStoreConditionalNode : public LoadStoreNode { 686 public: 687 enum { 688 ExpectedIn = MemNode::ValueIn+1 // One more input than MemNode 689 }; 690 LoadStoreConditionalNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex); 691 }; 692 693 //------------------------------StorePConditionalNode--------------------------- 694 // Conditionally store pointer to memory, if no change since prior 695 // load-locked. Sets flags for success or failure of the store. 696 class StorePConditionalNode : public LoadStoreConditionalNode { 697 public: 698 StorePConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) : LoadStoreConditionalNode(c, mem, adr, val, ll) { } 699 virtual int Opcode() const; 700 // Produces flags 701 virtual uint ideal_reg() const { return Op_RegFlags; } 702 }; 703 704 //------------------------------StoreIConditionalNode--------------------------- 705 // Conditionally store int to memory, if no change since prior 706 // load-locked. Sets flags for success or failure of the store. 707 class StoreIConditionalNode : public LoadStoreConditionalNode { 708 public: 709 StoreIConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ii ) : LoadStoreConditionalNode(c, mem, adr, val, ii) { } 710 virtual int Opcode() const; 711 // Produces flags 712 virtual uint ideal_reg() const { return Op_RegFlags; } 713 }; 714 715 //------------------------------StoreLConditionalNode--------------------------- 716 // Conditionally store long to memory, if no change since prior 717 // load-locked. Sets flags for success or failure of the store. 718 class StoreLConditionalNode : public LoadStoreConditionalNode { 719 public: 720 StoreLConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) : LoadStoreConditionalNode(c, mem, adr, val, ll) { } 721 virtual int Opcode() const; 722 // Produces flags 723 virtual uint ideal_reg() const { return Op_RegFlags; } 724 }; 725 726 727 //------------------------------CompareAndSwapLNode--------------------------- 728 class CompareAndSwapLNode : public LoadStoreConditionalNode { 729 public: 730 CompareAndSwapLNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } 731 virtual int Opcode() const; 732 }; 733 734 735 //------------------------------CompareAndSwapINode--------------------------- 736 class CompareAndSwapINode : public LoadStoreConditionalNode { 737 public: 738 CompareAndSwapINode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } 739 virtual int Opcode() const; 740 }; 741 742 743 //------------------------------CompareAndSwapPNode--------------------------- 744 class CompareAndSwapPNode : public LoadStoreConditionalNode { 745 public: 746 CompareAndSwapPNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } 747 virtual int Opcode() const; 748 }; 749 750 //------------------------------CompareAndSwapNNode--------------------------- 751 class CompareAndSwapNNode : public LoadStoreConditionalNode { 752 public: 753 CompareAndSwapNNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } 754 virtual int Opcode() const; 755 }; 756 757 //------------------------------GetAndAddINode--------------------------- 758 class GetAndAddINode : public LoadStoreNode { 759 public: 760 GetAndAddINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeInt::INT, 4) { } 761 virtual int Opcode() const; 762 }; 763 764 //------------------------------GetAndAddLNode--------------------------- 765 class GetAndAddLNode : public LoadStoreNode { 766 public: 767 GetAndAddLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } 768 virtual int Opcode() const; 769 }; 770 771 772 //------------------------------GetAndSetINode--------------------------- 773 class GetAndSetINode : public LoadStoreNode { 774 public: 775 GetAndSetINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeInt::INT, 4) { } 776 virtual int Opcode() const; 777 }; 778 779 //------------------------------GetAndSetINode--------------------------- 780 class GetAndSetLNode : public LoadStoreNode { 781 public: 782 GetAndSetLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } 783 virtual int Opcode() const; 784 }; 785 786 //------------------------------GetAndSetPNode--------------------------- 787 class GetAndSetPNode : public LoadStoreNode { 788 public: 789 GetAndSetPNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) : LoadStoreNode(c, mem, adr, val, at, t, 4) { } 790 virtual int Opcode() const; 791 }; 792 793 //------------------------------GetAndSetNNode--------------------------- 794 class GetAndSetNNode : public LoadStoreNode { 795 public: 796 GetAndSetNNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) : LoadStoreNode(c, mem, adr, val, at, t, 4) { } 797 virtual int Opcode() const; 798 }; 799 800 //------------------------------ClearArray------------------------------------- 801 class ClearArrayNode: public Node { 802 public: 803 ClearArrayNode( Node *ctrl, Node *arymem, Node *word_cnt, Node *base ) 804 : Node(ctrl,arymem,word_cnt,base) { 805 init_class_id(Class_ClearArray); 806 } 807 virtual int Opcode() const; 808 virtual const Type *bottom_type() const { return Type::MEMORY; } 809 // ClearArray modifies array elements, and so affects only the 810 // array memory addressed by the bottom_type of its base address. 811 virtual const class TypePtr *adr_type() const; 812 virtual Node *Identity( PhaseTransform *phase ); 813 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 814 virtual uint match_edge(uint idx) const; 815 816 // Clear the given area of an object or array. 817 // The start offset must always be aligned mod BytesPerInt. 818 // The end offset must always be aligned mod BytesPerLong. 819 // Return the new memory. 820 static Node* clear_memory(Node* control, Node* mem, Node* dest, 821 intptr_t start_offset, 822 intptr_t end_offset, 823 PhaseGVN* phase); 824 static Node* clear_memory(Node* control, Node* mem, Node* dest, 825 intptr_t start_offset, 826 Node* end_offset, 827 PhaseGVN* phase); 828 static Node* clear_memory(Node* control, Node* mem, Node* dest, 829 Node* start_offset, 830 Node* end_offset, 831 PhaseGVN* phase); 832 // Return allocation input memory edge if it is different instance 833 // or itself if it is the one we are looking for. 834 static bool step_through(Node** np, uint instance_id, PhaseTransform* phase); 835 }; 836 837 //------------------------------StrIntrinsic------------------------------- 838 // Base class for Ideal nodes used in String instrinsic code. 839 class StrIntrinsicNode: public Node { 840 public: 841 StrIntrinsicNode(Node* control, Node* char_array_mem, 842 Node* s1, Node* c1, Node* s2, Node* c2): 843 Node(control, char_array_mem, s1, c1, s2, c2) { 844 } 845 846 StrIntrinsicNode(Node* control, Node* char_array_mem, 847 Node* s1, Node* s2, Node* c): 848 Node(control, char_array_mem, s1, s2, c) { 849 } 850 851 StrIntrinsicNode(Node* control, Node* char_array_mem, 852 Node* s1, Node* s2): 853 Node(control, char_array_mem, s1, s2) { 854 } 855 856 virtual bool depends_only_on_test() const { return false; } 857 virtual const TypePtr* adr_type() const { return TypeAryPtr::CHARS; } 858 virtual uint match_edge(uint idx) const; 859 virtual uint ideal_reg() const { return Op_RegI; } 860 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 861 virtual const Type *Value(PhaseTransform *phase) const; 862 }; 863 864 //------------------------------StrComp------------------------------------- 865 class StrCompNode: public StrIntrinsicNode { 866 public: 867 StrCompNode(Node* control, Node* char_array_mem, 868 Node* s1, Node* c1, Node* s2, Node* c2): 869 StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2) {}; 870 virtual int Opcode() const; 871 virtual const Type* bottom_type() const { return TypeInt::INT; } 872 }; 873 874 //------------------------------StrEquals------------------------------------- 875 class StrEqualsNode: public StrIntrinsicNode { 876 public: 877 StrEqualsNode(Node* control, Node* char_array_mem, 878 Node* s1, Node* s2, Node* c): 879 StrIntrinsicNode(control, char_array_mem, s1, s2, c) {}; 880 virtual int Opcode() const; 881 virtual const Type* bottom_type() const { return TypeInt::BOOL; } 882 }; 883 884 //------------------------------StrIndexOf------------------------------------- 885 class StrIndexOfNode: public StrIntrinsicNode { 886 public: 887 StrIndexOfNode(Node* control, Node* char_array_mem, 888 Node* s1, Node* c1, Node* s2, Node* c2): 889 StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2) {}; 890 virtual int Opcode() const; 891 virtual const Type* bottom_type() const { return TypeInt::INT; } 892 }; 893 894 //------------------------------AryEq--------------------------------------- 895 class AryEqNode: public StrIntrinsicNode { 896 public: 897 AryEqNode(Node* control, Node* char_array_mem, Node* s1, Node* s2): 898 StrIntrinsicNode(control, char_array_mem, s1, s2) {}; 899 virtual int Opcode() const; 900 virtual const Type* bottom_type() const { return TypeInt::BOOL; } 901 }; 902 903 //------------------------------MemBar----------------------------------------- 904 // There are different flavors of Memory Barriers to match the Java Memory 905 // Model. Monitor-enter and volatile-load act as Aquires: no following ref 906 // can be moved to before them. We insert a MemBar-Acquire after a FastLock or 907 // volatile-load. Monitor-exit and volatile-store act as Release: no 908 // preceding ref can be moved to after them. We insert a MemBar-Release 909 // before a FastUnlock or volatile-store. All volatiles need to be 910 // serialized, so we follow all volatile-stores with a MemBar-Volatile to 911 // separate it from any following volatile-load. 912 class MemBarNode: public MultiNode { 913 virtual uint hash() const ; // { return NO_HASH; } 914 virtual uint cmp( const Node &n ) const ; // Always fail, except on self 915 916 virtual uint size_of() const { return sizeof(*this); } 917 // Memory type this node is serializing. Usually either rawptr or bottom. 918 const TypePtr* _adr_type; 919 920 public: 921 enum { 922 Precedent = TypeFunc::Parms // optional edge to force precedence 923 }; 924 MemBarNode(Compile* C, int alias_idx, Node* precedent); 925 virtual int Opcode() const = 0; 926 virtual const class TypePtr *adr_type() const { return _adr_type; } 927 virtual const Type *Value( PhaseTransform *phase ) const; 928 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 929 virtual uint match_edge(uint idx) const { return 0; } 930 virtual const Type *bottom_type() const { return TypeTuple::MEMBAR; } 931 virtual Node *match( const ProjNode *proj, const Matcher *m ); 932 // Factory method. Builds a wide or narrow membar. 933 // Optional 'precedent' becomes an extra edge if not null. 934 static MemBarNode* make(Compile* C, int opcode, 935 int alias_idx = Compile::AliasIdxBot, 936 Node* precedent = NULL); 937 }; 938 939 // "Acquire" - no following ref can move before (but earlier refs can 940 // follow, like an early Load stalled in cache). Requires multi-cpu 941 // visibility. Inserted after a volatile load. 942 class MemBarAcquireNode: public MemBarNode { 943 public: 944 MemBarAcquireNode(Compile* C, int alias_idx, Node* precedent) 945 : MemBarNode(C, alias_idx, precedent) {} 946 virtual int Opcode() const; 947 }; 948 949 // "Release" - no earlier ref can move after (but later refs can move 950 // up, like a speculative pipelined cache-hitting Load). Requires 951 // multi-cpu visibility. Inserted before a volatile store. 952 class MemBarReleaseNode: public MemBarNode { 953 public: 954 MemBarReleaseNode(Compile* C, int alias_idx, Node* precedent) 955 : MemBarNode(C, alias_idx, precedent) {} 956 virtual int Opcode() const; 957 }; 958 959 // "Acquire" - no following ref can move before (but earlier refs can 960 // follow, like an early Load stalled in cache). Requires multi-cpu 961 // visibility. Inserted after a FastLock. 962 class MemBarAcquireLockNode: public MemBarNode { 963 public: 964 MemBarAcquireLockNode(Compile* C, int alias_idx, Node* precedent) 965 : MemBarNode(C, alias_idx, precedent) {} 966 virtual int Opcode() const; 967 }; 968 969 // "Release" - no earlier ref can move after (but later refs can move 970 // up, like a speculative pipelined cache-hitting Load). Requires 971 // multi-cpu visibility. Inserted before a FastUnLock. 972 class MemBarReleaseLockNode: public MemBarNode { 973 public: 974 MemBarReleaseLockNode(Compile* C, int alias_idx, Node* precedent) 975 : MemBarNode(C, alias_idx, precedent) {} 976 virtual int Opcode() const; 977 }; 978 979 class MemBarStoreStoreNode: public MemBarNode { 980 public: 981 MemBarStoreStoreNode(Compile* C, int alias_idx, Node* precedent) 982 : MemBarNode(C, alias_idx, precedent) { 983 init_class_id(Class_MemBarStoreStore); 984 } 985 virtual int Opcode() const; 986 }; 987 988 // Ordering between a volatile store and a following volatile load. 989 // Requires multi-CPU visibility? 990 class MemBarVolatileNode: public MemBarNode { 991 public: 992 MemBarVolatileNode(Compile* C, int alias_idx, Node* precedent) 993 : MemBarNode(C, alias_idx, precedent) {} 994 virtual int Opcode() const; 995 }; 996 997 // Ordering within the same CPU. Used to order unsafe memory references 998 // inside the compiler when we lack alias info. Not needed "outside" the 999 // compiler because the CPU does all the ordering for us. 1000 class MemBarCPUOrderNode: public MemBarNode { 1001 public: 1002 MemBarCPUOrderNode(Compile* C, int alias_idx, Node* precedent) 1003 : MemBarNode(C, alias_idx, precedent) {} 1004 virtual int Opcode() const; 1005 virtual uint ideal_reg() const { return 0; } // not matched in the AD file 1006 }; 1007 1008 // Isolation of object setup after an AllocateNode and before next safepoint. 1009 // (See comment in memnode.cpp near InitializeNode::InitializeNode for semantics.) 1010 class InitializeNode: public MemBarNode { 1011 friend class AllocateNode; 1012 1013 enum { 1014 Incomplete = 0, 1015 Complete = 1, 1016 WithArraycopy = 2 1017 }; 1018 int _is_complete; 1019 1020 bool _does_not_escape; 1021 1022 public: 1023 enum { 1024 Control = TypeFunc::Control, 1025 Memory = TypeFunc::Memory, // MergeMem for states affected by this op 1026 RawAddress = TypeFunc::Parms+0, // the newly-allocated raw address 1027 RawStores = TypeFunc::Parms+1 // zero or more stores (or TOP) 1028 }; 1029 1030 InitializeNode(Compile* C, int adr_type, Node* rawoop); 1031 virtual int Opcode() const; 1032 virtual uint size_of() const { return sizeof(*this); } 1033 virtual uint ideal_reg() const { return 0; } // not matched in the AD file 1034 virtual const RegMask &in_RegMask(uint) const; // mask for RawAddress 1035 1036 // Manage incoming memory edges via a MergeMem on in(Memory): 1037 Node* memory(uint alias_idx); 1038 1039 // The raw memory edge coming directly from the Allocation. 1040 // The contents of this memory are *always* all-zero-bits. 1041 Node* zero_memory() { return memory(Compile::AliasIdxRaw); } 1042 1043 // Return the corresponding allocation for this initialization (or null if none). 1044 // (Note: Both InitializeNode::allocation and AllocateNode::initialization 1045 // are defined in graphKit.cpp, which sets up the bidirectional relation.) 1046 AllocateNode* allocation(); 1047 1048 // Anything other than zeroing in this init? 1049 bool is_non_zero(); 1050 1051 // An InitializeNode must completed before macro expansion is done. 1052 // Completion requires that the AllocateNode must be followed by 1053 // initialization of the new memory to zero, then to any initializers. 1054 bool is_complete() { return _is_complete != Incomplete; } 1055 bool is_complete_with_arraycopy() { return (_is_complete & WithArraycopy) != 0; } 1056 1057 // Mark complete. (Must not yet be complete.) 1058 void set_complete(PhaseGVN* phase); 1059 void set_complete_with_arraycopy() { _is_complete = Complete | WithArraycopy; } 1060 1061 bool does_not_escape() { return _does_not_escape; } 1062 void set_does_not_escape() { _does_not_escape = true; } 1063 1064 #ifdef ASSERT 1065 // ensure all non-degenerate stores are ordered and non-overlapping 1066 bool stores_are_sane(PhaseTransform* phase); 1067 #endif //ASSERT 1068 1069 // See if this store can be captured; return offset where it initializes. 1070 // Return 0 if the store cannot be moved (any sort of problem). 1071 intptr_t can_capture_store(StoreNode* st, PhaseTransform* phase); 1072 1073 // Capture another store; reformat it to write my internal raw memory. 1074 // Return the captured copy, else NULL if there is some sort of problem. 1075 Node* capture_store(StoreNode* st, intptr_t start, PhaseTransform* phase); 1076 1077 // Find captured store which corresponds to the range [start..start+size). 1078 // Return my own memory projection (meaning the initial zero bits) 1079 // if there is no such store. Return NULL if there is a problem. 1080 Node* find_captured_store(intptr_t start, int size_in_bytes, PhaseTransform* phase); 1081 1082 // Called when the associated AllocateNode is expanded into CFG. 1083 Node* complete_stores(Node* rawctl, Node* rawmem, Node* rawptr, 1084 intptr_t header_size, Node* size_in_bytes, 1085 PhaseGVN* phase); 1086 1087 private: 1088 void remove_extra_zeroes(); 1089 1090 // Find out where a captured store should be placed (or already is placed). 1091 int captured_store_insertion_point(intptr_t start, int size_in_bytes, 1092 PhaseTransform* phase); 1093 1094 static intptr_t get_store_offset(Node* st, PhaseTransform* phase); 1095 1096 Node* make_raw_address(intptr_t offset, PhaseTransform* phase); 1097 1098 bool detect_init_independence(Node* n, bool st_is_pinned, int& count); 1099 1100 void coalesce_subword_stores(intptr_t header_size, Node* size_in_bytes, 1101 PhaseGVN* phase); 1102 1103 intptr_t find_next_fullword_store(uint i, PhaseGVN* phase); 1104 }; 1105 1106 //------------------------------MergeMem--------------------------------------- 1107 // (See comment in memnode.cpp near MergeMemNode::MergeMemNode for semantics.) 1108 class MergeMemNode: public Node { 1109 virtual uint hash() const ; // { return NO_HASH; } 1110 virtual uint cmp( const Node &n ) const ; // Always fail, except on self 1111 friend class MergeMemStream; 1112 MergeMemNode(Node* def); // clients use MergeMemNode::make 1113 1114 public: 1115 // If the input is a whole memory state, clone it with all its slices intact. 1116 // Otherwise, make a new memory state with just that base memory input. 1117 // In either case, the result is a newly created MergeMem. 1118 static MergeMemNode* make(Compile* C, Node* base_memory); 1119 1120 virtual int Opcode() const; 1121 virtual Node *Identity( PhaseTransform *phase ); 1122 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 1123 virtual uint ideal_reg() const { return NotAMachineReg; } 1124 virtual uint match_edge(uint idx) const { return 0; } 1125 virtual const RegMask &out_RegMask() const; 1126 virtual const Type *bottom_type() const { return Type::MEMORY; } 1127 virtual const TypePtr *adr_type() const { return TypePtr::BOTTOM; } 1128 // sparse accessors 1129 // Fetch the previously stored "set_memory_at", or else the base memory. 1130 // (Caller should clone it if it is a phi-nest.) 1131 Node* memory_at(uint alias_idx) const; 1132 // set the memory, regardless of its previous value 1133 void set_memory_at(uint alias_idx, Node* n); 1134 // the "base" is the memory that provides the non-finite support 1135 Node* base_memory() const { return in(Compile::AliasIdxBot); } 1136 // warning: setting the base can implicitly set any of the other slices too 1137 void set_base_memory(Node* def); 1138 // sentinel value which denotes a copy of the base memory: 1139 Node* empty_memory() const { return in(Compile::AliasIdxTop); } 1140 static Node* make_empty_memory(); // where the sentinel comes from 1141 bool is_empty_memory(Node* n) const { assert((n == empty_memory()) == n->is_top(), "sanity"); return n->is_top(); } 1142 // hook for the iterator, to perform any necessary setup 1143 void iteration_setup(const MergeMemNode* other = NULL); 1144 // push sentinels until I am at least as long as the other (semantic no-op) 1145 void grow_to_match(const MergeMemNode* other); 1146 bool verify_sparse() const PRODUCT_RETURN0; 1147 #ifndef PRODUCT 1148 virtual void dump_spec(outputStream *st) const; 1149 #endif 1150 }; 1151 1152 class MergeMemStream : public StackObj { 1153 private: 1154 MergeMemNode* _mm; 1155 const MergeMemNode* _mm2; // optional second guy, contributes non-empty iterations 1156 Node* _mm_base; // loop-invariant base memory of _mm 1157 int _idx; 1158 int _cnt; 1159 Node* _mem; 1160 Node* _mem2; 1161 int _cnt2; 1162 1163 void init(MergeMemNode* mm, const MergeMemNode* mm2 = NULL) { 1164 // subsume_node will break sparseness at times, whenever a memory slice 1165 // folds down to a copy of the base ("fat") memory. In such a case, 1166 // the raw edge will update to base, although it should be top. 1167 // This iterator will recognize either top or base_memory as an 1168 // "empty" slice. See is_empty, is_empty2, and next below. 1169 // 1170 // The sparseness property is repaired in MergeMemNode::Ideal. 1171 // As long as access to a MergeMem goes through this iterator 1172 // or the memory_at accessor, flaws in the sparseness will 1173 // never be observed. 1174 // 1175 // Also, iteration_setup repairs sparseness. 1176 assert(mm->verify_sparse(), "please, no dups of base"); 1177 assert(mm2==NULL || mm2->verify_sparse(), "please, no dups of base"); 1178 1179 _mm = mm; 1180 _mm_base = mm->base_memory(); 1181 _mm2 = mm2; 1182 _cnt = mm->req(); 1183 _idx = Compile::AliasIdxBot-1; // start at the base memory 1184 _mem = NULL; 1185 _mem2 = NULL; 1186 } 1187 1188 #ifdef ASSERT 1189 Node* check_memory() const { 1190 if (at_base_memory()) 1191 return _mm->base_memory(); 1192 else if ((uint)_idx < _mm->req() && !_mm->in(_idx)->is_top()) 1193 return _mm->memory_at(_idx); 1194 else 1195 return _mm_base; 1196 } 1197 Node* check_memory2() const { 1198 return at_base_memory()? _mm2->base_memory(): _mm2->memory_at(_idx); 1199 } 1200 #endif 1201 1202 static bool match_memory(Node* mem, const MergeMemNode* mm, int idx) PRODUCT_RETURN0; 1203 void assert_synch() const { 1204 assert(!_mem || _idx >= _cnt || match_memory(_mem, _mm, _idx), 1205 "no side-effects except through the stream"); 1206 } 1207 1208 public: 1209 1210 // expected usages: 1211 // for (MergeMemStream mms(mem->is_MergeMem()); next_non_empty(); ) { ... } 1212 // for (MergeMemStream mms(mem1, mem2); next_non_empty2(); ) { ... } 1213 1214 // iterate over one merge 1215 MergeMemStream(MergeMemNode* mm) { 1216 mm->iteration_setup(); 1217 init(mm); 1218 debug_only(_cnt2 = 999); 1219 } 1220 // iterate in parallel over two merges 1221 // only iterates through non-empty elements of mm2 1222 MergeMemStream(MergeMemNode* mm, const MergeMemNode* mm2) { 1223 assert(mm2, "second argument must be a MergeMem also"); 1224 ((MergeMemNode*)mm2)->iteration_setup(); // update hidden state 1225 mm->iteration_setup(mm2); 1226 init(mm, mm2); 1227 _cnt2 = mm2->req(); 1228 } 1229 #ifdef ASSERT 1230 ~MergeMemStream() { 1231 assert_synch(); 1232 } 1233 #endif 1234 1235 MergeMemNode* all_memory() const { 1236 return _mm; 1237 } 1238 Node* base_memory() const { 1239 assert(_mm_base == _mm->base_memory(), "no update to base memory, please"); 1240 return _mm_base; 1241 } 1242 const MergeMemNode* all_memory2() const { 1243 assert(_mm2 != NULL, ""); 1244 return _mm2; 1245 } 1246 bool at_base_memory() const { 1247 return _idx == Compile::AliasIdxBot; 1248 } 1249 int alias_idx() const { 1250 assert(_mem, "must call next 1st"); 1251 return _idx; 1252 } 1253 1254 const TypePtr* adr_type() const { 1255 return Compile::current()->get_adr_type(alias_idx()); 1256 } 1257 1258 const TypePtr* adr_type(Compile* C) const { 1259 return C->get_adr_type(alias_idx()); 1260 } 1261 bool is_empty() const { 1262 assert(_mem, "must call next 1st"); 1263 assert(_mem->is_top() == (_mem==_mm->empty_memory()), "correct sentinel"); 1264 return _mem->is_top(); 1265 } 1266 bool is_empty2() const { 1267 assert(_mem2, "must call next 1st"); 1268 assert(_mem2->is_top() == (_mem2==_mm2->empty_memory()), "correct sentinel"); 1269 return _mem2->is_top(); 1270 } 1271 Node* memory() const { 1272 assert(!is_empty(), "must not be empty"); 1273 assert_synch(); 1274 return _mem; 1275 } 1276 // get the current memory, regardless of empty or non-empty status 1277 Node* force_memory() const { 1278 assert(!is_empty() || !at_base_memory(), ""); 1279 // Use _mm_base to defend against updates to _mem->base_memory(). 1280 Node *mem = _mem->is_top() ? _mm_base : _mem; 1281 assert(mem == check_memory(), ""); 1282 return mem; 1283 } 1284 Node* memory2() const { 1285 assert(_mem2 == check_memory2(), ""); 1286 return _mem2; 1287 } 1288 void set_memory(Node* mem) { 1289 if (at_base_memory()) { 1290 // Note that this does not change the invariant _mm_base. 1291 _mm->set_base_memory(mem); 1292 } else { 1293 _mm->set_memory_at(_idx, mem); 1294 } 1295 _mem = mem; 1296 assert_synch(); 1297 } 1298 1299 // Recover from a side effect to the MergeMemNode. 1300 void set_memory() { 1301 _mem = _mm->in(_idx); 1302 } 1303 1304 bool next() { return next(false); } 1305 bool next2() { return next(true); } 1306 1307 bool next_non_empty() { return next_non_empty(false); } 1308 bool next_non_empty2() { return next_non_empty(true); } 1309 // next_non_empty2 can yield states where is_empty() is true 1310 1311 private: 1312 // find the next item, which might be empty 1313 bool next(bool have_mm2) { 1314 assert((_mm2 != NULL) == have_mm2, "use other next"); 1315 assert_synch(); 1316 if (++_idx < _cnt) { 1317 // Note: This iterator allows _mm to be non-sparse. 1318 // It behaves the same whether _mem is top or base_memory. 1319 _mem = _mm->in(_idx); 1320 if (have_mm2) 1321 _mem2 = _mm2->in((_idx < _cnt2) ? _idx : Compile::AliasIdxTop); 1322 return true; 1323 } 1324 return false; 1325 } 1326 1327 // find the next non-empty item 1328 bool next_non_empty(bool have_mm2) { 1329 while (next(have_mm2)) { 1330 if (!is_empty()) { 1331 // make sure _mem2 is filled in sensibly 1332 if (have_mm2 && _mem2->is_top()) _mem2 = _mm2->base_memory(); 1333 return true; 1334 } else if (have_mm2 && !is_empty2()) { 1335 return true; // is_empty() == true 1336 } 1337 } 1338 return false; 1339 } 1340 }; 1341 1342 //------------------------------Prefetch--------------------------------------- 1343 1344 // Non-faulting prefetch load. Prefetch for many reads. 1345 class PrefetchReadNode : public Node { 1346 public: 1347 PrefetchReadNode(Node *abio, Node *adr) : Node(0,abio,adr) {} 1348 virtual int Opcode() const; 1349 virtual uint ideal_reg() const { return NotAMachineReg; } 1350 virtual uint match_edge(uint idx) const { return idx==2; } 1351 virtual const Type *bottom_type() const { return Type::ABIO; } 1352 }; 1353 1354 // Non-faulting prefetch load. Prefetch for many reads & many writes. 1355 class PrefetchWriteNode : public Node { 1356 public: 1357 PrefetchWriteNode(Node *abio, Node *adr) : Node(0,abio,adr) {} 1358 virtual int Opcode() const; 1359 virtual uint ideal_reg() const { return NotAMachineReg; } 1360 virtual uint match_edge(uint idx) const { return idx==2; } 1361 virtual const Type *bottom_type() const { return Type::ABIO; } 1362 }; 1363 1364 // Allocation prefetch which may fault, TLAB size have to be adjusted. 1365 class PrefetchAllocationNode : public Node { 1366 public: 1367 PrefetchAllocationNode(Node *mem, Node *adr) : Node(0,mem,adr) {} 1368 virtual int Opcode() const; 1369 virtual uint ideal_reg() const { return NotAMachineReg; } 1370 virtual uint match_edge(uint idx) const { return idx==2; } 1371 virtual const Type *bottom_type() const { return ( AllocatePrefetchStyle == 3 ) ? Type::MEMORY : Type::ABIO; } 1372 }; 1373 1374 #endif // SHARE_VM_OPTO_MEMNODE_HPP