39     size_t index; /* Constant index in elements[] */
51     struct pq_elem_st *elements;  member
55     size_t freelist; /* Index into elements[], start of free element list */
59  * The initial and maximum number of elements in the heap.
67     assert(pq->elements[pq->heap[idx].index].used); \
68     assert(pq->elements[pq->heap[idx].index].posn == idx)
70     assert(pq->elements[elem].used)
106     struct pq_elem_st *e = pq->elements;  in pqueue_swap_elem()
122     struct pq_elem_st *e = pq->elements;  in pqueue_move_elem()
204     pq->freelist = pq->elements[m].posn;  in ossl_pqueue_push()
209     pq->elements[m].posn = n;  in ossl_pqueue_push()
211     pq->elements[m].used = 1;  in ossl_pqueue_push()
245     pq->elements[elem].posn = pq->freelist;  in ossl_pqueue_pop()
248     pq->elements[elem].used = 0;  in ossl_pqueue_pop()
261     n = pq->elements[elem].posn;  in ossl_pqueue_remove()
266         pq->elements[elem].posn = pq->freelist;  in ossl_pqueue_remove()
269         pq->elements[elem].used = 0;  in ossl_pqueue_remove()
280     struct pq_elem_st *e = pq->elements;  in pqueue_add_freelist()
316     e = OPENSSL_realloc(pq->elements, new_max * sizeof(*pq->elements));  in ossl_pqueue_reserve()
319     pq->elements = e;  in ossl_pqueue_reserve()
341     pq->elements = OPENSSL_malloc(sizeof(*pq->elements) * min_nodes);  in ossl_pqueue_new()
342     if (pq->heap == NULL || pq->elements == NULL) {  in ossl_pqueue_new()
354         OPENSSL_free(pq->elements);  in ossl_pqueue_free()