/*
 * Copyright (c) 2011, 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.nodes.util;

import java.util.*;

import com.oracle.graal.graph.iterators.*;
import com.oracle.graal.nodes.*;

public class NodeIterators {

    public static NodeIterable<FixedNode> dominators(final FixedNode n) {
        return new AbstractNodeIterable<FixedNode>() {

            @Override
            public Iterator<FixedNode> iterator() {
                return new NodeIterator<FixedNode>() {

                    FixedNode p = n;

                    @Override
                    protected void forward() {
                        if (current == null) {
                            if (p instanceof MergeNode) {
                                current = new ComputeImmediateDominator((MergeNode) p).compute();
                            } else {
                                current = (FixedNode) p.predecessor();
                            }
                            p = current;
                        }
                    }
                };
            }
        };
    }
}