Home
last modified time | relevance | path

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

/optee_os/core/lib/libtomcrypt/src/pk/asn1/der/set/
H A Dder_encode_setof.c59 struct edge *edges; in der_encode_setof() local
82 edges = XCALLOC(inlen, sizeof(*edges)); in der_encode_setof()
83 if (edges == NULL) { in der_encode_setof()
105 edges[x].start = ptr; in der_encode_setof()
113 edges[x].size = y; in der_encode_setof()
116 edges[x].size = 0; in der_encode_setof()
118 edges[x].size = (edges[x].size << 8) | ((unsigned long)ptr[z++]); in der_encode_setof()
123 edges[x].size += z; in der_encode_setof()
124 ptr += edges[x].size; in der_encode_setof()
129 XQSORT(edges, inlen, sizeof(*edges), &s_qsort_helper); in der_encode_setof()
[all …]
/optee_os/core/kernel/
H A Dlockdep.c39 STAILQ_INIT(&node->edges); in lockdep_add_to_graph()
85 STAILQ_FOREACH(edge, &from->edges, link) in lockdep_add_edge()
96 STAILQ_INSERT_TAIL(&from->edges, edge, link); in lockdep_add_edge()
156 STAILQ_FOREACH(e, &n->edges, link) { in lockdep_graph_get_shortest_cycle()
223 STAILQ_FOREACH(e, &node->edges, link) { in lockdep_visit()
262 STAILQ_FOREACH(edge, &node->edges, link) in lockdep_find_edge()
432 STAILQ_FOREACH_SAFE(edge, &node->edges, link, next) in lockdep_node_delete()
474 edge = STAILQ_FIRST(&from->edges); in lockdep_node_destroy()
476 STAILQ_REMOVE_HEAD(&from->edges, link); in lockdep_node_destroy()
478 edge = STAILQ_FIRST(&from->edges); in lockdep_node_destroy()
[all …]
/optee_os/core/include/kernel/
H A Dlockdep.h33 struct lockdep_edge_head edges; member