Absolute File Name: | /home/opencoverage/opencoverage/guest-scripts/libressl/src/crypto/des/xcbc_enc.c |
Source code | Switch to Preprocessed file |
Line | Source | Count | ||||||
---|---|---|---|---|---|---|---|---|
1 | /* $OpenBSD: xcbc_enc.c,v 1.9 2015/02/07 13:19:15 doug Exp $ */ | - | ||||||
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | - | ||||||
3 | * All rights reserved. | - | ||||||
4 | * | - | ||||||
5 | * This package is an SSL implementation written | - | ||||||
6 | * by Eric Young (eay@cryptsoft.com). | - | ||||||
7 | * The implementation was written so as to conform with Netscapes SSL. | - | ||||||
8 | * | - | ||||||
9 | * This library is free for commercial and non-commercial use as long as | - | ||||||
10 | * the following conditions are aheared to. The following conditions | - | ||||||
11 | * apply to all code found in this distribution, be it the RC4, RSA, | - | ||||||
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | - | ||||||
13 | * included with this distribution is covered by the same copyright terms | - | ||||||
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | - | ||||||
15 | * | - | ||||||
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | - | ||||||
17 | * the code are not to be removed. | - | ||||||
18 | * If this package is used in a product, Eric Young should be given attribution | - | ||||||
19 | * as the author of the parts of the library used. | - | ||||||
20 | * This can be in the form of a textual message at program startup or | - | ||||||
21 | * in documentation (online or textual) provided with the package. | - | ||||||
22 | * | - | ||||||
23 | * Redistribution and use in source and binary forms, with or without | - | ||||||
24 | * modification, are permitted provided that the following conditions | - | ||||||
25 | * are met: | - | ||||||
26 | * 1. Redistributions of source code must retain the copyright | - | ||||||
27 | * notice, this list of conditions and the following disclaimer. | - | ||||||
28 | * 2. Redistributions in binary form must reproduce the above copyright | - | ||||||
29 | * notice, this list of conditions and the following disclaimer in the | - | ||||||
30 | * documentation and/or other materials provided with the distribution. | - | ||||||
31 | * 3. All advertising materials mentioning features or use of this software | - | ||||||
32 | * must display the following acknowledgement: | - | ||||||
33 | * "This product includes cryptographic software written by | - | ||||||
34 | * Eric Young (eay@cryptsoft.com)" | - | ||||||
35 | * The word 'cryptographic' can be left out if the rouines from the library | - | ||||||
36 | * being used are not cryptographic related :-). | - | ||||||
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | - | ||||||
38 | * the apps directory (application code) you must include an acknowledgement: | - | ||||||
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | - | ||||||
40 | * | - | ||||||
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | - | ||||||
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | - | ||||||
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | - | ||||||
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | - | ||||||
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | - | ||||||
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | - | ||||||
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | - | ||||||
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | - | ||||||
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | - | ||||||
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | - | ||||||
51 | * SUCH DAMAGE. | - | ||||||
52 | * | - | ||||||
53 | * The licence and distribution terms for any publically available version or | - | ||||||
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | - | ||||||
55 | * copied and put under another distribution licence | - | ||||||
56 | * [including the GNU Public Licence.] | - | ||||||
57 | */ | - | ||||||
58 | - | |||||||
59 | #include "des_locl.h" | - | ||||||
60 | - | |||||||
61 | /* RSA's DESX */ | - | ||||||
62 | - | |||||||
63 | void DES_xcbc_encrypt(const unsigned char *in, unsigned char *out, | - | ||||||
64 | long length, DES_key_schedule *schedule, | - | ||||||
65 | DES_cblock *ivec, const_DES_cblock *inw, | - | ||||||
66 | const_DES_cblock *outw, int enc) | - | ||||||
67 | { | - | ||||||
68 | DES_LONG tin0,tin1; | - | ||||||
69 | DES_LONG tout0,tout1,xor0,xor1; | - | ||||||
70 | DES_LONG inW0,inW1,outW0,outW1; | - | ||||||
71 | const unsigned char *in2; | - | ||||||
72 | long l=length; | - | ||||||
73 | DES_LONG tin[2]; | - | ||||||
74 | unsigned char *iv; | - | ||||||
75 | - | |||||||
76 | in2 = &(*inw)[0]; | - | ||||||
77 | c2l(in2,inW0); | - | ||||||
78 | c2l(in2,inW1); | - | ||||||
79 | in2 = &(*outw)[0]; | - | ||||||
80 | c2l(in2,outW0); | - | ||||||
81 | c2l(in2,outW1); | - | ||||||
82 | - | |||||||
83 | iv = &(*ivec)[0]; | - | ||||||
84 | - | |||||||
85 | if (enc)
| 4-6 | ||||||
86 | { | - | ||||||
87 | c2l(iv,tout0); | - | ||||||
88 | c2l(iv,tout1); | - | ||||||
89 | for (l-=8; l>=0; l-=8)
| 6-231 | ||||||
90 | { | - | ||||||
91 | c2l(in,tin0); | - | ||||||
92 | c2l(in,tin1); | - | ||||||
93 | tin0^=tout0^inW0; tin[0]=tin0; | - | ||||||
94 | tin1^=tout1^inW1; tin[1]=tin1; | - | ||||||
95 | DES_encrypt1(tin,schedule,DES_ENCRYPT); | - | ||||||
96 | tout0=tin[0]^outW0; l2c(tout0,out); | - | ||||||
97 | tout1=tin[1]^outW1; l2c(tout1,out); | - | ||||||
98 | } executed 231 times by 3 tests: end of block Executed by:
| 231 | ||||||
99 | if (l != -8)
| 1-5 | ||||||
100 | { | - | ||||||
101 | c2ln(in,tin0,tin1,l+8); executed 1 time by 1 test: end of block Executed by:
code before this statement never executed: case 7: code before this statement never executed: case 6: code before this statement never executed: case 5: code before this statement executed 1 time by 1 test: case 4: Executed by:
code before this statement executed 1 time by 1 test: case 3: Executed by:
code before this statement executed 1 time by 1 test: case 2: Executed by:
code before this statement executed 1 time by 1 test: case 1: Executed by:
never executed: case 8: never executed: case 7: never executed: case 6: executed 1 time by 1 test: case 5: Executed by:
never executed: case 4: never executed: case 3: never executed: case 2: executed 1 time by 1 test: case 1: Executed by:
| 0-1 | ||||||
102 | tin0^=tout0^inW0; tin[0]=tin0; | - | ||||||
103 | tin1^=tout1^inW1; tin[1]=tin1; | - | ||||||
104 | DES_encrypt1(tin,schedule,DES_ENCRYPT); | - | ||||||
105 | tout0=tin[0]^outW0; l2c(tout0,out); | - | ||||||
106 | tout1=tin[1]^outW1; l2c(tout1,out); | - | ||||||
107 | } executed 1 time by 1 test: end of block Executed by:
| 1 | ||||||
108 | iv = &(*ivec)[0]; | - | ||||||
109 | l2c(tout0,iv); | - | ||||||
110 | l2c(tout1,iv); | - | ||||||
111 | } executed 6 times by 3 tests: end of block Executed by:
| 6 | ||||||
112 | else | - | ||||||
113 | { | - | ||||||
114 | c2l(iv,xor0); | - | ||||||
115 | c2l(iv,xor1); | - | ||||||
116 | for (l-=8; l>0; l-=8)
| 4-228 | ||||||
117 | { | - | ||||||
118 | c2l(in,tin0); tin[0]=tin0^outW0; | - | ||||||
119 | c2l(in,tin1); tin[1]=tin1^outW1; | - | ||||||
120 | DES_encrypt1(tin,schedule,DES_DECRYPT); | - | ||||||
121 | tout0=tin[0]^xor0^inW0; | - | ||||||
122 | tout1=tin[1]^xor1^inW1; | - | ||||||
123 | l2c(tout0,out); | - | ||||||
124 | l2c(tout1,out); | - | ||||||
125 | xor0=tin0; | - | ||||||
126 | xor1=tin1; | - | ||||||
127 | } executed 228 times by 3 tests: end of block Executed by:
| 228 | ||||||
128 | if (l != -8)
| 0-4 | ||||||
129 | { | - | ||||||
130 | c2l(in,tin0); tin[0]=tin0^outW0; | - | ||||||
131 | c2l(in,tin1); tin[1]=tin1^outW1; | - | ||||||
132 | DES_encrypt1(tin,schedule,DES_DECRYPT); | - | ||||||
133 | tout0=tin[0]^xor0^inW0; | - | ||||||
134 | tout1=tin[1]^xor1^inW1; | - | ||||||
135 | l2cn(tout0,tout1,out,l+8); executed 4 times by 3 tests: end of block Executed by:
code before this statement executed 3 times by 2 tests: case 7: Executed by:
code before this statement executed 3 times by 2 tests: case 6: Executed by:
code before this statement executed 3 times by 2 tests: case 5: Executed by:
code before this statement executed 4 times by 3 tests: case 4: Executed by:
code before this statement executed 4 times by 3 tests: case 3: Executed by:
code before this statement executed 4 times by 3 tests: case 2: Executed by:
code before this statement executed 4 times by 3 tests: case 1: Executed by:
executed 3 times by 2 tests: case 8: Executed by:
never executed: case 7: never executed: case 6: executed 1 time by 1 test: case 5: Executed by:
never executed: case 4: never executed: case 3: never executed: case 2: executed 4 times by 3 tests: case 1: Executed by:
| 0-4 | ||||||
136 | xor0=tin0; | - | ||||||
137 | xor1=tin1; | - | ||||||
138 | } executed 4 times by 3 tests: end of block Executed by:
| 4 | ||||||
139 | - | |||||||
140 | iv = &(*ivec)[0]; | - | ||||||
141 | l2c(xor0,iv); | - | ||||||
142 | l2c(xor1,iv); | - | ||||||
143 | } executed 4 times by 3 tests: end of block Executed by:
| 4 | ||||||
144 | tin0=tin1=tout0=tout1=xor0=xor1=0; | - | ||||||
145 | inW0=inW1=outW0=outW1=0; | - | ||||||
146 | tin[0]=tin[1]=0; | - | ||||||
147 | } executed 10 times by 3 tests: end of block Executed by:
| 10 | ||||||
148 | - | |||||||
Source code | Switch to Preprocessed file |