Searched refs:SMALLEST (Results 1 – 6 of 6) sorted by relevance
| /external/zlib/src/ |
| D | trees.c | 422 #define SMALLEST 1 macro
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /external/syslinux/com32/lib/zlib/ |
| D | trees.c | 430 #define SMALLEST 1 macro
440 top = s->heap[SMALLEST]; \
441 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
442 pqdownheap(s, tree, SMALLEST); \
674 m = s->heap[SMALLEST]; /* m = node of next least frequency */
691 s->heap[SMALLEST] = node++;
692 pqdownheap(s, tree, SMALLEST);
696 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /external/python/cpython2/Modules/zlib/ |
| D | trees.c | 424 #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];
|
| /external/python/cpython3/Modules/zlib/ |
| D | trees.c | 422 #define SMALLEST 1 macro
432 top = s->heap[SMALLEST]; \
433 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
434 pqdownheap(s, tree, SMALLEST); \
666 m = s->heap[SMALLEST]; /* m = node of next least frequency */
683 s->heap[SMALLEST] = node++;
684 pqdownheap(s, tree, SMALLEST);
688 s->heap[--(s->heap_max)] = s->heap[SMALLEST];
|
| /external/oj-libjdwp/src/share/back/ |
| D | outStream.c | 36 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b) macro
109 jint segSize = SMALLEST(2 * stream->segment->length, MAX_SEGMENT_SIZE); in writeBytes()
126 count = SMALLEST(size, stream->left); in writeBytes()
|
| D | inStream.c | 35 #define SMALLEST(a, b) ((a) < (b)) ? (a) : (b) macro
|