Searched refs:node (Results 1 - 25 of 46) sorted by relevance

12

/dovecot/src/lib/
H A Dtest-json-tree.c60 const struct json_tree_node *root, *node, *node1, *node2; local
76 node = json_tree_find_key(root, test_input[i].value);
77 test_assert(node != NULL &&
78 node->value_type == test_input[i+1].type &&
79 null_strcmp(json_tree_get_value_str(node), test_input[i+1].value) == 0);
82 node = json_tree_find_key(root, "key-obj");
83 test_assert(node != NULL);
85 node = json_tree_find_key(root, "key-arr-empty");
86 test_assert(node != NULL && node
[all...]
H A Djson-tree.c37 struct json_tree_node *node; local
39 node = p_new(tree->pool, struct json_tree_node, 1);
40 node->parent = tree->cur;
41 node->value_type = type;
42 node->value.str = p_strdup(tree->pool, value);
45 tree->cur->value.child = node;
47 tree->cur_child->next = node;
48 tree->cur_child = node;
52 json_tree_set_cur(struct json_tree *tree, struct json_tree_node *node) argument
54 tree->cur = node;
141 json_tree_find_key(const struct json_tree_node *node, const char *key) argument
154 json_tree_find_child_with(const struct json_tree_node *node, const char *key, const char *value) argument
[all...]
H A Djson-tree.h22 static inline ATTR_PURE const struct json_tree_node *json_tree_get_child(const struct json_tree_node *node) argument
24 return node->value.child;
26 static inline ATTR_PURE const char *json_tree_get_value_str(const struct json_tree_node *node) argument
28 return node->value.str;
50 /* Return the root node. */
53 /* Find a node with the specified key from an OBJECT node */
55 json_tree_find_key(const struct json_tree_node *node, const char *key);
56 /* Find an object node (from an array), which contains the specified key=value
59 json_tree_find_child_with(const struct json_tree_node *node,
[all...]
H A Dhash.c101 static void free_node(struct hash_table *table, struct hash_node *node) argument
104 p_free(table->node_pool, node);
106 node->next = table->free_nodes;
107 table->free_nodes = node;
111 static void destroy_node_list(struct hash_table *table, struct hash_node *node) argument
115 while (node != NULL) {
116 next = node->next;
117 p_free(table->node_pool, node);
118 node = next;
173 struct hash_node *node; local
190 struct hash_node *node; local
200 struct hash_node *node; local
216 struct hash_node *node, *prev; local
308 struct hash_node *node, *next; local
344 struct hash_node *node; local
381 hash_table_iterate_next(struct hash_iterate_context *ctx, struct hash_node *node) argument
401 struct hash_node *node; local
446 struct hash_node *old_nodes, *node, *next; local
[all...]
/dovecot/src/lib-storage/
H A Dmailbox-tree.c85 struct mailbox_node **node, *parent; local
99 node = &tree->nodes;
110 /* find the node */
111 while (*node != NULL) {
112 if (strcmp((*node)->name, name) == 0)
115 node = &(*node)->next;
118 if (*node == NULL) {
123 *node = p_malloc(tree->pool, tree->node_size);
124 (*node)
148 struct mailbox_node *node; local
164 struct mailbox_node *node; local
195 struct mailbox_node *node = ctx->next_node; local
234 struct mailbox_node *node; local
273 struct mailbox_node *node, *dest_nodes = NULL, **dest = &dest_nodes; local
309 struct mailbox_node *node, *const *nodep, **dest; local
[all...]
/dovecot/src/doveadm/dsync/
H A Ddsync-mailbox-tree-sync.c86 const struct dsync_mailbox_node *node,
94 name = dsync_mailbox_node_get_full_name(ctx->local_tree, node);
98 change->ns = node->ns;
104 const struct dsync_mailbox_node *node, const char *name)
112 change->ns = node->ns;
114 memcpy(change->mailbox_guid, node->mailbox_guid,
116 change->uid_validity = node->uid_validity;
138 struct dsync_mailbox_node *node)
144 guid_p = node->mailbox_guid;
147 node
85 sync_add_dir_change(struct dsync_mailbox_tree_sync_ctx *ctx, const struct dsync_mailbox_node *node, enum dsync_mailbox_tree_sync_type type) argument
103 sync_add_create_change(struct dsync_mailbox_tree_sync_ctx *ctx, const struct dsync_mailbox_node *node, const char *name) argument
137 sync_set_node_deleted(struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node) argument
153 sync_delete_mailbox_node(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, const char *reason) argument
184 sync_delete_mailbox(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, const char *reason) argument
210 struct dsync_mailbox_node *node, *parent = NULL; local
259 dsync_mailbox_tree_node_attach_sorted(struct dsync_mailbox_node *node, struct dsync_mailbox_node *parent) argument
274 dsync_mailbox_tree_node_move_sorted(struct dsync_mailbox_node *node, struct dsync_mailbox_node *parent) argument
286 struct dsync_mailbox_node *node, *parent, *ret; local
305 struct dsync_mailbox_node *node; local
334 struct dsync_mailbox_node *node; local
344 node_has_existent_children(struct dsync_mailbox_node *node, bool dirs_ok) argument
356 node_is_existent(struct dsync_mailbox_node *node) argument
363 sync_node_is_namespace_prefix(struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node) argument
383 sync_rename_node_to_temp(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, struct dsync_mailbox_node *new_parent, const char **reason_r) argument
442 node_has_parent(struct dsync_mailbox_node *node, struct dsync_mailbox_node *parent) argument
453 sync_rename_node(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *temp_node, struct dsync_mailbox_node *node, const struct dsync_mailbox_node *other_node, const char **reason_r) argument
595 sync_node_is_namespace_root(struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node) argument
802 struct dsync_mailbox_node *node, *other_node; local
930 mailbox_node_hash_first_child(struct dsync_mailbox_node *node, struct md5_context *md5) argument
949 mailbox_node_generate_suffix(struct dsync_mailbox_node *node) argument
986 sync_rename_temp_mailbox_node(struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, const char **reason_r) argument
1021 sync_rename_delete_node_dirs(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node) argument
1041 sync_rename_temp_mailboxes(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, bool *renames_r) argument
1112 sync_is_wrong_mailbox(struct dsync_mailbox_node *node, const struct dsync_mailbox_node *wanted_node, const char **reason_r) argument
1143 sync_delete_wrong_mailboxes_branch(struct dsync_mailbox_tree_sync_ctx *ctx, struct dsync_mailbox_tree *tree, const struct dsync_mailbox_tree *wanted_tree, struct dsync_mailbox_node *node, const struct dsync_mailbox_node *wanted_node) argument
1207 struct dsync_mailbox_node *node, *other_node; local
1379 dsync_mailbox_tree_update_child_timestamps(struct dsync_mailbox_node *node, time_t parent_timestamp) argument
[all...]
H A Ddsync-mailbox-tree.c63 struct dsync_mailbox_node *node = &tree->root; local
69 for (; *path != NULL && node != NULL; path++)
70 node = dsync_mailbox_node_find(node->first_child, *path);
72 return node;
75 void dsync_mailbox_tree_node_attach(struct dsync_mailbox_node *node, argument
78 node->parent = parent;
79 node->next = parent->first_child;
80 parent->first_child = node;
83 void dsync_mailbox_tree_node_detach(struct dsync_mailbox_node *node) argument
99 struct dsync_mailbox_node *parent = NULL, *node = &tree->root; local
127 node_get_full_name_recurse(const struct dsync_mailbox_tree *tree, const struct dsync_mailbox_node *node, string_t *str) argument
137 dsync_mailbox_node_get_full_name(const struct dsync_mailbox_tree *tree, const struct dsync_mailbox_node *node) argument
145 dsync_mailbox_node_append_full_name(string_t *str, const struct dsync_mailbox_tree *tree, const struct dsync_mailbox_node *node) argument
183 node_get_full_name_length(struct dsync_mailbox_node *node) argument
236 struct dsync_mailbox_node *node; local
275 struct dsync_mailbox_node *node; local
299 dsync_mailbox_tree_guid_hash_add(struct dsync_mailbox_tree *tree, struct dsync_mailbox_node *node, struct dsync_mailbox_node **old_node_r) argument
322 struct dsync_mailbox_node *node, *old_node; local
399 struct dsync_mailbox_node *node; local
504 dsync_mailbox_node_to_string(const struct dsync_mailbox_node *node) argument
[all...]
H A Ddsync-mailbox-tree-fill.c20 struct dsync_mailbox_node *node; local
22 node = dsync_mailbox_tree_get(tree, info->vname);
23 if (node->ns == info->ns)
25 else if (node->ns == NULL) {
27 node->ns = info->ns;
30 info->vname, node->ns->prefix, info->ns->prefix);
33 *node_r = node;
80 struct dsync_mailbox_node *node; local
92 dsync_mailbox_tree_add_exists_node(tree, info, &node, error_r);
122 if (dsync_mailbox_tree_add_exists_node(tree, info, &node, error_
135 struct dsync_mailbox_node *node; local
148 struct dsync_mailbox_node *node; local
336 struct dsync_mailbox_node *node, *dup_node1, *dup_node2; local
[all...]
H A Dtest-dsync-mailbox-tree-sync.c37 struct dsync_mailbox_node *node; local
39 node = dsync_mailbox_tree_get(tree, name);
40 memcpy(node->mailbox_guid, &counter, sizeof(counter));
41 node->uid_validity = counter;
42 node->existence = DSYNC_MAILBOX_NODE_EXISTS;
43 node->last_renamed_or_created = last_renamed_or_created;
44 return node;
66 struct dsync_mailbox_node *node; local
70 node = node_create(tree, *counter, *names, 0);
71 node
112 struct dsync_mailbox_node *node; local
144 nodes_dump(const struct dsync_mailbox_node *node, unsigned int depth) argument
222 test_tree_nodes_add_namespace(struct dsync_mailbox_node *node, struct mail_namespace *ns) argument
235 struct dsync_mailbox_node *node, *n; local
310 struct dsync_mailbox_node *node; local
[all...]
H A Ddsync-mailbox-tree-private.h9 /* root node isn't part of the real mailbox tree. its name is "" and
28 void dsync_mailbox_tree_node_attach(struct dsync_mailbox_node *node,
30 void dsync_mailbox_tree_node_detach(struct dsync_mailbox_node *node);
H A Ddsync-mailbox-tree.h30 /* this is just a filler node for children or for
44 /* namespace where this node belongs to */
46 /* this node's name (not including parents) */
75 #define dsync_mailbox_node_is_dir(node) \
76 guid_128_is_empty((node)->mailbox_guid)
122 /* Lookup a mailbox node by name. Returns NULL if not known. */
126 /* Lookup a mailbox node by GUID. Returns NULL if not known.
131 /* Lookup or create a mailbox node by name. */
135 /* Returns full name for the given mailbox node. */
137 const struct dsync_mailbox_node *node);
[all...]
H A Ddsync-brain-mailbox-tree.c79 struct dsync_mailbox_node *node; local
86 &full_name, &node)) {
93 dsync_mailbox_node_to_string(node));
98 parts, node);
324 struct dsync_mailbox_node *node, *dup_node1, *dup_node2; local
346 node = dsync_mailbox_tree_get(brain->remote_mailbox_tree, name);
347 node->ns = ns;
348 dsync_mailbox_node_copy_data(node, remote_node);
375 const struct dsync_mailbox_node *node; local
381 node
453 const struct dsync_mailbox_node *node; local
[all...]
/dovecot/src/lib-storage/list/
H A Dmailbox-list-index-sync.c14 const struct mailbox_list_index_node *node, guid_128_t guid_r)
22 mailbox_list_index_node_get_path(node, ns_sep, str);
33 const struct mailbox_list_index_node *node, uint32_t *seq_r)
39 irec.name_id = node->name_id;
40 if (node->parent != NULL)
41 irec.parent_uid = node->parent->uid;
46 node_lookup_guid(ctx, node, irec.guid);
49 mail_index_append(ctx->trans, node->uid, &seq);
62 struct mailbox_list_index_node *node; local
65 node
13 node_lookup_guid(struct mailbox_list_index_sync_context *ctx, const struct mailbox_list_index_node *node, guid_128_t guid_r) argument
32 node_add_to_index(struct mailbox_list_index_sync_context *ctx, const struct mailbox_list_index_node *node, uint32_t *seq_r) argument
98 struct mailbox_list_index_node *node, *parent; local
194 mailbox_list_index_node_clear_exists(struct mailbox_list_index_node *node) argument
206 sync_expunge_nonexistent(struct mailbox_list_index_sync_context *sync_ctx, struct mailbox_list_index_node *node) argument
297 struct mailbox_list_index_node *node; local
371 mailbox_list_index_sync_update_corrupted_node(struct mailbox_list_index_sync_context *sync_ctx, struct mailbox_list_index_node *node) argument
407 mailbox_list_index_sync_update_corrupted_nodes(struct mailbox_list_index_sync_context *sync_ctx, struct mailbox_list_index_node *node) argument
480 struct mailbox_list_index_node *node; local
[all...]
H A Dmailbox-list-maildir-iter.c32 static void node_fix_parents(struct mailbox_node *node) argument
36 node = node->parent;
37 for (; node != NULL; node = node->parent) {
38 if ((node->flags & MAILBOX_MATCHED) == 0)
39 node->flags |= MAILBOX_NONEXISTENT;
41 node->flags |= MAILBOX_CHILDREN;
42 node
52 struct mailbox_node *node; local
92 struct mailbox_node *node; local
116 struct mailbox_node *node; local
275 struct mailbox_node *node; local
498 struct mailbox_node *node; local
[all...]
H A Dmailbox-list-index-iter.c72 struct mailbox_list_index_node *node = ctx->next_node; local
81 if (node->parent != NULL) {
85 str_append(ctx->path, node->name);
88 ctx->info.flags = node->children != NULL ?
106 if ((node->flags & MAILBOX_LIST_INDEX_FLAG_NONEXISTENT) != 0)
108 else if ((node->flags & MAILBOX_LIST_INDEX_FLAG_NOSELECT) != 0)
110 if ((node->flags & MAILBOX_LIST_INDEX_FLAG_NOINFERIORS) != 0)
122 mailbox_list_index_status_set_info_flags(box, node->uid,
132 struct mailbox_list_index_node *node = ctx->next_node; local
135 strcmp(node
[all...]
H A Dmailbox-list-index.c117 mailbox_list_index_node_find_sibling(struct mailbox_list_index_node *node, argument
120 while (node != NULL) {
121 if (strcmp(node->name, name) == 0)
122 return node;
123 node = node->next;
132 struct mailbox_list_index_node *node = ilist->mailbox_tree; local
138 return mailbox_list_index_node_find_sibling(node, "");
143 node = mailbox_list_index_node_find_sibling(node, pat
154 struct mailbox_list_index_node *node; local
168 mailbox_list_index_node_get_path(const struct mailbox_list_index_node *node, char sep, string_t *str) argument
178 mailbox_list_index_node_unlink(struct mailbox_list_index *ilist, struct mailbox_list_index_node *node) argument
246 mailbox_list_index_generate_name(struct mailbox_list_index *ilist, struct mailbox_list_index_node *node, const char *prefix) argument
275 mailbox_list_index_node_hash(const struct mailbox_list_index_node *node) argument
281 node_has_parent(const struct mailbox_list_index_node *parent, const struct mailbox_list_index_node *node) argument
297 struct mailbox_list_index_node *node, *parent; local
681 struct mailbox_list_index_node *node; local
[all...]
H A Dmailbox-list-notify-tree.h7 struct mailbox_node node; member in struct:mailbox_notify_node
H A Dmailbox-list-notify-tree.c45 struct mailbox_node *node; local
52 node = mailbox_tree_get(tree->mailboxes, str_c(path), &created);
53 nnode = (struct mailbox_notify_node *)node;
57 node->flags = MAILBOX_NONEXISTENT;
59 node->flags = MAILBOX_NOSELECT;
61 node->flags = 0;
65 node->flags |= MAILBOX_NOINFERIORS;
125 struct mailbox_node *node; local
127 node = mailbox_tree_lookup(tree->mailboxes, storage_name);
128 return (struct mailbox_notify_node *)node;
[all...]
/dovecot/src/auth/
H A Dauth-cache.c147 auth_cache_node_unlink(struct auth_cache *cache, struct auth_cache_node *node) argument
149 if (node->prev != NULL)
150 node->prev->next = node->next;
153 cache->tail = node->next;
156 if (node->next != NULL)
157 node->next->prev = node->prev;
160 cache->head = node->prev;
166 struct auth_cache_node *node)
165 auth_cache_node_link_head(struct auth_cache *cache, struct auth_cache_node *node) argument
179 auth_cache_node_destroy(struct auth_cache *cache, struct auth_cache_node *node) argument
270 auth_cache_node_is_user(struct auth_cache_node *node, const char *username) argument
302 auth_cache_node_is_one_of_users(struct auth_cache_node *node, const char *const *usernames) argument
317 struct auth_cache_node *node, *next; local
372 struct auth_cache_node *node; local
415 struct auth_cache_node *node; local
477 struct auth_cache_node *node; local
[all...]
H A Dpassdb-cache.c72 struct auth_cache_node *node; local
80 &node, &value, &neg_expired))
122 !(node->last_success || neg_expired));
124 if (ret == 0 && (node->last_success || neg_expired)) {
129 node->last_success = FALSE;
133 node->last_success = ret > 0;
153 struct auth_cache_node *node; local
160 &node, &value, &neg_expired))
/dovecot/src/lib-storage/index/
H A Dindex-thread-links.c12 struct mail_thread_node *node; local
17 node = array_idx_get_space(&cache->thread_nodes, msgid_idx);
18 if (node->uid == 0)
19 node->uid = uid;
23 node->expunge_rebuilds = TRUE;
26 node = array_idx_get_space(&cache->thread_nodes, msgid_idx);
27 node->uid = uid;
33 const struct mail_thread_node *node,
36 while (node != ancestor) {
37 if (node
32 thread_node_has_ancestor(struct mail_thread_cache *cache, const struct mail_thread_node *node, const struct mail_thread_node *ancestor) argument
48 struct mail_thread_node *node, *parent, *child; local
149 struct mail_thread_node *node; local
199 struct mail_thread_node *node; local
[all...]
H A Dindex-thread-finish.c16 /* node.idx usually points to indexes from mail hash. However
19 struct mail_thread_child_node node; member in struct:mail_thread_root_node
22 root_idx1 is node's index in roots[] array + 1.
29 /* a dummy node */
31 /* ignore this node - it's a dummy without children */
66 struct mail_thread_root_node *node)
86 hash_table_insert(ctx->subject_hash, hash_subject, node);
99 (node->dummy ||
101 hash_node->parent_root_idx1 = node->root_idx1;
102 hash_table_update(ctx->subject_hash, hash_subject, node);
65 add_base_subject(struct subject_gather_context *ctx, const char *subject, struct mail_thread_root_node *node) argument
135 const struct mail_thread_node *node; local
418 const struct mail_thread_node *node; local
462 const struct mail_thread_node *node, *parent; local
[all...]
H A Dindex-thread-private.h29 /* Index for this node's parent node, 0 = this is root */
32 link, i.e. "number of links to parent node". However since parents
39 /* If a link between this node and its child gets unreferenced,
44 #define MAIL_THREAD_NODE_EXISTS(node) \
45 ((node)->uid != 0)
/dovecot/src/plugins/fts-squat/
H A Dsquat-trie-private.h32 node file: FIXME: no up-to-date
37 node[] {
40 packed neg_diff_to_first_child_offset; // relative to node
62 /* This node's children are in a sequential array, meaning that the
66 /* Number of UIDs that exists in parent node but not in this one
67 (i.e. number of UIDs [0..next_uid-1] not in this node's uidlist).
69 the UID to be relative to this node's UID list. */
72 /* next_uid=0 means there are no UIDs in this node, otherwise
73 next_uid-1 is the last UID added to this node. */
92 /* Return pointer to node
[all...]
H A Dsquat-trie.c46 struct squat_node *node; member in struct:squat_trie_iterate_node
107 static void node_free(struct squat_trie *trie, struct squat_node *node) argument
112 if (node->leaf_string_length > 0) {
113 if (NODE_IS_DYNAMIC_LEAF(node))
114 i_free(node->children.leaf_string);
115 } else if (!node->children_not_mapped) {
116 children = NODE_CHILDREN_NODES(node);
119 NODE_CHILDREN_ALLOC_SIZE(node->child_count);
120 for (i = 0; i < node->child_count; i++)
123 i_free(node
335 node_make_sequential(struct squat_trie *trie, struct squat_node *node, int level) argument
365 node_add_child(struct squat_trie *trie, struct squat_node *node, unsigned char chr, int level) argument
428 node_read_children(struct squat_trie *trie, struct squat_node *node, int level) argument
576 node_write_children(struct squat_trie_build_context *ctx, struct squat_node *node, const uoff_t *node_offsets) argument
634 node_add_uid(struct squat_trie_build_context *ctx, uint32_t uid, struct squat_node *node) argument
650 node_split_string(struct squat_trie_build_context *ctx, struct squat_node *node) argument
698 node_leaf_string_add_or_split(struct squat_trie_build_context *ctx, struct squat_node *node, const unsigned char *data, unsigned int data_len) argument
730 struct squat_node *node = &trie->root; local
971 node_drop_unused_children(struct squat_trie *trie, struct squat_node *node) argument
1000 squat_write_node(struct squat_trie_build_context *ctx, struct squat_node *node, uoff_t *node_offset_r, int level) argument
1085 struct squat_trie_iterate_node *node; local
1300 struct squat_node *node; local
1346 struct squat_node *node; local
1773 struct squat_node *node = &trie->root; local
[all...]

Completed in 66 milliseconds

12