diff options
Diffstat (limited to 'src/lib')
-rw-r--r-- | src/lib/libcrypto/bn/bn_shift.c | 167 |
1 files changed, 42 insertions, 125 deletions
diff --git a/src/lib/libcrypto/bn/bn_shift.c b/src/lib/libcrypto/bn/bn_shift.c index 4b9a133b13..5fd6687076 100644 --- a/src/lib/libcrypto/bn/bn_shift.c +++ b/src/lib/libcrypto/bn/bn_shift.c | |||
@@ -1,134 +1,27 @@ | |||
1 | /* $OpenBSD: bn_shift.c,v 1.19 2023/01/10 04:13:22 jsing Exp $ */ | 1 | /* $OpenBSD: bn_shift.c,v 1.20 2023/01/11 04:26:24 jsing Exp $ */ |
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | 2 | /* |
3 | * All rights reserved. | 3 | * Copyright (c) 2022, 2023 Joel Sing <jsing@openbsd.org> |
4 | * | 4 | * |
5 | * This package is an SSL implementation written | 5 | * Permission to use, copy, modify, and distribute this software for any |
6 | * by Eric Young (eay@cryptsoft.com). | 6 | * purpose with or without fee is hereby granted, provided that the above |
7 | * The implementation was written so as to conform with Netscapes SSL. | 7 | * copyright notice and this permission notice appear in all copies. |
8 | * | 8 | * |
9 | * This library is free for commercial and non-commercial use as long as | 9 | * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
10 | * the following conditions are aheared to. The following conditions | 10 | * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | 11 | * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | 12 | * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
13 | * included with this distribution is covered by the same copyright terms | 13 | * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | 14 | * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
15 | * | 15 | * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
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 | */ | 16 | */ |
58 | 17 | ||
59 | #include <stdio.h> | 18 | #include <openssl/bn.h> |
60 | #include <string.h> | ||
61 | |||
62 | #include <openssl/err.h> | 19 | #include <openssl/err.h> |
63 | 20 | ||
64 | #include "bn_local.h" | 21 | #include "bn_local.h" |
65 | 22 | ||
66 | int | 23 | static inline int |
67 | BN_lshift1(BIGNUM *r, const BIGNUM *a) | 24 | bn_lshift(BIGNUM *r, const BIGNUM *a, int n) |
68 | { | ||
69 | BN_ULONG *ap, *rp, t, c; | ||
70 | int i; | ||
71 | |||
72 | |||
73 | if (r != a) { | ||
74 | r->neg = a->neg; | ||
75 | if (!bn_wexpand(r, a->top + 1)) | ||
76 | return (0); | ||
77 | r->top = a->top; | ||
78 | } else { | ||
79 | if (!bn_wexpand(r, a->top + 1)) | ||
80 | return (0); | ||
81 | } | ||
82 | ap = a->d; | ||
83 | rp = r->d; | ||
84 | c = 0; | ||
85 | for (i = 0; i < a->top; i++) { | ||
86 | t= *(ap++); | ||
87 | *(rp++) = ((t << 1) | c) & BN_MASK2; | ||
88 | c = (t & BN_TBIT) ? 1 : 0; | ||
89 | } | ||
90 | if (c) { | ||
91 | *rp = 1; | ||
92 | r->top++; | ||
93 | } | ||
94 | return (1); | ||
95 | } | ||
96 | |||
97 | int | ||
98 | BN_rshift1(BIGNUM *r, const BIGNUM *a) | ||
99 | { | ||
100 | BN_ULONG *ap, *rp, t, c; | ||
101 | int i, j; | ||
102 | |||
103 | |||
104 | if (BN_is_zero(a)) { | ||
105 | BN_zero(r); | ||
106 | return (1); | ||
107 | } | ||
108 | i = a->top; | ||
109 | ap = a->d; | ||
110 | j = i - (ap[i - 1]==1); | ||
111 | if (a != r) { | ||
112 | if (!bn_wexpand(r, j)) | ||
113 | return (0); | ||
114 | r->neg = a->neg; | ||
115 | } | ||
116 | rp = r->d; | ||
117 | t = ap[--i]; | ||
118 | c = (t & 1) ? BN_TBIT : 0; | ||
119 | if (t >>= 1) | ||
120 | rp[i] = t; | ||
121 | while (i > 0) { | ||
122 | t = ap[--i]; | ||
123 | rp[i] = ((t >> 1) & BN_MASK2) | c; | ||
124 | c = (t & 1) ? BN_TBIT : 0; | ||
125 | } | ||
126 | r->top = j; | ||
127 | return (1); | ||
128 | } | ||
129 | |||
130 | int | ||
131 | BN_lshift(BIGNUM *r, const BIGNUM *a, int n) | ||
132 | { | 25 | { |
133 | size_t count, shift_bits, shift_words; | 26 | size_t count, shift_bits, shift_words; |
134 | size_t lshift, rshift; | 27 | size_t lshift, rshift; |
@@ -197,8 +90,8 @@ BN_lshift(BIGNUM *r, const BIGNUM *a, int n) | |||
197 | return 1; | 90 | return 1; |
198 | } | 91 | } |
199 | 92 | ||
200 | int | 93 | static inline int |
201 | BN_rshift(BIGNUM *r, const BIGNUM *a, int n) | 94 | bn_rshift(BIGNUM *r, const BIGNUM *a, int n) |
202 | { | 95 | { |
203 | size_t count, shift_bits, shift_words; | 96 | size_t count, shift_bits, shift_words; |
204 | size_t lshift, rshift; | 97 | size_t lshift, rshift; |
@@ -252,3 +145,27 @@ BN_rshift(BIGNUM *r, const BIGNUM *a, int n) | |||
252 | 145 | ||
253 | return 1; | 146 | return 1; |
254 | } | 147 | } |
148 | |||
149 | int | ||
150 | BN_lshift1(BIGNUM *r, const BIGNUM *a) | ||
151 | { | ||
152 | return bn_lshift(r, a, 1); | ||
153 | } | ||
154 | |||
155 | int | ||
156 | BN_lshift(BIGNUM *r, const BIGNUM *a, int n) | ||
157 | { | ||
158 | return bn_lshift(r, a, n); | ||
159 | } | ||
160 | |||
161 | int | ||
162 | BN_rshift1(BIGNUM *r, const BIGNUM *a) | ||
163 | { | ||
164 | return bn_rshift(r, a, 1); | ||
165 | } | ||
166 | |||
167 | int | ||
168 | BN_rshift(BIGNUM *r, const BIGNUM *a, int n) | ||
169 | { | ||
170 | return bn_rshift(r, a, n); | ||
171 | } | ||