Mercurial > hg > graal-compiler
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/AndNode.java @ 5657:d71eb56d6bb0
new stamp inference in CanonicalizerPhase, IntegerStamp.mask
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Tue, 19 Jun 2012 20:03:06 +0200 |
parents | b0f511b40eee |
children | 4a6646d8eb87 |
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.calc; import com.oracle.graal.api.meta.*; import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; @NodeInfo(shortName = "&") public final class AndNode extends LogicNode implements Canonicalizable, LIRLowerable { public AndNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y); } @Override public boolean inferStamp() { return updateStamp(StampTool.and(x().integerStamp(), y().integerStamp())); } @Override public ValueNode canonical(CanonicalizerTool tool) { if (x() == y()) { return x(); } if (x().isConstant() && !y().isConstant()) { return graph().unique(new AndNode(kind(), y(), x())); } if (x().isConstant()) { if (kind() == Kind.Int) { return ConstantNode.forInt(x().asConstant().asInt() & y().asConstant().asInt(), graph()); } else { assert kind() == Kind.Long; return ConstantNode.forLong(x().asConstant().asLong() & y().asConstant().asLong(), graph()); } } else if (y().isConstant()) { if (kind() == Kind.Int) { int c = y().asConstant().asInt(); if (c == -1) { return x(); } if (c == 0) { return ConstantNode.forInt(0, graph()); } } else { assert kind() == Kind.Long; long c = y().asConstant().asLong(); if (c == -1) { return x(); } if (c == 0) { return ConstantNode.forLong(0, graph()); } } return BinaryNode.reassociate(this, ValueNode.isConstantPredicate()); } return this; } @Override public void generate(LIRGeneratorTool gen) { gen.setResult(this, gen.emitAnd(gen.operand(x()), gen.operand(y()))); } }