linux-kernel - [PATCH v2 3/3] [RFC] Generic Red-Black Trees

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

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:	Thu, 31 May 2012 18:30:10 -0500
From:	Daniel Santos <danielfsantos@....net>
To:	linux-kernel@...r.kernel.org
CC:	Kent Overstreet <koverstreet@...gle.com>, tj@...nel.org,
	Peter Zijlstra <peterz@...radead.org>, axboe@...nel.dk,
	paul.gortmaker@...driver.com, Andi Kleen <andi@...stfloor.org>,
	jack@...e.cz, Andrea Arcangeli <aarcange@...hat.com>,
	John Stultz <john.stultz@...aro.org>
Subject: [PATCH v2 3/3] [RFC] Generic Red-Black Trees

I've put a few performance notes in comments.  Specifically, I'm curious
if an inline function that expands to 128+ bytes like this should
possibly be wrapped in an __attribute__((flatten))
__attribute__((noinline)) function to force full expansion in one place
and then prevent it from getting inlined elsewhere (to keep the
generated code size down).

View attachment "0008-Use-generic-rbtree-impl-in-fair-scheduler.patch" of type "text/x-patch" (3360 bytes)