OpenCoverage

cbc128.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/libressl/src/crypto/modes/cbc128.c
Source codeSwitch to Preprocessed file
LineSourceCount
1/* $OpenBSD: cbc128.c,v 1.4 2015/02/10 09:46:30 miod Exp $ */-
2/* ====================================================================-
3 * Copyright (c) 2008 The OpenSSL Project. All rights reserved.-
4 *-
5 * Redistribution and use in source and binary forms, with or without-
6 * modification, are permitted provided that the following conditions-
7 * are met:-
8 *-
9 * 1. Redistributions of source code must retain the above copyright-
10 * notice, this list of conditions and the following disclaimer. -
11 *-
12 * 2. Redistributions in binary form must reproduce the above copyright-
13 * notice, this list of conditions and the following disclaimer in-
14 * the documentation and/or other materials provided with the-
15 * distribution.-
16 *-
17 * 3. All advertising materials mentioning features or use of this-
18 * software must display the following acknowledgment:-
19 * "This product includes software developed by the OpenSSL Project-
20 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"-
21 *-
22 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to-
23 * endorse or promote products derived from this software without-
24 * prior written permission. For written permission, please contact-
25 * openssl-core@openssl.org.-
26 *-
27 * 5. Products derived from this software may not be called "OpenSSL"-
28 * nor may "OpenSSL" appear in their names without prior written-
29 * permission of the OpenSSL Project.-
30 *-
31 * 6. Redistributions of any form whatsoever must retain the following-
32 * acknowledgment:-
33 * "This product includes software developed by the OpenSSL Project-
34 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"-
35 *-
36 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY-
37 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE-
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR-
39 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR-
40 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,-
41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT-
42 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;-
43 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)-
44 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,-
45 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)-
46 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED-
47 * OF THE POSSIBILITY OF SUCH DAMAGE.-
48 * ====================================================================-
49 *-
50 */-
51-
52#include <openssl/crypto.h>-
53#include "modes_lcl.h"-
54#include <string.h>-
55-
56#ifndef MODES_DEBUG-
57# ifndef NDEBUG-
58# define NDEBUG-
59# endif-
60#endif-
61-
62#undef STRICT_ALIGNMENT-
63#ifdef __STRICT_ALIGNMENT-
64#define STRICT_ALIGNMENT 1-
65#else-
66#define STRICT_ALIGNMENT 0-
67#endif-
68-
69void CRYPTO_cbc128_encrypt(const unsigned char *in, unsigned char *out,-
70 size_t len, const void *key,-
71 unsigned char ivec[16], block128_f block)-
72{-
73 size_t n;-
74 const unsigned char *iv = ivec;-
75-
76#if !defined(OPENSSL_SMALL_FOOTPRINT)-
77 if (STRICT_ALIGNMENT &&-
78 ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) {
dead code: ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
79 while (len>=16) {
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
80 for(n=0; n<16; ++n)
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
81 out[n] = in[n] ^ iv[n];
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
82 (*block)(out, out, key);
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
83 iv = out;
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
84 len -= 16;
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
85 in += 16;
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
86 out += 16;
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
87 }
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
88 } else {
dead code: { while (len>=16) { for(n=0; n<16; ++n) out[n] = in[n] ^ iv[n]; (*block)(out, out, key); iv = out; len -= 16; in += 16; out += 16; } }
-
89 while (len>=16) {
len>=16Description
TRUEevaluated 23 times by 1 test
Evaluated by:
  • cts128test
FALSEevaluated 12 times by 1 test
Evaluated by:
  • cts128test
12-23
90 for(n=0; n<16; n+=sizeof(size_t))
n<16Description
TRUEevaluated 46 times by 1 test
Evaluated by:
  • cts128test
FALSEevaluated 23 times by 1 test
Evaluated by:
  • cts128test
23-46
91 *(size_t*)(out+n) =
executed 46 times by 1 test: *(size_t*)(out+n) = *(size_t*)(in+n) ^ *(size_t*)(iv+n);
Executed by:
  • cts128test
46
92 *(size_t*)(in+n) ^ *(size_t*)(iv+n);
executed 46 times by 1 test: *(size_t*)(out+n) = *(size_t*)(in+n) ^ *(size_t*)(iv+n);
Executed by:
  • cts128test
46
93 (*block)(out, out, key);-
94 iv = out;-
95 len -= 16;-
96 in += 16;-
97 out += 16;-
98 }
executed 23 times by 1 test: end of block
Executed by:
  • cts128test
23
99 }
executed 12 times by 1 test: end of block
Executed by:
  • cts128test
12
100#endif-
101 while (len) {
lenDescription
TRUEnever evaluated
FALSEevaluated 12 times by 1 test
Evaluated by:
  • cts128test
0-12
102 for(n=0; n<16 && n<len; ++n)
n<16Description
TRUEnever evaluated
FALSEnever evaluated
n<lenDescription
TRUEnever evaluated
FALSEnever evaluated
0
103 out[n] = in[n] ^ iv[n];
never executed: out[n] = in[n] ^ iv[n];
0
104 for(; n<16; ++n)
n<16Description
TRUEnever evaluated
FALSEnever evaluated
0
105 out[n] = iv[n];
never executed: out[n] = iv[n];
0
106 (*block)(out, out, key);-
107 iv = out;-
108 if (len<=16) break;
never executed: break;
len<=16Description
TRUEnever evaluated
FALSEnever evaluated
0
109 len -= 16;-
110 in += 16;-
111 out += 16;-
112 }
never executed: end of block
0
113 memcpy(ivec,iv,16);-
114}
executed 12 times by 1 test: end of block
Executed by:
  • cts128test
