OpenCoverage

i_cbc.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/libressl/src/crypto/idea/i_cbc.c
Source codeSwitch to Preprocessed file
LineSourceCount
1/* $OpenBSD: i_cbc.c,v 1.3 2014/10/28 07:35:58 jsg 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 <openssl/idea.h>-
60#include "idea_lcl.h"-
61-
62void idea_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,-
63 IDEA_KEY_SCHEDULE *ks, unsigned char *iv, int encrypt)-
64 {-
65 unsigned long tin0,tin1;-
66 unsigned long tout0,tout1,xor0,xor1;-
67 long l=length;-
68 unsigned long tin[2];-
69-
70 if (encrypt)
encryptDescription
TRUEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 2 times by 1 test
Evaluated by:
  • ideatest
1-2
71 {-
72 n2l(iv,tout0);-
73 n2l(iv,tout1);-
74 iv-=8;-
75 for (l-=8; l>=0; l-=8)
l>=0Description
TRUEevaluated 3 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
1-3
76 {-
77 n2l(in,tin0);-
78 n2l(in,tin1);-
79 tin0^=tout0;-
80 tin1^=tout1;-
81 tin[0]=tin0;-
82 tin[1]=tin1;-
83 idea_encrypt(tin,ks);-
84 tout0=tin[0]; l2n(tout0,out);-
85 tout1=tin[1]; l2n(tout1,out);-
86 }
executed 3 times by 1 test: end of block
Executed by:
  • ideatest
3
87 if (l != -8)
l != -8Description
TRUEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-1
88 {-
89 n2ln(in,tin0,tin1,l+8);
executed 1 time by 1 test: end of block
Executed by:
  • ideatest
code before this statement never executed: case 7:
code before this statement never executed: case 6:
code before this statement executed 1 time by 1 test: case 5:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 4:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 3:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 2:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 1:
Executed by:
  • ideatest
never executed: case 8:
never executed: case 7:
executed 1 time by 1 test: case 6:
Executed by:
  • ideatest
never executed: case 5:
never executed: case 4:
never executed: case 3:
never executed: case 2:
executed 1 time by 1 test: case 1:
Executed by:
  • ideatest
0-1
90 tin0^=tout0;-
91 tin1^=tout1;-
92 tin[0]=tin0;-
93 tin[1]=tin1;-
94 idea_encrypt(tin,ks);-
95 tout0=tin[0]; l2n(tout0,out);-
96 tout1=tin[1]; l2n(tout1,out);-
97 }
executed 1 time by 1 test: end of block
Executed by:
  • ideatest
1
98 l2n(tout0,iv);-
99 l2n(tout1,iv);-
100 }
executed 1 time by 1 test: end of block
Executed by:
  • ideatest
1
101 else-
102 {-
103 n2l(iv,xor0);-
104 n2l(iv,xor1);-
105 iv-=8;-
106 for (l-=8; l>=0; l-=8)
l>=0Description
TRUEevaluated 3 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 2 times by 1 test
Evaluated by:
  • ideatest
2-3
107 {-
108 n2l(in,tin0); tin[0]=tin0;-
109 n2l(in,tin1); tin[1]=tin1;-
110 idea_encrypt(tin,ks);-
111 tout0=tin[0]^xor0;-
112 tout1=tin[1]^xor1;-
113 l2n(tout0,out);-
114 l2n(tout1,out);-
115 xor0=tin0;-
116 xor1=tin1;-
117 }
executed 3 times by 1 test: end of block
Executed by:
  • ideatest
3
118 if (l != -8)
l != -8Description
TRUEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
1
119 {-
120 n2l(in,tin0); tin[0]=tin0;-
121 n2l(in,tin1); tin[1]=tin1;-
122 idea_encrypt(tin,ks);-
123 tout0=tin[0]^xor0;-
124 tout1=tin[1]^xor1;-
125 l2nn(tout0,tout1,out,l+8);
executed 1 time by 1 test: end of block
Executed by:
  • ideatest
code before this statement never executed: case 7:
code before this statement never executed: case 6:
code before this statement executed 1 time by 1 test: case 5:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 4:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 3:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 2:
Executed by:
  • ideatest
code before this statement executed 1 time by 1 test: case 1:
Executed by:
  • ideatest
never executed: case 8:
never executed: case 7:
executed 1 time by 1 test: case 6:
Executed by:
  • ideatest
never executed: case 5:
never executed: case 4:
never executed: case 3:
never executed: case 2:
executed 1 time by 1 test: case 1:
Executed by:
  • ideatest
0-1
126 xor0=tin0;-
127 xor1=tin1;-
128 }
executed 1 time by 1 test: end of block
Executed by:
  • ideatest
1
129 l2n(xor0,iv);-
130 l2n(xor1,iv);-
131 }
executed 2 times by 1 test: end of block
Executed by:
  • ideatest
2
132 tin0=tin1=tout0=tout1=xor0=xor1=0;-
133 tin[0]=tin[1]=0;-
134 }
executed 3 times by 1 test: end of block
Executed by:
  • ideatest
3
135-
136void idea_encrypt(unsigned long *d, IDEA_KEY_SCHEDULE *key)-
137 {-
138 IDEA_INT *p;-
139 unsigned long x1,x2,x3,x4,t0,t1,ul;-
140-
141 x2=d[0];-
142 x1=(x2>>16);-
143 x4=d[1];-
144 x3=(x4>>16);-
145-
146 p= &(key->data[0][0]);-
147-
148 E_IDEA(0);
executed 15 times by 1 test: end of block
Executed by:
  • ideatest
executed 1 time by 1 test: x1=(-(int)x1-*p+1);
Executed by:
  • ideatest
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 15 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
149 E_IDEA(1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 11 times by 1 test: end of block
Executed by:
  • ideatest
executed 5 times by 1 test: t0=(-(int)t0-*p+1);
Executed by:
  • ideatest
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 11 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 5 times by 1 test
Evaluated by:
  • ideatest
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
150 E_IDEA(2);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
151 E_IDEA(3);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
152 E_IDEA(4);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
153 E_IDEA(5);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
154 E_IDEA(6);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 11 times by 1 test: end of block
Executed by:
  • ideatest
executed 5 times by 1 test: t0=(-(int)t0-*p+1);
Executed by:
  • ideatest
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 11 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 5 times by 1 test
Evaluated by:
  • ideatest
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
155 E_IDEA(7);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x1=(-(int)x1-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t0=(-(int)t0-*p+1);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: t1=(-(int)t1-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
156-
157 x1&=0xffff;-
158 idea_mul(x1,x1,*p,ul); p++;
executed 15 times by 1 test: end of block
Executed by:
  • ideatest
executed 1 time by 1 test: x1=(-(int)x1-*p+1);
Executed by:
  • ideatest
ul != 0Description
TRUEevaluated 15 times by 1 test
Evaluated by:
  • ideatest
FALSEevaluated 1 time by 1 test
Evaluated by:
  • ideatest
1-15
159-
160 t0= x3+ *(p++);-
161 t1= x2+ *(p++);-
162-
163 x4&=0xffff;-
164 idea_mul(x4,x4,*p,ul);
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
never executed: x4=(-(int)x4-*p+1);
ul != 0Description
TRUEevaluated 16 times by 1 test
Evaluated by:
  • ideatest
FALSEnever evaluated
0-16
165-
166 d[0]=(t0&0xffff)|((x1&0xffff)<<16);-
167 d[1]=(x4&0xffff)|((t1&0xffff)<<16);-
168 }
executed 16 times by 1 test: end of block
Executed by:
  • ideatest
16
Source codeSwitch to Preprocessed file
Generated by Squish Coco 4.2.2