Searched refs:first_child (Results 1 - 5 of 5) sorted by relevance

/dovecot/src/doveadm/dsync/
H A Ddsync-mailbox-tree-sync.c47 iter->cur = tree->root.first_child;
66 if (iter->cur->first_child != NULL)
67 aqueue_append(iter->queue, &iter->cur->first_child);
130 nodes[0]->parent->first_child = nodes[0];
265 for (p = &parent->first_child; *p != NULL; p = &(*p)->next) {
336 for (node = parent->first_child; node != NULL; node = node->next) {
346 for (node = node->first_child; node != NULL; node = node->next) {
532 ret = node_mailbox_guids_cmp(node1->first_child,
533 node2->first_child);
554 ret = node_mailbox_names_cmp(node1->first_child,
[all...]
H A Dtest-dsync-mailbox-tree-sync.c126 test_tree_nodes_fixup(&node->first_child, newguid_counter);
128 node->first_child == NULL) {
141 test_tree_nodes_fixup(&tree->root.first_child, &newguid_counter);
154 nodes_dump(node->first_child, depth+1);
162 nodes_dump(tree1->root.first_child, 1);
164 nodes_dump(tree2->root.first_child, 1);
227 test_tree_nodes_add_namespace(node->first_child, ns);
239 i_assert(tree->root.first_child == node);
240 i_assert(node->first_child == NULL);
241 node->first_child
[all...]
H A Ddsync-mailbox-tree.c70 node = dsync_mailbox_node_find(node->first_child, *path);
79 node->next = parent->first_child;
80 parent->first_child = node;
87 for (p = &node->parent->first_child;; p = &(*p)->next) {
110 node = dsync_mailbox_node_find(node->first_child, *path);
199 if (iter->cur->first_child != NULL)
200 iter->cur = iter->cur->first_child;
420 if (src->first_child != NULL) {
422 src->first_child, path);
486 if (!dsync_mailbox_branches_equal(snodes1[i]->first_child,
[all...]
H A Ddsync-mailbox-tree.h42 struct dsync_mailbox_node *parent, *next, *first_child; member in struct:dsync_mailbox_node
/dovecot/src/lib-storage/
H A Dmailbox-tree.c28 bool first_child:1; member in struct:mailbox_tree_iterate_context
203 ctx->first_child = TRUE;
216 ctx->first_child = TRUE;
242 if (ctx->first_child) {
243 ctx->first_child = FALSE;

Completed in 18 milliseconds