VariableLengthPrefixSet.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438
  1. /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
  2. /* This Source Code Form is subject to the terms of the Mozilla Public
  3. * License, v. 2.0. If a copy of the MPL was not distributed with this
  4. * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
  5. #include "VariableLengthPrefixSet.h"
  6. #include "nsUrlClassifierPrefixSet.h"
  7. #include "nsPrintfCString.h"
  8. #include "nsThreadUtils.h"
  9. #include "mozilla/EndianUtils.h"
  10. #include "mozilla/Telemetry.h"
  11. #include "mozilla/Unused.h"
  12. #include <algorithm>
  13. // MOZ_LOG=UrlClassifierPrefixSet:5
  14. static mozilla::LazyLogModule gUrlClassifierPrefixSetLog("UrlClassifierPrefixSet");
  15. #define LOG(args) MOZ_LOG(gUrlClassifierPrefixSetLog, mozilla::LogLevel::Debug, args)
  16. #define LOG_ENABLED() MOZ_LOG_TEST(gUrlClassifierPrefixSetLog, mozilla::LogLevel::Debug)
  17. namespace mozilla {
  18. namespace safebrowsing {
  19. #define PREFIX_SIZE_FIXED 4
  20. NS_IMPL_ISUPPORTS(VariableLengthPrefixSet, nsIMemoryReporter)
  21. // Definition required due to std::max<>()
  22. const uint32_t VariableLengthPrefixSet::MAX_BUFFER_SIZE;
  23. // This class will process prefix size between 4~32. But for 4 bytes prefixes,
  24. // they will be passed to nsUrlClassifierPrefixSet because of better optimization.
  25. VariableLengthPrefixSet::VariableLengthPrefixSet()
  26. : mLock("VariableLengthPrefixSet.mLock")
  27. , mMemoryReportPath()
  28. {
  29. mFixedPrefixSet = new nsUrlClassifierPrefixSet();
  30. }
  31. NS_IMETHODIMP
  32. VariableLengthPrefixSet::Init(const nsACString& aName)
  33. {
  34. mMemoryReportPath =
  35. nsPrintfCString(
  36. "explicit/storage/prefix-set/%s",
  37. (!aName.IsEmpty() ? PromiseFlatCString(aName).get() : "?!")
  38. );
  39. RegisterWeakMemoryReporter(this);
  40. return NS_OK;
  41. }
  42. VariableLengthPrefixSet::~VariableLengthPrefixSet()
  43. {
  44. UnregisterWeakMemoryReporter(this);
  45. }
  46. NS_IMETHODIMP
  47. VariableLengthPrefixSet::SetPrefixes(const PrefixStringMap& aPrefixMap)
  48. {
  49. MutexAutoLock lock(mLock);
  50. // Prefix size should not less than 4-bytes or greater than 32-bytes
  51. for (auto iter = aPrefixMap.ConstIter(); !iter.Done(); iter.Next()) {
  52. if (iter.Key() < PREFIX_SIZE_FIXED ||
  53. iter.Key() > COMPLETE_SIZE) {
  54. return NS_ERROR_FAILURE;
  55. }
  56. }
  57. // Clear old prefixSet before setting new one.
  58. mFixedPrefixSet->SetPrefixes(nullptr, 0);
  59. mVLPrefixSet.Clear();
  60. // 4-bytes prefixes are handled by nsUrlClassifierPrefixSet.
  61. nsCString* prefixes = aPrefixMap.Get(PREFIX_SIZE_FIXED);
  62. if (prefixes) {
  63. NS_ENSURE_TRUE(prefixes->Length() % PREFIX_SIZE_FIXED == 0, NS_ERROR_FAILURE);
  64. uint32_t numPrefixes = prefixes->Length() / PREFIX_SIZE_FIXED;
  65. #if MOZ_BIG_ENDIAN
  66. const uint32_t* arrayPtr = reinterpret_cast<const uint32_t*>(prefixes->BeginReading());
  67. #else
  68. FallibleTArray<uint32_t> array;
  69. // Prefixes are lexicographically-sorted, so the interger array
  70. // passed to nsUrlClassifierPrefixSet should also follow the same order.
  71. // To make sure of that, we convert char array to integer with Big-Endian
  72. // instead of casting to integer directly.
  73. if (!array.SetCapacity(numPrefixes, fallible)) {
  74. return NS_ERROR_OUT_OF_MEMORY;
  75. }
  76. const char* begin = prefixes->BeginReading();
  77. const char* end = prefixes->EndReading();
  78. while (begin != end) {
  79. array.AppendElement(BigEndian::readUint32(begin), fallible);
  80. begin += sizeof(uint32_t);
  81. }
  82. const uint32_t* arrayPtr = array.Elements();
  83. #endif
  84. nsresult rv = mFixedPrefixSet->SetPrefixes(arrayPtr, numPrefixes);
  85. NS_ENSURE_SUCCESS(rv, rv);
  86. }
  87. // 5~32 bytes prefixes are stored in mVLPrefixSet.
  88. for (auto iter = aPrefixMap.ConstIter(); !iter.Done(); iter.Next()) {
  89. // Skip 4bytes prefixes because it is already stored in mFixedPrefixSet.
  90. if (iter.Key() == PREFIX_SIZE_FIXED) {
  91. continue;
  92. }
  93. mVLPrefixSet.Put(iter.Key(), new nsCString(*iter.Data()));
  94. }
  95. return NS_OK;
  96. }
  97. nsresult
  98. VariableLengthPrefixSet::GetPrefixes(PrefixStringMap& aPrefixMap)
  99. {
  100. MutexAutoLock lock(mLock);
  101. // 4-bytes prefixes are handled by nsUrlClassifierPrefixSet.
  102. FallibleTArray<uint32_t> array;
  103. nsresult rv = mFixedPrefixSet->GetPrefixesNative(array);
  104. NS_ENSURE_SUCCESS(rv, rv);
  105. size_t count = array.Length();
  106. if (count) {
  107. nsCString* prefixes = new nsCString();
  108. prefixes->SetLength(PREFIX_SIZE_FIXED * count);
  109. // Writing integer array to character array
  110. uint32_t* begin = reinterpret_cast<uint32_t*>(prefixes->BeginWriting());
  111. for (uint32_t i = 0; i < count; i++) {
  112. begin[i] = NativeEndian::swapToBigEndian(array[i]);
  113. }
  114. aPrefixMap.Put(PREFIX_SIZE_FIXED, prefixes);
  115. }
  116. // Copy variable-length prefix set
  117. for (auto iter = mVLPrefixSet.ConstIter(); !iter.Done(); iter.Next()) {
  118. aPrefixMap.Put(iter.Key(), new nsCString(*iter.Data()));
  119. }
  120. return NS_OK;
  121. }
  122. // It should never be the case that more than one hash prefixes match a given
  123. // full hash. However, if that happens, this method returns any one of them.
  124. // It does not guarantee which one of those will be returned.
  125. NS_IMETHODIMP
  126. VariableLengthPrefixSet::Matches(const nsACString& aFullHash, uint32_t* aLength)
  127. {
  128. MutexAutoLock lock(mLock);
  129. // Only allow full-length hash to check if match any of the prefix
  130. MOZ_ASSERT(aFullHash.Length() == COMPLETE_SIZE);
  131. NS_ENSURE_ARG_POINTER(aLength);
  132. *aLength = 0;
  133. // Check if it matches 4-bytes prefixSet first
  134. const uint32_t* hash = reinterpret_cast<const uint32_t*>(aFullHash.BeginReading());
  135. uint32_t value = BigEndian::readUint32(hash);
  136. bool found = false;
  137. nsresult rv = mFixedPrefixSet->Contains(value, &found);
  138. NS_ENSURE_SUCCESS(rv, rv);
  139. if (found) {
  140. *aLength = PREFIX_SIZE_FIXED;
  141. return NS_OK;
  142. }
  143. for (auto iter = mVLPrefixSet.ConstIter(); !iter.Done(); iter.Next()) {
  144. if (BinarySearch(aFullHash, *iter.Data(), iter.Key())) {
  145. *aLength = iter.Key();
  146. return NS_OK;
  147. }
  148. }
  149. return NS_OK;
  150. }
  151. NS_IMETHODIMP
  152. VariableLengthPrefixSet::IsEmpty(bool* aEmpty)
  153. {
  154. MutexAutoLock lock(mLock);
  155. NS_ENSURE_ARG_POINTER(aEmpty);
  156. mFixedPrefixSet->IsEmpty(aEmpty);
  157. *aEmpty = *aEmpty && mVLPrefixSet.IsEmpty();
  158. return NS_OK;
  159. }
  160. NS_IMETHODIMP
  161. VariableLengthPrefixSet::LoadFromFile(nsIFile* aFile)
  162. {
  163. MutexAutoLock lock(mLock);
  164. NS_ENSURE_ARG_POINTER(aFile);
  165. nsCOMPtr<nsIInputStream> localInFile;
  166. nsresult rv = NS_NewLocalFileInputStream(getter_AddRefs(localInFile), aFile,
  167. PR_RDONLY | nsIFile::OS_READAHEAD);
  168. NS_ENSURE_SUCCESS(rv, rv);
  169. // Calculate how big the file is, make sure our read buffer isn't bigger
  170. // than the file itself which is just wasting memory.
  171. int64_t fileSize;
  172. rv = aFile->GetFileSize(&fileSize);
  173. NS_ENSURE_SUCCESS(rv, rv);
  174. if (fileSize < 0 || fileSize > UINT32_MAX) {
  175. return NS_ERROR_FAILURE;
  176. }
  177. uint32_t bufferSize = std::min<uint32_t>(static_cast<uint32_t>(fileSize),
  178. MAX_BUFFER_SIZE);
  179. // Convert to buffered stream
  180. nsCOMPtr<nsIInputStream> in = NS_BufferInputStream(localInFile, bufferSize);
  181. rv = mFixedPrefixSet->LoadPrefixes(in);
  182. NS_ENSURE_SUCCESS(rv, rv);
  183. rv = LoadPrefixes(in);
  184. NS_ENSURE_SUCCESS(rv, rv);
  185. return NS_OK;;
  186. }
  187. NS_IMETHODIMP
  188. VariableLengthPrefixSet::StoreToFile(nsIFile* aFile)
  189. {
  190. NS_ENSURE_ARG_POINTER(aFile);
  191. MutexAutoLock lock(mLock);
  192. nsCOMPtr<nsIOutputStream> localOutFile;
  193. nsresult rv = NS_NewLocalFileOutputStream(getter_AddRefs(localOutFile), aFile,
  194. PR_WRONLY | PR_TRUNCATE | PR_CREATE_FILE);
  195. NS_ENSURE_SUCCESS(rv, rv);
  196. uint32_t fileSize = 0;
  197. // Preallocate the file storage
  198. nsCOMPtr<nsIFileOutputStream> fos(do_QueryInterface(localOutFile));
  199. fileSize += mFixedPrefixSet->CalculatePreallocateSize();
  200. fileSize += CalculatePreallocateSize();
  201. Unused << fos->Preallocate(fileSize);
  202. // Convert to buffered stream
  203. nsCOMPtr<nsIOutputStream> out =
  204. NS_BufferOutputStream(localOutFile, std::min(fileSize, MAX_BUFFER_SIZE));
  205. rv = mFixedPrefixSet->WritePrefixes(out);
  206. NS_ENSURE_SUCCESS(rv, rv);
  207. rv = WritePrefixes(out);
  208. NS_ENSURE_SUCCESS(rv, rv);
  209. return NS_OK;
  210. }
  211. nsresult
  212. VariableLengthPrefixSet::LoadPrefixes(nsIInputStream* in)
  213. {
  214. uint32_t magic;
  215. uint32_t read;
  216. nsresult rv = in->Read(reinterpret_cast<char*>(&magic), sizeof(uint32_t), &read);
  217. NS_ENSURE_SUCCESS(rv, rv);
  218. NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FAILURE);
  219. if (magic != PREFIXSET_VERSION_MAGIC) {
  220. LOG(("Version magic mismatch, not loading"));
  221. return NS_ERROR_FILE_CORRUPTED;
  222. }
  223. mVLPrefixSet.Clear();
  224. uint32_t count;
  225. rv = in->Read(reinterpret_cast<char*>(&count), sizeof(uint32_t), &read);
  226. NS_ENSURE_SUCCESS(rv, rv);
  227. NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FAILURE);
  228. for(;count > 0; count--) {
  229. uint8_t prefixSize;
  230. rv = in->Read(reinterpret_cast<char*>(&prefixSize), sizeof(uint8_t), &read);
  231. NS_ENSURE_SUCCESS(rv, rv);
  232. NS_ENSURE_TRUE(read == sizeof(uint8_t), NS_ERROR_FAILURE);
  233. uint32_t stringLength;
  234. rv = in->Read(reinterpret_cast<char*>(&stringLength), sizeof(uint32_t), &read);
  235. NS_ENSURE_SUCCESS(rv, rv);
  236. NS_ENSURE_TRUE(read == sizeof(uint32_t), NS_ERROR_FAILURE);
  237. nsCString* vlPrefixes = new nsCString();
  238. if (!vlPrefixes->SetLength(stringLength, fallible)) {
  239. return NS_ERROR_OUT_OF_MEMORY;
  240. }
  241. rv = in->Read(reinterpret_cast<char*>(vlPrefixes->BeginWriting()), stringLength, &read);
  242. NS_ENSURE_SUCCESS(rv, rv);
  243. NS_ENSURE_TRUE(read == stringLength, NS_ERROR_FAILURE);
  244. mVLPrefixSet.Put(prefixSize, vlPrefixes);
  245. }
  246. return NS_OK;
  247. }
  248. uint32_t
  249. VariableLengthPrefixSet::CalculatePreallocateSize()
  250. {
  251. uint32_t fileSize = 0;
  252. // Store how many prefix string.
  253. fileSize += sizeof(uint32_t);
  254. for (auto iter = mVLPrefixSet.ConstIter(); !iter.Done(); iter.Next()) {
  255. // Store prefix size, prefix string length, and prefix string.
  256. fileSize += sizeof(uint8_t);
  257. fileSize += sizeof(uint32_t);
  258. fileSize += iter.Data()->Length();
  259. }
  260. return fileSize;
  261. }
  262. nsresult
  263. VariableLengthPrefixSet::WritePrefixes(nsIOutputStream* out)
  264. {
  265. uint32_t written;
  266. uint32_t writelen = sizeof(uint32_t);
  267. uint32_t magic = PREFIXSET_VERSION_MAGIC;
  268. nsresult rv = out->Write(reinterpret_cast<char*>(&magic), writelen, &written);
  269. NS_ENSURE_SUCCESS(rv, rv);
  270. NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE);
  271. uint32_t count = mVLPrefixSet.Count();
  272. rv = out->Write(reinterpret_cast<char*>(&count), writelen, &written);
  273. NS_ENSURE_SUCCESS(rv, rv);
  274. NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE);
  275. // Store PrefixSize, Length of Prefix String and then Prefix String
  276. for (auto iter = mVLPrefixSet.ConstIter(); !iter.Done(); iter.Next()) {
  277. const nsCString& vlPrefixes = *iter.Data();
  278. uint8_t prefixSize = iter.Key();
  279. writelen = sizeof(uint8_t);
  280. rv = out->Write(reinterpret_cast<char*>(&prefixSize), writelen, &written);
  281. NS_ENSURE_SUCCESS(rv, rv);
  282. NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE);
  283. uint32_t stringLength = vlPrefixes.Length();
  284. writelen = sizeof(uint32_t);
  285. rv = out->Write(reinterpret_cast<char*>(&stringLength), writelen, &written);
  286. NS_ENSURE_SUCCESS(rv, rv);
  287. NS_ENSURE_TRUE(written == writelen, NS_ERROR_FAILURE);
  288. rv = out->Write(const_cast<char*>(vlPrefixes.BeginReading()),
  289. stringLength, &written);
  290. NS_ENSURE_SUCCESS(rv, rv);
  291. NS_ENSURE_TRUE(stringLength == written, NS_ERROR_FAILURE);
  292. }
  293. return NS_OK;
  294. }
  295. bool
  296. VariableLengthPrefixSet::BinarySearch(const nsACString& aFullHash,
  297. const nsACString& aPrefixes,
  298. uint32_t aPrefixSize)
  299. {
  300. const char* fullhash = aFullHash.BeginReading();
  301. const char* prefixes = aPrefixes.BeginReading();
  302. int32_t begin = 0, end = aPrefixes.Length() / aPrefixSize;
  303. while (end > begin) {
  304. int32_t mid = (begin + end) >> 1;
  305. int cmp = memcmp(fullhash, prefixes + mid*aPrefixSize, aPrefixSize);
  306. if (cmp < 0) {
  307. end = mid;
  308. } else if (cmp > 0) {
  309. begin = mid + 1;
  310. } else {
  311. return true;
  312. }
  313. }
  314. return false;
  315. }
  316. MOZ_DEFINE_MALLOC_SIZE_OF(UrlClassifierMallocSizeOf)
  317. NS_IMETHODIMP
  318. VariableLengthPrefixSet::CollectReports(nsIHandleReportCallback* aHandleReport,
  319. nsISupports* aData, bool aAnonymize)
  320. {
  321. MOZ_ASSERT(NS_IsMainThread());
  322. size_t amount = SizeOfIncludingThis(UrlClassifierMallocSizeOf);
  323. return aHandleReport->Callback(
  324. EmptyCString(), mMemoryReportPath, KIND_HEAP, UNITS_BYTES, amount,
  325. NS_LITERAL_CSTRING("Memory used by the variable-length prefix set for a URL classifier."),
  326. aData);
  327. }
  328. size_t
  329. VariableLengthPrefixSet::SizeOfIncludingThis(mozilla::MallocSizeOf aMallocSizeOf)
  330. {
  331. MutexAutoLock lock(mLock);
  332. size_t n = 0;
  333. n += aMallocSizeOf(this);
  334. n += mFixedPrefixSet->SizeOfIncludingThis(moz_malloc_size_of) - aMallocSizeOf(mFixedPrefixSet);
  335. n += mVLPrefixSet.ShallowSizeOfExcludingThis(aMallocSizeOf);
  336. for (auto iter = mVLPrefixSet.ConstIter(); !iter.Done(); iter.Next()) {
  337. n += iter.Data()->SizeOfExcludingThisIfUnshared(aMallocSizeOf);
  338. }
  339. return n;
  340. }
  341. } // namespace safebrowsing
  342. } // namespace mozilla