Home
last modified time | relevance | path

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

/openbmc/linux/lib/zlib_deflate/
H A Ddeftree.c376 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
378 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
500 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
538 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
539 s->heap[--(s->heap_max)] = m; in build_tree()
557 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
H A Ddefutil.h183 int heap_max; /* element of largest frequency */ member
/openbmc/u-boot/lib/zlib/
H A Dtrees.c516 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
518 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
638 s->heap_len = 0, s->heap_max = HEAP_SIZE;
676 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
677 s->heap[--(s->heap_max)] = m;
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
H A Ddeflate.h205 int heap_max; /* element of largest frequency */ member