Home
last modified time | relevance | path

Searched refs:pqdownheap (Results 1 – 5 of 5) sorted by relevance

/third_party/skia/third_party/externals/zlib/
Dtrees.c140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
434 pqdownheap(s, tree, SMALLEST); \
451 local void pqdownheap(s, tree, k) in pqdownheap() function
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
684 pqdownheap(s, tree, SMALLEST);
/third_party/libwebsockets/win32port/zlib/
Dtrees.c145 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
442 pqdownheap(s, tree, SMALLEST); \
459 local void pqdownheap(s, tree, k) in pqdownheap() function
666 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
692 pqdownheap(s, tree, SMALLEST);
/third_party/zlib/
Dtrees.c140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
434 pqdownheap(s, tree, SMALLEST); \
451 local void pqdownheap(s, tree, k) in pqdownheap() function
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
684 pqdownheap(s, tree, SMALLEST);
/third_party/node/deps/v8/third_party/zlib/
Dtrees.c140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
434 pqdownheap(s, tree, SMALLEST); \
451 local void pqdownheap(s, tree, k) in pqdownheap() function
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
684 pqdownheap(s, tree, SMALLEST);
/third_party/node/deps/zlib/
Dtrees.c490 pqdownheap(s, tree, SMALLEST); \
507 local void pqdownheap(deflate_state *s, ct_data *tree, int k) { in pqdownheap() function
665 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n); in build_tree()
691 pqdownheap(s, tree, SMALLEST); in build_tree()