@swf2es/runtime 0.1.20 → 0.1.21

package/dist/avm2/natives/bytes.d.ts

@@ -0,0 +1,141 @@
+import type { AsObject } from "../descriptors.js";
+import type { Runtime } from "../runtime.js";
+import { type SharedBytesMemory } from "./shared-bytes.js";
+/** DomainEnv::GLOBAL_MEMORY_MIN_SIZE: domain memory's least length. */
+export declare const GLOBAL_MEMORY_MIN_SIZE = 1024;
+/** The capacity of `rt`'s ByteArrays, which avmshell's System counts in its memory. */
+export declare function byteArrayCapacity(rt: Runtime): number;
+/**
+ * A ByteArray's state: its buffer, as long as its capacity, and its length
+ * and position. A read or write takes its offset first: growing replaces
+ * the buffer and its view.
+ *
+ * A length or position is stored through `>>> 0`, as a uint32: an int32
+ * while below 2^31, and a double only from there.
+ * JavaScriptCore keeps a number its JIT once made a double a double, and
+ * an addition that has seen one makes doubles from then on: a double
+ * offset fails the int32 check of a DataView or typed array access, and
+ * after enough failures JavaScriptCore calls DataView's methods instead
+ * of inlining them, a quarter slower on every read and write. V8 makes
+ * small integers of them itself.
+ */
+export declare class Bytes {
+    readonly rt: Runtime;
+    readonly owner: AsObject;
+    buffer: Uint8Array;
+    view: DataView<ArrayBufferLike>;
+    length: number;
+    position: number;
+    littleEndian: boolean;
+    /** As ByteArray's constructor: ByteArray.defaultObjectEncoding when it is made. */
+    objectEncoding: number;
+    /** Whether it is the domain memory, which it then tells when its buffer or length changes. */
+    subscribed: boolean;
+    /**
+     * Whether `shareable` was set true, which cannot be undone: the
+     * ByteArray then crosses to another worker as its memory, not a copy.
+     */
+    shareable: boolean;
+    /**
+     * Its memory once it has crossed to another worker (share), which its
+     * buffer and view are then over, tracking its length as it grows; null
+     * until then, when it is a ByteArray like any other.
+     */
+    shared: SharedBytesMemory | null;
+    /** The shared memory's words, the length first, and its bytes as words for the atomics. */
+    private sharedWords;
+    private sharedInts;
+    /** Its runtime's capacity count, and its own part of it. */
+    private readonly capacity;
+    constructor(rt: Runtime, owner: AsObject);
+    /** Its buffer replaced by `next`, its runtime's capacity count with it. */
+    setBuffer(next: Uint8Array<ArrayBuffer>): void;
+    get available(): number;
+    /** As Grower::ReallocBackingStore: a new buffer, the old length's bytes copied and the rest zero. */
+    private realloc;
+    /** As Grower::EnsureWritableCapacity: double, at least `minimum`, and 4096 unless the setter sizes an empty one. */
+    private ensure;
+    /** As ByteArray::SetLengthCommon. */
+    setLength(length: number, fromSetter?: boolean): void;
+    /**
+     * The length made at least `length`, as a write past the end makes it:
+     * shared, by a compare and swap that only ever raises it, so that
+     * workers appending at once never lower what another made it.
+     */
+    extend(length: number): void;
+    /** A shared length raised to `length` unless another worker made it as long. */
+    private raise;
+    /** As Grower::SetLengthCommon, before the length is set: the capacity for `length`. */
+    private reserve;
+    /** Tell the domain memory, if this is it, where the bytes are now: a new view only if they moved or their length changed. */
+    notify(): void;
+    /** As ByteArray::Clear: no buffer at all; shared, every worker's ByteArray for it empty. */
+    clear(): void;
+    /**
+     * Its memory, shared from now on: a growable SharedArrayBuffer its bytes
+     * move to once, and that this ByteArray, and every worker's ByteArray for
+     * it, uses from then on. Where memory cannot be shared, the error that
+     * names cross-origin isolation.
+     */
+    share(): SharedBytesMemory;
+    /**
+     * Use `memory`, shared, as its bytes and length from now on. Its length
+     * becomes an accessor of the memory's word on this object alone, so that
+     * every read sees another worker's change and every write is seen, and
+     * a ByteArray that shares nothing reads a plain field as before.
+     */
+    adopt(memory: SharedBytesMemory): void;
+    /**
+     * A shared memory's capacity made at least `capacity`: it grows in place,
+     * which every worker sees, and never shrinks, as another worker may have
+     * grown it past what this one asks for since. Nor is what a smaller
+     * buffer would drop zeroed: without avmplus' safepoint, another worker
+     * may have grown the length again and written there meanwhile, so bytes
+     * past a lowered length may come back when it grows again.
+     */
+    private reshare;
+    /** As ByteArray::CAS, once the index is checked: atomic where the memory is shared. */
+    compareAndSwapInt(at: number, expected: number, next: number): number;
+    /**
+     * As UnprotectedAtomicCompareAndSwapLength: the length set to `next`, as
+     * its setter sets it, if it is `expected`; the length before. Shared,
+     * the capacity is made first and the length swapped atomically, so that
+     * of workers growing it at once one wins.
+     */
+    compareAndSwapLength(expected: number, next: number): number;
+    /** As requestBytesForShortRead: the offset of `n` bytes to read, or EOFError. */
+    shortRead(n: number): number;
+    /** As requestBytesForShortWrite: the offset of `n` bytes to write, the length grown to hold them. */
+    shortWrite(n: number): number;
+    /** As DataInput::CheckEOF. */
+    checkEOF(count: number): void;
+    /** As ByteArray::Read: `count` bytes from the position. */
+    read(count: number): Uint8Array;
+    /** As read, but the bytes themselves, not a copy: for a caller that only reads them, at once. */
+    readView(count: number): Uint8Array;
+    /**
+     * As ByteArray::Write: `count` bytes of `source` from `offset`, all of
+     * it by default, at the position; the length grows to the position after.
+     */
+    write(source: Uint8Array, offset?: number, count?: number): void;
+    /**
+     * As ByteArray::Write but for the bytes, which the caller writes itself:
+     * room for `count` at the position, which moves past them, the length
+     * growing to it. Where in the buffer they start.
+     */
+    claim(count: number): number;
+    /** As ByteArray's operator[] for a write: the length grows to hold `index`. */
+    setByte(index: number, value: number): void;
+}
+/**
+ * `count` bytes of `source` from `offset` copied into `target` at `at`,
+ * as memmove copies them where the two are one array. Part of `source`,
+ * fewer than COPY_LOOP_LENGTH bytes, is copied one at a time: the
+ * subarray set() would take costs more than they do, in JavaScriptCore up
+ * to about 64 bytes and in V8 up to about 32. All of it set() copies
+ * faster than a loop in V8, and as fast in JavaScriptCore.
+ */
+export declare function copyBytes(target: Uint8Array, at: number, source: Uint8Array, offset: number, count: number): void;
+/** A ByteArray's state, made the first time a native needs it. */
+export declare function bytesOf(rt: Runtime, o: AsObject): Bytes;
+//# sourceMappingURL=bytes.d.ts.map

