blob: f38fcb00c10d6c39b09c334483d80296b463e608 [file] [log] [blame]
Andreas Gruenbacher0939b0e2011-01-03 17:42:00 +01001#ifndef __DRBD_INTERVAL_H
2#define __DRBD_INTERVAL_H
3
4#include <linux/types.h>
5#include <linux/rbtree.h>
6
7struct drbd_interval {
8 struct rb_node rb;
9 sector_t sector; /* start sector of the interval */
10 unsigned int size; /* size in bytes */
11 sector_t end; /* highest interval end in subtree */
Andreas Gruenbacher5e472262011-01-27 14:42:51 +010012 int local:1 /* local or remote request? */;
Andreas Gruenbacher53840642011-01-28 10:31:04 +010013 int waiting:1;
Andreas Gruenbacher0939b0e2011-01-03 17:42:00 +010014};
15
16static inline void drbd_clear_interval(struct drbd_interval *i)
17{
18 RB_CLEAR_NODE(&i->rb);
19}
20
21static inline bool drbd_interval_empty(struct drbd_interval *i)
22{
23 return RB_EMPTY_NODE(&i->rb);
24}
25
Andreas Gruenbacherd0e22a22011-02-17 18:11:24 +010026extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
27extern bool drbd_contains_interval(struct rb_root *, sector_t,
28 struct drbd_interval *);
29extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
30extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
Andreas Gruenbacher0939b0e2011-01-03 17:42:00 +010031 unsigned int);
Andreas Gruenbacherd0e22a22011-02-17 18:11:24 +010032extern struct drbd_interval *drbd_next_overlap(struct drbd_interval *, sector_t,
33 unsigned int);
34
35#define drbd_for_each_overlap(i, root, sector, size) \
36 for (i = drbd_find_overlap(root, sector, size); \
37 i; \
38 i = drbd_next_overlap(i, sector, size))
Andreas Gruenbacher0939b0e2011-01-03 17:42:00 +010039
40#endif /* __DRBD_INTERVAL_H */