xref: /onnv-gate/usr/src/common/openssl/crypto/bn/bn_shift.c (revision 2139:6243c3338933)
10Sstevel@tonic-gate /* crypto/bn/bn_shift.c */
20Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
30Sstevel@tonic-gate  * All rights reserved.
40Sstevel@tonic-gate  *
50Sstevel@tonic-gate  * This package is an SSL implementation written
60Sstevel@tonic-gate  * by Eric Young (eay@cryptsoft.com).
70Sstevel@tonic-gate  * The implementation was written so as to conform with Netscapes SSL.
80Sstevel@tonic-gate  *
90Sstevel@tonic-gate  * This library is free for commercial and non-commercial use as long as
100Sstevel@tonic-gate  * the following conditions are aheared to.  The following conditions
110Sstevel@tonic-gate  * apply to all code found in this distribution, be it the RC4, RSA,
120Sstevel@tonic-gate  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
130Sstevel@tonic-gate  * included with this distribution is covered by the same copyright terms
140Sstevel@tonic-gate  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
150Sstevel@tonic-gate  *
160Sstevel@tonic-gate  * Copyright remains Eric Young's, and as such any Copyright notices in
170Sstevel@tonic-gate  * the code are not to be removed.
180Sstevel@tonic-gate  * If this package is used in a product, Eric Young should be given attribution
190Sstevel@tonic-gate  * as the author of the parts of the library used.
200Sstevel@tonic-gate  * This can be in the form of a textual message at program startup or
210Sstevel@tonic-gate  * in documentation (online or textual) provided with the package.
220Sstevel@tonic-gate  *
230Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
240Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
250Sstevel@tonic-gate  * are met:
260Sstevel@tonic-gate  * 1. Redistributions of source code must retain the copyright
270Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
280Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
290Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
300Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
310Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
320Sstevel@tonic-gate  *    must display the following acknowledgement:
330Sstevel@tonic-gate  *    "This product includes cryptographic software written by
340Sstevel@tonic-gate  *     Eric Young (eay@cryptsoft.com)"
350Sstevel@tonic-gate  *    The word 'cryptographic' can be left out if the rouines from the library
360Sstevel@tonic-gate  *    being used are not cryptographic related :-).
370Sstevel@tonic-gate  * 4. If you include any Windows specific code (or a derivative thereof) from
380Sstevel@tonic-gate  *    the apps directory (application code) you must include an acknowledgement:
390Sstevel@tonic-gate  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
400Sstevel@tonic-gate  *
410Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
420Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
430Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
440Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
450Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
460Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
470Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
480Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
490Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
500Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
510Sstevel@tonic-gate  * SUCH DAMAGE.
520Sstevel@tonic-gate  *
530Sstevel@tonic-gate  * The licence and distribution terms for any publically available version or
540Sstevel@tonic-gate  * derivative of this code cannot be changed.  i.e. this code cannot simply be
550Sstevel@tonic-gate  * copied and put under another distribution licence
560Sstevel@tonic-gate  * [including the GNU Public Licence.]
570Sstevel@tonic-gate  */
580Sstevel@tonic-gate 
590Sstevel@tonic-gate #include <stdio.h>
600Sstevel@tonic-gate #include "cryptlib.h"
610Sstevel@tonic-gate #include "bn_lcl.h"
620Sstevel@tonic-gate 
BN_lshift1(BIGNUM * r,const BIGNUM * a)630Sstevel@tonic-gate int BN_lshift1(BIGNUM *r, const BIGNUM *a)
640Sstevel@tonic-gate 	{
650Sstevel@tonic-gate 	register BN_ULONG *ap,*rp,t,c;
660Sstevel@tonic-gate 	int i;
670Sstevel@tonic-gate 
68*2139Sjp161948 	bn_check_top(r);
69*2139Sjp161948 	bn_check_top(a);
70*2139Sjp161948 
710Sstevel@tonic-gate 	if (r != a)
720Sstevel@tonic-gate 		{
730Sstevel@tonic-gate 		r->neg=a->neg;
740Sstevel@tonic-gate 		if (bn_wexpand(r,a->top+1) == NULL) return(0);
750Sstevel@tonic-gate 		r->top=a->top;
760Sstevel@tonic-gate 		}
770Sstevel@tonic-gate 	else
780Sstevel@tonic-gate 		{
790Sstevel@tonic-gate 		if (bn_wexpand(r,a->top+1) == NULL) return(0);
800Sstevel@tonic-gate 		}
810Sstevel@tonic-gate 	ap=a->d;
820Sstevel@tonic-gate 	rp=r->d;
830Sstevel@tonic-gate 	c=0;
840Sstevel@tonic-gate 	for (i=0; i<a->top; i++)
850Sstevel@tonic-gate 		{
860Sstevel@tonic-gate 		t= *(ap++);
870Sstevel@tonic-gate 		*(rp++)=((t<<1)|c)&BN_MASK2;
880Sstevel@tonic-gate 		c=(t & BN_TBIT)?1:0;
890Sstevel@tonic-gate 		}
900Sstevel@tonic-gate 	if (c)
910Sstevel@tonic-gate 		{
920Sstevel@tonic-gate 		*rp=1;
930Sstevel@tonic-gate 		r->top++;
940Sstevel@tonic-gate 		}
95*2139Sjp161948 	bn_check_top(r);
960Sstevel@tonic-gate 	return(1);
970Sstevel@tonic-gate 	}
980Sstevel@tonic-gate 
BN_rshift1(BIGNUM * r,const BIGNUM * a)990Sstevel@tonic-gate int BN_rshift1(BIGNUM *r, const BIGNUM *a)
1000Sstevel@tonic-gate 	{
1010Sstevel@tonic-gate 	BN_ULONG *ap,*rp,t,c;
1020Sstevel@tonic-gate 	int i;
1030Sstevel@tonic-gate 
104*2139Sjp161948 	bn_check_top(r);
105*2139Sjp161948 	bn_check_top(a);
106*2139Sjp161948 
1070Sstevel@tonic-gate 	if (BN_is_zero(a))
1080Sstevel@tonic-gate 		{
1090Sstevel@tonic-gate 		BN_zero(r);
1100Sstevel@tonic-gate 		return(1);
1110Sstevel@tonic-gate 		}
1120Sstevel@tonic-gate 	if (a != r)
1130Sstevel@tonic-gate 		{
1140Sstevel@tonic-gate 		if (bn_wexpand(r,a->top) == NULL) return(0);
1150Sstevel@tonic-gate 		r->top=a->top;
1160Sstevel@tonic-gate 		r->neg=a->neg;
1170Sstevel@tonic-gate 		}
1180Sstevel@tonic-gate 	ap=a->d;
1190Sstevel@tonic-gate 	rp=r->d;
1200Sstevel@tonic-gate 	c=0;
1210Sstevel@tonic-gate 	for (i=a->top-1; i>=0; i--)
1220Sstevel@tonic-gate 		{
1230Sstevel@tonic-gate 		t=ap[i];
1240Sstevel@tonic-gate 		rp[i]=((t>>1)&BN_MASK2)|c;
1250Sstevel@tonic-gate 		c=(t&1)?BN_TBIT:0;
1260Sstevel@tonic-gate 		}
127*2139Sjp161948 	bn_correct_top(r);
128*2139Sjp161948 	bn_check_top(r);
1290Sstevel@tonic-gate 	return(1);
1300Sstevel@tonic-gate 	}
1310Sstevel@tonic-gate 
BN_lshift(BIGNUM * r,const BIGNUM * a,int n)1320Sstevel@tonic-gate int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
1330Sstevel@tonic-gate 	{
1340Sstevel@tonic-gate 	int i,nw,lb,rb;
1350Sstevel@tonic-gate 	BN_ULONG *t,*f;
1360Sstevel@tonic-gate 	BN_ULONG l;
1370Sstevel@tonic-gate 
138*2139Sjp161948 	bn_check_top(r);
139*2139Sjp161948 	bn_check_top(a);
140*2139Sjp161948 
1410Sstevel@tonic-gate 	r->neg=a->neg;
1420Sstevel@tonic-gate 	nw=n/BN_BITS2;
1430Sstevel@tonic-gate 	if (bn_wexpand(r,a->top+nw+1) == NULL) return(0);
1440Sstevel@tonic-gate 	lb=n%BN_BITS2;
1450Sstevel@tonic-gate 	rb=BN_BITS2-lb;
1460Sstevel@tonic-gate 	f=a->d;
1470Sstevel@tonic-gate 	t=r->d;
1480Sstevel@tonic-gate 	t[a->top+nw]=0;
1490Sstevel@tonic-gate 	if (lb == 0)
1500Sstevel@tonic-gate 		for (i=a->top-1; i>=0; i--)
1510Sstevel@tonic-gate 			t[nw+i]=f[i];
1520Sstevel@tonic-gate 	else
1530Sstevel@tonic-gate 		for (i=a->top-1; i>=0; i--)
1540Sstevel@tonic-gate 			{
1550Sstevel@tonic-gate 			l=f[i];
1560Sstevel@tonic-gate 			t[nw+i+1]|=(l>>rb)&BN_MASK2;
1570Sstevel@tonic-gate 			t[nw+i]=(l<<lb)&BN_MASK2;
1580Sstevel@tonic-gate 			}
1590Sstevel@tonic-gate 	memset(t,0,nw*sizeof(t[0]));
1600Sstevel@tonic-gate /*	for (i=0; i<nw; i++)
1610Sstevel@tonic-gate 		t[i]=0;*/
1620Sstevel@tonic-gate 	r->top=a->top+nw+1;
163*2139Sjp161948 	bn_correct_top(r);
164*2139Sjp161948 	bn_check_top(r);
1650Sstevel@tonic-gate 	return(1);
1660Sstevel@tonic-gate 	}
1670Sstevel@tonic-gate 
BN_rshift(BIGNUM * r,const BIGNUM * a,int n)1680Sstevel@tonic-gate int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
1690Sstevel@tonic-gate 	{
1700Sstevel@tonic-gate 	int i,j,nw,lb,rb;
1710Sstevel@tonic-gate 	BN_ULONG *t,*f;
1720Sstevel@tonic-gate 	BN_ULONG l,tmp;
1730Sstevel@tonic-gate 
174*2139Sjp161948 	bn_check_top(r);
175*2139Sjp161948 	bn_check_top(a);
176*2139Sjp161948 
1770Sstevel@tonic-gate 	nw=n/BN_BITS2;
1780Sstevel@tonic-gate 	rb=n%BN_BITS2;
1790Sstevel@tonic-gate 	lb=BN_BITS2-rb;
1800Sstevel@tonic-gate 	if (nw > a->top || a->top == 0)
1810Sstevel@tonic-gate 		{
1820Sstevel@tonic-gate 		BN_zero(r);
1830Sstevel@tonic-gate 		return(1);
1840Sstevel@tonic-gate 		}
1850Sstevel@tonic-gate 	if (r != a)
1860Sstevel@tonic-gate 		{
1870Sstevel@tonic-gate 		r->neg=a->neg;
1880Sstevel@tonic-gate 		if (bn_wexpand(r,a->top-nw+1) == NULL) return(0);
1890Sstevel@tonic-gate 		}
1900Sstevel@tonic-gate 	else
1910Sstevel@tonic-gate 		{
1920Sstevel@tonic-gate 		if (n == 0)
1930Sstevel@tonic-gate 			return 1; /* or the copying loop will go berserk */
1940Sstevel@tonic-gate 		}
1950Sstevel@tonic-gate 
1960Sstevel@tonic-gate 	f= &(a->d[nw]);
1970Sstevel@tonic-gate 	t=r->d;
1980Sstevel@tonic-gate 	j=a->top-nw;
1990Sstevel@tonic-gate 	r->top=j;
2000Sstevel@tonic-gate 
2010Sstevel@tonic-gate 	if (rb == 0)
2020Sstevel@tonic-gate 		{
203*2139Sjp161948 		for (i=j; i != 0; i--)
2040Sstevel@tonic-gate 			*(t++)= *(f++);
2050Sstevel@tonic-gate 		}
2060Sstevel@tonic-gate 	else
2070Sstevel@tonic-gate 		{
2080Sstevel@tonic-gate 		l= *(f++);
209*2139Sjp161948 		for (i=j-1; i != 0; i--)
2100Sstevel@tonic-gate 			{
2110Sstevel@tonic-gate 			tmp =(l>>rb)&BN_MASK2;
2120Sstevel@tonic-gate 			l= *(f++);
2130Sstevel@tonic-gate 			*(t++) =(tmp|(l<<lb))&BN_MASK2;
2140Sstevel@tonic-gate 			}
2150Sstevel@tonic-gate 		*(t++) =(l>>rb)&BN_MASK2;
2160Sstevel@tonic-gate 		}
217*2139Sjp161948 	bn_correct_top(r);
218*2139Sjp161948 	bn_check_top(r);
2190Sstevel@tonic-gate 	return(1);
2200Sstevel@tonic-gate 	}
221