-
Notifications
You must be signed in to change notification settings - Fork 74
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Closes #1712 Co-authored-by: Pierre Krieger <[email protected]> Co-authored-by: mergify[bot] <37929162+mergify[bot]@users.noreply.github.com>
- Loading branch information
3 people
authored
Sep 20, 2022
1 parent
07d35b4
commit 405c38c
Showing
14 changed files
with
500 additions
and
128 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,115 @@ | ||
| // Smoldot | ||
| // Copyright (C) 2019-2022 Parity Technologies (UK) Ltd. | ||
| // SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0 | ||
|
|
||
| // This program is free software: you can redistribute it and/or modify | ||
| // it under the terms of the GNU General Public License as published by | ||
| // the Free Software Foundation, either version 3 of the License, or | ||
| // (at your option) any later version. | ||
|
|
||
| // This program is distributed in the hope that it will be useful, | ||
| // but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
| // GNU General Public License for more details. | ||
|
|
||
| // You should have received a copy of the GNU General Public License | ||
| // along with this program. If not, see <http://www.gnu.org/licenses/>. | ||
|
|
||
| let rfc4648Alphabet: Map<string, number> = new Map(); | ||
| const rfc4648AlphabetAsStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; | ||
| for (let i = 0; i < rfc4648AlphabetAsStr.length; ++i) { | ||
| rfc4648Alphabet.set(rfc4648AlphabetAsStr[i]!, i) | ||
| } | ||
|
|
||
| let urlSafeAlphabet: Map<string, number> = new Map(); | ||
| const urlSafeAlphabetAsStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"; | ||
| for (let i = 0; i < urlSafeAlphabetAsStr.length; ++i) { | ||
| urlSafeAlphabet.set(urlSafeAlphabetAsStr[i]!, i) | ||
| } | ||
|
|
||
| /** | ||
| * Decodes a multibase-encoded string. | ||
| * | ||
| * Throws an exception if the encoding isn't base64 or one of its variants. | ||
| */ | ||
| export function multibaseBase64Decode(input: string): Uint8Array { | ||
| if (input.length === 0) | ||
| throw new Error("Invalid multibase"); | ||
|
|
||
| switch (input[0]) { | ||
| case 'm': | ||
| case 'M': | ||
| return classicDecode(input.slice(1)) | ||
| case 'u': | ||
| case 'U': | ||
| return urlSafeDecode(input.slice(1)) | ||
| default: | ||
| throw new Error('Unknown multibase prefix: ' + input[0]); | ||
| } | ||
| } | ||
|
|
||
| /** | ||
| * Decodes a base64-encoded string into bytes using the original alphabet from RFC4648. | ||
| * | ||
| * See <https://datatracker.ietf.org/doc/html/rfc4648#section-4>. | ||
| */ | ||
| export function classicDecode(input: string): Uint8Array { | ||
| return base64Decode(input, rfc4648Alphabet); | ||
| } | ||
|
|
||
| /** | ||
| * Decodes a base64-encoded string into bytes using the URL-safe alphabet. | ||
| * | ||
| * See <https://datatracker.ietf.org/doc/html/rfc4648#section-5>. | ||
| */ | ||
| export function urlSafeDecode(input: string): Uint8Array { | ||
| return base64Decode(input, urlSafeAlphabet); | ||
| } | ||
|
|
||
| /** | ||
| * Decodes a base64-encoded string into bytes using the given alphabet. | ||
| */ | ||
| export function base64Decode(input: string, alphabet: Map<string, number>): Uint8Array { | ||
| // Remove the padding bytes at the end of the string. We don't check whether the padding is | ||
| // accurate. | ||
| while (input.length !== 0 && input[input.length - 1] === '=') | ||
| input = input.slice(0, -1) | ||
|
|
||
| // Contains the output data. | ||
| const out = new Uint8Array(Math.floor(input.length * 6 / 8)); | ||
| // Position within `out` of the next byte to write. | ||
| let outPos = 0; | ||
|
|
||
| // The bits decoded from the input are added to the right of this value. | ||
| let currentByte = 0; | ||
| // The left-most `validBitsInCurrentByte` bits of `currentByte` must be written out. | ||
| let validBitsInCurrentByte = 0; | ||
|
|
||
| for (let i = 0; i < input.length; ++i) { | ||
| const inputChr = input[i]!; | ||
|
|
||
| const bitsToAppend = alphabet.get(inputChr); | ||
| if (bitsToAppend === undefined) | ||
| throw new Error('Invalid base64 character: ' + inputChr); | ||
| console.assert(bitsToAppend < (1 << 6)); | ||
|
|
||
| currentByte = (currentByte << 6) | bitsToAppend; | ||
| validBitsInCurrentByte += 6; | ||
|
|
||
| if (validBitsInCurrentByte >= 8) { | ||
| let outByte = currentByte >> (validBitsInCurrentByte - 8); | ||
| out[outPos] = outByte; | ||
| outPos += 1; | ||
| validBitsInCurrentByte -= 8; | ||
| } | ||
| console.assert(validBitsInCurrentByte < 8); | ||
| currentByte &= 0xff; | ||
| } | ||
|
|
||
| if ((currentByte & ((1 << validBitsInCurrentByte) - 1)) !== 0) | ||
| throw new Error("Unexpected EOF"); | ||
| if (validBitsInCurrentByte >= 6) | ||
| throw new Error("Unexpected EOF"); | ||
|
|
||
| return out; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.