Mercurial > hg > graal-jvmci-8
view graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerArithmeticNode.java @ 5507:dc71b06d09f8
Moving classes from cri.ri to api.meta.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 07 Jun 2012 18:24:06 +0200 |
parents | 452f91ebdb54 |
children | a891c53a295b |
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.graph.*; import com.oracle.graal.nodes.*; public abstract class IntegerArithmeticNode extends ArithmeticNode { public IntegerArithmeticNode(RiKind kind, ValueNode x, ValueNode y) { super(kind, x, y, false); assert kind == RiKind.Int || kind == RiKind.Long; } public static IntegerAddNode add(ValueNode v1, ValueNode v2) { assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); Graph graph = v1.graph(); switch(v1.kind()) { case Int: return graph.unique(new IntegerAddNode(RiKind.Int, v1, v2)); case Long: return graph.unique(new IntegerAddNode(RiKind.Long, v1, v2)); default: throw ValueUtil.shouldNotReachHere(); } } public static IntegerMulNode mul(ValueNode v1, ValueNode v2) { assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); Graph graph = v1.graph(); switch(v1.kind()) { case Int: return graph.unique(new IntegerMulNode(RiKind.Int, v1, v2)); case Long: return graph.unique(new IntegerMulNode(RiKind.Long, v1, v2)); default: throw ValueUtil.shouldNotReachHere(); } } }