@willieee802/zigbee-herdsman 0.49.1 → 0.49.2

package/dist/adapter/ember/uart/parser.d.ts

@@ -0,0 +1,7 @@
+import { Transform, type TransformCallback } from "node:stream";
+export declare class AshParser extends Transform {
+    #private;
+    _transform(chunk: Buffer, _encoding: BufferEncoding, cb: TransformCallback): void;
+    _flush(cb: TransformCallback): void;
+}
+//# sourceMappingURL=parser.d.ts.map

package/dist/adapter/ember/uart/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/parser.ts"],"names":[],"mappings":"AAEA,OAAO,EAAC,SAAS,EAAE,KAAK,iBAAiB,EAAC,MAAM,aAAa,CAAC;AAO9D,qBAAa,SAAU,SAAQ,SAAS;;IAG3B,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,EAAE,EAAE,iBAAiB,GAAG,IAAI;IAsBjF,MAAM,CAAC,EAAE,EAAE,iBAAiB,GAAG,IAAI;CAO/C"}

package/dist/adapter/ember/uart/parser.js

@@ -0,0 +1,32 @@
+"use strict";
+/* v8 ignore start */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AshParser = void 0;
+const node_stream_1 = require("node:stream");
+// const NS = 'zh:ember:uart:ash:parser';
+class AshParser extends node_stream_1.Transform {
+    #buffer = Buffer.alloc(0);
+    _transform(chunk, _encoding, cb) {
+        let data = Buffer.concat([this.#buffer, chunk]);
+        let position;
+        // biome-ignore lint/suspicious/noAssignInExpressions: shorter
+        while ((position = data.indexOf(126 /* AshReservedByte.FLAG */)) !== -1) {
+            // emit the frame via 'data' event
+            const frame = data.subarray(0, position + 1);
+            // expensive and very verbose, enable locally only if necessary
+            // logger.debug(`<<<< [FRAME raw=${frame.toString('hex')}]`, NS);
+            this.push(frame);
+            // remove the frame from internal buffer (set below)
+            data = data.subarray(position + 1);
+        }
+        this.#buffer = data;
+        cb();
+    }
+    _flush(cb) {
+        this.push(this.#buffer);
+        this.#buffer = Buffer.alloc(0);
+        cb();
+    }
+}
+exports.AshParser = AshParser;
+//# sourceMappingURL=parser.js.map

package/dist/adapter/ember/uart/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/parser.ts"],"names":[],"mappings":";AAAA,qBAAqB;;;AAErB,6CAA8D;AAK9D,yCAAyC;AAEzC,MAAa,SAAU,SAAQ,uBAAS;IACpC,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEjB,UAAU,CAAC,KAAa,EAAE,SAAyB,EAAE,EAAqB;QAC/E,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QAChD,IAAI,QAAgB,CAAC;QAErB,8DAA8D;QAC9D,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,gCAAsB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC5D,kCAAkC;YAClC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;YAE7C,+DAA+D;YAC/D,iEAAiE;YACjE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEjB,oDAAoD;YACpD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAEpB,EAAE,EAAE,CAAC;IACT,CAAC;IAEQ,MAAM,CAAC,EAAqB;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAExB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE/B,EAAE,EAAE,CAAC;IACT,CAAC;CACJ;AAhCD,8BAgCC"}

package/dist/adapter/ember/uart/queues.d.ts

@@ -0,0 +1,84 @@
+/**
+ * Buffer to hold a DATA frame.
+ * Allocates `data` to `EZSP_MAX_FRAME_LENGTH` filled with zeroes.
+ */
+export declare class EzspBuffer {
+    /** uint8_t[EZSP_MAX_FRAME_LENGTH] */
+    data: Buffer;
+    link?: EzspBuffer;
+    /** uint8_t */
+    len: number;
+    constructor();
+}
+/**
+ * Simple queue (singly-linked list)
+ */
+export declare class EzspQueue {
+    tail?: EzspBuffer;
+    constructor();
+    /**
+     * Get the number of buffers in the queue.
+     * @returns
+     */
+    get length(): number;
+    get empty(): boolean;
+    /**
+     * Get a pointer to the buffer at the head of the queue.
+     * @returns
+     */
+    get head(): EzspBuffer;
+    /**
+     * Get a pointer to the Nth entry in the queue (the tail corresponds to N = 1).
+     *
+     * @param n
+     * @returns
+     */
+    getNthEntry(n: number): EzspBuffer | undefined;
+    /**
+     * Get a pointer to the entry before the specified entry (closer to the tail).
+     * If the buffer specified is undefined, the head entry is returned.
+     * If the buffer specified is the tail, undefined is returned.
+     * @param entry The buffer to look before.
+     * @returns
+     */
+    getPrecedingEntry(entry?: EzspBuffer): EzspBuffer | undefined;
+    /**
+     * Add a buffer to the tail of the queue.
+     * @param buf
+     */
+    addTail(buf: EzspBuffer): void;
+    /**
+     * Remove the buffer at the head of the queue.
+     * @returns The removed buffer.
+     */
+    removeHead(): EzspBuffer;
+    /**
+     * Remove the specified entry from the queue.
+     * @param entry
+     * @returns A pointer to the preceding entry (if any).
+     */
+    removeEntry(entry: EzspBuffer): EzspBuffer | undefined;
+}
+/**
+ * Simple free list (singly-linked list)
+ */
+export declare class EzspFreeList {
+    link?: EzspBuffer;
+    constructor();
+    /**
+     * Get the number of buffers in the free list.
+     * @returns
+     */
+    get length(): number;
+    /**
+     * Add a buffer to the free list.
+     * @param buf
+     */
+    freeBuffer(buf: EzspBuffer): void;
+    /**
+     * Get a buffer from the free list.
+     * @returns
+     */
+    allocBuffer(): EzspBuffer | undefined;
+}
+//# sourceMappingURL=queues.d.ts.map

package/dist/adapter/ember/uart/queues.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queues.d.ts","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/queues.ts"],"names":[],"mappings":"AAOA;;;GAGG;AACH,qBAAa,UAAU;IACnB,qCAAqC;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,UAAU,CAAC;IACzB,cAAc;IACP,GAAG,EAAE,MAAM,CAAC;;CAOtB;AAED;;GAEG;AACH,qBAAa,SAAS;IACX,IAAI,CAAC,EAAE,UAAU,CAAC;;IAMzB;;;OAGG;IACH,IAAI,MAAM,IAAI,MAAM,CASnB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED;;;OAGG;IACH,IAAI,IAAI,IAAI,UAAU,CAYrB;IAED;;;;;OAKG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,SAAS;IAkBrD;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAK,CAAC,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS;IAsBpE;;;OAGG;IACI,OAAO,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI;IASrC;;;OAGG;IACI,UAAU,IAAI,UAAU;IAuB/B;;;;OAIG;IACI,WAAW,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU,GAAG,SAAS;CAWhE;AAED;;GAEG;AACH,qBAAa,YAAY;IACd,IAAI,CAAC,EAAE,UAAU,CAAC;;IAMzB;;;OAGG;IACH,IAAI,MAAM,IAAI,MAAM,CASnB;IAED;;;OAGG;IACI,UAAU,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI;IASxC;;;OAGG;IACI,WAAW,IAAI,UAAU,GAAG,SAAS;CAqB/C"}

package/dist/adapter/ember/uart/queues.js

@@ -0,0 +1,213 @@
+"use strict";
+/* v8 ignore start */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EzspFreeList = exports.EzspQueue = exports.EzspBuffer = void 0;
+const logger_1 = require("../../../utils/logger");
+const consts_1 = require("../ezsp/consts");
+const NS = "zh:ember:uart:queues";
+/**
+ * Buffer to hold a DATA frame.
+ * Allocates `data` to `EZSP_MAX_FRAME_LENGTH` filled with zeroes.
+ */
+class EzspBuffer {
+    /** uint8_t[EZSP_MAX_FRAME_LENGTH] */
+    data;
+    link;
+    /** uint8_t */
+    len;
+    constructor() {
+        this.data = Buffer.alloc(consts_1.EZSP_MAX_FRAME_LENGTH); // inits to all-zeroes
+        this.link = undefined;
+        this.len = 0;
+    }
+}
+exports.EzspBuffer = EzspBuffer;
+/**
+ * Simple queue (singly-linked list)
+ */
+class EzspQueue {
+    tail;
+    constructor() {
+        this.tail = undefined;
+    }
+    /**
+     * Get the number of buffers in the queue.
+     * @returns
+     */
+    get length() {
+        let head = this.tail;
+        let count = 0;
+        for (count; head !== undefined; count++) {
+            head = head.link;
+        }
+        return count;
+    }
+    get empty() {
+        return this.tail === undefined;
+    }
+    /**
+     * Get a pointer to the buffer at the head of the queue.
+     * @returns
+     */
+    get head() {
+        let head = this.tail;
+        if (head === undefined) {
+            throw new Error("Tried to get head from an empty queue.");
+        }
+        while (head.link !== undefined) {
+            head = head.link;
+        }
+        return head;
+    }
+    /**
+     * Get a pointer to the Nth entry in the queue (the tail corresponds to N = 1).
+     *
+     * @param n
+     * @returns
+     */
+    getNthEntry(n) {
+        if (n === 0) {
+            throw new Error("Asked for 0th element in queue.");
+        }
+        let buf = this.tail;
+        while (--n) {
+            if (buf === undefined) {
+                throw new Error("Less than N entries in queue.");
+            }
+            buf = buf.link;
+        }
+        return buf;
+    }
+    /**
+     * Get a pointer to the entry before the specified entry (closer to the tail).
+     * If the buffer specified is undefined, the head entry is returned.
+     * If the buffer specified is the tail, undefined is returned.
+     * @param entry The buffer to look before.
+     * @returns
+     */
+    getPrecedingEntry(entry) {
+        let buf = this.tail;
+        if (buf === entry) {
+            return undefined;
+        }
+        if (buf === undefined) {
+            throw new Error("Tried to get preceding entry from an empty queue.");
+        }
+        do {
+            if (buf.link === entry) {
+                return buf;
+            }
+            buf = buf.link;
+        } while (buf !== undefined);
+        throw new Error("Buffer not in queue.");
+    }
+    /**
+     * Add a buffer to the tail of the queue.
+     * @param buf
+     */
+    addTail(buf) {
+        if (buf) {
+            buf.link = this.tail;
+            this.tail = buf;
+        }
+        else {
+            throw new Error("Called addTail with undefined buffer");
+        }
+    }
+    /**
+     * Remove the buffer at the head of the queue.
+     * @returns The removed buffer.
+     */
+    removeHead() {
+        let head = this.tail;
+        if (head === undefined) {
+            throw new Error("Tried to remove head from an empty queue.");
+        }
+        if (head.link === undefined) {
+            this.tail = undefined;
+        }
+        else {
+            let prev;
+            do {
+                prev = head;
+                head = head.link;
+            } while (head.link !== undefined);
+            prev.link = undefined;
+        }
+        return head;
+    }
+    /**
+     * Remove the specified entry from the queue.
+     * @param entry
+     * @returns A pointer to the preceding entry (if any).
+     */
+    removeEntry(entry) {
+        const buf = this.getPrecedingEntry(entry);
+        if (buf !== undefined) {
+            buf.link = entry.link;
+        }
+        else {
+            this.tail = entry.link;
+        }
+        return buf;
+    }
+}
+exports.EzspQueue = EzspQueue;
+/**
+ * Simple free list (singly-linked list)
+ */
+class EzspFreeList {
+    link;
+    constructor() {
+        this.link = undefined;
+    }
+    /**
+     * Get the number of buffers in the free list.
+     * @returns
+     */
+    get length() {
+        let next = this.link;
+        let count = 0;
+        for (count; next !== undefined; count++) {
+            next = next.link;
+        }
+        return count;
+    }
+    /**
+     * Add a buffer to the free list.
+     * @param buf
+     */
+    freeBuffer(buf) {
+        if (buf) {
+            buf.link = this.link;
+            this.link = buf;
+        }
+        else {
+            throw new Error("Called freeBuffer with undefined buffer");
+        }
+    }
+    /**
+     * Get a buffer from the free list.
+     * @returns
+     */
+    allocBuffer() {
+        const buf = this.link;
+        if (buf !== undefined) {
+            this.link = buf.link;
+            buf.len = 0;
+            if (buf.data.length !== consts_1.EZSP_MAX_FRAME_LENGTH) {
+                // should never happen if buffers are handled properly, but just in case, re-alloc to max length
+                buf.data = Buffer.alloc(consts_1.EZSP_MAX_FRAME_LENGTH);
+                const e = new Error();
+                logger_1.logger.error(`Pre-allocated buffer had improper size and had to be re-allocated. ${e.stack}`, NS);
+            }
+            else {
+                // (void) memset(buffer->data, 0, EZSP_MAX_FRAME_LENGTH);
+                buf.data.fill(0);
+            }
+        }
+        return buf;
+    }
+}
+exports.EzspFreeList = EzspFreeList;
+//# sourceMappingURL=queues.js.map

package/dist/adapter/ember/uart/queues.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queues.js","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/queues.ts"],"names":[],"mappings":";AAAA,qBAAqB;;;AAErB,kDAA6C;AAC7C,2CAAqD;AAErD,MAAM,EAAE,GAAG,sBAAsB,CAAC;AAElC;;;GAGG;AACH,MAAa,UAAU;IACnB,qCAAqC;IAC9B,IAAI,CAAS;IACb,IAAI,CAAc;IACzB,cAAc;IACP,GAAG,CAAS;IAEnB;QACI,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,8BAAqB,CAAC,CAAC,CAAC,sBAAsB;QACvE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;IACjB,CAAC;CACJ;AAZD,gCAYC;AAED;;GAEG;AACH,MAAa,SAAS;IACX,IAAI,CAAc;IAEzB;QACI,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACN,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,KAAK,EAAE,IAAI,KAAK,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAI,KAAK;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACJ,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAErB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC9D,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,WAAW,CAAC,CAAS;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QAEpB,OAAO,EAAE,CAAC,EAAE,CAAC;YACT,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;gBACpB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACrD,CAAC;YAED,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB,CAAC,KAAkB;QACvC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QAEpB,IAAI,GAAG,KAAK,KAAK,EAAE,CAAC;YAChB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QACzE,CAAC;QAED,GAAG,CAAC;YACA,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBACrB,OAAO,GAAG,CAAC;YACf,CAAC;YAED,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;QACnB,CAAC,QAAQ,GAAG,KAAK,SAAS,EAAE;QAE5B,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACI,OAAO,CAAC,GAAe;QAC1B,IAAI,GAAG,EAAE,CAAC;YACN,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACpB,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;QAC5D,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,UAAU;QACb,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAErB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QACjE,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QAC1B,CAAC;aAAM,CAAC;YACJ,IAAI,IAAgB,CAAC;YAErB,GAAG,CAAC;gBACA,IAAI,GAAG,IAAI,CAAC;gBACZ,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,CAAC,QAAQ,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE;YAElC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,KAAiB;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE1C,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAC1B,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QAC3B,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AAzJD,8BAyJC;AAED;;GAEG;AACH,MAAa,YAAY;IACd,IAAI,CAAc;IAEzB;QACI,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACN,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,KAAK,EAAE,IAAI,KAAK,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,GAAe;QAC7B,IAAI,GAAG,EAAE,CAAC;YACN,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QACpB,CAAC;aAAM,CAAC;YACJ,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC/D,CAAC;IACL,CAAC;IAED;;;OAGG;IACI,WAAW;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QAEtB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC;YACrB,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAEZ,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,8BAAqB,EAAE,CAAC;gBAC5C,gGAAgG;gBAChG,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,8BAAqB,CAAC,CAAC;gBAE/C,MAAM,CAAC,GAAG,IAAI,KAAK,EAAE,CAAC;gBACtB,eAAM,CAAC,KAAK,CAAC,sEAAsE,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;YACtG,CAAC;iBAAM,CAAC;gBACJ,yDAAyD;gBACzD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AA5DD,oCA4DC"}

package/dist/adapter/ember/uart/writer.d.ts

@@ -0,0 +1,13 @@
+import { Readable } from "node:stream";
+export declare class AshWriter extends Readable {
+    #private;
+    private writeBytes;
+    writeByte(byte: number): void;
+    writeAvailable(): boolean;
+    /**
+     * If there is anything to send, send to the port.
+     */
+    writeFlush(): void;
+    _read(): void;
+}
+//# sourceMappingURL=writer.d.ts.map

package/dist/adapter/ember/uart/writer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"writer.d.ts","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/writer.ts"],"names":[],"mappings":"AAEA,OAAO,EAAC,QAAQ,EAAC,MAAM,aAAa,CAAC;AAOrC,qBAAa,SAAU,SAAQ,QAAQ;;IAInC,OAAO,CAAC,UAAU;IAYX,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAI7B,cAAc,IAAI,OAAO;IAUhC;;OAEG;IACI,UAAU,IAAI,IAAI;IAMT,KAAK,IAAI,IAAI;CAChC"}

package/dist/adapter/ember/uart/writer.js

@@ -0,0 +1,42 @@
+"use strict";
+/* v8 ignore start */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AshWriter = void 0;
+const node_stream_1 = require("node:stream");
+const consts_1 = require("./consts");
+// import {logger} from '../../../utils/logger';
+// const NS = 'zh:ember:uart:ash:writer';
+class AshWriter extends node_stream_1.Readable {
+    #writtenLen = 0;
+    #bytesToWrite = Buffer.alloc(consts_1.ASH_MAX_FRAME_WITH_CRC_LEN);
+    writeBytes() {
+        // expensive and very verbose, enable locally only if necessary
+        // logger.debug(`>>>> [FRAME raw=${buffer.toString('hex')}]`, NS);
+        // copy, can't use ref
+        const buffer = Buffer.from(this.#bytesToWrite.subarray(0, this.#writtenLen));
+        this.#writtenLen = 0;
+        // this.push(buffer);
+        this.emit("data", buffer);
+    }
+    writeByte(byte) {
+        this.#writtenLen = this.#bytesToWrite.writeUInt8(byte, this.#writtenLen);
+    }
+    writeAvailable() {
+        if (this.readableLength < this.readableHighWaterMark) {
+            return true;
+        }
+        this.writeFlush();
+        return false;
+    }
+    /**
+     * If there is anything to send, send to the port.
+     */
+    writeFlush() {
+        if (this.#writtenLen > 0) {
+            this.writeBytes();
+        }
+    }
+    _read() { }
+}
+exports.AshWriter = AshWriter;
+//# sourceMappingURL=writer.js.map

package/dist/adapter/ember/uart/writer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"writer.js","sourceRoot":"","sources":["../../../../src/adapter/ember/uart/writer.ts"],"names":[],"mappings":";AAAA,qBAAqB;;;AAErB,6CAAqC;AACrC,qCAAoD;AAEpD,gDAAgD;AAEhD,yCAAyC;AAEzC,MAAa,SAAU,SAAQ,sBAAQ;IACnC,WAAW,GAAG,CAAC,CAAC;IAChB,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,mCAA0B,CAAC,CAAC;IAEjD,UAAU;QACd,+DAA+D;QAC/D,kEAAkE;QAElE,sBAAsB;QACtB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QAErB,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,CAAC;IAEM,SAAS,CAAC,IAAY;QACzB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7E,CAAC;IAEM,cAAc;QACjB,IAAI,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;YACnD,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,UAAU,EAAE,CAAC;QAElB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,UAAU;QACb,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,UAAU,EAAE,CAAC;QACtB,CAAC;IACL,CAAC;IAEe,KAAK,KAAU,CAAC;CACnC;AAxCD,8BAwCC"}

package/dist/adapter/ember/utils/initters.d.ts

@@ -0,0 +1,20 @@
+import type { NetworkCache } from "../adapter/emberAdapter";
+import type { EmberAesMmoHashContext, SecManContext } from "../types";
+/**
+ * Initialize a network cache index with proper "invalid" values.
+ * @returns
+ */
+export declare const initNetworkCache: () => NetworkCache;
+/**
+ * This routine will initialize a Security Manager context correctly for use in subsequent function calls.
+ * @returns
+ */
+export declare const initSecurityManagerContext: () => SecManContext;
+/**
+ *  This routine clears the passed context so that a new hash calculation
+ *  can be performed.
+ *
+ *  @returns context A pointer to the location of hash context to clear.
+ */
+export declare const aesMmoHashInit: () => EmberAesMmoHashContext;
+//# sourceMappingURL=initters.d.ts.map

package/dist/adapter/ember/utils/initters.js

@@ -0,0 +1,92 @@
+"use strict";
+/* v8 ignore start */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.aesMmoHashInit = exports.initSecurityManagerContext = exports.initNetworkCache = void 0;
+const ZSpec = __importStar(require("../../../zspec"));
+const consts_1 = require("../consts");
+const enums_1 = require("../enums");
+const consts_2 = require("../ezsp/consts");
+/**
+ * Initialize a network cache index with proper "invalid" values.
+ * @returns
+ */
+const initNetworkCache = () => {
+    return {
+        eui64: ZSpec.BLANK_EUI64,
+        parameters: {
+            extendedPanId: ZSpec.BLANK_EXTENDED_PAN_ID.slice(), // copy
+            panId: ZSpec.INVALID_PAN_ID,
+            radioTxPower: 0,
+            radioChannel: consts_1.INVALID_RADIO_CHANNEL,
+            joinMethod: enums_1.EmberJoinMethod.MAC_ASSOCIATION,
+            nwkManagerId: ZSpec.NULL_NODE_ID,
+            nwkUpdateId: 0,
+            channels: ZSpec.ALL_802_15_4_CHANNELS_MASK,
+        },
+    };
+};
+exports.initNetworkCache = initNetworkCache;
+/**
+ * This routine will initialize a Security Manager context correctly for use in subsequent function calls.
+ * @returns
+ */
+const initSecurityManagerContext = () => {
+    return {
+        coreKeyType: enums_1.SecManKeyType.NONE,
+        keyIndex: 0,
+        derivedType: enums_1.SecManDerivedKeyType.NONE,
+        eui64: "0x0000000000000000",
+        multiNetworkIndex: 0,
+        flags: enums_1.SecManFlag.NONE,
+        psaKeyAlgPermission: consts_1.ZB_PSA_ALG, // unused for classic key storage
+    };
+};
+exports.initSecurityManagerContext = initSecurityManagerContext;
+/**
+ *  This routine clears the passed context so that a new hash calculation
+ *  can be performed.
+ *
+ *  @returns context A pointer to the location of hash context to clear.
+ */
+const aesMmoHashInit = () => {
+    // MEMSET(context, 0, sizeof(EmberAesMmoHashContext));
+    return {
+        result: Buffer.alloc(consts_2.EMBER_AES_HASH_BLOCK_SIZE), // uint8_t[EMBER_AES_HASH_BLOCK_SIZE]
+        length: 0x00000000, // uint32_t
+    };
+};
+exports.aesMmoHashInit = aesMmoHashInit;
+//# sourceMappingURL=initters.js.map

package/dist/adapter/ember/utils/initters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"initters.js","sourceRoot":"","sources":["../../../../src/adapter/ember/utils/initters.ts"],"names":[],"mappings":";AAAA,qBAAqB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAErB,sDAAwC;AAExC,sCAA4D;AAC5D,oCAA0F;AAC1F,2CAAyD;AAGzD;;;GAGG;AACI,MAAM,gBAAgB,GAAG,GAAiB,EAAE;IAC/C,OAAO;QACH,KAAK,EAAE,KAAK,CAAC,WAAW;QACxB,UAAU,EAAE;YACR,aAAa,EAAE,KAAK,CAAC,qBAAqB,CAAC,KAAK,EAAE,EAAE,OAAO;YAC3D,KAAK,EAAE,KAAK,CAAC,cAAc;YAC3B,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,8BAAqB;YACnC,UAAU,EAAE,uBAAe,CAAC,eAAe;YAC3C,YAAY,EAAE,KAAK,CAAC,YAAY;YAChC,WAAW,EAAE,CAAC;YACd,QAAQ,EAAE,KAAK,CAAC,0BAA0B;SAC7C;KACJ,CAAC;AACN,CAAC,CAAC;AAdW,QAAA,gBAAgB,oBAc3B;AAEF;;;GAGG;AACI,MAAM,0BAA0B,GAAG,GAAkB,EAAE;IAC1D,OAAO;QACH,WAAW,EAAE,qBAAa,CAAC,IAAI;QAC/B,QAAQ,EAAE,CAAC;QACX,WAAW,EAAE,4BAAoB,CAAC,IAAI;QACtC,KAAK,EAAE,oBAAoB;QAC3B,iBAAiB,EAAE,CAAC;QACpB,KAAK,EAAE,kBAAU,CAAC,IAAI;QACtB,mBAAmB,EAAE,mBAAU,EAAE,iCAAiC;KACrE,CAAC;AACN,CAAC,CAAC;AAVW,QAAA,0BAA0B,8BAUrC;AAEF;;;;;GAKG;AACI,MAAM,cAAc,GAAG,GAA2B,EAAE;IACvD,sDAAsD;IACtD,OAAO;QACH,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,kCAAyB,CAAC,EAAE,qCAAqC;QACtF,MAAM,EAAE,UAAU,EAAE,WAAW;KAClC,CAAC;AACN,CAAC,CAAC;AANW,QAAA,cAAc,kBAMzB"}

