Lines Matching refs:seq
19 uint32_t seq:29;
97 if (n1->seq < n2->seq)
99 if (n1->seq > n2->seq)
108 uint32_t seq;
120 if (nodes[i].seq < nodes2[j].seq)
121 seq = nodes[i++].seq;
123 seq = nodes2[j++].seq;
125 seq = nodes[i++].seq;
127 seq = nodes2[j++].seq;
131 array_append(&ctx->program->seqs, &seq, 1);
152 node.seq = seqs[i];
166 mail_index_lookup_ext_full(ctx->program->t->view, node->seq,
182 if (ctx->lowest_nonexpunged_zero > node->seq ||
184 ctx->lowest_nonexpunged_zero = node->seq;
186 ctx->lowest_nonexpunged_zero <= node->seq) {
190 node->seq, &nonzero_uid);
229 if (ctx->last_seq < node->seq)
230 ctx->last_seq = node->seq;
240 node.seq = mail->seq;
243 if (mail->seq < ctx->prev_seq)
245 ctx->prev_seq = mail->seq;
256 ret = strcmp(ctx->sort_strings[n1->seq], ctx->sort_strings[n2->seq]);
262 n1->seq, n2->seq);
282 i_assert(nodes[i].seq <= ctx->last_seq);
285 if (index_sort_header_get(ctx->program, nodes[i].seq,
290 ctx->sort_strings[nodes[i].seq] =
321 ctx->sort_strings[nodes[idx].seq] != NULL) {
322 *result_r = ctx->sort_strings[nodes[idx].seq];
333 if (ctx->sort_strings[nodes[i].seq] != NULL) {
337 result = ctx->sort_strings[nodes[i].seq];
340 if (index_sort_header_get(ctx->program, nodes[i].seq,
355 ctx->sort_strings[nodes[i].seq] = result;
365 uint32_t seq = node->seq;
370 *str_r = ctx->sort_strings[seq];
374 if (ctx->sort_strings[seq] == NULL) T_BEGIN {
379 ret = index_sort_header_get(ctx->program, seq,
385 ctx->sort_strings[seq] = "";
388 ctx->sort_strings[seq] = result;
392 ctx->sort_strings[seq] = str_len(str) == 0 ? "" :
399 *str_r = ctx->sort_strings[seq];
483 zstr = ctx->sort_strings[znodes[zpos].seq];
502 znodes[zpos].seq, nznodes[nzpos].seq);
664 nodes[i].seq, &str_uid);
666 nodes[left_str_idx].seq, &left_str_uid);
668 "(idx=%u, seq=%u, uid=%u) '%s' < left string (idx=%u, seq=%u, uid=%u) '%s'",
669 i, nodes[i].seq, str_uid, str,
670 left_str_idx, nodes[left_str_idx].seq, left_str_uid, left_str);
689 nodes[i].seq, &uid);
768 uint32_t seq = nodes[i].seq;
770 if (nodes[i].no_update && lowest_failed_seq > seq &&
771 !mail_index_is_expunged(ctx->program->t->view, seq))
772 lowest_failed_seq = seq;
781 nodes[i].seq >= lowest_failed_seq)
784 mail_index_update_ext(itrans, nodes[i].seq, ext_id,
801 n1->seq, n2->seq);
809 uint32_t seq, next_seq;
819 for (seq = next_seq; seq < seqs[i]; seq++) {
821 node.seq = seq;
859 uint32_t seq;
873 seq = nodes[i].seq;
874 array_append(&program->seqs, &seq, 1);
928 seq = nodes[i].seq;
929 array_append(&program->seqs, &seq, 1);