- 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
void check_manifest_line (int p) {
static char c[MAX_LINE_LEN + 1];
int l = p - START_MANIFEST_POSITION;
if (l <= MAX_LINE_LEN && l > 4) {
get_binlog_data (c, START_MANIFEST_POSITION, l);
c[l] = 0;
char *pp = c;
int op = -1;
if (l >= 6 && !memcmp (c, "start", 5)) {
op = 1;
pp += 5;
} else if (l >= 5 && !memcmp (c, "stop", 4)) {
op = 2;
pp += 4;
} else if (l >= 8 && !memcmp (c, "version", 7)) {
op = 3;
pp += 7;
}
if (is_whitespace (*pp) && op > 0) {
pp ++;
pp = eat_whitespace (pp);
if (!*pp) {
START_MANIFEST_POSITION = p + 1;
return;
}
if (op == 1 || op == 2) {
char *rr = pp;
pp = eat_not_whitespace (pp);
char *zz = pp;
pp = eat_whitespace (pp);
*zz = 0;
if (pp == c + l && zz - rr > 0) {
struct cluster *C = CC;
int x = BINLOG_NAME_LEN - 1;
while (x >= 0 && BINLOG_NAME[x] != '/') {
x--;
}
add_cluster (BINLOG_NAME, x + 1, rr, (MAIN_REPLICA ? 2 : 0) + (op == 2 ? 4 : 0) + (1 << 30));
CC = C;
}
} else {
assert (op == 3);
char *rr = pp;
pp = eat_not_whitespace (pp);
char *rr_end = pp;
pp = eat_whitespace (pp);
*rr_end = 0;
if (!*pp) {
START_MANIFEST_POSITION = p + 1;
return;
}
int version = atoi (pp);
pp = eat_not_whitespace (pp);
pp = eat_whitespace (pp);
if (!*pp) {
START_MANIFEST_POSITION = p + 1;
return;
}
long long size = atoll (pp);
pp = eat_not_whitespace (pp);
pp = eat_whitespace (pp);
if (pp == c + l && rr_end > rr && version > 0 && size >= 0) {
struct cluster *C = CC;
int x = BINLOG_NAME_LEN - 1;
while (x >= 0 && BINLOG_NAME[x] != '/') {
x --;
}
int rrlen = rr_end - rr;
int i;
for (i = 0; i < max_cluster; i++) if (Clusters[i]) {
//fprintf (stderr, "i = %d, binlog_name = %s, rr = %s, rrlen = %d\n", i, Clusters[i]->binlog_name, rr, rrlen);
const char *s = Clusters[i]->binlog_name;
int l = strlen (Clusters[i]->binlog_name) - 1;
while (l >= 0 && s[l] != '/') { l --; }
s = s + l + 1;
if (!memcmp (s, rr, rrlen) && s[rrlen] == '.') {
int old = atoi (s + rrlen + 1);
if (old >= version) {
vkprintf (0, "New version %d, old %d. Skipping\n", version, old);
START_MANIFEST_POSITION = p + 1;
return;
}
if (unlink (Clusters[i]->binlog_name) < 0) {
fprintf (stderr, "Can not delete old file %s: %m\n", Clusters[i]->binlog_name);
}
delete_cluster (i);
}
}
static char name[1024];
memcpy (name, rr, rrlen);
name[rrlen] = '.';
sprintf (name + rrlen + 1, "%06d", version);
add_cluster (BINLOG_NAME, x + 1, name, (MAIN_REPLICA ? 2 : 0) + (1 << 30));
LAST_SIZE = size;
CC = C;
}
}
}
}
START_MANIFEST_POSITION = p + 1;
А 1024 точно хватит?
--Сколько букв в слове "тромбоэластограмма"?
--18
--ого, как ты так быстро посчитал?
--ну я просто в Вконтакте работаю