package/dist/adapter/ember/utils/math.d.ts

@@ -0,0 +1,41 @@
+/** increment in frame number modulus */
+export declare const inc8: (n: number) => number;
+/** Return true if n is within the range lo through hi, computed (mod 8) */
+export declare const withinRange: (lo: number, n: number, hi: number) => boolean;
+/**
+ * Calculates 16-bit cyclic redundancy code (CITT CRC 16).
+ *
+ * Applies the standard CITT CRC 16 polynomial to a
+ * single byte. It should support being called first with an initial
+ * value, then repeatedly until all data is processed.
+ *
+ * @param newByte     The new byte to be run through CRC.
+ * @param prevResult  The previous CRC result.
+ * @returns The new CRC result.
+ */
+export declare const halCommonCrc16: (newByte: number, prevResult: number) => number;
+/** Returns the low bits of the 8-bit value 'n' as uint8_t. */
+export declare const lowBits: (n: number) => number;
+/** Returns the high bits of the 8-bit value 'n' as uint8_t. */
+export declare const highBits: (n: number) => number;
+/** Returns the low byte of the 16-bit value 'n' as uint8_t. */
+export declare const lowByte: (n: number) => number;
+/** Returns the high byte of the 16-bit value 'n' as uint8_t. */
+export declare const highByte: (n: number) => number;
+/** Returns the value built from the two uint8_t values high and low. */
+export declare const highLowToInt: (high: number, low: number) => number;
+/** Useful to reference a single bit of a byte. */
+export declare const bit: (x: number) => number;
+/** Useful to reference a single bit of an uint32_t type. */
+export declare const bit32: (x: number) => number;
+/** Returns both the low and high bytes (in that order) of the same 16-bit value 'n' as uint8_t. */
+export declare const lowHighBytes: (n: number) => [number, highByte: number];
+/** Returns both the low and high bits (in that order) of the same 8-bit value 'n' as uint8_t. */
+export declare const lowHighBits: (n: number) => [number, highBits: number];
+/**
+ * Get byte as an 8-bit string (`n` assumed of proper range).
+ * @param n
+ * @returns
+ */
+export declare const byteToBits: (n: number) => string;
+//# sourceMappingURL=math.d.ts.map

