69 	struct list_head	node;		/* service_queue->queued[] */  member
99 #define rb_entry_tg(node)	rb_entry((node), struct throtl_grp, rb_node)  argument
398 	INIT_LIST_HEAD(&qn->node);  in throtl_qnode_init()
417 	if (list_empty(&qn->node)) {  in throtl_qnode_add_bio()
418 		list_add_tail(&qn->node, queued);  in throtl_qnode_add_bio()
435 	qn = list_first_entry(queued, struct throtl_qnode, node);  in throtl_peek_queued()
464 	qn = list_first_entry(queued, struct throtl_qnode, node);  in throtl_pop_queued()
469 		list_del_init(&qn->node);  in throtl_pop_queued()
475 		list_move_tail(&qn->node, queued);  in throtl_pop_queued()
497 	tg = kzalloc_node(sizeof(*tg), gfp, q->node);  in throtl_pd_alloc()
680 	struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node;  in tg_service_queue_add()  local
686 	while (*node != NULL) {  in tg_service_queue_add()
687 		parent = *node;  in tg_service_queue_add()
691 			node = &parent->rb_left;  in tg_service_queue_add()
693 			node = &parent->rb_right;  in tg_service_queue_add()
698 	rb_link_node(&tg->rb_node, parent, node);  in tg_service_queue_add()
2420 	td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node);  in blk_throtl_init()