[src/trunk]: src/sys/external/bsd/drm2/include/linux Move rbtree_postorder_fo...

[riastradh <riastradh%NetBSD.org@localhost>]

details:   https://anonhg.NetBSD.org/src/rev/af45540e4764
branches:  trunk
changeset: 1028052:af45540e4764
user:      riastradh <riastradh%NetBSD.org@localhost>
date:      Sun Dec 19 01:44:33 2021 +0000

description:
Move rbtree_postorder_for_each_entry_safe to linux/rbtree.h.

diffstat:

 sys/external/bsd/drm2/include/linux/interval_tree.h |  14 +-------------
 sys/external/bsd/drm2/include/linux/rbtree.h        |  14 +++++++++++++-
 2 files changed, 14 insertions(+), 14 deletions(-)

diffs (52 lines):

diff -r a6bae878c3c8 -r af45540e4764 sys/external/bsd/drm2/include/linux/interval_tree.h
--- a/sys/external/bsd/drm2/include/linux/interval_tree.h       Sun Dec 19 01:44:26 2021 +0000
+++ b/sys/external/bsd/drm2/include/linux/interval_tree.h       Sun Dec 19 01:44:33 2021 +0000
@@ -1,4 +1,4 @@
-/*     $NetBSD: interval_tree.h,v 1.9 2021/12/19 00:46:44 riastradh Exp $      */
+/*     $NetBSD: interval_tree.h,v 1.10 2021/12/19 01:44:33 riastradh Exp $     */
 
 /*-
  * Copyright (c) 2018 The NetBSD Foundation, Inc.
@@ -137,16 +137,4 @@
        return next;
 }
 
-/*
- * XXX This is not actually postorder, but I can't fathom why you would
- * want postorder for an ordered tree; different insertion orders lead
- * to different traversal orders.
- */
-#define        rbtree_postorder_for_each_entry_safe(NODE, TMP, ROOT, FIELD)          \
-       for ((NODE) = RB_TREE_MIN(&(ROOT)->rbr_tree);                         \
-               ((NODE) != NULL &&                                            \
-                   ((TMP) = rb_tree_iterate(&(ROOT)->rbr_tree, (NODE),       \
-                       RB_DIR_RIGHT)));                                      \
-               (NODE) = (TMP))
-
 #endif /* _LINUX_INTERVAL_TREE_H_ */
diff -r a6bae878c3c8 -r af45540e4764 sys/external/bsd/drm2/include/linux/rbtree.h
--- a/sys/external/bsd/drm2/include/linux/rbtree.h      Sun Dec 19 01:44:26 2021 +0000
+++ b/sys/external/bsd/drm2/include/linux/rbtree.h      Sun Dec 19 01:44:33 2021 +0000
@@ -1,4 +1,4 @@
-/*     $NetBSD: rbtree.h,v 1.6 2021/12/19 01:44:26 riastradh Exp $     */
+/*     $NetBSD: rbtree.h,v 1.7 2021/12/19 01:44:33 riastradh Exp $     */
 
 /*-
  * Copyright (c) 2013 The NetBSD Foundation, Inc.
@@ -64,4 +64,16 @@
        rb_erase(rbnode, &root->rbrc_root);
 }
 
+/*
+ * XXX This is not actually postorder, but I can't fathom why you would
+ * want postorder for an ordered tree; different insertion orders lead
+ * to different traversal orders.
+ */
+#define        rbtree_postorder_for_each_entry_safe(NODE, TMP, ROOT, FIELD)          \
+       for ((NODE) = RB_TREE_MIN(&(ROOT)->rbr_tree);                         \
+               ((NODE) != NULL &&                                            \
+                   ((TMP) = rb_tree_iterate(&(ROOT)->rbr_tree, (NODE),       \
+                       RB_DIR_RIGHT)));                                      \
+               (NODE) = (TMP))
+
 #endif  /* _LINUX_RBTREE_H_ */