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