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