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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
|
/*-
* Copyright (c) 2008-2013 WiredTiger, Inc.
* All rights reserved.
*
* See the file LICENSE for redistribution information.
*/
#include "wt_internal.h"
/*
* This file implements the consolidated array algorithm as described in
* the paper:
* Scalability of write-ahead logging on multicore and multisocket hardware
* by Ryan Johnson, Ippokratis Pandis, Radu Stoica, Manos Athanassoulis
* and Anastasia Ailamaki.
*
* It appeared in The VLDB Journal, DOI 10.1007/s00778-011-0260-8 and can
* be found at:
* http://infoscience.epfl.ch/record/170505/files/aether-smpfulltext.pdf
*/
/*
* __wt_log_slot_init --
* Initialize the slot array.
*/
int
__wt_log_slot_init(WT_SESSION_IMPL *session)
{
WT_CONNECTION_IMPL *conn;
WT_DECL_RET;
WT_LOG *log;
WT_LOGSLOT *slot;
int i;
conn = S2C(session);
log = conn->log;
for (i = 0; i < SLOT_POOL; i++) {
log->slot_pool[i].slot_state = WT_LOG_SLOT_FREE;
log->slot_pool[i].slot_index = SLOT_INVALID_INDEX;
}
/*
* Set up the available slots from the pool the first time.
*/
for (i = 0; i < SLOT_ACTIVE; i++) {
slot = &log->slot_pool[i];
slot->slot_index = i;
slot->slot_state = WT_LOG_SLOT_READY;
log->slot_array[i] = slot;
}
/*
* Allocate memory for buffers now that the arrays are setup. Split
* this out to make error handling simpler.
*/
for (i = 0; i < SLOT_ACTIVE; i++) {
WT_ERR(__wt_buf_init(session,
&log->slot_pool[i].slot_buf, WT_LOG_SLOT_BUF_INIT_SIZE));
F_SET(&log->slot_pool[i], SLOT_BUFFERED);
}
WT_STAT_FAST_CONN_INCRV(session,
log_buffer_size, WT_LOG_SLOT_BUF_INIT_SIZE * SLOT_ACTIVE);
if (0) {
err: while (--i >= 0)
__wt_buf_free(session, &log->slot_pool[i].slot_buf);
}
return (ret);
}
/*
* __wt_log_slot_join --
* Join a consolidated logging slot. Callers should be prepared to deal
* with a ENOMEM return - which indicates no slots could accommodate
* the log record.
*/
int
__wt_log_slot_join(WT_SESSION_IMPL *session, uint64_t mysize,
uint32_t flags, WT_MYSLOT *myslotp)
{
WT_CONNECTION_IMPL *conn;
WT_LOG *log;
WT_LOGSLOT *slot;
int64_t cur_state, new_state, old_state;
uint32_t allocated_slot, slot_grow_attempts;
conn = S2C(session);
log = conn->log;
slot_grow_attempts = 0;
find_slot:
allocated_slot = __wt_random() % SLOT_ACTIVE;
slot = log->slot_array[allocated_slot];
old_state = slot->slot_state;
join_slot:
/*
* WT_LOG_SLOT_READY and higher means the slot is available for
* joining. Any other state means it is in use and transitioning
* from the active array.
*/
if (old_state < WT_LOG_SLOT_READY) {
WT_STAT_FAST_CONN_INCR(session, log_slot_transitions);
goto find_slot;
}
/*
* Add in our size to the state and then atomically swap that
* into place if it is still the same value.
*/
new_state = old_state + (int64_t)mysize;
if (new_state < old_state) {
/* Our size doesn't fit here. */
WT_STAT_FAST_CONN_INCR(session, log_slot_toobig);
goto find_slot;
}
/*
* If the slot buffer isn't big enough to hold this update, mark
* the slot for a buffer size increase and find another slot.
*/
if (new_state > (int64_t)slot->slot_buf.memsize) {
F_SET(slot, SLOT_BUF_GROW);
if (++slot_grow_attempts > 5) {
WT_STAT_FAST_CONN_INCR(session, log_slot_toosmall);
return (ENOMEM);
}
goto find_slot;
}
cur_state = WT_ATOMIC_CAS_VAL(slot->slot_state, old_state, new_state);
/*
* We lost a race to add our size into this slot. Check the state
* and try again.
*/
if (cur_state != old_state) {
old_state = cur_state;
WT_STAT_FAST_CONN_INCR(session, log_slot_races);
goto join_slot;
}
WT_ASSERT(session, myslotp != NULL);
/*
* We joined this slot. Fill in our information to return to
* the caller.
*/
WT_STAT_FAST_CONN_INCR(session, log_slot_joins);
if (LF_ISSET(WT_LOG_FSYNC))
F_SET(slot, SLOT_SYNC);
myslotp->slot = slot;
myslotp->offset = (off_t)old_state - WT_LOG_SLOT_READY;
return (0);
}
/*
* __wt_log_slot_close --
* Close a slot and do not allow any other threads to join this slot.
* Remove this from the active slot array and move a new slot from
* the pool into its place. Set up the size of this group;
* Must be called with the logging spinlock held.
*/
int
__wt_log_slot_close(WT_SESSION_IMPL *session, WT_LOGSLOT *slot)
{
WT_CONNECTION_IMPL *conn;
WT_LOG *log;
WT_LOGSLOT *newslot;
int64_t old_state;
uint32_t pool_i;
conn = S2C(session);
log = conn->log;
retry:
/*
* Find an unused slot in the pool.
*/
pool_i = log->pool_index;
newslot = &log->slot_pool[pool_i];
if (++log->pool_index >= SLOT_POOL)
log->pool_index = 0;
if (newslot->slot_state != WT_LOG_SLOT_FREE)
goto retry;
/*
* Sleep for a small amount of time to allow other threads a
* chance to consolidate.
*/
__wt_yield();
/*
* Swap out the slot we're going to use and put a free one in the
* slot array in its place so that threads can use it right away.
*/
WT_STAT_FAST_CONN_INCR(session, log_slot_closes);
newslot->slot_state = WT_LOG_SLOT_READY;
newslot->slot_index = slot->slot_index;
log->slot_array[newslot->slot_index] = &log->slot_pool[pool_i];
old_state = WT_ATOMIC_STORE(slot->slot_state, WT_LOG_SLOT_PENDING);
slot->slot_group_size = (uint64_t)(old_state - WT_LOG_SLOT_READY);
/*
* Note that this statistic may be much bigger than in reality,
* especially when compared with the total bytes written in
* __log_fill. The reason is that this size reflects any
* rounding up that is needed and the total bytes in __log_fill
* is the amount of user bytes.
*/
WT_STAT_FAST_CONN_INCRV(session,
log_slot_consolidated, (uint64_t)slot->slot_group_size);
return (0);
}
/*
* __wt_log_slot_notify --
* Notify all threads waiting for the state to be < WT_LOG_SLOT_DONE.
*/
int
__wt_log_slot_notify(WT_LOGSLOT *slot)
{
slot->slot_state =
(int64_t)WT_LOG_SLOT_DONE - (int64_t)slot->slot_group_size;
return (0);
}
/*
* __wt_log_slot_wait --
* Wait for slot leader to allocate log area and tell us our log offset.
*/
int
__wt_log_slot_wait(WT_LOGSLOT *slot)
{
while (slot->slot_state > WT_LOG_SLOT_DONE)
__wt_yield();
return (0);
}
/*
* __wt_log_slot_release --
* Each thread in a consolidated group releases its portion to
* signal it has completed writing its piece of the log.
*/
int64_t
__wt_log_slot_release(WT_LOGSLOT *slot, uint64_t size)
{
int64_t newsize;
/*
* Add my size into the state. When it reaches WT_LOG_SLOT_DONE
* all participatory threads have completed copying their piece.
*/
newsize = WT_ATOMIC_ADD(slot->slot_state, (int64_t)size);
return (newsize);
}
/*
* __wt_log_slot_free --
* Free a slot back into the pool.
*/
int
__wt_log_slot_free(WT_LOGSLOT *slot)
{
slot->slot_state = WT_LOG_SLOT_FREE;
return (0);
}
/*
* __wt_log_slot_grow_buffers --
* Increase the buffer size of all available slots in the buffer pool.
* Go to some lengths to include active (but unused) slots to handle
* the case where all log write record sizes exceed the size of the
* active buffer.
*/
int
__wt_log_slot_grow_buffers(WT_SESSION_IMPL *session, int64_t newsize)
{
WT_CONNECTION_IMPL *conn;
WT_DECL_RET;
WT_LOG *log;
WT_LOGSLOT *slot;
int64_t old_size, orig_state, total_growth;
int i;
conn = S2C(session);
log = conn->log;
total_growth = 0;
WT_STAT_FAST_CONN_INCR(session, log_buffer_grow);
/*
* Take the log slot lock to prevent other threads growing buffers
* at the same time. Could tighten the scope of this lock, or have
* a separate lock if there is contention.
*/
__wt_spin_lock(session, &log->log_slot_lock);
for (i = 0; i < SLOT_POOL; i++) {
slot = &log->slot_pool[i];
/* Avoid atomic operations if they won't succeed. */
if (slot->slot_state != WT_LOG_SLOT_FREE &&
slot->slot_state != WT_LOG_SLOT_READY)
continue;
/* Don't keep growing unrelated buffers. */
if (slot->slot_buf.memsize > (size_t)(10 * newsize) &&
!F_ISSET(slot, SLOT_BUF_GROW))
continue;
orig_state = WT_ATOMIC_CAS_VAL(
slot->slot_state, WT_LOG_SLOT_FREE, WT_LOG_SLOT_PENDING);
if (orig_state != WT_LOG_SLOT_FREE) {
orig_state = WT_ATOMIC_CAS_VAL(slot->slot_state,
WT_LOG_SLOT_READY, WT_LOG_SLOT_PENDING);
if (orig_state != WT_LOG_SLOT_READY)
continue;
}
/* We have a slot - now go ahead and grow the buffer. */
old_size = slot->slot_buf.memsize;
F_CLR(slot, SLOT_BUF_GROW);
WT_ERR(__wt_buf_grow(session, &slot->slot_buf,
WT_MAX(slot->slot_buf.memsize * 2, (size_t)newsize)));
WT_ATOMIC_STORE(slot->slot_state, orig_state);
total_growth += slot->slot_buf.memsize - old_size;
}
err: __wt_spin_unlock(session, &log->log_slot_lock);
WT_STAT_FAST_CONN_INCRV(session, log_buffer_size, total_growth);
return (ret);
}
|