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-2017 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 40 #include <linux/types.h> 41 #include <linux/completion.h> 42 #include <linux/slab.h> 43 44 #include <asm/atomic.h> 45 46 #define MAX_SCHEDULE_TIMEOUT LONG_MAX 47 48 #define TASK_RUNNING 0 49 #define TASK_INTERRUPTIBLE 1 50 #define TASK_UNINTERRUPTIBLE 2 51 #define TASK_DEAD 64 52 #define TASK_WAKEKILL 128 53 #define TASK_WAKING 256 54 55 struct task_struct { 56 struct thread *task_thread; 57 linux_task_fn_t *task_fn; 58 void *task_data; 59 int task_ret; 60 int state; 61 atomic_t kthread_flags; 62 pid_t pid; 63 const char *comm; 64 void *bsd_ioctl_data; 65 unsigned bsd_ioctl_len; 66 struct completion parked; 67 struct completion exited; 68 }; 69 70 #define current ((struct task_struct *)curthread->td_lkpi_task) 71 72 #define task_pid(task) ((task)->task_thread->td_proc->p_pid) 73 #define task_pid_nr(task) ((task)->task_thread->td_tid) 74 #define get_pid(x) (x) 75 #define put_pid(x) 76 #define current_euid() (curthread->td_ucred->cr_uid) 77 78 #define set_current_state(x) \ 79 atomic_store_rel_int((volatile int *)¤t->state, (x)) 80 #define __set_current_state(x) current->state = (x) 81 82 83 #define schedule() \ 84 do { \ 85 void *c; \ 86 \ 87 if (cold || SCHEDULER_STOPPED()) \ 88 break; \ 89 c = curthread; \ 90 sleepq_lock(c); \ 91 if (current->state == TASK_INTERRUPTIBLE || \ 92 current->state == TASK_UNINTERRUPTIBLE) { \ 93 sleepq_add(c, NULL, "task", SLEEPQ_SLEEP, 0); \ 94 sleepq_wait(c, 0); \ 95 } else { \ 96 sleepq_release(c); \ 97 sched_relinquish(curthread); \ 98 } \ 99 } while (0) 100 101 #define wake_up_process(x) \ 102 do { \ 103 int wakeup_swapper; \ 104 void *c; \ 105 \ 106 c = (x)->task_thread; \ 107 sleepq_lock(c); \ 108 (x)->state = TASK_RUNNING; \ 109 wakeup_swapper = sleepq_signal(c, SLEEPQ_SLEEP, 0, 0); \ 110 sleepq_release(c); \ 111 if (wakeup_swapper) \ 112 kick_proc0(); \ 113 } while (0) 114 115 #define cond_resched() if (!cold) sched_relinquish(curthread) 116 117 #define sched_yield() sched_relinquish(curthread) 118 119 static inline long 120 schedule_timeout(signed long timeout) 121 { 122 if (timeout < 0) 123 return 0; 124 125 pause("lstim", timeout); 126 127 return 0; 128 } 129 130 #endif /* _LINUX_SCHED_H_ */ 131