drbd_interval.h 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546
  1. /* SPDX-License-Identifier: GPL-2.0-only */
  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. sector_t end; /* highest interval end in subtree */
  10. unsigned int size; /* size in bytes */
  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. /* to resume a partially successful drbd_al_begin_io_nonblock(); */
  16. unsigned int partially_in_al_next_enr;
  17. };
  18. static inline void drbd_clear_interval(struct drbd_interval *i)
  19. {
  20. RB_CLEAR_NODE(&i->rb);
  21. }
  22. static inline bool drbd_interval_empty(struct drbd_interval *i)
  23. {
  24. return RB_EMPTY_NODE(&i->rb);
  25. }
  26. extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
  27. extern bool drbd_contains_interval(struct rb_root *, sector_t,
  28. struct drbd_interval *);
  29. extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
  30. extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
  31. unsigned int);
  32. extern struct drbd_interval *drbd_next_overlap(struct drbd_interval *, sector_t,
  33. unsigned int);
  34. #define drbd_for_each_overlap(i, root, sector, size) \
  35. for (i = drbd_find_overlap(root, sector, size); \
  36. i; \
  37. i = drbd_next_overlap(i, sector, size))
  38. #endif /* __DRBD_INTERVAL_H */