linux-kernel - Re: [RFC] B+Tree library

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]

Message-Id: <1225458974.5546.6.camel@johannes.berg>
Date:	Fri, 31 Oct 2008 14:16:14 +0100
From:	Johannes Berg <johannes@...solutions.net>
To:	Jörn Engel <joern@...fs.org>
Cc:	linux-kernel@...r.kernel.org
Subject: Re: [RFC] B+Tree library


> +static inline size_t btree_visitorl(struct btree_headl *head, long opaque,
> +		visitorl_t func2)
> +{
> +	return btree_visitor(&head->h, &btree_geo32, opaque, visitorl, func2);
> +}

Incidentally, do you think it would be possible to implement a kind of 

btree_for_each_entry(e, ...) {
	do something with e
}

macro or function/macro combination? You seem to be doing a recursive
walk across the tree, would it be useful to have a linked list at the
lowest level of nodes to be able to iterate more easily?

johannes

Download attachment "signature.asc" of type "application/pgp-signature" (837 bytes)