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