Searched refs:children (Results 1 - 25 of 30) sorted by relevance

12

/dovecot/src/lib-mail/
H A Dtest-message-parser.c47 if ((p1->children != NULL) != (p2->children != NULL))
50 if (p1->children != NULL) {
51 if (!msg_parts_cmp(p1->children, p2->children))
206 test_assert(parts->children->physical_pos == 55);
207 test_assert(parts->children->header_size.physical_size == 0);
208 test_assert(parts->children->body_size.physical_size == 0);
209 test_assert(parts->children->body_size.lines == 0);
210 test_assert(parts->children
[all...]
H A Dmessage-part.h30 struct message_part *children; member in struct:message_part
38 /* total number of message_parts under children */
H A Dmessage-part.c24 if (message_part_find(p->children, part, n))
49 return message_sub_part_by_idx(part->children, idx-1);
H A Dmessage-part-serialize.c10 root's first children
11 children's first children
13 root's next children
81 if (part->children != NULL) {
82 part_serialize(part->children, dest,
90 i_assert(part->children == NULL);
205 "message/rfc822 part has no children";
210 "has multiple children";
216 /* our children mus
[all...]
H A Dtest-message-part.c91 test_assert(message_part_by_idx(parts, 1) == parts->children);
H A Dmessage-parser.c191 list = &part->parent->children;
748 ctx->part = ctx->part->children;
780 i_assert(ctx->part->children != NULL);
781 end_offset = ctx->part->children->physical_pos;
925 not have any children. */
927 ctx->part->children == NULL)
958 if (ctx->part->children != NULL) {
964 ctx->part = ctx->part->children;
/dovecot/src/plugins/fts-squat/
H A Dsquat-trie-private.h36 // children are written before their parents
53 /* children.leaf_string contains this many bytes */
56 /* TRUE = children.data contains our children.
57 FALSE = children.offset contains offset to our children in the
60 /* When allocating our children, use a sequential array. */
62 /* This node's children are in a sequential array, meaning that the
63 first SEQUENTIAL_COUNT children have chars[n] = n. */
68 This is mainly used when adding new UIDs to our children t
90 } children; member in struct:squat_node
[all...]
H A Dsquat-trie.c109 struct squat_node *children; local
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; local
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_childre local
432 struct squat_node *child, *children = NULL; local
579 struct squat_node *children; local
1004 struct squat_node *children; local
1115 struct squat_node *children; local
[all...]
/dovecot/src/lib-storage/index/
H A Dindex-thread-finish.c31 /* ignore this node - it's a dummy without children */
52 ARRAY_TYPE(mail_thread_child_node) children;
198 /* sort the children */
209 const struct mail_thread_child_node *children; local
233 children = array_idx(&sorted_children, 0);
234 idx = children[0].idx;
236 /* dummy without children */
292 message's children to the children of the message in
293 the subject table (the children o
367 const struct mail_thread_child_node *children; local
555 struct mail_thread_child_node *children; local
638 const struct mail_thread_child_node *children, *child; local
[all...]
H A Dindex-search-mime.c81 /* CHILD EXISTS: matches if this part has any children; i.e., it is
84 return (part->children != NULL ? 1 : 0);
113 part = part->children;
123 if (part->children != NULL) {
132 part = part->children;
508 if (part->children != NULL) {
511 part = part->children;
H A Dindex-mail-binary.c159 if (part->children != NULL) {
161 for (child = part->children; child != NULL; child = child->next) {
252 binary_parts_update(ctx, part->children, msg_bin_parts);
472 child = msg_part_find(part->children, physical_pos);
/dovecot/src/lib-imap/
H A Dimap-bodystructure.c118 if (part->children != NULL)
119 part_write_bodystructure_siblings(part->children, str, extended);
203 i_assert(part->children != NULL);
204 i_assert(part->children->next == NULL);
206 child_data = part->children->data;
212 part_write_bodystructure_siblings(part->children, str, extended);
381 part->children == NULL) {
414 child_part = part->children;
445 child_part_p = &part->children;
567 i_assert(part->children
726 const struct imap_arg *children; local
[all...]
/dovecot/src/lib/
H A Distream-tee.c9 struct tee_child_istream *children; member in struct:tee_istream
25 struct tee_child_istream *tstream = tee->children;
53 struct tee_child_istream *tstream = tee->children;
86 for (p = &tee->children; *p != NULL; p = &(*p)->next) {
93 if (tee->children == NULL) {
231 tstream->next = tee->children;
232 tee->children = tstream;
/dovecot/src/lib-storage/
H A Dmailbox-tree.h9 struct mailbox_node *children; member in struct:mailbox_node
H A Dmailbox-tree.c138 node = &(*node)->children;
199 if (node->children != NULL) {
202 node = node->children;
281 node->children = mailbox_tree_dup_branch(dest_tree, node,
282 src->children);
328 /* sort the children */
330 mailbox_tree_sort_branch(&node->children, tmparr);
/dovecot/src/lib-storage/list/
H A Dmailbox-list-index-sync.c77 node->next = parent->children;
78 parent->children = node;
113 node = node->children;
141 if (node->children != NULL)
142 get_existing_name_ids(ids, node->children);
197 if (node->children != NULL)
198 mailbox_list_index_node_clear_exists(node->children);
212 if (node->children != NULL)
213 sync_expunge_nonexistent(sync_ctx, node->children);
412 mailbox_list_index_sync_update_corrupted_nodes(sync_ctx, node->children);
[all...]
H A Dmailbox-list-index-iter.c88 ctx->info.flags = node->children != NULL ?
136 node->children != NULL) {
137 /* prefix/INBOX has children */
142 if (node->children != NULL && follow_children) {
144 ctx->next_node = node->children;
218 subscribed children. */
H A Dmailbox-list-notify-tree.c67 if (index_node->children != NULL) {
70 index_node = index_node->children;
H A Dmailbox-list-index.h82 struct mailbox_list_index_node *children; member in struct:mailbox_list_index_node
H A Dmailbox-list-index-backend.c717 "Mailbox has children, delete them first");
784 newnode->children = oldnode->children; oldnode->children = NULL;
785 for (child = newnode->children; child != NULL; child = child->next)
H A Dmailbox-list-index.c146 node = node->children;
184 &ilist->mailbox_tree : &node->parent->children;
397 node->next = parent->children;
398 parent->children = node;
H A Dmailbox-list-subscriptions.c194 if (node->children != NULL)
/dovecot/src/config/
H A Dconfig-request.c222 void *const *children, *const *change_children = NULL; local
261 count = 0; children = NULL;
287 children = array_get(val, &count);
291 setting_export_section_name(ctx->value, def, children[i], i);
351 i_assert(count == 0 || children != NULL);
356 setting_export_section_name(ctx->prefix, def, children[i], i);
360 children[i], change_children[i]);
/dovecot/src/lib-imap-storage/
H A Dimap-msgpart.c113 part = part->children;
132 part = part->children;
557 i_assert(part->children != NULL &&
558 part->children->next == NULL);
559 part = part->children;
798 pos = &(*binpart_r)->children;
799 for (part = part->children; part != NULL; part = part->next) {
/dovecot/src/lib-settings/
H A Dsettings-parser.c98 void *const *children; local
106 children = array_get(arr, &count);
127 keyp = CONST_PTR_OFFSET(children[i], info.type_offset);
146 info.defaults = children[i];
1194 void *const *children; local
1210 children = array_get(val, &count);
1213 children[i], error_r))
1279 void *value, *const *children; local
1333 children = array_get(val, &count);
1336 children[
1423 void *const *children; local
1587 void *dest_set, *dest, *const *children; local
1641 void *dest_set, *dest, *const *children; local
1978 void *dest_set, *set, *const *children; local
2013 void *const *children, *child_set; local
[all...]

Completed in 72 milliseconds

12