lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
Open Source and information security mailing list archives
| ||
|
Date: Sun, 23 Nov 2008 20:45:57 +0100 From: Andi Kleen <andi@...stfloor.org> To: Arjan van de Ven <arjan@...radead.org> Cc: "Peter Teoh" <htmldeveloper@...il.com>, LKML <linux-kernel@...r.kernel.org>, "Sam Ravnborg" <sam@...nborg.org> Subject: Re: A question sort_main_extable() Arjan van de Ven <arjan@...radead.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@...ux.intel.com -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists