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