Lines Matching refs:children
109 struct squat_node *children;
114 i_free(node->children.leaf_string);
116 children = NODE_CHILDREN_NODES(node);
121 node_free(trie, &children[i]);
123 i_free(node->children.data);
339 struct squat_node *children;
351 node->children.data = i_malloc(alloc_size);
358 children = NODE_CHILDREN_NODES(node);
360 children[i].want_sequential = TRUE;
369 struct squat_node *children, *old_children;
388 node->children.data = i_malloc(new_size);
394 node->children.data = i_realloc(node->children.data,
398 children = NODE_CHILDREN_NODES(node);
401 if (children != old_children) {
402 memmove(children, old_children,
432 struct squat_node *child, *children = NULL;
444 node_offset = node->children.offset;
446 node->children.data = NULL;
479 children = NODE_CHILDREN_NODES(node);
482 i_assert(children != NULL);
484 child = &children[child_idx];
489 /* no children */
502 child->children.offset = base_offset;
534 dest = child->children.static_leaf_string;
536 dest = child->children.leaf_string =
579 struct squat_node *children;
586 children = NODE_CHILDREN_NODES(node);
609 squat_pack_num(&bufp, children[i].uid_list_idx);
610 if (!UIDLIST_IS_SINGLETON(children[i].uid_list_idx)) {
612 squat_pack_num(&bufp, children[i].next_uid - 1);
615 if (children[i].leaf_string_length == 0) {
617 squat_pack_num(&bufp, children[i].unused_uids << 1);
622 squat_pack_num(&bufp, (children[i].unused_uids << 1) | 1);
624 squat_pack_num(&bufp, children[i].leaf_string_length - 1);
627 NODE_LEAF_STRING(&children[i]),
628 children[i].leaf_string_length);
662 memcpy(str, node->children.static_leaf_string, leafstr_len);
664 memcpy(str, node->children.leaf_string, leafstr_len);
665 i_free(node->children.leaf_string);
681 i_assert(!child->have_sequential && child->children.data == NULL);
687 memcpy(child->children.static_leaf_string,
690 child->children.leaf_string = i_malloc(leafstr_len);
691 memcpy(child->children.leaf_string,
789 /* create new children */
807 i_assert(node->children.data == NULL);
810 memcpy(node->children.static_leaf_string,
813 node->children.leaf_string = i_malloc(len);
814 memcpy(node->children.leaf_string, data, len);
987 /* move children. note that children_dest may point to different
1004 struct squat_node *children;
1025 node->children.offset;
1032 children = NODE_CHILDREN_NODES(node);
1036 ret = squat_write_node(ctx, &children[i],
1115 struct squat_node *children;
1135 children = NODE_CHILDREN_NODES(ctx->cur.node);
1136 while (children[ctx->cur.idx++].uid_list_idx == 0) {
1138 /* no more non-empty children in this node */
1143 ctx->cur.node = &children[ctx->cur.idx-1];
1276 /* no UIDs left, delete the node's children and mark it
1504 changed = trie->root.children.offset != trie->hdr.root_offset;
1513 trie->root.children.offset = trie->hdr.root_offset;
1789 if (len > sizeof(node->children.static_leaf_string))
1790 str = node->children.leaf_string;
1792 str = node->children.static_leaf_string;
1821 /* follow to children */