minix/sys/sys/sleepq.h
Ben Gras 6c8f7fc3ba netbsd dirent.h, import sys/sys *.h, mfs cleanup
. add all sys/sys headers not already present to help compiling
	. take netbsd dirent.h and struct dirent; main result is
	  introducing d_type and d_namlen that have to be set by getdents()
	  in all FS code implementing it
	. d_off is gone
	. alignment of the struct has become 8 bytes instead of 4
	. remove _MAX_BLOCK_SIZE, _MIN_BLOCK_SIZE, _STATIC_BLOCK_SIZE
	. libminlib: cleanup unused yet duplicate code
	. mfs: throw out the long-broken v1, v2 support
	. new test for dirent contents filled by getdents()

Change-Id: I1459755c7ba5e5d1c9396d3a587ce6e63ddc283e
2014-03-01 09:04:59 +01:00

184 lines
5.2 KiB
C

/* $NetBSD: sleepq.h,v 1.22 2012/02/19 21:07:00 rmind Exp $ */
/*-
* Copyright (c) 2002, 2006, 2007, 2008, 2009 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jason R. Thorpe and Andrew Doran.
*
* 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, 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 NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``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 FOUNDATION OR CONTRIBUTORS
* 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.
*/
#ifndef _SYS_SLEEPQ_H_
#define _SYS_SLEEPQ_H_
#include <sys/lwp.h>
#include <sys/mutex.h>
#include <sys/pool.h>
#include <sys/queue.h>
#include <sys/sched.h>
#include <sys/syncobj.h>
/*
* Generic sleep queues.
*/
#define SLEEPTAB_HASH_SHIFT 7
#define SLEEPTAB_HASH_SIZE (1 << SLEEPTAB_HASH_SHIFT)
#define SLEEPTAB_HASH_MASK (SLEEPTAB_HASH_SIZE - 1)
#define SLEEPTAB_HASH(wchan) (((uintptr_t)(wchan) >> 8) & SLEEPTAB_HASH_MASK)
TAILQ_HEAD(sleepq, lwp);
typedef struct sleepq sleepq_t;
typedef struct sleeptab {
struct {
kmutex_t *st_mutex;
sleepq_t st_queue;
} st_queues[SLEEPTAB_HASH_SIZE];
} sleeptab_t;
void sleepq_init(sleepq_t *);
void sleepq_remove(sleepq_t *, lwp_t *);
void sleepq_enqueue(sleepq_t *, wchan_t, const char *, syncobj_t *);
void sleepq_unsleep(lwp_t *, bool);
void sleepq_timeout(void *);
lwp_t *sleepq_wake(sleepq_t *, wchan_t, u_int, kmutex_t *);
int sleepq_abort(kmutex_t *, int);
void sleepq_changepri(lwp_t *, pri_t);
void sleepq_lendpri(lwp_t *, pri_t);
int sleepq_block(int, bool);
void sleeptab_init(sleeptab_t *);
extern sleeptab_t sleeptab;
/*
* Return non-zero if it is unsafe to sleep.
*
* XXX This only exists because panic() is broken.
*/
static inline bool
sleepq_dontsleep(lwp_t *l)
{
extern int cold;
return cold || (doing_shutdown && (panicstr || CURCPU_IDLE_P()));
}
/*
* Find the correct sleep queue for the specified wait channel. This
* acquires and holds the per-queue interlock.
*/
static inline sleepq_t *
sleeptab_lookup(sleeptab_t *st, wchan_t wchan, kmutex_t **mp)
{
sleepq_t *sq;
sq = &st->st_queues[SLEEPTAB_HASH(wchan)].st_queue;
*mp = st->st_queues[SLEEPTAB_HASH(wchan)].st_mutex;
mutex_spin_enter(*mp);
return sq;
}
static inline kmutex_t *
sleepq_hashlock(wchan_t wchan)
{
kmutex_t *mp;
mp = sleeptab.st_queues[SLEEPTAB_HASH(wchan)].st_mutex;
mutex_spin_enter(mp);
return mp;
}
/*
* Prepare to block on a sleep queue, after which any interlock can be
* safely released.
*/
static inline void
sleepq_enter(sleepq_t *sq, lwp_t *l, kmutex_t *mp)
{
/*
* Acquire the per-LWP mutex and lend it ours sleep queue lock.
* Once interlocked, we can release the kernel lock.
*/
lwp_lock(l);
lwp_unlock_to(l, mp);
KERNEL_UNLOCK_ALL(NULL, &l->l_biglocks);
}
/*
* Turnstiles, specialized sleep queues for use by kernel locks.
*/
typedef struct turnstile {
LIST_ENTRY(turnstile) ts_chain; /* link on hash chain */
struct turnstile *ts_free; /* turnstile free list */
wchan_t ts_obj; /* lock object */
sleepq_t ts_sleepq[2]; /* sleep queues */
u_int ts_waiters[2]; /* count of waiters */
/* priority inheritance */
pri_t ts_eprio;
lwp_t *ts_inheritor;
SLIST_ENTRY(turnstile) ts_pichain;
} turnstile_t;
typedef struct tschain {
kmutex_t *tc_mutex; /* mutex on structs & queues */
LIST_HEAD(, turnstile) tc_chain; /* turnstile chain */
} tschain_t;
#define TS_READER_Q 0 /* reader sleep queue */
#define TS_WRITER_Q 1 /* writer sleep queue */
#define TS_WAITERS(ts, q) \
(ts)->ts_waiters[(q)]
#define TS_ALL_WAITERS(ts) \
((ts)->ts_waiters[TS_READER_Q] + \
(ts)->ts_waiters[TS_WRITER_Q])
#define TS_FIRST(ts, q) (TAILQ_FIRST(&(ts)->ts_sleepq[(q)]))
#ifdef _KERNEL
void turnstile_init(void);
turnstile_t *turnstile_lookup(wchan_t);
void turnstile_exit(wchan_t);
void turnstile_block(turnstile_t *, int, wchan_t, syncobj_t *);
void turnstile_wakeup(turnstile_t *, int, int, lwp_t *);
void turnstile_print(volatile void *, void (*)(const char *, ...)
__printflike(1, 2));
void turnstile_unsleep(lwp_t *, bool);
void turnstile_changepri(lwp_t *, pri_t);
extern pool_cache_t turnstile_cache;
extern turnstile_t turnstile0;
#endif /* _KERNEL */
#endif /* _SYS_SLEEPQ_H_ */