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 * 32917e476dSPeter Dufault */ 33917e476dSPeter Dufault 34917e476dSPeter Dufault /* ksched: Soft real time scheduling based on "rtprio". 35917e476dSPeter Dufault */ 36917e476dSPeter Dufault 37917e476dSPeter Dufault #include <sys/param.h> 38917e476dSPeter Dufault #include <sys/systm.h> 39917e476dSPeter Dufault #include <sys/proc.h> 40917e476dSPeter Dufault #include <sys/kernel.h> 4138c76440SPeter Dufault #include <sys/resource.h> 42917e476dSPeter Dufault #include <machine/cpu.h> /* For need_resched */ 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 90917e476dSPeter Dufault static inline int 918a6472b7SPeter Dufault getscheduler(int *ret, struct ksched *ksched, struct proc *p) 92917e476dSPeter Dufault { 93917e476dSPeter Dufault int e = 0; 94917e476dSPeter Dufault 95917e476dSPeter Dufault switch (p->p_rtprio.type) 96917e476dSPeter Dufault { 97917e476dSPeter Dufault case RTP_PRIO_FIFO: 98917e476dSPeter Dufault *ret = SCHED_FIFO; 99917e476dSPeter Dufault break; 100917e476dSPeter Dufault 101917e476dSPeter Dufault case RTP_PRIO_REALTIME: 102917e476dSPeter Dufault *ret = SCHED_RR; 103917e476dSPeter Dufault break; 104917e476dSPeter Dufault 105917e476dSPeter Dufault default: 106917e476dSPeter Dufault *ret = SCHED_OTHER; 107917e476dSPeter Dufault break; 108917e476dSPeter Dufault } 109917e476dSPeter Dufault 110917e476dSPeter Dufault return e; 111917e476dSPeter Dufault } 112917e476dSPeter Dufault 1138a6472b7SPeter Dufault int ksched_setparam(int *ret, struct ksched *ksched, 114917e476dSPeter Dufault struct proc *p, const struct sched_param *param) 115917e476dSPeter Dufault { 116917e476dSPeter Dufault int e, policy; 117917e476dSPeter Dufault 1188a6472b7SPeter Dufault e = getscheduler(&policy, ksched, p); 119917e476dSPeter Dufault 120917e476dSPeter Dufault if (e == 0) 121917e476dSPeter Dufault { 122917e476dSPeter Dufault if (policy == SCHED_OTHER) 123917e476dSPeter Dufault e = EINVAL; 124917e476dSPeter Dufault else 1258a6472b7SPeter Dufault e = ksched_setscheduler(ret, ksched, p, policy, param); 126917e476dSPeter Dufault } 127917e476dSPeter Dufault 128917e476dSPeter Dufault return e; 129917e476dSPeter Dufault } 130917e476dSPeter Dufault 1318a6472b7SPeter Dufault int ksched_getparam(int *ret, struct ksched *ksched, 132917e476dSPeter Dufault struct proc *p, struct sched_param *param) 133917e476dSPeter Dufault { 134917e476dSPeter Dufault if (RTP_PRIO_IS_REALTIME(p->p_rtprio.type)) 135917e476dSPeter Dufault param->sched_priority = rtpprio_to_p4prio(p->p_rtprio.prio); 136917e476dSPeter Dufault 137917e476dSPeter Dufault return 0; 138917e476dSPeter Dufault } 139917e476dSPeter Dufault 140917e476dSPeter Dufault /* 141917e476dSPeter Dufault * XXX The priority and scheduler modifications should 142917e476dSPeter Dufault * be moved into published interfaces in kern/kern_sync. 143917e476dSPeter Dufault * 1448a6472b7SPeter Dufault * The permissions to modify process p were checked in "p31b_proc()". 145917e476dSPeter Dufault * 146917e476dSPeter Dufault */ 1478a6472b7SPeter Dufault int ksched_setscheduler(int *ret, struct ksched *ksched, 148917e476dSPeter Dufault struct proc *p, int policy, const struct sched_param *param) 149917e476dSPeter Dufault { 150917e476dSPeter Dufault int e = 0; 151917e476dSPeter Dufault struct rtprio rtp; 152917e476dSPeter Dufault 153917e476dSPeter Dufault switch(policy) 154917e476dSPeter Dufault { 155917e476dSPeter Dufault case SCHED_RR: 156917e476dSPeter Dufault case SCHED_FIFO: 157917e476dSPeter Dufault 158917e476dSPeter Dufault if (param->sched_priority >= RTP_PRIO_MIN && 159917e476dSPeter Dufault param->sched_priority <= RTP_PRIO_MAX) 160917e476dSPeter Dufault { 161917e476dSPeter Dufault rtp.type = (policy == SCHED_FIFO) 162917e476dSPeter Dufault ? RTP_PRIO_FIFO : RTP_PRIO_REALTIME; 163917e476dSPeter Dufault 164917e476dSPeter Dufault rtp.prio = p4prio_to_rtpprio(RTP_PRIO_MAX); 165917e476dSPeter Dufault p->p_rtprio = rtp; 166917e476dSPeter Dufault (void)resetpriority(p); 167917e476dSPeter Dufault } 168917e476dSPeter Dufault else 169917e476dSPeter Dufault e = EPERM; 170917e476dSPeter Dufault 171917e476dSPeter Dufault 172917e476dSPeter Dufault break; 173917e476dSPeter Dufault 174917e476dSPeter Dufault case SCHED_OTHER: 175917e476dSPeter Dufault { 176917e476dSPeter Dufault rtp.type = RTP_PRIO_NORMAL; 177917e476dSPeter Dufault rtp.prio = p4prio_to_rtpprio(RTP_PRIO_MIN); 178917e476dSPeter Dufault p->p_rtprio = rtp; 179917e476dSPeter Dufault 180917e476dSPeter Dufault /* XXX Simply revert to whatever we had for last 181917e476dSPeter Dufault * normal scheduler priorities. 182917e476dSPeter Dufault * This puts a requirement 183917e476dSPeter Dufault * on the scheduling code: You must leave the 184917e476dSPeter Dufault * scheduling info alone. 185917e476dSPeter Dufault */ 186917e476dSPeter Dufault (void)resetpriority(p); 187917e476dSPeter Dufault } 188917e476dSPeter Dufault break; 189917e476dSPeter Dufault } 190917e476dSPeter Dufault 191917e476dSPeter Dufault return e; 192917e476dSPeter Dufault } 193917e476dSPeter Dufault 1948a6472b7SPeter Dufault int ksched_getscheduler(int *ret, struct ksched *ksched, struct proc *p) 195917e476dSPeter Dufault { 1968a6472b7SPeter Dufault return getscheduler(ret, ksched, p); 197917e476dSPeter Dufault } 198917e476dSPeter Dufault 199917e476dSPeter Dufault /* ksched_yield: Yield the CPU. 200917e476dSPeter Dufault */ 2018a6472b7SPeter Dufault int ksched_yield(int *ret, struct ksched *ksched) 202917e476dSPeter Dufault { 203917e476dSPeter Dufault need_resched(); 204917e476dSPeter Dufault return 0; 205917e476dSPeter Dufault } 206917e476dSPeter Dufault 2078a6472b7SPeter Dufault int ksched_get_priority_max(int *ret, struct ksched *ksched, int policy) 208917e476dSPeter Dufault { 209917e476dSPeter Dufault int e = 0; 210917e476dSPeter Dufault 211917e476dSPeter Dufault switch (policy) 212917e476dSPeter Dufault { 213917e476dSPeter Dufault case SCHED_FIFO: 214917e476dSPeter Dufault case SCHED_RR: 215917e476dSPeter Dufault *ret = RTP_PRIO_MAX; 216917e476dSPeter Dufault break; 217917e476dSPeter Dufault 218917e476dSPeter Dufault case SCHED_OTHER: 219917e476dSPeter Dufault *ret = PRIO_MAX; 220917e476dSPeter Dufault break; 221917e476dSPeter Dufault 222917e476dSPeter Dufault default: 223917e476dSPeter Dufault e = EINVAL; 224917e476dSPeter Dufault } 225917e476dSPeter Dufault 226917e476dSPeter Dufault return e; 227917e476dSPeter Dufault } 228917e476dSPeter Dufault 2298a6472b7SPeter Dufault int ksched_get_priority_min(int *ret, struct ksched *ksched, int policy) 230917e476dSPeter Dufault { 231917e476dSPeter Dufault int e = 0; 232917e476dSPeter Dufault 233917e476dSPeter Dufault switch (policy) 234917e476dSPeter Dufault { 235917e476dSPeter Dufault case SCHED_FIFO: 236917e476dSPeter Dufault case SCHED_RR: 237917e476dSPeter Dufault *ret = RTP_PRIO_MIN; 238917e476dSPeter Dufault break; 239917e476dSPeter Dufault 240917e476dSPeter Dufault case SCHED_OTHER: 241917e476dSPeter Dufault *ret = PRIO_MIN; 242917e476dSPeter Dufault break; 243917e476dSPeter Dufault 244917e476dSPeter Dufault default: 245917e476dSPeter Dufault e = EINVAL; 246917e476dSPeter Dufault } 247917e476dSPeter Dufault 248917e476dSPeter Dufault return e; 249917e476dSPeter Dufault } 250917e476dSPeter Dufault 2518a6472b7SPeter Dufault int ksched_rr_get_interval(int *ret, struct ksched *ksched, 252917e476dSPeter Dufault struct proc *p, struct timespec *timespec) 253917e476dSPeter Dufault { 2548a6472b7SPeter Dufault *timespec = ksched->rr_interval; 255917e476dSPeter Dufault 256917e476dSPeter Dufault return 0; 257917e476dSPeter Dufault } 258