usnic_uiom_interval_tree.h 3.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. /*
  2. * Copyright (c) 2013, Cisco Systems, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. */
  33. #ifndef USNIC_UIOM_INTERVAL_TREE_H_
  34. #define USNIC_UIOM_INTERVAL_TREE_H_
  35. #include <linux/rbtree.h>
  36. struct usnic_uiom_interval_node {
  37. struct rb_node rb;
  38. struct list_head link;
  39. unsigned long start;
  40. unsigned long last;
  41. unsigned long __subtree_last;
  42. unsigned int ref_cnt;
  43. int flags;
  44. };
  45. extern void
  46. usnic_uiom_interval_tree_insert(struct usnic_uiom_interval_node *node,
  47. struct rb_root_cached *root);
  48. extern void
  49. usnic_uiom_interval_tree_remove(struct usnic_uiom_interval_node *node,
  50. struct rb_root_cached *root);
  51. extern struct usnic_uiom_interval_node *
  52. usnic_uiom_interval_tree_iter_first(struct rb_root_cached *root,
  53. unsigned long start,
  54. unsigned long last);
  55. extern struct usnic_uiom_interval_node *
  56. usnic_uiom_interval_tree_iter_next(struct usnic_uiom_interval_node *node,
  57. unsigned long start, unsigned long last);
  58. /*
  59. * Inserts {start...last} into {root}. If there are overlaps,
  60. * nodes will be broken up and merged
  61. */
  62. int usnic_uiom_insert_interval(struct rb_root_cached *root,
  63. unsigned long start, unsigned long last,
  64. int flags);
  65. /*
  66. * Removed {start...last} from {root}. The nodes removed are returned in
  67. * 'removed.' The caller is responsibile for freeing memory of nodes in
  68. * 'removed.'
  69. */
  70. void usnic_uiom_remove_interval(struct rb_root_cached *root,
  71. unsigned long start, unsigned long last,
  72. struct list_head *removed);
  73. /*
  74. * Returns {start...last} - {root} (relative complement of {start...last} in
  75. * {root}) in diff_set sorted ascendingly
  76. */
  77. int usnic_uiom_get_intervals_diff(unsigned long start,
  78. unsigned long last, int flags,
  79. int flag_mask,
  80. struct rb_root_cached *root,
  81. struct list_head *diff_set);
  82. /* Call this to free diff_set returned by usnic_uiom_get_intervals_diff */
  83. void usnic_uiom_put_interval_set(struct list_head *intervals);
  84. #endif /* USNIC_UIOM_INTERVAL_TREE_H_ */