/src/zlib-ng/deflate_medium.c

Source (jump to first uncovered line)
/* deflate_medium.c -- The deflate_medium deflate strategy
 *
 * Copyright (C) 2013 Intel Corporation. All rights reserved.
 * Authors:
 *  Arjan van de Ven    <arjan@linux.intel.com>
 *
 * For conditions of distribution and use, see copyright notice in zlib.h
 */
#ifndef NO_MEDIUM_STRATEGY
#include "zbuild.h"
#include "deflate.h"
#include "deflate_p.h"
#include "functable.h"

struct match {
    uint16_t match_start;
    uint16_t match_length;
    uint16_t strstart;
    uint16_t orgstart;
};

static int emit_match(deflate_state *s, struct match match) {
    int bflush = 0;

    /* matches that are not long enough we need to emit as literals */
    if (match.match_length < WANT_MIN_MATCH) {
        while (match.match_length) {
            bflush += zng_tr_tally_lit(s, s->window[match.strstart]);
            s->lookahead--;
            match.strstart++;
            match.match_length--;
        }
        return bflush;
    }

    check_match(s, match.strstart, match.match_start, match.match_length);

    bflush += zng_tr_tally_dist(s, match.strstart - match.match_start, match.match_length - STD_MIN_MATCH);

    s->lookahead -= match.match_length;
    return bflush;
}

static void insert_match(deflate_state *s, struct match match) {
    if (UNLIKELY(s->lookahead <= (unsigned int)(match.match_length + WANT_MIN_MATCH)))
        return;

    /* matches that are not long enough we need to emit as literals */
    if (LIKELY(match.match_length < WANT_MIN_MATCH)) {
        match.strstart++;
        match.match_length--;
        if (UNLIKELY(match.match_length > 0)) {
            if (match.strstart >= match.orgstart) {
                if (match.strstart + match.match_length - 1 >= match.orgstart) {
                    insert_string(s, match.strstart, match.match_length);
                } else {
                    insert_string(s, match.strstart, match.orgstart - match.strstart + 1);
                }
                match.strstart += match.match_length;
                match.match_length = 0;
            }
        }
        return;
    }

    /* Insert new strings in the hash table only if the match length
     * is not too large. This saves time but degrades compression.
     */
    if (match.match_length <= 16 * s->max_insert_length && s->lookahead >= WANT_MIN_MATCH) {
        match.match_length--; /* string at strstart already in table */
        match.strstart++;

        if (LIKELY(match.strstart >= match.orgstart)) {
            if (LIKELY(match.strstart + match.match_length - 1 >= match.orgstart)) {
                insert_string(s, match.strstart, match.match_length);
            } else {
                insert_string(s, match.strstart, match.orgstart - match.strstart + 1);
            }
        } else if (match.orgstart < match.strstart + match.match_length) {
            insert_string(s, match.orgstart, match.strstart + match.match_length - match.orgstart);
        }
        match.strstart += match.match_length;
        match.match_length = 0;
    } else {
        match.strstart += match.match_length;
        match.match_length = 0;

        if (match.strstart >= (STD_MIN_MATCH - 2))
            quick_insert_string(s, match.strstart + 2 - STD_MIN_MATCH);

        /* If lookahead < WANT_MIN_MATCH, ins_h is garbage, but it does not
         * matter since it will be recomputed at next deflate call.
         */
    }
}

static void fizzle_matches(deflate_state *s, struct match *current, struct match *next) {
    Pos limit;
    unsigned char *match, *orig;
    int changed = 0;
    struct match c, n;
    /* step zero: sanity checks */

    if (current->match_length <= 1)
        return;

    if (UNLIKELY(current->match_length > 1 + next->match_start))
        return;

    if (UNLIKELY(current->match_length > 1 + next->strstart))
        return;

    match = s->window - current->match_length + 1 + next->match_start;
    orig  = s->window - current->match_length + 1 + next->strstart;

    /* quick exit check.. if this fails then don't bother with anything else */
    if (LIKELY(*match != *orig))
        return;

    c = *current;
    n = *next;

    /* step one: try to move the "next" match to the left as much as possible */
    limit = next->strstart > MAX_DIST(s) ? next->strstart - (Pos)MAX_DIST(s) : 0;

    match = s->window + n.match_start - 1;
    orig = s->window + n.strstart - 1;

    while (*match == *orig) {
        if (UNLIKELY(c.match_length < 1))
            break;
        if (UNLIKELY(n.strstart <= limit))
            break;
        if (UNLIKELY(n.match_length >= 256))
            break;
        if (UNLIKELY(n.match_start <= 1))
            break;

        n.strstart--;
        n.match_start--;
        n.match_length++;
        c.match_length--;
        match--;
        orig--;
        changed++;
    }

    if (!changed)
        return;

    if (c.match_length <= 1 && n.match_length != 2) {
        n.orgstart++;
        *current = c;
        *next = n;
    } else {
        return;
    }
}

