Searched refs:uid1 (Results 1 - 25 of 31) sorted by relevance

12

/dovecot/src/lib-index/
H A Dmail-index-transaction-finish.c93 update.uid1 == keep_range[0].seq1 &&
103 update.uid1 = keep_range[i].seq1;
128 for (seq = u->uid1; seq <= u->uid2; seq++) {
211 uint32_t uid1, uint32_t seq1)
215 while (mail_index_transaction_get_uid(t, seq1) == uid1 + 1) {
217 uid1++;
219 return uid1;
227 uint32_t uid1, uid2, prev_uid = 0; local
236 uid1 = mail_index_transaction_get_uid(t, range->seq1);
238 i_assert(uid1 > prev_ui
210 get_nonexpunged_uid2(struct mail_index_transaction *t, uint32_t uid1, uint32_t seq1) argument
[all...]
H A Dtest-mail-transaction-log-file.c37 { .uid1 = 1, .uid2 = 2, .add_flags = 0 }
42 { .uid1 = 1, .uid2 = 2, .add_flags = MAIL_INDEX_MAIL_FLAG_BACKEND }
47 { .uid1 = 1, .uid2 = 2, .remove_flags = MAIL_INDEX_MAIL_FLAG_BACKEND }
52 { .uid1 = 1, .uid2 = 2, .add_flags = MAIL_INDEX_MAIL_FLAG_DIRTY }
57 { .uid1 = 1, .uid2 = 2, .remove_flags = MAIL_INDEX_MAIL_FLAG_DIRTY }
63 { .uid1 = 1, .uid2 = 2, .add_flags = MAIL_SEEN }
68 { .uid1 = 1, .uid2 = 2, .remove_flags = MAIL_SEEN }
73 { .uid1 = 1, .uid2 = 2, .add_flags = MAIL_SEEN | MAIL_INDEX_MAIL_FLAG_BACKEND }
78 { .uid1 = 1, .uid2 = 2, .add_flags = MAIL_SEEN | MAIL_INDEX_MAIL_FLAG_DIRTY }
83 { .uid1
[all...]
H A Dtest-mail-index-transaction-finish.c82 u.uid1 = 1; u.uid2 = 2;
84 u.uid1 = 4; u.uid2 = 5;
90 test_assert(updates[0].uid1 == 1*2 && updates[0].uid2 == 1*2);
91 test_assert(updates[1].uid1 == 2*2 && updates[1].uid2 == 2*2);
92 test_assert(updates[2].uid1 == 4*2 && updates[2].uid2 == 4*2);
93 test_assert(updates[3].uid1 == 5*2 && updates[3].uid2 == 5*2);
97 u.uid1 = 1; u.uid2 = 2;
99 u.uid1 = 4; u.uid2 = 5;
110 u.uid1 = 2; u.uid2 = 3;
112 u.uid1
[all...]
H A Dmail-index-transaction-update.c426 else if (updates[idx].uid1 > seq)
447 i_assert(idx == 0 || updates[idx-1].uid2 < u.uid1);
448 i_assert(idx == count || updates[idx].uid2 >= u.uid1);
452 for (; idx < count && u.uid2 >= updates[idx].uid1; idx++) {
453 i_assert(u.uid1 <= updates[idx].uid2);
454 if (u.uid1 != updates[idx].uid1 &&
457 if (u.uid1 < updates[idx].uid1) {
460 tmp_update.uid2 = updates[idx].uid1
[all...]
H A Dtest-mail-index-transaction-update.c184 test_assert(updates[0].uid1 == 13);
189 test_assert(updates[1].uid1 == 16);
226 test_assert(updates[0].uid1 == 4);
237 test_assert(updates[0].uid1 == 4);
270 test_assert(updates[0].uid1 == 3);
274 test_assert(updates[1].uid1 == 5);
278 test_assert(updates[2].uid1 == 6);
282 test_assert(updates[3].uid1 == 7);
286 test_assert(updates[4].uid1 == 8);
290 test_assert(updates[5].uid1
[all...]
H A Dmail-index-sync-private.h8 uint32_t uid1, uid2; member in struct:uid_range
H A Dmail-index-sync.c39 for (uid = e[i].uid1; uid <= e[i].uid2; uid++)
63 u[i].uid1, u[i].uid2,
69 u[i].uid1, u[i].uid2,
117 for (uid = u[i].uid1; uid <= u[i].uid2; uid++) {
620 rec->uid1 = exp->uid;
630 rec->uid1 = update->uid1;
645 rec->uid1 = range->uid1;
674 if (uid_range->uid1
[all...]
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-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-view-sync.c356 flag_update.uid1 = flag_update.uid2 = new_rec->uid;
375 kw_reset.uid1 = kw_reset.uid2 = new_rec->uid;
799 rec->uid1 = update->uid1;
808 the keyword name and an array of { uint32_t uid1, uid2; } */
819 rec->uid1 = uids[0];
831 rec->uid1 = reset->uid1;
859 sync_rec->uid1 = range[ctx->lost_flag_idx].seq1;
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-index-transaction-export.c39 log_update->uid1 = updates[i].uid1;
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/index/
H A Dindex-sync-changes.c59 i_assert(last_uid >= syncs[src].uid1);
103 while (uid >= sync_rec->uid1) {
130 sync_rec->uid1,
160 return ctx->sync_rec.uid1;
/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 ||
143 ctx->prev_uid1 = uid1;
184 uint32_t seq, uid1, uid2; local
195 mail_index_lookup_uid(ctx->sync_view, seq1, &uid1);
198 imapc_sync_store(ctx, MODIFY_ADD, uid1, uid2, "\\Deleted");
213 imapc_sync_store(ctx, MODIFY_ADD, sync_rec->uid1,
221 imapc_sync_store(ctx, MODIFY_REMOVE, sync_rec->uid1,
245 imapc_sync_store(ctx, modify_type, sync_rec->uid1,
385 sync_rec.uid1, sync_re
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/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);
47 src->uid1, src->uid2);
H A Dtest-mailbox-get.c69 old_exp.uid1 = old_exp.uid2 = expunge_uids[expunge_idx];
/dovecot/src/lib-storage/index/cydir/
H A Dcydir-sync.c79 sync_rec.uid1, sync_rec.uid2,
/dovecot/src/doveadm/dsync/
H A Ddsync-transaction-log-scan.c78 for (uid = rec->uid1; uid <= rec->uid2; uid++) {
99 if (uid >= rec->uid1 && uid <= rec->uid2) {
175 for (uid = rec->uid1; uid <= rec->uid2; uid++) {
198 for (uid = rec->uid1; uid <= rec->uid2; uid++) {
/dovecot/src/lib-storage/index/pop3c/
H A Dpop3c-sync.c311 if (!bsearch_insert_pos(&sync_rec.uid1, mbox->msg_uids,
318 i_assert(mbox->msg_uids[idx] >= sync_rec.uid1);
/dovecot/src/imap/
H A Dimap-state.c71 uint32_t i, count, next_uid, num, uid1, uid2; local
80 uid1 = next_uid + (num >> 1);
82 uid2 = uid1;
83 seq_range_array_add(range, uid1);
87 uid2 = uid1 + num + 1;
88 seq_range_array_add_range(range, uid1, uid2);
/dovecot/src/plugins/fts-squat/
H A Dsquat-uidlist.c999 uint32_t seq, uid1, ret; local
1027 uid1 = range[i].seq1 | UID_LIST_MASK_RANGE;
1028 array_append(&tmp_uids, &uid1, 1);
1259 uint32_t uid1, uint32_t uid2)
1264 i_assert(uid1 < uid2);
1268 uid1 |= UID_LIST_MASK_RANGE;
1269 array_append(uids, &uid1, 1);
1273 if (uidlist[count-1] + 1 == uid1) {
1281 uid1 |= UID_LIST_MASK_RANGE;
1282 array_append(uids, &uid1,
[all...]
/dovecot/src/doveadm/
H A Ddoveadm-dump-log.c252 printf("%u-%u,", exp->uid1, exp->uid2);
285 u->uid1, u->uid2, u->add_flags, u->remove_flags, u->modseq_inc_flag);
403 printf("%u-%u, ", u->uid1, u->uid2);
/dovecot/src/plugins/virtual/
H A Dvirtual-sync.c378 sync_rec->uid1, sync_rec->uid2,
1013 uint32_t uid1, uid2; local
1015 mail_index_lookup_uid(bbox->box->view, sync_rec->seq1, &uid1);
1017 (void)array_bsearch_insert_pos(&bbox->uids, &uid1,
1036 uint32_t uid1, uid2; local
1039 mail_index_lookup_uid(bbox->box->view, sync_rec->seq1, &uid1);
1044 (void)array_bsearch_insert_pos(&bbox->uids, &uid1,
/dovecot/src/lib-storage/index/dbox-multi/
H A Dmdbox-sync.c78 sync_rec->uid1, sync_rec->uid2,

Completed in 49 milliseconds

12