build/pgo/js-input/bitops-nsieve-bits.html

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.

michael@0 1 <!DOCTYPE html>
michael@0 2 <head>
michael@0 3 <!--
michael@0 4 Copyright (C) 2007 Apple Inc. All rights reserved.
michael@0 5
michael@0 6 Redistribution and use in source and binary forms, with or without
michael@0 7 modification, are permitted provided that the following conditions
michael@0 8 are met:
michael@0 9 1. Redistributions of source code must retain the above copyright
michael@0 10 notice, this list of conditions and the following disclaimer.
michael@0 11 2. Redistributions in binary form must reproduce the above copyright
michael@0 12 notice, this list of conditions and the following disclaimer in the
michael@0 13 documentation and/or other materials provided with the distribution.
michael@0 14
michael@0 15 THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
michael@0 16 EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
michael@0 18 PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
michael@0 19 CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
michael@0 20 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
michael@0 21 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
michael@0 22 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
michael@0 23 OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0 24 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0 25 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0 26 -->
michael@0 27
michael@0 28 <title>SunSpider bitops-nsieve-bits</title>
michael@0 29
michael@0 30 </head>
michael@0 31
michael@0 32 <body>
michael@0 33 <h3>bitops-nsieve-bits</h3>
michael@0 34 <div id="console">
michael@0 35 </div>
michael@0 36
michael@0 37 <script>
michael@0 38
michael@0 39 var _sunSpiderStartDate = new Date();
michael@0 40
michael@0 41 // The Great Computer Language Shootout
michael@0 42 // http://shootout.alioth.debian.org
michael@0 43 //
michael@0 44 // Contributed by Ian Osgood
michael@0 45
michael@0 46 function pad(n,width) {
michael@0 47 var s = n.toString();
michael@0 48 while (s.length < width) s = ' ' + s;
michael@0 49 return s;
michael@0 50 }
michael@0 51
michael@0 52 function primes(isPrime, n) {
michael@0 53 var i, count = 0, m = 10000<<n, size = m+31>>5;
michael@0 54
michael@0 55 for (i=0; i<size; i++) isPrime[i] = 0xffffffff;
michael@0 56
michael@0 57 for (i=2; i<m; i++)
michael@0 58 if (isPrime[i>>5] & 1<<(i&31)) {
michael@0 59 for (var j=i+i; j<m; j+=i)
michael@0 60 isPrime[j>>5] &= ~(1<<(j&31));
michael@0 61 count++;
michael@0 62 }
michael@0 63 }
michael@0 64
michael@0 65 function sieve() {
michael@0 66 for (var i = 4; i <= 4; i++) {
michael@0 67 var isPrime = new Array((10000<<i)+31>>5);
michael@0 68 primes(isPrime, i);
michael@0 69 }
michael@0 70 }
michael@0 71
michael@0 72 sieve();
michael@0 73
michael@0 74
michael@0 75 var _sunSpiderInterval = new Date() - _sunSpiderStartDate;
michael@0 76
michael@0 77 document.getElementById("console").innerHTML = _sunSpiderInterval;
michael@0 78 </script>
michael@0 79
michael@0 80
michael@0 81 </body>
michael@0 82 </html>

mercurial