Z_INTERNAL block_state deflate_medium(deflate_state *s, int flush) {
    /* Align the first struct to start on a new cacheline, this allows us to fit both structs in one cacheline */
    ALIGNED_(16) struct match current_match;
                 struct match next_match;

    /* For levels below 5, don't check the next position for a better match */
    int early_exit = s->level < 5;

    memset(&current_match, 0, sizeof(struct match));
    memset(&next_match, 0, sizeof(struct match));

    for (;;) {
        Pos hash_head = 0;    /* head of the hash chain */
        int bflush = 0;       /* set if current block must be flushed */
        int64_t dist;

        /* Make sure that we always have enough lookahead, except
         * at the end of the input file. We need STD_MAX_MATCH bytes
         * for the next match, plus WANT_MIN_MATCH bytes to insert the
         * string following the next current_match.
         */
        if (s->lookahead < MIN_LOOKAHEAD) {
            PREFIX(fill_window)(s);
            if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
                return need_more;
            }
            if (UNLIKELY(s->lookahead == 0))
                break; /* flush the current block */
            next_match.match_length = 0;
        }

        /* Insert the string window[strstart .. strstart+2] in the
         * dictionary, and set hash_head to the head of the hash chain:
         */

        /* If we already have a future match from a previous round, just use that */
        if (!early_exit && next_match.match_length > 0) {
            current_match = next_match;
            next_match.match_length = 0;
        } else {
            hash_head = 0;
            if (s->lookahead >= WANT_MIN_MATCH) {
                hash_head = quick_insert_string(s, s->strstart);
            }

            current_match.strstart = (uint16_t)s->strstart;
            current_match.orgstart = current_match.strstart;

            /* Find the longest match, discarding those <= prev_length.
             * At this point we have always match_length < WANT_MIN_MATCH
             */

            dist = (int64_t)s->strstart - hash_head;
            if (dist <= MAX_DIST(s) && dist > 0 && hash_head != 0) {
                /* To simplify the code, we prevent matches with the string
                 * of window index 0 (in particular we have to avoid a match
                 * of the string with itself at the start of the input file).
                 */
                current_match.match_length = (uint16_t)FUNCTABLE_CALL(longest_match)(s, hash_head);
                current_match.match_start = (uint16_t)s->match_start;
                if (UNLIKELY(current_match.match_length < WANT_MIN_MATCH))
                    current_match.match_length = 1;
                if (UNLIKELY(current_match.match_start >= current_match.strstart)) {
                    /* this can happen due to some restarts */
                    current_match.match_length = 1;
                }
            } else {
                /* Set up the match to be a 1 byte literal */
                current_match.match_start = 0;
                current_match.match_length = 1;
            }
        }

        insert_match(s, current_match);

        /* now, look ahead one */
        if (LIKELY(!early_exit && s->lookahead > MIN_LOOKAHEAD && (uint32_t)(current_match.strstart + current_match.match_length) < (s->window_size - MIN_LOOKAHEAD))) {
            s->strstart = current_match.strstart + current_match.match_length;
            hash_head = quick_insert_string(s, s->strstart);

            next_match.strstart = (uint16_t)s->strstart;
            next_match.orgstart = next_match.strstart;

            /* Find the longest match, discarding those <= prev_length.
             * At this point we have always match_length < WANT_MIN_MATCH
             */

            dist = (int64_t)s->strstart - hash_head;
            if (dist <= MAX_DIST(s) && dist > 0 && hash_head != 0) {
                /* To simplify the code, we prevent matches with the string
                 * of window index 0 (in particular we have to avoid a match
                 * of the string with itself at the start of the input file).
                 */
                next_match.match_length = (uint16_t)FUNCTABLE_CALL(longest_match)(s, hash_head);
                next_match.match_start = (uint16_t)s->match_start;
                if (UNLIKELY(next_match.match_start >= next_match.strstart)) {
                    /* this can happen due to some restarts */
                    next_match.match_length = 1;
                }
                if (next_match.match_length < WANT_MIN_MATCH)
                    next_match.match_length = 1;
                else
                    fizzle_matches(s, &current_match, &next_match);
            } else {
                /* Set up the match to be a 1 byte literal */
                next_match.match_start = 0;
                next_match.match_length = 1;
            }

            s->strstart = current_match.strstart;
        } else {
            next_match.match_length = 0;
        }

        /* now emit the current match */
        bflush = emit_match(s, current_match);

        /* move the "cursor" forward */
        s->strstart += current_match.match_length;

        if (UNLIKELY(bflush))
            FLUSH_BLOCK(s, 0);
    }
    s->insert = s->strstart < (STD_MIN_MATCH - 1) ? s->strstart : (STD_MIN_MATCH - 1);
    if (flush == Z_FINISH) {
        FLUSH_BLOCK(s, 1);
        return finish_done;
    }
    if (UNLIKELY(s->sym_next))
        FLUSH_BLOCK(s, 0);

    return block_done;
}
#endif

