ioprio.h 2.0 KB

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