Searched refs:rb_node (Results 26 - 50 of 466) sorted by path

1234567891011>>

/linux-master/block/
H A Dbfq-iosched.h121 struct rb_node weights_node;
153 struct rb_node rb_node; member in struct:bfq_entity
272 struct rb_node pos_node;
1137 struct bfq_entity *bfq_entity_of(struct rb_node *node);
H A Dbfq-wf2q.c25 struct rb_node *node = tree->rb_node;
27 return rb_entry(node, struct bfq_entity, rb_node);
323 struct bfq_entity *bfq_entity_of(struct rb_node *node)
328 entity = rb_entry(node, struct bfq_entity, rb_node);
341 rb_erase(&entity->rb_node, root);
353 struct rb_node *next;
356 next = rb_next(&entity->rb_node);
361 next = rb_prev(&entity->rb_node);
382 struct rb_node **nod
[all...]
H A Dblk-mq.c321 RB_CLEAR_NODE(&rq->rb_node);
394 RB_CLEAR_NODE(&rq->rb_node);
H A Dblk-throttle.c44 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node)
361 RB_CLEAR_NODE(&tg->rb_node);
502 struct rb_node *n;
511 static void throtl_rb_erase(struct rb_node *n,
532 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node;
533 struct rb_node *parent = NULL;
550 rb_link_node(&tg->rb_node, parent, node);
551 rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree,
570 throtl_rb_erase(&tg->rb_node, parent_s
[all...]
H A Dblk-throttle.h72 struct rb_node rb_node; member in struct:throtl_grp
H A Delevator.c229 struct rb_node **p = &root->rb_node;
230 struct rb_node *parent = NULL;
235 __rq = rb_entry(parent, struct request, rb_node);
243 rb_link_node(&rq->rb_node, parent, p);
244 rb_insert_color(&rq->rb_node, root);
250 BUG_ON(RB_EMPTY_NODE(&rq->rb_node));
251 rb_erase(&rq->rb_node, root);
252 RB_CLEAR_NODE(&rq->rb_node);
258 struct rb_node *
[all...]
H A Delevator.h181 #define rb_entry_rq(node) rb_entry((node), struct request, rb_node)
H A Dmq-deadline.c137 struct rb_node *node = rb_prev(&rq->rb_node);
151 struct rb_node *node = rb_next(&rq->rb_node);
166 struct rb_node *node = per_prio->sort_list[data_dir].rb_node;
219 if (!RB_EMPTY_NODE(&rq->rb_node))
/linux-master/drivers/android/
H A Dbinder.c581 struct rb_node *n;
585 thread = rb_entry(n, struct binder_thread, rb_node);
698 struct rb_node *n = proc->nodes.rb_node;
704 node = rb_entry(n, struct binder_node, rb_node);
739 struct rb_node **p = &proc->nodes.rb_node;
740 struct rb_node *parent = NULL;
751 node = rb_entry(parent, struct binder_node, rb_node);
770 rb_link_node(&node->rb_node, paren
[all...]
H A Dbinder_alloc.c71 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);
[all...]
H A Dbinder_alloc.h24 * @rb_node: node for allocated_buffers/free_buffers rb trees
44 struct rb_node rb_node; /* free entry by size or allocated entry */ member in struct:binder_buffer
H A Dbinder_internal.h177 * @rb_node: element for proc->nodes tree
235 struct rb_node rb_node; member in union:binder_node::__anon78
320 struct rb_node rb_node_desc;
321 struct rb_node rb_node_node;
442 * @rb_node: element for proc->threads rbtree
478 struct rb_node rb_node; member in struct:binder_thread
/linux-master/drivers/base/regmap/
H A Dinternal.h209 struct rb_node node;
H A Dregcache-rbtree.c31 struct rb_node node;
66 struct rb_node *node;
78 node = rbtree_ctx->root.rb_node;
99 struct rb_node **new, *parent;
105 new = &root->rb_node;
137 struct rb_node *node;
215 struct rb_node *next;
373 struct rb_node *node;
402 node = rbtree_ctx->root.rb_node;
469 struct rb_node *nod
[all...]
H A Dregcache.c339 static int rbtree_all(const void *key, const struct rb_node *node)
361 struct rb_node *node;
H A Dregmap-debugfs.c548 struct rb_node *next;
H A Dregmap.c501 struct rb_node **new = &(root->rb_node), *parent = NULL;
525 struct rb_node *node = map->range_tree.rb_node;
544 struct rb_node *next;
/linux-master/drivers/block/drbd/
H A Ddrbd_interval.c10 sector_t interval_end(struct rb_node *node)
27 struct rb_node **new = &root->rb_node, *parent = NULL;
72 struct rb_node *node = root->rb_node;
120 struct rb_node *node = root->rb_node;
151 struct rb_node *node;
H A Ddrbd_interval.h9 struct rb_node rb;
/linux-master/drivers/block/
H A Dloop.c793 struct rb_node rb_node; member in struct:loop_worker
818 struct rb_node **node, *parent = NULL;
828 node = &lo->worker_tree.rb_node;
832 cur_worker = container_of(*node, struct loop_worker, rb_node);
864 rb_link_node(&worker->rb_node, parent, node);
865 rb_insert_color(&worker->rb_node, &lo->worker_tree);
903 rb_erase(&worker->rb_node, &lo->worker_tree);
H A Dpktcdvd.c641 struct rb_node *n = rb_next(&node->rb_node);
644 return rb_entry(n, struct pkt_rb_node, rb_node);
649 rb_erase(&node->rb_node, &pd->bio_queue);
660 struct rb_node *n = pd->bio_queue.rb_node;
661 struct rb_node *next;
670 tmp = rb_entry(n, struct pkt_rb_node, rb_node);
694 struct rb_node **p = &pd->bio_queue.rb_node;
[all...]
/linux-master/drivers/block/xen-blkback/
H A Dblkback.c171 struct rb_node **new = NULL, *parent = NULL;
181 new = &ring->persistent_gnts.rb_node;
209 struct rb_node *node = NULL;
211 node = ring->persistent_gnts.rb_node;
248 struct rb_node *n;
335 struct rb_node *n;
H A Dcommon.h247 struct rb_node node;
/linux-master/drivers/dma-buf/
H A Dsw_sync.c287 struct rb_node **p = &obj->pt_tree.rb_node;
288 struct rb_node *parent = NULL;
H A Dsync_debug.h63 struct rb_node node;

Completed in 538 milliseconds

1234567891011>>