Home
last modified time | relevance | path

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

/titanic_53/usr/src/boot/lib/libz/
H A Dtrees.c424 #define SMALLEST 1 macro
434 top = s->heap[SMALLEST]; \
435 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
436 pqdownheap(s, tree, SMALLEST); \
668 m = s->heap[SMALLEST]; /* m = node of next least frequency */
685 s->heap[SMALLEST] = node++;
686 pqdownheap(s, tree, SMALLEST);
690 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/titanic_53/usr/src/contrib/zlib/
H A Dtrees.c422 #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];
/titanic_53/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1784 #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];
/titanic_53/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2587 #define SMALLEST 1 macro
2598 top = s->heap[SMALLEST]; \
2599 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2600 pqdownheap(s, tree, SMALLEST); \
2859 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2877 s->heap[SMALLEST] = node++;
2878 pqdownheap(s, tree, SMALLEST);
2882 s->heap[--(s->heap_max)] = s->heap[SMALLEST];