@yume-chan/adb 0.0.18 → 0.0.20

package/esm/{crypto.js → daemon/crypto.js}

@@ -1,249 +1,245 @@
-import { getBigUint64, setBigUint64, } from "@yume-chan/dataview-bigint-polyfill/esm/fallback.js";
-const BigInt0 = BigInt(0);
-const BigInt1 = BigInt(1);
-const BigInt2 = BigInt(2);
-const BigInt64 = BigInt(64);
-/**
- * Gets the `BigInt` value at the specified byte offset and length from the start of the view. There is
- * no alignment constraint; multi-byte values may be fetched from any offset.
- *
- * Only supports Big-Endian, because that's what ADB uses.
- * @param byteOffset The place in the buffer at which the value should be retrieved.
- */
-export function getBigUint(dataView, byteOffset, length) {
-    let result = BigInt0;
-    // Currently `length` must be a multiplication of 8
-    // Support for arbitrary length can be easily added
-    for (let i = byteOffset; i < byteOffset + length; i += 8) {
-        result <<= BigInt64;
-        const value = getBigUint64(dataView, i, false);
-        result += value;
-    }
-    return result;
-}
-/**
- * Stores an arbitrary-precision positive `BigInt` value at the specified byte offset from the start of the view.
- * @param byteOffset The place in the buffer at which the value should be set.
- * @param value The value to set.
- * @param littleEndian If `false` or `undefined`, a big-endian value should be written,
- * otherwise a little-endian value should be written.
- */
-export function setBigUint(dataView, byteOffset, value, littleEndian) {
-    const start = byteOffset;
-    if (littleEndian) {
-        while (value > BigInt0) {
-            setBigUint64(dataView, byteOffset, value, true);
-            byteOffset += 8;
-            value >>= BigInt64;
-        }
-    }
-    else {
-        // Because we don't know how long (in bits) the `value` is,
-        // Convert it to an array of `uint64` first.
-        const uint64Array = [];
-        while (value > BigInt0) {
-            uint64Array.push(BigInt.asUintN(64, value));
-            value >>= BigInt64;
-        }
-        for (let i = uint64Array.length - 1; i >= 0; i -= 1) {
-            setBigUint64(dataView, byteOffset, uint64Array[i], false);
-            byteOffset += 8;
-        }
-    }
-    return byteOffset - start;
-}
-// These values are correct only if
-// modulus length is 2048 and
-// public exponent (e) is 65537
-// Anyway, that's how this library generates keys
-// To support other parameters,
-// a proper ASN.1 parser can be used
-// References:
-//
-//   https://tools.ietf.org/html/rfc8017#appendix-A.1.2
-//   PKCS #1: RSA Cryptography Specifications Version 2.2
-//     A.1.2.  RSA Private Key Syntax
-//
-//   https://lapo.it/asn1js/
-//   https://github.com/lapo-luchini/asn1js
-//   ASN.1 JavaScript decoder
-//
-//   https://www.itu.int/rec/T-REC-X.690-201508-I/en
-//   X.690: Specification of Distinguished Encoding Rules (DER)
-const RsaPrivateKeyNOffset = 38;
-const RsaPrivateKeyNLength = 2048 / 8;
-const RsaPrivateKeyDOffset = 303;
-const RsaPrivateKeyDLength = 2048 / 8;
-export function parsePrivateKey(key) {
-    const view = new DataView(key.buffer, key.byteOffset, key.byteLength);
-    const n = getBigUint(view, RsaPrivateKeyNOffset, RsaPrivateKeyNLength);
-    const d = getBigUint(view, RsaPrivateKeyDOffset, RsaPrivateKeyDLength);
-    return [n, d];
-}
-// Taken from https://stackoverflow.com/a/51562038
-// I can't understand, but it does work
-// Only used with numbers smaller than 2^32 so doesn't need BigInt
-export function modInverse(a, m) {
-    a = ((a % m) + m) % m;
-    if (!a || m < 2) {
-        return NaN; // invalid input
-    }
-    // find the gcd
-    const s = [];
-    let b = m;
-    while (b) {
-        [a, b] = [b, a % b];
-        s.push({ a, b });
-    }
-    if (a !== 1) {
-        return NaN; // inverse does not exists
-    }
-    // find the inverse
-    let x = 1;
-    let y = 0;
-    for (let i = s.length - 2; i >= 0; i -= 1) {
-        [x, y] = [y, x - y * Math.floor(s[i].a / s[i].b)];
-    }
-    return ((y % m) + m) % m;
-}
-export function calculatePublicKeyLength() {
-    return 4 + 4 + 2048 / 8 + 2048 / 8 + 4;
-}
-export function calculatePublicKey(privateKey, output) {
-    // Android has its own public key generation algorithm
-    // See https://android.googlesource.com/platform/system/core.git/+/91784040db2b9273687f88d8b95f729d4a61ecc2/libcrypto_utils/android_pubkey.cpp#111
-    // The public key is an array of
-    //
-    // [
-    //   modulusLengthInWords, // 32-bit integer, a "word" is 32-bit so it must be 2048 / 8 / 4
-    //                         // Actually the comment in Android source code was wrong
-    //   n0inv,                // 32-bit integer, the modular inverse of (low 32 bits of n)
-    //   modulus,              // n
-    //   rr,                   // Montgomery parameter R^2
-    //   exponent,             // 32-bit integer, must be 65537
-    // ]
-    //
-    // (All in little endian)
-    // See https://android.googlesource.com/platform/system/core.git/+/91784040db2b9273687f88d8b95f729d4a61ecc2/libcrypto_utils/android_pubkey.cpp#38
-    // extract `n` from private key
-    const [n] = parsePrivateKey(privateKey);
-    let outputType;
-    const outputLength = calculatePublicKeyLength();
-    if (!output) {
-        output = new Uint8Array(outputLength);
-        outputType = "Uint8Array";
-    }
-    else {
-        if (output.byteLength < outputLength) {
-            throw new Error("output buffer is too small");
-        }
-        outputType = "number";
-    }
-    const outputView = new DataView(output.buffer, output.byteOffset, output.byteLength);
-    let outputOffset = 0;
-    // modulusLengthInWords
-    outputView.setUint32(outputOffset, 2048 / 8 / 4, true);
-    outputOffset += 4;
-    // Calculate `n0inv`
-    // Don't know why need to multiple -1
-    // Didn't exist in Android codebase
-    const n0inv = modInverse(Number(BigInt.asUintN(32, n) * BigInt(-1)), 2 ** 32);
-    outputView.setUint32(outputOffset, n0inv, true);
-    outputOffset += 4;
-    // Write n
-    setBigUint(outputView, outputOffset, n, true);
-    outputOffset += 256;
-    // Calculate rr = (2^(rsa_size)) ^ 2 mod n
-    const rr = BigInt(2) ** BigInt(4096) % n;
-    outputOffset += setBigUint(outputView, outputOffset, rr, true);
-    // exponent
-    outputView.setUint32(outputOffset, 65537, true);
-    outputOffset += 4;
-    if (outputType === "Uint8Array") {
-        return output;
-    }
-    else {
-        return outputLength;
-    }
-}
-/**
- * Modular exponentiation.
- *
- * Calculate `(base ** exponent) % modulus` without actually calculating `(base ** exponent)`.
- *
- * See https://en.wikipedia.org/wiki/Modular_exponentiation#Implementation_in_Lua
- */
-export function powMod(base, exponent, modulus) {
-    if (modulus === BigInt1) {
-        return BigInt0;
-    }
-    let r = BigInt1;
-    base = base % modulus;
-    while (exponent > BigInt0) {
-        if (BigInt.asUintN(1, exponent) === BigInt1) {
-            r = (r * base) % modulus;
-        }
-        exponent >>= BigInt1;
-        base = base ** BigInt2 % modulus;
-    }
-    return r;
-}
-export const SHA1_DIGEST_LENGTH = 20;
-export const ASN1_SEQUENCE = 0x30;
-export const ASN1_OCTET_STRING = 0x04;
-export const ASN1_NULL = 0x05;
-export const ASN1_OID = 0x06;
-// PKCS#1 SHA-1 hash digest info
-export const SHA1_DIGEST_INFO = new Uint8Array([
-    ASN1_SEQUENCE,
-    0x0d + SHA1_DIGEST_LENGTH,
-    ASN1_SEQUENCE,
-    0x09,
-    // SHA-1 (1 3 14 3 2 26)
-    ASN1_OID,
-    0x05,
-    1 * 40 + 3,
-    14,
-    3,
-    2,
-    26,
-    ASN1_NULL,
-    0x00,
-    ASN1_OCTET_STRING,
-    SHA1_DIGEST_LENGTH,
-]);
-// SubtleCrypto.sign() will hash the given data and sign the hash
-// But we don't need the hashing step
-// (In another word, ADB just requires the client to
-// encrypt the given data with its private key)
-// However SubtileCrypto.encrypt() doesn't accept 'RSASSA-PKCS1-v1_5' algorithm
-// So we need to implement the encryption by ourself
-export function sign(privateKey, data) {
-    const [n, d] = parsePrivateKey(privateKey);
-    // PKCS#1 padding
-    const padded = new Uint8Array(256);
-    let index = 0;
-    padded[index] = 0;
-    index += 1;
-    padded[index] = 1;
-    index += 1;
-    const fillLength = padded.length - SHA1_DIGEST_INFO.length - data.length - 1;
-    while (index < fillLength) {
-        padded[index] = 0xff;
-        index += 1;
-    }
-    padded[index] = 0;
-    index += 1;
-    padded.set(SHA1_DIGEST_INFO, index);
-    index += SHA1_DIGEST_INFO.length;
-    padded.set(data, index);
-    // Encryption
-    // signature = padded ** d % n
-    const view = new DataView(padded.buffer);
-    const signature = powMod(getBigUint(view, 0, view.byteLength), d, n);
-    // `padded` is not used anymore,
-    // re-use the buffer to store the result
-    setBigUint(view, 0, signature, false);
-    return padded;
-}
+import { getBigUint64, setBigUint64, } from "@yume-chan/dataview-bigint-polyfill/esm/fallback.js";
+/**
+ * Gets the `BigInt` value at the specified byte offset and length from the start of the view. There is
+ * no alignment constraint; multi-byte values may be fetched from any offset.
+ *
+ * Only supports Big-Endian, because that's what ADB uses.
+ * @param byteOffset The place in the buffer at which the value should be retrieved.
+ */
+export function getBigUint(dataView, byteOffset, length) {
+    let result = 0n;
+    // Currently `length` must be a multiplication of 8
+    // Support for arbitrary length can be easily added
+    for (let i = byteOffset; i < byteOffset + length; i += 8) {
+        result <<= 64n;
+        const value = getBigUint64(dataView, i, false);
+        result += value;
+    }
+    return result;
+}
+/**
+ * Stores an arbitrary-precision positive `BigInt` value at the specified byte offset from the start of the view.
+ * @param byteOffset The place in the buffer at which the value should be set.
+ * @param value The value to set.
+ * @param littleEndian If `false` or `undefined`, a big-endian value should be written,
+ * otherwise a little-endian value should be written.
+ */
+export function setBigUint(dataView, byteOffset, value, littleEndian) {
+    const start = byteOffset;
+    if (littleEndian) {
+        while (value > 0n) {
+            setBigUint64(dataView, byteOffset, value, true);
+            byteOffset += 8;
+            value >>= 64n;
+        }
+    }
+    else {
+        // Because we don't know how long (in bits) the `value` is,
+        // Convert it to an array of `uint64` first.
+        const uint64Array = [];
+        while (value > 0n) {
+            uint64Array.push(BigInt.asUintN(64, value));
+            value >>= 64n;
+        }
+        for (let i = uint64Array.length - 1; i >= 0; i -= 1) {
+            setBigUint64(dataView, byteOffset, uint64Array[i], false);
+            byteOffset += 8;
+        }
+    }
+    return byteOffset - start;
+}
+// These values are correct only if
+// modulus length is 2048 and
+// public exponent (e) is 65537
+// Anyway, that's how this library generates keys
+// To support other parameters,
+// a proper ASN.1 parser can be used
+// References:
+//
+//   https://tools.ietf.org/html/rfc8017#appendix-A.1.2
+//   PKCS #1: RSA Cryptography Specifications Version 2.2
+//     A.1.2.  RSA Private Key Syntax
+//
+//   https://lapo.it/asn1js/
+//   https://github.com/lapo-luchini/asn1js
+//   ASN.1 JavaScript decoder
+//
+//   https://www.itu.int/rec/T-REC-X.690-201508-I/en
+//   X.690: Specification of Distinguished Encoding Rules (DER)
+const RsaPrivateKeyNOffset = 38;
+const RsaPrivateKeyNLength = 2048 / 8;
+const RsaPrivateKeyDOffset = 303;
+const RsaPrivateKeyDLength = 2048 / 8;
+export function rsaParsePrivateKey(key) {
+    const view = new DataView(key.buffer, key.byteOffset, key.byteLength);
+    const n = getBigUint(view, RsaPrivateKeyNOffset, RsaPrivateKeyNLength);
+    const d = getBigUint(view, RsaPrivateKeyDOffset, RsaPrivateKeyDLength);
+    return [n, d];
+}
+// Taken from https://stackoverflow.com/a/51562038
+// I can't understand, but it does work
+// Only used with numbers smaller than 2^32 so doesn't need BigInt
+export function modInverse(a, m) {
+    a = ((a % m) + m) % m;
+    if (!a || m < 2) {
+        return NaN; // invalid input
+    }
+    // find the gcd
+    const s = [];
+    let b = m;
+    while (b) {
+        [a, b] = [b, a % b];
+        s.push({ a, b });
+    }
+    if (a !== 1) {
+        return NaN; // inverse does not exists
+    }
+    // find the inverse
+    let x = 1;
+    let y = 0;
+    for (let i = s.length - 2; i >= 0; i -= 1) {
+        [x, y] = [y, x - y * Math.floor(s[i].a / s[i].b)];
+    }
+    return ((y % m) + m) % m;
+}
+export function adbGetPublicKeySize() {
+    return 4 + 4 + 2048 / 8 + 2048 / 8 + 4;
+}
+export function adbGeneratePublicKey(privateKey, output) {
+    // Android has its own public key generation algorithm
+    // See https://android.googlesource.com/platform/system/core.git/+/91784040db2b9273687f88d8b95f729d4a61ecc2/libcrypto_utils/android_pubkey.cpp#111
+    // The public key is an array of
+    //
+    // [
+    //   modulusLengthInWords, // 32-bit integer, a "word" is 32-bit so it must be 2048 / 8 / 4
+    //                         // Actually the comment in Android source code was wrong
+    //   n0inv,                // 32-bit integer, the modular inverse of (low 32 bits of n)
+    //   modulus,              // n
+    //   rr,                   // Montgomery parameter R^2
+    //   exponent,             // 32-bit integer, must be 65537
+    // ]
+    //
+    // (All in little endian)
+    // See https://android.googlesource.com/platform/system/core.git/+/91784040db2b9273687f88d8b95f729d4a61ecc2/libcrypto_utils/android_pubkey.cpp#38
+    // extract `n` from private key
+    const [n] = rsaParsePrivateKey(privateKey);
+    let outputType;
+    const outputLength = adbGetPublicKeySize();
+    if (!output) {
+        output = new Uint8Array(outputLength);
+        outputType = "Uint8Array";
+    }
+    else {
+        if (output.byteLength < outputLength) {
+            throw new Error("output buffer is too small");
+        }
+        outputType = "number";
+    }
+    const outputView = new DataView(output.buffer, output.byteOffset, output.byteLength);
+    let outputOffset = 0;
+    // modulusLengthInWords
+    outputView.setUint32(outputOffset, 2048 / 8 / 4, true);
+    outputOffset += 4;
+    // Calculate `n0inv`
+    // Don't know why need to multiply by -1
+    // Didn't exist in Android codebase
+    const n0inv = modInverse(-Number(BigInt.asUintN(32, n)), 2 ** 32);
+    outputView.setUint32(outputOffset, n0inv, true);
+    outputOffset += 4;
+    // Write n
+    setBigUint(outputView, outputOffset, n, true);
+    outputOffset += 256;
+    // Calculate rr = (2^(rsa_size)) ^ 2 mod n
+    const rr = 2n ** 4096n % n;
+    outputOffset += setBigUint(outputView, outputOffset, rr, true);
+    // exponent
+    outputView.setUint32(outputOffset, 65537, true);
+    outputOffset += 4;
+    if (outputType === "Uint8Array") {
+        return output;
+    }
+    else {
+        return outputLength;
+    }
+}
+/**
+ * Modular exponentiation.
+ *
+ * Calculate `(base ** exponent) % modulus` without actually calculating `(base ** exponent)`.
+ *
+ * See https://en.wikipedia.org/wiki/Modular_exponentiation#Implementation_in_Lua
+ */
+export function powMod(base, exponent, modulus) {
+    if (modulus === 1n) {
+        return 0n;
+    }
+    let r = 1n;
+    base = base % modulus;
+    while (exponent > 0n) {
+        if (BigInt.asUintN(1, exponent) === 1n) {
+            r = (r * base) % modulus;
+        }
+        base = (base * base) % modulus;
+        exponent >>= 1n;
+    }
+    return r;
+}
+export const SHA1_DIGEST_LENGTH = 20;
+export const ASN1_SEQUENCE = 0x30;
+export const ASN1_OCTET_STRING = 0x04;
+export const ASN1_NULL = 0x05;
+export const ASN1_OID = 0x06;
+// PKCS#1 SHA-1 hash digest info
+export const SHA1_DIGEST_INFO = new Uint8Array([
+    ASN1_SEQUENCE,
+    0x0d + SHA1_DIGEST_LENGTH,
+    ASN1_SEQUENCE,
+    0x09,
+    // SHA-1 (1 3 14 3 2 26)
+    ASN1_OID,
+    0x05,
+    1 * 40 + 3,
+    14,
+    3,
+    2,
+    26,
+    ASN1_NULL,
+    0x00,
+    ASN1_OCTET_STRING,
+    SHA1_DIGEST_LENGTH,
+]);
+// SubtleCrypto.sign() will hash the given data and sign the hash
+// But we don't need the hashing step
+// (In another word, ADB just requires the client to
+// encrypt the given data with its private key)
+// However SubtileCrypto.encrypt() doesn't accept 'RSASSA-PKCS1-v1_5' algorithm
+// So we need to implement the encryption by ourself
+export function rsaSign(privateKey, data) {
+    const [n, d] = rsaParsePrivateKey(privateKey);
+    // PKCS#1 padding
+    const padded = new Uint8Array(256);
+    let index = 0;
+    padded[index] = 0;
+    index += 1;
+    padded[index] = 1;
+    index += 1;
+    const fillLength = padded.length - SHA1_DIGEST_INFO.length - data.length - 1;
+    while (index < fillLength) {
+        padded[index] = 0xff;
+        index += 1;
+    }
+    padded[index] = 0;
+    index += 1;
+    padded.set(SHA1_DIGEST_INFO, index);
+    index += SHA1_DIGEST_INFO.length;
+    padded.set(data, index);
+    // Encryption
+    // signature = padded ** d % n
+    const view = new DataView(padded.buffer);
+    const signature = powMod(getBigUint(view, 0, view.byteLength), d, n);
+    // `padded` is not used anymore,
+    // re-use the buffer to store the result
+    setBigUint(view, 0, signature, false);
+    return padded;
+}
 //# sourceMappingURL=crypto.js.map