package/dist/adapter/ember/utils/math.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.d.ts","sourceRoot":"","sources":["../../../../src/adapter/ember/utils/math.ts"],"names":[],"mappings":"AAIA,wCAAwC;AACxC,eAAO,MAAM,IAAI,GAAI,GAAG,MAAM,KAAG,MAAqB,CAAC;AACvD,2EAA2E;AAC3E,eAAO,MAAM,WAAW,GAAI,IAAI,MAAM,EAAE,GAAG,MAAM,EAAE,IAAI,MAAM,KAAG,OAA4C,CAAC;AAK7G;;;;;;;;;;GAUG;AACH,eAAO,MAAM,cAAc,GAAI,SAAS,MAAM,EAAE,YAAY,MAAM,KAAG,MAgBpE,CAAC;AAKF,8DAA8D;AAC9D,eAAO,MAAM,OAAO,GAAI,GAAG,MAAM,KAAG,MAAiB,CAAC;AACtD,+DAA+D;AAC/D,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,KAAG,MAA+B,CAAC;AACrE,+DAA+D;AAC/D,eAAO,MAAM,OAAO,GAAI,GAAG,MAAM,KAAG,MAAkB,CAAC;AACvD,gEAAgE;AAChE,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,KAAG,MAAgC,CAAC;AACtE,wEAAwE;AACxE,eAAO,MAAM,YAAY,GAAI,MAAM,MAAM,EAAE,KAAK,MAAM,KAAG,MAAwD,CAAC;AAClH,kDAAkD;AAClD,eAAO,MAAM,GAAG,GAAI,GAAG,MAAM,KAAG,MAAgB,CAAC;AACjD,4DAA4D;AAC5D,eAAO,MAAM,KAAK,GAAI,GAAG,MAAM,KAAG,MAAgB,CAAC;AACnD,mGAAmG;AACnG,eAAO,MAAM,YAAY,GAAI,GAAG,MAAM,KAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAA8B,CAAC;AACjG,iGAAiG;AACjG,eAAO,MAAM,WAAW,GAAI,GAAG,MAAM,KAAG,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAA8B,CAAC;AAEhG;;;;GAIG;AACH,eAAO,MAAM,UAAU,GAAI,GAAG,MAAM,KAAG,MAEtC,CAAC"}

