xref: /freebsd/sys/compat/linuxkpi/common/include/linux/sched.h (revision 6be3386466ab79a84b48429ae66244f21526d3df)
1 /*-
2  * Copyright (c) 2010 Isilon Systems, Inc.
3  * Copyright (c) 2010 iX Systems, Inc.
4  * Copyright (c) 2010 Panasas, Inc.
5  * Copyright (c) 2013-2018 Mellanox Technologies, Ltd.
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice unmodified, this list of conditions, and the following
13  *    disclaimer.
14  * 2. Redistributions in binary form must reproduce the above copyright
15  *    notice, this list of conditions and the following disclaimer in the
16  *    documentation and/or other materials provided with the distribution.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28  *
29  * $FreeBSD$
30  */
31 #ifndef	_LINUX_SCHED_H_
32 #define	_LINUX_SCHED_H_
33 
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/proc.h>
37 #include <sys/sched.h>
38 #include <sys/sleepqueue.h>
39 #include <sys/time.h>
40 
41 #include <linux/bitmap.h>
42 #include <linux/compat.h>
43 #include <linux/completion.h>
44 #include <linux/mm_types.h>
45 #include <linux/pid.h>
46 #include <linux/slab.h>
47 #include <linux/string.h>
48 #include <linux/time.h>
49 
50 #include <asm/atomic.h>
51 
52 #define	MAX_SCHEDULE_TIMEOUT	INT_MAX
53 
54 #define	TASK_RUNNING		0x0000
55 #define	TASK_INTERRUPTIBLE	0x0001
56 #define	TASK_UNINTERRUPTIBLE	0x0002
57 #define	TASK_NORMAL		(TASK_INTERRUPTIBLE | TASK_UNINTERRUPTIBLE)
58 #define	TASK_WAKING		0x0100
59 #define	TASK_PARKED		0x0200
60 
61 #define	TASK_COMM_LEN		(MAXCOMLEN + 1)
62 
63 struct work_struct;
64 struct task_struct {
65 	struct thread *task_thread;
66 	struct mm_struct *mm;
67 	linux_task_fn_t *task_fn;
68 	void   *task_data;
69 	int	task_ret;
70 	atomic_t usage;
71 	atomic_t state;
72 	atomic_t kthread_flags;
73 	pid_t	pid;	/* BSD thread ID */
74 	const char    *comm;
75 	void   *bsd_ioctl_data;
76 	unsigned bsd_ioctl_len;
77 	struct completion parked;
78 	struct completion exited;
79 #define	TS_RCU_TYPE_MAX 2
80 	TAILQ_ENTRY(task_struct) rcu_entry[TS_RCU_TYPE_MAX];
81 	int rcu_recurse[TS_RCU_TYPE_MAX];
82 	int bsd_interrupt_value;
83 	struct work_struct *work;	/* current work struct, if set */
84 	struct task_struct *group_leader;
85 };
86 
87 #define	current	({ \
88 	struct thread *__td = curthread; \
89 	linux_set_current(__td); \
90 	((struct task_struct *)__td->td_lkpi_task); \
91 })
92 
93 #define	task_pid_group_leader(task) (task)->task_thread->td_proc->p_pid
94 #define	task_pid(task)		((task)->pid)
95 #define	task_pid_nr(task)	((task)->pid)
96 #define	task_pid_vnr(task)	((task)->pid)
97 #define	get_pid(x)		(x)
98 #define	put_pid(x)		do { } while (0)
99 #define	current_euid()	(curthread->td_ucred->cr_uid)
100 #define	task_euid(task)	((task)->task_thread->td_ucred->cr_uid)
101 
102 #define	get_task_state(task)		atomic_read(&(task)->state)
103 #define	set_task_state(task, x)		atomic_set(&(task)->state, (x))
104 #define	__set_task_state(task, x)	((task)->state.counter = (x))
105 #define	set_current_state(x)		set_task_state(current, x)
106 #define	__set_current_state(x)		__set_task_state(current, x)
107 
108 static inline void
109 get_task_struct(struct task_struct *task)
110 {
111 	atomic_inc(&task->usage);
112 }
113 
114 static inline void
115 put_task_struct(struct task_struct *task)
116 {
117 	if (atomic_dec_and_test(&task->usage))
118 		linux_free_current(task);
119 }
120 
121 #define	cond_resched()	do { if (!cold) sched_relinquish(curthread); } while (0)
122 
123 #define	yield()		kern_yield(PRI_UNCHANGED)
124 #define	sched_yield()	sched_relinquish(curthread)
125 
126 #define	need_resched() (curthread->td_flags & TDF_NEEDRESCHED)
127 
128 bool linux_signal_pending(struct task_struct *task);
129 bool linux_fatal_signal_pending(struct task_struct *task);
130 bool linux_signal_pending_state(long state, struct task_struct *task);
131 void linux_send_sig(int signo, struct task_struct *task);
132 
133 #define	signal_pending(task)		linux_signal_pending(task)
134 #define	fatal_signal_pending(task)	linux_fatal_signal_pending(task)
135 #define	signal_pending_state(state, task)		\
136 	linux_signal_pending_state(state, task)
137 #define	send_sig(signo, task, priv) do {		\
138 	CTASSERT((priv) == 0);				\
139 	linux_send_sig(signo, task);			\
140 } while (0)
141 
142 int linux_schedule_timeout(int timeout);
143 
144 static inline void
145 linux_schedule_save_interrupt_value(struct task_struct *task, int value)
146 {
147 	task->bsd_interrupt_value = value;
148 }
149 
150 bool linux_task_exiting(struct task_struct *task);
151 
152 #define	current_exiting() \
153 	linux_task_exiting(current)
154 
155 static inline int
156 linux_schedule_get_interrupt_value(struct task_struct *task)
157 {
158 	int value = task->bsd_interrupt_value;
159 	task->bsd_interrupt_value = 0;
160 	return (value);
161 }
162 
163 #define	schedule()					\
164 	(void)linux_schedule_timeout(MAX_SCHEDULE_TIMEOUT)
165 #define	schedule_timeout(timeout)			\
166 	linux_schedule_timeout(timeout)
167 #define	schedule_timeout_killable(timeout)		\
168 	schedule_timeout_interruptible(timeout)
169 #define	schedule_timeout_interruptible(timeout) ({	\
170 	set_current_state(TASK_INTERRUPTIBLE);		\
171 	schedule_timeout(timeout);			\
172 })
173 #define	schedule_timeout_uninterruptible(timeout) ({	\
174 	set_current_state(TASK_UNINTERRUPTIBLE);	\
175 	schedule_timeout(timeout);			\
176 })
177 
178 #define	io_schedule()			schedule()
179 #define	io_schedule_timeout(timeout)	schedule_timeout(timeout)
180 
181 static inline uint64_t
182 local_clock(void)
183 {
184 	struct timespec ts;
185 
186 	nanotime(&ts);
187 	return ((uint64_t)ts.tv_sec * NSEC_PER_SEC + ts.tv_nsec);
188 }
189 
190 static inline const char *
191 get_task_comm(char *buf, struct task_struct *task)
192 {
193 
194 	buf[0] = 0; /* buffer is too small */
195 	return (task->comm);
196 }
197 
198 #endif	/* _LINUX_SCHED_H_ */
199