| 1 |
|
| 2 | #ifndef __DRBD_INTERVAL_H
|
| 3 | #define __DRBD_INTERVAL_H
|
| 4 |
|
| 5 | #include <linux/types.h>
|
| 6 | #include <linux/rbtree.h>
|
| 7 |
|
| 8 | struct drbd_interval {
|
| 9 | struct rb_node rb;
|
| 10 | sector_t sector;
|
| 11 | sector_t end;
|
| 12 | unsigned int size;
|
| 13 | unsigned int local:1 ;
|
| 14 | unsigned int waiting:1;
|
| 15 | unsigned int completed:1; |
| 16 | * ignore for conflict detection
|
| 17 |
|
| 18 |
|
| 19 | unsigned int partially_in_al_next_enr;
|
| 20 | };
|
| 21 |
|
| 22 | static inline void drbd_clear_interval(struct drbd_interval *i)
|
| 23 | {
|
| 24 | RB_CLEAR_NODE(&i->rb);
|
| 25 | }
|
| 26 |
|
| 27 | static inline bool drbd_interval_empty(struct drbd_interval *i)
|
| 28 | {
|
| 29 | return RB_EMPTY_NODE(&i->rb);
|
| 30 | }
|
| 31 |
|
| 32 | extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
|
| 33 | extern bool drbd_contains_interval(struct rb_root *, sector_t,
|
| 34 | struct drbd_interval *);
|
| 35 | extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
|
| 36 | extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
|
| 37 | unsigned int);
|
| 38 | extern struct drbd_interval *drbd_next_overlap(struct drbd_interval *, sector_t,
|
| 39 | unsigned int);
|
| 40 |
|
| 41 | #define drbd_for_each_overlap(i, root, sector, size) \
|
| 42 | for (i = drbd_find_overlap(root, sector, size); \
|
| 43 | i; \
|
| 44 | i = drbd_next_overlap(i, sector, size))
|
| 45 |
|
| 46 | #endif
|