Searched refs:SMALLEST (Results 1 – 3 of 3) sorted by relevance
| /illumos-gate/usr/src/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];
|
| /illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
| H A D | zlib.c | 1784 #define SMALLEST 1 macro
1794 top = s->heap[SMALLEST]; \
1795 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
1796 pqdownheap(s, tree, SMALLEST); \
2028 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2044 s->heap[SMALLEST] = node++;
2045 pqdownheap(s, tree, SMALLEST);
2049 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
| H A D | zlib.c | 2585 #define SMALLEST 1 macro
2596 top = s->heap[SMALLEST]; \
2597 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2598 pqdownheap(s, tree, SMALLEST); \
2857 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2875 s->heap[SMALLEST] = node++;
2876 pqdownheap(s, tree, SMALLEST);
2880 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|