-
Notifications
You must be signed in to change notification settings - Fork 271
/
squat-uidlist.c
1621 lines (1410 loc) · 42.1 KB
/
squat-uidlist.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
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* Copyright (c) 2007-2016 Dovecot authors, see the included COPYING file */
#include "lib.h"
#include "array.h"
#include "sort.h"
#include "bsearch-insert-pos.h"
#include "file-cache.h"
#include "file-lock.h"
#include "read-full.h"
#include "write-full.h"
#include "ostream.h"
#include "mmap-util.h"
#include "squat-trie-private.h"
#include "squat-uidlist.h"
#include <stdio.h>
#include <sys/stat.h>
#define UIDLIST_LIST_SIZE 31
#define UIDLIST_BLOCK_LIST_COUNT 100
#define UID_LIST_MASK_RANGE 0x80000000
/* set = points to uidlist index number, unset = points to uidlist offset */
#define UID_LIST_POINTER_MASK_LIST_IDX 0x80000000
#define UIDLIST_PACKED_FLAG_BITMASK 1
#define UIDLIST_PACKED_FLAG_BEGINS_WITH_POINTER 2
struct uidlist_list {
unsigned int uid_count:31;
bool uid_begins_with_pointer:1;
uint32_t uid_list[UIDLIST_LIST_SIZE];
};
struct squat_uidlist {
struct squat_trie *trie;
char *path;
int fd;
struct file_cache *file_cache;
struct file_lock *file_lock;
struct dotlock *dotlock;
uoff_t locked_file_size;
void *mmap_base;
size_t mmap_size;
struct squat_uidlist_file_header hdr;
const void *data;
size_t data_size;
unsigned int cur_block_count;
const uint32_t *cur_block_offsets;
const uint32_t *cur_block_end_indexes;
size_t max_size;
bool corrupted:1;
bool building:1;
};
struct squat_uidlist_build_context {
struct squat_uidlist *uidlist;
struct ostream *output;
ARRAY_TYPE(uint32_t) block_offsets;
ARRAY_TYPE(uint32_t) block_end_indexes;
ARRAY(struct uidlist_list) lists;
uint32_t list_start_idx;
struct squat_uidlist_file_header build_hdr;
bool need_reopen:1;
};
struct squat_uidlist_rebuild_context {
struct squat_uidlist *uidlist;
struct squat_uidlist_build_context *build_ctx;
int fd;
struct ostream *output;
ARRAY_TYPE(uint32_t) new_block_offsets, new_block_end_indexes;
uoff_t cur_block_start_offset;
uint32_t list_sizes[UIDLIST_BLOCK_LIST_COUNT];
uint32_t next_uid_list_idx;
unsigned int list_idx;
unsigned int new_count;
};
static void squat_uidlist_close(struct squat_uidlist *uidlist);
void squat_uidlist_delete(struct squat_uidlist *uidlist)
{
i_unlink_if_exists(uidlist->path);
}
static void squat_uidlist_set_corrupted(struct squat_uidlist *uidlist,
const char *reason)
{
if (uidlist->corrupted)
return;
uidlist->corrupted = TRUE;
i_error("Corrupted squat uidlist file %s: %s", uidlist->path, reason);
squat_trie_delete(uidlist->trie);
}
static int
uidlist_write_array(struct ostream *output, const uint32_t *uid_list,
unsigned int uid_count, uint32_t packed_flags,
uint32_t offset, bool write_size, uint32_t *size_r)
{
uint8_t *uidbuf, *bufp, sizebuf[SQUAT_PACK_MAX_SIZE], *sizebufp;
uint8_t listbuf[SQUAT_PACK_MAX_SIZE], *listbufp = listbuf;
uint32_t uid, uid2, prev, base_uid, size_value;
unsigned int i, bitmask_len, uid_list_len;
unsigned int idx, max_idx, mask;
bool datastack;
int num;
if ((packed_flags & UIDLIST_PACKED_FLAG_BEGINS_WITH_POINTER) != 0)
squat_pack_num(&listbufp, offset);
/* @UNSAFE */
base_uid = uid_list[0] & ~UID_LIST_MASK_RANGE;
datastack = uid_count < 1024*8/SQUAT_PACK_MAX_SIZE;
if (datastack)
uidbuf = t_malloc_no0(SQUAT_PACK_MAX_SIZE * uid_count);
else
uidbuf = i_malloc(SQUAT_PACK_MAX_SIZE * uid_count);
bufp = uidbuf;
squat_pack_num(&bufp, base_uid);
bitmask_len = (uid_list[uid_count-1] - base_uid + 7) / 8 +
(bufp - uidbuf);
if (bitmask_len < uid_count) {
bitmask_build:
i_assert(bitmask_len < SQUAT_PACK_MAX_SIZE*uid_count);
memset(bufp, 0, bitmask_len - (bufp - uidbuf));
if ((uid_list[0] & UID_LIST_MASK_RANGE) == 0) {
i = 1;
uid = i == uid_count ? 0 : uid_list[i];
} else {
i = 0;
uid = uid_list[0] + 1;
}
base_uid++;
for (; i < uid_count; i++) {
i_assert((uid & ~UID_LIST_MASK_RANGE) >= base_uid);
if ((uid & UID_LIST_MASK_RANGE) == 0) {
uid -= base_uid;
uid2 = uid;
} else {
uid &= ~UID_LIST_MASK_RANGE;
uid -= base_uid;
uid2 = uid_list[i+1] - base_uid;
i++;
}
if (uid2 - uid < 3*8) {
for (; uid <= uid2; uid++)
bufp[uid / 8] |= 1 << (uid % 8);
} else {
/* first byte */
idx = uid / 8;
num = uid % 8;
if (num != 0) {
uid += 8 - num;
for (mask = 0; num < 8; num++)
mask |= 1 << num;
bufp[idx++] |= mask;
}
/* middle bytes */
num = uid2 % 8;
max_idx = idx + (uid2 - num - uid)/8;
for (; idx < max_idx; idx++, uid += 8)
bufp[idx] = 0xff;
/* last byte */
for (mask = 0; num >= 0; num--)
mask |= 1 << num;
bufp[idx] |= mask;
}
uid = i+1 == uid_count ? 0 : uid_list[i+1];
}
uid_list_len = bitmask_len;
packed_flags |= UIDLIST_PACKED_FLAG_BITMASK;
} else {
bufp = uidbuf;
prev = 0;
for (i = 0; i < uid_count; i++) {
uid = uid_list[i];
if (unlikely((uid & ~UID_LIST_MASK_RANGE) < prev)) {
if (!datastack)
i_free(uidbuf);
return -1;
}
if ((uid & UID_LIST_MASK_RANGE) == 0) {
squat_pack_num(&bufp, (uid - prev) << 1);
prev = uid + 1;
} else {
uid &= ~UID_LIST_MASK_RANGE;
squat_pack_num(&bufp, 1 | (uid - prev) << 1);
squat_pack_num(&bufp, uid_list[i+1] - uid - 1);
prev = uid_list[i+1] + 1;
i++;
}
}
uid_list_len = bufp - uidbuf;
if (uid_list_len > bitmask_len) {
bufp = uidbuf;
squat_pack_num(&bufp, base_uid);
goto bitmask_build;
}
}
size_value = ((uid_list_len +
(listbufp - listbuf)) << 2) | packed_flags;
if (write_size) {
sizebufp = sizebuf;
squat_pack_num(&sizebufp, size_value);
o_stream_nsend(output, sizebuf, sizebufp - sizebuf);
}
o_stream_nsend(output, listbuf, listbufp - listbuf);
o_stream_nsend(output, uidbuf, uid_list_len);
if (!datastack)
i_free(uidbuf);
*size_r = size_value;
return 0;
}
static int
uidlist_write(struct ostream *output, const struct uidlist_list *list,
bool write_size, uint32_t *size_r)
{
const uint32_t *uid_list = list->uid_list;
uint8_t buf[SQUAT_PACK_MAX_SIZE], *bufp;
uint32_t uid_count = list->uid_count;
uint32_t packed_flags = 0;
uint32_t offset = 0;
int ret;
if (list->uid_begins_with_pointer) {
/* continued UID list */
packed_flags |= UIDLIST_PACKED_FLAG_BEGINS_WITH_POINTER;
if ((uid_list[0] & UID_LIST_POINTER_MASK_LIST_IDX) != 0) {
offset = ((uid_list[0] & ~UID_LIST_POINTER_MASK_LIST_IDX) << 1) | 1;
if (list->uid_count == 1) {
bufp = buf;
squat_pack_num(&bufp, offset);
o_stream_nsend(output, buf, bufp - buf);
*size_r = (bufp - buf) << 2 | packed_flags;
return 0;
}
} else if (unlikely(output->offset <= uid_list[0])) {
i_assert(output->closed);
return -1;
} else {
i_assert(list->uid_count > 1);
offset = (output->offset - uid_list[0]) << 1;
}
uid_list++;
uid_count--;
}
T_BEGIN {
ret = uidlist_write_array(output, uid_list, uid_count,
packed_flags, offset,
write_size, size_r);
} T_END;
return ret;
}
static void squat_uidlist_map_blocks_set_pointers(struct squat_uidlist *uidlist)
{
const void *base;
size_t end_index_size, end_size;
base = CONST_PTR_OFFSET(uidlist->data, uidlist->hdr.block_list_offset +
sizeof(uint32_t));
end_index_size = uidlist->cur_block_count * sizeof(uint32_t);
end_size = end_index_size + uidlist->cur_block_count * sizeof(uint32_t);
if (end_size <= uidlist->data_size) {
uidlist->cur_block_end_indexes = base;
uidlist->cur_block_offsets =
CONST_PTR_OFFSET(base, end_index_size);
} else {
uidlist->cur_block_end_indexes = NULL;
uidlist->cur_block_offsets = NULL;
}
}
static int uidlist_file_cache_read(struct squat_uidlist *uidlist,
size_t offset, size_t size)
{
if (uidlist->file_cache == NULL)
return 0;
if (file_cache_read(uidlist->file_cache, offset, size) < 0) {
i_error("read(%s) failed: %m", uidlist->path);
return -1;
}
uidlist->data = file_cache_get_map(uidlist->file_cache,
&uidlist->data_size);
squat_uidlist_map_blocks_set_pointers(uidlist);
return 0;
}
static int squat_uidlist_map_blocks(struct squat_uidlist *uidlist)
{
const struct squat_uidlist_file_header *hdr = &uidlist->hdr;
const void *base;
uint32_t block_count, blocks_offset, blocks_size, i, verify_count;
if (hdr->block_list_offset == 0) {
/* empty file */
uidlist->cur_block_count = 0;
return 1;
}
/* get number of blocks */
if (uidlist_file_cache_read(uidlist, hdr->block_list_offset,
sizeof(block_count)) < 0)
return -1;
blocks_offset = hdr->block_list_offset + sizeof(block_count);
if (blocks_offset > uidlist->data_size) {
squat_uidlist_set_corrupted(uidlist, "block list outside file");
return 0;
}
i_assert(uidlist->data != NULL);
base = CONST_PTR_OFFSET(uidlist->data, hdr->block_list_offset);
memcpy(&block_count, base, sizeof(block_count));
/* map the blocks */
blocks_size = block_count * sizeof(uint32_t)*2;
if (uidlist_file_cache_read(uidlist, blocks_offset, blocks_size) < 0)
return -1;
if (blocks_offset + blocks_size > uidlist->data_size) {
squat_uidlist_set_corrupted(uidlist, "block list outside file");
return 0;
}
uidlist->cur_block_count = block_count;
squat_uidlist_map_blocks_set_pointers(uidlist);
i_assert(uidlist->cur_block_end_indexes != NULL);
/* verify just a couple of the end indexes to make sure they
look correct */
verify_count = I_MIN(block_count, 8);
for (i = 1; i < verify_count; i++) {
if (unlikely(uidlist->cur_block_end_indexes[i-1] >=
uidlist->cur_block_end_indexes[i])) {
squat_uidlist_set_corrupted(uidlist,
"block list corrupted");
return 0;
}
}
return 1;
}
static int squat_uidlist_map_header(struct squat_uidlist *uidlist)
{
if (uidlist->hdr.indexid == 0) {
/* still being built */
return 1;
}
if (uidlist->hdr.indexid != uidlist->trie->hdr.indexid) {
/* see if trie was recreated */
(void)squat_trie_open(uidlist->trie);
}
if (uidlist->hdr.indexid != uidlist->trie->hdr.indexid) {
squat_uidlist_set_corrupted(uidlist, "wrong indexid");
return 0;
}
if (uidlist->hdr.used_file_size < sizeof(uidlist->hdr) ||
(uidlist->hdr.used_file_size > uidlist->mmap_size &&
uidlist->mmap_base != NULL)) {
squat_uidlist_set_corrupted(uidlist, "broken used_file_size");
return 0;
}
return squat_uidlist_map_blocks(uidlist);
}
static void squat_uidlist_unmap(struct squat_uidlist *uidlist)
{
if (uidlist->mmap_size != 0) {
if (munmap(uidlist->mmap_base, uidlist->mmap_size) < 0)
i_error("munmap(%s) failed: %m", uidlist->path);
uidlist->mmap_base = NULL;
uidlist->mmap_size = 0;
}
uidlist->cur_block_count = 0;
uidlist->cur_block_end_indexes = NULL;
uidlist->cur_block_offsets = NULL;
}
static int squat_uidlist_mmap(struct squat_uidlist *uidlist)
{
struct stat st;
if (fstat(uidlist->fd, &st) < 0) {
i_error("fstat(%s) failed: %m", uidlist->path);
return -1;
}
if (st.st_size < (off_t)sizeof(uidlist->hdr)) {
squat_uidlist_set_corrupted(uidlist, "File too small");
return -1;
}
squat_uidlist_unmap(uidlist);
uidlist->mmap_size = st.st_size;
uidlist->mmap_base = mmap(NULL, uidlist->mmap_size,
PROT_READ | PROT_WRITE,
MAP_SHARED, uidlist->fd, 0);
if (uidlist->mmap_base == MAP_FAILED) {
uidlist->data = uidlist->mmap_base = NULL;
uidlist->data_size = uidlist->mmap_size = 0;
i_error("mmap(%s) failed: %m", uidlist->path);
return -1;
}
uidlist->data = uidlist->mmap_base;
uidlist->data_size = uidlist->mmap_size;
return 0;
}
static int squat_uidlist_map(struct squat_uidlist *uidlist)
{
const struct squat_uidlist_file_header *mmap_hdr = uidlist->mmap_base;
int ret;
if (mmap_hdr != NULL && !uidlist->building &&
uidlist->hdr.block_list_offset == mmap_hdr->block_list_offset) {
/* file hasn't changed */
return 1;
}
if ((uidlist->trie->flags & SQUAT_INDEX_FLAG_MMAP_DISABLE) == 0) {
if (mmap_hdr == NULL || uidlist->building ||
uidlist->mmap_size < mmap_hdr->used_file_size) {
if (squat_uidlist_mmap(uidlist) < 0)
return -1;
}
if (!uidlist->building) {
memcpy(&uidlist->hdr, uidlist->mmap_base,
sizeof(uidlist->hdr));
}
} else if (uidlist->building) {
/* we want to update blocks mapping, but using the header
in memory */
} else {
ret = pread_full(uidlist->fd, &uidlist->hdr,
sizeof(uidlist->hdr), 0);
if (ret <= 0) {
if (ret < 0) {
i_error("pread(%s) failed: %m", uidlist->path);
return -1;
}
i_error("Corrupted %s: File too small", uidlist->path);
return 0;
}
uidlist->data = NULL;
uidlist->data_size = 0;
}
if (uidlist->file_cache == NULL &&
(uidlist->trie->flags & SQUAT_INDEX_FLAG_MMAP_DISABLE) != 0)
uidlist->file_cache = file_cache_new(uidlist->fd);
return squat_uidlist_map_header(uidlist);
}
static int squat_uidlist_read_to_memory(struct squat_uidlist *uidlist)
{
size_t i, page_size = mmap_get_page_size();
if (uidlist->file_cache != NULL) {
return uidlist_file_cache_read(uidlist, 0,
uidlist->hdr.used_file_size);
}
/* Tell the kernel we're going to use the uidlist data, so it loads
it into memory and keeps it there. */
(void)madvise(uidlist->mmap_base, uidlist->mmap_size, MADV_WILLNEED);
/* It also speeds up a bit for us to sequentially load everything
into memory, although at least Linux catches up quite fast even
without this code. Compiler can quite easily optimize away this
entire for loop, but volatile seems to help with gcc 4.2. */
for (i = 0; i < uidlist->mmap_size; i += page_size)
((const volatile char *)uidlist->data)[i];
return 0;
}
static void squat_uidlist_free_from_memory(struct squat_uidlist *uidlist)
{
size_t page_size = mmap_get_page_size();
if (uidlist->file_cache != NULL) {
file_cache_invalidate(uidlist->file_cache,
page_size, (uoff_t)-1);
} else {
(void)madvise(uidlist->mmap_base, uidlist->mmap_size,
MADV_DONTNEED);
}
}
struct squat_uidlist *squat_uidlist_init(struct squat_trie *trie)
{
struct squat_uidlist *uidlist;
uidlist = i_new(struct squat_uidlist, 1);
uidlist->trie = trie;
uidlist->path = i_strconcat(trie->path, ".uids", NULL);
uidlist->fd = -1;
return uidlist;
}
void squat_uidlist_deinit(struct squat_uidlist *uidlist)
{
squat_uidlist_close(uidlist);
i_free(uidlist->path);
i_free(uidlist);
}
static int squat_uidlist_open(struct squat_uidlist *uidlist)
{
squat_uidlist_close(uidlist);
uidlist->fd = open(uidlist->path, O_RDWR);
if (uidlist->fd == -1) {
if (errno == ENOENT) {
memset(&uidlist->hdr, 0, sizeof(uidlist->hdr));
return 0;
}
i_error("open(%s) failed: %m", uidlist->path);
return -1;
}
return squat_uidlist_map(uidlist) <= 0 ? -1 : 0;
}
static void squat_uidlist_close(struct squat_uidlist *uidlist)
{
i_assert(!uidlist->building);
squat_uidlist_unmap(uidlist);
if (uidlist->file_cache != NULL)
file_cache_free(&uidlist->file_cache);
if (uidlist->file_lock != NULL)
file_lock_free(&uidlist->file_lock);
if (uidlist->dotlock != NULL)
file_dotlock_delete(&uidlist->dotlock);
if (uidlist->fd != -1) {
if (close(uidlist->fd) < 0)
i_error("close(%s) failed: %m", uidlist->path);
uidlist->fd = -1;
}
uidlist->corrupted = FALSE;
}
int squat_uidlist_refresh(struct squat_uidlist *uidlist)
{
/* we assume here that trie is locked, so that we don't need to worry
about it when reading the header */
if (uidlist->fd == -1 ||
uidlist->hdr.indexid != uidlist->trie->hdr.indexid) {
if (squat_uidlist_open(uidlist) < 0)
return -1;
} else {
if (squat_uidlist_map(uidlist) <= 0)
return -1;
}
return 0;
}
static int squat_uidlist_is_file_stale(struct squat_uidlist *uidlist)
{
struct stat st, st2;
i_assert(uidlist->fd != -1);
if (stat(uidlist->path, &st) < 0) {
if (errno == ENOENT)
return 1;
i_error("stat(%s) failed: %m", uidlist->path);
return -1;
}
if (fstat(uidlist->fd, &st2) < 0) {
i_error("fstat(%s) failed: %m", uidlist->path);
return -1;
}
uidlist->locked_file_size = st2.st_size;
return st.st_ino == st2.st_ino &&
CMP_DEV_T(st.st_dev, st2.st_dev) ? 0 : 1;
}
static int squat_uidlist_lock(struct squat_uidlist *uidlist)
{
int ret;
for (;;) {
i_assert(uidlist->fd != -1);
i_assert(uidlist->file_lock == NULL);
i_assert(uidlist->dotlock == NULL);
if (uidlist->trie->lock_method != FILE_LOCK_METHOD_DOTLOCK) {
ret = file_wait_lock(uidlist->fd, uidlist->path,
F_WRLCK,
uidlist->trie->lock_method,
SQUAT_TRIE_LOCK_TIMEOUT,
&uidlist->file_lock);
} else {
ret = file_dotlock_create(&uidlist->trie->dotlock_set,
uidlist->path, 0,
&uidlist->dotlock);
}
if (ret == 0) {
i_error("squat uidlist %s: Locking timed out",
uidlist->path);
return 0;
}
if (ret < 0)
return -1;
ret = squat_uidlist_is_file_stale(uidlist);
if (ret == 0)
break;
if (uidlist->file_lock != NULL)
file_unlock(&uidlist->file_lock);
else
file_dotlock_delete(&uidlist->dotlock);
if (ret < 0)
return -1;
squat_uidlist_close(uidlist);
uidlist->fd = squat_trie_create_fd(uidlist->trie,
uidlist->path, 0);
if (uidlist->fd == -1)
return -1;
}
return 1;
}
static int squat_uidlist_open_or_create(struct squat_uidlist *uidlist)
{
int ret;
if (uidlist->fd == -1) {
uidlist->fd = squat_trie_create_fd(uidlist->trie,
uidlist->path, 0);
if (uidlist->fd == -1)
return -1;
}
if (squat_uidlist_lock(uidlist) <= 0)
return -1;
if (uidlist->locked_file_size != 0) {
if ((ret = squat_uidlist_map(uidlist)) < 0)
return -1;
if (ret == 0) {
/* broken file, truncate */
if (ftruncate(uidlist->fd, 0) < 0) {
i_error("ftruncate(%s) failed: %m",
uidlist->path);
return -1;
}
uidlist->locked_file_size = 0;
}
}
if (uidlist->locked_file_size == 0) {
/* write using 0 until we're finished */
memset(&uidlist->hdr, 0, sizeof(uidlist->hdr));
if (write_full(uidlist->fd, &uidlist->hdr,
sizeof(uidlist->hdr)) < 0) {
i_error("write(%s) failed: %m", uidlist->path);
return -1;
}
}
return 0;
}
int squat_uidlist_build_init(struct squat_uidlist *uidlist,
struct squat_uidlist_build_context **ctx_r)
{
struct squat_uidlist_build_context *ctx;
int ret;
i_assert(!uidlist->building);
ret = squat_uidlist_open_or_create(uidlist);
if (ret == 0 &&
lseek(uidlist->fd, uidlist->hdr.used_file_size, SEEK_SET) < 0) {
i_error("lseek(%s) failed: %m", uidlist->path);
ret = -1;
}
if (ret < 0) {
if (uidlist->file_lock != NULL)
file_unlock(&uidlist->file_lock);
if (uidlist->dotlock != NULL)
file_dotlock_delete(&uidlist->dotlock);
return -1;
}
ctx = i_new(struct squat_uidlist_build_context, 1);
ctx->uidlist = uidlist;
ctx->output = o_stream_create_fd(uidlist->fd, 0);
if (ctx->output->offset == 0) {
struct squat_uidlist_file_header hdr;
memset(&hdr, 0, sizeof(hdr));
o_stream_nsend(ctx->output, &hdr, sizeof(hdr));
}
o_stream_cork(ctx->output);
i_array_init(&ctx->lists, 10240);
i_array_init(&ctx->block_offsets, 128);
i_array_init(&ctx->block_end_indexes, 128);
ctx->list_start_idx = uidlist->hdr.count;
ctx->build_hdr = uidlist->hdr;
uidlist->building = TRUE;
*ctx_r = ctx;
return 0;
}
static void
uidlist_write_block_list_and_header(struct squat_uidlist_build_context *ctx,
struct ostream *output,
ARRAY_TYPE(uint32_t) *block_offsets,
ARRAY_TYPE(uint32_t) *block_end_indexes,
bool write_old_blocks)
{
struct squat_uidlist *uidlist = ctx->uidlist;
unsigned int align, old_block_count, new_block_count;
uint32_t block_offset_count;
uoff_t block_list_offset;
i_assert(uidlist->trie->hdr.indexid != 0);
ctx->build_hdr.indexid = uidlist->trie->hdr.indexid;
if (array_count(block_end_indexes) == 0) {
ctx->build_hdr.used_file_size = output->offset;
ctx->build_hdr.block_list_offset = 0;
uidlist->hdr = ctx->build_hdr;
return;
}
align = output->offset % sizeof(uint32_t);
if (align != 0) {
static char null[sizeof(uint32_t)-1] = { 0, };
o_stream_nsend(output, null, sizeof(uint32_t) - align);
}
block_list_offset = output->offset;
new_block_count = array_count(block_offsets);
old_block_count = write_old_blocks ? uidlist->cur_block_count : 0;
block_offset_count = new_block_count + old_block_count;
o_stream_nsend(output, &block_offset_count, sizeof(block_offset_count));
/* write end indexes */
o_stream_nsend(output, uidlist->cur_block_end_indexes,
old_block_count * sizeof(uint32_t));
o_stream_nsend(output, array_idx(block_end_indexes, 0),
new_block_count * sizeof(uint32_t));
/* write offsets */
o_stream_nsend(output, uidlist->cur_block_offsets,
old_block_count * sizeof(uint32_t));
o_stream_nsend(output, array_idx(block_offsets, 0),
new_block_count * sizeof(uint32_t));
(void)o_stream_flush(output);
/* update header - it's written later when trie is locked */
ctx->build_hdr.block_list_offset = block_list_offset;
ctx->build_hdr.used_file_size = output->offset;
uidlist->hdr = ctx->build_hdr;
}
void squat_uidlist_build_flush(struct squat_uidlist_build_context *ctx)
{
struct uidlist_list *lists;
uint8_t buf[SQUAT_PACK_MAX_SIZE], *bufp;
unsigned int i, j, count, max;
uint32_t block_offset, block_end_idx, start_offset;
uint32_t list_sizes[UIDLIST_BLOCK_LIST_COUNT];
size_t mem_size;
if (ctx->uidlist->corrupted)
return;
lists = array_get_modifiable(&ctx->lists, &count);
if (count == 0)
return;
/* write the lists and save the written sizes to uid_list[0] */
for (i = 0; i < count; i += UIDLIST_BLOCK_LIST_COUNT) {
start_offset = ctx->output->offset;
max = I_MIN(count - i, UIDLIST_BLOCK_LIST_COUNT);
for (j = 0; j < max; j++) {
if (uidlist_write(ctx->output, &lists[i+j],
FALSE, &list_sizes[j]) < 0) {
squat_uidlist_set_corrupted(ctx->uidlist,
"Broken uidlists");
return;
}
}
block_offset = ctx->output->offset;
block_end_idx = ctx->list_start_idx + i + max;
array_append(&ctx->block_offsets, &block_offset, 1);
array_append(&ctx->block_end_indexes, &block_end_idx, 1);
/* write the full size of the uidlists */
bufp = buf;
squat_pack_num(&bufp, block_offset - start_offset);
o_stream_nsend(ctx->output, buf, bufp - buf);
/* write the sizes/flags */
for (j = 0; j < max; j++) {
bufp = buf;
squat_pack_num(&bufp, list_sizes[j]);
o_stream_nsend(ctx->output, buf, bufp - buf);
}
}
mem_size = ctx->lists.arr.buffer->used +
ctx->block_offsets.arr.buffer->used +
ctx->block_end_indexes.arr.buffer->used;
if (ctx->uidlist->max_size < mem_size)
ctx->uidlist->max_size = mem_size;
ctx->list_start_idx += count;
array_clear(&ctx->lists);
uidlist_write_block_list_and_header(ctx, ctx->output,
&ctx->block_offsets,
&ctx->block_end_indexes, TRUE);
(void)squat_uidlist_map(ctx->uidlist);
array_clear(&ctx->block_offsets);
array_clear(&ctx->block_end_indexes);
}
int squat_uidlist_build_finish(struct squat_uidlist_build_context *ctx)
{
if (ctx->uidlist->corrupted)
return -1;
if (!ctx->output->closed) {
(void)o_stream_seek(ctx->output, 0);
o_stream_nsend(ctx->output,
&ctx->build_hdr, sizeof(ctx->build_hdr));
(void)o_stream_seek(ctx->output, ctx->build_hdr.used_file_size);
}
if (o_stream_nfinish(ctx->output) < 0) {
i_error("write() to %s failed: %s", ctx->uidlist->path,
o_stream_get_error(ctx->output));
return -1;
}
return 0;
}
void squat_uidlist_build_deinit(struct squat_uidlist_build_context **_ctx)
{
struct squat_uidlist_build_context *ctx = *_ctx;
*_ctx = NULL;
i_assert(array_count(&ctx->lists) == 0 || ctx->uidlist->corrupted);
i_assert(ctx->uidlist->building);
ctx->uidlist->building = FALSE;
if (ctx->uidlist->file_lock != NULL)
file_unlock(&ctx->uidlist->file_lock);
else
file_dotlock_delete(&ctx->uidlist->dotlock);
if (ctx->need_reopen)
(void)squat_uidlist_open(ctx->uidlist);
array_free(&ctx->block_offsets);
array_free(&ctx->block_end_indexes);
array_free(&ctx->lists);
o_stream_ignore_last_errors(ctx->output);
o_stream_unref(&ctx->output);
i_free(ctx);
}
int squat_uidlist_rebuild_init(struct squat_uidlist_build_context *build_ctx,
bool compress,
struct squat_uidlist_rebuild_context **ctx_r)
{
struct squat_uidlist_rebuild_context *ctx;
struct squat_uidlist_file_header hdr;
const char *temp_path;
int fd;
if (build_ctx->build_hdr.link_count == 0)
return 0;
if (!compress) {
if (build_ctx->build_hdr.link_count <
build_ctx->build_hdr.count*2/3)
return 0;
}
/* make sure the entire uidlist is in memory before beginning,
otherwise the pages are faulted to memory in random order which
takes forever. */
if (squat_uidlist_read_to_memory(build_ctx->uidlist) < 0)
return -1;
temp_path = t_strconcat(build_ctx->uidlist->path, ".tmp", NULL);
fd = squat_trie_create_fd(build_ctx->uidlist->trie, temp_path, O_TRUNC);
if (fd == -1)
return -1;
ctx = i_new(struct squat_uidlist_rebuild_context, 1);
ctx->uidlist = build_ctx->uidlist;
ctx->build_ctx = build_ctx;
ctx->fd = fd;
ctx->output = o_stream_create_fd(ctx->fd, 0);
ctx->next_uid_list_idx = 0x100;
o_stream_cork(ctx->output);
memset(&hdr, 0, sizeof(hdr));
o_stream_nsend(ctx->output, &hdr, sizeof(hdr));
ctx->cur_block_start_offset = ctx->output->offset;
i_array_init(&ctx->new_block_offsets,
build_ctx->build_hdr.count / UIDLIST_BLOCK_LIST_COUNT);
i_array_init(&ctx->new_block_end_indexes,
build_ctx->build_hdr.count / UIDLIST_BLOCK_LIST_COUNT);
*ctx_r = ctx;
return 1;
}
static void
uidlist_rebuild_flush_block(struct squat_uidlist_rebuild_context *ctx)
{
uint8_t buf[SQUAT_PACK_MAX_SIZE], *bufp;
uint32_t block_offset, block_end_idx;
unsigned int i;
ctx->new_count += ctx->list_idx;
block_offset = ctx->output->offset;
block_end_idx = ctx->new_count;
array_append(&ctx->new_block_offsets, &block_offset, 1);
array_append(&ctx->new_block_end_indexes, &block_end_idx, 1);
/* this block's contents started from cur_block_start_offset and
ended to current offset. write the size of this area. */
bufp = buf;
squat_pack_num(&bufp, block_offset - ctx->cur_block_start_offset);
o_stream_nsend(ctx->output, buf, bufp - buf);
/* write the sizes/flags */
for (i = 0; i < ctx->list_idx; i++) {
bufp = buf;
squat_pack_num(&bufp, ctx->list_sizes[i]);
o_stream_nsend(ctx->output, buf, bufp - buf);
}
ctx->cur_block_start_offset = ctx->output->offset;
}
uint32_t squat_uidlist_rebuild_next(struct squat_uidlist_rebuild_context *ctx,
const ARRAY_TYPE(uint32_t) *uids)
{
int ret;
T_BEGIN {
ret = uidlist_write_array(ctx->output, array_idx(uids, 0),
array_count(uids), 0, 0, FALSE,
&ctx->list_sizes[ctx->list_idx]);
} T_END;
if (ret < 0)
squat_uidlist_set_corrupted(ctx->uidlist, "Broken uidlists");
if (++ctx->list_idx == UIDLIST_BLOCK_LIST_COUNT) {
uidlist_rebuild_flush_block(ctx);
ctx->list_idx = 0;
}
return ctx->next_uid_list_idx++ << 1;
}
uint32_t squat_uidlist_rebuild_nextu(struct squat_uidlist_rebuild_context *ctx,
const ARRAY_TYPE(seq_range) *uids)