Searched refs:SMALLEST (Results 1 – 3 of 3) sorted by relevance
| /titanic_41/usr/src/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];
|
| /titanic_41/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];
|
| /titanic_41/usr/src/uts/common/io/ppp/spppcomp/ |
| H A D | zlib.c | 2587 #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];
|