Searched refs:num (Results 1 - 25 of 57) sorted by relevance

123

/dovecot/src/lib/
H A Dtest-primes.c8 unsigned int i, j, num; local
12 for (num = 1; num < 1024; num++) {
13 if (primes_closest(num) < num)
17 num = (1U << i) - 100;
18 for (j = 0; j < 200; j++, num++) {
19 if (primes_closest(num) < num)
[all...]
H A Dbits.c15 size_t nearest_power(size_t num) argument
17 i_assert(num <= ((size_t)1 << (CHAR_BIT*sizeof(size_t) - 1)));
19 if (num == 0)
22 return 1UL << BITS_REQUIRED(num - 1);
28 unsigned int bits_required8(uint8_t num) argument
31 if (num > 0xf) { ret += 4; num >>= 4; }
32 if (num > 0x3) { ret += 2; num >>= 2; }
33 num
[all...]
H A Dprimes.h6 unsigned int primes_closest(unsigned int num) ATTR_CONST;
H A Dbits.h9 /* Returns x, such that x is the smallest power of 2 >= num. */
10 size_t nearest_power(size_t num) ATTR_CONST;
12 /* Returns TRUE if 2^x=num, i.e. if num has only a single bit set to 1. */
14 bits_is_power_of_two(uint64_t num) argument
16 return num > 0 && (num & (num - 1)) == 0;
21 bits_required32(uint32_t num) argument
23 return num
26 bits_required8(uint8_t num) argument
29 bits_required16(uint16_t num) argument
32 bits_required64(uint64_t num) argument
40 bits_required16(uint16_t num) argument
46 bits_required32(uint32_t num) argument
52 bits_required64(uint64_t num) argument
60 bits_rotl64(uint64_t num, unsigned int count) argument
68 bits_rotl32(uint32_t num, unsigned int count) argument
76 bits_rotr64(uint64_t num, unsigned int count) argument
84 bits_rotr32(uint32_t num, unsigned int count) argument
[all...]
H A Dnumpack.c7 void numpack_encode(buffer_t *buf, uint64_t num) argument
10 while (num >= 0x80) {
11 buffer_append_c(buf, (num & 0x7f) | 0x80);
12 num >>= 7;
15 buffer_append_c(buf, num);
47 uint64_t num; local
49 if (numpack_decode(p, end, &num) < 0)
51 if (num > 4294967295U)
54 *num_r = (uint32_t)num;
H A Dprimes.c39 unsigned int primes_closest(unsigned int num) argument
44 if ((num & (1U << i)) != 0)
H A Dtest-priorityq.c9 int num; member in struct:pq_test_item
16 return i1->num - i2->num;
48 item->num = input[i];
54 test_assert(item->num == output[0]);
57 test_assert(item->num > output[0]);
58 test_assert(item->num <= output[N_ELEMENTS(output)-1]);
65 test_assert(output[j] == item->num);
68 test_assert(output[j] == item->num);
82 items[j].num
[all...]
H A Dtest-imem.c6 uint32_t num[10]; member in struct:test_struct
15 memset(ab.num, 0xab, sizeof(ab.num));
16 memset(bc.num, 0xbc, sizeof(bc.num));
17 memset(cd.num, 0xcd, sizeof(cd.num));
18 memset(de.num, 0xde, sizeof(de.num));
H A Dtest-bits.c19 /* nearest_power(num) == 1ULL << bits_required64(num-1) */
23 size_t num; local
29 num = (size_t)1 << b;
30 test_assert_idx(nearest_power(num-1) == num, b);
31 test_assert_idx(nearest_power(num ) == num, b);
32 test_assert_idx(nearest_power(num+1) == num<<
69 uint64_t num = 1ULL << b; local
[all...]
H A Dnumpack.h7 void numpack_encode(buffer_t *buf, uint64_t num);
H A Dtest-numpack.c38 uint64_t num; local
51 test_assert_idx(numpack_decode(&p, end, &num) == 0, i);
52 test_assert_idx(num == enc_tests[i].input, i);
59 num = magic;
60 test_assert_idx(numpack_decode(&p, end, &num) == -1, i);
61 test_assert_idx(p == dec_fails[i].input && num == magic, i);
/dovecot/src/lib-imap/
H A Dimap-seqset.c8 uint32_t num; local
10 num = 0;
15 num = num*10 + (**str - '0');
19 if (num == (uint32_t)-1) {
23 num--;
26 return num;
/dovecot/src/lib-index/
H A Dmail-index-util.c35 void mail_index_pack_num(uint8_t **p, uint32_t num) argument
38 while (num >= 0x80) {
39 **p = (num & 0x7f) | 0x80;
41 num >>= 7;
44 **p = num;
H A Dmail-index-util.h10 void mail_index_pack_num(uint8_t **p, uint32_t num);
/dovecot/src/plugins/fts-squat/
H A Dsquat-trie-private.h146 static inline void squat_pack_num(uint8_t **p, uint32_t num) argument
149 while (num >= 0x80) {
150 **p = (num & 0x7f) | 0x80;
152 num >>= 7;
155 **p = num;
H A Dsquat-uidlist.c121 int num; local
170 num = uid % 8;
171 if (num != 0) {
172 uid += 8 - num;
173 for (mask = 0; num < 8; num++)
174 mask |= 1 << num;
179 num = uid2 % 8;
180 max_idx = idx + (uid2 - num - uid)/8;
185 for (mask = 0; num >
1288 squat_uidlist_get_at_offset(struct squat_uidlist *uidlist, uoff_t offset, uint32_t num, ARRAY_TYPE(uint32_t) *uids) argument
1393 uint32_t num, skip_bytes, uidlists_offset; local
1453 uint32_t uid, offset, num; local
[all...]
/dovecot/src/lib-storage/index/pop3c/
H A Dpop3c-settings.c53 enum pop3c_features num; member in struct:pop3c_feature_list
74 features |= list->num;
/dovecot/src/lib-mail/
H A Dmessage-header-decode.c16 unsigned int num = 0; local
22 start_pos[num++] = i;
23 if (num == QCOUNT)
/dovecot/src/lib-storage/index/imapc/
H A Dimapc-settings.c88 enum imapc_features num; member in struct:imapc_feature_list
141 features |= list->num;
/dovecot/src/lib-settings/
H A Dsettings.c45 int num; local
47 if (sscanf(value, "%i", &num) != 1 || num < 0)
49 *result = num;
/dovecot/src/stats/
H A Dstats-metrics.c162 intmax_t num = 0; local
167 num = field->value.intmax;
170 num = field->value.timeval.tv_sec * 1000000ULL +
174 stats_dist_add(metric->fields[i].stats, num);
/dovecot/src/lib-storage/index/
H A Dindex-attachment.c335 unsigned int num; local
343 str++; num = 0;
345 num = num*10 + (*str-'0');
348 if (num == 0 || num % 4 != 0)
351 extref->base64_blocks_per_line = num/4;
/dovecot/src/pop3/
H A Dpop3-settings.c119 enum pop3_client_workarounds num; member in struct:pop3_client_workaround_list
141 client_workarounds |= list->num;
/dovecot/src/doveadm/
H A Ddoveadm-settings.c142 enum dsync_features num; member in struct:dsync_feature_list
163 features |= list->num;
/dovecot/src/doveadm/dsync/
H A Ddsync-mailbox-state.c16 static void put_uint32(buffer_t *output, uint32_t num) argument
20 cpu32_to_le_unaligned(num, tmp);

Completed in 22 milliseconds

123