/*
 * Copyright (c) 2013, 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.phases;

import java.util.*;

import com.oracle.graal.nodes.*;

/**
 * A compiler phase that can apply an ordered collection of phases to a graph.
 */
public class PhaseSuite<C> extends BasePhase<C> {

    private final List<BasePhase<? super C>> phases;

    public PhaseSuite() {
        this.phases = new ArrayList<>();
    }

    /**
     * Add a new phase at the beginning of this suite.
     */
    public final void prependPhase(BasePhase<? super C> phase) {
        phases.add(0, phase);
    }

    /**
     * Add a new phase at the end of this suite.
     */
    public final void appendPhase(BasePhase<? super C> phase) {
        phases.add(phase);
    }

    public final ListIterator<BasePhase<? super C>> findPhase(Class<? extends BasePhase<? super C>> phaseClass) {
        ListIterator<BasePhase<? super C>> it = phases.listIterator();
        findNextPhase(it, phaseClass);
        return it;
    }

    public static <C> void findNextPhase(ListIterator<BasePhase<? super C>> it, Class<? extends BasePhase<? super C>> phaseClass) {
        while (it.hasNext()) {
            BasePhase<? super C> phase = it.next();
            if (phaseClass.isInstance(phase)) {
                break;
            }
        }
    }

    @Override
    protected void run(StructuredGraph graph, C context) {
        for (BasePhase<? super C> phase : phases) {
            phase.apply(graph, context);
        }
    }

    public PhaseSuite<C> copy() {
        PhaseSuite<C> suite = new PhaseSuite<>();
        suite.phases.addAll(phases);
        return suite;
    }
}

@@ -1928,16 +1928,20 @@
         
+if (
 findNext
@@ -1961,26 +1961,30 @@
 seClass)
-;%0A
+) %7B%0A  
         
 return i
@@ -1971,24 +1971,26 @@
 %7B%0A          
+  
 return it;%0A 
@@ -1988,16 +1988,68 @@
 urn it;%0A
+        %7D else %7B%0A            return null;%0A        %7D%0A
     %7D%0A%0A 
@@ -2069,20 +2069,23 @@
 tic %3CC%3E 
-void
+boolean
  findNex
@@ -2333,13 +2333,19 @@
     
-b
 re
-ak
+turn true
 ;%0A  
@@ -2358,32 +2358,54 @@
     %7D%0A        %7D%0A
+        return false;%0A
     %7D%0A%0A    @Over

return null if phase is not found in PhaseSuite.findPhase