Searched refs:BI_DV (Results 1 – 4 of 4) sorted by relevance
| /external/v8/benchmarks/ |
| D | crypto.js | 46 var BI_DV; variable
153 BI_DV = (1<<dbits);
407 if(c < -1) r_array[i++] = BI_DV+c;
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) {
441 r_array[i+x.t] -= BI_DV;
550 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
552 return (y>0)?BI_DV-y:-y;
595 while(x_array[j] >= BI_DV) { x_array[j] -= BI_DV; x_array[++j]++; }
682 if(this.t == 1) return this_array[0]-BI_DV;
965 else if(c < -1) r_array[i++] = BI_DV+c;
[all …]
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| D | v8-crypto.js | 38 var BI_DV; variable
145 BI_DV = (1<<dbits);
399 if(c < -1) r_array[i++] = BI_DV+c;
432 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) {
433 r_array[i+x.t] -= BI_DV;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
544 return (y>0)?BI_DV-y:-y;
587 while(x_array[j] >= BI_DV) { x_array[j] -= BI_DV; x_array[++j]++; }
674 if(this.t == 1) return this_array[0]-BI_DV;
957 else if(c < -1) r_array[i++] = BI_DV+c;
[all …]
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| D | v8-crypto.js | 38 var BI_DV; variable
145 BI_DV = (1<<dbits);
399 if(c < -1) r_array[i++] = BI_DV+c;
432 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) {
433 r_array[i+x.t] -= BI_DV;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
544 return (y>0)?BI_DV-y:-y;
587 while(x_array[j] >= BI_DV) { x_array[j] -= BI_DV; x_array[++j]++; }
674 if(this.t == 1) return this_array[0]-BI_DV;
957 else if(c < -1) r_array[i++] = BI_DV+c;
[all …]
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| D | v8-crypto.js | 38 var BI_DV; variable
145 BI_DV = (1<<dbits);
399 if(c < -1) r_array[i++] = BI_DV+c;
432 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) {
433 r_array[i+x.t] -= BI_DV;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
544 return (y>0)?BI_DV-y:-y;
587 while(x_array[j] >= BI_DV) { x_array[j] -= BI_DV; x_array[++j]++; }
674 if(this.t == 1) return this_array[0]-BI_DV;
957 else if(c < -1) r_array[i++] = BI_DV+c;
[all …]
|