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
|
/* Copyright (c) 2009-2018 Dovecot authors, see the included COPYING file */
#include "lib.h"
#include "array.h"
#include "test-common.h"
#include "mail-index-private.h"
#include "mail-index-modseq.h"
#include "mail-index-transaction-private.h"
static struct mail_index_record recs[20];
static uint64_t modseqs[N_ELEMENTS(recs)];
bool mail_index_map_get_ext_idx(struct mail_index_map *map ATTR_UNUSED,
uint32_t ext_id ATTR_UNUSED,
uint32_t *idx_r ATTR_UNUSED) { return FALSE; }
void mail_index_ext_set_reset_id(struct mail_index_transaction *t ATTR_UNUSED,
uint32_t ext_id ATTR_UNUSED,
uint32_t reset_id ATTR_UNUSED) { }
void mail_index_transaction_set_log_updates(struct mail_index_transaction *t ATTR_UNUSED) { }
void mail_index_update_day_headers(struct mail_index_transaction *t ATTR_UNUSED, time_t day_stamp ATTR_UNUSED) {}
bool mail_index_cancel_flag_updates(struct mail_index_transaction *t ATTR_UNUSED,
uint32_t seq ATTR_UNUSED) { return TRUE; }
bool mail_index_cancel_keyword_updates(struct mail_index_transaction *t ATTR_UNUSED,
uint32_t seq ATTR_UNUSED) { return TRUE; }
void mail_index_transaction_sort_appends(struct mail_index_transaction *t ATTR_UNUSED) {}
int mail_index_map(struct mail_index *index ATTR_UNUSED,
enum mail_index_sync_handler_type type ATTR_UNUSED) { return 1; }
void mail_index_update_modseq(struct mail_index_transaction *t ATTR_UNUSED, uint32_t seq ATTR_UNUSED,
uint64_t min_modseq ATTR_UNUSED) {}
const struct mail_index_record *
mail_index_lookup(struct mail_index_view *view ATTR_UNUSED, uint32_t seq)
{
i_assert(seq < N_ELEMENTS(recs));
return &recs[seq];
}
struct mail_index_record *
mail_index_transaction_lookup(struct mail_index_transaction *t ATTR_UNUSED,
uint32_t seq)
{
i_assert(seq < N_ELEMENTS(recs));
return &recs[seq];
}
uint64_t mail_index_modseq_lookup(struct mail_index_view *view ATTR_UNUSED,
uint32_t seq)
{
i_assert(seq < N_ELEMENTS(modseqs));
return modseqs[seq];
}
uint64_t mail_index_modseq_get_highest(struct mail_index_view *view ATTR_UNUSED)
{
return modseqs[0];
}
#define MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far) \
for (unsigned int sofar = 0; sofar < n_so_far; sofar++) \
mail_index_transaction_finish_so_far(t); \
mail_index_transaction_finish(t);
static void
test_mail_index_transaction_finish_flag_updates(unsigned int n_so_far)
{
struct mail_index_transaction *t;
const struct mail_index_flag_update *updates;
struct mail_index_flag_update u;
unsigned int count;
t = t_new(struct mail_index_transaction, 1);
t->drop_unnecessary_flag_updates = TRUE;
i_zero(&u);
u.add_flags = MAIL_SEEN; u.remove_flags = MAIL_DRAFT;
test_begin(t_strdup_printf("mail index transaction finish flag updates n_so_far=%u", n_so_far));
/* test fast path: all changed */
t_array_init(&t->updates, 10);
u.uid1 = 1; u.uid2 = 2;
array_push_back(&t->updates, &u);
u.uid1 = 4; u.uid2 = 5;
array_push_back(&t->updates, &u);
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
updates = array_get(&t->updates, &count);
test_assert(count == 4);
test_assert(updates[0].uid1 == 1*2 && updates[0].uid2 == 1*2);
test_assert(updates[1].uid1 == 2*2 && updates[1].uid2 == 2*2);
test_assert(updates[2].uid1 == 4*2 && updates[2].uid2 == 4*2);
test_assert(updates[3].uid1 == 5*2 && updates[3].uid2 == 5*2);
/* nothing changed */
t_array_init(&t->updates, 10);
u.uid1 = 1; u.uid2 = 2;
array_push_back(&t->updates, &u);
u.uid1 = 4; u.uid2 = 5;
array_push_back(&t->updates, &u);
recs[1].flags = MAIL_SEEN;
recs[2].flags = MAIL_SEEN;
recs[4].flags = MAIL_SEEN;
recs[5].flags = MAIL_SEEN;
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
test_assert(!array_is_created(&t->updates));
/* some changes */
t_array_init(&t->updates, 10);
u.uid1 = 2; u.uid2 = 3;
array_push_back(&t->updates, &u);
u.uid1 = 5; u.uid2 = 6;
array_push_back(&t->updates, &u);
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
updates = array_get(&t->updates, &count);
test_assert(count == 2);
test_assert(updates[0].uid1 == 3*2 && updates[0].uid2 == 3*2);
test_assert(updates[1].uid1 == 6*2 && updates[1].uid2 == 6*2);
test_end();
}
static void
test_mail_index_transaction_finish_check_conflicts(unsigned int n_so_far)
{
struct mail_index_transaction *t;
const struct seq_range *conflicts;
ARRAY_TYPE(seq_range) conflict_seqs = ARRAY_INIT;
unsigned int count;
t = t_new(struct mail_index_transaction, 1);
t->view = t_new(struct mail_index_view, 1);
t->min_flagupdate_seq = 5;
t->max_flagupdate_seq = 8;
t->conflict_seqs = &conflict_seqs;
modseqs[0] = 1234;
modseqs[5] = 5;
modseqs[6] = 8;
modseqs[7] = 6;
modseqs[8] = 7;
test_begin(t_strdup_printf("mail index transaction finish check conflicts n_so_far=%u", n_so_far));
/* fast path: no conflicts */
t->max_modseq = 1234;
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
test_assert(!array_is_created(&conflict_seqs));
/* try some conflicts */
t->max_modseq = 6;
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
i_assert(array_is_created(&conflict_seqs));
conflicts = array_get(&conflict_seqs, &count);
test_assert(count == 2);
test_assert(conflicts[0].seq1 == 6 && conflicts[0].seq2 == 6);
test_assert(conflicts[1].seq1 == 8 && conflicts[1].seq2 == 8);
test_end();
array_free(t->conflict_seqs);
}
static void
test_mail_index_transaction_finish_modseq_updates(unsigned int n_so_far)
{
struct mail_index_transaction *t;
const struct mail_transaction_modseq_update *ups;
struct mail_transaction_modseq_update u;
unsigned int count;
t = t_new(struct mail_index_transaction, 1);
test_begin(t_strdup_printf("mail index transaction finish modseq updates n_so_far=%u", n_so_far));
t_array_init(&t->modseq_updates, 10);
u.modseq_low32 = 1234567890;
u.modseq_high32 = 987654321;
u.uid = 1; array_push_back(&t->modseq_updates, &u);
u.modseq_low32++;
u.modseq_high32++;
u.uid = 2; array_push_back(&t->modseq_updates, &u);
u.modseq_low32++;
u.modseq_high32++;
u.uid = 5; array_push_back(&t->modseq_updates, &u);
u.modseq_low32 = 1234;
u.modseq_high32 = 0;
u.uid = 2; array_push_back(&t->modseq_updates, &u);
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
ups = array_get(&t->modseq_updates, &count);
test_assert(count == 4);
test_assert(ups[0].uid == 1*2);
test_assert(ups[0].modseq_low32 == 1234567890 &&
ups[0].modseq_high32 == 987654321);
test_assert(ups[1].uid == 2*2);
test_assert(ups[1].modseq_low32 == 1234567891 &&
ups[1].modseq_high32 == 987654322);
test_assert(ups[2].uid == 5*2);
test_assert(ups[2].modseq_low32 == 1234567892 &&
ups[2].modseq_high32 == 987654323);
test_assert(ups[3].uid == 2*2);
test_assert(ups[3].modseq_low32 == 1234 &&
ups[3].modseq_high32 == 0);
test_end();
}
static void
test_mail_index_transaction_finish_expunges(unsigned int n_so_far)
{
struct mail_index_transaction *t;
guid_128_t guid1, guid2, guid3;
const struct mail_transaction_expunge_guid *expunges;
struct mail_transaction_expunge_guid expunge;
unsigned int i, count;
for (i = 0; i < sizeof(guid2); i++) {
guid1[i] = i + 1;
guid2[i] = i ^ 0xff;
guid3[i] = i + 0x80;
}
recs[1].uid = 12;
recs[2].uid = 15;
recs[3].uid = 18;
t = t_new(struct mail_index_transaction, 1);
t->expunges_nonsorted = TRUE;
test_begin(t_strdup_printf("mail index transaction finish expunges n_so_far=%u", n_so_far));
t_array_init(&t->expunges, 3);
expunge.uid = 2;
memcpy(expunge.guid_128, guid2, sizeof(expunge.guid_128));
array_push_back(&t->expunges, &expunge);
array_push_back(&t->expunges, &expunge);
expunge.uid = 1;
memcpy(expunge.guid_128, guid1, sizeof(expunge.guid_128));
array_push_back(&t->expunges, &expunge);
array_push_back(&t->expunges, &expunge);
expunge.uid = 3;
memcpy(expunge.guid_128, guid3, sizeof(expunge.guid_128));
array_push_back(&t->expunges, &expunge);
array_push_back(&t->expunges, &expunge);
MAIL_INDEX_TRANSACTION_FINISH(t, n_so_far);
expunges = array_get(&t->expunges, &count);
test_assert(count == 3);
test_assert(expunges[0].uid == 12);
test_assert(memcmp(expunges[0].guid_128, guid1, sizeof(guid1)) == 0);
test_assert(expunges[1].uid == 15);
test_assert(memcmp(expunges[1].guid_128, guid2, sizeof(guid2)) == 0);
test_assert(expunges[2].uid == 18);
test_assert(memcmp(expunges[2].guid_128, guid3, sizeof(guid3)) == 0);
test_end();
}
static void test_state_reset(void)
{
memset(recs, 0, sizeof(recs));
memset(modseqs, 0, sizeof(modseqs));
for (unsigned int n = 1; n < N_ELEMENTS(recs); n++)
recs[n].uid = n*2;
}
static void test_mail_index_transaction_finish(void)
{
void (*const test_finish_functions[])(unsigned int) = {
test_mail_index_transaction_finish_flag_updates,
test_mail_index_transaction_finish_check_conflicts,
test_mail_index_transaction_finish_modseq_updates,
test_mail_index_transaction_finish_expunges,
};
unsigned int i, j;
for (i = 0; i < N_ELEMENTS(test_finish_functions); i++) {
for (j = 0; j < 3; j++) {
test_state_reset();
test_finish_functions[i](j);
}
}
}
int main(void)
{
static void (*const test_functions[])(void) = {
test_mail_index_transaction_finish,
NULL
};
return test_run(test_functions);
}
|
