Mercurial > hg > truffle
annotate src/share/vm/opto/node.cpp @ 8048:8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
Summary: Add support for expensive nodes.
Reviewed-by: kvn
| author | roland |
|---|---|
| date | Tue, 12 Feb 2013 12:56:11 +0100 |
| parents | a7114d3d712e |
| children | 6931f425c517 |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
4778
diff
changeset
|
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
| 26 #include "libadt/vectset.hpp" | |
| 27 #include "memory/allocation.inline.hpp" | |
| 28 #include "opto/cfgnode.hpp" | |
| 29 #include "opto/connode.hpp" | |
| 30 #include "opto/machnode.hpp" | |
| 31 #include "opto/matcher.hpp" | |
| 32 #include "opto/node.hpp" | |
| 33 #include "opto/opcodes.hpp" | |
| 34 #include "opto/regmask.hpp" | |
| 35 #include "opto/type.hpp" | |
| 36 #include "utilities/copy.hpp" | |
| 0 | 37 |
| 38 class RegMask; | |
| 39 // #include "phase.hpp" | |
| 40 class PhaseTransform; | |
| 41 class PhaseGVN; | |
| 42 | |
| 43 // Arena we are currently building Nodes in | |
| 44 const uint Node::NotAMachineReg = 0xffff0000; | |
| 45 | |
| 46 #ifndef PRODUCT | |
| 47 extern int nodes_created; | |
| 48 #endif | |
| 49 | |
| 50 #ifdef ASSERT | |
| 51 | |
| 52 //-------------------------- construct_node------------------------------------ | |
| 53 // Set a breakpoint here to identify where a particular node index is built. | |
| 54 void Node::verify_construction() { | |
| 55 _debug_orig = NULL; | |
| 56 int old_debug_idx = Compile::debug_idx(); | |
| 57 int new_debug_idx = old_debug_idx+1; | |
| 58 if (new_debug_idx > 0) { | |
| 59 // Arrange that the lowest five decimal digits of _debug_idx | |
|
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
60 // will repeat those of _idx. In case this is somehow pathological, |
| 0 | 61 // we continue to assign negative numbers (!) consecutively. |
| 62 const int mod = 100000; | |
| 63 int bump = (int)(_idx - new_debug_idx) % mod; | |
| 64 if (bump < 0) bump += mod; | |
| 65 assert(bump >= 0 && bump < mod, ""); | |
| 66 new_debug_idx += bump; | |
| 67 } | |
| 68 Compile::set_debug_idx(new_debug_idx); | |
| 69 set_debug_idx( new_debug_idx ); | |
|
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
70 assert(Compile::current()->unique() < (UINT_MAX - 1), "Node limit exceeded UINT_MAX"); |
| 0 | 71 if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) { |
| 72 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx); | |
| 73 BREAKPOINT; | |
| 74 } | |
| 75 #if OPTO_DU_ITERATOR_ASSERT | |
| 76 _last_del = NULL; | |
| 77 _del_tick = 0; | |
| 78 #endif | |
| 79 _hash_lock = 0; | |
| 80 } | |
| 81 | |
| 82 | |
| 83 // #ifdef ASSERT ... | |
| 84 | |
| 85 #if OPTO_DU_ITERATOR_ASSERT | |
| 86 void DUIterator_Common::sample(const Node* node) { | |
| 87 _vdui = VerifyDUIterators; | |
| 88 _node = node; | |
| 89 _outcnt = node->_outcnt; | |
| 90 _del_tick = node->_del_tick; | |
| 91 _last = NULL; | |
| 92 } | |
| 93 | |
| 94 void DUIterator_Common::verify(const Node* node, bool at_end_ok) { | |
| 95 assert(_node == node, "consistent iterator source"); | |
| 96 assert(_del_tick == node->_del_tick, "no unexpected deletions allowed"); | |
| 97 } | |
| 98 | |
| 99 void DUIterator_Common::verify_resync() { | |
| 100 // Ensure that the loop body has just deleted the last guy produced. | |
| 101 const Node* node = _node; | |
| 102 // Ensure that at least one copy of the last-seen edge was deleted. | |
| 103 // Note: It is OK to delete multiple copies of the last-seen edge. | |
| 104 // Unfortunately, we have no way to verify that all the deletions delete | |
| 105 // that same edge. On this point we must use the Honor System. | |
| 106 assert(node->_del_tick >= _del_tick+1, "must have deleted an edge"); | |
| 107 assert(node->_last_del == _last, "must have deleted the edge just produced"); | |
| 108 // We liked this deletion, so accept the resulting outcnt and tick. | |
| 109 _outcnt = node->_outcnt; | |
| 110 _del_tick = node->_del_tick; | |
| 111 } | |
| 112 | |
| 113 void DUIterator_Common::reset(const DUIterator_Common& that) { | |
| 114 if (this == &that) return; // ignore assignment to self | |
| 115 if (!_vdui) { | |
| 116 // We need to initialize everything, overwriting garbage values. | |
| 117 _last = that._last; | |
| 118 _vdui = that._vdui; | |
| 119 } | |
| 120 // Note: It is legal (though odd) for an iterator over some node x | |
| 121 // to be reassigned to iterate over another node y. Some doubly-nested | |
| 122 // progress loops depend on being able to do this. | |
| 123 const Node* node = that._node; | |
| 124 // Re-initialize everything, except _last. | |
| 125 _node = node; | |
| 126 _outcnt = node->_outcnt; | |
| 127 _del_tick = node->_del_tick; | |
| 128 } | |
| 129 | |
| 130 void DUIterator::sample(const Node* node) { | |
| 131 DUIterator_Common::sample(node); // Initialize the assertion data. | |
| 132 _refresh_tick = 0; // No refreshes have happened, as yet. | |
| 133 } | |
| 134 | |
| 135 void DUIterator::verify(const Node* node, bool at_end_ok) { | |
| 136 DUIterator_Common::verify(node, at_end_ok); | |
| 137 assert(_idx < node->_outcnt + (uint)at_end_ok, "idx in range"); | |
| 138 } | |
| 139 | |
| 140 void DUIterator::verify_increment() { | |
| 141 if (_refresh_tick & 1) { | |
| 142 // We have refreshed the index during this loop. | |
| 143 // Fix up _idx to meet asserts. | |
| 144 if (_idx > _outcnt) _idx = _outcnt; | |
| 145 } | |
| 146 verify(_node, true); | |
| 147 } | |
| 148 | |
| 149 void DUIterator::verify_resync() { | |
| 150 // Note: We do not assert on _outcnt, because insertions are OK here. | |
| 151 DUIterator_Common::verify_resync(); | |
| 152 // Make sure we are still in sync, possibly with no more out-edges: | |
| 153 verify(_node, true); | |
| 154 } | |
| 155 | |
| 156 void DUIterator::reset(const DUIterator& that) { | |
| 157 if (this == &that) return; // self assignment is always a no-op | |
| 158 assert(that._refresh_tick == 0, "assign only the result of Node::outs()"); | |
| 159 assert(that._idx == 0, "assign only the result of Node::outs()"); | |
| 160 assert(_idx == that._idx, "already assigned _idx"); | |
| 161 if (!_vdui) { | |
| 162 // We need to initialize everything, overwriting garbage values. | |
| 163 sample(that._node); | |
| 164 } else { | |
| 165 DUIterator_Common::reset(that); | |
| 166 if (_refresh_tick & 1) { | |
| 167 _refresh_tick++; // Clear the "was refreshed" flag. | |
| 168 } | |
| 169 assert(_refresh_tick < 2*100000, "DU iteration must converge quickly"); | |
| 170 } | |
| 171 } | |
| 172 | |
| 173 void DUIterator::refresh() { | |
| 174 DUIterator_Common::sample(_node); // Re-fetch assertion data. | |
| 175 _refresh_tick |= 1; // Set the "was refreshed" flag. | |
| 176 } | |
| 177 | |
| 178 void DUIterator::verify_finish() { | |
| 179 // If the loop has killed the node, do not require it to re-run. | |
| 180 if (_node->_outcnt == 0) _refresh_tick &= ~1; | |
| 181 // If this assert triggers, it means that a loop used refresh_out_pos | |
| 182 // to re-synch an iteration index, but the loop did not correctly | |
| 183 // re-run itself, using a "while (progress)" construct. | |
| 184 // This iterator enforces the rule that you must keep trying the loop | |
| 185 // until it "runs clean" without any need for refreshing. | |
| 186 assert(!(_refresh_tick & 1), "the loop must run once with no refreshing"); | |
| 187 } | |
| 188 | |
| 189 | |
| 190 void DUIterator_Fast::verify(const Node* node, bool at_end_ok) { | |
| 191 DUIterator_Common::verify(node, at_end_ok); | |
| 192 Node** out = node->_out; | |
| 193 uint cnt = node->_outcnt; | |
| 194 assert(cnt == _outcnt, "no insertions allowed"); | |
| 195 assert(_outp >= out && _outp <= out + cnt - !at_end_ok, "outp in range"); | |
| 196 // This last check is carefully designed to work for NO_OUT_ARRAY. | |
| 197 } | |
| 198 | |
| 199 void DUIterator_Fast::verify_limit() { | |
| 200 const Node* node = _node; | |
| 201 verify(node, true); | |
| 202 assert(_outp == node->_out + node->_outcnt, "limit still correct"); | |
| 203 } | |
| 204 | |
| 205 void DUIterator_Fast::verify_resync() { | |
| 206 const Node* node = _node; | |
| 207 if (_outp == node->_out + _outcnt) { | |
| 208 // Note that the limit imax, not the pointer i, gets updated with the | |
| 209 // exact count of deletions. (For the pointer it's always "--i".) | |
| 210 assert(node->_outcnt+node->_del_tick == _outcnt+_del_tick, "no insertions allowed with deletion(s)"); | |
| 211 // This is a limit pointer, with a name like "imax". | |
| 212 // Fudge the _last field so that the common assert will be happy. | |
| 213 _last = (Node*) node->_last_del; | |
| 214 DUIterator_Common::verify_resync(); | |
| 215 } else { | |
| 216 assert(node->_outcnt < _outcnt, "no insertions allowed with deletion(s)"); | |
| 217 // A normal internal pointer. | |
| 218 DUIterator_Common::verify_resync(); | |
| 219 // Make sure we are still in sync, possibly with no more out-edges: | |
| 220 verify(node, true); | |
| 221 } | |
| 222 } | |
| 223 | |
| 224 void DUIterator_Fast::verify_relimit(uint n) { | |
| 225 const Node* node = _node; | |
| 226 assert((int)n > 0, "use imax -= n only with a positive count"); | |
| 227 // This must be a limit pointer, with a name like "imax". | |
| 228 assert(_outp == node->_out + node->_outcnt, "apply -= only to a limit (imax)"); | |
| 229 // The reported number of deletions must match what the node saw. | |
| 230 assert(node->_del_tick == _del_tick + n, "must have deleted n edges"); | |
| 231 // Fudge the _last field so that the common assert will be happy. | |
| 232 _last = (Node*) node->_last_del; | |
| 233 DUIterator_Common::verify_resync(); | |
| 234 } | |
| 235 | |
| 236 void DUIterator_Fast::reset(const DUIterator_Fast& that) { | |
| 237 assert(_outp == that._outp, "already assigned _outp"); | |
| 238 DUIterator_Common::reset(that); | |
| 239 } | |
| 240 | |
| 241 void DUIterator_Last::verify(const Node* node, bool at_end_ok) { | |
| 242 // at_end_ok means the _outp is allowed to underflow by 1 | |
| 243 _outp += at_end_ok; | |
| 244 DUIterator_Fast::verify(node, at_end_ok); // check _del_tick, etc. | |
| 245 _outp -= at_end_ok; | |
| 246 assert(_outp == (node->_out + node->_outcnt) - 1, "pointer must point to end of nodes"); | |
| 247 } | |
| 248 | |
| 249 void DUIterator_Last::verify_limit() { | |
| 250 // Do not require the limit address to be resynched. | |
| 251 //verify(node, true); | |
| 252 assert(_outp == _node->_out, "limit still correct"); | |
| 253 } | |
| 254 | |
| 255 void DUIterator_Last::verify_step(uint num_edges) { | |
| 256 assert((int)num_edges > 0, "need non-zero edge count for loop progress"); | |
| 257 _outcnt -= num_edges; | |
| 258 _del_tick += num_edges; | |
| 259 // Make sure we are still in sync, possibly with no more out-edges: | |
| 260 const Node* node = _node; | |
| 261 verify(node, true); | |
| 262 assert(node->_last_del == _last, "must have deleted the edge just produced"); | |
| 263 } | |
| 264 | |
| 265 #endif //OPTO_DU_ITERATOR_ASSERT | |
| 266 | |
| 267 | |
| 268 #endif //ASSERT | |
| 269 | |
| 270 | |
| 271 // This constant used to initialize _out may be any non-null value. | |
| 272 // The value NULL is reserved for the top node only. | |
| 273 #define NO_OUT_ARRAY ((Node**)-1) | |
| 274 | |
| 275 // This funny expression handshakes with Node::operator new | |
| 276 // to pull Compile::current out of the new node's _out field, | |
| 277 // and then calls a subroutine which manages most field | |
| 278 // initializations. The only one which is tricky is the | |
| 279 // _idx field, which is const, and so must be initialized | |
| 280 // by a return value, not an assignment. | |
| 281 // | |
| 282 // (Aren't you thankful that Java finals don't require so many tricks?) | |
| 283 #define IDX_INIT(req) this->Init((req), (Compile*) this->_out) | |
| 284 #ifdef _MSC_VER // the IDX_INIT hack falls foul of warning C4355 | |
| 285 #pragma warning( disable:4355 ) // 'this' : used in base member initializer list | |
| 286 #endif | |
| 287 | |
| 288 // Out-of-line code from node constructors. | |
| 289 // Executed only when extra debug info. is being passed around. | |
| 290 static void init_node_notes(Compile* C, int idx, Node_Notes* nn) { | |
| 291 C->set_node_notes_at(idx, nn); | |
| 292 } | |
| 293 | |
| 294 // Shared initialization code. | |
| 295 inline int Node::Init(int req, Compile* C) { | |
| 296 assert(Compile::current() == C, "must use operator new(Compile*)"); | |
| 297 int idx = C->next_unique(); | |
| 298 | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
299 // Allocate memory for the necessary number of edges. |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
300 if (req > 0) { |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
301 // Allocate space for _in array to have double alignment. |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
302 _in = (Node **) ((char *) (C->node_arena()->Amalloc_D(req * sizeof(void*)))); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
303 #ifdef ASSERT |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
304 _in[req-1] = this; // magic cookie for assertion check |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
305 #endif |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
306 } |
| 0 | 307 // If there are default notes floating around, capture them: |
| 308 Node_Notes* nn = C->default_node_notes(); | |
| 309 if (nn != NULL) init_node_notes(C, idx, nn); | |
| 310 | |
| 311 // Note: At this point, C is dead, | |
| 312 // and we begin to initialize the new Node. | |
| 313 | |
| 314 _cnt = _max = req; | |
| 315 _outcnt = _outmax = 0; | |
| 316 _class_id = Class_Node; | |
| 317 _flags = 0; | |
| 318 _out = NO_OUT_ARRAY; | |
| 319 return idx; | |
| 320 } | |
| 321 | |
| 322 //------------------------------Node------------------------------------------- | |
| 323 // Create a Node, with a given number of required edges. | |
| 324 Node::Node(uint req) | |
| 325 : _idx(IDX_INIT(req)) | |
| 326 { | |
| 327 assert( req < (uint)(MaxNodeLimit - NodeLimitFudgeFactor), "Input limit exceeded" ); | |
| 328 debug_only( verify_construction() ); | |
| 329 NOT_PRODUCT(nodes_created++); | |
| 330 if (req == 0) { | |
| 331 assert( _in == (Node**)this, "Must not pass arg count to 'new'" ); | |
| 332 _in = NULL; | |
| 333 } else { | |
| 334 assert( _in[req-1] == this, "Must pass arg count to 'new'" ); | |
| 335 Node** to = _in; | |
| 336 for(uint i = 0; i < req; i++) { | |
| 337 to[i] = NULL; | |
| 338 } | |
| 339 } | |
| 340 } | |
| 341 | |
| 342 //------------------------------Node------------------------------------------- | |
| 343 Node::Node(Node *n0) | |
| 344 : _idx(IDX_INIT(1)) | |
| 345 { | |
| 346 debug_only( verify_construction() ); | |
| 347 NOT_PRODUCT(nodes_created++); | |
| 348 // Assert we allocated space for input array already | |
| 349 assert( _in[0] == this, "Must pass arg count to 'new'" ); | |
| 350 assert( is_not_dead(n0), "can not use dead node"); | |
| 351 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 352 } | |
| 353 | |
| 354 //------------------------------Node------------------------------------------- | |
| 355 Node::Node(Node *n0, Node *n1) | |
| 356 : _idx(IDX_INIT(2)) | |
| 357 { | |
| 358 debug_only( verify_construction() ); | |
| 359 NOT_PRODUCT(nodes_created++); | |
| 360 // Assert we allocated space for input array already | |
| 361 assert( _in[1] == this, "Must pass arg count to 'new'" ); | |
| 362 assert( is_not_dead(n0), "can not use dead node"); | |
| 363 assert( is_not_dead(n1), "can not use dead node"); | |
| 364 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 365 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 366 } | |
| 367 | |
| 368 //------------------------------Node------------------------------------------- | |
| 369 Node::Node(Node *n0, Node *n1, Node *n2) | |
| 370 : _idx(IDX_INIT(3)) | |
| 371 { | |
| 372 debug_only( verify_construction() ); | |
| 373 NOT_PRODUCT(nodes_created++); | |
| 374 // Assert we allocated space for input array already | |
| 375 assert( _in[2] == this, "Must pass arg count to 'new'" ); | |
| 376 assert( is_not_dead(n0), "can not use dead node"); | |
| 377 assert( is_not_dead(n1), "can not use dead node"); | |
| 378 assert( is_not_dead(n2), "can not use dead node"); | |
| 379 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 380 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 381 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); | |
| 382 } | |
| 383 | |
| 384 //------------------------------Node------------------------------------------- | |
| 385 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3) | |
| 386 : _idx(IDX_INIT(4)) | |
| 387 { | |
| 388 debug_only( verify_construction() ); | |
| 389 NOT_PRODUCT(nodes_created++); | |
| 390 // Assert we allocated space for input array already | |
| 391 assert( _in[3] == this, "Must pass arg count to 'new'" ); | |
| 392 assert( is_not_dead(n0), "can not use dead node"); | |
| 393 assert( is_not_dead(n1), "can not use dead node"); | |
| 394 assert( is_not_dead(n2), "can not use dead node"); | |
| 395 assert( is_not_dead(n3), "can not use dead node"); | |
| 396 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 397 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 398 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); | |
| 399 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); | |
| 400 } | |
| 401 | |
| 402 //------------------------------Node------------------------------------------- | |
| 403 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4) | |
| 404 : _idx(IDX_INIT(5)) | |
| 405 { | |
| 406 debug_only( verify_construction() ); | |
| 407 NOT_PRODUCT(nodes_created++); | |
| 408 // Assert we allocated space for input array already | |
| 409 assert( _in[4] == this, "Must pass arg count to 'new'" ); | |
| 410 assert( is_not_dead(n0), "can not use dead node"); | |
| 411 assert( is_not_dead(n1), "can not use dead node"); | |
| 412 assert( is_not_dead(n2), "can not use dead node"); | |
| 413 assert( is_not_dead(n3), "can not use dead node"); | |
| 414 assert( is_not_dead(n4), "can not use dead node"); | |
| 415 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 416 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 417 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); | |
| 418 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); | |
| 419 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); | |
| 420 } | |
| 421 | |
| 422 //------------------------------Node------------------------------------------- | |
| 423 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, | |
| 424 Node *n4, Node *n5) | |
| 425 : _idx(IDX_INIT(6)) | |
| 426 { | |
| 427 debug_only( verify_construction() ); | |
| 428 NOT_PRODUCT(nodes_created++); | |
| 429 // Assert we allocated space for input array already | |
| 430 assert( _in[5] == this, "Must pass arg count to 'new'" ); | |
| 431 assert( is_not_dead(n0), "can not use dead node"); | |
| 432 assert( is_not_dead(n1), "can not use dead node"); | |
| 433 assert( is_not_dead(n2), "can not use dead node"); | |
| 434 assert( is_not_dead(n3), "can not use dead node"); | |
| 435 assert( is_not_dead(n4), "can not use dead node"); | |
| 436 assert( is_not_dead(n5), "can not use dead node"); | |
| 437 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 438 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 439 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); | |
| 440 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); | |
| 441 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); | |
| 442 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this); | |
| 443 } | |
| 444 | |
| 445 //------------------------------Node------------------------------------------- | |
| 446 Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, | |
| 447 Node *n4, Node *n5, Node *n6) | |
| 448 : _idx(IDX_INIT(7)) | |
| 449 { | |
| 450 debug_only( verify_construction() ); | |
| 451 NOT_PRODUCT(nodes_created++); | |
| 452 // Assert we allocated space for input array already | |
| 453 assert( _in[6] == this, "Must pass arg count to 'new'" ); | |
| 454 assert( is_not_dead(n0), "can not use dead node"); | |
| 455 assert( is_not_dead(n1), "can not use dead node"); | |
| 456 assert( is_not_dead(n2), "can not use dead node"); | |
| 457 assert( is_not_dead(n3), "can not use dead node"); | |
| 458 assert( is_not_dead(n4), "can not use dead node"); | |
| 459 assert( is_not_dead(n5), "can not use dead node"); | |
| 460 assert( is_not_dead(n6), "can not use dead node"); | |
| 461 _in[0] = n0; if (n0 != NULL) n0->add_out((Node *)this); | |
| 462 _in[1] = n1; if (n1 != NULL) n1->add_out((Node *)this); | |
| 463 _in[2] = n2; if (n2 != NULL) n2->add_out((Node *)this); | |
| 464 _in[3] = n3; if (n3 != NULL) n3->add_out((Node *)this); | |
| 465 _in[4] = n4; if (n4 != NULL) n4->add_out((Node *)this); | |
| 466 _in[5] = n5; if (n5 != NULL) n5->add_out((Node *)this); | |
| 467 _in[6] = n6; if (n6 != NULL) n6->add_out((Node *)this); | |
| 468 } | |
| 469 | |
| 470 | |
| 471 //------------------------------clone------------------------------------------ | |
| 472 // Clone a Node. | |
| 473 Node *Node::clone() const { | |
| 474 Compile *compile = Compile::current(); | |
| 475 uint s = size_of(); // Size of inherited Node | |
| 476 Node *n = (Node*)compile->node_arena()->Amalloc_D(size_of() + _max*sizeof(Node*)); | |
| 477 Copy::conjoint_words_to_lower((HeapWord*)this, (HeapWord*)n, s); | |
| 478 // Set the new input pointer array | |
| 479 n->_in = (Node**)(((char*)n)+s); | |
| 480 // Cannot share the old output pointer array, so kill it | |
| 481 n->_out = NO_OUT_ARRAY; | |
| 482 // And reset the counters to 0 | |
| 483 n->_outcnt = 0; | |
| 484 n->_outmax = 0; | |
| 485 // Unlock this guy, since he is not in any hash table. | |
| 486 debug_only(n->_hash_lock = 0); | |
| 487 // Walk the old node's input list to duplicate its edges | |
| 488 uint i; | |
| 489 for( i = 0; i < len(); i++ ) { | |
| 490 Node *x = in(i); | |
| 491 n->_in[i] = x; | |
| 492 if (x != NULL) x->add_out(n); | |
| 493 } | |
| 494 if (is_macro()) | |
| 495 compile->add_macro_node(n); | |
|
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
496 if (is_expensive()) |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
497 compile->add_expensive_node(n); |
| 0 | 498 |
| 499 n->set_idx(compile->next_unique()); // Get new unique index as well | |
| 500 debug_only( n->verify_construction() ); | |
| 501 NOT_PRODUCT(nodes_created++); | |
| 502 // Do not patch over the debug_idx of a clone, because it makes it | |
| 503 // impossible to break on the clone's moment of creation. | |
| 504 //debug_only( n->set_debug_idx( debug_idx() ) ); | |
| 505 | |
| 506 compile->copy_node_notes_to(n, (Node*) this); | |
| 507 | |
| 508 // MachNode clone | |
| 509 uint nopnds; | |
| 510 if (this->is_Mach() && (nopnds = this->as_Mach()->num_opnds()) > 0) { | |
| 511 MachNode *mach = n->as_Mach(); | |
| 512 MachNode *mthis = this->as_Mach(); | |
| 513 // Get address of _opnd_array. | |
| 514 // It should be the same offset since it is the clone of this node. | |
| 515 MachOper **from = mthis->_opnds; | |
| 516 MachOper **to = (MachOper **)((size_t)(&mach->_opnds) + | |
| 517 pointer_delta((const void*)from, | |
| 518 (const void*)(&mthis->_opnds), 1)); | |
| 519 mach->_opnds = to; | |
| 520 for ( uint i = 0; i < nopnds; ++i ) { | |
| 521 to[i] = from[i]->clone(compile); | |
| 522 } | |
| 523 } | |
| 524 // cloning CallNode may need to clone JVMState | |
| 525 if (n->is_Call()) { | |
| 526 CallNode *call = n->as_Call(); | |
| 527 call->clone_jvms(); | |
| 528 } | |
| 529 return n; // Return the clone | |
| 530 } | |
| 531 | |
| 532 //---------------------------setup_is_top-------------------------------------- | |
| 533 // Call this when changing the top node, to reassert the invariants | |
| 534 // required by Node::is_top. See Compile::set_cached_top_node. | |
| 535 void Node::setup_is_top() { | |
| 536 if (this == (Node*)Compile::current()->top()) { | |
| 537 // This node has just become top. Kill its out array. | |
| 538 _outcnt = _outmax = 0; | |
| 539 _out = NULL; // marker value for top | |
| 540 assert(is_top(), "must be top"); | |
| 541 } else { | |
| 542 if (_out == NULL) _out = NO_OUT_ARRAY; | |
| 543 assert(!is_top(), "must not be top"); | |
| 544 } | |
| 545 } | |
| 546 | |
| 547 | |
| 548 //------------------------------~Node------------------------------------------ | |
| 549 // Fancy destructor; eagerly attempt to reclaim Node numberings and storage | |
| 550 extern int reclaim_idx ; | |
| 551 extern int reclaim_in ; | |
| 552 extern int reclaim_node; | |
| 553 void Node::destruct() { | |
| 554 // Eagerly reclaim unique Node numberings | |
| 555 Compile* compile = Compile::current(); | |
| 556 if ((uint)_idx+1 == compile->unique()) { | |
| 557 compile->set_unique(compile->unique()-1); | |
| 558 #ifdef ASSERT | |
| 559 reclaim_idx++; | |
| 560 #endif | |
| 561 } | |
| 562 // Clear debug info: | |
| 563 Node_Notes* nn = compile->node_notes_at(_idx); | |
| 564 if (nn != NULL) nn->clear(); | |
| 565 // Walk the input array, freeing the corresponding output edges | |
| 566 _cnt = _max; // forget req/prec distinction | |
| 567 uint i; | |
| 568 for( i = 0; i < _max; i++ ) { | |
| 569 set_req(i, NULL); | |
| 570 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim"); | |
| 571 } | |
| 572 assert(outcnt() == 0, "deleting a node must not leave a dangling use"); | |
| 573 // See if the input array was allocated just prior to the object | |
| 574 int edge_size = _max*sizeof(void*); | |
| 575 int out_edge_size = _outmax*sizeof(void*); | |
| 576 char *edge_end = ((char*)_in) + edge_size; | |
| 577 char *out_array = (char*)(_out == NO_OUT_ARRAY? NULL: _out); | |
| 578 char *out_edge_end = out_array + out_edge_size; | |
| 579 int node_size = size_of(); | |
| 580 | |
| 581 // Free the output edge array | |
| 582 if (out_edge_size > 0) { | |
| 583 #ifdef ASSERT | |
| 584 if( out_edge_end == compile->node_arena()->hwm() ) | |
| 585 reclaim_in += out_edge_size; // count reclaimed out edges with in edges | |
| 586 #endif | |
| 587 compile->node_arena()->Afree(out_array, out_edge_size); | |
| 588 } | |
| 589 | |
| 590 // Free the input edge array and the node itself | |
| 591 if( edge_end == (char*)this ) { | |
| 592 #ifdef ASSERT | |
| 593 if( edge_end+node_size == compile->node_arena()->hwm() ) { | |
| 594 reclaim_in += edge_size; | |
| 595 reclaim_node+= node_size; | |
| 596 } | |
| 597 #else | |
| 598 // It was; free the input array and object all in one hit | |
| 599 compile->node_arena()->Afree(_in,edge_size+node_size); | |
| 600 #endif | |
| 601 } else { | |
| 602 | |
| 603 // Free just the input array | |
| 604 #ifdef ASSERT | |
| 605 if( edge_end == compile->node_arena()->hwm() ) | |
| 606 reclaim_in += edge_size; | |
| 607 #endif | |
| 608 compile->node_arena()->Afree(_in,edge_size); | |
| 609 | |
| 610 // Free just the object | |
| 611 #ifdef ASSERT | |
| 612 if( ((char*)this) + node_size == compile->node_arena()->hwm() ) | |
| 613 reclaim_node+= node_size; | |
| 614 #else | |
| 615 compile->node_arena()->Afree(this,node_size); | |
| 616 #endif | |
| 617 } | |
| 618 if (is_macro()) { | |
| 619 compile->remove_macro_node(this); | |
| 620 } | |
|
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
621 if (is_expensive()) { |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
622 compile->remove_expensive_node(this); |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
623 } |
| 0 | 624 #ifdef ASSERT |
| 625 // We will not actually delete the storage, but we'll make the node unusable. | |
| 626 *(address*)this = badAddress; // smash the C++ vtbl, probably | |
| 627 _in = _out = (Node**) badAddress; | |
| 628 _max = _cnt = _outmax = _outcnt = 0; | |
| 629 #endif | |
| 630 } | |
| 631 | |
| 632 //------------------------------grow------------------------------------------- | |
| 633 // Grow the input array, making space for more edges | |
| 634 void Node::grow( uint len ) { | |
| 635 Arena* arena = Compile::current()->node_arena(); | |
| 636 uint new_max = _max; | |
| 637 if( new_max == 0 ) { | |
| 638 _max = 4; | |
| 639 _in = (Node**)arena->Amalloc(4*sizeof(Node*)); | |
| 640 Node** to = _in; | |
| 641 to[0] = NULL; | |
| 642 to[1] = NULL; | |
| 643 to[2] = NULL; | |
| 644 to[3] = NULL; | |
| 645 return; | |
| 646 } | |
| 647 while( new_max <= len ) new_max <<= 1; // Find next power-of-2 | |
| 648 // Trimming to limit allows a uint8 to handle up to 255 edges. | |
| 649 // Previously I was using only powers-of-2 which peaked at 128 edges. | |
| 650 //if( new_max >= limit ) new_max = limit-1; | |
| 651 _in = (Node**)arena->Arealloc(_in, _max*sizeof(Node*), new_max*sizeof(Node*)); | |
| 652 Copy::zero_to_bytes(&_in[_max], (new_max-_max)*sizeof(Node*)); // NULL all new space | |
| 653 _max = new_max; // Record new max length | |
| 654 // This assertion makes sure that Node::_max is wide enough to | |
| 655 // represent the numerical value of new_max. | |
| 656 assert(_max == new_max && _max > len, "int width of _max is too small"); | |
| 657 } | |
| 658 | |
| 659 //-----------------------------out_grow---------------------------------------- | |
| 660 // Grow the input array, making space for more edges | |
| 661 void Node::out_grow( uint len ) { | |
| 662 assert(!is_top(), "cannot grow a top node's out array"); | |
| 663 Arena* arena = Compile::current()->node_arena(); | |
| 664 uint new_max = _outmax; | |
| 665 if( new_max == 0 ) { | |
| 666 _outmax = 4; | |
| 667 _out = (Node **)arena->Amalloc(4*sizeof(Node*)); | |
| 668 return; | |
| 669 } | |
| 670 while( new_max <= len ) new_max <<= 1; // Find next power-of-2 | |
| 671 // Trimming to limit allows a uint8 to handle up to 255 edges. | |
| 672 // Previously I was using only powers-of-2 which peaked at 128 edges. | |
| 673 //if( new_max >= limit ) new_max = limit-1; | |
| 674 assert(_out != NULL && _out != NO_OUT_ARRAY, "out must have sensible value"); | |
| 675 _out = (Node**)arena->Arealloc(_out,_outmax*sizeof(Node*),new_max*sizeof(Node*)); | |
| 676 //Copy::zero_to_bytes(&_out[_outmax], (new_max-_outmax)*sizeof(Node*)); // NULL all new space | |
| 677 _outmax = new_max; // Record new max length | |
| 678 // This assertion makes sure that Node::_max is wide enough to | |
| 679 // represent the numerical value of new_max. | |
| 680 assert(_outmax == new_max && _outmax > len, "int width of _outmax is too small"); | |
| 681 } | |
| 682 | |
| 683 #ifdef ASSERT | |
| 684 //------------------------------is_dead---------------------------------------- | |
| 685 bool Node::is_dead() const { | |
| 686 // Mach and pinch point nodes may look like dead. | |
| 687 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) ) | |
| 688 return false; | |
| 689 for( uint i = 0; i < _max; i++ ) | |
| 690 if( _in[i] != NULL ) | |
| 691 return false; | |
| 692 dump(); | |
| 693 return true; | |
| 694 } | |
| 695 #endif | |
| 696 | |
|
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
697 |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
698 //------------------------------is_unreachable--------------------------------- |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
699 bool Node::is_unreachable(PhaseIterGVN &igvn) const { |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
700 assert(!is_Mach(), "doesn't work with MachNodes"); |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
701 return outcnt() == 0 || igvn.type(this) == Type::TOP || in(0)->is_top(); |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
702 } |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
703 |
| 0 | 704 //------------------------------add_req---------------------------------------- |
| 705 // Add a new required input at the end | |
| 706 void Node::add_req( Node *n ) { | |
| 707 assert( is_not_dead(n), "can not use dead node"); | |
| 708 | |
| 709 // Look to see if I can move precedence down one without reallocating | |
| 710 if( (_cnt >= _max) || (in(_max-1) != NULL) ) | |
| 711 grow( _max+1 ); | |
| 712 | |
| 713 // Find a precedence edge to move | |
| 714 if( in(_cnt) != NULL ) { // Next precedence edge is busy? | |
| 715 uint i; | |
| 716 for( i=_cnt; i<_max; i++ ) | |
| 717 if( in(i) == NULL ) // Find the NULL at end of prec edge list | |
| 718 break; // There must be one, since we grew the array | |
| 719 _in[i] = in(_cnt); // Move prec over, making space for req edge | |
| 720 } | |
| 721 _in[_cnt++] = n; // Stuff over old prec edge | |
| 722 if (n != NULL) n->add_out((Node *)this); | |
| 723 } | |
| 724 | |
| 725 //---------------------------add_req_batch------------------------------------- | |
| 726 // Add a new required input at the end | |
| 727 void Node::add_req_batch( Node *n, uint m ) { | |
| 728 assert( is_not_dead(n), "can not use dead node"); | |
| 729 // check various edge cases | |
| 730 if ((int)m <= 1) { | |
| 731 assert((int)m >= 0, "oob"); | |
| 732 if (m != 0) add_req(n); | |
| 733 return; | |
| 734 } | |
| 735 | |
| 736 // Look to see if I can move precedence down one without reallocating | |
| 737 if( (_cnt+m) > _max || _in[_max-m] ) | |
| 738 grow( _max+m ); | |
| 739 | |
| 740 // Find a precedence edge to move | |
| 741 if( _in[_cnt] != NULL ) { // Next precedence edge is busy? | |
| 742 uint i; | |
| 743 for( i=_cnt; i<_max; i++ ) | |
| 744 if( _in[i] == NULL ) // Find the NULL at end of prec edge list | |
| 745 break; // There must be one, since we grew the array | |
| 746 // Slide all the precs over by m positions (assume #prec << m). | |
| 747 Copy::conjoint_words_to_higher((HeapWord*)&_in[_cnt], (HeapWord*)&_in[_cnt+m], ((i-_cnt)*sizeof(Node*))); | |
| 748 } | |
| 749 | |
| 750 // Stuff over the old prec edges | |
| 751 for(uint i=0; i<m; i++ ) { | |
| 752 _in[_cnt++] = n; | |
| 753 } | |
| 754 | |
| 755 // Insert multiple out edges on the node. | |
| 756 if (n != NULL && !n->is_top()) { | |
| 757 for(uint i=0; i<m; i++ ) { | |
| 758 n->add_out((Node *)this); | |
| 759 } | |
| 760 } | |
| 761 } | |
| 762 | |
| 763 //------------------------------del_req---------------------------------------- | |
| 764 // Delete the required edge and compact the edge array | |
| 765 void Node::del_req( uint idx ) { | |
|
2254
ab42c7e1cf83
7017746: Regression : C2 compiler crash due to SIGSEGV in PhaseCFG::schedule_early()
kvn
parents:
1972
diff
changeset
|
766 assert( idx < _cnt, "oob"); |
|
ab42c7e1cf83
7017746: Regression : C2 compiler crash due to SIGSEGV in PhaseCFG::schedule_early()
kvn
parents:
1972
diff
changeset
|
767 assert( !VerifyHashTableKeys || _hash_lock == 0, |
|
ab42c7e1cf83
7017746: Regression : C2 compiler crash due to SIGSEGV in PhaseCFG::schedule_early()
kvn
parents:
1972
diff
changeset
|
768 "remove node from hash table before modifying it"); |
| 0 | 769 // First remove corresponding def-use edge |
| 770 Node *n = in(idx); | |
| 771 if (n != NULL) n->del_out((Node *)this); | |
| 772 _in[idx] = in(--_cnt); // Compact the array | |
| 773 _in[_cnt] = NULL; // NULL out emptied slot | |
| 774 } | |
| 775 | |
| 776 //------------------------------ins_req---------------------------------------- | |
| 777 // Insert a new required input at the end | |
| 778 void Node::ins_req( uint idx, Node *n ) { | |
| 779 assert( is_not_dead(n), "can not use dead node"); | |
| 780 add_req(NULL); // Make space | |
| 781 assert( idx < _max, "Must have allocated enough space"); | |
| 782 // Slide over | |
| 783 if(_cnt-idx-1 > 0) { | |
| 784 Copy::conjoint_words_to_higher((HeapWord*)&_in[idx], (HeapWord*)&_in[idx+1], ((_cnt-idx-1)*sizeof(Node*))); | |
| 785 } | |
| 786 _in[idx] = n; // Stuff over old required edge | |
| 787 if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge | |
| 788 } | |
| 789 | |
| 790 //-----------------------------find_edge--------------------------------------- | |
| 791 int Node::find_edge(Node* n) { | |
| 792 for (uint i = 0; i < len(); i++) { | |
| 793 if (_in[i] == n) return i; | |
| 794 } | |
| 795 return -1; | |
| 796 } | |
| 797 | |
| 798 //----------------------------replace_edge------------------------------------- | |
| 799 int Node::replace_edge(Node* old, Node* neww) { | |
| 800 if (old == neww) return 0; // nothing to do | |
| 801 uint nrep = 0; | |
| 802 for (uint i = 0; i < len(); i++) { | |
| 803 if (in(i) == old) { | |
| 804 if (i < req()) | |
| 805 set_req(i, neww); | |
| 806 else | |
| 807 set_prec(i, neww); | |
| 808 nrep++; | |
| 809 } | |
| 810 } | |
| 811 return nrep; | |
| 812 } | |
| 813 | |
| 814 //-------------------------disconnect_inputs----------------------------------- | |
| 815 // NULL out all inputs to eliminate incoming Def-Use edges. | |
| 816 // Return the number of edges between 'n' and 'this' | |
|
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
817 int Node::disconnect_inputs(Node *n, Compile* C) { |
| 0 | 818 int edges_to_n = 0; |
| 819 | |
| 820 uint cnt = req(); | |
| 821 for( uint i = 0; i < cnt; ++i ) { | |
| 822 if( in(i) == 0 ) continue; | |
| 823 if( in(i) == n ) ++edges_to_n; | |
| 824 set_req(i, NULL); | |
| 825 } | |
| 826 // Remove precedence edges if any exist | |
| 827 // Note: Safepoints may have precedence edges, even during parsing | |
| 828 if( (req() != len()) && (in(req()) != NULL) ) { | |
| 829 uint max = len(); | |
| 830 for( uint i = 0; i < max; ++i ) { | |
| 831 if( in(i) == 0 ) continue; | |
| 832 if( in(i) == n ) ++edges_to_n; | |
| 833 set_prec(i, NULL); | |
| 834 } | |
| 835 } | |
| 836 | |
| 837 // Node::destruct requires all out edges be deleted first | |
| 838 // debug_only(destruct();) // no reuse benefit expected | |
|
7196
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
839 if (edges_to_n == 0) { |
|
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
840 C->record_dead_node(_idx); |
|
2aff40cb4703
7092905: C2: Keep track of the number of dead nodes
bharadwaj
parents:
6804
diff
changeset
|
841 } |
| 0 | 842 return edges_to_n; |
| 843 } | |
| 844 | |
| 845 //-----------------------------uncast--------------------------------------- | |
| 846 // %%% Temporary, until we sort out CheckCastPP vs. CastPP. | |
| 847 // Strip away casting. (It is depth-limited.) | |
| 848 Node* Node::uncast() const { | |
| 849 // Should be inline: | |
| 850 //return is_ConstraintCast() ? uncast_helper(this) : (Node*) this; | |
| 65 | 851 if (is_ConstraintCast() || is_CheckCastPP()) |
| 0 | 852 return uncast_helper(this); |
| 853 else | |
| 854 return (Node*) this; | |
| 855 } | |
| 856 | |
| 857 //---------------------------uncast_helper------------------------------------- | |
| 858 Node* Node::uncast_helper(const Node* p) { | |
| 4778 | 859 #ifdef ASSERT |
| 860 uint depth_count = 0; | |
| 861 const Node* orig_p = p; | |
| 862 #endif | |
| 863 | |
| 864 while (true) { | |
| 865 #ifdef ASSERT | |
| 866 if (depth_count >= K) { | |
| 867 orig_p->dump(4); | |
| 868 if (p != orig_p) | |
| 869 p->dump(1); | |
| 870 } | |
| 871 assert(depth_count++ < K, "infinite loop in Node::uncast_helper"); | |
| 872 #endif | |
| 0 | 873 if (p == NULL || p->req() != 2) { |
| 874 break; | |
| 875 } else if (p->is_ConstraintCast()) { | |
| 876 p = p->in(1); | |
| 65 | 877 } else if (p->is_CheckCastPP()) { |
| 0 | 878 p = p->in(1); |
| 879 } else { | |
| 880 break; | |
| 881 } | |
| 882 } | |
| 883 return (Node*) p; | |
| 884 } | |
| 885 | |
| 886 //------------------------------add_prec--------------------------------------- | |
| 887 // Add a new precedence input. Precedence inputs are unordered, with | |
| 888 // duplicates removed and NULLs packed down at the end. | |
| 889 void Node::add_prec( Node *n ) { | |
| 890 assert( is_not_dead(n), "can not use dead node"); | |
| 891 | |
| 892 // Check for NULL at end | |
| 893 if( _cnt >= _max || in(_max-1) ) | |
| 894 grow( _max+1 ); | |
| 895 | |
| 896 // Find a precedence edge to move | |
| 897 uint i = _cnt; | |
| 898 while( in(i) != NULL ) i++; | |
| 899 _in[i] = n; // Stuff prec edge over NULL | |
| 900 if ( n != NULL) n->add_out((Node *)this); // Add mirror edge | |
| 901 } | |
| 902 | |
| 903 //------------------------------rm_prec---------------------------------------- | |
| 904 // Remove a precedence input. Precedence inputs are unordered, with | |
| 905 // duplicates removed and NULLs packed down at the end. | |
| 906 void Node::rm_prec( uint j ) { | |
| 907 | |
| 908 // Find end of precedence list to pack NULLs | |
| 909 uint i; | |
| 910 for( i=j; i<_max; i++ ) | |
| 911 if( !_in[i] ) // Find the NULL at end of prec edge list | |
| 912 break; | |
| 913 if (_in[j] != NULL) _in[j]->del_out((Node *)this); | |
| 914 _in[j] = _in[--i]; // Move last element over removed guy | |
| 915 _in[i] = NULL; // NULL out last element | |
| 916 } | |
| 917 | |
| 918 //------------------------------size_of---------------------------------------- | |
| 919 uint Node::size_of() const { return sizeof(*this); } | |
| 920 | |
| 921 //------------------------------ideal_reg-------------------------------------- | |
| 922 uint Node::ideal_reg() const { return 0; } | |
| 923 | |
| 924 //------------------------------jvms------------------------------------------- | |
| 925 JVMState* Node::jvms() const { return NULL; } | |
| 926 | |
| 927 #ifdef ASSERT | |
| 928 //------------------------------jvms------------------------------------------- | |
| 929 bool Node::verify_jvms(const JVMState* using_jvms) const { | |
| 930 for (JVMState* jvms = this->jvms(); jvms != NULL; jvms = jvms->caller()) { | |
| 931 if (jvms == using_jvms) return true; | |
| 932 } | |
| 933 return false; | |
| 934 } | |
| 935 | |
| 936 //------------------------------init_NodeProperty------------------------------ | |
| 937 void Node::init_NodeProperty() { | |
| 938 assert(_max_classes <= max_jushort, "too many NodeProperty classes"); | |
| 939 assert(_max_flags <= max_jushort, "too many NodeProperty flags"); | |
| 940 } | |
| 941 #endif | |
| 942 | |
| 943 //------------------------------format----------------------------------------- | |
| 944 // Print as assembly | |
| 945 void Node::format( PhaseRegAlloc *, outputStream *st ) const {} | |
| 946 //------------------------------emit------------------------------------------- | |
| 947 // Emit bytes starting at parameter 'ptr'. | |
| 948 void Node::emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {} | |
| 949 //------------------------------size------------------------------------------- | |
| 950 // Size of instruction in bytes | |
| 951 uint Node::size(PhaseRegAlloc *ra_) const { return 0; } | |
| 952 | |
| 953 //------------------------------CFG Construction------------------------------- | |
| 954 // Nodes that end basic blocks, e.g. IfTrue/IfFalse, JumpProjNode, Root, | |
| 955 // Goto and Return. | |
| 956 const Node *Node::is_block_proj() const { return 0; } | |
| 957 | |
| 958 // Minimum guaranteed type | |
| 959 const Type *Node::bottom_type() const { return Type::BOTTOM; } | |
| 960 | |
| 961 | |
| 962 //------------------------------raise_bottom_type------------------------------ | |
| 963 // Get the worst-case Type output for this Node. | |
| 964 void Node::raise_bottom_type(const Type* new_type) { | |
| 965 if (is_Type()) { | |
| 966 TypeNode *n = this->as_Type(); | |
| 967 if (VerifyAliases) { | |
| 968 assert(new_type->higher_equal(n->type()), "new type must refine old type"); | |
| 969 } | |
| 970 n->set_type(new_type); | |
| 971 } else if (is_Load()) { | |
| 972 LoadNode *n = this->as_Load(); | |
| 973 if (VerifyAliases) { | |
| 974 assert(new_type->higher_equal(n->type()), "new type must refine old type"); | |
| 975 } | |
| 976 n->set_type(new_type); | |
| 977 } | |
| 978 } | |
| 979 | |
| 980 //------------------------------Identity--------------------------------------- | |
| 981 // Return a node that the given node is equivalent to. | |
| 982 Node *Node::Identity( PhaseTransform * ) { | |
| 983 return this; // Default to no identities | |
| 984 } | |
| 985 | |
| 986 //------------------------------Value------------------------------------------ | |
| 987 // Compute a new Type for a node using the Type of the inputs. | |
| 988 const Type *Node::Value( PhaseTransform * ) const { | |
| 989 return bottom_type(); // Default to worst-case Type | |
| 990 } | |
| 991 | |
| 992 //------------------------------Ideal------------------------------------------ | |
| 993 // | |
| 994 // 'Idealize' the graph rooted at this Node. | |
| 995 // | |
| 996 // In order to be efficient and flexible there are some subtle invariants | |
| 997 // these Ideal calls need to hold. Running with '+VerifyIterativeGVN' checks | |
| 998 // these invariants, although its too slow to have on by default. If you are | |
| 999 // hacking an Ideal call, be sure to test with +VerifyIterativeGVN! | |
| 1000 // | |
| 1001 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this' | |
| 1002 // pointer. If ANY change is made, it must return the root of the reshaped | |
| 1003 // graph - even if the root is the same Node. Example: swapping the inputs | |
| 1004 // to an AddINode gives the same answer and same root, but you still have to | |
| 1005 // return the 'this' pointer instead of NULL. | |
| 1006 // | |
| 1007 // You cannot return an OLD Node, except for the 'this' pointer. Use the | |
| 1008 // Identity call to return an old Node; basically if Identity can find | |
| 1009 // another Node have the Ideal call make no change and return NULL. | |
| 1010 // Example: AddINode::Ideal must check for add of zero; in this case it | |
| 1011 // returns NULL instead of doing any graph reshaping. | |
| 1012 // | |
| 1013 // You cannot modify any old Nodes except for the 'this' pointer. Due to | |
| 1014 // sharing there may be other users of the old Nodes relying on their current | |
| 1015 // semantics. Modifying them will break the other users. | |
| 1016 // Example: when reshape "(X+3)+4" into "X+7" you must leave the Node for | |
| 1017 // "X+3" unchanged in case it is shared. | |
| 1018 // | |
| 605 | 1019 // If you modify the 'this' pointer's inputs, you should use |
| 1020 // 'set_req'. If you are making a new Node (either as the new root or | |
| 1021 // some new internal piece) you may use 'init_req' to set the initial | |
| 1022 // value. You can make a new Node with either 'new' or 'clone'. In | |
| 1023 // either case, def-use info is correctly maintained. | |
| 1024 // | |
| 0 | 1025 // Example: reshape "(X+3)+4" into "X+7": |
| 605 | 1026 // set_req(1, in(1)->in(1)); |
| 1027 // set_req(2, phase->intcon(7)); | |
| 0 | 1028 // return this; |
| 605 | 1029 // Example: reshape "X*4" into "X<<2" |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1030 // return new (C) LShiftINode(in(1), phase->intcon(2)); |
| 0 | 1031 // |
| 1032 // You must call 'phase->transform(X)' on any new Nodes X you make, except | |
| 605 | 1033 // for the returned root node. Example: reshape "X*31" with "(X<<5)-X". |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1034 // Node *shift=phase->transform(new(C)LShiftINode(in(1),phase->intcon(5))); |
|
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1035 // return new (C) AddINode(shift, in(1)); |
| 0 | 1036 // |
| 1037 // When making a Node for a constant use 'phase->makecon' or 'phase->intcon'. | |
|
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
1038 // These forms are faster than 'phase->transform(new (C) ConNode())' and Do |
| 0 | 1039 // The Right Thing with def-use info. |
| 1040 // | |
| 1041 // You cannot bury the 'this' Node inside of a graph reshape. If the reshaped | |
| 1042 // graph uses the 'this' Node it must be the root. If you want a Node with | |
| 1043 // the same Opcode as the 'this' pointer use 'clone'. | |
| 1044 // | |
| 1045 Node *Node::Ideal(PhaseGVN *phase, bool can_reshape) { | |
| 1046 return NULL; // Default to being Ideal already | |
| 1047 } | |
| 1048 | |
| 1049 // Some nodes have specific Ideal subgraph transformations only if they are | |
| 1050 // unique users of specific nodes. Such nodes should be put on IGVN worklist | |
| 1051 // for the transformations to happen. | |
| 1052 bool Node::has_special_unique_user() const { | |
| 1053 assert(outcnt() == 1, "match only for unique out"); | |
| 1054 Node* n = unique_out(); | |
| 1055 int op = Opcode(); | |
| 1056 if( this->is_Store() ) { | |
| 1057 // Condition for back-to-back stores folding. | |
| 1058 return n->Opcode() == op && n->in(MemNode::Memory) == this; | |
| 1059 } else if( op == Op_AddL ) { | |
| 1060 // Condition for convL2I(addL(x,y)) ==> addI(convL2I(x),convL2I(y)) | |
| 1061 return n->Opcode() == Op_ConvL2I && n->in(1) == this; | |
| 1062 } else if( op == Op_SubI || op == Op_SubL ) { | |
| 1063 // Condition for subI(x,subI(y,z)) ==> subI(addI(x,z),y) | |
| 1064 return n->Opcode() == op && n->in(2) == this; | |
| 1065 } | |
| 1066 return false; | |
| 1067 }; | |
| 1068 | |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1069 //--------------------------find_exact_control--------------------------------- |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1070 // Skip Proj and CatchProj nodes chains. Check for Null and Top. |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1071 Node* Node::find_exact_control(Node* ctrl) { |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1072 if (ctrl == NULL && this->is_Region()) |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1073 ctrl = this->as_Region()->is_copy(); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1074 |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1075 if (ctrl != NULL && ctrl->is_CatchProj()) { |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1076 if (ctrl->as_CatchProj()->_con == CatchProjNode::fall_through_index) |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1077 ctrl = ctrl->in(0); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1078 if (ctrl != NULL && !ctrl->is_top()) |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1079 ctrl = ctrl->in(0); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1080 } |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1081 |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1082 if (ctrl != NULL && ctrl->is_Proj()) |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1083 ctrl = ctrl->in(0); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1084 |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1085 return ctrl; |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1086 } |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1087 |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1088 //--------------------------dominates------------------------------------------ |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1089 // Helper function for MemNode::all_controls_dominate(). |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1090 // Check if 'this' control node dominates or equal to 'sub' control node. |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1091 // We already know that if any path back to Root or Start reaches 'this', |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1092 // then all paths so, so this is a simple search for one example, |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1093 // not an exhaustive search for a counterexample. |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1094 bool Node::dominates(Node* sub, Node_List &nlist) { |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1095 assert(this->is_CFG(), "expecting control"); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1096 assert(sub != NULL && sub->is_CFG(), "expecting control"); |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1097 |
|
155
723be81c1212
6701887: JDK7 server VM in endless loop in Node::dominates
kvn
parents:
122
diff
changeset
|
1098 // detect dead cycle without regions |
|
723be81c1212
6701887: JDK7 server VM in endless loop in Node::dominates
kvn
parents:
122
diff
changeset
|
1099 int iterations_without_region_limit = DominatorSearchLimit; |
|
723be81c1212
6701887: JDK7 server VM in endless loop in Node::dominates
kvn
parents:
122
diff
changeset
|
1100 |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1101 Node* orig_sub = sub; |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1102 Node* dom = this; |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1103 bool met_dom = false; |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1104 nlist.clear(); |
| 163 | 1105 |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1106 // Walk 'sub' backward up the chain to 'dom', watching for regions. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1107 // After seeing 'dom', continue up to Root or Start. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1108 // If we hit a region (backward split point), it may be a loop head. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1109 // Keep going through one of the region's inputs. If we reach the |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1110 // same region again, go through a different input. Eventually we |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1111 // will either exit through the loop head, or give up. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1112 // (If we get confused, break out and return a conservative 'false'.) |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1113 while (sub != NULL) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1114 if (sub->is_top()) break; // Conservative answer for dead code. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1115 if (sub == dom) { |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1116 if (nlist.size() == 0) { |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1117 // No Region nodes except loops were visited before and the EntryControl |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1118 // path was taken for loops: it did not walk in a cycle. |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1119 return true; |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1120 } else if (met_dom) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1121 break; // already met before: walk in a cycle |
| 163 | 1122 } else { |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1123 // Region nodes were visited. Continue walk up to Start or Root |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1124 // to make sure that it did not walk in a cycle. |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1125 met_dom = true; // first time meet |
|
155
723be81c1212
6701887: JDK7 server VM in endless loop in Node::dominates
kvn
parents:
122
diff
changeset
|
1126 iterations_without_region_limit = DominatorSearchLimit; // Reset |
| 163 | 1127 } |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1128 } |
| 163 | 1129 if (sub->is_Start() || sub->is_Root()) { |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1130 // Success if we met 'dom' along a path to Start or Root. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1131 // We assume there are no alternative paths that avoid 'dom'. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1132 // (This assumption is up to the caller to ensure!) |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1133 return met_dom; |
| 163 | 1134 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1135 Node* up = sub->in(0); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1136 // Normalize simple pass-through regions and projections: |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1137 up = sub->find_exact_control(up); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1138 // If sub == up, we found a self-loop. Try to push past it. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1139 if (sub == up && sub->is_Loop()) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1140 // Take loop entry path on the way up to 'dom'. |
| 163 | 1141 up = sub->in(1); // in(LoopNode::EntryControl); |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1142 } else if (sub == up && sub->is_Region() && sub->req() != 3) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1143 // Always take in(1) path on the way up to 'dom' for clone regions |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1144 // (with only one input) or regions which merge > 2 paths |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1145 // (usually used to merge fast/slow paths). |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1146 up = sub->in(1); |
| 163 | 1147 } else if (sub == up && sub->is_Region()) { |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1148 // Try both paths for Regions with 2 input paths (it may be a loop head). |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1149 // It could give conservative 'false' answer without information |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1150 // which region's input is the entry path. |
| 163 | 1151 iterations_without_region_limit = DominatorSearchLimit; // Reset |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1152 |
| 163 | 1153 bool region_was_visited_before = false; |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1154 // Was this Region node visited before? |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1155 // If so, we have reached it because we accidentally took a |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1156 // loop-back edge from 'sub' back into the body of the loop, |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1157 // and worked our way up again to the loop header 'sub'. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1158 // So, take the first unexplored path on the way up to 'dom'. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1159 for (int j = nlist.size() - 1; j >= 0; j--) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1160 intptr_t ni = (intptr_t)nlist.at(j); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1161 Node* visited = (Node*)(ni & ~1); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1162 bool visited_twice_already = ((ni & 1) != 0); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1163 if (visited == sub) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1164 if (visited_twice_already) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1165 // Visited 2 paths, but still stuck in loop body. Give up. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1166 return false; |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1167 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1168 // The Region node was visited before only once. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1169 // (We will repush with the low bit set, below.) |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1170 nlist.remove(j); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1171 // We will find a new edge and re-insert. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1172 region_was_visited_before = true; |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1173 break; |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1174 } |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1175 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1176 |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1177 // Find an incoming edge which has not been seen yet; walk through it. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1178 assert(up == sub, ""); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1179 uint skip = region_was_visited_before ? 1 : 0; |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1180 for (uint i = 1; i < sub->req(); i++) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1181 Node* in = sub->in(i); |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1182 if (in != NULL && !in->is_top() && in != sub) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1183 if (skip == 0) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1184 up = in; |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1185 break; |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1186 } |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1187 --skip; // skip this nontrivial input |
| 163 | 1188 } |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1189 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1190 |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1191 // Set 0 bit to indicate that both paths were taken. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1192 nlist.push((Node*)((intptr_t)sub + (region_was_visited_before ? 1 : 0))); |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1193 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1194 |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1195 if (up == sub) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1196 break; // some kind of tight cycle |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1197 } |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1198 if (up == orig_sub && met_dom) { |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1199 // returned back after visiting 'dom' |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1200 break; // some kind of cycle |
| 163 | 1201 } |
| 1202 if (--iterations_without_region_limit < 0) { | |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1203 break; // dead cycle |
| 163 | 1204 } |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1205 sub = up; |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1206 } |
|
193
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1207 |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1208 // Did not meet Root or Start node in pred. chain. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1209 // Conservative answer for dead code. |
|
44a553b2809d
6714406: Node::dominates() does not always check for TOP
kvn
parents:
163
diff
changeset
|
1210 return false; |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1211 } |
|
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
65
diff
changeset
|
1212 |
| 0 | 1213 //------------------------------remove_dead_region----------------------------- |
| 1214 // This control node is dead. Follow the subgraph below it making everything | |
| 1215 // using it dead as well. This will happen normally via the usual IterGVN | |
| 1216 // worklist but this call is more efficient. Do not update use-def info | |
| 1217 // inside the dead region, just at the borders. | |
| 305 | 1218 static void kill_dead_code( Node *dead, PhaseIterGVN *igvn ) { |
| 0 | 1219 // Con's are a popular node to re-hit in the hash table again. |
| 305 | 1220 if( dead->is_Con() ) return; |
| 0 | 1221 |
| 1222 // Can't put ResourceMark here since igvn->_worklist uses the same arena | |
| 1223 // for verify pass with +VerifyOpto and we add/remove elements in it here. | |
| 1224 Node_List nstack(Thread::current()->resource_area()); | |
| 1225 | |
| 1226 Node *top = igvn->C->top(); | |
| 1227 nstack.push(dead); | |
| 1228 | |
| 1229 while (nstack.size() > 0) { | |
| 1230 dead = nstack.pop(); | |
| 1231 if (dead->outcnt() > 0) { | |
| 1232 // Keep dead node on stack until all uses are processed. | |
| 1233 nstack.push(dead); | |
| 1234 // For all Users of the Dead... ;-) | |
| 1235 for (DUIterator_Last kmin, k = dead->last_outs(kmin); k >= kmin; ) { | |
| 1236 Node* use = dead->last_out(k); | |
| 1237 igvn->hash_delete(use); // Yank from hash table prior to mod | |
| 1238 if (use->in(0) == dead) { // Found another dead node | |
|
1489
cff162798819
6888953: some calls to function-like macros are missing semicolons
jcoomes
parents:
605
diff
changeset
|
1239 assert (!use->is_Con(), "Control for Con node should be Root node."); |
| 0 | 1240 use->set_req(0, top); // Cut dead edge to prevent processing |
| 1241 nstack.push(use); // the dead node again. | |
| 1242 } else { // Else found a not-dead user | |
| 1243 for (uint j = 1; j < use->req(); j++) { | |
| 1244 if (use->in(j) == dead) { // Turn all dead inputs into TOP | |
| 1245 use->set_req(j, top); | |
| 1246 } | |
| 1247 } | |
| 1248 igvn->_worklist.push(use); | |
| 1249 } | |
| 1250 // Refresh the iterator, since any number of kills might have happened. | |
| 1251 k = dead->last_outs(kmin); | |
| 1252 } | |
| 1253 } else { // (dead->outcnt() == 0) | |
| 1254 // Done with outputs. | |
| 1255 igvn->hash_delete(dead); | |
| 1256 igvn->_worklist.remove(dead); | |
| 1257 igvn->set_type(dead, Type::TOP); | |
| 1258 if (dead->is_macro()) { | |
| 1259 igvn->C->remove_macro_node(dead); | |
| 1260 } | |
|
8048
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
1261 if (dead->is_expensive()) { |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
1262 igvn->C->remove_expensive_node(dead); |
|
8b3da8d14c93
7197327: 40% regression on 8 b41 comp 8 b40 on specjvm2008.mpegaudio on oob
roland
parents:
7636
diff
changeset
|
1263 } |
| 0 | 1264 // Kill all inputs to the dead guy |
| 1265 for (uint i=0; i < dead->req(); i++) { | |
| 1266 Node *n = dead->in(i); // Get input to dead guy | |
| 1267 if (n != NULL && !n->is_top()) { // Input is valid? | |
| 1268 dead->set_req(i, top); // Smash input away | |
| 1269 if (n->outcnt() == 0) { // Input also goes dead? | |
| 1270 if (!n->is_Con()) | |
| 1271 nstack.push(n); // Clear it out as well | |
| 1272 } else if (n->outcnt() == 1 && | |
| 1273 n->has_special_unique_user()) { | |
| 1274 igvn->add_users_to_worklist( n ); | |
| 1275 } else if (n->outcnt() <= 2 && n->is_Store()) { | |
| 1276 // Push store's uses on worklist to enable folding optimization for | |
| 1277 // store/store and store/load to the same address. | |
| 1278 // The restriction (outcnt() <= 2) is the same as in set_req_X() | |
| 1279 // and remove_globally_dead_node(). | |
| 1280 igvn->add_users_to_worklist( n ); | |
| 1281 } | |
| 1282 } | |
| 1283 } | |
| 1284 } // (dead->outcnt() == 0) | |
| 1285 } // while (nstack.size() > 0) for outputs | |
| 305 | 1286 return; |
| 0 | 1287 } |
| 1288 | |
| 1289 //------------------------------remove_dead_region----------------------------- | |
| 1290 bool Node::remove_dead_region(PhaseGVN *phase, bool can_reshape) { | |
| 1291 Node *n = in(0); | |
| 1292 if( !n ) return false; | |
| 1293 // Lost control into this guy? I.e., it became unreachable? | |
| 1294 // Aggressively kill all unreachable code. | |
| 1295 if (can_reshape && n->is_top()) { | |
| 305 | 1296 kill_dead_code(this, phase->is_IterGVN()); |
| 1297 return false; // Node is dead. | |
| 0 | 1298 } |
| 1299 | |
| 1300 if( n->is_Region() && n->as_Region()->is_copy() ) { | |
| 1301 Node *m = n->nonnull_req(); | |
| 1302 set_req(0, m); | |
| 1303 return true; | |
| 1304 } | |
| 1305 return false; | |
| 1306 } | |
| 1307 | |
| 1308 //------------------------------Ideal_DU_postCCP------------------------------- | |
| 1309 // Idealize graph, using DU info. Must clone result into new-space | |
| 1310 Node *Node::Ideal_DU_postCCP( PhaseCCP * ) { | |
| 1311 return NULL; // Default to no change | |
| 1312 } | |
| 1313 | |
| 1314 //------------------------------hash------------------------------------------- | |
| 1315 // Hash function over Nodes. | |
| 1316 uint Node::hash() const { | |
| 1317 uint sum = 0; | |
| 1318 for( uint i=0; i<_cnt; i++ ) // Add in all inputs | |
| 1319 sum = (sum<<1)-(uintptr_t)in(i); // Ignore embedded NULLs | |
| 1320 return (sum>>2) + _cnt + Opcode(); | |
| 1321 } | |
| 1322 | |
| 1323 //------------------------------cmp-------------------------------------------- | |
| 1324 // Compare special parts of simple Nodes | |
| 1325 uint Node::cmp( const Node &n ) const { | |
| 1326 return 1; // Must be same | |
| 1327 } | |
| 1328 | |
| 1329 //------------------------------rematerialize----------------------------------- | |
| 1330 // Should we clone rather than spill this instruction? | |
| 1331 bool Node::rematerialize() const { | |
| 1332 if ( is_Mach() ) | |
| 1333 return this->as_Mach()->rematerialize(); | |
| 1334 else | |
| 1335 return (_flags & Flag_rematerialize) != 0; | |
| 1336 } | |
| 1337 | |
| 1338 //------------------------------needs_anti_dependence_check--------------------- | |
| 1339 // Nodes which use memory without consuming it, hence need antidependences. | |
| 1340 bool Node::needs_anti_dependence_check() const { | |
| 1341 if( req() < 2 || (_flags & Flag_needs_anti_dependence_check) == 0 ) | |
| 1342 return false; | |
| 1343 else | |
| 1344 return in(1)->bottom_type()->has_memory(); | |
| 1345 } | |
| 1346 | |
| 1347 | |
| 1348 // Get an integer constant from a ConNode (or CastIINode). | |
| 1349 // Return a default value if there is no apparent constant here. | |
| 1350 const TypeInt* Node::find_int_type() const { | |
| 1351 if (this->is_Type()) { | |
| 1352 return this->as_Type()->type()->isa_int(); | |
| 1353 } else if (this->is_Con()) { | |
| 1354 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode"); | |
| 1355 return this->bottom_type()->isa_int(); | |
| 1356 } | |
| 1357 return NULL; | |
| 1358 } | |
| 1359 | |
| 1360 // Get a pointer constant from a ConstNode. | |
| 1361 // Returns the constant if it is a pointer ConstNode | |
| 1362 intptr_t Node::get_ptr() const { | |
| 1363 assert( Opcode() == Op_ConP, "" ); | |
| 1364 return ((ConPNode*)this)->type()->is_ptr()->get_con(); | |
| 1365 } | |
| 1366 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1367 // Get a narrow oop constant from a ConNNode. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1368 intptr_t Node::get_narrowcon() const { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1369 assert( Opcode() == Op_ConN, "" ); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1370 return ((ConNNode*)this)->type()->is_narrowoop()->get_con(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1371 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
65
diff
changeset
|
1372 |
| 0 | 1373 // Get a long constant from a ConNode. |
| 1374 // Return a default value if there is no apparent constant here. | |
| 1375 const TypeLong* Node::find_long_type() const { | |
| 1376 if (this->is_Type()) { | |
| 1377 return this->as_Type()->type()->isa_long(); | |
| 1378 } else if (this->is_Con()) { | |
| 1379 assert(is_Mach(), "should be ConNode(TypeNode) or else a MachNode"); | |
| 1380 return this->bottom_type()->isa_long(); | |
| 1381 } | |
| 1382 return NULL; | |
| 1383 } | |
| 1384 | |
| 1385 // Get a double constant from a ConstNode. | |
| 1386 // Returns the constant if it is a double ConstNode | |
| 1387 jdouble Node::getd() const { | |
| 1388 assert( Opcode() == Op_ConD, "" ); | |
| 1389 return ((ConDNode*)this)->type()->is_double_constant()->getd(); | |
| 1390 } | |
| 1391 | |
| 1392 // Get a float constant from a ConstNode. | |
| 1393 // Returns the constant if it is a float ConstNode | |
| 1394 jfloat Node::getf() const { | |
| 1395 assert( Opcode() == Op_ConF, "" ); | |
| 1396 return ((ConFNode*)this)->type()->is_float_constant()->getf(); | |
| 1397 } | |
| 1398 | |
| 1399 #ifndef PRODUCT | |
| 1400 | |
| 1401 //----------------------------NotANode---------------------------------------- | |
| 1402 // Used in debugging code to avoid walking across dead or uninitialized edges. | |
| 1403 static inline bool NotANode(const Node* n) { | |
| 1404 if (n == NULL) return true; | |
| 1405 if (((intptr_t)n & 1) != 0) return true; // uninitialized, etc. | |
| 1406 if (*(address*)n == badAddress) return true; // kill by Node::destruct | |
| 1407 return false; | |
| 1408 } | |
| 1409 | |
| 1410 | |
| 1411 //------------------------------find------------------------------------------ | |
| 1412 // Find a neighbor of this Node with the given _idx | |
| 1413 // If idx is negative, find its absolute value, following both _in and _out. | |
| 2403 | 1414 static void find_recur(Compile* C, Node* &result, Node *n, int idx, bool only_ctrl, |
| 1415 VectorSet* old_space, VectorSet* new_space ) { | |
| 0 | 1416 int node_idx = (idx >= 0) ? idx : -idx; |
| 1417 if (NotANode(n)) return; // Gracefully handle NULL, -1, 0xabababab, etc. | |
| 2403 | 1418 // Contained in new_space or old_space? Check old_arena first since it's mostly empty. |
| 1419 VectorSet *v = C->old_arena()->contains(n) ? old_space : new_space; | |
| 0 | 1420 if( v->test(n->_idx) ) return; |
| 1421 if( (int)n->_idx == node_idx | |
| 1422 debug_only(|| n->debug_idx() == node_idx) ) { | |
| 1423 if (result != NULL) | |
| 1424 tty->print("find: " INTPTR_FORMAT " and " INTPTR_FORMAT " both have idx==%d\n", | |
| 1425 (uintptr_t)result, (uintptr_t)n, node_idx); | |
| 1426 result = n; | |
| 1427 } | |
| 1428 v->set(n->_idx); | |
| 1429 for( uint i=0; i<n->len(); i++ ) { | |
| 1430 if( only_ctrl && !(n->is_Region()) && (n->Opcode() != Op_Root) && (i != TypeFunc::Control) ) continue; | |
| 2403 | 1431 find_recur(C, result, n->in(i), idx, only_ctrl, old_space, new_space ); |
| 0 | 1432 } |
| 1433 // Search along forward edges also: | |
| 1434 if (idx < 0 && !only_ctrl) { | |
| 1435 for( uint j=0; j<n->outcnt(); j++ ) { | |
| 2403 | 1436 find_recur(C, result, n->raw_out(j), idx, only_ctrl, old_space, new_space ); |
| 0 | 1437 } |
| 1438 } | |
| 1439 #ifdef ASSERT | |
| 2403 | 1440 // Search along debug_orig edges last, checking for cycles |
| 1441 Node* orig = n->debug_orig(); | |
| 1442 if (orig != NULL) { | |
| 1443 do { | |
| 1444 if (NotANode(orig)) break; | |
| 1445 find_recur(C, result, orig, idx, only_ctrl, old_space, new_space ); | |
| 1446 orig = orig->debug_orig(); | |
| 1447 } while (orig != NULL && orig != n->debug_orig()); | |
| 0 | 1448 } |
| 1449 #endif //ASSERT | |
| 1450 } | |
| 1451 | |
| 1452 // call this from debugger: | |
| 1453 Node* find_node(Node* n, int idx) { | |
| 1454 return n->find(idx); | |
| 1455 } | |
| 1456 | |
| 1457 //------------------------------find------------------------------------------- | |
| 1458 Node* Node::find(int idx) const { | |
| 1459 ResourceArea *area = Thread::current()->resource_area(); | |
| 1460 VectorSet old_space(area), new_space(area); | |
| 1461 Node* result = NULL; | |
| 2403 | 1462 find_recur(Compile::current(), result, (Node*) this, idx, false, &old_space, &new_space ); |
| 0 | 1463 return result; |
| 1464 } | |
| 1465 | |
| 1466 //------------------------------find_ctrl-------------------------------------- | |
| 1467 // Find an ancestor to this node in the control history with given _idx | |
| 1468 Node* Node::find_ctrl(int idx) const { | |
| 1469 ResourceArea *area = Thread::current()->resource_area(); | |
| 1470 VectorSet old_space(area), new_space(area); | |
| 1471 Node* result = NULL; | |
| 2403 | 1472 find_recur(Compile::current(), result, (Node*) this, idx, true, &old_space, &new_space ); |
| 0 | 1473 return result; |
| 1474 } | |
| 1475 #endif | |
| 1476 | |
| 1477 | |
| 1478 | |
| 1479 #ifndef PRODUCT | |
| 1480 int Node::_in_dump_cnt = 0; | |
| 1481 | |
| 1482 // -----------------------------Name------------------------------------------- | |
| 1483 extern const char *NodeClassNames[]; | |
| 1484 const char *Node::Name() const { return NodeClassNames[Opcode()]; } | |
| 1485 | |
| 1486 static bool is_disconnected(const Node* n) { | |
| 1487 for (uint i = 0; i < n->req(); i++) { | |
| 1488 if (n->in(i) != NULL) return false; | |
| 1489 } | |
| 1490 return true; | |
| 1491 } | |
| 1492 | |
| 1493 #ifdef ASSERT | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1494 static void dump_orig(Node* orig, outputStream *st) { |
| 0 | 1495 Compile* C = Compile::current(); |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1496 if (NotANode(orig)) orig = NULL; |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1497 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL; |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1498 if (orig == NULL) return; |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1499 st->print(" !orig="); |
| 0 | 1500 Node* fast = orig->debug_orig(); // tortoise & hare algorithm to detect loops |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1501 if (NotANode(fast)) fast = NULL; |
| 0 | 1502 while (orig != NULL) { |
| 1503 bool discon = is_disconnected(orig); // if discon, print [123] else 123 | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1504 if (discon) st->print("["); |
| 0 | 1505 if (!Compile::current()->node_arena()->contains(orig)) |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1506 st->print("o"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1507 st->print("%d", orig->_idx); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1508 if (discon) st->print("]"); |
| 0 | 1509 orig = orig->debug_orig(); |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1510 if (NotANode(orig)) orig = NULL; |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1511 if (orig != NULL && !C->node_arena()->contains(orig)) orig = NULL; |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1512 if (orig != NULL) st->print(","); |
| 0 | 1513 if (fast != NULL) { |
| 1514 // Step fast twice for each single step of orig: | |
| 1515 fast = fast->debug_orig(); | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1516 if (NotANode(fast)) fast = NULL; |
| 0 | 1517 if (fast != NULL && fast != orig) { |
| 1518 fast = fast->debug_orig(); | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1519 if (NotANode(fast)) fast = NULL; |
| 0 | 1520 } |
| 1521 if (fast == orig) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1522 st->print("..."); |
| 0 | 1523 break; |
| 1524 } | |
| 1525 } | |
| 1526 } | |
| 1527 } | |
| 1528 | |
| 1529 void Node::set_debug_orig(Node* orig) { | |
| 1530 _debug_orig = orig; | |
| 1531 if (BreakAtNode == 0) return; | |
| 1532 if (NotANode(orig)) orig = NULL; | |
| 1533 int trip = 10; | |
| 1534 while (orig != NULL) { | |
| 1535 if (orig->debug_idx() == BreakAtNode || (int)orig->_idx == BreakAtNode) { | |
| 1536 tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d orig._idx=%d orig._debug_idx=%d", | |
| 1537 this->_idx, this->debug_idx(), orig->_idx, orig->debug_idx()); | |
| 1538 BREAKPOINT; | |
| 1539 } | |
| 1540 orig = orig->debug_orig(); | |
| 1541 if (NotANode(orig)) orig = NULL; | |
| 1542 if (trip-- <= 0) break; | |
| 1543 } | |
| 1544 } | |
| 1545 #endif //ASSERT | |
| 1546 | |
| 1547 //------------------------------dump------------------------------------------ | |
| 1548 // Dump a Node | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1549 void Node::dump(const char* suffix, outputStream *st) const { |
| 0 | 1550 Compile* C = Compile::current(); |
| 1551 bool is_new = C->node_arena()->contains(this); | |
| 1552 _in_dump_cnt++; | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1553 st->print("%c%d\t%s\t=== ", is_new ? ' ' : 'o', _idx, Name()); |
| 0 | 1554 |
| 1555 // Dump the required and precedence inputs | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1556 dump_req(st); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1557 dump_prec(st); |
| 0 | 1558 // Dump the outputs |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1559 dump_out(st); |
| 0 | 1560 |
| 1561 if (is_disconnected(this)) { | |
| 1562 #ifdef ASSERT | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1563 st->print(" [%d]",debug_idx()); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1564 dump_orig(debug_orig(), st); |
| 0 | 1565 #endif |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1566 st->cr(); |
| 0 | 1567 _in_dump_cnt--; |
| 1568 return; // don't process dead nodes | |
| 1569 } | |
| 1570 | |
| 1571 // Dump node-specific info | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1572 dump_spec(st); |
| 0 | 1573 #ifdef ASSERT |
| 1574 // Dump the non-reset _debug_idx | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1575 if (Verbose && WizardMode) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1576 st->print(" [%d]",debug_idx()); |
| 0 | 1577 } |
| 1578 #endif | |
| 1579 | |
| 1580 const Type *t = bottom_type(); | |
| 1581 | |
| 1582 if (t != NULL && (t->isa_instptr() || t->isa_klassptr())) { | |
| 1583 const TypeInstPtr *toop = t->isa_instptr(); | |
| 1584 const TypeKlassPtr *tkls = t->isa_klassptr(); | |
| 1585 ciKlass* klass = toop ? toop->klass() : (tkls ? tkls->klass() : NULL ); | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1586 if (klass && klass->is_loaded() && klass->is_interface()) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1587 st->print(" Interface:"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1588 } else if (toop) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1589 st->print(" Oop:"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1590 } else if (tkls) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1591 st->print(" Klass:"); |
| 0 | 1592 } |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1593 t->dump_on(st); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1594 } else if (t == Type::MEMORY) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1595 st->print(" Memory:"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1596 MemNode::dump_adr_type(this, adr_type(), st); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1597 } else if (Verbose || WizardMode) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1598 st->print(" Type:"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1599 if (t) { |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1600 t->dump_on(st); |
| 0 | 1601 } else { |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1602 st->print("no type"); |
| 0 | 1603 } |
|
6179
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
4778
diff
changeset
|
1604 } else if (t->isa_vect() && this->is_MachSpillCopy()) { |
|
8c92982cbbc4
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
4778
diff
changeset
|
1605 // Dump MachSpillcopy vector type. |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1606 t->dump_on(st); |
| 0 | 1607 } |
| 1608 if (is_new) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1609 debug_only(dump_orig(debug_orig(), st)); |
| 0 | 1610 Node_Notes* nn = C->node_notes_at(_idx); |
| 1611 if (nn != NULL && !nn->is_clear()) { | |
| 1612 if (nn->jvms() != NULL) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1613 st->print(" !jvms:"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1614 nn->jvms()->dump_spec(st); |
| 0 | 1615 } |
| 1616 } | |
| 1617 } | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1618 if (suffix) st->print(suffix); |
| 0 | 1619 _in_dump_cnt--; |
| 1620 } | |
| 1621 | |
| 1622 //------------------------------dump_req-------------------------------------- | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1623 void Node::dump_req(outputStream *st) const { |
| 0 | 1624 // Dump the required input edges |
| 1625 for (uint i = 0; i < req(); i++) { // For all required inputs | |
| 1626 Node* d = in(i); | |
| 1627 if (d == NULL) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1628 st->print("_ "); |
| 0 | 1629 } else if (NotANode(d)) { |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1630 st->print("NotANode "); // uninitialized, sentinel, garbage, etc. |
| 0 | 1631 } else { |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1632 st->print("%c%d ", Compile::current()->node_arena()->contains(d) ? ' ' : 'o', d->_idx); |
| 0 | 1633 } |
| 1634 } | |
| 1635 } | |
| 1636 | |
| 1637 | |
| 1638 //------------------------------dump_prec------------------------------------- | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1639 void Node::dump_prec(outputStream *st) const { |
| 0 | 1640 // Dump the precedence edges |
| 1641 int any_prec = 0; | |
| 1642 for (uint i = req(); i < len(); i++) { // For all precedence inputs | |
| 1643 Node* p = in(i); | |
| 1644 if (p != NULL) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1645 if (!any_prec++) st->print(" |"); |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1646 if (NotANode(p)) { st->print("NotANode "); continue; } |
|
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1647 st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); |
| 0 | 1648 } |
| 1649 } | |
| 1650 } | |
| 1651 | |
| 1652 //------------------------------dump_out-------------------------------------- | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1653 void Node::dump_out(outputStream *st) const { |
| 0 | 1654 // Delimit the output edges |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1655 st->print(" [["); |
| 0 | 1656 // Dump the output edges |
| 1657 for (uint i = 0; i < _outcnt; i++) { // For all outputs | |
| 1658 Node* u = _out[i]; | |
| 1659 if (u == NULL) { | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1660 st->print("_ "); |
| 0 | 1661 } else if (NotANode(u)) { |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1662 st->print("NotANode "); |
| 0 | 1663 } else { |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1664 st->print("%c%d ", Compile::current()->node_arena()->contains(u) ? ' ' : 'o', u->_idx); |
| 0 | 1665 } |
| 1666 } | |
|
7636
a7114d3d712e
8005055: pass outputStream to more opto debug routines
kvn
parents:
7434
diff
changeset
|
1667 st->print("]] "); |
| 0 | 1668 } |
| 1669 | |
| 1670 //------------------------------dump_nodes------------------------------------- | |
| 1671 static void dump_nodes(const Node* start, int d, bool only_ctrl) { | |
| 1672 Node* s = (Node*)start; // remove const | |
| 1673 if (NotANode(s)) return; | |
| 1674 | |
|
24
953939ef62ab
6614330: Node::dump(n) does not print full graph for specified depth.
kvn
parents:
0
diff
changeset
|
1675 uint depth = (uint)ABS(d); |
|
953939ef62ab
6614330: Node::dump(n) does not print full graph for specified depth.
kvn
parents:
0
diff
changeset
|
1676 int direction = d; |
| 0 | 1677 Compile* C = Compile::current(); |
| 40 | 1678 GrowableArray <Node *> nstack(C->unique()); |
| 0 | 1679 |
| 40 | 1680 nstack.append(s); |
| 1681 int begin = 0; | |
| 1682 int end = 0; | |
| 1683 for(uint i = 0; i < depth; i++) { | |
| 1684 end = nstack.length(); | |
| 1685 for(int j = begin; j < end; j++) { | |
| 1686 Node* tp = nstack.at(j); | |
| 1687 uint limit = direction > 0 ? tp->len() : tp->outcnt(); | |
| 1688 for(uint k = 0; k < limit; k++) { | |
| 1689 Node* n = direction > 0 ? tp->in(k) : tp->raw_out(k); | |
| 0 | 1690 |
| 40 | 1691 if (NotANode(n)) continue; |
| 1692 // do not recurse through top or the root (would reach unrelated stuff) | |
| 1693 if (n->is_Root() || n->is_top()) continue; | |
| 1694 if (only_ctrl && !n->is_CFG()) continue; | |
| 0 | 1695 |
| 40 | 1696 bool on_stack = nstack.contains(n); |
| 1697 if (!on_stack) { | |
| 1698 nstack.append(n); | |
| 0 | 1699 } |
| 1700 } | |
| 1701 } | |
| 40 | 1702 begin = end; |
| 1703 } | |
| 1704 end = nstack.length(); | |
| 1705 if (direction > 0) { | |
| 1706 for(int j = end-1; j >= 0; j--) { | |
| 1707 nstack.at(j)->dump(); | |
| 1708 } | |
| 1709 } else { | |
| 1710 for(int j = 0; j < end; j++) { | |
| 1711 nstack.at(j)->dump(); | |
| 1712 } | |
| 0 | 1713 } |
| 1714 } | |
| 1715 | |
| 1716 //------------------------------dump------------------------------------------- | |
| 1717 void Node::dump(int d) const { | |
| 1718 dump_nodes(this, d, false); | |
| 1719 } | |
| 1720 | |
| 1721 //------------------------------dump_ctrl-------------------------------------- | |
| 1722 // Dump a Node's control history to depth | |
| 1723 void Node::dump_ctrl(int d) const { | |
| 1724 dump_nodes(this, d, true); | |
| 1725 } | |
| 1726 | |
| 1727 // VERIFICATION CODE | |
| 1728 // For each input edge to a node (ie - for each Use-Def edge), verify that | |
| 1729 // there is a corresponding Def-Use edge. | |
| 1730 //------------------------------verify_edges----------------------------------- | |
| 1731 void Node::verify_edges(Unique_Node_List &visited) { | |
| 1732 uint i, j, idx; | |
| 1733 int cnt; | |
| 1734 Node *n; | |
| 1735 | |
| 1736 // Recursive termination test | |
| 1737 if (visited.member(this)) return; | |
| 1738 visited.push(this); | |
| 1739 | |
| 605 | 1740 // Walk over all input edges, checking for correspondence |
| 0 | 1741 for( i = 0; i < len(); i++ ) { |
| 1742 n = in(i); | |
| 1743 if (n != NULL && !n->is_top()) { | |
| 1744 // Count instances of (Node *)this | |
| 1745 cnt = 0; | |
| 1746 for (idx = 0; idx < n->_outcnt; idx++ ) { | |
| 1747 if (n->_out[idx] == (Node *)this) cnt++; | |
| 1748 } | |
| 1749 assert( cnt > 0,"Failed to find Def-Use edge." ); | |
| 1750 // Check for duplicate edges | |
| 1751 // walk the input array downcounting the input edges to n | |
| 1752 for( j = 0; j < len(); j++ ) { | |
| 1753 if( in(j) == n ) cnt--; | |
| 1754 } | |
| 1755 assert( cnt == 0,"Mismatched edge count."); | |
| 1756 } else if (n == NULL) { | |
| 1757 assert(i >= req() || i == 0 || is_Region() || is_Phi(), "only regions or phis have null data edges"); | |
| 1758 } else { | |
| 1759 assert(n->is_top(), "sanity"); | |
| 1760 // Nothing to check. | |
| 1761 } | |
| 1762 } | |
| 1763 // Recursive walk over all input edges | |
| 1764 for( i = 0; i < len(); i++ ) { | |
| 1765 n = in(i); | |
| 1766 if( n != NULL ) | |
| 1767 in(i)->verify_edges(visited); | |
| 1768 } | |
| 1769 } | |
| 1770 | |
| 1771 //------------------------------verify_recur----------------------------------- | |
| 1772 static const Node *unique_top = NULL; | |
| 1773 | |
| 1774 void Node::verify_recur(const Node *n, int verify_depth, | |
| 1775 VectorSet &old_space, VectorSet &new_space) { | |
| 1776 if ( verify_depth == 0 ) return; | |
| 1777 if (verify_depth > 0) --verify_depth; | |
| 1778 | |
| 1779 Compile* C = Compile::current(); | |
| 1780 | |
| 1781 // Contained in new_space or old_space? | |
| 1782 VectorSet *v = C->node_arena()->contains(n) ? &new_space : &old_space; | |
| 1783 // Check for visited in the proper space. Numberings are not unique | |
| 605 | 1784 // across spaces so we need a separate VectorSet for each space. |
| 0 | 1785 if( v->test_set(n->_idx) ) return; |
| 1786 | |
| 1787 if (n->is_Con() && n->bottom_type() == Type::TOP) { | |
| 1788 if (C->cached_top_node() == NULL) | |
| 1789 C->set_cached_top_node((Node*)n); | |
| 1790 assert(C->cached_top_node() == n, "TOP node must be unique"); | |
| 1791 } | |
| 1792 | |
| 1793 for( uint i = 0; i < n->len(); i++ ) { | |
| 1794 Node *x = n->in(i); | |
| 1795 if (!x || x->is_top()) continue; | |
| 1796 | |
| 1797 // Verify my input has a def-use edge to me | |
| 1798 if (true /*VerifyDefUse*/) { | |
| 1799 // Count use-def edges from n to x | |
| 1800 int cnt = 0; | |
| 1801 for( uint j = 0; j < n->len(); j++ ) | |
| 1802 if( n->in(j) == x ) | |
| 1803 cnt++; | |
| 1804 // Count def-use edges from x to n | |
| 1805 uint max = x->_outcnt; | |
| 1806 for( uint k = 0; k < max; k++ ) | |
| 1807 if (x->_out[k] == n) | |
| 1808 cnt--; | |
| 1809 assert( cnt == 0, "mismatched def-use edge counts" ); | |
| 1810 } | |
| 1811 | |
| 1812 verify_recur(x, verify_depth, old_space, new_space); | |
| 1813 } | |
| 1814 | |
| 1815 } | |
| 1816 | |
| 1817 //------------------------------verify----------------------------------------- | |
| 1818 // Check Def-Use info for my subgraph | |
| 1819 void Node::verify() const { | |
| 1820 Compile* C = Compile::current(); | |
| 1821 Node* old_top = C->cached_top_node(); | |
| 1822 ResourceMark rm; | |
| 1823 ResourceArea *area = Thread::current()->resource_area(); | |
| 1824 VectorSet old_space(area), new_space(area); | |
| 1825 verify_recur(this, -1, old_space, new_space); | |
| 1826 C->set_cached_top_node(old_top); | |
| 1827 } | |
| 1828 #endif | |
| 1829 | |
| 1830 | |
| 1831 //------------------------------walk------------------------------------------- | |
| 1832 // Graph walk, with both pre-order and post-order functions | |
| 1833 void Node::walk(NFunc pre, NFunc post, void *env) { | |
| 1834 VectorSet visited(Thread::current()->resource_area()); // Setup for local walk | |
| 1835 walk_(pre, post, env, visited); | |
| 1836 } | |
| 1837 | |
| 1838 void Node::walk_(NFunc pre, NFunc post, void *env, VectorSet &visited) { | |
| 1839 if( visited.test_set(_idx) ) return; | |
| 1840 pre(*this,env); // Call the pre-order walk function | |
| 1841 for( uint i=0; i<_max; i++ ) | |
| 1842 if( in(i) ) // Input exists and is not walked? | |
| 1843 in(i)->walk_(pre,post,env,visited); // Walk it with pre & post functions | |
| 1844 post(*this,env); // Call the post-order walk function | |
| 1845 } | |
| 1846 | |
| 1847 void Node::nop(Node &, void*) {} | |
| 1848 | |
| 1849 //------------------------------Registers-------------------------------------- | |
| 1850 // Do we Match on this edge index or not? Generally false for Control | |
| 1851 // and true for everything else. Weird for calls & returns. | |
| 1852 uint Node::match_edge(uint idx) const { | |
| 1853 return idx; // True for other than index 0 (control) | |
| 1854 } | |
| 1855 | |
|
7434
32164d89fe9c
8004845: Catch incorrect usage of new and delete during compile time for value objects and stack objects
brutisso
parents:
7196
diff
changeset
|
1856 static RegMask _not_used_at_all; |
| 0 | 1857 // Register classes are defined for specific machines |
| 1858 const RegMask &Node::out_RegMask() const { | |
| 1859 ShouldNotCallThis(); | |
|
7434
32164d89fe9c
8004845: Catch incorrect usage of new and delete during compile time for value objects and stack objects
brutisso
parents:
7196
diff
changeset
|
1860 return _not_used_at_all; |
| 0 | 1861 } |
| 1862 | |
| 1863 const RegMask &Node::in_RegMask(uint) const { | |
| 1864 ShouldNotCallThis(); | |
|
7434
32164d89fe9c
8004845: Catch incorrect usage of new and delete during compile time for value objects and stack objects
brutisso
parents:
7196
diff
changeset
|
1865 return _not_used_at_all; |
| 0 | 1866 } |
| 1867 | |
| 1868 //============================================================================= | |
| 1869 //----------------------------------------------------------------------------- | |
| 1870 void Node_Array::reset( Arena *new_arena ) { | |
| 1871 _a->Afree(_nodes,_max*sizeof(Node*)); | |
| 1872 _max = 0; | |
| 1873 _nodes = NULL; | |
| 1874 _a = new_arena; | |
| 1875 } | |
| 1876 | |
| 1877 //------------------------------clear------------------------------------------ | |
| 1878 // Clear all entries in _nodes to NULL but keep storage | |
| 1879 void Node_Array::clear() { | |
| 1880 Copy::zero_to_bytes( _nodes, _max*sizeof(Node*) ); | |
| 1881 } | |
| 1882 | |
| 1883 //----------------------------------------------------------------------------- | |
| 1884 void Node_Array::grow( uint i ) { | |
| 1885 if( !_max ) { | |
| 1886 _max = 1; | |
| 1887 _nodes = (Node**)_a->Amalloc( _max * sizeof(Node*) ); | |
| 1888 _nodes[0] = NULL; | |
| 1889 } | |
| 1890 uint old = _max; | |
| 1891 while( i >= _max ) _max <<= 1; // Double to fit | |
| 1892 _nodes = (Node**)_a->Arealloc( _nodes, old*sizeof(Node*),_max*sizeof(Node*)); | |
| 1893 Copy::zero_to_bytes( &_nodes[old], (_max-old)*sizeof(Node*) ); | |
| 1894 } | |
| 1895 | |
| 1896 //----------------------------------------------------------------------------- | |
| 1897 void Node_Array::insert( uint i, Node *n ) { | |
| 1898 if( _nodes[_max-1] ) grow(_max); // Get more space if full | |
| 1899 Copy::conjoint_words_to_higher((HeapWord*)&_nodes[i], (HeapWord*)&_nodes[i+1], ((_max-i-1)*sizeof(Node*))); | |
| 1900 _nodes[i] = n; | |
| 1901 } | |
| 1902 | |
| 1903 //----------------------------------------------------------------------------- | |
| 1904 void Node_Array::remove( uint i ) { | |
| 1905 Copy::conjoint_words_to_lower((HeapWord*)&_nodes[i+1], (HeapWord*)&_nodes[i], ((_max-i-1)*sizeof(Node*))); | |
| 1906 _nodes[_max-1] = NULL; | |
| 1907 } | |
| 1908 | |
| 1909 //----------------------------------------------------------------------------- | |
| 1910 void Node_Array::sort( C_sort_func_t func) { | |
| 1911 qsort( _nodes, _max, sizeof( Node* ), func ); | |
| 1912 } | |
| 1913 | |
| 1914 //----------------------------------------------------------------------------- | |
| 1915 void Node_Array::dump() const { | |
| 1916 #ifndef PRODUCT | |
| 1917 for( uint i = 0; i < _max; i++ ) { | |
| 1918 Node *nn = _nodes[i]; | |
| 1919 if( nn != NULL ) { | |
| 1920 tty->print("%5d--> ",i); nn->dump(); | |
| 1921 } | |
| 1922 } | |
| 1923 #endif | |
| 1924 } | |
| 1925 | |
| 1926 //--------------------------is_iteratively_computed------------------------------ | |
| 1927 // Operation appears to be iteratively computed (such as an induction variable) | |
| 1928 // It is possible for this operation to return false for a loop-varying | |
| 1929 // value, if it appears (by local graph inspection) to be computed by a simple conditional. | |
| 1930 bool Node::is_iteratively_computed() { | |
| 1931 if (ideal_reg()) { // does operation have a result register? | |
| 1932 for (uint i = 1; i < req(); i++) { | |
| 1933 Node* n = in(i); | |
| 1934 if (n != NULL && n->is_Phi()) { | |
| 1935 for (uint j = 1; j < n->req(); j++) { | |
| 1936 if (n->in(j) == this) { | |
| 1937 return true; | |
| 1938 } | |
| 1939 } | |
| 1940 } | |
| 1941 } | |
| 1942 } | |
| 1943 return false; | |
| 1944 } | |
| 1945 | |
| 1946 //--------------------------find_similar------------------------------ | |
| 1947 // Return a node with opcode "opc" and same inputs as "this" if one can | |
| 1948 // be found; Otherwise return NULL; | |
| 1949 Node* Node::find_similar(int opc) { | |
| 1950 if (req() >= 2) { | |
| 1951 Node* def = in(1); | |
| 1952 if (def && def->outcnt() >= 2) { | |
| 1953 for (DUIterator_Fast dmax, i = def->fast_outs(dmax); i < dmax; i++) { | |
| 1954 Node* use = def->fast_out(i); | |
| 1955 if (use->Opcode() == opc && | |
| 1956 use->req() == req()) { | |
| 1957 uint j; | |
| 1958 for (j = 0; j < use->req(); j++) { | |
| 1959 if (use->in(j) != in(j)) { | |
| 1960 break; | |
| 1961 } | |
| 1962 } | |
| 1963 if (j == use->req()) { | |
| 1964 return use; | |
| 1965 } | |
| 1966 } | |
| 1967 } | |
| 1968 } | |
| 1969 } | |
| 1970 return NULL; | |
| 1971 } | |
| 1972 | |
| 1973 | |
| 1974 //--------------------------unique_ctrl_out------------------------------ | |
| 1975 // Return the unique control out if only one. Null if none or more than one. | |
| 1976 Node* Node::unique_ctrl_out() { | |
| 1977 Node* found = NULL; | |
| 1978 for (uint i = 0; i < outcnt(); i++) { | |
| 1979 Node* use = raw_out(i); | |
| 1980 if (use->is_CFG() && use != this) { | |
| 1981 if (found != NULL) return NULL; | |
| 1982 found = use; | |
| 1983 } | |
| 1984 } | |
| 1985 return found; | |
| 1986 } | |
| 1987 | |
| 1988 //============================================================================= | |
| 1989 //------------------------------yank------------------------------------------- | |
| 1990 // Find and remove | |
| 1991 void Node_List::yank( Node *n ) { | |
| 1992 uint i; | |
| 1993 for( i = 0; i < _cnt; i++ ) | |
| 1994 if( _nodes[i] == n ) | |
| 1995 break; | |
| 1996 | |
| 1997 if( i < _cnt ) | |
| 1998 _nodes[i] = _nodes[--_cnt]; | |
| 1999 } | |
| 2000 | |
| 2001 //------------------------------dump------------------------------------------- | |
| 2002 void Node_List::dump() const { | |
| 2003 #ifndef PRODUCT | |
| 2004 for( uint i = 0; i < _cnt; i++ ) | |
| 2005 if( _nodes[i] ) { | |
| 2006 tty->print("%5d--> ",i); | |
| 2007 _nodes[i]->dump(); | |
| 2008 } | |
| 2009 #endif | |
| 2010 } | |
| 2011 | |
| 2012 //============================================================================= | |
| 2013 //------------------------------remove----------------------------------------- | |
| 2014 void Unique_Node_List::remove( Node *n ) { | |
| 2015 if( _in_worklist[n->_idx] ) { | |
| 2016 for( uint i = 0; i < size(); i++ ) | |
| 2017 if( _nodes[i] == n ) { | |
| 2018 map(i,Node_List::pop()); | |
| 2019 _in_worklist >>= n->_idx; | |
| 2020 return; | |
| 2021 } | |
| 2022 ShouldNotReachHere(); | |
| 2023 } | |
| 2024 } | |
| 2025 | |
| 2026 //-----------------------remove_useless_nodes---------------------------------- | |
| 2027 // Remove useless nodes from worklist | |
| 2028 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) { | |
| 2029 | |
| 2030 for( uint i = 0; i < size(); ++i ) { | |
| 2031 Node *n = at(i); | |
| 2032 assert( n != NULL, "Did not expect null entries in worklist"); | |
| 2033 if( ! useful.test(n->_idx) ) { | |
| 2034 _in_worklist >>= n->_idx; | |
| 2035 map(i,Node_List::pop()); | |
| 2036 // Node *replacement = Node_List::pop(); | |
| 2037 // if( i != size() ) { // Check if removing last entry | |
| 2038 // _nodes[i] = replacement; | |
| 2039 // } | |
| 2040 --i; // Visit popped node | |
| 2041 // If it was last entry, loop terminates since size() was also reduced | |
| 2042 } | |
| 2043 } | |
| 2044 } | |
| 2045 | |
| 2046 //============================================================================= | |
| 2047 void Node_Stack::grow() { | |
| 2048 size_t old_top = pointer_delta(_inode_top,_inodes,sizeof(INode)); // save _top | |
| 2049 size_t old_max = pointer_delta(_inode_max,_inodes,sizeof(INode)); | |
| 2050 size_t max = old_max << 1; // max * 2 | |
| 2051 _inodes = REALLOC_ARENA_ARRAY(_a, INode, _inodes, old_max, max); | |
| 2052 _inode_max = _inodes + max; | |
| 2053 _inode_top = _inodes + old_top; // restore _top | |
| 2054 } | |
| 2055 | |
|
3788
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2056 // Node_Stack is used to map nodes. |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2057 Node* Node_Stack::find(uint idx) const { |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2058 uint sz = size(); |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2059 for (uint i=0; i < sz; i++) { |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2060 if (idx == index_at(i) ) |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2061 return node_at(i); |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2062 } |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2063 return NULL; |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2064 } |
|
e3cbc9ddd434
7044738: Loop unroll optimization causes incorrect result
kvn
parents:
2426
diff
changeset
|
2065 |
| 0 | 2066 //============================================================================= |
| 2067 uint TypeNode::size_of() const { return sizeof(*this); } | |
| 2068 #ifndef PRODUCT | |
| 2069 void TypeNode::dump_spec(outputStream *st) const { | |
| 2070 if( !Verbose && !WizardMode ) { | |
| 2071 // standard dump does this in Verbose and WizardMode | |
| 2072 st->print(" #"); _type->dump_on(st); | |
| 2073 } | |
| 2074 } | |
| 2075 #endif | |
| 2076 uint TypeNode::hash() const { | |
| 2077 return Node::hash() + _type->hash(); | |
| 2078 } | |
| 2079 uint TypeNode::cmp( const Node &n ) const | |
| 2080 { return !Type::cmp( _type, ((TypeNode&)n)._type ); } | |
| 2081 const Type *TypeNode::bottom_type() const { return _type; } | |
| 2082 const Type *TypeNode::Value( PhaseTransform * ) const { return _type; } | |
| 2083 | |
| 2084 //------------------------------ideal_reg-------------------------------------- | |
| 2085 uint TypeNode::ideal_reg() const { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6179
diff
changeset
|
2086 return _type->ideal_reg(); |
| 0 | 2087 } |