23 	struct noop_data *nd = q->elevator->elevator_data;  in noop_dispatch()  local
25 	if (!list_empty(&nd->queue)) {  in noop_dispatch()
27 		rq = list_entry(nd->queue.next, struct request, queuelist);  in noop_dispatch()
37 	struct noop_data *nd = q->elevator->elevator_data;  in noop_add_request()  local
39 	list_add_tail(&rq->queuelist, &nd->queue);  in noop_add_request()
45 	struct noop_data *nd = q->elevator->elevator_data;  in noop_former_request()  local
47 	if (rq->queuelist.prev == &nd->queue)  in noop_former_request()
55 	struct noop_data *nd = q->elevator->elevator_data;  in noop_latter_request()  local
57 	if (rq->queuelist.next == &nd->queue)  in noop_latter_request()
64 	struct noop_data *nd;  in noop_init_queue()  local
71 	nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);  in noop_init_queue()
72 	if (!nd) {  in noop_init_queue()
76 	eq->elevator_data = nd;  in noop_init_queue()
78 	INIT_LIST_HEAD(&nd->queue);  in noop_init_queue()
88 	struct noop_data *nd = e->elevator_data;  in noop_exit_queue()  local
90 	BUG_ON(!list_empty(&nd->queue));  in noop_exit_queue()
91 	kfree(nd);  in noop_exit_queue()