Coverage Report

Created: 2025-07-12 06:30

/src/c-blosc2/internal-complibs/zlib-ng-2.0.7/deflate_fast.c
Line
Count
Source (jump to first uncovered line)
1
/* deflate_fast.c -- compress data using the fast strategy of deflation algorithm
2
 *
3
 * Copyright (C) 1995-2013 Jean-loup Gailly and Mark Adler
4
 * For conditions of distribution and use, see copyright notice in zlib.h
5
 */
6
7
#include "zbuild.h"
8
#include "deflate.h"
9
#include "deflate_p.h"
10
#include "functable.h"
11
12
/* ===========================================================================
13
 * Compress as much as possible from the input stream, return the current
14
 * block state.
15
 * This function does not perform lazy evaluation of matches and inserts
16
 * new strings in the dictionary only for unmatched strings or for short
17
 * matches. It is used only for the fast compression options.
18
 */
19
6.58k
Z_INTERNAL block_state deflate_fast(deflate_state *s, int flush) {
20
6.58k
    Pos hash_head;        /* head of the hash chain */
21
6.58k
    int bflush = 0;       /* set if current block must be flushed */
22
6.58k
    int64_t dist;
23
6.58k
    uint32_t match_len = 0;
24
25
11.3M
    for (;;) {
26
        /* Make sure that we always have enough lookahead, except
27
         * at the end of the input file. We need MAX_MATCH bytes
28
         * for the next match, plus MIN_MATCH bytes to insert the
29
         * string following the next match.
30
         */
31
11.3M
        if (s->lookahead < MIN_LOOKAHEAD) {
32
713k
            fill_window(s);
33
713k
            if (UNLIKELY(s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH)) {
34
0
                return need_more;
35
0
            }
36
713k
            if (UNLIKELY(s->lookahead == 0))
37
6.58k
                break; /* flush the current block */
38
713k
        }
39
40
        /* Insert the string window[strstart .. strstart+2] in the
41
         * dictionary, and set hash_head to the head of the hash chain:
42
         */
43
11.3M
        if (s->lookahead >= MIN_MATCH) {
44
11.3M
            hash_head = functable.quick_insert_string(s, s->strstart);
45
11.3M
            dist = (int64_t)s->strstart - hash_head;
46
47
            /* Find the longest match, discarding those <= prev_length.
48
             * At this point we have always match length < MIN_MATCH
49
             */
50
11.3M
            if (dist <= MAX_DIST(s) && dist > 0 && hash_head != 0) {
51
                /* To simplify the code, we prevent matches with the string
52
                 * of window index 0 (in particular we have to avoid a match
53
                 * of the string with itself at the start of the input file).
54
                 */
55
662k
                match_len = functable.longest_match(s, hash_head);
56
                /* longest_match() sets match_start */
57
662k
            }
58
11.3M
        }
59
60
11.3M
        if (match_len >= MIN_MATCH) {
61
356k
            check_match(s, s->strstart, s->match_start, match_len);
62
63
356k
            bflush = zng_tr_tally_dist(s, s->strstart - s->match_start, match_len - MIN_MATCH);
64
65
356k
            s->lookahead -= match_len;
66
67
            /* Insert new strings in the hash table only if the match length
68
             * is not too large. This saves time but degrades compression.
69
             */
70
356k
            if (match_len <= s->max_insert_length && s->lookahead >= MIN_MATCH) {
71
124k
                match_len--; /* string at strstart already in table */
72
124k
                s->strstart++;
73
74
124k
                functable.insert_string(s, s->strstart, match_len);
75
124k
                s->strstart += match_len;
76
232k
            } else {
77
232k
                s->strstart += match_len;
78
#if MIN_MATCH != 3
79
                functable.insert_string(s, s->strstart + 2 - MIN_MATCH, MIN_MATCH - 2);
80
#else
81
232k
                functable.quick_insert_string(s, s->strstart + 2 - MIN_MATCH);
82
232k
#endif
83
                /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
84
                 * matter since it will be recomputed at next deflate call.
85
                 */
86
232k
            }
87
356k
            match_len = 0;
88
10.9M
        } else {
89
            /* No match, output a literal byte */
90
10.9M
            bflush = zng_tr_tally_lit(s, s->window[s->strstart]);
91
10.9M
            s->lookahead--;
92
10.9M
            s->strstart++;
93
10.9M
        }
94
11.3M
        if (UNLIKELY(bflush))
95
11.3M
            FLUSH_BLOCK(s, 0);
96
11.3M
    }
97
6.58k
    s->insert = s->strstart < MIN_MATCH-1 ? s->strstart : MIN_MATCH-1;
98
6.58k
    if (UNLIKELY(flush == Z_FINISH)) {
99
6.58k
        FLUSH_BLOCK(s, 1);
100
5.27k
        return finish_done;
101
6.58k
    }
102
0
    if (UNLIKELY(s->sym_next))
103
0
        FLUSH_BLOCK(s, 0);
104
0
    return block_done;
105
0
}