crypto/ec/ecp_smpl.c:1652: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_lshift1_quick`.
Showing all 18 steps of the trace


crypto/ec/ecp_smpl.c:1643:10: Call
1641.   
1642.       BN_CTX_start(ctx);
1643.       t0 = BN_CTX_get(ctx);
                 ^
1644.       t1 = BN_CTX_get(ctx);
1645.       t2 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  231.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:366:15: Assignment
    364.       a->neg = 0;
    365.       a->d[0] = w;
    366.       a->top = (w ? 1 : 0);
                         ^
    367.       a->flags &= ~BN_FLG_FIXED_TOP;
    368.       bn_check_top(a);

crypto/bn/bn_lib.c:366:5: Assignment
    364.       a->neg = 0;
    365.       a->d[0] = w;
    366.       a->top = (w ? 1 : 0);
               ^
    367.       a->flags &= ~BN_FLG_FIXED_TOP;
    368.       bn_check_top(a);

crypto/ec/ecp_smpl.c:1652:13: Call
1650.   
1651.       if (t6 == NULL
1652.           || !BN_mod_lshift1_quick(t0, p->Y, group->field)
                    ^
1653.           || !group->meth->field_mul(group, t1, r->X, p->Z, ctx)
1654.           || !group->meth->field_mul(group, t2, r->Z, s->Z, ctx)

crypto/bn/bn_mod.c:242:1: Parameter `*r->d`
  240.    * m
  241.    */
  242. > int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  243.   {
  244.       if (!BN_lshift1(r, a))

crypto/bn/bn_mod.c:244:10: Call
  242.   int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)
  243.   {
  244.       if (!BN_lshift1(r, a))
                  ^
  245.           return 0;
  246.       bn_check_top(r);

crypto/bn/bn_shift.c:14:1: Parameter `*r->d`
    12.   #include "bn_lcl.h"
    13.   
    14. > int BN_lshift1(BIGNUM *r, const BIGNUM *a)
    15.   {
    16.       register BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:28:13: Call
    26.           r->top = a->top;
    27.       } else {
    28.           if (bn_wexpand(r, a->top + 1) == NULL)
                      ^
    29.               return 0;
    30.       }

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
      937.   }
      938.   
      939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      940.   {
      941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:941:37: Call
      939.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      940.   {
      941.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                 ^
      942.   }
      943.   

crypto/bn/bn_lib.c:245:1: Parameter `*b->d`
        243.    */
        244.   
        245. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        246.   {
        247.       if (words > b->dmax) {

crypto/bn/bn_lib.c:248:23: Call
        246.   {
        247.       if (words > b->dmax) {
        248.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        249.           if (!a)
        250.               return NULL;

crypto/bn/bn_lib.c:209:1: <Offset trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `b->top`
          207.   /* This is used by bn_expand2() */
          208.   /* The caller MUST check that words > b->dmax before calling this */
          209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          210.   {
          211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: <Length trace>
207.   /* This is used by bn_expand2() */
208.   /* The caller MUST check that words > b->dmax before calling this */
209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
210.   {
211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:209:1: Parameter `*b->d`
          207.   /* This is used by bn_expand2() */
          208.   /* The caller MUST check that words > b->dmax before calling this */
          209. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
          210.   {
          211.       BN_ULONG *a = NULL;

crypto/bn/bn_lib.c:232:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_lshift1_quick` 
          230.       assert(b->top <= words);
          231.       if (b->top > 0)
          232.           memcpy(a, b->d, sizeof(*a) * b->top);
                         ^
          233.   
          234.       return a;

