Home
last modified time | relevance | path

Searched refs:pkcs2tee_algo (Results 1 – 3 of 3) sorted by relevance

/optee_os/ta/pkcs11/src/
H A Dprocessing_digest.c45 } pkcs2tee_algo[] = { in pkcs2tee_algorithm() local
55 for (n = 0; n < ARRAY_SIZE(pkcs2tee_algo); n++) { in pkcs2tee_algorithm()
56 if (proc_params->id == pkcs2tee_algo[n].mech_id) { in pkcs2tee_algorithm()
57 *tee_id = pkcs2tee_algo[n].tee_id; in pkcs2tee_algorithm()
H A Dprocessing_asymm.c65 } pkcs2tee_algo[] = { in pkcs2tee_algorithm() local
107 for (n = 0; n < ARRAY_SIZE(pkcs2tee_algo); n++) { in pkcs2tee_algorithm()
108 if (pkcs2tee_algo[n].mech_id == proc_params->id) { in pkcs2tee_algorithm()
109 *tee_id = pkcs2tee_algo[n].tee_id; in pkcs2tee_algorithm()
110 *tee_hash_id = pkcs2tee_algo[n].tee_hash_id; in pkcs2tee_algorithm()
115 if (n == ARRAY_SIZE(pkcs2tee_algo)) in pkcs2tee_algorithm()
H A Dprocessing_symm.c66 } pkcs2tee_algo[] = { in pkcs2tee_algorithm() local
93 for (n = 0; n < ARRAY_SIZE(pkcs2tee_algo); n++) { in pkcs2tee_algorithm()
94 if (proc_params->id == pkcs2tee_algo[n].mech_id) { in pkcs2tee_algorithm()
95 *tee_id = pkcs2tee_algo[n].tee_id; in pkcs2tee_algorithm()