Lines Matching defs:child
387 /* first child */
432 struct squat_node *child, *children = NULL;
469 /* get child offsets */
473 check always goes to add the first child */
484 child = &children[child_idx];
486 /* 1) child offset */
501 child->children_not_mapped = TRUE;
502 child->children.offset = base_offset;
506 child->uid_list_idx = squat_unpack_num(&data, end);
507 if (child->uid_list_idx == 0) {
512 if (!UIDLIST_IS_SINGLETON(child->uid_list_idx)) {
514 child->next_uid = squat_unpack_num(&data, end) + 1;
516 uint32_t idx = child->uid_list_idx;
518 child->next_uid = 1 +
524 child->unused_uids = num >> 1;
531 len = child->leaf_string_length =
533 if (!NODE_IS_DYNAMIC_LEAF(child))
534 dest = child->children.static_leaf_string;
536 dest = child->children.leaf_string =
595 /* 1) child offset */
652 struct squat_node *child;
669 /* create a new child node for the rest of the string */
671 child = NODE_CHILDREN_NODES(node) + idx;
674 child->next_uid = node->next_uid - node->unused_uids;
675 for (uid = 0; uid < child->next_uid; uid++) {
676 child->uid_list_idx =
678 child->uid_list_idx, uid);
681 i_assert(!child->have_sequential && child->children.data == NULL);
683 /* make the child a leaf string */
685 child->leaf_string_length = leafstr_len;
686 if (!NODE_IS_DYNAMIC_LEAF(child)) {
687 memcpy(child->children.static_leaf_string,
690 child->children.leaf_string = i_malloc(leafstr_len);
691 memcpy(child->children.leaf_string,
758 /* child node's UIDs are relative to ours. so for example if
760 unused_uids=3 and so the child node will be adding
1222 /* update child shifts */