package/esm/daemon/crypto.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"crypto.js","sourceRoot":"","sources":["../../src/daemon/crypto.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,YAAY,EACZ,YAAY,GACf,MAAM,qDAAqD,CAAC;AAE7D;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACtB,QAAkB,EAClB,UAAkB,EAClB,MAAc;IAEd,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,mDAAmD;IACnD,mDAAmD;IAEnD,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,UAAU,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACtD,MAAM,KAAK,GAAG,CAAC;QACf,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,IAAI,KAAK,CAAC;KACnB;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CACtB,QAAkB,EAClB,UAAkB,EAClB,KAAa,EACb,YAAsB;IAEtB,MAAM,KAAK,GAAG,UAAU,CAAC;IAEzB,IAAI,YAAY,EAAE;QACd,OAAO,KAAK,GAAG,EAAE,EAAE;YACf,YAAY,CAAC,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAChD,UAAU,IAAI,CAAC,CAAC;YAChB,KAAK,KAAK,GAAG,CAAC;SACjB;KACJ;SAAM;QACH,2DAA2D;QAC3D,4CAA4C;QAC5C,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,OAAO,KAAK,GAAG,EAAE,EAAE;YACf,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5C,KAAK,KAAK,GAAG,CAAC;SACjB;QAED,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;YACjD,YAAY,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,UAAU,IAAI,CAAC,CAAC;SACnB;KACJ;IAED,OAAO,UAAU,GAAG,KAAK,CAAC;AAC9B,CAAC;AAED,mCAAmC;AACnC,6BAA6B;AAC7B,+BAA+B;AAC/B,iDAAiD;AAEjD,+BAA+B;AAC/B,oCAAoC;AAEpC,cAAc;AACd,EAAE;AACF,uDAAuD;AACvD,yDAAyD;AACzD,qCAAqC;AACrC,EAAE;AACF,4BAA4B;AAC5B,2CAA2C;AAC3C,6BAA6B;AAC7B,EAAE;AACF,oDAAoD;AACpD,+DAA+D;AAE/D,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAChC,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC,CAAC;AACtC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACjC,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC,CAAC;AAEtC,MAAM,UAAU,kBAAkB,CAAC,GAAe;IAC9C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;IACtE,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,oBAAoB,EAAE,oBAAoB,CAAC,CAAC;IACvE,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,oBAAoB,EAAE,oBAAoB,CAAC,CAAC;IACvE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClB,CAAC;AAED,kDAAkD;AAClD,uCAAuC;AACvC,kEAAkE;AAClE,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC3C,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;QACb,OAAO,GAAG,CAAC,CAAC,gBAAgB;KAC/B;IACD,eAAe;IACf,MAAM,CAAC,GAAG,EAAE,CAAC;IACb,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,EAAE;QACN,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;KACpB;IACD,IAAI,CAAC,KAAK,CAAC,EAAE;QACT,OAAO,GAAG,CAAC,CAAC,0BAA0B;KACzC;IACD,mBAAmB;IACnB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;QACvC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC;KACvD;IACD,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7B,CAAC;AAED,MAAM,UAAU,mBAAmB;IAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;AAC3C,CAAC;AAOD,MAAM,UAAU,oBAAoB,CAChC,UAAsB,EACtB,MAAmB;IAEnB,sDAAsD;IACtD,kJAAkJ;IAElJ,gCAAgC;IAChC,EAAE;IACF,IAAI;IACJ,2FAA2F;IAC3F,mFAAmF;IACnF,uFAAuF;IACvF,+BAA+B;IAC/B,sDAAsD;IACtD,2DAA2D;IAC3D,IAAI;IACJ,EAAE;IACF,yBAAyB;IACzB,iJAAiJ;IAEjJ,+BAA+B;IAC/B,MAAM,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IAE3C,IAAI,UAAmC,CAAC;IACxC,MAAM,YAAY,GAAG,mBAAmB,EAAE,CAAC;IAC3C,IAAI,CAAC,MAAM,EAAE;QACT,MAAM,GAAG,IAAI,UAAU,CAAC,YAAY,CAAC,CAAC;QACtC,UAAU,GAAG,YAAY,CAAC;KAC7B;SAAM;QACH,IAAI,MAAM,CAAC,UAAU,GAAG,YAAY,EAAE;YAClC,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;SACjD;QAED,UAAU,GAAG,QAAQ,CAAC;KACzB;IAED,MAAM,UAAU,GAAG,IAAI,QAAQ,CAC3B,MAAM,CAAC,MAAM,EACb,MAAM,CAAC,UAAU,EACjB,MAAM,CAAC,UAAU,CACpB,CAAC;IACF,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,uBAAuB;IACvB,UAAU,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IACvD,YAAY,IAAI,CAAC,CAAC;IAElB,oBAAoB;IACpB,wCAAwC;IACxC,mCAAmC;IACnC,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;IAClE,UAAU,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,YAAY,IAAI,CAAC,CAAC;IAElB,UAAU;IACV,UAAU,CAAC,UAAU,EAAE,YAAY,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9C,YAAY,IAAI,GAAG,CAAC;IAEpB,0CAA0C;IAC1C,MAAM,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC;IAC3B,YAAY,IAAI,UAAU,CAAC,UAAU,EAAE,YAAY,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAE/D,WAAW;IACX,UAAU,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IAChD,YAAY,IAAI,CAAC,CAAC;IAElB,IAAI,UAAU,KAAK,YAAY,EAAE;QAC7B,OAAO,MAAM,CAAC;KACjB;SAAM;QACH,OAAO,YAAY,CAAC;KACvB;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,MAAM,CAClB,IAAY,EACZ,QAAgB,EAChB,OAAe;IAEf,IAAI,OAAO,KAAK,EAAE,EAAE;QAChB,OAAO,EAAE,CAAC;KACb;IAED,IAAI,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC;IAEtB,OAAO,QAAQ,GAAG,EAAE,EAAE;QAClB,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE;YACpC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC;SAC5B;QAED,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC;QAC/B,QAAQ,KAAK,EAAE,CAAC;KACnB;IAED,OAAO,CAAC,CAAC;AACb,CAAC;AAED,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAAC;AAClC,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,CAAC;AACtC,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,CAAC;AAC9B,MAAM,CAAC,MAAM,QAAQ,GAAG,IAAI,CAAC;AAE7B,gCAAgC;AAChC,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,UAAU,CAAC;IAC3C,aAAa;IACb,IAAI,GAAG,kBAAkB;IACzB,aAAa;IACb,IAAI;IACJ,wBAAwB;IACxB,QAAQ;IACR,IAAI;IACJ,CAAC,GAAG,EAAE,GAAG,CAAC;IACV,EAAE;IACF,CAAC;IACD,CAAC;IACD,EAAE;IACF,SAAS;IACT,IAAI;IACJ,iBAAiB;IACjB,kBAAkB;CACrB,CAAC,CAAC;AAEH,iEAAiE;AACjE,qCAAqC;AACrC,oDAAoD;AACpD,+CAA+C;AAC/C,+EAA+E;AAC/E,oDAAoD;AACpD,MAAM,UAAU,OAAO,CAAC,UAAsB,EAAE,IAAgB;IAC5D,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IAE9C,iBAAiB;IACjB,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,CAAC;IAEX,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,CAAC;IAEX,MAAM,UAAU,GACZ,MAAM,CAAC,MAAM,GAAG,gBAAgB,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9D,OAAO,KAAK,GAAG,UAAU,EAAE;QACvB,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC;KACd;IAED,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,CAAC;IAEX,MAAM,CAAC,GAAG,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;IACpC,KAAK,IAAI,gBAAgB,CAAC,MAAM,CAAC;IAEjC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAExB,aAAa;IACb,8BAA8B;IAC9B,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAErE,gCAAgC;IAChC,wCAAwC;IACxC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAEtC,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/esm/daemon/device.d.ts

@@ -0,0 +1,9 @@
+import type { Consumable, ReadableWritablePair } from "@yume-chan/stream-extra";
+import type { ValueOrPromise } from "@yume-chan/struct";
+import type { AdbPacketData, AdbPacketInit } from "./packet.js";
+export interface AdbDaemonDevice {
+    readonly serial: string;
+    readonly name: string | undefined;
+    connect(): ValueOrPromise<ReadableWritablePair<AdbPacketData, Consumable<AdbPacketInit>>>;
+}
+//# sourceMappingURL=device.d.ts.map

package/esm/daemon/device.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"device.d.ts","sourceRoot":"","sources":["../../src/daemon/device.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAChF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAExD,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAEhE,MAAM,WAAW,eAAe;IAC5B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAExB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IAElC,OAAO,IAAI,cAAc,CACrB,oBAAoB,CAAC,aAAa,EAAE,UAAU,CAAC,aAAa,CAAC,CAAC,CACjE,CAAC;CACL"}

package/esm/daemon/device.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=device.js.map

package/esm/daemon/device.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"device.js","sourceRoot":"","sources":["../../src/daemon/device.ts"],"names":[],"mappings":""}

