/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* vim: set ts=8 sts=2 et sw=2 tw=80: */ /* 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/. */ #include "nsCOMPtr.h" #include "nsDebug.h" #include "nsPrintfCString.h" #include "nsTArray.h" #include "nsString.h" #include "nsUrlClassifierPrefixSet.h" #include "nsIUrlClassifierPrefixSet.h" #include "nsIFile.h" #include "nsToolkitCompsCID.h" #include "nsTArray.h" #include "nsThreadUtils.h" #include "mozilla/MemoryReporting.h" #include "mozilla/Telemetry.h" #include "mozilla/FileUtils.h" #include "mozilla/Logging.h" using namespace mozilla; // NSPR_LOG_MODULES=UrlClassifierPrefixSet:5 static const PRLogModuleInfo *gUrlClassifierPrefixSetLog = nullptr; #define LOG(args) MOZ_LOG(gUrlClassifierPrefixSetLog, mozilla::LogLevel::Debug, args) #define LOG_ENABLED() MOZ_LOG_TEST(gUrlClassifierPrefixSetLog, mozilla::LogLevel::Debug) NS_IMPL_ISUPPORTS( nsUrlClassifierPrefixSet, nsIUrlClassifierPrefixSet, nsIMemoryReporter) MOZ_DEFINE_MALLOC_SIZE_OF(UrlClassifierMallocSizeOf) nsUrlClassifierPrefixSet::nsUrlClassifierPrefixSet() : mTotalPrefixes(0) , mMemoryInUse(0) , mMemoryReportPath() { if (!gUrlClassifierPrefixSetLog) gUrlClassifierPrefixSetLog = PR_NewLogModule("UrlClassifierPrefixSet"); } NS_IMETHODIMP nsUrlClassifierPrefixSet::Init(const nsACString& aName) { mMemoryReportPath = nsPrintfCString( "explicit/storage/prefix-set/%s", (!aName.IsEmpty() ? PromiseFlatCString(aName).get() : "?!") ); RegisterWeakMemoryReporter(this); return NS_OK; } nsUrlClassifierPrefixSet::~nsUrlClassifierPrefixSet() { UnregisterWeakMemoryReporter(this); } NS_IMETHODIMP nsUrlClassifierPrefixSet::SetPrefixes(const uint32_t* aArray, uint32_t aLength) { nsresult rv = NS_OK; if (aLength <= 0) { if (mIndexPrefixes.Length() > 0) { LOG(("Clearing PrefixSet")); mIndexDeltas.Clear(); mIndexPrefixes.Clear(); mTotalPrefixes = 0; } } else { rv = MakePrefixSet(aArray, aLength); } mMemoryInUse = SizeOfIncludingThis(UrlClassifierMallocSizeOf); return rv; } nsresult nsUrlClassifierPrefixSet::MakePrefixSet(const uint32_t* aPrefixes, uint32_t aLength) { if (aLength == 0) { return NS_OK; } #ifdef DEBUG for (uint32_t i = 1; i < aLength; i++) { MOZ_ASSERT(aPrefixes[i] >= aPrefixes[i-1]); } #endif mIndexPrefixes.Clear(); mIndexDeltas.Clear(); mTotalPrefixes = aLength; mIndexPrefixes.AppendElement(aPrefixes[0]); mIndexDeltas.AppendElement(); uint32_t numOfDeltas = 0; uint32_t totalDeltas = 0; uint32_t currentItem = aPrefixes[0]; for (uint32_t i = 1; i < aLength; i++) { if ((numOfDeltas >= DELTAS_LIMIT) || (aPrefixes[i] - currentItem >= MAX_INDEX_DIFF)) { mIndexDeltas.AppendElement(); mIndexDeltas[mIndexDeltas.Length() - 1].Compact(); mIndexPrefixes.AppendElement(aPrefixes[i]); numOfDeltas = 0; } else { uint16_t delta = aPrefixes[i] - currentItem; mIndexDeltas[mIndexDeltas.Length() - 1].AppendElement(delta); numOfDeltas++; totalDeltas++; } currentItem = aPrefixes[i]; } mIndexPrefixes.Compact(); mIndexDeltas.Compact(); LOG(("Total number of indices: %d", aLength)); LOG(("Total number of deltas: %d", totalDeltas)); LOG(("Total number of delta chunks: %d", mIndexDeltas.Length())); return NS_OK; } nsresult nsUrlClassifierPrefixSet::GetPrefixesNative(FallibleTArray& outArray) { if (!outArray.SetLength(mTotalPrefixes, fallible)) { return NS_ERROR_OUT_OF_MEMORY; } uint32_t prefixIdxLength = mIndexPrefixes.Length(); uint32_t prefixCnt = 0; for (uint32_t i = 0; i < prefixIdxLength; i++) { uint32_t prefix = mIndexPrefixes[i]; outArray[prefixCnt++] = prefix; for (uint32_t j = 0; j < mIndexDeltas[i].Length(); j++) { prefix += mIndexDeltas[i][j]; outArray[prefixCnt++] = prefix; } } NS_ASSERTION(mTotalPrefixes == prefixCnt, "Lengths are inconsistent"); return NS_OK; } NS_IMETHODIMP nsUrlClassifierPrefixSet::GetPrefixes(uint32_t* aCount, uint32_t** aPrefixes) { NS_ENSURE_ARG_POINTER(aCount); *aCount = 0; NS_ENSURE_ARG_POINTER(aPrefixes); *aPrefixes = nullptr; FallibleTArray prefixes; nsresult rv = GetPrefixesNative(prefixes); if (NS_FAILED(rv)) { return rv; } uint64_t itemCount = prefixes.Length(); uint32_t* prefixArray = static_cast(moz_xmalloc(itemCount * sizeof(uint32_t))); NS_ENSURE_TRUE(prefixArray, NS_ERROR_OUT_OF_MEMORY); memcpy(prefixArray, prefixes.Elements(), sizeof(uint32_t) * itemCount); *aCount = itemCount; *aPrefixes = prefixArray; return NS_OK; } uint32_t nsUrlClassifierPrefixSet::BinSearch(uint32_t start, uint32_t end, uint32_t target) { while (start != end && end >= start) { uint32_t i = start + ((end - start) >> 1); uint32_t value = mIndexPrefixes[i]; if (value < target) { start = i + 1; } else if (value > target) { end = i - 1; } else { return i; } } return end; } NS_IMETHODIMP nsUrlClassifierPrefixSet::Contains(uint32_t aPrefix, bool* aFound) { *aFound = false; if (mIndexPrefixes.Length() == 0) { return NS_OK; } uint32_t target = aPrefix; // We want to do a "Price is Right" binary search, that is, we want to find // the index of the value either equal to the target or the closest value // that is less than the target. // if (target < mIndexPrefixes[0]) { return NS_OK; } // |binsearch| does not necessarily return the correct index (when the // target is not found) but rather it returns an index at least one away // from the correct index. // Because of this, we need to check if the target lies before the beginning // of the indices. uint32_t i = BinSearch(0, mIndexPrefixes.Length() - 1, target); if (mIndexPrefixes[i] > target && i > 0) { i--; } // Now search through the deltas for the target. uint32_t diff = target - mIndexPrefixes[i]; uint32_t deltaSize = mIndexDeltas[i].Length(); uint32_t deltaIndex = 0; while (diff > 0 && deltaIndex < deltaSize) { diff -= mIndexDeltas[i][deltaIndex]; deltaIndex++; } if (diff == 0) { *aFound = true; } return NS_OK; } NS_IMETHODIMP nsUrlClassifierPrefixSet::CollectReports(nsIHandleReportCallback* aHandleReport, nsISupports* aData, bool aAnonymize) { return aHandleReport->Callback( EmptyCString(), mMemoryReportPath, KIND_HEAP, UNITS_BYTES, mMemoryInUse, NS_LITERAL_CSTRING("Memory used by the prefix set for a URL classifier."), aData); } size_t nsUrlClassifierPrefixSet::SizeOfIncludingThis(mozilla::MallocSizeOf aMallocSizeOf) { size_t n = 0; n += aMallocSizeOf(this); n += mIndexDeltas.ShallowSizeOfExcludingThis(aMallocSizeOf); for (uint32_t i = 0; i < mIndexDeltas.Length(); i++) { n += mIndexDeltas[i].ShallowSizeOfExcludingThis(aMallocSizeOf); } n += mIndexPrefixes.ShallowSizeOfExcludingThis(aMallocSizeOf); return n; } NS_IMETHODIMP nsUrlClassifierPrefixSet::IsEmpty(bool * aEmpty) { *aEmpty = (mIndexPrefixes.Length() == 0); return NS_OK; } nsresult nsUrlClassifierPrefixSet::LoadFromFd(AutoFDClose& fileFd) { uint32_t magic; int32_t read; read = PR_Read(fileFd, &magic, sizeof(uint32_t)); NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FAILURE); if (magic == PREFIXSET_VERSION_MAGIC) { uint32_t indexSize; uint32_t deltaSize; read = PR_Read(fileFd, &indexSize, sizeof(uint32_t)); NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FILE_CORRUPTED); read = PR_Read(fileFd, &deltaSize, sizeof(uint32_t)); NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FILE_CORRUPTED); if (indexSize == 0) { LOG(("stored PrefixSet is empty!")); return NS_OK; } if (deltaSize > (indexSize * DELTAS_LIMIT)) { return NS_ERROR_FILE_CORRUPTED; } nsTArray indexStarts; indexStarts.SetLength(indexSize); mIndexPrefixes.SetLength(indexSize); mIndexDeltas.SetLength(indexSize); mTotalPrefixes = indexSize; int32_t toRead = indexSize*sizeof(uint32_t); read = PR_Read(fileFd, mIndexPrefixes.Elements(), toRead); NS_ENSURE_TRUE(read == toRead, NS_ERROR_FILE_CORRUPTED); read = PR_Read(fileFd, indexStarts.Elements(), toRead); NS_ENSURE_TRUE(read == toRead, NS_ERROR_FILE_CORRUPTED); if (indexSize != 0 && indexStarts[0] != 0) { return NS_ERROR_FILE_CORRUPTED; } for (uint32_t i = 0; i < indexSize; i++) { uint32_t numInDelta = i == indexSize - 1 ? deltaSize - indexStarts[i] : indexStarts[i + 1] - indexStarts[i]; if (numInDelta > DELTAS_LIMIT) { return NS_ERROR_FILE_CORRUPTED; } if (numInDelta > 0) { mIndexDeltas[i].SetLength(numInDelta); mTotalPrefixes += numInDelta; toRead = numInDelta * sizeof(uint16_t); read = PR_Read(fileFd, mIndexDeltas[i].Elements(), toRead); NS_ENSURE_TRUE(read == toRead, NS_ERROR_FILE_CORRUPTED); } } } else { LOG(("Version magic mismatch, not loading")); return NS_ERROR_FILE_CORRUPTED; } MOZ_ASSERT(mIndexPrefixes.Length() == mIndexDeltas.Length()); LOG(("Loading PrefixSet successful")); return NS_OK; } NS_IMETHODIMP nsUrlClassifierPrefixSet::LoadFromFile(nsIFile* aFile) { Telemetry::AutoTimer timer; nsresult rv; AutoFDClose fileFd; rv = aFile->OpenNSPRFileDesc(PR_RDONLY | nsIFile::OS_READAHEAD, 0, &fileFd.rwget()); if (!NS_FAILED(rv)) { rv = LoadFromFd(fileFd); mMemoryInUse = SizeOfIncludingThis(UrlClassifierMallocSizeOf); } return rv; } nsresult nsUrlClassifierPrefixSet::StoreToFd(AutoFDClose& fileFd) { { Telemetry::AutoTimer timer; int64_t size = 4 * sizeof(uint32_t); uint32_t deltas = mTotalPrefixes - mIndexPrefixes.Length(); size += 2 * mIndexPrefixes.Length() * sizeof(uint32_t); size += deltas * sizeof(uint16_t); mozilla::fallocate(fileFd, size); } int32_t written; int32_t writelen = sizeof(uint32_t); uint32_t magic = PREFIXSET_VERSION_MAGIC; written = PR_Write(fileFd, &magic, writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); uint32_t indexSize = mIndexPrefixes.Length(); uint32_t indexDeltaSize = mIndexDeltas.Length(); uint32_t totalDeltas = 0; // Store the shape of mIndexDeltas by noting at which "count" of total // indexes a new subarray starts. This is slightly cumbersome but keeps // file format compatibility. // If we ever update the format, we can gain space by storing the delta // subarray sizes, which fit in bytes. nsTArray indexStarts; indexStarts.AppendElement(0); for (uint32_t i = 0; i < indexDeltaSize; i++) { uint32_t deltaLength = mIndexDeltas[i].Length(); totalDeltas += deltaLength; indexStarts.AppendElement(totalDeltas); } written = PR_Write(fileFd, &indexSize, writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); written = PR_Write(fileFd, &totalDeltas, writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); writelen = indexSize * sizeof(uint32_t); written = PR_Write(fileFd, mIndexPrefixes.Elements(), writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); written = PR_Write(fileFd, indexStarts.Elements(), writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); if (totalDeltas > 0) { for (uint32_t i = 0; i < indexDeltaSize; i++) { writelen = mIndexDeltas[i].Length() * sizeof(uint16_t); written = PR_Write(fileFd, mIndexDeltas[i].Elements(), writelen); NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE); } } LOG(("Saving PrefixSet successful\n")); return NS_OK; } NS_IMETHODIMP nsUrlClassifierPrefixSet::StoreToFile(nsIFile* aFile) { AutoFDClose fileFd; nsresult rv = aFile->OpenNSPRFileDesc(PR_RDWR | PR_TRUNCATE | PR_CREATE_FILE, 0644, &fileFd.rwget()); NS_ENSURE_SUCCESS(rv, rv); return StoreToFd(fileFd); }