Lines Matching refs:xx
744 unsigned long xx;
780 // Initial condition starts at 1: xx=(1L<<30);
781 // First iteration is simple: Instead of initializing xx=1, assign to result of first iteration:
782 // xx= (3/2-x0/2);
783 //% NR formula: xx=xx*(3/2-x0*xx*xx/2); = xx*(1.5 - (x0/2)*xx*xx)
784 // Initialize NR (first iteration). Note we are starting with xx=1, so the first iteration becomes an initialization.
785 xx = oneandhalf - x0_2;
788 xx = inv_q30_mult( xx, ( oneandhalf - inv_q30_mult(x0_2, inv_q30_mult(xx,xx) ) ) );
791 xx = inv_q30_mult( xx, ( oneandhalf - inv_q30_mult(x0_2, inv_q30_mult(xx,xx) ) ) );
797 return (inv_q30_mult(xx,oneoversqrt2));
801 return xx;
826 long xx, cc;
847 xx = x0 - (inv_q30_mult(x0, cc)>>1);
853 xx = xx - (inv_q30_mult(xx, cc)>>1);
857 xx = xx - (inv_q30_mult(xx, cc)>>1);
861 xx = inv_q30_mult(xx,oneoversqrt2);
864 xx = (xx >> (pow2>>1));
866 xx = inv_q30_mult(xx,sqrt2);
867 return xx;
885 long two, xx;
940 xx = (two - x0) + 1; // Note 2 will overflow so the computation (2-x) is done with "two" == (2^30-1)
942 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 );
945 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 );
948 xx = inv_q30_mult( xx, (two - inv_q30_mult(x0, xx)) + 1 );
955 xx = inv_q30_mult( xx, upscale);
957 xx = inv_q30_mult( xx, downscale);
960 xx = -xx;
961 return xx;
