Lines Matching defs:child
145 struct mail_thread_child_node *child)
149 child->uid = thread_lookup_existing(ctx, child->idx);
151 if (!mail_set_uid(ctx->tmp_mail, child->uid)) {
159 child->sort_date = 0;
160 else if (mail_get_date(ctx->tmp_mail, &child->sort_date, &tz) < 0)
161 child->sort_date = 0;
163 if (child->sort_date == 0) {
165 (void)mail_get_received_date(ctx->tmp_mail, &child->sort_date);
174 struct mail_thread_child_node child;
177 i_zero(&child);
180 /* add all child indexes to the array */
182 child.idx = shadows[parent_idx].first_child_idx;
183 i_assert(child.idx != 0);
184 if (shadows[child.idx].next_sibling_idx == 0) {
185 /* only child - don't bother setting sort date */
186 child.uid = thread_lookup_existing(ctx, child.idx);
188 array_append(sorted_children, &child, 1);
191 while (child.idx != 0) {
192 thread_child_node_fill(ctx, &child);
194 array_append(sorted_children, &child, 1);
195 child.idx = shadows[child.idx].next_sibling_idx;
230 /* find the oldest child */
310 child of the message in the subject table (a sibling
315 message a child of the message in the subject table (a
379 /* sort by the first child */
389 /* only one child - deferred step (3).
390 promote the child to the root. */
420 struct mail_thread_child_node child;
440 child.idx = idx;
441 thread_child_node_fill(ctx, &child);
453 if (root->node.sort_date < child.sort_date)
454 root->node.sort_date = child.sort_date;
464 struct mail_thread_child_node child;
470 i_zero(&child);
501 node as its child. If there are no non-dummy
502 parents, add it as the highest dummy's child. */
638 const struct mail_thread_child_node *children, *child;
646 child = &children[iter->next_idx++];
647 shadow = array_idx(&iter->ctx->shadow_nodes, child->idx);
649 mail_thread_iterate_children(iter, child->idx);
650 if (child->uid == 0 && *child_iter_r == NULL) {
655 return child;