Bug Summary

File:src/lib/libcrypto/cast/c_enc.c
Warning:line 204, column 2
Value stored to 'tin0' is never read

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple amd64-unknown-openbsd7.4 -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name c_enc.c -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 1 -pic-is-pie -mframe-pointer=all -relaxed-aliasing -ffp-contract=on -fno-rounding-math -mconstructor-aliases -funwind-tables=2 -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/lib/libcrypto/obj -resource-dir /usr/local/llvm16/lib/clang/16 -D LIBRESSL_INTERNAL -D HAVE_FUNOPEN -I /usr/src/lib/libcrypto -I /usr/src/lib/libcrypto/arch/amd64 -I /usr/src/lib/libcrypto/asn1 -I /usr/src/lib/libcrypto/bio -I /usr/src/lib/libcrypto/bn -I /usr/src/lib/libcrypto/bn/arch/amd64 -I /usr/src/lib/libcrypto/bytestring -I /usr/src/lib/libcrypto/curve25519 -I /usr/src/lib/libcrypto/dh -I /usr/src/lib/libcrypto/dsa -I /usr/src/lib/libcrypto/ec -I /usr/src/lib/libcrypto/ecdsa -I /usr/src/lib/libcrypto/evp -I /usr/src/lib/libcrypto/hidden -I /usr/src/lib/libcrypto/hmac -I /usr/src/lib/libcrypto/kdf -I /usr/src/lib/libcrypto/modes -I /usr/src/lib/libcrypto/ocsp -I /usr/src/lib/libcrypto/pkcs12 -I /usr/src/lib/libcrypto/rsa -I /usr/src/lib/libcrypto/sha -I /usr/src/lib/libcrypto/ts -I /usr/src/lib/libcrypto/x509 -I /usr/src/lib/libcrypto/obj -D AES_ASM -D BSAES_ASM -D VPAES_ASM -D OPENSSL_IA32_SSE2 -D RSA_ASM -D OPENSSL_BN_ASM_MONT -D OPENSSL_BN_ASM_MONT5 -D MD5_ASM -D GHASH_ASM -D RC4_MD5_ASM -D SHA1_ASM -D SHA256_ASM -D SHA512_ASM -D WHIRLPOOL_ASM -D OPENSSL_CPUID_OBJ -internal-isystem /usr/local/llvm16/lib/clang/16/include -internal-externc-isystem /usr/include -O2 -fdebug-compilation-dir=/usr/src/lib/libcrypto/obj -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fcf-protection=branch -fno-jump-tables -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/scan/2024-01-11-140451-98009-1 -x c /usr/src/lib/libcrypto/cast/c_enc.c
1/* $OpenBSD: c_enc.c,v 1.10 2023/07/08 10:43:59 beck 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/cast.h>
60#include "cast_local.h"
61
62#ifndef OPENBSD_CAST_ASM
63void
64CAST_encrypt(CAST_LONGunsigned int *data, const CAST_KEY *key)
65{
66 CAST_LONGunsigned int l, r, t;
67 const CAST_LONGunsigned int *k;
68
69 k = &(key->data[0]);
70 l = data[0];
71 r = data[1];
72
73 E_CAST( 0, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[0*2] + r)&0xffffffff; t=((((
t)<<((k[0*2+1])))&0xffffffffL)|((t)>>((32-((k
[0*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
74 E_CAST( 1, k,r, l,^, -,+){ unsigned int a,b,c,d; t=(k[1*2] ^ l)&0xffffffff; t=((((
t)<<((k[1*2+1])))&0xffffffffL)|((t)>>((32-((k
[1*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
75 E_CAST( 2, k,l, r, -,+,^){ unsigned int a,b,c,d; t=(k[2*2] - r)&0xffffffff; t=((((
t)<<((k[2*2+1])))&0xffffffffL)|((t)>>((32-((k
[2*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
76 E_CAST( 3, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[3*2] + l)&0xffffffff; t=((((
t)<<((k[3*2+1])))&0xffffffffL)|((t)>>((32-((k
[3*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
77 E_CAST( 4, k,l, r,^, -,+){ unsigned int a,b,c,d; t=(k[4*2] ^ r)&0xffffffff; t=((((
t)<<((k[4*2+1])))&0xffffffffL)|((t)>>((32-((k
[4*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
78 E_CAST( 5, k,r, l, -,+,^){ unsigned int a,b,c,d; t=(k[5*2] - l)&0xffffffff; t=((((
t)<<((k[5*2+1])))&0xffffffffL)|((t)>>((32-((k
[5*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
79 E_CAST( 6, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[6*2] + r)&0xffffffff; t=((((
t)<<((k[6*2+1])))&0xffffffffL)|((t)>>((32-((k
[6*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
80 E_CAST( 7, k,r, l,^, -,+){ unsigned int a,b,c,d; t=(k[7*2] ^ l)&0xffffffff; t=((((
t)<<((k[7*2+1])))&0xffffffffL)|((t)>>((32-((k
[7*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
81 E_CAST( 8, k,l, r, -,+,^){ unsigned int a,b,c,d; t=(k[8*2] - r)&0xffffffff; t=((((
t)<<((k[8*2+1])))&0xffffffffL)|((t)>>((32-((k
[8*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
82 E_CAST( 9, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[9*2] + l)&0xffffffff; t=((((
t)<<((k[9*2+1])))&0xffffffffL)|((t)>>((32-((k
[9*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
83 E_CAST(10, k,l, r,^, -,+){ unsigned int a,b,c,d; t=(k[10*2] ^ r)&0xffffffff; t=(((
(t)<<((k[10*2+1])))&0xffffffffL)|((t)>>((32-(
(k[10*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
84 E_CAST(11, k,r, l, -,+,^){ unsigned int a,b,c,d; t=(k[11*2] - l)&0xffffffff; t=(((
(t)<<((k[11*2+1])))&0xffffffffL)|((t)>>((32-(
(k[11*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
85 if (!key->short_key) {
86 E_CAST(12, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[12*2] + r)&0xffffffff; t=(((
(t)<<((k[12*2+1])))&0xffffffffL)|((t)>>((32-(
(k[12*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
87 E_CAST(13, k,r, l,^, -,+){ unsigned int a,b,c,d; t=(k[13*2] ^ l)&0xffffffff; t=(((
(t)<<((k[13*2+1])))&0xffffffffL)|((t)>>((32-(
(k[13*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
88 E_CAST(14, k,l, r, -,+,^){ unsigned int a,b,c,d; t=(k[14*2] - r)&0xffffffff; t=(((
(t)<<((k[14*2+1])))&0xffffffffL)|((t)>>((32-(
(k[14*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
89 E_CAST(15, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[15*2] + l)&0xffffffff; t=(((
(t)<<((k[15*2+1])))&0xffffffffL)|((t)>>((32-(
(k[15*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
90 }
91
92 data[1] = l&0xffffffffL;
93 data[0] = r&0xffffffffL;
94}
95LCRYPTO_ALIAS(CAST_encrypt)asm("");
96
97void
98CAST_decrypt(CAST_LONGunsigned int *data, const CAST_KEY *key)
99{
100 CAST_LONGunsigned int l, r, t;
101 const CAST_LONGunsigned int *k;
102
103 k = &(key->data[0]);
104 l = data[0];
105 r = data[1];
106
107 if (!key->short_key) {
108 E_CAST(15, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[15*2] + r)&0xffffffff; t=(((
(t)<<((k[15*2+1])))&0xffffffffL)|((t)>>((32-(
(k[15*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
109 E_CAST(14, k,r, l, -,+,^){ unsigned int a,b,c,d; t=(k[14*2] - l)&0xffffffff; t=(((
(t)<<((k[14*2+1])))&0xffffffffL)|((t)>>((32-(
(k[14*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
110 E_CAST(13, k,l, r,^, -,+){ unsigned int a,b,c,d; t=(k[13*2] ^ r)&0xffffffff; t=(((
(t)<<((k[13*2+1])))&0xffffffffL)|((t)>>((32-(
(k[13*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
111 E_CAST(12, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[12*2] + l)&0xffffffff; t=(((
(t)<<((k[12*2+1])))&0xffffffffL)|((t)>>((32-(
(k[12*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
112 }
113 E_CAST(11, k,l, r, -,+,^){ unsigned int a,b,c,d; t=(k[11*2] - r)&0xffffffff; t=(((
(t)<<((k[11*2+1])))&0xffffffffL)|((t)>>((32-(
(k[11*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((
(((a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
114 E_CAST(10, k,r, l,^, -,+){ unsigned int a,b,c,d; t=(k[10*2] ^ l)&0xffffffff; t=(((
(t)<<((k[10*2+1])))&0xffffffffL)|((t)>>((32-(
(k[10*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff
]; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>
24)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((
(((a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
115 E_CAST( 9, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[9*2] + r)&0xffffffff; t=((((
t)<<((k[9*2+1])))&0xffffffffL)|((t)>>((32-((k
[9*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
116 E_CAST( 8, k,r, l, -,+,^){ unsigned int a,b,c,d; t=(k[8*2] - l)&0xffffffff; t=((((
t)<<((k[8*2+1])))&0xffffffffL)|((t)>>((32-((k
[8*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
117 E_CAST( 7, k,l, r,^, -,+){ unsigned int a,b,c,d; t=(k[7*2] ^ r)&0xffffffff; t=((((
t)<<((k[7*2+1])))&0xffffffffL)|((t)>>((32-((k
[7*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
118 E_CAST( 6, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[6*2] + l)&0xffffffff; t=((((
t)<<((k[6*2+1])))&0xffffffffL)|((t)>>((32-((k
[6*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
119 E_CAST( 5, k,l, r, -,+,^){ unsigned int a,b,c,d; t=(k[5*2] - r)&0xffffffff; t=((((
t)<<((k[5*2+1])))&0xffffffffL)|((t)>>((32-((k
[5*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
120 E_CAST( 4, k,r, l,^, -,+){ unsigned int a,b,c,d; t=(k[4*2] ^ l)&0xffffffff; t=((((
t)<<((k[4*2+1])))&0xffffffffL)|((t)>>((32-((k
[4*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
121 E_CAST( 3, k,l, r,+,^, -){ unsigned int a,b,c,d; t=(k[3*2] + r)&0xffffffff; t=((((
t)<<((k[3*2+1])))&0xffffffffL)|((t)>>((32-((k
[3*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
122 E_CAST( 2, k,r, l, -,+,^){ unsigned int a,b,c,d; t=(k[2*2] - l)&0xffffffff; t=((((
t)<<((k[2*2+1])))&0xffffffffL)|((t)>>((32-((k
[2*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a + b)&0xffffffffL) ^ c)&0xffffffffL) - d)&0xffffffffL
; };
123 E_CAST( 1, k,l, r,^, -,+){ unsigned int a,b,c,d; t=(k[1*2] ^ r)&0xffffffff; t=((((
t)<<((k[1*2+1])))&0xffffffffL)|((t)>>((32-((k
[1*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; l^=((((
(a - b)&0xffffffffL) + c)&0xffffffffL) ^ d)&0xffffffffL
; };
124 E_CAST( 0, k,r, l,+,^, -){ unsigned int a,b,c,d; t=(k[0*2] + l)&0xffffffff; t=((((
t)<<((k[0*2+1])))&0xffffffffL)|((t)>>((32-((k
[0*2+1])))&31))); a=CAST_S_table0[(t>> 8)&0xff]
; b=CAST_S_table1[(t )&0xff]; c=CAST_S_table2[(t>>24
)&0xff]; d=CAST_S_table3[(t>>16)&0xff]; r^=((((
(a ^ b)&0xffffffffL) - c)&0xffffffffL) + d)&0xffffffffL
; };
125
126 data[1] = l&0xffffffffL;
127 data[0] = r&0xffffffffL;
128}
129LCRYPTO_ALIAS(CAST_decrypt)asm("");
130#endif
131
132void
133CAST_cbc_encrypt(const unsigned char *in, unsigned char *out, long length,
134 const CAST_KEY *ks, unsigned char *iv, int enc)
135{
136 CAST_LONGunsigned int tin0, tin1;
137 CAST_LONGunsigned int tout0, tout1, xor0, xor1;
138 long l = length;
139 CAST_LONGunsigned int tin[2];
140
141 if (enc) {
142 n2l(iv, tout0)(tout0 =((unsigned long)(*((iv)++)))<<24L, tout0|=((unsigned
long)(*((iv)++)))<<16L, tout0|=((unsigned long)(*((iv)
++)))<< 8L, tout0|=((unsigned long)(*((iv)++))));
143 n2l(iv, tout1)(tout1 =((unsigned long)(*((iv)++)))<<24L, tout1|=((unsigned
long)(*((iv)++)))<<16L, tout1|=((unsigned long)(*((iv)
++)))<< 8L, tout1|=((unsigned long)(*((iv)++))));
144 iv -= 8;
145 for (l -= 8; l >= 0; l -= 8) {
146 n2l(in, tin0)(tin0 =((unsigned long)(*((in)++)))<<24L, tin0|=((unsigned
long)(*((in)++)))<<16L, tin0|=((unsigned long)(*((in)++
)))<< 8L, tin0|=((unsigned long)(*((in)++))));
147 n2l(in, tin1)(tin1 =((unsigned long)(*((in)++)))<<24L, tin1|=((unsigned
long)(*((in)++)))<<16L, tin1|=((unsigned long)(*((in)++
)))<< 8L, tin1|=((unsigned long)(*((in)++))));
148 tin0 ^= tout0;
149 tin1 ^= tout1;
150 tin[0] = tin0;
151 tin[1] = tin1;
152 CAST_encrypt(tin, ks);
153 tout0 = tin[0];
154 tout1 = tin[1];
155 l2n(tout0, out)(*((out)++)=(unsigned char)(((tout0)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout0)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout0)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout0) )&0xff));
156 l2n(tout1, out)(*((out)++)=(unsigned char)(((tout1)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout1)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout1)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout1) )&0xff));
157 }
158 if (l != -8) {
159 n2ln(in, tin0, tin1, l + 8){ in+=l + 8; tin0=tin1=0; switch (l + 8) { case 8: tin1 =((unsigned
long)(*(--(in)))) ; case 7: tin1|=((unsigned long)(*(--(in))
))<< 8; case 6: tin1|=((unsigned long)(*(--(in))))<<
16; case 5: tin1|=((unsigned long)(*(--(in))))<<24; case
4: tin0 =((unsigned long)(*(--(in)))) ; case 3: tin0|=((unsigned
long)(*(--(in))))<< 8; case 2: tin0|=((unsigned long)(
*(--(in))))<<16; case 1: tin0|=((unsigned long)(*(--(in
))))<<24; } };
160 tin0 ^= tout0;
161 tin1 ^= tout1;
162 tin[0] = tin0;
163 tin[1] = tin1;
164 CAST_encrypt(tin, ks);
165 tout0 = tin[0];
166 tout1 = tin[1];
167 l2n(tout0, out)(*((out)++)=(unsigned char)(((tout0)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout0)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout0)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout0) )&0xff));
168 l2n(tout1, out)(*((out)++)=(unsigned char)(((tout1)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout1)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout1)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout1) )&0xff));
169 }
170 l2n(tout0, iv)(*((iv)++)=(unsigned char)(((tout0)>>24L)&0xff), *(
(iv)++)=(unsigned char)(((tout0)>>16L)&0xff), *((iv
)++)=(unsigned char)(((tout0)>> 8L)&0xff), *((iv)++
)=(unsigned char)(((tout0) )&0xff));
171 l2n(tout1, iv)(*((iv)++)=(unsigned char)(((tout1)>>24L)&0xff), *(
(iv)++)=(unsigned char)(((tout1)>>16L)&0xff), *((iv
)++)=(unsigned char)(((tout1)>> 8L)&0xff), *((iv)++
)=(unsigned char)(((tout1) )&0xff));
172 } else {
173 n2l(iv, xor0)(xor0 =((unsigned long)(*((iv)++)))<<24L, xor0|=((unsigned
long)(*((iv)++)))<<16L, xor0|=((unsigned long)(*((iv)++
)))<< 8L, xor0|=((unsigned long)(*((iv)++))));
174 n2l(iv, xor1)(xor1 =((unsigned long)(*((iv)++)))<<24L, xor1|=((unsigned
long)(*((iv)++)))<<16L, xor1|=((unsigned long)(*((iv)++
)))<< 8L, xor1|=((unsigned long)(*((iv)++))));
175 iv -= 8;
176 for (l -= 8; l >= 0; l -= 8) {
177 n2l(in, tin0)(tin0 =((unsigned long)(*((in)++)))<<24L, tin0|=((unsigned
long)(*((in)++)))<<16L, tin0|=((unsigned long)(*((in)++
)))<< 8L, tin0|=((unsigned long)(*((in)++))));
178 n2l(in, tin1)(tin1 =((unsigned long)(*((in)++)))<<24L, tin1|=((unsigned
long)(*((in)++)))<<16L, tin1|=((unsigned long)(*((in)++
)))<< 8L, tin1|=((unsigned long)(*((in)++))));
179 tin[0] = tin0;
180 tin[1] = tin1;
181 CAST_decrypt(tin, ks);
182 tout0 = tin[0]^xor0;
183 tout1 = tin[1]^xor1;
184 l2n(tout0, out)(*((out)++)=(unsigned char)(((tout0)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout0)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout0)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout0) )&0xff));
185 l2n(tout1, out)(*((out)++)=(unsigned char)(((tout1)>>24L)&0xff), *
((out)++)=(unsigned char)(((tout1)>>16L)&0xff), *((
out)++)=(unsigned char)(((tout1)>> 8L)&0xff), *((out
)++)=(unsigned char)(((tout1) )&0xff));
186 xor0 = tin0;
187 xor1 = tin1;
188 }
189 if (l != -8) {
190 n2l(in, tin0)(tin0 =((unsigned long)(*((in)++)))<<24L, tin0|=((unsigned
long)(*((in)++)))<<16L, tin0|=((unsigned long)(*((in)++
)))<< 8L, tin0|=((unsigned long)(*((in)++))));
191 n2l(in, tin1)(tin1 =((unsigned long)(*((in)++)))<<24L, tin1|=((unsigned
long)(*((in)++)))<<16L, tin1|=((unsigned long)(*((in)++
)))<< 8L, tin1|=((unsigned long)(*((in)++))));
192 tin[0] = tin0;
193 tin[1] = tin1;
194 CAST_decrypt(tin, ks);
195 tout0 = tin[0]^xor0;
196 tout1 = tin[1]^xor1;
197 l2nn(tout0, tout1, out, l + 8){ out+=l + 8; switch (l + 8) { case 8: *(--(out))=(unsigned char
)(((tout1) )&0xff); case 7: *(--(out))=(unsigned char)(((
tout1)>> 8)&0xff); case 6: *(--(out))=(unsigned char
)(((tout1)>>16)&0xff); case 5: *(--(out))=(unsigned
char)(((tout1)>>24)&0xff); case 4: *(--(out))=(unsigned
char)(((tout0) )&0xff); case 3: *(--(out))=(unsigned char
)(((tout0)>> 8)&0xff); case 2: *(--(out))=(unsigned
char)(((tout0)>>16)&0xff); case 1: *(--(out))=(unsigned
char)(((tout0)>>24)&0xff); } };
198 xor0 = tin0;
199 xor1 = tin1;
200 }
201 l2n(xor0, iv)(*((iv)++)=(unsigned char)(((xor0)>>24L)&0xff), *((
iv)++)=(unsigned char)(((xor0)>>16L)&0xff), *((iv)++
)=(unsigned char)(((xor0)>> 8L)&0xff), *((iv)++)=(unsigned
char)(((xor0) )&0xff));
202 l2n(xor1, iv)(*((iv)++)=(unsigned char)(((xor1)>>24L)&0xff), *((
iv)++)=(unsigned char)(((xor1)>>16L)&0xff), *((iv)++
)=(unsigned char)(((xor1)>> 8L)&0xff), *((iv)++)=(unsigned
char)(((xor1) )&0xff));
203 }
204 tin0 = tin1 = tout0 = tout1 = xor0 = xor1 = 0;
Value stored to 'tin0' is never read
205 tin[0] = tin[1] = 0;
206}
207LCRYPTO_ALIAS(CAST_cbc_encrypt)asm("");