summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bn/bn_word.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/bn/bn_word.c')
-rw-r--r--src/lib/libcrypto/bn/bn_word.c233
1 files changed, 0 insertions, 233 deletions
diff --git a/src/lib/libcrypto/bn/bn_word.c b/src/lib/libcrypto/bn/bn_word.c
deleted file mode 100644
index c4c6754c37..0000000000
--- a/src/lib/libcrypto/bn/bn_word.c
+++ /dev/null
@@ -1,233 +0,0 @@
1/* $OpenBSD: bn_word.c,v 1.12 2014/07/11 08:44:48 jsing 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 <stdio.h>
60
61#include "bn_lcl.h"
62
63BN_ULONG
64BN_mod_word(const BIGNUM *a, BN_ULONG w)
65{
66#ifndef BN_LLONG
67 BN_ULONG ret = 0;
68#else
69 BN_ULLONG ret = 0;
70#endif
71 int i;
72
73 if (w == 0)
74 return (BN_ULONG) - 1;
75
76 bn_check_top(a);
77 w &= BN_MASK2;
78 for (i = a->top - 1; i >= 0; i--) {
79#ifndef BN_LLONG
80 ret = ((ret << BN_BITS4) | ((a->d[i] >> BN_BITS4) &
81 BN_MASK2l)) % w;
82 ret = ((ret << BN_BITS4) | (a->d[i] & BN_MASK2l)) % w;
83#else
84 ret = (BN_ULLONG)(((ret << (BN_ULLONG)BN_BITS2) |
85 a->d[i]) % (BN_ULLONG)w);
86#endif
87 }
88 return ((BN_ULONG)ret);
89}
90
91BN_ULONG
92BN_div_word(BIGNUM *a, BN_ULONG w)
93{
94 BN_ULONG ret = 0;
95 int i, j;
96
97 bn_check_top(a);
98 w &= BN_MASK2;
99
100 if (!w)
101 /* actually this an error (division by zero) */
102 return (BN_ULONG) - 1;
103 if (a->top == 0)
104 return 0;
105
106 /* normalize input (so bn_div_words doesn't complain) */
107 j = BN_BITS2 - BN_num_bits_word(w);
108 w <<= j;
109 if (!BN_lshift(a, a, j))
110 return (BN_ULONG) - 1;
111
112 for (i = a->top - 1; i >= 0; i--) {
113 BN_ULONG l, d;
114
115 l = a->d[i];
116 d = bn_div_words(ret, l, w);
117 ret = (l - ((d*w)&BN_MASK2))&BN_MASK2;
118 a->d[i] = d;
119 }
120 if ((a->top > 0) && (a->d[a->top - 1] == 0))
121 a->top--;
122 ret >>= j;
123 bn_check_top(a);
124 return (ret);
125}
126
127int
128BN_add_word(BIGNUM *a, BN_ULONG w)
129{
130 BN_ULONG l;
131 int i;
132
133 bn_check_top(a);
134 w &= BN_MASK2;
135
136 /* degenerate case: w is zero */
137 if (!w)
138 return 1;
139 /* degenerate case: a is zero */
140 if (BN_is_zero(a))
141 return BN_set_word(a, w);
142 /* handle 'a' when negative */
143 if (a->neg) {
144 a->neg = 0;
145 i = BN_sub_word(a, w);
146 if (!BN_is_zero(a))
147 a->neg=!(a->neg);
148 return (i);
149 }
150 for (i = 0; w != 0 && i < a->top; i++) {
151 a->d[i] = l = (a->d[i] + w) & BN_MASK2;
152 w = (w > l) ? 1 : 0;
153 }
154 if (w && i == a->top) {
155 if (bn_wexpand(a, a->top + 1) == NULL)
156 return 0;
157 a->top++;
158 a->d[i] = w;
159 }
160 bn_check_top(a);
161 return (1);
162}
163
164int
165BN_sub_word(BIGNUM *a, BN_ULONG w)
166{
167 int i;
168
169 bn_check_top(a);
170 w &= BN_MASK2;
171
172 /* degenerate case: w is zero */
173 if (!w)
174 return 1;
175 /* degenerate case: a is zero */
176 if (BN_is_zero(a)) {
177 i = BN_set_word(a, w);
178 if (i != 0)
179 BN_set_negative(a, 1);
180 return i;
181 }
182 /* handle 'a' when negative */
183 if (a->neg) {
184 a->neg = 0;
185 i = BN_add_word(a, w);
186 a->neg = 1;
187 return (i);
188 }
189
190 if ((a->top == 1) && (a->d[0] < w)) {
191 a->d[0] = w - a->d[0];
192 a->neg = 1;
193 return (1);
194 }
195 i = 0;
196 for (;;) {
197 if (a->d[i] >= w) {
198 a->d[i] -= w;
199 break;
200 } else {
201 a->d[i] = (a->d[i] - w) & BN_MASK2;
202 i++;
203 w = 1;
204 }
205 }
206 if ((a->d[i] == 0) && (i == (a->top - 1)))
207 a->top--;
208 bn_check_top(a);
209 return (1);
210}
211
212int
213BN_mul_word(BIGNUM *a, BN_ULONG w)
214{
215 BN_ULONG ll;
216
217 bn_check_top(a);
218 w &= BN_MASK2;
219 if (a->top) {
220 if (w == 0)
221 BN_zero(a);
222 else {
223 ll = bn_mul_words(a->d, a->d, a->top, w);
224 if (ll) {
225 if (bn_wexpand(a, a->top + 1) == NULL)
226 return (0);
227 a->d[a->top++] = ll;
228 }
229 }
230 }
231 bn_check_top(a);
232 return (1);
233}
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-08-09 14:59:09 +0000