package/esm/daemon/dispatcher.d.ts

@@ -0,0 +1,42 @@
+import type { Consumable, ReadableWritablePair } from "@yume-chan/stream-extra";
+import type { AdbIncomingSocketHandler, AdbSocket, Closeable } from "../adb.js";
+import type { AdbPacketData, AdbPacketInit } from "./packet.js";
+import { AdbCommand } from "./packet.js";
+export interface AdbPacketDispatcherOptions {
+    calculateChecksum: boolean;
+    /**
+     * Before Android 9.0, ADB uses `char*` to parse service string,
+     * thus requires a null character to terminate.
+     *
+     * Usually it should have the same value as `calculateChecksum`.
+     */
+    appendNullToServiceString: boolean;
+    maxPayloadSize: number;
+}
+/**
+ * The dispatcher is the "dumb" part of the connection handling logic.
+ *
+ * Except some options to change some minor behaviors,
+ * its only job is forwarding packets between authenticated underlying streams
+ * and abstracted socket objects.
+ *
+ * The `Adb` class is responsible for doing the authentication,
+ * negotiating the options, and has shortcuts to high-level services.
+ */
+export declare class AdbPacketDispatcher implements Closeable {
+    #private;
+    readonly options: AdbPacketDispatcherOptions;
+    get disconnected(): Promise<void>;
+    constructor(connection: ReadableWritablePair<AdbPacketData, Consumable<AdbPacketInit>>, options: AdbPacketDispatcherOptions);
+    private handleOk;
+    private handleClose;
+    addReverseTunnel(service: string, handler: AdbIncomingSocketHandler): void;
+    removeReverseTunnel(address: string): void;
+    clearReverseTunnels(): void;
+    private handleOpen;
+    createSocket(service: string): Promise<AdbSocket>;
+    sendPacket(command: AdbCommand, arg0: number, arg1: number, payload?: string | Uint8Array): Promise<void>;
+    close(): Promise<void>;
+    private dispose;
+}
+//# sourceMappingURL=dispatcher.d.ts.map

