|
|
|
/*
|
|
|
|
* Object handling: property access and other support functions.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "duk_internal.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Property handling
|
|
|
|
*
|
|
|
|
* The API exposes only the most common property handling functions.
|
|
|
|
* The caller can invoke Ecmascript built-ins for full control (e.g.
|
|
|
|
* defineProperty, getOwnPropertyDescriptor).
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_prop(duk_context *ctx, duk_idx_t obj_idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_tval *tv_obj;
|
|
|
|
duk_tval *tv_key;
|
|
|
|
duk_bool_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
/* Note: copying tv_obj and tv_key to locals to shield against a valstack
|
|
|
|
* resize is not necessary for a property get right now.
|
|
|
|
*/
|
|
|
|
|
|
|
|
tv_obj = duk_require_tval(ctx, obj_idx);
|
|
|
|
tv_key = duk_require_tval(ctx, -1);
|
|
|
|
|
|
|
|
rc = duk_hobject_getprop(thr, tv_obj, tv_key);
|
|
|
|
DUK_ASSERT(rc == 0 || rc == 1);
|
|
|
|
/* a value is left on stack regardless of rc */
|
|
|
|
|
|
|
|
duk_remove_m2(ctx); /* remove key */
|
|
|
|
return rc; /* 1 if property found, 0 otherwise */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_prop_string(duk_context *ctx, duk_idx_t obj_idx, const char *key) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_string(ctx, key);
|
|
|
|
return duk_get_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_prop_lstring(duk_context *ctx, duk_idx_t obj_idx, const char *key, duk_size_t key_len) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_lstring(ctx, key, key_len);
|
|
|
|
return duk_get_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_prop_index(duk_context *ctx, duk_idx_t obj_idx, duk_uarridx_t arr_idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_uarridx(ctx, arr_idx);
|
|
|
|
return duk_get_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_get_prop_stridx(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
DUK_UNREF(thr);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
duk_push_hstring(ctx, DUK_HTHREAD_GET_STRING(thr, stridx));
|
|
|
|
return duk_get_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_get_prop_stridx_short_raw(duk_context *ctx, duk_uint_t packed_args) {
|
|
|
|
return duk_get_prop_stridx(ctx, (duk_idx_t) (duk_int16_t) (packed_args >> 16),
|
|
|
|
(duk_small_uint_t) (packed_args & 0xffffUL));
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_get_prop_stridx_boolean(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx, duk_bool_t *out_has_prop) {
|
|
|
|
duk_bool_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
|
|
|
|
rc = duk_get_prop_stridx(ctx, obj_idx, stridx);
|
|
|
|
if (out_has_prop) {
|
|
|
|
*out_has_prop = rc;
|
|
|
|
}
|
|
|
|
rc = duk_to_boolean(ctx, -1);
|
|
|
|
DUK_ASSERT(rc == 0 || rc == 1);
|
|
|
|
duk_pop(ctx);
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_LOCAL duk_bool_t duk__put_prop_shared(duk_context *ctx, duk_idx_t obj_idx, duk_idx_t idx_key) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_tval *tv_obj;
|
|
|
|
duk_tval *tv_key;
|
|
|
|
duk_tval *tv_val;
|
|
|
|
duk_small_int_t throw_flag;
|
|
|
|
duk_bool_t rc;
|
|
|
|
|
|
|
|
/* Note: copying tv_obj and tv_key to locals to shield against a valstack
|
|
|
|
* resize is not necessary for a property put right now (putprop protects
|
|
|
|
* against it internally).
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Key and value indices are either (-2, -1) or (-1, -2). Given idx_key,
|
|
|
|
* idx_val is always (idx_key ^ 0x01).
|
|
|
|
*/
|
|
|
|
DUK_ASSERT((idx_key == -2 && (idx_key ^ 1) == -1) ||
|
|
|
|
(idx_key == -1 && (idx_key ^ 1) == -2));
|
|
|
|
/* XXX: Direct access; faster validation. */
|
|
|
|
tv_obj = duk_require_tval(ctx, obj_idx);
|
|
|
|
tv_key = duk_require_tval(ctx, idx_key);
|
|
|
|
tv_val = duk_require_tval(ctx, idx_key ^ 1);
|
|
|
|
throw_flag = duk_is_strict_call(ctx);
|
|
|
|
|
|
|
|
rc = duk_hobject_putprop(thr, tv_obj, tv_key, tv_val, throw_flag);
|
|
|
|
DUK_ASSERT(rc == 0 || rc == 1);
|
|
|
|
|
|
|
|
duk_pop_2(ctx); /* remove key and value */
|
|
|
|
return rc; /* 1 if property found, 0 otherwise */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_prop(duk_context *ctx, duk_idx_t obj_idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
return duk__put_prop_shared(ctx, obj_idx, -2);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_prop_string(duk_context *ctx, duk_idx_t obj_idx, const char *key) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
/* Careful here and with other duk_put_prop_xxx() helpers: the
|
|
|
|
* target object and the property value may be in the same value
|
|
|
|
* stack slot (unusual, but still conceptually clear).
|
|
|
|
*/
|
|
|
|
obj_idx = duk_normalize_index(ctx, obj_idx);
|
|
|
|
(void) duk_push_string(ctx, key);
|
|
|
|
return duk__put_prop_shared(ctx, obj_idx, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_prop_lstring(duk_context *ctx, duk_idx_t obj_idx, const char *key, duk_size_t key_len) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_normalize_index(ctx, obj_idx);
|
|
|
|
(void) duk_push_lstring(ctx, key, key_len);
|
|
|
|
return duk__put_prop_shared(ctx, obj_idx, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_prop_index(duk_context *ctx, duk_idx_t obj_idx, duk_uarridx_t arr_idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_uarridx(ctx, arr_idx);
|
|
|
|
return duk__put_prop_shared(ctx, obj_idx, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_put_prop_stridx(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
DUK_UNREF(thr);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
duk_push_hstring(ctx, DUK_HTHREAD_GET_STRING(thr, stridx));
|
|
|
|
return duk__put_prop_shared(ctx, obj_idx, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_put_prop_stridx_short_raw(duk_context *ctx, duk_uint_t packed_args) {
|
|
|
|
return duk_put_prop_stridx(ctx, (duk_idx_t) (duk_int16_t) (packed_args >> 16),
|
|
|
|
(duk_small_uint_t) (packed_args & 0xffffUL));
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_del_prop(duk_context *ctx, duk_idx_t obj_idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_tval *tv_obj;
|
|
|
|
duk_tval *tv_key;
|
|
|
|
duk_small_int_t throw_flag;
|
|
|
|
duk_bool_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
/* Note: copying tv_obj and tv_key to locals to shield against a valstack
|
|
|
|
* resize is not necessary for a property delete right now.
|
|
|
|
*/
|
|
|
|
|
|
|
|
tv_obj = duk_require_tval(ctx, obj_idx);
|
|
|
|
tv_key = duk_require_tval(ctx, -1);
|
|
|
|
throw_flag = duk_is_strict_call(ctx);
|
|
|
|
|
|
|
|
rc = duk_hobject_delprop(thr, tv_obj, tv_key, throw_flag);
|
|
|
|
DUK_ASSERT(rc == 0 || rc == 1);
|
|
|
|
|
|
|
|
duk_pop(ctx); /* remove key */
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_del_prop_string(duk_context *ctx, duk_idx_t obj_idx, const char *key) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_string(ctx, key);
|
|
|
|
return duk_del_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_del_prop_lstring(duk_context *ctx, duk_idx_t obj_idx, const char *key, duk_size_t key_len) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_lstring(ctx, key, key_len);
|
|
|
|
return duk_del_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_del_prop_index(duk_context *ctx, duk_idx_t obj_idx, duk_uarridx_t arr_idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_uarridx(ctx, arr_idx);
|
|
|
|
return duk_del_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_del_prop_stridx(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
DUK_UNREF(thr);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
duk_push_hstring(ctx, DUK_HTHREAD_GET_STRING(thr, stridx));
|
|
|
|
return duk_del_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
DUK_INTERNAL duk_bool_t duk_del_prop_stridx_short_raw(duk_context *ctx, duk_uint_t packed_args) {
|
|
|
|
return duk_del_prop_stridx(ctx, (duk_idx_t) (duk_int16_t) (packed_args >> 16),
|
|
|
|
(duk_small_uint_t) (packed_args & 0xffffUL));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_has_prop(duk_context *ctx, duk_idx_t obj_idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_tval *tv_obj;
|
|
|
|
duk_tval *tv_key;
|
|
|
|
duk_bool_t rc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
/* Note: copying tv_obj and tv_key to locals to shield against a valstack
|
|
|
|
* resize is not necessary for a property existence check right now.
|
|
|
|
*/
|
|
|
|
|
|
|
|
tv_obj = duk_require_tval(ctx, obj_idx);
|
|
|
|
tv_key = duk_require_tval(ctx, -1);
|
|
|
|
|
|
|
|
rc = duk_hobject_hasprop(thr, tv_obj, tv_key);
|
|
|
|
DUK_ASSERT(rc == 0 || rc == 1);
|
|
|
|
|
|
|
|
duk_pop(ctx); /* remove key */
|
|
|
|
return rc; /* 1 if property found, 0 otherwise */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_has_prop_string(duk_context *ctx, duk_idx_t obj_idx, const char *key) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_string(ctx, key);
|
|
|
|
return duk_has_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_has_prop_lstring(duk_context *ctx, duk_idx_t obj_idx, const char *key, duk_size_t key_len) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_lstring(ctx, key, key_len);
|
|
|
|
return duk_has_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_has_prop_index(duk_context *ctx, duk_idx_t obj_idx, duk_uarridx_t arr_idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_uarridx(ctx, arr_idx);
|
|
|
|
return duk_has_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL duk_bool_t duk_has_prop_stridx(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
DUK_UNREF(thr);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
duk_push_hstring(ctx, DUK_HTHREAD_GET_STRING(thr, stridx));
|
|
|
|
return duk_has_prop(ctx, obj_idx);
|
|
|
|
}
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
DUK_INTERNAL duk_bool_t duk_has_prop_stridx_short_raw(duk_context *ctx, duk_uint_t packed_args) {
|
|
|
|
return duk_has_prop_stridx(ctx, (duk_idx_t) (duk_int16_t) (packed_args >> 16),
|
|
|
|
(duk_small_uint_t) (packed_args & 0xffffUL));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Define own property without inheritance lookups and such. This differs from
|
|
|
|
* [[DefineOwnProperty]] because special behaviors (like Array 'length') are
|
|
|
|
* not invoked by this method. The caller must be careful to invoke any such
|
|
|
|
* behaviors if necessary.
|
|
|
|
*/
|
|
|
|
DUK_INTERNAL void duk_xdef_prop(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t desc_flags) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hstring *key;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, obj_idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
|
|
|
key = duk_to_property_key_hstring(ctx, -2);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
DUK_ASSERT(duk_require_tval(ctx, -1) != NULL);
|
|
|
|
|
|
|
|
duk_hobject_define_property_internal(thr, obj, key, desc_flags);
|
|
|
|
|
|
|
|
duk_pop(ctx); /* pop key */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_xdef_prop_index(duk_context *ctx, duk_idx_t obj_idx, duk_uarridx_t arr_idx, duk_small_uint_t desc_flags) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, obj_idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
|
|
|
|
|
|
|
duk_hobject_define_property_internal_arridx(thr, obj, arr_idx, desc_flags);
|
|
|
|
/* value popped by call */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_xdef_prop_stridx(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx, duk_small_uint_t desc_flags) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hstring *key;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, obj_idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
key = DUK_HTHREAD_GET_STRING(thr, stridx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
DUK_ASSERT(duk_require_tval(ctx, -1) != NULL);
|
|
|
|
|
|
|
|
duk_hobject_define_property_internal(thr, obj, key, desc_flags);
|
|
|
|
/* value popped by call */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_xdef_prop_stridx_short_raw(duk_context *ctx, duk_uint_t packed_args) {
|
|
|
|
duk_xdef_prop_stridx(ctx, (duk_idx_t) (duk_int8_t) (packed_args >> 24),
|
|
|
|
(duk_small_uint_t) (packed_args >> 8) & 0xffffUL,
|
|
|
|
(duk_small_uint_t) (packed_args & 0xffL));
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_xdef_prop_stridx_builtin(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx, duk_small_int_t builtin_idx, duk_small_uint_t desc_flags) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hstring *key;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT_STRIDX_VALID(stridx);
|
|
|
|
DUK_ASSERT_BIDX_VALID(builtin_idx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, obj_idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
16-bit fields and heap pointer compression work
Memory optimization work for very low memory devices (96 to 256kB system RAM).
Overall changes are:
- 16-bit fields for various internal structures to reduce their size
- Heap pointer compression to reduce pointer size to 16 bits
When DUK_OPT_LIGHTFUNC_BUILTINS and the new low memory options are enabled,
Duktape initial heap memory usage is about 23kB (compared to baseline of
about 45kB) on x86.
Unless low memory feature options are enabled, there should be no visible
changes to Duktape behavior.
More detailed changes:
- 16-bit changes for duk_heaphdr: pointer compression, refcount
- 16-bit changes for duk_hstring: hash, blen, and clen can all be 16 bits,
use 0xFFFF as string byte length limit (call sites ensure this limit is
never exceeded)
- 16-bit changes for duk_hbuffer, use 0xFFFF as buffer length limit
- 16-bit fields for hobject size (entry part, array part), drop hash part
since it's not usually needed for extremely low memory environments
- 16-bit changes for duk_hcompiledfunction
- Heap pointer packing for stringtable
- Heap pointer packing for 'strs' built-in strings list (saves around 600
to 700 bytes but may not be a good tradeoff because call site size will
increase)
Other changes:
- Heaphdr NULL init fix. The original macros were broken: the double/single
linked macro variants were the wrong way around. Now sets through macro
to work properly with compressed pointers.
- Rename duk_hbuffer CURR_DATA_PTR -> DATA_PTR to reduce macro length
(previous name was tediously long)
- Rename buffer "usable_size" to "alloc_size" throughout as they have been
the same for a while now (they used to differ when buffer had an extra NUL).
- Add memory optimization markers to Duktape.env (pointer compression and
individual 16-bit field options)
- Rename a few internal fields for clarity: duk_hobject 'p' to 'props',
heap->st to heap->strtable
- Add a safety check for buffer alloc size (should not be triggered but
prevents wrapping if call sites don't properly check for sizes)
- Other minor cleanups
10 years ago
|
|
|
key = DUK_HTHREAD_GET_STRING(thr, stridx);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
duk_push_hobject(ctx, thr->builtins[builtin_idx]);
|
|
|
|
duk_hobject_define_property_internal(thr, obj, key, desc_flags);
|
|
|
|
/* value popped by call */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This is a rare property helper; it sets the global thrower (E5 Section 13.2.3)
|
|
|
|
* setter/getter into an object property. This is needed by the 'arguments'
|
|
|
|
* object creation code, function instance creation code, and Function.prototype.bind().
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_xdef_prop_stridx_thrower(duk_context *ctx, duk_idx_t obj_idx, duk_small_uint_t stridx) {
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
duk_push_hstring_stridx(ctx, stridx);
|
|
|
|
duk_push_hobject_bidx(ctx, DUK_BIDX_TYPE_ERROR_THROWER);
|
|
|
|
duk_dup_top(ctx);
|
|
|
|
duk_def_prop(ctx, obj_idx, DUK_DEFPROP_HAVE_SETTER | DUK_DEFPROP_HAVE_GETTER | DUK_DEFPROP_FORCE); /* attributes always 0 */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Object.getOwnPropertyDescriptor() equivalent C binding. */
|
|
|
|
DUK_EXTERNAL void duk_get_prop_desc(duk_context *ctx, duk_idx_t obj_idx, duk_uint_t flags) {
|
|
|
|
DUK_UNREF(flags); /* no flags defined yet */
|
|
|
|
|
|
|
|
duk_hobject_object_get_own_property_descriptor(ctx, obj_idx); /* [ ... key ] -> [ ... desc ] */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Object.defineProperty() equivalent C binding. */
|
|
|
|
DUK_EXTERNAL void duk_def_prop(duk_context *ctx, duk_idx_t obj_idx, duk_uint_t flags) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_idx_t idx_base;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hstring *key;
|
|
|
|
duk_idx_t idx_value;
|
|
|
|
duk_hobject *get;
|
|
|
|
duk_hobject *set;
|
|
|
|
duk_uint_t is_data_desc;
|
|
|
|
duk_uint_t is_acc_desc;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, obj_idx);
|
|
|
|
|
|
|
|
is_data_desc = flags & (DUK_DEFPROP_HAVE_VALUE | DUK_DEFPROP_HAVE_WRITABLE);
|
|
|
|
is_acc_desc = flags & (DUK_DEFPROP_HAVE_GETTER | DUK_DEFPROP_HAVE_SETTER);
|
|
|
|
if (is_data_desc && is_acc_desc) {
|
|
|
|
/* "Have" flags must not be conflicting so that they would
|
|
|
|
* apply to both a plain property and an accessor at the same
|
|
|
|
* time.
|
|
|
|
*/
|
|
|
|
goto fail_invalid_desc;
|
|
|
|
}
|
|
|
|
|
|
|
|
idx_base = duk_get_top_index(ctx);
|
|
|
|
if (flags & DUK_DEFPROP_HAVE_SETTER) {
|
|
|
|
duk_require_type_mask(ctx, idx_base, DUK_TYPE_MASK_UNDEFINED |
|
|
|
|
DUK_TYPE_MASK_OBJECT |
|
|
|
|
DUK_TYPE_MASK_LIGHTFUNC);
|
|
|
|
set = duk_get_hobject_promote_lfunc(ctx, idx_base);
|
|
|
|
if (set != NULL && !DUK_HOBJECT_IS_CALLABLE(set)) {
|
|
|
|
goto fail_not_callable;
|
|
|
|
}
|
|
|
|
idx_base--;
|
|
|
|
} else {
|
|
|
|
set = NULL;
|
|
|
|
}
|
|
|
|
if (flags & DUK_DEFPROP_HAVE_GETTER) {
|
|
|
|
duk_require_type_mask(ctx, idx_base, DUK_TYPE_MASK_UNDEFINED |
|
|
|
|
DUK_TYPE_MASK_OBJECT |
|
|
|
|
DUK_TYPE_MASK_LIGHTFUNC);
|
|
|
|
get = duk_get_hobject_promote_lfunc(ctx, idx_base);
|
|
|
|
if (get != NULL && !DUK_HOBJECT_IS_CALLABLE(get)) {
|
|
|
|
goto fail_not_callable;
|
|
|
|
}
|
|
|
|
idx_base--;
|
|
|
|
} else {
|
|
|
|
get = NULL;
|
|
|
|
}
|
|
|
|
if (flags & DUK_DEFPROP_HAVE_VALUE) {
|
|
|
|
idx_value = idx_base;
|
|
|
|
idx_base--;
|
|
|
|
} else {
|
|
|
|
idx_value = (duk_idx_t) -1;
|
|
|
|
}
|
|
|
|
key = duk_to_property_key_hstring(ctx, idx_base);
|
|
|
|
DUK_ASSERT(key != NULL);
|
|
|
|
|
|
|
|
duk_require_valid_index(ctx, idx_base);
|
|
|
|
|
|
|
|
duk_hobject_define_property_helper(ctx,
|
|
|
|
flags /*defprop_flags*/,
|
|
|
|
obj,
|
|
|
|
key,
|
|
|
|
idx_value,
|
|
|
|
get,
|
|
|
|
set,
|
|
|
|
1 /*throw_flag*/);
|
|
|
|
|
|
|
|
/* Clean up stack */
|
|
|
|
|
|
|
|
duk_set_top(ctx, idx_base);
|
|
|
|
|
|
|
|
/* [ ... obj ... ] */
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
fail_invalid_desc:
|
|
|
|
DUK_ERROR_TYPE(thr, DUK_STR_INVALID_DESCRIPTOR);
|
|
|
|
return;
|
|
|
|
|
|
|
|
fail_not_callable:
|
|
|
|
DUK_ERROR_TYPE(thr, DUK_STR_NOT_CALLABLE);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Object related
|
|
|
|
*
|
|
|
|
* Note: seal() and freeze() are accessible through Ecmascript bindings,
|
|
|
|
* and are not exposed through the API.
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_compact(duk_context *ctx, duk_idx_t obj_idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj = duk_get_hobject(ctx, obj_idx);
|
|
|
|
if (obj) {
|
|
|
|
/* Note: this may fail, caller should protect the call if necessary */
|
|
|
|
duk_hobject_compact_props(thr, obj);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_INTERNAL void duk_compact_m1(duk_context *ctx) {
|
|
|
|
duk_compact(ctx, -1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* XXX: the duk_hobject_enum.c stack APIs should be reworked */
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_enum(duk_context *ctx, duk_idx_t obj_idx, duk_uint_t enum_flags) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
duk_dup(ctx, obj_idx);
|
|
|
|
duk_require_hobject_promote_mask(ctx, -1, DUK_TYPE_MASK_LIGHTFUNC | DUK_TYPE_MASK_BUFFER);
|
|
|
|
duk_hobject_enumerator_create(ctx, enum_flags); /* [target] -> [enum] */
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_next(duk_context *ctx, duk_idx_t enum_index, duk_bool_t get_value) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
duk_require_hobject(ctx, enum_index);
|
|
|
|
duk_dup(ctx, enum_index);
|
|
|
|
return duk_hobject_enumerator_next(ctx, get_value);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Helpers for writing multiple properties
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_put_function_list(duk_context *ctx, duk_idx_t obj_idx, const duk_function_list_entry *funcs) {
|
|
|
|
const duk_function_list_entry *ent = funcs;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
if (ent != NULL) {
|
|
|
|
while (ent->key != NULL) {
|
|
|
|
duk_push_c_function(ctx, ent->value, ent->nargs);
|
|
|
|
duk_put_prop_string(ctx, obj_idx, ent->key);
|
|
|
|
ent++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_put_number_list(duk_context *ctx, duk_idx_t obj_idx, const duk_number_list_entry *numbers) {
|
|
|
|
const duk_number_list_entry *ent = numbers;
|
|
|
|
duk_tval *tv;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj_idx = duk_require_normalize_index(ctx, obj_idx);
|
|
|
|
if (ent != NULL) {
|
|
|
|
while (ent->key != NULL) {
|
|
|
|
tv = ((duk_hthread *) ctx)->valstack_top++;
|
|
|
|
DUK_ASSERT(DUK_TVAL_IS_UNDEFINED(tv)); /* value stack init policy */
|
|
|
|
DUK_TVAL_SET_NUMBER_CHKFAST_SLOW(tv, ent->value); /* no need for decref/incref */
|
|
|
|
duk_put_prop_string(ctx, obj_idx, ent->key);
|
|
|
|
ent++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Shortcut for accessing global object properties
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_global_string(duk_context *ctx, const char *key) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_bool_t ret;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr->builtins[DUK_BIDX_GLOBAL] != NULL);
|
|
|
|
|
|
|
|
/* XXX: direct implementation */
|
|
|
|
|
|
|
|
duk_push_hobject(ctx, thr->builtins[DUK_BIDX_GLOBAL]);
|
|
|
|
ret = duk_get_prop_string(ctx, -1, key);
|
|
|
|
duk_remove_m2(ctx);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_get_global_lstring(duk_context *ctx, const char *key, duk_size_t key_len) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_bool_t ret;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr->builtins[DUK_BIDX_GLOBAL] != NULL);
|
|
|
|
|
|
|
|
/* XXX: direct implementation */
|
|
|
|
|
|
|
|
duk_push_hobject(ctx, thr->builtins[DUK_BIDX_GLOBAL]);
|
|
|
|
ret = duk_get_prop_lstring(ctx, -1, key, key_len);
|
|
|
|
duk_remove_m2(ctx);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_global_string(duk_context *ctx, const char *key) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_bool_t ret;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr->builtins[DUK_BIDX_GLOBAL] != NULL);
|
|
|
|
|
|
|
|
/* XXX: direct implementation */
|
|
|
|
|
|
|
|
duk_push_hobject(ctx, thr->builtins[DUK_BIDX_GLOBAL]);
|
|
|
|
duk_insert(ctx, -2);
|
|
|
|
ret = duk_put_prop_string(ctx, -2, key); /* [ ... global val ] -> [ ... global ] */
|
|
|
|
duk_pop(ctx);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL duk_bool_t duk_put_global_lstring(duk_context *ctx, const char *key, duk_size_t key_len) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_bool_t ret;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_ASSERT(thr->builtins[DUK_BIDX_GLOBAL] != NULL);
|
|
|
|
|
|
|
|
/* XXX: direct implementation */
|
|
|
|
|
|
|
|
duk_push_hobject(ctx, thr->builtins[DUK_BIDX_GLOBAL]);
|
|
|
|
duk_insert(ctx, -2);
|
|
|
|
ret = duk_put_prop_lstring(ctx, -2, key, key_len); /* [ ... global val ] -> [ ... global ] */
|
|
|
|
duk_pop(ctx);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Object prototype
|
|
|
|
*/
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_get_prototype(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hobject *proto;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_UNREF(thr);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
|
|
|
|
|
|
|
/* XXX: shared helper for duk_push_hobject_or_undefined()? */
|
|
|
|
proto = DUK_HOBJECT_GET_PROTOTYPE(thr->heap, obj);
|
|
|
|
if (proto) {
|
|
|
|
duk_push_hobject(ctx, proto);
|
|
|
|
} else {
|
|
|
|
duk_push_undefined(ctx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_set_prototype(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
duk_hthread *thr = (duk_hthread *) ctx;
|
|
|
|
duk_hobject *obj;
|
|
|
|
duk_hobject *proto;
|
|
|
|
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
obj = duk_require_hobject(ctx, idx);
|
|
|
|
DUK_ASSERT(obj != NULL);
|
|
|
|
duk_require_type_mask(ctx, -1, DUK_TYPE_MASK_UNDEFINED |
|
|
|
|
DUK_TYPE_MASK_OBJECT);
|
|
|
|
proto = duk_get_hobject(ctx, -1);
|
|
|
|
/* proto can also be NULL here (allowed explicitly) */
|
|
|
|
|
|
|
|
#if defined(DUK_USE_ROM_OBJECTS)
|
|
|
|
if (DUK_HEAPHDR_HAS_READONLY((duk_heaphdr *) obj)) {
|
|
|
|
DUK_ERROR_TYPE(thr, DUK_STR_NOT_CONFIGURABLE); /* XXX: "read only object"? */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
DUK_HOBJECT_SET_PROTOTYPE_UPDREF(thr, obj, proto);
|
|
|
|
|
|
|
|
duk_pop(ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Object finalizer
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(DUK_USE_FINALIZER_SUPPORT)
|
|
|
|
/* XXX: these could be implemented as macros calling an internal function
|
|
|
|
* directly.
|
|
|
|
* XXX: same issue as with Duktape.fin: there's no way to delete the property
|
|
|
|
* now (just set it to undefined).
|
|
|
|
*/
|
|
|
|
DUK_EXTERNAL void duk_get_finalizer(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
duk_get_prop_stridx(ctx, idx, DUK_STRIDX_INT_FINALIZER);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_set_finalizer(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
|
|
|
|
duk_put_prop_stridx(ctx, idx, DUK_STRIDX_INT_FINALIZER);
|
|
|
|
}
|
|
|
|
#else /* DUK_USE_FINALIZER_SUPPORT */
|
|
|
|
DUK_EXTERNAL void duk_get_finalizer(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_UNREF(idx);
|
|
|
|
DUK_ERROR_UNSUPPORTED((duk_hthread *) ctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
DUK_EXTERNAL void duk_set_finalizer(duk_context *ctx, duk_idx_t idx) {
|
|
|
|
DUK_ASSERT_CTX_VALID(ctx);
|
|
|
|
DUK_UNREF(idx);
|
|
|
|
DUK_ERROR_UNSUPPORTED((duk_hthread *) ctx);
|
|
|
|
}
|
|
|
|
#endif /* DUK_USE_FINALIZER_SUPPORT */
|