2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2015, 2016 The FreeBSD Foundation
5 * Copyright (c) 2004, David Xu <davidxu@freebsd.org>
6 * Copyright (c) 2002, Jeffrey Roberson <jeff@freebsd.org>
9 * Portions of this software were developed by Konstantin Belousov
10 * under sponsorship from the FreeBSD Foundation.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice unmodified, this list of conditions, and the following
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
34 #include <sys/cdefs.h>
35 #include "opt_umtx_profiling.h"
37 #include <sys/param.h>
38 #include <sys/kernel.h>
39 #include <sys/fcntl.h>
41 #include <sys/filedesc.h>
42 #include <sys/limits.h>
44 #include <sys/malloc.h>
46 #include <sys/mutex.h>
49 #include <sys/resource.h>
50 #include <sys/resourcevar.h>
51 #include <sys/rwlock.h>
53 #include <sys/sched.h>
55 #include <sys/sysctl.h>
56 #include <sys/systm.h>
57 #include <sys/sysproto.h>
58 #include <sys/syscallsubr.h>
59 #include <sys/taskqueue.h>
61 #include <sys/eventhandler.h>
63 #include <sys/umtxvar.h>
65 #include <security/mac/mac_framework.h>
68 #include <vm/vm_param.h>
70 #include <vm/vm_map.h>
71 #include <vm/vm_object.h>
73 #include <machine/atomic.h>
74 #include <machine/cpu.h>
76 #include <compat/freebsd32/freebsd32.h>
77 #ifdef COMPAT_FREEBSD32
78 #include <compat/freebsd32/freebsd32_proto.h>
82 #define _UMUTEX_WAIT 2
85 #define UPROF_PERC_BIGGER(w, f, sw, sf) \
86 (((w) > (sw)) || ((w) == (sw) && (f) > (sf)))
89 #define UMTXQ_LOCKED_ASSERT(uc) mtx_assert(&(uc)->uc_lock, MA_OWNED)
91 #define UMTXQ_ASSERT_LOCKED_BUSY(key) do { \
92 struct umtxq_chain *uc; \
94 uc = umtxq_getchain(key); \
95 mtx_assert(&uc->uc_lock, MA_OWNED); \
96 KASSERT(uc->uc_busy != 0, ("umtx chain is not busy")); \
99 #define UMTXQ_ASSERT_LOCKED_BUSY(key) do {} while (0)
103 * Don't propagate time-sharing priority, there is a security reason,
104 * a user can simply introduce PI-mutex, let thread A lock the mutex,
105 * and let another thread B block on the mutex, because B is
106 * sleeping, its priority will be boosted, this causes A's priority to
107 * be boosted via priority propagating too and will never be lowered even
108 * if it is using 100%CPU, this is unfair to other processes.
111 #define UPRI(td) (((td)->td_user_pri >= PRI_MIN_TIMESHARE &&\
112 (td)->td_user_pri <= PRI_MAX_TIMESHARE) ?\
113 PRI_MAX_TIMESHARE : (td)->td_user_pri)
115 #define GOLDEN_RATIO_PRIME 2654404609U
117 #define UMTX_CHAINS 512
119 #define UMTX_SHIFTS (__WORD_BIT - 9)
121 #define GET_SHARE(flags) \
122 (((flags) & USYNC_PROCESS_SHARED) == 0 ? THREAD_SHARE : PROCESS_SHARE)
124 #define BUSY_SPINS 200
126 struct umtx_copyops {
127 int (*copyin_timeout)(const void *uaddr, struct timespec *tsp);
128 int (*copyin_umtx_time)(const void *uaddr, size_t size,
129 struct _umtx_time *tp);
130 int (*copyin_robust_lists)(const void *uaddr, size_t size,
131 struct umtx_robust_lists_params *rbp);
132 int (*copyout_timeout)(void *uaddr, size_t size,
133 struct timespec *tsp);
134 const size_t timespec_sz;
135 const size_t umtx_time_sz;
139 _Static_assert(sizeof(struct umutex) == sizeof(struct umutex32), "umutex32");
140 _Static_assert(__offsetof(struct umutex, m_spare[0]) ==
141 __offsetof(struct umutex32, m_spare[0]), "m_spare32");
143 int umtx_shm_vnobj_persistent = 0;
144 SYSCTL_INT(_kern_ipc, OID_AUTO, umtx_vnode_persistent, CTLFLAG_RWTUN,
145 &umtx_shm_vnobj_persistent, 0,
146 "False forces destruction of umtx attached to file, on last close");
147 static int umtx_max_rb = 1000;
148 SYSCTL_INT(_kern_ipc, OID_AUTO, umtx_max_robust, CTLFLAG_RWTUN,
150 "Maximum number of robust mutexes allowed for each thread");
152 static uma_zone_t umtx_pi_zone;
153 static struct umtxq_chain umtxq_chains[2][UMTX_CHAINS];
154 static MALLOC_DEFINE(M_UMTX, "umtx", "UMTX queue memory");
155 static int umtx_pi_allocated;
157 static SYSCTL_NODE(_debug, OID_AUTO, umtx, CTLFLAG_RW | CTLFLAG_MPSAFE, 0,
159 SYSCTL_INT(_debug_umtx, OID_AUTO, umtx_pi_allocated, CTLFLAG_RD,
160 &umtx_pi_allocated, 0, "Allocated umtx_pi");
161 static int umtx_verbose_rb = 1;
162 SYSCTL_INT(_debug_umtx, OID_AUTO, robust_faults_verbose, CTLFLAG_RWTUN,
166 #ifdef UMTX_PROFILING
167 static long max_length;
168 SYSCTL_LONG(_debug_umtx, OID_AUTO, max_length, CTLFLAG_RD, &max_length, 0, "max_length");
169 static SYSCTL_NODE(_debug_umtx, OID_AUTO, chains, CTLFLAG_RD | CTLFLAG_MPSAFE, 0,
173 static inline void umtx_abs_timeout_init2(struct umtx_abs_timeout *timo,
174 const struct _umtx_time *umtxtime);
176 static void umtx_shm_init(void);
177 static void umtxq_sysinit(void *);
178 static void umtxq_hash(struct umtx_key *key);
179 static int do_unlock_pp(struct thread *td, struct umutex *m, uint32_t flags,
181 static void umtx_thread_cleanup(struct thread *td);
182 SYSINIT(umtx, SI_SUB_EVENTHANDLER+1, SI_ORDER_MIDDLE, umtxq_sysinit, NULL);
184 #define umtxq_signal(key, nwake) umtxq_signal_queue((key), (nwake), UMTX_SHARED_QUEUE)
186 static struct mtx umtx_lock;
188 #ifdef UMTX_PROFILING
190 umtx_init_profiling(void)
192 struct sysctl_oid *chain_oid;
196 for (i = 0; i < UMTX_CHAINS; ++i) {
197 snprintf(chain_name, sizeof(chain_name), "%d", i);
198 chain_oid = SYSCTL_ADD_NODE(NULL,
199 SYSCTL_STATIC_CHILDREN(_debug_umtx_chains), OID_AUTO,
200 chain_name, CTLFLAG_RD | CTLFLAG_MPSAFE, NULL,
202 SYSCTL_ADD_INT(NULL, SYSCTL_CHILDREN(chain_oid), OID_AUTO,
203 "max_length0", CTLFLAG_RD, &umtxq_chains[0][i].max_length, 0, NULL);
204 SYSCTL_ADD_INT(NULL, SYSCTL_CHILDREN(chain_oid), OID_AUTO,
205 "max_length1", CTLFLAG_RD, &umtxq_chains[1][i].max_length, 0, NULL);
210 sysctl_debug_umtx_chains_peaks(SYSCTL_HANDLER_ARGS)
214 struct umtxq_chain *uc;
215 u_int fract, i, j, tot, whole;
216 u_int sf0, sf1, sf2, sf3, sf4;
217 u_int si0, si1, si2, si3, si4;
218 u_int sw0, sw1, sw2, sw3, sw4;
220 sbuf_new(&sb, buf, sizeof(buf), SBUF_FIXEDLEN);
221 for (i = 0; i < 2; i++) {
223 for (j = 0; j < UMTX_CHAINS; ++j) {
224 uc = &umtxq_chains[i][j];
225 mtx_lock(&uc->uc_lock);
226 tot += uc->max_length;
227 mtx_unlock(&uc->uc_lock);
230 sbuf_printf(&sb, "%u) Empty ", i);
232 sf0 = sf1 = sf2 = sf3 = sf4 = 0;
233 si0 = si1 = si2 = si3 = si4 = 0;
234 sw0 = sw1 = sw2 = sw3 = sw4 = 0;
235 for (j = 0; j < UMTX_CHAINS; j++) {
236 uc = &umtxq_chains[i][j];
237 mtx_lock(&uc->uc_lock);
238 whole = uc->max_length * 100;
239 mtx_unlock(&uc->uc_lock);
240 fract = (whole % tot) * 100;
241 if (UPROF_PERC_BIGGER(whole, fract, sw0, sf0)) {
245 } else if (UPROF_PERC_BIGGER(whole, fract, sw1,
250 } else if (UPROF_PERC_BIGGER(whole, fract, sw2,
255 } else if (UPROF_PERC_BIGGER(whole, fract, sw3,
260 } else if (UPROF_PERC_BIGGER(whole, fract, sw4,
267 sbuf_printf(&sb, "queue %u:\n", i);
268 sbuf_printf(&sb, "1st: %u.%u%% idx: %u\n", sw0 / tot,
270 sbuf_printf(&sb, "2nd: %u.%u%% idx: %u\n", sw1 / tot,
272 sbuf_printf(&sb, "3rd: %u.%u%% idx: %u\n", sw2 / tot,
274 sbuf_printf(&sb, "4th: %u.%u%% idx: %u\n", sw3 / tot,
276 sbuf_printf(&sb, "5th: %u.%u%% idx: %u\n", sw4 / tot,
282 sysctl_handle_string(oidp, sbuf_data(&sb), sbuf_len(&sb), req);
288 sysctl_debug_umtx_chains_clear(SYSCTL_HANDLER_ARGS)
290 struct umtxq_chain *uc;
295 error = sysctl_handle_int(oidp, &clear, 0, req);
296 if (error != 0 || req->newptr == NULL)
300 for (i = 0; i < 2; ++i) {
301 for (j = 0; j < UMTX_CHAINS; ++j) {
302 uc = &umtxq_chains[i][j];
303 mtx_lock(&uc->uc_lock);
306 mtx_unlock(&uc->uc_lock);
313 SYSCTL_PROC(_debug_umtx_chains, OID_AUTO, clear,
314 CTLTYPE_INT | CTLFLAG_RW | CTLFLAG_MPSAFE, 0, 0,
315 sysctl_debug_umtx_chains_clear, "I",
316 "Clear umtx chains statistics");
317 SYSCTL_PROC(_debug_umtx_chains, OID_AUTO, peaks,
318 CTLTYPE_STRING | CTLFLAG_RD | CTLFLAG_MPSAFE, 0, 0,
319 sysctl_debug_umtx_chains_peaks, "A",
320 "Highest peaks in chains max length");
324 umtxq_sysinit(void *arg __unused)
328 umtx_pi_zone = uma_zcreate("umtx pi", sizeof(struct umtx_pi),
329 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
330 for (i = 0; i < 2; ++i) {
331 for (j = 0; j < UMTX_CHAINS; ++j) {
332 mtx_init(&umtxq_chains[i][j].uc_lock, "umtxql", NULL,
333 MTX_DEF | MTX_DUPOK);
334 LIST_INIT(&umtxq_chains[i][j].uc_queue[0]);
335 LIST_INIT(&umtxq_chains[i][j].uc_queue[1]);
336 LIST_INIT(&umtxq_chains[i][j].uc_spare_queue);
337 TAILQ_INIT(&umtxq_chains[i][j].uc_pi_list);
338 umtxq_chains[i][j].uc_busy = 0;
339 umtxq_chains[i][j].uc_waiters = 0;
340 #ifdef UMTX_PROFILING
341 umtxq_chains[i][j].length = 0;
342 umtxq_chains[i][j].max_length = 0;
346 #ifdef UMTX_PROFILING
347 umtx_init_profiling();
349 mtx_init(&umtx_lock, "umtx lock", NULL, MTX_DEF);
358 uq = malloc(sizeof(struct umtx_q), M_UMTX, M_WAITOK | M_ZERO);
359 uq->uq_spare_queue = malloc(sizeof(struct umtxq_queue), M_UMTX,
361 TAILQ_INIT(&uq->uq_spare_queue->head);
362 TAILQ_INIT(&uq->uq_pi_contested);
363 uq->uq_inherited_pri = PRI_MAX;
368 umtxq_free(struct umtx_q *uq)
371 MPASS(uq->uq_spare_queue != NULL);
372 free(uq->uq_spare_queue, M_UMTX);
377 umtxq_hash(struct umtx_key *key)
381 n = (uintptr_t)key->info.both.a + key->info.both.b;
382 key->hash = ((n * GOLDEN_RATIO_PRIME) >> UMTX_SHIFTS) % UMTX_CHAINS;
386 umtxq_getchain(struct umtx_key *key)
389 if (key->type <= TYPE_SEM)
390 return (&umtxq_chains[1][key->hash]);
391 return (&umtxq_chains[0][key->hash]);
395 * Set chain to busy state when following operation
396 * may be blocked (kernel mutex can not be used).
399 umtxq_busy(struct umtx_key *key)
401 struct umtxq_chain *uc;
403 uc = umtxq_getchain(key);
404 mtx_assert(&uc->uc_lock, MA_OWNED);
408 int count = BUSY_SPINS;
411 while (uc->uc_busy && --count > 0)
417 while (uc->uc_busy) {
419 msleep(uc, &uc->uc_lock, 0, "umtxqb", 0);
430 umtxq_unbusy(struct umtx_key *key)
432 struct umtxq_chain *uc;
434 uc = umtxq_getchain(key);
435 mtx_assert(&uc->uc_lock, MA_OWNED);
436 KASSERT(uc->uc_busy != 0, ("not busy"));
443 umtxq_unbusy_unlocked(struct umtx_key *key)
451 static struct umtxq_queue *
452 umtxq_queue_lookup(struct umtx_key *key, int q)
454 struct umtxq_queue *uh;
455 struct umtxq_chain *uc;
457 uc = umtxq_getchain(key);
458 UMTXQ_LOCKED_ASSERT(uc);
459 LIST_FOREACH(uh, &uc->uc_queue[q], link) {
460 if (umtx_key_match(&uh->key, key))
468 umtxq_insert_queue(struct umtx_q *uq, int q)
470 struct umtxq_queue *uh;
471 struct umtxq_chain *uc;
473 uc = umtxq_getchain(&uq->uq_key);
474 UMTXQ_LOCKED_ASSERT(uc);
475 KASSERT((uq->uq_flags & UQF_UMTXQ) == 0, ("umtx_q is already on queue"));
476 uh = umtxq_queue_lookup(&uq->uq_key, q);
478 LIST_INSERT_HEAD(&uc->uc_spare_queue, uq->uq_spare_queue, link);
480 uh = uq->uq_spare_queue;
481 uh->key = uq->uq_key;
482 LIST_INSERT_HEAD(&uc->uc_queue[q], uh, link);
483 #ifdef UMTX_PROFILING
485 if (uc->length > uc->max_length) {
486 uc->max_length = uc->length;
487 if (uc->max_length > max_length)
488 max_length = uc->max_length;
492 uq->uq_spare_queue = NULL;
494 TAILQ_INSERT_TAIL(&uh->head, uq, uq_link);
496 uq->uq_flags |= UQF_UMTXQ;
497 uq->uq_cur_queue = uh;
502 umtxq_remove_queue(struct umtx_q *uq, int q)
504 struct umtxq_chain *uc;
505 struct umtxq_queue *uh;
507 uc = umtxq_getchain(&uq->uq_key);
508 UMTXQ_LOCKED_ASSERT(uc);
509 if (uq->uq_flags & UQF_UMTXQ) {
510 uh = uq->uq_cur_queue;
511 TAILQ_REMOVE(&uh->head, uq, uq_link);
513 uq->uq_flags &= ~UQF_UMTXQ;
514 if (TAILQ_EMPTY(&uh->head)) {
515 KASSERT(uh->length == 0,
516 ("inconsistent umtxq_queue length"));
517 #ifdef UMTX_PROFILING
520 LIST_REMOVE(uh, link);
522 uh = LIST_FIRST(&uc->uc_spare_queue);
523 KASSERT(uh != NULL, ("uc_spare_queue is empty"));
524 LIST_REMOVE(uh, link);
526 uq->uq_spare_queue = uh;
527 uq->uq_cur_queue = NULL;
532 * Check if there are multiple waiters
535 umtxq_count(struct umtx_key *key)
537 struct umtxq_queue *uh;
539 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key));
540 uh = umtxq_queue_lookup(key, UMTX_SHARED_QUEUE);
547 * Check if there are multiple PI waiters and returns first
551 umtxq_count_pi(struct umtx_key *key, struct umtx_q **first)
553 struct umtxq_queue *uh;
556 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key));
557 uh = umtxq_queue_lookup(key, UMTX_SHARED_QUEUE);
559 *first = TAILQ_FIRST(&uh->head);
566 * Wake up threads waiting on an userland object by a bit mask.
569 umtxq_signal_mask(struct umtx_key *key, int n_wake, u_int bitset)
571 struct umtxq_queue *uh;
572 struct umtx_q *uq, *uq_temp;
576 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key));
577 uh = umtxq_queue_lookup(key, UMTX_SHARED_QUEUE);
580 TAILQ_FOREACH_SAFE(uq, &uh->head, uq_link, uq_temp) {
581 if ((uq->uq_bitset & bitset) == 0)
583 umtxq_remove_queue(uq, UMTX_SHARED_QUEUE);
592 * Wake up threads waiting on an userland object.
596 umtxq_signal_queue(struct umtx_key *key, int n_wake, int q)
598 struct umtxq_queue *uh;
603 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key));
604 uh = umtxq_queue_lookup(key, q);
606 while ((uq = TAILQ_FIRST(&uh->head)) != NULL) {
607 umtxq_remove_queue(uq, q);
617 * Wake up specified thread.
620 umtxq_signal_thread(struct umtx_q *uq)
623 UMTXQ_LOCKED_ASSERT(umtxq_getchain(&uq->uq_key));
629 * Wake up a maximum of n_wake threads that are waiting on an userland
630 * object identified by key. The remaining threads are removed from queue
631 * identified by key and added to the queue identified by key2 (requeued).
632 * The n_requeue specifies an upper limit on the number of threads that
633 * are requeued to the second queue.
636 umtxq_requeue(struct umtx_key *key, int n_wake, struct umtx_key *key2,
639 struct umtxq_queue *uh, *uh2;
640 struct umtx_q *uq, *uq_temp;
644 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key));
645 UMTXQ_LOCKED_ASSERT(umtxq_getchain(key2));
646 uh = umtxq_queue_lookup(key, UMTX_SHARED_QUEUE);
647 uh2 = umtxq_queue_lookup(key2, UMTX_SHARED_QUEUE);
650 TAILQ_FOREACH_SAFE(uq, &uh->head, uq_link, uq_temp) {
651 if (++ret <= n_wake) {
658 if (ret - n_wake == n_requeue)
666 tstohz(const struct timespec *tsp)
670 TIMESPEC_TO_TIMEVAL(&tv, tsp);
675 umtx_abs_timeout_init(struct umtx_abs_timeout *timo, int clockid,
676 int absolute, const struct timespec *timeout)
679 timo->clockid = clockid;
681 timo->is_abs_real = false;
682 kern_clock_gettime(curthread, timo->clockid, &timo->cur);
683 timespecadd(&timo->cur, timeout, &timo->end);
685 timo->end = *timeout;
686 timo->is_abs_real = clockid == CLOCK_REALTIME ||
687 clockid == CLOCK_REALTIME_FAST ||
688 clockid == CLOCK_REALTIME_PRECISE ||
689 clockid == CLOCK_SECOND;
694 umtx_abs_timeout_init2(struct umtx_abs_timeout *timo,
695 const struct _umtx_time *umtxtime)
698 umtx_abs_timeout_init(timo, umtxtime->_clockid,
699 (umtxtime->_flags & UMTX_ABSTIME) != 0, &umtxtime->_timeout);
703 umtx_abs_timeout_enforce_min(sbintime_t *sbt)
705 sbintime_t when, mint;
707 mint = curproc->p_umtx_min_timeout;
708 if (__predict_false(mint != 0)) {
709 when = sbinuptime() + mint;
716 umtx_abs_timeout_getsbt(struct umtx_abs_timeout *timo, sbintime_t *sbt,
719 struct bintime bt, bbt;
723 switch (timo->clockid) {
725 /* Clocks that can be converted into absolute time. */
727 case CLOCK_REALTIME_PRECISE:
728 case CLOCK_REALTIME_FAST:
729 case CLOCK_MONOTONIC:
730 case CLOCK_MONOTONIC_PRECISE:
731 case CLOCK_MONOTONIC_FAST:
733 case CLOCK_UPTIME_PRECISE:
734 case CLOCK_UPTIME_FAST:
736 timespec2bintime(&timo->end, &bt);
737 switch (timo->clockid) {
739 case CLOCK_REALTIME_PRECISE:
740 case CLOCK_REALTIME_FAST:
742 getboottimebin(&bbt);
743 bintime_sub(&bt, &bbt);
748 if (bt.sec >= (SBT_MAX >> 32)) {
754 umtx_abs_timeout_enforce_min(sbt);
757 * Check if the absolute time should be aligned to
758 * avoid firing multiple timer events in non-periodic
761 switch (timo->clockid) {
762 case CLOCK_REALTIME_FAST:
763 case CLOCK_MONOTONIC_FAST:
764 case CLOCK_UPTIME_FAST:
765 rem = *sbt % tc_tick_sbt;
766 if (__predict_true(rem != 0))
767 *sbt += tc_tick_sbt - rem;
771 if (__predict_true(rem != 0))
772 *sbt += SBT_1S - rem;
778 /* Clocks that has to be periodically polled. */
781 case CLOCK_THREAD_CPUTIME_ID:
782 case CLOCK_PROCESS_CPUTIME_ID:
784 kern_clock_gettime(curthread, timo->clockid, &timo->cur);
785 if (timespeccmp(&timo->end, &timo->cur, <=))
787 timespecsub(&timo->end, &timo->cur, &tts);
788 *sbt = tick_sbt * tstohz(&tts);
789 *flags = C_HARDCLOCK;
795 umtx_unlock_val(uint32_t flags, bool rb)
799 return (UMUTEX_RB_OWNERDEAD);
800 else if ((flags & UMUTEX_NONCONSISTENT) != 0)
801 return (UMUTEX_RB_NOTRECOV);
803 return (UMUTEX_UNOWNED);
808 * Put thread into sleep state, before sleeping, check if
809 * thread was removed from umtx queue.
812 umtxq_sleep(struct umtx_q *uq, const char *wmesg,
813 struct umtx_abs_timeout *timo)
815 struct umtxq_chain *uc;
817 int error, flags = 0;
819 uc = umtxq_getchain(&uq->uq_key);
820 UMTXQ_LOCKED_ASSERT(uc);
822 if (!(uq->uq_flags & UQF_UMTXQ)) {
827 if (timo->is_abs_real)
828 curthread->td_rtcgen =
829 atomic_load_acq_int(&rtc_generation);
830 error = umtx_abs_timeout_getsbt(timo, &sbt, &flags);
834 error = msleep_sbt(uq, &uc->uc_lock, PCATCH | PDROP, wmesg,
836 uc = umtxq_getchain(&uq->uq_key);
837 mtx_lock(&uc->uc_lock);
838 if (error == EINTR || error == ERESTART)
840 if (error == EWOULDBLOCK && (flags & C_ABSOLUTE) != 0) {
846 curthread->td_rtcgen = 0;
851 * Convert userspace address into unique logical address.
854 umtx_key_get(const void *addr, int type, int share, struct umtx_key *key)
856 struct thread *td = curthread;
858 vm_map_entry_t entry;
864 if (share == THREAD_SHARE) {
866 key->info.private.vs = td->td_proc->p_vmspace;
867 key->info.private.addr = (uintptr_t)addr;
869 MPASS(share == PROCESS_SHARE || share == AUTO_SHARE);
870 map = &td->td_proc->p_vmspace->vm_map;
871 if (vm_map_lookup(&map, (vm_offset_t)addr, VM_PROT_WRITE,
872 &entry, &key->info.shared.object, &pindex, &prot,
873 &wired) != KERN_SUCCESS) {
877 if ((share == PROCESS_SHARE) ||
878 (share == AUTO_SHARE &&
879 VM_INHERIT_SHARE == entry->inheritance)) {
881 key->info.shared.offset = (vm_offset_t)addr -
882 entry->start + entry->offset;
883 vm_object_reference(key->info.shared.object);
886 key->info.private.vs = td->td_proc->p_vmspace;
887 key->info.private.addr = (uintptr_t)addr;
889 vm_map_lookup_done(map, entry);
900 umtx_key_release(struct umtx_key *key)
903 vm_object_deallocate(key->info.shared.object);
906 #ifdef COMPAT_FREEBSD10
908 * Lock a umtx object.
911 do_lock_umtx(struct thread *td, struct umtx *umtx, u_long id,
912 const struct timespec *timeout)
914 struct umtx_abs_timeout timo;
922 umtx_abs_timeout_init(&timo, CLOCK_REALTIME, 0, timeout);
925 * Care must be exercised when dealing with umtx structure. It
926 * can fault on any access.
930 * Try the uncontested case. This should be done in userland.
932 owner = casuword(&umtx->u_owner, UMTX_UNOWNED, id);
934 /* The acquire succeeded. */
935 if (owner == UMTX_UNOWNED)
938 /* The address was invalid. */
942 /* If no one owns it but it is contested try to acquire it. */
943 if (owner == UMTX_CONTESTED) {
944 owner = casuword(&umtx->u_owner,
945 UMTX_CONTESTED, id | UMTX_CONTESTED);
947 if (owner == UMTX_CONTESTED)
950 /* The address was invalid. */
954 error = thread_check_susp(td, false);
958 /* If this failed the lock has changed, restart. */
963 * If we caught a signal, we have retried and now
969 if ((error = umtx_key_get(umtx, TYPE_SIMPLE_LOCK,
970 AUTO_SHARE, &uq->uq_key)) != 0)
973 umtxq_lock(&uq->uq_key);
974 umtxq_busy(&uq->uq_key);
976 umtxq_unbusy(&uq->uq_key);
977 umtxq_unlock(&uq->uq_key);
980 * Set the contested bit so that a release in user space
981 * knows to use the system call for unlock. If this fails
982 * either some one else has acquired the lock or it has been
985 old = casuword(&umtx->u_owner, owner, owner | UMTX_CONTESTED);
987 /* The address was invalid. */
989 umtxq_lock(&uq->uq_key);
991 umtxq_unlock(&uq->uq_key);
992 umtx_key_release(&uq->uq_key);
997 * We set the contested bit, sleep. Otherwise the lock changed
998 * and we need to retry or we lost a race to the thread
999 * unlocking the umtx.
1001 umtxq_lock(&uq->uq_key);
1003 error = umtxq_sleep(uq, "umtx", timeout == NULL ? NULL :
1006 umtxq_unlock(&uq->uq_key);
1007 umtx_key_release(&uq->uq_key);
1010 error = thread_check_susp(td, false);
1013 if (timeout == NULL) {
1014 /* Mutex locking is restarted if it is interrupted. */
1018 /* Timed-locking is not restarted. */
1019 if (error == ERESTART)
1026 * Unlock a umtx object.
1029 do_unlock_umtx(struct thread *td, struct umtx *umtx, u_long id)
1031 struct umtx_key key;
1038 * Make sure we own this mtx.
1040 owner = fuword(__DEVOLATILE(u_long *, &umtx->u_owner));
1044 if ((owner & ~UMTX_CONTESTED) != id)
1047 /* This should be done in userland */
1048 if ((owner & UMTX_CONTESTED) == 0) {
1049 old = casuword(&umtx->u_owner, owner, UMTX_UNOWNED);
1057 /* We should only ever be in here for contested locks */
1058 if ((error = umtx_key_get(umtx, TYPE_SIMPLE_LOCK, AUTO_SHARE,
1064 count = umtxq_count(&key);
1068 * When unlocking the umtx, it must be marked as unowned if
1069 * there is zero or one thread only waiting for it.
1070 * Otherwise, it must be marked as contested.
1072 old = casuword(&umtx->u_owner, owner,
1073 count <= 1 ? UMTX_UNOWNED : UMTX_CONTESTED);
1075 umtxq_signal(&key,1);
1078 umtx_key_release(&key);
1086 #ifdef COMPAT_FREEBSD32
1089 * Lock a umtx object.
1092 do_lock_umtx32(struct thread *td, uint32_t *m, uint32_t id,
1093 const struct timespec *timeout)
1095 struct umtx_abs_timeout timo;
1103 if (timeout != NULL)
1104 umtx_abs_timeout_init(&timo, CLOCK_REALTIME, 0, timeout);
1107 * Care must be exercised when dealing with umtx structure. It
1108 * can fault on any access.
1112 * Try the uncontested case. This should be done in userland.
1114 owner = casuword32(m, UMUTEX_UNOWNED, id);
1116 /* The acquire succeeded. */
1117 if (owner == UMUTEX_UNOWNED)
1120 /* The address was invalid. */
1124 /* If no one owns it but it is contested try to acquire it. */
1125 if (owner == UMUTEX_CONTESTED) {
1126 owner = casuword32(m,
1127 UMUTEX_CONTESTED, id | UMUTEX_CONTESTED);
1128 if (owner == UMUTEX_CONTESTED)
1131 /* The address was invalid. */
1135 error = thread_check_susp(td, false);
1139 /* If this failed the lock has changed, restart. */
1144 * If we caught a signal, we have retried and now
1150 if ((error = umtx_key_get(m, TYPE_SIMPLE_LOCK,
1151 AUTO_SHARE, &uq->uq_key)) != 0)
1154 umtxq_lock(&uq->uq_key);
1155 umtxq_busy(&uq->uq_key);
1157 umtxq_unbusy(&uq->uq_key);
1158 umtxq_unlock(&uq->uq_key);
1161 * Set the contested bit so that a release in user space
1162 * knows to use the system call for unlock. If this fails
1163 * either some one else has acquired the lock or it has been
1166 old = casuword32(m, owner, owner | UMUTEX_CONTESTED);
1168 /* The address was invalid. */
1170 umtxq_lock(&uq->uq_key);
1172 umtxq_unlock(&uq->uq_key);
1173 umtx_key_release(&uq->uq_key);
1178 * We set the contested bit, sleep. Otherwise the lock changed
1179 * and we need to retry or we lost a race to the thread
1180 * unlocking the umtx.
1182 umtxq_lock(&uq->uq_key);
1184 error = umtxq_sleep(uq, "umtx", timeout == NULL ?
1187 umtxq_unlock(&uq->uq_key);
1188 umtx_key_release(&uq->uq_key);
1191 error = thread_check_susp(td, false);
1194 if (timeout == NULL) {
1195 /* Mutex locking is restarted if it is interrupted. */
1199 /* Timed-locking is not restarted. */
1200 if (error == ERESTART)
1207 * Unlock a umtx object.
1210 do_unlock_umtx32(struct thread *td, uint32_t *m, uint32_t id)
1212 struct umtx_key key;
1219 * Make sure we own this mtx.
1221 owner = fuword32(m);
1225 if ((owner & ~UMUTEX_CONTESTED) != id)
1228 /* This should be done in userland */
1229 if ((owner & UMUTEX_CONTESTED) == 0) {
1230 old = casuword32(m, owner, UMUTEX_UNOWNED);
1238 /* We should only ever be in here for contested locks */
1239 if ((error = umtx_key_get(m, TYPE_SIMPLE_LOCK, AUTO_SHARE,
1245 count = umtxq_count(&key);
1249 * When unlocking the umtx, it must be marked as unowned if
1250 * there is zero or one thread only waiting for it.
1251 * Otherwise, it must be marked as contested.
1253 old = casuword32(m, owner,
1254 count <= 1 ? UMUTEX_UNOWNED : UMUTEX_CONTESTED);
1256 umtxq_signal(&key,1);
1259 umtx_key_release(&key);
1266 #endif /* COMPAT_FREEBSD32 */
1267 #endif /* COMPAT_FREEBSD10 */
1270 * Fetch and compare value, sleep on the address if value is not changed.
1273 do_wait(struct thread *td, void *addr, u_long id,
1274 struct _umtx_time *timeout, int compat32, int is_private)
1276 struct umtx_abs_timeout timo;
1283 if ((error = umtx_key_get(addr, TYPE_SIMPLE_WAIT,
1284 is_private ? THREAD_SHARE : AUTO_SHARE, &uq->uq_key)) != 0)
1287 if (timeout != NULL)
1288 umtx_abs_timeout_init2(&timo, timeout);
1290 umtxq_lock(&uq->uq_key);
1292 umtxq_unlock(&uq->uq_key);
1293 if (compat32 == 0) {
1294 error = fueword(addr, &tmp);
1298 error = fueword32(addr, &tmp32);
1304 umtxq_lock(&uq->uq_key);
1307 error = umtxq_sleep(uq, "uwait", timeout == NULL ?
1309 if ((uq->uq_flags & UQF_UMTXQ) == 0)
1313 } else if ((uq->uq_flags & UQF_UMTXQ) != 0) {
1316 umtxq_unlock(&uq->uq_key);
1317 umtx_key_release(&uq->uq_key);
1318 if (error == ERESTART)
1324 * Wake up threads sleeping on the specified address.
1327 kern_umtx_wake(struct thread *td, void *uaddr, int n_wake, int is_private)
1329 struct umtx_key key;
1332 if ((ret = umtx_key_get(uaddr, TYPE_SIMPLE_WAIT,
1333 is_private ? THREAD_SHARE : AUTO_SHARE, &key)) != 0)
1336 umtxq_signal(&key, n_wake);
1338 umtx_key_release(&key);
1343 * Lock PTHREAD_PRIO_NONE protocol POSIX mutex.
1346 do_lock_normal(struct thread *td, struct umutex *m, uint32_t flags,
1347 struct _umtx_time *timeout, int mode)
1349 struct umtx_abs_timeout timo;
1351 uint32_t owner, old, id;
1357 if (timeout != NULL)
1358 umtx_abs_timeout_init2(&timo, timeout);
1361 * Care must be exercised when dealing with umtx structure. It
1362 * can fault on any access.
1365 rv = fueword32(&m->m_owner, &owner);
1368 if (mode == _UMUTEX_WAIT) {
1369 if (owner == UMUTEX_UNOWNED ||
1370 owner == UMUTEX_CONTESTED ||
1371 owner == UMUTEX_RB_OWNERDEAD ||
1372 owner == UMUTEX_RB_NOTRECOV)
1376 * Robust mutex terminated. Kernel duty is to
1377 * return EOWNERDEAD to the userspace. The
1378 * umutex.m_flags UMUTEX_NONCONSISTENT is set
1379 * by the common userspace code.
1381 if (owner == UMUTEX_RB_OWNERDEAD) {
1382 rv = casueword32(&m->m_owner,
1383 UMUTEX_RB_OWNERDEAD, &owner,
1384 id | UMUTEX_CONTESTED);
1388 MPASS(owner == UMUTEX_RB_OWNERDEAD);
1389 return (EOWNERDEAD); /* success */
1392 rv = thread_check_susp(td, false);
1397 if (owner == UMUTEX_RB_NOTRECOV)
1398 return (ENOTRECOVERABLE);
1401 * Try the uncontested case. This should be
1404 rv = casueword32(&m->m_owner, UMUTEX_UNOWNED,
1406 /* The address was invalid. */
1410 /* The acquire succeeded. */
1412 MPASS(owner == UMUTEX_UNOWNED);
1417 * If no one owns it but it is contested try
1421 if (owner == UMUTEX_CONTESTED) {
1422 rv = casueword32(&m->m_owner,
1423 UMUTEX_CONTESTED, &owner,
1424 id | UMUTEX_CONTESTED);
1425 /* The address was invalid. */
1429 MPASS(owner == UMUTEX_CONTESTED);
1433 rv = thread_check_susp(td, false);
1439 * If this failed the lock has
1445 /* rv == 1 but not contested, likely store failure */
1446 rv = thread_check_susp(td, false);
1451 if (mode == _UMUTEX_TRY)
1455 * If we caught a signal, we have retried and now
1461 if ((error = umtx_key_get(m, TYPE_NORMAL_UMUTEX,
1462 GET_SHARE(flags), &uq->uq_key)) != 0)
1465 umtxq_lock(&uq->uq_key);
1466 umtxq_busy(&uq->uq_key);
1468 umtxq_unlock(&uq->uq_key);
1471 * Set the contested bit so that a release in user space
1472 * knows to use the system call for unlock. If this fails
1473 * either some one else has acquired the lock or it has been
1476 rv = casueword32(&m->m_owner, owner, &old,
1477 owner | UMUTEX_CONTESTED);
1479 /* The address was invalid or casueword failed to store. */
1480 if (rv == -1 || rv == 1) {
1481 umtxq_lock(&uq->uq_key);
1483 umtxq_unbusy(&uq->uq_key);
1484 umtxq_unlock(&uq->uq_key);
1485 umtx_key_release(&uq->uq_key);
1489 rv = thread_check_susp(td, false);
1497 * We set the contested bit, sleep. Otherwise the lock changed
1498 * and we need to retry or we lost a race to the thread
1499 * unlocking the umtx.
1501 umtxq_lock(&uq->uq_key);
1502 umtxq_unbusy(&uq->uq_key);
1503 MPASS(old == owner);
1504 error = umtxq_sleep(uq, "umtxn", timeout == NULL ?
1507 umtxq_unlock(&uq->uq_key);
1508 umtx_key_release(&uq->uq_key);
1511 error = thread_check_susp(td, false);
1518 * Unlock PTHREAD_PRIO_NONE protocol POSIX mutex.
1521 do_unlock_normal(struct thread *td, struct umutex *m, uint32_t flags, bool rb)
1523 struct umtx_key key;
1524 uint32_t owner, old, id, newlock;
1531 * Make sure we own this mtx.
1533 error = fueword32(&m->m_owner, &owner);
1537 if ((owner & ~UMUTEX_CONTESTED) != id)
1540 newlock = umtx_unlock_val(flags, rb);
1541 if ((owner & UMUTEX_CONTESTED) == 0) {
1542 error = casueword32(&m->m_owner, owner, &old, newlock);
1546 error = thread_check_susp(td, false);
1551 MPASS(old == owner);
1555 /* We should only ever be in here for contested locks */
1556 if ((error = umtx_key_get(m, TYPE_NORMAL_UMUTEX, GET_SHARE(flags),
1562 count = umtxq_count(&key);
1566 * When unlocking the umtx, it must be marked as unowned if
1567 * there is zero or one thread only waiting for it.
1568 * Otherwise, it must be marked as contested.
1571 newlock |= UMUTEX_CONTESTED;
1572 error = casueword32(&m->m_owner, owner, &old, newlock);
1574 umtxq_signal(&key, 1);
1577 umtx_key_release(&key);
1583 error = thread_check_susp(td, false);
1592 * Check if the mutex is available and wake up a waiter,
1593 * only for simple mutex.
1596 do_wake_umutex(struct thread *td, struct umutex *m)
1598 struct umtx_key key;
1605 error = fueword32(&m->m_owner, &owner);
1609 if ((owner & ~UMUTEX_CONTESTED) != 0 && owner != UMUTEX_RB_OWNERDEAD &&
1610 owner != UMUTEX_RB_NOTRECOV)
1613 error = fueword32(&m->m_flags, &flags);
1617 /* We should only ever be in here for contested locks */
1618 if ((error = umtx_key_get(m, TYPE_NORMAL_UMUTEX, GET_SHARE(flags),
1624 count = umtxq_count(&key);
1627 if (count <= 1 && owner != UMUTEX_RB_OWNERDEAD &&
1628 owner != UMUTEX_RB_NOTRECOV) {
1629 error = casueword32(&m->m_owner, UMUTEX_CONTESTED, &owner,
1633 } else if (error == 1) {
1637 umtx_key_release(&key);
1638 error = thread_check_susp(td, false);
1646 if (error == 0 && count != 0) {
1647 MPASS((owner & ~UMUTEX_CONTESTED) == 0 ||
1648 owner == UMUTEX_RB_OWNERDEAD ||
1649 owner == UMUTEX_RB_NOTRECOV);
1650 umtxq_signal(&key, 1);
1654 umtx_key_release(&key);
1659 * Check if the mutex has waiters and tries to fix contention bit.
1662 do_wake2_umutex(struct thread *td, struct umutex *m, uint32_t flags)
1664 struct umtx_key key;
1665 uint32_t owner, old;
1670 switch (flags & (UMUTEX_PRIO_INHERIT | UMUTEX_PRIO_PROTECT |
1674 type = TYPE_NORMAL_UMUTEX;
1676 case UMUTEX_PRIO_INHERIT:
1677 type = TYPE_PI_UMUTEX;
1679 case (UMUTEX_PRIO_INHERIT | UMUTEX_ROBUST):
1680 type = TYPE_PI_ROBUST_UMUTEX;
1682 case UMUTEX_PRIO_PROTECT:
1683 type = TYPE_PP_UMUTEX;
1685 case (UMUTEX_PRIO_PROTECT | UMUTEX_ROBUST):
1686 type = TYPE_PP_ROBUST_UMUTEX;
1691 if ((error = umtx_key_get(m, type, GET_SHARE(flags), &key)) != 0)
1697 count = umtxq_count(&key);
1700 error = fueword32(&m->m_owner, &owner);
1705 * Only repair contention bit if there is a waiter, this means
1706 * the mutex is still being referenced by userland code,
1707 * otherwise don't update any memory.
1709 while (error == 0 && (owner & UMUTEX_CONTESTED) == 0 &&
1710 (count > 1 || (count == 1 && (owner & ~UMUTEX_CONTESTED) != 0))) {
1711 error = casueword32(&m->m_owner, owner, &old,
1712 owner | UMUTEX_CONTESTED);
1718 MPASS(old == owner);
1722 error = thread_check_susp(td, false);
1726 if (error == EFAULT) {
1727 umtxq_signal(&key, INT_MAX);
1728 } else if (count != 0 && ((owner & ~UMUTEX_CONTESTED) == 0 ||
1729 owner == UMUTEX_RB_OWNERDEAD || owner == UMUTEX_RB_NOTRECOV))
1730 umtxq_signal(&key, 1);
1733 umtx_key_release(&key);
1738 umtx_pi_alloc(int flags)
1742 pi = uma_zalloc(umtx_pi_zone, M_ZERO | flags);
1743 TAILQ_INIT(&pi->pi_blocked);
1744 atomic_add_int(&umtx_pi_allocated, 1);
1749 umtx_pi_free(struct umtx_pi *pi)
1751 uma_zfree(umtx_pi_zone, pi);
1752 atomic_add_int(&umtx_pi_allocated, -1);
1756 * Adjust the thread's position on a pi_state after its priority has been
1760 umtx_pi_adjust_thread(struct umtx_pi *pi, struct thread *td)
1762 struct umtx_q *uq, *uq1, *uq2;
1765 mtx_assert(&umtx_lock, MA_OWNED);
1772 * Check if the thread needs to be moved on the blocked chain.
1773 * It needs to be moved if either its priority is lower than
1774 * the previous thread or higher than the next thread.
1776 uq1 = TAILQ_PREV(uq, umtxq_head, uq_lockq);
1777 uq2 = TAILQ_NEXT(uq, uq_lockq);
1778 if ((uq1 != NULL && UPRI(td) < UPRI(uq1->uq_thread)) ||
1779 (uq2 != NULL && UPRI(td) > UPRI(uq2->uq_thread))) {
1781 * Remove thread from blocked chain and determine where
1782 * it should be moved to.
1784 TAILQ_REMOVE(&pi->pi_blocked, uq, uq_lockq);
1785 TAILQ_FOREACH(uq1, &pi->pi_blocked, uq_lockq) {
1786 td1 = uq1->uq_thread;
1787 MPASS(td1->td_proc->p_magic == P_MAGIC);
1788 if (UPRI(td1) > UPRI(td))
1793 TAILQ_INSERT_TAIL(&pi->pi_blocked, uq, uq_lockq);
1795 TAILQ_INSERT_BEFORE(uq1, uq, uq_lockq);
1800 static struct umtx_pi *
1801 umtx_pi_next(struct umtx_pi *pi)
1803 struct umtx_q *uq_owner;
1805 if (pi->pi_owner == NULL)
1807 uq_owner = pi->pi_owner->td_umtxq;
1808 if (uq_owner == NULL)
1810 return (uq_owner->uq_pi_blocked);
1814 * Floyd's Cycle-Finding Algorithm.
1817 umtx_pi_check_loop(struct umtx_pi *pi)
1819 struct umtx_pi *pi1; /* fast iterator */
1821 mtx_assert(&umtx_lock, MA_OWNED);
1826 pi = umtx_pi_next(pi);
1829 pi1 = umtx_pi_next(pi1);
1832 pi1 = umtx_pi_next(pi1);
1842 * Propagate priority when a thread is blocked on POSIX
1846 umtx_propagate_priority(struct thread *td)
1852 mtx_assert(&umtx_lock, MA_OWNED);
1855 pi = uq->uq_pi_blocked;
1858 if (umtx_pi_check_loop(pi))
1863 if (td == NULL || td == curthread)
1866 MPASS(td->td_proc != NULL);
1867 MPASS(td->td_proc->p_magic == P_MAGIC);
1870 if (td->td_lend_user_pri > pri)
1871 sched_lend_user_prio(td, pri);
1879 * Pick up the lock that td is blocked on.
1882 pi = uq->uq_pi_blocked;
1885 /* Resort td on the list if needed. */
1886 umtx_pi_adjust_thread(pi, td);
1891 * Unpropagate priority for a PI mutex when a thread blocked on
1892 * it is interrupted by signal or resumed by others.
1895 umtx_repropagate_priority(struct umtx_pi *pi)
1897 struct umtx_q *uq, *uq_owner;
1898 struct umtx_pi *pi2;
1901 mtx_assert(&umtx_lock, MA_OWNED);
1903 if (umtx_pi_check_loop(pi))
1905 while (pi != NULL && pi->pi_owner != NULL) {
1907 uq_owner = pi->pi_owner->td_umtxq;
1909 TAILQ_FOREACH(pi2, &uq_owner->uq_pi_contested, pi_link) {
1910 uq = TAILQ_FIRST(&pi2->pi_blocked);
1912 if (pri > UPRI(uq->uq_thread))
1913 pri = UPRI(uq->uq_thread);
1917 if (pri > uq_owner->uq_inherited_pri)
1918 pri = uq_owner->uq_inherited_pri;
1919 thread_lock(pi->pi_owner);
1920 sched_lend_user_prio(pi->pi_owner, pri);
1921 thread_unlock(pi->pi_owner);
1922 if ((pi = uq_owner->uq_pi_blocked) != NULL)
1923 umtx_pi_adjust_thread(pi, uq_owner->uq_thread);
1928 * Insert a PI mutex into owned list.
1931 umtx_pi_setowner(struct umtx_pi *pi, struct thread *owner)
1933 struct umtx_q *uq_owner;
1935 uq_owner = owner->td_umtxq;
1936 mtx_assert(&umtx_lock, MA_OWNED);
1937 MPASS(pi->pi_owner == NULL);
1938 pi->pi_owner = owner;
1939 TAILQ_INSERT_TAIL(&uq_owner->uq_pi_contested, pi, pi_link);
1943 * Disown a PI mutex, and remove it from the owned list.
1946 umtx_pi_disown(struct umtx_pi *pi)
1949 mtx_assert(&umtx_lock, MA_OWNED);
1950 TAILQ_REMOVE(&pi->pi_owner->td_umtxq->uq_pi_contested, pi, pi_link);
1951 pi->pi_owner = NULL;
1955 * Claim ownership of a PI mutex.
1958 umtx_pi_claim(struct umtx_pi *pi, struct thread *owner)
1963 mtx_lock(&umtx_lock);
1964 if (pi->pi_owner == owner) {
1965 mtx_unlock(&umtx_lock);
1969 if (pi->pi_owner != NULL) {
1971 * userland may have already messed the mutex, sigh.
1973 mtx_unlock(&umtx_lock);
1976 umtx_pi_setowner(pi, owner);
1977 uq = TAILQ_FIRST(&pi->pi_blocked);
1979 pri = UPRI(uq->uq_thread);
1981 if (pri < UPRI(owner))
1982 sched_lend_user_prio(owner, pri);
1983 thread_unlock(owner);
1985 mtx_unlock(&umtx_lock);
1990 * Adjust a thread's order position in its blocked PI mutex,
1991 * this may result new priority propagating process.
1994 umtx_pi_adjust(struct thread *td, u_char oldpri)
2000 mtx_lock(&umtx_lock);
2002 * Pick up the lock that td is blocked on.
2004 pi = uq->uq_pi_blocked;
2006 umtx_pi_adjust_thread(pi, td);
2007 umtx_repropagate_priority(pi);
2009 mtx_unlock(&umtx_lock);
2013 * Sleep on a PI mutex.
2016 umtxq_sleep_pi(struct umtx_q *uq, struct umtx_pi *pi, uint32_t owner,
2017 const char *wmesg, struct umtx_abs_timeout *timo, bool shared)
2019 struct thread *td, *td1;
2023 struct umtxq_chain *uc;
2025 uc = umtxq_getchain(&pi->pi_key);
2029 KASSERT(td == curthread, ("inconsistent uq_thread"));
2030 UMTXQ_LOCKED_ASSERT(umtxq_getchain(&uq->uq_key));
2031 KASSERT(uc->uc_busy != 0, ("umtx chain is not busy"));
2033 mtx_lock(&umtx_lock);
2034 if (pi->pi_owner == NULL) {
2035 mtx_unlock(&umtx_lock);
2036 td1 = tdfind(owner, shared ? -1 : td->td_proc->p_pid);
2037 mtx_lock(&umtx_lock);
2039 if (pi->pi_owner == NULL)
2040 umtx_pi_setowner(pi, td1);
2041 PROC_UNLOCK(td1->td_proc);
2045 TAILQ_FOREACH(uq1, &pi->pi_blocked, uq_lockq) {
2046 pri = UPRI(uq1->uq_thread);
2052 TAILQ_INSERT_BEFORE(uq1, uq, uq_lockq);
2054 TAILQ_INSERT_TAIL(&pi->pi_blocked, uq, uq_lockq);
2056 uq->uq_pi_blocked = pi;
2058 td->td_flags |= TDF_UPIBLOCKED;
2060 umtx_propagate_priority(td);
2061 mtx_unlock(&umtx_lock);
2062 umtxq_unbusy(&uq->uq_key);
2064 error = umtxq_sleep(uq, wmesg, timo);
2067 mtx_lock(&umtx_lock);
2068 uq->uq_pi_blocked = NULL;
2070 td->td_flags &= ~TDF_UPIBLOCKED;
2072 TAILQ_REMOVE(&pi->pi_blocked, uq, uq_lockq);
2073 umtx_repropagate_priority(pi);
2074 mtx_unlock(&umtx_lock);
2075 umtxq_unlock(&uq->uq_key);
2081 * Add reference count for a PI mutex.
2084 umtx_pi_ref(struct umtx_pi *pi)
2087 UMTXQ_LOCKED_ASSERT(umtxq_getchain(&pi->pi_key));
2092 * Decrease reference count for a PI mutex, if the counter
2093 * is decreased to zero, its memory space is freed.
2096 umtx_pi_unref(struct umtx_pi *pi)
2098 struct umtxq_chain *uc;
2100 uc = umtxq_getchain(&pi->pi_key);
2101 UMTXQ_LOCKED_ASSERT(uc);
2102 KASSERT(pi->pi_refcount > 0, ("invalid reference count"));
2103 if (--pi->pi_refcount == 0) {
2104 mtx_lock(&umtx_lock);
2105 if (pi->pi_owner != NULL)
2107 KASSERT(TAILQ_EMPTY(&pi->pi_blocked),
2108 ("blocked queue not empty"));
2109 mtx_unlock(&umtx_lock);
2110 TAILQ_REMOVE(&uc->uc_pi_list, pi, pi_hashlink);
2116 * Find a PI mutex in hash table.
2119 umtx_pi_lookup(struct umtx_key *key)
2121 struct umtxq_chain *uc;
2124 uc = umtxq_getchain(key);
2125 UMTXQ_LOCKED_ASSERT(uc);
2127 TAILQ_FOREACH(pi, &uc->uc_pi_list, pi_hashlink) {
2128 if (umtx_key_match(&pi->pi_key, key)) {
2136 * Insert a PI mutex into hash table.
2139 umtx_pi_insert(struct umtx_pi *pi)
2141 struct umtxq_chain *uc;
2143 uc = umtxq_getchain(&pi->pi_key);
2144 UMTXQ_LOCKED_ASSERT(uc);
2145 TAILQ_INSERT_TAIL(&uc->uc_pi_list, pi, pi_hashlink);
2149 * Drop a PI mutex and wakeup a top waiter.
2152 umtx_pi_drop(struct thread *td, struct umtx_key *key, bool rb, int *count)
2154 struct umtx_q *uq_first, *uq_first2, *uq_me;
2155 struct umtx_pi *pi, *pi2;
2158 UMTXQ_ASSERT_LOCKED_BUSY(key);
2159 *count = umtxq_count_pi(key, &uq_first);
2160 if (uq_first != NULL) {
2161 mtx_lock(&umtx_lock);
2162 pi = uq_first->uq_pi_blocked;
2163 KASSERT(pi != NULL, ("pi == NULL?"));
2164 if (pi->pi_owner != td && !(rb && pi->pi_owner == NULL)) {
2165 mtx_unlock(&umtx_lock);
2166 /* userland messed the mutex */
2169 uq_me = td->td_umtxq;
2170 if (pi->pi_owner == td)
2172 /* get highest priority thread which is still sleeping. */
2173 uq_first = TAILQ_FIRST(&pi->pi_blocked);
2174 while (uq_first != NULL &&
2175 (uq_first->uq_flags & UQF_UMTXQ) == 0) {
2176 uq_first = TAILQ_NEXT(uq_first, uq_lockq);
2179 TAILQ_FOREACH(pi2, &uq_me->uq_pi_contested, pi_link) {
2180 uq_first2 = TAILQ_FIRST(&pi2->pi_blocked);
2181 if (uq_first2 != NULL) {
2182 if (pri > UPRI(uq_first2->uq_thread))
2183 pri = UPRI(uq_first2->uq_thread);
2187 sched_lend_user_prio(td, pri);
2189 mtx_unlock(&umtx_lock);
2191 umtxq_signal_thread(uq_first);
2193 pi = umtx_pi_lookup(key);
2195 * A umtx_pi can exist if a signal or timeout removed the
2196 * last waiter from the umtxq, but there is still
2197 * a thread in do_lock_pi() holding the umtx_pi.
2201 * The umtx_pi can be unowned, such as when a thread
2202 * has just entered do_lock_pi(), allocated the
2203 * umtx_pi, and unlocked the umtxq.
2204 * If the current thread owns it, it must disown it.
2206 mtx_lock(&umtx_lock);
2207 if (pi->pi_owner == td)
2209 mtx_unlock(&umtx_lock);
2219 do_lock_pi(struct thread *td, struct umutex *m, uint32_t flags,
2220 struct _umtx_time *timeout, int try)
2222 struct umtx_abs_timeout timo;
2224 struct umtx_pi *pi, *new_pi;
2225 uint32_t id, old_owner, owner, old;
2231 if ((error = umtx_key_get(m, (flags & UMUTEX_ROBUST) != 0 ?
2232 TYPE_PI_ROBUST_UMUTEX : TYPE_PI_UMUTEX, GET_SHARE(flags),
2236 if (timeout != NULL)
2237 umtx_abs_timeout_init2(&timo, timeout);
2239 umtxq_lock(&uq->uq_key);
2240 pi = umtx_pi_lookup(&uq->uq_key);
2242 new_pi = umtx_pi_alloc(M_NOWAIT);
2243 if (new_pi == NULL) {
2244 umtxq_unlock(&uq->uq_key);
2245 new_pi = umtx_pi_alloc(M_WAITOK);
2246 umtxq_lock(&uq->uq_key);
2247 pi = umtx_pi_lookup(&uq->uq_key);
2249 umtx_pi_free(new_pi);
2253 if (new_pi != NULL) {
2254 new_pi->pi_key = uq->uq_key;
2255 umtx_pi_insert(new_pi);
2260 umtxq_unlock(&uq->uq_key);
2263 * Care must be exercised when dealing with umtx structure. It
2264 * can fault on any access.
2268 * Try the uncontested case. This should be done in userland.
2270 rv = casueword32(&m->m_owner, UMUTEX_UNOWNED, &owner, id);
2271 /* The address was invalid. */
2276 /* The acquire succeeded. */
2278 MPASS(owner == UMUTEX_UNOWNED);
2283 if (owner == UMUTEX_RB_NOTRECOV) {
2284 error = ENOTRECOVERABLE;
2289 * Nobody owns it, but the acquire failed. This can happen
2290 * with ll/sc atomics.
2292 if (owner == UMUTEX_UNOWNED) {
2293 error = thread_check_susp(td, true);
2300 * Avoid overwriting a possible error from sleep due
2301 * to the pending signal with suspension check result.
2304 error = thread_check_susp(td, true);
2309 /* If no one owns it but it is contested try to acquire it. */
2310 if (owner == UMUTEX_CONTESTED || owner == UMUTEX_RB_OWNERDEAD) {
2312 rv = casueword32(&m->m_owner, owner, &owner,
2313 id | UMUTEX_CONTESTED);
2314 /* The address was invalid. */
2321 error = thread_check_susp(td, true);
2327 * If this failed the lock could
2334 MPASS(owner == old_owner);
2335 umtxq_lock(&uq->uq_key);
2336 umtxq_busy(&uq->uq_key);
2337 error = umtx_pi_claim(pi, td);
2338 umtxq_unbusy(&uq->uq_key);
2339 umtxq_unlock(&uq->uq_key);
2342 * Since we're going to return an
2343 * error, restore the m_owner to its
2344 * previous, unowned state to avoid
2345 * compounding the problem.
2347 (void)casuword32(&m->m_owner,
2348 id | UMUTEX_CONTESTED, old_owner);
2350 if (error == 0 && old_owner == UMUTEX_RB_OWNERDEAD)
2355 if ((owner & ~UMUTEX_CONTESTED) == id) {
2366 * If we caught a signal, we have retried and now
2372 umtxq_lock(&uq->uq_key);
2373 umtxq_busy(&uq->uq_key);
2374 umtxq_unlock(&uq->uq_key);
2377 * Set the contested bit so that a release in user space
2378 * knows to use the system call for unlock. If this fails
2379 * either some one else has acquired the lock or it has been
2382 rv = casueword32(&m->m_owner, owner, &old, owner |
2385 /* The address was invalid. */
2387 umtxq_unbusy_unlocked(&uq->uq_key);
2392 umtxq_unbusy_unlocked(&uq->uq_key);
2393 error = thread_check_susp(td, true);
2398 * The lock changed and we need to retry or we
2399 * lost a race to the thread unlocking the
2400 * umtx. Note that the UMUTEX_RB_OWNERDEAD
2401 * value for owner is impossible there.
2406 umtxq_lock(&uq->uq_key);
2408 /* We set the contested bit, sleep. */
2409 MPASS(old == owner);
2410 error = umtxq_sleep_pi(uq, pi, owner & ~UMUTEX_CONTESTED,
2411 "umtxpi", timeout == NULL ? NULL : &timo,
2412 (flags & USYNC_PROCESS_SHARED) != 0);
2416 error = thread_check_susp(td, false);
2421 umtxq_lock(&uq->uq_key);
2423 umtxq_unlock(&uq->uq_key);
2425 umtx_key_release(&uq->uq_key);
2430 * Unlock a PI mutex.
2433 do_unlock_pi(struct thread *td, struct umutex *m, uint32_t flags, bool rb)
2435 struct umtx_key key;
2436 uint32_t id, new_owner, old, owner;
2443 * Make sure we own this mtx.
2445 error = fueword32(&m->m_owner, &owner);
2449 if ((owner & ~UMUTEX_CONTESTED) != id)
2452 new_owner = umtx_unlock_val(flags, rb);
2454 /* This should be done in userland */
2455 if ((owner & UMUTEX_CONTESTED) == 0) {
2456 error = casueword32(&m->m_owner, owner, &old, new_owner);
2460 error = thread_check_susp(td, true);
2470 /* We should only ever be in here for contested locks */
2471 if ((error = umtx_key_get(m, (flags & UMUTEX_ROBUST) != 0 ?
2472 TYPE_PI_ROBUST_UMUTEX : TYPE_PI_UMUTEX, GET_SHARE(flags),
2478 error = umtx_pi_drop(td, &key, rb, &count);
2482 umtx_key_release(&key);
2483 /* userland messed the mutex */
2489 * When unlocking the umtx, it must be marked as unowned if
2490 * there is zero or one thread only waiting for it.
2491 * Otherwise, it must be marked as contested.
2495 new_owner |= UMUTEX_CONTESTED;
2497 error = casueword32(&m->m_owner, owner, &old, new_owner);
2499 error = thread_check_susp(td, false);
2503 umtxq_unbusy_unlocked(&key);
2504 umtx_key_release(&key);
2507 if (error == 0 && old != owner)
2516 do_lock_pp(struct thread *td, struct umutex *m, uint32_t flags,
2517 struct _umtx_time *timeout, int try)
2519 struct umtx_abs_timeout timo;
2520 struct umtx_q *uq, *uq2;
2524 int error, pri, old_inherited_pri, su, rv;
2528 if ((error = umtx_key_get(m, (flags & UMUTEX_ROBUST) != 0 ?
2529 TYPE_PP_ROBUST_UMUTEX : TYPE_PP_UMUTEX, GET_SHARE(flags),
2533 if (timeout != NULL)
2534 umtx_abs_timeout_init2(&timo, timeout);
2536 su = (priv_check(td, PRIV_SCHED_RTPRIO) == 0);
2538 old_inherited_pri = uq->uq_inherited_pri;
2539 umtxq_lock(&uq->uq_key);
2540 umtxq_busy(&uq->uq_key);
2541 umtxq_unlock(&uq->uq_key);
2543 rv = fueword32(&m->m_ceilings[0], &ceiling);
2548 ceiling = RTP_PRIO_MAX - ceiling;
2549 if (ceiling > RTP_PRIO_MAX) {
2554 mtx_lock(&umtx_lock);
2555 if (UPRI(td) < PRI_MIN_REALTIME + ceiling) {
2556 mtx_unlock(&umtx_lock);
2560 if (su && PRI_MIN_REALTIME + ceiling < uq->uq_inherited_pri) {
2561 uq->uq_inherited_pri = PRI_MIN_REALTIME + ceiling;
2563 if (uq->uq_inherited_pri < UPRI(td))
2564 sched_lend_user_prio(td, uq->uq_inherited_pri);
2567 mtx_unlock(&umtx_lock);
2569 rv = casueword32(&m->m_owner, UMUTEX_CONTESTED, &owner,
2570 id | UMUTEX_CONTESTED);
2571 /* The address was invalid. */
2577 MPASS(owner == UMUTEX_CONTESTED);
2582 if (owner == UMUTEX_RB_OWNERDEAD) {
2583 rv = casueword32(&m->m_owner, UMUTEX_RB_OWNERDEAD,
2584 &owner, id | UMUTEX_CONTESTED);
2590 MPASS(owner == UMUTEX_RB_OWNERDEAD);
2591 error = EOWNERDEAD; /* success */
2596 * rv == 1, only check for suspension if we
2597 * did not already catched a signal. If we
2598 * get an error from the check, the same
2599 * condition is checked by the umtxq_sleep()
2600 * call below, so we should obliterate the
2601 * error to not skip the last loop iteration.
2604 error = thread_check_susp(td, false);
2613 } else if (owner == UMUTEX_RB_NOTRECOV) {
2614 error = ENOTRECOVERABLE;
2621 * If we caught a signal, we have retried and now
2627 umtxq_lock(&uq->uq_key);
2629 umtxq_unbusy(&uq->uq_key);
2630 error = umtxq_sleep(uq, "umtxpp", timeout == NULL ?
2633 umtxq_unlock(&uq->uq_key);
2635 mtx_lock(&umtx_lock);
2636 uq->uq_inherited_pri = old_inherited_pri;
2638 TAILQ_FOREACH(pi, &uq->uq_pi_contested, pi_link) {
2639 uq2 = TAILQ_FIRST(&pi->pi_blocked);
2641 if (pri > UPRI(uq2->uq_thread))
2642 pri = UPRI(uq2->uq_thread);
2645 if (pri > uq->uq_inherited_pri)
2646 pri = uq->uq_inherited_pri;
2648 sched_lend_user_prio(td, pri);
2650 mtx_unlock(&umtx_lock);
2653 if (error != 0 && error != EOWNERDEAD) {
2654 mtx_lock(&umtx_lock);
2655 uq->uq_inherited_pri = old_inherited_pri;
2657 TAILQ_FOREACH(pi, &uq->uq_pi_contested, pi_link) {
2658 uq2 = TAILQ_FIRST(&pi->pi_blocked);
2660 if (pri > UPRI(uq2->uq_thread))
2661 pri = UPRI(uq2->uq_thread);
2664 if (pri > uq->uq_inherited_pri)
2665 pri = uq->uq_inherited_pri;
2667 sched_lend_user_prio(td, pri);
2669 mtx_unlock(&umtx_lock);
2673 umtxq_unbusy_unlocked(&uq->uq_key);
2674 umtx_key_release(&uq->uq_key);
2679 * Unlock a PP mutex.
2682 do_unlock_pp(struct thread *td, struct umutex *m, uint32_t flags, bool rb)
2684 struct umtx_key key;
2685 struct umtx_q *uq, *uq2;
2687 uint32_t id, owner, rceiling;
2688 int error, pri, new_inherited_pri, su;
2692 su = (priv_check(td, PRIV_SCHED_RTPRIO) == 0);
2695 * Make sure we own this mtx.
2697 error = fueword32(&m->m_owner, &owner);
2701 if ((owner & ~UMUTEX_CONTESTED) != id)
2704 error = copyin(&m->m_ceilings[1], &rceiling, sizeof(uint32_t));
2709 new_inherited_pri = PRI_MAX;
2711 rceiling = RTP_PRIO_MAX - rceiling;
2712 if (rceiling > RTP_PRIO_MAX)
2714 new_inherited_pri = PRI_MIN_REALTIME + rceiling;
2717 if ((error = umtx_key_get(m, (flags & UMUTEX_ROBUST) != 0 ?
2718 TYPE_PP_ROBUST_UMUTEX : TYPE_PP_UMUTEX, GET_SHARE(flags),
2725 * For priority protected mutex, always set unlocked state
2726 * to UMUTEX_CONTESTED, so that userland always enters kernel
2727 * to lock the mutex, it is necessary because thread priority
2728 * has to be adjusted for such mutex.
2730 error = suword32(&m->m_owner, umtx_unlock_val(flags, rb) |
2735 umtxq_signal(&key, 1);
2742 mtx_lock(&umtx_lock);
2744 uq->uq_inherited_pri = new_inherited_pri;
2746 TAILQ_FOREACH(pi, &uq->uq_pi_contested, pi_link) {
2747 uq2 = TAILQ_FIRST(&pi->pi_blocked);
2749 if (pri > UPRI(uq2->uq_thread))
2750 pri = UPRI(uq2->uq_thread);
2753 if (pri > uq->uq_inherited_pri)
2754 pri = uq->uq_inherited_pri;
2756 sched_lend_user_prio(td, pri);
2758 mtx_unlock(&umtx_lock);
2760 umtx_key_release(&key);
2765 do_set_ceiling(struct thread *td, struct umutex *m, uint32_t ceiling,
2766 uint32_t *old_ceiling)
2769 uint32_t flags, id, owner, save_ceiling;
2772 error = fueword32(&m->m_flags, &flags);
2775 if ((flags & UMUTEX_PRIO_PROTECT) == 0)
2777 if (ceiling > RTP_PRIO_MAX)
2781 if ((error = umtx_key_get(m, (flags & UMUTEX_ROBUST) != 0 ?
2782 TYPE_PP_ROBUST_UMUTEX : TYPE_PP_UMUTEX, GET_SHARE(flags),
2786 umtxq_lock(&uq->uq_key);
2787 umtxq_busy(&uq->uq_key);
2788 umtxq_unlock(&uq->uq_key);
2790 rv = fueword32(&m->m_ceilings[0], &save_ceiling);
2796 rv = casueword32(&m->m_owner, UMUTEX_CONTESTED, &owner,
2797 id | UMUTEX_CONTESTED);
2804 MPASS(owner == UMUTEX_CONTESTED);
2805 rv = suword32(&m->m_ceilings[0], ceiling);
2806 rv1 = suword32(&m->m_owner, UMUTEX_CONTESTED);
2807 error = (rv == 0 && rv1 == 0) ? 0: EFAULT;
2811 if ((owner & ~UMUTEX_CONTESTED) == id) {
2812 rv = suword32(&m->m_ceilings[0], ceiling);
2813 error = rv == 0 ? 0 : EFAULT;
2817 if (owner == UMUTEX_RB_OWNERDEAD) {
2820 } else if (owner == UMUTEX_RB_NOTRECOV) {
2821 error = ENOTRECOVERABLE;
2826 * If we caught a signal, we have retried and now
2833 * We set the contested bit, sleep. Otherwise the lock changed
2834 * and we need to retry or we lost a race to the thread
2835 * unlocking the umtx.
2837 umtxq_lock(&uq->uq_key);
2839 umtxq_unbusy(&uq->uq_key);
2840 error = umtxq_sleep(uq, "umtxpp", NULL);
2842 umtxq_unlock(&uq->uq_key);
2844 umtxq_lock(&uq->uq_key);
2846 umtxq_signal(&uq->uq_key, INT_MAX);
2847 umtxq_unbusy(&uq->uq_key);
2848 umtxq_unlock(&uq->uq_key);
2849 umtx_key_release(&uq->uq_key);
2850 if (error == 0 && old_ceiling != NULL) {
2851 rv = suword32(old_ceiling, save_ceiling);
2852 error = rv == 0 ? 0 : EFAULT;
2858 * Lock a userland POSIX mutex.
2861 do_lock_umutex(struct thread *td, struct umutex *m,
2862 struct _umtx_time *timeout, int mode)
2867 error = fueword32(&m->m_flags, &flags);
2871 switch (flags & (UMUTEX_PRIO_INHERIT | UMUTEX_PRIO_PROTECT)) {
2873 error = do_lock_normal(td, m, flags, timeout, mode);
2875 case UMUTEX_PRIO_INHERIT:
2876 error = do_lock_pi(td, m, flags, timeout, mode);
2878 case UMUTEX_PRIO_PROTECT:
2879 error = do_lock_pp(td, m, flags, timeout, mode);
2884 if (timeout == NULL) {
2885 if (error == EINTR && mode != _UMUTEX_WAIT)
2888 /* Timed-locking is not restarted. */
2889 if (error == ERESTART)
2896 * Unlock a userland POSIX mutex.
2899 do_unlock_umutex(struct thread *td, struct umutex *m, bool rb)
2904 error = fueword32(&m->m_flags, &flags);
2908 switch (flags & (UMUTEX_PRIO_INHERIT | UMUTEX_PRIO_PROTECT)) {
2910 return (do_unlock_normal(td, m, flags, rb));
2911 case UMUTEX_PRIO_INHERIT:
2912 return (do_unlock_pi(td, m, flags, rb));
2913 case UMUTEX_PRIO_PROTECT:
2914 return (do_unlock_pp(td, m, flags, rb));
2921 do_cv_wait(struct thread *td, struct ucond *cv, struct umutex *m,
2922 struct timespec *timeout, u_long wflags)
2924 struct umtx_abs_timeout timo;
2926 uint32_t flags, clockid, hasw;
2930 error = fueword32(&cv->c_flags, &flags);
2933 error = umtx_key_get(cv, TYPE_CV, GET_SHARE(flags), &uq->uq_key);
2937 if ((wflags & CVWAIT_CLOCKID) != 0) {
2938 error = fueword32(&cv->c_clockid, &clockid);
2940 umtx_key_release(&uq->uq_key);
2943 if (clockid < CLOCK_REALTIME ||
2944 clockid >= CLOCK_THREAD_CPUTIME_ID) {
2945 /* hmm, only HW clock id will work. */
2946 umtx_key_release(&uq->uq_key);
2950 clockid = CLOCK_REALTIME;
2953 umtxq_lock(&uq->uq_key);
2954 umtxq_busy(&uq->uq_key);
2956 umtxq_unlock(&uq->uq_key);
2959 * Set c_has_waiters to 1 before releasing user mutex, also
2960 * don't modify cache line when unnecessary.
2962 error = fueword32(&cv->c_has_waiters, &hasw);
2963 if (error == 0 && hasw == 0)
2964 suword32(&cv->c_has_waiters, 1);
2966 umtxq_unbusy_unlocked(&uq->uq_key);
2968 error = do_unlock_umutex(td, m, false);
2970 if (timeout != NULL)
2971 umtx_abs_timeout_init(&timo, clockid,
2972 (wflags & CVWAIT_ABSTIME) != 0, timeout);
2974 umtxq_lock(&uq->uq_key);
2976 error = umtxq_sleep(uq, "ucond", timeout == NULL ?
2980 if ((uq->uq_flags & UQF_UMTXQ) == 0)
2984 * This must be timeout,interrupted by signal or
2985 * surprious wakeup, clear c_has_waiter flag when
2988 umtxq_busy(&uq->uq_key);
2989 if ((uq->uq_flags & UQF_UMTXQ) != 0) {
2990 int oldlen = uq->uq_cur_queue->length;
2993 umtxq_unlock(&uq->uq_key);
2994 suword32(&cv->c_has_waiters, 0);
2995 umtxq_lock(&uq->uq_key);
2998 umtxq_unbusy(&uq->uq_key);
2999 if (error == ERESTART)
3003 umtxq_unlock(&uq->uq_key);
3004 umtx_key_release(&uq->uq_key);
3009 * Signal a userland condition variable.
3012 do_cv_signal(struct thread *td, struct ucond *cv)
3014 struct umtx_key key;
3015 int error, cnt, nwake;
3018 error = fueword32(&cv->c_flags, &flags);
3021 if ((error = umtx_key_get(cv, TYPE_CV, GET_SHARE(flags), &key)) != 0)
3025 cnt = umtxq_count(&key);
3026 nwake = umtxq_signal(&key, 1);
3029 error = suword32(&cv->c_has_waiters, 0);
3036 umtx_key_release(&key);
3041 do_cv_broadcast(struct thread *td, struct ucond *cv)
3043 struct umtx_key key;
3047 error = fueword32(&cv->c_flags, &flags);
3050 if ((error = umtx_key_get(cv, TYPE_CV, GET_SHARE(flags), &key)) != 0)
3055 umtxq_signal(&key, INT_MAX);
3058 error = suword32(&cv->c_has_waiters, 0);
3062 umtxq_unbusy_unlocked(&key);
3064 umtx_key_release(&key);
3069 do_rw_rdlock(struct thread *td, struct urwlock *rwlock, long fflag,
3070 struct _umtx_time *timeout)
3072 struct umtx_abs_timeout timo;
3074 uint32_t flags, wrflags;
3075 int32_t state, oldstate;
3076 int32_t blocked_readers;
3077 int error, error1, rv;
3080 error = fueword32(&rwlock->rw_flags, &flags);
3083 error = umtx_key_get(rwlock, TYPE_RWLOCK, GET_SHARE(flags), &uq->uq_key);
3087 if (timeout != NULL)
3088 umtx_abs_timeout_init2(&timo, timeout);
3090 wrflags = URWLOCK_WRITE_OWNER;
3091 if (!(fflag & URWLOCK_PREFER_READER) && !(flags & URWLOCK_PREFER_READER))
3092 wrflags |= URWLOCK_WRITE_WAITERS;
3095 rv = fueword32(&rwlock->rw_state, &state);
3097 umtx_key_release(&uq->uq_key);
3101 /* try to lock it */
3102 while (!(state & wrflags)) {
3103 if (__predict_false(URWLOCK_READER_COUNT(state) ==
3104 URWLOCK_MAX_READERS)) {
3105 umtx_key_release(&uq->uq_key);
3108 rv = casueword32(&rwlock->rw_state, state,
3109 &oldstate, state + 1);
3111 umtx_key_release(&uq->uq_key);
3115 MPASS(oldstate == state);
3116 umtx_key_release(&uq->uq_key);
3119 error = thread_check_susp(td, true);
3128 /* grab monitor lock */
3129 umtxq_lock(&uq->uq_key);
3130 umtxq_busy(&uq->uq_key);
3131 umtxq_unlock(&uq->uq_key);
3134 * re-read the state, in case it changed between the try-lock above
3135 * and the check below
3137 rv = fueword32(&rwlock->rw_state, &state);
3141 /* set read contention bit */
3142 while (error == 0 && (state & wrflags) &&
3143 !(state & URWLOCK_READ_WAITERS)) {
3144 rv = casueword32(&rwlock->rw_state, state,
3145 &oldstate, state | URWLOCK_READ_WAITERS);
3151 MPASS(oldstate == state);
3155 error = thread_check_susp(td, false);
3160 umtxq_unbusy_unlocked(&uq->uq_key);
3164 /* state is changed while setting flags, restart */
3165 if (!(state & wrflags)) {
3166 umtxq_unbusy_unlocked(&uq->uq_key);
3167 error = thread_check_susp(td, true);
3175 * Contention bit is set, before sleeping, increase
3176 * read waiter count.
3178 rv = fueword32(&rwlock->rw_blocked_readers,
3181 umtxq_unbusy_unlocked(&uq->uq_key);
3185 suword32(&rwlock->rw_blocked_readers, blocked_readers+1);
3187 while (state & wrflags) {
3188 umtxq_lock(&uq->uq_key);
3190 umtxq_unbusy(&uq->uq_key);
3192 error = umtxq_sleep(uq, "urdlck", timeout == NULL ?
3195 umtxq_busy(&uq->uq_key);
3197 umtxq_unlock(&uq->uq_key);
3200 rv = fueword32(&rwlock->rw_state, &state);
3207 /* decrease read waiter count, and may clear read contention bit */
3208 rv = fueword32(&rwlock->rw_blocked_readers,
3211 umtxq_unbusy_unlocked(&uq->uq_key);
3215 suword32(&rwlock->rw_blocked_readers, blocked_readers-1);
3216 if (blocked_readers == 1) {
3217 rv = fueword32(&rwlock->rw_state, &state);
3219 umtxq_unbusy_unlocked(&uq->uq_key);
3224 rv = casueword32(&rwlock->rw_state, state,
3225 &oldstate, state & ~URWLOCK_READ_WAITERS);
3231 MPASS(oldstate == state);
3235 error1 = thread_check_susp(td, false);
3244 umtxq_unbusy_unlocked(&uq->uq_key);
3248 umtx_key_release(&uq->uq_key);
3249 if (error == ERESTART)
3255 do_rw_wrlock(struct thread *td, struct urwlock *rwlock, struct _umtx_time *timeout)
3257 struct umtx_abs_timeout timo;
3260 int32_t state, oldstate;
3261 int32_t blocked_writers;
3262 int32_t blocked_readers;
3263 int error, error1, rv;
3266 error = fueword32(&rwlock->rw_flags, &flags);
3269 error = umtx_key_get(rwlock, TYPE_RWLOCK, GET_SHARE(flags), &uq->uq_key);
3273 if (timeout != NULL)
3274 umtx_abs_timeout_init2(&timo, timeout);
3276 blocked_readers = 0;
3278 rv = fueword32(&rwlock->rw_state, &state);
3280 umtx_key_release(&uq->uq_key);
3283 while ((state & URWLOCK_WRITE_OWNER) == 0 &&
3284 URWLOCK_READER_COUNT(state) == 0) {
3285 rv = casueword32(&rwlock->rw_state, state,
3286 &oldstate, state | URWLOCK_WRITE_OWNER);
3288 umtx_key_release(&uq->uq_key);
3292 MPASS(oldstate == state);
3293 umtx_key_release(&uq->uq_key);
3297 error = thread_check_susp(td, true);
3303 if ((state & (URWLOCK_WRITE_OWNER |
3304 URWLOCK_WRITE_WAITERS)) == 0 &&
3305 blocked_readers != 0) {
3306 umtxq_lock(&uq->uq_key);
3307 umtxq_busy(&uq->uq_key);
3308 umtxq_signal_queue(&uq->uq_key, INT_MAX,
3310 umtxq_unbusy(&uq->uq_key);
3311 umtxq_unlock(&uq->uq_key);
3317 /* grab monitor lock */
3318 umtxq_lock(&uq->uq_key);
3319 umtxq_busy(&uq->uq_key);
3320 umtxq_unlock(&uq->uq_key);
3323 * Re-read the state, in case it changed between the
3324 * try-lock above and the check below.
3326 rv = fueword32(&rwlock->rw_state, &state);
3330 while (error == 0 && ((state & URWLOCK_WRITE_OWNER) ||
3331 URWLOCK_READER_COUNT(state) != 0) &&
3332 (state & URWLOCK_WRITE_WAITERS) == 0) {
3333 rv = casueword32(&rwlock->rw_state, state,
3334 &oldstate, state | URWLOCK_WRITE_WAITERS);
3340 MPASS(oldstate == state);
3344 error = thread_check_susp(td, false);
3349 umtxq_unbusy_unlocked(&uq->uq_key);
3353 if ((state & URWLOCK_WRITE_OWNER) == 0 &&
3354 URWLOCK_READER_COUNT(state) == 0) {
3355 umtxq_unbusy_unlocked(&uq->uq_key);
3356 error = thread_check_susp(td, false);
3362 rv = fueword32(&rwlock->rw_blocked_writers,
3365 umtxq_unbusy_unlocked(&uq->uq_key);
3369 suword32(&rwlock->rw_blocked_writers, blocked_writers + 1);
3371 while ((state & URWLOCK_WRITE_OWNER) ||
3372 URWLOCK_READER_COUNT(state) != 0) {
3373 umtxq_lock(&uq->uq_key);
3374 umtxq_insert_queue(uq, UMTX_EXCLUSIVE_QUEUE);
3375 umtxq_unbusy(&uq->uq_key);
3377 error = umtxq_sleep(uq, "uwrlck", timeout == NULL ?
3380 umtxq_busy(&uq->uq_key);
3381 umtxq_remove_queue(uq, UMTX_EXCLUSIVE_QUEUE);
3382 umtxq_unlock(&uq->uq_key);
3385 rv = fueword32(&rwlock->rw_state, &state);
3392 rv = fueword32(&rwlock->rw_blocked_writers,
3395 umtxq_unbusy_unlocked(&uq->uq_key);
3399 suword32(&rwlock->rw_blocked_writers, blocked_writers-1);
3400 if (blocked_writers == 1) {
3401 rv = fueword32(&rwlock->rw_state, &state);
3403 umtxq_unbusy_unlocked(&uq->uq_key);
3408 rv = casueword32(&rwlock->rw_state, state,
3409 &oldstate, state & ~URWLOCK_WRITE_WAITERS);
3415 MPASS(oldstate == state);
3419 error1 = thread_check_susp(td, false);
3421 * We are leaving the URWLOCK_WRITE_WAITERS
3422 * behind, but this should not harm the
3431 rv = fueword32(&rwlock->rw_blocked_readers,
3434 umtxq_unbusy_unlocked(&uq->uq_key);
3439 blocked_readers = 0;
3441 umtxq_unbusy_unlocked(&uq->uq_key);
3444 umtx_key_release(&uq->uq_key);
3445 if (error == ERESTART)
3451 do_rw_unlock(struct thread *td, struct urwlock *rwlock)
3455 int32_t state, oldstate;
3456 int error, rv, q, count;
3459 error = fueword32(&rwlock->rw_flags, &flags);
3462 error = umtx_key_get(rwlock, TYPE_RWLOCK, GET_SHARE(flags), &uq->uq_key);
3466 error = fueword32(&rwlock->rw_state, &state);
3471 if (state & URWLOCK_WRITE_OWNER) {
3473 rv = casueword32(&rwlock->rw_state, state,
3474 &oldstate, state & ~URWLOCK_WRITE_OWNER);
3481 if (!(oldstate & URWLOCK_WRITE_OWNER)) {
3485 error = thread_check_susp(td, true);
3491 } else if (URWLOCK_READER_COUNT(state) != 0) {
3493 rv = casueword32(&rwlock->rw_state, state,
3494 &oldstate, state - 1);
3501 if (URWLOCK_READER_COUNT(oldstate) == 0) {
3505 error = thread_check_susp(td, true);
3518 if (!(flags & URWLOCK_PREFER_READER)) {
3519 if (state & URWLOCK_WRITE_WAITERS) {
3521 q = UMTX_EXCLUSIVE_QUEUE;
3522 } else if (state & URWLOCK_READ_WAITERS) {
3524 q = UMTX_SHARED_QUEUE;
3527 if (state & URWLOCK_READ_WAITERS) {
3529 q = UMTX_SHARED_QUEUE;
3530 } else if (state & URWLOCK_WRITE_WAITERS) {
3532 q = UMTX_EXCLUSIVE_QUEUE;
3537 umtxq_lock(&uq->uq_key);
3538 umtxq_busy(&uq->uq_key);
3539 umtxq_signal_queue(&uq->uq_key, count, q);
3540 umtxq_unbusy(&uq->uq_key);
3541 umtxq_unlock(&uq->uq_key);
3544 umtx_key_release(&uq->uq_key);
3548 #if defined(COMPAT_FREEBSD9) || defined(COMPAT_FREEBSD10)
3550 do_sem_wait(struct thread *td, struct _usem *sem, struct _umtx_time *timeout)
3552 struct umtx_abs_timeout timo;
3554 uint32_t flags, count, count1;
3558 error = fueword32(&sem->_flags, &flags);
3561 error = umtx_key_get(sem, TYPE_SEM, GET_SHARE(flags), &uq->uq_key);
3565 if (timeout != NULL)
3566 umtx_abs_timeout_init2(&timo, timeout);
3569 umtxq_lock(&uq->uq_key);
3570 umtxq_busy(&uq->uq_key);
3572 umtxq_unlock(&uq->uq_key);
3573 rv = casueword32(&sem->_has_waiters, 0, &count1, 1);
3575 rv1 = fueword32(&sem->_count, &count);
3576 if (rv == -1 || rv1 == -1 || count != 0 || (rv == 1 && count1 == 0)) {
3578 suword32(&sem->_has_waiters, 0);
3579 umtxq_lock(&uq->uq_key);
3580 umtxq_unbusy(&uq->uq_key);
3582 umtxq_unlock(&uq->uq_key);
3583 if (rv == -1 || rv1 == -1) {
3591 MPASS(rv == 1 && count1 == 0);
3592 rv = thread_check_susp(td, true);
3598 umtxq_lock(&uq->uq_key);
3599 umtxq_unbusy(&uq->uq_key);
3601 error = umtxq_sleep(uq, "usem", timeout == NULL ? NULL : &timo);
3603 if ((uq->uq_flags & UQF_UMTXQ) == 0)
3607 /* A relative timeout cannot be restarted. */
3608 if (error == ERESTART && timeout != NULL &&
3609 (timeout->_flags & UMTX_ABSTIME) == 0)
3612 umtxq_unlock(&uq->uq_key);
3614 umtx_key_release(&uq->uq_key);
3619 * Signal a userland semaphore.
3622 do_sem_wake(struct thread *td, struct _usem *sem)
3624 struct umtx_key key;
3628 error = fueword32(&sem->_flags, &flags);
3631 if ((error = umtx_key_get(sem, TYPE_SEM, GET_SHARE(flags), &key)) != 0)
3635 cnt = umtxq_count(&key);
3638 * Check if count is greater than 0, this means the memory is
3639 * still being referenced by user code, so we can safely
3640 * update _has_waiters flag.
3644 error = suword32(&sem->_has_waiters, 0);
3649 umtxq_signal(&key, 1);
3653 umtx_key_release(&key);
3659 do_sem2_wait(struct thread *td, struct _usem2 *sem, struct _umtx_time *timeout)
3661 struct umtx_abs_timeout timo;
3663 uint32_t count, flags;
3667 flags = fuword32(&sem->_flags);
3668 if (timeout != NULL)
3669 umtx_abs_timeout_init2(&timo, timeout);
3672 error = umtx_key_get(sem, TYPE_SEM, GET_SHARE(flags), &uq->uq_key);
3675 umtxq_lock(&uq->uq_key);
3676 umtxq_busy(&uq->uq_key);
3678 umtxq_unlock(&uq->uq_key);
3679 rv = fueword32(&sem->_count, &count);
3681 umtxq_lock(&uq->uq_key);
3682 umtxq_unbusy(&uq->uq_key);
3684 umtxq_unlock(&uq->uq_key);
3685 umtx_key_release(&uq->uq_key);
3689 if (USEM_COUNT(count) != 0) {
3690 umtxq_lock(&uq->uq_key);
3691 umtxq_unbusy(&uq->uq_key);
3693 umtxq_unlock(&uq->uq_key);
3694 umtx_key_release(&uq->uq_key);
3697 if (count == USEM_HAS_WAITERS)
3699 rv = casueword32(&sem->_count, 0, &count, USEM_HAS_WAITERS);
3702 umtxq_lock(&uq->uq_key);
3703 umtxq_unbusy(&uq->uq_key);
3705 umtxq_unlock(&uq->uq_key);
3706 umtx_key_release(&uq->uq_key);
3709 rv = thread_check_susp(td, true);
3714 umtxq_lock(&uq->uq_key);
3715 umtxq_unbusy(&uq->uq_key);
3717 error = umtxq_sleep(uq, "usem", timeout == NULL ? NULL : &timo);
3719 if ((uq->uq_flags & UQF_UMTXQ) == 0)
3723 if (timeout != NULL && (timeout->_flags & UMTX_ABSTIME) == 0) {
3724 /* A relative timeout cannot be restarted. */
3725 if (error == ERESTART)
3727 if (error == EINTR) {
3728 kern_clock_gettime(curthread, timo.clockid,
3730 timespecsub(&timo.end, &timo.cur,
3731 &timeout->_timeout);
3735 umtxq_unlock(&uq->uq_key);
3736 umtx_key_release(&uq->uq_key);
3741 * Signal a userland semaphore.
3744 do_sem2_wake(struct thread *td, struct _usem2 *sem)
3746 struct umtx_key key;
3748 uint32_t count, flags;
3750 rv = fueword32(&sem->_flags, &flags);
3753 if ((error = umtx_key_get(sem, TYPE_SEM, GET_SHARE(flags), &key)) != 0)
3757 cnt = umtxq_count(&key);
3760 * If this was the last sleeping thread, clear the waiters
3765 rv = fueword32(&sem->_count, &count);
3766 while (rv != -1 && count & USEM_HAS_WAITERS) {
3767 rv = casueword32(&sem->_count, count, &count,
3768 count & ~USEM_HAS_WAITERS);
3770 rv = thread_check_susp(td, true);
3783 umtxq_signal(&key, 1);
3787 umtx_key_release(&key);
3791 #ifdef COMPAT_FREEBSD10
3793 freebsd10__umtx_lock(struct thread *td, struct freebsd10__umtx_lock_args *uap)
3795 return (do_lock_umtx(td, uap->umtx, td->td_tid, 0));
3799 freebsd10__umtx_unlock(struct thread *td,
3800 struct freebsd10__umtx_unlock_args *uap)
3802 return (do_unlock_umtx(td, uap->umtx, td->td_tid));
3807 umtx_copyin_timeout(const void *uaddr, struct timespec *tsp)
3811 error = copyin(uaddr, tsp, sizeof(*tsp));
3813 if (!timespecvalid_interval(tsp))
3820 umtx_copyin_umtx_time(const void *uaddr, size_t size, struct _umtx_time *tp)
3824 if (size <= sizeof(tp->_timeout)) {
3825 tp->_clockid = CLOCK_REALTIME;
3827 error = copyin(uaddr, &tp->_timeout, sizeof(tp->_timeout));
3829 error = copyin(uaddr, tp, sizeof(*tp));
3832 if (!timespecvalid_interval(&tp->_timeout))
3838 umtx_copyin_robust_lists(const void *uaddr, size_t size,
3839 struct umtx_robust_lists_params *rb)
3842 if (size > sizeof(*rb))
3844 return (copyin(uaddr, rb, size));
3848 umtx_copyout_timeout(void *uaddr, size_t sz, struct timespec *tsp)
3852 * Should be guaranteed by the caller, sz == uaddr1 - sizeof(_umtx_time)
3853 * and we're only called if sz >= sizeof(timespec) as supplied in the
3856 KASSERT(sz >= sizeof(*tsp),
3857 ("umtx_copyops specifies incorrect sizes"));
3859 return (copyout(tsp, uaddr, sizeof(*tsp)));
3862 #ifdef COMPAT_FREEBSD10
3864 __umtx_op_lock_umtx(struct thread *td, struct _umtx_op_args *uap,
3865 const struct umtx_copyops *ops)
3867 struct timespec *ts, timeout;
3870 /* Allow a null timespec (wait forever). */
3871 if (uap->uaddr2 == NULL)
3874 error = ops->copyin_timeout(uap->uaddr2, &timeout);
3879 #ifdef COMPAT_FREEBSD32
3881 return (do_lock_umtx32(td, uap->obj, uap->val, ts));
3883 return (do_lock_umtx(td, uap->obj, uap->val, ts));
3887 __umtx_op_unlock_umtx(struct thread *td, struct _umtx_op_args *uap,
3888 const struct umtx_copyops *ops)
3890 #ifdef COMPAT_FREEBSD32
3892 return (do_unlock_umtx32(td, uap->obj, uap->val));
3894 return (do_unlock_umtx(td, uap->obj, uap->val));
3896 #endif /* COMPAT_FREEBSD10 */
3898 #if !defined(COMPAT_FREEBSD10)
3900 __umtx_op_unimpl(struct thread *td __unused, struct _umtx_op_args *uap __unused,
3901 const struct umtx_copyops *ops __unused)
3903 return (EOPNOTSUPP);
3905 #endif /* COMPAT_FREEBSD10 */
3908 __umtx_op_wait(struct thread *td, struct _umtx_op_args *uap,
3909 const struct umtx_copyops *ops)
3911 struct _umtx_time timeout, *tm_p;
3914 if (uap->uaddr2 == NULL)
3917 error = ops->copyin_umtx_time(
3918 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
3923 return (do_wait(td, uap->obj, uap->val, tm_p, ops->compat32, 0));
3927 __umtx_op_wait_uint(struct thread *td, struct _umtx_op_args *uap,
3928 const struct umtx_copyops *ops)
3930 struct _umtx_time timeout, *tm_p;
3933 if (uap->uaddr2 == NULL)
3936 error = ops->copyin_umtx_time(
3937 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
3942 return (do_wait(td, uap->obj, uap->val, tm_p, 1, 0));
3946 __umtx_op_wait_uint_private(struct thread *td, struct _umtx_op_args *uap,
3947 const struct umtx_copyops *ops)
3949 struct _umtx_time *tm_p, timeout;
3952 if (uap->uaddr2 == NULL)
3955 error = ops->copyin_umtx_time(
3956 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
3961 return (do_wait(td, uap->obj, uap->val, tm_p, 1, 1));
3965 __umtx_op_wake(struct thread *td, struct _umtx_op_args *uap,
3966 const struct umtx_copyops *ops __unused)
3969 return (kern_umtx_wake(td, uap->obj, uap->val, 0));
3972 #define BATCH_SIZE 128
3974 __umtx_op_nwake_private_native(struct thread *td, struct _umtx_op_args *uap)
3976 char *uaddrs[BATCH_SIZE], **upp;
3977 int count, error, i, pos, tocopy;
3979 upp = (char **)uap->obj;
3981 for (count = uap->val, pos = 0; count > 0; count -= tocopy,
3983 tocopy = MIN(count, BATCH_SIZE);
3984 error = copyin(upp + pos, uaddrs, tocopy * sizeof(char *));
3987 for (i = 0; i < tocopy; ++i) {
3988 kern_umtx_wake(td, uaddrs[i], INT_MAX, 1);
3996 __umtx_op_nwake_private_compat32(struct thread *td, struct _umtx_op_args *uap)
3998 uint32_t uaddrs[BATCH_SIZE], *upp;
3999 int count, error, i, pos, tocopy;
4001 upp = (uint32_t *)uap->obj;
4003 for (count = uap->val, pos = 0; count > 0; count -= tocopy,
4005 tocopy = MIN(count, BATCH_SIZE);
4006 error = copyin(upp + pos, uaddrs, tocopy * sizeof(uint32_t));
4009 for (i = 0; i < tocopy; ++i) {
4010 kern_umtx_wake(td, (void *)(uintptr_t)uaddrs[i],
4019 __umtx_op_nwake_private(struct thread *td, struct _umtx_op_args *uap,
4020 const struct umtx_copyops *ops)
4024 return (__umtx_op_nwake_private_compat32(td, uap));
4025 return (__umtx_op_nwake_private_native(td, uap));
4029 __umtx_op_wake_private(struct thread *td, struct _umtx_op_args *uap,
4030 const struct umtx_copyops *ops __unused)
4033 return (kern_umtx_wake(td, uap->obj, uap->val, 1));
4037 __umtx_op_lock_umutex(struct thread *td, struct _umtx_op_args *uap,
4038 const struct umtx_copyops *ops)
4040 struct _umtx_time *tm_p, timeout;
4043 /* Allow a null timespec (wait forever). */
4044 if (uap->uaddr2 == NULL)
4047 error = ops->copyin_umtx_time(
4048 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
4053 return (do_lock_umutex(td, uap->obj, tm_p, 0));
4057 __umtx_op_trylock_umutex(struct thread *td, struct _umtx_op_args *uap,
4058 const struct umtx_copyops *ops __unused)
4061 return (do_lock_umutex(td, uap->obj, NULL, _UMUTEX_TRY));
4065 __umtx_op_wait_umutex(struct thread *td, struct _umtx_op_args *uap,
4066 const struct umtx_copyops *ops)
4068 struct _umtx_time *tm_p, timeout;
4071 /* Allow a null timespec (wait forever). */
4072 if (uap->uaddr2 == NULL)
4075 error = ops->copyin_umtx_time(
4076 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
4081 return (do_lock_umutex(td, uap->obj, tm_p, _UMUTEX_WAIT));
4085 __umtx_op_wake_umutex(struct thread *td, struct _umtx_op_args *uap,
4086 const struct umtx_copyops *ops __unused)
4089 return (do_wake_umutex(td, uap->obj));
4093 __umtx_op_unlock_umutex(struct thread *td, struct _umtx_op_args *uap,
4094 const struct umtx_copyops *ops __unused)
4097 return (do_unlock_umutex(td, uap->obj, false));
4101 __umtx_op_set_ceiling(struct thread *td, struct _umtx_op_args *uap,
4102 const struct umtx_copyops *ops __unused)
4105 return (do_set_ceiling(td, uap->obj, uap->val, uap->uaddr1));
4109 __umtx_op_cv_wait(struct thread *td, struct _umtx_op_args *uap,
4110 const struct umtx_copyops *ops)
4112 struct timespec *ts, timeout;
4115 /* Allow a null timespec (wait forever). */
4116 if (uap->uaddr2 == NULL)
4119 error = ops->copyin_timeout(uap->uaddr2, &timeout);
4124 return (do_cv_wait(td, uap->obj, uap->uaddr1, ts, uap->val));
4128 __umtx_op_cv_signal(struct thread *td, struct _umtx_op_args *uap,
4129 const struct umtx_copyops *ops __unused)
4132 return (do_cv_signal(td, uap->obj));
4136 __umtx_op_cv_broadcast(struct thread *td, struct _umtx_op_args *uap,
4137 const struct umtx_copyops *ops __unused)
4140 return (do_cv_broadcast(td, uap->obj));
4144 __umtx_op_rw_rdlock(struct thread *td, struct _umtx_op_args *uap,
4145 const struct umtx_copyops *ops)
4147 struct _umtx_time timeout;
4150 /* Allow a null timespec (wait forever). */
4151 if (uap->uaddr2 == NULL) {
4152 error = do_rw_rdlock(td, uap->obj, uap->val, 0);
4154 error = ops->copyin_umtx_time(uap->uaddr2,
4155 (size_t)uap->uaddr1, &timeout);
4158 error = do_rw_rdlock(td, uap->obj, uap->val, &timeout);
4164 __umtx_op_rw_wrlock(struct thread *td, struct _umtx_op_args *uap,
4165 const struct umtx_copyops *ops)
4167 struct _umtx_time timeout;
4170 /* Allow a null timespec (wait forever). */
4171 if (uap->uaddr2 == NULL) {
4172 error = do_rw_wrlock(td, uap->obj, 0);
4174 error = ops->copyin_umtx_time(uap->uaddr2,
4175 (size_t)uap->uaddr1, &timeout);
4179 error = do_rw_wrlock(td, uap->obj, &timeout);
4185 __umtx_op_rw_unlock(struct thread *td, struct _umtx_op_args *uap,
4186 const struct umtx_copyops *ops __unused)
4189 return (do_rw_unlock(td, uap->obj));
4192 #if defined(COMPAT_FREEBSD9) || defined(COMPAT_FREEBSD10)
4194 __umtx_op_sem_wait(struct thread *td, struct _umtx_op_args *uap,
4195 const struct umtx_copyops *ops)
4197 struct _umtx_time *tm_p, timeout;
4200 /* Allow a null timespec (wait forever). */
4201 if (uap->uaddr2 == NULL)
4204 error = ops->copyin_umtx_time(
4205 uap->uaddr2, (size_t)uap->uaddr1, &timeout);
4210 return (do_sem_wait(td, uap->obj, tm_p));
4214 __umtx_op_sem_wake(struct thread *td, struct _umtx_op_args *uap,
4215 const struct umtx_copyops *ops __unused)
4218 return (do_sem_wake(td, uap->obj));
4223 __umtx_op_wake2_umutex(struct thread *td, struct _umtx_op_args *uap,
4224 const struct umtx_copyops *ops __unused)
4227 return (do_wake2_umutex(td, uap->obj, uap->val));
4231 __umtx_op_sem2_wait(struct thread *td, struct _umtx_op_args *uap,
4232 const struct umtx_copyops *ops)
4234 struct _umtx_time *tm_p, timeout;
4238 /* Allow a null timespec (wait forever). */
4239 if (uap->uaddr2 == NULL) {
4243 uasize = (size_t)uap->uaddr1;
4244 error = ops->copyin_umtx_time(uap->uaddr2, uasize, &timeout);
4249 error = do_sem2_wait(td, uap->obj, tm_p);
4250 if (error == EINTR && uap->uaddr2 != NULL &&
4251 (timeout._flags & UMTX_ABSTIME) == 0 &&
4252 uasize >= ops->umtx_time_sz + ops->timespec_sz) {
4253 error = ops->copyout_timeout(
4254 (void *)((uintptr_t)uap->uaddr2 + ops->umtx_time_sz),
4255 uasize - ops->umtx_time_sz, &timeout._timeout);
4265 __umtx_op_sem2_wake(struct thread *td, struct _umtx_op_args *uap,
4266 const struct umtx_copyops *ops __unused)
4269 return (do_sem2_wake(td, uap->obj));
4272 #define USHM_OBJ_UMTX(o) \
4273 ((struct umtx_shm_obj_list *)(&(o)->umtx_data))
4275 #define USHMF_REG_LINKED 0x0001
4276 #define USHMF_OBJ_LINKED 0x0002
4277 struct umtx_shm_reg {
4278 TAILQ_ENTRY(umtx_shm_reg) ushm_reg_link;
4279 LIST_ENTRY(umtx_shm_reg) ushm_obj_link;
4280 struct umtx_key ushm_key;
4281 struct ucred *ushm_cred;
4282 struct shmfd *ushm_obj;
4287 LIST_HEAD(umtx_shm_obj_list, umtx_shm_reg);
4288 TAILQ_HEAD(umtx_shm_reg_head, umtx_shm_reg);
4290 static uma_zone_t umtx_shm_reg_zone;
4291 static struct umtx_shm_reg_head umtx_shm_registry[UMTX_CHAINS];
4292 static struct mtx umtx_shm_lock;
4293 static struct umtx_shm_reg_head umtx_shm_reg_delfree =
4294 TAILQ_HEAD_INITIALIZER(umtx_shm_reg_delfree);
4296 static void umtx_shm_free_reg(struct umtx_shm_reg *reg);
4299 umtx_shm_reg_delfree_tq(void *context __unused, int pending __unused)
4301 struct umtx_shm_reg_head d;
4302 struct umtx_shm_reg *reg, *reg1;
4305 mtx_lock(&umtx_shm_lock);
4306 TAILQ_CONCAT(&d, &umtx_shm_reg_delfree, ushm_reg_link);
4307 mtx_unlock(&umtx_shm_lock);
4308 TAILQ_FOREACH_SAFE(reg, &d, ushm_reg_link, reg1) {
4309 TAILQ_REMOVE(&d, reg, ushm_reg_link);
4310 umtx_shm_free_reg(reg);
4314 static struct task umtx_shm_reg_delfree_task =
4315 TASK_INITIALIZER(0, umtx_shm_reg_delfree_tq, NULL);
4317 static struct umtx_shm_reg *
4318 umtx_shm_find_reg_locked(const struct umtx_key *key)
4320 struct umtx_shm_reg *reg;
4321 struct umtx_shm_reg_head *reg_head;
4323 KASSERT(key->shared, ("umtx_p_find_rg: private key"));
4324 mtx_assert(&umtx_shm_lock, MA_OWNED);
4325 reg_head = &umtx_shm_registry[key->hash];
4326 TAILQ_FOREACH(reg, reg_head, ushm_reg_link) {
4327 KASSERT(reg->ushm_key.shared,
4328 ("non-shared key on reg %p %d", reg, reg->ushm_key.shared));
4329 if (reg->ushm_key.info.shared.object ==
4330 key->info.shared.object &&
4331 reg->ushm_key.info.shared.offset ==
4332 key->info.shared.offset) {
4333 KASSERT(reg->ushm_key.type == TYPE_SHM, ("TYPE_USHM"));
4334 KASSERT(reg->ushm_refcnt > 0,
4335 ("reg %p refcnt 0 onlist", reg));
4336 KASSERT((reg->ushm_flags & USHMF_REG_LINKED) != 0,
4337 ("reg %p not linked", reg));
4345 static struct umtx_shm_reg *
4346 umtx_shm_find_reg(const struct umtx_key *key)
4348 struct umtx_shm_reg *reg;
4350 mtx_lock(&umtx_shm_lock);
4351 reg = umtx_shm_find_reg_locked(key);
4352 mtx_unlock(&umtx_shm_lock);
4357 umtx_shm_free_reg(struct umtx_shm_reg *reg)
4360 chgumtxcnt(reg->ushm_cred->cr_ruidinfo, -1, 0);
4361 crfree(reg->ushm_cred);
4362 shm_drop(reg->ushm_obj);
4363 uma_zfree(umtx_shm_reg_zone, reg);
4367 umtx_shm_unref_reg_locked(struct umtx_shm_reg *reg, bool force)
4371 mtx_assert(&umtx_shm_lock, MA_OWNED);
4372 KASSERT(reg->ushm_refcnt > 0, ("ushm_reg %p refcnt 0", reg));
4374 res = reg->ushm_refcnt == 0;
4376 if ((reg->ushm_flags & USHMF_REG_LINKED) != 0) {
4377 TAILQ_REMOVE(&umtx_shm_registry[reg->ushm_key.hash],
4378 reg, ushm_reg_link);
4379 reg->ushm_flags &= ~USHMF_REG_LINKED;
4381 if ((reg->ushm_flags & USHMF_OBJ_LINKED) != 0) {
4382 LIST_REMOVE(reg, ushm_obj_link);
4383 reg->ushm_flags &= ~USHMF_OBJ_LINKED;
4390 umtx_shm_unref_reg(struct umtx_shm_reg *reg, bool force)
4396 object = reg->ushm_obj->shm_object;
4397 VM_OBJECT_WLOCK(object);
4398 vm_object_set_flag(object, OBJ_UMTXDEAD);
4399 VM_OBJECT_WUNLOCK(object);
4401 mtx_lock(&umtx_shm_lock);
4402 dofree = umtx_shm_unref_reg_locked(reg, force);
4403 mtx_unlock(&umtx_shm_lock);
4405 umtx_shm_free_reg(reg);
4409 umtx_shm_object_init(vm_object_t object)
4412 LIST_INIT(USHM_OBJ_UMTX(object));
4416 umtx_shm_object_terminated(vm_object_t object)
4418 struct umtx_shm_reg *reg, *reg1;
4421 if (LIST_EMPTY(USHM_OBJ_UMTX(object)))
4425 mtx_lock(&umtx_shm_lock);
4426 LIST_FOREACH_SAFE(reg, USHM_OBJ_UMTX(object), ushm_obj_link, reg1) {
4427 if (umtx_shm_unref_reg_locked(reg, true)) {
4428 TAILQ_INSERT_TAIL(&umtx_shm_reg_delfree, reg,
4433 mtx_unlock(&umtx_shm_lock);
4435 taskqueue_enqueue(taskqueue_thread, &umtx_shm_reg_delfree_task);
4439 umtx_shm_create_reg(struct thread *td, const struct umtx_key *key,
4440 struct umtx_shm_reg **res)
4442 struct umtx_shm_reg *reg, *reg1;
4446 reg = umtx_shm_find_reg(key);
4451 cred = td->td_ucred;
4452 if (!chgumtxcnt(cred->cr_ruidinfo, 1, lim_cur(td, RLIMIT_UMTXP)))
4454 reg = uma_zalloc(umtx_shm_reg_zone, M_WAITOK | M_ZERO);
4455 reg->ushm_refcnt = 1;
4456 bcopy(key, ®->ushm_key, sizeof(*key));
4457 reg->ushm_obj = shm_alloc(td->td_ucred, O_RDWR, false);
4458 reg->ushm_cred = crhold(cred);
4459 error = shm_dotruncate(reg->ushm_obj, PAGE_SIZE);
4461 umtx_shm_free_reg(reg);
4464 mtx_lock(&umtx_shm_lock);
4465 reg1 = umtx_shm_find_reg_locked(key);
4467 mtx_unlock(&umtx_shm_lock);
4468 umtx_shm_free_reg(reg);
4473 TAILQ_INSERT_TAIL(&umtx_shm_registry[key->hash], reg, ushm_reg_link);
4474 LIST_INSERT_HEAD(USHM_OBJ_UMTX(key->info.shared.object), reg,
4476 reg->ushm_flags = USHMF_REG_LINKED | USHMF_OBJ_LINKED;
4477 mtx_unlock(&umtx_shm_lock);
4483 umtx_shm_alive(struct thread *td, void *addr)
4486 vm_map_entry_t entry;
4493 map = &td->td_proc->p_vmspace->vm_map;
4494 res = vm_map_lookup(&map, (uintptr_t)addr, VM_PROT_READ, &entry,
4495 &object, &pindex, &prot, &wired);
4496 if (res != KERN_SUCCESS)
4501 ret = (object->flags & OBJ_UMTXDEAD) != 0 ? ENOTTY : 0;
4502 vm_map_lookup_done(map, entry);
4511 umtx_shm_reg_zone = uma_zcreate("umtx_shm", sizeof(struct umtx_shm_reg),
4512 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
4513 mtx_init(&umtx_shm_lock, "umtxshm", NULL, MTX_DEF);
4514 for (i = 0; i < nitems(umtx_shm_registry); i++)
4515 TAILQ_INIT(&umtx_shm_registry[i]);
4519 umtx_shm(struct thread *td, void *addr, u_int flags)
4521 struct umtx_key key;
4522 struct umtx_shm_reg *reg;
4526 if (__bitcount(flags & (UMTX_SHM_CREAT | UMTX_SHM_LOOKUP |
4527 UMTX_SHM_DESTROY| UMTX_SHM_ALIVE)) != 1)
4529 if ((flags & UMTX_SHM_ALIVE) != 0)
4530 return (umtx_shm_alive(td, addr));
4531 error = umtx_key_get(addr, TYPE_SHM, PROCESS_SHARE, &key);
4534 KASSERT(key.shared == 1, ("non-shared key"));
4535 if ((flags & UMTX_SHM_CREAT) != 0) {
4536 error = umtx_shm_create_reg(td, &key, ®);
4538 reg = umtx_shm_find_reg(&key);
4542 umtx_key_release(&key);
4545 KASSERT(reg != NULL, ("no reg"));
4546 if ((flags & UMTX_SHM_DESTROY) != 0) {
4547 umtx_shm_unref_reg(reg, true);
4551 error = mac_posixshm_check_open(td->td_ucred,
4552 reg->ushm_obj, FFLAGS(O_RDWR));
4555 error = shm_access(reg->ushm_obj, td->td_ucred,
4559 error = falloc_caps(td, &fp, &fd, O_CLOEXEC, NULL);
4561 shm_hold(reg->ushm_obj);
4562 finit(fp, FFLAGS(O_RDWR), DTYPE_SHM, reg->ushm_obj,
4564 td->td_retval[0] = fd;
4568 umtx_shm_unref_reg(reg, false);
4573 __umtx_op_shm(struct thread *td, struct _umtx_op_args *uap,
4574 const struct umtx_copyops *ops __unused)
4577 return (umtx_shm(td, uap->uaddr1, uap->val));
4581 __umtx_op_robust_lists(struct thread *td, struct _umtx_op_args *uap,
4582 const struct umtx_copyops *ops)
4584 struct umtx_robust_lists_params rb;
4587 if (ops->compat32) {
4588 if ((td->td_pflags2 & TDP2_COMPAT32RB) == 0 &&
4589 (td->td_rb_list != 0 || td->td_rbp_list != 0 ||
4590 td->td_rb_inact != 0))
4592 } else if ((td->td_pflags2 & TDP2_COMPAT32RB) != 0) {
4596 bzero(&rb, sizeof(rb));
4597 error = ops->copyin_robust_lists(uap->uaddr1, uap->val, &rb);
4602 td->td_pflags2 |= TDP2_COMPAT32RB;
4604 td->td_rb_list = rb.robust_list_offset;
4605 td->td_rbp_list = rb.robust_priv_list_offset;
4606 td->td_rb_inact = rb.robust_inact_offset;
4611 __umtx_op_get_min_timeout(struct thread *td, struct _umtx_op_args *uap,
4612 const struct umtx_copyops *ops)
4617 val = sbttons(td->td_proc->p_umtx_min_timeout);
4618 if (ops->compat32) {
4620 error = copyout(&val1, uap->uaddr1, sizeof(val1));
4622 error = copyout(&val, uap->uaddr1, sizeof(val));
4628 __umtx_op_set_min_timeout(struct thread *td, struct _umtx_op_args *uap,
4629 const struct umtx_copyops *ops)
4633 td->td_proc->p_umtx_min_timeout = nstosbt(uap->val);
4637 #if defined(__i386__) || defined(__amd64__)
4639 * Provide the standard 32-bit definitions for x86, since native/compat32 use a
4640 * 32-bit time_t there. Other architectures just need the i386 definitions
4641 * along with their standard compat32.
4643 struct timespecx32 {
4648 struct umtx_timex32 {
4649 struct timespecx32 _timeout;
4655 #define timespeci386 timespec32
4656 #define umtx_timei386 umtx_time32
4658 #else /* !__i386__ && !__amd64__ */
4659 /* 32-bit architectures can emulate i386, so define these almost everywhere. */
4660 struct timespeci386 {
4665 struct umtx_timei386 {
4666 struct timespeci386 _timeout;
4671 #if defined(__LP64__)
4672 #define timespecx32 timespec32
4673 #define umtx_timex32 umtx_time32
4678 umtx_copyin_robust_lists32(const void *uaddr, size_t size,
4679 struct umtx_robust_lists_params *rbp)
4681 struct umtx_robust_lists_params_compat32 rb32;
4684 if (size > sizeof(rb32))
4686 bzero(&rb32, sizeof(rb32));
4687 error = copyin(uaddr, &rb32, size);
4690 CP(rb32, *rbp, robust_list_offset);
4691 CP(rb32, *rbp, robust_priv_list_offset);
4692 CP(rb32, *rbp, robust_inact_offset);
4698 umtx_copyin_timeouti386(const void *uaddr, struct timespec *tsp)
4700 struct timespeci386 ts32;
4703 error = copyin(uaddr, &ts32, sizeof(ts32));
4705 if (!timespecvalid_interval(&ts32))
4708 CP(ts32, *tsp, tv_sec);
4709 CP(ts32, *tsp, tv_nsec);
4716 umtx_copyin_umtx_timei386(const void *uaddr, size_t size, struct _umtx_time *tp)
4718 struct umtx_timei386 t32;
4721 t32._clockid = CLOCK_REALTIME;
4723 if (size <= sizeof(t32._timeout))
4724 error = copyin(uaddr, &t32._timeout, sizeof(t32._timeout));
4726 error = copyin(uaddr, &t32, sizeof(t32));
4729 if (!timespecvalid_interval(&t32._timeout))
4731 TS_CP(t32, *tp, _timeout);
4732 CP(t32, *tp, _flags);
4733 CP(t32, *tp, _clockid);
4738 umtx_copyout_timeouti386(void *uaddr, size_t sz, struct timespec *tsp)
4740 struct timespeci386 remain32 = {
4741 .tv_sec = tsp->tv_sec,
4742 .tv_nsec = tsp->tv_nsec,
4746 * Should be guaranteed by the caller, sz == uaddr1 - sizeof(_umtx_time)
4747 * and we're only called if sz >= sizeof(timespec) as supplied in the
4750 KASSERT(sz >= sizeof(remain32),
4751 ("umtx_copyops specifies incorrect sizes"));
4753 return (copyout(&remain32, uaddr, sizeof(remain32)));
4755 #endif /* !__i386__ */
4757 #if defined(__i386__) || defined(__LP64__)
4759 umtx_copyin_timeoutx32(const void *uaddr, struct timespec *tsp)
4761 struct timespecx32 ts32;
4764 error = copyin(uaddr, &ts32, sizeof(ts32));
4766 if (!timespecvalid_interval(&ts32))
4769 CP(ts32, *tsp, tv_sec);
4770 CP(ts32, *tsp, tv_nsec);
4777 umtx_copyin_umtx_timex32(const void *uaddr, size_t size, struct _umtx_time *tp)
4779 struct umtx_timex32 t32;
4782 t32._clockid = CLOCK_REALTIME;
4784 if (size <= sizeof(t32._timeout))
4785 error = copyin(uaddr, &t32._timeout, sizeof(t32._timeout));
4787 error = copyin(uaddr, &t32, sizeof(t32));
4790 if (!timespecvalid_interval(&t32._timeout))
4792 TS_CP(t32, *tp, _timeout);
4793 CP(t32, *tp, _flags);
4794 CP(t32, *tp, _clockid);
4799 umtx_copyout_timeoutx32(void *uaddr, size_t sz, struct timespec *tsp)
4801 struct timespecx32 remain32 = {
4802 .tv_sec = tsp->tv_sec,
4803 .tv_nsec = tsp->tv_nsec,
4807 * Should be guaranteed by the caller, sz == uaddr1 - sizeof(_umtx_time)
4808 * and we're only called if sz >= sizeof(timespec) as supplied in the
4811 KASSERT(sz >= sizeof(remain32),
4812 ("umtx_copyops specifies incorrect sizes"));
4814 return (copyout(&remain32, uaddr, sizeof(remain32)));
4816 #endif /* __i386__ || __LP64__ */
4818 typedef int (*_umtx_op_func)(struct thread *td, struct _umtx_op_args *uap,
4819 const struct umtx_copyops *umtx_ops);
4821 static const _umtx_op_func op_table[] = {
4822 #ifdef COMPAT_FREEBSD10
4823 [UMTX_OP_LOCK] = __umtx_op_lock_umtx,
4824 [UMTX_OP_UNLOCK] = __umtx_op_unlock_umtx,
4826 [UMTX_OP_LOCK] = __umtx_op_unimpl,
4827 [UMTX_OP_UNLOCK] = __umtx_op_unimpl,
4829 [UMTX_OP_WAIT] = __umtx_op_wait,
4830 [UMTX_OP_WAKE] = __umtx_op_wake,
4831 [UMTX_OP_MUTEX_TRYLOCK] = __umtx_op_trylock_umutex,
4832 [UMTX_OP_MUTEX_LOCK] = __umtx_op_lock_umutex,
4833 [UMTX_OP_MUTEX_UNLOCK] = __umtx_op_unlock_umutex,
4834 [UMTX_OP_SET_CEILING] = __umtx_op_set_ceiling,
4835 [UMTX_OP_CV_WAIT] = __umtx_op_cv_wait,
4836 [UMTX_OP_CV_SIGNAL] = __umtx_op_cv_signal,
4837 [UMTX_OP_CV_BROADCAST] = __umtx_op_cv_broadcast,
4838 [UMTX_OP_WAIT_UINT] = __umtx_op_wait_uint,
4839 [UMTX_OP_RW_RDLOCK] = __umtx_op_rw_rdlock,
4840 [UMTX_OP_RW_WRLOCK] = __umtx_op_rw_wrlock,
4841 [UMTX_OP_RW_UNLOCK] = __umtx_op_rw_unlock,
4842 [UMTX_OP_WAIT_UINT_PRIVATE] = __umtx_op_wait_uint_private,
4843 [UMTX_OP_WAKE_PRIVATE] = __umtx_op_wake_private,
4844 [UMTX_OP_MUTEX_WAIT] = __umtx_op_wait_umutex,
4845 [UMTX_OP_MUTEX_WAKE] = __umtx_op_wake_umutex,
4846 #if defined(COMPAT_FREEBSD9) || defined(COMPAT_FREEBSD10)
4847 [UMTX_OP_SEM_WAIT] = __umtx_op_sem_wait,
4848 [UMTX_OP_SEM_WAKE] = __umtx_op_sem_wake,
4850 [UMTX_OP_SEM_WAIT] = __umtx_op_unimpl,
4851 [UMTX_OP_SEM_WAKE] = __umtx_op_unimpl,
4853 [UMTX_OP_NWAKE_PRIVATE] = __umtx_op_nwake_private,
4854 [UMTX_OP_MUTEX_WAKE2] = __umtx_op_wake2_umutex,
4855 [UMTX_OP_SEM2_WAIT] = __umtx_op_sem2_wait,
4856 [UMTX_OP_SEM2_WAKE] = __umtx_op_sem2_wake,
4857 [UMTX_OP_SHM] = __umtx_op_shm,
4858 [UMTX_OP_ROBUST_LISTS] = __umtx_op_robust_lists,
4859 [UMTX_OP_GET_MIN_TIMEOUT] = __umtx_op_get_min_timeout,
4860 [UMTX_OP_SET_MIN_TIMEOUT] = __umtx_op_set_min_timeout,
4863 static const struct umtx_copyops umtx_native_ops = {
4864 .copyin_timeout = umtx_copyin_timeout,
4865 .copyin_umtx_time = umtx_copyin_umtx_time,
4866 .copyin_robust_lists = umtx_copyin_robust_lists,
4867 .copyout_timeout = umtx_copyout_timeout,
4868 .timespec_sz = sizeof(struct timespec),
4869 .umtx_time_sz = sizeof(struct _umtx_time),
4873 static const struct umtx_copyops umtx_native_opsi386 = {
4874 .copyin_timeout = umtx_copyin_timeouti386,
4875 .copyin_umtx_time = umtx_copyin_umtx_timei386,
4876 .copyin_robust_lists = umtx_copyin_robust_lists32,
4877 .copyout_timeout = umtx_copyout_timeouti386,
4878 .timespec_sz = sizeof(struct timespeci386),
4879 .umtx_time_sz = sizeof(struct umtx_timei386),
4884 #if defined(__i386__) || defined(__LP64__)
4885 /* i386 can emulate other 32-bit archs, too! */
4886 static const struct umtx_copyops umtx_native_opsx32 = {
4887 .copyin_timeout = umtx_copyin_timeoutx32,
4888 .copyin_umtx_time = umtx_copyin_umtx_timex32,
4889 .copyin_robust_lists = umtx_copyin_robust_lists32,
4890 .copyout_timeout = umtx_copyout_timeoutx32,
4891 .timespec_sz = sizeof(struct timespecx32),
4892 .umtx_time_sz = sizeof(struct umtx_timex32),
4896 #ifdef COMPAT_FREEBSD32
4898 #define umtx_native_ops32 umtx_native_opsi386
4900 #define umtx_native_ops32 umtx_native_opsx32
4902 #endif /* COMPAT_FREEBSD32 */
4903 #endif /* __i386__ || __LP64__ */
4905 #define UMTX_OP__FLAGS (UMTX_OP__32BIT | UMTX_OP__I386)
4908 kern__umtx_op(struct thread *td, void *obj, int op, unsigned long val,
4909 void *uaddr1, void *uaddr2, const struct umtx_copyops *ops)
4911 struct _umtx_op_args uap = {
4913 .op = op & ~UMTX_OP__FLAGS,
4919 if ((uap.op >= nitems(op_table)))
4921 return ((*op_table[uap.op])(td, &uap, ops));
4925 sys__umtx_op(struct thread *td, struct _umtx_op_args *uap)
4927 static const struct umtx_copyops *umtx_ops;
4929 umtx_ops = &umtx_native_ops;
4931 if ((uap->op & (UMTX_OP__32BIT | UMTX_OP__I386)) != 0) {
4932 if ((uap->op & UMTX_OP__I386) != 0)
4933 umtx_ops = &umtx_native_opsi386;
4935 umtx_ops = &umtx_native_opsx32;
4937 #elif !defined(__i386__)
4938 /* We consider UMTX_OP__32BIT a nop on !i386 ILP32. */
4939 if ((uap->op & UMTX_OP__I386) != 0)
4940 umtx_ops = &umtx_native_opsi386;
4942 /* Likewise, UMTX_OP__I386 is a nop on i386. */
4943 if ((uap->op & UMTX_OP__32BIT) != 0)
4944 umtx_ops = &umtx_native_opsx32;
4946 return (kern__umtx_op(td, uap->obj, uap->op, uap->val, uap->uaddr1,
4947 uap->uaddr2, umtx_ops));
4950 #ifdef COMPAT_FREEBSD32
4951 #ifdef COMPAT_FREEBSD10
4953 freebsd10_freebsd32_umtx_lock(struct thread *td,
4954 struct freebsd10_freebsd32_umtx_lock_args *uap)
4956 return (do_lock_umtx32(td, (uint32_t *)uap->umtx, td->td_tid, NULL));
4960 freebsd10_freebsd32_umtx_unlock(struct thread *td,
4961 struct freebsd10_freebsd32_umtx_unlock_args *uap)
4963 return (do_unlock_umtx32(td, (uint32_t *)uap->umtx, td->td_tid));
4965 #endif /* COMPAT_FREEBSD10 */
4968 freebsd32__umtx_op(struct thread *td, struct freebsd32__umtx_op_args *uap)
4971 return (kern__umtx_op(td, uap->obj, uap->op, uap->val, uap->uaddr,
4972 uap->uaddr2, &umtx_native_ops32));
4974 #endif /* COMPAT_FREEBSD32 */
4977 umtx_thread_init(struct thread *td)
4980 td->td_umtxq = umtxq_alloc();
4981 td->td_umtxq->uq_thread = td;
4985 umtx_thread_fini(struct thread *td)
4988 umtxq_free(td->td_umtxq);
4992 * It will be called when new thread is created, e.g fork().
4995 umtx_thread_alloc(struct thread *td)
5000 uq->uq_inherited_pri = PRI_MAX;
5002 KASSERT(uq->uq_flags == 0, ("uq_flags != 0"));
5003 KASSERT(uq->uq_thread == td, ("uq_thread != td"));
5004 KASSERT(uq->uq_pi_blocked == NULL, ("uq_pi_blocked != NULL"));
5005 KASSERT(TAILQ_EMPTY(&uq->uq_pi_contested), ("uq_pi_contested is not empty"));
5011 * Clear robust lists for all process' threads, not delaying the
5012 * cleanup to thread exit, since the relevant address space is
5013 * destroyed right now.
5016 umtx_exec(struct proc *p)
5020 KASSERT(p == curproc, ("need curproc"));
5021 KASSERT((p->p_flag & P_HADTHREADS) == 0 ||
5022 (p->p_flag & P_STOPPED_SINGLE) != 0,
5023 ("curproc must be single-threaded"));
5025 * There is no need to lock the list as only this thread can be
5028 FOREACH_THREAD_IN_PROC(p, td) {
5029 KASSERT(td == curthread ||
5030 ((td->td_flags & TDF_BOUNDARY) != 0 && TD_IS_SUSPENDED(td)),
5031 ("running thread %p %p", p, td));
5032 umtx_thread_cleanup(td);
5033 td->td_rb_list = td->td_rbp_list = td->td_rb_inact = 0;
5036 p->p_umtx_min_timeout = 0;
5043 umtx_thread_exit(struct thread *td)
5046 umtx_thread_cleanup(td);
5050 umtx_read_uptr(struct thread *td, uintptr_t ptr, uintptr_t *res, bool compat32)
5057 error = fueword32((void *)ptr, &res32);
5061 error = fueword((void *)ptr, &res1);
5071 umtx_read_rb_list(struct thread *td, struct umutex *m, uintptr_t *rb_list,
5074 struct umutex32 m32;
5077 memcpy(&m32, m, sizeof(m32));
5078 *rb_list = m32.m_rb_lnk;
5080 *rb_list = m->m_rb_lnk;
5085 umtx_handle_rb(struct thread *td, uintptr_t rbp, uintptr_t *rb_list, bool inact,
5091 KASSERT(td->td_proc == curproc, ("need current vmspace"));
5092 error = copyin((void *)rbp, &m, sizeof(m));
5095 if (rb_list != NULL)
5096 umtx_read_rb_list(td, &m, rb_list, compat32);
5097 if ((m.m_flags & UMUTEX_ROBUST) == 0)
5099 if ((m.m_owner & ~UMUTEX_CONTESTED) != td->td_tid)
5100 /* inact is cleared after unlock, allow the inconsistency */
5101 return (inact ? 0 : EINVAL);
5102 return (do_unlock_umutex(td, (struct umutex *)rbp, true));
5106 umtx_cleanup_rb_list(struct thread *td, uintptr_t rb_list, uintptr_t *rb_inact,
5107 const char *name, bool compat32)
5115 error = umtx_read_uptr(td, rb_list, &rbp, compat32);
5116 for (i = 0; error == 0 && rbp != 0 && i < umtx_max_rb; i++) {
5117 if (rbp == *rb_inact) {
5122 error = umtx_handle_rb(td, rbp, &rbp, inact, compat32);
5124 if (i == umtx_max_rb && umtx_verbose_rb) {
5125 uprintf("comm %s pid %d: reached umtx %smax rb %d\n",
5126 td->td_proc->p_comm, td->td_proc->p_pid, name, umtx_max_rb);
5128 if (error != 0 && umtx_verbose_rb) {
5129 uprintf("comm %s pid %d: handling %srb error %d\n",
5130 td->td_proc->p_comm, td->td_proc->p_pid, name, error);
5135 * Clean up umtx data.
5138 umtx_thread_cleanup(struct thread *td)
5146 * Disown pi mutexes.
5150 if (uq->uq_inherited_pri != PRI_MAX ||
5151 !TAILQ_EMPTY(&uq->uq_pi_contested)) {
5152 mtx_lock(&umtx_lock);
5153 uq->uq_inherited_pri = PRI_MAX;
5154 while ((pi = TAILQ_FIRST(&uq->uq_pi_contested)) != NULL) {
5155 pi->pi_owner = NULL;
5156 TAILQ_REMOVE(&uq->uq_pi_contested, pi, pi_link);
5158 mtx_unlock(&umtx_lock);
5160 sched_lend_user_prio_cond(td, PRI_MAX);
5163 compat32 = (td->td_pflags2 & TDP2_COMPAT32RB) != 0;
5164 td->td_pflags2 &= ~TDP2_COMPAT32RB;
5166 if (td->td_rb_inact == 0 && td->td_rb_list == 0 && td->td_rbp_list == 0)
5170 * Handle terminated robust mutexes. Must be done after
5171 * robust pi disown, otherwise unlock could see unowned
5174 rb_inact = td->td_rb_inact;
5176 (void)umtx_read_uptr(td, rb_inact, &rb_inact, compat32);
5177 umtx_cleanup_rb_list(td, td->td_rb_list, &rb_inact, "", compat32);
5178 umtx_cleanup_rb_list(td, td->td_rbp_list, &rb_inact, "priv ", compat32);
5180 (void)umtx_handle_rb(td, rb_inact, NULL, true, compat32);