/*

 * Copyright (c) 2010, 2013, 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.  Oracle designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Oracle in the LICENSE file that accompanied this code.

 *

 * 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 jdk.nashorn.internal.runtime;

import static jdk.nashorn.internal.lookup.Lookup.MH;

import static jdk.nashorn.internal.runtime.UnwarrantedOptimismException.INVALID_PROGRAM_POINT;

import static jdk.nashorn.internal.runtime.UnwarrantedOptimismException.isValid;

import java.lang.invoke.CallSite;

import java.lang.invoke.MethodHandle;

import java.lang.invoke.MethodHandles;

import java.lang.invoke.MethodType;

import java.lang.invoke.MutableCallSite;

import java.lang.invoke.SwitchPoint;

import java.util.Map;

import java.util.TreeMap;

import jdk.internal.dynalink.support.CatchExceptionCombinator;

import jdk.nashorn.internal.codegen.types.ArrayType;

import jdk.nashorn.internal.codegen.types.Type;

import jdk.nashorn.internal.ir.FunctionNode;

import jdk.nashorn.internal.runtime.linker.Bootstrap;

import jdk.nashorn.internal.runtime.options.Options;

/**

 * An version of a JavaScript function, native or JavaScript.

 * Supports lazily generating a constructor version of the invocation.

 */

final class CompiledFunction {

    private static final boolean USE_FAST_REWRITE = Options.getBooleanProperty("nashorn.fastrewrite");

    static {

        if(USE_FAST_REWRITE && CompiledFunction.class.getClassLoader() != null) {

            throw new AssertionError("-Dnashorn.fastrewrite can only be used with Nashorn in boot class path! (Try -Xbootclasspath/p:dist/nashorn.jar )");

        }

    }

    private static final MethodHandle NEWFILTER = findOwnMH("newFilter", Object.class, Object.class, Object.class);

    private static final MethodHandle RELINK_COMPOSABLE_INVOKER = findOwnMH("relinkComposableInvoker", void.class, CallSite.class, CompiledFunction.class, boolean.class);

    private static final MethodHandle HANDLE_REWRITE_EXCEPTION = findOwnMH("handleRewriteException", MethodHandle.class, CompiledFunction.class, OptimismInfo.class, RewriteException.class);

    private static final MethodHandle RESTOF_INVOKER = MethodHandles.exactInvoker(MethodType.methodType(Object.class, RewriteException.class));

    private static final DebugLogger LOG = new DebugLogger("recompile", "nashorn.codegen.debug");

    /**

     * The method type may be more specific than the invoker, if. e.g.

     * the invoker is guarded, and a guard with a generic object only

     * fallback, while the target is more specific, we still need the

     * more specific type for sorting

     */

    private MethodHandle invoker;

    private MethodHandle constructor;

    private OptimismInfo optimismInfo;

    CompiledFunction(final MethodHandle invoker) {

        this.invoker = invoker;

    }

    static CompiledFunction createBuiltInConstructor(final MethodHandle invoker) {

        return new CompiledFunction(MH.insertArguments(invoker, 0, false),

                createConstructorFromInvoker(MH.insertArguments(invoker, 0, true)));

    }

    CompiledFunction(final MethodHandle invoker, final MethodHandle constructor) {

        this(invoker);

        this.constructor = constructor;

    }

    CompiledFunction(final MethodHandle invoker, final RecompilableScriptFunctionData functionData, final boolean isOptimistic) {

        this(invoker);

        if(isOptimistic) {

            optimismInfo = new OptimismInfo(functionData);

        } else {

            optimismInfo = null;

        }

    }

    @Override

    public String toString() {

        return "<callSiteType=" + invoker.type() + " invoker=" + invoker + " ctor=" + constructor + " weight=" + weight() + ">";

    }

    boolean needsCallee() {

        return ScriptFunctionData.needsCallee(invoker);

    }

