001/* 002 * Copyright (c) 2011, 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 static com.oracle.graal.graph.Edges.Type.*; 026 027import java.util.*; 028 029import com.oracle.graal.graph.Edges.Type; 030 031public final class NodeSuccessorList<T extends Node> extends NodeList<T> { 032 033 public NodeSuccessorList(Node self, int initialSize) { 034 super(self, initialSize); 035 } 036 037 protected NodeSuccessorList(Node self) { 038 super(self); 039 } 040 041 public NodeSuccessorList(Node self, T[] elements) { 042 super(self, elements); 043 assert self.hasNoUsages(); 044 } 045 046 public NodeSuccessorList(Node self, List<? extends T> elements) { 047 super(self, elements); 048 assert self.hasNoUsages(); 049 } 050 051 @Override 052 protected void update(T oldNode, T newNode) { 053 self.updatePredecessor(oldNode, newNode); 054 } 055 056 @Override 057 public Type getEdgesType() { 058 return Successors; 059 } 060}