tree 7fbdf118088f9d3746f384ea26312548ba5719dd
parent f720817700de48a57f54535a5dd9783cca2d2d6b
author Phil Carmody <ext-phil.2.carmody@nokia.com> 1284115679 +0300
committer Kyle McMartin <kyle@mcmartin.ca> 1287709939 -0400

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>