Searched defs:seq1 (Results 1 - 25 of 41) sorted by relevance

12

/dovecot/src/lib-imap/
H A Dimap-seqset.c32 uint32_t seq1, seq2; local
36 seq1 = (uint32_t)-1;
39 seq1 = get_next_number(str);
40 if (seq1 == 0)
45 seq2 = seq1;
60 if (seq1 > seq2) {
63 *seq2_r = seq1;
65 *seq1_r = seq1;
73 uint32_t seq1, seq2; local
76 if (get_next_seq_range(&str, &seq1,
[all...]
/dovecot/src/lib-storage/
H A Dmailbox-recent-flags.c32 uint32_t seq1, uint32_t seq2)
36 for (; seq1 <= seq2; seq1++) {
37 mail_index_lookup_uid(view, seq1, &uid);
73 if (range[i].seq1 >= hdr->next_uid) {
75 recent_count -= range[i].seq2 - range[i].seq1 + 1;
86 uint32_t seq1, uint32_t seq2)
93 for (; seq1 <= seq2; seq1++) {
94 mail_index_lookup_uid(box->view, seq1,
30 mailbox_recent_flags_set_seqs(struct mailbox *box, struct mail_index_view *view, uint32_t seq1, uint32_t seq2) argument
85 mailbox_recent_flags_expunge_seqs(struct mailbox *box, uint32_t seq1, uint32_t seq2) argument
[all...]
H A Dmail-search-build.c212 uint32_t seq1, uint32_t seq2)
219 seq_range_array_add_range(&arg->value.seqset, seq1, seq2);
211 mail_search_build_add_seqset(struct mail_search_args *args, uint32_t seq1, uint32_t seq2) argument
H A Dmail-search.c19 uint32_t seq1, seq2; local
46 mailbox_get_seq_range(box, uids[i].seq1, uids[i].seq2,
47 &seq1, &seq2);
48 if (seq1 != 0) {
50 seq1, seq2);
55 &seq1, &seq2);
/dovecot/src/lib/
H A Dseq-range-array.h5 uint32_t seq1, seq2; member in struct:seq_range
16 i_assert(range->seq2 >= range->seq1);
17 return range->seq2 - range->seq1 + 1;
29 uint32_t seq1, uint32_t seq2); variable
31 uint32_t seq1, uint32_t seq2); variable
40 uint32_t seq1, uint32_t seq2); variable
H A Dseq-range-array.c21 if (data[idx].seq1 <= seq) {
43 value.seq1 = value.seq2 = seq;
61 if (data[0].seq1 > seq) {
62 if (data[0].seq1-1 == seq) {
64 data[0].seq1 = seq;
77 i_assert(idx < count && data[idx].seq1 >= seq);
78 i_assert(data[idx].seq1 > seq || data[idx].seq2 < seq);
80 if (data[idx].seq1 == seq+1) {
81 data[idx].seq1 = seq;
93 if (data[idx+1].seq1
347 uint32_t seq1, seq2; local
[all...]
H A Dtest-seq-range-array.c30 test_assert(seqs[0].seq1 == 0);
32 test_assert(seqs[1].seq1 == (uint32_t)-2);
74 r = array_idx(&range, 0); test_assert(r->seq1 == 3 && r->seq2 == 5);
77 r = array_idx(&range, 0); test_assert(r->seq1 == 3 && r->seq2 == 3);
78 r = array_idx(&range, 1); test_assert(r->seq1 == 11 && r->seq2 == 20);
81 r = array_idx(&range, 1); test_assert(r->seq1 == 11 && r->seq2 == 14);
94 uint32_t seq1, seq2; local
102 seq1 = i_rand() % SEQ_RANGE_TEST_BUFSIZE;
103 seq2 = seq1 + i_rand() % (SEQ_RANGE_TEST_BUFSIZE - seq1);
[all...]
/dovecot/src/lib-storage/index/cydir/
H A Dcydir-sync.c30 cydir_sync_expunge(struct cydir_sync_context *ctx, uint32_t seq1, uint32_t seq2) argument
40 for (; seq1 <= seq2; seq1++) {
41 mail_index_lookup_uid(ctx->sync_view, seq1, &uid);
52 mail_index_expunge(ctx->trans, seq1);
62 uint32_t seq1, seq2; local
72 hdr->next_uid, &seq1, &seq2)) {
74 seq1, seq2);
80 &seq1, &seq2)) {
87 cydir_sync_expunge(ctx, seq1, seq
[all...]
/dovecot/src/lib-storage/index/
H A Dindex-search-private.h21 uint32_t seq1, seq2; member in struct:index_search_context
H A Dindex-sync-changes.c95 uint32_t seq1, seq2; local
132 &seq1, &seq2);
135 if (seq1 == 0)
139 seq1, seq2, MODIFY_ADD,
H A Dindex-mailbox-size.c86 uint32_t seq1, seq2; local
92 &seq1, &seq2))
270 uint32_t seq1, seq2; local
288 status.uidnext-1, &seq1, &seq2)) {
294 mail_search_build_add_seqset(search_args, seq1, seq2);
H A Dindex-sync-pvt.c295 uint32_t seq1, seq2; local
312 &seq1, &seq2)) {
315 seq1, seq2);
318 seq1, seq2);
H A Dindex-sync.c59 uint32_t seq1, seq2; local
70 &seq1, &seq2))
76 seq1, seq2);
79 seq1, seq2);
172 mailbox_recent_flags_expunge_seqs(ctx->ctx.box, range->seq1, range->seq2);
173 ctx->messages_count -= range->seq2 - range->seq1 + 1;
175 sync_rec_r->seq1 = range->seq1;
195 sync_rec_r->seq1 = range[ctx->flag_update_idx].seq1;
279 uint32_t seq1, seq2; local
[all...]
H A Dindex-sort.c545 uint32_t seq1, uint32_t seq2)
567 if (index_sort_header_get(program, seq1, sort_type, str1) < 0)
576 index_sort_set_seq(program, mail, seq1);
588 index_sort_set_seq(program, mail, seq1);
608 index_sort_set_seq(program, mail, seq1);
624 index_sort_set_seq(program, mail, seq1);
639 index_sort_set_seq(program, mail, seq1);
650 return seq1 < seq2 ? -1 :
651 (seq1 > seq2 ? 1 : 0);
659 seq1, seq
543 index_sort_node_cmp_type(struct mail_search_sort_program *program, const enum mail_sort_type *sort_program, uint32_t seq1, uint32_t seq2) argument
[all...]
/dovecot/src/lib-storage/index/dbox-multi/
H A Dmdbox-sync.c70 uint32_t seq, seq1, seq2; local
79 &seq1, &seq2)) {
84 for (seq = seq1; seq <= seq2; seq++) {
133 uint32_t seq1, seq2; local
153 hdr->next_uid, &seq1, &seq2)) {
155 seq1, seq2);
/dovecot/src/lib-index/
H A Dmail-index-sync-keywords.c212 uint32_t seq1, seq2; local
216 if (!mail_index_lookup_seq_range(view, uid1, uid2, &seq1, &seq2))
220 seq1, seq2);
232 for (; seq1 <= seq2; seq1++) {
233 rec = MAIL_INDEX_REC_AT_SEQ(view->map, seq1);
240 for (; seq1 <= seq2; seq1++) {
241 rec = MAIL_INDEX_REC_AT_SEQ(view->map, seq1);
325 uint32_t ext_map_idx, seq1, seq local
[all...]
H A Dmail-index-transaction-finish.c93 update.uid1 == keep_range[0].seq1 &&
103 update.uid1 = keep_range[i].seq1;
211 uint32_t uid1, uint32_t seq1)
213 seq1++;
215 while (mail_index_transaction_get_uid(t, seq1) == uid1 + 1) {
216 seq1++;
236 uid1 = mail_index_transaction_get_uid(t, range->seq1);
239 if (uid2 - uid1 == range->seq2 - range->seq1) {
241 range->seq1 = uid1;
251 new_range->seq1
210 get_nonexpunged_uid2(struct mail_index_transaction *t, uint32_t uid1, uint32_t seq1) argument
[all...]
H A Dtest-mail-index-transaction-update.c109 test_assert(saved_uids[0].seq1 == 123 && saved_uids[0].seq2 == 124);
140 test_assert(saved_uids[0].seq1 == 129 && saved_uids[0].seq2 == 129);
141 test_assert(saved_uids[1].seq1 == 126 && saved_uids[1].seq2 == 126);
142 test_assert(saved_uids[2].seq1 == 130 && saved_uids[2].seq2 == 131);
143 test_assert(saved_uids[3].seq1 == 128 && saved_uids[3].seq2 == 128);
336 unsigned int r, seq1, seq2, seq; local
348 seq1 = i_rand_minmax(1, hdr.messages_count);
349 seq2 = seq1 == hdr.messages_count ? seq1 :
350 i_rand_minmax(seq1, hd
[all...]
/dovecot/src/lib-storage/index/dbox-single/
H A Dsdbox-sync.c70 uint32_t seq, seq1, seq2; local
90 &seq1, &seq2)) {
95 for (seq = seq1; seq <= seq2; seq++) {
106 uint32_t seq1, seq2; local
127 hdr->next_uid, &seq1, &seq2))
128 mailbox_recent_flags_set_seqs(box, ctx->sync_view, seq1, seq2);
/dovecot/src/lib-storage/index/pop3c/
H A Dpop3c-sync.c190 uint32_t seq1, seq2, next_uid; local
265 hdr->next_uid, &seq1, &seq2))
266 mailbox_recent_flags_set_seqs(&mbox->box, sync_view, seq1, seq2);
/dovecot/src/plugins/fts/
H A Dfts-indexer.c97 uint32_t last_uid, seq1, seq2; local
110 mailbox_get_seq_range(box, last_uid+1, (uint32_t)-1, &seq1, &seq2);
111 if (seq1 == 0) {
H A Dfts-search.c20 uint32_t seq1, seq2; local
26 if (range[i].seq1 > range[i].seq2)
28 mailbox_get_seq_range(fctx->box, range[i].seq1, range[i].seq2,
29 &seq1, &seq2);
30 if (seq1 != 0)
31 seq_range_array_add_range(seq_range, seq1, seq2);
341 uint32_t last_uid, seq1, seq2; local
351 &seq1, &seq2);
352 fctx->first_unindexed_seq = seq1 != 0 ? seq1
[all...]
/dovecot/src/indexer/
H A Dmaster-connection.c38 uint32_t seq1, uint32_t seq2)
45 else if (seq1 == 0)
49 username, mailbox, seq1, seq2));
37 indexer_worker_refresh_proctitle(const char *username, const char *mailbox, uint32_t seq1, uint32_t seq2) argument
/dovecot/src/lib-storage/index/imapc/
H A Dimapc-sync.c181 uint32_t seq1, uint32_t seq2)
188 for (seq = seq1; seq <= seq2; seq++) {
195 mail_index_lookup_uid(ctx->sync_view, seq1, &uid1);
377 uint32_t seq1, seq2; local
386 &seq1, &seq2)) {
390 imapc_sync_add_missing_deleted_flags(ctx, seq1, seq2);
180 imapc_sync_add_missing_deleted_flags(struct imapc_sync_context *ctx, uint32_t seq1, uint32_t seq2) argument
/dovecot/src/imap/
H A Dimap-sync.c21 uint32_t seq1, seq2; local
25 mailbox_get_seq_range(box, range->seq1, range->seq2,
26 &seq1, &seq2);
29 i_assert(seq1 != 0);
30 i_assert(seq2 - seq1 == range->seq2 - range->seq1);
32 seq_range_array_add_range(&seqs, seq1, seq2);
431 for (seq = seqs[i].seq1; seq <= seqs[i].seq2; seq++) {
473 ctx->sync_rec.seq1,
479 for (; ctx->seq >= ctx->sync_rec.seq1; ct
[all...]

Completed in 30 milliseconds

12