Home
last modified time | relevance | path

Searched refs:cmp (Results 1 – 4 of 4) sorted by relevance

/lib/
A Dlist_sort.c23 int (*cmp)(void *priv, struct list_head *a, in merge()
31 if ((*cmp)(priv, a, b) <= 0) { in merge()
52 int (*cmp)(void *priv, struct list_head *a, in merge_and_restore_back_links()
61 if ((*cmp)(priv, a, b) <= 0) { in merge_and_restore_back_links()
81 (*cmp)(priv, tail->next, tail->next); in merge_and_restore_back_links()
106 int (*cmp)(void *priv, struct list_head *a, in list_sort()
129 cur = merge(priv, cmp, part[lev], cur); in list_sort()
146 list = merge(priv, cmp, part[lev], list); in list_sort()
148 merge_and_restore_back_links(priv, cmp, head, part[max_lev], list); in list_sort()
248 list_sort(NULL, &head, cmp); in list_sort_test()
[all …]
/lib/crypto/
A Dasymmetric_type.c308 bool (*cmp)(const struct key *, const struct key_match_data *) = in asymmetric_key_match_preparse() local
317 cmp = asymmetric_key_cmp_partial; in asymmetric_key_match_preparse()
331 match_data->cmp = cmp; in asymmetric_key_match_preparse()
/lib/mbedtls/external/mbedtls/programs/psa/
A Dkey_ladder_demo.sh37 cmp input.txt hello_world.txt
/lib/mbedtls/external/mbedtls/library/
A Dbignum.c1119 int cmp = mbedtls_mpi_cmp_abs(A, B); in add_sub_mpi() local
1120 if (cmp >= 0) { in add_sub_mpi()
1125 X->s = cmp == 0 ? 1 : s; in add_sub_mpi()

Completed in 20 milliseconds