1 /*- 2 * Copyright (c) 1996, 1997, 1998 3 * HD Associates, Inc. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by HD Associates, Inc 16 * 4. Neither the name of the author nor the names of any co-contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY HD ASSOCIATES AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL HD ASSOCIATES OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 /* p1003_1b: Real Time common code. 34 */ 35 36 #include <sys/cdefs.h> 37 __FBSDID("$FreeBSD$"); 38 39 #include "opt_posix.h" 40 41 #include <sys/param.h> 42 #include <sys/systm.h> 43 #include <sys/kernel.h> 44 #include <sys/lock.h> 45 #include <sys/module.h> 46 #include <sys/mutex.h> 47 #include <sys/proc.h> 48 #include <sys/syscallsubr.h> 49 #include <sys/sysctl.h> 50 #include <sys/sysent.h> 51 #include <sys/syslog.h> 52 #include <sys/sysproto.h> 53 54 #include <posix4/posix4.h> 55 56 MALLOC_DEFINE(M_P31B, "p1003.1b", "Posix 1003.1B"); 57 58 /* The system calls return ENOSYS if an entry is called that is 59 * not run-time supported. I am also logging since some programs 60 * start to use this when they shouldn't. That will be removed if annoying. 61 */ 62 int 63 syscall_not_present(struct thread *td, const char *s, struct nosys_args *uap) 64 { 65 log(LOG_ERR, "cmd %s pid %d tried to use non-present %s\n", 66 td->td_proc->p_comm, td->td_proc->p_pid, s); 67 68 /* a " return nosys(p, uap); " here causes a core dump. 69 */ 70 71 return ENOSYS; 72 } 73 74 #if !defined(_KPOSIX_PRIORITY_SCHEDULING) 75 76 /* Not configured but loadable via a module: 77 */ 78 79 static int sched_attach(void) 80 { 81 return 0; 82 } 83 84 SYSCALL_NOT_PRESENT_GEN(sched_setparam) 85 SYSCALL_NOT_PRESENT_GEN(sched_getparam) 86 SYSCALL_NOT_PRESENT_GEN(sched_setscheduler) 87 SYSCALL_NOT_PRESENT_GEN(sched_getscheduler) 88 SYSCALL_NOT_PRESENT_GEN(sched_yield) 89 SYSCALL_NOT_PRESENT_GEN(sched_get_priority_max) 90 SYSCALL_NOT_PRESENT_GEN(sched_get_priority_min) 91 SYSCALL_NOT_PRESENT_GEN(sched_rr_get_interval) 92 93 #else 94 95 /* Configured in kernel version: 96 */ 97 static struct ksched *ksched; 98 99 static int sched_attach(void) 100 { 101 int ret = ksched_attach(&ksched); 102 103 if (ret == 0) 104 p31b_setcfg(CTL_P1003_1B_PRIORITY_SCHEDULING, 1); 105 106 return ret; 107 } 108 109 /* 110 * MPSAFE 111 */ 112 int sched_setparam(struct thread *td, 113 struct sched_setparam_args *uap) 114 { 115 struct thread *targettd; 116 struct proc *targetp; 117 int e; 118 struct sched_param sched_param; 119 120 e = copyin(uap->param, &sched_param, sizeof(sched_param)); 121 if (e) 122 return (e); 123 124 mtx_lock(&Giant); 125 if (uap->pid == 0) { 126 targetp = td->td_proc; 127 targettd = td; 128 PROC_LOCK(targetp); 129 } else { 130 targetp = pfind(uap->pid); 131 if (targetp == NULL) { 132 e = ESRCH; 133 goto done2; 134 } 135 targettd = FIRST_THREAD_IN_PROC(targetp); /* XXXKSE */ 136 } 137 138 e = p_cansched(td, targetp); 139 PROC_UNLOCK(targetp); 140 if (e == 0) { 141 e = ksched_setparam(&td->td_retval[0], ksched, targettd, 142 (const struct sched_param *)&sched_param); 143 } 144 done2: 145 mtx_unlock(&Giant); 146 return (e); 147 } 148 149 /* 150 * MPSAFE 151 */ 152 int sched_getparam(struct thread *td, 153 struct sched_getparam_args *uap) 154 { 155 int e; 156 struct sched_param sched_param; 157 struct thread *targettd; 158 struct proc *targetp; 159 160 mtx_lock(&Giant); 161 if (uap->pid == 0) { 162 targetp = td->td_proc; 163 targettd = td; 164 PROC_LOCK(targetp); 165 } else { 166 targetp = pfind(uap->pid); 167 if (targetp == NULL) { 168 e = ESRCH; 169 goto done2; 170 } 171 targettd = FIRST_THREAD_IN_PROC(targetp); /* XXXKSE */ 172 } 173 174 e = p_cansee(td, targetp); 175 PROC_UNLOCK(targetp); 176 if (e) 177 goto done2; 178 179 e = ksched_getparam(&td->td_retval[0], ksched, targettd, &sched_param); 180 if (e == 0) 181 e = copyout(&sched_param, uap->param, sizeof(sched_param)); 182 done2: 183 mtx_unlock(&Giant); 184 return (e); 185 } 186 187 /* 188 * MPSAFE 189 */ 190 int sched_setscheduler(struct thread *td, 191 struct sched_setscheduler_args *uap) 192 { 193 int e; 194 struct sched_param sched_param; 195 struct thread *targettd; 196 struct proc *targetp; 197 198 e = copyin(uap->param, &sched_param, sizeof(sched_param)); 199 if (e) 200 return (e); 201 202 mtx_lock(&Giant); 203 if (uap->pid == 0) { 204 targetp = td->td_proc; 205 targettd = td; 206 PROC_LOCK(targetp); 207 } else { 208 targetp = pfind(uap->pid); 209 if (targetp == NULL) { 210 e = ESRCH; 211 goto done2; 212 } 213 targettd = FIRST_THREAD_IN_PROC(targetp); /* XXXKSE */ 214 } 215 216 e = p_cansched(td, targetp); 217 PROC_UNLOCK(targetp); 218 if (e == 0) { 219 e = ksched_setscheduler(&td->td_retval[0], ksched, targettd, 220 uap->policy, (const struct sched_param *)&sched_param); 221 } 222 done2: 223 mtx_unlock(&Giant); 224 return (e); 225 } 226 227 /* 228 * MPSAFE 229 */ 230 int sched_getscheduler(struct thread *td, 231 struct sched_getscheduler_args *uap) 232 { 233 int e; 234 struct thread *targettd; 235 struct proc *targetp; 236 237 mtx_lock(&Giant); 238 if (uap->pid == 0) { 239 targetp = td->td_proc; 240 targettd = td; 241 PROC_LOCK(targetp); 242 } else { 243 targetp = pfind(uap->pid); 244 if (targetp == NULL) { 245 e = ESRCH; 246 goto done2; 247 } 248 targettd = FIRST_THREAD_IN_PROC(targetp); /* XXXKSE */ 249 } 250 251 e = p_cansee(td, targetp); 252 PROC_UNLOCK(targetp); 253 if (e == 0) 254 e = ksched_getscheduler(&td->td_retval[0], ksched, targettd); 255 256 done2: 257 mtx_unlock(&Giant); 258 return (e); 259 } 260 261 /* 262 * MPSAFE 263 */ 264 int sched_yield(struct thread *td, 265 struct sched_yield_args *uap) 266 { 267 int error; 268 269 mtx_lock(&Giant); 270 error = ksched_yield(&td->td_retval[0], ksched); 271 mtx_unlock(&Giant); 272 return (error); 273 } 274 275 /* 276 * MPSAFE 277 */ 278 int sched_get_priority_max(struct thread *td, 279 struct sched_get_priority_max_args *uap) 280 { 281 int error; 282 283 mtx_lock(&Giant); 284 error = ksched_get_priority_max(&td->td_retval[0], ksched, uap->policy); 285 mtx_unlock(&Giant); 286 return (error); 287 } 288 289 /* 290 * MPSAFE 291 */ 292 int sched_get_priority_min(struct thread *td, 293 struct sched_get_priority_min_args *uap) 294 { 295 int error; 296 297 mtx_lock(&Giant); 298 error = ksched_get_priority_min(&td->td_retval[0], ksched, uap->policy); 299 mtx_unlock(&Giant); 300 return (error); 301 } 302 303 /* 304 * MPSAFE 305 */ 306 int sched_rr_get_interval(struct thread *td, 307 struct sched_rr_get_interval_args *uap) 308 { 309 struct timespec timespec; 310 int error; 311 312 error = kern_sched_rr_get_interval(td, uap->pid, ×pec); 313 if (error == 0) 314 error = copyout(×pec, uap->interval, sizeof(timespec)); 315 return (error); 316 } 317 318 int kern_sched_rr_get_interval(struct thread *td, pid_t pid, 319 struct timespec *ts) 320 { 321 int e; 322 struct thread *targettd; 323 struct proc *targetp; 324 325 mtx_lock(&Giant); 326 if (pid == 0) { 327 targettd = td; 328 targetp = td->td_proc; 329 PROC_LOCK(targetp); 330 } else { 331 targetp = pfind(pid); 332 if (targetp == NULL) { 333 mtx_unlock(&Giant); 334 return (ESRCH); 335 } 336 targettd = FIRST_THREAD_IN_PROC(targetp); /* XXXKSE */ 337 } 338 339 e = p_cansee(td, targetp); 340 if (e == 0) 341 e = ksched_rr_get_interval(&td->td_retval[0], ksched, targettd, 342 ts); 343 PROC_UNLOCK(targetp); 344 mtx_unlock(&Giant); 345 return (e); 346 } 347 348 #endif 349 350 static void p31binit(void *notused) 351 { 352 (void) sched_attach(); 353 p31b_setcfg(CTL_P1003_1B_PAGESIZE, PAGE_SIZE); 354 } 355 356 SYSINIT(p31b, SI_SUB_P1003_1B, SI_ORDER_FIRST, p31binit, NULL); 357