-
Notifications
You must be signed in to change notification settings - Fork 0
/
walg.c
521 lines (427 loc) · 10.4 KB
/
walg.c
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <fcntl.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <dirent.h>
#include <sys/uio.h>
#include <sys/stat.h>
#include <limits.h>
#include "dat.h"
static int reserve(Wal *w, int n);
// Reads w->dir for files matching binlog.NNN,
// sets w->next to the next unused number, and
// returns the minimum number.
// If no files are found, sets w->next to 1 and
// returns a large number.
static int
walscandir(Wal *w)
{
static char base[] = "binlog.";
static const int len = sizeof(base) - 1;
DIR *d;
struct dirent *e;
int min = 1<<30;
int max = 0;
int n;
char *p;
d = opendir(w->dir);
if (!d) return min;
while ((e = readdir(d))) {
// 如果名字是以binlog.开头的话
if (strncmp(e->d_name, base, len) == 0) {
//那么取binlog.后面的数字,转为p
n = strtol(e->d_name+len, &p, 10);
//p存储的是第一个非法字符的位置,参见strtol的文档
//10表示的是10进制
//c的这些函数真是奇奇怪怪
if (p && *p == '\0') {
//如果非法字符是最后一位的话
if (n > max) max = n;
if (n < min) min = n;
}
}
}
closedir(d);
//上面的while循环会检索当前目录下的binlog.1,binlog.2,binlog.3的文件
//计算出最大的.X
//然后将全局的Wal的next值变成X+1,这也就是为啥每次beanstalkd启动的时候会创建一个更大的
//binlog.X+1的原因
w->next = max + 1;
return min;
}
void
walgc(Wal *w)
{
File *f;
while (w->head && !w->head->refs) {
f = w->head;
w->head = f->next;
if (w->tail == f) {
w->tail = f->next; // also, f->next == NULL
}
w->nfile--;
unlink(f->path);
free(f->path);
free(f);
}
}
// returns 1 on success, 0 on error.
static int
usenext(Wal *w)
{
File *f;
f = w->cur;
if (!f->next) {
twarnx("there is no next wal file");
return 0;
}
w->cur = f->next;
filewclose(f);
return 1;
}
static int
ratio(Wal *w)
{
int64 n, d;
d = w->alive + w->resv;
n = (int64)w->nfile * (int64)w->filesize - d;
if (!d) return 0;
return n / d;
}
// Returns the number of bytes reserved or 0 on error.
static int
walresvmigrate(Wal *w, job j)
{
int z = 0;
// reserve only space for the migrated full job record
// space for the delete is already reserved
z += sizeof(int);
z += strlen(j->tube->name);
z += sizeof(Jobrec);
z += j->r.body_size;
return reserve(w, z);
}
static void
moveone(Wal *w)
{
job j;
if (w->head == w->cur || w->head->next == w->cur) {
// no point in moving a job
return;
}
j = w->head->jlist.fnext;
if (!j || j == &w->head->jlist) {
// head holds no jlist; can't happen
twarnx("head holds no jlist");
return;
}
if (!walresvmigrate(w, j)) {
// it will not fit, so we'll try again later
return;
}
filermjob(w->head, j);
w->nmig++;
walwrite(w, j);
}
static void
walcompact(Wal *w)
{
int r;
for (r=ratio(w); r>=2; r--) {
moveone(w);
}
}
static void
walsync(Wal *w)
{
int64 now;
now = nanoseconds();
if (w->wantsync && now >= w->lastsync+w->syncrate) {
w->lastsync = now;
if (fsync(w->cur->fd) == -1) {
twarn("fsync");
}
}
}
// Walwrite writes j to the log w (if w is enabled).
// On failure, walwrite disables w and returns 0; on success, it returns 1.
// Unlke walresv*, walwrite should never fail because of a full disk.
// If w is disabled, then walwrite takes no action and returns 1.
int
walwrite(Wal *w, job j)
{
int r = 0;
if (!w->use) return 1;
//如果当前的文件中被使用的字节数=0,那么就使用下一个文件
//为什么呢
if (w->cur->resv > 0 || usenext(w)) {
//如果job对应的file不为空,那么说明这个job已经被写入到过之前的文件
//参考一下读取时候的注释:
// We read a short record without having seen a
// full record for this job, so the full record
// was in an earlier file that has been deleted.
// Therefore the job itself has either been
// deleted or migrated; either way, this record
// should be ignored.
if (j->file) {
r = filewrjobshort(w->cur, j);
} else {
//在写完整信息时会把j->file改成w->cur的
r = filewrjobfull(w->cur, j);
}
}
if (!r) {
filewclose(w->cur);
w->use = 0;
}
w->nrec++;
return r;
}
void
walmaint(Wal *w)
{
if (w->use) {
if (!w->nocomp) {
walcompact(w);
}
walsync(w);
}
}
static int
makenextfile(Wal *w)
{
File *f;
f = new(File);
if (!f) {
twarnx("OOM");
return 0;
}
if (!fileinit(f, w, w->next)) {
free(f);
twarnx("OOM");
return 0;
}
filewopen(f);
if (!f->iswopen) {
free(f->path);
free(f);
return 0;
}
w->next++;
fileadd(f, w);
return 1;
}
static void
moveresv(File *to, File *from, int n)
{
from->resv -= n;
from->free += n;
to->resv += n;
to->free -= n;
}
static int
needfree(Wal *w, int n)
{
if (w->tail->free >= n) return n;
if (makenextfile(w)) return n;
return 0;
}
// Ensures:
// 1. b->resv is congruent to n (mod z).
// 2. x->resv is congruent to 0 (mod z) for each future file x.
// Assumes (and preserves) that b->resv >= n.
// Reserved space is conserved (neither created nor destroyed);
// we just move it around to preserve the invariant.
// We might have to allocate a new file.
// Returns 1 on success, otherwise 0. If there was a failure,
// w->tail is not updated.
static int
balancerest(Wal *w, File *b, int n)
{
int rest, c, r;
static const int z = sizeof(int) + sizeof(Jobrec);
if (!b) return 1;
rest = b->resv - n;
r = rest % z;
if (r == 0) return balancerest(w, b->next, 0);
c = z - r;
if (w->tail->resv >= c && b->free >= c) {
moveresv(b, w->tail, c);
return balancerest(w, b->next, 0);
}
if (needfree(w, r) != r) {
twarnx("needfree");
return 0;
}
moveresv(w->tail, b, r);
return balancerest(w, b->next, 0);
}
// Ensures:
// 1. w->cur->resv >= n.
// 2. w->cur->resv is congruent to n (mod z).
// 3. x->resv is congruent to 0 (mod z) for each future file x.
// (where z is the size of a delete record in the wal).
// Reserved space is conserved (neither created nor destroyed);
// we just move it around to preserve the invariant.
// We might have to allocate a new file.
// Returns 1 on success, otherwise 0. If there was a failure,
// w->tail is not updated.
static int
balance(Wal *w, int n)
{
int r;
// Invariant 1
// (this loop will run at most once)
while (w->cur->resv < n) {
int m = w->cur->resv;
r = needfree(w, m);
if (r != m) {
twarnx("needfree");
return 0;
}
moveresv(w->tail, w->cur, m);
usenext(w);
}
// Invariants 2 and 3
return balancerest(w, w->cur, n);
}
// Returns the number of bytes successfully reserved: either 0 or n.
static int
reserve(Wal *w, int n)
{
int r;
// return value must be nonzero but is otherwise ignored
if (!w->use) return 1;
if (w->cur->free >= n) {
w->cur->free -= n;
w->cur->resv += n;
w->resv += n;
return n;
}
r = needfree(w, n);
if (r != n) {
twarnx("needfree");
return 0;
}
w->tail->free -= n;
w->tail->resv += n;
w->resv += n;
if (!balance(w, n)) {
// error; undo the reservation
w->resv -= n;
w->tail->resv -= n;
w->tail->free += n;
return 0;
}
return n;
}
// Returns the number of bytes reserved or 0 on error.
int
walresvput(Wal *w, job j)
{
int z = 0;
// reserve space for the initial job record
z += sizeof(int);
z += strlen(j->tube->name);
z += sizeof(Jobrec);
z += j->r.body_size;
// plus space for a delete to come later
z += sizeof(int);
z += sizeof(Jobrec);
return reserve(w, z);
}
// Returns the number of bytes reserved or 0 on error.
int
walresvupdate(Wal *w, job j)
{
int z = 0;
z +=sizeof(int);
z +=sizeof(Jobrec);
return reserve(w, z);
}
// Returns the number of locks acquired: either 0 or 1.
int
waldirlock(Wal *w)
{
int r;
int fd;
struct flock lk;
char *path;
size_t path_length;
path_length = strlen(w->dir) + strlen("/lock") + 1;
if ((path = malloc(path_length)) == NULL) {
twarn("malloc");
return 0;
}
r = snprintf(path, path_length, "%s/lock", w->dir);
fd = open(path, O_WRONLY|O_CREAT, 0600);
free(path);
if (fd == -1) {
twarn("open");
return 0;
}
lk.l_type = F_WRLCK;
lk.l_whence = SEEK_SET;
lk.l_start = 0;
lk.l_len = 0;
r = fcntl(fd, F_SETLK, &lk);
if (r) {
twarn("fcntl");
return 0;
}
// intentionally leak fd, since we never want to close it
// and we'll never need it again
return 1;
}
void
walread(Wal *w, job list, int min)
{
File *f;
int i, fd;
int err = 0;
for (i = min; i < w->next; i++) {
f = new(File);
if (!f) {
twarnx("OOM");
exit(1);
}
if (!fileinit(f, w, i)) {
free(f);
twarnx("OOM");
exit(1);
}
fd = open(f->path, O_RDONLY);
if (fd < 0) {
twarn("open %s", f->path);
free(f->path);
free(f);
continue;
}
f->fd = fd;
fileadd(f, w);
err |= fileread(f, list);
close(fd);
}
if (err) {
warnx("Errors reading one or more WAL files.");
warnx("Continuing. You may be missing data.");
}
}
void
walinit(Wal *w, job list)
{
int min;
min = walscandir(w);
walread(w, list, min);
// first writable file
// 用walscandir里计算出来的那个next值去创建文件,next的值是上一次扫描到的最大的index+1
// 所以新文件一定会被创建出来
if (!makenextfile(w)) {
twarnx("makenextfile");
exit(1);
}
w->cur = w->tail;
}