Patch Detail
get:
Show a patch.
patch:
Update a patch.
put:
Update a patch.
GET /api/patches/4337/?format=api
https://patches.dpdk.org/api/patches/4337/?format=api", "web_url": "https://patches.dpdk.org/project/dpdk/patch/1429190819-27402-1-git-send-email-pablo.de.lara.guarch@intel.com/", "project": { "id": 1, "url": "https://patches.dpdk.org/api/projects/1/?format=api", "name": "DPDK", "link_name": "dpdk", "list_id": "dev.dpdk.org", "list_email": "dev@dpdk.org", "web_url": "http://core.dpdk.org", "scm_url": "git://dpdk.org/dpdk", "webscm_url": "http://git.dpdk.org/dpdk", "list_archive_url": "https://inbox.dpdk.org/dev", "list_archive_url_format": "https://inbox.dpdk.org/dev/{}", "commit_url_format": "" }, "msgid": "<1429190819-27402-1-git-send-email-pablo.de.lara.guarch@intel.com>", "list_archive_url": "https://inbox.dpdk.org/dev/1429190819-27402-1-git-send-email-pablo.de.lara.guarch@intel.com", "date": "2015-04-16T13:26:59", "name": "[dpdk-dev] hash: update jhash function with the latest available", "commit_ref": null, "pull_url": null, "state": "superseded", "archived": true, "hash": "38cfaa7893fc859853ef9baa54d99a17eb913e00", "submitter": { "id": 9, "url": "https://patches.dpdk.org/api/people/9/?format=api", "name": "De Lara Guarch, Pablo", "email": "pablo.de.lara.guarch@intel.com" }, "delegate": null, "mbox": "https://patches.dpdk.org/project/dpdk/patch/1429190819-27402-1-git-send-email-pablo.de.lara.guarch@intel.com/mbox/", "series": [], "comments": "https://patches.dpdk.org/api/patches/4337/comments/", "check": "pending", "checks": "https://patches.dpdk.org/api/patches/4337/checks/", "tags": {}, "related": [], "headers": { "Return-Path": "<dev-bounces@dpdk.org>", "X-Original-To": "patchwork@dpdk.org", "Delivered-To": "patchwork@dpdk.org", "Received": [ "from [92.243.14.124] (localhost [IPv6:::1])\n\tby dpdk.org (Postfix) with ESMTP id 0CA11688E;\n\tThu, 16 Apr 2015 15:27:05 +0200 (CEST)", "from mga09.intel.com (mga09.intel.com [134.134.136.24])\n\tby dpdk.org (Postfix) with ESMTP id 58EC05A8A\n\tfor <dev@dpdk.org>; Thu, 16 Apr 2015 15:27:03 +0200 (CEST)", "from orsmga001.jf.intel.com ([10.7.209.18])\n\tby orsmga102.jf.intel.com with ESMTP; 16 Apr 2015 06:27:02 -0700", "from irvmail001.ir.intel.com ([163.33.26.43])\n\tby orsmga001.jf.intel.com with ESMTP; 16 Apr 2015 06:27:01 -0700", "from sivswdev02.ir.intel.com (sivswdev02.ir.intel.com\n\t[10.237.217.46])\n\tby irvmail001.ir.intel.com (8.14.3/8.13.6/MailSET/Hub) with ESMTP id\n\tt3GDR0m7024130 for <dev@dpdk.org>; Thu, 16 Apr 2015 14:27:00 +0100", "from sivswdev02.ir.intel.com (localhost [127.0.0.1])\n\tby sivswdev02.ir.intel.com with ESMTP id t3GDQxZm027443\n\tfor <dev@dpdk.org>; Thu, 16 Apr 2015 14:26:59 +0100", "(from pdelarax@localhost)\n\tby sivswdev02.ir.intel.com with id t3GDQxiN027438\n\tfor dev@dpdk.org; Thu, 16 Apr 2015 14:26:59 +0100" ], "X-ExtLoop1": "1", "X-IronPort-AV": "E=Sophos;i=\"5.11,588,1422950400\"; d=\"scan'208\";a=\"681133222\"", "From": "Pablo de Lara <pablo.de.lara.guarch@intel.com>", "To": "dev@dpdk.org", "Date": "Thu, 16 Apr 2015 14:26:59 +0100", "Message-Id": "<1429190819-27402-1-git-send-email-pablo.de.lara.guarch@intel.com>", "X-Mailer": "git-send-email 1.7.4.1", "Subject": "[dpdk-dev] [PATCH] hash: update jhash function with the latest\n\tavailable", "X-BeenThere": "dev@dpdk.org", "X-Mailman-Version": "2.1.15", "Precedence": "list", "List-Id": "patches and discussions about DPDK <dev.dpdk.org>", "List-Unsubscribe": "<http://dpdk.org/ml/options/dev>,\n\t<mailto:dev-request@dpdk.org?subject=unsubscribe>", "List-Archive": "<http://dpdk.org/ml/archives/dev/>", "List-Post": "<mailto:dev@dpdk.org>", "List-Help": "<mailto:dev-request@dpdk.org?subject=help>", "List-Subscribe": "<http://dpdk.org/ml/listinfo/dev>,\n\t<mailto:dev-request@dpdk.org?subject=subscribe>", "Errors-To": "dev-bounces@dpdk.org", "Sender": "\"dev\" <dev-bounces@dpdk.org>" }, "content": "Jenkins hash function was developed originally in 1996,\nand was integrated in first versions of DPDK.\nThe function has been improved in 2006,\nachieving up to 60% better performance, compared to the original one.\n\nCheck out: http://burtleburtle.net/bob/c/lookup3.c\n\nThis patch integrates that code in the rte_jhash library,\nadding also a new function rte_jhash_word2,\nthat returns two different hash values, for a single key.\n\nSigned-off-by: Pablo de Lara <pablo.de.lara.guarch@intel.com>\n---\n lib/librte_hash/rte_jhash.h | 407 ++++++++++++++++++++++++++++++++++++-------\n 1 files changed, 347 insertions(+), 60 deletions(-)", "diff": "diff --git a/lib/librte_hash/rte_jhash.h b/lib/librte_hash/rte_jhash.h\nindex a4bf5a1..3de006d 100644\n--- a/lib/librte_hash/rte_jhash.h\n+++ b/lib/librte_hash/rte_jhash.h\n@@ -1,7 +1,7 @@\n /*-\n * BSD LICENSE\n *\n- * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.\n+ * Copyright(c) 2010-2015 Intel Corporation. All rights reserved.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n@@ -45,38 +45,51 @@ extern \"C\" {\n #endif\n \n #include <stdint.h>\n+#include <rte_byteorder.h>\n \n /* jhash.h: Jenkins hash support.\n *\n- * Copyright (C) 1996 Bob Jenkins (bob_jenkins@burtleburtle.net)\n+ * Copyright (C) 2006 Bob Jenkins (bob_jenkins@burtleburtle.net)\n *\n * http://burtleburtle.net/bob/hash/\n *\n * These are the credits from Bob's sources:\n *\n- * lookup2.c, by Bob Jenkins, December 1996, Public Domain.\n- * hash(), hash2(), hash3, and mix() are externally useful functions.\n- * Routines to test the hash are included if SELF_TEST is defined.\n- * You can use this free for any purpose. It has no warranty.\n+ * lookup3.c, by Bob Jenkins, May 2006, Public Domain.\n+ *\n+ * These are functions for producing 32-bit hashes for hash table lookup.\n+ * hashword(), hashlittle(), hashlittle2(), hashbig(), mix(), and final()\n+ * are externally useful functions. Routines to test the hash are included\n+ * if SELF_TEST is defined. You can use this free for any purpose. It's in\n+ * the public domain. It has no warranty.\n *\n * $FreeBSD$\n */\n \n+#define rot(x, k) (((x)<<(k)) | ((x)>>(32-(k))))\n+\n /** @internal Internal function. NOTE: Arguments are modified. */\n #define __rte_jhash_mix(a, b, c) do { \\\n-\ta -= b; a -= c; a ^= (c>>13); \\\n-\tb -= c; b -= a; b ^= (a<<8); \\\n-\tc -= a; c -= b; c ^= (b>>13); \\\n-\ta -= b; a -= c; a ^= (c>>12); \\\n-\tb -= c; b -= a; b ^= (a<<16); \\\n-\tc -= a; c -= b; c ^= (b>>5); \\\n-\ta -= b; a -= c; a ^= (c>>3); \\\n-\tb -= c; b -= a; b ^= (a<<10); \\\n-\tc -= a; c -= b; c ^= (b>>15); \\\n+\ta -= c; a ^= rot(c, 4); c += b; \\\n+\tb -= a; b ^= rot(a, 6); a += c; \\\n+\tc -= b; c ^= rot(b, 8); b += a; \\\n+\ta -= c; a ^= rot(c, 16); c += b; \\\n+\tb -= a; b ^= rot(a, 19); a += c; \\\n+\tc -= b; c ^= rot(b, 4); b += a; \\\n+} while (0)\n+\n+#define __rte_jhash_final(a, b, c) do { \\\n+\tc ^= b; c -= rot(b, 14); \\\n+\ta ^= c; a -= rot(c, 11); \\\n+\tb ^= a; b -= rot(a, 25); \\\n+\tc ^= b; c -= rot(b, 16); \\\n+\ta ^= c; a -= rot(c, 4); \\\n+\tb ^= a; b -= rot(a, 14); \\\n+\tc ^= b; c -= rot(b, 24); \\\n } while (0)\n \n /** The golden ratio: an arbitrary value. */\n-#define RTE_JHASH_GOLDEN_RATIO 0x9e3779b9\n+#define RTE_JHASH_GOLDEN_RATIO 0xdeadbeef\n \n /**\n * The most generic version, hashes an arbitrary sequence\n@@ -95,42 +108,256 @@ extern \"C\" {\n static inline uint32_t\n rte_jhash(const void *key, uint32_t length, uint32_t initval)\n {\n-\tuint32_t a, b, c, len;\n-\tconst uint8_t *k = (const uint8_t *)key;\n-\tconst uint32_t *k32 = (const uint32_t *)key;\n+\tuint32_t a, b, c;\n+\tunion {\n+\t\tconst void *ptr;\n+\t\tsize_t i;\n+\t} u;\n \n-\tlen = length;\n-\ta = b = RTE_JHASH_GOLDEN_RATIO;\n-\tc = initval;\n+\t/* Set up the internal state */\n+\ta = b = c = RTE_JHASH_GOLDEN_RATIO + ((uint32_t)length) + initval;\n \n-\twhile (len >= 12) {\n-\t\ta += k32[0];\n-\t\tb += k32[1];\n-\t\tc += k32[2];\n+\tu.ptr = key;\n \n-\t\t__rte_jhash_mix(a,b,c);\n+\tif ((u.i & 0x3) == 0) {\n+\t\tconst uint32_t *k = (const uint32_t *)key;\n \n-\t\tk += (3 * sizeof(uint32_t)), k32 += 3;\n-\t\tlen -= (3 * sizeof(uint32_t));\n-\t}\n+\t\twhile (length > 12) {\n+\t\t\ta += k[0];\n+\t\t\tb += k[1];\n+\t\t\tc += k[2];\n \n-\tc += length;\n-\tswitch (len) {\n-\t\tcase 11: c += ((uint32_t)k[10] << 24);\n-\t\tcase 10: c += ((uint32_t)k[9] << 16);\n-\t\tcase 9 : c += ((uint32_t)k[8] << 8);\n-\t\tcase 8 : b += ((uint32_t)k[7] << 24);\n-\t\tcase 7 : b += ((uint32_t)k[6] << 16);\n-\t\tcase 6 : b += ((uint32_t)k[5] << 8);\n-\t\tcase 5 : b += k[4];\n-\t\tcase 4 : a += ((uint32_t)k[3] << 24);\n-\t\tcase 3 : a += ((uint32_t)k[2] << 16);\n-\t\tcase 2 : a += ((uint32_t)k[1] << 8);\n-\t\tcase 1 : a += k[0];\n-\t\tdefault: break;\n-\t};\n+\t\t\t__rte_jhash_mix(a, b, c);\n+\n+\t\t\tk += 3;\n+\t\t\tlength -= 12;\n+\t\t}\n+\n+\t\tswitch (length) {\n+#if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN\n+\t\tcase 12:\n+\t\t\tc += k[2]; b += k[1]; a += k[0]; break;\n+\t\tcase 11:\n+\t\t\tc += k[2]&0xffffff; b += k[1]; a += k[0]; break;\n+\t\tcase 10:\n+\t\t\tc += k[2]&0xffff; b += k[1]; a += k[0]; break;\n+\t\tcase 9:\n+\t\t\tc += k[2]&0xff; b += k[1]; a += k[0]; break;\n+\t\tcase 8:\n+\t\t\tb += k[1]; a += k[0]; break;\n+\t\tcase 7:\n+\t\t\tb += k[1]&0xffffff; a += k[0]; break;\n+\t\tcase 6:\n+\t\t\tb += k[1]&0xffff; a += k[0]; break;\n+\t\tcase 5:\n+\t\t\tb += k[1]&0xff; a += k[0]; break;\n+\t\tcase 4:\n+\t\t\ta += k[0]; break;\n+\t\tcase 3:\n+\t\t\ta += k[0]&0xffffff; break;\n+\t\tcase 2:\n+\t\t\ta += k[0]&0xffff; break;\n+\t\tcase 1:\n+\t\t\ta += k[0]&0xff; break;\n+#else\n+\t\tcase 12:\n+\t\t\tc += k[2]; b += k[1]; a += k[0]; break;\n+\t\tcase 11:\n+\t\t\tc += k[2]&0xffffff00; b += k[1]; a += k[0]; break;\n+\t\tcase 10:\n+\t\t\tc += k[2]&0xffff0000; b += k[1]; a += k[0]; break;\n+\t\tcase 9:\n+\t\t\tc += k[2]&0xff000000; b += k[1]; a += k[0]; break;\n+\t\tcase 8:\n+\t\t\tb += k[1]; a += k[0]; break;\n+\t\tcase 7:\n+\t\t\tb += k[1]&0xffffff00; a += k[0]; break;\n+\t\tcase 6:\n+\t\t\tb += k[1]&0xffff0000; a += k[0]; break;\n+\t\tcase 5:\n+\t\t\tb += k[1]&0xff000000; a += k[0]; break;\n+\t\tcase 4:\n+\t\t\ta += k[0]; break;\n+\t\tcase 3:\n+\t\t\ta += k[0]&0xffffff00; break;\n+\t\tcase 2:\n+\t\t\ta += k[0]&0xffff0000; break;\n+\t\tcase 1:\n+\t\t\ta += k[0]&0xff000000; break;\n+#endif\n+\t\t/* zero length strings require no mixing */\n+\t\tcase 0:\n+\t\t\treturn c;\n+\t\t};\n+#if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN\n+\t} else if ((u.i & 0x1) == 0) {\n+\t\t/* read 16-bit chunks */\n+\t\tconst uint16_t *k = (const uint16_t *)key;\n+\t\tconst uint8_t *k8;\n+\n+\t\t/* all but last block: aligned reads and different mixing */\n+\t\twhile (length > 12) {\n+\t\t\ta += k[0] + (((uint32_t)k[1])<<16);\n+\t\t\tb += k[2] + (((uint32_t)k[3])<<16);\n+\t\t\tc += k[4] + (((uint32_t)k[5])<<16);\n+\n+\t\t\t__rte_jhash_mix(a, b, c);\n+\n+\t\t\tk += 6;\n+\t\t\tlength -= 12;\n+\t\t}\n+\n+\t\t/* handle the last (probably partial) block */\n+\t\tk8 = (const uint8_t *)k;\n+\t\tswitch (length) {\n+\t\tcase 12:\n+\t\t\tc += k[4]+(((uint32_t)k[5])<<16);\n+\t\t\tb += k[2]+(((uint32_t)k[3])<<16);\n+\t\t\ta += k[0]+(((uint32_t)k[1])<<16);\n+\t\t\tbreak;\n+\t\tcase 11:\n+\t\t\t/* fall through */\n+\t\t\tc += ((uint32_t)k8[10])<<16;\n+\t\tcase 10:\n+\t\t\tc += k[4];\n+\t\t\tb += k[2]+(((uint32_t)k[3])<<16);\n+\t\t\ta += k[0]+(((uint32_t)k[1])<<16);\n+\t\t\tbreak;\n+\t\tcase 9:\n+\t\t\t/* fall through */\n+\t\t\tc += k8[8];\n+\t\tcase 8:\n+\t\t\tb += k[2]+(((uint32_t)k[3])<<16);\n+\t\t\ta += k[0]+(((uint32_t)k[1])<<16);\n+\t\t\tbreak;\n+\t\tcase 7:\n+\t\t\t/* fall through */\n+\t\t\tb += ((uint32_t)k8[6])<<16;\n+\t\tcase 6:\n+\t\t\tb += k[2];\n+\t\t\ta += k[0]+(((uint32_t)k[1])<<16);\n+\t\t\tbreak;\n+\t\tcase 5:\n+\t\t\t/* fall through */\n+\t\t\tb += k8[4];\n+\t\tcase 4:\n+\t\t\ta += k[0]+(((uint32_t)k[1])<<16);\n+\t\t\tbreak;\n+\t\tcase 3:\n+\t\t\t/* fall through */\n+\t\t\ta += ((uint32_t)k8[2])<<16;\n+\t\tcase 2:\n+\t\t\ta += k[0];\n+\t\t\tbreak;\n+\t\tcase 1:\n+\t\t\ta += k8[0];\n+\t\t\tbreak;\n+\t\tcase 0:\n+\t\t\t/* zero length requires no mixing */\n+\t\t\treturn c;\n+\t\t}\n+#endif\n+\t} else {\n+\t\tconst uint8_t *k = (const uint8_t *)key;\n+\n+\t\t/* all but the last block: affect some 32 bits of (a, b, c) */\n+\t\twhile (length > 12) {\n+#if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN\n+\t\t\ta += k[0];\n+\t\t\ta += ((uint32_t)k[1])<<8;\n+\t\t\ta += ((uint32_t)k[2])<<16;\n+\t\t\ta += ((uint32_t)k[3])<<24;\n+\t\t\tb += k[4];\n+\t\t\tb += ((uint32_t)k[5])<<8;\n+\t\t\tb += ((uint32_t)k[6])<<16;\n+\t\t\tb += ((uint32_t)k[7])<<24;\n+\t\t\tc += k[8];\n+\t\t\tc += ((uint32_t)k[9])<<8;\n+\t\t\tc += ((uint32_t)k[10])<<16;\n+\t\t\tc += ((uint32_t)k[11])<<24;\n+#else\n+\t\t\ta += ((uint32_t)k[0])<<24;\n+\t\t\ta += ((uint32_t)k[1])<<16;\n+\t\t\ta += ((uint32_t)k[2])<<8;\n+\t\t\ta += ((uint32_t)k[3]);\n+\t\t\tb += ((uint32_t)k[4])<<24;\n+\t\t\tb += ((uint32_t)k[5])<<16;\n+\t\t\tb += ((uint32_t)k[6])<<8;\n+\t\t\tb += ((uint32_t)k[7]);\n+\t\t\tc += ((uint32_t)k[8])<<32;\n+\t\t\tc += ((uint32_t)k[9])<<16;\n+\t\t\tc += ((uint32_t)k[10])<<8;\n+\t\t\tc += ((uint32_t)k[11]);\n+#endif\n+\n+\t\t\t__rte_jhash_mix(a, b, c);\n \n-\t__rte_jhash_mix(a,b,c);\n+\t\t\tk += 12;\n+\t\t\tlength -= 12;\n+\t\t}\n+\n+\t\t/* last block: affect all 32 bits of (c) */\n+\t\t/* all the case statements fall through */\n+\t\tswitch (length) {\n+#if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN\n+\t\tcase 12:\n+\t\t\tc += ((uint32_t)k[11])<<24;\n+\t\tcase 11:\n+\t\t\tc += ((uint32_t)k[10])<<16;\n+\t\tcase 10:\n+\t\t\tc += ((uint32_t)k[9])<<8;\n+\t\tcase 9:\n+\t\t\tc += k[8];\n+\t\tcase 8:\n+\t\t\tb += ((uint32_t)k[7])<<24;\n+\t\tcase 7:\n+\t\t\tb += ((uint32_t)k[6])<<16;\n+\t\tcase 6:\n+\t\t\tb += ((uint32_t)k[5])<<8;\n+\t\tcase 5:\n+\t\t\tb += k[4];\n+\t\tcase 4:\n+\t\t\ta += ((uint32_t)k[3])<<24;\n+\t\tcase 3:\n+\t\t\ta += ((uint32_t)k[2])<<16;\n+\t\tcase 2:\n+\t\t\ta += ((uint32_t)k[1])<<8;\n+\t\tcase 1:\n+\t\t\ta += k[0];\n+\t\tbreak;\n+#else\n+\t\tcase 12:\n+\t\t\tc += k[11];\n+\t\tcase 11:\n+\t\t\tc += ((uint32_t)k[10])<<8;\n+\t\tcase 10:\n+\t\t\tc += ((uint32_t)k[9])<<16;\n+\t\tcase 9:\n+\t\t\tc += ((uint32_t)k[8])<<24;\n+\t\tcase 8:\n+\t\t\tb += k[7];\n+\t\tcase 7:\n+\t\t\tb += ((uint32_t)k[6])<<8;\n+\t\tcase 6:\n+\t\t\tb += ((uint32_t)k[5])<<16;\n+\t\tcase 5:\n+\t\t\tb += ((uint32_t)k[4])<<24;\n+\t\tcase 4:\n+\t\t\ta += k[3];\n+\t\tcase 3:\n+\t\t\ta += ((uint32_t)k[2])<<8;\n+\t\tcase 2:\n+\t\t\ta += ((uint32_t)k[1])<<16;\n+\t\tcase 1:\n+\t\t\ta += ((uint32_t)k[0])<<24;\n+\t\tbreak;\n+#endif\n+\t\tcase 0:\n+\t\t\treturn c;\n+\t\t}\n+\t}\n+\n+\t__rte_jhash_final(a, b, c);\n \n \treturn c;\n }\n@@ -151,33 +378,93 @@ rte_jhash(const void *key, uint32_t length, uint32_t initval)\n static inline uint32_t\n rte_jhash2(const uint32_t *k, uint32_t length, uint32_t initval)\n {\n-\tuint32_t a, b, c, len;\n+\tuint32_t a, b, c;\n \n-\ta = b = RTE_JHASH_GOLDEN_RATIO;\n-\tc = initval;\n-\tlen = length;\n+\t/* Set up the internal state */\n+\ta = b = c = RTE_JHASH_GOLDEN_RATIO + (((uint32_t)length)<<2) + initval;\n \n-\twhile (len >= 3) {\n+\t/* Handle most of the key */\n+\twhile (length > 3) {\n \t\ta += k[0];\n \t\tb += k[1];\n \t\tc += k[2];\n+\n \t\t__rte_jhash_mix(a, b, c);\n-\t\tk += 3; len -= 3;\n-\t}\n \n-\tc += length * 4;\n+\t\tk += 3;\n+\t\tlength -= 3;\n+\t}\n \n-\tswitch (len) {\n-\t\tcase 2 : b += k[1];\n-\t\tcase 1 : a += k[0];\n-\t\tdefault: break;\n+\t/* Handle the last 3 uint32_t's */\n+\tswitch (length) {\n+\tcase 3:\n+\t\tc += k[2];\n+\tcase 2:\n+\t\tb += k[1];\n+\tcase 1:\n+\t\ta += k[0];\n+\t\t__rte_jhash_final(a, b, c);\n+\t/* case 0: nothing left to add */\n+\tcase 0:\n+\t\tbreak;\n \t};\n \n-\t__rte_jhash_mix(a,b,c);\n-\n \treturn c;\n }\n \n+/**\n+ * Same as rte_jhash2, but take two seeds and return two uint32_ts.\n+ * pc and pb must be non-null, and *pc and *pb must both be initialized\n+ * with seeds. If you pass in (*pb)=0, the output (*pc) will be\n+ * the same as the return value from rte_jhash.\n+ *\n+ * @param k\n+ * Key to calculate hash of.\n+ * @param length\n+ * Length of key in units of 4 bytes.\n+ * @param pc\n+ * IN: seed OUT: primary hash value.\n+ * @param pc\n+ * IN: second seed OUT: secondary hash value.\n+ */\n+static inline void\n+rte_jhash_word2(const uint32_t *k, uint32_t length, uint32_t *pc, uint32_t *pb)\n+{\n+\tuint32_t a, b, c;\n+\n+\t/* Set up the internal state */\n+\ta = b = c = RTE_JHASH_GOLDEN_RATIO + (((uint32_t)length)<<2) + *pc;\n+\tc += *pb;\n+\n+\t/* Handle most of the key */\n+\twhile (length > 3) {\n+\t\ta += k[0];\n+\t\tb += k[1];\n+\t\tc += k[2];\n+\n+\t\t__rte_jhash_mix(a, b, c);\n+\n+\t\tk += 3;\n+\t\tlength -= 3;\n+\t}\n+\n+\t/* Handle the last 3 uint32_t's */\n+\tswitch (length) {\n+\tcase 3:\n+\t\tc += k[2];\n+\tcase 2:\n+\t\tb += k[1];\n+\tcase 1:\n+\t\ta += k[0];\n+\t\t__rte_jhash_final(a, b, c);\n+\t/* case 0: nothing left to add */\n+\tcase 0:\n+\t\tbreak;\n+\t};\n+\n+\t*pc = c;\n+\t*pb = b;\n+}\n \n /**\n * A special ultra-optimized versions that knows it is hashing exactly\n", "prefixes": [ "dpdk-dev" ] }{ "id": 4337, "url": "