2 * Copyright (c) 2010 David Xu <davidxu@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
31 #include "thr_private.h"
34 #define HASHSIZE (1 << HASHSHIFT)
35 #define SC_HASH(wchan) ((unsigned) \
36 ((((uintptr_t)(wchan) >> 3) \
37 ^ ((uintptr_t)(wchan) >> (HASHSHIFT + 3))) \
39 #define SC_LOOKUP(wc) &sc_table[SC_HASH(wc)]
41 struct sleepqueue_chain {
42 struct umutex sc_lock;
44 LIST_HEAD(, sleepqueue) sc_queues;
48 static struct sleepqueue_chain sc_table[HASHSIZE];
55 for (i = 0; i < HASHSIZE; ++i) {
56 LIST_INIT(&sc_table[i].sc_queues);
57 _thr_umutex_init(&sc_table[i].sc_lock);
64 struct sleepqueue *sq;
66 sq = calloc(1, sizeof(struct sleepqueue));
67 TAILQ_INIT(&sq->sq_blocked);
68 SLIST_INIT(&sq->sq_freeq);
73 _sleepq_free(struct sleepqueue *sq)
79 _sleepq_lock(void *wchan)
81 struct pthread *curthread = _get_curthread();
82 struct sleepqueue_chain *sc;
84 sc = SC_LOOKUP(wchan);
85 THR_LOCK_ACQUIRE_SPIN(curthread, &sc->sc_lock);
89 _sleepq_unlock(void *wchan)
91 struct sleepqueue_chain *sc;
92 struct pthread *curthread = _get_curthread();
94 sc = SC_LOOKUP(wchan);
95 THR_LOCK_RELEASE(curthread, &sc->sc_lock);
98 static inline struct sleepqueue *
99 lookup(struct sleepqueue_chain *sc, void *wchan)
101 struct sleepqueue *sq;
103 LIST_FOREACH(sq, &sc->sc_queues, sq_hash)
104 if (sq->sq_wchan == wchan)
110 _sleepq_lookup(void *wchan)
112 return (lookup(SC_LOOKUP(wchan), wchan));
116 _sleepq_add(void *wchan, struct pthread *td)
118 struct sleepqueue_chain *sc;
119 struct sleepqueue *sq;
121 sc = SC_LOOKUP(wchan);
122 sq = lookup(sc, wchan);
124 SLIST_INSERT_HEAD(&sq->sq_freeq, td->sleepqueue, sq_flink);
127 LIST_INSERT_HEAD(&sc->sc_queues, sq, sq_hash);
128 sq->sq_wchan = wchan;
129 /* sq->sq_type = type; */
131 td->sleepqueue = NULL;
133 if (((++sc->sc_enqcnt << _thr_queuefifo) & 0xff) != 0)
134 TAILQ_INSERT_HEAD(&sq->sq_blocked, td, wle);
136 TAILQ_INSERT_TAIL(&sq->sq_blocked, td, wle);
140 _sleepq_remove(struct sleepqueue *sq, struct pthread *td)
144 TAILQ_REMOVE(&sq->sq_blocked, td, wle);
145 if (TAILQ_EMPTY(&sq->sq_blocked)) {
146 LIST_REMOVE(sq, sq_hash);
150 td->sleepqueue = SLIST_FIRST(&sq->sq_freeq);
151 SLIST_REMOVE_HEAD(&sq->sq_freeq, sq_flink);
159 _sleepq_drop(struct sleepqueue *sq,
160 void (*cb)(struct pthread *, void *arg), void *arg)
163 struct sleepqueue *sq2;
165 td = TAILQ_FIRST(&sq->sq_blocked);
168 LIST_REMOVE(sq, sq_hash);
169 TAILQ_REMOVE(&sq->sq_blocked, td, wle);
174 sq2 = SLIST_FIRST(&sq->sq_freeq);
175 TAILQ_FOREACH(td, &sq->sq_blocked, wle) {
178 td->sleepqueue = sq2;
180 sq2 = SLIST_NEXT(sq2, sq_flink);
182 TAILQ_INIT(&sq->sq_blocked);
183 SLIST_INIT(&sq->sq_freeq);