| 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: <20171201235223.GX692@shells.gnugeneration.com> Date: Fri, 1 Dec 2017 15:52:23 -0800 From: Vito Caputo <vcaputo@...garu.com> To: linux-kernel <linux-kernel@...r.kernel.org> Cc: dave@...olabs.net, linux-doc@...r.kernel.org Subject: [PATCH] rbtree.txt: fix typo in cached rbtree section --- Documentation/rbtree.txt | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Documentation/rbtree.txt b/Documentation/rbtree.txt index c42a21b99046..3a4c23bc90b2 100644 --- a/Documentation/rbtree.txt +++ b/Documentation/rbtree.txt @@ -197,9 +197,9 @@ Cached rbtrees -------------- Computing the leftmost (smallest) node is quite a common task for binary -search trees, such as for traversals or users relying on a the particular -order for their own logic. To this end, users can use 'struct rb_root_cached' -to optimize O(logN) rb_first() calls to a simple pointer fetch avoiding +search trees, such as for traversals or users relying on a particular order +for their own logic. To this end, users can use 'struct rb_root_cached' to +optimize O(logN) rb_first() calls to a simple pointer fetch avoiding potentially expensive tree iterations. This is done at negligible runtime overhead for maintanence; albeit larger memory footprint. -- 2.11.0
Powered by blists - more mailing lists