Home
last modified time | relevance | path

Searched refs:D_CODES (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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};
280 for ( ; code < D_CODES; code++) { in tr_static_init()
302 for (n = 0; n < D_CODES; n++) { in tr_static_init()
341 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
342 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
344 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
366 fprintf(header, "local const int base_dist[D_CODES] in gen_trees_header()
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/third_party/node/deps/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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];
135 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
341 for ( ; code < D_CODES; code++) { in tr_static_init()
363 for (n = 0; n < D_CODES; n++) { in tr_static_init()
401 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
402 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
404 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
426 fprintf(header, "local const int base_dist[D_CODES] in gen_trees_header()
[all...]
H A Ddeflate.h43 #define D_CODES 30 macro
203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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++) { in tr_static_init()
309 for (n = 0; n < D_CODES; n++) { in tr_static_init()
348 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
349 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
373 fprintf(header, "local const int base_dist[D_CODES] in gen_trees_header()
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/third_party/skia/third_party/externals/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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};
280 for ( ; code < D_CODES; code++) { in tr_static_init()
302 for (n = 0; n < D_CODES; n++) { in tr_static_init()
341 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
342 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
344 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
366 fprintf(header, "local const int base_dist[D_CODES] in gen_trees_header()
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/third_party/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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];
135 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
356 for ( ; code < D_CODES; code++) { in tr_static_init()
378 for (n = 0; n < D_CODES; n++) { in tr_static_init()
417 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n"); in gen_trees_header()
418 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
420 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
442 fprintf(header, "local const int base_dist[D_CODES] in gen_trees_header()
[all...]
H A Ddeflate.h43 #define D_CODES 30 macro
203 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */

Completed in 10 milliseconds