Coverage Report

Created: 2026-01-10 06:56

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/irssi/subprojects/openssl-1.1.1l/crypto/buffer/buffer.c
Line
Count
Source
1
/*
2
 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the OpenSSL license (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 <stdio.h>
11
#include "internal/cryptlib.h"
12
#include <openssl/buffer.h>
13
14
/*
15
 * LIMIT_BEFORE_EXPANSION is the maximum n such that (n+3)/3*4 < 2**31. That
16
 * function is applied in several functions in this file and this limit
17
 * ensures that the result fits in an int.
18
 */
19
13.1k
#define LIMIT_BEFORE_EXPANSION 0x5ffffffc
20
21
BUF_MEM *BUF_MEM_new_ex(unsigned long flags)
22
6.48k
{
23
6.48k
    BUF_MEM *ret;
24
25
6.48k
    ret = BUF_MEM_new();
26
6.48k
    if (ret != NULL)
27
6.48k
        ret->flags = flags;
28
6.48k
    return ret;
29
6.48k
}
30
31
BUF_MEM *BUF_MEM_new(void)
32
13.1k
{
33
13.1k
    BUF_MEM *ret;
34
35
13.1k
    ret = OPENSSL_zalloc(sizeof(*ret));
36
13.1k
    if (ret == NULL) {
37
0
        BUFerr(BUF_F_BUF_MEM_NEW, ERR_R_MALLOC_FAILURE);
38
0
        return NULL;
39
0
    }
40
13.1k
    return ret;
41
13.1k
}
42
43
void BUF_MEM_free(BUF_MEM *a)
44
32.4k
{
45
32.4k
    if (a == NULL)
46
19.4k
        return;
47
12.9k
    if (a->data != NULL) {
48
12.9k
        if (a->flags & BUF_MEM_FLAG_SECURE)
49
0
            OPENSSL_secure_clear_free(a->data, a->max);
50
12.9k
        else
51
12.9k
            OPENSSL_clear_free(a->data, a->max);
52
12.9k
    }
53
12.9k
    OPENSSL_free(a);
54
12.9k
}
55
56
/* Allocate a block of secure memory; copy over old data if there
57
 * was any, and then free it. */
58
static char *sec_alloc_realloc(BUF_MEM *str, size_t len)
59
0
{
60
0
    char *ret;
61
62
0
    ret = OPENSSL_secure_malloc(len);
63
0
    if (str->data != NULL) {
64
0
        if (ret != NULL) {
65
0
            memcpy(ret, str->data, str->length);
66
0
            OPENSSL_secure_clear_free(str->data, str->length);
67
0
            str->data = NULL;
68
0
        }
69
0
    }
70
0
    return ret;
71
0
}
72
73
size_t BUF_MEM_grow(BUF_MEM *str, size_t len)
74
7.39k
{
75
7.39k
    char *ret;
76
7.39k
    size_t n;
77
78
7.39k
    if (str->length >= len) {
79
700
        str->length = len;
80
700
        return len;
81
700
    }
82
6.69k
    if (str->max >= len) {
83
0
        if (str->data != NULL)
84
0
            memset(&str->data[str->length], 0, len - str->length);
85
0
        str->length = len;
86
0
        return len;
87
0
    }
88
    /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
89
6.69k
    if (len > LIMIT_BEFORE_EXPANSION) {
90
0
        BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
91
0
        return 0;
92
0
    }
93
6.69k
    n = (len + 3) / 3 * 4;
94
6.69k
    if ((str->flags & BUF_MEM_FLAG_SECURE))
95
0
        ret = sec_alloc_realloc(str, n);
96
6.69k
    else
97
6.69k
        ret = OPENSSL_realloc(str->data, n);
98
6.69k
    if (ret == NULL) {
99
0
        BUFerr(BUF_F_BUF_MEM_GROW, ERR_R_MALLOC_FAILURE);
100
0
        len = 0;
101
6.69k
    } else {
102
6.69k
        str->data = ret;
103
6.69k
        str->max = n;
104
6.69k
        memset(&str->data[str->length], 0, len - str->length);
105
6.69k
        str->length = len;
106
6.69k
    }
107
6.69k
    return len;
108
6.69k
}
109
110
size_t BUF_MEM_grow_clean(BUF_MEM *str, size_t len)
111
6.50k
{
112
6.50k
    char *ret;
113
6.50k
    size_t n;
114
115
6.50k
    if (str->length >= len) {
116
0
        if (str->data != NULL)
117
0
            memset(&str->data[len], 0, str->length - len);
118
0
        str->length = len;
119
0
        return len;
120
0
    }
121
6.50k
    if (str->max >= len) {
122
26
        memset(&str->data[str->length], 0, len - str->length);
123
26
        str->length = len;
124
26
        return len;
125
26
    }
126
    /* This limit is sufficient to ensure (len+3)/3*4 < 2**31 */
127
6.48k
    if (len > LIMIT_BEFORE_EXPANSION) {
128
0
        BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
129
0
        return 0;
130
0
    }
131
6.48k
    n = (len + 3) / 3 * 4;
132
6.48k
    if ((str->flags & BUF_MEM_FLAG_SECURE))
133
0
        ret = sec_alloc_realloc(str, n);
134
6.48k
    else
135
6.48k
        ret = OPENSSL_clear_realloc(str->data, str->max, n);
136
6.48k
    if (ret == NULL) {
137
0
        BUFerr(BUF_F_BUF_MEM_GROW_CLEAN, ERR_R_MALLOC_FAILURE);
138
0
        len = 0;
139
6.48k
    } else {
140
6.48k
        str->data = ret;
141
6.48k
        str->max = n;
142
6.48k
        memset(&str->data[str->length], 0, len - str->length);
143
6.48k
        str->length = len;
144
6.48k
    }
145
6.48k
    return len;
146
6.48k
}
147
148
void BUF_reverse(unsigned char *out, const unsigned char *in, size_t size)
149
0
{
150
0
    size_t i;
151
0
    if (in) {
152
0
        out += size - 1;
153
0
        for (i = 0; i < size; i++)
154
0
            *out-- = *in++;
155
0
    } else {
156
0
        unsigned char *q;
157
0
        char c;
158
0
        q = out + size - 1;
159
0
        for (i = 0; i < size / 2; i++) {
160
0
            c = *q;
161
0
            *q-- = *out;
162
0
            *out++ = c;
163
0
        }
164
0
    }
165
0
}