Searched refs:SMALLEST (Results 1 – 5 of 5) sorted by relevance
| /dragonfly/sys/vfs/hammer2/zlib/ |
| H A D | hammer2_zlib_trees.c | 428 #define SMALLEST 1 macro
438 top = s->heap[SMALLEST]; \
439 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
440 pqdownheap(s, tree, SMALLEST); \
673 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
690 s->heap[SMALLEST] = node++; in build_tree()
691 pqdownheap(s, tree, SMALLEST); in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
|
| /dragonfly/contrib/zlib-1.2/ |
| H A D | trees.c | 422 #define SMALLEST 1 macro
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /dragonfly/usr.sbin/makefs/hammer2/zlib/ |
| H A D | hammer2_zlib_trees.c | 428 #define SMALLEST 1 macro
438 top = s->heap[SMALLEST]; \
439 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
440 pqdownheap(s, tree, SMALLEST); \
673 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
690 s->heap[SMALLEST] = node++; in build_tree()
691 pqdownheap(s, tree, SMALLEST); in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
|
| /dragonfly/sbin/hammer2/zlib/ |
| H A D | hammer2_zlib_trees.c | 428 #define SMALLEST 1 macro
438 top = s->heap[SMALLEST]; \
439 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
440 pqdownheap(s, tree, SMALLEST); \
673 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
690 s->heap[SMALLEST] = node++; in build_tree()
691 pqdownheap(s, tree, SMALLEST); in build_tree()
695 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
|
| /dragonfly/sys/net/ |
| H A D | zlib.c | 2176 #define SMALLEST 1 macro
2186 top = s->heap[SMALLEST]; \
2187 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2188 pqdownheap(s, tree, SMALLEST); \
2429 m = s->heap[SMALLEST]; /* m = node of next least frequency */ in build_tree()
2445 s->heap[SMALLEST] = node++; in build_tree()
2446 pqdownheap(s, tree, SMALLEST); in build_tree()
2450 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
|