Home
last modified time | relevance | path

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

/mirbsd/src/kern/z/
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];
/mirbsd/src/gnu/usr.bin/perl/pod/
Dperldebguts.pod798 =item C<buckets SMALLEST(APPROX)..GREATEST(APPROX)>
819 of buckets of each size between C<SMALLEST> and C<GREATEST>. In
Dperltoc.pod4684 C<buckets SMALLEST(APPROX)..GREATEST(APPROX)>, Free/Used, C<Total sbrk():