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

/freebsd-10.0-release/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); \
629 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
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-10.0-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A 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); \
631 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
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-10.0-release/sys/net/
H A Dzlib.c2191 #define SMALLEST 1 macro
2201 top = s->heap[SMALLEST]; \
2202 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
2203 pqdownheap(s, tree, SMALLEST); \
2396 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
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];

Completed in 115 milliseconds