Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerArithmeticNode.java @ 12655:2c4aa758ee18
made ConstantNodes external to a Graph (GRAAL-508)
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Sun, 03 Nov 2013 15:27:52 +0100 |
parents | 2ad1435489d1 |
children | 4aec62c32a82 |
line wrap: on
line source
/* * Copyright (c) 2011, 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.nodes.*; import com.oracle.graal.nodes.spi.*; public abstract class IntegerArithmeticNode extends BinaryNode implements ArithmeticLIRLowerable { public IntegerArithmeticNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y); assert kind == Kind.Int || kind == Kind.Long; } public static IntegerAddNode add(StructuredGraph graph, ValueNode v1, ValueNode v2) { assert v1.kind() == v2.kind(); switch (v1.kind()) { case Int: return graph.unique(new IntegerAddNode(Kind.Int, v1, v2)); case Long: return graph.unique(new IntegerAddNode(Kind.Long, v1, v2)); default: throw ValueNodeUtil.shouldNotReachHere(); } } public static IntegerMulNode mul(StructuredGraph graph, ValueNode v1, ValueNode v2) { assert v1.kind() == v2.kind(); switch (v1.kind()) { case Int: return graph.unique(new IntegerMulNode(Kind.Int, v1, v2)); case Long: return graph.unique(new IntegerMulNode(Kind.Long, v1, v2)); default: throw ValueNodeUtil.shouldNotReachHere(); } } public static IntegerSubNode sub(StructuredGraph graph, ValueNode v1, ValueNode v2) { assert v1.kind() == v2.kind(); switch (v1.kind()) { case Int: return graph.unique(new IntegerSubNode(Kind.Int, v1, v2)); case Long: return graph.unique(new IntegerSubNode(Kind.Long, v1, v2)); default: throw ValueNodeUtil.shouldNotReachHere(); } } }