1 /* 2 * Copyright (c) 1997, 2018, 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_NODE_HPP 26 #define SHARE_VM_OPTO_NODE_HPP 27 28 #include "libadt/vectset.hpp" 29 #include "opto/compile.hpp" 30 #include "opto/type.hpp" 31 32 // Portions of code courtesy of Clifford Click 33 34 // Optimization - Graph Style 35 36 37 class AbstractLockNode; 38 class AddNode; 39 class AddPNode; 40 class AliasInfo; 41 class AllocateArrayNode; 42 class AllocateNode; 43 class ArrayCopyNode; 44 class Block; 45 class BoolNode; 46 class BoxLockNode; 47 class CMoveNode; 48 class CallDynamicJavaNode; 49 class CallJavaNode; 50 class CallLeafNode; 51 class CallNode; 52 class CallRuntimeNode; 53 class CallStaticJavaNode; 54 class CastIINode; 55 class CatchNode; 56 class CatchProjNode; 57 class CheckCastPPNode; 58 class ClearArrayNode; 59 class CmpNode; 60 class CodeBuffer; 61 class ConstraintCastNode; 62 class ConNode; 63 class CompareAndSwapNode; 64 class CompareAndExchangeNode; 65 class CountedLoopNode; 66 class CountedLoopEndNode; 67 class DecodeNarrowPtrNode; 68 class DecodeNNode; 69 class DecodeNKlassNode; 70 class EncodeNarrowPtrNode; 71 class EncodePNode; 72 class EncodePKlassNode; 73 class FastLockNode; 74 class FastUnlockNode; 75 class IfNode; 76 class IfProjNode; 77 class IfFalseNode; 78 class IfTrueNode; 79 class InitializeNode; 80 class JVMState; 81 class JumpNode; 82 class JumpProjNode; 83 class LoadNode; 84 class LoadBarrierNode; 85 class LoadBarrierSlowRegNode; 86 class LoadBarrierWeakSlowRegNode; 87 class LoadStoreNode; 88 class LockNode; 89 class LoopNode; 90 class MachBranchNode; 91 class MachCallDynamicJavaNode; 92 class MachCallJavaNode; 93 class MachCallLeafNode; 94 class MachCallNode; 95 class MachCallRuntimeNode; 96 class MachCallStaticJavaNode; 97 class MachConstantBaseNode; 98 class MachConstantNode; 99 class MachGotoNode; 100 class MachIfNode; 101 class MachJumpNode; 102 class MachNode; 103 class MachNullCheckNode; 104 class MachProjNode; 105 class MachReturnNode; 106 class MachSafePointNode; 107 class MachSpillCopyNode; 108 class MachTempNode; 109 class MachMergeNode; 110 class MachMemBarNode; 111 class Matcher; 112 class MemBarNode; 113 class MemBarStoreStoreNode; 114 class MemNode; 115 class MergeMemNode; 116 class MulNode; 117 class MultiNode; 118 class MultiBranchNode; 119 class NeverBranchNode; 120 class OuterStripMinedLoopNode; 121 class OuterStripMinedLoopEndNode; 122 class Node; 123 class Node_Array; 124 class Node_List; 125 class Node_Stack; 126 class NullCheckNode; 127 class OopMap; 128 class ParmNode; 129 class PCTableNode; 130 class PhaseCCP; 131 class PhaseGVN; 132 class PhaseIterGVN; 133 class PhaseRegAlloc; 134 class PhaseTransform; 135 class PhaseValues; 136 class PhiNode; 137 class Pipeline; 138 class ProjNode; 139 class RangeCheckNode; 140 class RegMask; 141 class RegionNode; 142 class RootNode; 143 class SafePointNode; 144 class SafePointScalarObjectNode; 145 class ShenandoahBarrierNode; 146 class StartNode; 147 class State; 148 class StoreNode; 149 class SubNode; 150 class Type; 151 class TypeNode; 152 class UnlockNode; 153 class VectorNode; 154 class LoadVectorNode; 155 class StoreVectorNode; 156 class VectorSet; 157 typedef void (*NFunc)(Node&,void*); 158 extern "C" { 159 typedef int (*C_sort_func_t)(const void *, const void *); 160 } 161 162 // The type of all node counts and indexes. 163 // It must hold at least 16 bits, but must also be fast to load and store. 164 // This type, if less than 32 bits, could limit the number of possible nodes. 165 // (To make this type platform-specific, move to globalDefinitions_xxx.hpp.) 166 typedef unsigned int node_idx_t; 167 168 169 #ifndef OPTO_DU_ITERATOR_ASSERT 170 #ifdef ASSERT 171 #define OPTO_DU_ITERATOR_ASSERT 1 172 #else 173 #define OPTO_DU_ITERATOR_ASSERT 0 174 #endif 175 #endif //OPTO_DU_ITERATOR_ASSERT 176 177 #if OPTO_DU_ITERATOR_ASSERT 178 class DUIterator; 179 class DUIterator_Fast; 180 class DUIterator_Last; 181 #else 182 typedef uint DUIterator; 183 typedef Node** DUIterator_Fast; 184 typedef Node** DUIterator_Last; 185 #endif 186 187 // Node Sentinel 188 #define NodeSentinel (Node*)-1 189 190 // Unknown count frequency 191 #define COUNT_UNKNOWN (-1.0f) 192 193 //------------------------------Node------------------------------------------- 194 // Nodes define actions in the program. They create values, which have types. 195 // They are both vertices in a directed graph and program primitives. Nodes 196 // are labeled; the label is the "opcode", the primitive function in the lambda 197 // calculus sense that gives meaning to the Node. Node inputs are ordered (so 198 // that "a-b" is different from "b-a"). The inputs to a Node are the inputs to 199 // the Node's function. These inputs also define a Type equation for the Node. 200 // Solving these Type equations amounts to doing dataflow analysis. 201 // Control and data are uniformly represented in the graph. Finally, Nodes 202 // have a unique dense integer index which is used to index into side arrays 203 // whenever I have phase-specific information. 204 205 class Node { 206 friend class VMStructs; 207 208 // Lots of restrictions on cloning Nodes 209 Node(const Node&); // not defined; linker error to use these 210 Node &operator=(const Node &rhs); 211 212 public: 213 friend class Compile; 214 #if OPTO_DU_ITERATOR_ASSERT 215 friend class DUIterator_Common; 216 friend class DUIterator; 217 friend class DUIterator_Fast; 218 friend class DUIterator_Last; 219 #endif 220 221 // Because Nodes come and go, I define an Arena of Node structures to pull 222 // from. This should allow fast access to node creation & deletion. This 223 // field is a local cache of a value defined in some "program fragment" for 224 // which these Nodes are just a part of. 225 226 inline void* operator new(size_t x) throw() { 227 Compile* C = Compile::current(); 228 Node* n = (Node*)C->node_arena()->Amalloc_D(x); 229 return (void*)n; 230 } 231 232 // Delete is a NOP 233 void operator delete( void *ptr ) {} 234 // Fancy destructor; eagerly attempt to reclaim Node numberings and storage 235 void destruct(); 236 237 // Create a new Node. Required is the number is of inputs required for 238 // semantic correctness. 239 Node( uint required ); 240 241 // Create a new Node with given input edges. 242 // This version requires use of the "edge-count" new. 243 // E.g. new (C,3) FooNode( C, NULL, left, right ); 244 Node( Node *n0 ); 245 Node( Node *n0, Node *n1 ); 246 Node( Node *n0, Node *n1, Node *n2 ); 247 Node( Node *n0, Node *n1, Node *n2, Node *n3 ); 248 Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4 ); 249 Node( Node *n0, Node *n1, Node *n2, Node *n3, Node *n4, Node *n5 ); 250 Node( Node *n0, Node *n1, Node *n2, Node *n3, 251 Node *n4, Node *n5, Node *n6 ); 252 253 // Clone an inherited Node given only the base Node type. 254 Node* clone() const; 255 256 // Clone a Node, immediately supplying one or two new edges. 257 // The first and second arguments, if non-null, replace in(1) and in(2), 258 // respectively. 259 Node* clone_with_data_edge(Node* in1, Node* in2 = NULL) const { 260 Node* nn = clone(); 261 if (in1 != NULL) nn->set_req(1, in1); 262 if (in2 != NULL) nn->set_req(2, in2); 263 return nn; 264 } 265 266 private: 267 // Shared setup for the above constructors. 268 // Handles all interactions with Compile::current. 269 // Puts initial values in all Node fields except _idx. 270 // Returns the initial value for _idx, which cannot 271 // be initialized by assignment. 272 inline int Init(int req); 273 274 //----------------- input edge handling 275 protected: 276 friend class PhaseCFG; // Access to address of _in array elements 277 Node **_in; // Array of use-def references to Nodes 278 Node **_out; // Array of def-use references to Nodes 279 280 // Input edges are split into two categories. Required edges are required 281 // for semantic correctness; order is important and NULLs are allowed. 282 // Precedence edges are used to help determine execution order and are 283 // added, e.g., for scheduling purposes. They are unordered and not 284 // duplicated; they have no embedded NULLs. Edges from 0 to _cnt-1 285 // are required, from _cnt to _max-1 are precedence edges. 286 node_idx_t _cnt; // Total number of required Node inputs. 287 288 node_idx_t _max; // Actual length of input array. 289 290 // Output edges are an unordered list of def-use edges which exactly 291 // correspond to required input edges which point from other nodes 292 // to this one. Thus the count of the output edges is the number of 293 // users of this node. 294 node_idx_t _outcnt; // Total number of Node outputs. 295 296 node_idx_t _outmax; // Actual length of output array. 297 298 // Grow the actual input array to the next larger power-of-2 bigger than len. 299 void grow( uint len ); 300 // Grow the output array to the next larger power-of-2 bigger than len. 301 void out_grow( uint len ); 302 303 public: 304 // Each Node is assigned a unique small/dense number. This number is used 305 // to index into auxiliary arrays of data and bit vectors. 306 // The field _idx is declared constant to defend against inadvertent assignments, 307 // since it is used by clients as a naked field. However, the field's value can be 308 // changed using the set_idx() method. 309 // 310 // The PhaseRenumberLive phase renumbers nodes based on liveness information. 311 // Therefore, it updates the value of the _idx field. The parse-time _idx is 312 // preserved in _parse_idx. 313 const node_idx_t _idx; 314 DEBUG_ONLY(const node_idx_t _parse_idx;) 315 316 // Get the (read-only) number of input edges 317 uint req() const { return _cnt; } 318 uint len() const { return _max; } 319 // Get the (read-only) number of output edges 320 uint outcnt() const { return _outcnt; } 321 322 #if OPTO_DU_ITERATOR_ASSERT 323 // Iterate over the out-edges of this node. Deletions are illegal. 324 inline DUIterator outs() const; 325 // Use this when the out array might have changed to suppress asserts. 326 inline DUIterator& refresh_out_pos(DUIterator& i) const; 327 // Does the node have an out at this position? (Used for iteration.) 328 inline bool has_out(DUIterator& i) const; 329 inline Node* out(DUIterator& i) const; 330 // Iterate over the out-edges of this node. All changes are illegal. 331 inline DUIterator_Fast fast_outs(DUIterator_Fast& max) const; 332 inline Node* fast_out(DUIterator_Fast& i) const; 333 // Iterate over the out-edges of this node, deleting one at a time. 334 inline DUIterator_Last last_outs(DUIterator_Last& min) const; 335 inline Node* last_out(DUIterator_Last& i) const; 336 // The inline bodies of all these methods are after the iterator definitions. 337 #else 338 // Iterate over the out-edges of this node. Deletions are illegal. 339 // This iteration uses integral indexes, to decouple from array reallocations. 340 DUIterator outs() const { return 0; } 341 // Use this when the out array might have changed to suppress asserts. 342 DUIterator refresh_out_pos(DUIterator i) const { return i; } 343 344 // Reference to the i'th output Node. Error if out of bounds. 345 Node* out(DUIterator i) const { assert(i < _outcnt, "oob"); return _out[i]; } 346 // Does the node have an out at this position? (Used for iteration.) 347 bool has_out(DUIterator i) const { return i < _outcnt; } 348 349 // Iterate over the out-edges of this node. All changes are illegal. 350 // This iteration uses a pointer internal to the out array. 351 DUIterator_Fast fast_outs(DUIterator_Fast& max) const { 352 Node** out = _out; 353 // Assign a limit pointer to the reference argument: 354 max = out + (ptrdiff_t)_outcnt; 355 // Return the base pointer: 356 return out; 357 } 358 Node* fast_out(DUIterator_Fast i) const { return *i; } 359 // Iterate over the out-edges of this node, deleting one at a time. 360 // This iteration uses a pointer internal to the out array. 361 DUIterator_Last last_outs(DUIterator_Last& min) const { 362 Node** out = _out; 363 // Assign a limit pointer to the reference argument: 364 min = out; 365 // Return the pointer to the start of the iteration: 366 return out + (ptrdiff_t)_outcnt - 1; 367 } 368 Node* last_out(DUIterator_Last i) const { return *i; } 369 #endif 370 371 // Reference to the i'th input Node. Error if out of bounds. 372 Node* in(uint i) const { assert(i < _max, "oob: i=%d, _max=%d", i, _max); return _in[i]; } 373 // Reference to the i'th input Node. NULL if out of bounds. 374 Node* lookup(uint i) const { return ((i < _max) ? _in[i] : NULL); } 375 // Reference to the i'th output Node. Error if out of bounds. 376 // Use this accessor sparingly. We are going trying to use iterators instead. 377 Node* raw_out(uint i) const { assert(i < _outcnt,"oob"); return _out[i]; } 378 // Return the unique out edge. 379 Node* unique_out() const { assert(_outcnt==1,"not unique"); return _out[0]; } 380 // Delete out edge at position 'i' by moving last out edge to position 'i' 381 void raw_del_out(uint i) { 382 assert(i < _outcnt,"oob"); 383 assert(_outcnt > 0,"oob"); 384 #if OPTO_DU_ITERATOR_ASSERT 385 // Record that a change happened here. 386 debug_only(_last_del = _out[i]; ++_del_tick); 387 #endif 388 _out[i] = _out[--_outcnt]; 389 // Smash the old edge so it can't be used accidentally. 390 debug_only(_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef); 391 } 392 393 #ifdef ASSERT 394 bool is_dead() const; 395 #define is_not_dead(n) ((n) == NULL || !VerifyIterativeGVN || !((n)->is_dead())) 396 #endif 397 // Check whether node has become unreachable 398 bool is_unreachable(PhaseIterGVN &igvn) const; 399 400 // Set a required input edge, also updates corresponding output edge 401 void add_req( Node *n ); // Append a NEW required input 402 void add_req( Node *n0, Node *n1 ) { 403 add_req(n0); add_req(n1); } 404 void add_req( Node *n0, Node *n1, Node *n2 ) { 405 add_req(n0); add_req(n1); add_req(n2); } 406 void add_req_batch( Node* n, uint m ); // Append m NEW required inputs (all n). 407 void del_req( uint idx ); // Delete required edge & compact 408 void del_req_ordered( uint idx ); // Delete required edge & compact with preserved order 409 void ins_req( uint i, Node *n ); // Insert a NEW required input 410 void set_req( uint i, Node *n ) { 411 assert( is_not_dead(n), "can not use dead node"); 412 assert( i < _cnt, "oob: i=%d, _cnt=%d", i, _cnt); 413 assert( !VerifyHashTableKeys || _hash_lock == 0, 414 "remove node from hash table before modifying it"); 415 Node** p = &_in[i]; // cache this._in, across the del_out call 416 if (*p != NULL) (*p)->del_out((Node *)this); 417 (*p) = n; 418 if (n != NULL) n->add_out((Node *)this); 419 Compile::current()->record_modified_node(this); 420 } 421 // Light version of set_req() to init inputs after node creation. 422 void init_req( uint i, Node *n ) { 423 assert( i == 0 && this == n || 424 is_not_dead(n), "can not use dead node"); 425 assert( i < _cnt, "oob"); 426 assert( !VerifyHashTableKeys || _hash_lock == 0, 427 "remove node from hash table before modifying it"); 428 assert( _in[i] == NULL, "sanity"); 429 _in[i] = n; 430 if (n != NULL) n->add_out((Node *)this); 431 Compile::current()->record_modified_node(this); 432 } 433 // Find first occurrence of n among my edges: 434 int find_edge(Node* n); 435 int find_prec_edge(Node* n) { 436 for (uint i = req(); i < len(); i++) { 437 if (_in[i] == n) return i; 438 if (_in[i] == NULL) { 439 DEBUG_ONLY( while ((++i) < len()) assert(_in[i] == NULL, "Gap in prec edges!"); ) 440 break; 441 } 442 } 443 return -1; 444 } 445 int replace_edge(Node* old, Node* neww); 446 int replace_edges_in_range(Node* old, Node* neww, int start, int end); 447 // NULL out all inputs to eliminate incoming Def-Use edges. 448 // Return the number of edges between 'n' and 'this' 449 int disconnect_inputs(Node *n, Compile *c); 450 451 // Quickly, return true if and only if I am Compile::current()->top(). 452 bool is_top() const { 453 assert((this == (Node*) Compile::current()->top()) == (_out == NULL), ""); 454 return (_out == NULL); 455 } 456 // Reaffirm invariants for is_top. (Only from Compile::set_cached_top_node.) 457 void setup_is_top(); 458 459 // Strip away casting. (It is depth-limited.) 460 Node* uncast() const; 461 // Return whether two Nodes are equivalent, after stripping casting. 462 bool eqv_uncast(const Node* n) const { 463 return (this->uncast() == n->uncast()); 464 } 465 466 // Find out of current node that matches opcode. 467 Node* find_out_with(int opcode); 468 // Return true if the current node has an out that matches opcode. 469 bool has_out_with(int opcode); 470 // Return true if the current node has an out that matches any of the opcodes. 471 bool has_out_with(int opcode1, int opcode2, int opcode3, int opcode4); 472 473 private: 474 static Node* uncast_helper(const Node* n); 475 476 // Add an output edge to the end of the list 477 void add_out( Node *n ) { 478 if (is_top()) return; 479 if( _outcnt == _outmax ) out_grow(_outcnt); 480 _out[_outcnt++] = n; 481 } 482 // Delete an output edge 483 void del_out( Node *n ) { 484 if (is_top()) return; 485 Node** outp = &_out[_outcnt]; 486 // Find and remove n 487 do { 488 assert(outp > _out, "Missing Def-Use edge"); 489 } while (*--outp != n); 490 *outp = _out[--_outcnt]; 491 // Smash the old edge so it can't be used accidentally. 492 debug_only(_out[_outcnt] = (Node *)(uintptr_t)0xdeadbeef); 493 // Record that a change happened here. 494 #if OPTO_DU_ITERATOR_ASSERT 495 debug_only(_last_del = n; ++_del_tick); 496 #endif 497 } 498 // Close gap after removing edge. 499 void close_prec_gap_at(uint gap) { 500 assert(_cnt <= gap && gap < _max, "no valid prec edge"); 501 uint i = gap; 502 Node *last = NULL; 503 for (; i < _max-1; ++i) { 504 Node *next = _in[i+1]; 505 if (next == NULL) break; 506 last = next; 507 } 508 _in[gap] = last; // Move last slot to empty one. 509 _in[i] = NULL; // NULL out last slot. 510 } 511 512 public: 513 // Globally replace this node by a given new node, updating all uses. 514 void replace_by(Node* new_node); 515 // Globally replace this node by a given new node, updating all uses 516 // and cutting input edges of old node. 517 void subsume_by(Node* new_node, Compile* c) { 518 replace_by(new_node); 519 disconnect_inputs(NULL, c); 520 } 521 void set_req_X( uint i, Node *n, PhaseIterGVN *igvn ); 522 // Find the one non-null required input. RegionNode only 523 Node *nonnull_req() const; 524 // Add or remove precedence edges 525 void add_prec( Node *n ); 526 void rm_prec( uint i ); 527 528 // Note: prec(i) will not necessarily point to n if edge already exists. 529 void set_prec( uint i, Node *n ) { 530 assert(i < _max, "oob: i=%d, _max=%d", i, _max); 531 assert(is_not_dead(n), "can not use dead node"); 532 assert(i >= _cnt, "not a precedence edge"); 533 // Avoid spec violation: duplicated prec edge. 534 if (_in[i] == n) return; 535 if (n == NULL || find_prec_edge(n) != -1) { 536 rm_prec(i); 537 return; 538 } 539 if (_in[i] != NULL) _in[i]->del_out((Node *)this); 540 _in[i] = n; 541 if (n != NULL) n->add_out((Node *)this); 542 } 543 544 // Set this node's index, used by cisc_version to replace current node 545 void set_idx(uint new_idx) { 546 const node_idx_t* ref = &_idx; 547 *(node_idx_t*)ref = new_idx; 548 } 549 // Swap input edge order. (Edge indexes i1 and i2 are usually 1 and 2.) 550 void swap_edges(uint i1, uint i2) { 551 debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH); 552 // Def-Use info is unchanged 553 Node* n1 = in(i1); 554 Node* n2 = in(i2); 555 _in[i1] = n2; 556 _in[i2] = n1; 557 // If this node is in the hash table, make sure it doesn't need a rehash. 558 assert(check_hash == NO_HASH || check_hash == hash(), "edge swap must preserve hash code"); 559 } 560 561 // Iterators over input Nodes for a Node X are written as: 562 // for( i = 0; i < X.req(); i++ ) ... X[i] ... 563 // NOTE: Required edges can contain embedded NULL pointers. 564 565 //----------------- Other Node Properties 566 567 // Generate class IDs for (some) ideal nodes so that it is possible to determine 568 // the type of a node using a non-virtual method call (the method is_<Node>() below). 569 // 570 // A class ID of an ideal node is a set of bits. In a class ID, a single bit determines 571 // the type of the node the ID represents; another subset of an ID's bits are reserved 572 // for the superclasses of the node represented by the ID. 573 // 574 // By design, if A is a supertype of B, A.is_B() returns true and B.is_A() 575 // returns false. A.is_A() returns true. 576 // 577 // If two classes, A and B, have the same superclass, a different bit of A's class id 578 // is reserved for A's type than for B's type. That bit is specified by the third 579 // parameter in the macro DEFINE_CLASS_ID. 580 // 581 // By convention, classes with deeper hierarchy are declared first. Moreover, 582 // classes with the same hierarchy depth are sorted by usage frequency. 583 // 584 // The query method masks the bits to cut off bits of subclasses and then compares 585 // the result with the class id (see the macro DEFINE_CLASS_QUERY below). 586 // 587 // Class_MachCall=30, ClassMask_MachCall=31 588 // 12 8 4 0 589 // 0 0 0 0 0 0 0 0 1 1 1 1 0 590 // | | | | 591 // | | | Bit_Mach=2 592 // | | Bit_MachReturn=4 593 // | Bit_MachSafePoint=8 594 // Bit_MachCall=16 595 // 596 // Class_CountedLoop=56, ClassMask_CountedLoop=63 597 // 12 8 4 0 598 // 0 0 0 0 0 0 0 1 1 1 0 0 0 599 // | | | 600 // | | Bit_Region=8 601 // | Bit_Loop=16 602 // Bit_CountedLoop=32 603 604 #define DEFINE_CLASS_ID(cl, supcl, subn) \ 605 Bit_##cl = (Class_##supcl == 0) ? 1 << subn : (Bit_##supcl) << (1 + subn) , \ 606 Class_##cl = Class_##supcl + Bit_##cl , \ 607 ClassMask_##cl = ((Bit_##cl << 1) - 1) , 608 609 // This enum is used only for C2 ideal and mach nodes with is_<node>() methods 610 // so that it's values fits into 16 bits. 611 enum NodeClasses { 612 Bit_Node = 0x0000, 613 Class_Node = 0x0000, 614 ClassMask_Node = 0xFFFF, 615 616 DEFINE_CLASS_ID(Multi, Node, 0) 617 DEFINE_CLASS_ID(SafePoint, Multi, 0) 618 DEFINE_CLASS_ID(Call, SafePoint, 0) 619 DEFINE_CLASS_ID(CallJava, Call, 0) 620 DEFINE_CLASS_ID(CallStaticJava, CallJava, 0) 621 DEFINE_CLASS_ID(CallDynamicJava, CallJava, 1) 622 DEFINE_CLASS_ID(CallRuntime, Call, 1) 623 DEFINE_CLASS_ID(CallLeaf, CallRuntime, 0) 624 DEFINE_CLASS_ID(Allocate, Call, 2) 625 DEFINE_CLASS_ID(AllocateArray, Allocate, 0) 626 DEFINE_CLASS_ID(AbstractLock, Call, 3) 627 DEFINE_CLASS_ID(Lock, AbstractLock, 0) 628 DEFINE_CLASS_ID(Unlock, AbstractLock, 1) 629 DEFINE_CLASS_ID(ArrayCopy, Call, 4) 630 DEFINE_CLASS_ID(MultiBranch, Multi, 1) 631 DEFINE_CLASS_ID(PCTable, MultiBranch, 0) 632 DEFINE_CLASS_ID(Catch, PCTable, 0) 633 DEFINE_CLASS_ID(Jump, PCTable, 1) 634 DEFINE_CLASS_ID(If, MultiBranch, 1) 635 DEFINE_CLASS_ID(CountedLoopEnd, If, 0) 636 DEFINE_CLASS_ID(RangeCheck, If, 1) 637 DEFINE_CLASS_ID(OuterStripMinedLoopEnd, If, 2) 638 DEFINE_CLASS_ID(NeverBranch, MultiBranch, 2) 639 DEFINE_CLASS_ID(Start, Multi, 2) 640 DEFINE_CLASS_ID(MemBar, Multi, 3) 641 DEFINE_CLASS_ID(Initialize, MemBar, 0) 642 DEFINE_CLASS_ID(MemBarStoreStore, MemBar, 1) 643 DEFINE_CLASS_ID(LoadBarrier, Multi, 4) 644 645 DEFINE_CLASS_ID(Mach, Node, 1) 646 DEFINE_CLASS_ID(MachReturn, Mach, 0) 647 DEFINE_CLASS_ID(MachSafePoint, MachReturn, 0) 648 DEFINE_CLASS_ID(MachCall, MachSafePoint, 0) 649 DEFINE_CLASS_ID(MachCallJava, MachCall, 0) 650 DEFINE_CLASS_ID(MachCallStaticJava, MachCallJava, 0) 651 DEFINE_CLASS_ID(MachCallDynamicJava, MachCallJava, 1) 652 DEFINE_CLASS_ID(MachCallRuntime, MachCall, 1) 653 DEFINE_CLASS_ID(MachCallLeaf, MachCallRuntime, 0) 654 DEFINE_CLASS_ID(MachBranch, Mach, 1) 655 DEFINE_CLASS_ID(MachIf, MachBranch, 0) 656 DEFINE_CLASS_ID(MachGoto, MachBranch, 1) 657 DEFINE_CLASS_ID(MachNullCheck, MachBranch, 2) 658 DEFINE_CLASS_ID(MachSpillCopy, Mach, 2) 659 DEFINE_CLASS_ID(MachTemp, Mach, 3) 660 DEFINE_CLASS_ID(MachConstantBase, Mach, 4) 661 DEFINE_CLASS_ID(MachConstant, Mach, 5) 662 DEFINE_CLASS_ID(MachJump, MachConstant, 0) 663 DEFINE_CLASS_ID(MachMerge, Mach, 6) 664 DEFINE_CLASS_ID(MachMemBar, Mach, 7) 665 666 DEFINE_CLASS_ID(Type, Node, 2) 667 DEFINE_CLASS_ID(Phi, Type, 0) 668 DEFINE_CLASS_ID(ConstraintCast, Type, 1) 669 DEFINE_CLASS_ID(CastII, ConstraintCast, 0) 670 DEFINE_CLASS_ID(CheckCastPP, ConstraintCast, 1) 671 DEFINE_CLASS_ID(CMove, Type, 3) 672 DEFINE_CLASS_ID(SafePointScalarObject, Type, 4) 673 DEFINE_CLASS_ID(DecodeNarrowPtr, Type, 5) 674 DEFINE_CLASS_ID(DecodeN, DecodeNarrowPtr, 0) 675 DEFINE_CLASS_ID(DecodeNKlass, DecodeNarrowPtr, 1) 676 DEFINE_CLASS_ID(EncodeNarrowPtr, Type, 6) 677 DEFINE_CLASS_ID(EncodeP, EncodeNarrowPtr, 0) 678 DEFINE_CLASS_ID(EncodePKlass, EncodeNarrowPtr, 1) 679 DEFINE_CLASS_ID(ShenandoahBarrier, Type, 7) 680 681 DEFINE_CLASS_ID(Proj, Node, 3) 682 DEFINE_CLASS_ID(CatchProj, Proj, 0) 683 DEFINE_CLASS_ID(JumpProj, Proj, 1) 684 DEFINE_CLASS_ID(IfProj, Proj, 2) 685 DEFINE_CLASS_ID(IfTrue, IfProj, 0) 686 DEFINE_CLASS_ID(IfFalse, IfProj, 1) 687 DEFINE_CLASS_ID(Parm, Proj, 4) 688 DEFINE_CLASS_ID(MachProj, Proj, 5) 689 690 DEFINE_CLASS_ID(Mem, Node, 4) 691 DEFINE_CLASS_ID(Load, Mem, 0) 692 DEFINE_CLASS_ID(LoadVector, Load, 0) 693 DEFINE_CLASS_ID(LoadBarrierSlowReg, Load, 1) 694 DEFINE_CLASS_ID(LoadBarrierWeakSlowReg, Load, 2) 695 DEFINE_CLASS_ID(Store, Mem, 1) 696 DEFINE_CLASS_ID(StoreVector, Store, 0) 697 DEFINE_CLASS_ID(LoadStore, Mem, 2) 698 DEFINE_CLASS_ID(LoadStoreConditional, LoadStore, 0) 699 DEFINE_CLASS_ID(CompareAndSwap, LoadStoreConditional, 0) 700 DEFINE_CLASS_ID(CompareAndExchangeNode, LoadStore, 1) 701 702 DEFINE_CLASS_ID(Region, Node, 5) 703 DEFINE_CLASS_ID(Loop, Region, 0) 704 DEFINE_CLASS_ID(Root, Loop, 0) 705 DEFINE_CLASS_ID(CountedLoop, Loop, 1) 706 DEFINE_CLASS_ID(OuterStripMinedLoop, Loop, 2) 707 708 DEFINE_CLASS_ID(Sub, Node, 6) 709 DEFINE_CLASS_ID(Cmp, Sub, 0) 710 DEFINE_CLASS_ID(FastLock, Cmp, 0) 711 DEFINE_CLASS_ID(FastUnlock, Cmp, 1) 712 713 DEFINE_CLASS_ID(MergeMem, Node, 7) 714 DEFINE_CLASS_ID(Bool, Node, 8) 715 DEFINE_CLASS_ID(AddP, Node, 9) 716 DEFINE_CLASS_ID(BoxLock, Node, 10) 717 DEFINE_CLASS_ID(Add, Node, 11) 718 DEFINE_CLASS_ID(Mul, Node, 12) 719 DEFINE_CLASS_ID(Vector, Node, 13) 720 DEFINE_CLASS_ID(ClearArray, Node, 14) 721 722 _max_classes = ClassMask_ClearArray 723 }; 724 #undef DEFINE_CLASS_ID 725 726 // Flags are sorted by usage frequency. 727 enum NodeFlags { 728 Flag_is_Copy = 0x01, // should be first bit to avoid shift 729 Flag_rematerialize = Flag_is_Copy << 1, 730 Flag_needs_anti_dependence_check = Flag_rematerialize << 1, 731 Flag_is_macro = Flag_needs_anti_dependence_check << 1, 732 Flag_is_Con = Flag_is_macro << 1, 733 Flag_is_cisc_alternate = Flag_is_Con << 1, 734 Flag_is_dead_loop_safe = Flag_is_cisc_alternate << 1, 735 Flag_may_be_short_branch = Flag_is_dead_loop_safe << 1, 736 Flag_avoid_back_to_back_before = Flag_may_be_short_branch << 1, 737 Flag_avoid_back_to_back_after = Flag_avoid_back_to_back_before << 1, 738 Flag_has_call = Flag_avoid_back_to_back_after << 1, 739 Flag_is_reduction = Flag_has_call << 1, 740 Flag_is_scheduled = Flag_is_reduction << 1, 741 Flag_has_vector_mask_set = Flag_is_scheduled << 1, 742 Flag_is_expensive = Flag_has_vector_mask_set << 1, 743 _max_flags = (Flag_is_expensive << 1) - 1 // allow flags combination 744 }; 745 746 private: 747 jushort _class_id; 748 jushort _flags; 749 750 protected: 751 // These methods should be called from constructors only. 752 void init_class_id(jushort c) { 753 assert(c <= _max_classes, "invalid node class"); 754 _class_id = c; // cast out const 755 } 756 void init_flags(jushort fl) { 757 assert(fl <= _max_flags, "invalid node flag"); 758 _flags |= fl; 759 } 760 void clear_flag(jushort fl) { 761 assert(fl <= _max_flags, "invalid node flag"); 762 _flags &= ~fl; 763 } 764 765 public: 766 const jushort class_id() const { return _class_id; } 767 768 const jushort flags() const { return _flags; } 769 770 void add_flag(jushort fl) { init_flags(fl); } 771 772 void remove_flag(jushort fl) { clear_flag(fl); } 773 774 // Return a dense integer opcode number 775 virtual int Opcode() const; 776 777 // Virtual inherited Node size 778 virtual uint size_of() const; 779 780 // Other interesting Node properties 781 #define DEFINE_CLASS_QUERY(type) \ 782 bool is_##type() const { \ 783 return ((_class_id & ClassMask_##type) == Class_##type); \ 784 } \ 785 type##Node *as_##type() const { \ 786 assert(is_##type(), "invalid node class"); \ 787 return (type##Node*)this; \ 788 } \ 789 type##Node* isa_##type() const { \ 790 return (is_##type()) ? as_##type() : NULL; \ 791 } 792 793 DEFINE_CLASS_QUERY(AbstractLock) 794 DEFINE_CLASS_QUERY(Add) 795 DEFINE_CLASS_QUERY(AddP) 796 DEFINE_CLASS_QUERY(Allocate) 797 DEFINE_CLASS_QUERY(AllocateArray) 798 DEFINE_CLASS_QUERY(ArrayCopy) 799 DEFINE_CLASS_QUERY(Bool) 800 DEFINE_CLASS_QUERY(BoxLock) 801 DEFINE_CLASS_QUERY(Call) 802 DEFINE_CLASS_QUERY(CallDynamicJava) 803 DEFINE_CLASS_QUERY(CallJava) 804 DEFINE_CLASS_QUERY(CallLeaf) 805 DEFINE_CLASS_QUERY(CallRuntime) 806 DEFINE_CLASS_QUERY(CallStaticJava) 807 DEFINE_CLASS_QUERY(Catch) 808 DEFINE_CLASS_QUERY(CatchProj) 809 DEFINE_CLASS_QUERY(CheckCastPP) 810 DEFINE_CLASS_QUERY(CastII) 811 DEFINE_CLASS_QUERY(ConstraintCast) 812 DEFINE_CLASS_QUERY(ClearArray) 813 DEFINE_CLASS_QUERY(CMove) 814 DEFINE_CLASS_QUERY(Cmp) 815 DEFINE_CLASS_QUERY(CountedLoop) 816 DEFINE_CLASS_QUERY(CountedLoopEnd) 817 DEFINE_CLASS_QUERY(DecodeNarrowPtr) 818 DEFINE_CLASS_QUERY(DecodeN) 819 DEFINE_CLASS_QUERY(DecodeNKlass) 820 DEFINE_CLASS_QUERY(EncodeNarrowPtr) 821 DEFINE_CLASS_QUERY(EncodeP) 822 DEFINE_CLASS_QUERY(EncodePKlass) 823 DEFINE_CLASS_QUERY(FastLock) 824 DEFINE_CLASS_QUERY(FastUnlock) 825 DEFINE_CLASS_QUERY(If) 826 DEFINE_CLASS_QUERY(RangeCheck) 827 DEFINE_CLASS_QUERY(IfProj) 828 DEFINE_CLASS_QUERY(IfFalse) 829 DEFINE_CLASS_QUERY(IfTrue) 830 DEFINE_CLASS_QUERY(Initialize) 831 DEFINE_CLASS_QUERY(Jump) 832 DEFINE_CLASS_QUERY(JumpProj) 833 DEFINE_CLASS_QUERY(Load) 834 DEFINE_CLASS_QUERY(LoadStore) 835 DEFINE_CLASS_QUERY(LoadBarrier) 836 DEFINE_CLASS_QUERY(LoadBarrierSlowReg) 837 DEFINE_CLASS_QUERY(LoadBarrierWeakSlowReg) 838 DEFINE_CLASS_QUERY(Lock) 839 DEFINE_CLASS_QUERY(Loop) 840 DEFINE_CLASS_QUERY(Mach) 841 DEFINE_CLASS_QUERY(MachBranch) 842 DEFINE_CLASS_QUERY(MachCall) 843 DEFINE_CLASS_QUERY(MachCallDynamicJava) 844 DEFINE_CLASS_QUERY(MachCallJava) 845 DEFINE_CLASS_QUERY(MachCallLeaf) 846 DEFINE_CLASS_QUERY(MachCallRuntime) 847 DEFINE_CLASS_QUERY(MachCallStaticJava) 848 DEFINE_CLASS_QUERY(MachConstantBase) 849 DEFINE_CLASS_QUERY(MachConstant) 850 DEFINE_CLASS_QUERY(MachGoto) 851 DEFINE_CLASS_QUERY(MachIf) 852 DEFINE_CLASS_QUERY(MachJump) 853 DEFINE_CLASS_QUERY(MachNullCheck) 854 DEFINE_CLASS_QUERY(MachProj) 855 DEFINE_CLASS_QUERY(MachReturn) 856 DEFINE_CLASS_QUERY(MachSafePoint) 857 DEFINE_CLASS_QUERY(MachSpillCopy) 858 DEFINE_CLASS_QUERY(MachTemp) 859 DEFINE_CLASS_QUERY(MachMemBar) 860 DEFINE_CLASS_QUERY(MachMerge) 861 DEFINE_CLASS_QUERY(Mem) 862 DEFINE_CLASS_QUERY(MemBar) 863 DEFINE_CLASS_QUERY(MemBarStoreStore) 864 DEFINE_CLASS_QUERY(MergeMem) 865 DEFINE_CLASS_QUERY(Mul) 866 DEFINE_CLASS_QUERY(Multi) 867 DEFINE_CLASS_QUERY(MultiBranch) 868 DEFINE_CLASS_QUERY(OuterStripMinedLoop) 869 DEFINE_CLASS_QUERY(OuterStripMinedLoopEnd) 870 DEFINE_CLASS_QUERY(Parm) 871 DEFINE_CLASS_QUERY(PCTable) 872 DEFINE_CLASS_QUERY(Phi) 873 DEFINE_CLASS_QUERY(Proj) 874 DEFINE_CLASS_QUERY(Region) 875 DEFINE_CLASS_QUERY(Root) 876 DEFINE_CLASS_QUERY(SafePoint) 877 DEFINE_CLASS_QUERY(SafePointScalarObject) 878 DEFINE_CLASS_QUERY(ShenandoahBarrier) 879 DEFINE_CLASS_QUERY(Start) 880 DEFINE_CLASS_QUERY(Store) 881 DEFINE_CLASS_QUERY(Sub) 882 DEFINE_CLASS_QUERY(Type) 883 DEFINE_CLASS_QUERY(Vector) 884 DEFINE_CLASS_QUERY(LoadVector) 885 DEFINE_CLASS_QUERY(StoreVector) 886 DEFINE_CLASS_QUERY(Unlock) 887 888 #undef DEFINE_CLASS_QUERY 889 890 // duplicate of is_MachSpillCopy() 891 bool is_SpillCopy () const { 892 return ((_class_id & ClassMask_MachSpillCopy) == Class_MachSpillCopy); 893 } 894 895 bool is_Con () const { return (_flags & Flag_is_Con) != 0; } 896 // The data node which is safe to leave in dead loop during IGVN optimization. 897 bool is_dead_loop_safe() const { 898 return is_Phi() || (is_Proj() && in(0) == NULL) || 899 ((_flags & (Flag_is_dead_loop_safe | Flag_is_Con)) != 0 && 900 (!is_Proj() || !in(0)->is_Allocate())); 901 } 902 903 // is_Copy() returns copied edge index (0 or 1) 904 uint is_Copy() const { return (_flags & Flag_is_Copy); } 905 906 virtual bool is_CFG() const { return false; } 907 908 // If this node is control-dependent on a test, can it be 909 // rerouted to a dominating equivalent test? This is usually 910 // true of non-CFG nodes, but can be false for operations which 911 // depend for their correct sequencing on more than one test. 912 // (In that case, hoisting to a dominating test may silently 913 // skip some other important test.) 914 virtual bool depends_only_on_test() const { assert(!is_CFG(), ""); return true; }; 915 916 // When building basic blocks, I need to have a notion of block beginning 917 // Nodes, next block selector Nodes (block enders), and next block 918 // projections. These calls need to work on their machine equivalents. The 919 // Ideal beginning Nodes are RootNode, RegionNode and StartNode. 920 bool is_block_start() const { 921 if ( is_Region() ) 922 return this == (const Node*)in(0); 923 else 924 return is_Start(); 925 } 926 927 // The Ideal control projection Nodes are IfTrue/IfFalse, JumpProjNode, Root, 928 // Goto and Return. This call also returns the block ending Node. 929 virtual const Node *is_block_proj() const; 930 931 // The node is a "macro" node which needs to be expanded before matching 932 bool is_macro() const { return (_flags & Flag_is_macro) != 0; } 933 // The node is expensive: the best control is set during loop opts 934 bool is_expensive() const { return (_flags & Flag_is_expensive) != 0 && in(0) != NULL; } 935 936 // An arithmetic node which accumulates a data in a loop. 937 // It must have the loop's phi as input and provide a def to the phi. 938 bool is_reduction() const { return (_flags & Flag_is_reduction) != 0; } 939 940 // The node is a CountedLoopEnd with a mask annotation so as to emit a restore context 941 bool has_vector_mask_set() const { return (_flags & Flag_has_vector_mask_set) != 0; } 942 943 // Used in lcm to mark nodes that have scheduled 944 bool is_scheduled() const { return (_flags & Flag_is_scheduled) != 0; } 945 946 //----------------- Optimization 947 948 // Get the worst-case Type output for this Node. 949 virtual const class Type *bottom_type() const; 950 951 // If we find a better type for a node, try to record it permanently. 952 // Return true if this node actually changed. 953 // Be sure to do the hash_delete game in the "rehash" variant. 954 void raise_bottom_type(const Type* new_type); 955 956 // Get the address type with which this node uses and/or defs memory, 957 // or NULL if none. The address type is conservatively wide. 958 // Returns non-null for calls, membars, loads, stores, etc. 959 // Returns TypePtr::BOTTOM if the node touches memory "broadly". 960 virtual const class TypePtr *adr_type() const { return NULL; } 961 962 // Return an existing node which computes the same function as this node. 963 // The optimistic combined algorithm requires this to return a Node which 964 // is a small number of steps away (e.g., one of my inputs). 965 virtual Node* Identity(PhaseGVN* phase); 966 967 // Return the set of values this Node can take on at runtime. 968 virtual const Type* Value(PhaseGVN* phase) const; 969 970 // Return a node which is more "ideal" than the current node. 971 // The invariants on this call are subtle. If in doubt, read the 972 // treatise in node.cpp above the default implemention AND TEST WITH 973 // +VerifyIterativeGVN! 974 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 975 976 // Some nodes have specific Ideal subgraph transformations only if they are 977 // unique users of specific nodes. Such nodes should be put on IGVN worklist 978 // for the transformations to happen. 979 bool has_special_unique_user() const; 980 981 // Skip Proj and CatchProj nodes chains. Check for Null and Top. 982 Node* find_exact_control(Node* ctrl); 983 984 // Check if 'this' node dominates or equal to 'sub'. 985 bool dominates(Node* sub, Node_List &nlist); 986 987 protected: 988 bool remove_dead_region(PhaseGVN *phase, bool can_reshape); 989 public: 990 991 // See if there is valid pipeline info 992 static const Pipeline *pipeline_class(); 993 virtual const Pipeline *pipeline() const; 994 995 // Compute the latency from the def to this instruction of the ith input node 996 uint latency(uint i); 997 998 // Hash & compare functions, for pessimistic value numbering 999 1000 // If the hash function returns the special sentinel value NO_HASH, 1001 // the node is guaranteed never to compare equal to any other node. 1002 // If we accidentally generate a hash with value NO_HASH the node 1003 // won't go into the table and we'll lose a little optimization. 1004 enum { NO_HASH = 0 }; 1005 virtual uint hash() const; 1006 virtual uint cmp( const Node &n ) const; 1007 1008 // Operation appears to be iteratively computed (such as an induction variable) 1009 // It is possible for this operation to return false for a loop-varying 1010 // value, if it appears (by local graph inspection) to be computed by a simple conditional. 1011 bool is_iteratively_computed(); 1012 1013 // Determine if a node is Counted loop induction variable. 1014 // The method is defined in loopnode.cpp. 1015 const Node* is_loop_iv() const; 1016 1017 // Return a node with opcode "opc" and same inputs as "this" if one can 1018 // be found; Otherwise return NULL; 1019 Node* find_similar(int opc); 1020 1021 // Return the unique control out if only one. Null if none or more than one. 1022 Node* unique_ctrl_out() const; 1023 1024 // Set control or add control as precedence edge 1025 void ensure_control_or_add_prec(Node* c); 1026 1027 //----------------- Code Generation 1028 1029 // Ideal register class for Matching. Zero means unmatched instruction 1030 // (these are cloned instead of converted to machine nodes). 1031 virtual uint ideal_reg() const; 1032 1033 static const uint NotAMachineReg; // must be > max. machine register 1034 1035 // Do we Match on this edge index or not? Generally false for Control 1036 // and true for everything else. Weird for calls & returns. 1037 virtual uint match_edge(uint idx) const; 1038 1039 // Register class output is returned in 1040 virtual const RegMask &out_RegMask() const; 1041 // Register class input is expected in 1042 virtual const RegMask &in_RegMask(uint) const; 1043 // Should we clone rather than spill this instruction? 1044 bool rematerialize() const; 1045 1046 // Return JVM State Object if this Node carries debug info, or NULL otherwise 1047 virtual JVMState* jvms() const; 1048 1049 // Print as assembly 1050 virtual void format( PhaseRegAlloc *, outputStream* st = tty ) const; 1051 // Emit bytes starting at parameter 'ptr' 1052 // Bump 'ptr' by the number of output bytes 1053 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const; 1054 // Size of instruction in bytes 1055 virtual uint size(PhaseRegAlloc *ra_) const; 1056 1057 // Convenience function to extract an integer constant from a node. 1058 // If it is not an integer constant (either Con, CastII, or Mach), 1059 // return value_if_unknown. 1060 jint find_int_con(jint value_if_unknown) const { 1061 const TypeInt* t = find_int_type(); 1062 return (t != NULL && t->is_con()) ? t->get_con() : value_if_unknown; 1063 } 1064 // Return the constant, knowing it is an integer constant already 1065 jint get_int() const { 1066 const TypeInt* t = find_int_type(); 1067 guarantee(t != NULL, "must be con"); 1068 return t->get_con(); 1069 } 1070 // Here's where the work is done. Can produce non-constant int types too. 1071 const TypeInt* find_int_type() const; 1072 1073 // Same thing for long (and intptr_t, via type.hpp): 1074 jlong get_long() const { 1075 const TypeLong* t = find_long_type(); 1076 guarantee(t != NULL, "must be con"); 1077 return t->get_con(); 1078 } 1079 jlong find_long_con(jint value_if_unknown) const { 1080 const TypeLong* t = find_long_type(); 1081 return (t != NULL && t->is_con()) ? t->get_con() : value_if_unknown; 1082 } 1083 const TypeLong* find_long_type() const; 1084 1085 const TypePtr* get_ptr_type() const; 1086 1087 // These guys are called by code generated by ADLC: 1088 intptr_t get_ptr() const; 1089 intptr_t get_narrowcon() const; 1090 jdouble getd() const; 1091 jfloat getf() const; 1092 1093 // Nodes which are pinned into basic blocks 1094 virtual bool pinned() const { return false; } 1095 1096 // Nodes which use memory without consuming it, hence need antidependences 1097 // More specifically, needs_anti_dependence_check returns true iff the node 1098 // (a) does a load, and (b) does not perform a store (except perhaps to a 1099 // stack slot or some other unaliased location). 1100 bool needs_anti_dependence_check() const; 1101 1102 // Return which operand this instruction may cisc-spill. In other words, 1103 // return operand position that can convert from reg to memory access 1104 virtual int cisc_operand() const { return AdlcVMDeps::Not_cisc_spillable; } 1105 bool is_cisc_alternate() const { return (_flags & Flag_is_cisc_alternate) != 0; } 1106 1107 //----------------- Graph walking 1108 public: 1109 // Walk and apply member functions recursively. 1110 // Supplied (this) pointer is root. 1111 void walk(NFunc pre, NFunc post, void *env); 1112 static void nop(Node &, void*); // Dummy empty function 1113 static void packregion( Node &n, void* ); 1114 private: 1115 void walk_(NFunc pre, NFunc post, void *env, VectorSet &visited); 1116 1117 //----------------- Printing, etc 1118 public: 1119 #ifndef PRODUCT 1120 Node* find(int idx) const; // Search the graph for the given idx. 1121 Node* find_ctrl(int idx) const; // Search control ancestors for the given idx. 1122 void dump() const { dump("\n"); } // Print this node. 1123 void dump(const char* suffix, bool mark = false, outputStream *st = tty) const; // Print this node. 1124 void dump(int depth) const; // Print this node, recursively to depth d 1125 void dump_ctrl(int depth) const; // Print control nodes, to depth d 1126 void dump_comp() const; // Print this node in compact representation. 1127 // Print this node in compact representation. 1128 void dump_comp(const char* suffix, outputStream *st = tty) const; 1129 virtual void dump_req(outputStream *st = tty) const; // Print required-edge info 1130 virtual void dump_prec(outputStream *st = tty) const; // Print precedence-edge info 1131 virtual void dump_out(outputStream *st = tty) const; // Print the output edge info 1132 virtual void dump_spec(outputStream *st) const {}; // Print per-node info 1133 // Print compact per-node info 1134 virtual void dump_compact_spec(outputStream *st) const { dump_spec(st); } 1135 void dump_related() const; // Print related nodes (depends on node at hand). 1136 // Print related nodes up to given depths for input and output nodes. 1137 void dump_related(uint d_in, uint d_out) const; 1138 void dump_related_compact() const; // Print related nodes in compact representation. 1139 // Collect related nodes. 1140 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 1141 // Collect nodes starting from this node, explicitly including/excluding control and data links. 1142 void collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const; 1143 1144 // Node collectors, to be used in implementations of Node::rel(). 1145 // Collect the entire data input graph. Include control inputs if requested. 1146 void collect_nodes_in_all_data(GrowableArray<Node*> *ns, bool ctrl) const; 1147 // Collect the entire control input graph. Include data inputs if requested. 1148 void collect_nodes_in_all_ctrl(GrowableArray<Node*> *ns, bool data) const; 1149 // Collect the entire output graph until hitting and including control nodes. 1150 void collect_nodes_out_all_ctrl_boundary(GrowableArray<Node*> *ns) const; 1151 1152 void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges 1153 void verify() const; // Check Def-Use info for my subgraph 1154 static void verify_recur(const Node *n, int verify_depth, VectorSet &old_space, VectorSet &new_space); 1155 1156 // This call defines a class-unique string used to identify class instances 1157 virtual const char *Name() const; 1158 1159 void dump_format(PhaseRegAlloc *ra) const; // debug access to MachNode::format(...) 1160 // RegMask Print Functions 1161 void dump_in_regmask(int idx) { in_RegMask(idx).dump(); } 1162 void dump_out_regmask() { out_RegMask().dump(); } 1163 static bool in_dump() { return Compile::current()->_in_dump_cnt > 0; } 1164 void fast_dump() const { 1165 tty->print("%4d: %-17s", _idx, Name()); 1166 for (uint i = 0; i < len(); i++) 1167 if (in(i)) 1168 tty->print(" %4d", in(i)->_idx); 1169 else 1170 tty->print(" NULL"); 1171 tty->print("\n"); 1172 } 1173 #endif 1174 #ifdef ASSERT 1175 void verify_construction(); 1176 bool verify_jvms(const JVMState* jvms) const; 1177 int _debug_idx; // Unique value assigned to every node. 1178 int debug_idx() const { return _debug_idx; } 1179 void set_debug_idx( int debug_idx ) { _debug_idx = debug_idx; } 1180 1181 Node* _debug_orig; // Original version of this, if any. 1182 Node* debug_orig() const { return _debug_orig; } 1183 void set_debug_orig(Node* orig); // _debug_orig = orig 1184 1185 int _hash_lock; // Barrier to modifications of nodes in the hash table 1186 void enter_hash_lock() { ++_hash_lock; assert(_hash_lock < 99, "in too many hash tables?"); } 1187 void exit_hash_lock() { --_hash_lock; assert(_hash_lock >= 0, "mispaired hash locks"); } 1188 1189 static void init_NodeProperty(); 1190 1191 #if OPTO_DU_ITERATOR_ASSERT 1192 const Node* _last_del; // The last deleted node. 1193 uint _del_tick; // Bumped when a deletion happens.. 1194 #endif 1195 #endif 1196 }; 1197 1198 1199 #ifndef PRODUCT 1200 1201 // Used in debugging code to avoid walking across dead or uninitialized edges. 1202 inline bool NotANode(const Node* n) { 1203 if (n == NULL) return true; 1204 if (((intptr_t)n & 1) != 0) return true; // uninitialized, etc. 1205 if (*(address*)n == badAddress) return true; // kill by Node::destruct 1206 return false; 1207 } 1208 1209 #endif 1210 1211 1212 //----------------------------------------------------------------------------- 1213 // Iterators over DU info, and associated Node functions. 1214 1215 #if OPTO_DU_ITERATOR_ASSERT 1216 1217 // Common code for assertion checking on DU iterators. 1218 class DUIterator_Common { 1219 #ifdef ASSERT 1220 protected: 1221 bool _vdui; // cached value of VerifyDUIterators 1222 const Node* _node; // the node containing the _out array 1223 uint _outcnt; // cached node->_outcnt 1224 uint _del_tick; // cached node->_del_tick 1225 Node* _last; // last value produced by the iterator 1226 1227 void sample(const Node* node); // used by c'tor to set up for verifies 1228 void verify(const Node* node, bool at_end_ok = false); 1229 void verify_resync(); 1230 void reset(const DUIterator_Common& that); 1231 1232 // The VDUI_ONLY macro protects code conditionalized on VerifyDUIterators 1233 #define I_VDUI_ONLY(i,x) { if ((i)._vdui) { x; } } 1234 #else 1235 #define I_VDUI_ONLY(i,x) { } 1236 #endif //ASSERT 1237 }; 1238 1239 #define VDUI_ONLY(x) I_VDUI_ONLY(*this, x) 1240 1241 // Default DU iterator. Allows appends onto the out array. 1242 // Allows deletion from the out array only at the current point. 1243 // Usage: 1244 // for (DUIterator i = x->outs(); x->has_out(i); i++) { 1245 // Node* y = x->out(i); 1246 // ... 1247 // } 1248 // Compiles in product mode to a unsigned integer index, which indexes 1249 // onto a repeatedly reloaded base pointer of x->_out. The loop predicate 1250 // also reloads x->_outcnt. If you delete, you must perform "--i" just 1251 // before continuing the loop. You must delete only the last-produced 1252 // edge. You must delete only a single copy of the last-produced edge, 1253 // or else you must delete all copies at once (the first time the edge 1254 // is produced by the iterator). 1255 class DUIterator : public DUIterator_Common { 1256 friend class Node; 1257 1258 // This is the index which provides the product-mode behavior. 1259 // Whatever the product-mode version of the system does to the 1260 // DUI index is done to this index. All other fields in 1261 // this class are used only for assertion checking. 1262 uint _idx; 1263 1264 #ifdef ASSERT 1265 uint _refresh_tick; // Records the refresh activity. 1266 1267 void sample(const Node* node); // Initialize _refresh_tick etc. 1268 void verify(const Node* node, bool at_end_ok = false); 1269 void verify_increment(); // Verify an increment operation. 1270 void verify_resync(); // Verify that we can back up over a deletion. 1271 void verify_finish(); // Verify that the loop terminated properly. 1272 void refresh(); // Resample verification info. 1273 void reset(const DUIterator& that); // Resample after assignment. 1274 #endif 1275 1276 DUIterator(const Node* node, int dummy_to_avoid_conversion) 1277 { _idx = 0; debug_only(sample(node)); } 1278 1279 public: 1280 // initialize to garbage; clear _vdui to disable asserts 1281 DUIterator() 1282 { /*initialize to garbage*/ debug_only(_vdui = false); } 1283 1284 void operator++(int dummy_to_specify_postfix_op) 1285 { _idx++; VDUI_ONLY(verify_increment()); } 1286 1287 void operator--() 1288 { VDUI_ONLY(verify_resync()); --_idx; } 1289 1290 ~DUIterator() 1291 { VDUI_ONLY(verify_finish()); } 1292 1293 void operator=(const DUIterator& that) 1294 { _idx = that._idx; debug_only(reset(that)); } 1295 }; 1296 1297 DUIterator Node::outs() const 1298 { return DUIterator(this, 0); } 1299 DUIterator& Node::refresh_out_pos(DUIterator& i) const 1300 { I_VDUI_ONLY(i, i.refresh()); return i; } 1301 bool Node::has_out(DUIterator& i) const 1302 { I_VDUI_ONLY(i, i.verify(this,true));return i._idx < _outcnt; } 1303 Node* Node::out(DUIterator& i) const 1304 { I_VDUI_ONLY(i, i.verify(this)); return debug_only(i._last=) _out[i._idx]; } 1305 1306 1307 // Faster DU iterator. Disallows insertions into the out array. 1308 // Allows deletion from the out array only at the current point. 1309 // Usage: 1310 // for (DUIterator_Fast imax, i = x->fast_outs(imax); i < imax; i++) { 1311 // Node* y = x->fast_out(i); 1312 // ... 1313 // } 1314 // Compiles in product mode to raw Node** pointer arithmetic, with 1315 // no reloading of pointers from the original node x. If you delete, 1316 // you must perform "--i; --imax" just before continuing the loop. 1317 // If you delete multiple copies of the same edge, you must decrement 1318 // imax, but not i, multiple times: "--i, imax -= num_edges". 1319 class DUIterator_Fast : public DUIterator_Common { 1320 friend class Node; 1321 friend class DUIterator_Last; 1322 1323 // This is the pointer which provides the product-mode behavior. 1324 // Whatever the product-mode version of the system does to the 1325 // DUI pointer is done to this pointer. All other fields in 1326 // this class are used only for assertion checking. 1327 Node** _outp; 1328 1329 #ifdef ASSERT 1330 void verify(const Node* node, bool at_end_ok = false); 1331 void verify_limit(); 1332 void verify_resync(); 1333 void verify_relimit(uint n); 1334 void reset(const DUIterator_Fast& that); 1335 #endif 1336 1337 // Note: offset must be signed, since -1 is sometimes passed 1338 DUIterator_Fast(const Node* node, ptrdiff_t offset) 1339 { _outp = node->_out + offset; debug_only(sample(node)); } 1340 1341 public: 1342 // initialize to garbage; clear _vdui to disable asserts 1343 DUIterator_Fast() 1344 { /*initialize to garbage*/ debug_only(_vdui = false); } 1345 1346 void operator++(int dummy_to_specify_postfix_op) 1347 { _outp++; VDUI_ONLY(verify(_node, true)); } 1348 1349 void operator--() 1350 { VDUI_ONLY(verify_resync()); --_outp; } 1351 1352 void operator-=(uint n) // applied to the limit only 1353 { _outp -= n; VDUI_ONLY(verify_relimit(n)); } 1354 1355 bool operator<(DUIterator_Fast& limit) { 1356 I_VDUI_ONLY(*this, this->verify(_node, true)); 1357 I_VDUI_ONLY(limit, limit.verify_limit()); 1358 return _outp < limit._outp; 1359 } 1360 1361 void operator=(const DUIterator_Fast& that) 1362 { _outp = that._outp; debug_only(reset(that)); } 1363 }; 1364 1365 DUIterator_Fast Node::fast_outs(DUIterator_Fast& imax) const { 1366 // Assign a limit pointer to the reference argument: 1367 imax = DUIterator_Fast(this, (ptrdiff_t)_outcnt); 1368 // Return the base pointer: 1369 return DUIterator_Fast(this, 0); 1370 } 1371 Node* Node::fast_out(DUIterator_Fast& i) const { 1372 I_VDUI_ONLY(i, i.verify(this)); 1373 return debug_only(i._last=) *i._outp; 1374 } 1375 1376 1377 // Faster DU iterator. Requires each successive edge to be removed. 1378 // Does not allow insertion of any edges. 1379 // Usage: 1380 // for (DUIterator_Last imin, i = x->last_outs(imin); i >= imin; i -= num_edges) { 1381 // Node* y = x->last_out(i); 1382 // ... 1383 // } 1384 // Compiles in product mode to raw Node** pointer arithmetic, with 1385 // no reloading of pointers from the original node x. 1386 class DUIterator_Last : private DUIterator_Fast { 1387 friend class Node; 1388 1389 #ifdef ASSERT 1390 void verify(const Node* node, bool at_end_ok = false); 1391 void verify_limit(); 1392 void verify_step(uint num_edges); 1393 #endif 1394 1395 // Note: offset must be signed, since -1 is sometimes passed 1396 DUIterator_Last(const Node* node, ptrdiff_t offset) 1397 : DUIterator_Fast(node, offset) { } 1398 1399 void operator++(int dummy_to_specify_postfix_op) {} // do not use 1400 void operator<(int) {} // do not use 1401 1402 public: 1403 DUIterator_Last() { } 1404 // initialize to garbage 1405 1406 void operator--() 1407 { _outp--; VDUI_ONLY(verify_step(1)); } 1408 1409 void operator-=(uint n) 1410 { _outp -= n; VDUI_ONLY(verify_step(n)); } 1411 1412 bool operator>=(DUIterator_Last& limit) { 1413 I_VDUI_ONLY(*this, this->verify(_node, true)); 1414 I_VDUI_ONLY(limit, limit.verify_limit()); 1415 return _outp >= limit._outp; 1416 } 1417 1418 void operator=(const DUIterator_Last& that) 1419 { DUIterator_Fast::operator=(that); } 1420 }; 1421 1422 DUIterator_Last Node::last_outs(DUIterator_Last& imin) const { 1423 // Assign a limit pointer to the reference argument: 1424 imin = DUIterator_Last(this, 0); 1425 // Return the initial pointer: 1426 return DUIterator_Last(this, (ptrdiff_t)_outcnt - 1); 1427 } 1428 Node* Node::last_out(DUIterator_Last& i) const { 1429 I_VDUI_ONLY(i, i.verify(this)); 1430 return debug_only(i._last=) *i._outp; 1431 } 1432 1433 #endif //OPTO_DU_ITERATOR_ASSERT 1434 1435 #undef I_VDUI_ONLY 1436 #undef VDUI_ONLY 1437 1438 // An Iterator that truly follows the iterator pattern. Doesn't 1439 // support deletion but could be made to. 1440 // 1441 // for (SimpleDUIterator i(n); i.has_next(); i.next()) { 1442 // Node* m = i.get(); 1443 // 1444 class SimpleDUIterator : public StackObj { 1445 private: 1446 Node* node; 1447 DUIterator_Fast i; 1448 DUIterator_Fast imax; 1449 public: 1450 SimpleDUIterator(Node* n): node(n), i(n->fast_outs(imax)) {} 1451 bool has_next() { return i < imax; } 1452 void next() { i++; } 1453 Node* get() { return node->fast_out(i); } 1454 }; 1455 1456 1457 //----------------------------------------------------------------------------- 1458 // Map dense integer indices to Nodes. Uses classic doubling-array trick. 1459 // Abstractly provides an infinite array of Node*'s, initialized to NULL. 1460 // Note that the constructor just zeros things, and since I use Arena 1461 // allocation I do not need a destructor to reclaim storage. 1462 class Node_Array : public ResourceObj { 1463 friend class VMStructs; 1464 protected: 1465 Arena *_a; // Arena to allocate in 1466 uint _max; 1467 Node **_nodes; 1468 void grow( uint i ); // Grow array node to fit 1469 public: 1470 Node_Array(Arena *a) : _a(a), _max(OptoNodeListSize) { 1471 _nodes = NEW_ARENA_ARRAY( a, Node *, OptoNodeListSize ); 1472 for( int i = 0; i < OptoNodeListSize; i++ ) { 1473 _nodes[i] = NULL; 1474 } 1475 } 1476 1477 Node_Array(Node_Array *na) : _a(na->_a), _max(na->_max), _nodes(na->_nodes) {} 1478 Node *operator[] ( uint i ) const // Lookup, or NULL for not mapped 1479 { return (i<_max) ? _nodes[i] : (Node*)NULL; } 1480 Node *at( uint i ) const { assert(i<_max,"oob"); return _nodes[i]; } 1481 Node **adr() { return _nodes; } 1482 // Extend the mapping: index i maps to Node *n. 1483 void map( uint i, Node *n ) { if( i>=_max ) grow(i); _nodes[i] = n; } 1484 void insert( uint i, Node *n ); 1485 void remove( uint i ); // Remove, preserving order 1486 void sort( C_sort_func_t func); 1487 void reset( Arena *new_a ); // Zap mapping to empty; reclaim storage 1488 void clear(); // Set all entries to NULL, keep storage 1489 uint Size() const { return _max; } 1490 void dump() const; 1491 }; 1492 1493 class Node_List : public Node_Array { 1494 friend class VMStructs; 1495 uint _cnt; 1496 public: 1497 Node_List() : Node_Array(Thread::current()->resource_area()), _cnt(0) {} 1498 Node_List(Arena *a) : Node_Array(a), _cnt(0) {} 1499 bool contains(const Node* n) const { 1500 for (uint e = 0; e < size(); e++) { 1501 if (at(e) == n) return true; 1502 } 1503 return false; 1504 } 1505 void insert( uint i, Node *n ) { Node_Array::insert(i,n); _cnt++; } 1506 void remove( uint i ) { Node_Array::remove(i); _cnt--; } 1507 void push( Node *b ) { map(_cnt++,b); } 1508 void yank( Node *n ); // Find and remove 1509 Node *pop() { return _nodes[--_cnt]; } 1510 Node *rpop() { Node *b = _nodes[0]; _nodes[0]=_nodes[--_cnt]; return b;} 1511 void clear() { _cnt = 0; Node_Array::clear(); } // retain storage 1512 uint size() const { return _cnt; } 1513 void dump() const; 1514 void dump_simple() const; 1515 }; 1516 1517 //------------------------------Unique_Node_List------------------------------- 1518 class Unique_Node_List : public Node_List { 1519 friend class VMStructs; 1520 VectorSet _in_worklist; 1521 uint _clock_index; // Index in list where to pop from next 1522 public: 1523 Unique_Node_List() : Node_List(), _in_worklist(Thread::current()->resource_area()), _clock_index(0) {} 1524 Unique_Node_List(Arena *a) : Node_List(a), _in_worklist(a), _clock_index(0) {} 1525 1526 void remove( Node *n ); 1527 bool member( Node *n ) { return _in_worklist.test(n->_idx) != 0; } 1528 VectorSet &member_set(){ return _in_worklist; } 1529 1530 void push( Node *b ) { 1531 if( !_in_worklist.test_set(b->_idx) ) 1532 Node_List::push(b); 1533 } 1534 Node *pop() { 1535 if( _clock_index >= size() ) _clock_index = 0; 1536 Node *b = at(_clock_index); 1537 map( _clock_index, Node_List::pop()); 1538 if (size() != 0) _clock_index++; // Always start from 0 1539 _in_worklist >>= b->_idx; 1540 return b; 1541 } 1542 Node *remove( uint i ) { 1543 Node *b = Node_List::at(i); 1544 _in_worklist >>= b->_idx; 1545 map(i,Node_List::pop()); 1546 return b; 1547 } 1548 void yank( Node *n ) { _in_worklist >>= n->_idx; Node_List::yank(n); } 1549 void clear() { 1550 _in_worklist.Clear(); // Discards storage but grows automatically 1551 Node_List::clear(); 1552 _clock_index = 0; 1553 } 1554 1555 // Used after parsing to remove useless nodes before Iterative GVN 1556 void remove_useless_nodes(VectorSet &useful); 1557 1558 #ifndef PRODUCT 1559 void print_set() const { _in_worklist.print(); } 1560 #endif 1561 }; 1562 1563 // Inline definition of Compile::record_for_igvn must be deferred to this point. 1564 inline void Compile::record_for_igvn(Node* n) { 1565 _for_igvn->push(n); 1566 } 1567 1568 //------------------------------Node_Stack------------------------------------- 1569 class Node_Stack { 1570 friend class VMStructs; 1571 protected: 1572 struct INode { 1573 Node *node; // Processed node 1574 uint indx; // Index of next node's child 1575 }; 1576 INode *_inode_top; // tos, stack grows up 1577 INode *_inode_max; // End of _inodes == _inodes + _max 1578 INode *_inodes; // Array storage for the stack 1579 Arena *_a; // Arena to allocate in 1580 void grow(); 1581 public: 1582 Node_Stack(int size) { 1583 size_t max = (size > OptoNodeListSize) ? size : OptoNodeListSize; 1584 _a = Thread::current()->resource_area(); 1585 _inodes = NEW_ARENA_ARRAY( _a, INode, max ); 1586 _inode_max = _inodes + max; 1587 _inode_top = _inodes - 1; // stack is empty 1588 } 1589 1590 Node_Stack(Arena *a, int size) : _a(a) { 1591 size_t max = (size > OptoNodeListSize) ? size : OptoNodeListSize; 1592 _inodes = NEW_ARENA_ARRAY( _a, INode, max ); 1593 _inode_max = _inodes + max; 1594 _inode_top = _inodes - 1; // stack is empty 1595 } 1596 1597 void pop() { 1598 assert(_inode_top >= _inodes, "node stack underflow"); 1599 --_inode_top; 1600 } 1601 void push(Node *n, uint i) { 1602 ++_inode_top; 1603 if (_inode_top >= _inode_max) grow(); 1604 INode *top = _inode_top; // optimization 1605 top->node = n; 1606 top->indx = i; 1607 } 1608 Node *node() const { 1609 return _inode_top->node; 1610 } 1611 Node* node_at(uint i) const { 1612 assert(_inodes + i <= _inode_top, "in range"); 1613 return _inodes[i].node; 1614 } 1615 uint index() const { 1616 return _inode_top->indx; 1617 } 1618 uint index_at(uint i) const { 1619 assert(_inodes + i <= _inode_top, "in range"); 1620 return _inodes[i].indx; 1621 } 1622 void set_node(Node *n) { 1623 _inode_top->node = n; 1624 } 1625 void set_index(uint i) { 1626 _inode_top->indx = i; 1627 } 1628 uint size_max() const { return (uint)pointer_delta(_inode_max, _inodes, sizeof(INode)); } // Max size 1629 uint size() const { return (uint)pointer_delta((_inode_top+1), _inodes, sizeof(INode)); } // Current size 1630 bool is_nonempty() const { return (_inode_top >= _inodes); } 1631 bool is_empty() const { return (_inode_top < _inodes); } 1632 void clear() { _inode_top = _inodes - 1; } // retain storage 1633 1634 // Node_Stack is used to map nodes. 1635 Node* find(uint idx) const; 1636 }; 1637 1638 1639 //-----------------------------Node_Notes-------------------------------------- 1640 // Debugging or profiling annotations loosely and sparsely associated 1641 // with some nodes. See Compile::node_notes_at for the accessor. 1642 class Node_Notes { 1643 friend class VMStructs; 1644 JVMState* _jvms; 1645 1646 public: 1647 Node_Notes(JVMState* jvms = NULL) { 1648 _jvms = jvms; 1649 } 1650 1651 JVMState* jvms() { return _jvms; } 1652 void set_jvms(JVMState* x) { _jvms = x; } 1653 1654 // True if there is nothing here. 1655 bool is_clear() { 1656 return (_jvms == NULL); 1657 } 1658 1659 // Make there be nothing here. 1660 void clear() { 1661 _jvms = NULL; 1662 } 1663 1664 // Make a new, clean node notes. 1665 static Node_Notes* make(Compile* C) { 1666 Node_Notes* nn = NEW_ARENA_ARRAY(C->comp_arena(), Node_Notes, 1); 1667 nn->clear(); 1668 return nn; 1669 } 1670 1671 Node_Notes* clone(Compile* C) { 1672 Node_Notes* nn = NEW_ARENA_ARRAY(C->comp_arena(), Node_Notes, 1); 1673 (*nn) = (*this); 1674 return nn; 1675 } 1676 1677 // Absorb any information from source. 1678 bool update_from(Node_Notes* source) { 1679 bool changed = false; 1680 if (source != NULL) { 1681 if (source->jvms() != NULL) { 1682 set_jvms(source->jvms()); 1683 changed = true; 1684 } 1685 } 1686 return changed; 1687 } 1688 }; 1689 1690 // Inlined accessors for Compile::node_nodes that require the preceding class: 1691 inline Node_Notes* 1692 Compile::locate_node_notes(GrowableArray<Node_Notes*>* arr, 1693 int idx, bool can_grow) { 1694 assert(idx >= 0, "oob"); 1695 int block_idx = (idx >> _log2_node_notes_block_size); 1696 int grow_by = (block_idx - (arr == NULL? 0: arr->length())); 1697 if (grow_by >= 0) { 1698 if (!can_grow) return NULL; 1699 grow_node_notes(arr, grow_by + 1); 1700 } 1701 if (arr == NULL) return NULL; 1702 // (Every element of arr is a sub-array of length _node_notes_block_size.) 1703 return arr->at(block_idx) + (idx & (_node_notes_block_size-1)); 1704 } 1705 1706 inline bool 1707 Compile::set_node_notes_at(int idx, Node_Notes* value) { 1708 if (value == NULL || value->is_clear()) 1709 return false; // nothing to write => write nothing 1710 Node_Notes* loc = locate_node_notes(_node_note_array, idx, true); 1711 assert(loc != NULL, ""); 1712 return loc->update_from(value); 1713 } 1714 1715 1716 //------------------------------TypeNode--------------------------------------- 1717 // Node with a Type constant. 1718 class TypeNode : public Node { 1719 protected: 1720 virtual uint hash() const; // Check the type 1721 virtual uint cmp( const Node &n ) const; 1722 virtual uint size_of() const; // Size is bigger 1723 const Type* const _type; 1724 public: 1725 void set_type(const Type* t) { 1726 assert(t != NULL, "sanity"); 1727 debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH); 1728 *(const Type**)&_type = t; // cast away const-ness 1729 // If this node is in the hash table, make sure it doesn't need a rehash. 1730 assert(check_hash == NO_HASH || check_hash == hash(), "type change must preserve hash code"); 1731 } 1732 const Type* type() const { assert(_type != NULL, "sanity"); return _type; }; 1733 TypeNode( const Type *t, uint required ) : Node(required), _type(t) { 1734 init_class_id(Class_Type); 1735 } 1736 virtual const Type* Value(PhaseGVN* phase) const; 1737 virtual const Type *bottom_type() const; 1738 virtual uint ideal_reg() const; 1739 #ifndef PRODUCT 1740 virtual void dump_spec(outputStream *st) const; 1741 virtual void dump_compact_spec(outputStream *st) const; 1742 #endif 1743 }; 1744 1745 #endif // SHARE_VM_OPTO_NODE_HPP