package/dist/adapter/ember/utils/math.js

@@ -0,0 +1,80 @@
+"use strict";
+/* v8 ignore start */
+//--------------------------------------------------------------
+// Define macros for handling 3-bit frame numbers modulo 8
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.byteToBits = exports.lowHighBits = exports.lowHighBytes = exports.bit32 = exports.bit = exports.highLowToInt = exports.highByte = exports.lowByte = exports.highBits = exports.lowBits = exports.halCommonCrc16 = exports.withinRange = exports.inc8 = void 0;
+/** increment in frame number modulus */
+const inc8 = (n) => (n + 1) & 7;
+exports.inc8 = inc8;
+/** Return true if n is within the range lo through hi, computed (mod 8) */
+const withinRange = (lo, n, hi) => ((n - lo) & 7) <= ((hi - lo) & 7);
+exports.withinRange = withinRange;
+//--------------------------------------------------------------
+// CRC
+/**
+ * Calculates 16-bit cyclic redundancy code (CITT CRC 16).
+ *
+ * Applies the standard CITT CRC 16 polynomial to a
+ * single byte. It should support being called first with an initial
+ * value, then repeatedly until all data is processed.
+ *
+ * @param newByte     The new byte to be run through CRC.
+ * @param prevResult  The previous CRC result.
+ * @returns The new CRC result.
+ */
+const halCommonCrc16 = (newByte, prevResult) => {
+    /*
+     *    16bit CRC notes:
+     *    "CRC-CCITT"
+     *     poly is g(X) = X^16 + X^12 + X^5 + 1  (0x1021)
+     *     used in the FPGA (green boards and 15.4)
+     *     initial remainder should be 0xFFFF
+     */
+    prevResult = ((prevResult >> 8) & 0xffff) | ((prevResult << 8) & 0xffff);
+    prevResult ^= newByte;
+    prevResult ^= (prevResult & 0xff) >> 4;
+    prevResult ^= (((prevResult << 8) & 0xffff) << 4) & 0xffff;
+    prevResult ^= (((prevResult & 0xff) << 5) & 0xff) | (((((prevResult & 0xff) >> 3) & 0xffff) << 8) & 0xffff);
+    return prevResult;
+};
+exports.halCommonCrc16 = halCommonCrc16;
+//--------------------------------------------------------------
+// Byte manipulation
+/** Returns the low bits of the 8-bit value 'n' as uint8_t. */
+const lowBits = (n) => n & 0xf;
+exports.lowBits = lowBits;
+/** Returns the high bits of the 8-bit value 'n' as uint8_t. */
+const highBits = (n) => (0, exports.lowBits)(n >> 4) & 0xf;
+exports.highBits = highBits;
+/** Returns the low byte of the 16-bit value 'n' as uint8_t. */
+const lowByte = (n) => n & 0xff;
+exports.lowByte = lowByte;
+/** Returns the high byte of the 16-bit value 'n' as uint8_t. */
+const highByte = (n) => (0, exports.lowByte)(n >> 8) & 0xff;
+exports.highByte = highByte;
+/** Returns the value built from the two uint8_t values high and low. */
+const highLowToInt = (high, low) => ((high & 0xffff) << 8) + (low & 0xffff & 0xff);
+exports.highLowToInt = highLowToInt;
+/** Useful to reference a single bit of a byte. */
+const bit = (x) => 1 << x;
+exports.bit = bit;
+/** Useful to reference a single bit of an uint32_t type. */
+const bit32 = (x) => 1 << x;
+exports.bit32 = bit32;
+/** Returns both the low and high bytes (in that order) of the same 16-bit value 'n' as uint8_t. */
+const lowHighBytes = (n) => [(0, exports.lowByte)(n), (0, exports.highByte)(n)];
+exports.lowHighBytes = lowHighBytes;
+/** Returns both the low and high bits (in that order) of the same 8-bit value 'n' as uint8_t. */
+const lowHighBits = (n) => [(0, exports.lowBits)(n), (0, exports.highBits)(n)];
+exports.lowHighBits = lowHighBits;
+/**
+ * Get byte as an 8-bit string (`n` assumed of proper range).
+ * @param n
+ * @returns
+ */
+const byteToBits = (n) => {
+    return (n >>> 0).toString(2).padStart(8, "0");
+};
+exports.byteToBits = byteToBits;
+//# sourceMappingURL=math.js.map