| 
									
										
										
										
											2018-05-02 21:43:17 +02:00
										 |  |  | #include "tommath_private.h"
 | 
					
						
							| 
									
										
										
										
											2004-10-29 22:07:18 +00:00
										 |  |  | #ifdef BN_MP_LSHD_C
 | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | /* LibTomMath, multiple-precision integer library -- Tom St Denis
 | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2003-08-05 01:24:44 +00:00
										 |  |  |  * LibTomMath is a library that provides multiple-precision | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  |  * integer arithmetic as well as number theoretic functionality. | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2003-08-05 01:24:44 +00:00
										 |  |  |  * The library was designed directly after the MPI library by | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  |  * Michael Fromberger but has been written from scratch with | 
					
						
							|  |  |  |  * additional optimizations in place. | 
					
						
							|  |  |  |  * | 
					
						
							| 
									
										
										
										
											2018-12-29 17:56:20 +01:00
										 |  |  |  * SPDX-License-Identifier: Unlicense | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  |  */ | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | /* shift left a certain amount of digits */ | 
					
						
							| 
									
										
										
										
											2017-08-30 19:07:12 +02:00
										 |  |  | int mp_lshd(mp_int *a, int b) | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | { | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |    int     x, res; | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |    /* if its less than zero return */ | 
					
						
							|  |  |  |    if (b <= 0) { | 
					
						
							|  |  |  |       return MP_OKAY; | 
					
						
							|  |  |  |    } | 
					
						
							| 
									
										
										
										
											2017-08-29 23:53:02 +02:00
										 |  |  |    /* no need to shift 0 around */ | 
					
						
							|  |  |  |    if (mp_iszero(a) == MP_YES) { | 
					
						
							|  |  |  |       return MP_OKAY; | 
					
						
							|  |  |  |    } | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |    /* grow to fit the new digits */ | 
					
						
							|  |  |  |    if (a->alloc < (a->used + b)) { | 
					
						
							|  |  |  |       if ((res = mp_grow(a, a->used + b)) != MP_OKAY) { | 
					
						
							|  |  |  |          return res; | 
					
						
							|  |  |  |       } | 
					
						
							|  |  |  |    } | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |    { | 
					
						
							|  |  |  |       mp_digit *top, *bottom; | 
					
						
							| 
									
										
										
										
											2003-03-13 02:11:11 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |       /* increment the used by the shift amount then copy upwards */ | 
					
						
							|  |  |  |       a->used += b; | 
					
						
							| 
									
										
										
										
											2003-03-22 15:10:20 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |       /* top */ | 
					
						
							|  |  |  |       top = a->dp + a->used - 1; | 
					
						
							| 
									
										
										
										
											2003-03-22 15:10:20 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |       /* base */ | 
					
						
							|  |  |  |       bottom = (a->dp + a->used - 1) - b; | 
					
						
							| 
									
										
										
										
											2003-03-13 02:11:11 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |       /* much like mp_rshd this is implemented using a sliding window
 | 
					
						
							|  |  |  |        * except the window goes the otherway around.  Copying from | 
					
						
							|  |  |  |        * the bottom to the top.  see bn_mp_rshd.c for more info. | 
					
						
							|  |  |  |        */ | 
					
						
							|  |  |  |       for (x = a->used - 1; x >= b; x--) { | 
					
						
							|  |  |  |          *top-- = *bottom--; | 
					
						
							|  |  |  |       } | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-30 19:11:35 +02:00
										 |  |  |       /* zero the lower digits */ | 
					
						
							|  |  |  |       top = a->dp; | 
					
						
							|  |  |  |       for (x = 0; x < b; x++) { | 
					
						
							|  |  |  |          *top++ = 0; | 
					
						
							|  |  |  |       } | 
					
						
							|  |  |  |    } | 
					
						
							|  |  |  |    return MP_OKAY; | 
					
						
							| 
									
										
										
										
											2003-02-28 16:08:34 +00:00
										 |  |  | } | 
					
						
							| 
									
										
										
										
											2004-10-29 22:07:18 +00:00
										 |  |  | #endif
 | 
					
						
							| 
									
										
										
										
											2005-08-01 16:37:28 +00:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-08-28 16:27:26 +02:00
										 |  |  | /* ref:         $Format:%D$ */ | 
					
						
							|  |  |  | /* git commit:  $Format:%H$ */ | 
					
						
							|  |  |  | /* commit time: $Format:%ai$ */ |