noop-iosched.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  1. /*
  2. * elevator noop
  3. */
  4. #include <linux/blkdev.h>
  5. #include <linux/elevator.h>
  6. #include <linux/bio.h>
  7. #include <linux/module.h>
  8. #include <linux/slab.h>
  9. #include <linux/init.h>
  10. struct noop_data {
  11. struct list_head queue;
  12. };
  13. static void noop_merged_requests(struct request_queue *q, struct request *rq,
  14. struct request *next)
  15. {
  16. list_del_init(&next->queuelist);
  17. }
  18. static int noop_dispatch(struct request_queue *q, int force)
  19. {
  20. struct noop_data *nd = q->elevator->elevator_data;
  21. if (!list_empty(&nd->queue)) {
  22. struct request *rq;
  23. rq = list_entry(nd->queue.next, struct request, queuelist);
  24. list_del_init(&rq->queuelist);
  25. elv_dispatch_sort(q, rq);
  26. return 1;
  27. }
  28. return 0;
  29. }
  30. static void noop_add_request(struct request_queue *q, struct request *rq)
  31. {
  32. struct noop_data *nd = q->elevator->elevator_data;
  33. list_add_tail(&rq->queuelist, &nd->queue);
  34. }
  35. static int noop_queue_empty(struct request_queue *q)
  36. {
  37. struct noop_data *nd = q->elevator->elevator_data;
  38. return list_empty(&nd->queue);
  39. }
  40. static struct request *
  41. noop_former_request(struct request_queue *q, struct request *rq)
  42. {
  43. struct noop_data *nd = q->elevator->elevator_data;
  44. if (rq->queuelist.prev == &nd->queue)
  45. return NULL;
  46. return list_entry(rq->queuelist.prev, struct request, queuelist);
  47. }
  48. static struct request *
  49. noop_latter_request(struct request_queue *q, struct request *rq)
  50. {
  51. struct noop_data *nd = q->elevator->elevator_data;
  52. if (rq->queuelist.next == &nd->queue)
  53. return NULL;
  54. return list_entry(rq->queuelist.next, struct request, queuelist);
  55. }
  56. static void *noop_init_queue(struct request_queue *q)
  57. {
  58. struct noop_data *nd;
  59. nd = kmalloc_node(sizeof(*nd), GFP_KERNEL, q->node);
  60. if (!nd)
  61. return NULL;
  62. INIT_LIST_HEAD(&nd->queue);
  63. return nd;
  64. }
  65. static void noop_exit_queue(struct elevator_queue *e)
  66. {
  67. struct noop_data *nd = e->elevator_data;
  68. BUG_ON(!list_empty(&nd->queue));
  69. kfree(nd);
  70. }
  71. static struct elevator_type elevator_noop = {
  72. .ops = {
  73. .elevator_merge_req_fn = noop_merged_requests,
  74. .elevator_dispatch_fn = noop_dispatch,
  75. .elevator_add_req_fn = noop_add_request,
  76. .elevator_queue_empty_fn = noop_queue_empty,
  77. .elevator_former_req_fn = noop_former_request,
  78. .elevator_latter_req_fn = noop_latter_request,
  79. .elevator_init_fn = noop_init_queue,
  80. .elevator_exit_fn = noop_exit_queue,
  81. },
  82. .elevator_name = "noop",
  83. .elevator_owner = THIS_MODULE,
  84. };
  85. static int __init noop_init(void)
  86. {
  87. elv_register(&elevator_noop);
  88. return 0;
  89. }
  90. static void __exit noop_exit(void)
  91. {
  92. elv_unregister(&elevator_noop);
  93. }
  94. module_init(noop_init);
  95. module_exit(noop_exit);
  96. MODULE_AUTHOR("Jens Axboe");
  97. MODULE_LICENSE("GPL");
  98. MODULE_DESCRIPTION("No-op IO scheduler");