To: Arjan van de Ven <arjan@infradead.org>
Cc: "Peter Teoh" <htmldeveloper@gmail.com>,
       LKML <linux-kernel@vger.kernel.org>, "Sam Ravnborg" <sam@ravnborg.org>
Subject: Re: A question sort_main_extable()
From: Andi Kleen <andi@firstfloor.org>
References: <804dabb00811202142y799fb70dxf89a1fc3514d78b1@mail.gmail.com>
	<20081120214717.1a02a9af@infradead.org>
Date: Sun, 23 Nov 2008 20:45:57 +0100
In-Reply-To: <20081120214717.1a02a9af@infradead.org> (Arjan van de Ven's message of "Thu, 20 Nov 2008 21:47:17 -0800")
Message-ID: <87ej12i5u2.fsf@basil.nowhere.org>
User-Agent: Gnus/5.1008 (Gnus v5.10.8) Emacs/21.3 (gnu/linux)
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Sender: linux-kernel-owner@vger.kernel.org
Content-Length: 880
Lines: 27

Arjan van de Ven <arjan@infradead.org> writes:
>
> we used to do this but it was a pain and extremely fragile. Runtime
> sorting makes it very robust at least.

It's not only extremly fragile, but just broken with out of line
section which gcc also generates these days.

>
> The sort is really quick though; I've spent a lot of time on boot time
> and this guy never showed up for me.

If you really wanted to speed it up you could actually just switch
over to a bubble sort. It's typically the best algorithm for nearly
already sorted input data, which this is.

But then as you say it's not worth it.

-Andi

-- 
ak@linux.intel.com
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/