GameStarter/libraries/asn1.js

// Copyright 2018 AJ ONeal. All rights reserved
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

// https://git.coolaj86.com/coolaj86/asn1-parser.js

let ELOOPN = 102;
let EDEEPN = 60;
let CTYPES = [0x30, 0x31, 0xa0, 0xa1];
let VTYPES = [0x01, 0x02, 0x05, 0x06, 0x0c, 0x82];

function parseAsn1(buf) {
    //let ws = '  ';
    function parseAsn1(buf, depth, eager) {
        if (depth.length >= EDEEPN) {
            throw new Error("EDEEP");
        }

        let index = 2; // we know, at minimum, data starts after type (0) and lengthSize (1)
        let asn1 = {type: buf[0], lengthSize: 0, length: buf[1]};
        let child;
        let iters = 0;
        let adjust = 0;
        let adjustedLen;

        // Determine how many bytes the length uses, and what it is
        if (0x80 & asn1.length) {
            asn1.lengthSize = 0x7f & asn1.length;
            // I think that buf->hex->int solves the problem of Endianness... not sure
            asn1.length = parseInt(bufToHex(buf.slice(index, index + asn1.lengthSize)), 16);
            index += asn1.lengthSize;
        }

        // High-order bit Integers have a leading 0x00 to signify that they are positive.
        // Bit Streams use the first byte to signify padding, which x.509 doesn't use.
        if (0x00 === buf[index] && (0x02 === asn1.type || 0x03 === asn1.type)) {
            // However, 0x00 on its own is a valid number
            if (asn1.length > 1) {
                index += 1;
                adjust = -1;
            }
        }
        adjustedLen = asn1.length + adjust;

        function bufToHex(u8) {
            let hex = [];
            let i, h;
            let len = (u8.byteLength || u8.length);

            for (i = 0; i < len; i += 1) {
                h = u8[i].toString(16);
                if (h.length % 2) {
                    h = '0' + h;
                }
                hex.push(h);
            }

            return hex.join('').toLowerCase();
        }

        //console.warn(depth.join(ws) + '0x' + Enc.numToHex(asn1.type), index, 'len:', asn1.length, asn1);
        function parseChildren(eager) {
            asn1.children = [];
            //console.warn('1 len:', (2 + asn1.lengthSize + asn1.length), 'idx:', index, 'clen:', 0);
            while (iters < ELOOPN && index < (2 + asn1.length + asn1.lengthSize)) {
                iters += 1;
                depth.length += 1;
                child = parseAsn1(buf.slice(index, index + adjustedLen), depth, eager);
                depth.length -= 1;
                // The numbers don't match up exactly and I don't remember why...
                // probably something with adjustedLen or some such, but the tests pass
                index += (2 + child.lengthSize + child.length);
                //console.warn('2 len:', (2 + asn1.lengthSize + asn1.length), 'idx:', index, 'clen:', (2 + child.lengthSize + child.length));
                if (index > (2 + asn1.lengthSize + asn1.length)) {
                    if (!eager) {
                        console.error("error");
                    }
                    throw new Error("Parse error: child value length (" + child.length
                        + ") is greater than remaining parent length (" + (asn1.length - index)
                        + " = " + asn1.length + " - " + index + ")");
                }
                asn1.children.push(child);
                //console.warn(depth.join(ws) + '0x' + Enc.numToHex(asn1.type), index, 'len:', asn1.length, asn1);
            }
            if (index !== (2 + asn1.lengthSize + asn1.length)) {
                //console.warn('index:', index, 'length:', (2 + asn1.lengthSize + asn1.length));
                throw new Error("premature end-of-file");
            }
            if (iters >= ELOOPN) {
                throw new Error("ELOOP");
            }

            delete asn1.value;
            return asn1;
        }

        // Recurse into types that are _always_ containers
        if (-1 !== CTYPES.indexOf(asn1.type)) {
            return parseChildren(eager);
        }

        // Return types that are _always_ values
        asn1.value = buf.slice(index, index + adjustedLen);
        if (-1 !== VTYPES.indexOf(asn1.type)) {
            return asn1;
        }

        // For ambigious / unknown types, recurse and return on failure
        // (and return child array size to zero)
        try {
            return parseChildren(true);
        } catch (e) {
            asn1.children.length = 0;
            return asn1;
        }
    }

    let asn1 = parseAsn1(buf, []);
    let len = buf.byteLength || buf.length;
    if (len !== 2 + asn1.lengthSize + asn1.length) {
        throw new Error("Length of buffer does not match length of ASN.1 sequence.");
    }
    return asn1;
}

export {parseAsn1};