|
| 1 | +/* |
| 2 | + * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved. |
| 3 | + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | + * |
| 5 | + * The Universal Permissive License (UPL), Version 1.0 |
| 6 | + * |
| 7 | + * Subject to the condition set forth below, permission is hereby granted to any |
| 8 | + * person obtaining a copy of this software, associated documentation and/or |
| 9 | + * data (collectively the "Software"), free of charge and under any and all |
| 10 | + * copyright rights in the Software, and any and all patent rights owned or |
| 11 | + * freely licensable by each licensor hereunder covering either (i) the |
| 12 | + * unmodified Software as contributed to or provided by such licensor, or (ii) |
| 13 | + * the Larger Works (as defined below), to deal in both |
| 14 | + * |
| 15 | + * (a) the Software, and |
| 16 | + * |
| 17 | + * (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if |
| 18 | + * one is included with the Software each a "Larger Work" to which the Software |
| 19 | + * is contributed by such licensors), |
| 20 | + * |
| 21 | + * without restriction, including without limitation the rights to copy, create |
| 22 | + * derivative works of, display, perform, and distribute the Software and make, |
| 23 | + * use, sell, offer for sale, import, export, have made, and have sold the |
| 24 | + * Software and the Larger Work(s), and to sublicense the foregoing rights on |
| 25 | + * either these or other terms. |
| 26 | + * |
| 27 | + * This license is subject to the following condition: |
| 28 | + * |
| 29 | + * The above copyright notice and either this complete permission notice or at a |
| 30 | + * minimum a reference to the UPL must be included in all copies or substantial |
| 31 | + * portions of the Software. |
| 32 | + * |
| 33 | + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 34 | + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 35 | + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 36 | + * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 37 | + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| 38 | + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 39 | + * SOFTWARE. |
| 40 | + */ |
| 41 | + |
| 42 | +package com.oracle.graal.python.builtins.modules; |
| 43 | + |
| 44 | +import com.oracle.graal.python.builtins.Builtin; |
| 45 | +import com.oracle.graal.python.builtins.CoreFunctions; |
| 46 | +import com.oracle.graal.python.builtins.PythonBuiltins; |
| 47 | +import com.oracle.graal.python.builtins.objects.PNone; |
| 48 | +import com.oracle.graal.python.builtins.objects.ints.PInt; |
| 49 | +import com.oracle.graal.python.nodes.SpecialMethodNames; |
| 50 | +import com.oracle.graal.python.nodes.call.special.LookupAndCallUnaryNode; |
| 51 | +import com.oracle.graal.python.nodes.function.PythonBuiltinBaseNode; |
| 52 | +import com.oracle.graal.python.nodes.function.builtins.PythonBinaryBuiltinNode; |
| 53 | +import com.oracle.graal.python.nodes.function.builtins.PythonUnaryBuiltinNode; |
| 54 | +import com.oracle.graal.python.nodes.truffle.PythonArithmeticTypes; |
| 55 | +import com.oracle.truffle.api.CompilerDirectives; |
| 56 | +import com.oracle.truffle.api.CompilerDirectives.TruffleBoundary; |
| 57 | +import com.oracle.truffle.api.dsl.Fallback; |
| 58 | +import com.oracle.truffle.api.dsl.GenerateNodeFactory; |
| 59 | +import com.oracle.truffle.api.dsl.NodeFactory; |
| 60 | +import com.oracle.truffle.api.dsl.Specialization; |
| 61 | +import com.oracle.truffle.api.dsl.TypeSystemReference; |
| 62 | +import java.math.BigInteger; |
| 63 | +import java.util.List; |
| 64 | + |
| 65 | +@CoreFunctions(defineModule = OperatorModuleBuiltins.MODULE_NAME) |
| 66 | +public class OperatorModuleBuiltins extends PythonBuiltins { |
| 67 | + |
| 68 | + protected static final String MODULE_NAME = "_operator"; |
| 69 | + |
| 70 | + @Override |
| 71 | + protected List<? extends NodeFactory<? extends PythonBuiltinBaseNode>> getNodeFactories() { |
| 72 | + return OperatorModuleBuiltinsFactory.getFactories(); |
| 73 | + } |
| 74 | + |
| 75 | + @Builtin(name = "truth", fixedNumOfPositionalArgs = 1) |
| 76 | + @TypeSystemReference(PythonArithmeticTypes.class) |
| 77 | + @GenerateNodeFactory |
| 78 | + public abstract static class TruthNode extends PythonUnaryBuiltinNode { |
| 79 | + |
| 80 | + @Specialization |
| 81 | + public boolean doBoolean(boolean value) { |
| 82 | + return value; |
| 83 | + } |
| 84 | + |
| 85 | + @Specialization |
| 86 | + public boolean doNone(@SuppressWarnings("unused") PNone value) { |
| 87 | + return false; |
| 88 | + } |
| 89 | + |
| 90 | + @Specialization |
| 91 | + public boolean doInt(long value) { |
| 92 | + return value != 0; |
| 93 | + } |
| 94 | + |
| 95 | + @Specialization |
| 96 | + @TruffleBoundary |
| 97 | + public boolean doPInt(PInt value) { |
| 98 | + return !value.getValue().equals(BigInteger.ZERO); |
| 99 | + } |
| 100 | + |
| 101 | + @Specialization |
| 102 | + public boolean doDouble(double value) { |
| 103 | + return value != 0; |
| 104 | + } |
| 105 | + |
| 106 | + @Specialization |
| 107 | + public boolean doString(String value) { |
| 108 | + return !value.isEmpty(); |
| 109 | + } |
| 110 | + |
| 111 | + private @Child LookupAndCallUnaryNode boolNode; |
| 112 | + private @Child LookupAndCallUnaryNode lenNode; |
| 113 | + |
| 114 | + @Fallback |
| 115 | + public boolean doObject(Object value) { |
| 116 | + if (boolNode == null) { |
| 117 | + CompilerDirectives.transferToInterpreterAndInvalidate(); |
| 118 | + boolNode = insert((LookupAndCallUnaryNode.create(SpecialMethodNames.__BOOL__))); |
| 119 | + } |
| 120 | + Object result = boolNode.executeObject(value); |
| 121 | + if (result != PNone.NO_VALUE) { |
| 122 | + return (boolean) result; |
| 123 | + } |
| 124 | + if (lenNode == null) { |
| 125 | + CompilerDirectives.transferToInterpreterAndInvalidate(); |
| 126 | + lenNode = insert((LookupAndCallUnaryNode.create(SpecialMethodNames.__LEN__))); |
| 127 | + } |
| 128 | + |
| 129 | + result = lenNode.executeObject(value); |
| 130 | + if (result == PNone.NO_VALUE) { |
| 131 | + return false; |
| 132 | + } |
| 133 | + return (int) result != 0; |
| 134 | + } |
| 135 | + } |
| 136 | + |
| 137 | + // _compare_digest |
| 138 | + @Builtin(name = "_compare_digest", fixedNumOfPositionalArgs = 2) |
| 139 | + @TypeSystemReference(PythonArithmeticTypes.class) |
| 140 | + @GenerateNodeFactory |
| 141 | + public abstract static class CompareDigestNode extends PythonBinaryBuiltinNode { |
| 142 | + |
| 143 | + @Specialization |
| 144 | + public boolean doString(String arg1, String arg2) { |
| 145 | + return arg1.equals(arg2); |
| 146 | + } |
| 147 | + |
| 148 | + } |
| 149 | +} |
0 commit comments