Lines Matching refs:rb_node
71 struct rb_node **p = &alloc->free_buffers.rb_node;
72 struct rb_node *parent = NULL;
87 buffer = rb_entry(parent, struct binder_buffer, rb_node);
97 rb_link_node(&new_buffer->rb_node, parent, p);
98 rb_insert_color(&new_buffer->rb_node, &alloc->free_buffers);
104 struct rb_node **p = &alloc->allocated_buffers.rb_node;
105 struct rb_node *parent = NULL;
112 buffer = rb_entry(parent, struct binder_buffer, rb_node);
122 rb_link_node(&new_buffer->rb_node, parent, p);
123 rb_insert_color(&new_buffer->rb_node, &alloc->allocated_buffers);
130 struct rb_node *n = alloc->allocated_buffers.rb_node;
134 buffer = rb_entry(n, struct binder_buffer, rb_node);
356 struct rb_node *n;
359 buffer = rb_entry(n, struct binder_buffer, rb_node);
368 buffer = rb_entry(n, struct binder_buffer, rb_node);
396 struct rb_node *n;
409 buffer = rb_entry(n, struct binder_buffer, rb_node);
442 struct rb_node *n = alloc->free_buffers.rb_node;
443 struct rb_node *best_fit = NULL;
458 buffer = rb_entry(n, struct binder_buffer, rb_node);
484 buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
510 rb_erase(&buffer->rb_node, &alloc->free_buffers);
690 rb_erase(&buffer->rb_node, &alloc->allocated_buffers);
696 rb_erase(&next->rb_node, &alloc->free_buffers);
705 rb_erase(&prev->rb_node, &alloc->free_buffers);
891 struct rb_node *n;
900 buffer = rb_entry(n, struct binder_buffer, rb_node);
965 struct rb_node *n;
969 buffer = rb_entry(n, struct binder_buffer, rb_node);
1023 struct rb_node *n;