Searched refs:nlen (Results 1 – 5 of 5) sorted by relevance
/optee_os-3.20.0/ta/pkcs11/src/ |
A D | serializer.c | 179 size_t nlen = 0; in serialize() local 181 if (ADD_OVERFLOW(*blen, len, &nlen)) in serialize() 184 buf = TEE_Realloc(*bstart, nlen); in serialize() 190 *blen = nlen; in serialize()
|
/optee_os-3.20.0/core/kernel/ |
A D | lockdep.c | 159 size_t nlen = qe->pathlen + 1; in lockdep_graph_get_shortest_cycle() local 166 nlen * sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle() 174 qe->path[nlen - 1] = 0; in lockdep_graph_get_shortest_cycle() 180 size_t nlen = 0; in lockdep_graph_get_shortest_cycle() local 185 nlen = qe->pathlen + 1; in lockdep_graph_get_shortest_cycle() 190 nqe->path = malloc(nlen * sizeof(uintptr_t)); in lockdep_graph_get_shortest_cycle() 193 nqe->pathlen = nlen; in lockdep_graph_get_shortest_cycle() 196 nqe->path[nlen - 1] = e->to->lock_id; in lockdep_graph_get_shortest_cycle()
|
/optee_os-3.20.0/core/lib/zlib/ |
A D | inflate.h | 117 unsigned nlen; /* number of length code lengths */ member
|
A D | inflate.c | 936 state->nlen = BITS(5) + 257; 943 if (state->nlen > 286 || state->ndist > 30) { 976 while (state->have < state->nlen + state->ndist) { 1013 if (state->have + copy > state->nlen + state->ndist) { 1039 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next), 1048 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
/optee_os-3.20.0/lib/libmbedtls/mbedtls/library/ |
A D | ecp_curves.c | 611 const mbedtls_mpi_uint *n, size_t nlen) in ecp_group_load() argument 617 ecp_mpi_load( &grp->N, n, nlen ); in ecp_group_load()
|
Completed in 9 milliseconds