/*
 * 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 com.oracle.graal.compiler.phases;

import java.util.*;

import com.oracle.graal.compiler.loop.*;
import com.oracle.graal.debug.*;
import com.oracle.graal.lir.cfg.*;
import com.oracle.graal.nodes.*;

public class LoopTransformPhase extends Phase {

    @Override
    protected void run(StructuredGraph graph) {
        if (graph.hasLoops()) {
            ControlFlowGraph cfg = ControlFlowGraph.compute(graph, true, true, false, false);
            Loop[] loops = cfg.getLoops();
            // outermost first
            Arrays.sort(loops, new Comparator<Loop>() {
                @Override
                public int compare(Loop o1, Loop o2) {
                    return o1.depth - o2.depth;
                }
            });
            for (Loop loop : loops) {
                LoopTransformUtil.peel(loop);
                Debug.dump(graph, "After peeling %s", loop);
            }
        }
    }


}