OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:heap_max
(Results
1 - 8
of
8
) sorted by null
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_trees.c
481
* IN assertion: the fields freq and dad are set, heap[
heap_max
] and
510
tree[s->heap[s->
heap_max
]].Len = 0; /* root of the heap */
512
for (h = s->
heap_max
+1; h < HEAP_SIZE; h++) {
632
s->heap_len = 0, s->
heap_max
= HEAP_SIZE;
670
s->heap[--(s->
heap_max
)] = n; /* keep the nodes sorted by frequency */
671
s->heap[--(s->
heap_max
)] = m;
690
s->heap[--(s->
heap_max
)] = s->heap[SMALLEST];
[
all
...]
deflate.h
208
int
heap_max
; /* element of largest frequency */
member in struct:internal_state
/external/qemu/distrib/zlib-1.2.8/
trees.c
481
* IN assertion: the fields freq and dad are set, heap[
heap_max
] and
510
tree[s->heap[s->
heap_max
]].Len = 0; /* root of the heap */
512
for (h = s->
heap_max
+1; h < HEAP_SIZE; h++) {
632
s->heap_len = 0, s->
heap_max
= HEAP_SIZE;
670
s->heap[--(s->
heap_max
)] = n; /* keep the nodes sorted by frequency */
671
s->heap[--(s->
heap_max
)] = m;
690
s->heap[--(s->
heap_max
)] = s->heap[SMALLEST];
[
all
...]
deflate.h
208
int
heap_max
; /* element of largest frequency */
member in struct:internal_state
/external/zlib/src/
trees.c
481
* IN assertion: the fields freq and dad are set, heap[
heap_max
] and
510
tree[s->heap[s->
heap_max
]].Len = 0; /* root of the heap */
512
for (h = s->
heap_max
+1; h < HEAP_SIZE; h++) {
632
s->heap_len = 0, s->
heap_max
= HEAP_SIZE;
670
s->heap[--(s->
heap_max
)] = n; /* keep the nodes sorted by frequency */
671
s->heap[--(s->
heap_max
)] = m;
690
s->heap[--(s->
heap_max
)] = s->heap[SMALLEST];
[
all
...]
deflate.h
208
int
heap_max
; /* element of largest frequency */
member in struct:internal_state
/external/chromium_org/third_party/zlib/
trees.c
487
* IN assertion: the fields freq and dad are set, heap[
heap_max
] and
516
tree[s->heap[s->
heap_max
]].Len = 0; /* root of the heap */
518
for (h = s->
heap_max
+1; h < HEAP_SIZE; h++) {
638
s->heap_len = 0, s->
heap_max
= HEAP_SIZE;
676
s->heap[--(s->
heap_max
)] = n; /* keep the nodes sorted by frequency */
677
s->heap[--(s->
heap_max
)] = m;
696
s->heap[--(s->
heap_max
)] = s->heap[SMALLEST];
[
all
...]
deflate.h
210
int
heap_max
; /* element of largest frequency */
member in struct:internal_state
Completed in 98 milliseconds