Home | History | Annotate | Download | only in generic

Lines Matching refs:powtab

63   1. The recursive function of (C) could use less temporary memory.  The powtab
78      powtab parameter for dividing the current number into a fraction.  Convert
81      powtab instead of the actual powers.
82   6. Decrease powtab allocation for even bases.  E.g. for base 10 we could save
305 /* Convert {UP,UN} to a string with a base as represented in POWTAB, and put
313 		const powers_t *powtab, mp_ptr tmp)
318 	str = mpn_bc_get_str (str, len, up, un, powtab->base);
334       pwp = powtab->p;
335       pwn = powtab->n;
336       sn = powtab->shift;
340 	  str = mpn_dc_get_str (str, len, up, un, powtab - 1, tmp);
353 	    len = len - powtab->digits_in_base;
355 	  str = mpn_dc_get_str (str, len, qp, qn, powtab - 1, tmp + qn);
356 	  str = mpn_dc_get_str (str, powtab->digits_in_base, rp, pwn + sn, powtab - 1, tmp);
370   powers_t powtab[GMP_LIMB_BITS];
445   pi = 1 + mpn_compute_powtab (powtab, powtab_mem, xn, base);
447   /* Using our precomputed powers, now in powtab[], convert our number.  */
449   out_len = mpn_dc_get_str (str, 0, up, un, powtab + (pi - 1), tmp) - str;