1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/* Copyright (C) 2012-2018 Free Software Foundation, Inc.
Contributed by Richard Henderson <rth@redhat.com>.
This file is part of the GNU Atomic Library (libatomic).
Libatomic is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Libatomic is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License for
more details.
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.
You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
<http://www.gnu.org/licenses/>. */
#include "libatomic_i.h"
/* If we natively support the cas, and if we're unconcerned with extra
barriers (e.g. fully in-order cpu for which barriers are a nop), then
go ahead and expand the operation inline. */
#if !defined(WANT_SPECIALCASE_RELAXED) && !defined(__OPTIMIZE_SIZE__)
# define EXACT_INLINE(N) \
if (C2(HAVE_ATOMIC_CAS_,N)) \
return __atomic_compare_exchange_n \
(PTR(N,mptr), PTR(N,eptr), *PTR(N,dptr), false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST)
#else
# define EXACT_INLINE(N)
#endif
/* ... and if all that fails, invoke the function we generated elsewhere.
Worst case, this will *also* use locks. */
#define EXACT(N) \
do { \
if (!C2(HAVE_INT,N)) break; \
if ((uintptr_t)mptr & (N - 1)) break; \
EXACT_INLINE (N); \
return C3(local_,compare_exchange_,N) \
(PTR(N,mptr), PTR(N,eptr), *PTR(N,dptr), smodel, fmodel); \
} while (0)
#define LARGER(N) \
do { \
if (!C2(HAVE_INT,N)) break; \
if (!C2(HAVE_ATOMIC_LDST_,N)) break; \
if (!C2(MAYBE_HAVE_ATOMIC_CAS_,N)) break; \
r = (uintptr_t)mptr & (N - 1); \
a = (uintptr_t)mptr & -N; \
if (r + n <= N) \
{ \
pre_barrier (smodel); \
u.C2(i,N) = __atomic_load_n (PTR(N,a), __ATOMIC_RELAXED); \
do { \
if (memcmp (u.b + r, eptr, n) != 0) goto Lfail; \
v = u; memcpy (v.b + r, dptr, n); \
} while (!(C2(HAVE_ATOMIC_CAS_,N) \
? __atomic_compare_exchange_n (PTR(N,a), \
&u.C2(i,N), v.C2(i,N), true, \
__ATOMIC_RELAXED, __ATOMIC_RELAXED) \
: C3(local_,compare_exchange_,N) (PTR(N,a), \
&u.C2(i,N), v.C2(i,N), \
__ATOMIC_RELAXED, __ATOMIC_RELAXED))); \
goto Lsucc; \
} \
} while (0)
bool
libat_compare_exchange (size_t n, void *mptr, void *eptr, void *dptr,
int smodel, int fmodel)
{
union max_size_u u, v;
uintptr_t r, a;
bool ret;
switch (n)
{
case 0: return true;
case 1: EXACT(1); goto L4;
case 2: EXACT(2); goto L4;
case 4: EXACT(4); goto L8;
case 8: EXACT(8); goto L16;
case 16: EXACT(16); break;
case 3: L4: LARGER(4); /* FALLTHRU */
case 5 ... 7: L8: LARGER(8); /* FALLTHRU */
case 9 ... 15: L16: LARGER(16); break;
Lsucc:
post_barrier (smodel);
return true;
Lfail:
post_barrier (fmodel);
memcpy (eptr, u.b + r, n);
return false;
}
pre_seq_barrier (smodel);
libat_lock_n (mptr, n);
ret = memcmp (mptr, eptr, n) == 0;
memcpy ((ret ? mptr : eptr), (ret ? dptr : mptr), n);
libat_unlock_n (mptr, n);
post_seq_barrier (ret ? smodel : fmodel);
return ret;
}
EXPORT_ALIAS (compare_exchange);
|