package/dist/avm2/natives/bytes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.d.ts","sourceRoot":"","sources":["../../../src/avm2/natives/bytes.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AAC7C,OAAO,EAKL,KAAK,iBAAiB,EAEvB,MAAM,mBAAmB,CAAC;AAW3B,uEAAuE;AACvE,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAc3C,uFAAuF;AACvF,wBAAgB,iBAAiB,CAAC,EAAE,EAAE,OAAO,GAAG,MAAM,CAErD;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,KAAK;IA4Bd,QAAQ,CAAC,EAAE,EAAE,OAAO;IACpB,QAAQ,CAAC,KAAK,EAAE,QAAQ;IA5B1B,MAAM,EAAE,UAAU,CAAqB;IACvC,IAAI,4BAAoC;IACxC,MAAM,SAAK;IACX,QAAQ,SAAK;IACb,YAAY,UAAS;IACrB,mFAAmF;IACnF,cAAc,EAAE,MAAM,CAAC;IACvB,8FAA8F;IAC9F,UAAU,UAAS;IACnB;;;OAGG;IACH,SAAS,UAAS;IAClB;;;;OAIG;IACH,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAAQ;IACxC,2FAA2F;IAC3F,OAAO,CAAC,WAAW,CAA2B;IAC9C,OAAO,CAAC,UAAU,CAA2B;IAC7C,4DAA4D;IAC5D,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiC;IAE1D,YACW,EAAE,EAAE,OAAO,EACX,KAAK,EAAE,QAAQ,EAWzB;IAED,2EAA2E;IAC3E,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,WAAW,CAAC,GAAG,IAAI,CAM7C;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,qGAAqG;IACrG,OAAO,CAAC,OAAO;IAoCf,oHAAoH;IACpH,OAAO,CAAC,MAAM;IAUd,qCAAqC;IACrC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,UAAQ,GAAG,IAAI,CAYlD;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAS3B;IAED,gFAAgF;IAChF,OAAO,CAAC,KAAK;IAUb,uFAAuF;IACvF,OAAO,CAAC,OAAO;IAcf,6HAA6H;IAC7H,MAAM,IAAI,IAAI,CAQb;IAED,4FAA4F;IAC5F,KAAK,IAAI,IAAI,CAiBZ;IAED;;;;;OAKG;IACH,KAAK,IAAI,iBAAiB,CAiCzB;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAM,EAAE,iBAAiB,GAAG,IAAI,CAsBrC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,OAAO;IAwBf,uFAAuF;IACvF,iBAAiB,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAWpE;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CA0B3D;IAED,iFAAiF;IACjF,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ3B;IAED,qGAAqG;IACrG,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAY5B;IAED,8BAA8B;IAC9B,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAI5B;IAED,2DAA2D;IAC3D,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAK9B;IAED,iGAAiG;IACjG,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAKlC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,SAAI,EAAE,KAAK,SAAgB,GAAG,IAAI,CAIjE;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAsB3B;IAED,+EAA+E;IAC/E,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAU1C;CACF;AAKD;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,MAAM,EAAE,UAAU,EAClB,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,UAAU,EAClB,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,GACZ,IAAI,CAYN;AAED,kEAAkE;AAClE,wBAAgB,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,GAAG,KAAK,CAMvD"}

