This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
[Bug java/12756] Binary Compatibility: Searches are slow
- From: "bryce at mckinlay dot net dot nz" <gcc-bugzilla at gcc dot gnu dot org>
- To: gcc-bugs at gcc dot gnu dot org
- Date: 25 Oct 2003 03:48:45 -0000
- Subject: [Bug java/12756] Binary Compatibility: Searches are slow
- References: <20031024131840.12756.aph@gcc.gnu.org>
- Reply-to: gcc-bugzilla at gcc dot gnu dot org
PLEASE REPLY TO gcc-bugzilla@gcc.gnu.org ONLY, *NOT* gcc-bugs@gcc.gnu.org.
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=12756
------- Additional Comments From bryce at mckinlay dot net dot nz 2003-10-25 03:48 -------
We should be careful when adding hashtables to the runtime linker. My suspicion is that the extra
memory and allocation cost could easily outweigh the benefits. Having the compiler generate
sorted method/field tables and using binary searching could be a better option. In any case, it may
be better to wait until libgcj can be compiled with -findirect-dispatch and see if it really is a
bottleneck.