On Monday 21 November 2011 13:25:36 David Daney wrote:
On 11/20/2011 03:22 PM, Mike Frysinger wrote:
On Friday 18 November 2011 14:37:44 David Daney wrote:
+ switch (w2(ehdr-e_machine)) {
+ default:
+ fprintf(stderr, unrecognized e_machine %d %s\n,
+
On 11/20/2011 03:26 PM, H. Peter Anvin wrote:
On 11/18/2011 11:37 AM, David Daney wrote:
From: David Daneydavid.da...@cavium.com
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
On Monday 21 November 2011 14:16:04 David Daney wrote:
On 11/21/2011 10:50 AM, Mike Frysinger wrote:
On Monday 21 November 2011 13:25:36 David Daney wrote:
On 11/20/2011 03:22 PM, Mike Frysinger wrote:
On Friday 18 November 2011 14:37:44 David Daney wrote:
+switch
On Friday 18 November 2011 14:37:44 David Daney wrote:
--- /dev/null
+++ b/scripts/sortextable.c
+/*
+ * sortextable.c: Sort the kernel's exception table
+ *
+ * Copyright 2011 Cavium, Inc.
+ *
+ * Based on code taken from recortmcount.c which is:
seems like it'd be nice if the duplicate
On 11/18/2011 11:37 AM, David Daney wrote:
From: David Daney david.da...@cavium.com
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
On 11/20/2011 03:26 PM, H. Peter Anvin wrote:
On 11/18/2011 11:37 AM, David Daney wrote:
From: David Daney david.da...@cavium.com
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
On Sun, 2011-11-20 at 15:26 -0800, H. Peter Anvin wrote:
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.
Is the lookup time really an issue?
--
dwmw2
On 11/20/2011 03:28 PM, David Woodhouse wrote:
On Sun, 2011-11-20 at 15:26 -0800, H. Peter Anvin wrote:
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.
Is
From: David Daney david.da...@cavium.com
Using this build-time sort saves time booting as we don't have to burn
cycles sorting the exception table.
Signed-off-by: David Daney david.da...@cavium.com
---
scripts/.gitignore|1 +
scripts/Makefile |1 +
scripts/sortextable.c | 273
