mirror of
https://github.com/gorhill/uBlock.git
synced 2026-03-11 09:04:36 +00:00
In uBO, the "cache storage" is used to save resources which can be safely discarded, though at the cost of having to fetch or recompute them again. Extension storage (browser.storage.local) is now always used as cache storage backend. This has always been the default for Chromium-based browsers. For Firefox-based browsers, IndexedDB was used as backend for cache storage, with fallback to extension storage when using Firefox in private mode by default. Extension storage is reliable since it works in all contexts, though it may not be the most performant one. To speed-up loading of resources from extension storage, uBO will now make use of Cache API storage, which will mirror content of key assets saved to extension storage. Typically loading resources from Cache API is faster than loading the same resources from the extension storage. Only resources which must be loaded in memory as fast as possible will make use of the Cache API storage layered on top of the extension storage. Compiled filter lists and memory snapshot of filtering engines (aka "selfies") will be mirrored to the Cache API storage, since these must be loaded into memory as fast as possible, and reloading filter lists from their compiled counterpart is a common operation. This new design makes it now seamless to work in permanent private mode for Firefox-based browsers, since extension storage now always contains cache-related assets. Support for IndexedDB is removed for the time being, except to support migration of cached assets the first time uBO runs with the new cache storage design. In order to easily support all choices of storage, a new serializer has been introduced, which is capable of serializing/deserializing structure-cloneable data to/from a JS string. Because of this new serializer, JS data structures can be stored directly from their native representation, and deserialized directly to their native representation from uBO's point of view, since the serialization occurs (if needed) only at the storage interface level. This new serializer simplifies many code paths where data structures such as Set, Map, TypedArray, RegExp, etc. had to be converted in a disparate manner to be able to persist them to extension storage. The new serializer supports workers and LZ4 compression. These can be configured through advanced settings. With this new layered design, it's possible to introduce more storage layers if measured as beneficial (i.e. maybe browser.storage.session) References: - https://developer.mozilla.org/en-US/docs/Mozilla/Add-ons/WebExtensions/API/storage/local - https://developer.mozilla.org/en-US/docs/Web/API/Cache - https://developer.mozilla.org/en-US/docs/Web/API/Web_Workers_API/Structured_clone_algorithm
145 lines
5.4 KiB
JavaScript
145 lines
5.4 KiB
JavaScript
/*******************************************************************************
|
|
|
|
uBlock Origin - a comprehensive, efficient content blocker
|
|
Copyright (C) 2014-present Raymond Hill
|
|
|
|
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/}.
|
|
|
|
Home: https://github.com/gorhill/uBlock
|
|
*/
|
|
|
|
'use strict';
|
|
|
|
/******************************************************************************/
|
|
|
|
// Custom base64 codecs. These codecs are meant to encode/decode typed arrays
|
|
// to/from strings.
|
|
|
|
// https://github.com/uBlockOrigin/uBlock-issues/issues/461
|
|
// Provide a fallback encoding for Chromium 59 and less by issuing a plain
|
|
// JSON string. The fallback can be removed once min supported version is
|
|
// above 59.
|
|
|
|
// TODO: rename µBlock.base64 to µBlock.SparseBase64, now that
|
|
// µBlock.DenseBase64 has been introduced.
|
|
// TODO: Should no longer need to test presence of TextEncoder/TextDecoder.
|
|
|
|
const valToDigit = new Uint8Array(64);
|
|
const digitToVal = new Uint8Array(128);
|
|
{
|
|
const chars = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz@%';
|
|
for ( let i = 0, n = chars.length; i < n; i++ ) {
|
|
const c = chars.charCodeAt(i);
|
|
valToDigit[i] = c;
|
|
digitToVal[c] = i;
|
|
}
|
|
}
|
|
|
|
// The dense base64 codec is best for typed buffers which values are
|
|
// more random. For example, buffer contents as a result of compression
|
|
// contain less repetitive values and thus the content is more
|
|
// random-looking.
|
|
|
|
// TODO: Investigate that in Firefox, creating a new Uint8Array from the
|
|
// ArrayBuffer fails, the content of the resulting Uint8Array is
|
|
// non-sensical. WASM-related?
|
|
|
|
export const denseBase64 = {
|
|
magic: 'DenseBase64_1',
|
|
|
|
encode: function(input) {
|
|
const m = input.length % 3;
|
|
const n = input.length - m;
|
|
let outputLength = n / 3 * 4;
|
|
if ( m !== 0 ) {
|
|
outputLength += m + 1;
|
|
}
|
|
const output = new Uint8Array(outputLength);
|
|
let j = 0;
|
|
for ( let i = 0; i < n; i += 3) {
|
|
const i1 = input[i+0];
|
|
const i2 = input[i+1];
|
|
const i3 = input[i+2];
|
|
output[j+0] = valToDigit[ i1 >>> 2];
|
|
output[j+1] = valToDigit[i1 << 4 & 0b110000 | i2 >>> 4];
|
|
output[j+2] = valToDigit[i2 << 2 & 0b111100 | i3 >>> 6];
|
|
output[j+3] = valToDigit[i3 & 0b111111 ];
|
|
j += 4;
|
|
}
|
|
if ( m !== 0 ) {
|
|
const i1 = input[n];
|
|
output[j+0] = valToDigit[i1 >>> 2];
|
|
if ( m === 1 ) { // 1 value
|
|
output[j+1] = valToDigit[i1 << 4 & 0b110000];
|
|
} else { // 2 values
|
|
const i2 = input[n+1];
|
|
output[j+1] = valToDigit[i1 << 4 & 0b110000 | i2 >>> 4];
|
|
output[j+2] = valToDigit[i2 << 2 & 0b111100 ];
|
|
}
|
|
}
|
|
const textDecoder = new TextDecoder();
|
|
const b64str = textDecoder.decode(output);
|
|
return this.magic + b64str;
|
|
},
|
|
|
|
decode: function(instr, arrbuf) {
|
|
if ( instr.startsWith(this.magic) === false ) {
|
|
throw new Error('Invalid µBlock.denseBase64 encoding');
|
|
}
|
|
const outputLength = this.decodeSize(instr);
|
|
const outbuf = arrbuf instanceof ArrayBuffer === false
|
|
? new Uint8Array(outputLength)
|
|
: new Uint8Array(arrbuf);
|
|
const inputLength = instr.length - this.magic.length;
|
|
let i = this.magic.length;
|
|
let j = 0;
|
|
const m = inputLength & 3;
|
|
const n = i + inputLength - m;
|
|
while ( i < n ) {
|
|
const i1 = digitToVal[instr.charCodeAt(i+0)];
|
|
const i2 = digitToVal[instr.charCodeAt(i+1)];
|
|
const i3 = digitToVal[instr.charCodeAt(i+2)];
|
|
const i4 = digitToVal[instr.charCodeAt(i+3)];
|
|
i += 4;
|
|
outbuf[j+0] = i1 << 2 | i2 >>> 4;
|
|
outbuf[j+1] = i2 << 4 & 0b11110000 | i3 >>> 2;
|
|
outbuf[j+2] = i3 << 6 & 0b11000000 | i4;
|
|
j += 3;
|
|
}
|
|
if ( m !== 0 ) {
|
|
const i1 = digitToVal[instr.charCodeAt(i+0)];
|
|
const i2 = digitToVal[instr.charCodeAt(i+1)];
|
|
outbuf[j+0] = i1 << 2 | i2 >>> 4;
|
|
if ( m === 3 ) {
|
|
const i3 = digitToVal[instr.charCodeAt(i+2)];
|
|
outbuf[j+1] = i2 << 4 & 0b11110000 | i3 >>> 2;
|
|
}
|
|
}
|
|
return outbuf;
|
|
},
|
|
|
|
decodeSize: function(instr) {
|
|
if ( instr.startsWith(this.magic) === false ) { return 0; }
|
|
const inputLength = instr.length - this.magic.length;
|
|
const m = inputLength & 3;
|
|
const n = inputLength - m;
|
|
let outputLength = (n >>> 2) * 3;
|
|
if ( m !== 0 ) {
|
|
outputLength += m - 1;
|
|
}
|
|
return outputLength;
|
|
},
|
|
};
|
|
|
|
/******************************************************************************/
|