visaljs 0.0.0-stage → 0.0.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +45 -2
- package/cli.js +8084 -0
- package/node/include/js_node.h +46 -0
- package/node/prelude/async_hooks.js +88 -0
- package/node/prelude/buffer.js +31 -0
- package/node/prelude/crypto.js +114 -0
- package/node/prelude/events.js +227 -0
- package/node/prelude/fs.js +79 -0
- package/node/prelude/http.js +536 -0
- package/node/prelude/http2.js +30 -0
- package/node/prelude/internal/crypto/asym.js +333 -0
- package/node/prelude/internal/crypto/cipher.js +205 -0
- package/node/prelude/internal/crypto/hash.js +137 -0
- package/node/prelude/internal/crypto/kdf.js +182 -0
- package/node/prelude/internal/crypto/keys.js +603 -0
- package/node/prelude/internal/crypto/random.js +118 -0
- package/node/prelude/internal/crypto/util.js +76 -0
- package/node/prelude/internal/errors.js +88 -0
- package/node/prelude/internal/querystring.js +105 -0
- package/node/prelude/module.js +53 -0
- package/node/prelude/net.js +51 -0
- package/node/prelude/os.js +129 -0
- package/node/prelude/path.js +257 -0
- package/node/prelude/process.js +21 -0
- package/node/prelude/querystring.js +469 -0
- package/node/prelude/stream.js +1327 -0
- package/node/prelude/stream_promises.js +7 -0
- package/node/prelude/stream_web.js +6 -0
- package/node/prelude/string_decoder.js +236 -0
- package/node/prelude/tty.js +18 -0
- package/node/prelude/url.js +1156 -0
- package/node/prelude/util.js +64 -0
- package/node/prelude/zlib.js +81 -0
- package/node/src/host_fs.c +126 -0
- package/node/src/host_http.c +486 -0
- package/node/src/host_os.c +505 -0
- package/node/src/host_sys.c +78 -0
- package/node/third_party/libuv/LICENSE +19 -0
- package/node/third_party/libuv/include/uv/aix.h +32 -0
- package/node/third_party/libuv/include/uv/bsd.h +34 -0
- package/node/third_party/libuv/include/uv/darwin.h +61 -0
- package/node/third_party/libuv/include/uv/errno.h +483 -0
- package/node/third_party/libuv/include/uv/linux.h +34 -0
- package/node/third_party/libuv/include/uv/os390.h +33 -0
- package/node/third_party/libuv/include/uv/posix.h +31 -0
- package/node/third_party/libuv/include/uv/sunos.h +44 -0
- package/node/third_party/libuv/include/uv/threadpool.h +37 -0
- package/node/third_party/libuv/include/uv/tree.h +521 -0
- package/node/third_party/libuv/include/uv/unix.h +512 -0
- package/node/third_party/libuv/include/uv/version.h +43 -0
- package/node/third_party/libuv/include/uv/win.h +698 -0
- package/node/third_party/libuv/include/uv.h +1990 -0
- package/node/third_party/libuv/src/fs-poll.c +290 -0
- package/node/third_party/libuv/src/heap-inl.h +245 -0
- package/node/third_party/libuv/src/idna.c +560 -0
- package/node/third_party/libuv/src/idna.h +31 -0
- package/node/third_party/libuv/src/inet.c +298 -0
- package/node/third_party/libuv/src/queue.h +90 -0
- package/node/third_party/libuv/src/random.c +123 -0
- package/node/third_party/libuv/src/strscpy.c +38 -0
- package/node/third_party/libuv/src/strscpy.h +39 -0
- package/node/third_party/libuv/src/strtok.c +52 -0
- package/node/third_party/libuv/src/strtok.h +27 -0
- package/node/third_party/libuv/src/thread-common.c +175 -0
- package/node/third_party/libuv/src/threadpool.c +419 -0
- package/node/third_party/libuv/src/timer.c +200 -0
- package/node/third_party/libuv/src/unix/async.c +418 -0
- package/node/third_party/libuv/src/unix/bsd-ifaddrs.c +164 -0
- package/node/third_party/libuv/src/unix/core.c +2104 -0
- package/node/third_party/libuv/src/unix/darwin-proctitle.c +176 -0
- package/node/third_party/libuv/src/unix/darwin-stub.h +97 -0
- package/node/third_party/libuv/src/unix/darwin-syscalls.h +17 -0
- package/node/third_party/libuv/src/unix/darwin.c +237 -0
- package/node/third_party/libuv/src/unix/dl.c +80 -0
- package/node/third_party/libuv/src/unix/fs.c +2303 -0
- package/node/third_party/libuv/src/unix/fsevents.c +906 -0
- package/node/third_party/libuv/src/unix/getaddrinfo.c +252 -0
- package/node/third_party/libuv/src/unix/getnameinfo.c +121 -0
- package/node/third_party/libuv/src/unix/internal.h +530 -0
- package/node/third_party/libuv/src/unix/kqueue.c +667 -0
- package/node/third_party/libuv/src/unix/linux.c +2761 -0
- package/node/third_party/libuv/src/unix/loop-watcher.c +68 -0
- package/node/third_party/libuv/src/unix/loop.c +240 -0
- package/node/third_party/libuv/src/unix/pipe.c +555 -0
- package/node/third_party/libuv/src/unix/poll.c +159 -0
- package/node/third_party/libuv/src/unix/process.c +1123 -0
- package/node/third_party/libuv/src/unix/procfs-exepath.c +45 -0
- package/node/third_party/libuv/src/unix/proctitle.c +157 -0
- package/node/third_party/libuv/src/unix/random-devurandom.c +93 -0
- package/node/third_party/libuv/src/unix/random-getentropy.c +57 -0
- package/node/third_party/libuv/src/unix/random-getrandom.c +86 -0
- package/node/third_party/libuv/src/unix/random-sysctl-linux.c +99 -0
- package/node/third_party/libuv/src/unix/signal.c +581 -0
- package/node/third_party/libuv/src/unix/stream.c +1567 -0
- package/node/third_party/libuv/src/unix/tcp.c +673 -0
- package/node/third_party/libuv/src/unix/thread.c +975 -0
- package/node/third_party/libuv/src/unix/tty.c +510 -0
- package/node/third_party/libuv/src/unix/udp.c +1434 -0
- package/node/third_party/libuv/src/uv-common.c +1051 -0
- package/node/third_party/libuv/src/uv-common.h +474 -0
- package/node/third_party/libuv/src/uv-data-getter-setters.c +119 -0
- package/node/third_party/libuv/src/version.c +45 -0
- package/node/third_party/llhttp/LICENSE +22 -0
- package/node/third_party/llhttp/api.c +509 -0
- package/node/third_party/llhttp/http.c +170 -0
- package/node/third_party/llhttp/llhttp.c +10099 -0
- package/node/third_party/llhttp/llhttp.h +907 -0
- package/package.json +25 -4
- package/runtime/include/js_atoms.gen.h +68 -0
- package/runtime/include/js_atoms.h +54 -0
- package/runtime/include/js_bigint.h +93 -0
- package/runtime/include/js_buffer.h +79 -0
- package/runtime/include/js_builtins.h +168 -0
- package/runtime/include/js_console.h +58 -0
- package/runtime/include/js_convert.h +22 -0
- package/runtime/include/js_core.def +188 -0
- package/runtime/include/js_crypto.h +58 -0
- package/runtime/include/js_error.h +37 -0
- package/runtime/include/js_exception.h +65 -0
- package/runtime/include/js_function.h +167 -0
- package/runtime/include/js_gc.h +195 -0
- package/runtime/include/js_generator.h +96 -0
- package/runtime/include/js_host.h +19 -0
- package/runtime/include/js_jobs.h +84 -0
- package/runtime/include/js_module.h +16 -0
- package/runtime/include/js_object.h +384 -0
- package/runtime/include/js_ops.h +111 -0
- package/runtime/include/js_promise.h +45 -0
- package/runtime/include/js_regexp.h +25 -0
- package/runtime/include/js_runtime.h +30 -0
- package/runtime/include/js_symbol.h +62 -0
- package/runtime/include/js_web.h +110 -0
- package/runtime/include/jscell.h +48 -0
- package/runtime/include/jscontext.h +240 -0
- package/runtime/include/jsnum.h +42 -0
- package/runtime/include/jsstring.h +161 -0
- package/runtime/include/jsvalue.h +142 -0
- package/runtime/src/arguments.c +115 -0
- package/runtime/src/array.c +1145 -0
- package/runtime/src/arraybuffer.c +608 -0
- package/runtime/src/async_iter.c +479 -0
- package/runtime/src/atoms.c +157 -0
- package/runtime/src/base64.c +107 -0
- package/runtime/src/bigint.c +1189 -0
- package/runtime/src/blob.c +371 -0
- package/runtime/src/buffer.c +1357 -0
- package/runtime/src/builtin_table.c +100 -0
- package/runtime/src/builtins.c +987 -0
- package/runtime/src/builtins_util.h +53 -0
- package/runtime/src/collections.c +912 -0
- package/runtime/src/components.c +28 -0
- package/runtime/src/console.c +637 -0
- package/runtime/src/convert.c +82 -0
- package/runtime/src/core_all.c +21 -0
- package/runtime/src/crypto.c +116 -0
- package/runtime/src/crypto_asym.c +644 -0
- package/runtime/src/crypto_cipher.c +671 -0
- package/runtime/src/crypto_hash.c +260 -0
- package/runtime/src/crypto_host.c +414 -0
- package/runtime/src/crypto_internal.h +304 -0
- package/runtime/src/crypto_kdf.c +143 -0
- package/runtime/src/crypto_key.c +171 -0
- package/runtime/src/crypto_pkey.c +794 -0
- package/runtime/src/crypto_subtle.c +1675 -0
- package/runtime/src/date.c +940 -0
- package/runtime/src/domexception.c +169 -0
- package/runtime/src/elements.c +312 -0
- package/runtime/src/elements.h +45 -0
- package/runtime/src/encoding.c +485 -0
- package/runtime/src/error.c +297 -0
- package/runtime/src/events.c +793 -0
- package/runtime/src/exception.c +56 -0
- package/runtime/src/fetch.c +772 -0
- package/runtime/src/function.c +530 -0
- package/runtime/src/gc.c +803 -0
- package/runtime/src/generator.c +218 -0
- package/runtime/src/global.c +119 -0
- package/runtime/src/headers.c +557 -0
- package/runtime/src/inspect.c +1792 -0
- package/runtime/src/internal.h +80 -0
- package/runtime/src/iterate.c +94 -0
- package/runtime/src/iterator.c +409 -0
- package/runtime/src/jobs.c +337 -0
- package/runtime/src/jsnum.c +353 -0
- package/runtime/src/json.c +1028 -0
- package/runtime/src/math.c +243 -0
- package/runtime/src/module.c +336 -0
- package/runtime/src/number.c +176 -0
- package/runtime/src/object.c +1265 -0
- package/runtime/src/ops.c +322 -0
- package/runtime/src/os.c +196 -0
- package/runtime/src/os.h +29 -0
- package/runtime/src/process.c +432 -0
- package/runtime/src/promise.c +721 -0
- package/runtime/src/proxy.c +570 -0
- package/runtime/src/reflect.c +194 -0
- package/runtime/src/regexp.c +1141 -0
- package/runtime/src/regexp_anchor.h +34 -0
- package/runtime/src/regexp_message.h +32 -0
- package/runtime/src/shape.c +294 -0
- package/runtime/src/shape.h +46 -0
- package/runtime/src/streams.c +1046 -0
- package/runtime/src/streams.h +47 -0
- package/runtime/src/string.c +364 -0
- package/runtime/src/string_builtins.c +837 -0
- package/runtime/src/symbol.c +143 -0
- package/runtime/src/test_host.c +59 -0
- package/runtime/src/typedarray.c +1330 -0
- package/runtime/src/tznames.gen.h +712 -0
- package/runtime/src/uri.c +169 -0
- package/runtime/src/url.c +2116 -0
- package/runtime/src/weak.c +486 -0
- package/runtime/src/web.c +214 -0
- package/runtime/src/wrapper.c +59 -0
- package/runtime/src/writable.c +1486 -0
- package/runtime/third_party/ada-idna/LICENSE-MIT +18 -0
- package/runtime/third_party/ada-idna/README.md +27 -0
- package/runtime/third_party/ada-idna/convert.mjs +83 -0
- package/runtime/third_party/ada-idna/idna.c +416 -0
- package/runtime/third_party/ada-idna/idna.h +15 -0
- package/runtime/third_party/ada-idna/idna_tables.h +2657 -0
- package/runtime/third_party/bearssl/LICENSE.txt +21 -0
- package/runtime/third_party/bearssl/README.txt +136 -0
- package/runtime/third_party/bearssl/VERSION +1 -0
- package/runtime/third_party/bearssl/inc/bearssl.h +183 -0
- package/runtime/third_party/bearssl/inc/bearssl_aead.h +1059 -0
- package/runtime/third_party/bearssl/inc/bearssl_block.h +2618 -0
- package/runtime/third_party/bearssl/inc/bearssl_ec.h +967 -0
- package/runtime/third_party/bearssl/inc/bearssl_hash.h +1346 -0
- package/runtime/third_party/bearssl/inc/bearssl_hmac.h +241 -0
- package/runtime/third_party/bearssl/inc/bearssl_kdf.h +284 -0
- package/runtime/third_party/bearssl/inc/bearssl_pem.h +294 -0
- package/runtime/third_party/bearssl/inc/bearssl_prf.h +150 -0
- package/runtime/third_party/bearssl/inc/bearssl_rand.h +397 -0
- package/runtime/third_party/bearssl/inc/bearssl_rsa.h +1655 -0
- package/runtime/third_party/bearssl/inc/bearssl_ssl.h +4296 -0
- package/runtime/third_party/bearssl/inc/bearssl_x509.h +1474 -0
- package/runtime/third_party/bearssl/src/aead/ccm.c +346 -0
- package/runtime/third_party/bearssl/src/aead/eax.c +525 -0
- package/runtime/third_party/bearssl/src/aead/gcm.c +318 -0
- package/runtime/third_party/bearssl/src/codec/ccopy.c +44 -0
- package/runtime/third_party/bearssl/src/codec/dec16be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/dec16le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/dec32be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/dec32le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/dec64be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/dec64le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc16be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc16le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc32be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc32le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc64be.c +38 -0
- package/runtime/third_party/bearssl/src/codec/enc64le.c +38 -0
- package/runtime/third_party/bearssl/src/codec/pemdec.c +526 -0
- package/runtime/third_party/bearssl/src/codec/pemdec.t0 +314 -0
- package/runtime/third_party/bearssl/src/codec/pemenc.c +173 -0
- package/runtime/third_party/bearssl/src/config.h +247 -0
- package/runtime/third_party/bearssl/src/ec/ec_all_m15.c +121 -0
- package/runtime/third_party/bearssl/src/ec/ec_all_m31.c +171 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_i15.c +398 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_i31.c +390 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_m15.c +1478 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_m31.c +800 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_m62.c +605 -0
- package/runtime/third_party/bearssl/src/ec/ec_c25519_m64.c +831 -0
- package/runtime/third_party/bearssl/src/ec/ec_curve25519.c +46 -0
- package/runtime/third_party/bearssl/src/ec/ec_default.c +36 -0
- package/runtime/third_party/bearssl/src/ec/ec_keygen.c +86 -0
- package/runtime/third_party/bearssl/src/ec/ec_p256_m15.c +2124 -0
- package/runtime/third_party/bearssl/src/ec/ec_p256_m31.c +1469 -0
- package/runtime/third_party/bearssl/src/ec/ec_p256_m62.c +1765 -0
- package/runtime/third_party/bearssl/src/ec/ec_p256_m64.c +1781 -0
- package/runtime/third_party/bearssl/src/ec/ec_prime_i15.c +824 -0
- package/runtime/third_party/bearssl/src/ec/ec_prime_i31.c +826 -0
- package/runtime/third_party/bearssl/src/ec/ec_pubkey.c +85 -0
- package/runtime/third_party/bearssl/src/ec/ec_secp256r1.c +51 -0
- package/runtime/third_party/bearssl/src/ec/ec_secp384r1.c +57 -0
- package/runtime/third_party/bearssl/src/ec/ec_secp521r1.c +64 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_atr.c +134 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_default_sign_asn1.c +36 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_default_sign_raw.c +36 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_default_vrfy_asn1.c +36 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_default_vrfy_raw.c +36 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i15_bits.c +47 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i15_sign_asn1.c +45 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i15_sign_raw.c +174 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i15_vrfy_asn1.c +48 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i15_vrfy_raw.c +166 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i31_bits.c +47 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i31_sign_asn1.c +45 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i31_sign_raw.c +173 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i31_vrfy_asn1.c +48 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_i31_vrfy_raw.c +165 -0
- package/runtime/third_party/bearssl/src/ec/ecdsa_rta.c +121 -0
- package/runtime/third_party/bearssl/src/hash/dig_oid.c +84 -0
- package/runtime/third_party/bearssl/src/hash/dig_size.c +50 -0
- package/runtime/third_party/bearssl/src/hash/ghash_ctmul.c +345 -0
- package/runtime/third_party/bearssl/src/hash/ghash_ctmul32.c +251 -0
- package/runtime/third_party/bearssl/src/hash/ghash_ctmul64.c +154 -0
- package/runtime/third_party/bearssl/src/hash/ghash_pclmul.c +389 -0
- package/runtime/third_party/bearssl/src/hash/ghash_pwr8.c +411 -0
- package/runtime/third_party/bearssl/src/hash/md5.c +208 -0
- package/runtime/third_party/bearssl/src/hash/md5sha1.c +141 -0
- package/runtime/third_party/bearssl/src/hash/mgf1.c +56 -0
- package/runtime/third_party/bearssl/src/hash/multihash.c +166 -0
- package/runtime/third_party/bearssl/src/hash/sha1.c +191 -0
- package/runtime/third_party/bearssl/src/hash/sha2big.c +285 -0
- package/runtime/third_party/bearssl/src/hash/sha2small.c +341 -0
- package/runtime/third_party/bearssl/src/inner.h +2577 -0
- package/runtime/third_party/bearssl/src/int/i15_add.c +46 -0
- package/runtime/third_party/bearssl/src/int/i15_bitlen.c +44 -0
- package/runtime/third_party/bearssl/src/int/i15_decmod.c +124 -0
- package/runtime/third_party/bearssl/src/int/i15_decode.c +56 -0
- package/runtime/third_party/bearssl/src/int/i15_decred.c +100 -0
- package/runtime/third_party/bearssl/src/int/i15_encode.c +56 -0
- package/runtime/third_party/bearssl/src/int/i15_fmont.c +59 -0
- package/runtime/third_party/bearssl/src/int/i15_iszero.c +39 -0
- package/runtime/third_party/bearssl/src/int/i15_moddiv.c +465 -0
- package/runtime/third_party/bearssl/src/int/i15_modpow.c +50 -0
- package/runtime/third_party/bearssl/src/int/i15_modpow2.c +160 -0
- package/runtime/third_party/bearssl/src/int/i15_montmul.c +184 -0
- package/runtime/third_party/bearssl/src/int/i15_mulacc.c +61 -0
- package/runtime/third_party/bearssl/src/int/i15_muladd.c +173 -0
- package/runtime/third_party/bearssl/src/int/i15_ninv15.c +38 -0
- package/runtime/third_party/bearssl/src/int/i15_reduce.c +66 -0
- package/runtime/third_party/bearssl/src/int/i15_rshift.c +47 -0
- package/runtime/third_party/bearssl/src/int/i15_sub.c +46 -0
- package/runtime/third_party/bearssl/src/int/i15_tmont.c +36 -0
- package/runtime/third_party/bearssl/src/int/i31_add.c +46 -0
- package/runtime/third_party/bearssl/src/int/i31_bitlen.c +44 -0
- package/runtime/third_party/bearssl/src/int/i31_decmod.c +124 -0
- package/runtime/third_party/bearssl/src/int/i31_decode.c +57 -0
- package/runtime/third_party/bearssl/src/int/i31_decred.c +103 -0
- package/runtime/third_party/bearssl/src/int/i31_encode.c +79 -0
- package/runtime/third_party/bearssl/src/int/i31_fmont.c +60 -0
- package/runtime/third_party/bearssl/src/int/i31_iszero.c +39 -0
- package/runtime/third_party/bearssl/src/int/i31_moddiv.c +488 -0
- package/runtime/third_party/bearssl/src/int/i31_modpow.c +65 -0
- package/runtime/third_party/bearssl/src/int/i31_modpow2.c +160 -0
- package/runtime/third_party/bearssl/src/int/i31_montmul.c +127 -0
- package/runtime/third_party/bearssl/src/int/i31_mulacc.c +74 -0
- package/runtime/third_party/bearssl/src/int/i31_muladd.c +157 -0
- package/runtime/third_party/bearssl/src/int/i31_ninv31.c +39 -0
- package/runtime/third_party/bearssl/src/int/i31_reduce.c +66 -0
- package/runtime/third_party/bearssl/src/int/i31_rshift.c +47 -0
- package/runtime/third_party/bearssl/src/int/i31_sub.c +46 -0
- package/runtime/third_party/bearssl/src/int/i31_tmont.c +36 -0
- package/runtime/third_party/bearssl/src/int/i32_add.c +51 -0
- package/runtime/third_party/bearssl/src/int/i32_bitlen.c +44 -0
- package/runtime/third_party/bearssl/src/int/i32_decmod.c +77 -0
- package/runtime/third_party/bearssl/src/int/i32_decode.c +63 -0
- package/runtime/third_party/bearssl/src/int/i32_decred.c +107 -0
- package/runtime/third_party/bearssl/src/int/i32_div32.c +56 -0
- package/runtime/third_party/bearssl/src/int/i32_encode.c +72 -0
- package/runtime/third_party/bearssl/src/int/i32_fmont.c +60 -0
- package/runtime/third_party/bearssl/src/int/i32_iszero.c +39 -0
- package/runtime/third_party/bearssl/src/int/i32_modpow.c +65 -0
- package/runtime/third_party/bearssl/src/int/i32_montmul.c +69 -0
- package/runtime/third_party/bearssl/src/int/i32_mulacc.c +56 -0
- package/runtime/third_party/bearssl/src/int/i32_muladd.c +138 -0
- package/runtime/third_party/bearssl/src/int/i32_ninv32.c +39 -0
- package/runtime/third_party/bearssl/src/int/i32_reduce.c +66 -0
- package/runtime/third_party/bearssl/src/int/i32_sub.c +51 -0
- package/runtime/third_party/bearssl/src/int/i32_tmont.c +36 -0
- package/runtime/third_party/bearssl/src/int/i62_modpow2.c +493 -0
- package/runtime/third_party/bearssl/src/kdf/hkdf.c +107 -0
- package/runtime/third_party/bearssl/src/kdf/shake.c +590 -0
- package/runtime/third_party/bearssl/src/mac/hmac.c +122 -0
- package/runtime/third_party/bearssl/src/mac/hmac_ct.c +193 -0
- package/runtime/third_party/bearssl/src/rand/aesctr_drbg.c +206 -0
- package/runtime/third_party/bearssl/src/rand/hmac_drbg.c +157 -0
- package/runtime/third_party/bearssl/src/rand/sysrng.c +252 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_keygen.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_modulus.c +36 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_oaep_decrypt.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_oaep_encrypt.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pkcs1_sign.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pkcs1_vrfy.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_priv.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_privexp.c +36 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pss_sign.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pss_vrfy.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pub.c +38 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_default_pubexp.c +36 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_keygen.c +583 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_modulus.c +99 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_oaep_decrypt.c +41 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_oaep_encrypt.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pkcs1_sign.c +37 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pkcs1_vrfy.c +43 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_priv.c +209 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_privexp.c +320 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pss_sign.c +40 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pss_vrfy.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pub.c +113 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i15_pubexp.c +152 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_keygen.c +37 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_keygen_inner.c +608 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_modulus.c +99 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_oaep_decrypt.c +41 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_oaep_encrypt.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pkcs1_sign.c +37 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pkcs1_vrfy.c +43 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_priv.c +203 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_privexp.c +318 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pss_sign.c +40 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pss_vrfy.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pub.c +106 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i31_pubexp.c +152 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_oaep_decrypt.c +41 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_oaep_encrypt.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_pkcs1_sign.c +37 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_pkcs1_vrfy.c +43 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_priv.c +160 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_pss_sign.c +40 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_pss_vrfy.c +44 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i32_pub.c +77 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_keygen.c +57 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_oaep_decrypt.c +61 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_oaep_encrypt.c +64 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_pkcs1_sign.c +57 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_pkcs1_vrfy.c +63 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_priv.c +223 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_pss_sign.c +60 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_pss_vrfy.c +64 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_i62_pub.c +125 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_oaep_pad.c +112 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_oaep_unpad.c +145 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_pkcs1_sig_pad.c +100 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_pkcs1_sig_unpad.c +121 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_pss_sig_pad.c +106 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_pss_sig_unpad.c +121 -0
- package/runtime/third_party/bearssl/src/rsa/rsa_ssl_decrypt.c +52 -0
- package/runtime/third_party/bearssl/src/settings.c +306 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_cbcdec.c +69 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_cbcenc.c +67 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_ctr.c +84 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_ctrcbc.c +142 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_dec.c +254 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_big_enc.c +157 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_common.c +112 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct.c +328 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64.c +398 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_cbcdec.c +104 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_cbcenc.c +81 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_ctr.c +114 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_ctrcbc.c +433 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_dec.c +159 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct64_enc.c +115 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_cbcdec.c +111 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_cbcenc.c +91 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_ctr.c +116 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_ctrcbc.c +422 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_dec.c +170 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_ct_enc.c +112 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_pwr8.c +445 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_pwr8_cbcdec.c +670 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_pwr8_cbcenc.c +417 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_pwr8_ctr.c +717 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_pwr8_ctrcbc.c +946 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_cbcdec.c +69 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_cbcenc.c +67 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_ctr.c +84 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_ctrcbc.c +142 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_dec.c +176 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_small_enc.c +129 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_x86ni.c +240 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_x86ni_cbcdec.c +223 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_x86ni_cbcenc.c +122 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_x86ni_ctr.c +211 -0
- package/runtime/third_party/bearssl/src/symcipher/aes_x86ni_ctrcbc.c +596 -0
- package/runtime/third_party/bearssl/src/symcipher/chacha20_ct.c +106 -0
- package/runtime/third_party/bearssl/src/symcipher/chacha20_sse2.c +237 -0
- package/runtime/third_party/bearssl/src/symcipher/des_ct.c +411 -0
- package/runtime/third_party/bearssl/src/symcipher/des_ct_cbcdec.c +87 -0
- package/runtime/third_party/bearssl/src/symcipher/des_ct_cbcenc.c +69 -0
- package/runtime/third_party/bearssl/src/symcipher/des_support.c +166 -0
- package/runtime/third_party/bearssl/src/symcipher/des_tab.c +310 -0
- package/runtime/third_party/bearssl/src/symcipher/des_tab_cbcdec.c +85 -0
- package/runtime/third_party/bearssl/src/symcipher/des_tab_cbcenc.c +67 -0
- package/runtime/third_party/bearssl/src/symcipher/poly1305_ctmul.c +260 -0
- package/runtime/third_party/bearssl/src/symcipher/poly1305_ctmul32.c +297 -0
- package/runtime/third_party/bearssl/src/symcipher/poly1305_ctmulq.c +475 -0
- package/runtime/third_party/bearssl/src/symcipher/poly1305_i15.c +221 -0
- package/runtime/third_party/bearssl/src/x509/asn1.t0 +757 -0
- package/runtime/third_party/bearssl/src/x509/asn1enc.c +93 -0
- package/runtime/third_party/bearssl/src/x509/encode_ec_pk8der.c +110 -0
- package/runtime/third_party/bearssl/src/x509/encode_ec_rawder.c +161 -0
- package/runtime/third_party/bearssl/src/x509/encode_rsa_pk8der.c +97 -0
- package/runtime/third_party/bearssl/src/x509/encode_rsa_rawder.c +96 -0
- package/runtime/third_party/bearssl/src/x509/skey_decoder.c +653 -0
- package/runtime/third_party/bearssl/src/x509/skey_decoder.t0 +376 -0
- package/runtime/third_party/bearssl/src/x509/x509_decoder.c +776 -0
- package/runtime/third_party/bearssl/src/x509/x509_decoder.t0 +324 -0
- package/runtime/third_party/bearssl/src/x509/x509_knownkey.c +105 -0
- package/runtime/third_party/bearssl/src/x509/x509_minimal.c +1722 -0
- package/runtime/third_party/bearssl/src/x509/x509_minimal.t0 +1526 -0
- package/runtime/third_party/bearssl/src/x509/x509_minimal_full.c +59 -0
- package/runtime/third_party/quickjs-dtoa/LICENSE +22 -0
- package/runtime/third_party/quickjs-dtoa/README.md +23 -0
- package/runtime/third_party/quickjs-dtoa/dtoa.c +1640 -0
- package/runtime/third_party/quickjs-dtoa/dtoa.h +83 -0
- package/runtime/third_party/quickjs-dtoa/dtoa_compat.h +89 -0
- package/runtime/third_party/quickjs-regexp/LICENSE +22 -0
- package/runtime/third_party/quickjs-regexp/README.md +22 -0
- package/runtime/third_party/quickjs-regexp/cutils.c +641 -0
- package/runtime/third_party/quickjs-regexp/cutils.h +457 -0
- package/runtime/third_party/quickjs-regexp/libregexp-opcode.h +73 -0
- package/runtime/third_party/quickjs-regexp/libregexp.c +3448 -0
- package/runtime/third_party/quickjs-regexp/libregexp.h +65 -0
- package/runtime/third_party/quickjs-regexp/libunicode-table.h +5206 -0
- package/runtime/third_party/quickjs-regexp/libunicode.c +2124 -0
- package/runtime/third_party/quickjs-regexp/libunicode.h +196 -0
- package/runtime/third_party/v8-ieee754/LICENSE +61 -0
- package/runtime/third_party/v8-ieee754/README.md +22 -0
- package/runtime/third_party/v8-ieee754/convert.py +84 -0
- package/runtime/third_party/v8-ieee754/ieee754.c +3030 -0
- package/runtime/third_party/v8-ieee754/ieee754.h +27 -0
- package/runtime/tools/regexp_compile.c +90 -0
|
@@ -0,0 +1,1145 @@
|
|
|
1
|
+
/* Array and Array.prototype (§23.1): core built-ins (ADR 0014). The methods are generic, as
|
|
2
|
+
* the spec makes them: they work on any array-like through Get/Set/HasProperty/Delete, so
|
|
3
|
+
* holes, getters and proxies-to-come behave as in V8. Methods that create arrays honour
|
|
4
|
+
* Symbol.species (ArraySpeciesCreate). */
|
|
5
|
+
#include "builtins_util.h"
|
|
6
|
+
|
|
7
|
+
#include <math.h>
|
|
8
|
+
#include <stdlib.h>
|
|
9
|
+
#include <string.h>
|
|
10
|
+
|
|
11
|
+
#include "internal.h"
|
|
12
|
+
#include "js_atoms.h"
|
|
13
|
+
#include "js_convert.h"
|
|
14
|
+
#include "js_error.h"
|
|
15
|
+
#include "js_exception.h"
|
|
16
|
+
#include "js_generator.h"
|
|
17
|
+
#include "js_promise.h"
|
|
18
|
+
#include "js_ops.h"
|
|
19
|
+
#include "jsstring.h"
|
|
20
|
+
|
|
21
|
+
/* ---- Abstract operations ------------------------------------------------------------------ */
|
|
22
|
+
|
|
23
|
+
static JSValue get_index(JSContext *ctx, JSValue o, double i) {
|
|
24
|
+
JSValue k = js_index_key_of(ctx, i);
|
|
25
|
+
return js_is_exception(k) ? k : js_get_value(ctx, o, k);
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
static int has_index(JSContext *ctx, JSValue o, double i) {
|
|
29
|
+
JSValue k = js_index_key_of(ctx, i);
|
|
30
|
+
return js_is_exception(k) ? -1 : js_has_value(ctx, o, k);
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
static int set_index(JSContext *ctx, JSValue o, double i, JSValue v) {
|
|
34
|
+
JSValue k = js_index_key_of(ctx, i);
|
|
35
|
+
return js_is_exception(k) ? -1 : js_set_value(ctx, o, k, v, true);
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
static int delete_index(JSContext *ctx, JSValue o, double i) {
|
|
39
|
+
JSValue k = js_index_key_of(ctx, i);
|
|
40
|
+
if (js_is_exception(k)) return -1;
|
|
41
|
+
return js_is_exception(js_delete_value(ctx, o, k, true)) ? -1 : 0;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
static int create_index(JSContext *ctx, JSValue o, double i, JSValue v) {
|
|
45
|
+
JSValue k = js_index_key_of(ctx, i);
|
|
46
|
+
return js_is_exception(k) ? -1 : js_create_data_property(ctx, o, k, v);
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
static int set_length(JSContext *ctx, JSValue o, double len) {
|
|
50
|
+
return js_set_value(ctx, o, JS_ATOM(length), js_number(len), true) < 0 ? -1 : 0;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
/* The receiver and its length: ToObject(this) (primitives stay primitive: their indexed
|
|
54
|
+
* properties are readable through Get), LengthOfArrayLike. */
|
|
55
|
+
static int receiver(JSContext *ctx, JSValue this_val, const char *method, double *len) {
|
|
56
|
+
if (!js_require_this(ctx, this_val, method)) return -1;
|
|
57
|
+
return js_length_of_array_like(ctx, this_val, len);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
/* ArrayCreate (§10.4.2.2) */
|
|
61
|
+
static JSValue array_create(JSContext *ctx, double length) {
|
|
62
|
+
if (length > JS_MAX_ARRAY_LENGTH) return js_throw_range_error(ctx, "Invalid array length");
|
|
63
|
+
JSValue a = js_new_array(ctx, 0);
|
|
64
|
+
if (js_is_exception(a) || (length != 0 && set_length(ctx, a, length) < 0)) return JS_EXCEPTION;
|
|
65
|
+
return a;
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
static JSValue array_ctor(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target);
|
|
69
|
+
|
|
70
|
+
/* ArraySpeciesCreate (§10.4.2.3) */
|
|
71
|
+
static JSValue array_species_create(JSContext *ctx, JSValue original, double length) {
|
|
72
|
+
int is_array = js_is_array_spec(ctx, original);
|
|
73
|
+
if (is_array < 0) return JS_EXCEPTION;
|
|
74
|
+
if (!is_array) return array_create(ctx, length);
|
|
75
|
+
JSValue c = js_get_value(ctx, original, JS_ATOM(constructor));
|
|
76
|
+
if (js_is_exception(c)) return c;
|
|
77
|
+
/* another realm's %Array% counts as none: arrays stay in the caller's realm */
|
|
78
|
+
if (js_is_function(c) && js_as_function(c)->entry == array_ctor && js_as_function(c)->realm != ctx) c = JS_UNDEFINED;
|
|
79
|
+
if (js_is_object(c)) {
|
|
80
|
+
c = js_get_value(ctx, c, JS_SYMBOL(species));
|
|
81
|
+
if (js_is_exception(c)) return c;
|
|
82
|
+
if (js_is_null(c)) c = JS_UNDEFINED;
|
|
83
|
+
}
|
|
84
|
+
if (js_is_undefined(c)) return array_create(ctx, length);
|
|
85
|
+
if (!js_is_constructor(c)) return js_throw_type_error(ctx, "object.constructor[Symbol.species] is not a constructor");
|
|
86
|
+
JSValue n = js_number(length);
|
|
87
|
+
return js_construct(ctx, c, 1, &n, c, NULL);
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
static bool callable_or_throw(JSContext *ctx, JSValue f) {
|
|
91
|
+
if (js_is_callable(f)) return true;
|
|
92
|
+
js_discard(js_throw_type_error(ctx, "%s is not a function", "callback"));
|
|
93
|
+
return false;
|
|
94
|
+
}
|
|
95
|
+
|
|
96
|
+
/* ---- Array (§23.1.1, §23.1.2) ------------------------------------------------------------------ */
|
|
97
|
+
|
|
98
|
+
static JSValue array_ctor(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
99
|
+
(void)this_val;
|
|
100
|
+
JSValue proto = ctx->intrinsics[JS_INTRINSIC_ARRAY_PROTOTYPE];
|
|
101
|
+
if (!js_is_undefined(new_target) && !js_same_bits(new_target, callee)) {
|
|
102
|
+
proto = js_get_prototype_from_constructor(ctx, new_target, JS_INTRINSIC_ARRAY_PROTOTYPE);
|
|
103
|
+
if (js_is_exception(proto)) return JS_EXCEPTION;
|
|
104
|
+
}
|
|
105
|
+
JSValue a;
|
|
106
|
+
if (argc == 1 && js_is_number(argv[0])) {
|
|
107
|
+
double d = js_as_number(argv[0]);
|
|
108
|
+
if (d < 0 || d > JS_MAX_ARRAY_LENGTH || d != floor(d)) return js_throw_range_error(ctx, "Invalid array length");
|
|
109
|
+
a = array_create(ctx, d);
|
|
110
|
+
} else {
|
|
111
|
+
a = js_new_array_from(ctx, argv, argc);
|
|
112
|
+
}
|
|
113
|
+
if (js_is_exception(a)) return a;
|
|
114
|
+
if (!js_same_bits(proto, ctx->intrinsics[JS_INTRINSIC_ARRAY_PROTOTYPE]) && js_set_prototype_of(ctx, js_as_object(a), proto) < 0)
|
|
115
|
+
return JS_EXCEPTION;
|
|
116
|
+
return a;
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
CORE(array_is_array) {
|
|
120
|
+
UNUSED_ARGS;
|
|
121
|
+
int r = js_is_array_spec(ctx, ARG(0));
|
|
122
|
+
return r < 0 ? JS_EXCEPTION : js_bool(r);
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
/* A new array for Array.from / Array.of: Construct(C, args) when `this` is a constructor. */
|
|
126
|
+
static JSValue construct_or_array(JSContext *ctx, JSValue c, bool with_length, double length) {
|
|
127
|
+
if (!js_is_constructor(c)) return array_create(ctx, with_length ? length : 0);
|
|
128
|
+
JSValue n = js_number(length);
|
|
129
|
+
return js_construct(ctx, c, with_length ? 1 : 0, &n, c, NULL);
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
/* Array.from(items, mapfn, thisArg) (§23.1.2.1) */
|
|
133
|
+
CORE(array_from) {
|
|
134
|
+
UNUSED_ARGS;
|
|
135
|
+
JSValue items = ARG(0), mapfn = ARG(1), this_arg = ARG(2);
|
|
136
|
+
bool mapping = !js_is_undefined(mapfn);
|
|
137
|
+
if (mapping && !callable_or_throw(ctx, mapfn)) return JS_EXCEPTION;
|
|
138
|
+
if (js_is_nullish(items)) return js_throw_type_error(ctx, "%s is not iterable", js_is_null(items) ? "null" : "undefined");
|
|
139
|
+
JSValue using_iterator = js_get_value(ctx, items, JS_SYMBOL(iterator));
|
|
140
|
+
if (js_is_exception(using_iterator)) return using_iterator;
|
|
141
|
+
if (!js_is_nullish(using_iterator)) {
|
|
142
|
+
JSValue a = construct_or_array(ctx, this_val, false, 0);
|
|
143
|
+
if (js_is_exception(a)) return a;
|
|
144
|
+
JSValue rec = js_iter_start(ctx, items);
|
|
145
|
+
if (js_is_exception(rec)) return rec;
|
|
146
|
+
for (double k = 0;; k++) {
|
|
147
|
+
JSValue v = js_iter_next(ctx, rec);
|
|
148
|
+
if (js_is_exception(v)) return v;
|
|
149
|
+
if (js_is_empty(v)) return set_length(ctx, a, k) < 0 ? JS_EXCEPTION : a;
|
|
150
|
+
if (mapping) {
|
|
151
|
+
JSValue args[2] = { v, js_number(k) };
|
|
152
|
+
v = js_call(ctx, mapfn, this_arg, 2, args);
|
|
153
|
+
}
|
|
154
|
+
if (js_is_exception(v) || create_index(ctx, a, k, v) < 0) {
|
|
155
|
+
js_iter_close_throw(ctx, rec);
|
|
156
|
+
return JS_EXCEPTION;
|
|
157
|
+
}
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
double len;
|
|
161
|
+
if (js_length_of_array_like(ctx, items, &len) < 0) return JS_EXCEPTION;
|
|
162
|
+
JSValue a = construct_or_array(ctx, this_val, true, len);
|
|
163
|
+
if (js_is_exception(a)) return a;
|
|
164
|
+
for (double k = 0; k < len; k++) {
|
|
165
|
+
JSValue v = get_index(ctx, items, k);
|
|
166
|
+
if (!js_is_exception(v) && mapping) {
|
|
167
|
+
JSValue args[2] = { v, js_number(k) };
|
|
168
|
+
v = js_call(ctx, mapfn, this_arg, 2, args);
|
|
169
|
+
}
|
|
170
|
+
if (js_is_exception(v) || create_index(ctx, a, k, v) < 0) return JS_EXCEPTION;
|
|
171
|
+
}
|
|
172
|
+
return set_length(ctx, a, len) < 0 ? JS_EXCEPTION : a;
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
/* Array.of(...items) (§23.1.2.3) */
|
|
176
|
+
CORE(array_of) {
|
|
177
|
+
UNUSED_ARGS;
|
|
178
|
+
JSValue a = construct_or_array(ctx, this_val, true, argc);
|
|
179
|
+
if (js_is_exception(a)) return a;
|
|
180
|
+
for (uint32_t k = 0; k < argc; k++)
|
|
181
|
+
if (create_index(ctx, a, k, argv[k]) < 0) return JS_EXCEPTION;
|
|
182
|
+
return set_length(ctx, a, argc) < 0 ? JS_EXCEPTION : a;
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
CORE(array_species) {
|
|
186
|
+
UNUSED_ARGS;
|
|
187
|
+
return this_val;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
/* ---- Array.fromAsync (ES2026) --------------------------------------- */
|
|
191
|
+
|
|
192
|
+
/* fromAsync's state, one per call: what its async steps share. Its slots: */
|
|
193
|
+
enum { FA_PROMISE, FA_ARRAY, FA_SOURCE, FA_MAPFN, FA_THIS_ARG, FA_K, FA_LEN, FA_ITERATING, FA_SLOTS };
|
|
194
|
+
|
|
195
|
+
static JSValue fa_get(JSValue st, int slot) {
|
|
196
|
+
return ((JSValueArray *)js_as_cell(st))->values[slot];
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
static void fa_set(JSContext *ctx, JSValue st, int slot, JSValue v) {
|
|
200
|
+
JSValueArray *a = (JSValueArray *)js_as_cell(st);
|
|
201
|
+
js_store(ctx, &a->cell, &a->values[slot], v);
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
static void fa_step(JSContext *ctx, JSValue st);
|
|
205
|
+
|
|
206
|
+
/* Rejects the result with the pending exception. */
|
|
207
|
+
static void fa_reject(JSContext *ctx, JSValue st) {
|
|
208
|
+
js_promise_reject_internal(ctx, fa_get(st, FA_PROMISE), js_take_exception(ctx));
|
|
209
|
+
}
|
|
210
|
+
|
|
211
|
+
/* A reaction closure bound to the state (its home_object slot). */
|
|
212
|
+
static JSValue fa_closure(JSContext *ctx, JSNativeFn fn, JSValue st) {
|
|
213
|
+
JSValue f = js_new_native(ctx, fn, js_empty_string(), 1, JS_FN_STRICT);
|
|
214
|
+
if (!js_is_exception(f)) js_set_home_object(ctx, f, st);
|
|
215
|
+
return f;
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
/* Await(v): when it settles, `on_fulfilled` or `on_rejected` runs with the state. */
|
|
219
|
+
static void fa_await(JSContext *ctx, JSValue st, JSValue v, JSNativeFn on_fulfilled, JSNativeFn on_rejected) {
|
|
220
|
+
JSValue p = js_promise_resolve(ctx, v);
|
|
221
|
+
JSValue f = js_is_exception(p) ? p : fa_closure(ctx, on_fulfilled, st);
|
|
222
|
+
JSValue r = js_is_exception(f) ? f : fa_closure(ctx, on_rejected, st);
|
|
223
|
+
if (js_is_exception(r)) {
|
|
224
|
+
fa_reject(ctx, st);
|
|
225
|
+
return;
|
|
226
|
+
}
|
|
227
|
+
js_promise_then_internal(ctx, p, f, r, JS_UNDEFINED);
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
#define FA_STATE js_as_function(callee)->home_object
|
|
231
|
+
|
|
232
|
+
/* An abrupt completion inside the iteration: AsyncIteratorClose, then reject with it. */
|
|
233
|
+
static JSValue fa_close_rejected(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target);
|
|
234
|
+
|
|
235
|
+
static void fa_fail(JSContext *ctx, JSValue st) {
|
|
236
|
+
JSValue error = js_take_exception(ctx);
|
|
237
|
+
if (js_truthy(fa_get(st, FA_ITERATING))) {
|
|
238
|
+
fa_set(ctx, st, FA_K, error); /* kept for after return() settles */
|
|
239
|
+
JSValue awaited = js_async_iter_return(ctx, fa_get(st, FA_SOURCE));
|
|
240
|
+
if (!js_is_exception(awaited) && !js_is_empty(awaited)) {
|
|
241
|
+
fa_await(ctx, st, awaited, fa_close_rejected, fa_close_rejected);
|
|
242
|
+
return;
|
|
243
|
+
}
|
|
244
|
+
if (js_is_exception(awaited)) js_discard(js_take_exception(ctx)); /* the original error wins */
|
|
245
|
+
}
|
|
246
|
+
js_promise_reject_internal(ctx, fa_get(st, FA_PROMISE), error);
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
static JSValue fa_close_rejected(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
250
|
+
(void)this_val, (void)argc, (void)argv, (void)new_target;
|
|
251
|
+
JSValue st = FA_STATE;
|
|
252
|
+
js_promise_reject_internal(ctx, fa_get(st, FA_PROMISE), fa_get(st, FA_K));
|
|
253
|
+
return JS_UNDEFINED;
|
|
254
|
+
}
|
|
255
|
+
|
|
256
|
+
static JSValue fa_rejected(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
257
|
+
(void)this_val, (void)new_target;
|
|
258
|
+
js_promise_reject_internal(ctx, fa_get(FA_STATE, FA_PROMISE), ARG(0));
|
|
259
|
+
return JS_UNDEFINED;
|
|
260
|
+
}
|
|
261
|
+
|
|
262
|
+
/* A mapped value rejected: close the iterator, then reject. */
|
|
263
|
+
static JSValue fa_mapped_rejected(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
264
|
+
(void)this_val, (void)new_target;
|
|
265
|
+
JSValue e = js_throw(ctx, ARG(0));
|
|
266
|
+
(void)e;
|
|
267
|
+
fa_fail(ctx, FA_STATE);
|
|
268
|
+
return JS_UNDEFINED;
|
|
269
|
+
}
|
|
270
|
+
|
|
271
|
+
/* The element (mapped, awaited): A[k] = v, then the next one. */
|
|
272
|
+
static JSValue fa_store(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
273
|
+
(void)this_val, (void)new_target;
|
|
274
|
+
JSValue st = FA_STATE;
|
|
275
|
+
double k = js_as_number(fa_get(st, FA_K));
|
|
276
|
+
if (create_index(ctx, fa_get(st, FA_ARRAY), k, ARG(0)) < 0) {
|
|
277
|
+
fa_fail(ctx, st);
|
|
278
|
+
return JS_UNDEFINED;
|
|
279
|
+
}
|
|
280
|
+
fa_set(ctx, st, FA_K, js_number(k + 1));
|
|
281
|
+
fa_step(ctx, st);
|
|
282
|
+
return JS_UNDEFINED;
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
/* A value: mapped and awaited (mapfn), or stored. */
|
|
286
|
+
static void fa_value(JSContext *ctx, JSValue st, JSValue v) {
|
|
287
|
+
JSValue mapfn = fa_get(st, FA_MAPFN);
|
|
288
|
+
if (js_is_undefined(mapfn)) {
|
|
289
|
+
JSValue args[1] = { v };
|
|
290
|
+
JSValue f = fa_closure(ctx, fa_store, st);
|
|
291
|
+
if (js_is_exception(f)) {
|
|
292
|
+
fa_fail(ctx, st);
|
|
293
|
+
return;
|
|
294
|
+
}
|
|
295
|
+
fa_store(ctx, f, JS_UNDEFINED, 1, args, JS_UNDEFINED);
|
|
296
|
+
return;
|
|
297
|
+
}
|
|
298
|
+
JSValue args[2] = { v, fa_get(st, FA_K) };
|
|
299
|
+
JSValue mapped = js_call(ctx, mapfn, fa_get(st, FA_THIS_ARG), 2, args);
|
|
300
|
+
if (js_is_exception(mapped)) {
|
|
301
|
+
fa_fail(ctx, st);
|
|
302
|
+
return;
|
|
303
|
+
}
|
|
304
|
+
fa_await(ctx, st, mapped, fa_store, fa_mapped_rejected);
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
/* An array-like's element, awaited. */
|
|
308
|
+
static JSValue fa_element(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
309
|
+
(void)this_val, (void)new_target;
|
|
310
|
+
fa_value(ctx, FA_STATE, ARG(0));
|
|
311
|
+
return JS_UNDEFINED;
|
|
312
|
+
}
|
|
313
|
+
|
|
314
|
+
/* An iterator result, awaited: done, or a value. */
|
|
315
|
+
static JSValue fa_result(JSContext *ctx, JSValue callee, JSValue this_val, uint32_t argc, const JSValue *argv, JSValue new_target) {
|
|
316
|
+
(void)this_val, (void)new_target;
|
|
317
|
+
JSValue st = FA_STATE;
|
|
318
|
+
fa_set(ctx, st, FA_ITERATING, JS_FALSE); /* errors reading the result don't close the iterator */
|
|
319
|
+
JSValue v = js_async_iter_value(ctx, fa_get(st, FA_SOURCE), ARG(0));
|
|
320
|
+
if (js_is_exception(v)) {
|
|
321
|
+
fa_reject(ctx, st);
|
|
322
|
+
return JS_UNDEFINED;
|
|
323
|
+
}
|
|
324
|
+
if (js_is_empty(v)) { /* done */
|
|
325
|
+
JSValue a = fa_get(st, FA_ARRAY);
|
|
326
|
+
if (set_length(ctx, a, js_as_number(fa_get(st, FA_K))) < 0) fa_reject(ctx, st);
|
|
327
|
+
else js_promise_resolve_internal(ctx, fa_get(st, FA_PROMISE), a);
|
|
328
|
+
return JS_UNDEFINED;
|
|
329
|
+
}
|
|
330
|
+
fa_set(ctx, st, FA_ITERATING, JS_TRUE);
|
|
331
|
+
fa_value(ctx, st, v);
|
|
332
|
+
return JS_UNDEFINED;
|
|
333
|
+
}
|
|
334
|
+
|
|
335
|
+
static void fa_step(JSContext *ctx, JSValue st) {
|
|
336
|
+
double k = js_as_number(fa_get(st, FA_K));
|
|
337
|
+
if (js_is_undefined(fa_get(st, FA_LEN))) { /* an iterator */
|
|
338
|
+
if (k >= JS_MAX_SAFE_INTEGER) {
|
|
339
|
+
js_discard(js_throw_type_error(ctx, "Invalid array length"));
|
|
340
|
+
fa_fail(ctx, st);
|
|
341
|
+
return;
|
|
342
|
+
}
|
|
343
|
+
fa_set(ctx, st, FA_ITERATING, JS_FALSE);
|
|
344
|
+
JSValue next = js_async_iter_next(ctx, fa_get(st, FA_SOURCE));
|
|
345
|
+
if (js_is_exception(next)) {
|
|
346
|
+
fa_reject(ctx, st);
|
|
347
|
+
return;
|
|
348
|
+
}
|
|
349
|
+
fa_await(ctx, st, next, fa_result, fa_rejected);
|
|
350
|
+
return;
|
|
351
|
+
}
|
|
352
|
+
JSValue a = fa_get(st, FA_ARRAY);
|
|
353
|
+
if (k >= js_as_number(fa_get(st, FA_LEN))) {
|
|
354
|
+
if (set_length(ctx, a, k) < 0) fa_reject(ctx, st);
|
|
355
|
+
else js_promise_resolve_internal(ctx, fa_get(st, FA_PROMISE), a);
|
|
356
|
+
return;
|
|
357
|
+
}
|
|
358
|
+
JSValue v = get_index(ctx, fa_get(st, FA_SOURCE), k);
|
|
359
|
+
if (js_is_exception(v)) {
|
|
360
|
+
fa_reject(ctx, st);
|
|
361
|
+
return;
|
|
362
|
+
}
|
|
363
|
+
fa_await(ctx, st, v, fa_element, fa_rejected);
|
|
364
|
+
}
|
|
365
|
+
|
|
366
|
+
/* Array.fromAsync(items, mapfn, thisArg): a promise of the array; every value (and mapped
|
|
367
|
+
* value) is awaited in turn, as an async function would. */
|
|
368
|
+
CORE(array_from_async) {
|
|
369
|
+
UNUSED_ARGS;
|
|
370
|
+
JSValue promise = js_new_promise(ctx);
|
|
371
|
+
if (js_is_exception(promise)) return promise;
|
|
372
|
+
JSValue st = js_cell(&js_alloc_value_array(ctx, FA_SLOTS)->cell);
|
|
373
|
+
for (int i = 0; i < FA_SLOTS; i++) fa_set(ctx, st, i, JS_UNDEFINED);
|
|
374
|
+
fa_set(ctx, st, FA_PROMISE, promise);
|
|
375
|
+
fa_set(ctx, st, FA_K, js_int32(0));
|
|
376
|
+
fa_set(ctx, st, FA_ITERATING, JS_FALSE);
|
|
377
|
+
JSValue items = ARG(0), mapfn = ARG(1);
|
|
378
|
+
if (!js_is_undefined(mapfn) && !js_is_callable(mapfn)) {
|
|
379
|
+
js_discard(js_throw_type_error(ctx, "%s is not a function", "mapfn"));
|
|
380
|
+
fa_reject(ctx, st);
|
|
381
|
+
return promise;
|
|
382
|
+
}
|
|
383
|
+
fa_set(ctx, st, FA_MAPFN, mapfn);
|
|
384
|
+
fa_set(ctx, st, FA_THIS_ARG, ARG(2));
|
|
385
|
+
if (js_is_nullish(items)) {
|
|
386
|
+
js_discard(js_throw_type_error(ctx, "%s is not iterable", js_is_null(items) ? "null" : "undefined"));
|
|
387
|
+
fa_reject(ctx, st);
|
|
388
|
+
return promise;
|
|
389
|
+
}
|
|
390
|
+
JSValue async_method = js_get_value(ctx, items, JS_SYMBOL(asyncIterator));
|
|
391
|
+
JSValue sync_method = js_is_exception(async_method) || !js_is_nullish(async_method) ? JS_UNDEFINED : js_get_value(ctx, items, JS_SYMBOL(iterator));
|
|
392
|
+
if (js_is_exception(async_method) || js_is_exception(sync_method)) {
|
|
393
|
+
fa_reject(ctx, st);
|
|
394
|
+
return promise;
|
|
395
|
+
}
|
|
396
|
+
if (!js_is_nullish(async_method) || !js_is_nullish(sync_method)) {
|
|
397
|
+
JSValue a = construct_or_array(ctx, this_val, false, 0);
|
|
398
|
+
JSValue rec = js_is_exception(a) ? a : js_async_iter_start(ctx, items);
|
|
399
|
+
if (js_is_exception(rec)) {
|
|
400
|
+
fa_reject(ctx, st);
|
|
401
|
+
return promise;
|
|
402
|
+
}
|
|
403
|
+
fa_set(ctx, st, FA_ARRAY, a);
|
|
404
|
+
fa_set(ctx, st, FA_SOURCE, rec);
|
|
405
|
+
} else {
|
|
406
|
+
double len;
|
|
407
|
+
if (js_length_of_array_like(ctx, items, &len) < 0) {
|
|
408
|
+
fa_reject(ctx, st);
|
|
409
|
+
return promise;
|
|
410
|
+
}
|
|
411
|
+
JSValue a = construct_or_array(ctx, this_val, true, len);
|
|
412
|
+
if (js_is_exception(a)) {
|
|
413
|
+
fa_reject(ctx, st);
|
|
414
|
+
return promise;
|
|
415
|
+
}
|
|
416
|
+
fa_set(ctx, st, FA_ARRAY, a);
|
|
417
|
+
fa_set(ctx, st, FA_SOURCE, items);
|
|
418
|
+
fa_set(ctx, st, FA_LEN, js_number(len));
|
|
419
|
+
}
|
|
420
|
+
fa_step(ctx, st);
|
|
421
|
+
return promise;
|
|
422
|
+
}
|
|
423
|
+
|
|
424
|
+
/* ---- Array.prototype (§23.1.3) -------------------------------------------------------------- */
|
|
425
|
+
|
|
426
|
+
CORE(array_proto_at) {
|
|
427
|
+
UNUSED_ARGS;
|
|
428
|
+
double len, rel;
|
|
429
|
+
if (receiver(ctx, this_val, "Array.prototype.at", &len) < 0 || js_to_integer_or_infinity(ctx, &rel, ARG(0)) < 0) return JS_EXCEPTION;
|
|
430
|
+
double k = rel >= 0 ? rel : len + rel;
|
|
431
|
+
if (k < 0 || k >= len) return JS_UNDEFINED;
|
|
432
|
+
return get_index(ctx, this_val, k);
|
|
433
|
+
}
|
|
434
|
+
|
|
435
|
+
/* IsConcatSpreadable (§23.1.3.2.1) */
|
|
436
|
+
static int is_concat_spreadable(JSContext *ctx, JSValue v) {
|
|
437
|
+
if (!js_is_object(v)) return 0;
|
|
438
|
+
JSValue s = js_get_value(ctx, v, JS_SYMBOL(isConcatSpreadable));
|
|
439
|
+
if (js_is_exception(s)) return -1;
|
|
440
|
+
if (!js_is_undefined(s)) return js_truthy(s);
|
|
441
|
+
return js_is_array_spec(ctx, v);
|
|
442
|
+
}
|
|
443
|
+
|
|
444
|
+
CORE(array_proto_concat) {
|
|
445
|
+
UNUSED_ARGS;
|
|
446
|
+
if (!js_require_this(ctx, this_val, "Array.prototype.concat")) return JS_EXCEPTION;
|
|
447
|
+
JSValue a = array_species_create(ctx, this_val, 0);
|
|
448
|
+
if (js_is_exception(a)) return a;
|
|
449
|
+
double n = 0;
|
|
450
|
+
for (uint32_t i = 0; i <= argc; i++) {
|
|
451
|
+
JSValue e = i == 0 ? this_val : argv[i - 1];
|
|
452
|
+
int spreadable = is_concat_spreadable(ctx, e);
|
|
453
|
+
if (spreadable < 0) return JS_EXCEPTION;
|
|
454
|
+
if (spreadable) {
|
|
455
|
+
double len;
|
|
456
|
+
if (js_length_of_array_like(ctx, e, &len) < 0) return JS_EXCEPTION;
|
|
457
|
+
if (n + len > JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Invalid array length");
|
|
458
|
+
for (double k = 0; k < len; k++, n++) {
|
|
459
|
+
int has = has_index(ctx, e, k);
|
|
460
|
+
if (has < 0) return JS_EXCEPTION;
|
|
461
|
+
if (!has) continue;
|
|
462
|
+
JSValue v = get_index(ctx, e, k);
|
|
463
|
+
if (js_is_exception(v) || create_index(ctx, a, n, v) < 0) return JS_EXCEPTION;
|
|
464
|
+
}
|
|
465
|
+
} else {
|
|
466
|
+
if (n >= JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Invalid array length");
|
|
467
|
+
if (create_index(ctx, a, n++, e) < 0) return JS_EXCEPTION;
|
|
468
|
+
}
|
|
469
|
+
}
|
|
470
|
+
return set_length(ctx, a, n) < 0 ? JS_EXCEPTION : a;
|
|
471
|
+
}
|
|
472
|
+
|
|
473
|
+
CORE(array_proto_copy_within) {
|
|
474
|
+
UNUSED_ARGS;
|
|
475
|
+
double len, to, from, final;
|
|
476
|
+
if (receiver(ctx, this_val, "Array.prototype.copyWithin", &len) < 0) return JS_EXCEPTION;
|
|
477
|
+
if (js_relative_index(ctx, ARG(0), len, 0, &to) < 0 || js_relative_index(ctx, ARG(1), len, 0, &from) < 0 ||
|
|
478
|
+
js_relative_index(ctx, ARG(2), len, len, &final) < 0)
|
|
479
|
+
return JS_EXCEPTION;
|
|
480
|
+
double count = fmin(final - from, len - to);
|
|
481
|
+
double dir = 1;
|
|
482
|
+
if (from < to && to < from + count) {
|
|
483
|
+
dir = -1;
|
|
484
|
+
from += count - 1;
|
|
485
|
+
to += count - 1;
|
|
486
|
+
}
|
|
487
|
+
for (; count > 0; count--, from += dir, to += dir) {
|
|
488
|
+
int has = has_index(ctx, this_val, from);
|
|
489
|
+
if (has < 0) return JS_EXCEPTION;
|
|
490
|
+
if (has) {
|
|
491
|
+
JSValue v = get_index(ctx, this_val, from);
|
|
492
|
+
if (js_is_exception(v) || set_index(ctx, this_val, to, v) < 0) return JS_EXCEPTION;
|
|
493
|
+
} else if (delete_index(ctx, this_val, to) < 0) {
|
|
494
|
+
return JS_EXCEPTION;
|
|
495
|
+
}
|
|
496
|
+
}
|
|
497
|
+
return this_val;
|
|
498
|
+
}
|
|
499
|
+
|
|
500
|
+
CORE(array_proto_fill) {
|
|
501
|
+
UNUSED_ARGS;
|
|
502
|
+
double len, k, final;
|
|
503
|
+
if (receiver(ctx, this_val, "Array.prototype.fill", &len) < 0) return JS_EXCEPTION;
|
|
504
|
+
if (js_relative_index(ctx, ARG(1), len, 0, &k) < 0 || js_relative_index(ctx, ARG(2), len, len, &final) < 0) return JS_EXCEPTION;
|
|
505
|
+
for (; k < final; k++)
|
|
506
|
+
if (set_index(ctx, this_val, k, ARG(0)) < 0) return JS_EXCEPTION;
|
|
507
|
+
return this_val;
|
|
508
|
+
}
|
|
509
|
+
|
|
510
|
+
/* find, findIndex, findLast, findLastIndex: every index (holes are undefined), in order. */
|
|
511
|
+
static JSValue find(JSContext *ctx, JSValue o, uint32_t argc, const JSValue *argv, bool last, bool index, const char *method) {
|
|
512
|
+
double len;
|
|
513
|
+
if (receiver(ctx, o, method, &len) < 0 || !callable_or_throw(ctx, ARG(0))) return JS_EXCEPTION;
|
|
514
|
+
for (double i = 0; i < len; i++) {
|
|
515
|
+
double k = last ? len - 1 - i : i;
|
|
516
|
+
JSValue v = get_index(ctx, o, k);
|
|
517
|
+
if (js_is_exception(v)) return v;
|
|
518
|
+
JSValue args[3] = { v, js_number(k), o };
|
|
519
|
+
JSValue r = js_call(ctx, ARG(0), ARG(1), 3, args);
|
|
520
|
+
if (js_is_exception(r)) return r;
|
|
521
|
+
if (js_truthy(r)) return index ? js_number(k) : v;
|
|
522
|
+
}
|
|
523
|
+
return index ? js_int32(-1) : JS_UNDEFINED;
|
|
524
|
+
}
|
|
525
|
+
|
|
526
|
+
CORE(array_proto_find) {
|
|
527
|
+
UNUSED_ARGS;
|
|
528
|
+
return find(ctx, this_val, argc, argv, false, false, "Array.prototype.find");
|
|
529
|
+
}
|
|
530
|
+
|
|
531
|
+
CORE(array_proto_find_index) {
|
|
532
|
+
UNUSED_ARGS;
|
|
533
|
+
return find(ctx, this_val, argc, argv, false, true, "Array.prototype.findIndex");
|
|
534
|
+
}
|
|
535
|
+
|
|
536
|
+
CORE(array_proto_find_last) {
|
|
537
|
+
UNUSED_ARGS;
|
|
538
|
+
return find(ctx, this_val, argc, argv, true, false, "Array.prototype.findLast");
|
|
539
|
+
}
|
|
540
|
+
|
|
541
|
+
CORE(array_proto_find_last_index) {
|
|
542
|
+
UNUSED_ARGS;
|
|
543
|
+
return find(ctx, this_val, argc, argv, true, true, "Array.prototype.findLastIndex");
|
|
544
|
+
}
|
|
545
|
+
|
|
546
|
+
CORE(array_proto_index_of) {
|
|
547
|
+
UNUSED_ARGS;
|
|
548
|
+
double len, from;
|
|
549
|
+
if (receiver(ctx, this_val, "Array.prototype.indexOf", &len) < 0) return JS_EXCEPTION;
|
|
550
|
+
if (len == 0) return js_int32(-1);
|
|
551
|
+
if (js_relative_index(ctx, ARG(1), len, 0, &from) < 0) return JS_EXCEPTION;
|
|
552
|
+
for (double i = from; i < len; i++) {
|
|
553
|
+
int has = has_index(ctx, this_val, i);
|
|
554
|
+
if (has < 0) return JS_EXCEPTION;
|
|
555
|
+
if (!has) continue;
|
|
556
|
+
JSValue e = get_index(ctx, this_val, i);
|
|
557
|
+
if (js_is_exception(e)) return e;
|
|
558
|
+
if (js_truthy(js_strict_eq(ctx, e, ARG(0)))) return js_number(i);
|
|
559
|
+
}
|
|
560
|
+
return js_int32(-1);
|
|
561
|
+
}
|
|
562
|
+
|
|
563
|
+
CORE(array_proto_last_index_of) {
|
|
564
|
+
UNUSED_ARGS;
|
|
565
|
+
double len, n;
|
|
566
|
+
if (receiver(ctx, this_val, "Array.prototype.lastIndexOf", &len) < 0) return JS_EXCEPTION;
|
|
567
|
+
if (len == 0) return js_int32(-1);
|
|
568
|
+
if (argc > 1) {
|
|
569
|
+
if (js_to_integer_or_infinity(ctx, &n, argv[1]) < 0) return JS_EXCEPTION;
|
|
570
|
+
} else {
|
|
571
|
+
n = len - 1;
|
|
572
|
+
}
|
|
573
|
+
if (n == -INFINITY) return js_int32(-1);
|
|
574
|
+
for (double k = n >= 0 ? fmin(n, len - 1) : len + n; k >= 0; k--) {
|
|
575
|
+
int has = has_index(ctx, this_val, k);
|
|
576
|
+
if (has < 0) return JS_EXCEPTION;
|
|
577
|
+
if (!has) continue;
|
|
578
|
+
JSValue e = get_index(ctx, this_val, k);
|
|
579
|
+
if (js_is_exception(e)) return e;
|
|
580
|
+
if (js_truthy(js_strict_eq(ctx, e, ARG(0)))) return js_number(k);
|
|
581
|
+
}
|
|
582
|
+
return js_int32(-1);
|
|
583
|
+
}
|
|
584
|
+
|
|
585
|
+
CORE(array_proto_includes) {
|
|
586
|
+
UNUSED_ARGS;
|
|
587
|
+
double len, from;
|
|
588
|
+
if (receiver(ctx, this_val, "Array.prototype.includes", &len) < 0) return JS_EXCEPTION;
|
|
589
|
+
if (len == 0) return JS_FALSE;
|
|
590
|
+
if (js_relative_index(ctx, ARG(1), len, 0, &from) < 0) return JS_EXCEPTION;
|
|
591
|
+
for (double k = from; k < len; k++) {
|
|
592
|
+
JSValue e = get_index(ctx, this_val, k);
|
|
593
|
+
if (js_is_exception(e)) return e;
|
|
594
|
+
/* SameValueZero: NaN finds NaN, +0 finds -0 */
|
|
595
|
+
if (js_same_value(ctx, e, ARG(0)) || (js_is_number(e) && js_is_number(ARG(0)) && js_as_number(e) == js_as_number(ARG(0))))
|
|
596
|
+
return JS_TRUE;
|
|
597
|
+
}
|
|
598
|
+
return JS_FALSE;
|
|
599
|
+
}
|
|
600
|
+
|
|
601
|
+
CORE(array_proto_push) {
|
|
602
|
+
UNUSED_ARGS;
|
|
603
|
+
if (!js_require_this(ctx, this_val, "Array.prototype.push")) return JS_EXCEPTION;
|
|
604
|
+
if (js_is_array(this_val)) {
|
|
605
|
+
for (uint32_t i = 0; i < argc; i++)
|
|
606
|
+
if (js_array_push(ctx, js_as_object(this_val), argv[i]) < 0) return JS_EXCEPTION;
|
|
607
|
+
return js_number((double)js_array_length(js_as_object(this_val)));
|
|
608
|
+
}
|
|
609
|
+
double len;
|
|
610
|
+
if (js_length_of_array_like(ctx, this_val, &len) < 0) return JS_EXCEPTION;
|
|
611
|
+
if (len + argc > JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Pushing %u elements on an array-like of length %.0f is disallowed", argc, len);
|
|
612
|
+
for (uint32_t i = 0; i < argc; i++)
|
|
613
|
+
if (set_index(ctx, this_val, len + i, argv[i]) < 0) return JS_EXCEPTION;
|
|
614
|
+
return set_length(ctx, this_val, len + argc) < 0 ? JS_EXCEPTION : js_number(len + argc);
|
|
615
|
+
}
|
|
616
|
+
|
|
617
|
+
CORE(array_proto_pop) {
|
|
618
|
+
UNUSED_ARGS;
|
|
619
|
+
double len;
|
|
620
|
+
if (receiver(ctx, this_val, "Array.prototype.pop", &len) < 0) return JS_EXCEPTION;
|
|
621
|
+
if (len == 0) return set_length(ctx, this_val, 0) < 0 ? JS_EXCEPTION : JS_UNDEFINED;
|
|
622
|
+
JSValue v = get_index(ctx, this_val, len - 1);
|
|
623
|
+
if (js_is_exception(v) || delete_index(ctx, this_val, len - 1) < 0 || set_length(ctx, this_val, len - 1) < 0) return JS_EXCEPTION;
|
|
624
|
+
return v;
|
|
625
|
+
}
|
|
626
|
+
|
|
627
|
+
CORE(array_proto_reverse) {
|
|
628
|
+
UNUSED_ARGS;
|
|
629
|
+
double len;
|
|
630
|
+
if (receiver(ctx, this_val, "Array.prototype.reverse", &len) < 0) return JS_EXCEPTION;
|
|
631
|
+
for (double lower = 0, upper = len - 1; lower < upper; lower++, upper--) {
|
|
632
|
+
int has_lower = has_index(ctx, this_val, lower);
|
|
633
|
+
JSValue lv = has_lower > 0 ? get_index(ctx, this_val, lower) : JS_UNDEFINED;
|
|
634
|
+
if (has_lower < 0 || js_is_exception(lv)) return JS_EXCEPTION;
|
|
635
|
+
int has_upper = has_index(ctx, this_val, upper);
|
|
636
|
+
JSValue uv = has_upper > 0 ? get_index(ctx, this_val, upper) : JS_UNDEFINED;
|
|
637
|
+
if (has_upper < 0 || js_is_exception(uv)) return JS_EXCEPTION;
|
|
638
|
+
int r = 0;
|
|
639
|
+
if (has_lower && has_upper) r = set_index(ctx, this_val, lower, uv) < 0 || set_index(ctx, this_val, upper, lv) < 0 ? -1 : 0;
|
|
640
|
+
else if (has_upper) r = set_index(ctx, this_val, lower, uv) < 0 || delete_index(ctx, this_val, upper) < 0 ? -1 : 0;
|
|
641
|
+
else if (has_lower) r = delete_index(ctx, this_val, lower) < 0 || set_index(ctx, this_val, upper, lv) < 0 ? -1 : 0;
|
|
642
|
+
if (r < 0) return JS_EXCEPTION;
|
|
643
|
+
}
|
|
644
|
+
return this_val;
|
|
645
|
+
}
|
|
646
|
+
|
|
647
|
+
/* Moves [from, from + count) to `to` (shift, unshift, splice): holes stay holes. */
|
|
648
|
+
static int move_range(JSContext *ctx, JSValue o, double from, double to, double count, bool backwards) {
|
|
649
|
+
for (double i = 0; i < count; i++) {
|
|
650
|
+
double f = backwards ? from + count - 1 - i : from + i, t = backwards ? to + count - 1 - i : to + i;
|
|
651
|
+
int has = has_index(ctx, o, f);
|
|
652
|
+
if (has < 0) return -1;
|
|
653
|
+
if (has) {
|
|
654
|
+
JSValue v = get_index(ctx, o, f);
|
|
655
|
+
if (js_is_exception(v) || set_index(ctx, o, t, v) < 0) return -1;
|
|
656
|
+
} else if (delete_index(ctx, o, t) < 0) {
|
|
657
|
+
return -1;
|
|
658
|
+
}
|
|
659
|
+
}
|
|
660
|
+
return 0;
|
|
661
|
+
}
|
|
662
|
+
|
|
663
|
+
CORE(array_proto_shift) {
|
|
664
|
+
UNUSED_ARGS;
|
|
665
|
+
double len;
|
|
666
|
+
if (receiver(ctx, this_val, "Array.prototype.shift", &len) < 0) return JS_EXCEPTION;
|
|
667
|
+
if (len == 0) return set_length(ctx, this_val, 0) < 0 ? JS_EXCEPTION : JS_UNDEFINED;
|
|
668
|
+
JSValue first = get_index(ctx, this_val, 0);
|
|
669
|
+
if (js_is_exception(first) || move_range(ctx, this_val, 1, 0, len - 1, false) < 0 ||
|
|
670
|
+
delete_index(ctx, this_val, len - 1) < 0 || set_length(ctx, this_val, len - 1) < 0)
|
|
671
|
+
return JS_EXCEPTION;
|
|
672
|
+
return first;
|
|
673
|
+
}
|
|
674
|
+
|
|
675
|
+
CORE(array_proto_unshift) {
|
|
676
|
+
UNUSED_ARGS;
|
|
677
|
+
double len;
|
|
678
|
+
if (receiver(ctx, this_val, "Array.prototype.unshift", &len) < 0) return JS_EXCEPTION;
|
|
679
|
+
if (argc > 0) {
|
|
680
|
+
if (len + argc > JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Invalid array length");
|
|
681
|
+
if (move_range(ctx, this_val, 0, argc, len, true) < 0) return JS_EXCEPTION;
|
|
682
|
+
for (uint32_t j = 0; j < argc; j++)
|
|
683
|
+
if (set_index(ctx, this_val, j, argv[j]) < 0) return JS_EXCEPTION;
|
|
684
|
+
}
|
|
685
|
+
return set_length(ctx, this_val, len + argc) < 0 ? JS_EXCEPTION : js_number(len + argc);
|
|
686
|
+
}
|
|
687
|
+
|
|
688
|
+
CORE(array_proto_slice) {
|
|
689
|
+
UNUSED_ARGS;
|
|
690
|
+
double len, k, final;
|
|
691
|
+
if (receiver(ctx, this_val, "Array.prototype.slice", &len) < 0) return JS_EXCEPTION;
|
|
692
|
+
if (js_relative_index(ctx, ARG(0), len, 0, &k) < 0 || js_relative_index(ctx, ARG(1), len, len, &final) < 0) return JS_EXCEPTION;
|
|
693
|
+
double count = fmax(final - k, 0);
|
|
694
|
+
JSValue a = array_species_create(ctx, this_val, count);
|
|
695
|
+
if (js_is_exception(a)) return a;
|
|
696
|
+
double n = 0;
|
|
697
|
+
for (; k < final; k++, n++) {
|
|
698
|
+
int has = has_index(ctx, this_val, k);
|
|
699
|
+
if (has < 0) return JS_EXCEPTION;
|
|
700
|
+
if (!has) continue;
|
|
701
|
+
JSValue v = get_index(ctx, this_val, k);
|
|
702
|
+
if (js_is_exception(v) || create_index(ctx, a, n, v) < 0) return JS_EXCEPTION;
|
|
703
|
+
}
|
|
704
|
+
return set_length(ctx, a, n) < 0 ? JS_EXCEPTION : a;
|
|
705
|
+
}
|
|
706
|
+
|
|
707
|
+
CORE(array_proto_splice) {
|
|
708
|
+
UNUSED_ARGS;
|
|
709
|
+
double len, start, delete_count;
|
|
710
|
+
if (receiver(ctx, this_val, "Array.prototype.splice", &len) < 0) return JS_EXCEPTION;
|
|
711
|
+
if (js_relative_index(ctx, ARG(0), len, 0, &start) < 0) return JS_EXCEPTION;
|
|
712
|
+
uint32_t item_count = argc > 2 ? argc - 2 : 0;
|
|
713
|
+
if (argc == 0) {
|
|
714
|
+
delete_count = 0;
|
|
715
|
+
} else if (argc == 1) {
|
|
716
|
+
delete_count = len - start;
|
|
717
|
+
} else {
|
|
718
|
+
if (js_to_integer_or_infinity(ctx, &delete_count, argv[1]) < 0) return JS_EXCEPTION;
|
|
719
|
+
delete_count = fmin(fmax(delete_count, 0), len - start);
|
|
720
|
+
}
|
|
721
|
+
if (len + item_count - delete_count > JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Invalid array length");
|
|
722
|
+
JSValue a = array_species_create(ctx, this_val, delete_count);
|
|
723
|
+
if (js_is_exception(a)) return a;
|
|
724
|
+
for (double k = 0; k < delete_count; k++) {
|
|
725
|
+
int has = has_index(ctx, this_val, start + k);
|
|
726
|
+
if (has < 0) return JS_EXCEPTION;
|
|
727
|
+
if (!has) continue;
|
|
728
|
+
JSValue v = get_index(ctx, this_val, start + k);
|
|
729
|
+
if (js_is_exception(v) || create_index(ctx, a, k, v) < 0) return JS_EXCEPTION;
|
|
730
|
+
}
|
|
731
|
+
if (set_length(ctx, a, delete_count) < 0) return JS_EXCEPTION;
|
|
732
|
+
double tail = len - start - delete_count;
|
|
733
|
+
if (item_count < delete_count) {
|
|
734
|
+
if (move_range(ctx, this_val, start + delete_count, start + item_count, tail, false) < 0) return JS_EXCEPTION;
|
|
735
|
+
for (double k = len; k > len - delete_count + item_count; k--)
|
|
736
|
+
if (delete_index(ctx, this_val, k - 1) < 0) return JS_EXCEPTION;
|
|
737
|
+
} else if (item_count > delete_count) {
|
|
738
|
+
if (move_range(ctx, this_val, start + delete_count, start + item_count, tail, true) < 0) return JS_EXCEPTION;
|
|
739
|
+
}
|
|
740
|
+
for (uint32_t j = 0; j < item_count; j++)
|
|
741
|
+
if (set_index(ctx, this_val, start + j, argv[j + 2]) < 0) return JS_EXCEPTION;
|
|
742
|
+
return set_length(ctx, this_val, len - delete_count + item_count) < 0 ? JS_EXCEPTION : a;
|
|
743
|
+
}
|
|
744
|
+
|
|
745
|
+
/* ---- Sorting (§23.1.3.30.1 SortIndexedProperties, §23.1.3.30.2 CompareArrayElements) ---------- */
|
|
746
|
+
|
|
747
|
+
/* <0, 0, >0; -2 with an exception (as `failed`). undefined sorts last; no comparator compares
|
|
748
|
+
* the strings. */
|
|
749
|
+
static double compare_elements(JSContext *ctx, JSValue comparefn, JSValue x, JSValue y, bool *failed) {
|
|
750
|
+
if (js_is_undefined(x) && js_is_undefined(y)) return 0;
|
|
751
|
+
if (js_is_undefined(x)) return 1;
|
|
752
|
+
if (js_is_undefined(y)) return -1;
|
|
753
|
+
if (!js_is_undefined(comparefn)) {
|
|
754
|
+
JSValue args[2] = { x, y };
|
|
755
|
+
JSValue r = js_call(ctx, comparefn, JS_UNDEFINED, 2, args);
|
|
756
|
+
double d;
|
|
757
|
+
if (js_is_exception(r) || js_to_number(ctx, &d, r)) {
|
|
758
|
+
*failed = true;
|
|
759
|
+
return 0;
|
|
760
|
+
}
|
|
761
|
+
return d != d ? 0 : d;
|
|
762
|
+
}
|
|
763
|
+
JSValue xs = js_to_string(ctx, x);
|
|
764
|
+
JSValue ys = js_is_exception(xs) ? xs : js_to_string(ctx, y);
|
|
765
|
+
if (js_is_exception(ys)) {
|
|
766
|
+
*failed = true;
|
|
767
|
+
return 0;
|
|
768
|
+
}
|
|
769
|
+
return js_string_compare(ctx, xs, ys);
|
|
770
|
+
}
|
|
771
|
+
|
|
772
|
+
/* A stable merge sort; stops at the first exception. */
|
|
773
|
+
static bool merge_sort(JSContext *ctx, JSValue comparefn, JSValue *items, JSValue *tmp, size_t n) {
|
|
774
|
+
for (size_t width = 1; width < n; width *= 2) {
|
|
775
|
+
for (size_t lo = 0; lo < n; lo += 2 * width) {
|
|
776
|
+
size_t mid = lo + width < n ? lo + width : n, hi = lo + 2 * width < n ? lo + 2 * width : n;
|
|
777
|
+
size_t i = lo, j = mid, k = lo;
|
|
778
|
+
while (i < mid && j < hi) {
|
|
779
|
+
bool failed = false;
|
|
780
|
+
double c = compare_elements(ctx, comparefn, items[j], items[i], &failed);
|
|
781
|
+
if (failed) return false;
|
|
782
|
+
tmp[k++] = c < 0 ? items[j++] : items[i++]; /* equal: the left one first (stable) */
|
|
783
|
+
}
|
|
784
|
+
while (i < mid) tmp[k++] = items[i++];
|
|
785
|
+
while (j < hi) tmp[k++] = items[j++];
|
|
786
|
+
}
|
|
787
|
+
memcpy(items, tmp, n * sizeof *items);
|
|
788
|
+
}
|
|
789
|
+
return true;
|
|
790
|
+
}
|
|
791
|
+
|
|
792
|
+
/* The elements [0, len) (holes skipped, or read as undefined), sorted, as a JS array. */
|
|
793
|
+
static JSValue sorted_items(JSContext *ctx, JSValue o, double len, JSValue comparefn, bool skip_holes) {
|
|
794
|
+
JSValue list = js_new_array(ctx, 0);
|
|
795
|
+
if (js_is_exception(list)) return list;
|
|
796
|
+
for (double k = 0; k < len; k++) {
|
|
797
|
+
if (skip_holes) {
|
|
798
|
+
int has = has_index(ctx, o, k);
|
|
799
|
+
if (has < 0) return JS_EXCEPTION;
|
|
800
|
+
if (!has) continue;
|
|
801
|
+
}
|
|
802
|
+
JSValue v = get_index(ctx, o, k);
|
|
803
|
+
if (js_is_exception(v) || js_array_push(ctx, js_as_object(list), v) < 0) return JS_EXCEPTION;
|
|
804
|
+
}
|
|
805
|
+
uint32_t n = js_array_length(js_as_object(list));
|
|
806
|
+
JSValue *items = malloc((n ? n : 1) * 2 * sizeof *items);
|
|
807
|
+
if (!items) js_fatal("out of memory sorting");
|
|
808
|
+
for (uint32_t i = 0; i < n; i++) items[i] = js_get_elem(ctx, list, js_index_key(i));
|
|
809
|
+
/* `list` keeps the elements alive (the scan doesn't see `items`) while comparators run */
|
|
810
|
+
bool ok = merge_sort(ctx, comparefn, items, items + n, n);
|
|
811
|
+
JSValue sorted = ok ? js_new_array_from(ctx, items, n) : JS_EXCEPTION;
|
|
812
|
+
free(items);
|
|
813
|
+
js_keep_alive(list);
|
|
814
|
+
return sorted;
|
|
815
|
+
}
|
|
816
|
+
|
|
817
|
+
static bool comparefn_ok(JSContext *ctx, JSValue comparefn) {
|
|
818
|
+
if (js_is_undefined(comparefn) || js_is_callable(comparefn)) return true;
|
|
819
|
+
js_discard(js_throw_type_error(ctx, "The comparison function must be either a function or undefined"));
|
|
820
|
+
return false;
|
|
821
|
+
}
|
|
822
|
+
|
|
823
|
+
CORE(array_proto_sort) {
|
|
824
|
+
UNUSED_ARGS;
|
|
825
|
+
double len;
|
|
826
|
+
if (!comparefn_ok(ctx, ARG(0)) || receiver(ctx, this_val, "Array.prototype.sort", &len) < 0) return JS_EXCEPTION;
|
|
827
|
+
JSValue sorted = sorted_items(ctx, this_val, len, ARG(0), true);
|
|
828
|
+
if (js_is_exception(sorted)) return sorted;
|
|
829
|
+
uint32_t n = js_array_length(js_as_object(sorted));
|
|
830
|
+
for (uint32_t j = 0; j < n; j++) {
|
|
831
|
+
JSValue v = js_get_elem(ctx, sorted, js_index_key(j));
|
|
832
|
+
if (set_index(ctx, this_val, j, v) < 0) return JS_EXCEPTION;
|
|
833
|
+
}
|
|
834
|
+
for (double j = n; j < len; j++) /* the holes, now at the end */
|
|
835
|
+
if (delete_index(ctx, this_val, j) < 0) return JS_EXCEPTION;
|
|
836
|
+
return this_val;
|
|
837
|
+
}
|
|
838
|
+
|
|
839
|
+
CORE(array_proto_to_sorted) {
|
|
840
|
+
UNUSED_ARGS;
|
|
841
|
+
double len;
|
|
842
|
+
if (!comparefn_ok(ctx, ARG(0)) || receiver(ctx, this_val, "Array.prototype.toSorted", &len) < 0) return JS_EXCEPTION;
|
|
843
|
+
if (len > JS_MAX_ARRAY_LENGTH) return js_throw_range_error(ctx, "Invalid array length");
|
|
844
|
+
return sorted_items(ctx, this_val, len, ARG(0), false);
|
|
845
|
+
}
|
|
846
|
+
|
|
847
|
+
/* ---- Iteration with callbacks -------------------------------------------------------------- */
|
|
848
|
+
|
|
849
|
+
enum { FOR_EACH, MAP, FILTER, EVERY, SOME };
|
|
850
|
+
|
|
851
|
+
/* forEach, map, filter, every, some (§23.1.3.15 …): callback(value, index, o) over present elements. */
|
|
852
|
+
static JSValue iterate(JSContext *ctx, JSValue o, uint32_t argc, const JSValue *argv, int kind, const char *method) {
|
|
853
|
+
double len;
|
|
854
|
+
if (receiver(ctx, o, method, &len) < 0 || !callable_or_throw(ctx, ARG(0))) return JS_EXCEPTION;
|
|
855
|
+
JSValue a = JS_UNDEFINED;
|
|
856
|
+
if (kind == MAP || kind == FILTER) {
|
|
857
|
+
a = array_species_create(ctx, o, kind == MAP ? len : 0);
|
|
858
|
+
if (js_is_exception(a)) return a;
|
|
859
|
+
}
|
|
860
|
+
double to = 0;
|
|
861
|
+
for (double k = 0; k < len; k++) {
|
|
862
|
+
int has = has_index(ctx, o, k);
|
|
863
|
+
if (has < 0) return JS_EXCEPTION;
|
|
864
|
+
if (!has) continue;
|
|
865
|
+
JSValue v = get_index(ctx, o, k);
|
|
866
|
+
if (js_is_exception(v)) return v;
|
|
867
|
+
JSValue args[3] = { v, js_number(k), o };
|
|
868
|
+
JSValue r = js_call(ctx, ARG(0), ARG(1), 3, args);
|
|
869
|
+
if (js_is_exception(r)) return r;
|
|
870
|
+
switch (kind) {
|
|
871
|
+
case MAP:
|
|
872
|
+
if (create_index(ctx, a, k, r) < 0) return JS_EXCEPTION;
|
|
873
|
+
break;
|
|
874
|
+
case FILTER:
|
|
875
|
+
if (js_truthy(r) && create_index(ctx, a, to++, v) < 0) return JS_EXCEPTION;
|
|
876
|
+
break;
|
|
877
|
+
case EVERY:
|
|
878
|
+
if (!js_truthy(r)) return JS_FALSE;
|
|
879
|
+
break;
|
|
880
|
+
case SOME:
|
|
881
|
+
if (js_truthy(r)) return JS_TRUE;
|
|
882
|
+
break;
|
|
883
|
+
}
|
|
884
|
+
}
|
|
885
|
+
return kind == EVERY ? JS_TRUE : kind == SOME ? JS_FALSE : a;
|
|
886
|
+
}
|
|
887
|
+
|
|
888
|
+
CORE(array_proto_for_each) {
|
|
889
|
+
UNUSED_ARGS;
|
|
890
|
+
return iterate(ctx, this_val, argc, argv, FOR_EACH, "Array.prototype.forEach");
|
|
891
|
+
}
|
|
892
|
+
|
|
893
|
+
CORE(array_proto_map) {
|
|
894
|
+
UNUSED_ARGS;
|
|
895
|
+
return iterate(ctx, this_val, argc, argv, MAP, "Array.prototype.map");
|
|
896
|
+
}
|
|
897
|
+
|
|
898
|
+
CORE(array_proto_filter) {
|
|
899
|
+
UNUSED_ARGS;
|
|
900
|
+
return iterate(ctx, this_val, argc, argv, FILTER, "Array.prototype.filter");
|
|
901
|
+
}
|
|
902
|
+
|
|
903
|
+
CORE(array_proto_every) {
|
|
904
|
+
UNUSED_ARGS;
|
|
905
|
+
return iterate(ctx, this_val, argc, argv, EVERY, "Array.prototype.every");
|
|
906
|
+
}
|
|
907
|
+
|
|
908
|
+
CORE(array_proto_some) {
|
|
909
|
+
UNUSED_ARGS;
|
|
910
|
+
return iterate(ctx, this_val, argc, argv, SOME, "Array.prototype.some");
|
|
911
|
+
}
|
|
912
|
+
|
|
913
|
+
/* reduce / reduceRight (§23.1.3.24, §23.1.3.25) */
|
|
914
|
+
static JSValue reduce(JSContext *ctx, JSValue o, uint32_t argc, const JSValue *argv, bool right, const char *method) {
|
|
915
|
+
double len;
|
|
916
|
+
if (receiver(ctx, o, method, &len) < 0 || !callable_or_throw(ctx, ARG(0))) return JS_EXCEPTION;
|
|
917
|
+
double k = 0;
|
|
918
|
+
JSValue acc = JS_UNDEFINED;
|
|
919
|
+
if (argc >= 2) {
|
|
920
|
+
acc = argv[1];
|
|
921
|
+
} else {
|
|
922
|
+
bool found = false;
|
|
923
|
+
for (; k < len && !found; k++) {
|
|
924
|
+
double i = right ? len - 1 - k : k;
|
|
925
|
+
int has = has_index(ctx, o, i);
|
|
926
|
+
if (has < 0) return JS_EXCEPTION;
|
|
927
|
+
if (has) {
|
|
928
|
+
acc = get_index(ctx, o, i);
|
|
929
|
+
if (js_is_exception(acc)) return acc;
|
|
930
|
+
found = true;
|
|
931
|
+
}
|
|
932
|
+
}
|
|
933
|
+
if (!found) return js_throw_type_error(ctx, "Reduce of empty array with no initial value");
|
|
934
|
+
}
|
|
935
|
+
for (; k < len; k++) {
|
|
936
|
+
double i = right ? len - 1 - k : k;
|
|
937
|
+
int has = has_index(ctx, o, i);
|
|
938
|
+
if (has < 0) return JS_EXCEPTION;
|
|
939
|
+
if (!has) continue;
|
|
940
|
+
JSValue v = get_index(ctx, o, i);
|
|
941
|
+
if (js_is_exception(v)) return v;
|
|
942
|
+
JSValue args[4] = { acc, v, js_number(i), o };
|
|
943
|
+
acc = js_call(ctx, ARG(0), JS_UNDEFINED, 4, args);
|
|
944
|
+
if (js_is_exception(acc)) return acc;
|
|
945
|
+
}
|
|
946
|
+
return acc;
|
|
947
|
+
}
|
|
948
|
+
|
|
949
|
+
CORE(array_proto_reduce) {
|
|
950
|
+
UNUSED_ARGS;
|
|
951
|
+
return reduce(ctx, this_val, argc, argv, false, "Array.prototype.reduce");
|
|
952
|
+
}
|
|
953
|
+
|
|
954
|
+
CORE(array_proto_reduce_right) {
|
|
955
|
+
UNUSED_ARGS;
|
|
956
|
+
return reduce(ctx, this_val, argc, argv, true, "Array.prototype.reduceRight");
|
|
957
|
+
}
|
|
958
|
+
|
|
959
|
+
/* FlattenIntoArray (§23.1.3.13.1); returns the next index, or -1. */
|
|
960
|
+
static double flatten_into(JSContext *ctx, JSValue target, JSValue source, double source_len, double start, double depth,
|
|
961
|
+
JSValue mapper, JSValue this_arg) {
|
|
962
|
+
double target_index = start;
|
|
963
|
+
for (double k = 0; k < source_len; k++) {
|
|
964
|
+
int has = has_index(ctx, source, k);
|
|
965
|
+
if (has < 0) return -1;
|
|
966
|
+
if (!has) continue;
|
|
967
|
+
JSValue e = get_index(ctx, source, k);
|
|
968
|
+
if (js_is_exception(e)) return -1;
|
|
969
|
+
if (!js_is_undefined(mapper)) {
|
|
970
|
+
JSValue args[3] = { e, js_number(k), source };
|
|
971
|
+
e = js_call(ctx, mapper, this_arg, 3, args);
|
|
972
|
+
if (js_is_exception(e)) return -1;
|
|
973
|
+
}
|
|
974
|
+
int is_array = depth > 0 ? js_is_array_spec(ctx, e) : 0;
|
|
975
|
+
if (is_array < 0) return -1;
|
|
976
|
+
if (is_array) {
|
|
977
|
+
double len;
|
|
978
|
+
if (js_length_of_array_like(ctx, e, &len) < 0) return -1;
|
|
979
|
+
target_index = flatten_into(ctx, target, e, len, target_index, depth - 1, JS_UNDEFINED, JS_UNDEFINED);
|
|
980
|
+
if (target_index < 0) return -1;
|
|
981
|
+
} else {
|
|
982
|
+
if (target_index >= JS_MAX_SAFE_INTEGER) {
|
|
983
|
+
js_discard(js_throw_type_error(ctx, "Invalid array length"));
|
|
984
|
+
return -1;
|
|
985
|
+
}
|
|
986
|
+
if (create_index(ctx, target, target_index++, e) < 0) return -1;
|
|
987
|
+
}
|
|
988
|
+
}
|
|
989
|
+
return target_index;
|
|
990
|
+
}
|
|
991
|
+
|
|
992
|
+
CORE(array_proto_flat) {
|
|
993
|
+
UNUSED_ARGS;
|
|
994
|
+
double len, depth = 1;
|
|
995
|
+
if (receiver(ctx, this_val, "Array.prototype.flat", &len) < 0) return JS_EXCEPTION;
|
|
996
|
+
if (!js_is_undefined(ARG(0))) {
|
|
997
|
+
if (js_to_integer_or_infinity(ctx, &depth, ARG(0)) < 0) return JS_EXCEPTION;
|
|
998
|
+
if (depth < 0) depth = 0;
|
|
999
|
+
}
|
|
1000
|
+
JSValue a = array_species_create(ctx, this_val, 0);
|
|
1001
|
+
if (js_is_exception(a)) return a;
|
|
1002
|
+
return flatten_into(ctx, a, this_val, len, 0, depth, JS_UNDEFINED, JS_UNDEFINED) < 0 ? JS_EXCEPTION : a;
|
|
1003
|
+
}
|
|
1004
|
+
|
|
1005
|
+
CORE(array_proto_flat_map) {
|
|
1006
|
+
UNUSED_ARGS;
|
|
1007
|
+
double len;
|
|
1008
|
+
if (receiver(ctx, this_val, "Array.prototype.flatMap", &len) < 0 || !callable_or_throw(ctx, ARG(0))) return JS_EXCEPTION;
|
|
1009
|
+
JSValue a = array_species_create(ctx, this_val, 0);
|
|
1010
|
+
if (js_is_exception(a)) return a;
|
|
1011
|
+
return flatten_into(ctx, a, this_val, len, 0, 1, ARG(0), ARG(1)) < 0 ? JS_EXCEPTION : a;
|
|
1012
|
+
}
|
|
1013
|
+
|
|
1014
|
+
/* ---- Changing copies (ES2023) ----------------------------------------------------------------- */
|
|
1015
|
+
|
|
1016
|
+
CORE(array_proto_to_reversed) {
|
|
1017
|
+
UNUSED_ARGS;
|
|
1018
|
+
double len;
|
|
1019
|
+
if (receiver(ctx, this_val, "Array.prototype.toReversed", &len) < 0) return JS_EXCEPTION;
|
|
1020
|
+
JSValue a = array_create(ctx, len);
|
|
1021
|
+
if (js_is_exception(a)) return a;
|
|
1022
|
+
for (double k = 0; k < len; k++) {
|
|
1023
|
+
JSValue v = get_index(ctx, this_val, len - 1 - k);
|
|
1024
|
+
if (js_is_exception(v) || create_index(ctx, a, k, v) < 0) return JS_EXCEPTION;
|
|
1025
|
+
}
|
|
1026
|
+
return a;
|
|
1027
|
+
}
|
|
1028
|
+
|
|
1029
|
+
CORE(array_proto_to_spliced) {
|
|
1030
|
+
UNUSED_ARGS;
|
|
1031
|
+
double len, start, skip;
|
|
1032
|
+
if (receiver(ctx, this_val, "Array.prototype.toSpliced", &len) < 0) return JS_EXCEPTION;
|
|
1033
|
+
if (js_relative_index(ctx, ARG(0), len, 0, &start) < 0) return JS_EXCEPTION;
|
|
1034
|
+
uint32_t insert = argc > 2 ? argc - 2 : 0;
|
|
1035
|
+
if (argc == 0) {
|
|
1036
|
+
skip = 0;
|
|
1037
|
+
} else if (argc == 1) {
|
|
1038
|
+
skip = len - start;
|
|
1039
|
+
} else {
|
|
1040
|
+
if (js_to_integer_or_infinity(ctx, &skip, argv[1]) < 0) return JS_EXCEPTION;
|
|
1041
|
+
skip = fmin(fmax(skip, 0), len - start);
|
|
1042
|
+
}
|
|
1043
|
+
double new_len = len + insert - skip;
|
|
1044
|
+
if (new_len > JS_MAX_SAFE_INTEGER) return js_throw_type_error(ctx, "Invalid array length");
|
|
1045
|
+
JSValue a = array_create(ctx, new_len);
|
|
1046
|
+
if (js_is_exception(a)) return a;
|
|
1047
|
+
double i = 0;
|
|
1048
|
+
for (; i < start; i++) {
|
|
1049
|
+
JSValue v = get_index(ctx, this_val, i);
|
|
1050
|
+
if (js_is_exception(v) || create_index(ctx, a, i, v) < 0) return JS_EXCEPTION;
|
|
1051
|
+
}
|
|
1052
|
+
for (uint32_t j = 0; j < insert; j++, i++)
|
|
1053
|
+
if (create_index(ctx, a, i, argv[j + 2]) < 0) return JS_EXCEPTION;
|
|
1054
|
+
for (double r = start + skip; i < new_len; i++, r++) {
|
|
1055
|
+
JSValue v = get_index(ctx, this_val, r);
|
|
1056
|
+
if (js_is_exception(v) || create_index(ctx, a, i, v) < 0) return JS_EXCEPTION;
|
|
1057
|
+
}
|
|
1058
|
+
return a;
|
|
1059
|
+
}
|
|
1060
|
+
|
|
1061
|
+
CORE(array_proto_with) {
|
|
1062
|
+
UNUSED_ARGS;
|
|
1063
|
+
double len, rel;
|
|
1064
|
+
if (receiver(ctx, this_val, "Array.prototype.with", &len) < 0 || js_to_integer_or_infinity(ctx, &rel, ARG(0)) < 0) return JS_EXCEPTION;
|
|
1065
|
+
double index = rel >= 0 ? rel : len + rel;
|
|
1066
|
+
if (index >= len || index < 0) return js_throw_range_error(ctx, "Invalid index : %.0f", rel);
|
|
1067
|
+
JSValue a = array_create(ctx, len);
|
|
1068
|
+
if (js_is_exception(a)) return a;
|
|
1069
|
+
for (double k = 0; k < len; k++) {
|
|
1070
|
+
JSValue v = k == index ? ARG(1) : get_index(ctx, this_val, k);
|
|
1071
|
+
if (js_is_exception(v) || create_index(ctx, a, k, v) < 0) return JS_EXCEPTION;
|
|
1072
|
+
}
|
|
1073
|
+
return a;
|
|
1074
|
+
}
|
|
1075
|
+
|
|
1076
|
+
/* ---- Strings ------------------------------------------------------------------------------------- */
|
|
1077
|
+
|
|
1078
|
+
static JSValue join(JSContext *ctx, JSValue o, JSValue sep_arg, bool locale) {
|
|
1079
|
+
double len;
|
|
1080
|
+
if (receiver(ctx, o, locale ? "Array.prototype.toLocaleString" : "Array.prototype.join", &len) < 0) return JS_EXCEPTION;
|
|
1081
|
+
JSValue sep = locale || js_is_undefined(sep_arg) ? js_char_string(',') : js_to_string(ctx, sep_arg);
|
|
1082
|
+
if (js_is_exception(sep)) return JS_EXCEPTION;
|
|
1083
|
+
JSValue r = js_empty_string();
|
|
1084
|
+
for (double i = 0; i < len; i++) {
|
|
1085
|
+
if (i > 0) r = js_concat(ctx, r, sep);
|
|
1086
|
+
if (js_is_exception(r)) return JS_EXCEPTION;
|
|
1087
|
+
JSValue e = get_index(ctx, o, i);
|
|
1088
|
+
if (js_is_exception(e)) return e;
|
|
1089
|
+
if (js_is_nullish(e)) continue;
|
|
1090
|
+
JSValue s;
|
|
1091
|
+
if (locale) {
|
|
1092
|
+
JSValue f = js_get_value(ctx, e, js_atom_from_cstr(ctx, "toLocaleString"));
|
|
1093
|
+
s = js_is_exception(f) ? f : js_call(ctx, f, e, 0, NULL);
|
|
1094
|
+
if (!js_is_exception(s)) s = js_to_string(ctx, s);
|
|
1095
|
+
} else {
|
|
1096
|
+
s = js_to_string(ctx, e);
|
|
1097
|
+
}
|
|
1098
|
+
if (js_is_exception(s)) return s;
|
|
1099
|
+
r = js_concat(ctx, r, s);
|
|
1100
|
+
if (js_is_exception(r)) return r;
|
|
1101
|
+
}
|
|
1102
|
+
return r;
|
|
1103
|
+
}
|
|
1104
|
+
|
|
1105
|
+
CORE(array_proto_join) {
|
|
1106
|
+
UNUSED_ARGS;
|
|
1107
|
+
return join(ctx, this_val, ARG(0), false);
|
|
1108
|
+
}
|
|
1109
|
+
|
|
1110
|
+
CORE(array_proto_to_locale_string) {
|
|
1111
|
+
UNUSED_ARGS;
|
|
1112
|
+
return join(ctx, this_val, JS_UNDEFINED, true);
|
|
1113
|
+
}
|
|
1114
|
+
|
|
1115
|
+
CORE(array_proto_to_string) {
|
|
1116
|
+
UNUSED_ARGS;
|
|
1117
|
+
if (!js_require_this(ctx, this_val, "Array.prototype.toString")) return JS_EXCEPTION;
|
|
1118
|
+
JSValue f = js_get_value(ctx, this_val, js_atom_from_cstr(ctx, "join"));
|
|
1119
|
+
if (js_is_exception(f)) return JS_EXCEPTION;
|
|
1120
|
+
if (js_is_callable(f)) return js_call(ctx, f, this_val, 0, NULL);
|
|
1121
|
+
return js_object_to_string_tag(ctx, this_val);
|
|
1122
|
+
}
|
|
1123
|
+
|
|
1124
|
+
/* ---- The objects --------------------------------------------------------------------------------- */
|
|
1125
|
+
|
|
1126
|
+
JSValue js_array_realm_init(JSContext *ctx, JSObject *global,
|
|
1127
|
+
JSValue (*define_constructor)(JSContext *, JSObject *, const char *, JSNativeFn, uint32_t, JSValue)) {
|
|
1128
|
+
return define_constructor(ctx, global, "Array", array_ctor, 1, ctx->intrinsics[JS_INTRINSIC_ARRAY_PROTOTYPE]);
|
|
1129
|
+
}
|
|
1130
|
+
|
|
1131
|
+
void js_array_realm_finish(JSContext *ctx) {
|
|
1132
|
+
JSValue *in = ctx->intrinsics;
|
|
1133
|
+
JSObject *array_proto = js_as_object(in[JS_INTRINSIC_ARRAY_PROTOTYPE]);
|
|
1134
|
+
JSPropertyDescriptor values;
|
|
1135
|
+
if (js_get_own_property(ctx, array_proto, js_atom_from_cstr(ctx, "values"), &values) == 1) in[JS_INTRINSIC_ARRAY_VALUES] = values.value;
|
|
1136
|
+
/* @@unscopables (§23.1.3.41): the names `with` statements don't see */
|
|
1137
|
+
static const char *const unscopable[] = {
|
|
1138
|
+
"at", "copyWithin", "entries", "fill", "find", "findIndex", "findLast", "findLastIndex", "flat", "flatMap",
|
|
1139
|
+
"includes", "keys", "toReversed", "toSorted", "toSpliced", "values",
|
|
1140
|
+
};
|
|
1141
|
+
JSValue list = js_new_object_proto(ctx, JS_NULL, JS_DEFAULT_INLINE_SLOTS);
|
|
1142
|
+
for (size_t i = 0; i < JS_COUNTOF(unscopable); i++)
|
|
1143
|
+
js_define_data(ctx, js_as_object(list), js_atom_from_cstr(ctx, unscopable[i]), JS_TRUE, JS_PROP_DEFAULT);
|
|
1144
|
+
js_define_data(ctx, array_proto, JS_SYMBOL(unscopables), list, JS_PROP_CONFIGURABLE);
|
|
1145
|
+
}
|