diff options
| author | Linus Torvalds <torvalds@g5.osdl.org> | 2006-06-20 17:51:22 -0400 |
|---|---|---|
| committer | Linus Torvalds <torvalds@g5.osdl.org> | 2006-06-20 17:51:22 -0400 |
| commit | 2edc322d420a4cec8dbc184a1220ecd7fa9f8ae6 (patch) | |
| tree | e7be2cf442626316b6b6fb212960fe1f77ff2725 /include/linux | |
| parent | be967b7e2f7747a5ebf2a07ee627d9338491e784 (diff) | |
| parent | 2f3243aebd8df4d9eecaeca04bbff6c7dbfb2142 (diff) | |
Merge git://git.infradead.org/~dwmw2/rbtree-2.6
* git://git.infradead.org/~dwmw2/rbtree-2.6:
[RBTREE] Switch rb_colour() et al to en_US spelling of 'color' for consistency
Update UML kernel/physmem.c to use rb_parent() accessor macro
[RBTREE] Update hrtimers to use rb_parent() accessor macro.
[RBTREE] Add explicit alignment to sizeof(long) for struct rb_node.
[RBTREE] Merge colour and parent fields of struct rb_node.
[RBTREE] Remove dead code in rb_erase()
[RBTREE] Update JFFS2 to use rb_parent() accessor macro.
[RBTREE] Update eventpoll.c to use rb_parent() accessor macro.
[RBTREE] Update key.c to use rb_parent() accessor macro.
[RBTREE] Update ext3 to use rb_parent() accessor macro.
[RBTREE] Change rbtree off-tree marking in I/O schedulers.
[RBTREE] Add accessor macros for colour and parent fields of rb_node
Diffstat (limited to 'include/linux')
| -rw-r--r-- | include/linux/hrtimer.h | 2 | ||||
| -rw-r--r-- | include/linux/rbtree.h | 26 |
2 files changed, 22 insertions, 6 deletions
diff --git a/include/linux/hrtimer.h b/include/linux/hrtimer.h index 306acf1dc6d5..7d2a1b974c5e 100644 --- a/include/linux/hrtimer.h +++ b/include/linux/hrtimer.h | |||
| @@ -127,7 +127,7 @@ extern ktime_t hrtimer_get_next_event(void); | |||
| 127 | 127 | ||
| 128 | static inline int hrtimer_active(const struct hrtimer *timer) | 128 | static inline int hrtimer_active(const struct hrtimer *timer) |
| 129 | { | 129 | { |
| 130 | return timer->node.rb_parent != HRTIMER_INACTIVE; | 130 | return rb_parent(&timer->node) != &timer->node; |
| 131 | } | 131 | } |
| 132 | 132 | ||
| 133 | /* Forward a hrtimer so it expires after now: */ | 133 | /* Forward a hrtimer so it expires after now: */ |
diff --git a/include/linux/rbtree.h b/include/linux/rbtree.h index 4b7cc4fe366d..f37006f21664 100644 --- a/include/linux/rbtree.h +++ b/include/linux/rbtree.h | |||
| @@ -99,19 +99,36 @@ static inline struct page * rb_insert_page_cache(struct inode * inode, | |||
| 99 | 99 | ||
| 100 | struct rb_node | 100 | struct rb_node |
| 101 | { | 101 | { |
| 102 | struct rb_node *rb_parent; | 102 | unsigned long rb_parent_color; |
| 103 | int rb_color; | ||
| 104 | #define RB_RED 0 | 103 | #define RB_RED 0 |
| 105 | #define RB_BLACK 1 | 104 | #define RB_BLACK 1 |
| 106 | struct rb_node *rb_right; | 105 | struct rb_node *rb_right; |
| 107 | struct rb_node *rb_left; | 106 | struct rb_node *rb_left; |
| 108 | }; | 107 | } __attribute__((aligned(sizeof(long)))); |
| 108 | /* The alignment might seem pointless, but allegedly CRIS needs it */ | ||
| 109 | 109 | ||
| 110 | struct rb_root | 110 | struct rb_root |
| 111 | { | 111 | { |
| 112 | struct rb_node *rb_node; | 112 | struct rb_node *rb_node; |
| 113 | }; | 113 | }; |
| 114 | 114 | ||
| 115 | |||
| 116 | #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3)) | ||
| 117 | #define rb_color(r) ((r)->rb_parent_color & 1) | ||
| 118 | #define rb_is_red(r) (!rb_color(r)) | ||
| 119 | #define rb_is_black(r) rb_color(r) | ||
| 120 | #define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0) | ||
| 121 | #define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0) | ||
| 122 | |||
| 123 | static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) | ||
| 124 | { | ||
| 125 | rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p; | ||
| 126 | } | ||
| 127 | static inline void rb_set_color(struct rb_node *rb, int color) | ||
| 128 | { | ||
| 129 | rb->rb_parent_color = (rb->rb_parent_color & ~1) | color; | ||
| 130 | } | ||
| 131 | |||
| 115 | #define RB_ROOT (struct rb_root) { NULL, } | 132 | #define RB_ROOT (struct rb_root) { NULL, } |
| 116 | #define rb_entry(ptr, type, member) container_of(ptr, type, member) | 133 | #define rb_entry(ptr, type, member) container_of(ptr, type, member) |
| 117 | 134 | ||
| @@ -131,8 +148,7 @@ extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, | |||
| 131 | static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, | 148 | static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, |
| 132 | struct rb_node ** rb_link) | 149 | struct rb_node ** rb_link) |
| 133 | { | 150 | { |
| 134 | node->rb_parent = parent; | 151 | node->rb_parent_color = (unsigned long )parent; |
| 135 | node->rb_color = RB_RED; | ||
| 136 | node->rb_left = node->rb_right = NULL; | 152 | node->rb_left = node->rb_right = NULL; |
| 137 | 153 | ||
| 138 | *rb_link = node; | 154 | *rb_link = node; |