    /**

     * Returns an invoker method handle for this function. Note that the handle is safely composable in

     * the sense that you can compose it with other handles using any combinators even if you can't affect call site

     * invalidation. If this compiled function is non-optimistic, then it returns the same value as

     * {@link #getInvoker()}. However, if the function is optimistic, then this handle will incur an overhead as it will

     * add an intermediate internal call site that can relink itself when the function needs to regenerate its code to

     * always point at the latest generated code version.

     * @return a guaranteed composable invoker method handle for this function.

     */

    MethodHandle createComposableInvoker() {

        return createComposableInvoker(false);

    }

    /**

     * Returns an invoker method handle for this function when invoked as a constructor. Note that the handle should be

     * considered non-composable in the sense that you can only compose it with other handles using any combinators if

     * you can ensure that the composition is guarded by {@link #getOptimisticAssumptionsSwitchPoint()} if it's

     * non-null, and that you can relink the call site it is set into as a target if the switch point is invalidated. In

     * all other cases, use {@link #createComposableConstructor()}.

     * @return a direct constructor method handle for this function.

     */

    MethodHandle getConstructor() {

        if(constructor == null) {

            constructor = createConstructorFromInvoker(createInvokerForPessimisticCaller());

        }

        return constructor;

    }

    /**

     * Creates a version of the invoker intended for a pessimistic caller (return type is Object, no caller optimistic

     * program point available).

     * @return a version of the invoker intended for a pessimistic caller.

     */

    private MethodHandle createInvokerForPessimisticCaller() {

        return createInvoker(Object.class, INVALID_PROGRAM_POINT);

    }

    /**

     * Compose a constructor from an invoker.

     *

     * @param invoker         invoker

     * @param needsCallee  do we need to pass a callee

     *

     * @return the composed constructor

     */

    private static MethodHandle createConstructorFromInvoker(final MethodHandle invoker) {

        final boolean needsCallee = ScriptFunctionData.needsCallee(invoker);

        // If it was (callee, this, args...), permute it to (this, callee, args...). We're doing this because having

        // "this" in the first argument position is what allows the elegant folded composition of

        // (newFilter x constructor x allocator) further down below in the code. Also, ensure the composite constructor

        // always returns Object.

        final MethodHandle swapped = needsCallee ? swapCalleeAndThis(invoker) : invoker;

        final MethodHandle returnsObject = MH.asType(swapped, swapped.type().changeReturnType(Object.class));

        final MethodType ctorType = returnsObject.type();

        // Construct a dropping type list for NEWFILTER, but don't include constructor "this" into it, so it's actually

        // captured as "allocation" parameter of NEWFILTER after we fold the constructor into it.

        // (this, [callee, ]args...) => ([callee, ]args...)

        final Class<?>[] ctorArgs = ctorType.dropParameterTypes(0, 1).parameterArray();

        // Fold constructor into newFilter that replaces the return value from the constructor with the originally

        // allocated value when the originally allocated value is a JS primitive (String, Boolean, Number).

        // (result, this, [callee, ]args...) x (this, [callee, ]args...) => (this, [callee, ]args...)

        final MethodHandle filtered = MH.foldArguments(MH.dropArguments(NEWFILTER, 2, ctorArgs), returnsObject);

        // allocate() takes a ScriptFunction and returns a newly allocated ScriptObject...

        if (needsCallee) {

            // ...we either fold it into the previous composition, if we need both the ScriptFunction callee object and

            // the newly allocated object in the arguments, so (this, callee, args...) x (callee) => (callee, args...),

            // or...

            return MH.foldArguments(filtered, ScriptFunction.ALLOCATE);

        }

        // ...replace the ScriptFunction argument with the newly allocated object, if it doesn't need the callee

        // (this, args...) filter (callee) => (callee, args...)

        return MH.filterArguments(filtered, 0, ScriptFunction.ALLOCATE);

    }

    /**

     * Permutes the parameters in the method handle from {@code (callee, this, ...)} to {@code (this, callee, ...)}.

     * Used when creating a constructor handle.

     * @param mh a method handle with order of arguments {@code (callee, this, ...)}

     * @return a method handle with order of arguments {@code (this, callee, ...)}

     */

