int BN_set_word(BIGNUM *a, BN_ULONG w)
{
    bn_check_top(a);
    if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
        return 0;
    a->neg = 0;
    a->d[0] = w;
    a->top = (w ? 1 : 0);
    a->flags &= ~BN_FLG_FIXED_TOP;
    bn_check_top(a);
    return 1;
}
['static int test_bn_small_factors(void)\n{\n    int ret = 0, i;\n    BIGNUM *b = NULL;\n    if (!(TEST_ptr(b = BN_new()) && TEST_true(BN_set_word(b, 3))))\n        goto err;\n    for (i = 1; i < NUMPRIMES; i++) {\n        prime_t p = primes[i];\n        if (p > 3 && p <= 751)\n            BN_mul_word(b, p);\n        if (p > 751)\n            break;\n    }\n    ret = TEST_BN_eq(bn_get0_small_factors(), b);\nerr:\n    BN_free(b);\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}', 'static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)\n{\n    if (bits > (INT_MAX - BN_BITS2 + 1))\n        return NULL;\n    if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax)\n        return a;\n    return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);\n}', 'int BN_mul_word(BIGNUM *a, BN_ULONG w)\n{\n    BN_ULONG ll;\n    bn_check_top(a);\n    w &= BN_MASK2;\n    if (a->top) {\n        if (w == 0)\n            BN_zero(a);\n        else {\n            ll = bn_mul_words(a->d, a->d, a->top, w);\n            if (ll) {\n                if (bn_wexpand(a, a->top + 1) == NULL)\n                    return 0;\n                a->d[a->top++] = ll;\n            }\n        }\n    }\n    bn_check_top(a);\n    return 1;\n}']