38 import org.graalvm.compiler.nodes.FixedNode;
39 import org.graalvm.compiler.nodes.FixedWithNextNode;
40 import org.graalvm.compiler.nodes.InvokeNode;
41 import org.graalvm.compiler.nodes.LoopBeginNode;
42 import org.graalvm.compiler.nodes.MergeNode;
43 import org.graalvm.compiler.nodes.StructuredGraph;
44 import org.graalvm.compiler.nodes.VirtualState;
45 import org.graalvm.compiler.nodes.VirtualState.VirtualClosure;
46 import org.graalvm.compiler.nodes.cfg.Block;
47 import org.graalvm.compiler.nodes.cfg.ControlFlowGraph;
48 import org.graalvm.compiler.nodes.debug.ControlFlowAnchorNode;
49 import org.graalvm.compiler.nodes.java.TypeSwitchNode;
50 import org.graalvm.compiler.options.Option;
51 import org.graalvm.compiler.options.OptionKey;
52 import org.graalvm.compiler.options.OptionType;
53 import org.graalvm.compiler.options.OptionValues;
54
55 import jdk.vm.ci.meta.MetaAccessProvider;
56
57 public class DefaultLoopPolicies implements LoopPolicies {
58 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> LoopUnswitchMaxIncrease = new OptionKey<>(500);
59 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> LoopUnswitchTrivial = new OptionKey<>(10);
60 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Double> LoopUnswitchFrequencyBoost = new OptionKey<>(10.0);
61
62 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> FullUnrollMaxNodes = new OptionKey<>(300);
63 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> FullUnrollMaxIterations = new OptionKey<>(600);
64 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> ExactFullUnrollMaxNodes = new OptionKey<>(1200);
65 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> ExactPartialUnrollMaxNodes = new OptionKey<>(200);
66
67 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> UnrollMaxIterations = new OptionKey<>(16);
68
69 @Override
70 public boolean shouldPeel(LoopEx loop, ControlFlowGraph cfg, MetaAccessProvider metaAccess) {
71 LoopBeginNode loopBegin = loop.loopBegin();
72 double entryProbability = cfg.blockFor(loopBegin.forwardEnd()).probability();
73 OptionValues options = cfg.graph.getOptions();
74 if (entryProbability > MinimumPeelProbability.getValue(options) && loop.size() + loopBegin.graph().getNodeCount() < MaximumDesiredSize.getValue(options)) {
75 // check whether we're allowed to peel this loop
76 return loop.canDuplicateLoop();
77 } else {
78 return false;
79 }
80 }
81
82 @Override
83 public boolean shouldFullUnroll(LoopEx loop) {
84 if (!loop.isCounted() || !loop.counted().isConstantMaxTripCount()) {
85 return false;
86 }
87 OptionValues options = loop.entryPoint().getOptions();
88 CountedLoopInfo counted = loop.counted();
89 long maxTrips = counted.constantMaxTripCount();
90 int maxNodes = (counted.isExactTripCount() && counted.isConstantExactTripCount()) ? ExactFullUnrollMaxNodes.getValue(options) : FullUnrollMaxNodes.getValue(options);
91 maxNodes = Math.min(maxNodes, Math.max(0, MaximumDesiredSize.getValue(options) - loop.loopBegin().graph().getNodeCount()));
92 int size = Math.max(1, loop.size() - 1 - loop.loopBegin().phis().count());
93 if (maxTrips <= FullUnrollMaxIterations.getValue(options) && size * (maxTrips - 1) <= maxNodes) {
94 // check whether we're allowed to unroll this loop
95 return loop.canDuplicateLoop();
96 } else {
97 return false;
98 }
99 }
100
101 @Override
102 public boolean shouldPartiallyUnroll(LoopEx loop) {
103 LoopBeginNode loopBegin = loop.loopBegin();
104 if (!loop.isCounted()) {
105 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s isn't counted", loopBegin);
106 return false;
107 }
108 OptionValues options = loop.entryPoint().getOptions();
109 int maxNodes = ExactPartialUnrollMaxNodes.getValue(options);
110 maxNodes = Math.min(maxNodes, Math.max(0, MaximumDesiredSize.getValue(options) - loop.loopBegin().graph().getNodeCount()));
111 int size = Math.max(1, loop.size() - 1 - loop.loopBegin().phis().count());
112 int unrollFactor = loopBegin.getUnrollFactor();
113 if (unrollFactor == 1) {
114 double loopFrequency = loopBegin.loopFrequency();
115 if (loopBegin.isSimpleLoop() && loopFrequency < 5.0) {
116 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s frequency too low %s ", loopBegin, loopFrequency);
117 return false;
118 }
119 loopBegin.setLoopOrigFrequency(loopFrequency);
120 }
121 int maxUnroll = UnrollMaxIterations.getValue(options);
122 // Now correct size for the next unroll. UnrollMaxIterations == 1 means perform the
123 // pre/main/post transformation but don't actually unroll the main loop.
124 size += size;
125 if (maxUnroll == 1 && loopBegin.isSimpleLoop() || size <= maxNodes && unrollFactor < maxUnroll) {
126 // Will the next unroll fit?
127 if ((int) loopBegin.loopOrigFrequency() < (unrollFactor * 2)) {
128 return false;
129 }
130 // Check whether we're allowed to unroll this loop
131 for (Node node : loop.inside().nodes()) {
132 if (node instanceof ControlFlowAnchorNode) {
133 return false;
134 }
135 if (node instanceof InvokeNode) {
136 return false;
137 }
138 }
139 return true;
140 } else {
141 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s unrolled loop is too large %s ", loopBegin, size);
173 StructuredGraph graph = loop.loopBegin().graph();
174 DebugContext debug = graph.getDebug();
175 NodeBitMap branchNodes = graph.createNodeBitMap();
176 for (ControlSplitNode controlSplit : controlSplits) {
177 for (Node successor : controlSplit.successors()) {
178 AbstractBeginNode branch = (AbstractBeginNode) successor;
179 // this may count twice because of fall-through in switches
180 loop.nodesInLoopBranch(branchNodes, branch);
181 }
182 Block postDomBlock = loop.loopsData().getCFG().blockFor(controlSplit).getPostdominator();
183 if (postDomBlock != null) {
184 IsolatedInitialization.UNSWITCH_SPLIT_WITH_PHIS.increment(debug);
185 phis += ((MergeNode) postDomBlock.getBeginNode()).phis().count();
186 }
187 }
188 int inBranchTotal = branchNodes.count();
189
190 CountingClosure stateNodesCount = new CountingClosure();
191 double loopFrequency = loop.loopBegin().loopFrequency();
192 OptionValues options = loop.loopBegin().getOptions();
193 int maxDiff = LoopUnswitchTrivial.getValue(options) + (int) (LoopUnswitchFrequencyBoost.getValue(options) * (loopFrequency - 1.0 + phis));
194
195 maxDiff = Math.min(maxDiff, LoopUnswitchMaxIncrease.getValue(options));
196 int remainingGraphSpace = MaximumDesiredSize.getValue(options) - graph.getNodeCount();
197 maxDiff = Math.min(maxDiff, remainingGraphSpace);
198
199 loop.loopBegin().stateAfter().applyToVirtual(stateNodesCount);
200 int loopTotal = loop.size() - loop.loopBegin().phis().count() - stateNodesCount.count - 1;
201 int actualDiff = (loopTotal - inBranchTotal);
202 ControlSplitNode firstSplit = controlSplits.get(0);
203 if (firstSplit instanceof TypeSwitchNode) {
204 int copies = firstSplit.successors().count() - 1;
205 for (Node succ : firstSplit.successors()) {
206 FixedNode current = (FixedNode) succ;
207 while (current instanceof FixedWithNextNode) {
208 current = ((FixedWithNextNode) current).next();
209 }
210 if (current instanceof DeoptimizeNode) {
211 copies--;
212 }
213 }
214 actualDiff = actualDiff * copies;
215 }
|
38 import org.graalvm.compiler.nodes.FixedNode;
39 import org.graalvm.compiler.nodes.FixedWithNextNode;
40 import org.graalvm.compiler.nodes.InvokeNode;
41 import org.graalvm.compiler.nodes.LoopBeginNode;
42 import org.graalvm.compiler.nodes.MergeNode;
43 import org.graalvm.compiler.nodes.StructuredGraph;
44 import org.graalvm.compiler.nodes.VirtualState;
45 import org.graalvm.compiler.nodes.VirtualState.VirtualClosure;
46 import org.graalvm.compiler.nodes.cfg.Block;
47 import org.graalvm.compiler.nodes.cfg.ControlFlowGraph;
48 import org.graalvm.compiler.nodes.debug.ControlFlowAnchorNode;
49 import org.graalvm.compiler.nodes.java.TypeSwitchNode;
50 import org.graalvm.compiler.options.Option;
51 import org.graalvm.compiler.options.OptionKey;
52 import org.graalvm.compiler.options.OptionType;
53 import org.graalvm.compiler.options.OptionValues;
54
55 import jdk.vm.ci.meta.MetaAccessProvider;
56
57 public class DefaultLoopPolicies implements LoopPolicies {
58
59 public static class Options {
60 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> LoopUnswitchMaxIncrease = new OptionKey<>(500);
61 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> LoopUnswitchTrivial = new OptionKey<>(10);
62 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Double> LoopUnswitchFrequencyBoost = new OptionKey<>(10.0);
63
64 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> FullUnrollMaxNodes = new OptionKey<>(300);
65 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> FullUnrollMaxIterations = new OptionKey<>(600);
66 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> ExactFullUnrollMaxNodes = new OptionKey<>(1200);
67 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> ExactPartialUnrollMaxNodes = new OptionKey<>(200);
68
69 @Option(help = "", type = OptionType.Expert) public static final OptionKey<Integer> UnrollMaxIterations = new OptionKey<>(16);
70 }
71
72 @Override
73 public boolean shouldPeel(LoopEx loop, ControlFlowGraph cfg, MetaAccessProvider metaAccess) {
74 LoopBeginNode loopBegin = loop.loopBegin();
75 double entryProbability = cfg.blockFor(loopBegin.forwardEnd()).probability();
76 OptionValues options = cfg.graph.getOptions();
77 if (entryProbability > MinimumPeelProbability.getValue(options) && loop.size() + loopBegin.graph().getNodeCount() < MaximumDesiredSize.getValue(options)) {
78 // check whether we're allowed to peel this loop
79 return loop.canDuplicateLoop();
80 } else {
81 return false;
82 }
83 }
84
85 @Override
86 public boolean shouldFullUnroll(LoopEx loop) {
87 if (!loop.isCounted() || !loop.counted().isConstantMaxTripCount()) {
88 return false;
89 }
90 OptionValues options = loop.entryPoint().getOptions();
91 CountedLoopInfo counted = loop.counted();
92 long maxTrips = counted.constantMaxTripCount();
93 int maxNodes = (counted.isExactTripCount() && counted.isConstantExactTripCount()) ? Options.ExactFullUnrollMaxNodes.getValue(options) : Options.FullUnrollMaxNodes.getValue(options);
94 maxNodes = Math.min(maxNodes, Math.max(0, MaximumDesiredSize.getValue(options) - loop.loopBegin().graph().getNodeCount()));
95 int size = Math.max(1, loop.size() - 1 - loop.loopBegin().phis().count());
96 if (maxTrips <= Options.FullUnrollMaxIterations.getValue(options) && size * (maxTrips - 1) <= maxNodes) {
97 // check whether we're allowed to unroll this loop
98 return loop.canDuplicateLoop();
99 } else {
100 return false;
101 }
102 }
103
104 @Override
105 public boolean shouldPartiallyUnroll(LoopEx loop) {
106 LoopBeginNode loopBegin = loop.loopBegin();
107 if (!loop.isCounted()) {
108 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s isn't counted", loopBegin);
109 return false;
110 }
111 OptionValues options = loop.entryPoint().getOptions();
112 int maxNodes = Options.ExactPartialUnrollMaxNodes.getValue(options);
113 maxNodes = Math.min(maxNodes, Math.max(0, MaximumDesiredSize.getValue(options) - loop.loopBegin().graph().getNodeCount()));
114 int size = Math.max(1, loop.size() - 1 - loop.loopBegin().phis().count());
115 int unrollFactor = loopBegin.getUnrollFactor();
116 if (unrollFactor == 1) {
117 double loopFrequency = loopBegin.loopFrequency();
118 if (loopBegin.isSimpleLoop() && loopFrequency < 5.0) {
119 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s frequency too low %s ", loopBegin, loopFrequency);
120 return false;
121 }
122 loopBegin.setLoopOrigFrequency(loopFrequency);
123 }
124 int maxUnroll = Options.UnrollMaxIterations.getValue(options);
125 // Now correct size for the next unroll. UnrollMaxIterations == 1 means perform the
126 // pre/main/post transformation but don't actually unroll the main loop.
127 size += size;
128 if (maxUnroll == 1 && loopBegin.isSimpleLoop() || size <= maxNodes && unrollFactor < maxUnroll) {
129 // Will the next unroll fit?
130 if ((int) loopBegin.loopOrigFrequency() < (unrollFactor * 2)) {
131 return false;
132 }
133 // Check whether we're allowed to unroll this loop
134 for (Node node : loop.inside().nodes()) {
135 if (node instanceof ControlFlowAnchorNode) {
136 return false;
137 }
138 if (node instanceof InvokeNode) {
139 return false;
140 }
141 }
142 return true;
143 } else {
144 loopBegin.getDebug().log(DebugContext.VERBOSE_LEVEL, "shouldPartiallyUnroll %s unrolled loop is too large %s ", loopBegin, size);
176 StructuredGraph graph = loop.loopBegin().graph();
177 DebugContext debug = graph.getDebug();
178 NodeBitMap branchNodes = graph.createNodeBitMap();
179 for (ControlSplitNode controlSplit : controlSplits) {
180 for (Node successor : controlSplit.successors()) {
181 AbstractBeginNode branch = (AbstractBeginNode) successor;
182 // this may count twice because of fall-through in switches
183 loop.nodesInLoopBranch(branchNodes, branch);
184 }
185 Block postDomBlock = loop.loopsData().getCFG().blockFor(controlSplit).getPostdominator();
186 if (postDomBlock != null) {
187 IsolatedInitialization.UNSWITCH_SPLIT_WITH_PHIS.increment(debug);
188 phis += ((MergeNode) postDomBlock.getBeginNode()).phis().count();
189 }
190 }
191 int inBranchTotal = branchNodes.count();
192
193 CountingClosure stateNodesCount = new CountingClosure();
194 double loopFrequency = loop.loopBegin().loopFrequency();
195 OptionValues options = loop.loopBegin().getOptions();
196 int maxDiff = Options.LoopUnswitchTrivial.getValue(options) + (int) (Options.LoopUnswitchFrequencyBoost.getValue(options) * (loopFrequency - 1.0 + phis));
197
198 maxDiff = Math.min(maxDiff, Options.LoopUnswitchMaxIncrease.getValue(options));
199 int remainingGraphSpace = MaximumDesiredSize.getValue(options) - graph.getNodeCount();
200 maxDiff = Math.min(maxDiff, remainingGraphSpace);
201
202 loop.loopBegin().stateAfter().applyToVirtual(stateNodesCount);
203 int loopTotal = loop.size() - loop.loopBegin().phis().count() - stateNodesCount.count - 1;
204 int actualDiff = (loopTotal - inBranchTotal);
205 ControlSplitNode firstSplit = controlSplits.get(0);
206 if (firstSplit instanceof TypeSwitchNode) {
207 int copies = firstSplit.successors().count() - 1;
208 for (Node succ : firstSplit.successors()) {
209 FixedNode current = (FixedNode) succ;
210 while (current instanceof FixedWithNextNode) {
211 current = ((FixedWithNextNode) current).next();
212 }
213 if (current instanceof DeoptimizeNode) {
214 copies--;
215 }
216 }
217 actualDiff = actualDiff * copies;
218 }
|