Home
last modified time | relevance | path

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

/external/llvm-project/llvm/test/Transforms/GVNHoist/
Dpr35222-hoist-load.ll18 %cmp = call i1 @pqdownheap(i32 %tmp9)
26 declare i1 @pqdownheap(i32)
/external/rust/crates/libz-sys/src/zlib-ng/
Dtrees.c69 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
135 pqdownheap(s, tree, SMALLEST); \
152 static void pqdownheap(deflate_state *s, ct_data *tree, int k) { in pqdownheap() function
368 pqdownheap(s, tree, n); in build_tree()
394 pqdownheap(s, tree, SMALLEST); in build_tree()
/external/rust/crates/libz-sys/src/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);
/external/angle/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);
/external/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);
/external/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);
/external/python/cpython2/Modules/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);