|
|
|
/*
|
|
|
|
* Calls.
|
|
|
|
*
|
|
|
|
* Protected variants should avoid ever throwing an error.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "duk_internal.h"
|
|
|
|
|
|
|
|
/* Prepare value stack for a method call through an object property.
|
|
|
|
* May currently throw an error e.g. when getting the property.
|
|
|
|
*/
|
|
|
|
DUK_LOCAL void duk__call_prop_prep_stack(duk_context *ctx, duk_idx_t normalized_obj_index, duk_idx_t nargs) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
DUK_DDD(DUK_DDDPRINT("duk__call_prop_prep_stack, normalized_obj_index=%ld, nargs=%ld, stacktop=%ld",
|
|
|
|
(long) normalized_obj_index, (long) nargs, (long) duk_get_top(ctx)));
|
|
|
|
|
|
|
|
/* [... key arg1 ... argN] */
|
|
|
|
|
|
|
|
/* duplicate key */
|
|
|
|
duk_dup(ctx, -nargs - 1); /* Note: -nargs alone would fail for nargs == 0, this is OK */
|
|
|
|
duk_get_prop(ctx, normalized_obj_index);
|
|
|
|
|
|
|
|
DUK_DDD(DUK_DDDPRINT("func: %!T", (duk_tval *) duk_get_tval(ctx, -1)));
|
|
|
|
|
|
|
|
/* [... key arg1 ... argN func] */
|
|
|
|
|
|
|
|
duk_replace(ctx, -nargs - 2);
|
|
|
|
|
|
|
|
/* [... func arg1 ... argN] */
|
|
|
|
|
|
|
|
duk_dup(ctx, normalized_obj_index);
|
|
|
|
duk_insert(ctx, -nargs - 1);
|
|
|
|
|
|
|
|
/* [... func this arg1 ... argN] */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_call(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_small_uint_t call_flags;
|
|
|
|
duk_idx_t idx_func;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
|
|
|
|
idx_func = duk_get_top(ctx) - nargs - 1;
|
|
|
|
if (idx_func < 0 || nargs < 0) {
|
|
|
|
/* note that we can't reliably pop anything here */
|
|
|
|
DUK_ERROR(thr, DUK_ERR_API_ERROR, DUK_STR_INVALID_CALL_ARGS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* XXX: awkward; we assume there is space for this, overwrite
|
|
|
|
* directly instead?
|
|
|
|
*/
|
|
|
|
duk_push_undefined(ctx);
|
|
|
|
duk_insert(ctx, idx_func + 1);
|
|
|
|
|
|
|
|
call_flags = 0; /* not protected, respect reclimit, not constructor */
|
|
|
|
|
|
|
|
rc = duk_handle_call(thr, /* thread */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
call_flags); /* call_flags */
|
|
|
|
DUK_UNREF(rc);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_call_method(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_small_uint_t call_flags;
|
|
|
|
duk_idx_t idx_func;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
|
|
|
|
idx_func = duk_get_top(ctx) - nargs - 2; /* must work for nargs <= 0 */
|
|
|
|
if (idx_func < 0 || nargs < 0) {
|
|
|
|
/* note that we can't reliably pop anything here */
|
|
|
|
DUK_ERROR(thr, DUK_ERR_API_ERROR, DUK_STR_INVALID_CALL_ARGS);
|
|
|
|
}
|
|
|
|
|
|
|
|
call_flags = 0; /* not protected, respect reclimit, not constructor */
|
|
|
|
|
|
|
|
rc = duk_handle_call(thr, /* thread */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
call_flags); /* call_flags */
|
|
|
|
DUK_UNREF(rc);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_call_prop(duk_context *ctx, duk_idx_t obj_index, duk_idx_t nargs) {
|
|
|
|
/*
|
|
|
|
* XXX: if duk_handle_call() took values through indices, this could be
|
|
|
|
* made much more sensible. However, duk_handle_call() needs to fudge
|
|
|
|
* the 'this' and 'func' values to handle bound function chains, which
|
|
|
|
* is now done "in-place", so this is not a trivial change.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_index = duk_require_normalize_index(ctx, obj_index); /* make absolute */
|
|
|
|
|
|
|
|
duk__call_prop_prep_stack(ctx, obj_index, nargs);
|
|
|
|
|
|
|
|
duk_call_method(ctx, nargs);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_pcall(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_small_uint_t call_flags;
|
|
|
|
duk_idx_t idx_func;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
|
|
|
|
idx_func = duk_get_top(ctx) - nargs - 1; /* must work for nargs <= 0 */
|
|
|
|
if (idx_func < 0 || nargs < 0) {
|
|
|
|
/* We can't reliably pop anything here because the stack input
|
|
|
|
* shape is incorrect. So we throw an error; if the caller has
|
|
|
|
* no catch point for this, a fatal error will occur. Another
|
|
|
|
* alternative would be to just return an error. But then the
|
|
|
|
* stack would be in an unknown state which might cause some
|
|
|
|
* very hard to diagnose problems later on. Also note that even
|
|
|
|
* if we did not throw an error here, the underlying call handler
|
|
|
|
* might STILL throw an out-of-memory error or some other internal
|
|
|
|
* fatal error.
|
|
|
|
*/
|
|
|
|
DUK_ERROR(thr, DUK_ERR_API_ERROR, DUK_STR_INVALID_CALL_ARGS);
|
|
|
|
return DUK_EXEC_ERROR; /* unreachable */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* awkward; we assume there is space for this */
|
|
|
|
duk_push_undefined(ctx);
|
|
|
|
duk_insert(ctx, idx_func + 1);
|
|
|
|
|
|
|
|
call_flags = DUK_CALL_FLAG_PROTECTED; /* protected, respect reclimit, not constructor */
|
|
|
|
|
|
|
|
rc = duk_handle_call(thr, /* thread */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
call_flags); /* call_flags */
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_pcall_method(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_small_uint_t call_flags;
|
|
|
|
duk_idx_t idx_func;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
|
|
|
|
idx_func = duk_get_top(ctx) - nargs - 2; /* must work for nargs <= 0 */
|
|
|
|
if (idx_func < 0 || nargs < 0) {
|
|
|
|
/* See comments in duk_pcall(). */
|
|
|
|
DUK_ERROR(thr, DUK_ERR_API_ERROR, DUK_STR_INVALID_CALL_ARGS);
|
|
|
|
return DUK_EXEC_ERROR; /* unreachable */
|
|
|
|
}
|
|
|
|
|
|
|
|
call_flags = DUK_CALL_FLAG_PROTECTED; /* protected, respect reclimit, not constructor */
|
|
|
|
|
|
|
|
rc = duk_handle_call(thr, /* thread */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
call_flags); /* call_flags */
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_LOCAL duk_ret_t duk__pcall_prop_raw(duk_context *ctx) {
|
|
|
|
duk_idx_t obj_index;
|
|
|
|
duk_idx_t nargs;
|
|
|
|
|
|
|
|
/* Get the original arguments. Note that obj_index may be a relative
|
|
|
|
* index so the stack must have the same top when we use it.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_index = (duk_idx_t) duk_get_int(ctx, -2);
|
|
|
|
nargs = (duk_idx_t) duk_get_int(ctx, -1);
|
|
|
|
duk_pop_2(ctx);
|
|
|
|
|
|
|
|
obj_index = duk_require_normalize_index(ctx, obj_index); /* make absolute */
|
|
|
|
duk__call_prop_prep_stack(ctx, obj_index, nargs);
|
|
|
|
duk_call_method(ctx, nargs);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_pcall_prop(duk_context *ctx, duk_idx_t obj_index, duk_idx_t nargs) {
|
|
|
|
/*
|
|
|
|
* Must be careful to catch errors related to value stack manipulation
|
|
|
|
* and property lookup, not just the call itself.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
duk_push_idx(ctx, obj_index);
|
|
|
|
duk_push_idx(ctx, nargs);
|
|
|
|
|
|
|
|
/* Inputs: explicit arguments (nargs), +1 for key, +2 for obj_index/nargs passing.
|
|
|
|
* If the value stack does not contain enough args, an error is thrown; this matches
|
|
|
|
* behavior of the other protected call API functions.
|
|
|
|
*/
|
|
|
|
return duk_safe_call(ctx, duk__pcall_prop_raw, nargs + 1 + 2 /*nargs*/, 1 /*nrets*/);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_safe_call(duk_context *ctx, duk_safe_call_function func, duk_idx_t nargs, duk_idx_t nrets) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
|
|
|
|
if (duk_get_top(ctx) < nargs || nrets < 0) {
|
|
|
|
/* See comments in duk_pcall(). */
|
|
|
|
DUK_ERROR(thr, DUK_ERR_API_ERROR, DUK_STR_INVALID_CALL_ARGS);
|
|
|
|
return DUK_EXEC_ERROR; /* unreachable */
|
|
|
|
}
|
|
|
|
|
|
|
|
rc = duk_handle_safe_call(thr, /* thread */
|
|
|
|
func, /* func */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
nrets); /* num_stack_res */
|
|
|
|
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_new(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
/*
|
|
|
|
* There are two [[Construct]] operations in the specification:
|
|
|
|
*
|
|
|
|
* - E5 Section 13.2.2: for Function objects
|
|
|
|
* - E5 Section 15.3.4.5.2: for "bound" Function objects
|
|
|
|
*
|
|
|
|
* The chain of bound functions is resolved in Section 15.3.4.5.2,
|
|
|
|
* with arguments "piling up" until the [[Construct]] internal
|
|
|
|
* method is called on the final, actual Function object. Note
|
|
|
|
* that the "prototype" property is looked up *only* from the
|
|
|
|
* final object, *before* calling the constructor.
|
|
|
|
*
|
|
|
|
* Currently we follow the bound function chain here to get the
|
|
|
|
* "prototype" property value from the final, non-bound function.
|
|
|
|
* However, we let duk_handle_call() handle the argument "piling"
|
|
|
|
* when the constructor is called. The bound function chain is
|
|
|
|
* thus now processed twice.
|
|
|
|
*
|
|
|
|
* When constructing new Array instances, an unnecessary object is
|
|
|
|
* created and discarded now: the standard [[Construct]] creates an
|
|
|
|
* object, and calls the Array constructor. The Array constructor
|
|
|
|
* returns an Array instance, which is used as the result value for
|
|
|
|
* the "new" operation; the object created before the Array constructor
|
|
|
|
* call is discarded.
|
|
|
|
*
|
|
|
|
* This would be easy to fix, e.g. by knowing that the Array constructor
|
|
|
|
* will always create a replacement object and skip creating the fallback
|
|
|
|
* object in that case.
|
|
|
|
*
|
|
|
|
* Note: functions called via "new" need to know they are called as a
|
|
|
|
* constructor. For instance, built-in constructors behave differently
|
|
|
|
* depending on how they are called.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* XXX: merge this with duk_js_call.c, as this function implements
|
|
|
|
* core semantics (or perhaps merge the two files altogether).
|
|
|
|
*/
|
|
|
|
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *proto;
|
|
|
|
duk_hobject *cons;
|
|
|
|
duk_hobject *fallback;
|
|
|
|
duk_idx_t idx_cons;
|
|
|
|
duk_small_uint_t call_flags;
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
/* [... constructor arg1 ... argN] */
|
|
|
|
|
|
|
|
idx_cons = duk_require_normalize_index(ctx, -nargs - 1);
|
|
|
|
|
|
|
|
DUK_DDD(DUK_DDDPRINT("top=%ld, nargs=%ld, idx_cons=%ld",
|
|
|
|
(long) duk_get_top(ctx), (long) nargs, (long) idx_cons));
|
|
|
|
|
|
|
|
/* XXX: code duplication */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Figure out the final, non-bound constructor, to get "prototype"
|
|
|
|
* property.
|
|
|
|
*/
|
|
|
|
|
|
|
|
duk_dup(ctx, idx_cons);
|
|
|
|
for (;;) {
|
|
|
|
cons = duk_get_hobject(ctx, -1);
|
|
|
|
if (cons == NULL || !DUK_HOBJECT_HAS_CONSTRUCTABLE(cons)) {
|
|
|
|
/* Checking constructability from anything else than the
|
|
|
|
* initial constructor is not strictly necessary, but a
|
|
|
|
* nice sanity check.
|
|
|
|
*/
|
|
|
|
goto not_constructable;
|
|
|
|
}
|
|
|
|
if (!DUK_HOBJECT_HAS_BOUND(cons)) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
duk_get_prop_stridx(ctx, -1, DUK_STRIDX_INT_TARGET); /* -> [... cons target] */
|
|
|
|
duk_remove(ctx, -2); /* -> [... target] */
|
|
|
|
}
|
|
|
|
DUK_ASSERT(cons != NULL && !DUK_HOBJECT_HAS_BOUND(cons));
|
|
|
|
|
|
|
|
/* [... constructor arg1 ... argN final_cons] */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Create "fallback" object to be used as the object instance,
|
|
|
|
* unless the constructor returns a replacement value.
|
|
|
|
* Its internal prototype needs to be set based on "prototype"
|
|
|
|
* property of the constructor.
|
|
|
|
*/
|
|
|
|
|
|
|
|
duk_push_object(ctx); /* class Object, extensible */
|
|
|
|
|
|
|
|
/* [... constructor arg1 ... argN final_cons fallback] */
|
|
|
|
|
|
|
|
duk_get_prop_stridx(ctx, -2, DUK_STRIDX_PROTOTYPE);
|
|
|
|
proto = duk_get_hobject(ctx, -1);
|
|
|
|
if (!proto) {
|
|
|
|
DUK_DDD(DUK_DDDPRINT("constructor has no 'prototype' property, or value not an object "
|
|
|
|
"-> leave standard Object prototype as fallback prototype"));
|
|
|
|
} else {
|
|
|
|
DUK_DDD(DUK_DDDPRINT("constructor has 'prototype' property with object value "
|
|
|
|
"-> set fallback prototype to that value: %!iO", (duk_heaphdr *) proto));
|
|
|
|
fallback = duk_get_hobject(ctx, -2);
|
|
|
|
DUK_ASSERT(fallback != NULL);
|
|
|
|
DUK_HOBJECT_SET_PROTOTYPE_UPDREF(thr, fallback, proto);
|
|
|
|
}
|
|
|
|
duk_pop(ctx);
|
|
|
|
|
|
|
|
/* [... constructor arg1 ... argN final_cons fallback] */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Manipulate callstack for the call.
|
|
|
|
*/
|
|
|
|
|
|
|
|
duk_dup_top(ctx);
|
|
|
|
duk_insert(ctx, idx_cons + 1); /* use fallback as 'this' value */
|
|
|
|
duk_insert(ctx, idx_cons); /* also stash it before constructor,
|
|
|
|
* in case we need it (as the fallback value)
|
|
|
|
*/
|
|
|
|
duk_pop(ctx); /* pop final_cons */
|
|
|
|
|
|
|
|
|
|
|
|
/* [... fallback constructor fallback(this) arg1 ... argN];
|
|
|
|
* Note: idx_cons points to first 'fallback', not 'constructor'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_DDD(DUK_DDDPRINT("before call, idx_cons+1 (constructor) -> %!T, idx_cons+2 (fallback/this) -> %!T, "
|
|
|
|
"nargs=%ld, top=%ld",
|
|
|
|
(duk_tval *) duk_get_tval(ctx, idx_cons + 1),
|
|
|
|
(duk_tval *) duk_get_tval(ctx, idx_cons + 2),
|
|
|
|
(long) nargs,
|
|
|
|
(long) duk_get_top(ctx)));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Call the constructor function (called in "constructor mode").
|
|
|
|
*/
|
|
|
|
|
|
|
|
call_flags = DUK_CALL_FLAG_CONSTRUCTOR_CALL; /* not protected, respect reclimit, is a constructor call */
|
|
|
|
|
|
|
|
rc = duk_handle_call(thr, /* thread */
|
|
|
|
nargs, /* num_stack_args */
|
|
|
|
call_flags); /* call_flags */
|
|
|
|
DUK_UNREF(rc);
|
|
|
|
|
|
|
|
/* [... fallback retval] */
|
|
|
|
|
|
|
|
DUK_DDD(DUK_DDDPRINT("constructor call finished, rc=%ld, fallback=%!iT, retval=%!iT",
|
|
|
|
(long) rc,
|
|
|
|
(duk_tval *) duk_get_tval(ctx, -2),
|
|
|
|
(duk_tval *) duk_get_tval(ctx, -1)));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine whether to use the constructor return value as the created
|
|
|
|
* object instance or not.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (duk_is_object(ctx, -1)) {
|
|
|
|
duk_remove(ctx, -2);
|
|
|
|
} else {
|
|
|
|
duk_pop(ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Augment created errors upon creation (not when they are thrown or
|
|
|
|
* rethrown). __FILE__ and __LINE__ are not desirable here; the call
|
|
|
|
* stack reflects the caller which is correct.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef DUK_USE_AUGMENT_ERROR_CREATE
|
|
|
|
duk_hthread_sync_currpc(thr);
|
|
|
|
duk_err_augment_error_create(thr, thr, NULL, 0, 1 /*noblame_fileline*/);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* [... retval] */
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
not_constructable:
|
|
|
|
DUK_ERROR(thr, DUK_ERR_TYPE_ERROR, DUK_STR_NOT_CONSTRUCTABLE);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_LOCAL duk_ret_t duk__pnew_helper(duk_context *ctx) {
|
|
|
|
duk_uint_t nargs;
|
|
|
|
|
|
|
|
nargs = duk_to_uint(ctx, -1);
|
|
|
|
duk_pop(ctx);
|
|
|
|
|
|
|
|
duk_new(ctx, nargs);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_pnew(duk_context *ctx, duk_idx_t nargs) {
|
|
|
|
duk_int_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
/* For now, just use duk_safe_call() to wrap duk_new(). We can't
|
|
|
|
* simply use a protected duk_handle_call() because there's post
|
|
|
|
* processing which might throw. It should be possible to ensure
|
|
|
|
* the post processing never throws (except in internal errors and
|
|
|
|
* out of memory etc which are always allowed) and then remove this
|
|
|
|
* wrapper.
|
|
|
|
*/
|
|
|
|
|
|
|
|
duk_push_uint(ctx, nargs);
|
|
|
|
rc = duk_safe_call(ctx, duk__pnew_helper, nargs + 2 /*nargs*/, 1 /*nrets*/);
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_is_constructor_call(duk_context *ctx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_activation *act;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
DUK_ASSERT_DISABLE(thr->callstack_top >= 0);
|
|
|
|
|
|
|
|
act = duk_hthread_get_current_activation(thr);
|
|
|
|
DUK_ASSERT(act != NULL); /* because callstack_top > 0 */
|
|
|
|
return ((act->flags & DUK_ACT_FLAG_CONSTRUCT) != 0 ? 1 : 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_is_strict_call(duk_context *ctx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_activation *act;
|
|
|
|
|
|
|
|
/* For user code this could just return 1 (strict) always
|
|
|
|
* because all Duktape/C functions are considered strict,
|
|
|
|
* and strict is also the default when nothing is running.
|
|
|
|
* However, Duktape may call this function internally when
|
|
|
|
* the current activation is an Ecmascript function, so
|
|
|
|
* this cannot be replaced by a 'return 1' without fixing
|
|
|
|
* the internal call sites.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
DUK_ASSERT_DISABLE(thr->callstack_top >= 0);
|
|
|
|
|
|
|
|
act = duk_hthread_get_current_activation(thr);
|
|
|
|
if (act == NULL) {
|
|
|
|
/* Strict by default. */
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return ((act->flags & DUK_ACT_FLAG_STRICT) != 0 ? 1 : 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Duktape/C function magic
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_get_current_magic(duk_context *ctx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_activation *act;
|
|
|
|
duk_hobject *func;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr != NULL);
|
|
|
|
DUK_ASSERT_DISABLE(thr->callstack_top >= 0);
|
|
|
|
|
|
|
|
act = duk_hthread_get_current_activation(thr);
|
|
|
|
if (act) {
|
First round of lightfunc changes
A lot of changes to add preliminary lightfunc support:
* Add LIGHTFUNC tagged type to duk_tval.h and API.
* Internal changes for preliminary to support lightfuncs in call handling
and other operations (FIXMEs left in obvious places where support is
still missing after this commit)
* Preliminary Ecmascript and API testcases for lightfuncs
Detailed notes:
* Because magic is signed, reading it back involves sign extension which is
quite verbose to do in C. Use macros for reading the magic value and other
bit fields encoded in the flags.
* Function.prototype.bind(): the 'length' property of a bound function now
comes out wrong. We could simply look up the virtual 'length' property
even if h_target is NULL: no extra code and binding is relatively rare in
hot paths. Rewrite more cleanly in any case.
* The use flag DUK_USE_LIGHTFUNC_BUILTINS controls the forced lightfunc
conversion of built-ins. This results in non-compliant built-ins but
significant memory savings in very memory poor environments.
* Reject eval(), Thread.yield/resume as lightfuncs. These functions have
current assertions that they must be called as fully fledged functions.
* Lightfuncs are serialized like ordinary functions for JSON, JX, and JC
by this diff.
* Add 'magic' to activation for lightfuncs. It will be needed for lightweight
functions: we don't have the duk_tval related to the lightfunc, so we must
copy the magic value to the activation when a call is made.
* When lightfuncs are used as property lookup base values, continue property
lookup from the Function.prototype object. This is necessary to allow e.g.
``func.call()`` and ``func.apply()`` to be used.
* Call handling had to be reworked for lightfuncs, especially how bound
function chains are handled. This is a relatively large change but is
necessary to support lightweight functions properly in bound function
resolution.
The current solution is not ideal. The bytecode executor will first try an
ecma-to-ecma call setup which resolves the bound function chain first. If
the final, unbound function is not viable (a native function) the call setup
returns with an error code. The caller will then perform a normal call.
Although bound function resolution has already been done, the normal call
handling code will re-do it (and detect there is nothing to do).
This situation could be avoided by decoupling bound function handling and
effective this binding computation from the actual call setup. The caller
could then to do this prestep first, and only then decide whether to use an
ecma-to-ecma call or an ordinary heavyweight call.
Remove duk__find_nonbound_function as unused.
* Use indirect magic to allow LIGHTFUNCs for Date. Most of the built-in
functions not directly eligible as lightfuncs are the Date built-in methods,
whose magic values contain too much information to fit into the 8-bit magic
of a LIGHTFUNC value.
To work around this, add an array (duk__date_magics[]) containing the
actual control flags needed by the built-ins, and make the Date built-in
magic value an index into this table. With this change Date built-ins are
successfully converted to lightfuncs.
Testcase fixes:
- Whitespace fixes
- Print error for indirect eval error to make diagnosis easier
- Fix error string to match errmsg updated in this branch
11 years ago
|
|
|
func = DUK_ACT_GET_FUNC(act);
|
|
|
|
if (!func) {
|
|
|
|
duk_tval *tv = &act->tv_func;
|
|
|
|
duk_small_uint_t lf_flags;
|
|
|
|
lf_flags = DUK_TVAL_GET_LIGHTFUNC_FLAGS(tv);
|
|
|
|
return (duk_int_t) DUK_LFUNC_FLAGS_GET_MAGIC(lf_flags);
|
|
|
|
}
|
|
|
|
DUK_ASSERT(func != NULL);
|
|
|
|
|
|
|
|
if (DUK_HOBJECT_IS_NATIVEFUNCTION(func)) {
|
|
|
|
duk_hnativefunction *nf = (duk_hnativefunction *) func;
|
|
|
|
return (duk_int_t) nf->magic;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_int_t duk_get_magic(duk_context *ctx, duk_idx_t index) {
|
First round of lightfunc changes
A lot of changes to add preliminary lightfunc support:
* Add LIGHTFUNC tagged type to duk_tval.h and API.
* Internal changes for preliminary to support lightfuncs in call handling
and other operations (FIXMEs left in obvious places where support is
still missing after this commit)
* Preliminary Ecmascript and API testcases for lightfuncs
Detailed notes:
* Because magic is signed, reading it back involves sign extension which is
quite verbose to do in C. Use macros for reading the magic value and other
bit fields encoded in the flags.
* Function.prototype.bind(): the 'length' property of a bound function now
comes out wrong. We could simply look up the virtual 'length' property
even if h_target is NULL: no extra code and binding is relatively rare in
hot paths. Rewrite more cleanly in any case.
* The use flag DUK_USE_LIGHTFUNC_BUILTINS controls the forced lightfunc
conversion of built-ins. This results in non-compliant built-ins but
significant memory savings in very memory poor environments.
* Reject eval(), Thread.yield/resume as lightfuncs. These functions have
current assertions that they must be called as fully fledged functions.
* Lightfuncs are serialized like ordinary functions for JSON, JX, and JC
by this diff.
* Add 'magic' to activation for lightfuncs. It will be needed for lightweight
functions: we don't have the duk_tval related to the lightfunc, so we must
copy the magic value to the activation when a call is made.
* When lightfuncs are used as property lookup base values, continue property
lookup from the Function.prototype object. This is necessary to allow e.g.
``func.call()`` and ``func.apply()`` to be used.
* Call handling had to be reworked for lightfuncs, especially how bound
function chains are handled. This is a relatively large change but is
necessary to support lightweight functions properly in bound function
resolution.
The current solution is not ideal. The bytecode executor will first try an
ecma-to-ecma call setup which resolves the bound function chain first. If
the final, unbound function is not viable (a native function) the call setup
returns with an error code. The caller will then perform a normal call.
Although bound function resolution has already been done, the normal call
handling code will re-do it (and detect there is nothing to do).
This situation could be avoided by decoupling bound function handling and
effective this binding computation from the actual call setup. The caller
could then to do this prestep first, and only then decide whether to use an
ecma-to-ecma call or an ordinary heavyweight call.
Remove duk__find_nonbound_function as unused.
* Use indirect magic to allow LIGHTFUNCs for Date. Most of the built-in
functions not directly eligible as lightfuncs are the Date built-in methods,
whose magic values contain too much information to fit into the 8-bit magic
of a LIGHTFUNC value.
To work around this, add an array (duk__date_magics[]) containing the
actual control flags needed by the built-ins, and make the Date built-in
magic value an index into this table. With this change Date built-ins are
successfully converted to lightfuncs.
Testcase fixes:
- Whitespace fixes
- Print error for indirect eval error to make diagnosis easier
- Fix error string to match errmsg updated in this branch
11 years ago
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_tval *tv;
|
|
|
|
duk_hobject *h;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
First round of lightfunc changes
A lot of changes to add preliminary lightfunc support:
* Add LIGHTFUNC tagged type to duk_tval.h and API.
* Internal changes for preliminary to support lightfuncs in call handling
and other operations (FIXMEs left in obvious places where support is
still missing after this commit)
* Preliminary Ecmascript and API testcases for lightfuncs
Detailed notes:
* Because magic is signed, reading it back involves sign extension which is
quite verbose to do in C. Use macros for reading the magic value and other
bit fields encoded in the flags.
* Function.prototype.bind(): the 'length' property of a bound function now
comes out wrong. We could simply look up the virtual 'length' property
even if h_target is NULL: no extra code and binding is relatively rare in
hot paths. Rewrite more cleanly in any case.
* The use flag DUK_USE_LIGHTFUNC_BUILTINS controls the forced lightfunc
conversion of built-ins. This results in non-compliant built-ins but
significant memory savings in very memory poor environments.
* Reject eval(), Thread.yield/resume as lightfuncs. These functions have
current assertions that they must be called as fully fledged functions.
* Lightfuncs are serialized like ordinary functions for JSON, JX, and JC
by this diff.
* Add 'magic' to activation for lightfuncs. It will be needed for lightweight
functions: we don't have the duk_tval related to the lightfunc, so we must
copy the magic value to the activation when a call is made.
* When lightfuncs are used as property lookup base values, continue property
lookup from the Function.prototype object. This is necessary to allow e.g.
``func.call()`` and ``func.apply()`` to be used.
* Call handling had to be reworked for lightfuncs, especially how bound
function chains are handled. This is a relatively large change but is
necessary to support lightweight functions properly in bound function
resolution.
The current solution is not ideal. The bytecode executor will first try an
ecma-to-ecma call setup which resolves the bound function chain first. If
the final, unbound function is not viable (a native function) the call setup
returns with an error code. The caller will then perform a normal call.
Although bound function resolution has already been done, the normal call
handling code will re-do it (and detect there is nothing to do).
This situation could be avoided by decoupling bound function handling and
effective this binding computation from the actual call setup. The caller
could then to do this prestep first, and only then decide whether to use an
ecma-to-ecma call or an ordinary heavyweight call.
Remove duk__find_nonbound_function as unused.
* Use indirect magic to allow LIGHTFUNCs for Date. Most of the built-in
functions not directly eligible as lightfuncs are the Date built-in methods,
whose magic values contain too much information to fit into the 8-bit magic
of a LIGHTFUNC value.
To work around this, add an array (duk__date_magics[]) containing the
actual control flags needed by the built-ins, and make the Date built-in
magic value an index into this table. With this change Date built-ins are
successfully converted to lightfuncs.
Testcase fixes:
- Whitespace fixes
- Print error for indirect eval error to make diagnosis easier
- Fix error string to match errmsg updated in this branch
11 years ago
|
|
|
tv = duk_require_tval(ctx, index);
|
|
|
|
if (DUK_TVAL_IS_OBJECT(tv)) {
|
|
|
|
h = DUK_TVAL_GET_OBJECT(tv);
|
|
|
|
DUK_ASSERT(h != NULL);
|
|
|
|
if (!DUK_HOBJECT_HAS_NATIVEFUNCTION(h)) {
|
|
|
|
goto type_error;
|
|
|
|
}
|
|
|
|
return (duk_int_t) ((duk_hnativefunction *) h)->magic;
|
|
|
|
} else if (DUK_TVAL_IS_LIGHTFUNC(tv)) {
|
|
|
|
duk_small_uint_t lf_flags = DUK_TVAL_GET_LIGHTFUNC_FLAGS(tv);
|
|
|
|
return (duk_int_t) DUK_LFUNC_FLAGS_GET_MAGIC(lf_flags);
|
First round of lightfunc changes
A lot of changes to add preliminary lightfunc support:
* Add LIGHTFUNC tagged type to duk_tval.h and API.
* Internal changes for preliminary to support lightfuncs in call handling
and other operations (FIXMEs left in obvious places where support is
still missing after this commit)
* Preliminary Ecmascript and API testcases for lightfuncs
Detailed notes:
* Because magic is signed, reading it back involves sign extension which is
quite verbose to do in C. Use macros for reading the magic value and other
bit fields encoded in the flags.
* Function.prototype.bind(): the 'length' property of a bound function now
comes out wrong. We could simply look up the virtual 'length' property
even if h_target is NULL: no extra code and binding is relatively rare in
hot paths. Rewrite more cleanly in any case.
* The use flag DUK_USE_LIGHTFUNC_BUILTINS controls the forced lightfunc
conversion of built-ins. This results in non-compliant built-ins but
significant memory savings in very memory poor environments.
* Reject eval(), Thread.yield/resume as lightfuncs. These functions have
current assertions that they must be called as fully fledged functions.
* Lightfuncs are serialized like ordinary functions for JSON, JX, and JC
by this diff.
* Add 'magic' to activation for lightfuncs. It will be needed for lightweight
functions: we don't have the duk_tval related to the lightfunc, so we must
copy the magic value to the activation when a call is made.
* When lightfuncs are used as property lookup base values, continue property
lookup from the Function.prototype object. This is necessary to allow e.g.
``func.call()`` and ``func.apply()`` to be used.
* Call handling had to be reworked for lightfuncs, especially how bound
function chains are handled. This is a relatively large change but is
necessary to support lightweight functions properly in bound function
resolution.
The current solution is not ideal. The bytecode executor will first try an
ecma-to-ecma call setup which resolves the bound function chain first. If
the final, unbound function is not viable (a native function) the call setup
returns with an error code. The caller will then perform a normal call.
Although bound function resolution has already been done, the normal call
handling code will re-do it (and detect there is nothing to do).
This situation could be avoided by decoupling bound function handling and
effective this binding computation from the actual call setup. The caller
could then to do this prestep first, and only then decide whether to use an
ecma-to-ecma call or an ordinary heavyweight call.
Remove duk__find_nonbound_function as unused.
* Use indirect magic to allow LIGHTFUNCs for Date. Most of the built-in
functions not directly eligible as lightfuncs are the Date built-in methods,
whose magic values contain too much information to fit into the 8-bit magic
of a LIGHTFUNC value.
To work around this, add an array (duk__date_magics[]) containing the
actual control flags needed by the built-ins, and make the Date built-in
magic value an index into this table. With this change Date built-ins are
successfully converted to lightfuncs.
Testcase fixes:
- Whitespace fixes
- Print error for indirect eval error to make diagnosis easier
- Fix error string to match errmsg updated in this branch
11 years ago
|
|
|
}
|
|
|
|
|
|
|
|
/* fall through */
|
|
|
|
type_error:
|
|
|
|
DUK_ERROR(thr, DUK_ERR_TYPE_ERROR, DUK_STR_UNEXPECTED_TYPE);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_set_magic(duk_context *ctx, duk_idx_t index, duk_int_t magic) {
|
|
|
|
duk_hnativefunction *nf;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
nf = duk_require_hnativefunction(ctx, index);
|
|
|
|
DUK_ASSERT(nf != NULL);
|
|
|
|
nf->magic = (duk_int16_t) magic;
|
|
|
|
}
|