    private static MethodHandle swapCalleeAndThis(final MethodHandle mh) {

        final MethodType type = mh.type();

        assert type.parameterType(0) == ScriptFunction.class : type;

        assert type.parameterType(1) == Object.class : type;

        final MethodType newType = type.changeParameterType(0, Object.class).changeParameterType(1, ScriptFunction.class);

        final int[] reorder = new int[type.parameterCount()];

        reorder[0] = 1;

        assert reorder[1] == 0;

        for (int i = 2; i < reorder.length; ++i) {

            reorder[i] = i;

        }

        return MethodHandles.permuteArguments(mh, newType, reorder);

    }

    /**

     * Returns an invoker method handle for this function when invoked as a constructor. Note that the handle is safely

     * composable in the sense that you can compose it with other handles using any combinators even if you can't affect

     * call site invalidation. If this compiled function is non-optimistic, then it returns the same value as

     * {@link #getConstructor()}. However, if the function is optimistic, then this handle will incur an overhead as it

     * will add an intermediate internal call site that can relink itself when the function needs to regenerate its code

     * to always point at the latest generated code version.

     * @return a guaranteed composable constructor method handle for this function.

     */

    MethodHandle createComposableConstructor() {

        return createComposableInvoker(true);

    }

    boolean hasConstructor() {

        return constructor != null;

    }

    MethodType type() {

        return invoker.type();

    }

    int weight() {

        return weight(type());

    }

    private static int weight(final MethodType type) {

        if (isVarArgsType(type)) {

            return Integer.MAX_VALUE; //if there is a varargs it should be the heavist and last fallback

        }

        int weight = Type.typeFor(type.returnType()).getWeight();

        for (int i = 0 ; i < type.parameterCount() ; i++) {

            final Class<?> paramType = type.parameterType(i);

            final int pweight = Type.typeFor(paramType).getWeight() * 2; //params are more important than call types as return values are always specialized

            weight += pweight;

        }

        weight += type.parameterCount(); //more params outweigh few parameters

        return weight;

    }

    private static boolean isVarArgsType(final MethodType type) {

        assert type.parameterCount() >= 1 : type;

        return type.parameterType(type.parameterCount() - 1) == Object[].class;

    }

    static boolean moreGenericThan(final MethodType mt0, final MethodType mt1) {

        return weight(mt0) > weight(mt1);

    }

    boolean betterThanFinal(final CompiledFunction other, final MethodType callSiteMethodType) {

        // Prefer anything over nothing, as we can't compile new versions.

        if (other == null) {

            return true;

        }

        return betterThanFinal(type(), other.type(), callSiteMethodType);

    }

        final int thisParamCount = getParamCount(thisMethodType);

        final int otherParamCount = getParamCount(otherMethodType);

        final int callSiteRawParamCount = getParamCount(callSiteMethodType);

        final boolean csVarArg = callSiteRawParamCount == Integer.MAX_VALUE;

        // Subtract 1 for callee for non-vararg call sites

        final int callSiteParamCount = csVarArg ? callSiteRawParamCount : callSiteRawParamCount - 1;

        // Prefer the function that discards less parameters

        final int thisDiscardsParams = Math.max(callSiteParamCount - thisParamCount, 0);

        final int otherDiscardsParams = Math.max(callSiteParamCount - otherParamCount, 0);

        if(thisDiscardsParams < otherDiscardsParams) {

            return true;

        }

        if(thisDiscardsParams > otherDiscardsParams) {

            return false;

        }

        final boolean thisVarArg = thisParamCount == Integer.MAX_VALUE;

        final boolean otherVarArg = otherParamCount == Integer.MAX_VALUE;

