From 1a528d3ef07fc6084fc51759c1b2f8abb5c8127e Mon Sep 17 00:00:00 2001 From: Michael Matz Date: Wed, 20 Jul 2022 17:22:15 +0200 Subject: Faster string merging * use power-of-two hash table * use better hash function (hashing 32bits at once and with better mixing characteristics) * use input-offset-to-entry maps instead of retaining full input contents for lookup time * don't reread SEC_MERGE section multiple times * care for cache behaviour for the hot lookup routine The overall effect is less usage in libz and much faster string merging itself. On a debug-info-enabled cc1 the effect at the time of this writing on the machine I used was going from 14400 perf samples to 9300 perf samples or from 3.7 seconds to 2.4 seconds, i.e. about 33% . --- bfd/configure.ac | 2 ++ 1 file changed, 2 insertions(+) (limited to 'bfd/configure.ac') diff --git a/bfd/configure.ac b/bfd/configure.ac index 82a3d1f..f044616 100644 --- a/bfd/configure.ac +++ b/bfd/configure.ac @@ -193,6 +193,8 @@ AM_CONDITIONAL(GENINSRC_NEVER, false) AM_INSTALL_LIBBFD AC_EXEEXT +AC_C_BIGENDIAN + host64=false target64=false bfd_default_target_size=32 -- cgit v1.1