summaryrefslogtreecommitdiffstats
path: root/pbn_mulus_add.c
blob: 23ec240221625f512642f179608c835685d23677 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/* ----------------------------------------------------------------------- *
 *
 *   Copyright 2007 H. Peter Anvin - All Rights Reserved
 *
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU Lesser General Public License as
 *   published by the Free Software Foundation, Inc.,
 *   59 Temple Place Ste 330, Boston MA 02111-1307, USA; version 2.1,
 *   incorporated herein by reference.
 *
 * ----------------------------------------------------------------------- */

/*
 * pbn_mulus_add.c
 *
 * Multiply a PBN with a single limb unsigned number, and add a single
 * limb unsigned number.
 */

#include "pbnint.h"

struct pbn *pbn_mulus_add(struct pbn *s1, pbn_limb_t s2, pbn_limb_t c)
{
    size_t i, len;
    struct pbn *d;
    pbn_limb_t *s1p, *dp;
    pbn_2limb_t t;

    if (unlikely(s1->bits == 0)) {
        pbn_free(s1);
	return pbn_uint(c);
    }

    len = (s1->bits+PBN_LIMB_BITS-1) >> PBN_LIMB_SHIFT;

    d = pbn_new(len+1);
    d->minus = s1->minus;

    s1p = s1->num;
    dp  = d->num;
    for (i = 0; i < len; i++) {
	t = (pbn_2limb_t)*s1p++ * s2 + c;
        *dp++ = (pbn_limb_t)t;
        c = t >> PBN_LIMB_BITS;
    }
    *dp = c;

    pbn_free(s1);

    return pbn_adjust_bits(d);
}