Coverage Report

Created: 2026-04-01 06:39

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/openssl30/crypto/modes/cbc128.c
Line
Count
Source
1
/*
2
 * Copyright 2008-2021 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 <string.h>
11
#include <openssl/crypto.h>
12
#include "crypto/modes.h"
13
14
#if !defined(STRICT_ALIGNMENT) && !defined(PEDANTIC)
15
#define STRICT_ALIGNMENT 0
16
#endif
17
18
#if defined(__GNUC__) && !STRICT_ALIGNMENT
19
typedef size_t size_t_aX __attribute((__aligned__(1)));
20
#else
21
typedef size_t size_t_aX;
22
#endif
23
24
void CRYPTO_cbc128_encrypt(const unsigned char *in, unsigned char *out,
25
    size_t len, const void *key,
26
    unsigned char ivec[16], block128_f block)
27
3.30k
{
28
3.30k
    size_t n;
29
3.30k
    const unsigned char *iv = ivec;
30
31
3.30k
    if (len == 0)
32
0
        return;
33
34
3.30k
#if !defined(OPENSSL_SMALL_FOOTPRINT)
35
3.30k
    if (STRICT_ALIGNMENT && ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
36
312k
        while (len >= 16) {
37
5.27M
            for (n = 0; n < 16; ++n)
38
4.96M
                out[n] = in[n] ^ iv[n];
39
310k
            (*block)(out, out, key);
40
310k
            iv = out;
41
310k
            len -= 16;
42
310k
            in += 16;
43
310k
            out += 16;
44
310k
        }
45
2.57k
    } else {
46
17.2k
        while (len >= 16) {
47
49.5k
            for (n = 0; n < 16; n += sizeof(size_t))
48
33.0k
                *(size_t_aX *)(out + n) = *(size_t_aX *)(in + n) ^ *(size_t_aX *)(iv + n);
49
16.5k
            (*block)(out, out, key);
50
16.5k
            iv = out;
51
16.5k
            len -= 16;
52
16.5k
            in += 16;
53
16.5k
            out += 16;
54
16.5k
        }
55
731
    }
56
3.30k
#endif
57
3.30k
    while (len) {
58
0
        for (n = 0; n < 16 && n < len; ++n)
59
0
            out[n] = in[n] ^ iv[n];
60
0
        for (; n < 16; ++n)
61
0
            out[n] = iv[n];
62
0
        (*block)(out, out, key);
63
0
        iv = out;
64
0
        if (len <= 16)
65
0
            break;
66
0
        len -= 16;
67
0
        in += 16;
68
0
        out += 16;
69
0
    }
70
3.30k
    if (ivec != iv)
71
3.30k
        memcpy(ivec, iv, 16);
72
3.30k
}
73
74
void CRYPTO_cbc128_decrypt(const unsigned char *in, unsigned char *out,
75
    size_t len, const void *key,
76
    unsigned char ivec[16], block128_f block)
77
24
{
78
24
    size_t n;
79
24
    union {
80
24
        size_t t[16 / sizeof(size_t)];
81
24
        unsigned char c[16];
82
24
    } tmp;
83
84
24
    if (len == 0)
85
0
        return;
86
87
24
#if !defined(OPENSSL_SMALL_FOOTPRINT)
88
24
    if (in != out) {
89
12
        const unsigned char *iv = ivec;
90
91
12
        if (STRICT_ALIGNMENT && ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
92
0
            while (len >= 16) {
93
0
                (*block)(in, out, key);
94
0
                for (n = 0; n < 16; ++n)
95
0
                    out[n] ^= iv[n];
96
0
                iv = in;
97
0
                len -= 16;
98
0
                in += 16;
99
0
                out += 16;
100
0
            }
101
12
        } else if (16 % sizeof(size_t) == 0) { /* always true */
102
744
            while (len >= 16) {
103
732
                size_t_aX *out_t = (size_t_aX *)out;
104
732
                size_t_aX *iv_t = (size_t_aX *)iv;
105
106
732
                (*block)(in, out, key);
107
2.19k
                for (n = 0; n < 16 / sizeof(size_t); n++)
108
1.46k
                    out_t[n] ^= iv_t[n];
109
732
                iv = in;
110
732
                len -= 16;
111
732
                in += 16;
112
732
                out += 16;
113
732
            }
114
12
        }
115
12
        if (ivec != iv)
116
12
            memcpy(ivec, iv, 16);
117
12
    } else {
118
12
        if (STRICT_ALIGNMENT && ((size_t)in | (size_t)out | (size_t)ivec) % sizeof(size_t) != 0) {
119
0
            unsigned char c;
120
0
            while (len >= 16) {
121
0
                (*block)(in, tmp.c, key);
122
0
                for (n = 0; n < 16; ++n) {
123
0
                    c = in[n];
124
0
                    out[n] = tmp.c[n] ^ ivec[n];
125
0
                    ivec[n] = c;
126
0
                }
127
0
                len -= 16;
128
0
                in += 16;
129
0
                out += 16;
130
0
            }
131
12
        } else if (16 % sizeof(size_t) == 0) { /* always true */
132
24
            while (len >= 16) {
133
12
                size_t c;
134
12
                size_t_aX *out_t = (size_t_aX *)out;
135
12
                size_t_aX *ivec_t = (size_t_aX *)ivec;
136
12
                const size_t_aX *in_t = (const size_t_aX *)in;
137
138
12
                (*block)(in, tmp.c, key);
139
36
                for (n = 0; n < 16 / sizeof(size_t); n++) {
140
24
                    c = in_t[n];
141
24
                    out_t[n] = tmp.t[n] ^ ivec_t[n];
142
24
                    ivec_t[n] = c;
143
24
                }
144
12
                len -= 16;
145
12
                in += 16;
146
12
                out += 16;
147
12
            }
148
12
        }
149
12
    }
150
24
#endif
151
24
    while (len) {
152
0
        unsigned char c;
153
0
        (*block)(in, tmp.c, key);
154
0
        for (n = 0; n < 16 && n < len; ++n) {
155
0
            c = in[n];
156
0
            out[n] = tmp.c[n] ^ ivec[n];
157
0
            ivec[n] = c;
158
0
        }
159
0
        if (len <= 16) {
160
0
            for (; n < 16; ++n)
161
0
                ivec[n] = in[n];
162
0
            break;
163
0
        }
164
0
        len -= 16;
165
0
        in += 16;
166
0
        out += 16;
167
0
    }
168
24
}