summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/bn/bn_lib.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/bn/bn_lib.c')
-rw-r--r--src/lib/libcrypto/bn/bn_lib.c755
1 files changed, 0 insertions, 755 deletions
diff --git a/src/lib/libcrypto/bn/bn_lib.c b/src/lib/libcrypto/bn/bn_lib.c
deleted file mode 100644
index 0e6b12d9c3..0000000000
--- a/src/lib/libcrypto/bn/bn_lib.c
+++ /dev/null
@@ -1,755 +0,0 @@
1/* crypto/bn/bn_lib.c */
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#include "cryptlib.h"
61#include "bn_lcl.h"
62
63const char *BN_version="Big Number" OPENSSL_VERSION_PTEXT;
64
65/* For a 32 bit machine
66 * 2 - 4 == 128
67 * 3 - 8 == 256
68 * 4 - 16 == 512
69 * 5 - 32 == 1024
70 * 6 - 64 == 2048
71 * 7 - 128 == 4096
72 * 8 - 256 == 8192
73 */
74static int bn_limit_bits=0;
75static int bn_limit_num=8; /* (1<<bn_limit_bits) */
76static int bn_limit_bits_low=0;
77static int bn_limit_num_low=8; /* (1<<bn_limit_bits_low) */
78static int bn_limit_bits_high=0;
79static int bn_limit_num_high=8; /* (1<<bn_limit_bits_high) */
80static int bn_limit_bits_mont=0;
81static int bn_limit_num_mont=8; /* (1<<bn_limit_bits_mont) */
82
83void BN_set_params(int mult, int high, int low, int mont)
84 {
85 if (mult >= 0)
86 {
87 if (mult > (sizeof(int)*8)-1)
88 mult=sizeof(int)*8-1;
89 bn_limit_bits=mult;
90 bn_limit_num=1<<mult;
91 }
92 if (high >= 0)
93 {
94 if (high > (sizeof(int)*8)-1)
95 high=sizeof(int)*8-1;
96 bn_limit_bits_high=high;
97 bn_limit_num_high=1<<high;
98 }
99 if (low >= 0)
100 {
101 if (low > (sizeof(int)*8)-1)
102 low=sizeof(int)*8-1;
103 bn_limit_bits_low=low;
104 bn_limit_num_low=1<<low;
105 }
106 if (mont >= 0)
107 {
108 if (mont > (sizeof(int)*8)-1)
109 mont=sizeof(int)*8-1;
110 bn_limit_bits_mont=mont;
111 bn_limit_num_mont=1<<mont;
112 }
113 }
114
115int BN_get_params(int which)
116 {
117 if (which == 0) return(bn_limit_bits);
118 else if (which == 1) return(bn_limit_bits_high);
119 else if (which == 2) return(bn_limit_bits_low);
120 else if (which == 3) return(bn_limit_bits_mont);
121 else return(0);
122 }
123
124BIGNUM *BN_value_one(void)
125 {
126 static BN_ULONG data_one=1L;
127 static BIGNUM const_one={&data_one,1,1,0};
128
129 return(&const_one);
130 }
131
132char *BN_options(void)
133 {
134 static int init=0;
135 static char data[16];
136
137 if (!init)
138 {
139 init++;
140#ifdef BN_LLONG
141 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULLONG)*8,
142 (int)sizeof(BN_ULONG)*8);
143#else
144 sprintf(data,"bn(%d,%d)",(int)sizeof(BN_ULONG)*8,
145 (int)sizeof(BN_ULONG)*8);
146#endif
147 }
148 return(data);
149 }
150
151int BN_num_bits_word(BN_ULONG l)
152 {
153 static const char bits[256]={
154 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,
155 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
156 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
157 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
158 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
159 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
160 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
161 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
162 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
163 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
164 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
165 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
166 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
167 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
168 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
169 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
170 };
171
172#if defined(SIXTY_FOUR_BIT_LONG)
173 if (l & 0xffffffff00000000L)
174 {
175 if (l & 0xffff000000000000L)
176 {
177 if (l & 0xff00000000000000L)
178 {
179 return(bits[(int)(l>>56)]+56);
180 }
181 else return(bits[(int)(l>>48)]+48);
182 }
183 else
184 {
185 if (l & 0x0000ff0000000000L)
186 {
187 return(bits[(int)(l>>40)]+40);
188 }
189 else return(bits[(int)(l>>32)]+32);
190 }
191 }
192 else
193#else
194#ifdef SIXTY_FOUR_BIT
195 if (l & 0xffffffff00000000LL)
196 {
197 if (l & 0xffff000000000000LL)
198 {
199 if (l & 0xff00000000000000LL)
200 {
201 return(bits[(int)(l>>56)]+56);
202 }
203 else return(bits[(int)(l>>48)]+48);
204 }
205 else
206 {
207 if (l & 0x0000ff0000000000LL)
208 {
209 return(bits[(int)(l>>40)]+40);
210 }
211 else return(bits[(int)(l>>32)]+32);
212 }
213 }
214 else
215#endif
216#endif
217 {
218#if defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
219 if (l & 0xffff0000L)
220 {
221 if (l & 0xff000000L)
222 return(bits[(int)(l>>24L)]+24);
223 else return(bits[(int)(l>>16L)]+16);
224 }
225 else
226#endif
227 {
228#if defined(SIXTEEN_BIT) || defined(THIRTY_TWO_BIT) || defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
229 if (l & 0xff00L)
230 return(bits[(int)(l>>8)]+8);
231 else
232#endif
233 return(bits[(int)(l )] );
234 }
235 }
236 }
237
238int BN_num_bits(const BIGNUM *a)
239 {
240 BN_ULONG l;
241 int i;
242
243 bn_check_top(a);
244
245 if (a->top == 0) return(0);
246 l=a->d[a->top-1];
247 i=(a->top-1)*BN_BITS2;
248 if (l == 0)
249 {
250#if !defined(NO_STDIO) && !defined(WIN16)
251 fprintf(stderr,"BAD TOP VALUE\n");
252#endif
253 abort();
254 }
255 return(i+BN_num_bits_word(l));
256 }
257
258void BN_clear_free(BIGNUM *a)
259 {
260 int i;
261
262 if (a == NULL) return;
263 if (a->d != NULL)
264 {
265 memset(a->d,0,a->max*sizeof(a->d[0]));
266 if (!(BN_get_flags(a,BN_FLG_STATIC_DATA)))
267 Free(a->d);
268 }
269 i=BN_get_flags(a,BN_FLG_MALLOCED);
270 memset(a,0,sizeof(BIGNUM));
271 if (i)
272 Free(a);
273 }
274
275void BN_free(BIGNUM *a)
276 {
277 if (a == NULL) return;
278 if ((a->d != NULL) && !(BN_get_flags(a,BN_FLG_STATIC_DATA)))
279 Free(a->d);
280 a->flags|=BN_FLG_FREE; /* REMOVE? */
281 if (a->flags & BN_FLG_MALLOCED)
282 Free(a);
283 }
284
285void BN_init(BIGNUM *a)
286 {
287 memset(a,0,sizeof(BIGNUM));
288 }
289
290BIGNUM *BN_new(void)
291 {
292 BIGNUM *ret;
293
294 if ((ret=(BIGNUM *)Malloc(sizeof(BIGNUM))) == NULL)
295 {
296 BNerr(BN_F_BN_NEW,ERR_R_MALLOC_FAILURE);
297 return(NULL);
298 }
299 ret->flags=BN_FLG_MALLOCED;
300 ret->top=0;
301 ret->neg=0;
302 ret->max=0;
303 ret->d=NULL;
304 return(ret);
305 }
306
307/* This is an internal function that should not be used in applications.
308 * It ensures that 'b' has enough room for a 'words' word number number.
309 * It is mostly used by the various BIGNUM routines. If there is an error,
310 * NULL is returned. If not, 'b' is returned. */
311
312BIGNUM *bn_expand2(BIGNUM *b, int words)
313 {
314 BN_ULONG *A,*a;
315 const BN_ULONG *B;
316 int i;
317
318 bn_check_top(b);
319
320 if (words > b->max)
321 {
322 bn_check_top(b);
323 if (BN_get_flags(b,BN_FLG_STATIC_DATA))
324 {
325 BNerr(BN_F_BN_EXPAND2,BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
326 return(NULL);
327 }
328 a=A=(BN_ULONG *)Malloc(sizeof(BN_ULONG)*(words+1));
329 if (A == NULL)
330 {
331 BNerr(BN_F_BN_EXPAND2,ERR_R_MALLOC_FAILURE);
332 return(NULL);
333 }
334#if 1
335 B=b->d;
336 /* Check if the previous number needs to be copied */
337 if (B != NULL)
338 {
339#if 0
340 /* This lot is an unrolled loop to copy b->top
341 * BN_ULONGs from B to A
342 */
343/*
344 * I have nothing against unrolling but it's usually done for
345 * several reasons, namely:
346 * - minimize percentage of decision making code, i.e. branches;
347 * - avoid cache trashing;
348 * - make it possible to schedule loads earlier;
349 * Now let's examine the code below. The cornerstone of C is
350 * "programmer is always right" and that's what we love it for:-)
351 * For this very reason C compilers have to be paranoid when it
352 * comes to data aliasing and assume the worst. Yeah, but what
353 * does it mean in real life? This means that loop body below will
354 * be compiled to sequence of loads immediately followed by stores
355 * as compiler assumes the worst, something in A==B+1 style. As a
356 * result CPU pipeline is going to starve for incoming data. Secondly
357 * if A and B happen to share same cache line such code is going to
358 * cause severe cache trashing. Both factors have severe impact on
359 * performance of modern CPUs and this is the reason why this
360 * particular piece of code is #ifdefed away and replaced by more
361 * "friendly" version found in #else section below. This comment
362 * also applies to BN_copy function.
363 *
364 * <appro@fy.chalmers.se>
365 */
366 for (i=b->top&(~7); i>0; i-=8)
367 {
368 A[0]=B[0]; A[1]=B[1]; A[2]=B[2]; A[3]=B[3];
369 A[4]=B[4]; A[5]=B[5]; A[6]=B[6]; A[7]=B[7];
370 A+=8;
371 B+=8;
372 }
373 switch (b->top&7)
374 {
375 case 7:
376 A[6]=B[6];
377 case 6:
378 A[5]=B[5];
379 case 5:
380 A[4]=B[4];
381 case 4:
382 A[3]=B[3];
383 case 3:
384 A[2]=B[2];
385 case 2:
386 A[1]=B[1];
387 case 1:
388 A[0]=B[0];
389 case 0:
390 /* I need the 'case 0' entry for utrix cc.
391 * If the optimizer is turned on, it does the
392 * switch table by doing
393 * a=top&7
394 * a--;
395 * goto jump_table[a];
396 * If top is 0, this makes us jump to 0xffffffc
397 * which is rather bad :-(.
398 * eric 23-Apr-1998
399 */
400 ;
401 }
402#else
403 for (i=b->top>>2; i>0; i--,A+=4,B+=4)
404 {
405 /*
406 * The fact that the loop is unrolled
407 * 4-wise is a tribute to Intel. It's
408 * the one that doesn't have enough
409 * registers to accomodate more data.
410 * I'd unroll it 8-wise otherwise:-)
411 *
412 * <appro@fy.chalmers.se>
413 */
414 BN_ULONG a0,a1,a2,a3;
415 a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
416 A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
417 }
418 switch (b->top&3)
419 {
420 case 3: A[2]=B[2];
421 case 2: A[1]=B[1];
422 case 1: A[0]=B[0];
423 case 0: ; /* ultrix cc workaround, see above */
424 }
425#endif
426 Free(b->d);
427 }
428
429 b->d=a;
430 b->max=words;
431
432 /* Now need to zero any data between b->top and b->max */
433
434 A= &(b->d[b->top]);
435 for (i=(b->max - b->top)>>3; i>0; i--,A+=8)
436 {
437 A[0]=0; A[1]=0; A[2]=0; A[3]=0;
438 A[4]=0; A[5]=0; A[6]=0; A[7]=0;
439 }
440 for (i=(b->max - b->top)&7; i>0; i--,A++)
441 A[0]=0;
442#else
443 memset(A,0,sizeof(BN_ULONG)*(words+1));
444 memcpy(A,b->d,sizeof(b->d[0])*b->top);
445 b->d=a;
446 b->max=words;
447#endif
448
449/* memset(&(p[b->max]),0,((words+1)-b->max)*sizeof(BN_ULONG)); */
450/* { int i; for (i=b->max; i<words+1; i++) p[i]=i;} */
451
452 }
453 return(b);
454 }
455
456BIGNUM *BN_dup(const BIGNUM *a)
457 {
458 BIGNUM *r;
459
460 if (a == NULL) return NULL;
461
462 bn_check_top(a);
463
464 r=BN_new();
465 if (r == NULL) return(NULL);
466 return((BIGNUM *)BN_copy(r,a));
467 }
468
469BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
470 {
471 int i;
472 BN_ULONG *A;
473 const BN_ULONG *B;
474
475 bn_check_top(b);
476
477 if (a == b) return(a);
478 if (bn_wexpand(a,b->top) == NULL) return(NULL);
479
480#if 1
481 A=a->d;
482 B=b->d;
483 for (i=b->top>>2; i>0; i--,A+=4,B+=4)
484 {
485 BN_ULONG a0,a1,a2,a3;
486 a0=B[0]; a1=B[1]; a2=B[2]; a3=B[3];
487 A[0]=a0; A[1]=a1; A[2]=a2; A[3]=a3;
488 }
489 switch (b->top&3)
490 {
491 case 3: A[2]=B[2];
492 case 2: A[1]=B[1];
493 case 1: A[0]=B[0];
494 case 0: ; /* ultrix cc workaround, see comments in bn_expand2 */
495 }
496#else
497 memcpy(a->d,b->d,sizeof(b->d[0])*b->top);
498#endif
499
500/* memset(&(a->d[b->top]),0,sizeof(a->d[0])*(a->max-b->top));*/
501 a->top=b->top;
502 if ((a->top == 0) && (a->d != NULL))
503 a->d[0]=0;
504 a->neg=b->neg;
505 return(a);
506 }
507
508void BN_clear(BIGNUM *a)
509 {
510 if (a->d != NULL)
511 memset(a->d,0,a->max*sizeof(a->d[0]));
512 a->top=0;
513 a->neg=0;
514 }
515
516BN_ULONG BN_get_word(BIGNUM *a)
517 {
518 int i,n;
519 BN_ULONG ret=0;
520
521 n=BN_num_bytes(a);
522 if (n > sizeof(BN_ULONG))
523 return(BN_MASK2);
524 for (i=a->top-1; i>=0; i--)
525 {
526#ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
527 ret<<=BN_BITS4; /* stops the compiler complaining */
528 ret<<=BN_BITS4;
529#else
530 ret=0;
531#endif
532 ret|=a->d[i];
533 }
534 return(ret);
535 }
536
537int BN_set_word(BIGNUM *a, BN_ULONG w)
538 {
539 int i,n;
540 if (bn_expand(a,sizeof(BN_ULONG)*8) == NULL) return(0);
541
542 n=sizeof(BN_ULONG)/BN_BYTES;
543 a->neg=0;
544 a->top=0;
545 a->d[0]=(BN_ULONG)w&BN_MASK2;
546 if (a->d[0] != 0) a->top=1;
547 for (i=1; i<n; i++)
548 {
549 /* the following is done instead of
550 * w>>=BN_BITS2 so compilers don't complain
551 * on builds where sizeof(long) == BN_TYPES */
552#ifndef SIXTY_FOUR_BIT /* the data item > unsigned long */
553 w>>=BN_BITS4;
554 w>>=BN_BITS4;
555#else
556 w=0;
557#endif
558 a->d[i]=(BN_ULONG)w&BN_MASK2;
559 if (a->d[i] != 0) a->top=i+1;
560 }
561 return(1);
562 }
563
564/* ignore negative */
565BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
566 {
567 unsigned int i,m;
568 unsigned int n;
569 BN_ULONG l;
570
571 if (ret == NULL) ret=BN_new();
572 if (ret == NULL) return(NULL);
573 l=0;
574 n=len;
575 if (n == 0)
576 {
577 ret->top=0;
578 return(ret);
579 }
580 if (bn_expand(ret,(int)(n+2)*8) == NULL)
581 return(NULL);
582 i=((n-1)/BN_BYTES)+1;
583 m=((n-1)%(BN_BYTES));
584 ret->top=i;
585 while (n-- > 0)
586 {
587 l=(l<<8L)| *(s++);
588 if (m-- == 0)
589 {
590 ret->d[--i]=l;
591 l=0;
592 m=BN_BYTES-1;
593 }
594 }
595 /* need to call this due to clear byte at top if avoiding
596 * having the top bit set (-ve number) */
597 bn_fix_top(ret);
598 return(ret);
599 }
600
601/* ignore negative */
602int BN_bn2bin(const BIGNUM *a, unsigned char *to)
603 {
604 int n,i;
605 BN_ULONG l;
606
607 n=i=BN_num_bytes(a);
608 while (i-- > 0)
609 {
610 l=a->d[i/BN_BYTES];
611 *(to++)=(unsigned char)(l>>(8*(i%BN_BYTES)))&0xff;
612 }
613 return(n);
614 }
615
616int BN_ucmp(const BIGNUM *a, const BIGNUM *b)
617 {
618 int i;
619 BN_ULONG t1,t2,*ap,*bp;
620
621 bn_check_top(a);
622 bn_check_top(b);
623
624 i=a->top-b->top;
625 if (i != 0) return(i);
626 ap=a->d;
627 bp=b->d;
628 for (i=a->top-1; i>=0; i--)
629 {
630 t1= ap[i];
631 t2= bp[i];
632 if (t1 != t2)
633 return(t1 > t2?1:-1);
634 }
635 return(0);
636 }
637
638int BN_cmp(const BIGNUM *a, const BIGNUM *b)
639 {
640 int i;
641 int gt,lt;
642 BN_ULONG t1,t2;
643
644 if ((a == NULL) || (b == NULL))
645 {
646 if (a != NULL)
647 return(-1);
648 else if (b != NULL)
649 return(1);
650 else
651 return(0);
652 }
653
654 bn_check_top(a);
655 bn_check_top(b);
656
657 if (a->neg != b->neg)
658 {
659 if (a->neg)
660 return(-1);
661 else return(1);
662 }
663 if (a->neg == 0)
664 { gt=1; lt= -1; }
665 else { gt= -1; lt=1; }
666
667 if (a->top > b->top) return(gt);
668 if (a->top < b->top) return(lt);
669 for (i=a->top-1; i>=0; i--)
670 {
671 t1=a->d[i];
672 t2=b->d[i];
673 if (t1 > t2) return(gt);
674 if (t1 < t2) return(lt);
675 }
676 return(0);
677 }
678
679int BN_set_bit(BIGNUM *a, int n)
680 {
681 int i,j,k;
682
683 i=n/BN_BITS2;
684 j=n%BN_BITS2;
685 if (a->top <= i)
686 {
687 if (bn_wexpand(a,i+1) == NULL) return(0);
688 for(k=a->top; k<i+1; k++)
689 a->d[k]=0;
690 a->top=i+1;
691 }
692
693 a->d[i]|=(((BN_ULONG)1)<<j);
694 return(1);
695 }
696
697int BN_clear_bit(BIGNUM *a, int n)
698 {
699 int i,j;
700
701 i=n/BN_BITS2;
702 j=n%BN_BITS2;
703 if (a->top <= i) return(0);
704
705 a->d[i]&=(~(((BN_ULONG)1)<<j));
706 bn_fix_top(a);
707 return(1);
708 }
709
710int BN_is_bit_set(const BIGNUM *a, int n)
711 {
712 int i,j;
713
714 if (n < 0) return(0);
715 i=n/BN_BITS2;
716 j=n%BN_BITS2;
717 if (a->top <= i) return(0);
718 return((a->d[i]&(((BN_ULONG)1)<<j))?1:0);
719 }
720
721int BN_mask_bits(BIGNUM *a, int n)
722 {
723 int b,w;
724
725 w=n/BN_BITS2;
726 b=n%BN_BITS2;
727 if (w >= a->top) return(0);
728 if (b == 0)
729 a->top=w;
730 else
731 {
732 a->top=w+1;
733 a->d[w]&= ~(BN_MASK2<<b);
734 }
735 bn_fix_top(a);
736 return(1);
737 }
738
739int bn_cmp_words(BN_ULONG *a, BN_ULONG *b, int n)
740 {
741 int i;
742 BN_ULONG aa,bb;
743
744 aa=a[n-1];
745 bb=b[n-1];
746 if (aa != bb) return((aa > bb)?1:-1);
747 for (i=n-2; i>=0; i--)
748 {
749 aa=a[i];
750 bb=b[i];
751 if (aa != bb) return((aa > bb)?1:-1);
752 }
753 return(0);
754 }
755
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-12-24 20:19:01 +0000