linux-kernel - Re: [PATCH] ulist: generic data structure to build unique lists

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 for Android: free password hash cracker in your pocket

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

Date:	Thu, 20 Oct 2011 18:56:16 +0200
From:	Arne Jansen <lists@...-jansens.de>
To:	Arne Jansen <sensille@....net>
CC:	linux-kernel@...r.kernel.org, akpm@...ux-foundation.org
Subject: Re: [PATCH] ulist: generic data structure to build unique lists

On 20.10.2011 16:50, Arne Jansen wrote:

> + * This function is used to iterate an ulist. The iteration is started with
> + * @prev = %NULL. It returns the next element from the ulist or %NULL when the
> + * end is reached. No guarantee is made with respect to the order in which
> + * the elements are returned. They might neither be returned in order of
> + * addition nor in ascending order.
> + * It is allowed to call ulist_add during an enumeration. Newly added items
> + * are guaranteed to show up in the running enumeration.

Thinking twice about it this guarantee most probably implies that the
items are returned  in order of addition. This is currently the case.

> + */
--
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/