Mercurial > hg > graal-compiler
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/FixedGuardNode.java @ 5563:6a2671066204
added NewInstanceSnippets for lowering NewInstanceNodes (currently disabled by default)
added Word type and WordTypeRewriterPhase to support programming against machine word values in snippets without duplicating the code for 32 and 64 bit platforms
added GraphUtil.approxSourceLocation() utility method for getting an approximate source code location for a node
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Mon, 11 Jun 2012 15:39:57 +0200 |
parents | b6617d13ea44 |
children | 8e098bf83c95 6c3a5ccec483 |
line wrap: on
line source
/* * Copyright (c) 2011, 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; import com.oracle.graal.api.code.*; import com.oracle.graal.api.meta.*; import com.oracle.graal.cri.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; public final class FixedGuardNode extends FixedWithNextNode implements Simplifiable, Lowerable, LIRLowerable, Node.IterableNodeType, Negatable { @Input private BooleanNode condition; private final DeoptimizationReason deoptReason; private final DeoptimizationAction action; private boolean negated; private final long leafGraphId; public BooleanNode condition() { return condition; } public void setCondition(BooleanNode x) { updateUsages(condition, x); condition = x; } public FixedGuardNode(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, long leafGraphId) { this(condition, deoptReason, action, false, leafGraphId); } public FixedGuardNode(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated, long leafGraphId) { super(StampFactory.forVoid()); this.action = action; this.negated = negated; this.leafGraphId = leafGraphId; this.condition = condition; this.deoptReason = deoptReason; } @Override public String toString(Verbosity verbosity) { if (verbosity == Verbosity.Name && negated) { return "!" + super.toString(verbosity); } else { return super.toString(verbosity); } } @Override public void generate(LIRGeneratorTool gen) { gen.emitGuardCheck(condition, deoptReason, action, negated, leafGraphId); } @Override public void simplify(SimplifierTool tool) { if (condition instanceof ConstantNode) { ConstantNode c = (ConstantNode) condition; if (c.asConstant().asBoolean() != negated) { ((StructuredGraph) graph()).removeFixed(this); } else { FixedNode next = this.next(); if (next != null) { tool.deleteBranch(next); } setNext(graph().add(new DeoptimizeNode(DeoptimizationAction.InvalidateRecompile, deoptReason, leafGraphId))); return; } } } @Override public void lower(CiLoweringTool tool) { AnchorNode newAnchor = graph().add(new AnchorNode()); newAnchor.dependencies().add(tool.createGuard(condition, deoptReason, action, negated, leafGraphId)); ((StructuredGraph) graph()).replaceFixedWithFixed(this, newAnchor); } @Override public Negatable negate() { negated = !negated; return this; } }