Home
last modified time | relevance | path

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

/freebsd-9-stable/lib/libz/
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];
/freebsd-9-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
Dtrees.c426 #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-9-stable/sys/net/
Dzlib.c2184 #define SMALLEST 1 macro
2194 top = s->heap[SMALLEST]; \
2195 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2196 pqdownheap(s, tree, SMALLEST); \
2428 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2444 s->heap[SMALLEST] = node++;
2445 pqdownheap(s, tree, SMALLEST);
2449 s->heap[--(s->heap_max)] = s->heap[SMALLEST];