On 11/18/2011 11:37 AM, David Daney wrote: > From: David Daney <david.daney@xxxxxxxxxx> > > Using this build-time sort saves time booting as we don't have to burn > cycles sorting the exception table. > If we're going to do this at build time, I would suggest using a collisionless hash instead. The lookup time for those are O(1), but they definitely need to be done at build time. -hpa
