diff options
| author | Roman Beslik | 2015-07-03 16:58:11 +0300 |
|---|---|---|
| committer | Roman Beslik | 2015-07-03 16:58:11 +0300 |
| commit | 4e63f87a17a9105ee8098219f8d98104eb3f526a (patch) | |
| tree | bb8489d675f52fdf11a83218e9b8fee5df055834 /binutils-2.22-tune-bfd-hash.patch | |
| download | aur-binutils-tune-bfd-hash.tar.gz | |
init
Diffstat (limited to 'binutils-2.22-tune-bfd-hash.patch')
| -rw-r--r-- | binutils-2.22-tune-bfd-hash.patch | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/binutils-2.22-tune-bfd-hash.patch b/binutils-2.22-tune-bfd-hash.patch new file mode 100644 index 000000000000..295a032ed28d --- /dev/null +++ b/binutils-2.22-tune-bfd-hash.patch @@ -0,0 +1,19 @@ +commit a8c9fe1ae3d7d90f0d5f0cd6b81a58f25b429255 +Author: Bertram Felgenhauer <int-e@gmx.de> +Date: Fri May 16 22:45:20 2008 +0200 + + tune bfd hash to use less memory. it's still fast. + +diff --git a/bfd/hash.c b/bfd/hash.c +index 5edccac..90b5069 100644 +--- a/bfd/hash.c ++++ b/bfd/hash.c +@@ -299,7 +299,7 @@ SUBSUBSECTION + */ + + /* The default number of entries to use when creating a hash table. */ +-#define DEFAULT_SIZE 4051 ++#define DEFAULT_SIZE 31 + + /* The following function returns a nearest prime number which is + greater than N, and near a power of two. Copied from libiberty. |