sbin/hammer2/zlib/hammer2_zlib_trees.c

438

top = s->heap[SMALLEST]; \

sbin/hammer2/zlib/hammer2_zlib_trees.c

439

s->heap[SMALLEST] = s->heap[s->heap_len--]; \

sbin/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

sbin/hammer2/zlib/hammer2_zlib_trees.c

673

m = s->heap[SMALLEST]; /* m = node of next least frequency */

sbin/hammer2/zlib/hammer2_zlib_trees.c

690

s->heap[SMALLEST] = node++;

sbin/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

sbin/hammer2/zlib/hammer2_zlib_trees.c

695

s->heap[--(s->heap_max)] = s->heap[SMALLEST];

sys/net/zlib.c

2186

top = s->heap[SMALLEST]; \

sys/net/zlib.c

2187

s->heap[SMALLEST] = s->heap[s->heap_len--]; \

sys/net/zlib.c

2188

pqdownheap(s, tree, SMALLEST); \

sys/net/zlib.c

2429

m = s->heap[SMALLEST]; /* m = node of next least frequency */

sys/net/zlib.c

2445

s->heap[SMALLEST] = node++;

sys/net/zlib.c

2446

pqdownheap(s, tree, SMALLEST);

sys/net/zlib.c

2450

s->heap[--(s->heap_max)] = s->heap[SMALLEST];

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

438

top = s->heap[SMALLEST]; \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

439

s->heap[SMALLEST] = s->heap[s->heap_len--]; \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

673

m = s->heap[SMALLEST]; /* m = node of next least frequency */

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

690

s->heap[SMALLEST] = node++;

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

sys/vfs/hammer2/zlib/hammer2_zlib_trees.c

695

s->heap[--(s->heap_max)] = s->heap[SMALLEST];

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

438

top = s->heap[SMALLEST]; \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

439

s->heap[SMALLEST] = s->heap[s->heap_len--]; \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

440

pqdownheap(s, tree, SMALLEST); \

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

673

m = s->heap[SMALLEST]; /* m = node of next least frequency */

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

690

s->heap[SMALLEST] = node++;

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

691

pqdownheap(s, tree, SMALLEST);

usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c

695

s->heap[--(s->heap_max)] = s->heap[SMALLEST];