Home
last modified time | relevance | path

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

/dragonfly/sbin/hammer2/zlib/
HDhammer2_zlib_trees.c513 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
515 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
637 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
675 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
676 s->heap[--(s->heap_max)] = m; in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
HDhammer2_zlib_deflate.h199 int heap_max; /* element of largest frequency */ member
/dragonfly/sys/vfs/hammer2/zlib/
HDhammer2_zlib_trees.c513 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
515 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
637 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
675 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
676 s->heap[--(s->heap_max)] = m; in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
HDhammer2_zlib_deflate.h199 int heap_max; /* element of largest frequency */ member
/dragonfly/contrib/zlib-1.2/
HDtrees.c508 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
510 for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
630 s->heap_len = 0, s->heap_max = HEAP_SIZE;
668 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
669 s->heap[--(s->heap_max)] = m;
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
HDdeflate.h211 int heap_max; /* element of largest frequency */ member
/dragonfly/usr.sbin/makefs/hammer2/zlib/
HDhammer2_zlib_trees.c513 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
515 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
637 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
675 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
676 s->heap[--(s->heap_max)] = m; in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
HDhammer2_zlib_deflate.h199 int heap_max; /* element of largest frequency */ member
/dragonfly/sys/net/
HDzlib.c464 int heap_max; /* element of largest frequency */ member
2266 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */ in gen_bitlen()
2268 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
2393 s->heap_len = 0, s->heap_max = HEAP_SIZE; in build_tree()
2431 s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */ in build_tree()
2432 s->heap[--(s->heap_max)] = m; in build_tree()
2450 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()