Coverage Report

Created: 2026-09-12 06:55

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl41/ssl/quic/quic_txpim.c
Line
Count
Source
1
/*
2
 * Copyright 2022-2023 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the Apache License 2.0 (the "License").  You may not use
5
 * this file except in compliance with the License.  You can obtain a copy
6
 * in the file LICENSE in the source distribution or at
7
 * https://www.openssl.org/source/license.html
8
 */
9
10
#include "internal/quic_txpim.h"
11
#include <stdlib.h>
12
13
typedef struct quic_txpim_pkt_ex_st QUIC_TXPIM_PKT_EX;
14
15
struct quic_txpim_pkt_ex_st {
16
    QUIC_TXPIM_PKT public;
17
    QUIC_TXPIM_PKT_EX *prev, *next;
18
    QUIC_TXPIM_CHUNK *chunks;
19
    size_t num_chunks, alloc_chunks;
20
    unsigned int chunks_need_sort : 1;
21
};
22
23
typedef struct quic_txpim_pkt_ex_list {
24
    QUIC_TXPIM_PKT_EX *head, *tail;
25
} QUIC_TXPIM_PKT_EX_LIST;
26
27
struct quic_txpim_st {
28
    QUIC_TXPIM_PKT_EX_LIST free_list;
29
    size_t in_use;
30
};
31
32
88.9k
#define MAX_ALLOC_CHUNKS 512
33
34
QUIC_TXPIM *ossl_quic_txpim_new(void)
35
41.7k
{
36
41.7k
    QUIC_TXPIM *txpim = OPENSSL_zalloc(sizeof(*txpim));
37
38
41.7k
    if (txpim == NULL)
39
0
        return NULL;
40
41
41.7k
    return txpim;
42
41.7k
}
43
44
static void free_list(QUIC_TXPIM_PKT_EX_LIST *l)
45
41.7k
{
46
41.7k
    QUIC_TXPIM_PKT_EX *n, *nnext;
47
48
757k
    for (n = l->head; n != NULL; n = nnext) {
49
715k
        nnext = n->next;
50
51
715k
        OPENSSL_free(n->chunks);
52
715k
        OPENSSL_free(n);
53
715k
    }
54
55
41.7k
    l->head = l->tail = NULL;
56
41.7k
}
57
58
void ossl_quic_txpim_free(QUIC_TXPIM *txpim)
59
41.7k
{
60
41.7k
    if (txpim == NULL)
61
0
        return;
62
63
41.7k
    assert(txpim->in_use == 0);
64
41.7k
    free_list(&txpim->free_list);
65
41.7k
    OPENSSL_free(txpim);
66
41.7k
}
67
68
static void list_remove(QUIC_TXPIM_PKT_EX_LIST *l, QUIC_TXPIM_PKT_EX *n)
69
36.6M
{
70
36.6M
    if (l->head == n)
71
36.6M
        l->head = n->next;
72
36.6M
    if (l->tail == n)
73
19.5M
        l->tail = n->prev;
74
36.6M
    if (n->prev != NULL)
75
0
        n->prev->next = n->next;
76
36.6M
    if (n->next != NULL)
77
17.1M
        n->next->prev = n->prev;
78
36.6M
    n->prev = n->next = NULL;
79
36.6M
}
80
81
static void list_insert_tail(QUIC_TXPIM_PKT_EX_LIST *l, QUIC_TXPIM_PKT_EX *n)
82
37.3M
{
83
37.3M
    n->prev = l->tail;
84
37.3M
    n->next = NULL;
85
37.3M
    l->tail = n;
86
37.3M
    if (n->prev != NULL)
87
17.8M
        n->prev->next = n;
88
37.3M
    if (l->head == NULL)
89
19.5M
        l->head = n;
90
37.3M
}
91
92
static QUIC_TXPIM_PKT_EX *txpim_get_free(QUIC_TXPIM *txpim)
93
36.6M
{
94
36.6M
    QUIC_TXPIM_PKT_EX *ex = txpim->free_list.head;
95
96
36.6M
    if (ex != NULL)
97
35.9M
        return ex;
98
99
715k
    ex = OPENSSL_zalloc(sizeof(*ex));
100
715k
    if (ex == NULL)
101
0
        return NULL;
102
103
715k
    list_insert_tail(&txpim->free_list, ex);
104
715k
    return ex;
105
715k
}
106
107
static void txpim_clear(QUIC_TXPIM_PKT_EX *ex)
108
36.6M
{
109
36.6M
    memset(&ex->public.ackm_pkt, 0, sizeof(ex->public.ackm_pkt));
110
36.6M
    ossl_quic_txpim_pkt_clear_chunks(&ex->public);
111
36.6M
    ex->public.retx_head = NULL;
112
36.6M
    ex->public.fifd = NULL;
113
36.6M
    ex->public.had_handshake_done_frame = 0;
114
36.6M
    ex->public.had_max_data_frame = 0;
115
36.6M
    ex->public.had_max_streams_bidi_frame = 0;
116
36.6M
    ex->public.had_max_streams_uni_frame = 0;
117
36.6M
    ex->public.had_ack_frame = 0;
118
36.6M
    ex->public.had_conn_close = 0;
119
36.6M
}
120
121
QUIC_TXPIM_PKT *ossl_quic_txpim_pkt_alloc(QUIC_TXPIM *txpim)
122
36.6M
{
123
36.6M
    QUIC_TXPIM_PKT_EX *ex = txpim_get_free(txpim);
124
125
36.6M
    if (ex == NULL)
126
0
        return NULL;
127
128
36.6M
    txpim_clear(ex);
129
36.6M
    list_remove(&txpim->free_list, ex);
130
36.6M
    ++txpim->in_use;
131
36.6M
    return &ex->public;
132
36.6M
}
133
134
void ossl_quic_txpim_pkt_release(QUIC_TXPIM *txpim, QUIC_TXPIM_PKT *fpkt)
135
36.6M
{
136
36.6M
    QUIC_TXPIM_PKT_EX *ex = (QUIC_TXPIM_PKT_EX *)fpkt;
137
138
36.6M
    assert(txpim->in_use > 0);
139
36.6M
    --txpim->in_use;
140
36.6M
    list_insert_tail(&txpim->free_list, ex);
141
36.6M
}
142
143
void ossl_quic_txpim_pkt_add_cfq_item(QUIC_TXPIM_PKT *fpkt,
144
    QUIC_CFQ_ITEM *item)
