aboutsummaryrefslogtreecommitdiff
path: root/gdb/stabsread.c
diff options
context:
space:
mode:
authorChristian Biesinger <cbiesinger@google.com>2019-12-02 18:58:35 -0600
committerChristian Biesinger <cbiesinger@google.com>2019-12-03 15:27:15 -0600
commit4cbd39b289b012782df2fdda9adc7eacdcfc6ad7 (patch)
treef52aba927c48c83dca2923c7c3c0c55657ca29c1 /gdb/stabsread.c
parent82f910ea9cce04b0faabfcd022d9d8949567541e (diff)
downloadgdb-4cbd39b289b012782df2fdda9adc7eacdcfc6ad7.zip
gdb-4cbd39b289b012782df2fdda9adc7eacdcfc6ad7.tar.gz
gdb-4cbd39b289b012782df2fdda9adc7eacdcfc6ad7.tar.bz2
Replace hash function from bcache with fast_hash
This function is not just slower than xxhash, it is slower than even libiberty's iterative_hash, so there does not seem to be a reason for it to exist. ------------------------------------------------------------ Benchmark Time CPU Iterations ------------------------------------------------------------ BM_xxh3 11 ns 11 ns 66127192 BM_xxh32 19 ns 19 ns 36792609 BM_xxh64 16 ns 16 ns 42941328 BM_city32 26 ns 26 ns 27028370 BM_city64 17 ns 17 ns 40472793 BM_iterative_hash 77 ns 77 ns 9088854 BM_bcache_hash 125 ns 125 ns 5599232 gdb/ChangeLog: 2019-12-03 Christian Biesinger <cbiesinger@google.com> * bcache.c (hash): Remove. (hash_continue): Remove. * bcache.h (hash): Remove. (hash_continue): Remove. (struct bcache) <ctor>: Update. * psymtab.c (psymbol_hash): Update. * stabsread.c (hashname): Update. * utils.h (fast_hash): Add an argument for a start value, defaulting to zero. Change-Id: I107f013eda5fdd3293326b5a206be43155dae0f8
Diffstat (limited to 'gdb/stabsread.c')
-rw-r--r--gdb/stabsread.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gdb/stabsread.c b/gdb/stabsread.c
index 979df02..91a73dd 100644
--- a/gdb/stabsread.c
+++ b/gdb/stabsread.c
@@ -4778,7 +4778,7 @@ find_name_end (const char *name)
int
hashname (const char *name)
{
- return hash (name, strlen (name)) % HASHSIZE;
+ return fast_hash (name, strlen (name)) % HASHSIZE;
}
/* Initializer for this module. */