1 /* SPDX-License-Identifier: GPL-2.0 */ 1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _LINUX_SCHED_PRIO_H 2 #ifndef _LINUX_SCHED_PRIO_H
3 #define _LINUX_SCHED_PRIO_H 3 #define _LINUX_SCHED_PRIO_H
4 4
5 #define MAX_NICE 19 5 #define MAX_NICE 19
6 #define MIN_NICE -20 6 #define MIN_NICE -20
7 #define NICE_WIDTH (MAX_NICE - MIN_NICE + 7 #define NICE_WIDTH (MAX_NICE - MIN_NICE + 1)
8 8
9 /* 9 /*
10 * Priority of a process goes from 0..MAX_PRIO 10 * Priority of a process goes from 0..MAX_PRIO-1, valid RT
11 * priority is 0..MAX_RT_PRIO-1, and SCHED_NOR 11 * priority is 0..MAX_RT_PRIO-1, and SCHED_NORMAL/SCHED_BATCH
12 * tasks are in the range MAX_RT_PRIO..MAX_PRI 12 * tasks are in the range MAX_RT_PRIO..MAX_PRIO-1. Priority
13 * values are inverted: lower p->prio value me 13 * values are inverted: lower p->prio value means higher priority.
>> 14 *
>> 15 * The MAX_USER_RT_PRIO value allows the actual maximum
>> 16 * RT priority to be separate from the value exported to
>> 17 * user-space. This allows kernel threads to set their
>> 18 * priority to a value higher than any user task. Note:
>> 19 * MAX_RT_PRIO must not be smaller than MAX_USER_RT_PRIO.
14 */ 20 */
15 21
16 #define MAX_RT_PRIO 100 !! 22 #define MAX_USER_RT_PRIO 100
>> 23 #define MAX_RT_PRIO MAX_USER_RT_PRIO
17 24
18 #define MAX_PRIO (MAX_RT_PRIO + 25 #define MAX_PRIO (MAX_RT_PRIO + NICE_WIDTH)
19 #define DEFAULT_PRIO (MAX_RT_PRIO + 26 #define DEFAULT_PRIO (MAX_RT_PRIO + NICE_WIDTH / 2)
20 27
21 /* 28 /*
22 * Convert user-nice values [ -20 ... 0 ... 19 29 * Convert user-nice values [ -20 ... 0 ... 19 ]
23 * to static priority [ MAX_RT_PRIO..MAX_PRIO- 30 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
24 * and back. 31 * and back.
25 */ 32 */
26 #define NICE_TO_PRIO(nice) ((nice) + DEFA 33 #define NICE_TO_PRIO(nice) ((nice) + DEFAULT_PRIO)
27 #define PRIO_TO_NICE(prio) ((prio) - DEFA 34 #define PRIO_TO_NICE(prio) ((prio) - DEFAULT_PRIO)
>> 35
>> 36 /*
>> 37 * 'User priority' is the nice value converted to something we
>> 38 * can work with better when scaling various scheduler parameters,
>> 39 * it's a [ 0 ... 39 ] range.
>> 40 */
>> 41 #define USER_PRIO(p) ((p)-MAX_RT_PRIO)
>> 42 #define TASK_USER_PRIO(p) USER_PRIO((p)->static_prio)
>> 43 #define MAX_USER_PRIO (USER_PRIO(MAX_PRIO))
28 44
29 /* 45 /*
30 * Convert nice value [19,-20] to rlimit style 46 * Convert nice value [19,-20] to rlimit style value [1,40].
31 */ 47 */
32 static inline long nice_to_rlimit(long nice) 48 static inline long nice_to_rlimit(long nice)
33 { 49 {
34 return (MAX_NICE - nice + 1); 50 return (MAX_NICE - nice + 1);
35 } 51 }
36 52
37 /* 53 /*
38 * Convert rlimit style value [1,40] to nice v 54 * Convert rlimit style value [1,40] to nice value [-20, 19].
39 */ 55 */
40 static inline long rlimit_to_nice(long prio) 56 static inline long rlimit_to_nice(long prio)
41 { 57 {
42 return (MAX_NICE - prio + 1); 58 return (MAX_NICE - prio + 1);
43 } 59 }
44 60
45 #endif /* _LINUX_SCHED_PRIO_H */ 61 #endif /* _LINUX_SCHED_PRIO_H */
46 62
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.