| //////////////////////////////////////////////////////////////////////////////// |
| // base.js |
| //////////////////////////////////////////////////////////////////////////////// |
| |
| // Copyright 2013 the V8 project authors. All rights reserved. |
| // 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. |
| |
| if(typeof(WScript) === "undefined") |
| { |
| var WScript = { |
| Echo: print |
| } |
| } |
| |
| // Performance.now is used in latency benchmarks, the fallback is Date.now. |
| var performance = performance || {}; |
| performance.now = (function() { |
| return performance.now || |
| performance.mozNow || |
| performance.msNow || |
| performance.oNow || |
| performance.webkitNow || |
| Date.now; |
| })(); |
| |
| // Simple framework for running the benchmark suites and |
| // computing a score based on the timing measurements. |
| |
| |
| // A benchmark has a name (string) and a function that will be run to |
| // do the performance measurement. The optional setup and tearDown |
| // arguments are functions that will be invoked before and after |
| // running the benchmark, but the running time of these functions will |
| // not be accounted for in the benchmark score. |
| function Benchmark(name, doWarmup, doDeterministic, deterministicIterations, |
| run, setup, tearDown, rmsResult, minIterations) { |
| this.name = name; |
| this.doWarmup = doWarmup; |
| this.doDeterministic = doDeterministic; |
| this.deterministicIterations = deterministicIterations; |
| this.run = run; |
| this.Setup = setup ? setup : function() { }; |
| this.TearDown = tearDown ? tearDown : function() { }; |
| this.rmsResult = rmsResult ? rmsResult : null; |
| this.minIterations = minIterations ? minIterations : 32; |
| } |
| |
| |
| // Benchmark results hold the benchmark and the measured time used to |
| // run the benchmark. The benchmark score is computed later once a |
| // full benchmark suite has run to completion. If latency is set to 0 |
| // then there is no latency score for this benchmark. |
| function BenchmarkResult(benchmark, time, latency) { |
| this.benchmark = benchmark; |
| this.time = time; |
| this.latency = latency; |
| } |
| |
| |
| // Automatically convert results to numbers. Used by the geometric |
| // mean computation. |
| BenchmarkResult.prototype.valueOf = function() { |
| return this.time; |
| } |
| |
| |
| // Suites of benchmarks consist of a name and the set of benchmarks in |
| // addition to the reference timing that the final score will be based |
| // on. This way, all scores are relative to a reference run and higher |
| // scores implies better performance. |
| function BenchmarkSuite(name, reference, benchmarks) { |
| this.name = name; |
| this.reference = reference; |
| this.benchmarks = benchmarks; |
| BenchmarkSuite.suites.push(this); |
| } |
| |
| |
| // Keep track of all declared benchmark suites. |
| BenchmarkSuite.suites = []; |
| |
| // Scores are not comparable across versions. Bump the version if |
| // you're making changes that will affect that scores, e.g. if you add |
| // a new benchmark or change an existing one. |
| BenchmarkSuite.version = '9'; |
| |
| |
| // Defines global benchsuite running mode that overrides benchmark suite |
| // behavior. Intended to be set by the benchmark driver. Undefined |
| // values here allow a benchmark to define behaviour itself. |
| BenchmarkSuite.config = { |
| doWarmup: undefined, |
| doDeterministic: undefined |
| }; |
| |
| |
| // Override the alert function to throw an exception instead. |
| alert = function(s) { |
| throw "Alert called with argument: " + s; |
| }; |
| |
| |
| // To make the benchmark results predictable, we replace Math.random |
| // with a 100% deterministic alternative. |
| BenchmarkSuite.ResetRNG = function() { |
| Math.random = (function() { |
| var seed = 49734321; |
| return function() { |
| // Robert Jenkins' 32 bit integer hash function. |
| seed = ((seed + 0x7ed55d16) + (seed << 12)) & 0xffffffff; |
| seed = ((seed ^ 0xc761c23c) ^ (seed >>> 19)) & 0xffffffff; |
| seed = ((seed + 0x165667b1) + (seed << 5)) & 0xffffffff; |
| seed = ((seed + 0xd3a2646c) ^ (seed << 9)) & 0xffffffff; |
| seed = ((seed + 0xfd7046c5) + (seed << 3)) & 0xffffffff; |
| seed = ((seed ^ 0xb55a4f09) ^ (seed >>> 16)) & 0xffffffff; |
| return (seed & 0xfffffff) / 0x10000000; |
| }; |
| })(); |
| } |
| |
| |
| // Runs all registered benchmark suites and optionally yields between |
| // each individual benchmark to avoid running for too long in the |
| // context of browsers. Once done, the final score is reported to the |
| // runner. |
| BenchmarkSuite.RunSuites = function(runner, skipBenchmarks) { |
| skipBenchmarks = typeof skipBenchmarks === 'undefined' ? [] : skipBenchmarks; |
| var continuation = null; |
| var suites = BenchmarkSuite.suites; |
| var length = suites.length; |
| BenchmarkSuite.scores = []; |
| var index = 0; |
| function RunStep() { |
| while (continuation || index < length) { |
| if (continuation) { |
| continuation = continuation(); |
| } else { |
| var suite = suites[index++]; |
| if (runner.NotifyStart) runner.NotifyStart(suite.name); |
| if (skipBenchmarks.indexOf(suite.name) > -1) { |
| suite.NotifySkipped(runner); |
| } else { |
| continuation = suite.RunStep(runner); |
| } |
| } |
| if (continuation && typeof window != 'undefined' && window.setTimeout) { |
| window.setTimeout(RunStep, 25); |
| return; |
| } |
| } |
| |
| // show final result |
| if (runner.NotifyScore) { |
| var score = BenchmarkSuite.GeometricMean(BenchmarkSuite.scores); |
| var formatted = BenchmarkSuite.FormatScore(100 * score); |
| runner.NotifyScore(formatted); |
| } |
| } |
| RunStep(); |
| } |
| |
| |
| // Counts the total number of registered benchmarks. Useful for |
| // showing progress as a percentage. |
| BenchmarkSuite.CountBenchmarks = function() { |
| var result = 0; |
| var suites = BenchmarkSuite.suites; |
| for (var i = 0; i < suites.length; i++) { |
| result += suites[i].benchmarks.length; |
| } |
| return result; |
| } |
| |
| |
| // Computes the geometric mean of a set of numbers. |
| BenchmarkSuite.GeometricMean = function(numbers) { |
| var log = 0; |
| for (var i = 0; i < numbers.length; i++) { |
| log += Math.log(numbers[i]); |
| } |
| return Math.pow(Math.E, log / numbers.length); |
| } |
| |
| |
| // Computes the geometric mean of a set of throughput time measurements. |
| BenchmarkSuite.GeometricMeanTime = function(measurements) { |
| var log = 0; |
| for (var i = 0; i < measurements.length; i++) { |
| log += Math.log(measurements[i].time); |
| } |
| return Math.pow(Math.E, log / measurements.length); |
| } |
| |
| |
| // Computes the geometric mean of a set of rms measurements. |
| BenchmarkSuite.GeometricMeanLatency = function(measurements) { |
| var log = 0; |
| var hasLatencyResult = false; |
| for (var i = 0; i < measurements.length; i++) { |
| if (measurements[i].latency != 0) { |
| log += Math.log(measurements[i].latency); |
| hasLatencyResult = true; |
| } |
| } |
| if (hasLatencyResult) { |
| return Math.pow(Math.E, log / measurements.length); |
| } else { |
| return 0; |
| } |
| } |
| |
| |
| // Converts a score value to a string with at least three significant |
| // digits. |
| BenchmarkSuite.FormatScore = function(value) { |
| if (value > 100) { |
| return value.toFixed(0); |
| } else { |
| return value.toPrecision(3); |
| } |
| } |
| |
| // Notifies the runner that we're done running a single benchmark in |
| // the benchmark suite. This can be useful to report progress. |
| BenchmarkSuite.prototype.NotifyStep = function(result) { |
| this.results.push(result); |
| if (this.runner.NotifyStep) this.runner.NotifyStep(result.benchmark.name); |
| } |
| |
| |
| // Notifies the runner that we're done with running a suite and that |
| // we have a result which can be reported to the user if needed. |
| BenchmarkSuite.prototype.NotifyResult = function() { |
| var mean = BenchmarkSuite.GeometricMeanTime(this.results); |
| var score = this.reference[0] / mean; |
| BenchmarkSuite.scores.push(score); |
| if (this.runner.NotifyResult) { |
| var formatted = BenchmarkSuite.FormatScore(100 * score); |
| this.runner.NotifyResult(this.name, formatted); |
| } |
| if (this.reference.length == 2) { |
| var meanLatency = BenchmarkSuite.GeometricMeanLatency(this.results); |
| if (meanLatency != 0) { |
| var scoreLatency = this.reference[1] / meanLatency; |
| BenchmarkSuite.scores.push(scoreLatency); |
| if (this.runner.NotifyResult) { |
| var formattedLatency = BenchmarkSuite.FormatScore(100 * scoreLatency) |
| this.runner.NotifyResult(this.name + "Latency", formattedLatency); |
| } |
| } |
| } |
| } |
| |
| |
| BenchmarkSuite.prototype.NotifySkipped = function(runner) { |
| BenchmarkSuite.scores.push(1); // push default reference score. |
| if (runner.NotifyResult) { |
| runner.NotifyResult(this.name, "Skipped"); |
| } |
| } |
| |
| |
| // Notifies the runner that running a benchmark resulted in an error. |
| BenchmarkSuite.prototype.NotifyError = function(error) { |
| if (this.runner.NotifyError) { |
| this.runner.NotifyError(this.name, error); |
| } |
| if (this.runner.NotifyStep) { |
| this.runner.NotifyStep(this.name); |
| } |
| } |
| |
| |
| // Runs a single benchmark for at least a second and computes the |
| // average time it takes to run a single iteration. |
| BenchmarkSuite.prototype.RunSingleBenchmark = function(benchmark, data) { |
| var config = BenchmarkSuite.config; |
| var doWarmup = config.doWarmup !== undefined |
| ? config.doWarmup |
| : benchmark.doWarmup; |
| var doDeterministic = config.doDeterministic !== undefined |
| ? config.doDeterministic |
| : benchmark.doDeterministic; |
| |
| function Measure(data) { |
| var elapsed = 0; |
| var start = new Date(); |
| |
| // Run either for 1 second or for the number of iterations specified |
| // by minIterations, depending on the config flag doDeterministic. |
| for (var i = 0; (doDeterministic ? |
| i<benchmark.deterministicIterations : elapsed < 1000); i++) { |
| benchmark.run(); |
| elapsed = new Date() - start; |
| } |
| if (data != null) { |
| data.runs += i; |
| data.elapsed += elapsed; |
| } |
| } |
| |
| // Sets up data in order to skip or not the warmup phase. |
| if (!doWarmup && data == null) { |
| data = { runs: 0, elapsed: 0 }; |
| } |
| |
| if (data == null) { |
| Measure(null); |
| return { runs: 0, elapsed: 0 }; |
| } else { |
| Measure(data); |
| // If we've run too few iterations, we continue for another second. |
| if (data.runs < benchmark.minIterations) return data; |
| var usec = (data.elapsed * 1000) / data.runs; |
| var rms = (benchmark.rmsResult != null) ? benchmark.rmsResult() : 0; |
| this.NotifyStep(new BenchmarkResult(benchmark, usec, rms)); |
| return null; |
| } |
| } |
| |
| |
| // This function starts running a suite, but stops between each |
| // individual benchmark in the suite and returns a continuation |
| // function which can be invoked to run the next benchmark. Once the |
| // last benchmark has been executed, null is returned. |
| BenchmarkSuite.prototype.RunStep = function(runner) { |
| BenchmarkSuite.ResetRNG(); |
| this.results = []; |
| this.runner = runner; |
| var length = this.benchmarks.length; |
| var index = 0; |
| var suite = this; |
| var data; |
| |
| // Run the setup, the actual benchmark, and the tear down in three |
| // separate steps to allow the framework to yield between any of the |
| // steps. |
| |
| function RunNextSetup() { |
| if (index < length) { |
| try { |
| suite.benchmarks[index].Setup(); |
| } catch (e) { |
| suite.NotifyError(e); |
| return null; |
| } |
| return RunNextBenchmark; |
| } |
| suite.NotifyResult(); |
| return null; |
| } |
| |
| function RunNextBenchmark() { |
| try { |
| data = suite.RunSingleBenchmark(suite.benchmarks[index], data); |
| } catch (e) { |
| suite.NotifyError(e); |
| return null; |
| } |
| // If data is null, we're done with this benchmark. |
| return (data == null) ? RunNextTearDown : RunNextBenchmark(); |
| } |
| |
| function RunNextTearDown() { |
| try { |
| suite.benchmarks[index++].TearDown(); |
| } catch (e) { |
| suite.NotifyError(e); |
| return null; |
| } |
| return RunNextSetup; |
| } |
| |
| // Start out running the setup. |
| return RunNextSetup(); |
| } |
| |
| ///////////////////////////////////////////////////////////// |
| // richards.js |
| ///////////////////////////////////////////////////////////// |
| |
| // Copyright 2006-2008 the V8 project authors. All rights reserved. |
| // 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. |
| |
| |
| var Richards = new BenchmarkSuite('Richards', [35302], [ |
| new Benchmark("Richards", true, false, 8200, runRichards) |
| ]); |
| |
| |
| /** |
| * 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; |
| |
| /** |
| * 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.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.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.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.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.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); |
| } |
| |
| /** |
| * 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"; |
| }; |
| |
| //////////////////////////////////////////////////////////////////////////////// |
| // Runner |
| //////////////////////////////////////////////////////////////////////////////// |
| |
| var success = true; |
| |
| function NotifyStart(name) { |
| } |
| |
| function NotifyError(name, error) { |
| WScript.Echo(name + " : ERROR : " +error.stack); |
| success = false; |
| } |
| |
| function NotifyResult(name, score) { |
| if (success) { |
| WScript.Echo("### SCORE:", score); |
| } |
| } |
| |
| function NotifyScore(score) { |
| } |
| |
| BenchmarkSuite.RunSuites({ |
| NotifyStart : NotifyStart, |
| NotifyError : NotifyError, |
| NotifyResult : NotifyResult, |
| NotifyScore : NotifyScore |
| }); |