2017-05-25 21:32:40 +03:00
|
|
|
// Copyright (c) 2011 Google, Inc.
|
|
|
|
//
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
|
|
// in the Software without restriction, including without limitation the rights
|
|
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
|
|
// furnished to do so, subject to the following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included in
|
|
|
|
// all copies or substantial portions of the Software.
|
|
|
|
//
|
|
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
// THE SOFTWARE.
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 2017 by Delphix. All rights reserved.
|
|
|
|
*/
|
|
|
|
|
2020-03-27 19:11:22 +03:00
|
|
|
#include <cityhash.h>
|
2017-05-25 21:32:40 +03:00
|
|
|
|
|
|
|
#define HASH_K1 0xb492b66fbe98f273ULL
|
|
|
|
#define HASH_K2 0x9ae16a3b2f90404fULL
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Bitwise right rotate. Normally this will compile to a single
|
|
|
|
* instruction.
|
|
|
|
*/
|
|
|
|
static inline uint64_t
|
|
|
|
rotate(uint64_t val, int shift)
|
|
|
|
{
|
|
|
|
// Avoid shifting by 64: doing so yields an undefined result.
|
|
|
|
return (shift == 0 ? val : (val >> shift) | (val << (64 - shift)));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline uint64_t
|
|
|
|
cityhash_helper(uint64_t u, uint64_t v, uint64_t mul)
|
|
|
|
{
|
|
|
|
uint64_t a = (u ^ v) * mul;
|
|
|
|
a ^= (a >> 47);
|
|
|
|
uint64_t b = (v ^ a) * mul;
|
|
|
|
b ^= (b >> 47);
|
|
|
|
b *= mul;
|
|
|
|
return (b);
|
|
|
|
}
|
|
|
|
|
zcommon: add specialized versions of cityhash4
Specializing cityhash4 on 32-bit architectures can reduce the size
of stack frames as well as instruction count. This is a tiny but
useful optimization, since some callers invoke it frequently.
When specializing into 1/2/3/4-arg versions, the stack usage
(in bytes) on some 32-bit arches are listed as follows:
- x86: 32, 32, 32, 40
- arm-v7a: 20, 20, 28, 36
- riscv: 0, 0, 0, 16
- power: 16, 16, 16, 32
- mipsel: 8, 8, 8, 24
And each actual argument (even if passing 0) contributes evenly
to the number of multiplication instructions generated:
- x86: 9, 12, 15 ,18
- arm-v7a: 6, 8, 10, 12
- riscv / power: 12, 18, 20, 24
- mipsel: 9, 12, 15, 19
On 64-bit architectures, the tendencies are similar. But both stack
sizes and instruction counts are significantly smaller thus negligible.
Reviewed by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Alexander Motin <mav@FreeBSD.org>
Reviewed-by: Tino Reichardt <milky-zfs@mcmilk.de>
Signed-off-by: Shengqi Chen <harry-chen@outlook.com>
Closes #16131
Closes #16483
2024-09-07 16:55:03 +03:00
|
|
|
static inline uint64_t
|
|
|
|
cityhash_impl(uint64_t w1, uint64_t w2, uint64_t w3, uint64_t w4)
|
2017-05-25 21:32:40 +03:00
|
|
|
{
|
|
|
|
uint64_t mul = HASH_K2 + 64;
|
|
|
|
uint64_t a = w1 * HASH_K1;
|
|
|
|
uint64_t b = w2;
|
|
|
|
uint64_t c = w4 * mul;
|
|
|
|
uint64_t d = w3 * HASH_K2;
|
|
|
|
return (cityhash_helper(rotate(a + b, 43) + rotate(c, 30) + d,
|
|
|
|
a + rotate(b + HASH_K2, 18) + c, mul));
|
zcommon: add specialized versions of cityhash4
Specializing cityhash4 on 32-bit architectures can reduce the size
of stack frames as well as instruction count. This is a tiny but
useful optimization, since some callers invoke it frequently.
When specializing into 1/2/3/4-arg versions, the stack usage
(in bytes) on some 32-bit arches are listed as follows:
- x86: 32, 32, 32, 40
- arm-v7a: 20, 20, 28, 36
- riscv: 0, 0, 0, 16
- power: 16, 16, 16, 32
- mipsel: 8, 8, 8, 24
And each actual argument (even if passing 0) contributes evenly
to the number of multiplication instructions generated:
- x86: 9, 12, 15 ,18
- arm-v7a: 6, 8, 10, 12
- riscv / power: 12, 18, 20, 24
- mipsel: 9, 12, 15, 19
On 64-bit architectures, the tendencies are similar. But both stack
sizes and instruction counts are significantly smaller thus negligible.
Reviewed by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Alexander Motin <mav@FreeBSD.org>
Reviewed-by: Tino Reichardt <milky-zfs@mcmilk.de>
Signed-off-by: Shengqi Chen <harry-chen@outlook.com>
Closes #16131
Closes #16483
2024-09-07 16:55:03 +03:00
|
|
|
}
|
2017-05-25 21:32:40 +03:00
|
|
|
|
zcommon: add specialized versions of cityhash4
Specializing cityhash4 on 32-bit architectures can reduce the size
of stack frames as well as instruction count. This is a tiny but
useful optimization, since some callers invoke it frequently.
When specializing into 1/2/3/4-arg versions, the stack usage
(in bytes) on some 32-bit arches are listed as follows:
- x86: 32, 32, 32, 40
- arm-v7a: 20, 20, 28, 36
- riscv: 0, 0, 0, 16
- power: 16, 16, 16, 32
- mipsel: 8, 8, 8, 24
And each actual argument (even if passing 0) contributes evenly
to the number of multiplication instructions generated:
- x86: 9, 12, 15 ,18
- arm-v7a: 6, 8, 10, 12
- riscv / power: 12, 18, 20, 24
- mipsel: 9, 12, 15, 19
On 64-bit architectures, the tendencies are similar. But both stack
sizes and instruction counts are significantly smaller thus negligible.
Reviewed by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Alexander Motin <mav@FreeBSD.org>
Reviewed-by: Tino Reichardt <milky-zfs@mcmilk.de>
Signed-off-by: Shengqi Chen <harry-chen@outlook.com>
Closes #16131
Closes #16483
2024-09-07 16:55:03 +03:00
|
|
|
/*
|
|
|
|
* Passing w as the 2nd argument could save one 64-bit multiplication.
|
|
|
|
*/
|
|
|
|
uint64_t
|
|
|
|
cityhash1(uint64_t w)
|
|
|
|
{
|
|
|
|
return (cityhash_impl(0, w, 0, 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t
|
|
|
|
cityhash2(uint64_t w1, uint64_t w2)
|
|
|
|
{
|
|
|
|
return (cityhash_impl(w1, w2, 0, 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t
|
|
|
|
cityhash3(uint64_t w1, uint64_t w2, uint64_t w3)
|
|
|
|
{
|
|
|
|
return (cityhash_impl(w1, w2, w3, 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t
|
|
|
|
cityhash4(uint64_t w1, uint64_t w2, uint64_t w3, uint64_t w4)
|
|
|
|
{
|
|
|
|
return (cityhash_impl(w1, w2, w3, w4));
|
2017-05-25 21:32:40 +03:00
|
|
|
}
|
2020-03-27 19:11:22 +03:00
|
|
|
|
|
|
|
#if defined(_KERNEL)
|
zcommon: add specialized versions of cityhash4
Specializing cityhash4 on 32-bit architectures can reduce the size
of stack frames as well as instruction count. This is a tiny but
useful optimization, since some callers invoke it frequently.
When specializing into 1/2/3/4-arg versions, the stack usage
(in bytes) on some 32-bit arches are listed as follows:
- x86: 32, 32, 32, 40
- arm-v7a: 20, 20, 28, 36
- riscv: 0, 0, 0, 16
- power: 16, 16, 16, 32
- mipsel: 8, 8, 8, 24
And each actual argument (even if passing 0) contributes evenly
to the number of multiplication instructions generated:
- x86: 9, 12, 15 ,18
- arm-v7a: 6, 8, 10, 12
- riscv / power: 12, 18, 20, 24
- mipsel: 9, 12, 15, 19
On 64-bit architectures, the tendencies are similar. But both stack
sizes and instruction counts are significantly smaller thus negligible.
Reviewed by: Brian Behlendorf <behlendorf1@llnl.gov>
Reviewed-by: Alexander Motin <mav@FreeBSD.org>
Reviewed-by: Tino Reichardt <milky-zfs@mcmilk.de>
Signed-off-by: Shengqi Chen <harry-chen@outlook.com>
Closes #16131
Closes #16483
2024-09-07 16:55:03 +03:00
|
|
|
EXPORT_SYMBOL(cityhash1);
|
|
|
|
EXPORT_SYMBOL(cityhash2);
|
|
|
|
EXPORT_SYMBOL(cityhash3);
|
2020-03-27 19:11:22 +03:00
|
|
|
EXPORT_SYMBOL(cityhash4);
|
|
|
|
#endif
|