        if(!(thisVarArg && otherVarArg && csVarArg)) {

            // At least one of them isn't vararg

            final Type[] thisType = toTypeWithoutCallee(thisMethodType, 0); // Never has callee

            final Type[] otherType = toTypeWithoutCallee(otherMethodType, 0); // Never has callee

            final Type[] callSiteType = toTypeWithoutCallee(callSiteMethodType, 1); // Always has callee

            int narrowWeightDelta = 0;

            int widenWeightDelta = 0;

            final int minParamsCount = Math.min(Math.min(thisParamCount, otherParamCount), callSiteParamCount);

            for(int i = 0; i < minParamsCount; ++i) {

                final int callSiteParamWeight = getParamType(i, callSiteType, csVarArg).getWeight();

                // Delta is negative for narrowing, positive for widening

                final int thisParamWeightDelta = getParamType(i, thisType, thisVarArg).getWeight() - callSiteParamWeight;

                final int otherParamWeightDelta = getParamType(i, otherType, otherVarArg).getWeight() - callSiteParamWeight;

                // Only count absolute values of narrowings

                narrowWeightDelta += Math.max(-thisParamWeightDelta, 0) - Math.max(-otherParamWeightDelta, 0);

                // Only count absolute values of widenings

                widenWeightDelta += Math.max(thisParamWeightDelta, 0) - Math.max(otherParamWeightDelta, 0);

            }

            // If both functions accept more arguments than what is passed at the call site, account for ability

            // to receive Undefined un-narrowed in the remaining arguments.

            if(!thisVarArg) {

                for(int i = callSiteParamCount; i < thisParamCount; ++i) {

                    narrowWeightDelta += Math.max(Type.OBJECT.getWeight() - thisType[i].getWeight(), 0);

                }

            }

            if(!otherVarArg) {

                for(int i = callSiteParamCount; i < otherParamCount; ++i) {

                    narrowWeightDelta -= Math.max(Type.OBJECT.getWeight() - otherType[i].getWeight(), 0);

                }

            }

            // Prefer function that narrows less

            if(narrowWeightDelta < 0) {

                return true;

            }

            if(narrowWeightDelta > 0) {

                return false;

            }

            // Prefer function that widens less

            if(widenWeightDelta < 0) {

                return true;

            }

            if(widenWeightDelta > 0) {

                return false;

            }

        }

        // Prefer the function that exactly matches the arity of the call site.

        if(thisParamCount == callSiteParamCount && otherParamCount != callSiteParamCount) {

            return true;

        }

        if(thisParamCount != callSiteParamCount && otherParamCount == callSiteParamCount) {

            return false;

        }

        // Otherwise, neither function matches arity exactly. We also know that at this point, they both can receive

        // more arguments than call site, otherwise we would've already chosen the one that discards less parameters.

        // Note that variable arity methods are preferred, as they actually match the call site arity better, since they

        // really have arbitrary arity.

        if(thisVarArg) {

            if(!otherVarArg) {

                return true; //

            }

        } else if(otherVarArg) {

            return false;

        }

        // Neither is variable arity; chose the one that has less extra parameters.

        final int fnParamDelta = thisParamCount - otherParamCount;

        if(fnParamDelta < 0) {

            return true;

        }

        if(fnParamDelta > 0) {

            return false;

        }

        final int callSiteRetWeight = Type.typeFor(callSiteMethodType.returnType()).getWeight();

        // Delta is negative for narrower return type, positive for wider return type

        final int thisRetWeightDelta = Type.typeFor(thisMethodType.returnType()).getWeight() - callSiteRetWeight;

        final int otherRetWeightDelta = Type.typeFor(otherMethodType.returnType()).getWeight() - callSiteRetWeight;

        // Prefer function that returns a less wide return type

        final int widenRetDelta = Math.max(thisRetWeightDelta, 0) - Math.max(otherRetWeightDelta, 0);

        if(widenRetDelta < 0) {

            return true;

        }

        if(widenRetDelta > 0) {

            return false;

        }

        // Prefer function that returns a less narrow return type

        final int narrowRetDelta = Math.max(-thisRetWeightDelta, 0) - Math.max(-otherRetWeightDelta, 0);

        if(narrowRetDelta < 0) {

            return true;

        }

        if(narrowRetDelta > 0) {

            return false;

        }

