void dsync_brain_mailbox_trees_init(struct dsync_brain *brain)
{
struct mail_namespace *ns;
dsync_brain_check_namespaces(brain);
brain->local_mailbox_tree =
dsync_mailbox_tree_init(brain->hierarchy_sep, brain->alt_char);
/* we'll convert remote mailbox names to use our own separator */
brain->remote_mailbox_tree =
dsync_mailbox_tree_init(brain->hierarchy_sep, brain->alt_char);
/* fill the local mailbox tree */
for (ns = brain->user->namespaces; ns != NULL; ns = ns->next) {
if (!dsync_brain_want_namespace(brain, ns))
continue;
if (dsync_mailbox_tree_fill(brain->local_mailbox_tree, ns,
brain->sync_box,
brain->sync_box_guid,
brain->exclude_mailboxes,
&brain->mail_error) < 0) {
brain->failed = TRUE;
break;
}
}
brain->local_tree_iter =
dsync_mailbox_tree_iter_init(brain->local_mailbox_tree);
}
static void test_dsync_mailbox_tree_sync_renames15(void)
{
struct dsync_mailbox_tree *tree1, *tree2;
test_begin("dsync mailbox tree sync renames 15");
tree1 = dsync_mailbox_tree_init('/', '_');
tree2 = dsync_mailbox_tree_init('/', '_');
node_create(tree1, 1, "1", 0);
node_create(tree2, 2, "1", 1);
test_trees(tree1, tree2);
test_end();
}
static void test_dsync_mailbox_tree_sync_renames1(void)
{
static const char *common_nodes[] = { "1", "2", "3", "2/s1", "2/s2", "x/y", "3/s3", NULL };
struct dsync_mailbox_tree *tree1, *tree2;
struct dsync_mailbox_node *node;
unsigned int counter = 0;
test_begin("dsync mailbox tree sync renames 1");
tree1 = dsync_mailbox_tree_init('/', '_');
nodes_create(tree1, &counter, common_nodes);
tree2 = dsync_mailbox_tree_dup(tree1);
node = dsync_mailbox_tree_get(tree1, "1");
node->name = "a";
node->last_renamed_or_created = 1000;
node = dsync_mailbox_tree_get(tree2, "2");
node->name = "b";
node->last_renamed_or_created = 1000;
node = dsync_mailbox_tree_get(tree1, "3/s3");
node->name = "z";
node->last_renamed_or_created = 1000;
dsync_mailbox_tree_node_detach(node);
dsync_mailbox_tree_node_attach(node, &tree1->root);
test_trees(tree1, tree2);
test_end();
}
static struct dsync_mailbox_tree *create_random_tree(void)
{
struct dsync_mailbox_tree *tree;
unsigned int counter = 0;
tree = dsync_mailbox_tree_init('/', '_');
create_random_nodes(tree, "", 0, &counter);
return tree;
}
static void test_dsync_mailbox_tree_sync_renames19(void)
{
struct dsync_mailbox_tree *tree1, *tree2;
test_begin("dsync mailbox tree sync renames 19");
tree1 = dsync_mailbox_tree_init('/', '_');
tree2 = dsync_mailbox_tree_init('/', '_');
node_create(tree1, 1, "0/2/1", 1);
node_create(tree1, 2, "0/4", 3);
node_create(tree1, 3, "0/2", 2);
node_create(tree2, 1, "1", 0);
node_create(tree2, 2, "1/3", 4);
test_trees(tree1, tree2);
test_end();
}
static void test_dsync_mailbox_tree_sync_renames18(void)
{
struct dsync_mailbox_tree *tree1, *tree2;
test_begin("dsync mailbox tree sync renames 18");
tree1 = dsync_mailbox_tree_init('/', '_');
tree2 = dsync_mailbox_tree_init('/', '_');
node_create(tree1, 2, "a", 5);
node_create(tree1, 4, "a/c", 2);
node_create(tree1, 5, "b", 6);
node_create(tree2, 1, "a", 7);
node_create(tree2, 2, "b", 3);
node_create(tree2, 3, "b/c", 4);
node_create(tree2, 4, "d", 1);
test_trees(tree1, tree2);
test_end();
}
static void test_dsync_mailbox_tree_sync_renames13(void)
{
struct dsync_mailbox_tree *tree1, *tree2;
test_begin("dsync mailbox tree sync renames 13");
tree1 = dsync_mailbox_tree_init('/', '_');
tree2 = dsync_mailbox_tree_init('/', '_');
node_create(tree1, 4, "0.0/1.0/2.1", 0);
node_create(tree1, 5, "0.1", 2);
node_create(tree1, 6, "0.1/1.0", 2);
node_create(tree1, 7, "0.1/1.0/2.0", 8);
node_create(tree2, 5, "0.1/1.0", 5);
node_create(tree2, 6, "0.1/1.0/2.0", 8);
node_create(tree2, 7, "0.1/1.1", 1);
test_trees(tree1, tree2);
test_end();
}
static void test_dsync_mailbox_tree_sync_renames20(void)
{
struct dsync_mailbox_tree *tree1, *tree2;
test_begin("dsync mailbox tree sync renames 20");
tree1 = dsync_mailbox_tree_init('/', '_');
tree2 = dsync_mailbox_tree_init('/', '_');
node_create(tree1, 1, "1", 0);
node_create(tree1, 2, "0", 0);
node_create(tree1, 3, "0/2", 0);
/* rename 0 -> 1/0 */
node_create(tree2, 1, "1", 0);
node_create(tree2, 2, "1/0", 1);
node_create(tree2, 3, "1/0/2", 0);
test_trees_nofree(tree1, &tree2);
test_assert(tree1->root.first_child != NULL &&
tree1->root.first_child->next == NULL);
dsync_mailbox_tree_deinit(&tree1);
test_end();
}
static void test_dsync_mailbox_tree_sync_deletes(void)
{
static const char *common_nodes[] = { "1", "2", "3", "2/s1", "2/s2", "x/y", NULL };
static const char *delete1_nodes[] = { "1", "2", NULL };
static const char *delete2_nodes[] = { "2/s1", "x/y", NULL };
struct dsync_mailbox_tree *tree1, *tree2;
unsigned int counter = 0;
test_begin("dsync mailbox tree sync deletes");
tree1 = dsync_mailbox_tree_init('/', '_');
nodes_create(tree1, &counter, common_nodes);
tree2 = dsync_mailbox_tree_dup(tree1);
nodes_delete(tree1, &counter, delete1_nodes);
nodes_delete(tree2, &counter, delete2_nodes);
test_trees(tree1, tree2);
test_end();
}
static void test_dsync_mailbox_tree_sync_creates(void)
{
static const char *common_nodes[] = { "foo", "foo/bar", NULL };
static const char *create1_nodes[] = { "bar", "foo/baz", NULL };
static const char *create2_nodes[] = { "foo/xyz", "foo/bar/3", NULL };
struct dsync_mailbox_tree *tree1, *tree2;
unsigned int counter = 0;
test_begin("dsync mailbox tree sync creates");
tree1 = dsync_mailbox_tree_init('/', '_');
nodes_create(tree1, &counter, common_nodes);
tree2 = dsync_mailbox_tree_dup(tree1);
nodes_create(tree1, &counter, create1_nodes);
nodes_create(tree2, &counter, create2_nodes);
test_trees(tree1, tree2);
test_end();
}
