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
|
/* Copyright (c) 2003-2018 Dovecot authors, see the included COPYING file */
#include "lib.h"
#include "array.h"
#include "bsearch-insert-pos.h"
#include "mail-index-private.h"
uint32_t mail_index_uint32_to_offset(uint32_t offset)
{
i_assert(offset < 0x40000000);
i_assert((offset & 3) == 0);
offset >>= 2;
offset = 0x00000080 | ((offset & 0x0000007f)) |
0x00008000 | ((offset & 0x00003f80) >> 7 << 8) |
0x00800000 | ((offset & 0x001fc000) >> 14 << 16) |
0x80000000 | ((offset & 0x0fe00000) >> 21 << 24);
return cpu32_to_be(offset);
}
uint32_t mail_index_offset_to_uint32(uint32_t offset)
{
offset = be32_to_cpu(offset);
if ((offset & 0x80808080) != 0x80808080)
return 0;
return (((offset & 0x0000007f)) |
((offset & 0x00007f00) >> 8 << 7) |
((offset & 0x007f0000) >> 16 << 14) |
((offset & 0x7f000000) >> 24 << 21)) << 2;
}
void mail_index_pack_num(uint8_t **p, uint32_t num)
{
/* number continues as long as the highest bit is set */
while (num >= 0x80) {
**p = (num & 0x7f) | 0x80;
*p += 1;
num >>= 7;
}
**p = num;
*p += 1;
}
int mail_index_unpack_num(const uint8_t **p, const uint8_t *end,
uint32_t *num_r)
{
const uint8_t *c = *p;
uint32_t value = 0;
unsigned int bits = 0;
for (;;) {
if (unlikely(c == end)) {
/* we should never see EOF */
*num_r = 0;
return -1;
}
value |= (*c & 0x7f) << bits;
if (*c < 0x80)
break;
bits += 7;
c++;
}
if (unlikely(bits >= 32)) {
/* broken input */
*p = end;
*num_r = 0;
return -1;
}
*p = c + 1;
*num_r = value;
return 0;
}
static int mail_index_seq_record_cmp(const uint32_t *key_seq,
const uint32_t *data_seq)
{
return (int)*key_seq - (int)*data_seq;
}
bool mail_index_seq_array_lookup(const ARRAY_TYPE(seq_array) *array,
uint32_t seq, unsigned int *idx_r)
{
return array_bsearch_insert_pos(array, &seq,
mail_index_seq_record_cmp, idx_r);
}
void mail_index_seq_array_alloc(ARRAY_TYPE(seq_array) *array,
size_t record_size)
{
size_t aligned_record_size = (record_size + 3) & ~3U;
i_assert(!array_is_created(array));
array_create(array, default_pool,
sizeof(uint32_t) + aligned_record_size,
1024 / (sizeof(uint32_t) + aligned_record_size));
}
bool mail_index_seq_array_add(ARRAY_TYPE(seq_array) *array, uint32_t seq,
const void *record, size_t record_size,
void *old_record)
{
void *p;
unsigned int idx, aligned_record_size;
/* records need to be 32bit aligned */
aligned_record_size = (record_size + 3) & ~3U;
if (!array_is_created(array))
mail_index_seq_array_alloc(array, record_size);
i_assert(array->arr.element_size == sizeof(seq) + aligned_record_size);
if (mail_index_seq_array_lookup(array, seq, &idx)) {
/* already there, update */
p = array_idx_modifiable(array, idx);
if (old_record != NULL) {
/* save the old record before overwriting it */
memcpy(old_record, PTR_OFFSET(p, sizeof(seq)),
record_size);
}
memcpy(PTR_OFFSET(p, sizeof(seq)), record, record_size);
return TRUE;
} else {
/* insert */
p = array_insert_space(array, idx);
memcpy(p, &seq, sizeof(seq));
memcpy(PTR_OFFSET(p, sizeof(seq)), record, record_size);
return FALSE;
}
}
|
