зеркало из https://github.com/mozilla/gecko-dev.git
Backed out 10 changesets (bug 1550108) for causing build bustages on StartupCache.cpp.
Backed out changeset cbadfa2bbd7e (bug 1550108) Backed out changeset 2560f0ab6ebf (bug 1550108) Backed out changeset 0a1fa8d8bb3c (bug 1550108) Backed out changeset 62416909cf67 (bug 1550108) Backed out changeset 60991713b1e2 (bug 1550108) Backed out changeset f950e30afd90 (bug 1550108) Backed out changeset e63d0a1fec38 (bug 1550108) Backed out changeset 7a009d42e7e7 (bug 1550108) Backed out changeset 395affa4c205 (bug 1550108) Backed out changeset 0fd41e9dbd2a (bug 1550108) --HG-- rename : mfbt/lz4/lz4.c => mfbt/lz4.c rename : mfbt/lz4/lz4.h => mfbt/lz4.h
This commit is contained in:
Cosmin Sabou
Родитель
4fce63cac2
Коммит
14938bad3b
|
|
@ -138,7 +138,7 @@ media/openmax_il/.*
|
|||
media/webrtc/signaling/src/sdp/sipcc/.*
|
||||
media/webrtc/trunk/.*
|
||||
mfbt/double-conversion/double-conversion/.*
|
||||
mfbt/lz4/.*
|
||||
mfbt/lz4.*
|
||||
mobile/android/geckoview/src/thirdparty/.*
|
||||
mobile/android/thirdparty/.*
|
||||
modules/brotli/.*
|
||||
|
|
|
|||
|
|
@ -119,7 +119,7 @@ src:*/modules/zlib/src/*
|
|||
# Our LZ4 implementation uses overflows. By listing it here we might
|
||||
# miss some unintended overflows in that implementation, but we can't
|
||||
# check for it right now.
|
||||
src:*/mfbt/lz4/*
|
||||
src:*/mfbt/lz4.c
|
||||
|
||||
# Apparently this overflows a lot, because it contains some allocators
|
||||
# that keep overflowing, not sure why. Disabling by function didn't seem
|
||||
|
|
|
|||
|
|
@ -14,7 +14,6 @@
|
|||
#include "mozilla/dom/ContentProcessMessageManager.h"
|
||||
#include "mozilla/dom/IPCBlobUtils.h"
|
||||
#include "mozilla/dom/ScriptSettings.h"
|
||||
#include "mozilla/IOBuffers.h"
|
||||
#include "mozilla/ScriptPreloader.h"
|
||||
|
||||
using namespace mozilla::loader;
|
||||
|
|
|
|||
|
|
@ -186,14 +186,14 @@ nsresult nsXBLDocumentInfo::ReadPrototypeBindings(nsIURI* aURI,
|
|||
return NS_ERROR_FAILURE;
|
||||
}
|
||||
|
||||
const char* buf;
|
||||
UniquePtr<char[]> buf;
|
||||
uint32_t len;
|
||||
rv = startupCache->GetBuffer(spec.get(), &buf, &len);
|
||||
// GetBuffer will fail if the binding is not in the cache.
|
||||
if (NS_FAILED(rv)) return rv;
|
||||
|
||||
nsCOMPtr<nsIObjectInputStream> stream;
|
||||
rv = NewObjectInputStreamFromBuffer(buf, len,
|
||||
rv = NewObjectInputStreamFromBuffer(std::move(buf), len,
|
||||
getter_AddRefs(stream));
|
||||
NS_ENSURE_SUCCESS(rv, rv);
|
||||
|
||||
|
|
|
|||
|
|
@ -260,7 +260,7 @@ nsresult nsXULPrototypeCache::GetInputStream(nsIURI* uri,
|
|||
nsresult rv = PathifyURI(uri, spec);
|
||||
if (NS_FAILED(rv)) return NS_ERROR_NOT_AVAILABLE;
|
||||
|
||||
const char* buf;
|
||||
UniquePtr<char[]> buf;
|
||||
uint32_t len;
|
||||
nsCOMPtr<nsIObjectInputStream> ois;
|
||||
StartupCache* sc = StartupCache::GetSingleton();
|
||||
|
|
@ -269,7 +269,7 @@ nsresult nsXULPrototypeCache::GetInputStream(nsIURI* uri,
|
|||
rv = sc->GetBuffer(spec.get(), &buf, &len);
|
||||
if (NS_FAILED(rv)) return NS_ERROR_NOT_AVAILABLE;
|
||||
|
||||
rv = NewObjectInputStreamFromBuffer(buf, len, getter_AddRefs(ois));
|
||||
rv = NewObjectInputStreamFromBuffer(std::move(buf), len, getter_AddRefs(ois));
|
||||
NS_ENSURE_SUCCESS(rv, rv);
|
||||
|
||||
mInputStreamTable.Put(uri, ois);
|
||||
|
|
@ -353,9 +353,10 @@ nsresult nsXULPrototypeCache::HasData(nsIURI* uri, bool* exists) {
|
|||
return NS_OK;
|
||||
}
|
||||
UniquePtr<char[]> buf;
|
||||
uint32_t len;
|
||||
StartupCache* sc = StartupCache::GetSingleton();
|
||||
if (sc) {
|
||||
*exists = sc->HasEntry(spec.get());
|
||||
rv = sc->GetBuffer(spec.get(), &buf, &len);
|
||||
} else {
|
||||
*exists = false;
|
||||
return NS_OK;
|
||||
|
|
@ -398,13 +399,14 @@ nsresult nsXULPrototypeCache::BeginCaching(nsIURI* aURI) {
|
|||
|
||||
nsAutoCString fileChromePath, fileLocale;
|
||||
|
||||
const char* buf = nullptr;
|
||||
UniquePtr<char[]> buf;
|
||||
uint32_t len, amtRead;
|
||||
nsCOMPtr<nsIObjectInputStream> objectInput;
|
||||
|
||||
rv = startupCache->GetBuffer(kXULCacheInfoKey, &buf, &len);
|
||||
if (NS_SUCCEEDED(rv))
|
||||
rv = NewObjectInputStreamFromBuffer(buf, len, getter_AddRefs(objectInput));
|
||||
rv = NewObjectInputStreamFromBuffer(std::move(buf), len,
|
||||
getter_AddRefs(objectInput));
|
||||
|
||||
if (NS_SUCCEEDED(rv)) {
|
||||
rv = objectInput->ReadCString(fileLocale);
|
||||
|
|
@ -460,10 +462,10 @@ nsresult nsXULPrototypeCache::BeginCaching(nsIURI* aURI) {
|
|||
}
|
||||
|
||||
if (NS_SUCCEEDED(rv)) {
|
||||
auto putBuf = MakeUnique<char[]>(len);
|
||||
rv = inputStream->Read(putBuf.get(), len, &amtRead);
|
||||
buf = MakeUnique<char[]>(len);
|
||||
rv = inputStream->Read(buf.get(), len, &amtRead);
|
||||
if (NS_SUCCEEDED(rv) && len == amtRead)
|
||||
rv = startupCache->PutBuffer(kXULCacheInfoKey, std::move(putBuf), len);
|
||||
rv = startupCache->PutBuffer(kXULCacheInfoKey, std::move(buf), len);
|
||||
else {
|
||||
rv = NS_ERROR_UNEXPECTED;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -48,7 +48,6 @@
|
|||
#include "nsIMemory.h"
|
||||
#include "gfxFontConstants.h"
|
||||
|
||||
#include "mozilla/EndianUtils.h"
|
||||
#include "mozilla/Preferences.h"
|
||||
#include "mozilla/scache/StartupCache.h"
|
||||
#include <fcntl.h>
|
||||
|
|
@ -700,8 +699,8 @@ class FontNameCache {
|
|||
}
|
||||
|
||||
uint32_t size;
|
||||
const char* cur;
|
||||
if (NS_FAILED(mCache->GetBuffer(CACHE_KEY, &cur, &size))) {
|
||||
UniquePtr<char[]> buf;
|
||||
if (NS_FAILED(mCache->GetBuffer(CACHE_KEY, &buf, &size))) {
|
||||
LOG(("no cache of " CACHE_KEY));
|
||||
return;
|
||||
}
|
||||
|
|
@ -711,6 +710,8 @@ class FontNameCache {
|
|||
mMap.Clear();
|
||||
mWriteNeeded = false;
|
||||
|
||||
const char* cur = buf.get();
|
||||
|
||||
while (const char* fileEnd = strchr(cur, kFileSep)) {
|
||||
// The cached record for one file is at [cur, fileEnd].
|
||||
|
||||
|
|
@ -1116,7 +1117,7 @@ void gfxFT2FontList::FindFontsInOmnijar(FontNameCache* aCache) {
|
|||
|
||||
mozilla::scache::StartupCache* cache =
|
||||
mozilla::scache::StartupCache::GetSingleton();
|
||||
const char* cachedModifiedTimeBuf;
|
||||
UniquePtr<char[]> cachedModifiedTimeBuf;
|
||||
uint32_t longSize;
|
||||
if (cache &&
|
||||
NS_SUCCEEDED(cache->GetBuffer(JAR_LAST_MODIFED_TIME,
|
||||
|
|
@ -1124,7 +1125,7 @@ void gfxFT2FontList::FindFontsInOmnijar(FontNameCache* aCache) {
|
|||
longSize == sizeof(int64_t)) {
|
||||
nsCOMPtr<nsIFile> jarFile = Omnijar::GetPath(Omnijar::Type::GRE);
|
||||
jarFile->GetLastModifiedTime(&mJarModifiedTime);
|
||||
if (mJarModifiedTime > LittleEndian::readInt64(cachedModifiedTimeBuf)) {
|
||||
if (mJarModifiedTime > *(int64_t*)cachedModifiedTimeBuf.get()) {
|
||||
jarChanged = true;
|
||||
}
|
||||
}
|
||||
|
|
@ -1383,7 +1384,7 @@ void gfxFT2FontList::WriteCache() {
|
|||
if (cache && mJarModifiedTime > 0) {
|
||||
const size_t bufSize = sizeof(mJarModifiedTime);
|
||||
auto buf = MakeUnique<char[]>(bufSize);
|
||||
LittleEndian::writeInt64(buf.get(), mJarModifiedTime);
|
||||
memcpy(buf.get(), &mJarModifiedTime, bufSize);
|
||||
|
||||
LOG(("WriteCache: putting Jar, length %zu", bufSize));
|
||||
cache->PutBuffer(JAR_LAST_MODIFED_TIME, std::move(buf), bufSize);
|
||||
|
|
|
|||
|
|
@ -1,148 +0,0 @@
|
|||
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2; -*- */
|
||||
/* 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/. */
|
||||
|
||||
#ifndef IOBuffers_h
|
||||
#define IOBuffers_h
|
||||
|
||||
#include "mozilla/Assertions.h"
|
||||
#include "mozilla/CheckedInt.h"
|
||||
#include "mozilla/EndianUtils.h"
|
||||
#include "mozilla/EnumSet.h"
|
||||
#include "mozilla/Range.h"
|
||||
#include "mozilla/Span.h"
|
||||
#include "nsString.h"
|
||||
#include "nsTArray.h"
|
||||
|
||||
namespace mozilla {
|
||||
namespace loader {
|
||||
|
||||
class OutputBuffer {
|
||||
public:
|
||||
OutputBuffer() {}
|
||||
|
||||
uint8_t* write(size_t size) {
|
||||
auto buf = data.AppendElements(size);
|
||||
cursor_ += size;
|
||||
return buf;
|
||||
}
|
||||
|
||||
void codeUint8(const uint8_t& val) { *write(sizeof val) = val; }
|
||||
|
||||
template <typename T>
|
||||
void codeUint8(const EnumSet<T>& val) {
|
||||
// EnumSets are always represented as uint32_t values, so we need to
|
||||
// assert that the value actually fits in a uint8 before writing it.
|
||||
uint32_t value = val.serialize();
|
||||
codeUint8(CheckedUint8(value).value());
|
||||
}
|
||||
|
||||
void codeUint16(const uint16_t& val) {
|
||||
LittleEndian::writeUint16(write(sizeof val), val);
|
||||
}
|
||||
|
||||
void codeUint32(const uint32_t& val) {
|
||||
LittleEndian::writeUint32(write(sizeof val), val);
|
||||
}
|
||||
|
||||
void codeString(const nsCString& str) {
|
||||
auto len = CheckedUint16(str.Length()).value();
|
||||
|
||||
codeUint16(len);
|
||||
memcpy(write(len), str.BeginReading(), len);
|
||||
}
|
||||
|
||||
size_t cursor() const { return cursor_; }
|
||||
|
||||
uint8_t* Get() { return data.Elements(); }
|
||||
|
||||
const uint8_t* Get() const { return data.Elements(); }
|
||||
|
||||
private:
|
||||
nsTArray<uint8_t> data;
|
||||
size_t cursor_ = 0;
|
||||
};
|
||||
|
||||
class InputBuffer {
|
||||
public:
|
||||
explicit InputBuffer(const Range<uint8_t>& buffer) : data(buffer) {}
|
||||
|
||||
const uint8_t* read(size_t size) {
|
||||
MOZ_ASSERT(checkCapacity(size));
|
||||
|
||||
auto buf = &data[cursor_];
|
||||
cursor_ += size;
|
||||
return buf;
|
||||
}
|
||||
|
||||
bool codeUint8(uint8_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = *read(sizeof val);
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
bool codeUint8(EnumSet<T>& val) {
|
||||
uint8_t value;
|
||||
if (codeUint8(value)) {
|
||||
val.deserialize(value);
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeUint16(uint16_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = LittleEndian::readUint16(read(sizeof val));
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeUint32(uint32_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = LittleEndian::readUint32(read(sizeof val));
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeString(nsCString& str) {
|
||||
uint16_t len;
|
||||
if (codeUint16(len)) {
|
||||
if (checkCapacity(len)) {
|
||||
str.SetLength(len);
|
||||
memcpy(str.BeginWriting(), read(len), len);
|
||||
}
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool error() { return error_; }
|
||||
|
||||
bool finished() { return error_ || !remainingCapacity(); }
|
||||
|
||||
size_t remainingCapacity() { return data.length() - cursor_; }
|
||||
|
||||
size_t cursor() const { return cursor_; }
|
||||
|
||||
const uint8_t* Get() const { return data.begin().get(); }
|
||||
|
||||
private:
|
||||
bool checkCapacity(size_t size) {
|
||||
if (size > remainingCapacity()) {
|
||||
error_ = true;
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool error_ = false;
|
||||
|
||||
public:
|
||||
const Range<uint8_t>& data;
|
||||
size_t cursor_ = 0;
|
||||
};
|
||||
|
||||
} // namespace loader
|
||||
} // namespace mozilla
|
||||
|
||||
#endif // IOBuffers_h
|
||||
|
|
@ -38,6 +38,130 @@ struct MOZ_RAII AutoSafeJSAPI : public AutoJSAPI {
|
|||
AutoSafeJSAPI() { Init(); }
|
||||
};
|
||||
|
||||
class OutputBuffer {
|
||||
public:
|
||||
OutputBuffer() {}
|
||||
|
||||
uint8_t* write(size_t size) {
|
||||
auto buf = data.AppendElements(size);
|
||||
cursor_ += size;
|
||||
return buf;
|
||||
}
|
||||
|
||||
void codeUint8(const uint8_t& val) { *write(sizeof val) = val; }
|
||||
|
||||
template <typename T>
|
||||
void codeUint8(const EnumSet<T>& val) {
|
||||
// EnumSets are always represented as uint32_t values, so we need to
|
||||
// assert that the value actually fits in a uint8 before writing it.
|
||||
uint32_t value = val.serialize();
|
||||
codeUint8(CheckedUint8(value).value());
|
||||
}
|
||||
|
||||
void codeUint16(const uint16_t& val) {
|
||||
LittleEndian::writeUint16(write(sizeof val), val);
|
||||
}
|
||||
|
||||
void codeUint32(const uint32_t& val) {
|
||||
LittleEndian::writeUint32(write(sizeof val), val);
|
||||
}
|
||||
|
||||
void codeString(const nsCString& str) {
|
||||
auto len = CheckedUint16(str.Length()).value();
|
||||
|
||||
codeUint16(len);
|
||||
memcpy(write(len), str.BeginReading(), len);
|
||||
}
|
||||
|
||||
size_t cursor() const { return cursor_; }
|
||||
|
||||
uint8_t* Get() { return data.Elements(); }
|
||||
|
||||
const uint8_t* Get() const { return data.Elements(); }
|
||||
|
||||
private:
|
||||
nsTArray<uint8_t> data;
|
||||
size_t cursor_ = 0;
|
||||
};
|
||||
|
||||
class InputBuffer {
|
||||
public:
|
||||
explicit InputBuffer(const Range<uint8_t>& buffer) : data(buffer) {}
|
||||
|
||||
const uint8_t* read(size_t size) {
|
||||
MOZ_ASSERT(checkCapacity(size));
|
||||
|
||||
auto buf = &data[cursor_];
|
||||
cursor_ += size;
|
||||
return buf;
|
||||
}
|
||||
|
||||
bool codeUint8(uint8_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = *read(sizeof val);
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
bool codeUint8(EnumSet<T>& val) {
|
||||
uint8_t value;
|
||||
if (codeUint8(value)) {
|
||||
val.deserialize(value);
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeUint16(uint16_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = LittleEndian::readUint16(read(sizeof val));
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeUint32(uint32_t& val) {
|
||||
if (checkCapacity(sizeof val)) {
|
||||
val = LittleEndian::readUint32(read(sizeof val));
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool codeString(nsCString& str) {
|
||||
uint16_t len;
|
||||
if (codeUint16(len)) {
|
||||
if (checkCapacity(len)) {
|
||||
str.SetLength(len);
|
||||
memcpy(str.BeginWriting(), read(len), len);
|
||||
}
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool error() { return error_; }
|
||||
|
||||
bool finished() { return error_ || !remainingCapacity(); }
|
||||
|
||||
size_t remainingCapacity() { return data.length() - cursor_; }
|
||||
|
||||
size_t cursor() const { return cursor_; }
|
||||
|
||||
const uint8_t* Get() const { return data.begin().get(); }
|
||||
|
||||
private:
|
||||
bool checkCapacity(size_t size) {
|
||||
if (size > remainingCapacity()) {
|
||||
error_ = true;
|
||||
}
|
||||
return !error_;
|
||||
}
|
||||
|
||||
bool error_ = false;
|
||||
|
||||
public:
|
||||
const Range<uint8_t>& data;
|
||||
size_t cursor_ = 0;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
struct Matcher;
|
||||
|
||||
|
|
|
|||
|
|
@ -14,7 +14,6 @@
|
|||
#include "mozilla/ClearOnShutdown.h"
|
||||
#include "mozilla/Components.h"
|
||||
#include "mozilla/FileUtils.h"
|
||||
#include "mozilla/IOBuffers.h"
|
||||
#include "mozilla/Logging.h"
|
||||
#include "mozilla/ScopeExit.h"
|
||||
#include "mozilla/Services.h"
|
||||
|
|
|
|||
|
|
@ -31,7 +31,6 @@ EXPORTS += [
|
|||
|
||||
EXPORTS.mozilla += [
|
||||
'AutoMemMap.h',
|
||||
'IOBuffers.h',
|
||||
'ScriptPreloader.h',
|
||||
'URLPreloader.h',
|
||||
]
|
||||
|
|
|
|||
|
|
@ -20,16 +20,15 @@ using mozilla::UniquePtr;
|
|||
// principals to the system principals.
|
||||
nsresult ReadCachedScript(StartupCache* cache, nsACString& uri, JSContext* cx,
|
||||
MutableHandleScript scriptp) {
|
||||
const char* buf;
|
||||
UniquePtr<char[]> buf;
|
||||
uint32_t len;
|
||||
nsresult rv = cache->GetBuffer(PromiseFlatCString(uri).get(), &buf, &len);
|
||||
if (NS_FAILED(rv)) {
|
||||
return rv; // don't warn since NOT_AVAILABLE is an ok error
|
||||
}
|
||||
void* copy = malloc(len);
|
||||
memcpy(copy, buf, len);
|
||||
|
||||
JS::TranscodeBuffer buffer;
|
||||
buffer.replaceRawBuffer(reinterpret_cast<uint8_t*>(copy), len);
|
||||
buffer.replaceRawBuffer(reinterpret_cast<uint8_t*>(buf.release()), len);
|
||||
JS::TranscodeResult code = JS::DecodeScript(cx, buffer, scriptp);
|
||||
if (code == JS::TranscodeResult_Ok) {
|
||||
return NS_OK;
|
||||
|
|
|
|||
|
|
@ -12,10 +12,8 @@
|
|||
// corecrt_memory.h.
|
||||
#include <string>
|
||||
|
||||
#include "lz4/lz4.h"
|
||||
#include "lz4/lz4frame.h"
|
||||
#include "lz4.h"
|
||||
|
||||
using namespace mozilla;
|
||||
using namespace mozilla::Compression;
|
||||
|
||||
/* Our wrappers */
|
||||
|
|
@ -80,111 +78,3 @@ bool LZ4::decompressPartial(const char* aSource, size_t aInputSize, char* aDest,
|
|||
*aOutputSize = 0;
|
||||
return false;
|
||||
}
|
||||
|
||||
template<class AP>
|
||||
LZ4FrameCompressionContext<AP>::LZ4FrameCompressionContext(int aCompressionLevel,
|
||||
size_t aMaxSrcSize,
|
||||
bool aChecksum,
|
||||
bool aStableSrc)
|
||||
: mContext(nullptr),
|
||||
mCompressionLevel(aCompressionLevel),
|
||||
mGenerateChecksum(aChecksum),
|
||||
mStableSrc(aStableSrc),
|
||||
mMaxSrcSize(aMaxSrcSize),
|
||||
mWriteBufLen(0),
|
||||
mWriteBuffer(nullptr) {
|
||||
LZ4F_errorCode_t err = LZ4F_createCompressionContext(&mContext, LZ4F_VERSION);
|
||||
MOZ_RELEASE_ASSERT(!LZ4F_isError(err));
|
||||
}
|
||||
|
||||
template<class AP>
|
||||
LZ4FrameCompressionContext<AP>::~LZ4FrameCompressionContext() {
|
||||
LZ4F_freeCompressionContext(mContext);
|
||||
this->free_(mWriteBuffer);
|
||||
}
|
||||
|
||||
template<class AP>
|
||||
Result<Span<const char>, size_t>
|
||||
LZ4FrameCompressionContext<AP>::BeginCompressing() {
|
||||
LZ4F_contentChecksum_t checksum =
|
||||
mGenerateChecksum ? LZ4F_contentChecksumEnabled : LZ4F_noContentChecksum;
|
||||
LZ4F_preferences_t prefs = {
|
||||
{
|
||||
LZ4F_max256KB,
|
||||
LZ4F_blockLinked,
|
||||
checksum,
|
||||
},
|
||||
mCompressionLevel,
|
||||
};
|
||||
mWriteBufLen = LZ4F_compressBound(mMaxSrcSize, &prefs);
|
||||
mWriteBuffer = this->template pod_malloc<char>(mWriteBufLen);
|
||||
|
||||
size_t headerSize =
|
||||
LZ4F_compressBegin(mContext, mWriteBuffer, mWriteBufLen, &prefs);
|
||||
if (LZ4F_isError(headerSize)) {
|
||||
return Err(headerSize);
|
||||
}
|
||||
|
||||
return MakeSpan(static_cast<const char*>(mWriteBuffer), headerSize);
|
||||
}
|
||||
|
||||
template<class AP>
|
||||
Result<Span<const char>, size_t>
|
||||
LZ4FrameCompressionContext<AP>::ContinueCompressing(Span<const char> aInput) {
|
||||
LZ4F_compressOptions_t opts = {};
|
||||
opts.stableSrc = (uint32_t)mStableSrc;
|
||||
size_t outputSize =
|
||||
LZ4F_compressUpdate(mContext, mWriteBuffer, mWriteBufLen,
|
||||
aInput.Elements(), aInput.Length(),
|
||||
&opts);
|
||||
if (LZ4F_isError(outputSize)) {
|
||||
return Err(outputSize);
|
||||
}
|
||||
|
||||
return MakeSpan(static_cast<const char*>(mWriteBuffer), outputSize);
|
||||
}
|
||||
|
||||
template<class AP>
|
||||
Result<Span<const char>, size_t> LZ4FrameCompressionContext<AP>::EndCompressing() {
|
||||
size_t outputSize =
|
||||
LZ4F_compressEnd(mContext, mWriteBuffer, mWriteBufLen,
|
||||
/* options */ nullptr);
|
||||
if (LZ4F_isError(outputSize)) {
|
||||
return Err(outputSize);
|
||||
}
|
||||
|
||||
return MakeSpan(static_cast<const char*>(mWriteBuffer), outputSize);
|
||||
}
|
||||
|
||||
LZ4FrameDecompressionContext::LZ4FrameDecompressionContext(bool aStableDest)
|
||||
: mContext(nullptr),
|
||||
mStableDest(aStableDest) {
|
||||
LZ4F_errorCode_t err =
|
||||
LZ4F_createDecompressionContext(&mContext, LZ4F_VERSION);
|
||||
MOZ_RELEASE_ASSERT(!LZ4F_isError(err));
|
||||
}
|
||||
|
||||
LZ4FrameDecompressionContext::~LZ4FrameDecompressionContext() {
|
||||
LZ4F_freeDecompressionContext(mContext);
|
||||
}
|
||||
|
||||
Result<LZ4FrameDecompressionResult, size_t>
|
||||
LZ4FrameDecompressionContext::Decompress(Span<char> aOutput,
|
||||
Span<const char> aInput) {
|
||||
LZ4F_decompressOptions_t opts = {};
|
||||
opts.stableDst = (uint32_t)mStableDest;
|
||||
size_t outBytes = aOutput.Length();
|
||||
size_t inBytes = aInput.Length();
|
||||
size_t result = LZ4F_decompress(mContext, aOutput.Elements(), &outBytes,
|
||||
aInput.Elements(), &inBytes,
|
||||
&opts);
|
||||
if (LZ4F_isError(result)) {
|
||||
return Err(result);
|
||||
}
|
||||
|
||||
LZ4FrameDecompressionResult decompressionResult = {};
|
||||
decompressionResult.mFinished = !result;
|
||||
decompressionResult.mSizeRead = inBytes;
|
||||
decompressionResult.mSizeWritten = outBytes;
|
||||
return decompressionResult;
|
||||
}
|
||||
|
|
|
|||
|
|
@ -9,14 +9,8 @@
|
|||
#ifndef mozilla_Compression_h_
|
||||
#define mozilla_Compression_h_
|
||||
|
||||
#include "mozilla/AllocPolicy.h"
|
||||
#include "mozilla/Assertions.h"
|
||||
#include "mozilla/Types.h"
|
||||
#include "mozilla/Result.h"
|
||||
#include "mozilla/Span.h"
|
||||
|
||||
struct LZ4F_cctx_s; // compression context
|
||||
struct LZ4F_dctx_s; // decompression context
|
||||
|
||||
namespace mozilla {
|
||||
namespace Compression {
|
||||
|
|
@ -143,87 +137,6 @@ class LZ4 {
|
|||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Context for LZ4 Frame-based streaming compression. Use this if you
|
||||
* want to incrementally compress something or if you want to compress
|
||||
* something such that another application can read it.
|
||||
*/
|
||||
template<class AllocPolicy = MallocAllocPolicy>
|
||||
class LZ4FrameCompressionContext final : private AllocPolicy {
|
||||
public:
|
||||
MFBT_API LZ4FrameCompressionContext(int aCompressionLevel, size_t aMaxSrcSize,
|
||||
bool aChecksum, bool aStableSrc = false);
|
||||
MFBT_API ~LZ4FrameCompressionContext();
|
||||
|
||||
|
||||
/**
|
||||
* Begin streaming frame-based compression.
|
||||
*
|
||||
* @return a Result with a Span containing the frame header, or an lz4 error
|
||||
* code (size_t).
|
||||
*/
|
||||
MFBT_API Result<Span<const char>, size_t> BeginCompressing();
|
||||
|
||||
/**
|
||||
* Continue streaming frame-based compression with the provided input.
|
||||
*
|
||||
* @param aInput input buffer to be compressed.
|
||||
* @return a Result with a Span containing compressed output, or an lz4 error
|
||||
* code (size_t).
|
||||
*/
|
||||
MFBT_API Result<Span<const char>, size_t> ContinueCompressing(Span<const char> aInput);
|
||||
|
||||
/**
|
||||
* Finalize streaming frame-based compression with the provided input.
|
||||
*
|
||||
* @return a Result with a Span containing compressed output and the frame
|
||||
* footer, or an lz4 error code (size_t).
|
||||
*/
|
||||
MFBT_API Result<Span<const char>, size_t> EndCompressing();
|
||||
|
||||
private:
|
||||
LZ4F_cctx_s* mContext;
|
||||
int mCompressionLevel;
|
||||
bool mGenerateChecksum;
|
||||
bool mStableSrc;
|
||||
size_t mMaxSrcSize;
|
||||
size_t mWriteBufLen;
|
||||
char* mWriteBuffer;
|
||||
};
|
||||
|
||||
struct LZ4FrameDecompressionResult {
|
||||
size_t mSizeRead;
|
||||
size_t mSizeWritten;
|
||||
bool mFinished;
|
||||
};
|
||||
|
||||
/**
|
||||
* Context for LZ4 Frame-based streaming decompression. Use this if you
|
||||
* want to decompress something compressed by LZ4FrameCompressionContext
|
||||
* or by another application.
|
||||
*/
|
||||
class LZ4FrameDecompressionContext final {
|
||||
public:
|
||||
explicit MFBT_API LZ4FrameDecompressionContext(bool aStableDest = false);
|
||||
MFBT_API ~LZ4FrameDecompressionContext();
|
||||
|
||||
/**
|
||||
* Decompress a buffer/part of a buffer compressed with
|
||||
* LZ4FrameCompressionContext or another application.
|
||||
*
|
||||
* @param aOutput output buffer to be write results into.
|
||||
* @param aInput input buffer to be decompressed.
|
||||
* @return a Result with information on bytes read/written and whether we
|
||||
* completely decompressed the input into the output, or an lz4 error code (size_t).
|
||||
*/
|
||||
MFBT_API Result<LZ4FrameDecompressionResult, size_t> Decompress(
|
||||
Span<char> aOutput, Span<const char> aInput);
|
||||
|
||||
private:
|
||||
LZ4F_dctx_s* mContext;
|
||||
bool mStableDest;
|
||||
};
|
||||
|
||||
} /* namespace Compression */
|
||||
} /* namespace mozilla */
|
||||
|
||||
|
|
|
|||
|
|
@ -9,7 +9,6 @@
|
|||
#ifndef mozilla_Result_h
|
||||
#define mozilla_Result_h
|
||||
|
||||
#include <type_traits>
|
||||
#include "mozilla/Alignment.h"
|
||||
#include "mozilla/Assertions.h"
|
||||
#include "mozilla/Attributes.h"
|
||||
|
|
@ -434,37 +433,6 @@ class MOZ_MUST_USE_TYPE Result final {
|
|||
return isOk() ? RetResult(f(unwrap())) : RetResult(unwrapErr());
|
||||
}
|
||||
|
||||
/**
|
||||
* Map a function V -> W over this result's error variant. If this result is
|
||||
* a success, do not invoke the function and move the success over.
|
||||
*
|
||||
* Mapping over error values invokes the function to produce a new error
|
||||
* value:
|
||||
*
|
||||
* // Map Result<V, int> to another Result<V, int>
|
||||
* Result<V, int> res(5);
|
||||
* Result<V, int> res2 = res.mapErr([](int x) { return x * x; });
|
||||
* MOZ_ASSERT(res2.unwrapErr() == 25);
|
||||
*
|
||||
* // Map Result<V, const char*> to Result<V, size_t>
|
||||
* Result<V, const char*> res("hello, map!");
|
||||
* Result<size_t, E> res2 = res.mapErr(strlen);
|
||||
* MOZ_ASSERT(res2.unwrapErr() == 11);
|
||||
*
|
||||
* Mapping over a success does not invoke the function and copies the error:
|
||||
*
|
||||
* Result<int, V> res(5);
|
||||
* MOZ_ASSERT(res.isOk());
|
||||
* Result<int, W> res2 = res.mapErr([](V v) { ... });
|
||||
* MOZ_ASSERT(res2.isOk());
|
||||
* MOZ_ASSERT(res2.unwrap() == 5);
|
||||
*/
|
||||
template <typename F>
|
||||
auto mapErr(F f) -> Result<V, std::result_of_t<F(E)>> {
|
||||
using RetResult = Result<V, std::result_of_t<F(E)>>;
|
||||
return isOk() ? RetResult(unwrap()) : RetResult(f(unwrapErr()));
|
||||
}
|
||||
|
||||
/**
|
||||
* Given a function V -> Result<W, E>, apply it to this result's success value
|
||||
* and return its result. If this result is an error value, then return a
|
||||
|
|
|
|||
|
|
@ -8,4 +8,4 @@ MFBT uses standard Mozilla style, with the following exceptions.
|
|||
upper-case letter at the start of function names.
|
||||
|
||||
- Imported third-party code (such as decimal/*, double-conversion/source/*, and
|
||||
lz4/*) remains in its original style.
|
||||
lz4*) remains in its original style.
|
||||
|
|
|
|||
|
|
@ -1,24 +0,0 @@
|
|||
LZ4 Library
|
||||
Copyright (c) 2011-2016, Yann Collet
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification,
|
||||
are permitted provided that the following conditions are met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright notice, this
|
||||
list of conditions and the following disclaimer.
|
||||
|
||||
* Redistributions in binary form must reproduce the above copyright notice, this
|
||||
list of conditions and the following disclaimer in the documentation and/or
|
||||
other materials provided with the distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||||
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
||||
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
||||
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
|
||||
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
||||
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
|
@ -1,122 +0,0 @@
|
|||
LZ4 - Library Files
|
||||
================================
|
||||
|
||||
The `/lib` directory contains many files, but depending on project's objectives,
|
||||
not all of them are necessary.
|
||||
|
||||
#### Minimal LZ4 build
|
||||
|
||||
The minimum required is **`lz4.c`** and **`lz4.h`**,
|
||||
which provides the fast compression and decompression algorithms.
|
||||
They generate and decode data using the [LZ4 block format].
|
||||
|
||||
|
||||
#### High Compression variant
|
||||
|
||||
For more compression ratio at the cost of compression speed,
|
||||
the High Compression variant called **lz4hc** is available.
|
||||
Add files **`lz4hc.c`** and **`lz4hc.h`**.
|
||||
This variant also compresses data using the [LZ4 block format],
|
||||
and depends on regular `lib/lz4.*` source files.
|
||||
|
||||
|
||||
#### Frame support, for interoperability
|
||||
|
||||
In order to produce compressed data compatible with `lz4` command line utility,
|
||||
it's necessary to use the [official interoperable frame format].
|
||||
This format is generated and decoded automatically by the **lz4frame** library.
|
||||
Its public API is described in `lib/lz4frame.h`.
|
||||
In order to work properly, lz4frame needs all other modules present in `/lib`,
|
||||
including, lz4 and lz4hc, and also **xxhash**.
|
||||
So it's necessary to include all `*.c` and `*.h` files present in `/lib`.
|
||||
|
||||
|
||||
#### Advanced / Experimental API
|
||||
|
||||
Definitions which are not guaranteed to remain stable in future versions,
|
||||
are protected behind macros, such as `LZ4_STATIC_LINKING_ONLY`.
|
||||
As the name implies, these definitions can only be invoked
|
||||
in the context of static linking ***only***.
|
||||
Otherwise, dependent application may fail on API or ABI break in the future.
|
||||
The associated symbols are also not present in dynamic library by default.
|
||||
Should they be nonetheless needed, it's possible to force their publication
|
||||
by using build macro `LZ4_PUBLISH_STATIC_FUNCTIONS`.
|
||||
|
||||
|
||||
#### Build macros
|
||||
|
||||
The following build macro can be selected at compilation time :
|
||||
|
||||
- `LZ4_FAST_DEC_LOOP` : this triggers the optimized decompression loop.
|
||||
This loops works great on x86/x64 cpus, and is automatically enabled on this platform.
|
||||
It's possible to enable or disable it manually, by passing `LZ4_FAST_DEC_LOOP=1` or `0` to the preprocessor.
|
||||
For example, with `gcc` : `-DLZ4_FAST_DEC_LOOP=1`,
|
||||
and with `make` : `CPPFLAGS+=-DLZ4_FAST_DEC_LOOP=1 make lz4`.
|
||||
|
||||
- `LZ4_DISTANCE_MAX` : control the maximum offset that the compressor will allow.
|
||||
Set to 65535 by default, which is the maximum value supported by lz4 format.
|
||||
Reducing maximum distance will reduce opportunities for LZ4 to find matches,
|
||||
hence will produce worse the compression ratio.
|
||||
However, a smaller max distance may allow compatibility with specific decoders using limited memory budget.
|
||||
This build macro only influences the compressed output of the compressor.
|
||||
|
||||
- `LZ4_DISABLE_DEPRECATE_WARNINGS` : invoking a deprecated function will make the compiler generate a warning.
|
||||
This is meant to invite users to update their source code.
|
||||
Should this be a problem, it's generally possible to make the compiler ignore these warnings,
|
||||
for example with `-Wno-deprecated-declarations` on `gcc`,
|
||||
or `_CRT_SECURE_NO_WARNINGS` for Visual Studio.
|
||||
Another method is to define `LZ4_DISABLE_DEPRECATE_WARNINGS`
|
||||
before including the LZ4 header files.
|
||||
|
||||
|
||||
#### Amalgamation
|
||||
|
||||
lz4 source code can be amalgamated into a single file.
|
||||
One can combine all source code into `lz4_all.c` by using following command:
|
||||
```
|
||||
cat lz4.c > lz4_all.c
|
||||
cat lz4hc.c >> lz4_all.c
|
||||
cat lz4frame.c >> lz4_all.c
|
||||
```
|
||||
(`cat` file order is important) then compile `lz4_all.c`.
|
||||
All `*.h` files present in `/lib` remain necessary to compile `lz4_all.c`.
|
||||
|
||||
|
||||
#### Windows : using MinGW+MSYS to create DLL
|
||||
|
||||
DLL can be created using MinGW+MSYS with the `make liblz4` command.
|
||||
This command creates `dll\liblz4.dll` and the import library `dll\liblz4.lib`.
|
||||
To override the `dlltool` command when cross-compiling on Linux, just set the `DLLTOOL` variable. Example of cross compilation on Linux with mingw-w64 64 bits:
|
||||
```
|
||||
make BUILD_STATIC=no CC=x86_64-w64-mingw32-gcc DLLTOOL=x86_64-w64-mingw32-dlltool OS=Windows_NT
|
||||
```
|
||||
The import library is only required with Visual C++.
|
||||
The header files `lz4.h`, `lz4hc.h`, `lz4frame.h` and the dynamic library
|
||||
`dll\liblz4.dll` are required to compile a project using gcc/MinGW.
|
||||
The dynamic library has to be added to linking options.
|
||||
It means that if a project that uses LZ4 consists of a single `test-dll.c`
|
||||
file it should be linked with `dll\liblz4.dll`. For example:
|
||||
```
|
||||
$(CC) $(CFLAGS) -Iinclude/ test-dll.c -o test-dll dll\liblz4.dll
|
||||
```
|
||||
The compiled executable will require LZ4 DLL which is available at `dll\liblz4.dll`.
|
||||
|
||||
|
||||
#### Miscellaneous
|
||||
|
||||
Other files present in the directory are not source code. There are :
|
||||
|
||||
- `LICENSE` : contains the BSD license text
|
||||
- `Makefile` : `make` script to compile and install lz4 library (static and dynamic)
|
||||
- `liblz4.pc.in` : for `pkg-config` (used in `make install`)
|
||||
- `README.md` : this file
|
||||
|
||||
[official interoperable frame format]: ../doc/lz4_Frame_format.md
|
||||
[LZ4 block format]: ../doc/lz4_Block_format.md
|
||||
|
||||
|
||||
#### License
|
||||
|
||||
All source material within __lib__ directory are BSD 2-Clause licensed.
|
||||
See [LICENSE](LICENSE) for details.
|
||||
The license is also reminded at the top of each source file.
|
||||
1838
mfbt/lz4/lz4frame.c
1838
mfbt/lz4/lz4frame.c
Разница между файлами не показана из-за своего большого размера
Загрузить разницу
|
|
@ -1,606 +0,0 @@
|
|||
/*
|
||||
LZ4 auto-framing library
|
||||
Header File
|
||||
Copyright (C) 2011-2017, Yann Collet.
|
||||
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at :
|
||||
- LZ4 source repository : https://github.com/lz4/lz4
|
||||
- LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
|
||||
*/
|
||||
|
||||
/* LZ4F is a stand-alone API able to create and decode LZ4 frames
|
||||
* conformant with specification v1.6.1 in doc/lz4_Frame_format.md .
|
||||
* Generated frames are compatible with `lz4` CLI.
|
||||
*
|
||||
* LZ4F also offers streaming capabilities.
|
||||
*
|
||||
* lz4.h is not required when using lz4frame.h,
|
||||
* except to extract common constant such as LZ4_VERSION_NUMBER.
|
||||
* */
|
||||
|
||||
#ifndef LZ4F_H_09782039843
|
||||
#define LZ4F_H_09782039843
|
||||
|
||||
#if defined (__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* --- Dependency --- */
|
||||
#include <stddef.h> /* size_t */
|
||||
|
||||
|
||||
/**
|
||||
Introduction
|
||||
|
||||
lz4frame.h implements LZ4 frame specification (doc/lz4_Frame_format.md).
|
||||
lz4frame.h provides frame compression functions that take care
|
||||
of encoding standard metadata alongside LZ4-compressed blocks.
|
||||
*/
|
||||
|
||||
/*-***************************************************************
|
||||
* Compiler specifics
|
||||
*****************************************************************/
|
||||
/* LZ4_DLL_EXPORT :
|
||||
* Enable exporting of functions when building a Windows DLL
|
||||
* LZ4FLIB_API :
|
||||
* Control library symbols visibility.
|
||||
*/
|
||||
#if defined(LZ4_DLL_EXPORT) && (LZ4_DLL_EXPORT==1)
|
||||
# define LZ4FLIB_API __declspec(dllexport)
|
||||
#elif defined(LZ4_DLL_IMPORT) && (LZ4_DLL_IMPORT==1)
|
||||
# define LZ4FLIB_API __declspec(dllimport)
|
||||
#elif defined(__GNUC__) && (__GNUC__ >= 4)
|
||||
# define LZ4FLIB_API __attribute__ ((__visibility__ ("default")))
|
||||
#else
|
||||
# define LZ4FLIB_API
|
||||
#endif
|
||||
|
||||
#ifdef LZ4F_DISABLE_DEPRECATE_WARNINGS
|
||||
# define LZ4F_DEPRECATE(x) x
|
||||
#else
|
||||
# if defined(_MSC_VER)
|
||||
# define LZ4F_DEPRECATE(x) x /* __declspec(deprecated) x - only works with C++ */
|
||||
# elif defined(__clang__) || (defined(__GNUC__) && (__GNUC__ >= 6))
|
||||
# define LZ4F_DEPRECATE(x) x __attribute__((deprecated))
|
||||
# else
|
||||
# define LZ4F_DEPRECATE(x) x /* no deprecation warning for this compiler */
|
||||
# endif
|
||||
#endif
|
||||
|
||||
|
||||
/*-************************************
|
||||
* Error management
|
||||
**************************************/
|
||||
typedef size_t LZ4F_errorCode_t;
|
||||
|
||||
LZ4FLIB_API unsigned LZ4F_isError(LZ4F_errorCode_t code); /**< tells when a function result is an error code */
|
||||
LZ4FLIB_API const char* LZ4F_getErrorName(LZ4F_errorCode_t code); /**< return error code string; for debugging */
|
||||
|
||||
|
||||
/*-************************************
|
||||
* Frame compression types
|
||||
**************************************/
|
||||
/* #define LZ4F_ENABLE_OBSOLETE_ENUMS // uncomment to enable obsolete enums */
|
||||
#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS
|
||||
# define LZ4F_OBSOLETE_ENUM(x) , LZ4F_DEPRECATE(x) = LZ4F_##x
|
||||
#else
|
||||
# define LZ4F_OBSOLETE_ENUM(x)
|
||||
#endif
|
||||
|
||||
/* The larger the block size, the (slightly) better the compression ratio,
|
||||
* though there are diminishing returns.
|
||||
* Larger blocks also increase memory usage on both compression and decompression sides. */
|
||||
typedef enum {
|
||||
LZ4F_default=0,
|
||||
LZ4F_max64KB=4,
|
||||
LZ4F_max256KB=5,
|
||||
LZ4F_max1MB=6,
|
||||
LZ4F_max4MB=7
|
||||
LZ4F_OBSOLETE_ENUM(max64KB)
|
||||
LZ4F_OBSOLETE_ENUM(max256KB)
|
||||
LZ4F_OBSOLETE_ENUM(max1MB)
|
||||
LZ4F_OBSOLETE_ENUM(max4MB)
|
||||
} LZ4F_blockSizeID_t;
|
||||
|
||||
/* Linked blocks sharply reduce inefficiencies when using small blocks,
|
||||
* they compress better.
|
||||
* However, some LZ4 decoders are only compatible with independent blocks */
|
||||
typedef enum {
|
||||
LZ4F_blockLinked=0,
|
||||
LZ4F_blockIndependent
|
||||
LZ4F_OBSOLETE_ENUM(blockLinked)
|
||||
LZ4F_OBSOLETE_ENUM(blockIndependent)
|
||||
} LZ4F_blockMode_t;
|
||||
|
||||
typedef enum {
|
||||
LZ4F_noContentChecksum=0,
|
||||
LZ4F_contentChecksumEnabled
|
||||
LZ4F_OBSOLETE_ENUM(noContentChecksum)
|
||||
LZ4F_OBSOLETE_ENUM(contentChecksumEnabled)
|
||||
} LZ4F_contentChecksum_t;
|
||||
|
||||
typedef enum {
|
||||
LZ4F_noBlockChecksum=0,
|
||||
LZ4F_blockChecksumEnabled
|
||||
} LZ4F_blockChecksum_t;
|
||||
|
||||
typedef enum {
|
||||
LZ4F_frame=0,
|
||||
LZ4F_skippableFrame
|
||||
LZ4F_OBSOLETE_ENUM(skippableFrame)
|
||||
} LZ4F_frameType_t;
|
||||
|
||||
#ifdef LZ4F_ENABLE_OBSOLETE_ENUMS
|
||||
typedef LZ4F_blockSizeID_t blockSizeID_t;
|
||||
typedef LZ4F_blockMode_t blockMode_t;
|
||||
typedef LZ4F_frameType_t frameType_t;
|
||||
typedef LZ4F_contentChecksum_t contentChecksum_t;
|
||||
#endif
|
||||
|
||||
/*! LZ4F_frameInfo_t :
|
||||
* makes it possible to set or read frame parameters.
|
||||
* Structure must be first init to 0, using memset() or LZ4F_INIT_FRAMEINFO,
|
||||
* setting all parameters to default.
|
||||
* It's then possible to update selectively some parameters */
|
||||
typedef struct {
|
||||
LZ4F_blockSizeID_t blockSizeID; /* max64KB, max256KB, max1MB, max4MB; 0 == default */
|
||||
LZ4F_blockMode_t blockMode; /* LZ4F_blockLinked, LZ4F_blockIndependent; 0 == default */
|
||||
LZ4F_contentChecksum_t contentChecksumFlag; /* 1: frame terminated with 32-bit checksum of decompressed data; 0: disabled (default) */
|
||||
LZ4F_frameType_t frameType; /* read-only field : LZ4F_frame or LZ4F_skippableFrame */
|
||||
unsigned long long contentSize; /* Size of uncompressed content ; 0 == unknown */
|
||||
unsigned dictID; /* Dictionary ID, sent by compressor to help decoder select correct dictionary; 0 == no dictID provided */
|
||||
LZ4F_blockChecksum_t blockChecksumFlag; /* 1: each block followed by a checksum of block's compressed data; 0: disabled (default) */
|
||||
} LZ4F_frameInfo_t;
|
||||
|
||||
#define LZ4F_INIT_FRAMEINFO { LZ4F_default, LZ4F_blockLinked, LZ4F_noContentChecksum, LZ4F_frame, 0ULL, 0U, LZ4F_noBlockChecksum } /* v1.8.3+ */
|
||||
|
||||
/*! LZ4F_preferences_t :
|
||||
* makes it possible to supply advanced compression instructions to streaming interface.
|
||||
* Structure must be first init to 0, using memset() or LZ4F_INIT_PREFERENCES,
|
||||
* setting all parameters to default.
|
||||
* All reserved fields must be set to zero. */
|
||||
typedef struct {
|
||||
LZ4F_frameInfo_t frameInfo;
|
||||
int compressionLevel; /* 0: default (fast mode); values > LZ4HC_CLEVEL_MAX count as LZ4HC_CLEVEL_MAX; values < 0 trigger "fast acceleration" */
|
||||
unsigned autoFlush; /* 1: always flush; reduces usage of internal buffers */
|
||||
unsigned favorDecSpeed; /* 1: parser favors decompression speed vs compression ratio. Only works for high compression modes (>= LZ4HC_CLEVEL_OPT_MIN) */ /* v1.8.2+ */
|
||||
unsigned reserved[3]; /* must be zero for forward compatibility */
|
||||
} LZ4F_preferences_t;
|
||||
|
||||
#define LZ4F_INIT_PREFERENCES { LZ4F_INIT_FRAMEINFO, 0, 0u, 0u, { 0u, 0u, 0u } } /* v1.8.3+ */
|
||||
|
||||
|
||||
/*-*********************************
|
||||
* Simple compression function
|
||||
***********************************/
|
||||
|
||||
LZ4FLIB_API int LZ4F_compressionLevel_max(void); /* v1.8.0+ */
|
||||
|
||||
/*! LZ4F_compressFrameBound() :
|
||||
* Returns the maximum possible compressed size with LZ4F_compressFrame() given srcSize and preferences.
|
||||
* `preferencesPtr` is optional. It can be replaced by NULL, in which case, the function will assume default preferences.
|
||||
* Note : this result is only usable with LZ4F_compressFrame().
|
||||
* It may also be used with LZ4F_compressUpdate() _if no flush() operation_ is performed.
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressFrameBound(size_t srcSize, const LZ4F_preferences_t* preferencesPtr);
|
||||
|
||||
/*! LZ4F_compressFrame() :
|
||||
* Compress an entire srcBuffer into a valid LZ4 frame.
|
||||
* dstCapacity MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
|
||||
* The LZ4F_preferences_t structure is optional : you can provide NULL as argument. All preferences will be set to default.
|
||||
* @return : number of bytes written into dstBuffer.
|
||||
* or an error code if it fails (can be tested using LZ4F_isError())
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressFrame(void* dstBuffer, size_t dstCapacity,
|
||||
const void* srcBuffer, size_t srcSize,
|
||||
const LZ4F_preferences_t* preferencesPtr);
|
||||
|
||||
|
||||
/*-***********************************
|
||||
* Advanced compression functions
|
||||
*************************************/
|
||||
typedef struct LZ4F_cctx_s LZ4F_cctx; /* incomplete type */
|
||||
typedef LZ4F_cctx* LZ4F_compressionContext_t; /* for compatibility with previous API version */
|
||||
|
||||
typedef struct {
|
||||
unsigned stableSrc; /* 1 == src content will remain present on future calls to LZ4F_compress(); skip copying src content within tmp buffer */
|
||||
unsigned reserved[3];
|
||||
} LZ4F_compressOptions_t;
|
||||
|
||||
/*--- Resource Management ---*/
|
||||
|
||||
#define LZ4F_VERSION 100 /* This number can be used to check for an incompatible API breaking change */
|
||||
LZ4FLIB_API unsigned LZ4F_getVersion(void);
|
||||
|
||||
/*! LZ4F_createCompressionContext() :
|
||||
* The first thing to do is to create a compressionContext object, which will be used in all compression operations.
|
||||
* This is achieved using LZ4F_createCompressionContext(), which takes as argument a version.
|
||||
* The version provided MUST be LZ4F_VERSION. It is intended to track potential version mismatch, notably when using DLL.
|
||||
* The function will provide a pointer to a fully allocated LZ4F_cctx object.
|
||||
* If @return != zero, there was an error during context creation.
|
||||
* Object can release its memory using LZ4F_freeCompressionContext();
|
||||
*/
|
||||
LZ4FLIB_API LZ4F_errorCode_t LZ4F_createCompressionContext(LZ4F_cctx** cctxPtr, unsigned version);
|
||||
LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeCompressionContext(LZ4F_cctx* cctx);
|
||||
|
||||
|
||||
/*---- Compression ----*/
|
||||
|
||||
#define LZ4F_HEADER_SIZE_MIN 7 /* LZ4 Frame header size can vary, depending on selected paramaters */
|
||||
#define LZ4F_HEADER_SIZE_MAX 19
|
||||
|
||||
/*! LZ4F_compressBegin() :
|
||||
* will write the frame header into dstBuffer.
|
||||
* dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes.
|
||||
* `prefsPtr` is optional : you can provide NULL as argument, all preferences will then be set to default.
|
||||
* @return : number of bytes written into dstBuffer for the header
|
||||
* or an error code (which can be tested using LZ4F_isError())
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressBegin(LZ4F_cctx* cctx,
|
||||
void* dstBuffer, size_t dstCapacity,
|
||||
const LZ4F_preferences_t* prefsPtr);
|
||||
|
||||
/*! LZ4F_compressBound() :
|
||||
* Provides minimum dstCapacity required to guarantee success of
|
||||
* LZ4F_compressUpdate(), given a srcSize and preferences, for a worst case scenario.
|
||||
* When srcSize==0, LZ4F_compressBound() provides an upper bound for LZ4F_flush() and LZ4F_compressEnd() instead.
|
||||
* Note that the result is only valid for a single invocation of LZ4F_compressUpdate().
|
||||
* When invoking LZ4F_compressUpdate() multiple times,
|
||||
* if the output buffer is gradually filled up instead of emptied and re-used from its start,
|
||||
* one must check if there is enough remaining capacity before each invocation, using LZ4F_compressBound().
|
||||
* @return is always the same for a srcSize and prefsPtr.
|
||||
* prefsPtr is optional : when NULL is provided, preferences will be set to cover worst case scenario.
|
||||
* tech details :
|
||||
* @return includes the possibility that internal buffer might already be filled by up to (blockSize-1) bytes.
|
||||
* It also includes frame footer (ending + checksum), since it might be generated by LZ4F_compressEnd().
|
||||
* @return doesn't include frame header, as it was already generated by LZ4F_compressBegin().
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressBound(size_t srcSize, const LZ4F_preferences_t* prefsPtr);
|
||||
|
||||
/*! LZ4F_compressUpdate() :
|
||||
* LZ4F_compressUpdate() can be called repetitively to compress as much data as necessary.
|
||||
* Important rule: dstCapacity MUST be large enough to ensure operation success even in worst case situations.
|
||||
* This value is provided by LZ4F_compressBound().
|
||||
* If this condition is not respected, LZ4F_compress() will fail (result is an errorCode).
|
||||
* LZ4F_compressUpdate() doesn't guarantee error recovery.
|
||||
* When an error occurs, compression context must be freed or resized.
|
||||
* `cOptPtr` is optional : NULL can be provided, in which case all options are set to default.
|
||||
* @return : number of bytes written into `dstBuffer` (it can be zero, meaning input data was just buffered).
|
||||
* or an error code if it fails (which can be tested using LZ4F_isError())
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressUpdate(LZ4F_cctx* cctx,
|
||||
void* dstBuffer, size_t dstCapacity,
|
||||
const void* srcBuffer, size_t srcSize,
|
||||
const LZ4F_compressOptions_t* cOptPtr);
|
||||
|
||||
/*! LZ4F_flush() :
|
||||
* When data must be generated and sent immediately, without waiting for a block to be completely filled,
|
||||
* it's possible to call LZ4_flush(). It will immediately compress any data buffered within cctx.
|
||||
* `dstCapacity` must be large enough to ensure the operation will be successful.
|
||||
* `cOptPtr` is optional : it's possible to provide NULL, all options will be set to default.
|
||||
* @return : nb of bytes written into dstBuffer (can be zero, when there is no data stored within cctx)
|
||||
* or an error code if it fails (which can be tested using LZ4F_isError())
|
||||
* Note : LZ4F_flush() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr).
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_flush(LZ4F_cctx* cctx,
|
||||
void* dstBuffer, size_t dstCapacity,
|
||||
const LZ4F_compressOptions_t* cOptPtr);
|
||||
|
||||
/*! LZ4F_compressEnd() :
|
||||
* To properly finish an LZ4 frame, invoke LZ4F_compressEnd().
|
||||
* It will flush whatever data remained within `cctx` (like LZ4_flush())
|
||||
* and properly finalize the frame, with an endMark and a checksum.
|
||||
* `cOptPtr` is optional : NULL can be provided, in which case all options will be set to default.
|
||||
* @return : nb of bytes written into dstBuffer, necessarily >= 4 (endMark),
|
||||
* or an error code if it fails (which can be tested using LZ4F_isError())
|
||||
* Note : LZ4F_compressEnd() is guaranteed to be successful when dstCapacity >= LZ4F_compressBound(0, prefsPtr).
|
||||
* A successful call to LZ4F_compressEnd() makes `cctx` available again for another compression task.
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_compressEnd(LZ4F_cctx* cctx,
|
||||
void* dstBuffer, size_t dstCapacity,
|
||||
const LZ4F_compressOptions_t* cOptPtr);
|
||||
|
||||
|
||||
/*-*********************************
|
||||
* Decompression functions
|
||||
***********************************/
|
||||
typedef struct LZ4F_dctx_s LZ4F_dctx; /* incomplete type */
|
||||
typedef LZ4F_dctx* LZ4F_decompressionContext_t; /* compatibility with previous API versions */
|
||||
|
||||
typedef struct {
|
||||
unsigned stableDst; /* pledges that last 64KB decompressed data will remain available unmodified. This optimization skips storage operations in tmp buffers. */
|
||||
unsigned reserved[3]; /* must be set to zero for forward compatibility */
|
||||
} LZ4F_decompressOptions_t;
|
||||
|
||||
|
||||
/* Resource management */
|
||||
|
||||
/*! LZ4F_createDecompressionContext() :
|
||||
* Create an LZ4F_dctx object, to track all decompression operations.
|
||||
* The version provided MUST be LZ4F_VERSION.
|
||||
* The function provides a pointer to an allocated and initialized LZ4F_dctx object.
|
||||
* The result is an errorCode, which can be tested using LZ4F_isError().
|
||||
* dctx memory can be released using LZ4F_freeDecompressionContext();
|
||||
* Result of LZ4F_freeDecompressionContext() indicates current state of decompressionContext when being released.
|
||||
* That is, it should be == 0 if decompression has been completed fully and correctly.
|
||||
*/
|
||||
LZ4FLIB_API LZ4F_errorCode_t LZ4F_createDecompressionContext(LZ4F_dctx** dctxPtr, unsigned version);
|
||||
LZ4FLIB_API LZ4F_errorCode_t LZ4F_freeDecompressionContext(LZ4F_dctx* dctx);
|
||||
|
||||
|
||||
/*-***********************************
|
||||
* Streaming decompression functions
|
||||
*************************************/
|
||||
|
||||
#define LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH 5
|
||||
|
||||
/*! LZ4F_headerSize() : v1.9.0+
|
||||
* Provide the header size of a frame starting at `src`.
|
||||
* `srcSize` must be >= LZ4F_MIN_SIZE_TO_KNOW_HEADER_LENGTH,
|
||||
* which is enough to decode the header length.
|
||||
* @return : size of frame header
|
||||
* or an error code, which can be tested using LZ4F_isError()
|
||||
* note : Frame header size is variable, but is guaranteed to be
|
||||
* >= LZ4F_HEADER_SIZE_MIN bytes, and <= LZ4F_HEADER_SIZE_MAX bytes.
|
||||
*/
|
||||
size_t LZ4F_headerSize(const void* src, size_t srcSize);
|
||||
|
||||
/*! LZ4F_getFrameInfo() :
|
||||
* This function extracts frame parameters (max blockSize, dictID, etc.).
|
||||
* Its usage is optional: user can call LZ4F_decompress() directly.
|
||||
*
|
||||
* Extracted information will fill an existing LZ4F_frameInfo_t structure.
|
||||
* This can be useful for allocation and dictionary identification purposes.
|
||||
*
|
||||
* LZ4F_getFrameInfo() can work in the following situations :
|
||||
*
|
||||
* 1) At the beginning of a new frame, before any invocation of LZ4F_decompress().
|
||||
* It will decode header from `srcBuffer`,
|
||||
* consuming the header and starting the decoding process.
|
||||
*
|
||||
* Input size must be large enough to contain the full frame header.
|
||||
* Frame header size can be known beforehand by LZ4F_headerSize().
|
||||
* Frame header size is variable, but is guaranteed to be >= LZ4F_HEADER_SIZE_MIN bytes,
|
||||
* and not more than <= LZ4F_HEADER_SIZE_MAX bytes.
|
||||
* Hence, blindly providing LZ4F_HEADER_SIZE_MAX bytes or more will always work.
|
||||
* It's allowed to provide more input data than the header size,
|
||||
* LZ4F_getFrameInfo() will only consume the header.
|
||||
*
|
||||
* If input size is not large enough,
|
||||
* aka if it's smaller than header size,
|
||||
* function will fail and return an error code.
|
||||
*
|
||||
* 2) After decoding has been started,
|
||||
* it's possible to invoke LZ4F_getFrameInfo() anytime
|
||||
* to extract already decoded frame parameters stored within dctx.
|
||||
*
|
||||
* Note that, if decoding has barely started,
|
||||
* and not yet read enough information to decode the header,
|
||||
* LZ4F_getFrameInfo() will fail.
|
||||
*
|
||||
* The number of bytes consumed from srcBuffer will be updated in *srcSizePtr (necessarily <= original value).
|
||||
* LZ4F_getFrameInfo() only consumes bytes when decoding has not yet started,
|
||||
* and when decoding the header has been successful.
|
||||
* Decompression must then resume from (srcBuffer + *srcSizePtr).
|
||||
*
|
||||
* @return : a hint about how many srcSize bytes LZ4F_decompress() expects for next call,
|
||||
* or an error code which can be tested using LZ4F_isError().
|
||||
* note 1 : in case of error, dctx is not modified. Decoding operation can resume from beginning safely.
|
||||
* note 2 : frame parameters are *copied into* an already allocated LZ4F_frameInfo_t structure.
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_getFrameInfo(LZ4F_dctx* dctx,
|
||||
LZ4F_frameInfo_t* frameInfoPtr,
|
||||
const void* srcBuffer, size_t* srcSizePtr);
|
||||
|
||||
/*! LZ4F_decompress() :
|
||||
* Call this function repetitively to regenerate compressed data from `srcBuffer`.
|
||||
* The function will read up to *srcSizePtr bytes from srcBuffer,
|
||||
* and decompress data into dstBuffer, of capacity *dstSizePtr.
|
||||
*
|
||||
* The nb of bytes consumed from srcBuffer will be written into *srcSizePtr (necessarily <= original value).
|
||||
* The nb of bytes decompressed into dstBuffer will be written into *dstSizePtr (necessarily <= original value).
|
||||
*
|
||||
* The function does not necessarily read all input bytes, so always check value in *srcSizePtr.
|
||||
* Unconsumed source data must be presented again in subsequent invocations.
|
||||
*
|
||||
* `dstBuffer` can freely change between each consecutive function invocation.
|
||||
* `dstBuffer` content will be overwritten.
|
||||
*
|
||||
* @return : an hint of how many `srcSize` bytes LZ4F_decompress() expects for next call.
|
||||
* Schematically, it's the size of the current (or remaining) compressed block + header of next block.
|
||||
* Respecting the hint provides some small speed benefit, because it skips intermediate buffers.
|
||||
* This is just a hint though, it's always possible to provide any srcSize.
|
||||
*
|
||||
* When a frame is fully decoded, @return will be 0 (no more data expected).
|
||||
* When provided with more bytes than necessary to decode a frame,
|
||||
* LZ4F_decompress() will stop reading exactly at end of current frame, and @return 0.
|
||||
*
|
||||
* If decompression failed, @return is an error code, which can be tested using LZ4F_isError().
|
||||
* After a decompression error, the `dctx` context is not resumable.
|
||||
* Use LZ4F_resetDecompressionContext() to return to clean state.
|
||||
*
|
||||
* After a frame is fully decoded, dctx can be used again to decompress another frame.
|
||||
*/
|
||||
LZ4FLIB_API size_t LZ4F_decompress(LZ4F_dctx* dctx,
|
||||
void* dstBuffer, size_t* dstSizePtr,
|
||||
const void* srcBuffer, size_t* srcSizePtr,
|
||||
const LZ4F_decompressOptions_t* dOptPtr);
|
||||
|
||||
|
||||
/*! LZ4F_resetDecompressionContext() : added in v1.8.0
|
||||
* In case of an error, the context is left in "undefined" state.
|
||||
* In which case, it's necessary to reset it, before re-using it.
|
||||
* This method can also be used to abruptly stop any unfinished decompression,
|
||||
* and start a new one using same context resources. */
|
||||
LZ4FLIB_API void LZ4F_resetDecompressionContext(LZ4F_dctx* dctx); /* always successful */
|
||||
|
||||
|
||||
|
||||
#if defined (__cplusplus)
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* LZ4F_H_09782039843 */
|
||||
|
||||
#if defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843)
|
||||
#define LZ4F_H_STATIC_09782039843
|
||||
|
||||
#if defined (__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* These declarations are not stable and may change in the future.
|
||||
* They are therefore only safe to depend on
|
||||
* when the caller is statically linked against the library.
|
||||
* To access their declarations, define LZ4F_STATIC_LINKING_ONLY.
|
||||
*
|
||||
* By default, these symbols aren't published into shared/dynamic libraries.
|
||||
* You can override this behavior and force them to be published
|
||||
* by defining LZ4F_PUBLISH_STATIC_FUNCTIONS.
|
||||
* Use at your own risk.
|
||||
*/
|
||||
#ifdef LZ4F_PUBLISH_STATIC_FUNCTIONS
|
||||
#define LZ4FLIB_STATIC_API LZ4FLIB_API
|
||||
#else
|
||||
#define LZ4FLIB_STATIC_API
|
||||
#endif
|
||||
|
||||
|
||||
/* --- Error List --- */
|
||||
#define LZ4F_LIST_ERRORS(ITEM) \
|
||||
ITEM(OK_NoError) \
|
||||
ITEM(ERROR_GENERIC) \
|
||||
ITEM(ERROR_maxBlockSize_invalid) \
|
||||
ITEM(ERROR_blockMode_invalid) \
|
||||
ITEM(ERROR_contentChecksumFlag_invalid) \
|
||||
ITEM(ERROR_compressionLevel_invalid) \
|
||||
ITEM(ERROR_headerVersion_wrong) \
|
||||
ITEM(ERROR_blockChecksum_invalid) \
|
||||
ITEM(ERROR_reservedFlag_set) \
|
||||
ITEM(ERROR_allocation_failed) \
|
||||
ITEM(ERROR_srcSize_tooLarge) \
|
||||
ITEM(ERROR_dstMaxSize_tooSmall) \
|
||||
ITEM(ERROR_frameHeader_incomplete) \
|
||||
ITEM(ERROR_frameType_unknown) \
|
||||
ITEM(ERROR_frameSize_wrong) \
|
||||
ITEM(ERROR_srcPtr_wrong) \
|
||||
ITEM(ERROR_decompressionFailed) \
|
||||
ITEM(ERROR_headerChecksum_invalid) \
|
||||
ITEM(ERROR_contentChecksum_invalid) \
|
||||
ITEM(ERROR_frameDecoding_alreadyStarted) \
|
||||
ITEM(ERROR_maxCode)
|
||||
|
||||
#define LZ4F_GENERATE_ENUM(ENUM) LZ4F_##ENUM,
|
||||
|
||||
/* enum list is exposed, to handle specific errors */
|
||||
typedef enum { LZ4F_LIST_ERRORS(LZ4F_GENERATE_ENUM)
|
||||
_LZ4F_dummy_error_enum_for_c89_never_used } LZ4F_errorCodes;
|
||||
|
||||
LZ4FLIB_STATIC_API LZ4F_errorCodes LZ4F_getErrorCode(size_t functionResult);
|
||||
|
||||
LZ4FLIB_STATIC_API size_t LZ4F_getBlockSize(unsigned);
|
||||
|
||||
/**********************************
|
||||
* Bulk processing dictionary API
|
||||
*********************************/
|
||||
|
||||
/* A Dictionary is useful for the compression of small messages (KB range).
|
||||
* It dramatically improves compression efficiency.
|
||||
*
|
||||
* LZ4 can ingest any input as dictionary, though only the last 64 KB are useful.
|
||||
* Best results are generally achieved by using Zstandard's Dictionary Builder
|
||||
* to generate a high-quality dictionary from a set of samples.
|
||||
*
|
||||
* Loading a dictionary has a cost, since it involves construction of tables.
|
||||
* The Bulk processing dictionary API makes it possible to share this cost
|
||||
* over an arbitrary number of compression jobs, even concurrently,
|
||||
* markedly improving compression latency for these cases.
|
||||
*
|
||||
* The same dictionary will have to be used on the decompression side
|
||||
* for decoding to be successful.
|
||||
* To help identify the correct dictionary at decoding stage,
|
||||
* the frame header allows optional embedding of a dictID field.
|
||||
*/
|
||||
typedef struct LZ4F_CDict_s LZ4F_CDict;
|
||||
|
||||
/*! LZ4_createCDict() :
|
||||
* When compressing multiple messages / blocks using the same dictionary, it's recommended to load it just once.
|
||||
* LZ4_createCDict() will create a digested dictionary, ready to start future compression operations without startup delay.
|
||||
* LZ4_CDict can be created once and shared by multiple threads concurrently, since its usage is read-only.
|
||||
* `dictBuffer` can be released after LZ4_CDict creation, since its content is copied within CDict */
|
||||
LZ4FLIB_STATIC_API LZ4F_CDict* LZ4F_createCDict(const void* dictBuffer, size_t dictSize);
|
||||
LZ4FLIB_STATIC_API void LZ4F_freeCDict(LZ4F_CDict* CDict);
|
||||
|
||||
|
||||
/*! LZ4_compressFrame_usingCDict() :
|
||||
* Compress an entire srcBuffer into a valid LZ4 frame using a digested Dictionary.
|
||||
* cctx must point to a context created by LZ4F_createCompressionContext().
|
||||
* If cdict==NULL, compress without a dictionary.
|
||||
* dstBuffer MUST be >= LZ4F_compressFrameBound(srcSize, preferencesPtr).
|
||||
* If this condition is not respected, function will fail (@return an errorCode).
|
||||
* The LZ4F_preferences_t structure is optional : you may provide NULL as argument,
|
||||
* but it's not recommended, as it's the only way to provide dictID in the frame header.
|
||||
* @return : number of bytes written into dstBuffer.
|
||||
* or an error code if it fails (can be tested using LZ4F_isError()) */
|
||||
LZ4FLIB_STATIC_API size_t LZ4F_compressFrame_usingCDict(
|
||||
LZ4F_cctx* cctx,
|
||||
void* dst, size_t dstCapacity,
|
||||
const void* src, size_t srcSize,
|
||||
const LZ4F_CDict* cdict,
|
||||
const LZ4F_preferences_t* preferencesPtr);
|
||||
|
||||
|
||||
/*! LZ4F_compressBegin_usingCDict() :
|
||||
* Inits streaming dictionary compression, and writes the frame header into dstBuffer.
|
||||
* dstCapacity must be >= LZ4F_HEADER_SIZE_MAX bytes.
|
||||
* `prefsPtr` is optional : you may provide NULL as argument,
|
||||
* however, it's the only way to provide dictID in the frame header.
|
||||
* @return : number of bytes written into dstBuffer for the header,
|
||||
* or an error code (which can be tested using LZ4F_isError()) */
|
||||
LZ4FLIB_STATIC_API size_t LZ4F_compressBegin_usingCDict(
|
||||
LZ4F_cctx* cctx,
|
||||
void* dstBuffer, size_t dstCapacity,
|
||||
const LZ4F_CDict* cdict,
|
||||
const LZ4F_preferences_t* prefsPtr);
|
||||
|
||||
|
||||
/*! LZ4F_decompress_usingDict() :
|
||||
* Same as LZ4F_decompress(), using a predefined dictionary.
|
||||
* Dictionary is used "in place", without any preprocessing.
|
||||
* It must remain accessible throughout the entire frame decoding. */
|
||||
LZ4FLIB_STATIC_API size_t LZ4F_decompress_usingDict(
|
||||
LZ4F_dctx* dctxPtr,
|
||||
void* dstBuffer, size_t* dstSizePtr,
|
||||
const void* srcBuffer, size_t* srcSizePtr,
|
||||
const void* dict, size_t dictSize,
|
||||
const LZ4F_decompressOptions_t* decompressOptionsPtr);
|
||||
|
||||
#if defined (__cplusplus)
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* defined(LZ4F_STATIC_LINKING_ONLY) && !defined(LZ4F_H_STATIC_09782039843) */
|
||||
|
|
@ -1,47 +0,0 @@
|
|||
/*
|
||||
LZ4 auto-framing library
|
||||
Header File for static linking only
|
||||
Copyright (C) 2011-2016, Yann Collet.
|
||||
|
||||
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at :
|
||||
- LZ4 source repository : https://github.com/lz4/lz4
|
||||
- LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
|
||||
*/
|
||||
|
||||
#ifndef LZ4FRAME_STATIC_H_0398209384
|
||||
#define LZ4FRAME_STATIC_H_0398209384
|
||||
|
||||
/* The declarations that formerly were made here have been merged into
|
||||
* lz4frame.h, protected by the LZ4F_STATIC_LINKING_ONLY macro. Going forward,
|
||||
* it is recommended to simply include that header directly.
|
||||
*/
|
||||
|
||||
#define LZ4F_STATIC_LINKING_ONLY
|
||||
#include "lz4frame.h"
|
||||
|
||||
#endif /* LZ4FRAME_STATIC_H_0398209384 */
|
||||
1476
mfbt/lz4/lz4hc.c
1476
mfbt/lz4/lz4hc.c
Разница между файлами не показана из-за своего большого размера
Загрузить разницу
435
mfbt/lz4/lz4hc.h
435
mfbt/lz4/lz4hc.h
|
|
@ -1,435 +0,0 @@
|
|||
/*
|
||||
LZ4 HC - High Compression Mode of LZ4
|
||||
Header File
|
||||
Copyright (C) 2011-2017, Yann Collet.
|
||||
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at :
|
||||
- LZ4 source repository : https://github.com/lz4/lz4
|
||||
- LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
|
||||
*/
|
||||
#ifndef LZ4_HC_H_19834876238432
|
||||
#define LZ4_HC_H_19834876238432
|
||||
|
||||
#if defined (__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* --- Dependency --- */
|
||||
/* note : lz4hc requires lz4.h/lz4.c for compilation */
|
||||
#include "lz4.h" /* stddef, LZ4LIB_API, LZ4_DEPRECATED */
|
||||
|
||||
|
||||
/* --- Useful constants --- */
|
||||
#define LZ4HC_CLEVEL_MIN 3
|
||||
#define LZ4HC_CLEVEL_DEFAULT 9
|
||||
#define LZ4HC_CLEVEL_OPT_MIN 10
|
||||
#define LZ4HC_CLEVEL_MAX 12
|
||||
|
||||
|
||||
/*-************************************
|
||||
* Block Compression
|
||||
**************************************/
|
||||
/*! LZ4_compress_HC() :
|
||||
* Compress data from `src` into `dst`, using the powerful but slower "HC" algorithm.
|
||||
* `dst` must be already allocated.
|
||||
* Compression is guaranteed to succeed if `dstCapacity >= LZ4_compressBound(srcSize)` (see "lz4.h")
|
||||
* Max supported `srcSize` value is LZ4_MAX_INPUT_SIZE (see "lz4.h")
|
||||
* `compressionLevel` : any value between 1 and LZ4HC_CLEVEL_MAX will work.
|
||||
* Values > LZ4HC_CLEVEL_MAX behave the same as LZ4HC_CLEVEL_MAX.
|
||||
* @return : the number of bytes written into 'dst'
|
||||
* or 0 if compression fails.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_HC (const char* src, char* dst, int srcSize, int dstCapacity, int compressionLevel);
|
||||
|
||||
|
||||
/* Note :
|
||||
* Decompression functions are provided within "lz4.h" (BSD license)
|
||||
*/
|
||||
|
||||
|
||||
/*! LZ4_compress_HC_extStateHC() :
|
||||
* Same as LZ4_compress_HC(), but using an externally allocated memory segment for `state`.
|
||||
* `state` size is provided by LZ4_sizeofStateHC().
|
||||
* Memory segment must be aligned on 8-bytes boundaries (which a normal malloc() should do properly).
|
||||
*/
|
||||
LZ4LIB_API int LZ4_sizeofStateHC(void);
|
||||
LZ4LIB_API int LZ4_compress_HC_extStateHC(void* stateHC, const char* src, char* dst, int srcSize, int maxDstSize, int compressionLevel);
|
||||
|
||||
|
||||
/*! LZ4_compress_HC_destSize() : v1.9.0+
|
||||
* Will compress as much data as possible from `src`
|
||||
* to fit into `targetDstSize` budget.
|
||||
* Result is provided in 2 parts :
|
||||
* @return : the number of bytes written into 'dst' (necessarily <= targetDstSize)
|
||||
* or 0 if compression fails.
|
||||
* `srcSizePtr` : on success, *srcSizePtr is updated to indicate how much bytes were read from `src`
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_HC_destSize(void* stateHC,
|
||||
const char* src, char* dst,
|
||||
int* srcSizePtr, int targetDstSize,
|
||||
int compressionLevel);
|
||||
|
||||
|
||||
/*-************************************
|
||||
* Streaming Compression
|
||||
* Bufferless synchronous API
|
||||
**************************************/
|
||||
typedef union LZ4_streamHC_u LZ4_streamHC_t; /* incomplete type (defined later) */
|
||||
|
||||
/*! LZ4_createStreamHC() and LZ4_freeStreamHC() :
|
||||
* These functions create and release memory for LZ4 HC streaming state.
|
||||
* Newly created states are automatically initialized.
|
||||
* A same state can be used multiple times consecutively,
|
||||
* starting with LZ4_resetStreamHC_fast() to start a new stream of blocks.
|
||||
*/
|
||||
LZ4LIB_API LZ4_streamHC_t* LZ4_createStreamHC(void);
|
||||
LZ4LIB_API int LZ4_freeStreamHC (LZ4_streamHC_t* streamHCPtr);
|
||||
|
||||
/*
|
||||
These functions compress data in successive blocks of any size,
|
||||
using previous blocks as dictionary, to improve compression ratio.
|
||||
One key assumption is that previous blocks (up to 64 KB) remain read-accessible while compressing next blocks.
|
||||
There is an exception for ring buffers, which can be smaller than 64 KB.
|
||||
Ring-buffer scenario is automatically detected and handled within LZ4_compress_HC_continue().
|
||||
|
||||
Before starting compression, state must be allocated and properly initialized.
|
||||
LZ4_createStreamHC() does both, though compression level is set to LZ4HC_CLEVEL_DEFAULT.
|
||||
|
||||
Selecting the compression level can be done with LZ4_resetStreamHC_fast() (starts a new stream)
|
||||
or LZ4_setCompressionLevel() (anytime, between blocks in the same stream) (experimental).
|
||||
LZ4_resetStreamHC_fast() only works on states which have been properly initialized at least once,
|
||||
which is automatically the case when state is created using LZ4_createStreamHC().
|
||||
|
||||
After reset, a first "fictional block" can be designated as initial dictionary,
|
||||
using LZ4_loadDictHC() (Optional).
|
||||
|
||||
Invoke LZ4_compress_HC_continue() to compress each successive block.
|
||||
The number of blocks is unlimited.
|
||||
Previous input blocks, including initial dictionary when present,
|
||||
must remain accessible and unmodified during compression.
|
||||
|
||||
It's allowed to update compression level anytime between blocks,
|
||||
using LZ4_setCompressionLevel() (experimental).
|
||||
|
||||
'dst' buffer should be sized to handle worst case scenarios
|
||||
(see LZ4_compressBound(), it ensures compression success).
|
||||
In case of failure, the API does not guarantee recovery,
|
||||
so the state _must_ be reset.
|
||||
To ensure compression success
|
||||
whenever `dst` buffer size cannot be made >= LZ4_compressBound(),
|
||||
consider using LZ4_compress_HC_continue_destSize().
|
||||
|
||||
Whenever previous input blocks can't be preserved unmodified in-place during compression of next blocks,
|
||||
it's possible to copy the last blocks into a more stable memory space, using LZ4_saveDictHC().
|
||||
Return value of LZ4_saveDictHC() is the size of dictionary effectively saved into 'safeBuffer' (<= 64 KB)
|
||||
|
||||
After completing a streaming compression,
|
||||
it's possible to start a new stream of blocks, using the same LZ4_streamHC_t state,
|
||||
just by resetting it, using LZ4_resetStreamHC_fast().
|
||||
*/
|
||||
|
||||
LZ4LIB_API void LZ4_resetStreamHC_fast(LZ4_streamHC_t* streamHCPtr, int compressionLevel); /* v1.9.0+ */
|
||||
LZ4LIB_API int LZ4_loadDictHC (LZ4_streamHC_t* streamHCPtr, const char* dictionary, int dictSize);
|
||||
|
||||
LZ4LIB_API int LZ4_compress_HC_continue (LZ4_streamHC_t* streamHCPtr,
|
||||
const char* src, char* dst,
|
||||
int srcSize, int maxDstSize);
|
||||
|
||||
/*! LZ4_compress_HC_continue_destSize() : v1.9.0+
|
||||
* Similar to LZ4_compress_HC_continue(),
|
||||
* but will read as much data as possible from `src`
|
||||
* to fit into `targetDstSize` budget.
|
||||
* Result is provided into 2 parts :
|
||||
* @return : the number of bytes written into 'dst' (necessarily <= targetDstSize)
|
||||
* or 0 if compression fails.
|
||||
* `srcSizePtr` : on success, *srcSizePtr will be updated to indicate how much bytes were read from `src`.
|
||||
* Note that this function may not consume the entire input.
|
||||
*/
|
||||
LZ4LIB_API int LZ4_compress_HC_continue_destSize(LZ4_streamHC_t* LZ4_streamHCPtr,
|
||||
const char* src, char* dst,
|
||||
int* srcSizePtr, int targetDstSize);
|
||||
|
||||
LZ4LIB_API int LZ4_saveDictHC (LZ4_streamHC_t* streamHCPtr, char* safeBuffer, int maxDictSize);
|
||||
|
||||
|
||||
|
||||
/*^**********************************************
|
||||
* !!!!!! STATIC LINKING ONLY !!!!!!
|
||||
***********************************************/
|
||||
|
||||
/*-******************************************************************
|
||||
* PRIVATE DEFINITIONS :
|
||||
* Do not use these definitions directly.
|
||||
* They are merely exposed to allow static allocation of `LZ4_streamHC_t`.
|
||||
* Declare an `LZ4_streamHC_t` directly, rather than any type below.
|
||||
* Even then, only do so in the context of static linking, as definitions may change between versions.
|
||||
********************************************************************/
|
||||
|
||||
#define LZ4HC_DICTIONARY_LOGSIZE 16
|
||||
#define LZ4HC_MAXD (1<<LZ4HC_DICTIONARY_LOGSIZE)
|
||||
#define LZ4HC_MAXD_MASK (LZ4HC_MAXD - 1)
|
||||
|
||||
#define LZ4HC_HASH_LOG 15
|
||||
#define LZ4HC_HASHTABLESIZE (1 << LZ4HC_HASH_LOG)
|
||||
#define LZ4HC_HASH_MASK (LZ4HC_HASHTABLESIZE - 1)
|
||||
|
||||
|
||||
#if defined(__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
|
||||
#include <stdint.h>
|
||||
|
||||
typedef struct LZ4HC_CCtx_internal LZ4HC_CCtx_internal;
|
||||
struct LZ4HC_CCtx_internal
|
||||
{
|
||||
uint32_t hashTable[LZ4HC_HASHTABLESIZE];
|
||||
uint16_t chainTable[LZ4HC_MAXD];
|
||||
const uint8_t* end; /* next block here to continue on current prefix */
|
||||
const uint8_t* base; /* All index relative to this position */
|
||||
const uint8_t* dictBase; /* alternate base for extDict */
|
||||
uint32_t dictLimit; /* below that point, need extDict */
|
||||
uint32_t lowLimit; /* below that point, no more dict */
|
||||
uint32_t nextToUpdate; /* index from which to continue dictionary update */
|
||||
short compressionLevel;
|
||||
int8_t favorDecSpeed; /* favor decompression speed if this flag set,
|
||||
otherwise, favor compression ratio */
|
||||
int8_t dirty; /* stream has to be fully reset if this flag is set */
|
||||
const LZ4HC_CCtx_internal* dictCtx;
|
||||
};
|
||||
|
||||
#else
|
||||
|
||||
typedef struct LZ4HC_CCtx_internal LZ4HC_CCtx_internal;
|
||||
struct LZ4HC_CCtx_internal
|
||||
{
|
||||
unsigned int hashTable[LZ4HC_HASHTABLESIZE];
|
||||
unsigned short chainTable[LZ4HC_MAXD];
|
||||
const unsigned char* end; /* next block here to continue on current prefix */
|
||||
const unsigned char* base; /* All index relative to this position */
|
||||
const unsigned char* dictBase; /* alternate base for extDict */
|
||||
unsigned int dictLimit; /* below that point, need extDict */
|
||||
unsigned int lowLimit; /* below that point, no more dict */
|
||||
unsigned int nextToUpdate; /* index from which to continue dictionary update */
|
||||
short compressionLevel;
|
||||
char favorDecSpeed; /* favor decompression speed if this flag set,
|
||||
otherwise, favor compression ratio */
|
||||
char dirty; /* stream has to be fully reset if this flag is set */
|
||||
const LZ4HC_CCtx_internal* dictCtx;
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
/* Do not use these definitions directly !
|
||||
* Declare or allocate an LZ4_streamHC_t instead.
|
||||
*/
|
||||
#define LZ4_STREAMHCSIZE (4*LZ4HC_HASHTABLESIZE + 2*LZ4HC_MAXD + 56 + ((sizeof(void*)==16) ? 56 : 0) /* AS400*/ ) /* 262200 or 262256*/
|
||||
#define LZ4_STREAMHCSIZE_SIZET (LZ4_STREAMHCSIZE / sizeof(size_t))
|
||||
union LZ4_streamHC_u {
|
||||
size_t table[LZ4_STREAMHCSIZE_SIZET];
|
||||
LZ4HC_CCtx_internal internal_donotuse;
|
||||
}; /* previously typedef'd to LZ4_streamHC_t */
|
||||
|
||||
/* LZ4_streamHC_t :
|
||||
* This structure allows static allocation of LZ4 HC streaming state.
|
||||
* This can be used to allocate statically, on state, or as part of a larger structure.
|
||||
*
|
||||
* Such state **must** be initialized using LZ4_initStreamHC() before first use.
|
||||
*
|
||||
* Note that invoking LZ4_initStreamHC() is not required when
|
||||
* the state was created using LZ4_createStreamHC() (which is recommended).
|
||||
* Using the normal builder, a newly created state is automatically initialized.
|
||||
*
|
||||
* Static allocation shall only be used in combination with static linking.
|
||||
*/
|
||||
|
||||
/* LZ4_initStreamHC() : v1.9.0+
|
||||
* Required before first use of a statically allocated LZ4_streamHC_t.
|
||||
* Before v1.9.0 : use LZ4_resetStreamHC() instead
|
||||
*/
|
||||
LZ4LIB_API LZ4_streamHC_t* LZ4_initStreamHC (void* buffer, size_t size);
|
||||
|
||||
|
||||
/*-************************************
|
||||
* Deprecated Functions
|
||||
**************************************/
|
||||
/* see lz4.h LZ4_DISABLE_DEPRECATE_WARNINGS to turn off deprecation warnings */
|
||||
|
||||
/* deprecated compression functions */
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC (const char* source, char* dest, int inputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput (const char* source, char* dest, int inputSize, int maxOutputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2 (const char* source, char* dest, int inputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput(const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_withStateHC (void* state, const char* source, char* dest, int inputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_withStateHC (void* state, const char* source, char* dest, int inputSize, int maxOutputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_withStateHC (void* state, const char* source, char* dest, int inputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_extStateHC() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_withStateHC(void* state, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC_limitedOutput_continue (LZ4_streamHC_t* LZ4_streamHCPtr, const char* source, char* dest, int inputSize, int maxOutputSize);
|
||||
|
||||
/* Obsolete streaming functions; degraded functionality; do not use!
|
||||
*
|
||||
* In order to perform streaming compression, these functions depended on data
|
||||
* that is no longer tracked in the state. They have been preserved as well as
|
||||
* possible: using them will still produce a correct output. However, use of
|
||||
* LZ4_slideInputBufferHC() will truncate the history of the stream, rather
|
||||
* than preserve a window-sized chunk of history.
|
||||
*/
|
||||
LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API void* LZ4_createHC (const char* inputBuffer);
|
||||
LZ4_DEPRECATED("use LZ4_saveDictHC() instead") LZ4LIB_API char* LZ4_slideInputBufferHC (void* LZ4HC_Data);
|
||||
LZ4_DEPRECATED("use LZ4_freeStreamHC() instead") LZ4LIB_API int LZ4_freeHC (void* LZ4HC_Data);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_continue (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_compress_HC_continue() instead") LZ4LIB_API int LZ4_compressHC2_limitedOutput_continue (void* LZ4HC_Data, const char* source, char* dest, int inputSize, int maxOutputSize, int compressionLevel);
|
||||
LZ4_DEPRECATED("use LZ4_createStreamHC() instead") LZ4LIB_API int LZ4_sizeofStreamStateHC(void);
|
||||
LZ4_DEPRECATED("use LZ4_initStreamHC() instead") LZ4LIB_API int LZ4_resetStreamStateHC(void* state, char* inputBuffer);
|
||||
|
||||
|
||||
/* LZ4_resetStreamHC() is now replaced by LZ4_initStreamHC().
|
||||
* The intention is to emphasize the difference with LZ4_resetStreamHC_fast(),
|
||||
* which is now the recommended function to start a new stream of blocks,
|
||||
* but cannot be used to initialize a memory segment containing arbitrary garbage data.
|
||||
*
|
||||
* It is recommended to switch to LZ4_initStreamHC().
|
||||
* LZ4_resetStreamHC() will generate deprecation warnings in a future version.
|
||||
*/
|
||||
LZ4LIB_API void LZ4_resetStreamHC (LZ4_streamHC_t* streamHCPtr, int compressionLevel);
|
||||
|
||||
|
||||
#if defined (__cplusplus)
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* LZ4_HC_H_19834876238432 */
|
||||
|
||||
|
||||
/*-**************************************************
|
||||
* !!!!! STATIC LINKING ONLY !!!!!
|
||||
* Following definitions are considered experimental.
|
||||
* They should not be linked from DLL,
|
||||
* as there is no guarantee of API stability yet.
|
||||
* Prototypes will be promoted to "stable" status
|
||||
* after successfull usage in real-life scenarios.
|
||||
***************************************************/
|
||||
#ifdef LZ4_HC_STATIC_LINKING_ONLY /* protection macro */
|
||||
#ifndef LZ4_HC_SLO_098092834
|
||||
#define LZ4_HC_SLO_098092834
|
||||
|
||||
#if defined (__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/*! LZ4_setCompressionLevel() : v1.8.0+ (experimental)
|
||||
* It's possible to change compression level
|
||||
* between successive invocations of LZ4_compress_HC_continue*()
|
||||
* for dynamic adaptation.
|
||||
*/
|
||||
LZ4LIB_STATIC_API void LZ4_setCompressionLevel(
|
||||
LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel);
|
||||
|
||||
/*! LZ4_favorDecompressionSpeed() : v1.8.2+ (experimental)
|
||||
* Opt. Parser will favor decompression speed over compression ratio.
|
||||
* Only applicable to levels >= LZ4HC_CLEVEL_OPT_MIN.
|
||||
*/
|
||||
LZ4LIB_STATIC_API void LZ4_favorDecompressionSpeed(
|
||||
LZ4_streamHC_t* LZ4_streamHCPtr, int favor);
|
||||
|
||||
/*! LZ4_resetStreamHC_fast() : v1.9.0+
|
||||
* When an LZ4_streamHC_t is known to be in a internally coherent state,
|
||||
* it can often be prepared for a new compression with almost no work, only
|
||||
* sometimes falling back to the full, expensive reset that is always required
|
||||
* when the stream is in an indeterminate state (i.e., the reset performed by
|
||||
* LZ4_resetStreamHC()).
|
||||
*
|
||||
* LZ4_streamHCs are guaranteed to be in a valid state when:
|
||||
* - returned from LZ4_createStreamHC()
|
||||
* - reset by LZ4_resetStreamHC()
|
||||
* - memset(stream, 0, sizeof(LZ4_streamHC_t))
|
||||
* - the stream was in a valid state and was reset by LZ4_resetStreamHC_fast()
|
||||
* - the stream was in a valid state and was then used in any compression call
|
||||
* that returned success
|
||||
* - the stream was in an indeterminate state and was used in a compression
|
||||
* call that fully reset the state (LZ4_compress_HC_extStateHC()) and that
|
||||
* returned success
|
||||
*
|
||||
* Note:
|
||||
* A stream that was last used in a compression call that returned an error
|
||||
* may be passed to this function. However, it will be fully reset, which will
|
||||
* clear any existing history and settings from the context.
|
||||
*/
|
||||
LZ4LIB_STATIC_API void LZ4_resetStreamHC_fast(
|
||||
LZ4_streamHC_t* LZ4_streamHCPtr, int compressionLevel);
|
||||
|
||||
/*! LZ4_compress_HC_extStateHC_fastReset() :
|
||||
* A variant of LZ4_compress_HC_extStateHC().
|
||||
*
|
||||
* Using this variant avoids an expensive initialization step. It is only safe
|
||||
* to call if the state buffer is known to be correctly initialized already
|
||||
* (see above comment on LZ4_resetStreamHC_fast() for a definition of
|
||||
* "correctly initialized"). From a high level, the difference is that this
|
||||
* function initializes the provided state with a call to
|
||||
* LZ4_resetStreamHC_fast() while LZ4_compress_HC_extStateHC() starts with a
|
||||
* call to LZ4_resetStreamHC().
|
||||
*/
|
||||
LZ4LIB_STATIC_API int LZ4_compress_HC_extStateHC_fastReset (
|
||||
void* state,
|
||||
const char* src, char* dst,
|
||||
int srcSize, int dstCapacity,
|
||||
int compressionLevel);
|
||||
|
||||
/*! LZ4_attach_HC_dictionary() :
|
||||
* This is an experimental API that allows for the efficient use of a
|
||||
* static dictionary many times.
|
||||
*
|
||||
* Rather than re-loading the dictionary buffer into a working context before
|
||||
* each compression, or copying a pre-loaded dictionary's LZ4_streamHC_t into a
|
||||
* working LZ4_streamHC_t, this function introduces a no-copy setup mechanism,
|
||||
* in which the working stream references the dictionary stream in-place.
|
||||
*
|
||||
* Several assumptions are made about the state of the dictionary stream.
|
||||
* Currently, only streams which have been prepared by LZ4_loadDictHC() should
|
||||
* be expected to work.
|
||||
*
|
||||
* Alternatively, the provided dictionary stream pointer may be NULL, in which
|
||||
* case any existing dictionary stream is unset.
|
||||
*
|
||||
* A dictionary should only be attached to a stream without any history (i.e.,
|
||||
* a stream that has just been reset).
|
||||
*
|
||||
* The dictionary will remain attached to the working stream only for the
|
||||
* current stream session. Calls to LZ4_resetStreamHC(_fast) will remove the
|
||||
* dictionary context association from the working stream. The dictionary
|
||||
* stream (and source buffer) must remain in-place / accessible / unchanged
|
||||
* through the lifetime of the stream session.
|
||||
*/
|
||||
LZ4LIB_STATIC_API void LZ4_attach_HC_dictionary(
|
||||
LZ4_streamHC_t *working_stream,
|
||||
const LZ4_streamHC_t *dictionary_stream);
|
||||
|
||||
#if defined (__cplusplus)
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* LZ4_HC_SLO_098092834 */
|
||||
#endif /* LZ4_HC_STATIC_LINKING_ONLY */
|
||||
1030
mfbt/lz4/xxhash.c
1030
mfbt/lz4/xxhash.c
Разница между файлами не показана из-за своего большого размера
Загрузить разницу
|
|
@ -1,328 +0,0 @@
|
|||
/*
|
||||
xxHash - Extremely Fast Hash algorithm
|
||||
Header File
|
||||
Copyright (C) 2012-2016, Yann Collet.
|
||||
|
||||
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following disclaimer
|
||||
in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
You can contact the author at :
|
||||
- xxHash source repository : https://github.com/Cyan4973/xxHash
|
||||
*/
|
||||
|
||||
/* Notice extracted from xxHash homepage :
|
||||
|
||||
xxHash is an extremely fast Hash algorithm, running at RAM speed limits.
|
||||
It also successfully passes all tests from the SMHasher suite.
|
||||
|
||||
Comparison (single thread, Windows Seven 32 bits, using SMHasher on a Core 2 Duo @3GHz)
|
||||
|
||||
Name Speed Q.Score Author
|
||||
xxHash 5.4 GB/s 10
|
||||
CrapWow 3.2 GB/s 2 Andrew
|
||||
MumurHash 3a 2.7 GB/s 10 Austin Appleby
|
||||
SpookyHash 2.0 GB/s 10 Bob Jenkins
|
||||
SBox 1.4 GB/s 9 Bret Mulvey
|
||||
Lookup3 1.2 GB/s 9 Bob Jenkins
|
||||
SuperFastHash 1.2 GB/s 1 Paul Hsieh
|
||||
CityHash64 1.05 GB/s 10 Pike & Alakuijala
|
||||
FNV 0.55 GB/s 5 Fowler, Noll, Vo
|
||||
CRC32 0.43 GB/s 9
|
||||
MD5-32 0.33 GB/s 10 Ronald L. Rivest
|
||||
SHA1-32 0.28 GB/s 10
|
||||
|
||||
Q.Score is a measure of quality of the hash function.
|
||||
It depends on successfully passing SMHasher test set.
|
||||
10 is a perfect score.
|
||||
|
||||
A 64-bit version, named XXH64, is available since r35.
|
||||
It offers much better speed, but for 64-bit applications only.
|
||||
Name Speed on 64 bits Speed on 32 bits
|
||||
XXH64 13.8 GB/s 1.9 GB/s
|
||||
XXH32 6.8 GB/s 6.0 GB/s
|
||||
*/
|
||||
|
||||
#ifndef XXHASH_H_5627135585666179
|
||||
#define XXHASH_H_5627135585666179 1
|
||||
|
||||
#if defined (__cplusplus)
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
/* ****************************
|
||||
* Definitions
|
||||
******************************/
|
||||
#include <stddef.h> /* size_t */
|
||||
typedef enum { XXH_OK=0, XXH_ERROR } XXH_errorcode;
|
||||
|
||||
|
||||
/* ****************************
|
||||
* API modifier
|
||||
******************************/
|
||||
/** XXH_INLINE_ALL (and XXH_PRIVATE_API)
|
||||
* This is useful to include xxhash functions in `static` mode
|
||||
* in order to inline them, and remove their symbol from the public list.
|
||||
* Inlining can offer dramatic performance improvement on small keys.
|
||||
* Methodology :
|
||||
* #define XXH_INLINE_ALL
|
||||
* #include "xxhash.h"
|
||||
* `xxhash.c` is automatically included.
|
||||
* It's not useful to compile and link it as a separate module.
|
||||
*/
|
||||
#if defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)
|
||||
# ifndef XXH_STATIC_LINKING_ONLY
|
||||
# define XXH_STATIC_LINKING_ONLY
|
||||
# endif
|
||||
# if defined(__GNUC__)
|
||||
# define XXH_PUBLIC_API static __inline __attribute__((unused))
|
||||
# elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)
|
||||
# define XXH_PUBLIC_API static inline
|
||||
# elif defined(_MSC_VER)
|
||||
# define XXH_PUBLIC_API static __inline
|
||||
# else
|
||||
/* this version may generate warnings for unused static functions */
|
||||
# define XXH_PUBLIC_API static
|
||||
# endif
|
||||
#else
|
||||
# define XXH_PUBLIC_API /* do nothing */
|
||||
#endif /* XXH_INLINE_ALL || XXH_PRIVATE_API */
|
||||
|
||||
/*! XXH_NAMESPACE, aka Namespace Emulation :
|
||||
*
|
||||
* If you want to include _and expose_ xxHash functions from within your own library,
|
||||
* but also want to avoid symbol collisions with other libraries which may also include xxHash,
|
||||
*
|
||||
* you can use XXH_NAMESPACE, to automatically prefix any public symbol from xxhash library
|
||||
* with the value of XXH_NAMESPACE (therefore, avoid NULL and numeric values).
|
||||
*
|
||||
* Note that no change is required within the calling program as long as it includes `xxhash.h` :
|
||||
* regular symbol name will be automatically translated by this header.
|
||||
*/
|
||||
#ifdef XXH_NAMESPACE
|
||||
# define XXH_CAT(A,B) A##B
|
||||
# define XXH_NAME2(A,B) XXH_CAT(A,B)
|
||||
# define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)
|
||||
# define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)
|
||||
# define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)
|
||||
# define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)
|
||||
# define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)
|
||||
# define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)
|
||||
# define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)
|
||||
# define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)
|
||||
# define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)
|
||||
# define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)
|
||||
# define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)
|
||||
# define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)
|
||||
# define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)
|
||||
# define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)
|
||||
# define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)
|
||||
# define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)
|
||||
# define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)
|
||||
# define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)
|
||||
# define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)
|
||||
#endif
|
||||
|
||||
|
||||
/* *************************************
|
||||
* Version
|
||||
***************************************/
|
||||
#define XXH_VERSION_MAJOR 0
|
||||
#define XXH_VERSION_MINOR 6
|
||||
#define XXH_VERSION_RELEASE 5
|
||||
#define XXH_VERSION_NUMBER (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)
|
||||
XXH_PUBLIC_API unsigned XXH_versionNumber (void);
|
||||
|
||||
|
||||
/*-**********************************************************************
|
||||
* 32-bit hash
|
||||
************************************************************************/
|
||||
typedef unsigned int XXH32_hash_t;
|
||||
|
||||
/*! XXH32() :
|
||||
Calculate the 32-bit hash of sequence "length" bytes stored at memory address "input".
|
||||
The memory between input & input+length must be valid (allocated and read-accessible).
|
||||
"seed" can be used to alter the result predictably.
|
||||
Speed on Core 2 Duo @ 3 GHz (single thread, SMHasher benchmark) : 5.4 GB/s */
|
||||
XXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t length, unsigned int seed);
|
||||
|
||||
/*====== Streaming ======*/
|
||||
typedef struct XXH32_state_s XXH32_state_t; /* incomplete type */
|
||||
XXH_PUBLIC_API XXH32_state_t* XXH32_createState(void);
|
||||
XXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr);
|
||||
XXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dst_state, const XXH32_state_t* src_state);
|
||||
|
||||
XXH_PUBLIC_API XXH_errorcode XXH32_reset (XXH32_state_t* statePtr, unsigned int seed);
|
||||
XXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);
|
||||
XXH_PUBLIC_API XXH32_hash_t XXH32_digest (const XXH32_state_t* statePtr);
|
||||
|
||||
/*
|
||||
* Streaming functions generate the xxHash of an input provided in multiple segments.
|
||||
* Note that, for small input, they are slower than single-call functions, due to state management.
|
||||
* For small inputs, prefer `XXH32()` and `XXH64()`, which are better optimized.
|
||||
*
|
||||
* XXH state must first be allocated, using XXH*_createState() .
|
||||
*
|
||||
* Start a new hash by initializing state with a seed, using XXH*_reset().
|
||||
*
|
||||
* Then, feed the hash state by calling XXH*_update() as many times as necessary.
|
||||
* The function returns an error code, with 0 meaning OK, and any other value meaning there is an error.
|
||||
*
|
||||
* Finally, a hash value can be produced anytime, by using XXH*_digest().
|
||||
* This function returns the nn-bits hash as an int or long long.
|
||||
*
|
||||
* It's still possible to continue inserting input into the hash state after a digest,
|
||||
* and generate some new hashes later on, by calling again XXH*_digest().
|
||||
*
|
||||
* When done, free XXH state space if it was allocated dynamically.
|
||||
*/
|
||||
|
||||
/*====== Canonical representation ======*/
|
||||
|
||||
typedef struct { unsigned char digest[4]; } XXH32_canonical_t;
|
||||
XXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);
|
||||
XXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);
|
||||
|
||||
/* Default result type for XXH functions are primitive unsigned 32 and 64 bits.
|
||||
* The canonical representation uses human-readable write convention, aka big-endian (large digits first).
|
||||
* These functions allow transformation of hash result into and from its canonical format.
|
||||
* This way, hash values can be written into a file / memory, and remain comparable on different systems and programs.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef XXH_NO_LONG_LONG
|
||||
/*-**********************************************************************
|
||||
* 64-bit hash
|
||||
************************************************************************/
|
||||
typedef unsigned long long XXH64_hash_t;
|
||||
|
||||
/*! XXH64() :
|
||||
Calculate the 64-bit hash of sequence of length "len" stored at memory address "input".
|
||||
"seed" can be used to alter the result predictably.
|
||||
This function runs faster on 64-bit systems, but slower on 32-bit systems (see benchmark).
|
||||
*/
|
||||
XXH_PUBLIC_API XXH64_hash_t XXH64 (const void* input, size_t length, unsigned long long seed);
|
||||
|
||||
/*====== Streaming ======*/
|
||||
typedef struct XXH64_state_s XXH64_state_t; /* incomplete type */
|
||||
XXH_PUBLIC_API XXH64_state_t* XXH64_createState(void);
|
||||
XXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr);
|
||||
XXH_PUBLIC_API void XXH64_copyState(XXH64_state_t* dst_state, const XXH64_state_t* src_state);
|
||||
|
||||
XXH_PUBLIC_API XXH_errorcode XXH64_reset (XXH64_state_t* statePtr, unsigned long long seed);
|
||||
XXH_PUBLIC_API XXH_errorcode XXH64_update (XXH64_state_t* statePtr, const void* input, size_t length);
|
||||
XXH_PUBLIC_API XXH64_hash_t XXH64_digest (const XXH64_state_t* statePtr);
|
||||
|
||||
/*====== Canonical representation ======*/
|
||||
typedef struct { unsigned char digest[8]; } XXH64_canonical_t;
|
||||
XXH_PUBLIC_API void XXH64_canonicalFromHash(XXH64_canonical_t* dst, XXH64_hash_t hash);
|
||||
XXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(const XXH64_canonical_t* src);
|
||||
#endif /* XXH_NO_LONG_LONG */
|
||||
|
||||
|
||||
|
||||
#ifdef XXH_STATIC_LINKING_ONLY
|
||||
|
||||
/* ================================================================================================
|
||||
This section contains declarations which are not guaranteed to remain stable.
|
||||
They may change in future versions, becoming incompatible with a different version of the library.
|
||||
These declarations should only be used with static linking.
|
||||
Never use them in association with dynamic linking !
|
||||
=================================================================================================== */
|
||||
|
||||
/* These definitions are only present to allow
|
||||
* static allocation of XXH state, on stack or in a struct for example.
|
||||
* Never **ever** use members directly. */
|
||||
|
||||
#if !defined (__VMS) \
|
||||
&& (defined (__cplusplus) \
|
||||
|| (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )
|
||||
# include <stdint.h>
|
||||
|
||||
struct XXH32_state_s {
|
||||
uint32_t total_len_32;
|
||||
uint32_t large_len;
|
||||
uint32_t v1;
|
||||
uint32_t v2;
|
||||
uint32_t v3;
|
||||
uint32_t v4;
|
||||
uint32_t mem32[4];
|
||||
uint32_t memsize;
|
||||
uint32_t reserved; /* never read nor write, might be removed in a future version */
|
||||
}; /* typedef'd to XXH32_state_t */
|
||||
|
||||
struct XXH64_state_s {
|
||||
uint64_t total_len;
|
||||
uint64_t v1;
|
||||
uint64_t v2;
|
||||
uint64_t v3;
|
||||
uint64_t v4;
|
||||
uint64_t mem64[4];
|
||||
uint32_t memsize;
|
||||
uint32_t reserved[2]; /* never read nor write, might be removed in a future version */
|
||||
}; /* typedef'd to XXH64_state_t */
|
||||
|
||||
# else
|
||||
|
||||
struct XXH32_state_s {
|
||||
unsigned total_len_32;
|
||||
unsigned large_len;
|
||||
unsigned v1;
|
||||
unsigned v2;
|
||||
unsigned v3;
|
||||
unsigned v4;
|
||||
unsigned mem32[4];
|
||||
unsigned memsize;
|
||||
unsigned reserved; /* never read nor write, might be removed in a future version */
|
||||
}; /* typedef'd to XXH32_state_t */
|
||||
|
||||
# ifndef XXH_NO_LONG_LONG /* remove 64-bit support */
|
||||
struct XXH64_state_s {
|
||||
unsigned long long total_len;
|
||||
unsigned long long v1;
|
||||
unsigned long long v2;
|
||||
unsigned long long v3;
|
||||
unsigned long long v4;
|
||||
unsigned long long mem64[4];
|
||||
unsigned memsize;
|
||||
unsigned reserved[2]; /* never read nor write, might be removed in a future version */
|
||||
}; /* typedef'd to XXH64_state_t */
|
||||
# endif
|
||||
|
||||
# endif
|
||||
|
||||
|
||||
#if defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)
|
||||
# include "xxhash.c" /* include xxhash function bodies as `static`, for inlining */
|
||||
#endif
|
||||
|
||||
#endif /* XXH_STATIC_LINKING_ONLY */
|
||||
|
||||
|
||||
#if defined (__cplusplus)
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* XXHASH_H_5627135585666179 */
|
||||
|
|
@ -177,10 +177,7 @@ DEFINES['IMPL_MFBT'] = True
|
|||
|
||||
SOURCES += [
|
||||
'Compression.cpp',
|
||||
'lz4/lz4.c',
|
||||
'lz4/lz4frame.c',
|
||||
'lz4/lz4hc.c',
|
||||
'lz4/xxhash.c',
|
||||
'lz4.c',
|
||||
]
|
||||
|
||||
DisableStlWrapping()
|
||||
|
|
|
|||
|
|
@ -7,13 +7,8 @@
|
|||
#include "prio.h"
|
||||
#include "PLDHashTable.h"
|
||||
#include "mozilla/IOInterposer.h"
|
||||
#include "mozilla/AutoMemMap.h"
|
||||
#include "mozilla/IOBuffers.h"
|
||||
#include "mozilla/MemoryReporting.h"
|
||||
#include "mozilla/MemUtils.h"
|
||||
#include "mozilla/ResultExtensions.h"
|
||||
#include "mozilla/scache/StartupCache.h"
|
||||
#include "mozilla/ScopeExit.h"
|
||||
|
||||
#include "nsAutoPtr.h"
|
||||
#include "nsClassHashtable.h"
|
||||
|
|
@ -53,8 +48,6 @@
|
|||
# define SC_WORDSIZE "8"
|
||||
#endif
|
||||
|
||||
using namespace mozilla::Compression;
|
||||
|
||||
namespace mozilla {
|
||||
namespace scache {
|
||||
|
||||
|
|
@ -65,7 +58,7 @@ StartupCache::CollectReports(nsIHandleReportCallback* aHandleReport,
|
|||
nsISupports* aData, bool aAnonymize) {
|
||||
MOZ_COLLECT_REPORT(
|
||||
"explicit/startup-cache/mapping", KIND_NONHEAP, UNITS_BYTES,
|
||||
mCacheData.nonHeapSizeOfExcludingThis(),
|
||||
SizeOfMapping(),
|
||||
"Memory used to hold the mapping of the startup cache from file. "
|
||||
"This memory is likely to be swapped out shortly after start-up.");
|
||||
|
||||
|
|
@ -77,37 +70,8 @@ StartupCache::CollectReports(nsIHandleReportCallback* aHandleReport,
|
|||
return NS_OK;
|
||||
}
|
||||
|
||||
static const uint8_t MAGIC[] = "startupcache0002";
|
||||
// This is a heuristic value for how much to reserve for mTable to avoid
|
||||
// rehashing. This is not a hard limit in release builds, but it is in
|
||||
// debug builds as it should be stable. If we exceed this number we should
|
||||
// just increase it.
|
||||
static const size_t STARTUP_CACHE_RESERVE_CAPACITY = 450;
|
||||
// This is a hard limit which we will assert on, to ensure that we don't
|
||||
// have some bug causing runaway cache growth.
|
||||
static const size_t STARTUP_CACHE_MAX_CAPACITY = 5000;
|
||||
|
||||
#define STARTUP_CACHE_NAME "startupCache." SC_WORDSIZE "." SC_ENDIAN
|
||||
|
||||
static inline Result<Ok, nsresult> Write(PRFileDesc* fd, const void* data,
|
||||
int32_t len) {
|
||||
if (PR_Write(fd, data, len) != len) {
|
||||
return Err(NS_ERROR_FAILURE);
|
||||
}
|
||||
return Ok();
|
||||
}
|
||||
|
||||
static inline Result<Ok, nsresult> Seek(PRFileDesc* fd, int32_t offset) {
|
||||
if (PR_Seek(fd, offset, PR_SEEK_SET) == -1) {
|
||||
return Err(NS_ERROR_FAILURE);
|
||||
}
|
||||
return Ok();
|
||||
}
|
||||
|
||||
static nsresult MapLZ4ErrorToNsresult(size_t aError) {
|
||||
return NS_ERROR_FAILURE;
|
||||
}
|
||||
|
||||
StartupCache* StartupCache::GetSingleton() {
|
||||
if (!gStartupCache) {
|
||||
if (!XRE_IsParentProcess()) {
|
||||
|
|
@ -143,13 +107,7 @@ bool StartupCache::gIgnoreDiskCache;
|
|||
NS_IMPL_ISUPPORTS(StartupCache, nsIMemoryReporter)
|
||||
|
||||
StartupCache::StartupCache()
|
||||
: mDirty(false),
|
||||
mStartupWriteInitiated(false),
|
||||
mCurTableReferenced(false),
|
||||
mRequestedCount(0),
|
||||
mCacheEntriesBaseOffset(0),
|
||||
mWriteThread(nullptr),
|
||||
mPrefetchThread(nullptr) {}
|
||||
: mArchive(nullptr), mStartupWriteInitiated(false), mWriteThread(nullptr) {}
|
||||
|
||||
StartupCache::~StartupCache() {
|
||||
if (mTimer) {
|
||||
|
|
@ -160,16 +118,13 @@ StartupCache::~StartupCache() {
|
|||
// but an early shutdown means either mTimer didn't run
|
||||
// or the write thread is still running.
|
||||
WaitOnWriteThread();
|
||||
WaitOnPrefetchThread();
|
||||
|
||||
// If we shutdown quickly timer wont have fired. Instead of writing
|
||||
// it on the main thread and block the shutdown we simply wont update
|
||||
// the startup cache. Always do this if the file doesn't exist since
|
||||
// we use it part of the package step.
|
||||
if (mDirty || ShouldCompactCache()) {
|
||||
mDirty = true;
|
||||
auto result = WriteToDisk();
|
||||
Unused << NS_WARN_IF(result.isErr());
|
||||
if (!mArchive) {
|
||||
WriteToDisk();
|
||||
}
|
||||
|
||||
UnregisterWeakMemoryReporter(this);
|
||||
|
|
@ -228,8 +183,7 @@ nsresult StartupCache::Init() {
|
|||
false);
|
||||
NS_ENSURE_SUCCESS(rv, rv);
|
||||
|
||||
auto result = LoadArchive();
|
||||
rv = result.isErr() ? result.unwrapErr() : NS_OK;
|
||||
rv = LoadArchive();
|
||||
|
||||
// Sometimes we don't have a cache yet, that's ok.
|
||||
// If it's corrupted, just remove it and start over.
|
||||
|
|
@ -239,112 +193,46 @@ nsresult StartupCache::Init() {
|
|||
}
|
||||
|
||||
RegisterWeakMemoryReporter(this);
|
||||
mDecompressionContext = MakeUnique<LZ4FrameDecompressionContext>(true);
|
||||
|
||||
return NS_OK;
|
||||
}
|
||||
|
||||
void StartupCache::StartPrefetchMemoryThread() {
|
||||
// XXX: It would be great for this to not create its own thread, unfortunately
|
||||
// there doesn't seem to be an existing thread that makes sense for this, so
|
||||
// barring a coordinated global scheduling system this is the best we get.
|
||||
mPrefetchThread = PR_CreateThread(
|
||||
PR_USER_THREAD, StartupCache::ThreadedPrefetch, this,
|
||||
PR_PRIORITY_NORMAL, PR_GLOBAL_THREAD, PR_JOINABLE_THREAD, 256 * 1024);
|
||||
}
|
||||
|
||||
/**
|
||||
* LoadArchive can be called from the main thread or while reloading cache on
|
||||
* write thread.
|
||||
*/
|
||||
Result<Ok, nsresult> StartupCache::LoadArchive() {
|
||||
if (gIgnoreDiskCache) return Err(NS_ERROR_FAILURE);
|
||||
nsresult StartupCache::LoadArchive() {
|
||||
if (gIgnoreDiskCache) return NS_ERROR_FAILURE;
|
||||
|
||||
MOZ_TRY(mCacheData.init(mFile));
|
||||
auto size = mCacheData.size();
|
||||
if (CanPrefetchMemory()) {
|
||||
StartPrefetchMemoryThread();
|
||||
mArchive = new nsZipArchive();
|
||||
nsresult rv = mArchive->OpenArchive(mFile);
|
||||
|
||||
if (NS_FAILED(rv)) {
|
||||
mArchive = nullptr;
|
||||
}
|
||||
|
||||
uint32_t headerSize;
|
||||
if (size < sizeof(MAGIC) + sizeof(headerSize)) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
|
||||
auto data = mCacheData.get<uint8_t>();
|
||||
auto end = data + size;
|
||||
|
||||
if (memcmp(MAGIC, data.get(), sizeof(MAGIC))) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
data += sizeof(MAGIC);
|
||||
|
||||
headerSize = LittleEndian::readUint32(data.get());
|
||||
data += sizeof(headerSize);
|
||||
|
||||
if (data + headerSize > end) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
|
||||
Range<uint8_t> header(data, data + headerSize);
|
||||
data += headerSize;
|
||||
|
||||
mCacheEntriesBaseOffset = sizeof(MAGIC) + sizeof(headerSize) + headerSize;
|
||||
{
|
||||
if (!mTable.reserve(STARTUP_CACHE_RESERVE_CAPACITY)) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
auto cleanup = MakeScopeExit([&]() { mTable.clear(); });
|
||||
loader::InputBuffer buf(header);
|
||||
|
||||
uint32_t currentOffset = 0;
|
||||
while (!buf.finished()) {
|
||||
uint32_t offset = 0;
|
||||
uint32_t compressedSize = 0;
|
||||
uint32_t uncompressedSize = 0;
|
||||
nsCString key;
|
||||
buf.codeUint32(offset);
|
||||
buf.codeUint32(compressedSize);
|
||||
buf.codeUint32(uncompressedSize);
|
||||
buf.codeString(key);
|
||||
|
||||
if (data + offset + compressedSize > end) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
|
||||
// Make sure offsets match what we'd expect based on script ordering and
|
||||
// size, as a basic sanity check.
|
||||
if (offset != currentOffset) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
currentOffset += compressedSize;
|
||||
|
||||
if (!mTable.putNew(key, StartupCacheEntry(offset, compressedSize,
|
||||
uncompressedSize))) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
}
|
||||
|
||||
if (buf.error()) {
|
||||
return Err(NS_ERROR_UNEXPECTED);
|
||||
}
|
||||
|
||||
cleanup.release();
|
||||
}
|
||||
|
||||
return Ok();
|
||||
return rv;
|
||||
}
|
||||
|
||||
bool StartupCache::HasEntry(const char* id) {
|
||||
AUTO_PROFILER_LABEL("StartupCache::HasEntry", OTHER);
|
||||
namespace {
|
||||
|
||||
MOZ_ASSERT(NS_IsMainThread(), "Startup cache only available on main thread");
|
||||
WaitOnWriteThread();
|
||||
nsresult GetBufferFromZipArchive(nsZipArchive* zip, bool doCRC, const char* id,
|
||||
UniquePtr<char[]>* outbuf, uint32_t* length) {
|
||||
if (!zip) return NS_ERROR_NOT_AVAILABLE;
|
||||
|
||||
return mTable.has(nsDependentCString(id));
|
||||
nsZipItemPtr<char> zipItem(zip, id, doCRC);
|
||||
if (!zipItem) return NS_ERROR_NOT_AVAILABLE;
|
||||
|
||||
*outbuf = zipItem.Forget();
|
||||
*length = zipItem.Length();
|
||||
return NS_OK;
|
||||
}
|
||||
|
||||
nsresult StartupCache::GetBuffer(const char* id, const char** outbuf,
|
||||
} /* anonymous namespace */
|
||||
|
||||
// NOTE: this will not find a new entry until it has been written to disk!
|
||||
// Consumer should take ownership of the resulting buffer.
|
||||
nsresult StartupCache::GetBuffer(const char* id, UniquePtr<char[]>* outbuf,
|
||||
uint32_t* length) {
|
||||
AUTO_PROFILER_LABEL("StartupCache::GetBuffer", OTHER);
|
||||
|
||||
|
|
@ -352,65 +240,39 @@ nsresult StartupCache::GetBuffer(const char* id, const char** outbuf,
|
|||
"Startup cache only available on main thread");
|
||||
|
||||
WaitOnWriteThread();
|
||||
Telemetry::LABELS_STARTUP_CACHE_REQUESTS label =
|
||||
Telemetry::LABELS_STARTUP_CACHE_REQUESTS::Miss;
|
||||
auto telemetry = MakeScopeExit([&label] {
|
||||
Telemetry::AccumulateCategorical(label);
|
||||
});
|
||||
|
||||
decltype(mTable)::Ptr p = mTable.lookup(nsDependentCString(id));
|
||||
if (!p) {
|
||||
return NS_ERROR_NOT_AVAILABLE;
|
||||
}
|
||||
|
||||
auto& value = p->value();
|
||||
if (value.mData) {
|
||||
label = Telemetry::LABELS_STARTUP_CACHE_REQUESTS::HitMemory;
|
||||
} else {
|
||||
if (!mCacheData.initialized()) {
|
||||
return NS_ERROR_NOT_AVAILABLE;
|
||||
if (!mStartupWriteInitiated) {
|
||||
CacheEntry* entry;
|
||||
nsDependentCString idStr(id);
|
||||
mTable.Get(idStr, &entry);
|
||||
if (entry) {
|
||||
*outbuf = MakeUnique<char[]>(entry->size);
|
||||
memcpy(outbuf->get(), entry->data.get(), entry->size);
|
||||
*length = entry->size;
|
||||
Telemetry::AccumulateCategorical(
|
||||
Telemetry::LABELS_STARTUP_CACHE_REQUESTS::HitMemory);
|
||||
return NS_OK;
|
||||
}
|
||||
|
||||
size_t totalRead = 0;
|
||||
size_t totalWritten = 0;
|
||||
Span<const char> compressed = MakeSpan(
|
||||
mCacheData.get<char>().get() + mCacheEntriesBaseOffset + value.mOffset,
|
||||
value.mCompressedSize);
|
||||
value.mData = MakeUnique<char[]>(value.mUncompressedSize);
|
||||
Span<char> uncompressed =
|
||||
MakeSpan(value.mData.get(), value.mUncompressedSize);
|
||||
bool finished = false;
|
||||
while (!finished) {
|
||||
auto result = mDecompressionContext->Decompress(
|
||||
uncompressed.From(totalWritten), compressed.From(totalRead));
|
||||
if (NS_WARN_IF(result.isErr())) {
|
||||
value.mData = nullptr;
|
||||
InvalidateCache();
|
||||
return NS_ERROR_FAILURE;
|
||||
}
|
||||
auto decompressionResult = result.unwrap();
|
||||
totalRead += decompressionResult.mSizeRead;
|
||||
totalWritten += decompressionResult.mSizeWritten;
|
||||
finished = decompressionResult.mFinished;
|
||||
}
|
||||
|
||||
label = Telemetry::LABELS_STARTUP_CACHE_REQUESTS::HitDisk;
|
||||
}
|
||||
|
||||
if (!value.mRequested) {
|
||||
value.mRequested = true;
|
||||
value.mRequestedOrder = ++mRequestedCount;
|
||||
MOZ_ASSERT(mRequestedCount <= mTable.count(),
|
||||
"Somehow we requested more StartupCache items than exist.");
|
||||
ResetStartupWriteTimerCheckingReadCount();
|
||||
nsresult rv = GetBufferFromZipArchive(mArchive, true, id, outbuf, length);
|
||||
if (NS_SUCCEEDED(rv)) {
|
||||
Telemetry::AccumulateCategorical(
|
||||
Telemetry::LABELS_STARTUP_CACHE_REQUESTS::HitDisk);
|
||||
return rv;
|
||||
}
|
||||
|
||||
// Track that something holds a reference into mTable, so we know to hold
|
||||
// onto it in case the cache is invalidated.
|
||||
mCurTableReferenced = true;
|
||||
*outbuf = value.mData.get();
|
||||
*length = value.mUncompressedSize;
|
||||
return NS_OK;
|
||||
Telemetry::AccumulateCategorical(
|
||||
Telemetry::LABELS_STARTUP_CACHE_REQUESTS::Miss);
|
||||
|
||||
RefPtr<nsZipArchive> omnijar =
|
||||
mozilla::Omnijar::GetReader(mozilla::Omnijar::APP);
|
||||
// no need to checksum omnijarred entries
|
||||
rv = GetBufferFromZipArchive(omnijar, false, id, outbuf, length);
|
||||
if (NS_SUCCEEDED(rv)) return rv;
|
||||
|
||||
omnijar = mozilla::Omnijar::GetReader(mozilla::Omnijar::GRE);
|
||||
// no need to checksum omnijarred entries
|
||||
return GetBufferFromZipArchive(omnijar, false, id, outbuf, length);
|
||||
}
|
||||
|
||||
// Makes a copy of the buffer, client retains ownership of inbuf.
|
||||
|
|
@ -423,24 +285,31 @@ nsresult StartupCache::PutBuffer(const char* id, UniquePtr<char[]>&& inbuf,
|
|||
return NS_ERROR_NOT_AVAILABLE;
|
||||
}
|
||||
|
||||
bool exists = mTable.has(nsDependentCString(id));
|
||||
nsDependentCString idStr(id);
|
||||
// Cache it for now, we'll write all together later.
|
||||
auto entry = mTable.LookupForAdd(idStr);
|
||||
|
||||
if (exists) {
|
||||
if (entry) {
|
||||
NS_WARNING("Existing entry in StartupCache.");
|
||||
// Double-caching is undesirable but not an error.
|
||||
return NS_OK;
|
||||
}
|
||||
|
||||
// putNew returns false on alloc failure - in the very unlikely event we hit
|
||||
// that and aren't going to crash elsewhere, there's no reason we need to
|
||||
// crash here.
|
||||
if (mTable.putNew(nsCString(id), StartupCacheEntry(std::move(inbuf), len,
|
||||
++mRequestedCount))) {
|
||||
return ResetStartupWriteTimer();
|
||||
#ifdef DEBUG
|
||||
if (mArchive) {
|
||||
nsZipItem* zipItem = mArchive->GetItem(id);
|
||||
NS_ASSERTION(zipItem == nullptr, "Existing entry in disk StartupCache.");
|
||||
}
|
||||
MOZ_DIAGNOSTIC_ASSERT(mTable.count() < STARTUP_CACHE_MAX_CAPACITY,
|
||||
"Too many StartupCache entries.");
|
||||
return NS_OK;
|
||||
#endif
|
||||
|
||||
entry.OrInsert(
|
||||
[&inbuf, &len]() { return new CacheEntry(std::move(inbuf), len); });
|
||||
mPendingWrites.AppendElement(idStr);
|
||||
return ResetStartupWriteTimer();
|
||||
}
|
||||
|
||||
size_t StartupCache::SizeOfMapping() {
|
||||
return mArchive ? mArchive->SizeOfMapping() : 0;
|
||||
}
|
||||
|
||||
size_t StartupCache::HeapSizeOfIncludingThis(
|
||||
|
|
@ -450,142 +319,125 @@ size_t StartupCache::HeapSizeOfIncludingThis(
|
|||
|
||||
size_t n = aMallocSizeOf(this);
|
||||
|
||||
n += mTable.shallowSizeOfExcludingThis(aMallocSizeOf);
|
||||
n += mTable.ShallowSizeOfExcludingThis(aMallocSizeOf);
|
||||
for (auto iter = mTable.ConstIter(); !iter.Done(); iter.Next()) {
|
||||
n += iter.Data()->SizeOfIncludingThis(aMallocSizeOf);
|
||||
}
|
||||
|
||||
n += mPendingWrites.ShallowSizeOfExcludingThis(aMallocSizeOf);
|
||||
|
||||
return n;
|
||||
}
|
||||
|
||||
struct CacheWriteHolder {
|
||||
nsCOMPtr<nsIZipWriter> writer;
|
||||
nsCOMPtr<nsIStringInputStream> stream;
|
||||
PRTime time;
|
||||
};
|
||||
|
||||
static void CacheCloseHelper(const nsACString& key, const CacheEntry* data,
|
||||
const CacheWriteHolder* holder) {
|
||||
MOZ_ASSERT(data); // assert key was found in mTable.
|
||||
|
||||
nsresult rv;
|
||||
nsIStringInputStream* stream = holder->stream;
|
||||
nsIZipWriter* writer = holder->writer;
|
||||
|
||||
stream->ShareData(data->data.get(), data->size);
|
||||
|
||||
#ifdef DEBUG
|
||||
bool hasEntry;
|
||||
rv = writer->HasEntry(key, &hasEntry);
|
||||
NS_ASSERTION(NS_SUCCEEDED(rv) && hasEntry == false,
|
||||
"Existing entry in disk StartupCache.");
|
||||
#endif
|
||||
rv = writer->AddEntryStream(key, holder->time, true, stream, false);
|
||||
|
||||
if (NS_FAILED(rv)) {
|
||||
NS_WARNING("cache entry deleted but not written to disk.");
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* WriteToDisk writes the cache out to disk. Callers of WriteToDisk need to call
|
||||
* WaitOnWriteThread to make sure there isn't a write happening on another
|
||||
* thread
|
||||
*/
|
||||
Result<Ok, nsresult> StartupCache::WriteToDisk() {
|
||||
void StartupCache::WriteToDisk() {
|
||||
nsresult rv;
|
||||
mStartupWriteInitiated = true;
|
||||
if (!mDirty) return Ok();
|
||||
|
||||
AutoFDClose fd;
|
||||
MOZ_TRY(mFile->OpenNSPRFileDesc(PR_WRONLY | PR_CREATE_FILE | PR_TRUNCATE,
|
||||
0644, &fd.rwget()));
|
||||
if (mTable.Count() == 0) return;
|
||||
|
||||
nsTArray<Pair<const nsCString*, StartupCacheEntry*>> entries;
|
||||
for (auto iter = mTable.iter(); !iter.done(); iter.next()) {
|
||||
entries.AppendElement(MakePair(&iter.get().key(), &iter.get().value()));
|
||||
nsCOMPtr<nsIZipWriter> zipW = do_CreateInstance("@mozilla.org/zipwriter;1");
|
||||
if (!zipW) return;
|
||||
|
||||
rv = zipW->Open(mFile, PR_RDWR | PR_CREATE_FILE);
|
||||
if (NS_FAILED(rv)) {
|
||||
NS_WARNING("could not open zipfile for write");
|
||||
return;
|
||||
}
|
||||
|
||||
entries.Sort(StartupCacheEntry::Comparator());
|
||||
loader::OutputBuffer buf;
|
||||
for (auto& e : entries) {
|
||||
auto key = e.first();
|
||||
auto value = e.second();
|
||||
if (!value->mRequested) {
|
||||
continue;
|
||||
}
|
||||
auto uncompressedSize = value->mUncompressedSize;
|
||||
// Set the mHeaderOffsetInFile so we can go back and edit the offset.
|
||||
value->mHeaderOffsetInFile = buf.cursor();
|
||||
// Write a 0 offset/compressed size as a placeholder until we get the real
|
||||
// offset after compressing.
|
||||
buf.codeUint32(0);
|
||||
buf.codeUint32(0);
|
||||
buf.codeUint32(uncompressedSize);
|
||||
buf.codeString(*key);
|
||||
// If we didn't have an mArchive member, that means that we failed to
|
||||
// open the startup cache for reading. Therefore, we need to record
|
||||
// the time of creation in a zipfile comment; this has been useful for
|
||||
// Telemetry statistics.
|
||||
PRTime now = PR_Now();
|
||||
if (!mArchive) {
|
||||
nsCString comment;
|
||||
comment.Assign((char*)&now, sizeof(now));
|
||||
zipW->SetComment(comment);
|
||||
}
|
||||
|
||||
uint8_t headerSize[4];
|
||||
LittleEndian::writeUint32(headerSize, buf.cursor());
|
||||
|
||||
MOZ_TRY(Write(fd, MAGIC, sizeof(MAGIC)));
|
||||
MOZ_TRY(Write(fd, headerSize, sizeof(headerSize)));
|
||||
size_t headerStart = sizeof(MAGIC) + sizeof(headerSize);
|
||||
size_t dataStart = headerStart + buf.cursor();
|
||||
MOZ_TRY(Seek(fd, dataStart));
|
||||
|
||||
size_t offset = 0;
|
||||
for (auto& e : entries) {
|
||||
auto value = e.second();
|
||||
if (!value->mRequested) {
|
||||
continue;
|
||||
}
|
||||
value->mOffset = offset;
|
||||
const size_t chunkSize = 1024 * 16;
|
||||
LZ4FrameCompressionContext ctx(6, /* aCompressionLevel */
|
||||
chunkSize, /* aReadBufLen */
|
||||
true, /* aChecksum */
|
||||
true); /* aStableSrc */
|
||||
Span<const char> result;
|
||||
MOZ_TRY_VAR(result, ctx.BeginCompressing().mapErr(MapLZ4ErrorToNsresult));
|
||||
MOZ_TRY(Write(fd, result.Elements(), result.Length()));
|
||||
offset += result.Length();
|
||||
|
||||
for (size_t i = 0; i < value->mUncompressedSize; i += chunkSize) {
|
||||
size_t size = std::min(chunkSize, value->mUncompressedSize - i);
|
||||
char* uncompressed = value->mData.get() + i;
|
||||
MOZ_TRY_VAR(result,
|
||||
ctx.ContinueCompressing(MakeSpan(uncompressed, size))
|
||||
.mapErr(MapLZ4ErrorToNsresult));
|
||||
MOZ_TRY(Write(fd, result.Elements(), result.Length()));
|
||||
offset += result.Length();
|
||||
}
|
||||
|
||||
MOZ_TRY_VAR(result, ctx.EndCompressing().mapErr(MapLZ4ErrorToNsresult));
|
||||
MOZ_TRY(Write(fd, result.Elements(), result.Length()));
|
||||
offset += result.Length();
|
||||
value->mCompressedSize = offset - value->mOffset;
|
||||
MOZ_TRY(Seek(fd, dataStart + offset));
|
||||
nsCOMPtr<nsIStringInputStream> stream =
|
||||
do_CreateInstance("@mozilla.org/io/string-input-stream;1", &rv);
|
||||
if (NS_FAILED(rv)) {
|
||||
NS_WARNING("Couldn't create string input stream.");
|
||||
return;
|
||||
}
|
||||
|
||||
for (auto& e : entries) {
|
||||
auto value = e.second();
|
||||
if (!value->mRequested) {
|
||||
continue;
|
||||
}
|
||||
uint8_t* headerEntry = buf.Get() + value->mHeaderOffsetInFile;
|
||||
LittleEndian::writeUint32(headerEntry, value->mOffset);
|
||||
LittleEndian::writeUint32(headerEntry + sizeof(value->mOffset),
|
||||
value->mCompressedSize);
|
||||
CacheWriteHolder holder;
|
||||
holder.stream = stream;
|
||||
holder.writer = zipW;
|
||||
holder.time = now;
|
||||
|
||||
for (auto& key : mPendingWrites) {
|
||||
CacheCloseHelper(key, mTable.Get(key), &holder);
|
||||
}
|
||||
MOZ_TRY(Seek(fd, headerStart));
|
||||
MOZ_TRY(Write(fd, buf.Get(), buf.cursor()));
|
||||
mPendingWrites.Clear();
|
||||
mTable.Clear();
|
||||
|
||||
mDirty = false;
|
||||
// Close the archive so Windows doesn't choke.
|
||||
mArchive = nullptr;
|
||||
zipW->Close();
|
||||
|
||||
return Ok();
|
||||
// We succesfully wrote the archive to disk; mark the disk file as trusted
|
||||
gIgnoreDiskCache = false;
|
||||
|
||||
// Our reader's view of the archive is outdated now, reload it.
|
||||
LoadArchive();
|
||||
}
|
||||
|
||||
void StartupCache::InvalidateCache(bool memoryOnly) {
|
||||
WaitOnWriteThread();
|
||||
if (memoryOnly) {
|
||||
auto writeResult = WriteToDisk();
|
||||
if (NS_WARN_IF(writeResult.isErr())) {
|
||||
gIgnoreDiskCache = true;
|
||||
return;
|
||||
}
|
||||
// The memoryOnly option is just for testing purposes. We want to ensure
|
||||
// that we're nuking the in-memory form but that we preserve everything
|
||||
// on disk.
|
||||
WriteToDisk();
|
||||
return;
|
||||
}
|
||||
if (mCurTableReferenced) {
|
||||
// There should be no way for this assert to fail other than a user manually
|
||||
// sending startupcache-invalidate messages through the Browser Toolbox.
|
||||
MOZ_DIAGNOSTIC_ASSERT(xpc::IsInAutomation() || mOldTables.Length() < 10,
|
||||
"Startup cache invalidated too many times.");
|
||||
mOldTables.AppendElement(std::move(mTable));
|
||||
mCurTableReferenced = false;
|
||||
} else {
|
||||
mTable.clear();
|
||||
}
|
||||
mRequestedCount = 0;
|
||||
if (!memoryOnly) {
|
||||
nsresult rv = mFile->Remove(false);
|
||||
if (NS_FAILED(rv) && rv != NS_ERROR_FILE_TARGET_DOES_NOT_EXIST &&
|
||||
rv != NS_ERROR_FILE_NOT_FOUND) {
|
||||
gIgnoreDiskCache = true;
|
||||
return;
|
||||
}
|
||||
WaitOnWriteThread();
|
||||
mPendingWrites.Clear();
|
||||
mTable.Clear();
|
||||
mArchive = nullptr;
|
||||
nsresult rv = mFile->Remove(false);
|
||||
if (NS_FAILED(rv) && rv != NS_ERROR_FILE_TARGET_DOES_NOT_EXIST &&
|
||||
rv != NS_ERROR_FILE_NOT_FOUND) {
|
||||
gIgnoreDiskCache = true;
|
||||
return;
|
||||
}
|
||||
gIgnoreDiskCache = false;
|
||||
auto result = LoadArchive();
|
||||
if (NS_WARN_IF(result.isErr())) {
|
||||
gIgnoreDiskCache = true;
|
||||
}
|
||||
LoadArchive();
|
||||
}
|
||||
|
||||
void StartupCache::IgnoreDiskCache() {
|
||||
|
|
@ -608,25 +460,6 @@ void StartupCache::WaitOnWriteThread() {
|
|||
mWriteThread = nullptr;
|
||||
}
|
||||
|
||||
void StartupCache::WaitOnPrefetchThread() {
|
||||
if (!mPrefetchThread || mPrefetchThread == PR_GetCurrentThread()) return;
|
||||
|
||||
PR_JoinThread(mPrefetchThread);
|
||||
mPrefetchThread = nullptr;
|
||||
}
|
||||
|
||||
void StartupCache::ThreadedPrefetch(void* aClosure) {
|
||||
AUTO_PROFILER_REGISTER_THREAD("StartupCache");
|
||||
NS_SetCurrentThreadName("StartupCache");
|
||||
mozilla::IOInterposer::RegisterCurrentThread();
|
||||
StartupCache* startupCacheObj = static_cast<StartupCache*>(aClosure);
|
||||
PrefetchMemory(startupCacheObj->mCacheData.get<uint8_t>().get(),
|
||||
startupCacheObj->mCacheData.size());
|
||||
auto result = startupCacheObj->WriteToDisk();
|
||||
Unused << NS_WARN_IF(result.isErr());
|
||||
mozilla::IOInterposer::UnregisterCurrentThread();
|
||||
}
|
||||
|
||||
void StartupCache::ThreadedWrite(void* aClosure) {
|
||||
AUTO_PROFILER_REGISTER_THREAD("StartupCache");
|
||||
NS_SetCurrentThreadName("StartupCache");
|
||||
|
|
@ -639,20 +472,10 @@ void StartupCache::ThreadedWrite(void* aClosure) {
|
|||
* if the StartupCache object is valid.
|
||||
*/
|
||||
StartupCache* startupCacheObj = static_cast<StartupCache*>(aClosure);
|
||||
auto result = startupCacheObj->WriteToDisk();
|
||||
Unused << NS_WARN_IF(result.isErr());
|
||||
startupCacheObj->WriteToDisk();
|
||||
mozilla::IOInterposer::UnregisterCurrentThread();
|
||||
}
|
||||
|
||||
bool StartupCache::ShouldCompactCache() {
|
||||
// If we've requested less than 4/5 of the startup cache, then we should
|
||||
// probably compact it down. This can happen quite easily after the first run,
|
||||
// which seems to request quite a few more things than subsequent runs.
|
||||
CheckedInt<uint32_t> threshold = CheckedInt<uint32_t>(mTable.count()) * 4 / 5;
|
||||
MOZ_RELEASE_ASSERT(threshold.isValid(), "Runaway StartupCache size");
|
||||
return mRequestedCount < threshold.value();
|
||||
}
|
||||
|
||||
/*
|
||||
* The write-thread is spawned on a timeout(which is reset with every write).
|
||||
* This can avoid a slow shutdown. After writing out the cache, the zipreader is
|
||||
|
|
@ -667,15 +490,9 @@ void StartupCache::WriteTimeout(nsITimer* aTimer, void* aClosure) {
|
|||
* if the StartupCache object is valid.
|
||||
*/
|
||||
StartupCache* startupCacheObj = static_cast<StartupCache*>(aClosure);
|
||||
if (startupCacheObj->mDirty || startupCacheObj->ShouldCompactCache()) {
|
||||
startupCacheObj->WaitOnPrefetchThread();
|
||||
startupCacheObj->mStartupWriteInitiated = false;
|
||||
startupCacheObj->mDirty = true;
|
||||
startupCacheObj->mCacheData.reset();
|
||||
startupCacheObj->mWriteThread = PR_CreateThread(
|
||||
PR_USER_THREAD, StartupCache::ThreadedWrite, startupCacheObj,
|
||||
PR_PRIORITY_NORMAL, PR_GLOBAL_THREAD, PR_JOINABLE_THREAD, 256 * 1024);
|
||||
}
|
||||
startupCacheObj->mWriteThread = PR_CreateThread(
|
||||
PR_USER_THREAD, StartupCache::ThreadedWrite, startupCacheObj,
|
||||
PR_PRIORITY_NORMAL, PR_GLOBAL_THREAD, PR_JOINABLE_THREAD, 0);
|
||||
}
|
||||
|
||||
// We don't want to refcount StartupCache, so we'll just
|
||||
|
|
@ -710,23 +527,8 @@ nsresult StartupCache::GetDebugObjectOutputStream(
|
|||
return NS_OK;
|
||||
}
|
||||
|
||||
nsresult StartupCache::ResetStartupWriteTimerCheckingReadCount() {
|
||||
nsresult rv = NS_OK;
|
||||
if (!mTimer)
|
||||
mTimer = NS_NewTimer();
|
||||
else
|
||||
rv = mTimer->Cancel();
|
||||
NS_ENSURE_SUCCESS(rv, rv);
|
||||
// Wait for 10 seconds, then write out the cache.
|
||||
mTimer->InitWithNamedFuncCallback(StartupCache::WriteTimeout, this, 60000,
|
||||
nsITimer::TYPE_ONE_SHOT,
|
||||
"StartupCache::WriteTimeout");
|
||||
return NS_OK;
|
||||
}
|
||||
|
||||
nsresult StartupCache::ResetStartupWriteTimer() {
|
||||
mStartupWriteInitiated = false;
|
||||
mDirty = true;
|
||||
nsresult rv = NS_OK;
|
||||
if (!mTimer)
|
||||
mTimer = NS_NewTimer();
|
||||
|
|
@ -742,7 +544,7 @@ nsresult StartupCache::ResetStartupWriteTimer() {
|
|||
|
||||
bool StartupCache::StartupWriteComplete() {
|
||||
WaitOnWriteThread();
|
||||
return mStartupWriteInitiated && !mDirty;
|
||||
return mStartupWriteInitiated && mTable.Count() == 0;
|
||||
}
|
||||
|
||||
// StartupCacheDebugOutputStream implementation
|
||||
|
|
|
|||
|
|
@ -18,11 +18,7 @@
|
|||
#include "nsIOutputStream.h"
|
||||
#include "nsIFile.h"
|
||||
#include "mozilla/Attributes.h"
|
||||
#include "mozilla/AutoMemMap.h"
|
||||
#include "mozilla/Compression.h"
|
||||
#include "mozilla/MemoryReporting.h"
|
||||
#include "mozilla/Pair.h"
|
||||
#include "mozilla/Result.h"
|
||||
#include "mozilla/UniquePtr.h"
|
||||
|
||||
/**
|
||||
|
|
@ -79,58 +75,20 @@ namespace mozilla {
|
|||
|
||||
namespace scache {
|
||||
|
||||
struct StartupCacheEntry {
|
||||
UniquePtr<char[]> mData;
|
||||
uint32_t mOffset;
|
||||
uint32_t mCompressedSize;
|
||||
uint32_t mUncompressedSize;
|
||||
int32_t mHeaderOffsetInFile;
|
||||
int32_t mRequestedOrder;
|
||||
bool mRequested;
|
||||
struct CacheEntry {
|
||||
UniquePtr<char[]> data;
|
||||
uint32_t size;
|
||||
|
||||
MOZ_IMPLICIT StartupCacheEntry(uint32_t aOffset, uint32_t aCompressedSize,
|
||||
uint32_t aUncompressedSize)
|
||||
: mData(nullptr),
|
||||
mOffset(aOffset),
|
||||
mCompressedSize(aCompressedSize),
|
||||
mUncompressedSize(aUncompressedSize),
|
||||
mHeaderOffsetInFile(0),
|
||||
mRequestedOrder(0),
|
||||
mRequested(false) {}
|
||||
CacheEntry() : size(0) {}
|
||||
|
||||
StartupCacheEntry(UniquePtr<char[]> aData, size_t aLength,
|
||||
int32_t aRequestedOrder)
|
||||
: mData(std::move(aData)),
|
||||
mOffset(0),
|
||||
mCompressedSize(0),
|
||||
mUncompressedSize(aLength),
|
||||
mHeaderOffsetInFile(0),
|
||||
mRequestedOrder(0),
|
||||
mRequested(true) {}
|
||||
// Takes possession of buf
|
||||
CacheEntry(UniquePtr<char[]> buf, uint32_t len)
|
||||
: data(std::move(buf)), size(len) {}
|
||||
|
||||
struct Comparator {
|
||||
using Value = Pair<const nsCString*, StartupCacheEntry*>;
|
||||
~CacheEntry() {}
|
||||
|
||||
bool Equals(const Value& a, const Value& b) const {
|
||||
return a.second()->mRequestedOrder == b.second()->mRequestedOrder;
|
||||
}
|
||||
|
||||
bool LessThan(const Value& a, const Value& b) const {
|
||||
return a.second()->mRequestedOrder < b.second()->mRequestedOrder;
|
||||
}
|
||||
};
|
||||
};
|
||||
|
||||
struct nsCStringHasher {
|
||||
using Key = nsCString;
|
||||
using Lookup = nsCString;
|
||||
|
||||
static HashNumber hash(const Lookup& aLookup) {
|
||||
return HashString(aLookup.get());
|
||||
}
|
||||
|
||||
static bool match(const Key& aKey, const Lookup& aLookup) {
|
||||
return aKey.Equals(aLookup);
|
||||
size_t SizeOfIncludingThis(mozilla::MallocSizeOf mallocSizeOf) {
|
||||
return mallocSizeOf(this) + mallocSizeOf(data.get());
|
||||
}
|
||||
};
|
||||
|
||||
|
|
@ -151,11 +109,9 @@ class StartupCache : public nsIMemoryReporter {
|
|||
|
||||
// StartupCache methods. See above comments for a more detailed description.
|
||||
|
||||
// true if the archive has an entry for the buffer or not.
|
||||
bool HasEntry(const char* id);
|
||||
|
||||
// Returns a buffer that was previously stored, caller does not take ownership
|
||||
nsresult GetBuffer(const char* id, const char** outbuf, uint32_t* length);
|
||||
// Returns a buffer that was previously stored, caller takes ownership.
|
||||
nsresult GetBuffer(const char* id, UniquePtr<char[]>* outbuf,
|
||||
uint32_t* length);
|
||||
|
||||
// Stores a buffer. Caller yields ownership.
|
||||
nsresult PutBuffer(const char* id, UniquePtr<char[]>&& inbuf,
|
||||
|
|
@ -179,8 +135,9 @@ class StartupCache : public nsIMemoryReporter {
|
|||
// excludes the mapping.
|
||||
size_t HeapSizeOfIncludingThis(mozilla::MallocSizeOf mallocSizeOf) const;
|
||||
|
||||
bool ShouldCompactCache();
|
||||
nsresult ResetStartupWriteTimerCheckingReadCount();
|
||||
size_t SizeOfMapping();
|
||||
|
||||
// FOR TESTING ONLY
|
||||
nsresult ResetStartupWriteTimer();
|
||||
bool StartupWriteComplete();
|
||||
|
||||
|
|
@ -188,52 +145,30 @@ class StartupCache : public nsIMemoryReporter {
|
|||
StartupCache();
|
||||
virtual ~StartupCache();
|
||||
|
||||
Result<Ok, nsresult> LoadArchive();
|
||||
nsresult LoadArchive();
|
||||
nsresult Init();
|
||||
|
||||
// Returns a file pointer for the cache file with the given name in the
|
||||
// current profile.
|
||||
Result<nsCOMPtr<nsIFile>, nsresult> GetCacheFile(const nsAString& suffix);
|
||||
|
||||
// Opens the cache file for reading.
|
||||
Result<Ok, nsresult> OpenCache();
|
||||
|
||||
// Writes the cache to disk
|
||||
Result<Ok, nsresult> WriteToDisk();
|
||||
|
||||
void WriteToDisk();
|
||||
void WaitOnWriteThread();
|
||||
void WaitOnPrefetchThread();
|
||||
void StartPrefetchMemoryThread();
|
||||
|
||||
static nsresult InitSingleton();
|
||||
static void WriteTimeout(nsITimer* aTimer, void* aClosure);
|
||||
static void ThreadedWrite(void* aClosure);
|
||||
static void ThreadedPrefetch(void* aClosure);
|
||||
|
||||
HashMap<nsCString, StartupCacheEntry, nsCStringHasher> mTable;
|
||||
// owns references to the contents of tables which have been invalidated.
|
||||
// In theory grows forever if the cache is continually filled and then
|
||||
// invalidated, but this should not happen in practice.
|
||||
nsTArray<decltype(mTable)> mOldTables;
|
||||
nsClassHashtable<nsCStringHashKey, CacheEntry> mTable;
|
||||
nsTArray<nsCString> mPendingWrites;
|
||||
RefPtr<nsZipArchive> mArchive;
|
||||
nsCOMPtr<nsIFile> mFile;
|
||||
loader::AutoMemMap mCacheData;
|
||||
|
||||
nsCOMPtr<nsIObserverService> mObserverService;
|
||||
RefPtr<StartupCacheListener> mListener;
|
||||
nsCOMPtr<nsITimer> mTimer;
|
||||
|
||||
Atomic<bool> mDirty;
|
||||
bool mStartupWriteInitiated;
|
||||
bool mCurTableReferenced;
|
||||
uint32_t mRequestedCount;
|
||||
size_t mCacheEntriesBaseOffset;
|
||||
|
||||
static StaticRefPtr<StartupCache> gStartupCache;
|
||||
static bool gShutdownInitiated;
|
||||
static bool gIgnoreDiskCache;
|
||||
PRThread* mWriteThread;
|
||||
PRThread* mPrefetchThread;
|
||||
UniquePtr<Compression::LZ4FrameDecompressionContext> mDecompressionContext;
|
||||
#ifdef DEBUG
|
||||
nsTHashtable<nsISupportsHashKey> mWriteObjectMap;
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -19,12 +19,12 @@
|
|||
namespace mozilla {
|
||||
namespace scache {
|
||||
|
||||
nsresult NewObjectInputStreamFromBuffer(const char* buffer, uint32_t len,
|
||||
nsresult NewObjectInputStreamFromBuffer(UniquePtr<char[]> buffer, uint32_t len,
|
||||
nsIObjectInputStream** stream) {
|
||||
nsCOMPtr<nsIInputStream> stringStream;
|
||||
nsresult rv = NS_NewByteInputStream(getter_AddRefs(stringStream),
|
||||
MakeSpan(buffer, len),
|
||||
NS_ASSIGNMENT_DEPEND);
|
||||
MakeSpan(buffer.release(), len),
|
||||
NS_ASSIGNMENT_ADOPT);
|
||||
MOZ_ALWAYS_SUCCEEDS(rv);
|
||||
|
||||
nsCOMPtr<nsIObjectInputStream> objectInput =
|
||||
|
|
|
|||
|
|
@ -16,7 +16,7 @@ class nsIURI;
|
|||
namespace mozilla {
|
||||
namespace scache {
|
||||
|
||||
nsresult NewObjectInputStreamFromBuffer(const char* buffer, uint32_t len,
|
||||
nsresult NewObjectInputStreamFromBuffer(UniquePtr<char[]> buffer, uint32_t len,
|
||||
nsIObjectInputStream** stream);
|
||||
|
||||
// We can't retrieve the wrapped stream from the objectOutputStream later,
|
||||
|
|
|
|||
|
|
@ -86,7 +86,7 @@ TEST_F(TestStartupCache, StartupWriteRead) {
|
|||
|
||||
const char* buf = "Market opportunities for BeardBook";
|
||||
const char* id = "id";
|
||||
const char* outbuf;
|
||||
UniquePtr<char[]> outbuf;
|
||||
uint32_t len;
|
||||
|
||||
rv = sc->PutBuffer(id, UniquePtr<char[]>(strdup(buf)), strlen(buf) + 1);
|
||||
|
|
@ -94,7 +94,7 @@ TEST_F(TestStartupCache, StartupWriteRead) {
|
|||
|
||||
rv = sc->GetBuffer(id, &outbuf, &len);
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
EXPECT_STREQ(buf, outbuf);
|
||||
EXPECT_STREQ(buf, outbuf.get());
|
||||
|
||||
rv = sc->ResetStartupWriteTimer();
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
|
|
@ -102,14 +102,14 @@ TEST_F(TestStartupCache, StartupWriteRead) {
|
|||
|
||||
rv = sc->GetBuffer(id, &outbuf, &len);
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
EXPECT_STREQ(buf, outbuf);
|
||||
EXPECT_STREQ(buf, outbuf.get());
|
||||
}
|
||||
|
||||
TEST_F(TestStartupCache, WriteInvalidateRead) {
|
||||
nsresult rv;
|
||||
const char* buf = "BeardBook competitive analysis";
|
||||
const char* id = "id";
|
||||
const char* outbuf;
|
||||
UniquePtr<char[]> outbuf;
|
||||
uint32_t len;
|
||||
StartupCache* sc = StartupCache::GetSingleton();
|
||||
ASSERT_TRUE(sc);
|
||||
|
|
@ -168,13 +168,13 @@ TEST_F(TestStartupCache, WriteObject) {
|
|||
rv = sc->PutBuffer(id, std::move(buf), len);
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
|
||||
const char* buf2;
|
||||
UniquePtr<char[]> buf2;
|
||||
uint32_t len2;
|
||||
nsCOMPtr<nsIObjectInputStream> objectInput;
|
||||
rv = sc->GetBuffer(id, &buf2, &len2);
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
|
||||
rv = NewObjectInputStreamFromBuffer(buf2, len2,
|
||||
rv = NewObjectInputStreamFromBuffer(std::move(buf2), len2,
|
||||
getter_AddRefs(objectInput));
|
||||
EXPECT_TRUE(NS_SUCCEEDED(rv));
|
||||
|
||||
|
|
|
|||
|
|
@ -91,7 +91,8 @@ media/openmax_il/
|
|||
media/webrtc/signaling/src/sdp/sipcc/
|
||||
media/webrtc/trunk/
|
||||
mfbt/double-conversion/double-conversion/
|
||||
mfbt/lz4/.*
|
||||
mfbt/lz4.c
|
||||
mfbt/lz4.h
|
||||
mobile/android/geckoview/src/thirdparty/
|
||||
mobile/android/thirdparty/
|
||||
modules/brotli/
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче