Re: Speed up RgX_mul, RgX_sqr, RgX_divrem over Z, Fp, FpXQ

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Wed, Jun 07, 2017 at 10:55:30PM +0200, Peter Bruin wrote:
> Hi Bill,
> 
> > Maybe it would be better to have functions RgX_mul_i etc. that does
> > what RgX_mul is doing now, and change RgX_mul to do what you suggest.
> 
> That last alternative certainly sounds like the better one to me.  I
> guess that we would then call RgX_mul_i et al. only in cases where we
> know (thanks to earlier checks) that the polynomials do _not_ have a
> common "special" base ring, is that what you mean?

Yes. When writing generic polynomial code, it is more readable to use
RgX_mul for polynomials and gmul for scalars than gmul for both.

I will discuss this with Karim.

Cheers,
Bill.