2014-07-11 02:10:17 +00:00
|
|
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
2012-06-04 03:36:43 +00:00
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
2012-05-21 11:12:37 +00:00
|
|
|
* 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/. */
|
2012-03-12 22:53:18 +00:00
|
|
|
|
2012-06-04 03:36:43 +00:00
|
|
|
/* Implementations of hash functions. */
|
2012-03-12 22:53:18 +00:00
|
|
|
|
|
|
|
#include "mozilla/HashFunctions.h"
|
2012-06-11 23:16:46 +00:00
|
|
|
#include "mozilla/Types.h"
|
2012-06-04 03:36:43 +00:00
|
|
|
|
2012-03-12 22:53:18 +00:00
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
namespace mozilla {
|
|
|
|
|
2014-06-13 06:34:08 +00:00
|
|
|
uint32_t HashBytes(const void* aBytes, size_t aLength) {
|
2012-03-12 22:53:18 +00:00
|
|
|
uint32_t hash = 0;
|
2014-06-13 06:34:08 +00:00
|
|
|
const char* b = reinterpret_cast<const char*>(aBytes);
|
2012-03-12 22:53:18 +00:00
|
|
|
|
|
|
|
/* Walk word by word. */
|
|
|
|
size_t i = 0;
|
2014-06-13 06:34:08 +00:00
|
|
|
for (; i < aLength - (aLength % sizeof(size_t)); i += sizeof(size_t)) {
|
2012-03-12 22:53:18 +00:00
|
|
|
/* Do an explicitly unaligned load of the data. */
|
|
|
|
size_t data;
|
|
|
|
memcpy(&data, b + i, sizeof(size_t));
|
|
|
|
|
2021-07-19 21:35:40 +00:00
|
|
|
hash = AddToHash(hash, data);
|
2012-03-12 22:53:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the remaining bytes. */
|
2014-06-13 06:34:08 +00:00
|
|
|
for (; i < aLength; i++) {
|
2012-03-12 22:53:18 +00:00
|
|
|
hash = AddToHash(hash, b[i]);
|
2014-06-13 06:34:08 +00:00
|
|
|
}
|
2012-03-12 22:53:18 +00:00
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
} /* namespace mozilla */
|