Coverage Report

Created: 2025-08-28 06:39

Line	Count	Source (jump to first uncovered line)
1		/* deflate_medium.c -- The deflate_medium deflate strategy
2		*
3		* Copyright (C) 2013 Intel Corporation. All rights reserved.
4		* Authors:
5		* Arjan van de Ven <arjan@linux.intel.com>
6		*
7		* For conditions of distribution and use, see copyright notice in zlib.h
8		*/
9		#ifndef NO_MEDIUM_STRATEGY
10		#include "zbuild.h"
11		#include "deflate.h"
12		#include "deflate_p.h"
13		#include "functable.h"
14
15		struct match {
16		uint16_t match_start;
17		uint16_t match_length;
18		uint16_t strstart;
19		uint16_t orgstart;
20		};
21
22	1.94M	static int emit_match(deflate_state *s, struct match match) {
23	1.94M	int bflush = 0;
24
25		/* matches that are not long enough we need to emit as literals */
26	1.94M	if (match.match_length < WANT_MIN_MATCH) {
27	3.52M	while (match.match_length) {
28	1.76M	bflush += zng_tr_tally_lit(s, s->window[match.strstart]);
29	1.76M	s->lookahead--;
30	1.76M	match.strstart++;
31	1.76M	match.match_length--;
32	1.76M	}
33	1.76M	return bflush;
34	1.76M	}
35
36	185k	check_match(s, match.strstart, match.match_start, match.match_length);
37
38	185k	bflush += zng_tr_tally_dist(s, match.strstart - match.match_start, match.match_length - STD_MIN_MATCH);
39
40	185k	s->lookahead -= match.match_length;
41	185k	return bflush;
42	1.94M	}
43
44	1.94M	static void insert_match(deflate_state *s, struct match match) {
45	1.94M	if (UNLIKELY(s->lookahead <= (unsigned int)(match.match_length + WANT_MIN_MATCH)))
46	4.22k	return;
47
48		/* matches that are not long enough we need to emit as literals */
49	1.94M	if (LIKELY(match.match_length < WANT_MIN_MATCH)) {
50	1.75M	match.strstart++;
51	1.75M	match.match_length--;
52	1.75M	if (UNLIKELY(match.match_length > 0)) {
53	0	if (match.strstart >= match.orgstart) {
54	0	if (match.strstart + match.match_length - 1 >= match.orgstart) {
55	0	insert_string(s, match.strstart, match.match_length);
56	0	} else {
57	0	insert_string(s, match.strstart, match.orgstart - match.strstart + 1);
58	0	}
59	0	match.strstart += match.match_length;
60	0	match.match_length = 0;
61	0	}
62	0	}
63	1.75M	return;
64	1.75M	}
65
66		/* Insert new strings in the hash table only if the match length
67		* is not too large. This saves time but degrades compression.
68		*/
69	192k	if (match.match_length <= 16 * s->max_insert_length && s->lookahead >= WANT_MIN_MATCH) {
70	183k	match.match_length--; /* string at strstart already in table */
71	183k	match.strstart++;
72
73	183k	if (LIKELY(match.strstart >= match.orgstart)) {
74	175k	if (LIKELY(match.strstart + match.match_length - 1 >= match.orgstart)) {
75	175k	insert_string(s, match.strstart, match.match_length);
76	175k	} else {
77	0	insert_string(s, match.strstart, match.orgstart - match.strstart + 1);
78	0	}
79	175k	} else if (match.orgstart < match.strstart + match.match_length) {
80	8.08k	insert_string(s, match.orgstart, match.strstart + match.match_length - match.orgstart);
81	8.08k	}
82	183k	match.strstart += match.match_length;
83	183k	match.match_length = 0;
84	183k	} else {
85	9.09k	match.strstart += match.match_length;
86	9.09k	match.match_length = 0;
87
88	9.09k	if (match.strstart >= (STD_MIN_MATCH - 2))
89	9.09k	quick_insert_string(s, match.strstart + 2 - STD_MIN_MATCH);
90
91		/* If lookahead < WANT_MIN_MATCH, ins_h is garbage, but it does not
92		* matter since it will be recomputed at next deflate call.
93		*/
94	9.09k	}
95	192k	}
96
97	130k	static void fizzle_matches(deflate_state s, struct match current, struct match *next) {
98	130k	Pos limit;
99	130k	unsigned char match, orig;
100	130k	int changed = 0;
101	130k	struct match c, n;
102		/* step zero: sanity checks */
103
104	130k	if (current->match_length <= 1)
105	69.1k	return;
106
107	61.7k	if (UNLIKELY(current->match_length > 1 + next->match_start))
108	97	return;
109
110	61.6k	if (UNLIKELY(current->match_length > 1 + next->strstart))
111	0	return;
112
113	61.6k	match = s->window - current->match_length + 1 + next->match_start;
114	61.6k	orig = s->window - current->match_length + 1 + next->strstart;
115
116		/* quick exit check.. if this fails then don't bother with anything else */
117	61.6k	if (LIKELY(match != orig))
118	34.0k	return;
119
120	27.6k	c = *current;
121	27.6k	n = *next;
122
123		/* step one: try to move the "next" match to the left as much as possible */
124	27.6k	limit = next->strstart > MAX_DIST(s) ? next->strstart - (Pos)MAX_DIST(s) : 0;
125
126	27.6k	match = s->window + n.match_start - 1;
127	27.6k	orig = s->window + n.strstart - 1;
128
129	560k	while (match == orig) {
130	541k	if (UNLIKELY(c.match_length < 1))
131	1.18k	break;
132	539k	if (UNLIKELY(n.strstart <= limit))
133	204	break;
134	539k	if (UNLIKELY(n.match_length >= 256))
135	6.70k	break;
136	533k	if (UNLIKELY(n.match_start <= 1))
137	77	break;
138
139	532k	n.strstart--;
140	532k	n.match_start--;
141	532k	n.match_length++;
142	532k	c.match_length--;
143	532k	match--;
144	532k	orig--;
145	532k	changed++;
146	532k	}
147
148	27.6k	if (!changed)
149	9.68k	return;
150
151	17.9k	if (c.match_length <= 1 && n.match_length != 2) {
152	8.08k	n.orgstart++;
153	8.08k	*current = c;
154	8.08k	*next = n;
155	9.84k	} else {
156	9.84k	return;
157	9.84k	}
158	17.9k	}
159
160	1.49k	Z_INTERNAL block_state deflate_medium(deflate_state *s, int flush) {
161		/* Align the first struct to start on a new cacheline, this allows us to fit both structs in one cacheline */
162	1.49k	ALIGNED_(16) struct match current_match;
163	1.49k	struct match next_match;
164
165		/* For levels below 5, don't check the next position for a better match */
166	1.49k	int early_exit = s->level < 5;
167
168	1.49k	memset(&current_match, 0, sizeof(struct match));
169	1.49k	memset(&next_match, 0, sizeof(struct match));
170
171	1.95M	for (;;) {
172	1.95M	Pos hash_head = 0; /* head of the hash chain */
173	1.95M	int bflush = 0; /* set if current block must be flushed */
174	1.95M	int64_t dist;
175
176		/* Make sure that we always have enough lookahead, except
177		* at the end of the input file. We need STD_MAX_MATCH bytes
178		* for the next match, plus WANT_MIN_MATCH bytes to insert the
179		* string following the next current_match.
180		*/
181	1.95M	if (s->lookahead < MIN_LOOKAHEAD) {
182	86.2k	PREFIX(fill_window)(s);
183	86.2k	if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
184	0	return need_more;
185	0	}
186	86.2k	if (UNLIKELY(s->lookahead == 0))
187	1.49k	break; /* flush the current block */
188	84.7k	next_match.match_length = 0;
189	84.7k	}
190
191		/* Insert the string window[strstart .. strstart+2] in the
192		* dictionary, and set hash_head to the head of the hash chain:
193		*/
194
195		/* If we already have a future match from a previous round, just use that */
196	1.94M	if (!early_exit && next_match.match_length > 0) {
197	1.35M	current_match = next_match;
198	1.35M	next_match.match_length = 0;
199	1.35M	} else {
200	591k	hash_head = 0;
201	591k	if (s->lookahead >= WANT_MIN_MATCH) {
202	589k	hash_head = quick_insert_string(s, s->strstart);
203	589k	}
204
205	591k	current_match.strstart = (uint16_t)s->strstart;
206	591k	current_match.orgstart = current_match.strstart;
207
208		/* Find the longest match, discarding those <= prev_length.
209		* At this point we have always match_length < WANT_MIN_MATCH
210		*/
211
212	591k	dist = (int64_t)s->strstart - hash_head;
213	591k	if (dist <= MAX_DIST(s) && dist > 0 && hash_head != 0) {
214		/* To simplify the code, we prevent matches with the string
215		* of window index 0 (in particular we have to avoid a match
216		* of the string with itself at the start of the input file).
217		*/
218	65.2k	current_match.match_length = (uint16_t)FUNCTABLE_CALL(longest_match)(s, hash_head);
219	65.2k	current_match.match_start = (uint16_t)s->match_start;
220	65.2k	if (UNLIKELY(current_match.match_length < WANT_MIN_MATCH))
221	2.46k	current_match.match_length = 1;
222	65.2k	if (UNLIKELY(current_match.match_start >= current_match.strstart)) {
223		/* this can happen due to some restarts */
224	0	current_match.match_length = 1;
225	0	}
226	526k	} else {
227		/* Set up the match to be a 1 byte literal */
228	526k	current_match.match_start = 0;
229	526k	current_match.match_length = 1;
230	526k	}
231	591k	}
232
233	1.94M	insert_match(s, current_match);
234
235		/* now, look ahead one */
236	1.94M	if (LIKELY(!early_exit && s->lookahead > MIN_LOOKAHEAD && (uint32_t)(current_match.strstart + current_match.match_length) < (s->window_size - MIN_LOOKAHEAD))) {
237	1.35M	s->strstart = current_match.strstart + current_match.match_length;
238	1.35M	hash_head = quick_insert_string(s, s->strstart);
239
240	1.35M	next_match.strstart = (uint16_t)s->strstart;
241	1.35M	next_match.orgstart = next_match.strstart;
242
243		/* Find the longest match, discarding those <= prev_length.
244		* At this point we have always match_length < WANT_MIN_MATCH
245		*/
246
247	1.35M	dist = (int64_t)s->strstart - hash_head;
248	1.35M	if (dist <= MAX_DIST(s) && dist > 0 && hash_head != 0) {
249		/* To simplify the code, we prevent matches with the string
250		* of window index 0 (in particular we have to avoid a match
251		* of the string with itself at the start of the input file).
252		*/
253	151k	next_match.match_length = (uint16_t)FUNCTABLE_CALL(longest_match)(s, hash_head);
254	151k	next_match.match_start = (uint16_t)s->match_start;
255	151k	if (UNLIKELY(next_match.match_start >= next_match.strstart)) {
256		/* this can happen due to some restarts */
257	0	next_match.match_length = 1;
258	0	}
259	151k	if (next_match.match_length < WANT_MIN_MATCH)
260	20.8k	next_match.match_length = 1;
261	130k	else
262	130k	fizzle_matches(s, &current_match, &next_match);
263	1.20M	} else {
264		/* Set up the match to be a 1 byte literal */
265	1.20M	next_match.match_start = 0;
266	1.20M	next_match.match_length = 1;
267	1.20M	}
268
269	1.35M	s->strstart = current_match.strstart;
270	1.35M	} else {
271	591k	next_match.match_length = 0;
272	591k	}
273
274		/* now emit the current match */
275	1.94M	bflush = emit_match(s, current_match);
276
277		/* move the "cursor" forward */
278	1.94M	s->strstart += current_match.match_length;
279
280	1.94M	if (UNLIKELY(bflush))
281	1.94M	FLUSH_BLOCK(s, 0);
282	1.94M	}
283	1.49k	s->insert = s->strstart < (STD_MIN_MATCH - 1) ? s->strstart : (STD_MIN_MATCH - 1);
284	1.49k	if (flush == Z_FINISH) {
285	1.49k	FLUSH_BLOCK(s, 1);
286	1.49k	return finish_done;
287	1.49k	}
288	0	if (UNLIKELY(s->sym_next))
289	0	FLUSH_BLOCK(s, 0);
290
291	0	return block_done;
292	0	}
293		#endif