2009-07-08 13:19:16 -07:00
|
|
|
/*
|
2012-05-02 15:21:36 -07:00
|
|
|
* Copyright (c) 2008, 2009, 2010, 2012 Nicira, Inc.
|
2009-07-08 13:19:16 -07:00
|
|
|
*
|
2009-06-15 15:11:30 -07:00
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at:
|
2009-07-08 13:19:16 -07:00
|
|
|
*
|
2009-06-15 15:11:30 -07:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
2009-07-08 13:19:16 -07:00
|
|
|
*/
|
|
|
|
#include <config.h>
|
|
|
|
#include "hash.h"
|
|
|
|
#include <string.h>
|
2012-04-09 14:33:33 -07:00
|
|
|
#include "unaligned.h"
|
2009-07-08 13:19:16 -07:00
|
|
|
|
|
|
|
/* Returns the hash of the 'n' 32-bit words at 'p', starting from 'basis'.
|
|
|
|
* 'p' must be properly aligned. */
|
|
|
|
uint32_t
|
|
|
|
hash_words(const uint32_t *p, size_t n, uint32_t basis)
|
|
|
|
{
|
|
|
|
uint32_t a, b, c;
|
|
|
|
|
|
|
|
a = b = c = 0xdeadbeef + (((uint32_t) n) << 2) + basis;
|
|
|
|
|
|
|
|
while (n > 3) {
|
|
|
|
a += p[0];
|
|
|
|
b += p[1];
|
|
|
|
c += p[2];
|
2012-01-18 11:29:57 -08:00
|
|
|
hash_mix(&a, &b, &c);
|
2009-07-08 13:19:16 -07:00
|
|
|
n -= 3;
|
|
|
|
p += 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (n) {
|
|
|
|
case 3:
|
|
|
|
c += p[2];
|
|
|
|
/* fall through */
|
|
|
|
case 2:
|
|
|
|
b += p[1];
|
|
|
|
/* fall through */
|
|
|
|
case 1:
|
|
|
|
a += p[0];
|
2012-01-18 11:29:57 -08:00
|
|
|
hash_final(&a, &b, &c);
|
2009-07-08 13:19:16 -07:00
|
|
|
/* fall through */
|
|
|
|
case 0:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2010-12-16 13:53:29 -08:00
|
|
|
/* Returns the hash of 'a', 'b', and 'c'. */
|
2009-10-14 17:03:55 -07:00
|
|
|
uint32_t
|
2010-12-16 13:53:29 -08:00
|
|
|
hash_3words(uint32_t a, uint32_t b, uint32_t c)
|
2009-10-14 17:03:55 -07:00
|
|
|
{
|
2010-12-16 13:53:29 -08:00
|
|
|
a += 0xdeadbeef;
|
|
|
|
b += 0xdeadbeef;
|
|
|
|
c += 0xdeadbeef;
|
2012-01-18 11:29:57 -08:00
|
|
|
hash_final(&a, &b, &c);
|
2009-10-14 17:03:55 -07:00
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2010-12-16 13:53:29 -08:00
|
|
|
/* Returns the hash of 'a' and 'b'. */
|
|
|
|
uint32_t
|
|
|
|
hash_2words(uint32_t a, uint32_t b)
|
|
|
|
{
|
|
|
|
return hash_3words(a, b, 0);
|
|
|
|
}
|
|
|
|
|
2009-07-08 13:19:16 -07:00
|
|
|
/* Returns the hash of the 'n' bytes at 'p', starting from 'basis'. */
|
|
|
|
uint32_t
|
|
|
|
hash_bytes(const void *p_, size_t n, uint32_t basis)
|
|
|
|
{
|
|
|
|
const uint8_t *p = p_;
|
|
|
|
uint32_t a, b, c;
|
|
|
|
|
|
|
|
a = b = c = 0xdeadbeef + n + basis;
|
|
|
|
|
2012-04-09 14:33:33 -07:00
|
|
|
while (n >= 12) {
|
|
|
|
a += get_unaligned_u32((uint32_t *) p);
|
|
|
|
b += get_unaligned_u32((uint32_t *) (p + 4));
|
|
|
|
c += get_unaligned_u32((uint32_t *) (p + 8));
|
2012-01-18 11:29:57 -08:00
|
|
|
hash_mix(&a, &b, &c);
|
2012-04-09 14:33:33 -07:00
|
|
|
n -= 12;
|
|
|
|
p += 12;
|
2009-07-08 13:19:16 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
if (n) {
|
2012-04-09 14:33:33 -07:00
|
|
|
uint32_t tmp[3];
|
|
|
|
|
2009-07-08 13:19:16 -07:00
|
|
|
tmp[0] = tmp[1] = tmp[2] = 0;
|
|
|
|
memcpy(tmp, p, n);
|
|
|
|
a += tmp[0];
|
|
|
|
b += tmp[1];
|
|
|
|
c += tmp[2];
|
2012-01-18 11:29:57 -08:00
|
|
|
hash_final(&a, &b, &c);
|
2009-07-08 13:19:16 -07:00
|
|
|
}
|
|
|
|
|
|
|
|
return c;
|
|
|
|
}
|