You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
virt/web/public/cloud/template-upload-hash.js

172 lines
5.8 KiB
JavaScript

const K = new Uint32Array([
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2,
]);
function rotateRight(value, bits) {
return (value >>> bits) | (value << (32 - bits));
}
/** Incremental SHA-256 with bounded memory for multi-gigabyte browser files. */
export class IncrementalSha256 {
constructor() {
this.state = new Uint32Array([
0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
]);
this.buffer = new Uint8Array(64);
this.bufferLength = 0;
this.bytesHashed = 0;
this.finished = false;
this.words = new Uint32Array(64);
}
update(input) {
if (this.finished) throw new Error('SHA-256 is already finalized.');
const bytes = input instanceof Uint8Array
? input : new Uint8Array(input);
this.bytesHashed += bytes.length;
let offset = 0;
if (this.bufferLength > 0) {
const take = Math.min(64 - this.bufferLength, bytes.length);
this.buffer.set(bytes.subarray(0, take), this.bufferLength);
this.bufferLength += take;
offset += take;
if (this.bufferLength === 64) {
this.transform(this.buffer);
this.bufferLength = 0;
}
}
while (offset + 64 <= bytes.length) {
this.transform(bytes.subarray(offset, offset + 64));
offset += 64;
}
if (offset < bytes.length) {
this.buffer.set(bytes.subarray(offset), 0);
this.bufferLength = bytes.length - offset;
}
return this;
}
transform(block) {
const words = this.words;
for (let index = 0; index < 16; index += 1) {
const offset = index * 4;
words[index] = ((block[offset] << 24) | (block[offset + 1] << 16)
| (block[offset + 2] << 8) | block[offset + 3]) >>> 0;
}
for (let index = 16; index < 64; index += 1) {
const left = words[index - 15];
const right = words[index - 2];
const sigma0 = rotateRight(left, 7) ^ rotateRight(left, 18)
^ (left >>> 3);
const sigma1 = rotateRight(right, 17) ^ rotateRight(right, 19)
^ (right >>> 10);
words[index] = (words[index - 16] + sigma0
+ words[index - 7] + sigma1) >>> 0;
}
let [a, b, c, d, e, f, g, h] = this.state;
for (let index = 0; index < 64; index += 1) {
const upper = rotateRight(e, 6) ^ rotateRight(e, 11)
^ rotateRight(e, 25);
const choose = (e & f) ^ (~e & g);
const first = (h + upper + choose + K[index] + words[index]) >>> 0;
const lower = rotateRight(a, 2) ^ rotateRight(a, 13)
^ rotateRight(a, 22);
const majority = (a & b) ^ (a & c) ^ (b & c);
const second = (lower + majority) >>> 0;
h = g;
g = f;
f = e;
e = (d + first) >>> 0;
d = c;
c = b;
b = a;
a = (first + second) >>> 0;
}
this.state[0] = (this.state[0] + a) >>> 0;
this.state[1] = (this.state[1] + b) >>> 0;
this.state[2] = (this.state[2] + c) >>> 0;
this.state[3] = (this.state[3] + d) >>> 0;
this.state[4] = (this.state[4] + e) >>> 0;
this.state[5] = (this.state[5] + f) >>> 0;
this.state[6] = (this.state[6] + g) >>> 0;
this.state[7] = (this.state[7] + h) >>> 0;
}
digest() {
if (!this.finished) {
const bitLength = this.bytesHashed * 8;
this.buffer[this.bufferLength] = 0x80;
this.bufferLength += 1;
if (this.bufferLength > 56) {
this.buffer.fill(0, this.bufferLength, 64);
this.transform(this.buffer);
this.bufferLength = 0;
}
this.buffer.fill(0, this.bufferLength, 56);
const high = Math.floor(bitLength / 0x100000000);
const low = bitLength >>> 0;
this.buffer[56] = high >>> 24;
this.buffer[57] = high >>> 16;
this.buffer[58] = high >>> 8;
this.buffer[59] = high;
this.buffer[60] = low >>> 24;
this.buffer[61] = low >>> 16;
this.buffer[62] = low >>> 8;
this.buffer[63] = low;
this.transform(this.buffer);
this.finished = true;
}
const output = new Uint8Array(32);
for (let index = 0; index < this.state.length; index += 1) {
const word = this.state[index];
const offset = index * 4;
output[offset] = word >>> 24;
output[offset + 1] = word >>> 16;
output[offset + 2] = word >>> 8;
output[offset + 3] = word;
}
return output;
}
hex() {
return Array.from(this.digest(), byte => byte.toString(16)
.padStart(2, '0')).join('');
}
}
export async function hashBlob(blob, onProgress = null,
chunkBytes = 8 * 1024 * 1024) {
if (!blob || !Number.isSafeInteger(blob.size) || blob.size < 0
|| typeof blob.slice !== 'function'
|| !Number.isSafeInteger(chunkBytes) || chunkBytes < 1) {
throw new TypeError('Invalid browser file for SHA-256.');
}
const hasher = new IncrementalSha256();
let offset = 0;
while (offset < blob.size) {
const end = Math.min(blob.size, offset + chunkBytes);
const buffer = await blob.slice(offset, end).arrayBuffer();
hasher.update(new Uint8Array(buffer));
offset = end;
if (typeof onProgress === 'function') onProgress(offset, blob.size);
}
if (blob.size === 0 && typeof onProgress === 'function') onProgress(0, 0);
return hasher.hex();
}