Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /** | |
| 2 * Copyright (c) 2012 the V8 project authors. All rights reserved. | |
| 3 * Copyright (c) 2009 Oliver Hunt <http://nerget.com> | |
| 4 * | |
| 5 * Permission is hereby granted, free of charge, to any person | |
| 6 * obtaining a copy of this software and associated documentation | |
| 7 * files (the "Software"), to deal in the Software without | |
| 8 * restriction, including without limitation the rights to use, | |
| 9 * copy, modify, merge, publish, distribute, sublicense, and/or sell | |
| 10 * copies of the Software, and to permit persons to whom the | |
| 11 * Software is furnished to do so, subject to the following | |
| 12 * conditions: | |
| 13 * | |
| 14 * The above copyright notice and this permission notice shall be | |
| 15 * included in all copies or substantial portions of the Software. | |
| 16 * | |
| 17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, | |
| 18 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES | |
| 19 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND | |
| 20 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT | |
| 21 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, | |
| 22 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING | |
| 23 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR | |
| 24 * OTHER DEALINGS IN THE SOFTWARE. | |
| 25 */ | |
| 26 | |
| 27 var name = 'navier-stokes2'; | |
|
kasperl
2012/02/09 07:09:12
I think you should make this fit with the other be
| |
| 28 | |
| 29 function setupNavierStokes() | |
| 30 { | |
| 31 solver = new FluidField(null); | |
|
kasperl
2012/02/09 07:09:12
The |solver| variable is undeclared. Add a global
| |
| 32 solver.setResolution(128, 128); | |
| 33 solver.setIterations(20); | |
| 34 solver.setDisplayFunction(function(){}); | |
| 35 solver.setUICallback(prepareFrame); | |
| 36 solver.reset(); | |
| 37 } | |
| 38 | |
| 39 function runNavierStokes() | |
|
kasperl
2012/02/09 07:09:12
I would replace this entire method with a call to
| |
| 40 { | |
| 41 var elapsed = 0; | |
| 42 var start = new Date(); | |
| 43 for (var n = 0; elapsed < 3000; n++) { | |
| 44 solver.update(); | |
| 45 elapsed = new Date() - start; | |
| 46 } | |
| 47 var usec = 1000 * elapsed / n; | |
| 48 print('Time (' + name + '): ' + Math.round(usec) + ' us.'); | |
| 49 } | |
| 50 | |
| 51 // Add new source point. | |
| 52 function addPoint(field, omx, omy, mx, my) { | |
| 53 var displaySize = 512; | |
| 54 // This code is copied from Oliver's html page. | |
|
kasperl
2012/02/09 07:09:12
Reference to the exact page?
| |
| 55 var dx = mx - omx; | |
| 56 var dy = my - omy; | |
| 57 var length = (Math.sqrt(dx * dx + dy * dy) + 0.5) | 0; | |
| 58 if (length < 1) length = 1; | |
| 59 for (var i = 0; i < length; i++) { | |
| 60 var x = (((omx + dx * (i / length)) / displaySize) * field.width()) | 0 | |
| 61 var y = (((omy + dy * (i / length)) / displaySize) * field.height()) | 0 ; | |
| 62 field.setVelocity(x, y, dx, dy); | |
| 63 field.setDensity(x, y, 50); | |
| 64 } | |
| 65 } | |
| 66 | |
| 67 // Random coordinates. | |
| 68 var x1 = [329, 312, 62, 326, 96, 480, 359, 487, | |
|
kasperl
2012/02/09 07:09:12
If any of these variables change during the execut
| |
| 69 40, 75, 249, 201, 145, 51, 227, 474, 10]; | |
| 70 var y1 = [46, 143, 457, 71, 488, 155, 91, 318, 495, | |
| 71 221, 232, 8, 483, 206, 423, 386]; | |
| 72 var x2 = [440, 303, 417, 213, 510, 512, 340, 338, | |
| 73 111, 406, 205, 447, 187, 305, 174]; | |
| 74 var y2 = [101, 114, 381, 299, 444, 110, 151, 228, 173, 146, 215]; | |
| 75 var framesTillAddingPoint = 0; | |
| 76 var framesBetweenAddingPoints = 5; | |
| 77 var pointCount = 0; | |
|
kasperl
2012/02/09 07:09:12
Is there anyway you can check that the benchmark b
| |
| 78 | |
| 79 // Simulate user interaction. | |
| 80 function prepareFrame(field) | |
| 81 { | |
| 82 if (framesTillAddingPoint == 0) { | |
| 83 pointCount++; | |
| 84 addPoint(field, x1[pointCount % x1.length], y1[pointCount % y1.length], | |
| 85 x2[pointCount % x2.length], y2[pointCount % y2.length]); | |
| 86 framesTillAddingPoint = framesBetweenAddingPoints; | |
| 87 framesBetweenAddingPoints++; | |
| 88 } else { | |
| 89 framesTillAddingPoint--; | |
| 90 } | |
| 91 } | |
| 92 | |
| 93 setupNavierStokes(); | |
|
kasperl
2012/02/09 07:09:12
These two calls should be dealt with by the benchm
| |
| 94 runNavierStokes(); | |
| 95 | |
| 96 // Original code from Oliver Hunt starts here. | |
| 97 function FluidField(canvas) { | |
| 98 function addFields(x, s, dt) | |
| 99 { | |
| 100 for (var i=0; i<size ; i++ ) x[i] += dt*s[i]; | |
| 101 } | |
| 102 | |
| 103 function set_bnd(b, x) | |
| 104 { | |
| 105 if (b===1) { | |
| 106 for (var i = 1; i <= width; i++) { | |
| 107 x[i] = x[i + rowSize]; | |
| 108 x[i + (height+1) *rowSize] = x[i + height * rowSize]; | |
| 109 } | |
| 110 | |
| 111 for (var j = 1; i <= height; i++) { | |
| 112 x[j * rowSize] = -x[1 + j * rowSize]; | |
| 113 x[(width + 1) + j * rowSize] = -x[width + j * rowSize]; | |
| 114 } | |
| 115 } else if (b === 2) { | |
| 116 for (var i = 1; i <= width; i++) { | |
| 117 x[i] = -x[i + rowSize]; | |
| 118 x[i + (height + 1) * rowSize] = -x[i + height * rowSize]; | |
| 119 } | |
| 120 | |
| 121 for (var j = 1; j <= height; j++) { | |
| 122 x[j * rowSize] = x[1 + j * rowSize]; | |
| 123 x[(width + 1) + j * rowSize] = x[width + j * rowSize]; | |
| 124 } | |
| 125 } else { | |
| 126 for (var i = 1; i <= width; i++) { | |
| 127 x[i] = x[i + rowSize]; | |
| 128 x[i + (height + 1) * rowSize] = x[i + height * rowSize]; | |
| 129 } | |
| 130 | |
| 131 for (var j = 1; j <= height; j++) { | |
| 132 x[j * rowSize] = x[1 + j * rowSize]; | |
| 133 x[(width + 1) + j * rowSize] = x[width + j * rowSize]; | |
| 134 } | |
| 135 } | |
| 136 var maxEdge = (height + 1) * rowSize; | |
| 137 x[0] = 0.5 * (x[1] + x[rowSize]); | |
| 138 x[maxEdge] = 0.5 * (x[1 + maxEdge] + x[height * rowSize]); | |
| 139 x[(width+1)] = 0.5 * (x[width] + x[(width + 1) + rowSize]); | |
| 140 x[(width+1)+maxEdge] = 0.5 * (x[width + maxEdge] + x[(width + 1) + heigh t * rowSize]); | |
| 141 } | |
| 142 | |
| 143 function lin_solve(b, x, x0, a, c) | |
| 144 { | |
| 145 if (a === 0 && c === 1) { | |
| 146 for (var j=1 ; j<=height; j++) { | |
| 147 var currentRow = j * rowSize; | |
| 148 ++currentRow; | |
| 149 for (var i = 0; i < width; i++) { | |
| 150 x[currentRow] = x0[currentRow]; | |
| 151 ++currentRow; | |
| 152 } | |
| 153 } | |
| 154 set_bnd(b, x); | |
| 155 } else { | |
| 156 var invC = 1 / c; | |
| 157 for (var k=0 ; k<iterations; k++) { | |
| 158 for (var j=1 ; j<=height; j++) { | |
| 159 var lastRow = (j - 1) * rowSize; | |
| 160 var currentRow = j * rowSize; | |
| 161 var nextRow = (j + 1) * rowSize; | |
| 162 var lastX = x[currentRow]; | |
| 163 ++currentRow; | |
| 164 for (var i=1; i<=width; i++) | |
| 165 lastX = x[currentRow] = (x0[currentRow] + a*(lastX+x[++c urrentRow]+x[++lastRow]+x[++nextRow])) * invC; | |
| 166 } | |
| 167 set_bnd(b, x); | |
| 168 } | |
| 169 } | |
| 170 } | |
| 171 | |
| 172 function diffuse(b, x, x0, dt) | |
| 173 { | |
| 174 var a = 0; | |
| 175 lin_solve(b, x, x0, a, 1 + 4*a); | |
| 176 } | |
| 177 | |
| 178 function lin_solve2(x, x0, y, y0, a, c) | |
| 179 { | |
| 180 if (a === 0 && c === 1) { | |
| 181 for (var j=1 ; j <= height; j++) { | |
| 182 var currentRow = j * rowSize; | |
| 183 ++currentRow; | |
| 184 for (var i = 0; i < width; i++) { | |
| 185 x[currentRow] = x0[currentRow]; | |
| 186 y[currentRow] = y0[currentRow]; | |
| 187 ++currentRow; | |
| 188 } | |
| 189 } | |
| 190 set_bnd(1, x); | |
| 191 set_bnd(2, y); | |
| 192 } else { | |
| 193 var invC = 1/c; | |
| 194 for (var k=0 ; k<iterations; k++) { | |
| 195 for (var j=1 ; j <= height; j++) { | |
| 196 var lastRow = (j - 1) * rowSize; | |
| 197 var currentRow = j * rowSize; | |
| 198 var nextRow = (j + 1) * rowSize; | |
| 199 var lastX = x[currentRow]; | |
| 200 var lastY = y[currentRow]; | |
| 201 ++currentRow; | |
| 202 for (var i = 1; i <= width; i++) { | |
| 203 lastX = x[currentRow] = (x0[currentRow] + a * (lastX + x [currentRow] + x[lastRow] + x[nextRow])) * invC; | |
| 204 lastY = y[currentRow] = (y0[currentRow] + a * (lastY + y [++currentRow] + y[++lastRow] + y[++nextRow])) * invC; | |
| 205 } | |
| 206 } | |
| 207 set_bnd(1, x); | |
| 208 set_bnd(2, y); | |
| 209 } | |
| 210 } | |
| 211 } | |
| 212 | |
| 213 function diffuse2(x, x0, y, y0, dt) | |
| 214 { | |
| 215 var a = 0; | |
| 216 lin_solve2(x, x0, y, y0, a, 1 + 4 * a); | |
| 217 } | |
| 218 | |
| 219 function advect(b, d, d0, u, v, dt) | |
| 220 { | |
| 221 var Wdt0 = dt * width; | |
| 222 var Hdt0 = dt * height; | |
| 223 var Wp5 = width + 0.5; | |
| 224 var Hp5 = height + 0.5; | |
| 225 for (var j = 1; j<= height; j++) { | |
| 226 var pos = j * rowSize; | |
| 227 for (var i = 1; i <= width; i++) { | |
| 228 var x = i - Wdt0 * u[++pos]; | |
| 229 var y = j - Hdt0 * v[pos]; | |
| 230 if (x < 0.5) | |
| 231 x = 0.5; | |
| 232 else if (x > Wp5) | |
| 233 x = Wp5; | |
| 234 var i0 = x | 0; | |
| 235 var i1 = i0 + 1; | |
| 236 if (y < 0.5) | |
| 237 y = 0.5; | |
| 238 else if (y > Hp5) | |
| 239 y = Hp5; | |
| 240 var j0 = y | 0; | |
| 241 var j1 = j0 + 1; | |
| 242 var s1 = x - i0; | |
| 243 var s0 = 1 - s1; | |
| 244 var t1 = y - j0; | |
| 245 var t0 = 1 - t1; | |
| 246 var row1 = j0 * rowSize; | |
| 247 var row2 = j1 * rowSize; | |
| 248 d[pos] = s0 * (t0 * d0[i0 + row1] + t1 * d0[i0 + row2]) + s1 * ( t0 * d0[i1 + row1] + t1 * d0[i1 + row2]); | |
| 249 } | |
| 250 } | |
| 251 set_bnd(b, d); | |
| 252 } | |
| 253 | |
| 254 function project(u, v, p, div) | |
| 255 { | |
| 256 var h = -0.5 / Math.sqrt(width * height); | |
| 257 for (var j = 1 ; j <= height; j++ ) { | |
| 258 var row = j * rowSize; | |
| 259 var previousRow = (j - 1) * rowSize; | |
| 260 var prevValue = row - 1; | |
| 261 var currentRow = row; | |
| 262 var nextValue = row + 1; | |
| 263 var nextRow = (j + 1) * rowSize; | |
| 264 for (var i = 1; i <= width; i++ ) { | |
| 265 div[++currentRow] = h * (u[++nextValue] - u[++prevValue] + v[++n extRow] - v[++previousRow]); | |
| 266 p[currentRow] = 0; | |
| 267 } | |
| 268 } | |
| 269 set_bnd(0, div); | |
| 270 set_bnd(0, p); | |
| 271 | |
| 272 lin_solve(0, p, div, 1, 4 ); | |
| 273 var wScale = 0.5 * width; | |
| 274 var hScale = 0.5 * height; | |
| 275 for (var j = 1; j<= height; j++ ) { | |
| 276 var prevPos = j * rowSize - 1; | |
| 277 var currentPos = j * rowSize; | |
| 278 var nextPos = j * rowSize + 1; | |
| 279 var prevRow = (j - 1) * rowSize; | |
| 280 var currentRow = j * rowSize; | |
| 281 var nextRow = (j + 1) * rowSize; | |
| 282 | |
| 283 for (var i = 1; i<= width; i++) { | |
| 284 u[++currentPos] -= wScale * (p[++nextPos] - p[++prevPos]); | |
| 285 v[currentPos] -= hScale * (p[++nextRow] - p[++prevRow]); | |
| 286 } | |
| 287 } | |
| 288 set_bnd(1, u); | |
| 289 set_bnd(2, v); | |
| 290 } | |
| 291 | |
| 292 function dens_step(x, x0, u, v, dt) | |
| 293 { | |
| 294 addFields(x, x0, dt); | |
| 295 diffuse(0, x0, x, dt ); | |
| 296 advect(0, x, x0, u, v, dt ); | |
| 297 } | |
| 298 | |
| 299 function vel_step(u, v, u0, v0, dt) | |
| 300 { | |
| 301 addFields(u, u0, dt ); | |
| 302 addFields(v, v0, dt ); | |
| 303 var temp = u0; u0 = u; u = temp; | |
| 304 var temp = v0; v0 = v; v = temp; | |
| 305 diffuse2(u,u0,v,v0, dt); | |
| 306 project(u, v, u0, v0); | |
| 307 var temp = u0; u0 = u; u = temp; | |
| 308 var temp = v0; v0 = v; v = temp; | |
| 309 advect(1, u, u0, u0, v0, dt); | |
| 310 advect(2, v, v0, u0, v0, dt); | |
| 311 project(u, v, u0, v0 ); | |
| 312 } | |
| 313 var uiCallback = function(d,u,v) {}; | |
| 314 | |
| 315 function Field(dens, u, v) { | |
| 316 // Just exposing the fields here rather than using accessors is a measur able win during display (maybe 5%) | |
| 317 // but makes the code ugly. | |
| 318 this.setDensity = function(x, y, d) { | |
| 319 dens[(x + 1) + (y + 1) * rowSize] = d; | |
| 320 } | |
| 321 this.getDensity = function(x, y) { | |
| 322 return dens[(x + 1) + (y + 1) * rowSize]; | |
| 323 } | |
| 324 this.setVelocity = function(x, y, xv, yv) { | |
| 325 u[(x + 1) + (y + 1) * rowSize] = xv; | |
| 326 v[(x + 1) + (y + 1) * rowSize] = yv; | |
| 327 } | |
| 328 this.getXVelocity = function(x, y) { | |
| 329 return u[(x + 1) + (y + 1) * rowSize]; | |
| 330 } | |
| 331 this.getYVelocity = function(x, y) { | |
| 332 return v[(x + 1) + (y + 1) * rowSize]; | |
| 333 } | |
| 334 this.width = function() { return width; } | |
| 335 this.height = function() { return height; } | |
| 336 } | |
| 337 function queryUI(d, u, v) | |
| 338 { | |
| 339 for (var i = 0; i < size; i++) | |
| 340 u[i] = v[i] = d[i] = 0.0; | |
| 341 uiCallback(new Field(d, u, v)); | |
| 342 } | |
| 343 | |
| 344 this.update = function () { | |
| 345 queryUI(dens_prev, u_prev, v_prev); | |
| 346 vel_step(u, v, u_prev, v_prev, dt); | |
| 347 dens_step(dens, dens_prev, u, v, dt); | |
| 348 displayFunc(new Field(dens, u, v)); | |
| 349 } | |
| 350 this.setDisplayFunction = function(func) { | |
| 351 displayFunc = func; | |
| 352 } | |
| 353 | |
| 354 this.iterations = function() { return iterations; } | |
| 355 this.setIterations = function(iters) { | |
| 356 if (iters > 0 && iters <= 100) | |
| 357 iterations = iters; | |
| 358 } | |
| 359 this.setUICallback = function(callback) { | |
| 360 uiCallback = callback; | |
| 361 } | |
| 362 var iterations = 10; | |
| 363 var visc = 0.5; | |
| 364 var dt = 0.1; | |
| 365 var dens; | |
| 366 var dens_prev; | |
| 367 var u; | |
| 368 var u_prev; | |
| 369 var v; | |
| 370 var v_prev; | |
| 371 var width; | |
| 372 var height; | |
| 373 var rowSize; | |
| 374 var size; | |
| 375 var displayFunc; | |
| 376 function reset() | |
| 377 { | |
| 378 rowSize = width + 2; | |
| 379 size = (width+2)*(height+2); | |
| 380 dens = new Array(size); | |
| 381 dens_prev = new Array(size); | |
| 382 u = new Array(size); | |
| 383 u_prev = new Array(size); | |
| 384 v = new Array(size); | |
| 385 v_prev = new Array(size); | |
| 386 for (var i = 0; i < size; i++) | |
| 387 dens_prev[i] = u_prev[i] = v_prev[i] = dens[i] = u[i] = v[i] = 0; | |
| 388 } | |
| 389 this.reset = reset; | |
| 390 this.setResolution = function (hRes, wRes) | |
| 391 { | |
| 392 var res = wRes * hRes; | |
| 393 if (res > 0 && res < 1000000 && (wRes != width || hRes != height)) { | |
| 394 width = wRes; | |
| 395 height = hRes; | |
| 396 reset(); | |
| 397 return true; | |
| 398 } | |
| 399 return false; | |
| 400 } | |
| 401 this.setResolution(64, 64); | |
| 402 } | |
| OLD | NEW |