Searched refs:count (Results 1 - 25 of 356) sorted by relevance

1234567891011>>

/dovecot/src/lib/
H A Dexecv-const.c11 unsigned int i, count; local
13 for (count = 0; argv[count] != NULL; count++) ;
15 ret = t_new(char *, count + 1);
16 for (i = 0; i < count; i++)
H A Dsendfile-util.h7 ssize_t safe_sendfile(int out_fd, int in_fd, uoff_t *offset, size_t count);
H A Dstats-dist.c13 unsigned int count; member in struct:stats_dist
51 if (stats->count < stats->sample_count) {
52 stats->samples[stats->count] = value;
53 if (stats->count == 0)
56 unsigned int idx = i_rand_limit(stats->count);
61 stats->count++;
72 return stats->count;
92 if (stats->count == 0)
95 return (stats->sum + stats->count/2) / stats->count;
103 unsigned int count = (stats->count < stats->sample_count) local
117 unsigned int count = (stats->count < stats->sample_count) local
152 unsigned int count = (stats->count < stats->sample_count) local
[all...]
H A Dsendfile-util.c19 ssize_t safe_sendfile(int out_fd, int in_fd, uoff_t *offset, size_t count) argument
25 if (count == 0)
35 if (count > 2147483647L - *offset)
36 count = 2147483647L - *offset;
46 if (count > OFF_T_MAX - *offset)
47 count = OFF_T_MAX - *offset;
51 ret = sendfile(out_fd, in_fd, &safe_offset, count);
62 ssize_t safe_sendfile(int out_fd, int in_fd, uoff_t *offset, size_t count) argument
68 i_assert(count <= SSIZE_T_MAX);
70 if (count
98 safe_sendfile(int out_fd, int in_fd, uoff_t *offset, size_t count) argument
[all...]
H A Dbits.h60 bits_rotl64(uint64_t num, unsigned int count) argument
63 count &= mask;
64 return (num << count) | (num >> (-count & mask));
68 bits_rotl32(uint32_t num, unsigned int count) argument
71 count &= mask;
72 return (num << count) | (num >> (-count & mask));
76 bits_rotr64(uint64_t num, unsigned int count) argument
79 count
84 bits_rotr32(uint32_t num, unsigned int count) argument
[all...]
H A Drestrict-process-size.h12 void restrict_process_count(rlim_t count);
13 /* Set fd limit to count. */
14 void restrict_fd_limit(rlim_t count);
20 /* Get the process count limit. Returns 0 if ok, -1 if lookup failed. */
H A Drestrict-process-size.c26 void restrict_process_count(rlim_t count ATTR_UNUSED)
31 rlim.rlim_max = rlim.rlim_cur = count;
34 (unsigned long long)count);
39 void restrict_fd_limit(rlim_t count) argument
44 rlim.rlim_cur = rlim.rlim_max = count;
47 (unsigned long long)count);
H A Dpriorityq.c69 unsigned int parent_idx, count; local
71 items = array_get_modifiable(&pq->items, &count);
75 i_assert(idx < count);
89 unsigned int left_idx, right_idx, min_child_idx, count; local
91 items = array_get_modifiable(&pq->items, &count);
92 while ((left_idx = LEFT_CHILD_IDX(idx)) < count) {
94 if (right_idx >= count ||
119 unsigned int count; local
121 items = array_get_modifiable(&pq->items, &count);
122 i_assert(idx < count);
[all...]
H A Dseq-range-array.c12 unsigned int idx, left_idx, right_idx, count; local
14 data = array_get(array, &count);
15 i_assert(count < INT_MAX);
17 idx = 0; left_idx = 0; right_idx = count;
41 unsigned int idx, count; local
45 data = array_get_modifiable(array, &count);
46 if (count == 0) {
52 if (data[count-1].seq2 < seq) {
53 if (data[count-1].seq2 == seq-1) {
55 data[count
119 unsigned int idx1, idx2, count; local
199 unsigned int count; local
221 unsigned int idx, left_idx, right_idx, count; local
295 unsigned int idx, idx2, count, remove_count = 0; local
369 unsigned int i, count, ret = 0; local
429 unsigned int i, count; local
495 unsigned int i, count, diff; local
[all...]
H A Dbsearch-insert-pos.h6 #define BINARY_NUMERIC_SEARCH(getdata, data, count, value, idx_r) \
9 i_assert((count) < INT_MAX); \
10 left_idx = 0; right_idx = (count); \
26 #define BINARY_NUMBER_SEARCH(data, count, value, idx_r) \
27 BINARY_NUMERIC_SEARCH(BINARY_SEARCH_ARRAY_GET, data, count, value, idx_r);
H A Daqueue.c29 unsigned int orig_area_size, count; local
39 count = I_MIN(aqueue->area_size - orig_area_size, aqueue->head);
40 array_copy(aqueue->arr, orig_area_size, aqueue->arr, 0, count);
41 if (count < aqueue->area_size - orig_area_size)
42 aqueue->head = orig_area_size + count;
44 array_copy(aqueue->arr, 0, aqueue->arr, count,
45 aqueue->head - count);
46 aqueue->head -= count;
67 unsigned int idx, count = aqueue_count(aqueue); local
69 i_assert(n < count);
[all...]
H A Distream-try.c115 unsigned int count; local
119 for (count = 0; input[count] != NULL; count++) {
121 i_stream_get_max_buffer_size(input[count]));
122 if (!input[count]->blocking)
124 if (!input[count]->seekable)
126 i_stream_ref(input[count]);
128 i_assert(count != 0);
131 tstream->try_input_count = count;
[all...]
/dovecot/src/lib-storage/
H A Dmailbox-header.c21 unsigned int i, j, count; local
25 for (count = 0, name = headers; *name != NULL; name++)
26 count++;
29 sorted_headers = t_new(const char *, count);
30 memcpy(sorted_headers, headers, count * sizeof(*sorted_headers));
31 i_qsort(sorted_headers, count, sizeof(*sorted_headers), i_strcasecmp_p);
35 fields = t_new(struct mail_cache_field, count);
36 for (i = j = 0; i < count; i++) {
42 count = j;
43 mail_cache_register_fields(box->cache, fields, count);
[all...]
/dovecot/src/master/
H A Ddup2-array.c25 unsigned int i, j, count, conflict; local
28 dups = array_get_modifiable(dups_arr, &count);
30 moved = t_new(bool, count);
32 conflict = count;
34 for (i = 0; i < count; i++) {
38 for (j = 0; j < count; j++) {
46 if (j == count) {
58 if (conflict == count)
/dovecot/src/imap-login/
H A Dimap-login-commands.h18 unsigned int count);
20 unsigned int count);
/dovecot/src/auth/
H A Dmech-dovecot-token.c18 int count; local
23 count = 0;
26 count++; i++;
27 if (count == 1)
29 else if (count == 2)
31 else if (count == 3)
42 if (count != 4) {
H A Dpassdb-template.c49 unsigned int i, count; local
57 args = array_get(&tmpl->args, &count);
58 i_assert((count % 2) == 0);
59 for (i = 0; i < count; i += 2) {
79 unsigned int i, count; local
81 args = array_get(&tmpl->args, &count);
82 i_assert((count % 2) == 0);
83 for (i = 0; i < count; i += 2) {
H A Duserdb-template.c73 unsigned int i, count; local
81 args = array_get(&tmpl->args, &count);
82 i_assert((count % 2) == 0);
83 for (i = 0; i < count; i += 2) {
102 unsigned int i, count; local
104 args = array_get(&tmpl->args, &count);
105 i_assert((count % 2) == 0);
106 for (i = 0; i < count; i += 2) {
/dovecot/src/lib-storage/index/
H A Dindex-sync-search.c38 unsigned int count; local
40 count = array_count(&ctx->flag_updates) +
42 i_array_init(&ctx->all_flag_update_uids, count*2);
51 unsigned int i, count; local
55 results = array_get(&ctx->ctx.box->search_results, &count);
56 for (i = 0; i < count; i++) {
84 unsigned int i, count; local
86 results = array_get(&ctx->ctx.box->search_results, &count);
87 for (i = 0; i < count; i++)
/dovecot/src/plugins/virtual/
H A Dvirtual-transaction.c15 unsigned int i, count; local
17 bt = array_get(&vt->backend_transactions, &count);
18 for (i = 0; i < count; i++) {
49 unsigned int i, count; local
57 bt = array_get_modifiable(&vt->backend_transactions, &count);
58 for (i = 0; i < count; i++) {
74 unsigned int i, count; local
81 bt = array_get_modifiable(&vt->backend_transactions, &count);
82 for (i = 0; i < count; i++)
/dovecot/src/lib-index/
H A Dmail-index-transaction-sort-appends.c34 unsigned int i, j, count; local
39 ext_rec_arrays = array_get_modifiable(updates, &count);
40 for (j = 0; j < count; j++) {
69 unsigned int i, count; local
71 range = array_get_modifiable(array, &count);
72 for (i = 0; i < count; i++) {
76 if (i == count) {
81 i_array_init(&old_seqs, count - i);
89 array_append(&old_seqs, &range[i], count - i);
90 array_delete(array, i, count
130 unsigned int i, count; local
[all...]
H A Dmail-cache-sync-update.c11 void mail_cache_expunge_count(struct mail_cache *cache, unsigned int count) argument
14 cache->hdr_copy.deleted_record_count += count;
15 if (cache->hdr_copy.record_count >= count)
16 cache->hdr_copy.record_count -= count;
/dovecot/src/director/
H A Dtest-user-directory.c43 const unsigned int count = 100000; local
50 (void)user_directory_add(dir, 1, host, ioloop_time + count+1);
52 for (i = 0; i < count; i++)
54 verify_user_directory(dir, count+1);
61 const unsigned int count = 1000; local
69 for (i = 0; i < count; i++)
71 verify_user_directory(dir, count);
81 unsigned int i, count = i_rand_minmax(10000, 19999); local
85 for (i = 0; i < count; i++) {
92 verify_user_directory(dir, count);
[all...]
/dovecot/src/lib-storage/index/dbox-multi/
H A Dmdbox-file.c31 unsigned int i, count; local
33 files = array_get(&storage->open_files, &count);
34 for (i = 0; i < count; i++) {
44 unsigned int i, count; local
46 files = array_get(&storage->open_files, &count);
47 for (i = 0; i < count; i++)
55 unsigned int i, count; local
57 files = array_get(&storage->open_files, &count);
58 for (i = 0; i < count; i++) {
68 unsigned int i, count; local
142 unsigned int count; local
226 unsigned int i, count; local
272 unsigned int i, count; local
[all...]
/dovecot/src/doveadm/dsync/
H A Ddsync-serializer.c26 unsigned int i, count; local
32 count = str_array_length(keys);
33 dup_keys = p_new(pool, const char *, count + 1);
34 for (i = 0; i < count; i++)
37 serializer->keys_count = count;
98 unsigned int i, count; local
102 values = array_get(&encoder->values, &count);
103 for (i = 0; i < count; i++) {

Completed in 105 milliseconds

1234567891011>>