Lines Matching defs:node
70 struct list_head node; /* service_queue->queued[] */
100 #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node)
312 /* intermediate node or iops isn't 0 */
342 /* intermediate node or bps isn't 0 */
399 INIT_LIST_HEAD(&qn->node);
418 if (list_empty(&qn->node)) {
419 list_add_tail(&qn->node, queued);
436 qn = list_first_entry(queued, struct throtl_qnode, node);
465 qn = list_first_entry(queued, struct throtl_qnode, node);
470 list_del_init(&qn->node);
476 list_move_tail(&qn->node, queued);
498 tg = kzalloc_node(sizeof(*tg), gfp, q->node);
675 struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node;
681 while (*node != NULL) {
682 parent = *node;
686 node = &parent->rb_left;
688 node = &parent->rb_right;
693 rb_link_node(&tg->rb_node, parent, node);
1848 /* tg should not be an intermediate node */
2449 td = kzalloc_node(sizeof(*td), GFP_KERNEL, q->node);