Searched defs:uid2 (Results 1 - 11 of 11) sorted by relevance

/dovecot/src/lib-index/
H A Dmail-index-sync-private.h8 uint32_t uid1, uid2; member in struct:uid_range
H A Dmail-index-sync-keywords.c206 uint32_t uid1, uint32_t uid2)
216 if (!mail_index_lookup_seq_range(view, uid1, uid2, &seq1, &seq2))
336 if (!mail_index_lookup_seq_range(ctx->view, r->uid1, r->uid2,
203 keywords_update_records(struct mail_index_sync_map_ctx *ctx, const struct mail_index_ext *ext, unsigned int keyword_idx, enum modify_type type, uint32_t uid1, uint32_t uid2) argument
H A Dmail-index-transaction-finish.c94 update.uid2 == keep_range[0].seq2) {
104 update.uid2 = keep_range[i].seq2;
128 for (seq = u->uid1; seq <= u->uid2; seq++) {
227 uint32_t uid1, uid2, prev_uid = 0; local
237 uid2 = mail_index_transaction_get_uid(t, range->seq2);
239 if (uid2 - uid1 == range->seq2 - range->seq1) {
242 range->seq2 = uid2;
243 prev_uid = uid2;
254 i_assert(new_range->seq2 < uid2);
H A Dmail-index-transaction-private.h34 uint32_t uid1, uid2; member in struct:mail_index_flag_update
144 uid1..uid2 are actually sequences within the transaction view. This function
H A Dmail-transaction-log.h95 uint32_t uid1, uid2; member in struct:mail_transaction_expunge
103 uint32_t uid1, uid2; member in struct:mail_transaction_flag_update
115 array of { uint32_t uid1, uid2; }
120 uint32_t uid1, uid2; member in struct:mail_transaction_keyword_reset
H A Dmail-index.h201 uint32_t uid1, uid2; member in struct:mail_index_sync_rec
222 uint32_t uid1, uid2; member in struct:mail_index_view_sync_rec
/dovecot/src/lib-storage/
H A Dmailbox-get.c8 void mailbox_get_seq_range(struct mailbox *box, uint32_t uid1, uint32_t uid2, argument
11 (void)mail_index_lookup_seq_range(box->view, uid1, uid2, seq1_r, seq2_r);
45 if (src->uid2 >= min_uid) {
47 src->uid1, src->uid2);
/dovecot/src/lib-storage/index/imapc/
H A Dimapc-sync.c131 enum modify_type modify_type, uint32_t uid1, uint32_t uid2,
140 if (ctx->prev_uid1 != uid1 || ctx->prev_uid2 != uid2 ||
144 ctx->prev_uid2 = uid2;
184 uint32_t seq, uid1, uid2; local
196 mail_index_lookup_uid(ctx->sync_view, seq2, &uid2);
198 imapc_sync_store(ctx, MODIFY_ADD, uid1, uid2, "\\Deleted");
214 sync_rec->uid2, str_c(str));
222 sync_rec->uid2, str_c(str));
246 sync_rec->uid2, *kw_p);
385 sync_rec.uid1, sync_rec.uid2,
130 imapc_sync_store(struct imapc_sync_context *ctx, enum modify_type modify_type, uint32_t uid1, uint32_t uid2, const char *flags) argument
[all...]
/dovecot/src/imap/
H A Dimap-state.c71 uint32_t i, count, next_uid, num, uid1, uid2; local
82 uid2 = uid1;
87 uid2 = uid1 + num + 1;
88 seq_range_array_add_range(range, uid1, uid2);
90 next_uid = uid2 + 1;
/dovecot/src/plugins/fts-squat/
H A Dsquat-uidlist.c117 uint32_t uid, uid2, prev, base_uid, size_value; local
156 uid2 = uid;
160 uid2 = uid_list[i+1] - base_uid;
164 if (uid2 - uid < 3*8) {
165 for (; uid <= uid2; uid++)
179 num = uid2 % 8;
180 max_idx = idx + (uid2 - num - uid)/8;
1259 uint32_t uid1, uint32_t uid2)
1264 i_assert(uid1 < uid2);
1270 array_append(uids, &uid2,
[all...]
/dovecot/src/plugins/virtual/
H A Dvirtual-sync.c378 sync_rec->uid1, sync_rec->uid2,
1013 uint32_t uid1, uid2; local
1016 mail_index_lookup_uid(bbox->box->view, sync_rec->seq2, &uid2);
1022 if (idx == count || uidmap[idx].real_uid > uid2)
1026 while (idx < count && uidmap[idx].real_uid <= uid2) idx++;
1036 uint32_t uid1, uid2; local
1040 mail_index_lookup_uid(bbox->box->view, sync_rec->seq2, &uid2);
1049 if (uidmap[i].real_uid > uid2)

Completed in 23 milliseconds