crypto/ec/ec2_smpl.c:192: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `bn_wexpand`.
Showing all 11 steps of the trace


crypto/ec/ec2_smpl.c:182:10: Call
180.       if (!BN_copy(dest->field, src->field))
181.           return 0;
182.       if (!BN_copy(dest->a, src->a))
                ^
183.           return 0;
184.       if (!BN_copy(dest->b, src->b))

crypto/bn/bn_lib.c:429:1: Parameter `*a->d`
  427.   }
  428.   
  429. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
  430.   {
  431.       int i;

crypto/ec/ec2_smpl.c:192:9: Call
190.       dest->poly[4] = src->poly[4];
191.       dest->poly[5] = src->poly[5];
192.       if (bn_wexpand(dest->a, (int)(dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) ==
               ^
193.           NULL)
194.           return 0;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
  993.   }
  994.   
  995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
  996.   {
  997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
  995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
  996.   {
  997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                              ^
  998.   }
  999.   

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
    388.    */
    389.   
    390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
    391.   {
    392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
    393.   
    394.       if (words > b->dmax) {
    395.           BN_ULONG *a = bn_expand_internal(b, words);
                                 ^
    396.           if (!a)
    397.               return NULL;

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

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

crypto/bn/bn_lib.c:335:5: Assignment
      333.   
      334.   #if 1
      335.       B = b->d;
                 ^
      336.       /* Check if the previous number needs to be copied */
      337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `bn_wexpand` 
      350.               a1 = B[1];
      351.               a2 = B[2];
      352.               a3 = B[3];
                              ^
      353.               A[0] = a0;
      354.               A[1] = a1;

static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
{
    BN_ULONG *A, *a = NULL;
    const BN_ULONG *B;
    int i;
    bn_check_top(b);
    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 = A = OPENSSL_secure_malloc(words * sizeof(*a));
    else
        a = A = OPENSSL_malloc(words * sizeof(*a));
    if (A == NULL) {
        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);
        return (NULL);
    }
#ifdef PURIFY
    memset(a, 0, sizeof(*a) * words);
#endif
#if 1
    B = b->d;
    if (B != NULL) {
        for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {
            BN_ULONG a0, a1, a2, a3;
            a0 = B[0];
            a1 = B[1];
            a2 = B[2];
            a3 = B[3];
            A[0] = a0;
            A[1] = a1;
            A[2] = a2;
            A[3] = a3;
        }
        switch (b->top & 3) {
        case 3:
            A[2] = B[2];
        case 2:
            A[1] = B[1];
        case 1:
            A[0] = B[0];
        case 0:
            ;
        }
    }
#else
    memset(A, 0, sizeof(*A) * words);
    memcpy(A, b->d, sizeof(b->d[0]) * b->top);
#endif
    return (a);
}
['int ec_GF2m_simple_group_copy(EC_GROUP *dest, const EC_GROUP *src)\n{\n    if (!BN_copy(dest->field, src->field))\n        return 0;\n    if (!BN_copy(dest->a, src->a))\n        return 0;\n    if (!BN_copy(dest->b, src->b))\n        return 0;\n    dest->poly[0] = src->poly[0];\n    dest->poly[1] = src->poly[1];\n    dest->poly[2] = src->poly[2];\n    dest->poly[3] = src->poly[3];\n    dest->poly[4] = src->poly[4];\n    dest->poly[5] = src->poly[5];\n    if (bn_wexpand(dest->a, (int)(dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) ==\n        NULL)\n        return 0;\n    if (bn_wexpand(dest->b, (int)(dest->poly[0] + BN_BITS2 - 1) / BN_BITS2) ==\n        NULL)\n        return 0;\n    bn_set_all_zero(dest->a);\n    bn_set_all_zero(dest->b);\n    return 1;\n}', 'BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)\n{\n    int i;\n    BN_ULONG *A;\n    const BN_ULONG *B;\n    bn_check_top(b);\n    if (a == b)\n        return (a);\n    if (bn_wexpand(a, b->top) == NULL)\n        return (NULL);\n#if 1\n    A = a->d;\n    B = b->d;\n    for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {\n        BN_ULONG a0, a1, a2, a3;\n        a0 = B[0];\n        a1 = B[1];\n        a2 = B[2];\n        a3 = B[3];\n        A[0] = a0;\n        A[1] = a1;\n        A[2] = a2;\n        A[3] = a3;\n    }\n    switch (b->top & 3) {\n    case 3:\n        A[2] = B[2];\n    case 2:\n        A[1] = B[1];\n    case 1:\n        A[0] = B[0];\n    case 0:;\n    }\n#else\n    memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);\n#endif\n    a->top = b->top;\n    a->neg = b->neg;\n    bn_check_top(a);\n    return (a);\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    bn_check_top(b);\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    bn_check_top(b);\n    return b;\n}', 'static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)\n{\n    BN_ULONG *A, *a = NULL;\n    const BN_ULONG *B;\n    int i;\n    bn_check_top(b);\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 = A = OPENSSL_secure_malloc(words * sizeof(*a));\n    else\n        a = A = OPENSSL_malloc(words * sizeof(*a));\n    if (A == NULL) {\n        BNerr(BN_F_BN_EXPAND_INTERNAL, ERR_R_MALLOC_FAILURE);\n        return (NULL);\n    }\n#ifdef PURIFY\n    memset(a, 0, sizeof(*a) * words);\n#endif\n#if 1\n    B = b->d;\n    if (B != NULL) {\n        for (i = b->top >> 2; i > 0; i--, A += 4, B += 4) {\n            BN_ULONG a0, a1, a2, a3;\n            a0 = B[0];\n            a1 = B[1];\n            a2 = B[2];\n            a3 = B[3];\n            A[0] = a0;\n            A[1] = a1;\n            A[2] = a2;\n            A[3] = a3;\n        }\n        switch (b->top & 3) {\n        case 3:\n            A[2] = B[2];\n        case 2:\n            A[1] = B[1];\n        case 1:\n            A[0] = B[0];\n        case 0:\n            ;\n        }\n    }\n#else\n    memset(A, 0, sizeof(*A) * words);\n    memcpy(A, b->d, sizeof(b->d[0]) * b->top);\n#endif\n    return (a);\n}']