1917e476dSPeter Dufault /* 2917e476dSPeter Dufault * Copyright (c) 1996, 1997 3917e476dSPeter Dufault * HD Associates, Inc. All rights reserved. 4917e476dSPeter Dufault * 5917e476dSPeter Dufault * Redistribution and use in source and binary forms, with or without 6917e476dSPeter Dufault * modification, are permitted provided that the following conditions 7917e476dSPeter Dufault * are met: 8917e476dSPeter Dufault * 1. Redistributions of source code must retain the above copyright 9917e476dSPeter Dufault * notice, this list of conditions and the following disclaimer. 10917e476dSPeter Dufault * 2. Redistributions in binary form must reproduce the above copyright 11917e476dSPeter Dufault * notice, this list of conditions and the following disclaimer in the 12917e476dSPeter Dufault * documentation and/or other materials provided with the distribution. 13917e476dSPeter Dufault * 3. All advertising materials mentioning features or use of this software 14917e476dSPeter Dufault * must display the following acknowledgement: 15917e476dSPeter Dufault * This product includes software developed by HD Associates, Inc 16917e476dSPeter Dufault * 4. Neither the name of the author nor the names of any co-contributors 17917e476dSPeter Dufault * may be used to endorse or promote products derived from this software 18917e476dSPeter Dufault * without specific prior written permission. 19917e476dSPeter Dufault * 20917e476dSPeter Dufault * THIS SOFTWARE IS PROVIDED BY HD ASSOCIATES AND CONTRIBUTORS ``AS IS'' AND 21917e476dSPeter Dufault * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22917e476dSPeter Dufault * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23917e476dSPeter Dufault * ARE DISCLAIMED. IN NO EVENT SHALL HD ASSOCIATES OR CONTRIBUTORS BE LIABLE 24917e476dSPeter Dufault * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25917e476dSPeter Dufault * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26917e476dSPeter Dufault * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27917e476dSPeter Dufault * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28917e476dSPeter Dufault * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29917e476dSPeter Dufault * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30917e476dSPeter Dufault * SUCH DAMAGE. 31917e476dSPeter Dufault * 329f79feecSBruce Evans * $FreeBSD$ 33917e476dSPeter Dufault */ 34917e476dSPeter Dufault 35917e476dSPeter Dufault /* ksched: Soft real time scheduling based on "rtprio". 36917e476dSPeter Dufault */ 37917e476dSPeter Dufault 38917e476dSPeter Dufault #include <sys/param.h> 39917e476dSPeter Dufault #include <sys/systm.h> 40917e476dSPeter Dufault #include <sys/proc.h> 413a187295SJohn Baldwin #include <sys/mutex.h> 4238c76440SPeter Dufault #include <sys/resource.h> 43917e476dSPeter Dufault 448a6472b7SPeter Dufault #include <posix4/posix4.h> 45917e476dSPeter Dufault 46917e476dSPeter Dufault /* ksched: Real-time extension to support POSIX priority scheduling. 47917e476dSPeter Dufault */ 48917e476dSPeter Dufault 498a6472b7SPeter Dufault struct ksched { 508a6472b7SPeter Dufault struct timespec rr_interval; 518a6472b7SPeter Dufault }; 52917e476dSPeter Dufault 538a6472b7SPeter Dufault int ksched_attach(struct ksched **p) 54917e476dSPeter Dufault { 558a6472b7SPeter Dufault struct ksched *ksched= p31b_malloc(sizeof(*ksched)); 56917e476dSPeter Dufault 578a6472b7SPeter Dufault ksched->rr_interval.tv_sec = 0; 588a6472b7SPeter Dufault ksched->rr_interval.tv_nsec = 1000000000L / roundrobin_interval(); 59917e476dSPeter Dufault 608a6472b7SPeter Dufault *p = ksched; 61917e476dSPeter Dufault return 0; 62917e476dSPeter Dufault } 63917e476dSPeter Dufault 648a6472b7SPeter Dufault int ksched_detach(struct ksched *p) 65917e476dSPeter Dufault { 668a6472b7SPeter Dufault p31b_free(p); 678a6472b7SPeter Dufault 68917e476dSPeter Dufault return 0; 69917e476dSPeter Dufault } 70917e476dSPeter Dufault 71917e476dSPeter Dufault /* 72917e476dSPeter Dufault * XXX About priorities 73917e476dSPeter Dufault * 748a6472b7SPeter Dufault * POSIX 1003.1b requires that numerically higher priorities be of 75917e476dSPeter Dufault * higher priority. It also permits sched_setparam to be 76917e476dSPeter Dufault * implementation defined for SCHED_OTHER. I don't like 77917e476dSPeter Dufault * the notion of inverted priorites for normal processes when 78917e476dSPeter Dufault * you can use "setpriority" for that. 79917e476dSPeter Dufault * 80917e476dSPeter Dufault * I'm rejecting sched_setparam for SCHED_OTHER with EINVAL. 81917e476dSPeter Dufault */ 82917e476dSPeter Dufault 83917e476dSPeter Dufault /* Macros to convert between the unix (lower numerically is higher priority) 848a6472b7SPeter Dufault * and POSIX 1003.1b (higher numerically is higher priority) 85917e476dSPeter Dufault */ 86917e476dSPeter Dufault 87917e476dSPeter Dufault #define p4prio_to_rtpprio(P) (RTP_PRIO_MAX - (P)) 88917e476dSPeter Dufault #define rtpprio_to_p4prio(P) (RTP_PRIO_MAX - (P)) 89917e476dSPeter Dufault 90aebde782SPeter Dufault /* These improve readability a bit for me: 91aebde782SPeter Dufault */ 92aebde782SPeter Dufault #define P1B_PRIO_MIN rtpprio_to_p4prio(RTP_PRIO_MAX) 93aebde782SPeter Dufault #define P1B_PRIO_MAX rtpprio_to_p4prio(RTP_PRIO_MIN) 94aebde782SPeter Dufault 95c1087c13SBruce Evans static __inline int 969f79feecSBruce Evans getscheduler(register_t *ret, struct ksched *ksched, struct proc *p) 97917e476dSPeter Dufault { 98d5a08a60SJake Burkholder struct rtprio rtp; 99917e476dSPeter Dufault int e = 0; 100917e476dSPeter Dufault 101d5a08a60SJake Burkholder pri_to_rtp(&p->p_pri, &rtp); 102d5a08a60SJake Burkholder switch (rtp.type) 103917e476dSPeter Dufault { 104917e476dSPeter Dufault case RTP_PRIO_FIFO: 105917e476dSPeter Dufault *ret = SCHED_FIFO; 106917e476dSPeter Dufault break; 107917e476dSPeter Dufault 108917e476dSPeter Dufault case RTP_PRIO_REALTIME: 109917e476dSPeter Dufault *ret = SCHED_RR; 110917e476dSPeter Dufault break; 111917e476dSPeter Dufault 112917e476dSPeter Dufault default: 113917e476dSPeter Dufault *ret = SCHED_OTHER; 114917e476dSPeter Dufault break; 115917e476dSPeter Dufault } 116917e476dSPeter Dufault 117917e476dSPeter Dufault return e; 118917e476dSPeter Dufault } 119917e476dSPeter Dufault 1209f79feecSBruce Evans int ksched_setparam(register_t *ret, struct ksched *ksched, 121917e476dSPeter Dufault struct proc *p, const struct sched_param *param) 122917e476dSPeter Dufault { 1239f79feecSBruce Evans register_t policy; 1249f79feecSBruce Evans int e; 125917e476dSPeter Dufault 1268a6472b7SPeter Dufault e = getscheduler(&policy, ksched, p); 127917e476dSPeter Dufault 128917e476dSPeter Dufault if (e == 0) 129917e476dSPeter Dufault { 130917e476dSPeter Dufault if (policy == SCHED_OTHER) 131917e476dSPeter Dufault e = EINVAL; 132917e476dSPeter Dufault else 1338a6472b7SPeter Dufault e = ksched_setscheduler(ret, ksched, p, policy, param); 134917e476dSPeter Dufault } 135917e476dSPeter Dufault 136917e476dSPeter Dufault return e; 137917e476dSPeter Dufault } 138917e476dSPeter Dufault 1399f79feecSBruce Evans int ksched_getparam(register_t *ret, struct ksched *ksched, 140917e476dSPeter Dufault struct proc *p, struct sched_param *param) 141917e476dSPeter Dufault { 142d5a08a60SJake Burkholder struct rtprio rtp; 143d5a08a60SJake Burkholder 144d5a08a60SJake Burkholder pri_to_rtp(&p->p_pri, &rtp); 145d5a08a60SJake Burkholder if (RTP_PRIO_IS_REALTIME(rtp.type)) 146d5a08a60SJake Burkholder param->sched_priority = rtpprio_to_p4prio(rtp.prio); 147917e476dSPeter Dufault 148917e476dSPeter Dufault return 0; 149917e476dSPeter Dufault } 150917e476dSPeter Dufault 151917e476dSPeter Dufault /* 152917e476dSPeter Dufault * XXX The priority and scheduler modifications should 153917e476dSPeter Dufault * be moved into published interfaces in kern/kern_sync. 154917e476dSPeter Dufault * 1558a6472b7SPeter Dufault * The permissions to modify process p were checked in "p31b_proc()". 156917e476dSPeter Dufault * 157917e476dSPeter Dufault */ 1589f79feecSBruce Evans int ksched_setscheduler(register_t *ret, struct ksched *ksched, 159917e476dSPeter Dufault struct proc *p, int policy, const struct sched_param *param) 160917e476dSPeter Dufault { 161917e476dSPeter Dufault int e = 0; 162917e476dSPeter Dufault struct rtprio rtp; 163917e476dSPeter Dufault 164917e476dSPeter Dufault switch(policy) 165917e476dSPeter Dufault { 166917e476dSPeter Dufault case SCHED_RR: 167917e476dSPeter Dufault case SCHED_FIFO: 168917e476dSPeter Dufault 169aebde782SPeter Dufault if (param->sched_priority >= P1B_PRIO_MIN && 170aebde782SPeter Dufault param->sched_priority <= P1B_PRIO_MAX) 171917e476dSPeter Dufault { 172aebde782SPeter Dufault rtp.prio = p4prio_to_rtpprio(param->sched_priority); 173917e476dSPeter Dufault rtp.type = (policy == SCHED_FIFO) 174917e476dSPeter Dufault ? RTP_PRIO_FIFO : RTP_PRIO_REALTIME; 175917e476dSPeter Dufault 1763a187295SJohn Baldwin mtx_lock_spin(&sched_lock); 177d5a08a60SJake Burkholder rtp_to_pri(&rtp, &p->p_pri); 178aebde782SPeter Dufault need_resched(); 1793a187295SJohn Baldwin mtx_unlock_spin(&sched_lock); 180917e476dSPeter Dufault } 181917e476dSPeter Dufault else 182917e476dSPeter Dufault e = EPERM; 183917e476dSPeter Dufault 184917e476dSPeter Dufault 185917e476dSPeter Dufault break; 186917e476dSPeter Dufault 187917e476dSPeter Dufault case SCHED_OTHER: 188917e476dSPeter Dufault { 189917e476dSPeter Dufault rtp.type = RTP_PRIO_NORMAL; 1902a61a110SPeter Dufault rtp.prio = p4prio_to_rtpprio(param->sched_priority); 1913a187295SJohn Baldwin mtx_lock_spin(&sched_lock); 192d5a08a60SJake Burkholder rtp_to_pri(&rtp, &p->p_pri); 193917e476dSPeter Dufault 194917e476dSPeter Dufault /* XXX Simply revert to whatever we had for last 195917e476dSPeter Dufault * normal scheduler priorities. 196917e476dSPeter Dufault * This puts a requirement 197917e476dSPeter Dufault * on the scheduling code: You must leave the 198917e476dSPeter Dufault * scheduling info alone. 199917e476dSPeter Dufault */ 200aebde782SPeter Dufault need_resched(); 2013a187295SJohn Baldwin mtx_unlock_spin(&sched_lock); 202917e476dSPeter Dufault } 203917e476dSPeter Dufault break; 204917e476dSPeter Dufault } 205917e476dSPeter Dufault 206917e476dSPeter Dufault return e; 207917e476dSPeter Dufault } 208917e476dSPeter Dufault 2099f79feecSBruce Evans int ksched_getscheduler(register_t *ret, struct ksched *ksched, struct proc *p) 210917e476dSPeter Dufault { 2118a6472b7SPeter Dufault return getscheduler(ret, ksched, p); 212917e476dSPeter Dufault } 213917e476dSPeter Dufault 214917e476dSPeter Dufault /* ksched_yield: Yield the CPU. 215917e476dSPeter Dufault */ 2169f79feecSBruce Evans int ksched_yield(register_t *ret, struct ksched *ksched) 217917e476dSPeter Dufault { 2183a187295SJohn Baldwin mtx_lock_spin(&sched_lock); 219917e476dSPeter Dufault need_resched(); 2203a187295SJohn Baldwin mtx_unlock_spin(&sched_lock); 221917e476dSPeter Dufault return 0; 222917e476dSPeter Dufault } 223917e476dSPeter Dufault 2249f79feecSBruce Evans int ksched_get_priority_max(register_t*ret, struct ksched *ksched, int policy) 225917e476dSPeter Dufault { 226917e476dSPeter Dufault int e = 0; 227917e476dSPeter Dufault 228917e476dSPeter Dufault switch (policy) 229917e476dSPeter Dufault { 230917e476dSPeter Dufault case SCHED_FIFO: 231917e476dSPeter Dufault case SCHED_RR: 232917e476dSPeter Dufault *ret = RTP_PRIO_MAX; 233917e476dSPeter Dufault break; 234917e476dSPeter Dufault 235917e476dSPeter Dufault case SCHED_OTHER: 236917e476dSPeter Dufault *ret = PRIO_MAX; 237917e476dSPeter Dufault break; 238917e476dSPeter Dufault 239917e476dSPeter Dufault default: 240917e476dSPeter Dufault e = EINVAL; 241917e476dSPeter Dufault } 242917e476dSPeter Dufault 243917e476dSPeter Dufault return e; 244917e476dSPeter Dufault } 245917e476dSPeter Dufault 2469f79feecSBruce Evans int ksched_get_priority_min(register_t *ret, struct ksched *ksched, int policy) 247917e476dSPeter Dufault { 248917e476dSPeter Dufault int e = 0; 249917e476dSPeter Dufault 250917e476dSPeter Dufault switch (policy) 251917e476dSPeter Dufault { 252917e476dSPeter Dufault case SCHED_FIFO: 253917e476dSPeter Dufault case SCHED_RR: 254aebde782SPeter Dufault *ret = P1B_PRIO_MIN; 255917e476dSPeter Dufault break; 256917e476dSPeter Dufault 257917e476dSPeter Dufault case SCHED_OTHER: 258917e476dSPeter Dufault *ret = PRIO_MIN; 259917e476dSPeter Dufault break; 260917e476dSPeter Dufault 261917e476dSPeter Dufault default: 262917e476dSPeter Dufault e = EINVAL; 263917e476dSPeter Dufault } 264917e476dSPeter Dufault 265917e476dSPeter Dufault return e; 266917e476dSPeter Dufault } 267917e476dSPeter Dufault 2689f79feecSBruce Evans int ksched_rr_get_interval(register_t *ret, struct ksched *ksched, 269917e476dSPeter Dufault struct proc *p, struct timespec *timespec) 270917e476dSPeter Dufault { 2718a6472b7SPeter Dufault *timespec = ksched->rr_interval; 272917e476dSPeter Dufault 273917e476dSPeter Dufault return 0; 274917e476dSPeter Dufault } 275