12
115-
116void CRYPTO_cbc128_decrypt(const unsigned char *in, unsigned char *out,-
117 size_t len, const void *key,-
118 unsigned char ivec[16], block128_f block)-
119{-
120 size_t n;-
121 union { size_t t[16/sizeof(size_t)]; unsigned char c[16]; } tmp;-
122-
123#if !defined(OPENSSL_SMALL_FOOTPRINT)-
124 if (in != out) {
in != outDescription
TRUEevaluated 7 times by 1 test
Evaluated by:
  • cts128test
FALSEnever evaluated
0-7
125 const unsigned char *iv = ivec;-
126-
127 if (STRICT_ALIGNMENT &&-
128 ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) {
dead code: ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
129 while (len>=16) {
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
130 (*block)(in, out, key);
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
131 for(n=0; n<16; ++n)
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
132 out[n] ^= iv[n];
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
133 iv = in;
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
134 len -= 16;
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
135 in += 16;
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
136 out += 16;
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
137 }
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
138 } else if (16%sizeof(size_t) == 0) { /* always true */
16%sizeof(size_t) == 0Description
TRUEevaluated 7 times by 1 test
Evaluated by:
  • cts128test
FALSEnever evaluated
dead code: { while (len>=16) { (*block)(in, out, key); for(n=0; n<16; ++n) out[n] ^= iv[n]; iv = in; len -= 16; in += 16; out += 16; } }
-
139 while (len>=16) {
len>=16Description
TRUEevaluated 14 times by 1 test
Evaluated by:
  • cts128test
FALSEevaluated 7 times by 1 test
Evaluated by:
  • cts128test
7-14
140 size_t *out_t=(size_t *)out, *iv_t=(size_t *)iv;-
141-
142 (*block)(in, out, key);-
143 for(n=0; n<16/sizeof(size_t); n++)
n<16/sizeof(size_t)Description
TRUEevaluated 28 times by 1 test
Evaluated by:
  • cts128test
FALSEevaluated 14 times by 1 test
Evaluated by:
  • cts128test
14-28
144 out_t[n] ^= iv_t[n];
executed 28 times by 1 test: out_t[n] ^= iv_t[n];
Executed by:
  • cts128test
28
145 iv = in;-
146 len -= 16;-
147 in += 16;-
148 out += 16;-
149 }
executed 14 times by 1 test: end of block
Executed by:
  • cts128test
14
150 }
executed 7 times by 1 test: end of block
Executed by:
  • cts128test
7
151 memcpy(ivec,iv,16);-
152 } else {
executed 7 times by 1 test: end of block
Executed by:
  • cts128test
7
153 if (STRICT_ALIGNMENT &&-
154 ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0) {
dead code: ((size_t)in|(size_t)out|(size_t)ivec)%sizeof(size_t) != 0
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
155 unsigned char c;
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
156 while (len>=16) {
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
157 (*block)(in, tmp.c, key);
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
158 for(n=0; n<16; ++n) {
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
159 c = in[n];
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
160 out[n] = tmp.c[n] ^ ivec[n];
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
161 ivec[n] = c;
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
162 }
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
163 len -= 16;
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
164 in += 16;
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
165 out += 16;
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
166 }
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
167 } else if (16%sizeof(size_t) == 0) { /* always true */
16%sizeof(size_t) == 0Description
TRUEnever evaluated
FALSEnever evaluated
dead code: { unsigned char c; while (len>=16) { (*block)(in, tmp.c, key); for(n=0; n<16; ++n) { c = in[n]; out[n] = tmp.c[n] ^ ivec[n]; ivec[n] = c; } len -= 16; in += 16; out += 16; } }
-
168 while (len>=16) {
len>=16Description
TRUEnever evaluated
FALSEnever evaluated
0
169 size_t c, *out_t=(size_t *)out, *ivec_t=(size_t *)ivec;-
170 const size_t *in_t=(const size_t *)in;-
171-
172 (*block)(in, tmp.c, key);-
173 for(n=0; n<16/sizeof(size_t); n++) {
n<16/sizeof(size_t)Description
TRUEnever evaluated
FALSEnever evaluated
0
174 c = in_t[n];-
175 out_t[n] = tmp.t[n] ^ ivec_t[n];-
176 ivec_t[n] = c;-
177 }
never executed: end of block
0
178 len -= 16;-
179 in += 16;-
180 out += 16;-
181 }
never executed: end of block
0
182 }
never executed: end of block
0
183 }
never executed: end of block
0
184#endif-
185 while (len) {
lenDescription
TRUEnever evaluated
FALSEevaluated 7 times by 1 test
Evaluated by:
  • cts128test
0-7
186 unsigned char c;-
187 (*block)(in, tmp.c, key);-
188 for(n=0; n<16 && n<len; ++n) {
n<16Description
TRUEnever evaluated
FALSEnever evaluated
n<lenDescription
TRUEnever evaluated
FALSEnever evaluated
0
189 c = in[n];-
190 out[n] = tmp.c[n] ^ ivec[n];-
191 ivec[n] = c;-
192 }
never executed: end of block
0
193 if (len<=16) {
len<=16Description
TRUEnever evaluated
FALSEnever evaluated
0
194 for (; n<16; ++n)
n<16Description
TRUEnever evaluated
FALSEnever evaluated
0
195 ivec[n] = in[n];
never executed: ivec[n] = in[n];
0
196 break;
never executed: break;
0
197 }-
198 len -= 16;-
199 in += 16;-
200 out += 16;-
201 }
never executed: end of block
0
202}
executed 7 times by 1 test: end of block
Executed by:
  • cts128test
7
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2