lib/libz/deflate.c

152

(UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \

lib/libz/deflate.c

1553

if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;

lib/libz/deflate.c

157

(UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \

lib/libz/deflate.c

1578

if (len < MIN_MATCH) return MIN_MATCH - 1;

lib/libz/deflate.c

1875

if (s->lookahead >= MIN_MATCH) {

lib/libz/deflate.c

1890

if (s->match_length >= MIN_MATCH) {

lib/libz/deflate.c

1894

s->match_length - MIN_MATCH, bflush);

lib/libz/deflate.c

1903

s->lookahead >= MIN_MATCH) {

lib/libz/deflate.c

1920

#if MIN_MATCH != 3

lib/libz/deflate.c

1921

Call UPDATE_HASH() MIN_MATCH-3 more times

lib/libz/deflate.c

1936

s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;

lib/libz/deflate.c

1975

if (s->lookahead >= MIN_MATCH) {

lib/libz/deflate.c

1982

s->match_length = MIN_MATCH-1;

lib/libz/deflate.c

1995

|| (s->match_length == MIN_MATCH &&

lib/libz/deflate.c

2003

s->match_length = MIN_MATCH-1;

lib/libz/deflate.c

2009

if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {

lib/libz/deflate.c

2010

uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;

lib/libz/deflate.c

2016

s->prev_length - MIN_MATCH, bflush);

lib/libz/deflate.c

2031

s->match_length = MIN_MATCH-1;

lib/libz/deflate.c

2064

s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;

lib/libz/deflate.c

2100

if (s->lookahead >= MIN_MATCH && s->strstart > 0) {

lib/libz/deflate.c

2120

if (s->match_length >= MIN_MATCH) {

lib/libz/deflate.c

2123

_tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);

lib/libz/deflate.c

311

if (s->lookahead + s->insert >= MIN_MATCH) {

lib/libz/deflate.c

315

#if MIN_MATCH != 3

lib/libz/deflate.c

316

Call UPDATE_HASH() MIN_MATCH-3 more times

lib/libz/deflate.c

319

UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);

lib/libz/deflate.c

326

if (s->lookahead + s->insert < MIN_MATCH)

lib/libz/deflate.c

452

s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH);

lib/libz/deflate.c

593

while (s->lookahead >= MIN_MATCH) {

lib/libz/deflate.c

595

n = s->lookahead - (MIN_MATCH-1);

lib/libz/deflate.c

597

UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);

lib/libz/deflate.c

605

s->lookahead = MIN_MATCH-1;

lib/libz/deflate.c

612

s->match_length = s->prev_length = MIN_MATCH-1;

lib/libz/deflate.c

694

s->match_length = s->prev_length = MIN_MATCH-1;

lib/libz/deflate.h

294

#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

lib/libz/trees.c

102

uch _length_code[MAX_MATCH-MIN_MATCH+1];

lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

lib/libz/trees.c

414

for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {

lib/libz/trees.c

416

SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));

lib/libz/trees.h

102

const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {

sys/lib/libz/deflate.c

152

(UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \

sys/lib/libz/deflate.c

1553

if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;

sys/lib/libz/deflate.c

157

(UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \

sys/lib/libz/deflate.c

1578

if (len < MIN_MATCH) return MIN_MATCH - 1;

sys/lib/libz/deflate.c

1877

if (s->lookahead >= MIN_MATCH) {

sys/lib/libz/deflate.c

1892

if (s->match_length >= MIN_MATCH) {

sys/lib/libz/deflate.c

1896

s->match_length - MIN_MATCH, bflush);

sys/lib/libz/deflate.c

1905

s->lookahead >= MIN_MATCH) {

sys/lib/libz/deflate.c

1922

#if MIN_MATCH != 3

sys/lib/libz/deflate.c

1923

Call UPDATE_HASH() MIN_MATCH-3 more times

sys/lib/libz/deflate.c

1938

s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;

sys/lib/libz/deflate.c

1977

if (s->lookahead >= MIN_MATCH) {

sys/lib/libz/deflate.c

1984

s->match_length = MIN_MATCH-1;

sys/lib/libz/deflate.c

1997

|| (s->match_length == MIN_MATCH &&

sys/lib/libz/deflate.c

2005

s->match_length = MIN_MATCH-1;

sys/lib/libz/deflate.c

2011

if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {

sys/lib/libz/deflate.c

2012

uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;

sys/lib/libz/deflate.c

2018

s->prev_length - MIN_MATCH, bflush);

sys/lib/libz/deflate.c

2033

s->match_length = MIN_MATCH-1;

sys/lib/libz/deflate.c

2066

s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;

sys/lib/libz/deflate.c

2102

if (s->lookahead >= MIN_MATCH && s->strstart > 0) {

sys/lib/libz/deflate.c

2122

if (s->match_length >= MIN_MATCH) {

sys/lib/libz/deflate.c

2125

_tr_tally_dist(s, 1, s->match_length - MIN_MATCH, bflush);

sys/lib/libz/deflate.c

311

if (s->lookahead + s->insert >= MIN_MATCH) {

sys/lib/libz/deflate.c

315

#if MIN_MATCH != 3

sys/lib/libz/deflate.c

316

Call UPDATE_HASH() MIN_MATCH-3 more times

sys/lib/libz/deflate.c

319

UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);

sys/lib/libz/deflate.c

326

if (s->lookahead + s->insert < MIN_MATCH)

sys/lib/libz/deflate.c

452

s->hash_shift = ((s->hash_bits + MIN_MATCH-1) / MIN_MATCH);

sys/lib/libz/deflate.c

593

while (s->lookahead >= MIN_MATCH) {

sys/lib/libz/deflate.c

595

n = s->lookahead - (MIN_MATCH-1);

sys/lib/libz/deflate.c

597

UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);

sys/lib/libz/deflate.c

605

s->lookahead = MIN_MATCH-1;

sys/lib/libz/deflate.c

612

s->match_length = s->prev_length = MIN_MATCH-1;

sys/lib/libz/deflate.c

694

s->match_length = s->prev_length = MIN_MATCH-1;

sys/lib/libz/deflate.h

294

#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)

sys/lib/libz/trees.c

102

uch _length_code[MAX_MATCH-MIN_MATCH+1];

sys/lib/libz/trees.c

1110

(ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&

sys/lib/libz/trees.c

414

for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {

sys/lib/libz/trees.c

416

SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));

sys/lib/libz/trees.h

102

const uch ZLIB_INTERNAL _length_code[MAX_MATCH-MIN_MATCH+1]= {