Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/FixedGuardNode.java @ 9498:d0b3fa50e306
lower FixedGuardNode to if-condition-deopt in after-guard lowering
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Tue, 30 Apr 2013 13:25:05 +0200 |
parents | e35cf6b23b34 |
children | 19c5a07c7843 |
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.graph.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; import com.oracle.graal.nodes.util.*; @NodeInfo(nameTemplate = "FixedGuard(!={p#negated}) {p#reason/s}") public final class FixedGuardNode extends FixedWithNextNode implements Simplifiable, Lowerable, Node.IterableNodeType, Negatable { @Input private LogicNode condition; private final DeoptimizationReason reason; private final DeoptimizationAction action; private boolean negated; public LogicNode condition() { return condition; } public void setCondition(LogicNode x) { updateUsages(condition, x); condition = x; } public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) { this(condition, deoptReason, action, false); } public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { super(StampFactory.forVoid()); this.action = action; this.negated = negated; this.condition = condition; this.reason = deoptReason; } public DeoptimizationReason getReason() { return reason; } public DeoptimizationAction getAction() { return action; } public boolean isNegated() { return negated; } @Override public String toString(Verbosity verbosity) { if (verbosity == Verbosity.Name && negated) { return "!" + super.toString(verbosity); } else { return super.toString(verbosity); } } @Override public void simplify(SimplifierTool tool) { if (condition instanceof LogicConstantNode) { LogicConstantNode c = (LogicConstantNode) condition; if (c.getValue() != negated) { ((StructuredGraph) graph()).removeFixed(this); } else { FixedNode next = this.next(); if (next != null) { tool.deleteBranch(next); } setNext(graph().add(new DeoptimizeNode(DeoptimizationAction.InvalidateRecompile, reason))); return; } } } @Override public void lower(LoweringTool tool, LoweringType loweringType) { if (loweringType == LoweringType.BEFORE_GUARDS) { tool.getRuntime().lower(this, tool); } else { FixedNode next = next(); setNext(null); DeoptimizeNode deopt = graph().add(new DeoptimizeNode(action, reason)); IfNode ifNode; if (negated) { ifNode = graph().add(new IfNode(condition, deopt, next, 0)); } else { ifNode = graph().add(new IfNode(condition, next, deopt, 1)); } ((FixedWithNextNode) predecessor()).setNext(ifNode); GraphUtil.killWithUnusedFloatingInputs(this); } } @Override public Negatable negate(LogicNode cond) { assert cond == condition(); negated = !negated; return this; } }