Searched refs:SMALLEST (Results 1 – 3 of 3) sorted by relevance
| /freebsd-12.1/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
| H A D | trees.c | 426 #define SMALLEST 1 macro
436 top = s->heap[SMALLEST]; \
437 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
438 pqdownheap(s, tree, SMALLEST); \
670 m = s->heap[SMALLEST]; /* m = node of next least frequency */
687 s->heap[SMALLEST] = node++;
688 pqdownheap(s, tree, SMALLEST);
692 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /freebsd-12.1/sys/contrib/zlib/ |
| 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];
|
| /freebsd-12.1/sys/libkern/ |
| H A D | zlib.c | 2191 #define SMALLEST 1 macro
2201 top = s->heap[SMALLEST]; \
2202 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2203 pqdownheap(s, tree, SMALLEST); \
2435 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2451 s->heap[SMALLEST] = node++;
2452 pqdownheap(s, tree, SMALLEST);
2456 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|