gmp/tests/refmpn.c

78 refmpn_overlap_low_to_high_p (mp_srcptr dst, mp_srcptr src, mp_size_t size)
80   return (dst <= src || ! refmpn_overlap_p (dst, size, src, size));
85 refmpn_overlap_high_to_low_p (mp_srcptr dst, mp_srcptr src, mp_size_t size)
87   return (dst >= src || ! refmpn_overlap_p (dst, size, src, size));
92 refmpn_overlap_fullonly_p (mp_srcptr dst, mp_srcptr src, mp_size_t size)
94   return (dst == src || ! refmpn_overlap_p (dst, size, src, size));
97 refmpn_overlap_fullonly_two_p (mp_srcptr dst, mp_srcptr src1, mp_srcptr src2,
100   return (refmpn_overlap_fullonly_p (dst, src1, size)
101 	  && refmpn_overlap_fullonly_p (dst, src2, size));
717 refmpn_neg (mp_ptr dst, mp_srcptr src, mp_size_t size)
726   ret = refmpn_sub_n (dst, zeros, src, size);
830 refmpn_mul_N (mp_ptr dst, mp_srcptr src, mp_size_t size,
837   ASSERT (refmpn_overlap_fullonly_p (dst, src, size));
838   ASSERT (! refmpn_overlap_p (dst, size+msize-1, mult, msize));
842   /* in case dst==src */
847   dst[size] = refmpn_mul_1 (dst, src, size, mult[0]);
849     dst[size+i] = refmpn_addmul_1 (dst+i, src, size, mult[i]);
850   ret = refmpn_addmul_1 (dst+i, src, size, mult[i]);
914 refmpn_addmul_N (mp_ptr dst, mp_srcptr src, mp_size_t size,
921   ASSERT (dst == src || ! refmpn_overlap_p (dst, size+msize-1, src, size));
922   ASSERT (! refmpn_overlap_p (dst, size+msize-1, mult, msize));
926   /* in case dst==src */
932     dst[size+i] = refmpn_addmul_1 (dst+i, src, size, mult[i]);
933   ret = refmpn_addmul_1 (dst+i, src, size, mult[i]);
1388 /* The aim is to produce a dst quotient and return a remainder c, satisfying
1389    c*b^n + src-i == 3*dst, where i is the incoming carry.
1400    satisfying c1*b^n + b^n+src-i == 3*dst, from which clearly c=c1+1.  This
1544 refmpn_sqr (mp_ptr dst, mp_srcptr src, mp_size_t size)
1546   refmpn_mul (dst, src, size, src, size);
1945 refmpn_get_str (unsigned char *dst, int base, mp_ptr src, mp_size_t size)
1958   ASSERT (! byte_overlap_p (dst, (mp_size_t) dsize, src, size * BYTES_PER_MP_LIMB));
1962       dst[0] = 0;
1970   d = dst + dsize;
1974       ASSERT (d >= dst);
1982   if (d != dst)
1985       dsize -= d - dst;
1987 	dst[i] = d[i];
2000   mp_limb_t  dst;
2003   dst = 0;
2006       dst = (dst << 8) + (src & 0xFF);
2009   return dst;