| 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
| ||
|
Message-ID: <26e58eb6fd2aa699f49505a71d08813a.squirrel@www.firstfloor.org> Date: Tue, 21 Sep 2010 19:42:02 +0200 From: "Andi Kleen" <andi@...stfloor.org> To: "H. Peter Anvin" <hpa@...or.com> Cc: "Steven Rostedt" <rostedt@...dmis.org>, "Andi Kleen" <andi@...stfloor.org>, "Jason Baron" <jbaron@...hat.com>, linux-kernel@...r.kernel.org, mingo@...e.hu, mathieu.desnoyers@...ymtl.ca, tglx@...utronix.de, roland@...hat.com, rth@...hat.com, mhiramat@...hat.com, fweisbec@...il.com, avi@...hat.com, davem@...emloft.net, vgoyal@...hat.com, sam@...nborg.org, tony@...eyournoodle.com Subject: Re: [PATCH 03/10] jump label v11: base patch > > If all you need is exact matches -- as in this case -- hashes are > generally faster than binary anyway. Actually only if you have the whole thing in cache. The binary search has a much nicer access pattern if it's cache cold. And the footprint of directly accessing the section than having separate large list and tables is also significantly more compared to a compact table. But I don't think the access speed really matters here. Toggling trace points should be rare and is not a critical path operation. What matters is runtime overhead and simplicity. Right now on the simplicity front there is a problem. -Andi -- 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