Searched defs:nodes (Results 1 - 5 of 5) sorted by relevance

/dovecot/src/lib-storage/
H A Dmailbox-tree.c15 struct mailbox_node *nodes; member in struct:mailbox_tree_context
73 tree->nodes = NULL;
92 return tree->nodes;
99 node = &tree->nodes;
183 ctx->root = root != NULL ? root : tree->nodes;
196 struct mailbox_node *const *nodes; local
207 nodes = array_get(&ctx->node_path, &count);
210 size_t len = strlen(nodes[i-1]->name) + 1;
214 if (nodes[i-1]->next != NULL) {
215 node = nodes[
306 mailbox_tree_sort_branch(struct mailbox_node **nodes, ARRAY_TYPE(mailbox_node) *tmparr) argument
[all...]
/dovecot/src/doveadm/dsync/
H A Ddsync-mailbox-tree.c50 dsync_mailbox_node_find(struct dsync_mailbox_node *nodes, const char *name) argument
52 for (; nodes != NULL; nodes = nodes->next) {
53 if (strcmp(name, nodes->name) == 0)
54 return nodes;
H A Ddsync-mailbox-tree-sync.c121 struct dsync_mailbox_node *const *nodes; local
126 nodes = array_get(siblings, &count);
130 nodes[0]->parent->first_child = nodes[0];
132 nodes[i-1]->next = nodes[i];
133 nodes[count-1]->next = NULL;
233 existence=DELETED mailbox nodes by changing
496 sorted, because the nodes must be sorted by name, and the node's
644 the other data. We'll start by looking at the nodes' mailbo
[all...]
/dovecot/src/lib/
H A Dhash.c42 struct hash_node *nodes; member in struct:hash_table
79 table->nodes = i_new(struct hash_node, table->size);
127 if (table->nodes[i].next != NULL)
128 destroy_node_list(table, table->nodes[i].next);
146 i_free(table->nodes);
163 memset(table->nodes, 0, sizeof(struct hash_node) * table->size);
175 node = &table->nodes[hash % table->size];
239 node = &table->nodes[hash % table->size];
312 /* remove deleted nodes from the list */
337 hash_table_compress(table, &table->nodes[
[all...]
/dovecot/src/lib-storage/index/
H A Dindex-sort-string.c106 struct mail_sort_node *nodes, *nodes2; local
110 nodes = array_get_modifiable(&ctx->nonzero_nodes, &count);
120 if (nodes[i].seq < nodes2[j].seq)
121 seq = nodes[i++].seq;
125 seq = nodes[i++].seq;
270 struct mail_sort_node *nodes; local
280 nodes = array_get_modifiable(&ctx->zero_nodes, &count);
282 i_assert(nodes[i].seq <= ctx->last_seq);
285 if (index_sort_header_get(ctx->program, nodes[i].seq,
287 nodes[
307 const struct mail_sort_node *nodes; local
408 struct mail_sort_node *nodes; local
545 struct mail_sort_node *nodes; local
718 const struct mail_sort_node *nodes; local
745 const struct mail_sort_node *nodes; local
856 const struct mail_sort_node *nodes; local
[all...]

Completed in 39 milliseconds