block/drbd/drbd_interval.h

0001 /* SPDX-License-Identifier: GPL-2.0 */
0002 #ifndef __DRBD_INTERVAL_H
0003 #define __DRBD_INTERVAL_H
0004
0005 #include <linux/types.h>
0006 #include <linux/rbtree.h>
0007
0008 struct drbd_interval {
0009     struct rb_node rb;
0010     sector_t sector;        /* start sector of the interval */
0011     unsigned int size;      /* size in bytes */
0012     sector_t end;           /* highest interval end in subtree */
0013     unsigned int local:1        /* local or remote request? */;
0014     unsigned int waiting:1;     /* someone is waiting for completion */
0015     unsigned int completed:1;   /* this has been completed already;
0016                      * ignore for conflict detection */
0017 };
0018
0019 static inline void drbd_clear_interval(struct drbd_interval *i)
0020 {
0021     RB_CLEAR_NODE(&i->rb);
0022 }
0023
0024 static inline bool drbd_interval_empty(struct drbd_interval *i)
0025 {
0026     return RB_EMPTY_NODE(&i->rb);
0027 }
0028
0029 extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
0030 extern bool drbd_contains_interval(struct rb_root *, sector_t,
0031                    struct drbd_interval *);
0032 extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
0033 extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
0034                     unsigned int);
0035 extern struct drbd_interval *drbd_next_overlap(struct drbd_interval *, sector_t,
0036                     unsigned int);
0037
0038 #define drbd_for_each_overlap(i, root, sector, size)        \
0039     for (i = drbd_find_overlap(root, sector, size);     \
0040          i;                         \
0041          i = drbd_next_overlap(i, sector, size))
0042
0043 #endif  /* __DRBD_INTERVAL_H */