1/*
2 * Copyright (c) 2014, 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.graph;
24
25import java.util.ConcurrentModificationException;
26
27class NodeUsageWithModCountIterator extends NodeUsageIterator {
28
29    NodeUsageWithModCountIterator(Node n) {
30        super(n);
31    }
32
33    private final int expectedModCount = node.usageModCount();
34
35    @Override
36    public boolean hasNext() {
37        if (expectedModCount != node.usageModCount()) {
38            throw new ConcurrentModificationException();
39        }
40        return super.hasNext();
41    }
42
43    @Override
44    public Node next() {
45        if (expectedModCount != node.usageModCount()) {
46            throw new ConcurrentModificationException();
47        }
48        return super.next();
49    }
50}
51