003 File Manager
Current Path:
/usr/src/lib/libthr/thread
usr
/
src
/
lib
/
libthr
/
thread
/
📁
..
📄
Makefile.inc
(976 B)
📄
thr_affinity.c
(2.83 KB)
📄
thr_attr.c
(18.69 KB)
📄
thr_autoinit.c
(2.73 KB)
📄
thr_barrier.c
(4.73 KB)
📄
thr_barrierattr.c
(2.86 KB)
📄
thr_cancel.c
(4.75 KB)
📄
thr_clean.c
(3.45 KB)
📄
thr_concurrency.c
(2.33 KB)
📄
thr_cond.c
(14.19 KB)
📄
thr_condattr.c
(3.75 KB)
📄
thr_create.c
(8.23 KB)
📄
thr_ctrdtr.c
(1.86 KB)
📄
thr_detach.c
(2.3 KB)
📄
thr_equal.c
(1.92 KB)
📄
thr_event.c
(2.21 KB)
📄
thr_exit.c
(8.52 KB)
📄
thr_fork.c
(8.66 KB)
📄
thr_getcpuclockid.c
(1.85 KB)
📄
thr_getprio.c
(2.11 KB)
📄
thr_getschedparam.c
(2.63 KB)
📄
thr_getthreadid_np.c
(1.87 KB)
📄
thr_info.c
(4.19 KB)
📄
thr_init.c
(16.94 KB)
📄
thr_join.c
(4.76 KB)
📄
thr_kern.c
(5 KB)
📄
thr_kill.c
(2.55 KB)
📄
thr_list.c
(10 KB)
📄
thr_main_np.c
(1.88 KB)
📄
thr_malloc.c
(3.63 KB)
📄
thr_multi_np.c
(1.96 KB)
📄
thr_mutex.c
(30.24 KB)
📄
thr_mutexattr.c
(8.28 KB)
📄
thr_once.c
(3.32 KB)
📄
thr_printf.c
(3.52 KB)
📄
thr_private.h
(31.94 KB)
📄
thr_pshared.c
(6.3 KB)
📄
thr_pspinlock.c
(4.18 KB)
📄
thr_resume_np.c
(3.14 KB)
📄
thr_rtld.c
(6.07 KB)
📄
thr_rwlock.c
(10.17 KB)
📄
thr_rwlockattr.c
(2.84 KB)
📄
thr_self.c
(1.93 KB)
📄
thr_sem.c
(3.71 KB)
📄
thr_setprio.c
(2.42 KB)
📄
thr_setschedparam.c
(2.89 KB)
📄
thr_sig.c
(19.89 KB)
📄
thr_single_np.c
(1.97 KB)
📄
thr_sleepq.c
(4.46 KB)
📄
thr_spec.c
(7.03 KB)
📄
thr_spinlock.c
(3.7 KB)
📄
thr_stack.c
(10.63 KB)
📄
thr_suspend_np.c
(5.4 KB)
📄
thr_switch_np.c
(2.28 KB)
📄
thr_symbols.c
(2.75 KB)
📄
thr_syscalls.c
(16.69 KB)
📄
thr_umtx.c
(8.8 KB)
📄
thr_umtx.h
(8.02 KB)
📄
thr_yield.c
(1.83 KB)
Editing: thr_sleepq.c
/*- * SPDX-License-Identifier: BSD-2-Clause-FreeBSD * * Copyright (c) 2010 David Xu <davidxu@freebsd.org> * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice unmodified, this list of conditions, and the following * disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include <sys/cdefs.h> __FBSDID("$FreeBSD$"); #include <stdlib.h> #include "thr_private.h" #define HASHSHIFT 9 #define HASHSIZE (1 << HASHSHIFT) #define SC_HASH(wchan) ((unsigned) \ ((((uintptr_t)(wchan) >> 3) \ ^ ((uintptr_t)(wchan) >> (HASHSHIFT + 3))) \ & (HASHSIZE - 1))) #define SC_LOOKUP(wc) &sc_table[SC_HASH(wc)] struct sleepqueue_chain { struct umutex sc_lock; int sc_enqcnt; LIST_HEAD(, sleepqueue) sc_queues; int sc_type; }; static struct sleepqueue_chain sc_table[HASHSIZE]; void _sleepq_init(void) { int i; for (i = 0; i < HASHSIZE; ++i) { LIST_INIT(&sc_table[i].sc_queues); _thr_umutex_init(&sc_table[i].sc_lock); } } struct sleepqueue * _sleepq_alloc(void) { struct sleepqueue *sq; sq = calloc(1, sizeof(struct sleepqueue)); TAILQ_INIT(&sq->sq_blocked); SLIST_INIT(&sq->sq_freeq); return (sq); } void _sleepq_free(struct sleepqueue *sq) { free(sq); } void _sleepq_lock(void *wchan) { struct pthread *curthread = _get_curthread(); struct sleepqueue_chain *sc; sc = SC_LOOKUP(wchan); THR_LOCK_ACQUIRE_SPIN(curthread, &sc->sc_lock); } void _sleepq_unlock(void *wchan) { struct sleepqueue_chain *sc; struct pthread *curthread = _get_curthread(); sc = SC_LOOKUP(wchan); THR_LOCK_RELEASE(curthread, &sc->sc_lock); } static inline struct sleepqueue * lookup(struct sleepqueue_chain *sc, void *wchan) { struct sleepqueue *sq; LIST_FOREACH(sq, &sc->sc_queues, sq_hash) if (sq->sq_wchan == wchan) return (sq); return (NULL); } struct sleepqueue * _sleepq_lookup(void *wchan) { return (lookup(SC_LOOKUP(wchan), wchan)); } void _sleepq_add(void *wchan, struct pthread *td) { struct sleepqueue_chain *sc; struct sleepqueue *sq; sc = SC_LOOKUP(wchan); sq = lookup(sc, wchan); if (sq != NULL) { SLIST_INSERT_HEAD(&sq->sq_freeq, td->sleepqueue, sq_flink); } else { sq = td->sleepqueue; LIST_INSERT_HEAD(&sc->sc_queues, sq, sq_hash); sq->sq_wchan = wchan; /* sq->sq_type = type; */ } td->sleepqueue = NULL; td->wchan = wchan; if (((++sc->sc_enqcnt << _thr_queuefifo) & 0xff) != 0) TAILQ_INSERT_HEAD(&sq->sq_blocked, td, wle); else TAILQ_INSERT_TAIL(&sq->sq_blocked, td, wle); } int _sleepq_remove(struct sleepqueue *sq, struct pthread *td) { int rc; TAILQ_REMOVE(&sq->sq_blocked, td, wle); if (TAILQ_EMPTY(&sq->sq_blocked)) { LIST_REMOVE(sq, sq_hash); td->sleepqueue = sq; rc = 0; } else { td->sleepqueue = SLIST_FIRST(&sq->sq_freeq); SLIST_REMOVE_HEAD(&sq->sq_freeq, sq_flink); rc = 1; } td->wchan = NULL; return (rc); } void _sleepq_drop(struct sleepqueue *sq, void (*cb)(struct pthread *, void *arg), void *arg) { struct pthread *td; struct sleepqueue *sq2; td = TAILQ_FIRST(&sq->sq_blocked); if (td == NULL) return; LIST_REMOVE(sq, sq_hash); TAILQ_REMOVE(&sq->sq_blocked, td, wle); if (cb != NULL) cb(td, arg); td->sleepqueue = sq; td->wchan = NULL; sq2 = SLIST_FIRST(&sq->sq_freeq); TAILQ_FOREACH(td, &sq->sq_blocked, wle) { if (cb != NULL) cb(td, arg); td->sleepqueue = sq2; td->wchan = NULL; sq2 = SLIST_NEXT(sq2, sq_flink); } TAILQ_INIT(&sq->sq_blocked); SLIST_INIT(&sq->sq_freeq); }
Upload File
Create Folder