001/*
002 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation.
008 *
009 * This code is distributed in the hope that it will be useful, but WITHOUT
010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
011 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
012 * version 2 for more details (a copy is included in the LICENSE file that
013 * accompanied this code).
014 *
015 * You should have received a copy of the GNU General Public License version
016 * 2 along with this work; if not, write to the Free Software Foundation,
017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
018 *
019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
020 * or visit www.oracle.com if you need additional information or have any
021 * questions.
022 */
023package com.oracle.graal.graph;
024
025import java.util.*;
026
027class NodeUsageWithModCountIterator extends NodeUsageIterator {
028
029    public NodeUsageWithModCountIterator(Node n) {
030        super(n);
031    }
032
033    private final int expectedModCount = node.usageModCount();
034
035    @Override
036    public boolean hasNext() {
037        if (expectedModCount != node.usageModCount()) {
038            throw new ConcurrentModificationException();
039        }
040        return super.hasNext();
041    }
042
043    @Override
044    public Node next() {
045        if (expectedModCount != node.usageModCount()) {
046            throw new ConcurrentModificationException();
047        }
048        return super.next();
049    }
050}