The Tor Browser: js/src/parjs-benchmarks/mandelbrot.js@129ffea94266 (annotated)

js/src/parjs-benchmarks/mandelbrot.js@129ffea94266 (annotated)

js/src/parjs-benchmarks/mandelbrot.js

Sat, 03 Jan 2015 20:18:00 +0100

author: Michael Schloh von Bennewitz <michael@schloh.com>
date: Sat, 03 Jan 2015 20:18:00 +0100
branch: TOR_BUG_3246
changeset 7: 129ffea94266
permissions: -rw-r--r--

Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.

 // Adapted from
 //
 // https://github.com/RiverTrail/RiverTrail/blob/master/examples/mandelbrot/mandelbrot.js
 //
 // which in turn is adapted from a WebCL implementation available at
 //
 // http://www.ibiblio.org/e-notes/webcl/mandelbrot.html
 var nc = 30, maxCol = nc*3, cr,cg,cb;
 load(libdir + "util.js");
 // this is the actual mandelbrot computation, ported to JavaScript
 // from the WebCL / OpenCL example at
 // http://www.ibiblio.org/e-notes/webcl/mandelbrot.html
 function computeSetByRow(x, y) {
   var Cr = (x - 256) / scale + 0.407476;
   var Ci = (y - 256) / scale + 0.234204;
   var I = 0, R = 0, I2 = 0, R2 = 0;
   var n = 0;
   while ((R2+I2 < 2.0) && (n < 512)) {
     I = (R+R)*I+Ci;
     R = R2-I2+Cr;
     R2 = R*R;
     I2 = I*I;
     n++;
   }
   return n;
 }
 function computeSequentially() {
   result = [];
   for (var r = 0; r < rows; r++) {
     for (var c = 0; c < cols; c++) {
       result.push(computeSetByRow(c, r));
     }
   }
   return result;
 }
 function computeParallel() {
   return new ParallelArray([rows, cols], function(r, c) {
     return computeSetByRow(c, r);
   }).flatten();
 }
 function compare(arrs, pas) {
   for (var r = 0; r < rows; r++) {
     for (var c = 0; c < cols; c++) {
       assertEq(seq[c + r * cols], par.get(r, c));
     }
   }
 }
 var scale = 10000*300;
 var rows = 1024;
 var cols = 1024;
 // Experimentally, warmup doesn't seem to be necessary:
 benchmark("MANDELBROT", 1, DEFAULT_MEASURE,
           computeSequentially, computeParallel);