seq-range-array.c revision c47e837a127c533e67debafde8ccf9691041be16
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen/* Copyright (c) 2005-2007 Dovecot authors, see the included COPYING file */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainenstatic bool seq_range_lookup(const ARRAY_TYPE(seq_range) *array,
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* it's already in the range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainenvoid seq_range_array_add(ARRAY_TYPE(seq_range) *array,
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* quick checks */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* grow last range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* grow down first range */
7000810786f2959f02cd6d2f4151a9eb61ff5db8Timo Sirainen /* somewhere in the middle, array is sorted so find it with
7000810786f2959f02cd6d2f4151a9eb61ff5db8Timo Sirainen binary search */
7000810786f2959f02cd6d2f4151a9eb61ff5db8Timo Sirainen /* idx == count couldn't happen because we already handle it above */
7000810786f2959f02cd6d2f4151a9eb61ff5db8Timo Sirainen i_assert(idx < count && data[idx].seq1 >= seq);
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen i_assert(data[idx].seq1 > seq || data[idx].seq2 < seq);
7000810786f2959f02cd6d2f4151a9eb61ff5db8Timo Sirainen i_assert(idx+1 < count); /* already handled above */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainenbool seq_range_array_remove(ARRAY_TYPE(seq_range) *array, uint32_t seq)
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* quick checks */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen if (seq > data[count-1].seq2 || seq < data[0].seq1) {
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* outside the range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* shrink last range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* shrink up first range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* somewhere in the middle, array is sorted so find it with
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen binary search */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* found it */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* a single sequence range.
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen remove it entirely */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* shrink the range */
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen /* shrink the range */
fb79b36eb34532dbe67caf99eefe3660b8c841e0Timo Sirainen /* split the sequence range */
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainenunsigned int seq_range_array_remove_range(ARRAY_TYPE(seq_range) *array,
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen unsigned int idx, idx2, count, remove_count = 0;
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen /* remove first and last. this makes sure that everything between
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen can simply be deleted with array_delete().
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen FIXME: it would be faster if we did only one binary lookup here
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen and handled the splitting ourself.. */
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen /* find the beginning */
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen remove_count += data[idx2].seq2 - data[idx2].seq1 + 1;
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainenunsigned int seq_range_array_remove_seq_range(ARRAY_TYPE(seq_range) *dest,
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen unsigned int ret = 0;
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen unsigned int i, count;
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen for (i = 0; i < count; i++) {
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen ret += seq_range_array_remove_range(dest, src_range[i].seq1,
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainenseq_range_array_remove_invert_range(ARRAY_TYPE(seq_range) *dest,
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen for (i = 0; i < count; i++) {
d6a7cb184cc882a90aa3d9312082e0029f354ff6Timo Sirainen ret += seq_range_array_remove_range(dest, last_seq + 1,
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen ret += seq_range_array_remove_range(dest, last_seq + 1,
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainenbool seq_range_exists(const ARRAY_TYPE(seq_range) *array, uint32_t seq)
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen unsigned int idx;
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainenvoid seq_range_array_invert(ARRAY_TYPE(seq_range) *array,
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen unsigned int i, count;
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen /* empty -> full */
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen if (range[0].seq1 == min_seq && range[0].seq2 == max_seq) {
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen /* full -> empty */
f8740ac53310cd28ba4ec6dc9e9ce6e9a3688f39Timo Sirainen for (i = 0; i < count; ) {