Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/ShortCircuitBooleanNode.java @ 11409:1f302b6e16b0
Introduce LogicNegationNode and remove Negatable interface.
author | Roland Schatz <roland.schatz@oracle.com> |
---|---|
date | Sat, 24 Aug 2013 14:38:11 +0200 |
parents | ec4c7c33e8e5 |
children |
line wrap: on
line source
/* * Copyright (c) 2013, 2013, 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.graph.*; /** * Base class for the short-circuit boolean operators. */ public abstract class ShortCircuitBooleanNode extends LogicNode implements Node.IterableNodeType { @Input private LogicNode x; @Input private LogicNode y; private boolean xNegated; private boolean yNegated; private double shortCircuitProbability; public ShortCircuitBooleanNode(LogicNode x, boolean xNegated, LogicNode y, boolean yNegated, double shortCircuitProbability) { this.x = x; this.xNegated = xNegated; this.y = y; this.yNegated = yNegated; this.shortCircuitProbability = shortCircuitProbability; } public LogicNode getX() { return x; } public LogicNode getY() { return y; } public boolean isXNegated() { return xNegated; } public boolean isYNegated() { return yNegated; } /** * Gets the probability that the {@link #getY() y} part of this binary node is <b>not</b> * evaluated. This is the probability that this operator will short-circuit its execution. */ public double getShortCircuitProbability() { return shortCircuitProbability; } protected abstract ShortCircuitBooleanNode createCopy(LogicNode xCond, boolean xNeg, LogicNode yCond, boolean yNeg, double probability); protected ShortCircuitBooleanNode canonicalizeNegation() { LogicNode xCond = x; boolean xNeg = xNegated; while (xCond instanceof LogicNegationNode) { xCond = ((LogicNegationNode) xCond).getInput(); xNeg = !xNeg; } LogicNode yCond = y; boolean yNeg = yNegated; while (yCond instanceof LogicNegationNode) { yCond = ((LogicNegationNode) yCond).getInput(); yNeg = !yNeg; } if (xCond != x || yCond != y) { return graph().unique(createCopy(xCond, xNeg, yCond, yNeg, shortCircuitProbability)); } else { return null; } } }