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.
30 #include "thr_private.h"
33 #define HASHSIZE (1 << HASHSHIFT)
34 #define SC_HASH(wchan) ((unsigned) \
35 ((((uintptr_t)(wchan) >> 3) \
36 ^ ((uintptr_t)(wchan) >> (HASHSHIFT + 3))) \
38 #define SC_LOOKUP(wc) &sc_table[SC_HASH(wc)]
40 struct sleepqueue_chain {
41 struct umutex sc_lock;
42 LIST_HEAD(, sleepqueue) sc_queues;
46 static struct sleepqueue_chain sc_table[HASHSIZE];
53 for (i = 0; i < HASHSIZE; ++i) {
54 LIST_INIT(&sc_table[i].sc_queues);
55 _thr_umutex_init(&sc_table[i].sc_lock);
62 struct sleepqueue *sq;
64 sq = calloc(1, sizeof(struct sleepqueue));
65 TAILQ_INIT(&sq->sq_blocked);
66 SLIST_INIT(&sq->sq_freeq);
71 _sleepq_free(struct sleepqueue *sq)
77 _sleepq_lock(void *wchan)
79 struct pthread *curthread = _get_curthread();
80 struct sleepqueue_chain *sc;
82 sc = SC_LOOKUP(wchan);
83 THR_LOCK_ACQUIRE_SPIN(curthread, &sc->sc_lock);
87 _sleepq_unlock(void *wchan)
89 struct sleepqueue_chain *sc;
90 struct pthread *curthread = _get_curthread();
92 sc = SC_LOOKUP(wchan);
93 THR_LOCK_RELEASE(curthread, &sc->sc_lock);
97 _sleepq_lookup(void *wchan)
99 struct sleepqueue_chain *sc;
100 struct sleepqueue *sq;
102 sc = SC_LOOKUP(wchan);
103 LIST_FOREACH(sq, &sc->sc_queues, sq_hash)
104 if (sq->sq_wchan == wchan)
110 _sleepq_add(void *wchan, struct pthread *td)
112 struct sleepqueue_chain *sc;
113 struct sleepqueue *sq;
115 sq = _sleepq_lookup(wchan);
117 SLIST_INSERT_HEAD(&sq->sq_freeq, td->sleepqueue, sq_flink);
119 sc = SC_LOOKUP(wchan);
121 LIST_INSERT_HEAD(&sc->sc_queues, sq, sq_hash);
122 sq->sq_wchan = wchan;
123 /* sq->sq_type = type; */
125 td->sleepqueue = NULL;
127 TAILQ_INSERT_TAIL(&sq->sq_blocked, td, wle);
131 _sleepq_remove(struct sleepqueue *sq, struct pthread *td)
135 TAILQ_REMOVE(&sq->sq_blocked, td, wle);
136 if (TAILQ_EMPTY(&sq->sq_blocked)) {
137 LIST_REMOVE(sq, sq_hash);
141 td->sleepqueue = SLIST_FIRST(&sq->sq_freeq);
142 SLIST_REMOVE_HEAD(&sq->sq_freeq, sq_flink);
150 _sleepq_drop(struct sleepqueue *sq,
151 void (*cb)(struct pthread *, void *arg), void *arg)
154 struct sleepqueue *sq2;
156 td = TAILQ_FIRST(&sq->sq_blocked);
159 LIST_REMOVE(sq, sq_hash);
160 TAILQ_REMOVE(&sq->sq_blocked, td, wle);
165 sq2 = SLIST_FIRST(&sq->sq_freeq);
166 TAILQ_FOREACH(td, &sq->sq_blocked, wle) {
169 td->sleepqueue = sq2;
171 sq2 = SLIST_NEXT(sq2, sq_flink);
173 TAILQ_INIT(&sq->sq_blocked);
174 SLIST_INIT(&sq->sq_freeq);