Searched refs:queue (Results 1 – 5 of 5) sorted by relevance
| /optee_os/core/kernel/ |
| H A D | lockdep.c | 110 static void lockdep_bfs_queue_delete(struct lockdep_bfs_head *queue) in lockdep_bfs_queue_delete() argument
115 TAILQ_FOREACH_SAFE(cur, queue, link, next) { in lockdep_bfs_queue_delete()
116 TAILQ_REMOVE(queue, cur, link); in lockdep_bfs_queue_delete()
130 struct lockdep_bfs_head queue; in lockdep_graph_get_shortest_cycle() local
134 TAILQ_INIT(&queue); in lockdep_graph_get_shortest_cycle()
146 TAILQ_INSERT_TAIL(&queue, qe, link); in lockdep_graph_get_shortest_cycle()
148 while (!TAILQ_EMPTY(&queue)) { in lockdep_graph_get_shortest_cycle()
152 qe = TAILQ_FIRST(&queue); in lockdep_graph_get_shortest_cycle()
154 TAILQ_REMOVE(&queue, qe, link); in lockdep_graph_get_shortest_cycle()
197 TAILQ_INSERT_TAIL(&queue, nqe, link); in lockdep_graph_get_shortest_cycle()
[all …]
|
| /optee_os/lib/libmbedtls/mbedtls/library/ |
| H A D | poly1305.c | 264 mbedtls_platform_zeroize(ctx->queue, sizeof(ctx->queue)); in mbedtls_poly1305_starts()
286 memcpy(&ctx->queue[ctx->queue_len], in mbedtls_poly1305_update()
295 memcpy(&ctx->queue[ctx->queue_len], in mbedtls_poly1305_update()
301 poly1305_process(ctx, 1U, ctx->queue, 1U); /* add padding bit */ in mbedtls_poly1305_update()
320 memcpy(ctx->queue, &input[offset], remaining); in mbedtls_poly1305_update()
332 ctx->queue[ctx->queue_len] = 1U; in mbedtls_poly1305_finish()
336 memset(&ctx->queue[ctx->queue_len], in mbedtls_poly1305_finish()
341 ctx->queue, 0U); /* Already padded above */ in mbedtls_poly1305_finish()
|
| /optee_os/lib/libmbedtls/mbedtls/include/mbedtls/ |
| H A D | poly1305.h | 42 uint8_t MBEDTLS_PRIVATE(queue)[16]; /** The current partial block of data. */
|
| /optee_os/core/include/kernel/ |
| H A D | lockdep.h | 69 void lockdep_queue_delete(struct lockdep_lock_head *queue);
|
| /optee_os/core/drivers/crypto/hisilicon/ |
| H A D | hisi_qm.c | 107 uint16_t queue; member
213 mb->queue = qnum; in qm_mb_init()
|