Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/NodeLIRBuilderTool.java @ 15145:df2ef5204f2b
Remove AbstractBeginNode, move the framestate from AbstractBeginNode to BeginStateSplitNode.
This required some changes to loop transformations: when peeling don't create duplicates for the exit proxies.
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Mon, 14 Apr 2014 15:21:27 +0200 |
parents | 2ee777221036 |
children | e4d6c613d552 |
line wrap: on
line source
/* * Copyright (c) 2011, 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 com.oracle.graal.nodes.spi; import java.util.*; import com.oracle.graal.api.code.*; import com.oracle.graal.api.meta.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.calc.*; import com.oracle.graal.nodes.extended.*; public interface NodeLIRBuilderTool extends NodeMappableLIRBuilder { void emitNullCheck(ValueNode v, DeoptimizingNode deopting); void emitIf(IfNode i); void emitConditional(ConditionalNode i); void emitSwitch(SwitchNode i); void emitInvoke(Invoke i); // Handling of block-end nodes still needs to be unified in the LIRGenerator. void visitMerge(MergeNode i); void visitEndNode(AbstractEndNode i); void visitLoopEnd(LoopEndNode i); // These methods define the contract a runtime specific backend must provide. void visitSafepointNode(SafepointNode i); void visitBreakpointNode(BreakpointNode i); void visitInfopointNode(InfopointNode i); LIRGeneratorTool getLIRGeneratorTool(); void emitOverflowCheckBranch(BeginNode overflowSuccessor, BeginNode next, double probability); Value[] visitInvokeArguments(CallingConvention cc, Collection<ValueNode> arguments); MemoryArithmeticLIRLowerer getMemoryLowerer(); }