OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:D_CODES
(Results
1 - 9
of
9
) sorted by null
/external/chromium_org/third_party/zlib/
trees.h
64
local const ct_data static_dtree[
D_CODES
] = {
123
local const int base_dist[
D_CODES
] = {
trees.c
65
local const int extra_dbits[
D_CODES
] /* extra bits for each distance code */
98
local ct_data static_dtree[
D_CODES
];
115
local int base_dist[
D_CODES
];
134
{static_dtree, extra_dbits, 0,
D_CODES
, MAX_BITS};
287
for ( ; code <
D_CODES
; code++) {
309
for (n = 0; n <
D_CODES
; n++) {
348
fprintf(header, "local const ct_data static_dtree[
D_CODES
] = {\n");
349
for (i = 0; i <
D_CODES
; i++) {
351
static_dtree[i].Len, SEPARATOR(i,
D_CODES
-1, 5));
373
fprintf(header, "local const int base_dist[
D_CODES
] = {\n")
[
all
...]
deflate.h
39
#define
D_CODES
30
198
struct ct_data_s dyn_dtree[2*
D_CODES
+1]; /* distance tree */
/external/qemu/distrib/zlib-1.2.3/
trees.h
64
local const ct_data static_dtree[
D_CODES
] = {
123
local const int base_dist[
D_CODES
] = {
trees.c
64
local const int extra_dbits[
D_CODES
] /* extra bits for each distance code */
97
local ct_data static_dtree[
D_CODES
];
114
local int base_dist[
D_CODES
];
133
{static_dtree, extra_dbits, 0,
D_CODES
, MAX_BITS};
284
for ( ; code <
D_CODES
; code++) {
306
for (n = 0; n <
D_CODES
; n++) {
345
fprintf(header, "local const ct_data static_dtree[
D_CODES
] = {\n");
346
for (i = 0; i <
D_CODES
; i++) {
348
static_dtree[i].Len, SEPARATOR(i,
D_CODES
-1, 5));
369
fprintf(header, "local const int base_dist[
D_CODES
] = {\n")
[
all
...]
deflate.h
39
#define
D_CODES
30
193
struct ct_data_s dyn_dtree[2*
D_CODES
+1]; /* distance tree */
/external/zlib/src/
trees.h
64
local const ct_data static_dtree[
D_CODES
] = {
123
local const int base_dist[
D_CODES
] = {
trees.c
65
local const int extra_dbits[
D_CODES
] /* extra bits for each distance code */
93
local ct_data static_dtree[
D_CODES
];
110
local int base_dist[
D_CODES
];
129
{static_dtree, extra_dbits, 0,
D_CODES
, MAX_BITS};
282
for ( ; code <
D_CODES
; code++) {
304
for (n = 0; n <
D_CODES
; n++) {
343
fprintf(header, "local const ct_data static_dtree[
D_CODES
] = {\n");
344
for (i = 0; i <
D_CODES
; i++) {
346
static_dtree[i].Len, SEPARATOR(i,
D_CODES
-1, 5));
368
fprintf(header, "local const int base_dist[
D_CODES
] = {\n")
[
all
...]
deflate.h
39
#define
D_CODES
30
196
struct ct_data_s dyn_dtree[2*
D_CODES
+1]; /* distance tree */
Completed in 724 milliseconds