Phil Carmody b1b1d4a6f2 parisc: unwind - optimise linked-list searches for modules ...

Having many dozens of modules, the searches down the linked
list of sections would dominate the lookup time, dwarfing
any savings from the binary search within the section.

A simple move-to-front optimisation exploits the commonality
of the code paths taken, and in simple real-world tests
on other architectures reduced the number of steps in the
search to barely more than 1.

Signed-off-by: Phil Carmody <ext-phil.2.carmody@nokia.com>
Signed-off-by: Kyle McMartin <kyle@redhat.com>

2010-10-21 21:12:19 -04:00

11 KiB

Raw Blame History

View Raw