Lines Matching defs:big
569 * the old memory area is always big enough, so checking for MPD_Malloc_error
2038 * the buffer is big enough. Cannot fail.
2146 * Compare the data of big and small. This function does the equivalent
2148 * big and small, except that no allocation for the left shift is needed.
2151 _mpd_basecmp(mpd_uint_t *big, mpd_uint_t *small, mpd_size_t n, mpd_size_t m,
2174 CMP_EQUAL_OR_RETURN(big[n], h)
2180 CMP_EQUAL_OR_RETURN(big[n], x)
2184 CMP_EQUAL_OR_RETURN(big[q], x)
2188 CMP_EQUAL_OR_RETURN(big[m+q], small[m])
2192 return !_mpd_isallzero(big, q);
2552 * It is the caller's responsibility to ensure that the coefficient is big
2681 const mpd_t *big = a, *small = b;
2693 big = b;
2696 if (!mpd_qresize(result, big->len, status)) {
2704 y = big->data[i];
2720 y = big->data[i];
2743 /* scan the rest of big for digits > 1 */
2744 for (; i < big->len; i++) {
2745 y = big->data[i];
2872 const mpd_t *big = a, *small = b;
2884 big = b;
2887 if (!mpd_qresize(result, big->len, status)) {
2895 y = big->data[i];
2911 y = big->data[i];
2935 /* scan for digits > 1 and copy the rest of big */
2936 for (; i < big->len; i++) {
2937 y = big->data[i];
2945 result->data[i] = big->data[i];
2950 result->len = _mpd_real_size(result->data, big->len);
2970 MPD_NEW_STATIC(big,0,0,0,0);
3016 if (!mpd_qshiftl(&big, a, lshift, status)) {
3020 _mpd_cap(&big, ctx);
3026 _mpd_qadd(result, &big, &small, ctx, status);
3031 mpd_del(&big);
3191 const mpd_t *big = a, *small = b;
3203 big = b;
3206 if (!mpd_qresize(result, big->len, status)) {
3214 y = big->data[i];
3230 y = big->data[i];
3254 /* scan for digits > 1 and copy the rest of big */
3255 for (; i < big->len; i++) {
3256 y = big->data[i];
3264 result->data[i] = big->data[i];
3269 result->len = _mpd_real_size(result->data, big->len);
3338 const mpd_t *big, *small;
3348 big = a; small = b;
3349 if (big->exp != small->exp) {
3350 if (small->exp > big->exp) {
3351 _mpd_ptrswap(&big, &small);
3355 if (!mpd_iszerocoeff(big)) {
3356 exp = big->exp - 1;
3357 exp += (big->digits > ctx->prec) ? 0 : big->digits-ctx->prec-1;
3388 * of big. When subtracting, tiny is in the same position as
3399 shift = big->exp - small->exp;
3400 if (!mpd_qshiftl(&big_aligned, big, shift, status)) {
3404 big = &big_aligned;
3411 if (big->len < small->len) {
3412 _mpd_ptrswap(&big, &small);
3416 newsize = big->len;
3423 carry = _mpd_baseadd(result->data, big->data, small->data,
3424 big->len, small->len);
3427 newsize = big->len + 1;
3438 if (big->len == small->len) {
3439 for (i=big->len-1; i >= 0; --i) {
3440 if (big->data[i] != small->data[i]) {
3441 if (big->data[i] < small->data[i]) {
3442 _mpd_ptrswap(&big, &small);
3450 _mpd_basesub(result->data, big->data, small->data,
3451 big->len, small->len);
3452 newsize = _mpd_real_size(result->data, big->len);
5900 const mpd_t *big = a, *small = b;
5914 if (small->len > big->len) {
5915 _mpd_ptrswap(&big, &small);
5918 rsize = big->len + small->len;
5920 if (big->len == 1) {
5921 _mpd_singlemul(result->data, big->data[0], small->data[0]);
5925 if (big->len == 2) {
5926 _mpd_mul_2_le2(rbuf, big->data, small->data, small->len);
5931 _mpd_shortmul(rbuf, big->data, big->len, small->data[0]);
5934 _mpd_basemul(rbuf, small->data, big->data, small->len, big->len);
5951 _mpd_shortmul(rdata, big->data, big->len, small->data[0]);
5954 _mpd_basemul(rdata, small->data, big->data, small->len, big->len);
5959 rdata = _mpd_kmul(big->data, small->data, big->len, small->len, &rsize);
5962 rdata = _mpd_fntmul(big->data, small->data, big->len, small->len, &rsize);
5965 rdata = _mpd_kmul_fnt(big->data, small->data, big->len, small->len, &rsize);
5983 result->exp = big->exp + small->exp;