Mercurial > hg > truffle
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/BinaryOpLogicNode.java @ 19602:d5042bcd422f
Remove isCommutative method from BinaryCommutative interface.
author | Roland Schatz <roland.schatz@oracle.com> |
---|---|
date | Fri, 27 Feb 2015 12:08:57 +0100 |
parents | b92530cb27df |
children | 2625f0dc7b48 |
line wrap: on
line source
/* * Copyright (c) 2011, 2014, 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.*; import com.oracle.graal.graph.spi.Canonicalizable.BinaryCommutative; import com.oracle.graal.nodeinfo.*; import com.oracle.graal.nodes.spi.*; @NodeInfo public abstract class BinaryOpLogicNode extends LogicNode implements LIRLowerable { public static final NodeClass<BinaryOpLogicNode> TYPE = NodeClass.create(BinaryOpLogicNode.class); @Input protected ValueNode x; @Input protected ValueNode y; public ValueNode getX() { return x; } public ValueNode getY() { return y; } public BinaryOpLogicNode(NodeClass<? extends BinaryOpLogicNode> c, ValueNode x, ValueNode y) { super(c); assert x != null && y != null && x.getKind() == y.getKind(); this.x = x; this.y = y; } @Override public boolean verify() { assertTrue(x.stamp().isCompatible(y.stamp()), "stamps not compatible: %s, %s", x.stamp(), y.stamp()); return super.verify(); } @Override public void generate(NodeLIRBuilderTool gen) { } /** * Ensure a canonical ordering of inputs for commutative nodes to improve GVN results. Order the * inputs by increasing {@link Node#id} and call {@link Graph#findDuplicate(Node)} on the node * if it's currently in a graph. * * @return the original node or another node with the same inputs, ignoring ordering. */ @SuppressWarnings("deprecation") public LogicNode maybeCommuteInputs() { assert this instanceof BinaryCommutative; if (x.getId() > y.getId()) { ValueNode tmp = x; x = y; y = tmp; if (graph() != null) { // See if this node already exists LogicNode duplicate = graph().findDuplicate(this); if (duplicate != null) { return duplicate; } } } return this; } }