Mercurial > hg > truffle
view truffle/com.oracle.truffle.sl/src/com/oracle/truffle/sl/nodes/expression/demo/SLAddWithoutSpecializationNode.java @ 22548:6b76a24fffbd default tip
Use all variables: a, b, u,v and x, y
author | Jaroslav Tulach <jaroslav.tulach@oracle.com> |
---|---|
date | Thu, 14 Jan 2016 14:20:57 +0100 |
parents | dc83cc1f94f2 |
children |
line wrap: on
line source
/* * Copyright (c) 2012, 2014, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * The Universal Permissive License (UPL), Version 1.0 * * Subject to the condition set forth below, permission is hereby granted to any * person obtaining a copy of this software, associated documentation and/or * data (collectively the "Software"), free of charge and under any and all * copyright rights in the Software, and any and all patent rights owned or * freely licensable by each licensor hereunder covering either (i) the * unmodified Software as contributed to or provided by such licensor, or (ii) * the Larger Works (as defined below), to deal in both * * (a) the Software, and * * (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if * one is included with the Software each a "Larger Work" to which the Software * is contributed by such licensors), * * without restriction, including without limitation the rights to copy, create * derivative works of, display, perform, and distribute the Software and make, * use, sell, offer for sale, import, export, have made, and have sold the * Software and the Larger Work(s), and to sublicense the foregoing rights on * either these or other terms. * * This license is subject to the following condition: * * The above copyright notice and either this complete permission notice or at a * minimum a reference to the UPL must be included in all copies or substantial * portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ package com.oracle.truffle.sl.nodes.expression.demo; import com.oracle.truffle.api.ExactMath; import com.oracle.truffle.api.dsl.UnsupportedSpecializationException; import com.oracle.truffle.api.frame.VirtualFrame; import com.oracle.truffle.api.nodes.Node; import com.oracle.truffle.sl.nodes.SLExpressionNode; import com.oracle.truffle.sl.nodes.expression.SLAddNode; import java.math.BigInteger; /** * This is an example how the add operation would be implemented without specializations and without * the Truffle DSL. Do not write such code in your language! See {@link SLAddNode} how the add * operation is implemented correctly. */ public class SLAddWithoutSpecializationNode extends SLExpressionNode { @Child private SLExpressionNode leftNode; @Child private SLExpressionNode rightNode; public SLAddWithoutSpecializationNode(SLExpressionNode leftNode, SLExpressionNode rightNode) { super(null); this.leftNode = leftNode; this.rightNode = rightNode; } @Override public Object executeGeneric(VirtualFrame frame) { /* Evaluate the child nodes. */ Object left = leftNode.executeGeneric(frame); Object right = rightNode.executeGeneric(frame); if (left instanceof Long && right instanceof Long) { /* Fast path of the arbitrary-precision arithmetic. We need to check for overflows */ try { return ExactMath.addExact((Long) left, (Long) right); } catch (ArithmeticException ex) { /* Fall through to BigInteger case. */ } } /* Implicit type conversions. */ if (left instanceof Long) { left = BigInteger.valueOf((Long) left); } if (right instanceof Long) { right = BigInteger.valueOf((Long) right); } if (left instanceof BigInteger && right instanceof BigInteger) { /* Slow path of the arbitrary-precision arithmetic. */ return ((BigInteger) left).add((BigInteger) right); } /* String concatenation if either the left or the right operand is a String. */ if (left instanceof String || right instanceof String) { return left.toString() + right.toString(); } /* Type error. */ throw new UnsupportedSpecializationException(this, new Node[]{leftNode, rightNode}, new Object[]{left, right}); } }