Searched refs:SMALLEST (Results 1 – 4 of 4) sorted by relevance
| /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/zlib/src/ |
| 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/pdfium/third_party/zlib_v128/ |
| 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 */ in build_tree()
685 s->heap[SMALLEST] = node++; in build_tree()
686 pqdownheap(s, tree, SMALLEST); in build_tree()
690 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
|
| /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];
|