        throw new AssertionError(thisMethodType + " identically applicable to " + otherMethodType + " for " + callSiteMethodType); // Signatures are identical

    }

        final int paramCount = type.parameterCount();

        final Type[] t = new Type[paramCount - thisIndex];

        for(int i = thisIndex; i < paramCount; ++i) {

            t[i - thisIndex] = Type.typeFor(type.parameterType(i));

        }

        return t;

    }

        final int fixParamCount = paramTypes.length - (isVarArg ? 1 : 0);

        if(i < fixParamCount) {

            return paramTypes[i];

        }

        assert isVarArg;

        return ((ArrayType)(paramTypes[paramTypes.length - 1])).getElementType();

    }

    boolean matchesCallSite(final MethodType callSiteType) {

        if(!ScriptEnvironment.globalOptimistic()) {

            // Without optimistic recompilation, always choose the first eagerly compiled version.

            return true;

        }

        final MethodType type = type();

        final int fnParamCount = getParamCount(type);

        final boolean isVarArg = fnParamCount == Integer.MAX_VALUE;

        if(isVarArg) {

            return true;

        }

        final int csParamCount = getParamCount(callSiteType);

        final boolean csIsVarArg = csParamCount == Integer.MAX_VALUE;

        final int thisThisIndex = needsCallee() ? 1 : 0; // Index of "this" parameter in this function's type

        // We must match all incoming parameters, except "this". Starting from 1 to skip "this".

        for(int i = 1; i < minParams; ++i) {

            final Type fnType = Type.typeFor(type.parameterType(i + thisThisIndex));

            final Type csType = csIsVarArg ? Type.OBJECT : Type.typeFor(callSiteType.parameterType(i + 1));

            if(!fnType.isEquivalentTo(csType)) {

                return false;

            }

        }

        // Must match any undefined parameters to Object type.

        for(int i = minParams; i < fnParamCountNoCallee; ++i) {

            if(!Type.typeFor(type.parameterType(i + thisThisIndex)).isEquivalentTo(Type.OBJECT)) {

                return false;

            }

        }

        return true;

    }

    private static int getParamCount(final MethodType type) {

        final int paramCount = type.parameterCount();

        return type.parameterType(paramCount - 1).isArray() ? Integer.MAX_VALUE : paramCount;

    }

    /**

     * Returns the switch point embodying the optimistic assumptions in this compiled function. It should be used to

     * guard any linking to the function's invoker or constructor.

     * @return the switch point embodying the optimistic assumptions in this compiled function. Null is returned if the

     * function has no optimistic assumptions.

     */

    SwitchPoint getOptimisticAssumptionsSwitchPoint() {

        return isOptimistic() ? optimismInfo.optimisticAssumptions : null;

    }

    boolean isOptimistic() {

        return optimismInfo != null;

    }

        final MethodHandle handle = getInvokerOrConstructor(isConstructor);

        // If compiled function is not optimistic, it can't ever change its invoker/constructor, so just return them

        // directly.

        if(!isOptimistic()) {

            return handle;

        }

        // Otherwise, we need a new level of indirection; need to introduce a mutable call site that can relink itslef

        // to the compiled function's changed target whenever the optimistic assumptions are invalidated.

        final CallSite cs = new MutableCallSite(handle.type());

        relinkComposableInvoker(cs, this, isConstructor);

        return cs.dynamicInvoker();

    }

    private static void relinkComposableInvoker(final CallSite cs, final CompiledFunction inv, final boolean constructor) {

        final MethodHandle handle = inv.getInvokerOrConstructor(constructor);

        final SwitchPoint assumptions = inv.getOptimisticAssumptionsSwitchPoint();

        final MethodHandle target;

        if(assumptions == null) {

            target = handle;

        } else {

            // This assertion can obviously fail in a multithreaded environment, as we can be in a situation where

            // one thread is in the middle of a deoptimizing compilation when we hit this and thus, it has invalidated

            // the old switch point, but hasn't created the new one yet. Note that the behavior of invalidating the old

            // switch point before recompilation, and only creating the new one after recompilation is by design.

            // TODO: We need to think about thread safety of CompiledFunction objects.

            assert !assumptions.hasBeenInvalidated();

            final MethodHandle relink = MethodHandles.insertArguments(RELINK_COMPOSABLE_INVOKER, 0, cs, inv, constructor);

            target = assumptions.guardWithTest(handle, MethodHandles.foldArguments(cs.dynamicInvoker(), relink));

        }