NodeSuccessorList.java revision 12657:6ef01bd40ce2 
1/*
2 * Copyright (c) 2011, 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 static org.graalvm.compiler.graph.Edges.Type.Successors;
26
27import java.util.List;
28
29import org.graalvm.compiler.graph.Edges.Type;
30
31public final class NodeSuccessorList<T extends Node> extends NodeList<T> {
32
33    public NodeSuccessorList(Node self, int initialSize) {
34        super(self, initialSize);
35    }
36
37    protected NodeSuccessorList(Node self) {
38        super(self);
39    }
40
41    public NodeSuccessorList(Node self, T[] elements) {
42        super(self, elements);
43        assert self.hasNoUsages();
44    }
45
46    public NodeSuccessorList(Node self, List<? extends T> elements) {
47        super(self, elements);
48        assert self.hasNoUsages();
49    }
50
51    @Override
52    protected void update(T oldNode, T newNode) {
53        self.updatePredecessor(oldNode, newNode);
54    }
55
56    @Override
57    public Type getEdgesType() {
58        return Successors;
59    }
60}
61