OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:MAX_MATCH
(Results
1 - 7
of
7
) sorted by relevancy
/src/common/dist/zlib/
trees.h
102
const uch ZLIB_INTERNAL _length_code[
MAX_MATCH
-MIN_MATCH+1]= {
deflate.h
129
* wSize-
MAX_MATCH
bytes, but this ensures that IO is always
292
#define MIN_LOOKAHEAD (
MAX_MATCH
+MIN_MATCH+1)
302
#define WIN_INIT
MAX_MATCH
deflate.c
338
* time through here. WIN_INIT is set to
MAX_MATCH
since the longest match
339
* routines allow scanning to strstart +
MAX_MATCH
, ignoring lookahead.
1369
register Bytef *strend = s->window + s->strstart +
MAX_MATCH
- 1;
1373
register Bytef *strend = s->window + s->strstart +
MAX_MATCH
;
1378
/* The code is optimized for HASH_BITS >= 8 and
MAX_MATCH
-2 multiple of 16.
1381
Assert(s->hash_bits >= 8 &&
MAX_MATCH
== 258, "Code too clever");
1407
#if (defined(UNALIGNED_OK) &&
MAX_MATCH
== 258)
1419
* at strstart + 257. If
MAX_MATCH
-2 is not a multiple of 8, it is
1438
len = (
MAX_MATCH
- 1) - (int)(strend - scan);
1439
scan = strend - (
MAX_MATCH
-1)
[
all
...]
trees.c
106
uch _length_code[
MAX_MATCH
-MIN_MATCH+1];
416
"const uch ZLIB_INTERNAL _length_code[
MAX_MATCH
-MIN_MATCH+1]= {\n");
417
for (i = 0; i <
MAX_MATCH
-MIN_MATCH+1; i++) {
419
SEPARATOR(i,
MAX_MATCH
-MIN_MATCH, 20));
1112
(ush)lc <= (ush)(
MAX_MATCH
-MIN_MATCH) &&
zutil.h
99
#define
MAX_MATCH
258
/src/common/dist/zlib/contrib/gcc_gvmat64/
gvmat64.S
93
#define
MAX_MATCH
258
95
#define MIN_LOOKAHEAD (
MAX_MATCH
+MIN_MATCH+1)
488
//;;; Calculate the length of the match. If it is longer than
MAX_MATCH
,
493
cmp eax,
MAX_MATCH
538
mov r11d,
MAX_MATCH
/src/sys/net/
zlib.c
131
#define
MAX_MATCH
258
390
* wSize-
MAX_MATCH
bytes, but this ensures that IO is always
544
#define MIN_LOOKAHEAD (
MAX_MATCH
+MIN_MATCH+1)
717
#define MIN_LOOKAHEAD (
MAX_MATCH
+MIN_MATCH+1)
1371
Bytef *strend = s->window + s->strstart +
MAX_MATCH
- 1;
1375
Bytef *strend = s->window + s->strstart +
MAX_MATCH
;
1380
/* The code is optimized for HASH_BITS >= 8 and
MAX_MATCH
-2 multiple of 16.
1383
Assert(s->hash_bits >= 8 &&
MAX_MATCH
== 258, "Code too clever");
1403
#if (defined(UNALIGNED_OK) &&
MAX_MATCH
== 258)
1415
* at strstart+257. If
MAX_MATCH
-2 is not a multiple of 8, it i
[
all
...]
Completed in 20 milliseconds
Indexes created Tue Oct 14 21:09:58 GMT 2025