145
9.45k
{
146
9.45k
    item->pkt_next = fpkt->retx_head;
147
9.45k
    item->pkt_prev = NULL;
148
9.45k
    fpkt->retx_head = item;
149
9.45k
}
150
151
void ossl_quic_txpim_pkt_clear_chunks(QUIC_TXPIM_PKT *fpkt)
152
36.6M
{
153
36.6M
    QUIC_TXPIM_PKT_EX *ex = (QUIC_TXPIM_PKT_EX *)fpkt;
154
155
36.6M
    ex->num_chunks = 0;
156
36.6M
}
157
158
int ossl_quic_txpim_pkt_append_chunk(QUIC_TXPIM_PKT *fpkt,
159
    const QUIC_TXPIM_CHUNK *chunk)
160
95.6k
{
161
95.6k
    QUIC_TXPIM_PKT_EX *ex = (QUIC_TXPIM_PKT_EX *)fpkt;
162
95.6k
    QUIC_TXPIM_CHUNK *new_chunk;
163
95.6k
    size_t new_alloc_chunks = ex->alloc_chunks;
164
165
95.6k
    if (ex->num_chunks == ex->alloc_chunks) {
166
88.9k
        new_alloc_chunks = (ex->alloc_chunks == 0) ? 4 : ex->alloc_chunks * 8 / 5;
167
88.9k
        if (new_alloc_chunks > MAX_ALLOC_CHUNKS)
168
0
            new_alloc_chunks = MAX_ALLOC_CHUNKS;
169
88.9k
        if (ex->num_chunks == new_alloc_chunks)
170
0
            return 0;
171
172
88.9k
        new_chunk = OPENSSL_realloc(ex->chunks,
173
88.9k
            new_alloc_chunks * sizeof(QUIC_TXPIM_CHUNK));
174
88.9k
        if (new_chunk == NULL)
175
0
            return 0;
176
177
88.9k
        ex->chunks = new_chunk;
178
88.9k
        ex->alloc_chunks = new_alloc_chunks;
179
88.9k
    }
180
181
95.6k
    ex->chunks[ex->num_chunks++] = *chunk;
182
95.6k
    ex->chunks_need_sort = 1;
183
95.6k
    return 1;
184
95.6k
}
185
186
static int compare(const void *a, const void *b)
187
1.69k
{
188
1.69k
    const QUIC_TXPIM_CHUNK *ac = a, *bc = b;
189
190
1.69k
    if (ac->stream_id < bc->stream_id)
191
781
        return -1;
192
914
    else if (ac->stream_id > bc->stream_id)
193
881
        return 1;
194
195
33
    if (ac->start < bc->start)
196
33
        return -1;
197
0
    else if (ac->start > bc->start)
198
0
        return 1;
199
200
0
    return 0;
201
33
}
202
203
const QUIC_TXPIM_CHUNK *ossl_quic_txpim_pkt_get_chunks(const QUIC_TXPIM_PKT *fpkt)
204
889k
{
205
889k
    QUIC_TXPIM_PKT_EX *ex = (QUIC_TXPIM_PKT_EX *)fpkt;
206
207
889k
    if (ex->chunks_need_sort) {
208
        /*
209
         * List of chunks will generally be very small so there is no issue
210
         * simply sorting here.
211
         */
212
94.6k
        qsort(ex->chunks, ex->num_chunks, sizeof(QUIC_TXPIM_CHUNK), compare);
213
94.6k
        ex->chunks_need_sort = 0;
214
94.6k
    }
215
216
889k
    return ex->chunks;
217
889k
}
218
219
size_t ossl_quic_txpim_pkt_get_num_chunks(const QUIC_TXPIM_PKT *fpkt)
220
938k
{
221
938k
    QUIC_TXPIM_PKT_EX *ex = (QUIC_TXPIM_PKT_EX *)fpkt;
222
223
938k
    return ex->num_chunks;
224
938k
}
225
226
size_t ossl_quic_txpim_get_in_use(const QUIC_TXPIM *txpim)
227
0
{
228
0
    return txpim->in_use;
229
0
}