2 This source code file is part of thread_mpi.
3 Written by Sander Pronk, Erik Lindahl, and possibly others.
5 Copyright (c) 2009, Sander Pronk, Erik Lindahl.
8 Redistribution and use in source and binary forms, with or without
9 modification, are permitted provided that the following conditions are met:
10 1) Redistributions of source code must retain the above copyright
11 notice, this list of conditions and the following disclaimer.
12 2) Redistributions in binary form must reproduce the above copyright
13 notice, this list of conditions and the following disclaimer in the
14 documentation and/or other materials provided with the distribution.
15 3) Neither the name of the copyright holders nor the
16 names of its contributors may be used to endorse or promote products
17 derived from this software without specific prior written permission.
19 THIS SOFTWARE IS PROVIDED BY US ''AS IS'' AND ANY
20 EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
21 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL WE BE LIABLE FOR ANY
23 DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
26 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 If you want to redistribute modifications, please consider that
31 scientific software is very special. Version control is crucial -
32 bugs must be traceable. We will be happy to consider code for
33 inclusion in the official distribution, but derived work should not
34 be called official thread_mpi. Details are found in the README & COPYING
39 /* Microsoft Visual C on x86, define taken from FFTW who got it from Morten Nissov */
41 /* we need this for all the data types. We use WIN32_LEAN_AND_MEAN to avoid
42 polluting the global namespace. */
43 #define WIN32_LEAN_AND_MEAN
45 #undef WIN32_LEAN_AND_MEAN
47 #if (!defined(inline)) && (!defined(__cplusplus))
48 #define inline_defined_in_atomic 1
49 #define inline __inline
52 #define tMPI_Atomic_memory_barrier()
55 typedef struct tMPI_Atomic
57 LONG volatile value; /*!< Volatile, to avoid compiler aliasing */
60 typedef struct tMPI_Atomic_ptr
62 void* volatile value; /*!< Volatile, to avoid compiler aliasing */
65 typedef struct tMPI_Spinlock
67 LONG volatile lock; /*!< Volatile, to avoid compiler aliasing */
70 #define TMPI_SPINLOCK_INITIALIZER { 0 }
73 #define TMPI_HAVE_SWAP
76 #define tMPI_Atomic_get(a) ((a)->value)
77 #define tMPI_Atomic_set(a, i) (((a)->value) = (i))
80 #define tMPI_Atomic_ptr_get(a) ((a)->value)
81 #define tMPI_Atomic_ptr_set(a, i) (((a)->value) = (void*)(i))
84 #define tMPI_Atomic_fetch_add(a, i) \
85 InterlockedExchangeAdd((LONG volatile *)(a), (LONG) (i))
87 #define tMPI_Atomic_add_return(a, i) \
88 ( (i) + InterlockedExchangeAdd((LONG volatile *)(a), (LONG) (i)) )
90 #define tMPI_Atomic_cas(a, oldval, newval) \
91 (InterlockedCompareExchange((LONG volatile *)(a), (LONG) (newval), (LONG) (oldval)) == (LONG)oldval)
93 #define tMPI_Atomic_ptr_cas(a, oldval, newval) \
94 (InterlockedCompareExchangePointer(&((a)->value), (PVOID) (newval), \
95 (PVOID) (oldval)) == (PVOID)oldval)
97 #define tMPI_Atomic_swap(a, b) \
98 InterlockedExchange((LONG volatile *)(a), (LONG) (b))
100 #define tMPI_Atomic_ptr_swap(a, b) \
101 InterlockedExchangePointer(&((a)->value), (PVOID) (b))
105 static inline void tMPI_Spinlock_init(tMPI_Spinlock_t * x)
110 # define tMPI_Spinlock_lock(x) \
111 while ((InterlockedCompareExchange((LONG volatile *)(x), 1, 0)) != 0)
114 #define tMPI_Spinlock_trylock(x) \
115 InterlockedCompareExchange((LONG volatile *)(x), 1, 0)
118 static inline void tMPI_Spinlock_unlock(tMPI_Spinlock_t * x)
124 static inline int tMPI_Spinlock_islocked(const tMPI_Spinlock_t * x)
126 return (*(volatile signed char *)(&(x)->lock) != 0);
130 static inline void tMPI_Spinlock_wait(tMPI_Spinlock_t * x)
132 while (tMPI_Spinlock_islocked(x))