rbtree-clarify-documentation-of-rbtree_postorder_for_each_entry_safe-fix

s/this function/rbtree_postorder_for_each_entry_safe()/ (it isn't a function!)

Cc: Cody P Schafer <dev@codyps.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>

diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h
index 39de3df59e5ae95231817752de2753e3f610293c..a5aa7ae671f42d64727ebc2df1ba2950cebae66f 100644 (file)
--- a/include/linux/rbtree.h
+++ b/include/linux/rbtree.h
@@ -109,9 +109,9 @@ static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent
  * @root:      'rb_root *' of the rbtree.
  * @field:     the name of the rb_node field within 'type'.
  *
- * This function provides a similar guarantee as list_for_each_entry_safe() and
- * allows the iteration to continue independent of changes to @pos by the body
- * of the loop.
+ * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as
+ * list_for_each_entry_safe() and allows the 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