binutils-tune-bfd-hash/binutils-2.22-tune-bfd-hash.patch

   1 commit a8c9fe1ae3d7d90f0d5f0cd6b81a58f25b429255
   2 Author: Bertram Felgenhauer <int-e@gmx.de>
   3 Date:   Fri May 16 22:45:20 2008 +0200
   4
   5     tune bfd hash to use less memory. it's still fast.
   6
   7 diff --git a/bfd/hash.c b/bfd/hash.c
   8 index 5edccac..90b5069 100644
   9 --- a/bfd/hash.c
  10 +++ b/bfd/hash.c
  11 @@ -299,7 +299,7 @@ SUBSUBSECTION
  12  */
  13
  14  /* The default number of entries to use when creating a hash table.  */
  15 -#define DEFAULT_SIZE 4051
  16 +#define DEFAULT_SIZE 31
  17
  18  /* The following function returns a nearest prime number which is
  19     greater than N, and near a power of two.  Copied from libiberty.