diff options
| author | wl <wl> | 2010-12-26 10:50:18 +0000 |
|---|---|---|
| committer | wl <wl> | 2010-12-26 10:50:18 +0000 |
| commit | b9c26a6b01bce024f711e9370253dc97c6e93dfb (patch) | |
| tree | 76af2472d0045fe618f36cc3e62569d9990f5f0a | |
| parent | 25a3956d72974ecdf857bd6130ac4b1fc48f4421 (diff) | |
| download | groff-b9c26a6b01bce024f711e9370253dc97c6e93dfb.tar.gz | |
Thinko.
| -rw-r--r-- | ChangeLog | 13 |
1 files changed, 7 insertions, 6 deletions
@@ -3,12 +3,13 @@ Speed up troff. * src/include/ptable.h (PTABLE): Make hash tables much more sparse - by changing `FULL_NUM' from 3 to 1. This increases the allocated - memory by about 200kByte (which is nothing today) but assures that - there aren't extremely long searches for a free hash slot in case - that the hash function doesn't return a free one. Due to the nature - of the entries in uniuni.cpp, the used hash function in ptable.cpp - is not optimal, but using a sparse array compensates this. + by changing the ratio `FULL_NUM/FULL_DEN' from 2/3 to 1/4. This + increases the allocated memory by about 200kByte (which is nothing + today) but assures that there aren't extremely long searches for a + free hash slot in case that the hash function doesn't return a free + one. Due to the nature of the entries in uniuni.cpp, the used hash + function in ptable.cpp is not optimal, but using a sparse array + compensates this. 2010-12-20 Werner LEMBERG <wl@gnu.org> |