- unsigned i, k;
- for (i=2, k=0; i <= pm; i += 2, k++) {
- c = cln::exquo(c * ((p3 - i)*(p2 - i)), (i - 1)*i);
- b = b + c * results[k];
- }
- results.push_back(-b / (p+1));
- next_r += 2;
+ unsigned i, k, p_2;
+ // test if intermediate unsigned int can be represented by immediate
+ // objects by CLN (i.e. < 2^29 for 32 Bit machines, see <cln/object.h>)
+ if (p < (1UL<<cl_value_len/2)) {
+ for (i=2, k=1, p_2=p/2; i<=pm; i+=2, ++k, --p_2) {
+ c = cln::exquo(c * ((p3-i) * p_2), (i-1)*k);
+ b = b + c*results[k];
+ }
+ } else {
+ for (i=2, k=1, p_2=p/2; i<=pm; i+=2, ++k, --p_2) {
+ c = cln::exquo((c * (p3-i)) * p_2, cln::cl_I(i-1)*k);
+ b = b + c*results[k];
+ }
+ }
+ results.push_back(-b/(p+1));