File Manager

003 File Manager

Current Path: /usr/src/crypto/openssl/crypto/bn

usr / src / crypto / openssl / crypto / bn /

📁 ..
📄 README.pod(9.35 KB)
📁 asm
📄 bn_add.c(3.34 KB)
📄 bn_asm.c(26.9 KB)
📄 bn_blind.c(7.94 KB)
📄 bn_const.c(26.29 KB)
📄 bn_ctx.c(9.57 KB)
📄 bn_depr.c(1.89 KB)
📄 bn_dh.c(28.75 KB)
📄 bn_div.c(13.66 KB)
📄 bn_err.c(5.7 KB)
📄 bn_exp.c(44.31 KB)
📄 bn_exp2.c(5.8 KB)
📄 bn_gcd.c(18.56 KB)
📄 bn_gf2m.c(28.99 KB)
📄 bn_intern.c(5.47 KB)
📄 bn_kron.c(3.22 KB)
📄 bn_lib.c(22.66 KB)
📄 bn_local.h(24.59 KB)
📄 bn_mod.c(7.73 KB)
📄 bn_mont.c(12.13 KB)
📄 bn_mpi.c(1.89 KB)
📄 bn_mul.c(18.69 KB)
📄 bn_nist.c(37.28 KB)
📄 bn_prime.c(10.85 KB)
📄 bn_prime.h(15.49 KB)
📄 bn_prime.pl(1.38 KB)
📄 bn_print.c(7.77 KB)
📄 bn_rand.c(7.31 KB)
📄 bn_recp.c(4.51 KB)
📄 bn_shift.c(4.71 KB)
📄 bn_sqr.c(5.37 KB)
📄 bn_sqrt.c(9.28 KB)
📄 bn_srp.c(21.37 KB)
📄 bn_word.c(4.4 KB)
📄 bn_x931p.c(5.73 KB)
📄 build.info(2.6 KB)
📄 rsaz_exp.c(10.76 KB)
📄 rsaz_exp.h(1.38 KB)

Editing: bn_add.c

/*
 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the OpenSSL license (the "License").  You may not use
 * this file except in compliance with the License.  You can obtain a copy
 * in the file LICENSE in the source distribution or at
 * https://www.openssl.org/source/license.html
 */

#include "internal/cryptlib.h"
#include "bn_local.h"

/* signed add of b to a. */
int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
{
    int ret, r_neg, cmp_res;

bn_check_top(a);
    bn_check_top(b);

if (a->neg == b->neg) {
        r_neg = a->neg;
        ret = BN_uadd(r, a, b);
    } else {
        cmp_res = BN_ucmp(a, b);
        if (cmp_res > 0) {
            r_neg = a->neg;
            ret = BN_usub(r, a, b);
        } else if (cmp_res < 0) {
            r_neg = b->neg;
            ret = BN_usub(r, b, a);
        } else {
            r_neg = 0;
            BN_zero(r);
            ret = 1;
        }
    }

r->neg = r_neg;
    bn_check_top(r);
    return ret;
}

/* signed sub of b from a. */
int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
{
    int ret, r_neg, cmp_res;

bn_check_top(a);
    bn_check_top(b);

if (a->neg != b->neg) {
        r_neg = a->neg;
        ret = BN_uadd(r, a, b);
    } else {
        cmp_res = BN_ucmp(a, b);
        if (cmp_res > 0) {
            r_neg = a->neg;
            ret = BN_usub(r, a, b);
        } else if (cmp_res < 0) {
            r_neg = !b->neg;
            ret = BN_usub(r, b, a);
        } else {
            r_neg = 0;
            BN_zero(r);
            ret = 1;
        }
    }

r->neg = r_neg;
    bn_check_top(r);
    return ret;
}

/* unsigned add of b to a, r can be equal to a or b. */
int BN_uadd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
{
    int max, min, dif;
    const BN_ULONG *ap, *bp;
    BN_ULONG *rp, carry, t1, t2;

bn_check_top(a);
    bn_check_top(b);

if (a->top < b->top) {
        const BIGNUM *tmp;

tmp = a;
        a = b;
        b = tmp;
    }
    max = a->top;
    min = b->top;
    dif = max - min;

if (bn_wexpand(r, max + 1) == NULL)
        return 0;

r->top = max;

ap = a->d;
    bp = b->d;
    rp = r->d;

carry = bn_add_words(rp, ap, bp, min);
    rp += min;
    ap += min;

while (dif) {
        dif--;
        t1 = *(ap++);
        t2 = (t1 + carry) & BN_MASK2;
        *(rp++) = t2;
        carry &= (t2 == 0);
    }
    *rp = carry;
    r->top += carry;

r->neg = 0;
    bn_check_top(r);
    return 1;
}

/* unsigned subtraction of b from a, a must be larger than b. */
int BN_usub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
{
    int max, min, dif;
    BN_ULONG t1, t2, borrow, *rp;
    const BN_ULONG *ap, *bp;

bn_check_top(a);
    bn_check_top(b);

max = a->top;
    min = b->top;
    dif = max - min;

if (dif < 0) {              /* hmm... should not be happening */
        BNerr(BN_F_BN_USUB, BN_R_ARG2_LT_ARG3);
        return 0;
    }

if (bn_wexpand(r, max) == NULL)
        return 0;

ap = a->d;
    bp = b->d;
    rp = r->d;

borrow = bn_sub_words(rp, ap, bp, min);
    ap += min;
    rp += min;

while (dif) {
        dif--;
        t1 = *(ap++);
        t2 = (t1 - borrow) & BN_MASK2;
        *(rp++) = t2;
        borrow &= (t1 == 0);
    }

while (max && *--rp == 0)
        max--;

r->top = max;
    r->neg = 0;
    bn_pollute(r);

return 1;
}

003 File Manager

Editing: bn_add.c

Upload File

Create Folder