mfbt/HashFunctions.cpp

Tue, 06 Jan 2015 21:39:09 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Tue, 06 Jan 2015 21:39:09 +0100
branch
TOR_BUG_9701
changeset 8
97036ab72558
permissions
-rw-r--r--

Conditionally force memory storage according to privacy.thirdparty.isolate;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.

michael@0 1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
michael@0 2 /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0 3 * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0 4 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0 5
michael@0 6 /* Implementations of hash functions. */
michael@0 7
michael@0 8 #include "mozilla/HashFunctions.h"
michael@0 9 #include "mozilla/Types.h"
michael@0 10
michael@0 11 #include <string.h>
michael@0 12
michael@0 13 namespace mozilla {
michael@0 14
michael@0 15 uint32_t
michael@0 16 HashBytes(const void* bytes, size_t length)
michael@0 17 {
michael@0 18 uint32_t hash = 0;
michael@0 19 const char* b = reinterpret_cast<const char*>(bytes);
michael@0 20
michael@0 21 /* Walk word by word. */
michael@0 22 size_t i = 0;
michael@0 23 for (; i < length - (length % sizeof(size_t)); i += sizeof(size_t)) {
michael@0 24 /* Do an explicitly unaligned load of the data. */
michael@0 25 size_t data;
michael@0 26 memcpy(&data, b + i, sizeof(size_t));
michael@0 27
michael@0 28 hash = AddToHash(hash, data, sizeof(data));
michael@0 29 }
michael@0 30
michael@0 31 /* Get the remaining bytes. */
michael@0 32 for (; i < length; i++)
michael@0 33 hash = AddToHash(hash, b[i]);
michael@0 34
michael@0 35 return hash;
michael@0 36 }
michael@0 37
michael@0 38 } /* namespace mozilla */

mercurial