summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bf/bf_local.h
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--src/lib/libcrypto/bf/bf_local.h156
1 files changed, 0 insertions, 156 deletions
diff --git a/src/lib/libcrypto/bf/bf_local.h b/src/lib/libcrypto/bf/bf_local.h
deleted file mode 100644
index 8fc5a5dbd8..0000000000
--- a/src/lib/libcrypto/bf/bf_local.h
+++ /dev/null
@@ -1,156 +0,0 @@
1/* $OpenBSD: bf_local.h,v 1.3 2024/03/27 11:54:29 jsing Exp $ */
2/* Copyright (C) 1995-1997 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/opensslconf.h> /* BF_PTR */
60
61#ifndef HEADER_BF_LOCL_H
62#define HEADER_BF_LOCL_H
63
64/* NOTE - c is not incremented as per n2l */
65#define n2ln(c,l1,l2,n) { \
66 c+=n; \
67 l1=l2=0; \
68 switch (n) { \
69 case 8: l2 =((unsigned long)(*(--(c)))) ; \
70 case 7: l2|=((unsigned long)(*(--(c))))<< 8; \
71 case 6: l2|=((unsigned long)(*(--(c))))<<16; \
72 case 5: l2|=((unsigned long)(*(--(c))))<<24; \
73 case 4: l1 =((unsigned long)(*(--(c)))) ; \
74 case 3: l1|=((unsigned long)(*(--(c))))<< 8; \
75 case 2: l1|=((unsigned long)(*(--(c))))<<16; \
76 case 1: l1|=((unsigned long)(*(--(c))))<<24; \
77 } \
78 }
79
80/* NOTE - c is not incremented as per l2n */
81#define l2nn(l1,l2,c,n) { \
82 c+=n; \
83 switch (n) { \
84 case 8: *(--(c))=(unsigned char)(((l2) )&0xff); \
85 case 7: *(--(c))=(unsigned char)(((l2)>> 8)&0xff); \
86 case 6: *(--(c))=(unsigned char)(((l2)>>16)&0xff); \
87 case 5: *(--(c))=(unsigned char)(((l2)>>24)&0xff); \
88 case 4: *(--(c))=(unsigned char)(((l1) )&0xff); \
89 case 3: *(--(c))=(unsigned char)(((l1)>> 8)&0xff); \
90 case 2: *(--(c))=(unsigned char)(((l1)>>16)&0xff); \
91 case 1: *(--(c))=(unsigned char)(((l1)>>24)&0xff); \
92 } \
93 }
94
95#undef n2l
96#define n2l(c,l) (l =((unsigned long)(*((c)++)))<<24L, \
97 l|=((unsigned long)(*((c)++)))<<16L, \
98 l|=((unsigned long)(*((c)++)))<< 8L, \
99 l|=((unsigned long)(*((c)++))))
100
101#undef l2n
102#define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
103 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
104 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
105 *((c)++)=(unsigned char)(((l) )&0xff))
106
107/* This is actually a big endian algorithm, the most significant byte
108 * is used to lookup array 0 */
109
110#if defined(BF_PTR)
111
112#ifndef BF_LONG_LOG2
113#define BF_LONG_LOG2 2 /* default to BF_LONG being 32 bits */
114#endif
115#define BF_M (0xFF<<BF_LONG_LOG2)
116#define BF_0 (24-BF_LONG_LOG2)
117#define BF_1 (16-BF_LONG_LOG2)
118#define BF_2 ( 8-BF_LONG_LOG2)
119#define BF_3 BF_LONG_LOG2 /* left shift */
120
121/*
122 * This is normally very good on RISC platforms where normally you
123 * have to explicitly "multiply" array index by sizeof(BF_LONG)
124 * in order to calculate the effective address. This implementation
125 * excuses CPU from this extra work. Power[PC] uses should have most
126 * fun as (R>>BF_i)&BF_M gets folded into a single instruction, namely
127 * rlwinm. So let'em double-check if their compiler does it.
128 */
129
130#define BF_ENC(LL,R,S,P) ( \
131 LL^=P, \
132 LL^= (((*(BF_LONG *)((unsigned char *)&(S[ 0])+((R>>BF_0)&BF_M))+ \
133 *(BF_LONG *)((unsigned char *)&(S[256])+((R>>BF_1)&BF_M)))^ \
134 *(BF_LONG *)((unsigned char *)&(S[512])+((R>>BF_2)&BF_M)))+ \
135 *(BF_LONG *)((unsigned char *)&(S[768])+((R<<BF_3)&BF_M))) \
136 )
137#else
138
139/*
140 * This is a *generic* version. Seem to perform best on platforms that
141 * offer explicit support for extraction of 8-bit nibbles preferably
142 * complemented with "multiplying" of array index by sizeof(BF_LONG).
143 * For the moment of this writing the list comprises Alpha CPU featuring
144 * extbl and s[48]addq instructions.
145 */
146
147#define BF_ENC(LL,R,S,P) ( \
148 LL^=P, \
149 LL^=((( S[ ((int)(R>>24)&0xff)] + \
150 S[0x0100+((int)(R>>16)&0xff)])^ \
151 S[0x0200+((int)(R>> 8)&0xff)])+ \
152 S[0x0300+((int)(R )&0xff)])&0xffffffffL \
153 )
154#endif
155
156#endif
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-05-08 07:40:40 +0000