crypto/bn/bn_print.c:95: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word`.
Showing all 16 steps of the trace


crypto/bn/bn_print.c:80:14: Call
78.           goto err;
79.       }
80.       if ((t = BN_dup(a)) == NULL)
                   ^
81.           goto err;
82.   

crypto/bn/bn_lib.c:354:10: Call
  352.       if (t == NULL)
  353.           return NULL;
  354.       if (!BN_copy(t, a)) {
                  ^
  355.           BN_free(t);
  356.           return NULL;

crypto/bn/bn_lib.c:362:1: Parameter `*a->d`
    360.   }
    361.   
    362. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    363.   {
    364.       int i;

crypto/bn/bn_print.c:95:19: Call
93.           i = 0;
94.           while (!BN_is_zero(t)) {
95.               *lp = BN_div_word(t, BN_DEC_CONV);
                        ^
96.               lp++;
97.           }

crypto/bn/bn_word.c:39:1: Parameter `*a->d`
  37.   }
  38.   
  39. > BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w)
  40.   {
  41.       BN_ULONG ret = 0;

crypto/bn/bn_word.c:56:10: Call
  54.       j = BN_BITS2 - BN_num_bits_word(w);
  55.       w <<= j;
  56.       if (!BN_lshift(a, a, j))
                 ^
  57.           return (BN_ULONG)-1;
  58.   

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
    79.   }
    80.   
    81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    82.   {
    83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
    95.       r->neg = a->neg;
    96.       nw = n / BN_BITS2;
    97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    98.           return (0);
    99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1014:1: Parameter `*a->d`
      1012.   }
      1013.   
      1014. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1015.   {
      1016.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:1016:37: Call
      1014.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1015.   {
      1016.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      1017.   }
      1018.   

crypto/bn/bn_lib.c:323:1: Parameter `*b->d`
        321.    */
        322.   
        323. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        324.   {
        325.       bn_check_top(b);

crypto/bn/bn_lib.c:328:23: Call
        326.   
        327.       if (words > b->dmax) {
        328.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        329.           if (!a)
        330.               return NULL;

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

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

crypto/bn/bn_lib.c:272:5: Assignment
          270.   
          271.   #if 1
          272.       B = b->d;
                     ^
          273.       /* Check if the previous number needs to be copied */
          274.       if (B != NULL) {

crypto/bn/bn_lib.c:289:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_div_word` 
          287.               a1 = B[1];
          288.               a2 = B[2];
          289.               a3 = B[3];
                                  ^
          290.               A[0] = a0;
          291.               A[1] = a1;
