mutex.h revision 1.1
11.1Smatt/* $NetBSD: mutex.h,v 1.1 2014/09/03 19:34:26 matt Exp $ */ 21.1Smatt 31.1Smatt/*- 41.1Smatt * Copyright (c) 2002, 2007 The NetBSD Foundation, Inc. 51.1Smatt * All rights reserved. 61.1Smatt * 71.1Smatt * This code is derived from software contributed to The NetBSD Foundation 81.1Smatt * by Jason R. Thorpe and Andrew Doran. 91.1Smatt * 101.1Smatt * Redistribution and use in source and binary forms, with or without 111.1Smatt * modification, are permitted provided that the following conditions 121.1Smatt * are met: 131.1Smatt * 1. Redistributions of source code must retain the above copyright 141.1Smatt * notice, this list of conditions and the following disclaimer. 151.1Smatt * 2. Redistributions in binary form must reproduce the above copyright 161.1Smatt * notice, this list of conditions and the following disclaimer in the 171.1Smatt * documentation and/or other materials provided with the distribution. 181.1Smatt * 191.1Smatt * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 201.1Smatt * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 211.1Smatt * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 221.1Smatt * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 231.1Smatt * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 241.1Smatt * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 251.1Smatt * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 261.1Smatt * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 271.1Smatt * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 281.1Smatt * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 291.1Smatt * POSSIBILITY OF SUCH DAMAGE. 301.1Smatt */ 311.1Smatt 321.1Smatt#ifndef _OR1K_MUTEX_H_ 331.1Smatt#define _OR1K_MUTEX_H_ 341.1Smatt 351.1Smatt#ifndef __MUTEX_PRIVATE 361.1Smatt 371.1Smattstruct kmutex { 381.1Smatt uintptr_t mtx_pad1; 391.1Smatt}; 401.1Smatt 411.1Smatt#else /* __MUTEX_PRIVATE */ 421.1Smatt 431.1Smattstruct kmutex { 441.1Smatt union { 451.1Smatt /* Adaptive mutex */ 461.1Smatt volatile uintptr_t mtxa_owner; 471.1Smatt 481.1Smatt /* Spin mutex */ 491.1Smatt struct { 501.1Smatt /* 511.1Smatt * Since the low bit of mtax_owner is used to flag this 521.1Smatt * mutex as a spin mutex, we can't use the first byte 531.1Smatt * or the last byte to store the ipl or lock values. 541.1Smatt */ 551.1Smatt volatile uint8_t mtxs_dummy; 561.1Smatt ipl_cookie_t mtxs_ipl; 571.1Smatt __cpu_simple_lock_t mtxs_lock; 581.1Smatt volatile uint8_t mtxs_unused; 591.1Smatt } s; 601.1Smatt } u; 611.1Smatt}; 621.1Smatt 631.1Smatt#define mtx_owner u.mtxa_owner 641.1Smatt#define mtx_ipl u.s.mtxs_ipl 651.1Smatt#define mtx_lock u.s.mtxs_lock 661.1Smatt 671.1Smatt#if 0 681.1Smatt#define __HAVE_MUTEX_STUBS 1 691.1Smatt#define __HAVE_SPIN_MUTEX_STUBS 1 701.1Smatt#endif 711.1Smatt#define __HAVE_SIMPLE_MUTEXES 1 721.1Smatt 731.1Smatt/* 741.1Smatt * MUTEX_RECEIVE: no memory barrier required; we're synchronizing against 751.1Smatt * interrupts, not multiple processors. 761.1Smatt */ 771.1Smatt#ifdef MULTIPROCESSOR 781.1Smatt#define MUTEX_RECEIVE(mtx) membar_consumer() 791.1Smatt#else 801.1Smatt#define MUTEX_RECEIVE(mtx) /* nothing */ 811.1Smatt#endif 821.1Smatt 831.1Smatt/* 841.1Smatt * MUTEX_GIVE: no memory barrier required; same reason. 851.1Smatt */ 861.1Smatt#ifdef MULTIPROCESSOR 871.1Smatt#define MUTEX_GIVE(mtx) membar_producer() 881.1Smatt#else 891.1Smatt#define MUTEX_GIVE(mtx) /* nothing */ 901.1Smatt#endif 911.1Smatt 921.1Smatt#define MUTEX_CAS(p, o, n) \ 931.1Smatt (atomic_cas_ulong((volatile unsigned long *)(p), (o), (n)) == (o)) 941.1Smatt 951.1Smatt#endif /* __MUTEX_PRIVATE */ 961.1Smatt 971.1Smatt#endif /* _OR1K_MUTEX_H_ */ 98