Mercurial > dropbear

comparison libtommath/bn_mp_2expt.c @ 297:79bf1023cf11 agent-client

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
propagate from branch 'au.asn.ucc.matt.dropbear' (head 0501e6f661b5415eb76f3b312d183c3adfbfb712) to branch 'au.asn.ucc.matt.dropbear.cli-agent' (head 01038174ec27245b51bd43a66c01ad930880f67b)
author Matt Johnston <matt@ucc.asn.au>
date Tue, 21 Mar 2006 16:20:59 +0000
parents eed26cff980b
children 5ff8218bcee9
comparison
equal deleted inserted replaced
225:ca7e76d981d9 297:79bf1023cf11
1 #include <tommath.h>
2 #ifdef BN_MP_2EXPT_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
4 *
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
7 *
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
11 *
12 * The library is free for all purposes without any express
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://math.libtomcrypt.org
16 */
17
18 /* computes a = 2**b
19 *
20 * Simple algorithm which zeroes the int, grows it then just sets one bit
21 * as required.
22 */
23 int
24 mp_2expt (mp_int * a, int b)
25 {
26 int res;
27
28 /* zero a as per default */
29 mp_zero (a);
30
31 /* grow a to accomodate the single bit */
32 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) {
33 return res;
34 }
35
36 /* set the used count of where the bit will go */
37 a->used = b / DIGIT_BIT + 1;
38
39 /* put the single bit in its place */
40 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
41
42 return MP_OKAY;
43 }
44 #endif