HomeSort by relevance Sort by last modified time
    Searched refs:D_CODES (Results 1 - 6 of 6) sorted by null

  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
trees.h 65 local const ct_data static_dtree[D_CODES] = {
124 local const int base_dist[D_CODES] = {
fx_zlib_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 */
  /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 242 milliseconds