test/bntest.c:1269: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `BN_sqr`.
Showing all 13 steps of the trace


test/bntest.c:1269:10: Call
1267.   
1268.       BN_zero(zero);
1269.       if (!TEST_true(BN_sqr(ret, a, ctx))
                 ^
1270.               || !equalBN("A^2", square, ret)
1271.               || !TEST_true(BN_mul(ret, a, a, ctx))

crypto/bn/bn_sqr.c:17:1: Parameter `ctx->stack.depth`
  15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
  16.    */
  17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
  18.   {
  19.       int ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
  17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
  18.   {
  19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                      ^
  20.   
  21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:42:5: Call
    40.       }
    41.   
    42.       BN_CTX_start(ctx);
              ^
    43.       rr = (a != r) ? r : BN_CTX_get(ctx);
    44.       tmp = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:171:1: Parameter `*ctx->stack.indexes`
      169.   }
      170.   
      171. > void BN_CTX_start(BN_CTX *ctx)
      172.   {
      173.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_sqr.c:104:5: Call
    102.       bn_check_top(rr);
    103.       bn_check_top(tmp);
    104.       BN_CTX_end(ctx);
               ^
    105.       return ret;
    106.   }

crypto/bn/bn_ctx.c:185:1: Parameter `*ctx->stack.indexes`
      183.   }
      184.   
      185. > void BN_CTX_end(BN_CTX *ctx)
      186.   {
      187.       CTXDBG("ENTER BN_CTX_end()", ctx);

crypto/bn/bn_ctx.c:191:27: Call
      189.           ctx->err_stack--;
      190.       else {
      191.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      192.           /* Does this stack frame have anything to release? */
      193.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:266:1: <Offset trace>
264.   }
265.   
266. > static unsigned int BN_STACK_pop(BN_STACK *st)
267.   {
268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:266:1: Parameter `st->depth`
        264.   }
        265.   
        266. > static unsigned int BN_STACK_pop(BN_STACK *st)
        267.   {
        268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:266:1: <Length trace>
264.   }
265.   
266. > static unsigned int BN_STACK_pop(BN_STACK *st)
267.   {
268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:266:1: Parameter `*st->indexes`
        264.   }
        265.   
        266. > static unsigned int BN_STACK_pop(BN_STACK *st)
        267.   {
        268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:268:12: Array access: Offset: [-1, +oo] Size: [1, +oo] by call to `BN_sqr` 
        266.   static unsigned int BN_STACK_pop(BN_STACK *st)
        267.   {
        268.       return st->indexes[--(st->depth)];
                          ^
        269.   }
        270.   

static unsigned int BN_STACK_pop(BN_STACK *st)
{
    return st->indexes[--(st->depth)];
}
['static int file_square(STANZA *s)\n{\n    BIGNUM *a = NULL, *square = NULL, *zero = NULL, *ret = NULL;\n    BIGNUM *remainder = NULL, *tmp = NULL;\n    int st = 0;\n    if (!TEST_ptr(a = getBN(s, "A"))\n            || !TEST_ptr(square = getBN(s, "Square"))\n            || !TEST_ptr(zero = BN_new())\n            || !TEST_ptr(ret = BN_new())\n            || !TEST_ptr(remainder = BN_new()))\n        goto err;\n    BN_zero(zero);\n    if (!TEST_true(BN_sqr(ret, a, ctx))\n            || !equalBN("A^2", square, ret)\n            || !TEST_true(BN_mul(ret, a, a, ctx))\n            || !equalBN("A * A", square, ret)\n            || !TEST_true(BN_div(ret, remainder, square, a, ctx))\n            || !equalBN("Square / A", a, ret)\n            || !equalBN("Square % A", zero, remainder))\n        goto err;\n#if HAVE_BN_SQRT\n    BN_set_negative(a, 0);\n    if (!TEST_true(BN_sqrt(ret, square, ctx))\n            || !equalBN("sqrt(Square)", a, ret))\n        goto err;\n    if (!TEST_BN_eq_zero(square)) {\n        if (!TEST_ptr(tmp = BN_new())\n                || !TEST_true(BN_copy(tmp, square)))\n            goto err;\n        BN_set_negative(tmp, 1);\n        if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx), 0))\n            goto err;\n        ERR_clear_error();\n        BN_set_negative(tmp, 0);\n        if (BN_add(tmp, tmp, BN_value_one()))\n            goto err;\n        if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx)))\n            goto err;\n        ERR_clear_error();\n    }\n#endif\n    st = 1;\n err:\n    BN_free(a);\n    BN_free(square);\n    BN_free(zero);\n    BN_free(ret);\n    BN_free(remainder);\n    BN_free(tmp);\n    return st;\n}', 'int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n    int ret = bn_sqr_fixed_top(r, a, ctx);\n    bn_correct_top(r);\n    bn_check_top(r);\n    return ret;\n}', 'int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)\n{\n    int max, al;\n    int ret = 0;\n    BIGNUM *tmp, *rr;\n    bn_check_top(a);\n    al = a->top;\n    if (al <= 0) {\n        r->top = 0;\n        r->neg = 0;\n        return 1;\n    }\n    BN_CTX_start(ctx);\n    rr = (a != r) ? r : BN_CTX_get(ctx);\n    tmp = BN_CTX_get(ctx);\n    if (rr == NULL || tmp == NULL)\n        goto err;\n    max = 2 * al;\n    if (bn_wexpand(rr, max) == NULL)\n        goto err;\n    if (al == 4) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[8];\n        bn_sqr_normal(rr->d, a->d, 4, t);\n#else\n        bn_sqr_comba4(rr->d, a->d);\n#endif\n    } else if (al == 8) {\n#ifndef BN_SQR_COMBA\n        BN_ULONG t[16];\n        bn_sqr_normal(rr->d, a->d, 8, t);\n#else\n        bn_sqr_comba8(rr->d, a->d);\n#endif\n    } else {\n#if defined(BN_RECURSION)\n        if (al < BN_SQR_RECURSIVE_SIZE_NORMAL) {\n            BN_ULONG t[BN_SQR_RECURSIVE_SIZE_NORMAL * 2];\n            bn_sqr_normal(rr->d, a->d, al, t);\n        } else {\n            int j, k;\n            j = BN_num_bits_word((BN_ULONG)al);\n            j = 1 << (j - 1);\n            k = j + j;\n            if (al == j) {\n                if (bn_wexpand(tmp, k * 2) == NULL)\n                    goto err;\n                bn_sqr_recursive(rr->d, a->d, al, tmp->d);\n            } else {\n                if (bn_wexpand(tmp, max) == NULL)\n                    goto err;\n                bn_sqr_normal(rr->d, a->d, al, tmp->d);\n            }\n        }\n#else\n        if (bn_wexpand(tmp, max) == NULL)\n            goto err;\n        bn_sqr_normal(rr->d, a->d, al, tmp->d);\n#endif\n    }\n    rr->neg = 0;\n    rr->top = max;\n    rr->flags |= BN_FLG_FIXED_TOP;\n    if (r != rr && BN_copy(r, rr) == NULL)\n        goto err;\n    ret = 1;\n err:\n    bn_check_top(rr);\n    bn_check_top(tmp);\n    BN_CTX_end(ctx);\n    return ret;\n}', 'void BN_CTX_start(BN_CTX *ctx)\n{\n    CTXDBG("ENTER BN_CTX_start()", ctx);\n    if (ctx->err_stack || ctx->too_many)\n        ctx->err_stack++;\n    else if (!BN_STACK_push(&ctx->stack, ctx->used)) {\n        BNerr(BN_F_BN_CTX_START, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n        ctx->err_stack++;\n    }\n    CTXDBG("LEAVE BN_CTX_start()", ctx);\n}', 'void BN_CTX_end(BN_CTX *ctx)\n{\n    CTXDBG("ENTER BN_CTX_end()", ctx);\n    if (ctx->err_stack)\n        ctx->err_stack--;\n    else {\n        unsigned int fp = BN_STACK_pop(&ctx->stack);\n        if (fp < ctx->used)\n            BN_POOL_release(&ctx->pool, ctx->used - fp);\n        ctx->used = fp;\n        ctx->too_many = 0;\n    }\n    CTXDBG("LEAVE BN_CTX_end()", ctx);\n}', 'static unsigned int BN_STACK_pop(BN_STACK *st)\n{\n    return st->indexes[--(st->depth)];\n}']