Lines Matching refs:node
32 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) argument
145 INIT_LIST_HEAD(&qn->node); in throtl_qnode_init()
164 if (list_empty(&qn->node)) { in throtl_qnode_add_bio()
165 list_add_tail(&qn->node, queued); in throtl_qnode_add_bio()
182 qn = list_first_entry(queued, struct throtl_qnode, node); in throtl_peek_queued()
211 qn = list_first_entry(queued, struct throtl_qnode, node); in throtl_pop_queued()
216 list_del_init(&qn->node); in throtl_pop_queued()
222 list_move_tail(&qn->node, queued); in throtl_pop_queued()
375 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; in tg_service_queue_add() local
381 while (*node != NULL) { in tg_service_queue_add()
382 parent = *node; in tg_service_queue_add()
386 node = &parent->rb_left; in tg_service_queue_add()
388 node = &parent->rb_right; in tg_service_queue_add()
393 rb_link_node(&tg->rb_node, parent, node); in tg_service_queue_add()
1207 td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node); in blk_throtl_init()