| /* |
| * Copyright (c) 2012, 2012, Oracle and/or its affiliates. All rights reserved. |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| * |
| * This code is free software; you can redistribute it and/or modify it |
| * under the terms of the GNU General Public License version 2 only, as |
| * published by the Free Software Foundation. |
| * |
| * This code is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| * version 2 for more details (a copy is included in the LICENSE file that |
| * accompanied this code). |
| * |
| * You should have received a copy of the GNU General Public License version |
| * 2 along with this work; if not, write to the Free Software Foundation, |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| * |
| * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| * or visit www.oracle.com if you need additional information or have any |
| * questions. |
| */ |
| package org.graalvm.compiler.loop; |
| |
| import org.graalvm.compiler.graph.NodeBitMap; |
| import org.graalvm.compiler.nodes.FixedNode; |
| |
| public class LoopFragmentInsideFrom extends LoopFragmentInside { |
| |
| private final FixedNode point; |
| |
| public LoopFragmentInsideFrom(LoopEx loop, FixedNode point) { |
| super(loop); |
| this.point = point; |
| } |
| |
| // duplicates lazily |
| public LoopFragmentInsideFrom(LoopFragmentInsideFrom original) { |
| super(original); |
| this.point = original.point(); |
| } |
| |
| public FixedNode point() { |
| return point; |
| } |
| |
| @Override |
| public LoopFragmentInsideFrom duplicate() { |
| return new LoopFragmentInsideFrom(this); |
| } |
| |
| @Override |
| public NodeBitMap nodes() { |
| return null; |
| } |
| } |