static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
{
    BN_ULONG *a = NULL;
    if (words > (INT_MAX / (4 * BN_BITS2))) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);
        return NULL;
    }
    if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);
        return NULL;
    }
    if (BN_get_flags(b, BN_FLG_SECURE))
        a = OPENSSL_secure_zalloc(words * sizeof(*a));
    else
        a = OPENSSL_zalloc(words * sizeof(*a));
    if (a == NULL) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);
        return NULL;
    }
    assert(b->top <= words);
    if (b->top > 0)
        memcpy(a, b->d, sizeof(*a) * b->top);
    return a;
}
['int ec_GFp_simple_ladder_post(const EC_GROUP *group,\n                              EC_POINT *r, EC_POINT *s,\n                              EC_POINT *p, BN_CTX *ctx)\n{\n    int ret = 0;\n    BIGNUM *t0, *t1, *t2, *t3, *t4, *t5, *t6 = NULL;\n    if (BN_is_zero(r->Z))\n        return EC_POINT_set_to_infinity(group, r);\n    if (BN_is_zero(s->Z)) {\n        if (!group->meth->field_mul(group, r->X, p->X, p->Z, ctx)\n            || !group->meth->field_sqr(group, r->Z, p->Z, ctx)\n            || !group->meth->field_mul(group, r->Y, p->Y, r->Z, ctx)\n            || !BN_copy(r->Z, p->Z)\n            || !EC_POINT_invert(group, r, ctx))\n            return 0;\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    t0 = BN_CTX_get(ctx);\n    t1 = BN_CTX_get(ctx);\n    t2 = BN_CTX_get(ctx);\n    t3 = BN_CTX_get(ctx);\n    t4 = BN_CTX_get(ctx);\n    t5 = BN_CTX_get(ctx);\n    t6 = BN_CTX_get(ctx);\n    if (t6 == NULL\n        || !BN_mod_lshift1_quick(t0, p->Y, group->field)\n        || !group->meth->field_mul(group, t1, r->X, p->Z, ctx)\n        || !group->meth->field_mul(group, t2, r->Z, s->Z, ctx)\n        || !group->meth->field_mul(group, t2, t1, t2, ctx)\n        || !group->meth->field_mul(group, t3, t2, t0, ctx)\n        || !group->meth->field_mul(group, t2, r->Z, p->Z, ctx)\n        || !group->meth->field_sqr(group, t4, t2, ctx)\n        || !BN_mod_lshift1_quick(t5, group->b, group->field)\n        || !group->meth->field_mul(group, t4, t4, t5, ctx)\n        || !group->meth->field_mul(group, t6, t2, group->a, ctx)\n        || !group->meth->field_mul(group, t5, r->X, p->X, ctx)\n        || !BN_mod_add_quick(t5, t6, t5, group->field)\n        || !group->meth->field_mul(group, t6, r->Z, p->X, ctx)\n        || !BN_mod_add_quick(t2, t6, t1, group->field)\n        || !group->meth->field_mul(group, t5, t5, t2, ctx)\n        || !BN_mod_sub_quick(t6, t6, t1, group->field)\n        || !group->meth->field_sqr(group, t6, t6, ctx)\n        || !group->meth->field_mul(group, t6, t6, s->X, ctx)\n        || !BN_mod_add_quick(t4, t5, t4, group->field)\n        || !group->meth->field_mul(group, t4, t4, s->Z, ctx)\n        || !BN_mod_sub_quick(t4, t4, t6, group->field)\n        || !group->meth->field_sqr(group, t5, r->Z, ctx)\n        || !group->meth->field_mul(group, r->Z, p->Z, s->Z, ctx)\n        || !group->meth->field_mul(group, r->Z, t5, r->Z, ctx)\n        || !group->meth->field_mul(group, r->Z, r->Z, t0, ctx)\n        || !group->meth->field_mul(group, r->X, t3, r->Z, ctx)\n        || !group->meth->field_sqr(group, t3, r->Z, ctx)\n        || !group->meth->field_mul(group, r->Y, t4, t3, ctx))\n        goto err;\n    ret = 1;\n err:\n    BN_CTX_end(ctx);\n    return ret;\n}', 'BIGNUM *BN_CTX_get(BN_CTX *ctx)\n{\n    BIGNUM *ret;\n    CTXDBG_ENTRY("BN_CTX_get", ctx);\n    if (ctx->err_stack || ctx->too_many)\n        return NULL;\n    if ((ret = BN_POOL_get(&ctx->pool, ctx->flags)) == NULL) {\n        ctx->too_many = 1;\n        BNerr(BN_F_BN_CTX_GET, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n        return NULL;\n    }\n    BN_zero(ret);\n    ret->flags &= (~BN_FLG_CONSTTIME);\n    ctx->used++;\n    CTXDBG_RET(ctx, ret);\n    return ret;\n}', 'int BN_set_word(BIGNUM *a, BN_ULONG w)\n{\n    bn_check_top(a);\n    if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)\n        return 0;\n    a->neg = 0;\n    a->d[0] = w;\n    a->top = (w ? 1 : 0);\n    a->flags &= ~BN_FLG_FIXED_TOP;\n    bn_check_top(a);\n    return 1;\n}', 'int BN_mod_lshift1_quick(BIGNUM *r, const BIGNUM *a, const BIGNUM *m)\n{\n    if (!BN_lshift1(r, a))\n        return 0;\n    bn_check_top(r);\n    if (BN_cmp(r, m) >= 0)\n        return BN_sub(r, r, m);\n    return 1;\n}', 'int BN_lshift1(BIGNUM *r, const BIGNUM *a)\n{\n    register BN_ULONG *ap, *rp, t, c;\n    int i;\n    bn_check_top(r);\n    bn_check_top(a);\n    if (r != a) {\n        r->neg = a->neg;\n        if (bn_wexpand(r, a->top + 1) == NULL)\n            return 0;\n        r->top = a->top;\n    } else {\n        if (bn_wexpand(r, a->top + 1) == NULL)\n            return 0;\n    }\n    ap = a->d;\n    rp = r->d;\n    c = 0;\n    for (i = 0; i < a->top; i++) {\n        t = *(ap++);\n        *(rp++) = ((t << 1) | c) & BN_MASK2;\n        c = (t & BN_TBIT) ? 1 : 0;\n    }\n    if (c) {\n        *rp = 1;\n        r->top++;\n    }\n    bn_check_top(r);\n    return 1;\n}', 'BIGNUM *bn_wexpand(BIGNUM *a, int words)\n{\n    return (words <= a->dmax) ? a : bn_expand2(a, words);\n}', 'BIGNUM *bn_expand2(BIGNUM *b, int words)\n{\n    if (words > b->dmax) {\n        BN_ULONG *a = bn_expand_internal(b, words);\n        if (!a)\n            return NULL;\n        if (b->d) {\n            OPENSSL_cleanse(b->d, b->dmax * sizeof(b->d[0]));\n            bn_free_d(b);\n        }\n        b->d = a;\n        b->dmax = words;\n    }\n    return b;\n}', 'static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)\n{\n    BN_ULONG *a = NULL;\n    if (words > (INT_MAX / (4 * BN_BITS2))) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_BIGNUM_TOO_LONG);\n        return NULL;\n    }\n    if (BN_get_flags(b, BN_FLG_STATIC_DATA)) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, BN_R_EXPAND_ON_STATIC_BIGNUM_DATA);\n        return NULL;\n    }\n    if (BN_get_flags(b, BN_FLG_SECURE))\n        a = OPENSSL_secure_zalloc(words * sizeof(*a));\n    else\n        a = OPENSSL_zalloc(words * sizeof(*a));\n    if (a == NULL) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);\n        return NULL;\n    }\n    assert(b->top <= words);\n    if (b->top > 0)\n        memcpy(a, b->d, sizeof(*a) * b->top);\n    return a;\n}']