Lines Matching defs:am
69 // am: Compute w_j += (x*this_i), propagate carries,
148 BigInteger.prototype.am = fn;
424 for(i = 0; i < y.t; ++i) r_array[i+x.t] = x.am(0,y_array[i],r,i,0,x.t);
439 var c = x.am(i,x_array[i],r,2*i,0,1);
440 if((r_array[i+x.t]+=x.am(i+1,2*x_array[i],r,2*i+1,c,x.t-i-1)) >= BI_DV) {
445 if(r.t > 0) r_array[r.t-1] += x.am(i,x_array[i],r,2*i,0,1);
483 t.subTo(y,y); // "negative" y so we can replace sub with am later
488 if((r_array[i]+=y.am(0,qd,r,j,0,ys)) < qd) { // Try it out
585 while(x.t <= this.mt2) // pad x so am has enough room later
591 // use am to combine the multiply-shift-add into one call
593 x_array[j] += this.m.am(0,u0,x,i,0,this.m.t);
995 this_array[this.t] = this.am(0,n-1,this,0,0,this.t);
1036 for(j = r.t-this.t; i < j; ++i) r_array[i+this.t] = this.am(0,a_array[i],r,i,0,this.t);
1037 for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a_array[i],r,i,0,n-i);
1051 r_array[this.t+i-n] = this.am(n-i,a_array[i],r,0,0,this.t+i-n);
