This is the mail archive of the
binutils@sources.redhat.com
mailing list for the binutils project.
addr2line seems slow
- To: binutils at gcc dot gnu dot org
- Subject: addr2line seems slow
- From: Patrick Doyle <doylep at eecg dot toronto dot edu>
- Date: Sun, 29 Jul 2001 12:52:26 -0400 (EDT)
To convert 34,000 addresses to line numbers, addr2line takes upwards of
four minutes. That's longer than I would have expected.
Poking around the source, I found that it calls
"bfd_find_nearest_line" for each address. Presumably that does a linear
search through the debug information?
Has anyone considered caching these values once they are computed? Or
perhaps sorting the bfd data so a more efficient search can be performed?
--
Patrick Doyle
doylep@eecg.toronto.edu