Home
last modified time | relevance | path

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

/optee_os-3.20.0/ta/pkcs11/src/
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()
A Dprocessing_asymm.c63 } pkcs2tee_algo[] = { in pkcs2tee_algorithm() local
104 for (n = 0; n < ARRAY_SIZE(pkcs2tee_algo); n++) { in pkcs2tee_algorithm()
105 if (pkcs2tee_algo[n].mech_id == proc_params->id) { in pkcs2tee_algorithm()
106 *tee_id = pkcs2tee_algo[n].tee_id; in pkcs2tee_algorithm()
107 *tee_hash_id = pkcs2tee_algo[n].tee_hash_id; in pkcs2tee_algorithm()
112 if (n == ARRAY_SIZE(pkcs2tee_algo)) in pkcs2tee_algorithm()
A Dprocessing_symm.c65 } pkcs2tee_algo[] = { in pkcs2tee_algorithm() local
91 for (n = 0; n < ARRAY_SIZE(pkcs2tee_algo); n++) { in pkcs2tee_algorithm()
92 if (proc_params->id == pkcs2tee_algo[n].mech_id) { in pkcs2tee_algorithm()
93 *tee_id = pkcs2tee_algo[n].tee_id; in pkcs2tee_algorithm()

Completed in 6 milliseconds