--- /dev/null 2017-01-22 10:16:57.869617664 -0800 +++ new/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/LoopsData.java 2017-02-15 17:06:12.016471226 -0800 @@ -0,0 +1,143 @@ +/* + * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ +package org.graalvm.compiler.loop; + +import java.util.ArrayList; +import java.util.Collection; +import java.util.Collections; +import java.util.Comparator; +import java.util.LinkedList; +import java.util.List; +import java.util.Map; + +import org.graalvm.compiler.core.common.CollectionsFactory; +import org.graalvm.compiler.core.common.cfg.Loop; +import org.graalvm.compiler.debug.Debug; +import org.graalvm.compiler.debug.Debug.Scope; +import org.graalvm.compiler.graph.Node; +import org.graalvm.compiler.nodes.LoopBeginNode; +import org.graalvm.compiler.nodes.StructuredGraph; +import org.graalvm.compiler.nodes.ValueNode; +import org.graalvm.compiler.nodes.cfg.Block; +import org.graalvm.compiler.nodes.cfg.ControlFlowGraph; + +public class LoopsData { + + private Map, LoopEx> loopToEx = CollectionsFactory.newIdentityMap(); + private Map loopBeginToEx = Node.newIdentityMap(); + private ControlFlowGraph cfg; + + @SuppressWarnings("try") + public LoopsData(final StructuredGraph graph) { + try (Scope s = Debug.scope("ControlFlowGraph")) { + cfg = ControlFlowGraph.compute(graph, true, true, true, true); + } catch (Throwable e) { + throw Debug.handle(e); + } + + for (Loop loop : cfg.getLoops()) { + LoopEx ex = new LoopEx(loop, this); + loopToEx.put(loop, ex); + loopBeginToEx.put(ex.loopBegin(), ex); + } + } + + public LoopEx loop(Loop loop) { + return loopToEx.get(loop); + } + + public LoopEx loop(LoopBeginNode loopBegin) { + return loopBeginToEx.get(loopBegin); + } + + public Collection loops() { + return loopToEx.values(); + } + + public List outerFirst() { + ArrayList loops = new ArrayList<>(loops()); + Collections.sort(loops, new Comparator() { + + @Override + public int compare(LoopEx o1, LoopEx o2) { + return o1.loop().getDepth() - o2.loop().getDepth(); + } + }); + return loops; + } + + public List innerFirst() { + ArrayList loops = new ArrayList<>(loops()); + Collections.sort(loops, new Comparator() { + + @Override + public int compare(LoopEx o1, LoopEx o2) { + return o2.loop().getDepth() - o1.loop().getDepth(); + } + }); + return loops; + } + + public Collection countedLoops() { + List counted = new LinkedList<>(); + for (LoopEx loop : loops()) { + if (loop.isCounted()) { + counted.add(loop); + } + } + return counted; + } + + public void detectedCountedLoops() { + for (LoopEx loop : loops()) { + loop.detectCounted(); + } + } + + public ControlFlowGraph getCFG() { + return cfg; + } + + public InductionVariable getInductionVariable(ValueNode value) { + InductionVariable match = null; + for (LoopEx loop : loops()) { + InductionVariable iv = loop.getInductionVariables().get(value); + if (iv != null) { + if (match != null) { + return null; + } + match = iv; + } + } + return match; + } + + /** + * Deletes any nodes created within the scope of this object that have no usages. + */ + public void deleteUnusedNodes() { + for (LoopEx loop : loops()) { + loop.deleteUnusedNodes(); + } + } +}