js/src/jit-test/tests/sunspider/check-bitops-nsieve-bits.js

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

     1 // The Great Computer Language Shootout
     2 //  http://shootout.alioth.debian.org
     3 //
     4 //  Contributed by Ian Osgood
     6 var result = [];
     8 function pad(n,width) {
     9   var s = n.toString();
    10   while (s.length < width) s = ' ' + s;
    11   return s;
    12 }
    14 function primes(isPrime, n) {
    15   var i, count = 0, m = 10000<<n, size = m+31>>5;
    17   for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
    19   for (i=2; i<m; i++)
    20     if (isPrime[i>>5] & 1<<(i&31)) {
    21       for (var j=i+i; j<m; j+=i)
    22         result.push(isPrime[j>>5] &= ~(1<<(j&31)));
    23       count++;
    24     }
    25 }
    27 function sieve() {
    28     for (var i = 4; i <= 4; i++) {
    29         var isPrime = new Array((10000<<i)+31>>5);
    30         primes(isPrime, i);
    31     }
    32 }
    34 sieve();
    36 var ret = 0;
    37 for (var i = 0; i < result.length; ++i)
    38   ret += result[i];
    40 assertEq(ret, -211235557404919)

mercurial