package/dist/avm2/natives/bytes.js

@@ -0,0 +1,458 @@
+import { canShareMemory, notIsolated, sharedObjectsOf, } from "./shared-bytes.js";
+const kGrowthIncr = 4096;
+const kHugeGrowthThreshold = 24 * 1024 * 1024;
+const kHugeGrowthIncr = 24 * 1024 * 1024;
+/**
+ * The most a ByteArray holds: what a 32-bit avmshell, as the oracle's, can
+ * allocate, beyond which it fails with MemoryError 1000, and less than a
+ * browser's ArrayBuffer may be refused at.
+ */
+const kMaxCapacity = 0x80000000;
+/** DomainEnv::GLOBAL_MEMORY_MIN_SIZE: domain memory's least length. */
+export const GLOBAL_MEMORY_MIN_SIZE = 1024;
+/** The capacity of each runtime's ByteArrays, live or not yet collected. */
+const runtimeCapacity = new WeakMap();
+/** A ByteArray collected: its capacity no longer counted, by its runtime's count and its own. */
+const collected = new FinalizationRegistry(({ runtime, own }) => {
+    runtime.bytes -= own.bytes;
+});
+/** The capacity of `rt`'s ByteArrays, which avmshell's System counts in its memory. */
+export function byteArrayCapacity(rt) {
+    return runtimeCapacity.get(rt)?.bytes ?? 0;
+}
+/**
+ * A ByteArray's state: its buffer, as long as its capacity, and its length
+ * and position. A read or write takes its offset first: growing replaces
+ * the buffer and its view.
+ *
+ * A length or position is stored through `>>> 0`, as a uint32: an int32
+ * while below 2^31, and a double only from there.
+ * JavaScriptCore keeps a number its JIT once made a double a double, and
+ * an addition that has seen one makes doubles from then on: a double
+ * offset fails the int32 check of a DataView or typed array access, and
+ * after enough failures JavaScriptCore calls DataView's methods instead
+ * of inlining them, a quarter slower on every read and write. V8 makes
+ * small integers of them itself.
+ */
+export class Bytes {
+    rt;
+    owner;
+    buffer = new Uint8Array(0);
+    view = new DataView(this.buffer.buffer);
+    length = 0;
+    position = 0;
+    littleEndian = false;
+    /** As ByteArray's constructor: ByteArray.defaultObjectEncoding when it is made. */
+    objectEncoding;
+    /** Whether it is the domain memory, which it then tells when its buffer or length changes. */
+    subscribed = false;
+    /**
+     * Whether `shareable` was set true, which cannot be undone: the
+     * ByteArray then crosses to another worker as its memory, not a copy.
+     */
+    shareable = false;
+    /**
+     * Its memory once it has crossed to another worker (share), which its
+     * buffer and view are then over, tracking its length as it grows; null
+     * until then, when it is a ByteArray like any other.
+     */
+    shared = null;
+    /** The shared memory's words, the length first, and its bytes as words for the atomics. */
+    sharedWords = null;
+    sharedInts = null;
+    /** Its runtime's capacity count, and its own part of it. */
+    capacity;
+    constructor(rt, owner) {
+        this.rt = rt;
+        this.owner = owner;
+        this.objectEncoding = rt.defaultObjectEncoding;
+        let runtime = runtimeCapacity.get(rt);
+        if (!runtime) {
+            runtime = { bytes: 0 };
+            runtimeCapacity.set(rt, runtime);
+        }
+        this.capacity = { runtime, own: { bytes: 0 } };
+        collected.register(this, this.capacity);
+    }
+    /** Its buffer replaced by `next`, its runtime's capacity count with it. */
+    setBuffer(next) {
+        const { runtime, own } = this.capacity;
+        runtime.bytes += next.length - own.bytes;
+        own.bytes = next.length;
+        this.buffer = next;
+        this.view = new DataView(next.buffer);
+    }
+    get available() {
+        return this.length > this.position ? this.length - this.position : 0;
+    }
+    /** As Grower::ReallocBackingStore: a new buffer, the old length's bytes copied and the rest zero. */
+    realloc(capacityIn, minimum, fromSetter) {
+        let capacity = capacityIn;
+        if (capacity < minimum) {
+            capacity = minimum;
+        }
+        if (!(this.buffer.length === 0 && fromSetter) && capacity < kGrowthIncr) {
+            capacity = kGrowthIncr;
+        }
+        if (minimum > kMaxCapacity) {
+            throw this.rt.error("flash.errors::MemoryError", 1000);
+        }
+        capacity = Math.min(capacity, kMaxCapacity);
+        if (capacity === this.buffer.length) {
+            return;
+        }
+        if (this.shared !== null) {
+            this.reshare(capacity);
+            return;
+        }
+        let next;
+        try {
+            next = new Uint8Array(capacity);
+        }
+        catch {
+            // The host would not give it the memory, as the system would not give avmplus.
+            throw this.rt.error("flash.errors::MemoryError", 1000);
+        }
+        next.set(this.buffer.subarray(0, Math.min(capacity, this.length)));
+        this.setBuffer(next);
+    }
+    /** As Grower::EnsureWritableCapacity: double, at least `minimum`, and 4096 unless the setter sizes an empty one. */
+    ensure(minimum, fromSetter) {
+        if (minimum > 0xffffffff - 2 * 4096) {
+            throw this.rt.error("flash.errors::MemoryError", 1000);
+        }
+        if (minimum > this.buffer.length) {
+            this.realloc(this.buffer.length * 2, minimum, fromSetter);
+        }
+    }
+    /** As ByteArray::SetLengthCommon. */
+    setLength(length, fromSetter = false) {
+        if (this.subscribed && length < GLOBAL_MEMORY_MIN_SIZE) {
+            throw this.rt.error("RangeError", 1506);
+        }
+        this.reserve(length, fromSetter);
+        this.length = length >>> 0;
+        if (this.position > length) {
+            this.position = length >>> 0;
+        }
+        this.notify();
+    }
+    /**
+     * The length made at least `length`, as a write past the end makes it:
+     * shared, by a compare and swap that only ever raises it, so that
+     * workers appending at once never lower what another made it.
+     */
+    extend(length) {
+        if (this.shared === null) {
+            this.setLength(length);
+            return;
+        }
+        this.reserve(length, false);
+        this.raise(length);
+        this.notify();
+    }
+    /** A shared length raised to `length` unless another worker made it as long. */
+    raise(length) {
+        const words = this.sharedWords;
+        for (;;) {
+            const now = Atomics.load(words, 0) >>> 0;
+            if (now >= length || Atomics.compareExchange(words, 0, now | 0, length | 0) >>> 0 === now) {
+                return;
+            }
+        }
+    }
+    /** As Grower::SetLengthCommon, before the length is set: the capacity for `length`. */
+    reserve(length, fromSetter) {
+        if (!fromSetter || (length < kHugeGrowthThreshold && this.length < kHugeGrowthThreshold)) {
+            if (length > this.buffer.length) {
+                this.ensure(length, fromSetter);
+            }
+        }
+        else {
+            const rounded = Math.ceil(length / kHugeGrowthIncr) * kHugeGrowthIncr;
+            const capacity = rounded <= 0xffffffff - 2 * 4096 ? rounded : length;
+            if (capacity !== this.buffer.length) {
+                this.realloc(capacity, length, true);
+            }
+        }
+    }
+    /** Tell the domain memory, if this is it, where the bytes are now: a new view only if they moved or their length changed. */
+    notify() {
+        const rt = this.rt;
+        if (this.subscribed &&
+            (rt.memory.buffer !== this.buffer.buffer || rt.memoryLength !== this.length)) {
+            rt.memory = new DataView(this.buffer.buffer, 0, this.length);
+        }
+    }
+    /** As ByteArray::Clear: no buffer at all; shared, every worker's ByteArray for it empty. */
+    clear() {
+        if (this.subscribed) {
+            throw this.rt.error("RangeError", 1506);
+        }
+        this.position = 0;
+        if (this.shared !== null) {
+            // The memory cannot shrink: what it held is zeroed, as a new buffer
+            // would be once it grows again, before the length is told, so that a
+            // worker that grows it once it is empty writes into zeroes already.
+            this.buffer.fill(0);
+            this.length = 0;
+            return;
+        }
+        this.setBuffer(new Uint8Array(0));
+        this.length = 0;
+    }
+    /**
+     * Its memory, shared from now on: a growable SharedArrayBuffer its bytes
+     * move to once, and that this ByteArray, and every worker's ByteArray for
+     * it, uses from then on. Where memory cannot be shared, the error that
+     * names cross-origin isolation.
+     */
+    share() {
+        if (this.shared !== null) {
+            return this.shared;
+        }
+        if (!canShareMemory()) {
+            throw notIsolated("a shareable ByteArray");
+        }
+        const capacity = Math.max(this.buffer.length, this.length);
+        const Shared = SharedArrayBuffer;
+        let data = null;
+        // As much room to grow as a ByteArray has, or as much as the host reserves.
+        for (let max = kMaxCapacity; data === null; max /= 2) {
+            try {
+                data = new Shared(capacity, { maxByteLength: Math.max(max, capacity) });
+            }
+            catch {
+                if (max <= capacity) {
+                    throw this.rt.error("flash.errors::MemoryError", 1000);
+                }
+            }
+        }
+        new Uint8Array(data).set(this.buffer);
+        const memory = {
+            id: Math.floor(Math.random() * 2 ** 52),
+            meta: new SharedArrayBuffer(8),
+            data,
+        };
+        new Int32Array(memory.meta)[0] = this.length | 0;
+        this.adopt(memory);
+        sharedObjectsOf(this.rt).set(memory.id, new WeakRef(this.owner));
+        return memory;
+    }
+    /**
+     * Use `memory`, shared, as its bytes and length from now on. Its length
+     * becomes an accessor of the memory's word on this object alone, so that
+     * every read sees another worker's change and every write is seen, and
+     * a ByteArray that shares nothing reads a plain field as before.
+     */
+    adopt(memory) {
+        this.shared = memory;
+        this.shareable = true;
+        const words = new Int32Array(memory.meta);
+        this.sharedWords = words;
+        Object.defineProperty(this, "length", {
+            get: () => Atomics.load(words, 0) >>> 0,
+            set: (length) => Atomics.store(words, 0, length | 0),
+            configurable: true,
+        });
+        // Views that track the memory's length as any worker grows it.
+        this.buffer = new Uint8Array(memory.data);
+        this.view = new DataView(memory.data);
+        this.sharedInts = new Int32Array(memory.data);
+        const { runtime, own } = this.capacity;
+        runtime.bytes += memory.data.byteLength - own.bytes;
+        own.bytes = memory.data.byteLength;
+        if (this.subscribed) {
+            this.rt.refreshMemory = () => this.notify();
+        }
+        this.notify();
+    }
+    /**
+     * A shared memory's capacity made at least `capacity`: it grows in place,
+     * which every worker sees, and never shrinks, as another worker may have
+     * grown it past what this one asks for since. Nor is what a smaller
+     * buffer would drop zeroed: without avmplus' safepoint, another worker
+     * may have grown the length again and written there meanwhile, so bytes
+     * past a lowered length may come back when it grows again.
+     */
+    reshare(capacity) {
+        const data = this.shared.data;
+        if (capacity <= data.byteLength) {
+            return;
+        }
+        if (capacity > data.maxByteLength) {
+            throw this.rt.error("flash.errors::MemoryError", 1000);
+        }
+        try {
+            data.grow(capacity);
+        }
+        catch {
+            // Another worker grew it meanwhile, to as much or more, or the host refused.
+            if (data.byteLength < capacity) {
+                throw this.rt.error("flash.errors::MemoryError", 1000);
+            }
+        }
+        const { runtime, own } = this.capacity;
+        runtime.bytes += data.byteLength - own.bytes;
+        own.bytes = data.byteLength;
+    }
+    /** As ByteArray::CAS, once the index is checked: atomic where the memory is shared. */
+    compareAndSwapInt(at, expected, next) {
+        if (this.sharedInts !== null) {
+            return Atomics.compareExchange(this.sharedInts, at >> 2, expected, next);
+        }
+        const previous = this.view.getInt32(at, true);
+        if (previous === expected) {
+            this.view.setInt32(at, next, true);
+        }
+        return previous;
+    }
+    /**
+     * As UnprotectedAtomicCompareAndSwapLength: the length set to `next`, as
+     * its setter sets it, if it is `expected`; the length before. Shared,
+     * the capacity is made first and the length swapped atomically, so that
+     * of workers growing it at once one wins.
+     */
+    compareAndSwapLength(expected, next) {
+        if (this.shared === null) {
+            const previous = this.length;
+            if (previous === expected) {
+                this.setLength(next, true);
+            }
+            return previous;
+        }
+        // Read once: another worker may change it between two reads.
+        const now = this.length;
+        if (now !== expected) {
+            return now;
+        }
+        // Only grows the memory, so it does nothing another worker would undo if the swap fails.
+        this.reserve(next, true);
+        const previous = Atomics.compareExchange(this.sharedWords, 0, expected | 0, next | 0) >>> 0;
+        if (previous === expected && this.position > next) {
+            this.position = next;
+        }
+        this.notify();
+        return previous;
+    }
+    /** As requestBytesForShortRead: the offset of `n` bytes to read, or EOFError. */
+    shortRead(n) {
+        const at = this.position;
+        if (at >= this.length || at + n > this.length) {
+            throw this.rt.error("flash.errors::EOFError", 2030);
+        }
+        this.position = (at + n) >>> 0;
+        return at;
+    }
+    /** As requestBytesForShortWrite: the offset of `n` bytes to write, the length grown to hold them. */
+    shortWrite(n) {
+        const at = this.position;
+        if (at >= this.length || at + n > this.length) {
+            if (at + n > 0xffffffff) {
+                throw this.rt.error("flash.errors::MemoryError", 1000);
+            }
+            this.extend(at + n);
+        }
+        this.position = (at + n) >>> 0;
+        return at;
+    }
+    /** As DataInput::CheckEOF. */
+    checkEOF(count) {
+        if (this.available < count) {
+            throw this.rt.error("flash.errors::EOFError", 2030);
+        }
+    }
+    /** As ByteArray::Read: `count` bytes from the position. */
+    read(count) {
+        this.checkEOF(count);
+        const bytes = this.buffer.slice(this.position, this.position + count);
+        this.position = (this.position + count) >>> 0;
+        return bytes;
+    }
+    /** As read, but the bytes themselves, not a copy: for a caller that only reads them, at once. */
+    readView(count) {
+        this.checkEOF(count);
+        const bytes = this.buffer.subarray(this.position, this.position + count);
+        this.position = (this.position + count) >>> 0;
+        return bytes;
+    }
+    /**
+     * As ByteArray::Write: `count` bytes of `source` from `offset`, all of
+     * it by default, at the position; the length grows to the position after.
+     */
+    write(source, offset = 0, count = source.length) {
+        // Before the buffer is read: making room may replace it.
+        const at = this.claim(count);
+        copyBytes(this.buffer, at, source, offset, count);
+    }
+    /**
+     * As ByteArray::Write but for the bytes, which the caller writes itself:
+     * room for `count` at the position, which moves past them, the length
+     * growing to it. Where in the buffer they start.
+     */
+    claim(count) {
+        if (count > 0xffffffff - this.position) {
+            throw this.rt.error("flash.errors::MemoryError", 1000);
+        }
+        const at = this.position;
+        const end = (at + count) >>> 0;
+        if (end > this.buffer.length) {
+            this.ensure(end, false);
+        }
+        this.position = end;
+        if (this.length < end) {
+            if (this.shared === null) {
+                this.length = end;
+            }
+            else {
+                this.raise(end);
+            }
+        }
+        this.notify();
+        return at;
+    }
+    /** As ByteArray's operator[] for a write: the length grows to hold `index`. */
+    setByte(index, value) {
+        if (index >= this.length) {
+            if (index === 0xffffffff) {
+                throw this.rt.error("flash.errors::MemoryError", 1000);
+            }
+            this.extend(index + 1);
+        }
+        this.buffer[index] = value;
+    }
+}
+/** Below this many bytes, copyBytes copies one at a time. */
+const COPY_LOOP_LENGTH = 32;
+/**
+ * `count` bytes of `source` from `offset` copied into `target` at `at`,
+ * as memmove copies them where the two are one array. Part of `source`,
+ * fewer than COPY_LOOP_LENGTH bytes, is copied one at a time: the
+ * subarray set() would take costs more than they do, in JavaScriptCore up
+ * to about 64 bytes and in V8 up to about 32. All of it set() copies
+ * faster than a loop in V8, and as fast in JavaScriptCore.
+ */
+export function copyBytes(target, at, source, offset, count) {
+    if (source === target) {
+        target.copyWithin(at, offset, offset + count);
+    }
+    else if (offset === 0 && count === source.length) {
+        target.set(source, at);
+    }
+    else if (count < COPY_LOOP_LENGTH) {
+        for (let i = 0; i < count; i++) {
+            target[at + i] = source[offset + i];
+        }
+    }
+    else {
+        target.set(source.subarray(offset, offset + count), at);
+    }
+}
+/** A ByteArray's state, made the first time a native needs it. */
+export function bytesOf(rt, o) {
+    if (!o.$bytes) {
+        o.$bytes = new Bytes(rt, o);
+    }
+    return o.$bytes;
+}
+//# sourceMappingURL=bytes.js.map

