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