| 1 | /****************************************************************
 | 
|---|
| 2 | 
 | 
|---|
| 3 | The author of this software is David M. Gay.
 | 
|---|
| 4 | 
 | 
|---|
| 5 | Copyright (C) 1998 by Lucent Technologies
 | 
|---|
| 6 | All Rights Reserved
 | 
|---|
| 7 | 
 | 
|---|
| 8 | Permission to use, copy, modify, and distribute this software and
 | 
|---|
| 9 | its documentation for any purpose and without fee is hereby
 | 
|---|
| 10 | granted, provided that the above copyright notice appear in all
 | 
|---|
| 11 | copies and that both that the copyright notice and this
 | 
|---|
| 12 | permission notice and warranty disclaimer appear in supporting
 | 
|---|
| 13 | documentation, and that the name of Lucent or any of its entities
 | 
|---|
| 14 | not be used in advertising or publicity pertaining to
 | 
|---|
| 15 | distribution of the software without specific, written prior
 | 
|---|
| 16 | permission.
 | 
|---|
| 17 | 
 | 
|---|
| 18 | LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 | 
|---|
| 19 | INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
 | 
|---|
| 20 | IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
 | 
|---|
| 21 | SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 | 
|---|
| 22 | WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER
 | 
|---|
| 23 | IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
 | 
|---|
| 24 | ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
 | 
|---|
| 25 | THIS SOFTWARE.
 | 
|---|
| 26 | 
 | 
|---|
| 27 | ****************************************************************/
 | 
|---|
| 28 | 
 | 
|---|
| 29 | /* Please send bug reports to
 | 
|---|
| 30 |         David M. Gay
 | 
|---|
| 31 |         Bell Laboratories, Room 2C-463
 | 
|---|
| 32 |         600 Mountain Avenue
 | 
|---|
| 33 |         Murray Hill, NJ 07974-0636
 | 
|---|
| 34 |         U.S.A.
 | 
|---|
| 35 |         dmg@bell-labs.com
 | 
|---|
| 36 |  */
 | 
|---|
| 37 | 
 | 
|---|
| 38 | #include "gdtoaimp.h"
 | 
|---|
| 39 | 
 | 
|---|
| 40 |  void
 | 
|---|
| 41 | #ifdef KR_headers
 | 
|---|
| 42 | rshift(b, k) Bigint *b; int k;
 | 
|---|
| 43 | #else
 | 
|---|
| 44 | rshift(Bigint *b, int k)
 | 
|---|
| 45 | #endif
 | 
|---|
| 46 | {
 | 
|---|
| 47 |         ULong *x, *x1, *xe, y;
 | 
|---|
| 48 |         int n;
 | 
|---|
| 49 | 
 | 
|---|
| 50 |         x = x1 = b->x;
 | 
|---|
| 51 |         n = k >> kshift;
 | 
|---|
| 52 |         if (n < b->wds) {
 | 
|---|
| 53 |                 xe = x + b->wds;
 | 
|---|
| 54 |                 x += n;
 | 
|---|
| 55 |                 if (k &= kmask) {
 | 
|---|
| 56 |                         n = ULbits - k;
 | 
|---|
| 57 |                         y = *x++ >> k;
 | 
|---|
| 58 |                         while(x < xe) {
 | 
|---|
| 59 |                                 *x1++ = (y | (*x << n)) & ALL_ON;
 | 
|---|
| 60 |                                 y = *x++ >> k;
 | 
|---|
| 61 |                                 }
 | 
|---|
| 62 |                         if ((*x1 = y) !=0)
 | 
|---|
| 63 |                                 x1++;
 | 
|---|
| 64 |                         }
 | 
|---|
| 65 |                 else
 | 
|---|
| 66 |                         while(x < xe)
 | 
|---|
| 67 |                                 *x1++ = *x++;
 | 
|---|
| 68 |                 }
 | 
|---|
| 69 |         if ((b->wds = x1 - b->x) == 0)
 | 
|---|
| 70 |                 b->x[0] = 0;
 | 
|---|
| 71 |         }
 | 
|---|
| 72 | 
 | 
|---|
| 73 |  int
 | 
|---|
| 74 | #ifdef KR_headers
 | 
|---|
| 75 | trailz(b) Bigint *b;
 | 
|---|
| 76 | #else
 | 
|---|
| 77 | trailz(Bigint *b)
 | 
|---|
| 78 | #endif
 | 
|---|
| 79 | {
 | 
|---|
| 80 |         ULong L, *x, *xe;
 | 
|---|
| 81 |         int n = 0;
 | 
|---|
| 82 | 
 | 
|---|
| 83 |         x = b->x;
 | 
|---|
| 84 |         xe = x + b->wds;
 | 
|---|
| 85 |         for(n = 0; x < xe && !*x; x++)
 | 
|---|
| 86 |                 n += ULbits;
 | 
|---|
| 87 |         if (x < xe) {
 | 
|---|
| 88 |                 L = *x;
 | 
|---|
| 89 |                 n += lo0bits(&L);
 | 
|---|
| 90 |                 }
 | 
|---|
| 91 |         return n;
 | 
|---|
| 92 |         }
 | 
|---|