[Bug binutils/22911] Huge slowdown in objdump -d caused by scanning the dynamic relocs

[cvs-commit at gcc dot gnu.org]

https://sourceware.org/bugzilla/show_bug.cgi?id=22911

--- Comment #8 from cvs-commit at gcc dot gnu.org <cvs-commit at gcc dot 
gnu.org> ---
The master branch has been updated by H.J. Lu <address@hidden>:

https://sourceware.org/git/gitweb.cgi?p=binutils-gdb.git;h=0e70b27ba900581df8e23cbbd4612176f869d796

commit 0e70b27ba900581df8e23cbbd4612176f869d796
Author: H.J. Lu <address@hidden>
Date:   Mon Mar 5 03:44:46 2018 -0800

    Use binary search on dynamic relocations

    Replace linear search with binary search on dynamic relocations.  After
    finding a match, scan backward to the first matching relocation, then
    scan forward for a matching relocation with non-absolute symbol.

    On Fedora 27 x86-64, time for "objdump -d" on libxul.so from RHEL 7.4
    x86-64 went from

    134.46user 0.12system 2:15.03elapsed

    to

    8.49user 0.14system 0:08.64elapsed

        PR binutils/22911
        * objdump.c (is_significant_symbol_name): Return TRUE for all
        .plt* sections.
        (find_symbol_for_address): Replace linear search with binary
        search on dynamic relocations.

-- 
You are receiving this mail because:
You are on the CC list for the bug.