From: David Gibson <david@gibson.dropbear.id.au>
To: Stefano Brivio <sbrivio@redhat.com>, passt-dev@passt.top
Cc: David Gibson <david@gibson.dropbear.id.au>
Subject: [PATCH 03/10] siphash: Add siphash_feed() helper
Date: Sat, 23 Sep 2023 00:06:23 +1000 [thread overview]
Message-ID: <20230922140630.3184256-4-david@gibson.dropbear.id.au> (raw)
In-Reply-To: <20230922140630.3184256-1-david@gibson.dropbear.id.au>
We have macros or inlines for a number of common operations in the siphash
functions. However, in a number of places we still open code feeding
another 64-bits of data into the hash function: an xor, followed by 2
rounds of shuffling, followed by another xor.
Implement an inline function for this, which results in somewhat shortened
code.
Signed-off-by: David Gibson <david@gibson.dropbear.id.au>
---
siphash.c | 52 +++++++++++++++++++++-------------------------------
1 file changed, 21 insertions(+), 31 deletions(-)
diff --git a/siphash.c b/siphash.c
index e1fcf18..716ab62 100644
--- a/siphash.c
+++ b/siphash.c
@@ -91,11 +91,21 @@ static inline void sipround(uint64_t *v, int n)
}
}
+/**
+ * siphash_feed() - Fold 64-bits of data into the hash state
+ * @v: siphash state (4 x 64-bit integers)
+ * @in: New value to fold into hash
+ */
+static inline void siphash_feed(uint64_t *v, uint64_t in)
+{
+ v[3] ^= in;
+ sipround(v, 2);
+ v[0] ^= in;
+}
+
#define POSTAMBLE \
do { \
- v[3] ^= b; \
- sipround(v, 2); \
- v[0] ^= b; \
+ siphash_feed(v, b); \
v[2] ^= 0xff; \
sipround(v, 4); \
b = (v[0] ^ v[1]) ^ (v[2] ^ v[3]); \
@@ -123,9 +133,7 @@ __attribute__((optimize("-fno-strict-aliasing")))
uint64_t siphash_8b(const uint8_t *in, const uint64_t *k)
{
PREAMBLE(8);
- v[3] ^= *(uint64_t *)in;
- sipround(v, 2);
- v[0] ^= *(uint64_t *)in;
+ siphash_feed(v, *(uint64_t *)in);
POSTAMBLE;
return b;
@@ -144,14 +152,9 @@ __attribute__((optimize("-fno-strict-aliasing"))) /* See siphash_8b() */
uint64_t siphash_12b(const uint8_t *in, const uint64_t *k)
{
uint32_t *in32 = (uint32_t *)in;
- uint64_t combined;
-
- combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
PREAMBLE(12);
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *(in32 + 2);
POSTAMBLE;
@@ -174,13 +177,8 @@ uint64_t siphash_20b(const uint8_t *in, const uint64_t *k)
PREAMBLE(20);
- for (i = 0; i < 2; i++, in32 += 2) {
- uint64_t combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
-
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
- }
+ for (i = 0; i < 2; i++, in32 += 2)
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *in32;
POSTAMBLE;
@@ -205,11 +203,8 @@ uint64_t siphash_32b(const uint8_t *in, const uint64_t *k)
PREAMBLE(32);
- for (i = 0; i < 4; i++, in64++) {
- v[3] ^= *in64;
- sipround(v, 2);
- v[0] ^= *in64;
- }
+ for (i = 0; i < 4; i++, in64++)
+ siphash_feed(v, *in64);
POSTAMBLE;
@@ -232,13 +227,8 @@ uint64_t siphash_36b(const uint8_t *in, const uint64_t *k)
PREAMBLE(36);
- for (i = 0; i < 4; i++, in32 += 2) {
- uint64_t combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
-
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
- }
+ for (i = 0; i < 4; i++, in32 += 2)
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *in32;
POSTAMBLE;
--
@@ -91,11 +91,21 @@ static inline void sipround(uint64_t *v, int n)
}
}
+/**
+ * siphash_feed() - Fold 64-bits of data into the hash state
+ * @v: siphash state (4 x 64-bit integers)
+ * @in: New value to fold into hash
+ */
+static inline void siphash_feed(uint64_t *v, uint64_t in)
+{
+ v[3] ^= in;
+ sipround(v, 2);
+ v[0] ^= in;
+}
+
#define POSTAMBLE \
do { \
- v[3] ^= b; \
- sipround(v, 2); \
- v[0] ^= b; \
+ siphash_feed(v, b); \
v[2] ^= 0xff; \
sipround(v, 4); \
b = (v[0] ^ v[1]) ^ (v[2] ^ v[3]); \
@@ -123,9 +133,7 @@ __attribute__((optimize("-fno-strict-aliasing")))
uint64_t siphash_8b(const uint8_t *in, const uint64_t *k)
{
PREAMBLE(8);
- v[3] ^= *(uint64_t *)in;
- sipround(v, 2);
- v[0] ^= *(uint64_t *)in;
+ siphash_feed(v, *(uint64_t *)in);
POSTAMBLE;
return b;
@@ -144,14 +152,9 @@ __attribute__((optimize("-fno-strict-aliasing"))) /* See siphash_8b() */
uint64_t siphash_12b(const uint8_t *in, const uint64_t *k)
{
uint32_t *in32 = (uint32_t *)in;
- uint64_t combined;
-
- combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
PREAMBLE(12);
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *(in32 + 2);
POSTAMBLE;
@@ -174,13 +177,8 @@ uint64_t siphash_20b(const uint8_t *in, const uint64_t *k)
PREAMBLE(20);
- for (i = 0; i < 2; i++, in32 += 2) {
- uint64_t combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
-
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
- }
+ for (i = 0; i < 2; i++, in32 += 2)
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *in32;
POSTAMBLE;
@@ -205,11 +203,8 @@ uint64_t siphash_32b(const uint8_t *in, const uint64_t *k)
PREAMBLE(32);
- for (i = 0; i < 4; i++, in64++) {
- v[3] ^= *in64;
- sipround(v, 2);
- v[0] ^= *in64;
- }
+ for (i = 0; i < 4; i++, in64++)
+ siphash_feed(v, *in64);
POSTAMBLE;
@@ -232,13 +227,8 @@ uint64_t siphash_36b(const uint8_t *in, const uint64_t *k)
PREAMBLE(36);
- for (i = 0; i < 4; i++, in32 += 2) {
- uint64_t combined = (uint64_t)(*(in32 + 1)) << 32 | *in32;
-
- v[3] ^= combined;
- sipround(v, 2);
- v[0] ^= combined;
- }
+ for (i = 0; i < 4; i++, in32 += 2)
+ siphash_feed(v, (uint64_t)(*(in32 + 1)) << 32 | *in32);
b |= *in32;
POSTAMBLE;
--
2.41.0
next prev parent reply other threads:[~2023-09-22 14:06 UTC|newest]
Thread overview: 17+ messages / expand[flat|nested] mbox.gz Atom feed top
2023-09-22 14:06 [PATCH 00/10] siphash: cleanups and fixes David Gibson
2023-09-22 14:06 ` [PATCH 01/10] siphash: Make siphash functions consistently return 64-bit results David Gibson
2023-09-22 14:06 ` [PATCH 02/10] siphash: Make sip round calculations an inline function rather than macro David Gibson
2023-09-22 14:06 ` David Gibson [this message]
2023-09-22 14:06 ` [PATCH 04/10] siphash: Clean up hash finalisation with posthash_final() function David Gibson
2023-09-22 14:06 ` [PATCH 05/10] siphash: Fix bug in state initialisation David Gibson
2023-09-22 14:06 ` [PATCH 06/10] siphash: Use more hygienic state initialiser David Gibson
2023-09-27 17:04 ` Stefano Brivio
2023-09-28 1:20 ` David Gibson
2023-09-29 15:19 ` Stefano Brivio
2023-09-22 14:06 ` [PATCH 07/10] siphash: Use specific structure for internal state David Gibson
2023-09-22 14:06 ` [PATCH 08/10] siphash: Make internal helpers public David Gibson
2023-09-22 14:06 ` [PATCH 09/10] siphash, checksum: Move TBAA explanation to checksum.c David Gibson
2023-09-22 14:06 ` [PATCH 10/10] siphash: Use incremental rather than all-at-once siphash functions David Gibson
2023-09-26 6:23 ` David Gibson
2023-09-26 7:02 ` David Gibson
2023-09-27 17:05 ` Stefano Brivio
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=20230922140630.3184256-4-david@gibson.dropbear.id.au \
--to=david@gibson.dropbear.id.au \
--cc=passt-dev@passt.top \
--cc=sbrivio@redhat.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
Code repositories for project(s) associated with this public inbox
https://passt.top/passt
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for IMAP folder(s).