ioprio.h 2.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. #ifndef IOPRIO_H
  2. #define IOPRIO_H
  3. #ifdef __KERNEL__
  4. #include <linux/sched.h>
  5. #include <linux/iocontext.h>
  6. #endif /* __KERNEL__ */
  7. /*
  8. * Gives us 8 prio classes with 13-bits of data for each class
  9. */
  10. #define IOPRIO_BITS (16)
  11. #define IOPRIO_CLASS_SHIFT (13)
  12. #ifdef __KERNEL__
  13. #define IOPRIO_PRIO_MASK ((1UL << IOPRIO_CLASS_SHIFT) - 1)
  14. #define IOPRIO_PRIO_CLASS(mask) ((mask) >> IOPRIO_CLASS_SHIFT)
  15. #define IOPRIO_PRIO_DATA(mask) ((mask) & IOPRIO_PRIO_MASK)
  16. #define IOPRIO_PRIO_VALUE(class, data) (((class) << IOPRIO_CLASS_SHIFT) | data)
  17. #define ioprio_valid(mask) (IOPRIO_PRIO_CLASS((mask)) != IOPRIO_CLASS_NONE)
  18. #endif /* __KERNEL__ */
  19. /*
  20. * These are the io priority groups as implemented by CFQ. RT is the realtime
  21. * class, it always gets premium service. BE is the best-effort scheduling
  22. * class, the default for any process. IDLE is the idle scheduling class, it
  23. * is only served when no one else is using the disk.
  24. */
  25. enum {
  26. IOPRIO_CLASS_NONE,
  27. IOPRIO_CLASS_RT,
  28. IOPRIO_CLASS_BE,
  29. IOPRIO_CLASS_IDLE,
  30. };
  31. /*
  32. * 8 best effort priority levels are supported
  33. */
  34. #define IOPRIO_BE_NR (8)
  35. enum {
  36. IOPRIO_WHO_PROCESS = 1,
  37. IOPRIO_WHO_PGRP,
  38. IOPRIO_WHO_USER,
  39. };
  40. #ifdef __KERNEL__
  41. /*
  42. * if process has set io priority explicitly, use that. if not, convert
  43. * the cpu scheduler nice value to an io priority
  44. */
  45. #define IOPRIO_NORM (4)
  46. static inline int task_ioprio(struct io_context *ioc)
  47. {
  48. if (ioprio_valid(ioc->ioprio))
  49. return IOPRIO_PRIO_DATA(ioc->ioprio);
  50. return IOPRIO_NORM;
  51. }
  52. static inline int task_ioprio_class(struct io_context *ioc)
  53. {
  54. if (ioprio_valid(ioc->ioprio))
  55. return IOPRIO_PRIO_CLASS(ioc->ioprio);
  56. return IOPRIO_CLASS_BE;
  57. }
  58. static inline int task_nice_ioprio(struct task_struct *task)
  59. {
  60. return (task_nice(task) + 20) / 5;
  61. }
  62. /*
  63. * This is for the case where the task hasn't asked for a specific IO class.
  64. * Check for idle and rt task process, and return appropriate IO class.
  65. */
  66. static inline int task_nice_ioclass(struct task_struct *task)
  67. {
  68. if (task->policy == SCHED_IDLE)
  69. return IOPRIO_CLASS_IDLE;
  70. else if (task->policy == SCHED_FIFO || task->policy == SCHED_RR)
  71. return IOPRIO_CLASS_RT;
  72. else
  73. return IOPRIO_CLASS_BE;
  74. }
  75. /*
  76. * For inheritance, return the highest of the two given priorities
  77. */
  78. extern int ioprio_best(unsigned short aprio, unsigned short bprio);
  79. extern int set_task_ioprio(struct task_struct *task, int ioprio);
  80. #endif /* __KERNEL__ */
  81. #endif /* IOPRIO_H */