Home
last modified time | relevance | path

Searched refs:MAX_MATCH (Results 1 – 25 of 32) sorted by relevance

12

/third_party/zlib/contrib/gcc_gvmat64/
Dgvmat64.S93 #define MAX_MATCH 258 macro
95 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
493 cmp eax, MAX_MATCH
538 mov r11d,MAX_MATCH
/third_party/libwebsockets/win32port/zlib/
Ddeflate.c1097 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1101 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1109 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1134 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1164 len = (MAX_MATCH - 1) - (int)(strend-scan);
1165 scan = strend - (MAX_MATCH-1);
1195 len = MAX_MATCH - (int)(strend - scan);
1196 scan = strend - MAX_MATCH;
1231 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1236 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Ddeflate.h278 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
288 #define WIN_INIT MAX_MATCH
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c109 uch _length_code[MAX_MATCH-MIN_MATCH+1];
362 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
364 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1041 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h72 #define MAX_MATCH 258 macro
/third_party/skia/third_party/externals/zlib/
Ddeflate.c1303 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1307 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1315 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1340 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1379 len = (MAX_MATCH - 1) - (int)(strend-scan);
1380 scan = strend - (MAX_MATCH-1);
1419 len = MAX_MATCH - (int)(strend - scan);
1420 scan = strend - MAX_MATCH;
1455 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1460 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
289 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/third_party/node/deps/zlib/
Ddeflate.c1294 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1298 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1306 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1331 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1361 len = (MAX_MATCH - 1) - (int)(strend-scan);
1362 scan = strend - (MAX_MATCH-1);
1392 len = MAX_MATCH - (int)(strend - scan);
1393 scan = strend - MAX_MATCH;
1428 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1433 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
289 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/third_party/zlib/
Ddeflate.c1298 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1302 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1310 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1335 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1365 len = (MAX_MATCH - 1) - (int)(strend-scan);
1366 scan = strend - (MAX_MATCH-1);
1396 len = MAX_MATCH - (int)(strend - scan);
1397 scan = strend - MAX_MATCH;
1432 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1437 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
289 #define WIN_INIT MAX_MATCH
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1031 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
Dzutil.h85 #define MAX_MATCH 258 macro
/third_party/flutter/skia/third_party/externals/zlib/
Ddeflate.c1343 register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
1347 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1355 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
1380 #if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
1410 len = (MAX_MATCH - 1) - (int)(strend-scan);
1411 scan = strend - (MAX_MATCH-1);
1441 len = MAX_MATCH - (int)(strend - scan);
1442 scan = strend - MAX_MATCH;
1477 register Bytef *strend = s->window + s->strstart + MAX_MATCH;
1482 Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
[all …]
Dtrees.h102 const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {
Ddeflate.h279 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
289 #define WIN_INIT MAX_MATCH
Dtrees.c104 uch _length_code[MAX_MATCH-MIN_MATCH+1];
355 for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) { in gen_trees_header()
357 SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20)); in gen_trees_header()
1030 (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
/third_party/flutter/skia/third_party/externals/freetype/src/gzip/
Dzutil.h65 #define MAX_MATCH 258 macro
/third_party/skia/third_party/externals/freetype/src/gzip/
Dzutil.h65 #define MAX_MATCH 258 macro

12