lkml.org 
[lkml]   [2020]   [Mar]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] rbtree: introduce three helpers about sort-order iteration
On Tue, Mar 10, 2020 at 12:02:14AM +0800, qiwuchen55@gmail.com wrote:
> +/**
> + * rbtree_for_each_entry_safe - iterate in sort-order over of given type
> + * allowing the backing memory of @pos to be invalidated.
> + * @pos: the 'type *' to use as a loop cursor.
> + * @n: another 'type *' to use as temporary storage.
> + * @root: 'rb_root *' of the rbtree.
> + * @field: the name of the rb_node field within 'type'.
> + *
> + * rbtree_order_for_each_entry_safe() provides a similar guarantee as
> + * list_for_each_entry_safe() and allows the sort-order iteration to
> + * continue independent of changes to @pos by the body of the loop.
> + *
> + * Note, however, that it cannot handle other modifications that re-order the
> + * rbtree it is iterating over. This includes calling rb_erase() on @pos, as
> + * rb_erase() may rebalance the tree, causing us to miss some nodes.
> + */
> +#define rbtree_for_each_entry_safe(pos, n, root, field) \
> + for (pos = rb_entry_safe(rb_first(root), typeof(*pos), field); \
> + pos && ({ n = rb_entry_safe(rb_next(&pos->field), \
> + typeof(*pos), field); 1; }); \
> + pos = n)

Since this cannot deal with rb_erase(), what exactly is the purpose of
this thing?

\
 
 \ /
  Last update: 2020-03-09 17:56    [W:0.046 / U:2.716 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site