2 * Copyright (c) 2008, 2009 Nicira Networks.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
20 /* Returns the hash of the 'n' 32-bit words at 'p', starting from 'basis'.
21 * 'p' must be properly aligned. */
23 hash_words(const uint32_t *p, size_t n, uint32_t basis)
27 a = b = c = 0xdeadbeef + (((uint32_t) n) << 2) + basis;
55 /* Returns the hash of the pair of aligned 32-bit words at 'p', starting from
58 hash_2words(const uint32_t *p, uint32_t basis)
62 a = b = c = 0xdeadbeef + (2 << 2) + basis;
70 /* Returns the hash of the 'n' bytes at 'p', starting from 'basis'. */
72 hash_bytes(const void *p_, size_t n, uint32_t basis)
74 const uint8_t *p = p_;
78 a = b = c = 0xdeadbeef + n + basis;
80 while (n >= sizeof tmp) {
81 memcpy(tmp, p, sizeof tmp);
91 tmp[0] = tmp[1] = tmp[2] = 0;