> I'd like to move to C99 soon.
Nice. Any particular C99 features you'd like to use? Some of the
features (from the list on https://en.wikipedia.org/wiki/C99):
I am aware of that there are no compelling features provided with C99,
and that the ones at all relevant to us will not bring new
On 2018-03-29 11:27:24 +0200, Niels Möller wrote:
> Richard Biener writes:
>
> > I would be surprised if that wouldn't work everywhere - any reason
> > you have doubts? To clarify, allocation would work like
> >
> > void *ptr = malloc (... + sizeof (size_t));
> > ->_mp_d =
Ciao,
Il Mer, 4 Aprile 2018 9:00 am, Niels Möller ha scritto:
> t...@gmplib.org (Torbjörn Granlund) writes:
>> I'd suggest to make a 6.2 release of pretty much what we have today.
>
> Sounds good to me. Looking through my entries in ChangeLog, most
> interesting change was the merge of my changes
Presumably, that idea will work.
But based on my experience with multi-threading,
because of various overheads and latencies involved,
you have to make sure that there is enough work to do per
thread to make it worthwhile. Parallelizing the inner loops
like this may or may not yield the expected
"Richard Foster" writes:
> Even it looks OK in today's code, does Nisse's new FFT code change
> anything?
The small-prime FFT code uses fft-based multiplication of polynomials
over Z_p for a couple of single-limb primes p. Usually in the range from
3 to 5 primes, depending on
Hi all,
Since this FFT code is sitting around, I wonder if there's a chance I could
adapt it to NTL. I've actually implemented David Harvey's ideas a few years ago
(and his work is actually based on older NTL logic which I never really
publicized). NTL currently only uses special types like
Hi
It is probably not useful to work much on the current FFT code. We
have
long planned--and worked quite a bit on--replacement FFT code with much
better memory access pattern.
The replacement code works with multiple small coefficient fields
instead of a large ring. It also implements
Victor Shoup writes:
> So I guess I'm just asking where the FFT code is at and if there would be any
> objections to my using it in that way.
Here: https://gmplib.org/repo/gcd-nisse/
The relation to gcd is that subquadratic gcd includes multiplication of
2x2 matrices, and I
Thanks!
> On Apr 4, 2018, at 4:53 PM, Niels Möller wrote:
>
> Victor Shoup writes:
>
>> So I guess I'm just asking where the FFT code is at and if there would be
>> any objections to my using it in that way.
>
> Here:
t...@gmplib.org (Torbjörn Granlund) writes:
> I'd like to move to C99 soon.
Nice. Any particular C99 features you'd like to use? Some of the
features (from the list on https://en.wikipedia.org/wiki/C99):
* Better floating point support (e.g., standardized float.h).
* Standard inline (with
10 matches
Mail list logo