1bb535300SJeff Roberson /* 2a091d823SDavid Xu * Copyright (c) 2005 David Xu <davidxu@freebsd.org> 3a091d823SDavid Xu * Copyright (C) 2003 Daniel M. Eischen <deischen@freebsd.org> 4bb535300SJeff Roberson * All rights reserved. 5bb535300SJeff Roberson * 6bb535300SJeff Roberson * Redistribution and use in source and binary forms, with or without 7bb535300SJeff Roberson * modification, are permitted provided that the following conditions 8bb535300SJeff Roberson * are met: 9bb535300SJeff Roberson * 1. Redistributions of source code must retain the above copyright 10bb535300SJeff Roberson * notice unmodified, this list of conditions, and the following 11bb535300SJeff Roberson * disclaimer. 12bb535300SJeff Roberson * 2. Redistributions in binary form must reproduce the above copyright 13bb535300SJeff Roberson * notice, this list of conditions and the following disclaimer in the 14bb535300SJeff Roberson * documentation and/or other materials provided with the distribution. 15bb535300SJeff Roberson * 16bb535300SJeff Roberson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17bb535300SJeff Roberson * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18bb535300SJeff Roberson * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19bb535300SJeff Roberson * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20bb535300SJeff Roberson * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21bb535300SJeff Roberson * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22bb535300SJeff Roberson * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23bb535300SJeff Roberson * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24bb535300SJeff Roberson * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25bb535300SJeff Roberson * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26bb535300SJeff Roberson * 27bb535300SJeff Roberson * $FreeBSD$ 28bb535300SJeff Roberson */ 29bb535300SJeff Roberson 30bb535300SJeff Roberson #include <sys/types.h> 31bb535300SJeff Roberson #include <sys/signalvar.h> 32e6747c7cSDavid Xu #include <sys/rtprio.h> 33*d1078b0bSDavid Xu #include <sys/mman.h> 34bb535300SJeff Roberson #include <pthread.h> 35bb535300SJeff Roberson 36bb535300SJeff Roberson #include "thr_private.h" 37bb535300SJeff Roberson 38a091d823SDavid Xu /*#define DEBUG_THREAD_KERN */ 39a091d823SDavid Xu #ifdef DEBUG_THREAD_KERN 40a091d823SDavid Xu #define DBG_MSG stdout_debug 41a091d823SDavid Xu #else 42a091d823SDavid Xu #define DBG_MSG(x...) 43a091d823SDavid Xu #endif 44c984b5a7SMike Makonnen 45*d1078b0bSDavid Xu static struct umutex addr_lock; 46*d1078b0bSDavid Xu static struct wake_addr *wake_addr_head; 47*d1078b0bSDavid Xu static struct wake_addr default_wake_addr; 48*d1078b0bSDavid Xu 49c984b5a7SMike Makonnen /* 50a091d823SDavid Xu * This is called when the first thread (other than the initial 51a091d823SDavid Xu * thread) is created. 52c984b5a7SMike Makonnen */ 53a091d823SDavid Xu int 54a091d823SDavid Xu _thr_setthreaded(int threaded) 55a091d823SDavid Xu { 56a091d823SDavid Xu if (((threaded == 0) ^ (__isthreaded == 0)) == 0) 57a091d823SDavid Xu return (0); 58a091d823SDavid Xu 59a091d823SDavid Xu __isthreaded = threaded; 60a091d823SDavid Xu if (threaded != 0) { 61a091d823SDavid Xu _thr_rtld_init(); 62a091d823SDavid Xu } else { 63a091d823SDavid Xu _thr_rtld_fini(); 64a091d823SDavid Xu } 65a091d823SDavid Xu return (0); 66a091d823SDavid Xu } 67a091d823SDavid Xu 68a091d823SDavid Xu void 69a091d823SDavid Xu _thr_assert_lock_level() 70a091d823SDavid Xu { 71a091d823SDavid Xu PANIC("locklevel <= 0"); 72bb535300SJeff Roberson } 73e6747c7cSDavid Xu 74e6747c7cSDavid Xu int 75e6747c7cSDavid Xu _rtp_to_schedparam(const struct rtprio *rtp, int *policy, 76e6747c7cSDavid Xu struct sched_param *param) 77e6747c7cSDavid Xu { 78e6747c7cSDavid Xu switch(rtp->type) { 79e6747c7cSDavid Xu case RTP_PRIO_REALTIME: 80e6747c7cSDavid Xu *policy = SCHED_RR; 81e6747c7cSDavid Xu param->sched_priority = RTP_PRIO_MAX - rtp->prio; 82e6747c7cSDavid Xu break; 83e6747c7cSDavid Xu case RTP_PRIO_FIFO: 84e6747c7cSDavid Xu *policy = SCHED_FIFO; 85e6747c7cSDavid Xu param->sched_priority = RTP_PRIO_MAX - rtp->prio; 86e6747c7cSDavid Xu break; 87e6747c7cSDavid Xu default: 88e6747c7cSDavid Xu *policy = SCHED_OTHER; 89e6747c7cSDavid Xu param->sched_priority = 0; 90e6747c7cSDavid Xu break; 91e6747c7cSDavid Xu } 92e6747c7cSDavid Xu return (0); 93e6747c7cSDavid Xu } 94e6747c7cSDavid Xu 95e6747c7cSDavid Xu int 96e6747c7cSDavid Xu _schedparam_to_rtp(int policy, const struct sched_param *param, 97e6747c7cSDavid Xu struct rtprio *rtp) 98e6747c7cSDavid Xu { 99e6747c7cSDavid Xu switch(policy) { 100e6747c7cSDavid Xu case SCHED_RR: 101e6747c7cSDavid Xu rtp->type = RTP_PRIO_REALTIME; 102e6747c7cSDavid Xu rtp->prio = RTP_PRIO_MAX - param->sched_priority; 103e6747c7cSDavid Xu break; 104e6747c7cSDavid Xu case SCHED_FIFO: 105e6747c7cSDavid Xu rtp->type = RTP_PRIO_FIFO; 106e6747c7cSDavid Xu rtp->prio = RTP_PRIO_MAX - param->sched_priority; 107e6747c7cSDavid Xu break; 108e6747c7cSDavid Xu case SCHED_OTHER: 109e6747c7cSDavid Xu default: 110e6747c7cSDavid Xu rtp->type = RTP_PRIO_NORMAL; 111e6747c7cSDavid Xu rtp->prio = 0; 112e6747c7cSDavid Xu break; 113e6747c7cSDavid Xu } 114e6747c7cSDavid Xu return (0); 115e6747c7cSDavid Xu } 116e6747c7cSDavid Xu 117e6747c7cSDavid Xu int 118e6747c7cSDavid Xu _thr_getscheduler(lwpid_t lwpid, int *policy, struct sched_param *param) 119e6747c7cSDavid Xu { 120e6747c7cSDavid Xu struct rtprio rtp; 121e6747c7cSDavid Xu int ret; 122e6747c7cSDavid Xu 123e6747c7cSDavid Xu ret = rtprio_thread(RTP_LOOKUP, lwpid, &rtp); 124e6747c7cSDavid Xu if (ret == -1) 125e6747c7cSDavid Xu return (ret); 126e6747c7cSDavid Xu _rtp_to_schedparam(&rtp, policy, param); 127e6747c7cSDavid Xu return (0); 128e6747c7cSDavid Xu } 129e6747c7cSDavid Xu 130e6747c7cSDavid Xu int 131e6747c7cSDavid Xu _thr_setscheduler(lwpid_t lwpid, int policy, const struct sched_param *param) 132e6747c7cSDavid Xu { 133e6747c7cSDavid Xu struct rtprio rtp; 134e6747c7cSDavid Xu 135e6747c7cSDavid Xu _schedparam_to_rtp(policy, param, &rtp); 136e6747c7cSDavid Xu return (rtprio_thread(RTP_SET, lwpid, &rtp)); 137e6747c7cSDavid Xu } 138*d1078b0bSDavid Xu 139*d1078b0bSDavid Xu void 140*d1078b0bSDavid Xu _thr_wake_addr_init(void) 141*d1078b0bSDavid Xu { 142*d1078b0bSDavid Xu _thr_umutex_init(&addr_lock); 143*d1078b0bSDavid Xu wake_addr_head = NULL; 144*d1078b0bSDavid Xu } 145*d1078b0bSDavid Xu 146*d1078b0bSDavid Xu /* 147*d1078b0bSDavid Xu * Allocate wake-address, the memory area is never freed after 148*d1078b0bSDavid Xu * allocated, this becauses threads may be referencing it. 149*d1078b0bSDavid Xu */ 150*d1078b0bSDavid Xu struct wake_addr * 151*d1078b0bSDavid Xu _thr_alloc_wake_addr(void) 152*d1078b0bSDavid Xu { 153*d1078b0bSDavid Xu struct pthread *curthread; 154*d1078b0bSDavid Xu struct wake_addr *p; 155*d1078b0bSDavid Xu 156*d1078b0bSDavid Xu if (_thr_initial == NULL) { 157*d1078b0bSDavid Xu return &default_wake_addr; 158*d1078b0bSDavid Xu } 159*d1078b0bSDavid Xu 160*d1078b0bSDavid Xu curthread = _get_curthread(); 161*d1078b0bSDavid Xu 162*d1078b0bSDavid Xu THR_LOCK_ACQUIRE(curthread, &addr_lock); 163*d1078b0bSDavid Xu if (wake_addr_head == NULL) { 164*d1078b0bSDavid Xu unsigned i; 165*d1078b0bSDavid Xu unsigned pagesize = getpagesize(); 166*d1078b0bSDavid Xu struct wake_addr *pp = (struct wake_addr *) 167*d1078b0bSDavid Xu mmap(NULL, getpagesize(), PROT_READ|PROT_WRITE, 168*d1078b0bSDavid Xu MAP_ANON|MAP_PRIVATE, -1, 0); 169*d1078b0bSDavid Xu for (i = 1; i < pagesize/sizeof(struct wake_addr); ++i) 170*d1078b0bSDavid Xu pp[i].link = &pp[i+1]; 171*d1078b0bSDavid Xu pp[i-1].link = NULL; 172*d1078b0bSDavid Xu wake_addr_head = &pp[1]; 173*d1078b0bSDavid Xu p = &pp[0]; 174*d1078b0bSDavid Xu } else { 175*d1078b0bSDavid Xu p = wake_addr_head; 176*d1078b0bSDavid Xu wake_addr_head = p->link; 177*d1078b0bSDavid Xu } 178*d1078b0bSDavid Xu THR_LOCK_RELEASE(curthread, &addr_lock); 179*d1078b0bSDavid Xu p->value = 0; 180*d1078b0bSDavid Xu return (p); 181*d1078b0bSDavid Xu } 182*d1078b0bSDavid Xu 183*d1078b0bSDavid Xu void 184*d1078b0bSDavid Xu _thr_release_wake_addr(struct wake_addr *wa) 185*d1078b0bSDavid Xu { 186*d1078b0bSDavid Xu struct pthread *curthread = _get_curthread(); 187*d1078b0bSDavid Xu 188*d1078b0bSDavid Xu if (wa == &default_wake_addr) 189*d1078b0bSDavid Xu return; 190*d1078b0bSDavid Xu THR_LOCK_ACQUIRE(curthread, &addr_lock); 191*d1078b0bSDavid Xu wa->link = wake_addr_head; 192*d1078b0bSDavid Xu wake_addr_head = wa; 193*d1078b0bSDavid Xu THR_LOCK_RELEASE(curthread, &addr_lock); 194*d1078b0bSDavid Xu } 195*d1078b0bSDavid Xu 196*d1078b0bSDavid Xu /* Sleep on thread wakeup address */ 197*d1078b0bSDavid Xu int 198*d1078b0bSDavid Xu _thr_sleep(struct pthread *curthread, int clockid, 199*d1078b0bSDavid Xu const struct timespec *abstime) 200*d1078b0bSDavid Xu { 201*d1078b0bSDavid Xu 202*d1078b0bSDavid Xu curthread->will_sleep = 0; 203*d1078b0bSDavid Xu if (curthread->nwaiter_defer > 0) { 204*d1078b0bSDavid Xu _thr_wake_all(curthread->defer_waiters, 205*d1078b0bSDavid Xu curthread->nwaiter_defer); 206*d1078b0bSDavid Xu curthread->nwaiter_defer = 0; 207*d1078b0bSDavid Xu } 208*d1078b0bSDavid Xu 209*d1078b0bSDavid Xu if (curthread->wake_addr->value != 0) 210*d1078b0bSDavid Xu return (0); 211*d1078b0bSDavid Xu 212*d1078b0bSDavid Xu return _thr_umtx_timedwait_uint(&curthread->wake_addr->value, 0, 213*d1078b0bSDavid Xu clockid, abstime, 0); 214*d1078b0bSDavid Xu } 215*d1078b0bSDavid Xu 216*d1078b0bSDavid Xu void 217*d1078b0bSDavid Xu _thr_wake_all(unsigned int *waddrs[], int count) 218*d1078b0bSDavid Xu { 219*d1078b0bSDavid Xu int i; 220*d1078b0bSDavid Xu 221*d1078b0bSDavid Xu for (i = 0; i < count; ++i) 222*d1078b0bSDavid Xu *waddrs[i] = 1; 223*d1078b0bSDavid Xu _umtx_op(waddrs, UMTX_OP_NWAKE_PRIVATE, count, NULL, NULL); 224*d1078b0bSDavid Xu } 225