Searched defs:key (Results 1 - 25 of 219) sorted by relevance

123456789

/dovecot/src/lib-storage/
H A Dmail-search-mime-register.h8 const char *key; member in struct:mail_search_mime_register_arg
25 /* Find key's registered arg, or NULL if not found. */
27 mail_search_mime_register_find(const char *key);
H A Dmail-search-register.h8 const char *key; member in struct:mail_search_register_arg
17 const char *key);
26 "unknown key" error. */
35 /* Find key's registered arg, or NULL if not found. */
37 mail_search_register_find(struct mail_search_register *reg, const char *key);
/dovecot/src/lib/
H A Dsort.c9 int bsearch_strcmp(const char *key, const char *const *member) argument
11 return strcmp(key, *member);
14 int bsearch_strcasecmp(const char *key, const char *const *member) argument
16 return strcasecmp(key, *member);
H A Dtest-hash.c12 unsigned int i, key, keyidx, delidx; local
17 key = (i_rand() % KEYMAX) + 1;
19 if (hash_table_lookup(hash, POINTER_CAST(key)) == NULL) {
20 hash_table_insert(hash, POINTER_CAST(key),
22 keys[keyidx++] = key;
H A Dbsearch-insert-pos.c8 bool bsearch_insert_pos(const void *key, const void *base, unsigned int nmemb, argument
23 ret = cmp(key, p);
41 bool array_bsearch_insert_pos_i(const struct array *array, const void *key, argument
45 return bsearch_insert_pos(key, array->buffer->data,
H A Devent-filter.h7 const char *key; member in struct:event_filter_field
14 /* key=NULL-terminated list of key=value fields */
H A Djson-tree.h10 /* object key, or NULL if we're in a list */
11 const char *key; member in struct:json_tree_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
60 const char *key, const char *value);
H A Dstr-table.c24 char *key; local
30 while (hash_table_iterate(iter, table->hash, &key, &value))
31 i_free(key);
44 char *key; local
48 if (!hash_table_lookup_full(table->hash, str, &key, &value)) {
49 key = i_strdup(str);
56 hash_table_update(table->hash, key, POINTER_CAST(ref));
57 return key;
62 char *key; local
66 if (!hash_table_lookup_full(table->hash, *str, &key,
[all...]
H A Dtest-bsearch-insert-pos.c20 unsigned int key, len, i, idx; local
26 for (key = 0; key < max_key; key++) {
27 if (bsearch_insert_pos(&key, cur, len, sizeof(*cur),
29 success = cur[idx] == key;
31 success = cur[0] > key;
33 success = cur[len-1] < key;
35 success = cur[idx-1] < key &&
36 cur[idx+1] > key;
[all...]
H A Dtest-hmac.c11 const unsigned char *key; member in struct:test_vector
63 /* "This is a test using a larger than block-size key and a larger than block-size data. The key needs to be hashed before being used by the HMAC algorithm." */
74 hmac_init(&ctx, vec->key, vec->key_len, hash_method_lookup(vec->prf));
90 tmp = t_hmac_data(hash_method_lookup(vec->prf), vec->key, vec->key_len,
H A Dvar-expand-private.h30 const char *key, const char *field,
34 const char *key; member in struct:var_expand_extension_func_table
53 const char *key, const char *field,
H A Dvar-expand.h5 char key; member in struct:var_expand_table
11 const char *key; member in struct:var_expand_func_table
12 /* %{key:data}, or data is "" with %{key}.
19 table must end with key = 0. Returns 1 on success, 0 if the format string
33 /* Returns the actual key character for given string, ie. skip any modifiers
38 keys size=1, while for e.g. %{key} size=3 and idx points to 'k'. */
41 /* Returns TRUE if key variable is used in the string.
42 If key is '\0', it's ignored. If long_key is NULL, it's ignored. */
43 bool var_has_key(const char *str, char key, cons
[all...]
H A Dhmac.c15 void hmac_init(struct hmac_context *_ctx, const unsigned char *key, argument
30 meth->loop(ctx->ctx, key, key_len);
32 key = hashedkey;
36 memcpy(k_ipad, key, key_len);
65 const unsigned char *key, size_t key_len,
70 i_assert(key != NULL && key_len > 0);
74 hmac_init(&ctx, key, key_len, meth);
83 const unsigned char *key, size_t key_len,
86 return t_hmac_data(meth, key, key_len, data->data, data->used);
90 const unsigned char *key, size_
64 t_hmac_data(const struct hash_method *meth, const unsigned char *key, size_t key_len, const void *data, size_t data_len) argument
82 t_hmac_buffer(const struct hash_method *meth, const unsigned char *key, size_t key_len, const buffer_t *data) argument
89 t_hmac_str(const struct hash_method *meth, const unsigned char *key, size_t key_len, const char *data) argument
[all...]
/dovecot/src/plugins/mail-crypt/
H A Dmail-crypt-global-key.h5 struct dcrypt_private_key *key; member in struct:mail_crypt_global_private_key
H A Dtest-mail-global-key.c11 #include "mail-crypt-key.h"
75 /* public key id checks */
81 const struct mail_crypt_global_private_key *key = local
85 test_assert(dcrypt_key_id_private(key->key, MAIL_CRYPT_KEY_ID_ALGORITHM, key_id, &error) == TRUE);
88 key = array_idx(&keys.private_keys, 1);
90 test_assert(dcrypt_key_id_private(key->key, MAIL_CRYPT_KEY_ID_ALGORITHM, key_id, &error) == TRUE);
/dovecot/src/auth/
H A Dauth-fields.h14 const char *key, *value; member in struct:auth_field
21 const char *key, const char *value,
24 void auth_fields_remove(struct auth_fields *fields, const char *key);
26 const char *auth_fields_find(struct auth_fields *fields, const char *key);
27 bool auth_fields_exists(struct auth_fields *fields, const char *key);
39 /* If the field exists, clear its value (so the exported string will be "key"
40 instead of e.g. "key=y"). */
41 void auth_fields_booleanize(struct auth_fields *fields, const char *key);
H A Ddb-dict-cache-key.c12 const struct db_dict_key *key; local
14 array_foreach(keys, key) {
15 if (strcmp(key->name, name) == 0)
16 return key;
28 const struct db_dict_key *key; local
49 key = db_dict_set_key_find(keys, name);
50 if (key != NULL)
51 str_printfa(str, "\t%s", key->key);
63 str_printfa(str, "\t%s", (*keyp)->key);
[all...]
H A Dmycrypt.c20 char *mycrypt(const char *key, const char *salt) argument
22 return crypt(key, salt);
H A Dcheckpassword-reply.c14 const char *extra_env, *key, *value, *const *tmp; local
76 key = t_str_lcase(*tmp);
77 if (strcmp(key, "userdb_uid") == 0)
79 else if (strcmp(key, "userdb_gid") == 0)
81 str_append_tabescaped(str, key);
H A Dpassdb-template.c16 const char *const *tmp, *key, *value; local
26 key = *tmp;
28 key = t_strdup_until(*tmp, value++);
30 if (*key == '\0')
31 i_fatal("Invalid passdb template %s - key must not be empty",
34 key = p_strdup(pool, key);
36 array_append(&tmpl->args, &key, 1);
76 const char *key, const char **value_r)
84 if (strcmp(args[i], key)
75 passdb_template_remove(struct passdb_template *tmpl, const char *key, const char **value_r) argument
[all...]
/dovecot/src/lib-mail/
H A Dtest-rfc822-parser.c45 const char *key, *value; member in struct:__anon119
51 const char *key, *value; local
57 while ((ret = rfc822_parse_content_param(&parser, &key, &value)) > 0 &&
59 test_assert_idx(strcmp(output[i].key, key) == 0, i);
/dovecot/src/doveadm/
H A Ddoveadm-print-private.h7 const char *key; member in struct:doveadm_print_header
/dovecot/src/lib-dict/
H A Ddict-transaction-memory.c24 const char *key, const char *value)
32 change->key = p_strdup(ctx->pool, key);
37 const char *key)
45 change->key = p_strdup(ctx->pool, key);
49 const char *key, long long diff)
57 change->key = p_strdup(ctx->pool, key);
23 dict_transaction_memory_set(struct dict_transaction_context *_ctx, const char *key, const char *value) argument
36 dict_transaction_memory_unset(struct dict_transaction_context *_ctx, const char *key) argument
48 dict_transaction_memory_atomic_inc(struct dict_transaction_context *_ctx, const char *key, long long diff) argument
H A Ddict-transaction-memory.h14 const char *key; member in struct:dict_transaction_memory_change
32 const char *key, const char *value);
34 const char *key);
36 const char *key, long long diff);
/dovecot/src/lib-fts/
H A Dfts-filter-lowercase.c23 const char *key = settings[i], *value = settings[i+1]; local
25 if (strcmp(key, "maxlen") == 0) {
33 *error_r = t_strdup_printf("Unknown setting: %s", key);

Completed in 111 milliseconds

123456789