OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BI_DV
(Results
1 - 5
of
5
) sorted by null
/cts/suite/cts/deviceTests/browserbench/assets/octane/
crypto.js
46
var
BI_DV
;
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]++;
[
all
...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
v8-crypto.js
38
var
BI_DV
;
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]++;
[
all
...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
v8-crypto.js
38
var
BI_DV
;
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]++;
[
all
...]
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
v8-crypto.js
38
var
BI_DV
;
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]++;
[
all
...]
/external/chromium_org/v8/benchmarks/
crypto.js
46
var
BI_DV
;
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]++;
[
all
...]
Completed in 3698 milliseconds