package/dist/avm2/natives/bytes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.js","sourceRoot":"","sources":["../../../src/avm2/natives/bytes.ts"],"names":[],"mappings":"AAQA,OAAO,EACL,cAAc,EAGd,WAAW,EAEX,eAAe,GAChB,MAAM,mBAAmB,CAAC;AAE3B,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB,MAAM,oBAAoB,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAC9C,MAAM,eAAe,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AACzC;;;;GAIG;AACH,MAAM,YAAY,GAAG,UAAU,CAAC;AAChC,uEAAuE;AACvE,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAO3C,4EAA4E;AAC5E,MAAM,eAAe,GAAG,IAAI,OAAO,EAAkB,CAAC;AACtD,iGAAiG;AACjG,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAiC,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;IAC9F,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK,CAAC;AAC7B,CAAC,CAAC,CAAC;AAEH,uFAAuF;AACvF,MAAM,UAAU,iBAAiB,CAAC,EAAW;IAC3C,OAAO,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,KAAK;IA4BL,EAAE;IACF,KAAK;IA5BhB,MAAM,GAAe,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IACvC,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,GAAG,CAAC,CAAC;IACX,QAAQ,GAAG,CAAC,CAAC;IACb,YAAY,GAAG,KAAK,CAAC;IACrB,mFAAmF;IACnF,cAAc,CAAS;IACvB,8FAA8F;IAC9F,UAAU,GAAG,KAAK,CAAC;IACnB;;;OAGG;IACH,SAAS,GAAG,KAAK,CAAC;IAClB;;;;OAIG;IACH,MAAM,GAA6B,IAAI,CAAC;IACxC,2FAA2F;IACnF,WAAW,GAAsB,IAAI,CAAC;IACtC,UAAU,GAAsB,IAAI,CAAC;IAC7C,4DAA4D;IAC3C,QAAQ,CAAiC;IAE1D,YACW,EAAW,EACX,KAAe;kBADf,EAAE;qBACF,KAAK;QAEd,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC,qBAAqB,CAAC;QAC/C,IAAI,OAAO,GAAG,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACvB,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAED,2EAA2E;IAC3E,SAAS,CAAC,IAA6B;QACrC,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACvC,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC;QACzC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAED,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,qGAAqG;IAC7F,OAAO,CAAC,UAAkB,EAAE,OAAe,EAAE,UAAmB;QACtE,IAAI,QAAQ,GAAG,UAAU,CAAC;QAC1B,IAAI,QAAQ,GAAG,OAAO,EAAE,CAAC;YACvB,QAAQ,GAAG,OAAO,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;YACxE,QAAQ,GAAG,WAAW,CAAC;QACzB,CAAC;QAED,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;QAED,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;QAC5C,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACpC,OAAO;QACT,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACvB,OAAO;QACT,CAAC;QAED,IAAI,IAA6B,CAAC;QAClC,IAAI,CAAC;YACH,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QAClC,CAAC;QAAC,MAAM,CAAC;YACP,+EAA+E;YAC/E,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,oHAAoH;IAC5G,MAAM,CAAC,OAAe,EAAE,UAAmB;QACjD,IAAI,OAAO,GAAG,UAAU,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,SAAS,CAAC,MAAc,EAAE,UAAU,GAAG,KAAK;QAC1C,IAAI,IAAI,CAAC,UAAU,IAAI,MAAM,GAAG,sBAAsB,EAAE,CAAC;YACvD,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,GAAG,MAAM,KAAK,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,QAAQ,GAAG,MAAM,KAAK,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,MAAc;QACnB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,gFAAgF;IACxE,KAAK,CAAC,MAAc;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAyB,CAAC;QAC7C,SAAS,CAAC;YACR,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACzC,IAAI,GAAG,IAAI,MAAM,IAAI,OAAO,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC1F,OAAO;YACT,CAAC;QACH,CAAC;IACH,CAAC;IAED,uFAAuF;IAC/E,OAAO,CAAC,MAAc,EAAE,UAAmB;QACjD,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,GAAG,oBAAoB,IAAI,IAAI,CAAC,MAAM,GAAG,oBAAoB,CAAC,EAAE,CAAC;YACzF,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,eAAe,CAAC,GAAG,eAAe,CAAC;YACtE,MAAM,QAAQ,GAAG,OAAO,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;YACrE,IAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACpC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IAED,6HAA6H;IAC7H,MAAM;QACJ,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,IACE,IAAI,CAAC,UAAU;YACf,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,YAAY,KAAK,IAAI,CAAC,MAAM,CAAC,EAC5E,CAAC;YACD,EAAE,CAAC,MAAM,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,4FAA4F;IAC5F,KAAK;QACH,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,oEAAoE;YACpE,qEAAqE;YACrE,oEAAoE;YACpE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC;YACtB,MAAM,WAAW,CAAC,uBAAuB,CAAC,CAAC;QAC7C,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,iBAAyD,CAAC;QACzE,IAAI,IAAI,GAA6B,IAAI,CAAC;QAC1C,4EAA4E;QAC5E,KAAK,IAAI,GAAG,GAAG,YAAY,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC;gBACH,IAAI,GAAG,IAAI,MAAM,CAAC,QAAQ,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAC1E,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,GAAG,IAAI,QAAQ,EAAE,CAAC;oBACpB,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,MAAM,MAAM,GAAsB;YAChC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;YACvC,IAAI,EAAE,IAAI,iBAAiB,CAAC,CAAC,CAAC;YAC9B,IAAI;SACL,CAAC;QACF,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnB,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAyB;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;YACpC,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC;YACvC,GAAG,EAAE,CAAC,MAAc,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC;YAC5D,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,+DAA+D;QAC/D,IAAI,CAAC,MAAM,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,UAAU,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9C,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACvC,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC;QACpD,GAAG,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC;QACnC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,aAAa,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACK,OAAO,CAAC,QAAgB;QAC9B,MAAM,IAAI,GAAI,IAAI,CAAC,MAA4B,CAAC,IAAiC,CAAC;QAClF,IAAI,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAChC,OAAO;QACT,CAAC;QAED,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAClC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtB,CAAC;QAAC,MAAM,CAAC;YACP,6EAA6E;YAC7E,IAAI,IAAI,CAAC,UAAU,GAAG,QAAQ,EAAE,CAAC;gBAC/B,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;QAED,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACvC,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC;QAC7C,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IAED,uFAAuF;IACvF,iBAAiB,CAAC,EAAU,EAAE,QAAgB,EAAE,IAAY;QAC1D,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC3E,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9C,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,QAAgB,EAAE,IAAY;QACjD,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;YAC7B,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC7B,CAAC;YAED,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,6DAA6D;QAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;YACrB,OAAO,GAAG,CAAC;QACb,CAAC;QAED,yFAAyF;QACzF,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzB,MAAM,QAAQ,GACZ,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,WAAyB,EAAE,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC3F,IAAI,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACvB,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,iFAAiF;IACjF,SAAS,CAAC,CAAS;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzB,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9C,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,qGAAqG;IACrG,UAAU,CAAC,CAAS;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzB,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9C,IAAI,EAAE,GAAG,CAAC,GAAG,UAAU,EAAE,CAAC;gBACxB,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;YACzD,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC/B,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,8BAA8B;IAC9B,QAAQ,CAAC,KAAa;QACpB,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,wBAAwB,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,IAAI,CAAC,KAAa;QAChB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QACtE,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iGAAiG;IACjG,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QACzE,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAkB,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM;QACzD,yDAAyD;QACzD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAa;QACjB,IAAI,KAAK,GAAG,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvC,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC;QACzB,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;QACpB,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,+EAA+E;IAC/E,OAAO,CAAC,KAAa,EAAE,KAAa;QAClC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACzB,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;gBACzB,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;YACzD,CAAC;YAED,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC7B,CAAC;CACF;AAED,6DAA6D;AAC7D,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CACvB,MAAkB,EAClB,EAAU,EACV,MAAkB,EAClB,MAAc,EACd,KAAa;IAEb,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,MAAM,CAAC,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC;IAChD,CAAC;SAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACnD,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACzB,CAAC;SAAM,IAAI,KAAK,GAAG,gBAAgB,EAAE,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,OAAO,CAAC,EAAW,EAAE,CAAW;IAC9C,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QACd,CAAC,CAAC,MAAM,GAAG,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,OAAO,CAAC,CAAC,MAAM,CAAC;AAClB,CAAC"}

package/dist/avm2/natives/concurrent.js

@@ -4,7 +4,7 @@
 // object for each, as avmplus interns one for its State. And
 // avm2.intrinsics.memory's compare and swap. Crossbridge uses them all on
 // startup whether or not it starts workers.
-import { bytesOf } from "./bytearray.js";
+import { bytesOf } from "./bytes.js";
 import { plain, registerNativeClass } from "./define.js";
 import { newSyncMemory, Sync, SyncFull, SyncTimeout } from "./sync.js";
 const vmSyncs = new WeakMap();