mirror of https://github.com/tc39/test262.git
Remove folders without unit tests for ES
I observed each file in each of these folders and they don't contain any test matching for specific parts of ECMAScript, without a specific place for Test262. Ref https://github.com/bocoup/test262-automation/pull/76
This commit is contained in:
Leo Balter
Rick Waldron
parent
ead09a5080
commit
a83bae960c
|
|
@ -1,902 +0,0 @@
|
|||
// The ray tracer code in this file is written by Adam Burmister. It
|
||||
// is available in its original form from:
|
||||
//
|
||||
// http://labs.flog.nz.co/raytracer/
|
||||
//
|
||||
// It has been modified slightly by Google to work as a standalone
|
||||
// benchmark, but the all the computational code remains
|
||||
// untouched. This file also contains a copy of parts of the Prototype
|
||||
// JavaScript framework which is used by the ray tracer.
|
||||
|
||||
// Variable used to hold a number that can be used to verify that
|
||||
// the scene was ray traced correctly.
|
||||
var checkNumber;
|
||||
|
||||
|
||||
// ------------------------------------------------------------------------
|
||||
// ------------------------------------------------------------------------
|
||||
|
||||
// The following is a copy of parts of the Prototype JavaScript library:
|
||||
|
||||
// Prototype JavaScript framework, version 1.5.0
|
||||
// (c) 2005-2007 Sam Stephenson
|
||||
//
|
||||
// Prototype is freely distributable under the terms of an MIT-style license.
|
||||
// For details, see the Prototype web site: http://prototype.conio.net/
|
||||
|
||||
|
||||
var Class = {
|
||||
create: function() {
|
||||
return function() {
|
||||
this.initialize.apply(this, arguments);
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
Object.extend = function(destination, source) {
|
||||
for (var property in source) {
|
||||
destination[property] = source[property];
|
||||
}
|
||||
return destination;
|
||||
};
|
||||
|
||||
|
||||
// ------------------------------------------------------------------------
|
||||
// ------------------------------------------------------------------------
|
||||
|
||||
// The rest of this file is the actual ray tracer written by Adam
|
||||
// Burmister. It's a concatenation of the following files:
|
||||
//
|
||||
// flog/color.js
|
||||
// flog/light.js
|
||||
// flog/vector.js
|
||||
// flog/ray.js
|
||||
// flog/scene.js
|
||||
// flog/material/basematerial.js
|
||||
// flog/material/solid.js
|
||||
// flog/material/chessboard.js
|
||||
// flog/shape/baseshape.js
|
||||
// flog/shape/sphere.js
|
||||
// flog/shape/plane.js
|
||||
// flog/intersectioninfo.js
|
||||
// flog/camera.js
|
||||
// flog/background.js
|
||||
// flog/engine.js
|
||||
|
||||
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Color = Class.create();
|
||||
|
||||
Flog.RayTracer.Color.prototype = {
|
||||
red : 0.0,
|
||||
green : 0.0,
|
||||
blue : 0.0,
|
||||
|
||||
initialize : function(r, g, b) {
|
||||
if(!r) r = 0.0;
|
||||
if(!g) g = 0.0;
|
||||
if(!b) b = 0.0;
|
||||
|
||||
this.red = r;
|
||||
this.green = g;
|
||||
this.blue = b;
|
||||
},
|
||||
|
||||
add : function(c1, c2){
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red + c2.red;
|
||||
result.green = c1.green + c2.green;
|
||||
result.blue = c1.blue + c2.blue;
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
addScalar: function(c1, s){
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red + s;
|
||||
result.green = c1.green + s;
|
||||
result.blue = c1.blue + s;
|
||||
|
||||
result.limit();
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
subtract: function(c1, c2){
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red - c2.red;
|
||||
result.green = c1.green - c2.green;
|
||||
result.blue = c1.blue - c2.blue;
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
multiply : function(c1, c2) {
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red * c2.red;
|
||||
result.green = c1.green * c2.green;
|
||||
result.blue = c1.blue * c2.blue;
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
multiplyScalar : function(c1, f) {
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red * f;
|
||||
result.green = c1.green * f;
|
||||
result.blue = c1.blue * f;
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
divideFactor : function(c1, f) {
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
|
||||
result.red = c1.red / f;
|
||||
result.green = c1.green / f;
|
||||
result.blue = c1.blue / f;
|
||||
|
||||
return result;
|
||||
},
|
||||
|
||||
limit: function(){
|
||||
this.red = (this.red > 0.0) ? ( (this.red > 1.0) ? 1.0 : this.red ) : 0.0;
|
||||
this.green = (this.green > 0.0) ? ( (this.green > 1.0) ? 1.0 : this.green ) : 0.0;
|
||||
this.blue = (this.blue > 0.0) ? ( (this.blue > 1.0) ? 1.0 : this.blue ) : 0.0;
|
||||
},
|
||||
|
||||
distance : function(color) {
|
||||
var d = Math.abs(this.red - color.red) + Math.abs(this.green - color.green) + Math.abs(this.blue - color.blue);
|
||||
return d;
|
||||
},
|
||||
|
||||
blend: function(c1, c2, w){
|
||||
var result = new Flog.RayTracer.Color(0,0,0);
|
||||
result = Flog.RayTracer.Color.prototype.add(
|
||||
Flog.RayTracer.Color.prototype.multiplyScalar(c1, 1 - w),
|
||||
Flog.RayTracer.Color.prototype.multiplyScalar(c2, w)
|
||||
);
|
||||
return result;
|
||||
},
|
||||
|
||||
brightness : function() {
|
||||
var r = Math.floor(this.red*255);
|
||||
var g = Math.floor(this.green*255);
|
||||
var b = Math.floor(this.blue*255);
|
||||
return (r * 77 + g * 150 + b * 29) >> 8;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
var r = Math.floor(this.red*255);
|
||||
var g = Math.floor(this.green*255);
|
||||
var b = Math.floor(this.blue*255);
|
||||
|
||||
return "rgb("+ r +","+ g +","+ b +")";
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Light = Class.create();
|
||||
|
||||
Flog.RayTracer.Light.prototype = {
|
||||
position: null,
|
||||
color: null,
|
||||
intensity: 10.0,
|
||||
|
||||
initialize : function(pos, color, intensity) {
|
||||
this.position = pos;
|
||||
this.color = color;
|
||||
this.intensity = (intensity ? intensity : 10.0);
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Light [' + this.position.x + ',' + this.position.y + ',' + this.position.z + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Vector = Class.create();
|
||||
|
||||
Flog.RayTracer.Vector.prototype = {
|
||||
x : 0.0,
|
||||
y : 0.0,
|
||||
z : 0.0,
|
||||
|
||||
initialize : function(x, y, z) {
|
||||
this.x = (x ? x : 0);
|
||||
this.y = (y ? y : 0);
|
||||
this.z = (z ? z : 0);
|
||||
},
|
||||
|
||||
copy: function(vector){
|
||||
this.x = vector.x;
|
||||
this.y = vector.y;
|
||||
this.z = vector.z;
|
||||
},
|
||||
|
||||
normalize : function() {
|
||||
var m = this.magnitude();
|
||||
return new Flog.RayTracer.Vector(this.x / m, this.y / m, this.z / m);
|
||||
},
|
||||
|
||||
magnitude : function() {
|
||||
return Math.sqrt((this.x * this.x) + (this.y * this.y) + (this.z * this.z));
|
||||
},
|
||||
|
||||
cross : function(w) {
|
||||
return new Flog.RayTracer.Vector(
|
||||
-this.z * w.y + this.y * w.z,
|
||||
this.z * w.x - this.x * w.z,
|
||||
-this.y * w.x + this.x * w.y);
|
||||
},
|
||||
|
||||
dot : function(w) {
|
||||
return this.x * w.x + this.y * w.y + this.z * w.z;
|
||||
},
|
||||
|
||||
add : function(v, w) {
|
||||
return new Flog.RayTracer.Vector(w.x + v.x, w.y + v.y, w.z + v.z);
|
||||
},
|
||||
|
||||
subtract : function(v, w) {
|
||||
if(!w || !v) throw 'Vectors must be defined [' + v + ',' + w + ']';
|
||||
return new Flog.RayTracer.Vector(v.x - w.x, v.y - w.y, v.z - w.z);
|
||||
},
|
||||
|
||||
multiplyVector : function(v, w) {
|
||||
return new Flog.RayTracer.Vector(v.x * w.x, v.y * w.y, v.z * w.z);
|
||||
},
|
||||
|
||||
multiplyScalar : function(v, w) {
|
||||
return new Flog.RayTracer.Vector(v.x * w, v.y * w, v.z * w);
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Vector [' + this.x + ',' + this.y + ',' + this.z + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Ray = Class.create();
|
||||
|
||||
Flog.RayTracer.Ray.prototype = {
|
||||
position : null,
|
||||
direction : null,
|
||||
initialize : function(pos, dir) {
|
||||
this.position = pos;
|
||||
this.direction = dir;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Ray [' + this.position + ',' + this.direction + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Scene = Class.create();
|
||||
|
||||
Flog.RayTracer.Scene.prototype = {
|
||||
camera : null,
|
||||
shapes : [],
|
||||
lights : [],
|
||||
background : null,
|
||||
|
||||
initialize : function() {
|
||||
this.camera = new Flog.RayTracer.Camera(
|
||||
new Flog.RayTracer.Vector(0,0,-5),
|
||||
new Flog.RayTracer.Vector(0,0,1),
|
||||
new Flog.RayTracer.Vector(0,1,0)
|
||||
);
|
||||
this.shapes = new Array();
|
||||
this.lights = new Array();
|
||||
this.background = new Flog.RayTracer.Background(new Flog.RayTracer.Color(0,0,0.5), 0.2);
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
if(typeof(Flog.RayTracer.Material) == 'undefined') Flog.RayTracer.Material = {};
|
||||
|
||||
Flog.RayTracer.Material.BaseMaterial = Class.create();
|
||||
|
||||
Flog.RayTracer.Material.BaseMaterial.prototype = {
|
||||
|
||||
gloss: 2.0, // [0...infinity] 0 = matt
|
||||
transparency: 0.0, // 0=opaque
|
||||
reflection: 0.0, // [0...infinity] 0 = no reflection
|
||||
refraction: 0.50,
|
||||
hasTexture: false,
|
||||
|
||||
initialize : function() {
|
||||
|
||||
},
|
||||
|
||||
getColor: function(u, v){
|
||||
|
||||
},
|
||||
|
||||
wrapUp: function(t){
|
||||
t = t % 2.0;
|
||||
if(t < -1) t += 2.0;
|
||||
if(t >= 1) t -= 2.0;
|
||||
return t;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Material [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture +']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Material.Solid = Class.create();
|
||||
|
||||
Flog.RayTracer.Material.Solid.prototype = Object.extend(
|
||||
new Flog.RayTracer.Material.BaseMaterial(), {
|
||||
initialize : function(color, reflection, refraction, transparency, gloss) {
|
||||
this.color = color;
|
||||
this.reflection = reflection;
|
||||
this.transparency = transparency;
|
||||
this.gloss = gloss;
|
||||
this.hasTexture = false;
|
||||
},
|
||||
|
||||
getColor: function(u, v){
|
||||
return this.color;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'SolidMaterial [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture +']';
|
||||
}
|
||||
}
|
||||
);
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Material.Chessboard = Class.create();
|
||||
|
||||
Flog.RayTracer.Material.Chessboard.prototype = Object.extend(
|
||||
new Flog.RayTracer.Material.BaseMaterial(), {
|
||||
colorEven: null,
|
||||
colorOdd: null,
|
||||
density: 0.5,
|
||||
|
||||
initialize : function(colorEven, colorOdd, reflection, transparency, gloss, density) {
|
||||
this.colorEven = colorEven;
|
||||
this.colorOdd = colorOdd;
|
||||
this.reflection = reflection;
|
||||
this.transparency = transparency;
|
||||
this.gloss = gloss;
|
||||
this.density = density;
|
||||
this.hasTexture = true;
|
||||
},
|
||||
|
||||
getColor: function(u, v){
|
||||
var t = this.wrapUp(u * this.density) * this.wrapUp(v * this.density);
|
||||
|
||||
if(t < 0.0)
|
||||
return this.colorEven;
|
||||
else
|
||||
return this.colorOdd;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'ChessMaterial [gloss=' + this.gloss + ', transparency=' + this.transparency + ', hasTexture=' + this.hasTexture +']';
|
||||
}
|
||||
}
|
||||
);
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
if(typeof(Flog.RayTracer.Shape) == 'undefined') Flog.RayTracer.Shape = {};
|
||||
|
||||
Flog.RayTracer.Shape.Sphere = Class.create();
|
||||
|
||||
Flog.RayTracer.Shape.Sphere.prototype = {
|
||||
initialize : function(pos, radius, material) {
|
||||
this.radius = radius;
|
||||
this.position = pos;
|
||||
this.material = material;
|
||||
},
|
||||
|
||||
intersect: function(ray){
|
||||
var info = new Flog.RayTracer.IntersectionInfo();
|
||||
info.shape = this;
|
||||
|
||||
var dst = Flog.RayTracer.Vector.prototype.subtract(ray.position, this.position);
|
||||
|
||||
var B = dst.dot(ray.direction);
|
||||
var C = dst.dot(dst) - (this.radius * this.radius);
|
||||
var D = (B * B) - C;
|
||||
|
||||
if(D > 0){ // intersection!
|
||||
info.isHit = true;
|
||||
info.distance = (-B) - Math.sqrt(D);
|
||||
info.position = Flog.RayTracer.Vector.prototype.add(
|
||||
ray.position,
|
||||
Flog.RayTracer.Vector.prototype.multiplyScalar(
|
||||
ray.direction,
|
||||
info.distance
|
||||
)
|
||||
);
|
||||
info.normal = Flog.RayTracer.Vector.prototype.subtract(
|
||||
info.position,
|
||||
this.position
|
||||
).normalize();
|
||||
|
||||
info.color = this.material.getColor(0,0);
|
||||
} else {
|
||||
info.isHit = false;
|
||||
}
|
||||
return info;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Sphere [position=' + this.position + ', radius=' + this.radius + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
if(typeof(Flog.RayTracer.Shape) == 'undefined') Flog.RayTracer.Shape = {};
|
||||
|
||||
Flog.RayTracer.Shape.Plane = Class.create();
|
||||
|
||||
Flog.RayTracer.Shape.Plane.prototype = {
|
||||
d: 0.0,
|
||||
|
||||
initialize : function(pos, d, material) {
|
||||
this.position = pos;
|
||||
this.d = d;
|
||||
this.material = material;
|
||||
},
|
||||
|
||||
intersect: function(ray){
|
||||
var info = new Flog.RayTracer.IntersectionInfo();
|
||||
|
||||
var Vd = this.position.dot(ray.direction);
|
||||
if(Vd == 0) return info; // no intersection
|
||||
|
||||
var t = -(this.position.dot(ray.position) + this.d) / Vd;
|
||||
if(t <= 0) return info;
|
||||
|
||||
info.shape = this;
|
||||
info.isHit = true;
|
||||
info.position = Flog.RayTracer.Vector.prototype.add(
|
||||
ray.position,
|
||||
Flog.RayTracer.Vector.prototype.multiplyScalar(
|
||||
ray.direction,
|
||||
t
|
||||
)
|
||||
);
|
||||
info.normal = this.position;
|
||||
info.distance = t;
|
||||
|
||||
if(this.material.hasTexture){
|
||||
var vU = new Flog.RayTracer.Vector(this.position.y, this.position.z, -this.position.x);
|
||||
var vV = vU.cross(this.position);
|
||||
var u = info.position.dot(vU);
|
||||
var v = info.position.dot(vV);
|
||||
info.color = this.material.getColor(u,v);
|
||||
} else {
|
||||
info.color = this.material.getColor(0,0);
|
||||
}
|
||||
|
||||
return info;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Plane [' + this.position + ', d=' + this.d + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.IntersectionInfo = Class.create();
|
||||
|
||||
Flog.RayTracer.IntersectionInfo.prototype = {
|
||||
isHit: false,
|
||||
hitCount: 0,
|
||||
shape: null,
|
||||
position: null,
|
||||
normal: null,
|
||||
color: null,
|
||||
distance: null,
|
||||
|
||||
initialize : function() {
|
||||
this.color = new Flog.RayTracer.Color(0,0,0);
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Intersection [' + this.position + ']';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Camera = Class.create();
|
||||
|
||||
Flog.RayTracer.Camera.prototype = {
|
||||
position: null,
|
||||
lookAt: null,
|
||||
equator: null,
|
||||
up: null,
|
||||
screen: null,
|
||||
|
||||
initialize : function(pos, lookAt, up) {
|
||||
this.position = pos;
|
||||
this.lookAt = lookAt;
|
||||
this.up = up;
|
||||
this.equator = lookAt.normalize().cross(this.up);
|
||||
this.screen = Flog.RayTracer.Vector.prototype.add(this.position, this.lookAt);
|
||||
},
|
||||
|
||||
getRay: function(vx, vy){
|
||||
var pos = Flog.RayTracer.Vector.prototype.subtract(
|
||||
this.screen,
|
||||
Flog.RayTracer.Vector.prototype.subtract(
|
||||
Flog.RayTracer.Vector.prototype.multiplyScalar(this.equator, vx),
|
||||
Flog.RayTracer.Vector.prototype.multiplyScalar(this.up, vy)
|
||||
)
|
||||
);
|
||||
pos.y = pos.y * -1;
|
||||
var dir = Flog.RayTracer.Vector.prototype.subtract(
|
||||
pos,
|
||||
this.position
|
||||
);
|
||||
|
||||
var ray = new Flog.RayTracer.Ray(pos, dir.normalize());
|
||||
|
||||
return ray;
|
||||
},
|
||||
|
||||
toString : function () {
|
||||
return 'Ray []';
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Background = Class.create();
|
||||
|
||||
Flog.RayTracer.Background.prototype = {
|
||||
color : null,
|
||||
ambience : 0.0,
|
||||
|
||||
initialize : function(color, ambience) {
|
||||
this.color = color;
|
||||
this.ambience = ambience;
|
||||
}
|
||||
}
|
||||
/* Fake a Flog.* namespace */
|
||||
if(typeof(Flog) == 'undefined') var Flog = {};
|
||||
if(typeof(Flog.RayTracer) == 'undefined') Flog.RayTracer = {};
|
||||
|
||||
Flog.RayTracer.Engine = Class.create();
|
||||
|
||||
Flog.RayTracer.Engine.prototype = {
|
||||
canvas: null, /* 2d context we can render to */
|
||||
|
||||
initialize: function(options){
|
||||
this.options = Object.extend({
|
||||
canvasHeight: 100,
|
||||
canvasWidth: 100,
|
||||
pixelWidth: 2,
|
||||
pixelHeight: 2,
|
||||
renderDiffuse: false,
|
||||
renderShadows: false,
|
||||
renderHighlights: false,
|
||||
renderReflections: false,
|
||||
rayDepth: 2
|
||||
}, options || {});
|
||||
|
||||
this.options.canvasHeight /= this.options.pixelHeight;
|
||||
this.options.canvasWidth /= this.options.pixelWidth;
|
||||
|
||||
/* TODO: dynamically include other scripts */
|
||||
},
|
||||
|
||||
setPixel: function(x, y, color){
|
||||
var pxW, pxH;
|
||||
pxW = this.options.pixelWidth;
|
||||
pxH = this.options.pixelHeight;
|
||||
|
||||
if (this.canvas) {
|
||||
this.canvas.fillStyle = color.toString();
|
||||
this.canvas.fillRect (x * pxW, y * pxH, pxW, pxH);
|
||||
} else {
|
||||
if (x === y) {
|
||||
checkNumber += color.brightness();
|
||||
}
|
||||
// print(x * pxW, y * pxH, pxW, pxH);
|
||||
}
|
||||
},
|
||||
|
||||
renderScene: function(scene, canvas){
|
||||
checkNumber = 0;
|
||||
/* Get canvas */
|
||||
if (canvas) {
|
||||
this.canvas = canvas.getContext("2d");
|
||||
} else {
|
||||
this.canvas = null;
|
||||
}
|
||||
|
||||
var canvasHeight = this.options.canvasHeight;
|
||||
var canvasWidth = this.options.canvasWidth;
|
||||
|
||||
for(var y=0; y < canvasHeight; y++){
|
||||
for(var x=0; x < canvasWidth; x++){
|
||||
var yp = y * 1.0 / canvasHeight * 2 - 1;
|
||||
var xp = x * 1.0 / canvasWidth * 2 - 1;
|
||||
|
||||
var ray = scene.camera.getRay(xp, yp);
|
||||
|
||||
var color = this.getPixelColor(ray, scene);
|
||||
|
||||
this.setPixel(x, y, color);
|
||||
}
|
||||
}
|
||||
if (checkNumber !== 2321) {
|
||||
throw new Error("Scene rendered incorrectly");
|
||||
}
|
||||
},
|
||||
|
||||
getPixelColor: function(ray, scene){
|
||||
var info = this.testIntersection(ray, scene, null);
|
||||
if(info.isHit){
|
||||
var color = this.rayTrace(info, ray, scene, 0);
|
||||
return color;
|
||||
}
|
||||
return scene.background.color;
|
||||
},
|
||||
|
||||
testIntersection: function(ray, scene, exclude){
|
||||
var hits = 0;
|
||||
var best = new Flog.RayTracer.IntersectionInfo();
|
||||
best.distance = 2000;
|
||||
|
||||
for(var i=0; i<scene.shapes.length; i++){
|
||||
var shape = scene.shapes[i];
|
||||
|
||||
if(shape != exclude){
|
||||
var info = shape.intersect(ray);
|
||||
if(info.isHit && info.distance >= 0 && info.distance < best.distance){
|
||||
best = info;
|
||||
hits++;
|
||||
}
|
||||
}
|
||||
}
|
||||
best.hitCount = hits;
|
||||
return best;
|
||||
},
|
||||
|
||||
getReflectionRay: function(P,N,V){
|
||||
var c1 = -N.dot(V);
|
||||
var R1 = Flog.RayTracer.Vector.prototype.add(
|
||||
Flog.RayTracer.Vector.prototype.multiplyScalar(N, 2*c1),
|
||||
V
|
||||
);
|
||||
return new Flog.RayTracer.Ray(P, R1);
|
||||
},
|
||||
|
||||
rayTrace: function(info, ray, scene, depth){
|
||||
// Calc ambient
|
||||
var color = Flog.RayTracer.Color.prototype.multiplyScalar(info.color, scene.background.ambience);
|
||||
var oldColor = color;
|
||||
var shininess = Math.pow(10, info.shape.material.gloss + 1);
|
||||
|
||||
for(var i=0; i<scene.lights.length; i++){
|
||||
var light = scene.lights[i];
|
||||
|
||||
// Calc diffuse lighting
|
||||
var v = Flog.RayTracer.Vector.prototype.subtract(
|
||||
light.position,
|
||||
info.position
|
||||
).normalize();
|
||||
|
||||
if(this.options.renderDiffuse){
|
||||
var L = v.dot(info.normal);
|
||||
if(L > 0.0){
|
||||
color = Flog.RayTracer.Color.prototype.add(
|
||||
color,
|
||||
Flog.RayTracer.Color.prototype.multiply(
|
||||
info.color,
|
||||
Flog.RayTracer.Color.prototype.multiplyScalar(
|
||||
light.color,
|
||||
L
|
||||
)
|
||||
)
|
||||
);
|
||||
}
|
||||
}
|
||||
|
||||
// The greater the depth the more accurate the colours, but
|
||||
// this is exponentially (!) expensive
|
||||
if(depth <= this.options.rayDepth){
|
||||
// calculate reflection ray
|
||||
if(this.options.renderReflections && info.shape.material.reflection > 0)
|
||||
{
|
||||
var reflectionRay = this.getReflectionRay(info.position, info.normal, ray.direction);
|
||||
var refl = this.testIntersection(reflectionRay, scene, info.shape);
|
||||
|
||||
if (refl.isHit && refl.distance > 0){
|
||||
refl.color = this.rayTrace(refl, reflectionRay, scene, depth + 1);
|
||||
} else {
|
||||
refl.color = scene.background.color;
|
||||
}
|
||||
|
||||
color = Flog.RayTracer.Color.prototype.blend(
|
||||
color,
|
||||
refl.color,
|
||||
info.shape.material.reflection
|
||||
);
|
||||
}
|
||||
|
||||
// Refraction
|
||||
/* TODO */
|
||||
}
|
||||
|
||||
/* Render shadows and highlights */
|
||||
|
||||
var shadowInfo = new Flog.RayTracer.IntersectionInfo();
|
||||
|
||||
if(this.options.renderShadows){
|
||||
var shadowRay = new Flog.RayTracer.Ray(info.position, v);
|
||||
|
||||
shadowInfo = this.testIntersection(shadowRay, scene, info.shape);
|
||||
if(shadowInfo.isHit && shadowInfo.shape != info.shape /*&& shadowInfo.shape.type != 'PLANE'*/){
|
||||
var vA = Flog.RayTracer.Color.prototype.multiplyScalar(color, 0.5);
|
||||
var dB = (0.5 * Math.pow(shadowInfo.shape.material.transparency, 0.5));
|
||||
color = Flog.RayTracer.Color.prototype.addScalar(vA,dB);
|
||||
}
|
||||
}
|
||||
|
||||
// Phong specular highlights
|
||||
if(this.options.renderHighlights && !shadowInfo.isHit && info.shape.material.gloss > 0){
|
||||
var Lv = Flog.RayTracer.Vector.prototype.subtract(
|
||||
info.shape.position,
|
||||
light.position
|
||||
).normalize();
|
||||
|
||||
var E = Flog.RayTracer.Vector.prototype.subtract(
|
||||
scene.camera.position,
|
||||
info.shape.position
|
||||
).normalize();
|
||||
|
||||
var H = Flog.RayTracer.Vector.prototype.subtract(
|
||||
E,
|
||||
Lv
|
||||
).normalize();
|
||||
|
||||
var glossWeight = Math.pow(Math.max(info.normal.dot(H), 0), shininess);
|
||||
color = Flog.RayTracer.Color.prototype.add(
|
||||
Flog.RayTracer.Color.prototype.multiplyScalar(light.color, glossWeight),
|
||||
color
|
||||
);
|
||||
}
|
||||
}
|
||||
color.limit();
|
||||
return color;
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
function renderScene(){
|
||||
var scene = new Flog.RayTracer.Scene();
|
||||
|
||||
scene.camera = new Flog.RayTracer.Camera(
|
||||
new Flog.RayTracer.Vector(0, 0, -15),
|
||||
new Flog.RayTracer.Vector(-0.2, 0, 5),
|
||||
new Flog.RayTracer.Vector(0, 1, 0)
|
||||
);
|
||||
|
||||
scene.background = new Flog.RayTracer.Background(
|
||||
new Flog.RayTracer.Color(0.5, 0.5, 0.5),
|
||||
0.4
|
||||
);
|
||||
|
||||
var sphere = new Flog.RayTracer.Shape.Sphere(
|
||||
new Flog.RayTracer.Vector(-1.5, 1.5, 2),
|
||||
1.5,
|
||||
new Flog.RayTracer.Material.Solid(
|
||||
new Flog.RayTracer.Color(0,0.5,0.5),
|
||||
0.3,
|
||||
0.0,
|
||||
0.0,
|
||||
2.0
|
||||
)
|
||||
);
|
||||
|
||||
var sphere1 = new Flog.RayTracer.Shape.Sphere(
|
||||
new Flog.RayTracer.Vector(1, 0.25, 1),
|
||||
0.5,
|
||||
new Flog.RayTracer.Material.Solid(
|
||||
new Flog.RayTracer.Color(0.9,0.9,0.9),
|
||||
0.1,
|
||||
0.0,
|
||||
0.0,
|
||||
1.5
|
||||
)
|
||||
);
|
||||
|
||||
var plane = new Flog.RayTracer.Shape.Plane(
|
||||
new Flog.RayTracer.Vector(0.1, 0.9, -0.5).normalize(),
|
||||
1.2,
|
||||
new Flog.RayTracer.Material.Chessboard(
|
||||
new Flog.RayTracer.Color(1,1,1),
|
||||
new Flog.RayTracer.Color(0,0,0),
|
||||
0.2,
|
||||
0.0,
|
||||
1.0,
|
||||
0.7
|
||||
)
|
||||
);
|
||||
|
||||
scene.shapes.push(plane);
|
||||
scene.shapes.push(sphere);
|
||||
scene.shapes.push(sphere1);
|
||||
|
||||
var light = new Flog.RayTracer.Light(
|
||||
new Flog.RayTracer.Vector(5, 10, -1),
|
||||
new Flog.RayTracer.Color(0.8, 0.8, 0.8)
|
||||
);
|
||||
|
||||
var light1 = new Flog.RayTracer.Light(
|
||||
new Flog.RayTracer.Vector(-3, 5, -15),
|
||||
new Flog.RayTracer.Color(0.8, 0.8, 0.8),
|
||||
100
|
||||
);
|
||||
|
||||
scene.lights.push(light);
|
||||
scene.lights.push(light1);
|
||||
|
||||
var imageWidth = 100; // $F('imageWidth');
|
||||
var imageHeight = 100; // $F('imageHeight');
|
||||
var pixelSize = "5,5".split(','); // $F('pixelSize').split(',');
|
||||
var renderDiffuse = true; // $F('renderDiffuse');
|
||||
var renderShadows = true; // $F('renderShadows');
|
||||
var renderHighlights = true; // $F('renderHighlights');
|
||||
var renderReflections = true; // $F('renderReflections');
|
||||
var rayDepth = 2;//$F('rayDepth');
|
||||
|
||||
var raytracer = new Flog.RayTracer.Engine(
|
||||
{
|
||||
canvasWidth: imageWidth,
|
||||
canvasHeight: imageHeight,
|
||||
pixelWidth: pixelSize[0],
|
||||
pixelHeight: pixelSize[1],
|
||||
"renderDiffuse": renderDiffuse,
|
||||
"renderHighlights": renderHighlights,
|
||||
"renderShadows": renderShadows,
|
||||
"renderReflections": renderReflections,
|
||||
"rayDepth": rayDepth
|
||||
}
|
||||
);
|
||||
|
||||
raytracer.renderScene(scene, null, 0);
|
||||
}
|
||||
|
||||
for (var i = 0; i < 6; ++i)
|
||||
renderScene();
|
||||
|
|
@ -1,78 +0,0 @@
|
|||
load("./driver/driver.js");
|
||||
|
||||
function hasDifferentSizeNodes(nodes) {
|
||||
let seenSize = nodes[0].size;
|
||||
for (let node of nodes) {
|
||||
if (node.size !== seenSize)
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
function hasAllInternalNodes(nodes) {
|
||||
for (let node of nodes) {
|
||||
if (!node.internal)
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
function sorted(nodes) {
|
||||
return nodes.sort((a, b) => a.id - b.id);
|
||||
}
|
||||
|
||||
let simpleObject1NodeId;
|
||||
let simpleObject2NodeId;
|
||||
|
||||
(function() {
|
||||
let snapshot = createCheapHeapSnapshot();
|
||||
assert(snapshot.nodesWithClassName("global").length === 1, "Snapshot should contain a single 'global' node");
|
||||
assert(snapshot.nodesWithClassName("Structure").length > 0, "Snapshot should contain 'Structure' nodes");
|
||||
assert(snapshot.nodesWithClassName("ThisClassNameDoesNotExist").length === 0, "Snapshot should not contain 'ThisClassNameDoesNotExist' nodes");
|
||||
|
||||
let strings = snapshot.nodesWithClassName("string");
|
||||
assert(strings.length > 0, "Snapshot should contain 'string' nodes");
|
||||
assert(hasDifferentSizeNodes(strings), "'string' nodes should have different sizes");
|
||||
|
||||
let nativeExecutables = snapshot.nodesWithClassName("NativeExecutable");
|
||||
assert(nativeExecutables.length > 0, "Snapshot should contain 'NativeExecutable' nodes");
|
||||
assert(!hasDifferentSizeNodes(nativeExecutables), "'NativeExecutable' nodes should all be the same size");
|
||||
assert(hasAllInternalNodes(nativeExecutables), "'NativeExecutable' nodes should all be internal");
|
||||
|
||||
assert(snapshot.nodesWithClassName("SimpleObject").length === 0, "Snapshot should not contain a 'SimpleObject' instance");
|
||||
})();
|
||||
|
||||
let simpleObject1 = new SimpleObject;
|
||||
|
||||
(function() {
|
||||
let snapshot = createCheapHeapSnapshot();
|
||||
let nodes = sorted(snapshot.nodesWithClassName("SimpleObject"));
|
||||
let [simpleObject1Node] = nodes;
|
||||
simpleObject1NodeId = nodes[0].id;
|
||||
assert(nodes.length === 1, "Snapshot should contain 1 'SimpleObject' instance");
|
||||
assert(simpleObject1Node.outgoingEdges.length === 1, "'simpleObject1' should only reference its structure");
|
||||
assert(simpleObject1Node.outgoingEdges[0].to.className === "Structure", "'simpleObject1' should reference a Structure");
|
||||
})();
|
||||
|
||||
let simpleObjectList = [];
|
||||
for (let i = 0; i < 1234; ++i)
|
||||
simpleObjectList.push(new SimpleObject);
|
||||
|
||||
(function() {
|
||||
let snapshot = createCheapHeapSnapshot();
|
||||
let nodes = sorted(snapshot.nodesWithClassName("SimpleObject"));
|
||||
simpleObject1NodeId = nodes[0].id;
|
||||
simpleObject2NodeId = nodes[1].id;
|
||||
assert(nodes.length === 1235, "Snapshot should contain 1235 'SimpleObject' instances");
|
||||
assert(nodes[0].id === simpleObject1NodeId, "'simpleObject1' should maintain the same identifier");
|
||||
assert(simpleObject1NodeId < simpleObject2NodeId, "node identifiers should always increase across snapshots");
|
||||
})();
|
||||
|
||||
simpleObject1 = null;
|
||||
simpleObjectList.fill(null);
|
||||
|
||||
(function() {
|
||||
let snapshot = createCheapHeapSnapshot();
|
||||
let nodes = snapshot.nodesWithClassName("SimpleObject");
|
||||
assert(nodes.length === 0, "Snapshot should not contain a 'SimpleObject' instance");
|
||||
})();
|
||||
|
|
@ -1,280 +0,0 @@
|
|||
function assert(condition, reason) {
|
||||
if (!condition)
|
||||
throw new Error(reason);
|
||||
}
|
||||
|
||||
// -----------------
|
||||
// CheapHeapSnapshot
|
||||
//
|
||||
// Contains two large lists of all node data and all edge data.
|
||||
// Lazily creates node and edge objects off of indexes into these lists.
|
||||
|
||||
// [<0:id>, <1:size>, <2:classNameTableIndex>, <3:internal>, <4:firstEdgeIndex>];
|
||||
const nodeFieldCount = 5;
|
||||
const nodeIdOffset = 0;
|
||||
const nodeSizeOffset = 1;
|
||||
const nodeClassNameOffset = 2;
|
||||
const nodeInternalOffset = 3;
|
||||
const nodeFirstEdgeOffset = 4;
|
||||
const nodeNoEdgeValue = 0xffffffff; // UINT_MAX
|
||||
|
||||
// [<0:fromId>, <1:toId>, <2:typeTableIndex>, <3:edgeDataIndexOrEdgeNameIndex>]
|
||||
const edgeFieldCount = 4;
|
||||
const edgeFromIdOffset = 0;
|
||||
const edgeToIdOffset = 1;
|
||||
const edgeTypeOffset = 2;
|
||||
const edgeDataOffset = 3;
|
||||
|
||||
CheapHeapSnapshotNode = class CheapHeapSnapshotNode
|
||||
{
|
||||
constructor(snapshot, nodeIndex)
|
||||
{
|
||||
assert((nodeIndex % nodeFieldCount) === 0, "Bad Node Index: " + nodeIndex);
|
||||
|
||||
let nodes = snapshot.nodes;
|
||||
this.id = nodes[nodeIndex + nodeIdOffset];
|
||||
this.size = nodes[nodeIndex + nodeSizeOffset];
|
||||
this.className = snapshot.classNameFromTableIndex(nodes[nodeIndex + nodeClassNameOffset]);
|
||||
this.internal = nodes[nodeIndex + nodeInternalOffset] ? true : false;
|
||||
|
||||
this.outgoingEdges = [];
|
||||
let firstEdgeIndex = nodes[nodeIndex + nodeFirstEdgeOffset];
|
||||
if (firstEdgeIndex !== nodeNoEdgeValue) {
|
||||
for (let i = firstEdgeIndex; i < snapshot.edges.length; i += edgeFieldCount) {
|
||||
if (snapshot.edges[i + edgeFromIdOffset] !== this.id)
|
||||
break;
|
||||
this.outgoingEdges.push(new CheapHeapSnapshotEdge(snapshot, i));
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
CheapHeapSnapshotEdge = class CheapHeapSnapshotEdge
|
||||
{
|
||||
constructor(snapshot, edgeIndex)
|
||||
{
|
||||
assert((edgeIndex % edgeFieldCount) === 0, "Bad Edge Index: " + edgeIndex);
|
||||
this.snapshot = snapshot;
|
||||
|
||||
let edges = snapshot.edges;
|
||||
this.fromId = edges[edgeIndex + edgeFromIdOffset];
|
||||
this.toId = edges[edgeIndex + edgeToIdOffset];
|
||||
this.type = snapshot.edgeTypeFromTableIndex(edges[edgeIndex + edgeTypeOffset]);
|
||||
|
||||
if (this.type === "Property" || this.type === "Variable")
|
||||
this.data = snapshot.edgeNameFromTableIndex(edges[edgeIndex + edgeDataOffset]);
|
||||
else
|
||||
this.data = edges[edgeIndex + edgeDataOffset];
|
||||
}
|
||||
|
||||
get from() { return this.snapshot.nodeWithIdentifier(this.fromId); }
|
||||
get to() { return this.snapshot.nodeWithIdentifier(this.toId); }
|
||||
}
|
||||
|
||||
CheapHeapSnapshot = class CheapHeapSnapshot
|
||||
{
|
||||
constructor(json)
|
||||
{
|
||||
let {nodes, nodeClassNames, edges, edgeTypes, edgeNames} = json;
|
||||
|
||||
this._nodes = new Uint32Array(nodes.length * nodeFieldCount);
|
||||
this._edges = new Uint32Array(edges.length * edgeFieldCount);
|
||||
this._nodeIdentifierToIndex = new Map; // <id> => index in _nodes
|
||||
|
||||
this._edgeTypesTable = edgeTypes;
|
||||
this._edgeNamesTable = edgeNames;
|
||||
this._nodeClassNamesTable = nodeClassNames;
|
||||
|
||||
let n = 0;
|
||||
for (let i = 0; i < nodes.length;) {
|
||||
this._nodeIdentifierToIndex.set(nodes[i], n);
|
||||
this._nodes[n++] = nodes[i++]; // id
|
||||
this._nodes[n++] = nodes[i++]; // size
|
||||
this._nodes[n++] = nodes[i++]; // classNameTableIndex
|
||||
this._nodes[n++] = nodes[i++]; // internal
|
||||
this._nodes[n++] = nodeNoEdgeValue;
|
||||
}
|
||||
|
||||
let e = 0;
|
||||
let lastNodeIdentifier = -1;
|
||||
for (let i = 0; i < edges.length;) {
|
||||
let fromIdentifier = edges[i++]; // fromIdentifier
|
||||
let toIdentifier = edges[i++]; // toIdentifier
|
||||
assert(lastNodeIdentifier <= fromIdentifier, "Edge list should be ordered by from node identifier");
|
||||
if (fromIdentifier !== lastNodeIdentifier) {
|
||||
let nodeIndex = this._nodeIdentifierToIndex.get(fromIdentifier);
|
||||
assert(this._nodes[nodeIndex + nodeIdOffset] === fromIdentifier, "Node lookup failed");
|
||||
this._nodes[nodeIndex + nodeFirstEdgeOffset] = e;
|
||||
lastNodeIdentifier = fromIdentifier;
|
||||
}
|
||||
|
||||
this._edges[e++] = fromIdentifier;
|
||||
this._edges[e++] = toIdentifier;
|
||||
this._edges[e++] = edges[i++]; // edgeTypeTableIndex
|
||||
this._edges[e++] = edges[i++]; // data
|
||||
}
|
||||
}
|
||||
|
||||
get nodes() { return this._nodes; }
|
||||
get edges() { return this._edges; }
|
||||
|
||||
nodeWithIdentifier(id)
|
||||
{
|
||||
return new CheapHeapSnapshotNode(this, this._nodeIdentifierToIndex.get(id));
|
||||
}
|
||||
|
||||
nodesWithClassName(className)
|
||||
{
|
||||
let result = [];
|
||||
for (let i = 0; i < this._nodes.length; i += nodeFieldCount) {
|
||||
let classNameTableIndex = this._nodes[i + nodeClassNameOffset];
|
||||
if (this.classNameFromTableIndex(classNameTableIndex) === className)
|
||||
result.push(new CheapHeapSnapshotNode(this, i));
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
classNameFromTableIndex(tableIndex)
|
||||
{
|
||||
return this._nodeClassNamesTable[tableIndex];
|
||||
}
|
||||
|
||||
edgeTypeFromTableIndex(tableIndex)
|
||||
{
|
||||
return this._edgeTypesTable[tableIndex];
|
||||
}
|
||||
|
||||
edgeNameFromTableIndex(tableIndex)
|
||||
{
|
||||
return this._edgeNamesTable[tableIndex];
|
||||
}
|
||||
}
|
||||
|
||||
function createCheapHeapSnapshot() {
|
||||
let json = generateHeapSnapshot();
|
||||
|
||||
let {version, nodes, nodeClassNames, edges, edgeTypes} = json;
|
||||
assert(version === 1, "Heap Snapshot payload should be version 1");
|
||||
assert(nodes.length, "Heap Snapshot should have nodes");
|
||||
assert(nodeClassNames.length, "Heap Snapshot should have nodeClassNames");
|
||||
assert(edges.length, "Heap Snapshot should have edges");
|
||||
assert(edgeTypes.length, "Heap Snapshot should have edgeTypes");
|
||||
|
||||
return new CheapHeapSnapshot(json);
|
||||
}
|
||||
|
||||
|
||||
// ------------
|
||||
// HeapSnapshot
|
||||
//
|
||||
// This creates a lot of objects that make it easy to walk the entire node graph
|
||||
// (incoming and outgoing edges). However when a test creates multiple snapshots
|
||||
// with snapshots in scope this can quickly explode into a snapshot with a massive
|
||||
// number of nodes/edges. For such cases create CheapHeapSnapshots, which create
|
||||
// a very small number of objects per Heap Snapshot.
|
||||
|
||||
HeapSnapshotNode = class HeapSnapshotNode
|
||||
{
|
||||
constructor(id, className, size, internal)
|
||||
{
|
||||
this.id = id;
|
||||
this.className = className;
|
||||
this.size = size;
|
||||
this.internal = internal;
|
||||
this.incomingEdges = [];
|
||||
this.outgoingEdges = [];
|
||||
}
|
||||
}
|
||||
|
||||
HeapSnapshotEdge = class HeapSnapshotEdge
|
||||
{
|
||||
constructor(from, to, type, data)
|
||||
{
|
||||
this.from = from;
|
||||
this.to = to;
|
||||
this.type = type;
|
||||
this.data = data;
|
||||
}
|
||||
}
|
||||
|
||||
HeapSnapshot = class HeapSnapshot
|
||||
{
|
||||
constructor(json)
|
||||
{
|
||||
let {version, nodes, nodeClassNames, edges, edgeTypes, edgeNames} = json;
|
||||
|
||||
this.nodeMap = new Map;
|
||||
|
||||
this.nodes = [];
|
||||
for (let i = 0; i < nodes.length;) {
|
||||
let id = nodes[i++];
|
||||
let size = nodes[i++];
|
||||
let classNameIndex = nodes[i++];
|
||||
let internal = nodes[i++];
|
||||
|
||||
let node = new HeapSnapshotNode(id, nodeClassNames[classNameIndex], size, internal);
|
||||
this.nodeMap.set(id, node);
|
||||
this.nodes.push(node);
|
||||
}
|
||||
|
||||
for (let i = 0; i < edges.length;) {
|
||||
let fromIdentifier = edges[i++];
|
||||
let toIdentifier = edges[i++];
|
||||
let edgeTypeIndex = edges[i++];
|
||||
let data = edges[i++];
|
||||
|
||||
let from = this.nodeMap.get(fromIdentifier);
|
||||
let to = this.nodeMap.get(toIdentifier);
|
||||
assert(from, "Missing node for `from` part of edge");
|
||||
assert(to, "Missing node for `to` part of edge");
|
||||
let type = edgeTypes[edgeTypeIndex];
|
||||
if (type === "Property" || type === "Variable")
|
||||
data = edgeNames[data];
|
||||
let edge = new HeapSnapshotEdge(from, to, edgeTypes[edgeTypeIndex], data);
|
||||
from.outgoingEdges.push(edge);
|
||||
to.incomingEdges.push(edge);
|
||||
}
|
||||
|
||||
this.rootNode = this.nodeMap.get(0);
|
||||
assert(this.rootNode, "Missing <root> node with identifier 0");
|
||||
assert(this.rootNode.outgoingEdges.length > 0, "<root> should have children");
|
||||
assert(this.rootNode.incomingEdges.length === 0, "<root> should not have back references");
|
||||
}
|
||||
|
||||
nodesWithClassName(className)
|
||||
{
|
||||
let result = [];
|
||||
for (let node of this.nodes) {
|
||||
if (node.className === className)
|
||||
result.push(node);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
function createHeapSnapshot() {
|
||||
let json = generateHeapSnapshot();
|
||||
|
||||
let {version, nodes, nodeClassNames, edges, edgeTypes} = json;
|
||||
assert(version === 1, "Heap Snapshot payload should be version 1");
|
||||
assert(nodes.length, "Heap Snapshot should have nodes");
|
||||
assert(nodeClassNames.length, "Heap Snapshot should have nodeClassNames");
|
||||
assert(edges.length, "Heap Snapshot should have edges");
|
||||
assert(edgeTypes.length, "Heap Snapshot should have edgeTypes");
|
||||
|
||||
return new HeapSnapshot(json);
|
||||
}
|
||||
|
||||
function followPath(node, path) {
|
||||
let current = node;
|
||||
for (let component of path) {
|
||||
let edges = null;
|
||||
if (component.edge)
|
||||
edges = current.outgoingEdges.filter((e) => e.data === component.edge);
|
||||
else if (component.node)
|
||||
edges = current.outgoingEdges.filter((e) => e.to.className === component.node);
|
||||
assert(edges.length === 1, "Ambiguous or bad path component: " + JSON.stringify(component));
|
||||
current = edges[0].to;
|
||||
}
|
||||
return current;
|
||||
}
|
||||
|
|
@ -1,28 +0,0 @@
|
|||
load("./driver/driver.js");
|
||||
|
||||
(function() {
|
||||
const bufferBytes = 4 * 2000;
|
||||
const typedArraySize = 1000;
|
||||
const typedArrayBytes = 4 * typedArraySize;
|
||||
assert(typedArrayBytes < bufferBytes, "Sizes should be different");
|
||||
|
||||
let buffer = new ArrayBuffer(bufferBytes);
|
||||
let view = new Float32Array(buffer);
|
||||
let typedArray = new Uint32Array(typedArraySize);
|
||||
|
||||
let snapshot = createCheapHeapSnapshot();
|
||||
|
||||
let arrayBufferNodes = snapshot.nodesWithClassName("ArrayBuffer");
|
||||
let viewNodes = snapshot.nodesWithClassName("Float32Array");
|
||||
let typedArrayNodes = snapshot.nodesWithClassName("Uint32Array");
|
||||
assert(arrayBufferNodes.length === 1, "Snapshot should contain 1 'ArrayBuffer' instance");
|
||||
assert(viewNodes.length === 1, "Snapshot should contain 1 'Float32Array' instance");
|
||||
assert(typedArrayNodes.length === 1, "Snapshot should contain 1 'Uint32Array' instance");
|
||||
|
||||
let arrayBufferNode = arrayBufferNodes[0];
|
||||
let viewNode = viewNodes[0];
|
||||
let typedArrayNode = typedArrayNodes[0];
|
||||
assert(arrayBufferNode.size >= bufferBytes, "ArrayBuffer node should have a large size");
|
||||
assert(viewNode.size <= 100, "Float32Array node should have a very small size, it just wraps the already large ArrayBuffer");
|
||||
assert(typedArrayNode.size >= typedArrayBytes && typedArrayNode.size < bufferBytes, "Uint32Array node should have a large size, but not as large as the ArrayBuffer");
|
||||
})();
|
||||
|
|
@ -1,69 +0,0 @@
|
|||
load("./driver/driver.js");
|
||||
|
||||
let globalScopeVariable = "globalScopeVariableValue";
|
||||
let simpleObject = new SimpleObject;
|
||||
|
||||
(function() {
|
||||
let closureVariable = {};
|
||||
simpleObject.f = function() { closureVariable.x = 0; }
|
||||
})();
|
||||
|
||||
// ----------
|
||||
|
||||
let snapshot = createHeapSnapshot();
|
||||
|
||||
// Global Scope => "globalScopeVariable"
|
||||
let nodes = snapshot.nodesWithClassName("JSGlobalLexicalEnvironment");
|
||||
assert(nodes.length === 1, "Should be only 1 'JSGlobalLexicalEnvironment' instance");
|
||||
let globalScopeNode = nodes[0];
|
||||
|
||||
let seenGlobalScopeVariable = false;
|
||||
let seenSimpleObjectVariable = false;
|
||||
|
||||
for (let edge of globalScopeNode.outgoingEdges) {
|
||||
switch (edge.type) {
|
||||
case "Variable":
|
||||
if (edge.data === "globalScopeVariable")
|
||||
seenGlobalScopeVariable = true;
|
||||
else if (edge.data === "simpleObject")
|
||||
seenSimpleObjectVariable = true;
|
||||
else
|
||||
assert(false, "Unexpected variable name: " + edge.data);
|
||||
break;
|
||||
case "Index":
|
||||
case "Property":
|
||||
assert(false, "Unexpected edge type");
|
||||
break;
|
||||
case "Internal":
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
assert(seenGlobalScopeVariable, "Should see Variable edge for variable 'globalScopeVariable'");
|
||||
assert(seenSimpleObjectVariable, "Should see Variable edge for variable 'simpleObject'");
|
||||
|
||||
// Function Scope => "closureVariable"
|
||||
nodes = snapshot.nodesWithClassName("SimpleObject");
|
||||
assert(nodes.length === 1, "Should be only 1 'SimpleObject' instance");
|
||||
let scopeNode = followPath(nodes[0], [{edge: "f"}, {node: "JSLexicalEnvironment"}]);
|
||||
|
||||
let seenClosureVariable = false;
|
||||
|
||||
for (let edge of scopeNode.outgoingEdges) {
|
||||
switch (edge.type) {
|
||||
case "Variable":
|
||||
if (edge.data === "closureVariable")
|
||||
seenClosureVariable = true;
|
||||
else
|
||||
assert(false, "Unexpected variable name: " + edge.data);
|
||||
break;
|
||||
case "Index":
|
||||
case "Property":
|
||||
assert(false, "Unexpected edge type");
|
||||
break;
|
||||
case "Internal":
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
assert(seenClosureVariable, "Should see Variable edge for closure variable 'closureVariable'");
|
||||
|
|
@ -1,6 +0,0 @@
|
|||
(function () {
|
||||
for (var i = 0; i < 500; ++i) {
|
||||
for (var j = 0; j < 100000; ++j)
|
||||
var a = {};
|
||||
}
|
||||
})();
|
||||
|
|
@ -1,10 +0,0 @@
|
|||
(function () {
|
||||
var a = new Array(100000);
|
||||
for (var i = 0; i < 100000; ++i)
|
||||
a[i] = {};
|
||||
|
||||
for (var i = 0; i < 500; ++i) {
|
||||
for (var j = 0; j < 100000; ++j)
|
||||
var b = {};
|
||||
}
|
||||
})();
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,6 +0,0 @@
|
|||
This directory contains tests that were once found in JSTests/microbenchmarks, but were pulled from there
|
||||
because they are too slow to run regularly. Now they run only for JSC testing, and only with
|
||||
defaultQuickRun.
|
||||
|
||||
Only move benchmarks back into JSTests/microbenchmarks if you get them to run in under 100ms on a modern
|
||||
Mac.
|
||||
|
|
@ -1,9 +0,0 @@
|
|||
function arrayPush3() {
|
||||
var ret = [1];
|
||||
ret.push(1, 2, 3);
|
||||
return ret;
|
||||
}
|
||||
noInline(arrayPush3);
|
||||
|
||||
for (var i = 0; i < 1e7; ++i)
|
||||
arrayPush3();
|
||||
|
|
@ -1,279 +0,0 @@
|
|||
var thing0 = Symbol();
|
||||
var thing1 = Symbol();
|
||||
var thing2 = Symbol();
|
||||
var thing3 = Symbol();
|
||||
var thing4 = Symbol();
|
||||
var thing5 = Symbol();
|
||||
var thing6 = Symbol();
|
||||
var thing7 = Symbol();
|
||||
var thing8 = Symbol();
|
||||
var thing9 = Symbol();
|
||||
var thing10 = Symbol();
|
||||
var thing11 = Symbol();
|
||||
var thing12 = Symbol();
|
||||
var thing13 = Symbol();
|
||||
var thing14 = Symbol();
|
||||
var thing15 = Symbol();
|
||||
var thing16 = Symbol();
|
||||
var thing17 = Symbol();
|
||||
var thing18 = Symbol();
|
||||
var thing19 = Symbol();
|
||||
var thing20 = Symbol();
|
||||
var thing21 = Symbol();
|
||||
var thing22 = Symbol();
|
||||
var thing23 = Symbol();
|
||||
var thing24 = Symbol();
|
||||
var thing25 = Symbol();
|
||||
var thing26 = Symbol();
|
||||
var thing27 = Symbol();
|
||||
var thing28 = Symbol();
|
||||
var thing29 = Symbol();
|
||||
var thing30 = Symbol();
|
||||
var thing31 = Symbol();
|
||||
var thing32 = Symbol();
|
||||
var thing33 = Symbol();
|
||||
var thing34 = Symbol();
|
||||
var thing35 = Symbol();
|
||||
var thing36 = Symbol();
|
||||
var thing37 = Symbol();
|
||||
var thing38 = Symbol();
|
||||
var thing39 = Symbol();
|
||||
var thing40 = Symbol();
|
||||
var thing41 = Symbol();
|
||||
var thing42 = Symbol();
|
||||
var thing43 = Symbol();
|
||||
var thing44 = Symbol();
|
||||
var thing45 = Symbol();
|
||||
var thing46 = Symbol();
|
||||
var thing47 = Symbol();
|
||||
var thing48 = Symbol();
|
||||
var thing49 = Symbol();
|
||||
var thing50 = Symbol();
|
||||
var thing51 = Symbol();
|
||||
var thing52 = Symbol();
|
||||
var thing53 = Symbol();
|
||||
var thing54 = Symbol();
|
||||
var thing55 = Symbol();
|
||||
var thing56 = Symbol();
|
||||
var thing57 = Symbol();
|
||||
var thing58 = Symbol();
|
||||
var thing59 = Symbol();
|
||||
var thing60 = Symbol();
|
||||
var thing61 = Symbol();
|
||||
var thing62 = Symbol();
|
||||
|
||||
var things = [];
|
||||
for (var i = 0; i < 63; ++i)
|
||||
things.push(eval("thing" + i));
|
||||
|
||||
function foo(o) {
|
||||
var result = 0;
|
||||
for (var i = 0; i < 1000; ++i) {
|
||||
var value = things[i & 63];
|
||||
switch (value) {
|
||||
case thing0:
|
||||
result += o.a;
|
||||
break;
|
||||
case thing1:
|
||||
result += o.b;
|
||||
break;
|
||||
case thing2:
|
||||
result += o.c;
|
||||
break;
|
||||
case thing3:
|
||||
result += o.d;
|
||||
break;
|
||||
case thing4:
|
||||
result += o.e;
|
||||
break;
|
||||
case thing5:
|
||||
result += o.f;
|
||||
break;
|
||||
case thing6:
|
||||
result += o.g;
|
||||
break;
|
||||
case thing7:
|
||||
result += o.h;
|
||||
break;
|
||||
case thing8:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing9:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing10:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing11:
|
||||
result += o.a;
|
||||
break;
|
||||
case thing12:
|
||||
result += o.b;
|
||||
break;
|
||||
case thing13:
|
||||
result += o.c;
|
||||
break;
|
||||
case thing14:
|
||||
result += o.d;
|
||||
break;
|
||||
case thing15:
|
||||
result += o.e;
|
||||
break;
|
||||
case thing16:
|
||||
result += o.f;
|
||||
break;
|
||||
case thing17:
|
||||
result += o.g;
|
||||
break;
|
||||
case thing18:
|
||||
result += o.h;
|
||||
break;
|
||||
case thing19:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing20:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing21:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing22:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing23:
|
||||
result += o.a;
|
||||
break;
|
||||
case thing24:
|
||||
result += o.b;
|
||||
break;
|
||||
case thing25:
|
||||
result += o.c;
|
||||
break;
|
||||
case thing26:
|
||||
result += o.d;
|
||||
break;
|
||||
case thing27:
|
||||
result += o.e;
|
||||
break;
|
||||
case thing28:
|
||||
result += o.f;
|
||||
break;
|
||||
case thing29:
|
||||
result += o.g;
|
||||
break;
|
||||
case thing30:
|
||||
result += o.h;
|
||||
break;
|
||||
case thing31:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing32:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing33:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing34:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing35:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing36:
|
||||
result += o.a;
|
||||
break;
|
||||
case thing37:
|
||||
result += o.b;
|
||||
break;
|
||||
case thing38:
|
||||
result += o.c;
|
||||
break;
|
||||
case thing39:
|
||||
result += o.d;
|
||||
break;
|
||||
case thing40:
|
||||
result += o.e;
|
||||
break;
|
||||
case thing41:
|
||||
result += o.f;
|
||||
break;
|
||||
case thing42:
|
||||
result += o.g;
|
||||
break;
|
||||
case thing43:
|
||||
result += o.h;
|
||||
break;
|
||||
case thing44:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing45:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing46:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing47:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing48:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing49:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing50:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing51:
|
||||
result += o.k;
|
||||
break;
|
||||
case thing52:
|
||||
result += o.a;
|
||||
break;
|
||||
case thing53:
|
||||
result += o.b;
|
||||
break;
|
||||
case thing54:
|
||||
result += o.c;
|
||||
break;
|
||||
case thing55:
|
||||
result += o.d;
|
||||
break;
|
||||
case thing56:
|
||||
result += o.e;
|
||||
break;
|
||||
case thing57:
|
||||
result += o.f;
|
||||
break;
|
||||
case thing58:
|
||||
result += o.g;
|
||||
break;
|
||||
case thing59:
|
||||
result += o.h;
|
||||
break;
|
||||
case thing60:
|
||||
result += o.i;
|
||||
break;
|
||||
case thing61:
|
||||
result += o.j;
|
||||
break;
|
||||
case thing62:
|
||||
result += o.k;
|
||||
break;
|
||||
default:
|
||||
result += o.z;
|
||||
break;
|
||||
}
|
||||
}
|
||||
return result;
|
||||
}
|
||||
|
||||
(function() {
|
||||
var o = {a:1, b:2, c:3, d:4, e:5, f:6, g:7, h:8, i:9, j:10, k:11, z:100};
|
||||
var result = 0;
|
||||
for (var i = 0; i < 1000; ++i)
|
||||
result += foo(o);
|
||||
if (result != 7966000)
|
||||
throw "Error: bad result: " + result;
|
||||
})();
|
||||
|
||||
|
|
@ -1,18 +0,0 @@
|
|||
//@ skip if $architecture == "x86"
|
||||
function createClassHierarchy(depth) {
|
||||
let currentClass = class Base { };
|
||||
for (let i = 0; i < depth; i++) {
|
||||
currentClass = class extends currentClass {};
|
||||
}
|
||||
return currentClass;
|
||||
}
|
||||
|
||||
let ctor = createClassHierarchy(10);
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 500000; i++) {
|
||||
let x = new ctor({}, {}, 20, 30, 40, 50, 60, {}, 80, true, false);
|
||||
}
|
||||
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,29 +0,0 @@
|
|||
//@ skip if $memoryLimited
|
||||
(function() {
|
||||
|
||||
function bench(name, f, arg) {
|
||||
var start = new Date;
|
||||
var result = f(arg);
|
||||
var end = new Date;
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(name + " " + result + " " + (end-start) + "ms");
|
||||
}
|
||||
|
||||
var denseSet = new Set;
|
||||
var excludeSet = [123, 1230, 12300, 123000, 234, 2340, 23400];
|
||||
for (var idx = 0; idx < 5e6; ++idx) {
|
||||
if (excludeSet.includes(idx))
|
||||
continue;
|
||||
denseSet.add(idx);
|
||||
}
|
||||
|
||||
bench("Dense Set Property Existence", function(s) {
|
||||
var count = 0;
|
||||
for (var i = 0; i < 5e6; ++i)
|
||||
if (s.has(i))
|
||||
count++
|
||||
return count;
|
||||
}, denseSet);
|
||||
|
||||
})();
|
||||
|
|
@ -1,30 +0,0 @@
|
|||
// This microbenchmarks validates that the fix in https://webkit.org/b/170961
|
||||
// does not regress the performance gains from r211670: <http://trac.webkit.org/changeset/211670>.
|
||||
// r211670 reduces the size of operationToInt32SensibleSlow() for handling double numbers with
|
||||
// binary exponent 31. Hence, this microbenchmark stresses doubleToIn32 conversion on
|
||||
// numbers with binary exponents in the vicinity of 31.
|
||||
|
||||
let doubleValues = [
|
||||
2.147483648e8, // exp = 27
|
||||
2.147483648e9, // exp = 31
|
||||
2.147483648e10, // exp = 34
|
||||
];
|
||||
|
||||
function test(q, r, s, t, u, v, w, x, y, z) {
|
||||
// Do a lot of double to int32 conversions to weigh more on the conversion.
|
||||
return q|0 + r|0 + s|0 + t|0 + u|0 + v|0 + w|0 + x|0 + y|0 + z|0;
|
||||
}
|
||||
noInline(test);
|
||||
|
||||
var result = 0;
|
||||
let length = doubleValues.length;
|
||||
for (var i = 0; i < 1000000; ++i) {
|
||||
for (var j = 0; j < length; j++) {
|
||||
var value = doubleValues[j];
|
||||
result |= test(value, value, value, value, value, value, value, value, value, value);
|
||||
}
|
||||
}
|
||||
|
||||
if (result != -1932735284) {
|
||||
throw "Bad result: " + result;
|
||||
}
|
||||
|
|
@ -1,78 +0,0 @@
|
|||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad");
|
||||
}
|
||||
|
||||
class Numbers {
|
||||
constructor(limit = 100) {
|
||||
this.limit = limit;
|
||||
this.item = 0;
|
||||
}
|
||||
|
||||
next() {
|
||||
if (this.item >= this.limit)
|
||||
throw "done";
|
||||
return this.item++;
|
||||
}
|
||||
}
|
||||
|
||||
function transpose(I, f) {
|
||||
return class Transpose {
|
||||
constructor(...args) {
|
||||
this.iterator = new I(...args);
|
||||
}
|
||||
|
||||
next() {
|
||||
return f(this.iterator.next());
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
let EvenNumbers = transpose(Numbers, (x)=>x*2);
|
||||
function verifyEven(prev, cur) {
|
||||
assert(cur.value % 2 === 0);
|
||||
assert(!prev.value || prev.value+2 === cur.value);
|
||||
}
|
||||
|
||||
let StringNumbers = transpose(Numbers, (x)=>`${x}`);
|
||||
function verifyString(_, cur) {
|
||||
assert(cur.value === `${cur.value}`);
|
||||
}
|
||||
|
||||
let iterators = [
|
||||
[Numbers, function() {}],
|
||||
[Numbers, function() {}],
|
||||
[StringNumbers, verifyString],
|
||||
[EvenNumbers, verifyEven],
|
||||
[EvenNumbers, verifyEven],
|
||||
];
|
||||
|
||||
function foo(i) {}
|
||||
noInline(foo);
|
||||
|
||||
function runIterators() {
|
||||
for (let [iterator, verify] of iterators) {
|
||||
let i = new iterator;
|
||||
let prev = {};
|
||||
while (true) {
|
||||
let cur = {};
|
||||
try {
|
||||
cur.value = i.next();
|
||||
verify(prev, cur);
|
||||
} catch(e) {
|
||||
if (e !== "done")
|
||||
throw new Error("Bad: " + e);
|
||||
break;
|
||||
}
|
||||
prev = cur;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
{
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 5000; ++i)
|
||||
runIterators();
|
||||
if (false)
|
||||
print(Date.now() - start);
|
||||
}
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a & b;
|
||||
else
|
||||
temp = b & 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result & i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 499660;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 4999660;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a | b;
|
||||
else
|
||||
temp = b | 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result | i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 505700591;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 50056912223;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a ^ b;
|
||||
else
|
||||
temp = b ^ 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result ^ i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 500050340;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 50000500340;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,55 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a / b;
|
||||
else
|
||||
temp = b / 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Remove rounding errors so we can have a predictable test result.
|
||||
result = result | 0;
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result / i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 50002814;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 5000017595;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a << b;
|
||||
else
|
||||
temp = b << 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result << i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 512050639000;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 51200511439000;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,50 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
if (a > b)
|
||||
result += a * b;
|
||||
else
|
||||
result += b * 1;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result * i;
|
||||
result = origResult < result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 5000495600;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 500004995600;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a >> b;
|
||||
else
|
||||
temp = b >> 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result >> i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 439840;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 48330800;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,54 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
var o2 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
if (a > b)
|
||||
result += a - b;
|
||||
else
|
||||
result += b - 1;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result - i;
|
||||
result = origResult < result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = -4496448060;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 40001940;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,52 +0,0 @@
|
|||
//@ runFTLNoCJIT
|
||||
var o1 = {
|
||||
i: 0,
|
||||
valueOf: function() { return this.i; }
|
||||
};
|
||||
|
||||
result = 0;
|
||||
function foo(a, b) {
|
||||
var result = 0;
|
||||
for (var j = 0; j < 10; j++) {
|
||||
var temp;
|
||||
if (a > b)
|
||||
temp = a >>> b;
|
||||
else
|
||||
temp = b >>> 1;
|
||||
result += temp;
|
||||
}
|
||||
|
||||
// Busy work just to allow the DFG and FTL to optimize this out. If the above causes
|
||||
// us to speculation fail out to the baseline, this busy work will take a lot longer
|
||||
// to run.
|
||||
// This loop below also gets the DFG to compile this function sooner.
|
||||
var origResult = result;
|
||||
for (var i = 1; i < 1000; i++)
|
||||
result = result >>> i;
|
||||
result = origResult > result ? origResult : result;
|
||||
return result;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
var iterations;
|
||||
var expectedResult;
|
||||
if (this.window) {
|
||||
// The layout test doesn't like too many iterations and may time out.
|
||||
iterations = 10000;
|
||||
expectedResult = 439840;
|
||||
} else {
|
||||
iterations = 100000;
|
||||
expectedResult = 48330800;
|
||||
}
|
||||
|
||||
|
||||
for (var i = 0; i <= iterations; i++) {
|
||||
o1.i = i;
|
||||
if (i % 2)
|
||||
result += foo(o1, 10);
|
||||
else
|
||||
result += foo(i, 10);
|
||||
}
|
||||
|
||||
if (result != expectedResult)
|
||||
throw "Bad result: " + result;
|
||||
|
|
@ -1,28 +0,0 @@
|
|||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad")
|
||||
}
|
||||
noInline(assert);
|
||||
|
||||
function test(f, v, c, d) {
|
||||
return f.bind(v, c, d);
|
||||
}
|
||||
|
||||
function test2(f, v) {
|
||||
return f.bind(v);
|
||||
}
|
||||
|
||||
function foo(a,b,c,d,e,f) { return this; }
|
||||
let thisValue = {};
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 1000000; i++) {
|
||||
let f = test(foo, thisValue, 20, 30);
|
||||
assert(f(foo, thisValue, 20, 30) === thisValue);
|
||||
}
|
||||
for (let i = 0; i < 1000000; i++) {
|
||||
let f = test2(foo, thisValue);
|
||||
assert(f(foo, thisValue, 20, 30) === thisValue);
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,31 +0,0 @@
|
|||
|
||||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad")
|
||||
}
|
||||
noInline(assert);
|
||||
|
||||
function test(f, v, c, d) {
|
||||
return f.bind(v, c, d);
|
||||
}
|
||||
noInline(test);
|
||||
|
||||
function test2(f, v) {
|
||||
return f.bind(v);
|
||||
}
|
||||
noInline(test);
|
||||
|
||||
function foo(a,b,c,d,e,f) { return this; }
|
||||
let thisValue = {};
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 1000000; i++) {
|
||||
let f = test(foo, thisValue, 20, 30);
|
||||
assert(f(foo, thisValue, 20, 30) === thisValue);
|
||||
}
|
||||
for (let i = 0; i < 1000000; i++) {
|
||||
let f = test2(foo, thisValue);
|
||||
assert(f(foo, thisValue, 20, 30) === thisValue);
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,25 +0,0 @@
|
|||
let counter = 0;
|
||||
function bar(map) {
|
||||
for (let [key, value] of map) {
|
||||
if (Math.random() > 0.95) {
|
||||
map.set("" + counter, counter);
|
||||
++counter;
|
||||
}
|
||||
}
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo() {
|
||||
let map = new Map;
|
||||
for (let i = 0; i < 1000; i++)
|
||||
map.set(i, i+1);
|
||||
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 100; i++)
|
||||
bar(map);
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
||||
}
|
||||
foo();
|
||||
|
|
@ -1,25 +0,0 @@
|
|||
function bar(map) {
|
||||
for (let [key, value] of map) {
|
||||
if (value - 1 !== key)
|
||||
throw new Error("Bad iteration!");
|
||||
if (Math.random() > 0.95) {
|
||||
map.delete(key);
|
||||
}
|
||||
}
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo() {
|
||||
let map = new Map;
|
||||
for (let i = 0; i < 80000; i++)
|
||||
map.set(i, i+1);
|
||||
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 100; i++)
|
||||
bar(map);
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
||||
}
|
||||
foo();
|
||||
|
|
@ -1,49 +0,0 @@
|
|||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad assertion")
|
||||
}
|
||||
noInline(assert);
|
||||
function test(map, key, value) {
|
||||
let loadValue = eval(`${Math.random()}; let k = key; (function getValue() { return map.get(k); });`);
|
||||
noInline(loadValue);
|
||||
for (let i = 0; i < 1000000; i++) {
|
||||
assert(loadValue() === value);
|
||||
}
|
||||
}
|
||||
|
||||
let reallyLongString = "";
|
||||
for (let i = 0; i < 60000; i++) {
|
||||
reallyLongString += "i";
|
||||
}
|
||||
reallyLongString.toString();
|
||||
|
||||
let keys = [
|
||||
"foo",
|
||||
"fdashfdsahfdashfdsh",
|
||||
"rope" + "string",
|
||||
reallyLongString,
|
||||
259243,
|
||||
1238231.2138321,
|
||||
-92138.328,
|
||||
{foo: 25},
|
||||
Symbol("Hello world"),
|
||||
true,
|
||||
false,
|
||||
undefined,
|
||||
null,
|
||||
NaN,
|
||||
-0,
|
||||
function foo() {}
|
||||
];
|
||||
|
||||
let start = Date.now();
|
||||
let map = new Map;
|
||||
let i = 0;
|
||||
for (let key of keys) {
|
||||
let value = {i: i++};
|
||||
map.set(key, value);
|
||||
test(map, key, value);
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
function bar(map, p) {
|
||||
return map.get(p) + map.get(p);
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo() {
|
||||
let map = new Map;
|
||||
let items = [
|
||||
[10, 50],
|
||||
["450", 78],
|
||||
[{}, {}],
|
||||
[Symbol(), true],
|
||||
[undefined, null],
|
||||
[true, null],
|
||||
[false, true],
|
||||
[45.87, {}]
|
||||
];
|
||||
for (let [key, value] of items)
|
||||
map.set(key, value);
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 5000000; i++)
|
||||
bar(map, items[i % items.length][0]);
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
}
|
||||
foo();
|
||||
File diff suppressed because one or more lines are too long
|
|
@ -1,21 +0,0 @@
|
|||
//@ skip
|
||||
|
||||
(function() {
|
||||
var result = 0;
|
||||
|
||||
for (var i = 0; i < 100; ++i) {
|
||||
var program = "(function f" + i + "() {\n";
|
||||
for (var j = 0; j < 1000; ++j) {
|
||||
program += "function f" + j + "() { return 0 && 1 && 2 && 3 && 4 && 5 && 6 && 7 && 8 && 9 && 10; }\n";
|
||||
}
|
||||
program += "})();\n";
|
||||
program += "return 0;\n";
|
||||
|
||||
result += new Function(program)();
|
||||
}
|
||||
|
||||
if (result != 0) {
|
||||
print("Bad result: " + result);
|
||||
throw "Error";
|
||||
}
|
||||
})();
|
||||
|
|
@ -1,613 +0,0 @@
|
|||
function assert(b, m = "") {
|
||||
if (!b)
|
||||
throw new Error("Bad assertion: " + m);
|
||||
}
|
||||
noInline(assert);
|
||||
|
||||
const iterations = 20000;
|
||||
|
||||
function test1() {
|
||||
function bar(a, b, ...args) {
|
||||
return args.length;
|
||||
}
|
||||
noInline(bar);
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
assert(bar() === 0, bar());
|
||||
assert(bar(i) === 0);
|
||||
assert(bar(i, i) === 0);
|
||||
assert(bar(i, i, i) === 1);
|
||||
assert(bar(i, i, i, i, i) === 3);
|
||||
}
|
||||
}
|
||||
|
||||
function shallowEq(a, b) {
|
||||
if (a.length !== b.length)
|
||||
return false;
|
||||
for (let i = 0; i < a.length; i++) {
|
||||
if (a.length !== b.length)
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
noInline(shallowEq);
|
||||
|
||||
function test2() {
|
||||
function jaz(a, b, ...args) {
|
||||
let result = [];
|
||||
for (let i = 0; i < args.length; i++) {
|
||||
result.push(args[i]);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
function jaz2(...args) {
|
||||
function kaz(a, b, ...args) {
|
||||
let result = [];
|
||||
for (let i = 0; i < args.length; i++) {
|
||||
result.push(args[i]);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
return kaz.apply(null, args);
|
||||
}
|
||||
noInline(jaz2);
|
||||
|
||||
for (let f of [jaz, jaz2]) {
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let r = f();
|
||||
assert(!r.length);
|
||||
|
||||
r = f(i);
|
||||
assert(!r.length);
|
||||
|
||||
r = f(i, i)
|
||||
assert(!r.length);
|
||||
|
||||
r = f(i, i, i)
|
||||
assert(r.length === 1);
|
||||
assert(shallowEq(r, [i]));
|
||||
|
||||
r = f(i, i, i)
|
||||
assert(r.length === 1);
|
||||
assert(shallowEq(r, [i]));
|
||||
|
||||
r = f(i, i, i, i*2, i*4)
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, i*2, i*4]));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
function test3() {
|
||||
function foo(...args) {
|
||||
return args;
|
||||
}
|
||||
function baz(a, b, c, ...args) {
|
||||
return foo.apply(null, args);
|
||||
}
|
||||
function jaz(a, b, c, d, e, f) {
|
||||
return baz(a, b, c, d, e, f);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let r = jaz();
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [undefined, undefined, undefined]));
|
||||
|
||||
r = jaz(i, i);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [undefined, undefined, undefined]));
|
||||
|
||||
r = jaz(i, i, i);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [undefined, undefined, undefined]));
|
||||
|
||||
r = jaz(i, i, i, i);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, undefined, undefined]));
|
||||
|
||||
r = jaz(i, i, i, i, i, i);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, i, i]));
|
||||
}
|
||||
}
|
||||
|
||||
function test4() {
|
||||
function baz(...args) {
|
||||
return args;
|
||||
}
|
||||
function jaz(a, b, ...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let r = jaz();
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i, i);
|
||||
assert(r.length === 1);
|
||||
assert(shallowEq(r, [i]));
|
||||
|
||||
r = jaz(i, i, i, i*10);
|
||||
assert(r.length === 2);
|
||||
assert(shallowEq(r, [i, i*10]));
|
||||
|
||||
let o = {};
|
||||
r = jaz(i, i, i, i*10, o);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, i*10, o]));
|
||||
}
|
||||
}
|
||||
|
||||
function test5() {
|
||||
function baz(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(baz);
|
||||
function jaz(a, b, ...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let r = jaz();
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i, i);
|
||||
assert(r.length === 1);
|
||||
assert(shallowEq(r, [i]));
|
||||
|
||||
r = jaz(i, i, i, i*10);
|
||||
assert(r.length === 2);
|
||||
assert(shallowEq(r, [i, i*10]));
|
||||
|
||||
let o = {};
|
||||
r = jaz(i, i, i, i*10, o);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, i*10, o]));
|
||||
}
|
||||
}
|
||||
|
||||
function test6() {
|
||||
"use strict";
|
||||
function baz(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(baz);
|
||||
function jaz(a, b, ...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let r = jaz();
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i);
|
||||
assert(r.length === 0);
|
||||
|
||||
r = jaz(i, i, i);
|
||||
assert(r.length === 1);
|
||||
assert(shallowEq(r, [i]));
|
||||
|
||||
r = jaz(i, i, i, i*10);
|
||||
assert(r.length === 2);
|
||||
assert(shallowEq(r, [i, i*10]));
|
||||
|
||||
let o = {};
|
||||
r = jaz(i, i, i, i*10, o);
|
||||
assert(r.length === 3);
|
||||
assert(shallowEq(r, [i, i*10, o]));
|
||||
}
|
||||
}
|
||||
|
||||
function test7() {
|
||||
let shouldExit = false;
|
||||
function baz(...args) {
|
||||
if (shouldExit) {
|
||||
OSRExit();
|
||||
return [args.length, args[0], args[1], args[2]];
|
||||
}
|
||||
return [args.length, args[0], args[1], args[2]];
|
||||
}
|
||||
function jaz(a, b, ...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
function check(i) {
|
||||
let [length, a, b, c] = jaz();
|
||||
assert(length === 0);
|
||||
assert(a === undefined);
|
||||
assert(b === undefined);
|
||||
assert(c === undefined);
|
||||
|
||||
[length, a, b, c] = jaz(i);
|
||||
assert(length === 0);
|
||||
assert(a === undefined);
|
||||
assert(b === undefined);
|
||||
assert(c === undefined);
|
||||
|
||||
[length, a, b, c] = jaz(i, i);
|
||||
assert(length === 0);
|
||||
assert(a === undefined);
|
||||
assert(b === undefined);
|
||||
assert(c === undefined);
|
||||
|
||||
[length, a, b, c] = jaz(i, i, i);
|
||||
assert(length === 1);
|
||||
assert(a === i, JSON.stringify(a));
|
||||
assert(b === undefined);
|
||||
assert(c === undefined);
|
||||
|
||||
[length, a, b, c] = jaz(i, i, i, i*10);
|
||||
assert(length === 2);
|
||||
assert(a === i);
|
||||
assert(b === i*10);
|
||||
assert(c === undefined);
|
||||
|
||||
let o = {oooo:20};
|
||||
[length, a, b, c] = jaz(i, i, i, i*10, o);
|
||||
assert(length === 3);
|
||||
assert(a === i);
|
||||
assert(b === i*10);
|
||||
assert(c === o);
|
||||
}
|
||||
|
||||
shouldExit = true;
|
||||
for (let i = 0; i < 400; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
check(10);
|
||||
}
|
||||
|
||||
function test8() {
|
||||
let shouldExit = false;
|
||||
function baz(...args) {
|
||||
if (shouldExit) {
|
||||
OSRExit();
|
||||
return args;
|
||||
}
|
||||
return args;
|
||||
}
|
||||
function jaz(a, b, ...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
function check(i) {
|
||||
let args = jaz();
|
||||
assert(args.length === 0);
|
||||
|
||||
args = jaz(i);
|
||||
assert(args.length === 0);
|
||||
|
||||
args = jaz(i, i);
|
||||
assert(args.length === 0);
|
||||
|
||||
args = jaz(i, i, i);
|
||||
assert(args.length === 1);
|
||||
assert(args[0] === i);
|
||||
|
||||
args = jaz(i, i, i, i*10);
|
||||
assert(args.length === 2);
|
||||
assert(args[0] === i);
|
||||
assert(args[1] === i*10);
|
||||
|
||||
let o = {oooo:20};
|
||||
args = jaz(i, i, i, i*10, o);
|
||||
assert(args.length === 3);
|
||||
assert(args[0] === i);
|
||||
assert(args[1] === i*10);
|
||||
assert(args[2] === o);
|
||||
}
|
||||
|
||||
shouldExit = true;
|
||||
for (let i = 0; i < 400; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
check(10);
|
||||
}
|
||||
|
||||
function test9() {
|
||||
let shouldExit = false;
|
||||
function baz(a, ...args) {
|
||||
if (shouldExit) {
|
||||
OSRExit();
|
||||
return [args.length, args[0], args[1]];
|
||||
}
|
||||
return [args.length, args[0], args[1]];
|
||||
}
|
||||
function jaz(...args) {
|
||||
return baz.apply(null, args);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
function check(i) {
|
||||
let [length, a, b] = jaz();
|
||||
assert(length === 0);
|
||||
|
||||
[length, a, b] = jaz(i);
|
||||
assert(length === 0);
|
||||
assert(a === undefined);
|
||||
assert(b === undefined);
|
||||
|
||||
[length, a, b] = jaz(i, i + 1);
|
||||
assert(length === 1);
|
||||
assert(a === i+1);
|
||||
assert(b === undefined);
|
||||
|
||||
[length, a, b] = jaz(i, i+1, i+2);
|
||||
assert(length === 2);
|
||||
assert(a === i+1);
|
||||
assert(b === i+2);
|
||||
|
||||
let o = {oooo:20};
|
||||
[length, a, b] = jaz(i, i+1, o);
|
||||
assert(length === 2);
|
||||
assert(a === i+1);
|
||||
assert(b === o);
|
||||
}
|
||||
|
||||
shouldExit = true;
|
||||
for (let i = 0; i < 400; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
check(i);
|
||||
}
|
||||
|
||||
shouldExit = false;
|
||||
check(10);
|
||||
}
|
||||
|
||||
function test10() {
|
||||
function baz(a, b, c, ...args) {
|
||||
return [args.length, args[0], args[1], args[2], args[3]];
|
||||
}
|
||||
function jaz(a, b, c, d, e, f) {
|
||||
return baz(a, b, c, d, e, f);
|
||||
}
|
||||
noInline(jaz);
|
||||
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
let [length, a, b, c, d] = jaz(1, 2, 3, 4, 5, 6);
|
||||
assert(length === 3);
|
||||
assert(a === 4);
|
||||
assert(b === 5);
|
||||
assert(c === 6);
|
||||
assert(d === undefined);
|
||||
}
|
||||
}
|
||||
|
||||
function test11() {
|
||||
function bar(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo(a, b, c, d, ...args) {
|
||||
return bar.apply(null, args);
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function makeArguments(args) {
|
||||
return [1,2,3,4, ...args];
|
||||
}
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
function test() { assert(shallowEq(a, foo.apply(null, makeArguments(a)))); }
|
||||
let a = [{}, 25, 50];
|
||||
test();
|
||||
|
||||
a = [];
|
||||
test();
|
||||
|
||||
a = [{foo: 20}];
|
||||
test();
|
||||
|
||||
a = [10, 20, 30, 40, 50, 60, 70, 80];
|
||||
test();
|
||||
}
|
||||
}
|
||||
|
||||
function test12() {
|
||||
"use strict";
|
||||
let thisValue = {};
|
||||
function getThisValue() { return thisValue; }
|
||||
noInline(getThisValue);
|
||||
|
||||
function bar(...args) {
|
||||
assert(this === thisValue);
|
||||
return args;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo(a, b, c, d, ...args) {
|
||||
return bar.apply(getThisValue(), args);
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function makeArguments(args) {
|
||||
return [1,2,3,4, ...args];
|
||||
}
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
function test() { assert(shallowEq(a, foo.apply(null, makeArguments(a)))); }
|
||||
let a = [{}, 25, 50];
|
||||
test();
|
||||
|
||||
a = [];
|
||||
test();
|
||||
|
||||
a = [{foo: 20}];
|
||||
test();
|
||||
|
||||
a = [10, 20, 30, 40, 50, 60, 70, 80];
|
||||
test();
|
||||
}
|
||||
}
|
||||
|
||||
function test13() {
|
||||
"use strict";
|
||||
function bar(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function top(a, b, c, d, ...args) {
|
||||
return bar.apply(null, args);
|
||||
}
|
||||
function foo(...args) {
|
||||
let r = top.apply(null, args);
|
||||
return r;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function makeArguments(args) {
|
||||
return [1,2,3,4, ...args];
|
||||
}
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
function test() { assert(shallowEq(a, foo.apply(null, makeArguments(a)))); }
|
||||
let a = [{}, 25, 50];
|
||||
test();
|
||||
|
||||
a = [];
|
||||
test();
|
||||
|
||||
a = [10, 20, 30, 40, 50, 60, 70, 80];
|
||||
test();
|
||||
}
|
||||
}
|
||||
|
||||
function test14() {
|
||||
"use strict";
|
||||
function bar(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function top(a, b, c, d, ...args) {
|
||||
return bar.apply(null, args);
|
||||
}
|
||||
function foo(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17) {
|
||||
return top(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17);
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function makeArguments(args) {
|
||||
let r = [1,2,3,4, ...args];
|
||||
while (r.length < foo.length)
|
||||
r.push(undefined);
|
||||
return r;
|
||||
}
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
function test()
|
||||
{
|
||||
let args = makeArguments(a);
|
||||
assert(shallowEq(args.slice(4), foo.apply(null, args)));
|
||||
}
|
||||
|
||||
let a = [{}, 25, 50];
|
||||
test();
|
||||
|
||||
a = [];
|
||||
test();
|
||||
|
||||
a = [10, 20, 30, 40, 50, 60, 70, 80];
|
||||
test();
|
||||
}
|
||||
}
|
||||
|
||||
function test15() {
|
||||
"use strict";
|
||||
function bar(...args) {
|
||||
return args;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function top(a, b, c, d, ...args) {
|
||||
return bar.apply(null, args);
|
||||
}
|
||||
function foo(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17) {
|
||||
let r = top(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17);
|
||||
return r;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function makeArguments(args) {
|
||||
let r = [1,2,3,4, ...args];
|
||||
while (r.length < foo.length)
|
||||
r.push(undefined);
|
||||
return r;
|
||||
}
|
||||
for (let i = 0; i < iterations; i++) {
|
||||
function test()
|
||||
{
|
||||
let args = makeArguments(a);
|
||||
assert(shallowEq(args.slice(4), foo.apply(null, args)));
|
||||
}
|
||||
|
||||
let a = [{}, 25, 50];
|
||||
test();
|
||||
|
||||
a = [];
|
||||
test();
|
||||
|
||||
a = [10, 20, 30, 40, 50, 60, 70, 80];
|
||||
test();
|
||||
}
|
||||
}
|
||||
|
||||
let start = Date.now();
|
||||
test1();
|
||||
test2();
|
||||
test3();
|
||||
test4();
|
||||
test5();
|
||||
test6();
|
||||
test7();
|
||||
test8();
|
||||
test9();
|
||||
test10();
|
||||
test11();
|
||||
test12();
|
||||
test13();
|
||||
test14();
|
||||
test15();
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
||||
|
|
@ -1,39 +0,0 @@
|
|||
function foo(arg) {
|
||||
return [...arg];
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
let arrays = [ ];
|
||||
const size = 500;
|
||||
{
|
||||
let arr = [];
|
||||
for (let i = 0; i < size; i++) {
|
||||
arr.push(i);
|
||||
}
|
||||
arrays.push(arr);
|
||||
}
|
||||
|
||||
{
|
||||
let arr = [];
|
||||
for (let i = 0; i < size; i++) {
|
||||
arr.push(i + 0.5);
|
||||
}
|
||||
arrays.push(arr);
|
||||
}
|
||||
|
||||
{
|
||||
let arr = [];
|
||||
for (let i = 0; i < size; i++) {
|
||||
arr.push({i: i});
|
||||
}
|
||||
arrays.push(arr);
|
||||
}
|
||||
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 100000; i++) {
|
||||
let array = arrays[i % arrays.length];
|
||||
foo(array);
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,19 +0,0 @@
|
|||
function foo(arg) {
|
||||
return [...arg];
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
let arrays = [
|
||||
[10, 20, 40],
|
||||
[10.5, 20.5, 40.5],
|
||||
[20, {}, 8],
|
||||
];
|
||||
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 10000000; i++) {
|
||||
let array = arrays[i % arrays.length];
|
||||
foo(array);
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,145 +0,0 @@
|
|||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad assertion.");
|
||||
}
|
||||
|
||||
let tests = [];
|
||||
function test(f) {
|
||||
noInline(f);
|
||||
tests.push(f);
|
||||
}
|
||||
|
||||
function runTests() {
|
||||
let start = Date.now();
|
||||
for (let f of tests) {
|
||||
for (let i = 0; i < 40000; i++)
|
||||
f();
|
||||
}
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
}
|
||||
|
||||
function add(a,b) { return a + b; }
|
||||
noInline(add);
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 20;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = null;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = undefined;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 20.81239012821;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = true;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = false;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = NaN;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = -0;
|
||||
let b = "foo";
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 0.0;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = Infinity;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = -Infinity;
|
||||
let b = "foo";
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e10;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e-10;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e5;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e-5;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e-40;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
test(function() {
|
||||
let a = "foo";
|
||||
let b = 1e40;
|
||||
assert(a + b === add(a, b));
|
||||
assert(b + a === add(b, a));
|
||||
});
|
||||
|
||||
runTests();
|
||||
|
|
@ -1,36 +0,0 @@
|
|||
function assert(b) {
|
||||
if (!b)
|
||||
throw new Error("Bad assertion");
|
||||
}
|
||||
noInline(assert);
|
||||
|
||||
let tests = [
|
||||
["foo", "foo"],
|
||||
["foooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo", "foooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo"],
|
||||
];
|
||||
|
||||
function foo(a) {
|
||||
return a.toLowerCase();
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
function bar(a) {
|
||||
a.toLowerCase();
|
||||
assert(true); // side effects
|
||||
a.toLowerCase();
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
let start = Date.now();
|
||||
for (let i = 0; i < 500000; i++) {
|
||||
for (let i = 0; i < tests.length; i++) {
|
||||
let test = tests[i][0];
|
||||
let result = tests[i][1];
|
||||
assert(foo(test) === result);
|
||||
bar(test);
|
||||
}
|
||||
}
|
||||
|
||||
const verbose = false;
|
||||
if (verbose)
|
||||
print(Date.now() - start);
|
||||
|
|
@ -1,48 +0,0 @@
|
|||
var someGlobal;
|
||||
|
||||
// This is a simple speed test. It should go fast.
|
||||
|
||||
function foo() {
|
||||
var myObject = {};
|
||||
for (var i = 0; i < 10000000; ++i) {
|
||||
someGlobal = myObject.undefinedProperty;
|
||||
}
|
||||
return someGlobal;
|
||||
}
|
||||
result = foo();
|
||||
if (result != undefined)
|
||||
throw new Error("Bad result: " + result);
|
||||
|
||||
// This test checks that a cached property lookup miss doesn't continue to fire when the property suddenly appears on the object.
|
||||
|
||||
function bar() {
|
||||
var myObject = {};
|
||||
for (var i = 0; i < 100000000; ++i) {
|
||||
someGlobal = myObject.someProperty;
|
||||
if (i == 50000000)
|
||||
myObject.someProperty = 1;
|
||||
}
|
||||
return someGlobal;
|
||||
}
|
||||
var result = bar();
|
||||
if (result != 1)
|
||||
throw new Error("Bad result: " + result);
|
||||
someGlobal = undefined;
|
||||
|
||||
// This test checks that a cached property lookup miss doesn't continue to fire when the property suddenly appears on the object's prototype.
|
||||
|
||||
function baz() {
|
||||
var myPrototype = {}
|
||||
var myObject = {};
|
||||
myObject.__proto__ = myPrototype;
|
||||
for (var i = 0; i < 100000000; ++i) {
|
||||
someGlobal = myObject.someProperty;
|
||||
if (i == 50000000)
|
||||
myPrototype.someProperty = 2;
|
||||
}
|
||||
return someGlobal;
|
||||
}
|
||||
var result = baz();
|
||||
if (result != 2)
|
||||
throw new Error("Bad result: " + result);
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
|
|
@ -1,872 +0,0 @@
|
|||
//@ if $buildType == "debug" or $architecture =~ /arm|mips/ then skip else runTypeProfiler end
|
||||
|
||||
// Copyright 2008 the V8 project authors. All rights reserved.
|
||||
// Copyright 1996 John Maloney and Mario Wolczko.
|
||||
|
||||
// This program is free software; you can redistribute it and/or modify
|
||||
// it under the terms of the GNU General Public License as published by
|
||||
// the Free Software Foundation; either version 2 of the License, or
|
||||
// (at your option) any later version.
|
||||
//
|
||||
// This program is distributed in the hope that it will be useful,
|
||||
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
// GNU General Public License for more details.
|
||||
//
|
||||
// You should have received a copy of the GNU General Public License
|
||||
// along with this program; if not, write to the Free Software
|
||||
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||
|
||||
|
||||
// This implementation of the DeltaBlue benchmark is derived
|
||||
// from the Smalltalk implementation by John Maloney and Mario
|
||||
// Wolczko. Some parts have been translated directly, whereas
|
||||
// others have been modified more aggresively to make it feel
|
||||
// more like a JavaScript program.
|
||||
|
||||
/**
|
||||
* A JavaScript implementation of the DeltaBlue constraint-solving
|
||||
* algorithm, as described in:
|
||||
*
|
||||
* "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver"
|
||||
* Bjorn N. Freeman-Benson and John Maloney
|
||||
* January 1990 Communications of the ACM,
|
||||
* also available as University of Washington TR 89-08-06.
|
||||
*
|
||||
* Beware: this benchmark is written in a grotesque style where
|
||||
* the constraint model is built by side-effects from constructors.
|
||||
* I've kept it this way to avoid deviating too much from the original
|
||||
* implementation.
|
||||
*/
|
||||
|
||||
|
||||
/* --- O b j e c t M o d e l --- */
|
||||
|
||||
Object.prototype.inheritsFrom = function (shuper) {
|
||||
function Inheriter() { }
|
||||
Inheriter.prototype = shuper.prototype;
|
||||
this.prototype = new Inheriter();
|
||||
this.superConstructor = shuper;
|
||||
}
|
||||
|
||||
function OrderedCollection() {
|
||||
this.elms = new Array();
|
||||
}
|
||||
|
||||
OrderedCollection.prototype.add = function (elm) {
|
||||
this.elms.push(elm);
|
||||
}
|
||||
|
||||
OrderedCollection.prototype.at = function (index) {
|
||||
return this.elms[index];
|
||||
}
|
||||
|
||||
OrderedCollection.prototype.size = function () {
|
||||
return this.elms.length;
|
||||
}
|
||||
|
||||
OrderedCollection.prototype.removeFirst = function () {
|
||||
return this.elms.pop();
|
||||
}
|
||||
|
||||
OrderedCollection.prototype.remove = function (elm) {
|
||||
var index = 0, skipped = 0;
|
||||
for (var value of this.elms) {
|
||||
if (value != elm) {
|
||||
this.elms[index] = value;
|
||||
index++;
|
||||
} else {
|
||||
skipped++;
|
||||
}
|
||||
}
|
||||
for (var i = 0; i < skipped; i++)
|
||||
this.elms.pop();
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* S t r e n g t h
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* Strengths are used to measure the relative importance of constraints.
|
||||
* New strengths may be inserted in the strength hierarchy without
|
||||
* disrupting current constraints. Strengths cannot be created outside
|
||||
* this class, so pointer comparison can be used for value comparison.
|
||||
*/
|
||||
function Strength(strengthValue, name) {
|
||||
this.strengthValue = strengthValue;
|
||||
this.name = name;
|
||||
}
|
||||
|
||||
Strength.stronger = function (s1, s2) {
|
||||
return s1.strengthValue < s2.strengthValue;
|
||||
}
|
||||
|
||||
Strength.weaker = function (s1, s2) {
|
||||
return s1.strengthValue > s2.strengthValue;
|
||||
}
|
||||
|
||||
Strength.weakestOf = function (s1, s2) {
|
||||
return this.weaker(s1, s2) ? s1 : s2;
|
||||
}
|
||||
|
||||
Strength.strongest = function (s1, s2) {
|
||||
return this.stronger(s1, s2) ? s1 : s2;
|
||||
}
|
||||
|
||||
Strength.prototype.nextWeaker = function () {
|
||||
switch (this.strengthValue) {
|
||||
case 0: return Strength.WEAKEST;
|
||||
case 1: return Strength.WEAK_DEFAULT;
|
||||
case 2: return Strength.NORMAL;
|
||||
case 3: return Strength.STRONG_DEFAULT;
|
||||
case 4: return Strength.PREFERRED;
|
||||
case 5: return Strength.REQUIRED;
|
||||
}
|
||||
}
|
||||
|
||||
// Strength constants.
|
||||
Strength.REQUIRED = new Strength(0, "required");
|
||||
Strength.STONG_PREFERRED = new Strength(1, "strongPreferred");
|
||||
Strength.PREFERRED = new Strength(2, "preferred");
|
||||
Strength.STRONG_DEFAULT = new Strength(3, "strongDefault");
|
||||
Strength.NORMAL = new Strength(4, "normal");
|
||||
Strength.WEAK_DEFAULT = new Strength(5, "weakDefault");
|
||||
Strength.WEAKEST = new Strength(6, "weakest");
|
||||
|
||||
/* --- *
|
||||
* C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* An abstract class representing a system-maintainable relationship
|
||||
* (or "constraint") between a set of variables. A constraint supplies
|
||||
* a strength instance variable; concrete subclasses provide a means
|
||||
* of storing the constrained variables and other information required
|
||||
* to represent a constraint.
|
||||
*/
|
||||
function Constraint(strength) {
|
||||
this.strength = strength;
|
||||
}
|
||||
|
||||
/**
|
||||
* Activate this constraint and attempt to satisfy it.
|
||||
*/
|
||||
Constraint.prototype.addConstraint = function () {
|
||||
this.addToGraph();
|
||||
planner.incrementalAdd(this);
|
||||
}
|
||||
|
||||
/**
|
||||
* Attempt to find a way to enforce this constraint. If successful,
|
||||
* record the solution, perhaps modifying the current dataflow
|
||||
* graph. Answer the constraint that this constraint overrides, if
|
||||
* there is one, or nil, if there isn't.
|
||||
* Assume: I am not already satisfied.
|
||||
*/
|
||||
Constraint.prototype.satisfy = function (mark) {
|
||||
this.chooseMethod(mark);
|
||||
if (!this.isSatisfied()) {
|
||||
if (this.strength == Strength.REQUIRED)
|
||||
alert("Could not satisfy a required constraint!");
|
||||
return null;
|
||||
}
|
||||
this.markInputs(mark);
|
||||
var out = this.output();
|
||||
var overridden = out.determinedBy;
|
||||
if (overridden != null) overridden.markUnsatisfied();
|
||||
out.determinedBy = this;
|
||||
if (!planner.addPropagate(this, mark))
|
||||
alert("Cycle encountered");
|
||||
out.mark = mark;
|
||||
return overridden;
|
||||
}
|
||||
|
||||
Constraint.prototype.destroyConstraint = function () {
|
||||
if (this.isSatisfied()) planner.incrementalRemove(this);
|
||||
else this.removeFromGraph();
|
||||
}
|
||||
|
||||
/**
|
||||
* Normal constraints are not input constraints. An input constraint
|
||||
* is one that depends on external state, such as the mouse, the
|
||||
* keybord, a clock, or some arbitraty piece of imperative code.
|
||||
*/
|
||||
Constraint.prototype.isInput = function () {
|
||||
return false;
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* U n a r y C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* Abstract superclass for constraints having a single possible output
|
||||
* variable.
|
||||
*/
|
||||
function UnaryConstraint(v, strength) {
|
||||
UnaryConstraint.superConstructor.call(this, strength);
|
||||
this.myOutput = v;
|
||||
this.satisfied = false;
|
||||
this.addConstraint();
|
||||
}
|
||||
|
||||
UnaryConstraint.inheritsFrom(Constraint);
|
||||
|
||||
/**
|
||||
* Adds this constraint to the constraint graph
|
||||
*/
|
||||
UnaryConstraint.prototype.addToGraph = function () {
|
||||
this.myOutput.addConstraint(this);
|
||||
this.satisfied = false;
|
||||
}
|
||||
|
||||
/**
|
||||
* Decides if this constraint can be satisfied and records that
|
||||
* decision.
|
||||
*/
|
||||
UnaryConstraint.prototype.chooseMethod = function (mark) {
|
||||
this.satisfied = (this.myOutput.mark != mark)
|
||||
&& Strength.stronger(this.strength, this.myOutput.walkStrength);
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns true if this constraint is satisfied in the current solution.
|
||||
*/
|
||||
UnaryConstraint.prototype.isSatisfied = function () {
|
||||
return this.satisfied;
|
||||
}
|
||||
|
||||
UnaryConstraint.prototype.markInputs = function (mark) {
|
||||
// has no inputs
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the current output variable.
|
||||
*/
|
||||
UnaryConstraint.prototype.output = function () {
|
||||
return this.myOutput;
|
||||
}
|
||||
|
||||
/**
|
||||
* Calculate the walkabout strength, the stay flag, and, if it is
|
||||
* 'stay', the value for the current output of this constraint. Assume
|
||||
* this constraint is satisfied.
|
||||
*/
|
||||
UnaryConstraint.prototype.recalculate = function () {
|
||||
this.myOutput.walkStrength = this.strength;
|
||||
this.myOutput.stay = !this.isInput();
|
||||
if (this.myOutput.stay) this.execute(); // Stay optimization
|
||||
}
|
||||
|
||||
/**
|
||||
* Records that this constraint is unsatisfied
|
||||
*/
|
||||
UnaryConstraint.prototype.markUnsatisfied = function () {
|
||||
this.satisfied = false;
|
||||
}
|
||||
|
||||
UnaryConstraint.prototype.inputsKnown = function () {
|
||||
return true;
|
||||
}
|
||||
|
||||
UnaryConstraint.prototype.removeFromGraph = function () {
|
||||
if (this.myOutput != null) this.myOutput.removeConstraint(this);
|
||||
this.satisfied = false;
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* S t a y C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* Variables that should, with some level of preference, stay the same.
|
||||
* Planners may exploit the fact that instances, if satisfied, will not
|
||||
* change their output during plan execution. This is called "stay
|
||||
* optimization".
|
||||
*/
|
||||
function StayConstraint(v, str) {
|
||||
StayConstraint.superConstructor.call(this, v, str);
|
||||
}
|
||||
|
||||
StayConstraint.inheritsFrom(UnaryConstraint);
|
||||
|
||||
StayConstraint.prototype.execute = function () {
|
||||
// Stay constraints do nothing
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* E d i t C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* A unary input constraint used to mark a variable that the client
|
||||
* wishes to change.
|
||||
*/
|
||||
function EditConstraint(v, str) {
|
||||
EditConstraint.superConstructor.call(this, v, str);
|
||||
}
|
||||
|
||||
EditConstraint.inheritsFrom(UnaryConstraint);
|
||||
|
||||
/**
|
||||
* Edits indicate that a variable is to be changed by imperative code.
|
||||
*/
|
||||
EditConstraint.prototype.isInput = function () {
|
||||
return true;
|
||||
}
|
||||
|
||||
EditConstraint.prototype.execute = function () {
|
||||
// Edit constraints do nothing
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* B i n a r y C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
var Direction = new Object();
|
||||
Direction.NONE = 0;
|
||||
Direction.FORWARD = 1;
|
||||
Direction.BACKWARD = -1;
|
||||
|
||||
/**
|
||||
* Abstract superclass for constraints having two possible output
|
||||
* variables.
|
||||
*/
|
||||
function BinaryConstraint(var1, var2, strength) {
|
||||
BinaryConstraint.superConstructor.call(this, strength);
|
||||
this.v1 = var1;
|
||||
this.v2 = var2;
|
||||
this.direction = Direction.NONE;
|
||||
this.addConstraint();
|
||||
}
|
||||
|
||||
BinaryConstraint.inheritsFrom(Constraint);
|
||||
|
||||
/**
|
||||
* Decides if this constraint can be satisfied and which way it
|
||||
* should flow based on the relative strength of the variables related,
|
||||
* and record that decision.
|
||||
*/
|
||||
BinaryConstraint.prototype.chooseMethod = function (mark) {
|
||||
if (this.v1.mark == mark) {
|
||||
this.direction = (this.v2.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
|
||||
? Direction.FORWARD
|
||||
: Direction.NONE;
|
||||
}
|
||||
if (this.v2.mark == mark) {
|
||||
this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))
|
||||
? Direction.BACKWARD
|
||||
: Direction.NONE;
|
||||
}
|
||||
if (Strength.weaker(this.v1.walkStrength, this.v2.walkStrength)) {
|
||||
this.direction = Strength.stronger(this.strength, this.v1.walkStrength)
|
||||
? Direction.BACKWARD
|
||||
: Direction.NONE;
|
||||
} else {
|
||||
this.direction = Strength.stronger(this.strength, this.v2.walkStrength)
|
||||
? Direction.FORWARD
|
||||
: Direction.BACKWARD
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Add this constraint to the constraint graph
|
||||
*/
|
||||
BinaryConstraint.prototype.addToGraph = function () {
|
||||
this.v1.addConstraint(this);
|
||||
this.v2.addConstraint(this);
|
||||
this.direction = Direction.NONE;
|
||||
}
|
||||
|
||||
/**
|
||||
* Answer true if this constraint is satisfied in the current solution.
|
||||
*/
|
||||
BinaryConstraint.prototype.isSatisfied = function () {
|
||||
return this.direction != Direction.NONE;
|
||||
}
|
||||
|
||||
/**
|
||||
* Mark the input variable with the given mark.
|
||||
*/
|
||||
BinaryConstraint.prototype.markInputs = function (mark) {
|
||||
this.input().mark = mark;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the current input variable
|
||||
*/
|
||||
BinaryConstraint.prototype.input = function () {
|
||||
return (this.direction == Direction.FORWARD) ? this.v1 : this.v2;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the current output variable
|
||||
*/
|
||||
BinaryConstraint.prototype.output = function () {
|
||||
return (this.direction == Direction.FORWARD) ? this.v2 : this.v1;
|
||||
}
|
||||
|
||||
/**
|
||||
* Calculate the walkabout strength, the stay flag, and, if it is
|
||||
* 'stay', the value for the current output of this
|
||||
* constraint. Assume this constraint is satisfied.
|
||||
*/
|
||||
BinaryConstraint.prototype.recalculate = function () {
|
||||
var ihn = this.input(), out = this.output();
|
||||
out.walkStrength = Strength.weakestOf(this.strength, ihn.walkStrength);
|
||||
out.stay = ihn.stay;
|
||||
if (out.stay) this.execute();
|
||||
}
|
||||
|
||||
/**
|
||||
* Record the fact that this constraint is unsatisfied.
|
||||
*/
|
||||
BinaryConstraint.prototype.markUnsatisfied = function () {
|
||||
this.direction = Direction.NONE;
|
||||
}
|
||||
|
||||
BinaryConstraint.prototype.inputsKnown = function (mark) {
|
||||
var i = this.input();
|
||||
return i.mark == mark || i.stay || i.determinedBy == null;
|
||||
}
|
||||
|
||||
BinaryConstraint.prototype.removeFromGraph = function () {
|
||||
if (this.v1 != null) this.v1.removeConstraint(this);
|
||||
if (this.v2 != null) this.v2.removeConstraint(this);
|
||||
this.direction = Direction.NONE;
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* S c a l e C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* Relates two variables by the linear scaling relationship: "v2 =
|
||||
* (v1 * scale) + offset". Either v1 or v2 may be changed to maintain
|
||||
* this relationship but the scale factor and offset are considered
|
||||
* read-only.
|
||||
*/
|
||||
function ScaleConstraint(src, scale, offset, dest, strength) {
|
||||
this.direction = Direction.NONE;
|
||||
this.scale = scale;
|
||||
this.offset = offset;
|
||||
ScaleConstraint.superConstructor.call(this, src, dest, strength);
|
||||
}
|
||||
|
||||
ScaleConstraint.inheritsFrom(BinaryConstraint);
|
||||
|
||||
/**
|
||||
* Adds this constraint to the constraint graph.
|
||||
*/
|
||||
ScaleConstraint.prototype.addToGraph = function () {
|
||||
ScaleConstraint.superConstructor.prototype.addToGraph.call(this);
|
||||
this.scale.addConstraint(this);
|
||||
this.offset.addConstraint(this);
|
||||
}
|
||||
|
||||
ScaleConstraint.prototype.removeFromGraph = function () {
|
||||
ScaleConstraint.superConstructor.prototype.removeFromGraph.call(this);
|
||||
if (this.scale != null) this.scale.removeConstraint(this);
|
||||
if (this.offset != null) this.offset.removeConstraint(this);
|
||||
}
|
||||
|
||||
ScaleConstraint.prototype.markInputs = function (mark) {
|
||||
ScaleConstraint.superConstructor.prototype.markInputs.call(this, mark);
|
||||
this.scale.mark = this.offset.mark = mark;
|
||||
}
|
||||
|
||||
/**
|
||||
* Enforce this constraint. Assume that it is satisfied.
|
||||
*/
|
||||
ScaleConstraint.prototype.execute = function () {
|
||||
if (this.direction == Direction.FORWARD) {
|
||||
this.v2.value = this.v1.value * this.scale.value + this.offset.value;
|
||||
} else {
|
||||
this.v1.value = (this.v2.value - this.offset.value) / this.scale.value;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Calculate the walkabout strength, the stay flag, and, if it is
|
||||
* 'stay', the value for the current output of this constraint. Assume
|
||||
* this constraint is satisfied.
|
||||
*/
|
||||
ScaleConstraint.prototype.recalculate = function () {
|
||||
var ihn = this.input(), out = this.output();
|
||||
out.walkStrength = Strength.weakestOf(this.strength, ihn.walkStrength);
|
||||
out.stay = ihn.stay && this.scale.stay && this.offset.stay;
|
||||
if (out.stay) this.execute();
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* E q u a l i t y C o n s t r a i n t
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* Constrains two variables to have the same value.
|
||||
*/
|
||||
function EqualityConstraint(var1, var2, strength) {
|
||||
EqualityConstraint.superConstructor.call(this, var1, var2, strength);
|
||||
}
|
||||
|
||||
EqualityConstraint.inheritsFrom(BinaryConstraint);
|
||||
|
||||
/**
|
||||
* Enforce this constraint. Assume that it is satisfied.
|
||||
*/
|
||||
EqualityConstraint.prototype.execute = function () {
|
||||
this.output().value = this.input().value;
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* V a r i a b l e
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* A constrained variable. In addition to its value, it maintain the
|
||||
* structure of the constraint graph, the current dataflow graph, and
|
||||
* various parameters of interest to the DeltaBlue incremental
|
||||
* constraint solver.
|
||||
**/
|
||||
function Variable(name, initialValue) {
|
||||
this.value = initialValue || 0;
|
||||
this.constraints = new OrderedCollection();
|
||||
this.determinedBy = null;
|
||||
this.mark = 0;
|
||||
this.walkStrength = Strength.WEAKEST;
|
||||
this.stay = true;
|
||||
this.name = name;
|
||||
}
|
||||
|
||||
/**
|
||||
* Add the given constraint to the set of all constraints that refer
|
||||
* this variable.
|
||||
*/
|
||||
Variable.prototype.addConstraint = function (c) {
|
||||
this.constraints.add(c);
|
||||
}
|
||||
|
||||
/**
|
||||
* Removes all traces of c from this variable.
|
||||
*/
|
||||
Variable.prototype.removeConstraint = function (c) {
|
||||
this.constraints.remove(c);
|
||||
if (this.determinedBy == c) this.determinedBy = null;
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* P l a n n e r
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* The DeltaBlue planner
|
||||
*/
|
||||
function Planner() {
|
||||
this.currentMark = 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* Attempt to satisfy the given constraint and, if successful,
|
||||
* incrementally update the dataflow graph. Details: If satifying
|
||||
* the constraint is successful, it may override a weaker constraint
|
||||
* on its output. The algorithm attempts to resatisfy that
|
||||
* constraint using some other method. This process is repeated
|
||||
* until either a) it reaches a variable that was not previously
|
||||
* determined by any constraint or b) it reaches a constraint that
|
||||
* is too weak to be satisfied using any of its methods. The
|
||||
* variables of constraints that have been processed are marked with
|
||||
* a unique mark value so that we know where we've been. This allows
|
||||
* the algorithm to avoid getting into an infinite loop even if the
|
||||
* constraint graph has an inadvertent cycle.
|
||||
*/
|
||||
Planner.prototype.incrementalAdd = function (c) {
|
||||
var mark = this.newMark();
|
||||
var overridden = c.satisfy(mark);
|
||||
while (overridden != null)
|
||||
overridden = overridden.satisfy(mark);
|
||||
}
|
||||
|
||||
/**
|
||||
* Entry point for retracting a constraint. Remove the given
|
||||
* constraint and incrementally update the dataflow graph.
|
||||
* Details: Retracting the given constraint may allow some currently
|
||||
* unsatisfiable downstream constraint to be satisfied. We therefore collect
|
||||
* a list of unsatisfied downstream constraints and attempt to
|
||||
* satisfy each one in turn. This list is traversed by constraint
|
||||
* strength, strongest first, as a heuristic for avoiding
|
||||
* unnecessarily adding and then overriding weak constraints.
|
||||
* Assume: c is satisfied.
|
||||
*/
|
||||
Planner.prototype.incrementalRemove = function (c) {
|
||||
var out = c.output();
|
||||
c.markUnsatisfied();
|
||||
c.removeFromGraph();
|
||||
var unsatisfied = this.removePropagateFrom(out);
|
||||
var strength = Strength.REQUIRED;
|
||||
do {
|
||||
for (var u of unsatisfied.elms) {
|
||||
if (u.strength == strength)
|
||||
this.incrementalAdd(u);
|
||||
}
|
||||
strength = strength.nextWeaker();
|
||||
} while (strength != Strength.WEAKEST);
|
||||
}
|
||||
|
||||
/**
|
||||
* Select a previously unused mark value.
|
||||
*/
|
||||
Planner.prototype.newMark = function () {
|
||||
return ++this.currentMark;
|
||||
}
|
||||
|
||||
/**
|
||||
* Extract a plan for resatisfaction starting from the given source
|
||||
* constraints, usually a set of input constraints. This method
|
||||
* assumes that stay optimization is desired; the plan will contain
|
||||
* only constraints whose output variables are not stay. Constraints
|
||||
* that do no computation, such as stay and edit constraints, are
|
||||
* not included in the plan.
|
||||
* Details: The outputs of a constraint are marked when it is added
|
||||
* to the plan under construction. A constraint may be appended to
|
||||
* the plan when all its input variables are known. A variable is
|
||||
* known if either a) the variable is marked (indicating that has
|
||||
* been computed by a constraint appearing earlier in the plan), b)
|
||||
* the variable is 'stay' (i.e. it is a constant at plan execution
|
||||
* time), or c) the variable is not determined by any
|
||||
* constraint. The last provision is for past states of history
|
||||
* variables, which are not stay but which are also not computed by
|
||||
* any constraint.
|
||||
* Assume: sources are all satisfied.
|
||||
*/
|
||||
Planner.prototype.makePlan = function (sources) {
|
||||
var mark = this.newMark();
|
||||
var plan = new Plan();
|
||||
var todo = sources;
|
||||
while (todo.size() > 0) {
|
||||
var c = todo.removeFirst();
|
||||
if (c.output().mark != mark && c.inputsKnown(mark)) {
|
||||
plan.addConstraint(c);
|
||||
c.output().mark = mark;
|
||||
this.addConstraintsConsumingTo(c.output(), todo);
|
||||
}
|
||||
}
|
||||
return plan;
|
||||
}
|
||||
|
||||
/**
|
||||
* Extract a plan for resatisfying starting from the output of the
|
||||
* given constraints, usually a set of input constraints.
|
||||
*/
|
||||
Planner.prototype.extractPlanFromConstraints = function (constraints) {
|
||||
var sources = new OrderedCollection();
|
||||
for (var c of constraints.elms) {
|
||||
if (c.isInput() && c.isSatisfied())
|
||||
// not in plan already and eligible for inclusion
|
||||
sources.add(c);
|
||||
}
|
||||
return this.makePlan(sources);
|
||||
}
|
||||
|
||||
/**
|
||||
* Recompute the walkabout strengths and stay flags of all variables
|
||||
* downstream of the given constraint and recompute the actual
|
||||
* values of all variables whose stay flag is true. If a cycle is
|
||||
* detected, remove the given constraint and answer
|
||||
* false. Otherwise, answer true.
|
||||
* Details: Cycles are detected when a marked variable is
|
||||
* encountered downstream of the given constraint. The sender is
|
||||
* assumed to have marked the inputs of the given constraint with
|
||||
* the given mark. Thus, encountering a marked node downstream of
|
||||
* the output constraint means that there is a path from the
|
||||
* constraint's output to one of its inputs.
|
||||
*/
|
||||
Planner.prototype.addPropagate = function (c, mark) {
|
||||
var todo = new OrderedCollection();
|
||||
todo.add(c);
|
||||
while (todo.size() > 0) {
|
||||
var d = todo.removeFirst();
|
||||
if (d.output().mark == mark) {
|
||||
this.incrementalRemove(c);
|
||||
return false;
|
||||
}
|
||||
d.recalculate();
|
||||
this.addConstraintsConsumingTo(d.output(), todo);
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
/**
|
||||
* Update the walkabout strengths and stay flags of all variables
|
||||
* downstream of the given constraint. Answer a collection of
|
||||
* unsatisfied constraints sorted in order of decreasing strength.
|
||||
*/
|
||||
Planner.prototype.removePropagateFrom = function (out) {
|
||||
out.determinedBy = null;
|
||||
out.walkStrength = Strength.WEAKEST;
|
||||
out.stay = true;
|
||||
var unsatisfied = new OrderedCollection();
|
||||
var todo = new OrderedCollection();
|
||||
todo.add(out);
|
||||
while (todo.size() > 0) {
|
||||
var v = todo.removeFirst();
|
||||
for (var c of v.constraints.elms) {
|
||||
if (!c.isSatisfied())
|
||||
unsatisfied.add(c);
|
||||
}
|
||||
var determining = v.determinedBy;
|
||||
for (var next of v.constraints.elms) {
|
||||
if (next != determining && next.isSatisfied()) {
|
||||
next.recalculate();
|
||||
todo.add(next.output());
|
||||
}
|
||||
}
|
||||
}
|
||||
return unsatisfied;
|
||||
}
|
||||
|
||||
Planner.prototype.addConstraintsConsumingTo = function (v, coll) {
|
||||
var determining = v.determinedBy;
|
||||
var cc = v.constraints;
|
||||
for (var c of cc.elms) {
|
||||
if (c != determining && c.isSatisfied())
|
||||
coll.add(c);
|
||||
}
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* P l a n
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* A Plan is an ordered list of constraints to be executed in sequence
|
||||
* to resatisfy all currently satisfiable constraints in the face of
|
||||
* one or more changing inputs.
|
||||
*/
|
||||
function Plan() {
|
||||
this.v = new OrderedCollection();
|
||||
}
|
||||
|
||||
Plan.prototype.addConstraint = function (c) {
|
||||
this.v.add(c);
|
||||
}
|
||||
|
||||
Plan.prototype.size = function () {
|
||||
return this.v.size();
|
||||
}
|
||||
|
||||
Plan.prototype.constraintAt = function (index) {
|
||||
return this.v.at(index);
|
||||
}
|
||||
|
||||
Plan.prototype.execute = function () {
|
||||
for (var c of this.v.elms) {
|
||||
c.execute();
|
||||
}
|
||||
}
|
||||
|
||||
/* --- *
|
||||
* M a i n
|
||||
* --- */
|
||||
|
||||
/**
|
||||
* This is the standard DeltaBlue benchmark. A long chain of equality
|
||||
* constraints is constructed with a stay constraint on one end. An
|
||||
* edit constraint is then added to the opposite end and the time is
|
||||
* measured for adding and removing this constraint, and extracting
|
||||
* and executing a constraint satisfaction plan. There are two cases.
|
||||
* In case 1, the added constraint is stronger than the stay
|
||||
* constraint and values must propagate down the entire length of the
|
||||
* chain. In case 2, the added constraint is weaker than the stay
|
||||
* constraint so it cannot be accomodated. The cost in this case is,
|
||||
* of course, very low. Typical situations lie somewhere between these
|
||||
* two extremes.
|
||||
*/
|
||||
function chainTest(n) {
|
||||
planner = new Planner();
|
||||
var prev = null, first = null, last = null;
|
||||
|
||||
// Build chain of n equality constraints
|
||||
for (var i = 0; i <= n; i++) {
|
||||
var name = "v" + i;
|
||||
var v = new Variable(name);
|
||||
if (prev != null)
|
||||
new EqualityConstraint(prev, v, Strength.REQUIRED);
|
||||
if (i == 0) first = v;
|
||||
if (i == n) last = v;
|
||||
prev = v;
|
||||
}
|
||||
|
||||
new StayConstraint(last, Strength.STRONG_DEFAULT);
|
||||
var edit = new EditConstraint(first, Strength.PREFERRED);
|
||||
var edits = new OrderedCollection();
|
||||
edits.add(edit);
|
||||
var plan = planner.extractPlanFromConstraints(edits);
|
||||
for (var i = 0; i < 100; i++) {
|
||||
first.value = i;
|
||||
plan.execute();
|
||||
if (last.value != i)
|
||||
alert("Chain test failed.");
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* This test constructs a two sets of variables related to each
|
||||
* other by a simple linear transformation (scale and offset). The
|
||||
* time is measured to change a variable on either side of the
|
||||
* mapping and to change the scale and offset factors.
|
||||
*/
|
||||
function projectionTest(n) {
|
||||
planner = new Planner();
|
||||
var scale = new Variable("scale", 10);
|
||||
var offset = new Variable("offset", 1000);
|
||||
var src = null, dst = null;
|
||||
|
||||
var dests = new OrderedCollection();
|
||||
for (var i = 0; i < n; i++) {
|
||||
src = new Variable("src" + i, i);
|
||||
dst = new Variable("dst" + i, i);
|
||||
dests.add(dst);
|
||||
new StayConstraint(src, Strength.NORMAL);
|
||||
new ScaleConstraint(src, scale, offset, dst, Strength.REQUIRED);
|
||||
}
|
||||
|
||||
change(src, 17);
|
||||
if (dst.value != 1170) alert("Projection 1 failed");
|
||||
change(dst, 1050);
|
||||
if (src.value != 5) alert("Projection 2 failed");
|
||||
change(scale, 5);
|
||||
for (var i = 0; i < n - 1; i++) {
|
||||
if (dests.at(i).value != i * 5 + 1000)
|
||||
alert("Projection 3 failed");
|
||||
}
|
||||
change(offset, 2000);
|
||||
for (var i = 0; i < n - 1; i++) {
|
||||
if (dests.at(i).value != i * 5 + 2000)
|
||||
alert("Projection 4 failed");
|
||||
}
|
||||
}
|
||||
|
||||
function change(v, newValue) {
|
||||
var edit = new EditConstraint(v, Strength.PREFERRED);
|
||||
var edits = new OrderedCollection();
|
||||
edits.add(edit);
|
||||
var plan = planner.extractPlanFromConstraints(edits);
|
||||
for (var i = 0; i < 10; i++) {
|
||||
v.value = newValue;
|
||||
plan.execute();
|
||||
}
|
||||
edit.destroyConstraint();
|
||||
}
|
||||
|
||||
// Global variable holding the current planner.
|
||||
var planner = null;
|
||||
|
||||
function deltaBlue() {
|
||||
chainTest(50);
|
||||
projectionTest(50);
|
||||
}
|
||||
|
||||
for (var i = 0; i < 30; ++i)
|
||||
deltaBlue();
|
||||
|
|
@ -1,27 +0,0 @@
|
|||
// Types matching those in runtime/TypeSet
|
||||
var T = {
|
||||
Boolean:"Boolean",
|
||||
Integer: "Integer",
|
||||
Null: "Null",
|
||||
Number: "Number",
|
||||
Many: "(many)",
|
||||
String: "String",
|
||||
Undefined: "Undefined",
|
||||
Symbol: "Symbol",
|
||||
UndefinedOrNull: "(?)"
|
||||
};
|
||||
|
||||
var TOptional = {
|
||||
Boolean:"Boolean?",
|
||||
Integer: "Integer?",
|
||||
Number: "Number?",
|
||||
String: "String?",
|
||||
Symbol: "Symbol?"
|
||||
};
|
||||
|
||||
function assert(condition, reason) {
|
||||
if (!condition)
|
||||
throw new Error(reason);
|
||||
}
|
||||
|
||||
var MaxStructureCountWithoutOverflow = 100;
|
||||
|
|
@ -1,595 +0,0 @@
|
|||
//@ if $buildType == "debug" or $architecture =~ /arm|mips/ then skip else runTypeProfiler end
|
||||
|
||||
// Copyright 2006-2008 the V8 project authors. All rights reserved.
|
||||
// Copyright 2014 Apple Inc.
|
||||
// Redistribution and use in source and binary forms, with or without
|
||||
// modification, are permitted provided that the following conditions are
|
||||
// met:
|
||||
//
|
||||
// * Redistributions of source code must retain the above copyright
|
||||
// notice, this list of conditions and the following disclaimer.
|
||||
// * Redistributions in binary form must reproduce the above
|
||||
// copyright notice, this list of conditions and the following
|
||||
// disclaimer in the documentation and/or other materials provided
|
||||
// with the distribution.
|
||||
// * Neither the name of Google Inc. nor the names of its
|
||||
// contributors may be used to endorse or promote products derived
|
||||
// from this software without specific prior written permission.
|
||||
//
|
||||
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
|
||||
// This is a JavaScript implementation of the Richards
|
||||
// benchmark from:
|
||||
//
|
||||
// http://www.cl.cam.ac.uk/~mr10/Bench.html
|
||||
//
|
||||
// The benchmark was originally implemented in BCPL by
|
||||
// Martin Richards. It was then ported to JavaScript by the
|
||||
// V8 project authors, and then subsequently it was modified
|
||||
// to use getters and setters by WebKit authors.
|
||||
|
||||
|
||||
/**
|
||||
* The Richards benchmark simulates the task dispatcher of an
|
||||
* operating system.
|
||||
**/
|
||||
function runRichards() {
|
||||
var scheduler = new Scheduler();
|
||||
scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);
|
||||
|
||||
var queue = new Packet(null, ID_WORKER, KIND_WORK);
|
||||
queue = new Packet(queue, ID_WORKER, KIND_WORK);
|
||||
scheduler.addWorkerTask(ID_WORKER, 1000, queue);
|
||||
|
||||
queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
|
||||
queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
|
||||
queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
|
||||
scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue);
|
||||
|
||||
queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
|
||||
queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
|
||||
queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
|
||||
scheduler.addHandlerTask(ID_HANDLER_B, 3000, queue);
|
||||
|
||||
scheduler.addDeviceTask(ID_DEVICE_A, 4000, null);
|
||||
|
||||
scheduler.addDeviceTask(ID_DEVICE_B, 5000, null);
|
||||
|
||||
scheduler.schedule();
|
||||
|
||||
if (scheduler.queueCount != EXPECTED_QUEUE_COUNT ||
|
||||
scheduler.holdCount != EXPECTED_HOLD_COUNT) {
|
||||
var msg =
|
||||
"Error during execution: queueCount = " + scheduler.queueCount +
|
||||
", holdCount = " + scheduler.holdCount + ".";
|
||||
throw new Error(msg);
|
||||
}
|
||||
}
|
||||
|
||||
var COUNT = 1000;
|
||||
|
||||
/**
|
||||
* These two constants specify how many times a packet is queued and
|
||||
* how many times a task is put on hold in a correct run of richards.
|
||||
* They don't have any meaning a such but are characteristic of a
|
||||
* correct run so if the actual queue or hold count is different from
|
||||
* the expected there must be a bug in the implementation.
|
||||
**/
|
||||
var EXPECTED_QUEUE_COUNT = 2322;
|
||||
var EXPECTED_HOLD_COUNT = 928;
|
||||
|
||||
|
||||
/**
|
||||
* A scheduler can be used to schedule a set of tasks based on their relative
|
||||
* priorities. Scheduling is done by maintaining a list of task control blocks
|
||||
* which holds tasks and the data queue they are processing.
|
||||
* @constructor
|
||||
*/
|
||||
function Scheduler() {
|
||||
this._queueCount = 0;
|
||||
this._holdCount = 0;
|
||||
this._blocks = new Array(NUMBER_OF_IDS);
|
||||
this._list = null;
|
||||
this._currentTcb = null;
|
||||
this._currentId = null;
|
||||
}
|
||||
|
||||
var ID_IDLE = 0;
|
||||
var ID_WORKER = 1;
|
||||
var ID_HANDLER_A = 2;
|
||||
var ID_HANDLER_B = 3;
|
||||
var ID_DEVICE_A = 4;
|
||||
var ID_DEVICE_B = 5;
|
||||
var NUMBER_OF_IDS = 6;
|
||||
|
||||
var KIND_DEVICE = 0;
|
||||
var KIND_WORK = 1;
|
||||
|
||||
Scheduler.prototype.__defineGetter__("queueCount", function() { return this._queueCount; });
|
||||
Scheduler.prototype.__defineSetter__("queueCount", function(value) { this._queueCount = value; });
|
||||
Scheduler.prototype.__defineGetter__("holdCount", function() { return this._holdCount; });
|
||||
Scheduler.prototype.__defineSetter__("holdCount", function(value) { this._holdCount = value; });
|
||||
Scheduler.prototype.__defineGetter__("blocks", function() { return this._blocks; });
|
||||
Scheduler.prototype.__defineSetter__("blocks", function(value) { this._blocks = value; });
|
||||
Scheduler.prototype.__defineGetter__("list", function() { return this._list; });
|
||||
Scheduler.prototype.__defineSetter__("list", function(value) { this._list = value; });
|
||||
Scheduler.prototype.__defineGetter__("currentTcb", function() { return this._currentTcb; });
|
||||
Scheduler.prototype.__defineSetter__("currentTcb", function(value) { this._currentTcb = value; });
|
||||
Scheduler.prototype.__defineGetter__("currentId", function() { return this._currentId; });
|
||||
Scheduler.prototype.__defineSetter__("currentId", function(value) { this._currentId = value; });
|
||||
|
||||
/**
|
||||
* Add an idle task to this scheduler.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
* @param {int} count the number of times to schedule the task
|
||||
*/
|
||||
Scheduler.prototype.addIdleTask = function (id, priority, queue, count) {
|
||||
this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
|
||||
};
|
||||
|
||||
/**
|
||||
* Add a work task to this scheduler.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
*/
|
||||
Scheduler.prototype.addWorkerTask = function (id, priority, queue) {
|
||||
this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
|
||||
};
|
||||
|
||||
/**
|
||||
* Add a handler task to this scheduler.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
*/
|
||||
Scheduler.prototype.addHandlerTask = function (id, priority, queue) {
|
||||
this.addTask(id, priority, queue, new HandlerTask(this));
|
||||
};
|
||||
|
||||
/**
|
||||
* Add a handler task to this scheduler.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
*/
|
||||
Scheduler.prototype.addDeviceTask = function (id, priority, queue) {
|
||||
this.addTask(id, priority, queue, new DeviceTask(this))
|
||||
};
|
||||
|
||||
/**
|
||||
* Add the specified task and mark it as running.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
* @param {Task} task the task to add
|
||||
*/
|
||||
Scheduler.prototype.addRunningTask = function (id, priority, queue, task) {
|
||||
this.addTask(id, priority, queue, task);
|
||||
this.currentTcb.setRunning();
|
||||
};
|
||||
|
||||
/**
|
||||
* Add the specified task to this scheduler.
|
||||
* @param {int} id the identity of the task
|
||||
* @param {int} priority the task's priority
|
||||
* @param {Packet} queue the queue of work to be processed by the task
|
||||
* @param {Task} task the task to add
|
||||
*/
|
||||
Scheduler.prototype.addTask = function (id, priority, queue, task) {
|
||||
this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);
|
||||
this.list = this.currentTcb;
|
||||
this.blocks[id] = this.currentTcb;
|
||||
};
|
||||
|
||||
/**
|
||||
* Execute the tasks managed by this scheduler.
|
||||
*/
|
||||
Scheduler.prototype.schedule = function () {
|
||||
this.currentTcb = this.list;
|
||||
while (this.currentTcb != null) {
|
||||
if (this.currentTcb.isHeldOrSuspended()) {
|
||||
this.currentTcb = this.currentTcb.link;
|
||||
} else {
|
||||
this.currentId = this.currentTcb.id;
|
||||
this.currentTcb = this.currentTcb.run();
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Release a task that is currently blocked and return the next block to run.
|
||||
* @param {int} id the id of the task to suspend
|
||||
*/
|
||||
Scheduler.prototype.release = function (id) {
|
||||
var tcb = this.blocks[id];
|
||||
if (tcb == null) return tcb;
|
||||
tcb.markAsNotHeld();
|
||||
if (tcb.priority > this.currentTcb.priority) {
|
||||
return tcb;
|
||||
} else {
|
||||
return this.currentTcb;
|
||||
}
|
||||
};
|
||||
|
||||
/**
|
||||
* Block the currently executing task and return the next task control block
|
||||
* to run. The blocked task will not be made runnable until it is explicitly
|
||||
* released, even if new work is added to it.
|
||||
*/
|
||||
Scheduler.prototype.holdCurrent = function () {
|
||||
this.holdCount++;
|
||||
this.currentTcb.markAsHeld();
|
||||
return this.currentTcb.link;
|
||||
};
|
||||
|
||||
/**
|
||||
* Suspend the currently executing task and return the next task control block
|
||||
* to run. If new work is added to the suspended task it will be made runnable.
|
||||
*/
|
||||
Scheduler.prototype.suspendCurrent = function () {
|
||||
this.currentTcb.markAsSuspended();
|
||||
return this.currentTcb;
|
||||
};
|
||||
|
||||
/**
|
||||
* Add the specified packet to the end of the worklist used by the task
|
||||
* associated with the packet and make the task runnable if it is currently
|
||||
* suspended.
|
||||
* @param {Packet} packet the packet to add
|
||||
*/
|
||||
Scheduler.prototype.queue = function (packet) {
|
||||
var t = this.blocks[packet.id];
|
||||
if (t == null) return t;
|
||||
this.queueCount++;
|
||||
packet.link = null;
|
||||
packet.id = this.currentId;
|
||||
return t.checkPriorityAdd(this.currentTcb, packet);
|
||||
};
|
||||
|
||||
/**
|
||||
* A task control block manages a task and the queue of work packages associated
|
||||
* with it.
|
||||
* @param {TaskControlBlock} link the preceding block in the linked block list
|
||||
* @param {int} id the id of this block
|
||||
* @param {int} priority the priority of this block
|
||||
* @param {Packet} queue the queue of packages to be processed by the task
|
||||
* @param {Task} task the task
|
||||
* @constructor
|
||||
*/
|
||||
function TaskControlBlock(link, id, priority, queue, task) {
|
||||
this._link = link;
|
||||
this._id = id;
|
||||
this._priority = priority;
|
||||
this._queue = queue;
|
||||
this._task = task;
|
||||
if (queue == null) {
|
||||
this.state = STATE_SUSPENDED;
|
||||
} else {
|
||||
this.state = STATE_SUSPENDED_RUNNABLE;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* The task is running and is currently scheduled.
|
||||
*/
|
||||
var STATE_RUNNING = 0;
|
||||
|
||||
/**
|
||||
* The task has packets left to process.
|
||||
*/
|
||||
var STATE_RUNNABLE = 1;
|
||||
|
||||
/**
|
||||
* The task is not currently running. The task is not blocked as such and may
|
||||
* be started by the scheduler.
|
||||
*/
|
||||
var STATE_SUSPENDED = 2;
|
||||
|
||||
/**
|
||||
* The task is blocked and cannot be run until it is explicitly released.
|
||||
*/
|
||||
var STATE_HELD = 4;
|
||||
|
||||
var STATE_SUSPENDED_RUNNABLE = STATE_SUSPENDED | STATE_RUNNABLE;
|
||||
var STATE_NOT_HELD = ~STATE_HELD;
|
||||
|
||||
TaskControlBlock.prototype.__defineGetter__("link", function() { return this._link; });
|
||||
TaskControlBlock.prototype.__defineGetter__("id", function() { return this._id; });
|
||||
TaskControlBlock.prototype.__defineGetter__("priority", function() { return this._priority; });
|
||||
TaskControlBlock.prototype.__defineGetter__("queue", function() { return this._queue; });
|
||||
TaskControlBlock.prototype.__defineSetter__("queue", function(value) { this._queue = value; });
|
||||
TaskControlBlock.prototype.__defineGetter__("task", function() { return this._task; });
|
||||
TaskControlBlock.prototype.__defineGetter__("state", function() { return this._state; });
|
||||
TaskControlBlock.prototype.__defineSetter__("state", function(value) { this._state = value; });
|
||||
|
||||
TaskControlBlock.prototype.setRunning = function () {
|
||||
this.state = STATE_RUNNING;
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.markAsNotHeld = function () {
|
||||
this.state = this.state & STATE_NOT_HELD;
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.markAsHeld = function () {
|
||||
this.state = this.state | STATE_HELD;
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.isHeldOrSuspended = function () {
|
||||
return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.markAsSuspended = function () {
|
||||
this.state = this.state | STATE_SUSPENDED;
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.markAsRunnable = function () {
|
||||
this.state = this.state | STATE_RUNNABLE;
|
||||
};
|
||||
|
||||
/**
|
||||
* Runs this task, if it is ready to be run, and returns the next task to run.
|
||||
*/
|
||||
TaskControlBlock.prototype.run = function () {
|
||||
var packet;
|
||||
if (this.state == STATE_SUSPENDED_RUNNABLE) {
|
||||
packet = this.queue;
|
||||
this.queue = packet.link;
|
||||
if (this.queue == null) {
|
||||
this.state = STATE_RUNNING;
|
||||
} else {
|
||||
this.state = STATE_RUNNABLE;
|
||||
}
|
||||
} else {
|
||||
packet = null;
|
||||
}
|
||||
return this.task.run(packet);
|
||||
};
|
||||
|
||||
/**
|
||||
* Adds a packet to the worklist of this block's task, marks this as runnable if
|
||||
* necessary, and returns the next runnable object to run (the one
|
||||
* with the highest priority).
|
||||
*/
|
||||
TaskControlBlock.prototype.checkPriorityAdd = function (task, packet) {
|
||||
if (this.queue == null) {
|
||||
this.queue = packet;
|
||||
this.markAsRunnable();
|
||||
if (this.priority > task.priority) return this;
|
||||
} else {
|
||||
this.queue = packet.addTo(this.queue);
|
||||
}
|
||||
return task;
|
||||
};
|
||||
|
||||
TaskControlBlock.prototype.toString = function () {
|
||||
return "tcb { " + this.task + "@" + this.state + " }";
|
||||
};
|
||||
|
||||
/**
|
||||
* An idle task doesn't do any work itself but cycles control between the two
|
||||
* device tasks.
|
||||
* @param {Scheduler} scheduler the scheduler that manages this task
|
||||
* @param {int} v1 a seed value that controls how the device tasks are scheduled
|
||||
* @param {int} count the number of times this task should be scheduled
|
||||
* @constructor
|
||||
*/
|
||||
function IdleTask(scheduler, v1, count) {
|
||||
this._scheduler = scheduler;
|
||||
this._v1 = v1;
|
||||
this._count = count;
|
||||
}
|
||||
|
||||
IdleTask.prototype.__defineGetter__("scheduler", function() { return this._scheduler; });
|
||||
IdleTask.prototype.__defineGetter__("v1", function() { return this._v1; });
|
||||
IdleTask.prototype.__defineSetter__("v1", function(value) { this._v1 = value; });
|
||||
IdleTask.prototype.__defineGetter__("count", function() { return this._count; });
|
||||
IdleTask.prototype.__defineSetter__("count", function(value) { this._count = value; });
|
||||
|
||||
IdleTask.prototype.run = function (packet) {
|
||||
this.count--;
|
||||
if (this.count == 0) return this.scheduler.holdCurrent();
|
||||
if ((this.v1 & 1) == 0) {
|
||||
this.v1 = this.v1 >> 1;
|
||||
return this.scheduler.release(ID_DEVICE_A);
|
||||
} else {
|
||||
this.v1 = (this.v1 >> 1) ^ 0xD008;
|
||||
return this.scheduler.release(ID_DEVICE_B);
|
||||
}
|
||||
};
|
||||
|
||||
IdleTask.prototype.toString = function () {
|
||||
return "IdleTask"
|
||||
};
|
||||
|
||||
/**
|
||||
* A task that suspends itself after each time it has been run to simulate
|
||||
* waiting for data from an external device.
|
||||
* @param {Scheduler} scheduler the scheduler that manages this task
|
||||
* @constructor
|
||||
*/
|
||||
function DeviceTask(scheduler) {
|
||||
this._scheduler = scheduler;
|
||||
this._v1 = null;
|
||||
}
|
||||
|
||||
DeviceTask.prototype.__defineGetter__("scheduler", function() { return this._scheduler; });
|
||||
DeviceTask.prototype.__defineGetter__("v1", function() { return this._v1; });
|
||||
DeviceTask.prototype.__defineSetter__("v1", function(value) { this._v1 = value; });
|
||||
|
||||
DeviceTask.prototype.run = function (packet) {
|
||||
if (packet == null) {
|
||||
if (this.v1 == null) return this.scheduler.suspendCurrent();
|
||||
var v = this.v1;
|
||||
this.v1 = null;
|
||||
return this.scheduler.queue(v);
|
||||
} else {
|
||||
this.v1 = packet;
|
||||
return this.scheduler.holdCurrent();
|
||||
}
|
||||
};
|
||||
|
||||
DeviceTask.prototype.toString = function () {
|
||||
return "DeviceTask";
|
||||
};
|
||||
|
||||
/**
|
||||
* A task that manipulates work packets.
|
||||
* @param {Scheduler} scheduler the scheduler that manages this task
|
||||
* @param {int} v1 a seed used to specify how work packets are manipulated
|
||||
* @param {int} v2 another seed used to specify how work packets are manipulated
|
||||
* @constructor
|
||||
*/
|
||||
function WorkerTask(scheduler, v1, v2) {
|
||||
this._scheduler = scheduler;
|
||||
this._v1 = v1;
|
||||
this._v2 = v2;
|
||||
}
|
||||
|
||||
WorkerTask.prototype.__defineGetter__("scheduler", function() { return this._scheduler; });
|
||||
WorkerTask.prototype.__defineGetter__("v1", function() { return this._v1; });
|
||||
WorkerTask.prototype.__defineSetter__("v1", function(value) { this._v1 = value; });
|
||||
WorkerTask.prototype.__defineGetter__("v2", function() { return this._v2; });
|
||||
WorkerTask.prototype.__defineSetter__("v2", function(value) { this._v2 = value; });
|
||||
|
||||
WorkerTask.prototype.run = function (packet) {
|
||||
if (packet == null) {
|
||||
return this.scheduler.suspendCurrent();
|
||||
} else {
|
||||
if (this.v1 == ID_HANDLER_A) {
|
||||
this.v1 = ID_HANDLER_B;
|
||||
} else {
|
||||
this.v1 = ID_HANDLER_A;
|
||||
}
|
||||
packet.id = this.v1;
|
||||
packet.a1 = 0;
|
||||
for (var i = 0; i < DATA_SIZE; i++) {
|
||||
this.v2++;
|
||||
if (this.v2 > 26) this.v2 = 1;
|
||||
packet.a2[i] = this.v2;
|
||||
}
|
||||
return this.scheduler.queue(packet);
|
||||
}
|
||||
};
|
||||
|
||||
WorkerTask.prototype.toString = function () {
|
||||
return "WorkerTask";
|
||||
};
|
||||
|
||||
/**
|
||||
* A task that manipulates work packets and then suspends itself.
|
||||
* @param {Scheduler} scheduler the scheduler that manages this task
|
||||
* @constructor
|
||||
*/
|
||||
function HandlerTask(scheduler) {
|
||||
this._scheduler = scheduler;
|
||||
this._v1 = null;
|
||||
this._v2 = null;
|
||||
}
|
||||
|
||||
HandlerTask.prototype.__defineGetter__("scheduler", function() { return this._scheduler; });
|
||||
HandlerTask.prototype.__defineGetter__("v1", function() { return this._v1; });
|
||||
HandlerTask.prototype.__defineSetter__("v1", function(value) { this._v1 = value; });
|
||||
HandlerTask.prototype.__defineGetter__("v2", function() { return this._v2; });
|
||||
HandlerTask.prototype.__defineSetter__("v2", function(value) { this._v2 = value; });
|
||||
|
||||
HandlerTask.prototype.run = function (packet) {
|
||||
if (packet != null) {
|
||||
if (packet.kind == KIND_WORK) {
|
||||
this.v1 = packet.addTo(this.v1);
|
||||
} else {
|
||||
this.v2 = packet.addTo(this.v2);
|
||||
}
|
||||
}
|
||||
if (this.v1 != null) {
|
||||
var count = this.v1.a1;
|
||||
var v;
|
||||
if (count < DATA_SIZE) {
|
||||
if (this.v2 != null) {
|
||||
v = this.v2;
|
||||
this.v2 = this.v2.link;
|
||||
v.a1 = this.v1.a2[count];
|
||||
this.v1.a1 = count + 1;
|
||||
return this.scheduler.queue(v);
|
||||
}
|
||||
} else {
|
||||
v = this.v1;
|
||||
this.v1 = this.v1.link;
|
||||
return this.scheduler.queue(v);
|
||||
}
|
||||
}
|
||||
return this.scheduler.suspendCurrent();
|
||||
};
|
||||
|
||||
HandlerTask.prototype.toString = function () {
|
||||
return "HandlerTask";
|
||||
};
|
||||
|
||||
/* --- *
|
||||
* P a c k e t
|
||||
* --- */
|
||||
|
||||
var DATA_SIZE = 4;
|
||||
|
||||
/**
|
||||
* A simple package of data that is manipulated by the tasks. The exact layout
|
||||
* of the payload data carried by a packet is not importaint, and neither is the
|
||||
* nature of the work performed on packets by the tasks.
|
||||
*
|
||||
* Besides carrying data, packets form linked lists and are hence used both as
|
||||
* data and worklists.
|
||||
* @param {Packet} link the tail of the linked list of packets
|
||||
* @param {int} id an ID for this packet
|
||||
* @param {int} kind the type of this packet
|
||||
* @constructor
|
||||
*/
|
||||
function Packet(link, id, kind) {
|
||||
this._link = link;
|
||||
this._id = id;
|
||||
this._kind = kind;
|
||||
this._a1 = 0;
|
||||
this._a2 = new Array(DATA_SIZE);
|
||||
}
|
||||
|
||||
Packet.prototype.__defineGetter__("link", function() { return this._link; });
|
||||
Packet.prototype.__defineSetter__("link", function(value) { this._link = value; });
|
||||
Packet.prototype.__defineGetter__("id", function() { return this._id; });
|
||||
Packet.prototype.__defineSetter__("id", function(value) { this._id = value; });
|
||||
Packet.prototype.__defineGetter__("kind", function() { return this._kind; });
|
||||
Packet.prototype.__defineGetter__("a1", function() { return this._a1; });
|
||||
Packet.prototype.__defineSetter__("a1", function(value) { this._a1 = value; });
|
||||
Packet.prototype.__defineGetter__("a2", function() { return this._a2; });
|
||||
|
||||
/**
|
||||
* Add this packet to the end of a worklist, and return the worklist.
|
||||
* @param {Packet} queue the worklist to add this packet to
|
||||
*/
|
||||
Packet.prototype.addTo = function (queue) {
|
||||
this.link = null;
|
||||
if (queue == null) return this;
|
||||
var peek, next = queue;
|
||||
while ((peek = next.link) != null)
|
||||
next = peek;
|
||||
next.link = this;
|
||||
return queue;
|
||||
};
|
||||
|
||||
Packet.prototype.toString = function () {
|
||||
return "Packet";
|
||||
};
|
||||
|
||||
for (var i = 0; i < 150; ++i)
|
||||
runRichards();
|
||||
|
|
@ -1,25 +0,0 @@
|
|||
load("./driver/driver.js");
|
||||
|
||||
// The goal of this test is to just ensure that we don't crash the type profiler.
|
||||
|
||||
function bar(o) {
|
||||
o[Math.random() + "foo"] = new Array(100);
|
||||
return o;
|
||||
}
|
||||
noInline(bar);
|
||||
|
||||
function foo(o) {
|
||||
let x = bar(o);
|
||||
return x;
|
||||
}
|
||||
noInline(foo);
|
||||
|
||||
let o = {};
|
||||
for (let i = 0; i < 2000; i++) {
|
||||
if (i % 5 === 0)
|
||||
o = {};
|
||||
foo(o);
|
||||
for (let i = 0; i < 20; i++) {
|
||||
new Array(100);
|
||||
}
|
||||
}
|
||||
Loading…
Reference in New Issue