29 	struct rb_node		node;  member
40 	struct rb_node *node;  in pm_show_wakelocks()  local
46 	for (node = rb_first(&wakelocks_tree); node; node = rb_next(node)) {  in pm_show_wakelocks()
47 		wl = rb_entry(node, struct wakelock, node);  in pm_show_wakelocks()
122 			rb_erase(&wl->node, &wakelocks_tree);  in __wakelocks_gc()
150 	struct rb_node **node = &wakelocks_tree.rb_node;  in wakelock_lookup_add()  local
151 	struct rb_node *parent = *node;  in wakelock_lookup_add()
154 	while (*node) {  in wakelock_lookup_add()
157 		parent = *node;  in wakelock_lookup_add()
158 		wl = rb_entry(*node, struct wakelock, node);  in wakelock_lookup_add()
167 			node = &(*node)->rb_left;  in wakelock_lookup_add()
169 			node = &(*node)->rb_right;  in wakelock_lookup_add()
196 	rb_link_node(&wl->node, parent, node);  in wakelock_lookup_add()
197 	rb_insert_color(&wl->node, &wakelocks_tree);  in wakelock_lookup_add()