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