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

/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/
H A Dtrees.c450 #define SMALLEST 1 macro
460 top = s->heap[SMALLEST]; \
461 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
462 pqdownheap(s, tree, SMALLEST); \
655 * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
694 m = s->heap[SMALLEST]; /* m = node of next least frequency */
711 s->heap[SMALLEST] = node++;
712 pqdownheap(s, tree, SMALLEST);
716 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
/openjdk7/jdk/src/share/back/
H A DoutStream.c36 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b) macro
109 jint segSize = SMALLEST(2 * stream->segment->length, MAX_SEGMENT_SIZE);
126 count = SMALLEST(size, stream->left);
H A DinStream.c35 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b) macro

Completed in 41 milliseconds