Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 | #ifndef _LINUX_PRIO_TREE_H #define _LINUX_PRIO_TREE_H /* * K&R 2nd ed. A8.3 somewhat obliquely hints that initial sequences of struct * fields with identical types should end up at the same location. We'll use * this until we can scrap struct raw_prio_tree_node. * * Note: all this could be done more elegantly by using unnamed union/struct * fields. However, gcc 2.95.3 and apparently also gcc 3.0.4 don't support this * language extension. */ struct raw_prio_tree_node { struct prio_tree_node *left; struct prio_tree_node *right; struct prio_tree_node *parent; }; struct prio_tree_node { struct prio_tree_node *left; struct prio_tree_node *right; struct prio_tree_node *parent; unsigned long start; unsigned long last; /* last location _in_ interval */ }; struct prio_tree_root { struct prio_tree_node *prio_tree_node; unsigned short index_bits; unsigned short raw; /* * 0: nodes are of type struct prio_tree_node * 1: nodes are of type raw_prio_tree_node */ }; struct prio_tree_iter { struct prio_tree_node *cur; unsigned long mask; unsigned long value; int size_level; struct prio_tree_root *root; pgoff_t r_index; pgoff_t h_index; }; static inline void prio_tree_iter_init(struct prio_tree_iter *iter, struct prio_tree_root *root, pgoff_t r_index, pgoff_t h_index) { iter->root = root; iter->r_index = r_index; iter->h_index = h_index; iter->cur = NULL; } #define __INIT_PRIO_TREE_ROOT(ptr, _raw) \ do { \ (ptr)->prio_tree_node = NULL; \ (ptr)->index_bits = 1; \ (ptr)->raw = (_raw); \ } while (0) #define INIT_PRIO_TREE_ROOT(ptr) __INIT_PRIO_TREE_ROOT(ptr, 0) #define INIT_RAW_PRIO_TREE_ROOT(ptr) __INIT_PRIO_TREE_ROOT(ptr, 1) #define INIT_PRIO_TREE_NODE(ptr) \ do { \ (ptr)->left = (ptr)->right = (ptr)->parent = (ptr); \ } while (0) #define INIT_PRIO_TREE_ITER(ptr) \ do { \ (ptr)->cur = NULL; \ (ptr)->mask = 0UL; \ (ptr)->value = 0UL; \ (ptr)->size_level = 0; \ } while (0) #define prio_tree_entry(ptr, type, member) \ ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) static inline int prio_tree_empty(const struct prio_tree_root *root) { return root->prio_tree_node == NULL; } static inline int prio_tree_root(const struct prio_tree_node *node) { return node->parent == node; } static inline int prio_tree_left_empty(const struct prio_tree_node *node) { return node->left == node; } static inline int prio_tree_right_empty(const struct prio_tree_node *node) { return node->right == node; } struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root, struct prio_tree_node *old, struct prio_tree_node *node); struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root, struct prio_tree_node *node); void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node); struct prio_tree_node *prio_tree_next(struct prio_tree_iter *iter); #define raw_prio_tree_replace(root, old, node) \ prio_tree_replace(root, (struct prio_tree_node *) (old), \ (struct prio_tree_node *) (node)) #define raw_prio_tree_insert(root, node) \ prio_tree_insert(root, (struct prio_tree_node *) (node)) #define raw_prio_tree_remove(root, node) \ prio_tree_remove(root, (struct prio_tree_node *) (node)) #endif /* _LINUX_PRIO_TREE_H */ |