crypto/bn/bn_exp.c:1215: error: BUFFER_OVERRUN_L3
  Offset: [-1, +oo] Size: [1, +oo] by call to `BN_to_montgomery`.
Showing all 18 steps of the trace


crypto/bn/bn_exp.c:1129:1: Parameter `ctx->stack.depth`
1127.   }
1128.   
1129. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
1130.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
1131.   {

crypto/bn/bn_exp.c:1189:5: Call
1187.       }
1188.   
1189.       BN_CTX_start(ctx);
            ^
1190.       r = BN_CTX_get(ctx);
1191.       t = BN_CTX_get(ctx);

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

crypto/bn/bn_exp.c:1215:22: Call
1213.           if ((next_w / w) != w) { /* overflow */
1214.               if (r_is_one) {
1215.                   if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
                             ^
1216.                       goto err;
1217.                   r_is_one = 0;

crypto/bn/bn_lib.c:889:1: Parameter `ctx->stack.depth`
  887.   }
  888.   
  889. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
  890.                        BN_CTX *ctx)
  891.   {

crypto/bn/bn_lib.c:892:12: Call
  890.                        BN_CTX *ctx)
  891.   {
  892.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                    ^
  893.   }
  894.   

crypto/bn/bn_mont.c:26:1: Parameter `ctx->stack.depth`
    24.   #endif
    25.   
    26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    28.   {

crypto/bn/bn_mont.c:29:15: Call
    27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
    28.   {
    29.       int ret = bn_mul_mont_fixed_top(r, a, b, mont, ctx);
                        ^
    30.   
    31.       bn_correct_top(r);

crypto/bn/bn_mont.c:60:5: Call
      58.           return 0;
      59.   
      60.       BN_CTX_start(ctx);
                ^
      61.       tmp = BN_CTX_get(ctx);
      62.       if (tmp == NULL)

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_mont.c:83:5: Call
      81.       ret = 1;
      82.    err:
      83.       BN_CTX_end(ctx);
                ^
      84.       return ret;
      85.   }

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_to_montgomery` 
          266.   static unsigned int BN_STACK_pop(BN_STACK *st)
          267.   {
          268.       return st->indexes[--(st->depth)];
                            ^
          269.   }
          270.   
