Mercurial > hg > truffle
view graal/com.oracle.max.graal.nodes/src/com/oracle/max/graal/nodes/FixedGuardNode.java @ 4309:4a609a685fa4
changes to Node structures:
* add more uses of higher-level graph manipulation methods
* CanonicalierPhase cleanup
* introduce FloatingReadNode, make ReadNode an ordinary fixed nodeToBlock
* let Canonicalizable.canonical return ValueNode (instead of Node)
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Tue, 17 Jan 2012 19:45:39 +0100 |
parents | 0768bf0a4898 |
children | 72d099e5be61 |
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.max.graal.nodes; import com.oracle.max.graal.cri.*; import com.oracle.max.graal.graph.*; import com.oracle.max.graal.nodes.DeoptimizeNode.DeoptAction; import com.oracle.max.graal.nodes.spi.*; import com.oracle.max.graal.nodes.type.*; public final class FixedGuardNode extends FixedWithNextNode implements Canonicalizable, Lowerable, LIRLowerable { @Input private final NodeInputList<BooleanNode> conditions; public FixedGuardNode(BooleanNode condition) { super(StampFactory.illegal()); this.conditions = new NodeInputList<>(this, new BooleanNode[] {condition}); } @Override public void generate(LIRGeneratorTool gen) { for (BooleanNode condition : conditions()) { gen.emitGuardCheck(condition); } } public void addCondition(BooleanNode x) { conditions.add(x); } public NodeInputList<BooleanNode> conditions() { return conditions; } @Override public ValueNode canonical(CanonicalizerTool tool) { for (BooleanNode n : conditions.snapshot()) { if (n instanceof ConstantNode) { ConstantNode c = (ConstantNode) n; if (c.asConstant().asBoolean()) { conditions.remove(n); } else { FixedNode next = this.next(); if (next != null) { tool.deleteBranch(next); } return graph().add(new DeoptimizeNode(DeoptAction.InvalidateRecompile)); } } } if (conditions.isEmpty()) { return next(); } return this; } @Override public void lower(CiLoweringTool tool) { AnchorNode newAnchor = graph().add(new AnchorNode()); for (BooleanNode b : conditions) { newAnchor.addGuard((GuardNode) tool.createGuard(b)); } ((StructuredGraph) graph()).replaceFixedWithFixed(this, newAnchor); } }