20 * or visit www.oracle.com if you need additional information or have any |
20 * or visit www.oracle.com if you need additional information or have any |
21 * questions. |
21 * questions. |
22 * |
22 * |
23 */ |
23 */ |
24 |
24 |
25 #include "incls/_precompiled.incl" |
25 #include "precompiled.hpp" |
26 #include "incls/_loopopts.cpp.incl" |
26 #include "memory/allocation.inline.hpp" |
|
27 #include "opto/addnode.hpp" |
|
28 #include "opto/connode.hpp" |
|
29 #include "opto/divnode.hpp" |
|
30 #include "opto/loopnode.hpp" |
|
31 #include "opto/mulnode.hpp" |
|
32 #include "opto/rootnode.hpp" |
|
33 #include "opto/subnode.hpp" |
27 |
34 |
28 //============================================================================= |
35 //============================================================================= |
29 //------------------------------split_thru_phi--------------------------------- |
36 //------------------------------split_thru_phi--------------------------------- |
30 // Split Node 'n' through merge point if there is enough win. |
37 // Split Node 'n' through merge point if there is enough win. |
31 Node *PhaseIdealLoop::split_thru_phi( Node *n, Node *region, int policy ) { |
38 Node *PhaseIdealLoop::split_thru_phi( Node *n, Node *region, int policy ) { |