drbd_interval.h 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #ifndef __DRBD_INTERVAL_H
  3. #define __DRBD_INTERVAL_H
  4. #include <linux/types.h>
  5. #include <linux/rbtree.h>
  6. struct drbd_interval {
  7. struct rb_node rb;
  8. sector_t sector; /* start sector of the interval */
  9. unsigned int size; /* size in bytes */
  10. sector_t end; /* highest interval end in subtree */
  11. unsigned int local:1 /* local or remote request? */;
  12. unsigned int waiting:1; /* someone is waiting for completion */
  13. unsigned int completed:1; /* this has been completed already;
  14. * ignore for conflict detection */
  15. };
  16. static inline void drbd_clear_interval(struct drbd_interval *i)
  17. {
  18. RB_CLEAR_NODE(&i->rb);
  19. }
  20. static inline bool drbd_interval_empty(struct drbd_interval *i)
  21. {
  22. return RB_EMPTY_NODE(&i->rb);
  23. }
  24. extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
  25. extern bool drbd_contains_interval(struct rb_root *, sector_t,
  26. struct drbd_interval *);
  27. extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
  28. extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
  29. unsigned int);
  30. extern struct drbd_interval *drbd_next_overlap(struct drbd_interval *, sector_t,
  31. unsigned int);
  32. #define drbd_for_each_overlap(i, root, sector, size) \
  33. for (i = drbd_find_overlap(root, sector, size); \
  34. i; \
  35. i = drbd_next_overlap(i, sector, size))
  36. #endif /* __DRBD_INTERVAL_H */