Change and clean the mutex lock interface.

mtx_enter(lock, type) becomes:

mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)

similarily, for releasing a lock, we now have:

mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.

The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.

Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:

MTX_QUIET and MTX_NOSWITCH

The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:

mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.

Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.

Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.

Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.

Finally, caught up to the interface changes in all sys code.

Contributors: jake, jhb, jasone (in no particular order)

1 files changed, 15 insertions, 15 deletions

diff --git a/sys/kern/uipc_mbuf.c b/sys/kern/uipc_mbuf.c
index 1489157..adbfe31 100644
--- a/sys/kern/uipc_mbuf.c
+++ b/sys/kern/uipc_mbuf.c
@@ -152,20 +152,20 @@ mbinit(dummy)
 	/*
 	 * Perform some initial allocations.
 	 */
-	mtx_enter(&mcntfree.m_mtx, MTX_DEF);
+	mtx_lock(&mcntfree.m_mtx);
 	if (m_alloc_ref(REF_INIT, M_DONTWAIT) == 0)
 		goto bad;
-	mtx_exit(&mcntfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mcntfree.m_mtx);
 
-	mtx_enter(&mmbfree.m_mtx, MTX_DEF);
+	mtx_lock(&mmbfree.m_mtx);
 	if (m_mballoc(NMB_INIT, M_DONTWAIT) == 0)
 		goto bad;
-	mtx_exit(&mmbfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mmbfree.m_mtx);
 
-	mtx_enter(&mclfree.m_mtx, MTX_DEF);
+	mtx_lock(&mclfree.m_mtx);
 	if (m_clalloc(NCL_INIT, M_DONTWAIT) == 0)
 		goto bad;
-	mtx_exit(&mclfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mclfree.m_mtx);
 
 	return;
 bad:
@@ -204,10 +204,10 @@ m_alloc_ref(nmb, how)
 	 */
 
 	nbytes = round_page(nmb * sizeof(union mext_refcnt));
-	mtx_exit(&mcntfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mcntfree.m_mtx);
 	if ((p = (caddr_t)kmem_malloc(mb_map, nbytes, how == M_TRYWAIT ?
 	    M_WAITOK : M_NOWAIT)) == NULL) {
-		mtx_enter(&mcntfree.m_mtx, MTX_DEF);
+		mtx_lock(&mcntfree.m_mtx);
 		return (0);
 	}
 	nmb = nbytes / sizeof(union mext_refcnt);
@@ -216,7 +216,7 @@ m_alloc_ref(nmb, how)
 	 * We don't let go of the mutex in order to avoid a race.
 	 * It is up to the caller to let go of the mutex.
 	 */
-	mtx_enter(&mcntfree.m_mtx, MTX_DEF);
+	mtx_lock(&mcntfree.m_mtx);
 	for (i = 0; i < nmb; i++) {
 		((union mext_refcnt *)p)->next_ref = mcntfree.m_head;
 		mcntfree.m_head = (union mext_refcnt *)p;
@@ -260,13 +260,13 @@ m_mballoc(nmb, how)
 
 	nbytes = round_page(nmb * MSIZE);
 
-	mtx_exit(&mmbfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mmbfree.m_mtx);
 	p = (caddr_t)kmem_malloc(mb_map, nbytes, M_NOWAIT);
 	if (p == 0 && how == M_TRYWAIT) {
 		atomic_add_long(&mbstat.m_wait, 1);
 		p = (caddr_t)kmem_malloc(mb_map, nbytes, M_WAITOK);
 	}
-	mtx_enter(&mmbfree.m_mtx, MTX_DEF);
+	mtx_lock(&mmbfree.m_mtx);
 
 	/*
 	 * Either the map is now full, or `how' is M_DONTWAIT and there
@@ -318,10 +318,10 @@ m_mballoc_wait(void)
 	 * importantly, to avoid a potential lock order reversal which may
 	 * result in deadlock (See comment above m_reclaim()).
 	 */
-	mtx_exit(&mmbfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mmbfree.m_mtx);
 	m_reclaim();
 
-	mtx_enter(&mmbfree.m_mtx, MTX_DEF);
+	mtx_lock(&mmbfree.m_mtx);
 	_MGET(p, M_DONTWAIT);
 
 	if (p == NULL) {
@@ -381,11 +381,11 @@ m_clalloc(ncl, how)
 	}
 
 	npg = ncl;
-	mtx_exit(&mclfree.m_mtx, MTX_DEF);
+	mtx_unlock(&mclfree.m_mtx);
 	p = (caddr_t)kmem_malloc(mb_map, ctob(npg),
 				 how == M_TRYWAIT ? M_WAITOK : M_NOWAIT);
 	ncl = ncl * PAGE_SIZE / MCLBYTES;
-	mtx_enter(&mclfree.m_mtx, MTX_DEF);
+	mtx_lock(&mclfree.m_mtx);
 
 	/*
 	 * Either the map is now full, or `how' is M_DONTWAIT and there