Home
last modified time | relevance | path

Searched refs:desc (Results 1 – 10 of 10) sorted by relevance

/lib/crypto/
Dpoly1305.c15 void poly1305_init_generic(struct poly1305_desc_ctx *desc, in poly1305_init_generic() argument
18 poly1305_core_setkey(&desc->core_r, key); in poly1305_init_generic()
19 desc->s[0] = get_unaligned_le32(key + 16); in poly1305_init_generic()
20 desc->s[1] = get_unaligned_le32(key + 20); in poly1305_init_generic()
21 desc->s[2] = get_unaligned_le32(key + 24); in poly1305_init_generic()
22 desc->s[3] = get_unaligned_le32(key + 28); in poly1305_init_generic()
23 poly1305_core_init(&desc->h); in poly1305_init_generic()
24 desc->buflen = 0; in poly1305_init_generic()
25 desc->sset = true; in poly1305_init_generic()
26 desc->rset = 2; in poly1305_init_generic()
[all …]
/lib/
Dlocking-selftest.c1456 #define DO_TESTCASE_1(desc, name, nr) \ argument
1457 print_testname(desc"/"#nr); \
1461 #define DO_TESTCASE_1B(desc, name, nr) \ argument
1462 print_testname(desc"/"#nr); \
1466 #define DO_TESTCASE_1RR(desc, name, nr) \ argument
1467 print_testname(desc"/"#nr); \
1472 #define DO_TESTCASE_1RRB(desc, name, nr) \ argument
1473 print_testname(desc"/"#nr); \
1479 #define DO_TESTCASE_3(desc, name, nr) \ argument
1480 print_testname(desc"/"#nr); \
[all …]
Ddigsig.c204 struct shash_desc *desc = NULL; in digsig_verify() local
234 desc = kzalloc(sizeof(*desc) + crypto_shash_descsize(shash), in digsig_verify()
236 if (!desc) in digsig_verify()
239 desc->tfm = shash; in digsig_verify()
241 crypto_shash_init(desc); in digsig_verify()
242 crypto_shash_update(desc, data, datalen); in digsig_verify()
243 crypto_shash_update(desc, sig, sizeof(*sh)); in digsig_verify()
244 crypto_shash_final(desc, hash); in digsig_verify()
246 kfree(desc); in digsig_verify()
Dcrc-t10dif.c68 } desc; in crc_t10dif_update() local
75 desc.shash.tfm = rcu_dereference(crct10dif_tfm); in crc_t10dif_update()
76 desc.crc = crc; in crc_t10dif_update()
77 err = crypto_shash_update(&desc.shash, buffer, len); in crc_t10dif_update()
82 return desc.crc; in crc_t10dif_update()
Ddynamic_debug.c564 static char *__dynamic_emit_prefix(const struct _ddebug *desc, char *buf) in __dynamic_emit_prefix() argument
569 if (desc->flags & _DPRINTK_FLAGS_INCL_TID) { in __dynamic_emit_prefix()
577 if (desc->flags & _DPRINTK_FLAGS_INCL_MODNAME) in __dynamic_emit_prefix()
579 desc->modname); in __dynamic_emit_prefix()
580 if (desc->flags & _DPRINTK_FLAGS_INCL_FUNCNAME) in __dynamic_emit_prefix()
582 desc->function); in __dynamic_emit_prefix()
583 if (desc->flags & _DPRINTK_FLAGS_INCL_LINENO) in __dynamic_emit_prefix()
585 desc->lineno); in __dynamic_emit_prefix()
594 static inline char *dynamic_emit_prefix(struct _ddebug *desc, char *buf) in dynamic_emit_prefix() argument
596 if (unlikely(desc->flags & _DPRINTK_FLAGS_INCL_ANY)) in dynamic_emit_prefix()
[all …]
/lib/pldmfw/
Dpldmfw_private.h151 #define pldm_next_desc_tlv(desc) \ argument
152 ((const struct __pldmfw_desc_tlv *)((desc)->data + \
153 get_unaligned_le16(&(desc)->size)))
165 #define pldm_for_each_desc_tlv(i, desc, start, count) \ argument
166 for ((i) = 0, (desc) = pldm_first_desc_tlv(start); \
168 (i)++, (desc) = pldm_next_desc_tlv(desc))
Dpldmfw.c268 struct pldmfw_desc_tlv *desc; in pldm_parse_desc_tlvs() local
290 desc = kzalloc(sizeof(*desc), GFP_KERNEL); in pldm_parse_desc_tlvs()
291 if (!desc) in pldm_parse_desc_tlvs()
294 desc->type = type; in pldm_parse_desc_tlvs()
295 desc->size = size; in pldm_parse_desc_tlvs()
296 desc->data = __desc->data; in pldm_parse_desc_tlvs()
298 list_add_tail(&desc->entry, &record->descs); in pldm_parse_desc_tlvs()
547 struct pldmfw_desc_tlv *desc, *d_safe; in pldmfw_free_priv() local
555 list_for_each_entry_safe(desc, d_safe, &record->descs, entry) { in pldmfw_free_priv()
556 list_del(&desc->entry); in pldmfw_free_priv()
[all …]
/lib/zlib_deflate/
Ddeftree.c134 static void gen_bitlen (deflate_state *s, tree_desc *desc);
136 static void build_tree (deflate_state *s, tree_desc *desc);
355 tree_desc *desc /* the tree descriptor */ in gen_bitlen() argument
358 ct_data *tree = desc->dyn_tree; in gen_bitlen()
359 int max_code = desc->max_code; in gen_bitlen()
360 const ct_data *stree = desc->stat_desc->static_tree; in gen_bitlen()
361 const int *extra = desc->stat_desc->extra_bits; in gen_bitlen()
362 int base = desc->stat_desc->extra_base; in gen_bitlen()
363 int max_length = desc->stat_desc->max_length; in gen_bitlen()
486 tree_desc *desc /* the tree descriptor */ in build_tree() argument
[all …]
/lib/math/
Drational-test.c26 static void get_desc(const struct rational_test_param *param, char *desc) in get_desc() argument
28 strscpy(desc, param->name, KUNIT_PARAM_DESC_SIZE); in get_desc()
/lib/reed_solomon/
Dtest_rslib.c316 static const char * const desc[] = { in ex_rs_helper() local
327 pr_info(" %s\n", desc[method]); in ex_rs_helper()