/*
 * Copyright (c) 2018, 2020, 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.js.nodes.interop;

import com.oracle.truffle.api.CompilerDirectives;
import com.oracle.truffle.api.nodes.ExplodeLoop;
import com.oracle.truffle.js.nodes.JavaScriptBaseNode;

public abstract class ExportArgumentsNode extends JavaScriptBaseNode {
    private static final int MAX_FIXED = 250;

    public abstract Object[] export(Object[] extractedUserArguments);

    public static ExportArgumentsNode create(int expectedLength) {
        final class VariableLength extends ExportArgumentsNode {
            @Child private ExportValueNode exportNode = ExportValueNode.create();

            @Override
            public Object[] export(Object[] extractedUserArguments) {
                for (int i = 0; i < extractedUserArguments.length; i++) {
                    extractedUserArguments[i] = exportNode.execute(extractedUserArguments[i]);
                }
                return extractedUserArguments;
            }
        }

        final class FixedLength extends ExportArgumentsNode {
            @Children private final ExportValueNode[] exportNodes;

            FixedLength(int userArgumentCount) {
                ExportValueNode[] exportNodeArray = new ExportValueNode[userArgumentCount];
                for (int i = 0; i < exportNodeArray.length; i++) {
                    exportNodeArray[i] = ExportValueNode.create();
                }
                this.exportNodes = exportNodeArray;
            }

            @ExplodeLoop
            @Override
            public Object[] export(Object[] extractedUserArguments) {
                if (extractedUserArguments.length == exportNodes.length) {
                    for (int i = 0; i < exportNodes.length; i++) {
                        extractedUserArguments[i] = exportNodes[i].execute(extractedUserArguments[i]);
                    }
                    return extractedUserArguments;
                } else {
                    CompilerDirectives.transferToInterpreterAndInvalidate();
                    return replace(new VariableLength()).export(extractedUserArguments);
                }
            }
        }

        if (expectedLength >= 0 && expectedLength <= MAX_FIXED) {
            return new FixedLength(expectedLength);
        } else {
            return new VariableLength();
        }
    }
}