bcachefs: delete some dead code

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>

diff --git a/fs/bcachefs/util.h b/fs/bcachefs/util.h
index 9caf2487ee6323e0288a1f1250f30e2adc501ef8..cb6bed68abf894a3eb53967f638abc4da5e06d5b 100644 (file)
--- a/fs/bcachefs/util.h
+++ b/fs/bcachefs/util.h
@@ -455,96 +455,12 @@ do {                                                                      \
                            (var)->p_term_inverse, 1, INT_MAX);         \
 } while (0)
 
-#define __DIV_SAFE(n, d, zero)                                         \
-({                                                                     \
-       typeof(n) _n = (n);                                             \
-       typeof(d) _d = (d);                                             \
-       _d ? _n / _d : zero;                                            \
-})
-
-#define DIV_SAFE(n, d) __DIV_SAFE(n, d, 0)
-
 #define container_of_or_null(ptr, type, member)                                \
 ({                                                                     \
        typeof(ptr) _ptr = ptr;                                         \
        _ptr ? container_of(_ptr, type, member) : NULL;                 \
 })
 
-#define RB_INSERT(root, new, member, cmp)                              \
-({                                                                     \
-       __label__ dup;                                                  \
-       struct rb_node **n = &(root)->rb_node, *parent = NULL;          \
-       typeof(new) this;                                               \
-       int res, ret = -1;                                              \
-                                                                       \
-       while (*n) {                                                    \
-               parent = *n;                                            \
-               this = container_of(*n, typeof(*(new)), member);        \
-               res = cmp(new, this);                                   \
-               if (!res)                                               \
-                       goto dup;                                       \
-               n = res < 0                                             \
-                       ? &(*n)->rb_left                                \
-                       : &(*n)->rb_right;                              \
-       }                                                               \
-                                                                       \
-       rb_link_node(&(new)->member, parent, n);                        \
-       rb_insert_color(&(new)->member, root);                          \
-       ret = 0;                                                        \
-dup:                                                                   \
-       ret;                                                            \
-})
-
-#define RB_SEARCH(root, search, member, cmp)                           \
-({                                                                     \
-       struct rb_node *n = (root)->rb_node;                            \
-       typeof(&(search)) this, ret = NULL;                             \
-       int res;                                                        \
-                                                                       \
-       while (n) {                                                     \
-               this = container_of(n, typeof(search), member);         \
-               res = cmp(&(search), this);                             \
-               if (!res) {                                             \
-                       ret = this;                                     \
-                       break;                                          \
-               }                                                       \
-               n = res < 0                                             \
-                       ? n->rb_left                                    \
-                       : n->rb_right;                                  \
-       }                                                               \
-       ret;                                                            \
-})
-
-#define RB_GREATER(root, search, member, cmp)                          \
-({                                                                     \
-       struct rb_node *n = (root)->rb_node;                            \
-       typeof(&(search)) this, ret = NULL;                             \
-       int res;                                                        \
-                                                                       \
-       while (n) {                                                     \
-               this = container_of(n, typeof(search), member);         \
-               res = cmp(&(search), this);                             \
-               if (res < 0) {                                          \
-                       ret = this;                                     \
-                       n = n->rb_left;                                 \
-               } else                                                  \
-                       n = n->rb_right;                                \
-       }                                                               \
-       ret;                                                            \
-})
-
-#define RB_FIRST(root, type, member)                                   \
-       container_of_or_null(rb_first(root), type, member)
-
-#define RB_LAST(root, type, member)                                    \
-       container_of_or_null(rb_last(root), type, member)
-
-#define RB_NEXT(ptr, member)                                           \
-       container_of_or_null(rb_next(&(ptr)->member), typeof(*ptr), member)
-
-#define RB_PREV(ptr, member)                                           \
-       container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
-
 /* Does linear interpolation between powers of two */
 static inline unsigned fract_exp_two(unsigned x, unsigned fract_bits)
 {