1/* 2 * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. 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 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23package org.graalvm.compiler.loop.phases; 24 25import org.graalvm.compiler.debug.Debug; 26import org.graalvm.compiler.debug.DebugCounter; 27import org.graalvm.compiler.loop.LoopEx; 28import org.graalvm.compiler.loop.LoopPolicies; 29import org.graalvm.compiler.loop.LoopsData; 30import org.graalvm.compiler.nodes.StructuredGraph; 31import org.graalvm.compiler.phases.common.CanonicalizerPhase; 32import org.graalvm.compiler.phases.tiers.PhaseContext; 33 34public class LoopFullUnrollPhase extends LoopPhase<LoopPolicies> { 35 36 private static final DebugCounter FULLY_UNROLLED_LOOPS = Debug.counter("FullUnrolls"); 37 private final CanonicalizerPhase canonicalizer; 38 39 public LoopFullUnrollPhase(CanonicalizerPhase canonicalizer, LoopPolicies policies) { 40 super(policies); 41 this.canonicalizer = canonicalizer; 42 } 43 44 @Override 45 protected void run(StructuredGraph graph, PhaseContext context) { 46 if (graph.hasLoops()) { 47 boolean peeled; 48 do { 49 peeled = false; 50 final LoopsData dataCounted = new LoopsData(graph); 51 dataCounted.detectedCountedLoops(); 52 for (LoopEx loop : dataCounted.countedLoops()) { 53 if (getPolicies().shouldFullUnroll(loop)) { 54 Debug.log("FullUnroll %s", loop); 55 LoopTransformations.fullUnroll(loop, context, canonicalizer); 56 FULLY_UNROLLED_LOOPS.increment(); 57 Debug.dump(Debug.INFO_LOG_LEVEL, graph, "FullUnroll %s", loop); 58 peeled = true; 59 break; 60 } 61 } 62 dataCounted.deleteUnusedNodes(); 63 } while (peeled); 64 } 65 } 66 67 @Override 68 public boolean checkContract() { 69 return false; 70 } 71} 72