1 /* 2 * Copyright (c) 2012, 2012, 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 package org.graalvm.compiler.loop; 24 25 import org.graalvm.compiler.graph.NodeBitMap; 26 import org.graalvm.compiler.nodes.FixedNode; 27 28 public class LoopFragmentInsideBefore extends LoopFragmentInside { 29 30 private final FixedNode point; 31 32 public LoopFragmentInsideBefore(LoopEx loop, FixedNode point) { 33 super(loop); 34 this.point = point; 35 } 36 37 // duplicates lazily 38 public LoopFragmentInsideBefore(LoopFragmentInsideBefore original) { 39 super(original); 40 this.point = original.point(); 41 } 42 43 public FixedNode point() { 44 return point; 45 } 46 47 @Override 48 public LoopFragmentInsideBefore duplicate() { 49 return new LoopFragmentInsideBefore(this); 50 } 51 52 @Override 53 public NodeBitMap nodes() { 54 return null; 55 } 56 }