package/esm/daemon/dispatcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dispatcher.d.ts","sourceRoot":"","sources":["../../src/daemon/dispatcher.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACR,UAAU,EACV,oBAAoB,EAEvB,MAAM,yBAAyB,CAAC;AAQjC,OAAO,KAAK,EAAE,wBAAwB,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAGhF,OAAO,KAAK,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAChE,OAAO,EAAE,UAAU,EAAqB,MAAM,aAAa,CAAC;AAG5D,MAAM,WAAW,0BAA0B;IACvC,iBAAiB,EAAE,OAAO,CAAC;IAC3B;;;;;OAKG;IACH,yBAAyB,EAAE,OAAO,CAAC;IACnC,cAAc,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;;;GASG;AACH,qBAAa,mBAAoB,YAAW,SAAS;;IAWjD,SAAgB,OAAO,EAAE,0BAA0B,CAAC;IAIpD,IAAW,YAAY,kBAEtB;gBAMG,UAAU,EAAE,oBAAoB,CAC5B,aAAa,EACb,UAAU,CAAC,aAAa,CAAC,CAC5B,EACD,OAAO,EAAE,0BAA0B;IAuEvC,OAAO,CAAC,QAAQ;YAkBF,WAAW;IA6ClB,gBAAgB,CACnB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,wBAAwB;IAK9B,mBAAmB,CAAC,OAAO,EAAE,MAAM;IAInC,mBAAmB;YAIZ,UAAU;IAmCX,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IAsBjD,UAAU,CACnB,OAAO,EAAE,UAAU,EACnB,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,MAAM,EACZ,OAAO,GAAE,MAAM,GAAG,UAA8B,GACjD,OAAO,CAAC,IAAI,CAAC;IAqBH,KAAK;IAgBlB,OAAO,CAAC,OAAO;CAOlB"}