<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
"http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head><meta http-equiv="content-type" content="text/html; charset=utf-8" />
<title>[189956] trunk/LayoutTests</title>
</head>
<body>
<style type="text/css"><!--
#msg dl.meta { border: 1px #006 solid; background: #369; padding: 6px; color: #fff; }
#msg dl.meta dt { float: left; width: 6em; font-weight: bold; }
#msg dt:after { content:':';}
#msg dl, #msg dt, #msg ul, #msg li, #header, #footer, #logmsg { font-family: verdana,arial,helvetica,sans-serif; font-size: 10pt; }
#msg dl a { font-weight: bold}
#msg dl a:link { color:#fc3; }
#msg dl a:active { color:#ff0; }
#msg dl a:visited { color:#cc6; }
h3 { font-family: verdana,arial,helvetica,sans-serif; font-size: 10pt; font-weight: bold; }
#msg pre { overflow: auto; background: #ffc; border: 1px #fa0 solid; padding: 6px; }
#logmsg { background: #ffc; border: 1px #fa0 solid; padding: 1em 1em 0 1em; }
#logmsg p, #logmsg pre, #logmsg blockquote { margin: 0 0 1em 0; }
#logmsg p, #logmsg li, #logmsg dt, #logmsg dd { line-height: 14pt; }
#logmsg h1, #logmsg h2, #logmsg h3, #logmsg h4, #logmsg h5, #logmsg h6 { margin: .5em 0; }
#logmsg h1:first-child, #logmsg h2:first-child, #logmsg h3:first-child, #logmsg h4:first-child, #logmsg h5:first-child, #logmsg h6:first-child { margin-top: 0; }
#logmsg ul, #logmsg ol { padding: 0; list-style-position: inside; margin: 0 0 0 1em; }
#logmsg ul { text-indent: -1em; padding-left: 1em; }#logmsg ol { text-indent: -1.5em; padding-left: 1.5em; }
#logmsg > ul, #logmsg > ol { margin: 0 0 1em 0; }
#logmsg pre { background: #eee; padding: 1em; }
#logmsg blockquote { border: 1px solid #fa0; border-left-width: 10px; padding: 1em 1em 0 1em; background: white;}
#logmsg dl { margin: 0; }
#logmsg dt { font-weight: bold; }
#logmsg dd { margin: 0; padding: 0 0 0.5em 0; }
#logmsg dd:before { content:'\00bb';}
#logmsg table { border-spacing: 0px; border-collapse: collapse; border-top: 4px solid #fa0; border-bottom: 1px solid #fa0; background: #fff; }
#logmsg table th { text-align: left; font-weight: normal; padding: 0.2em 0.5em; border-top: 1px dotted #fa0; }
#logmsg table td { text-align: right; border-top: 1px dotted #fa0; padding: 0.2em 0.5em; }
#logmsg table thead th { text-align: center; border-bottom: 1px solid #fa0; }
#logmsg table th.Corner { text-align: left; }
#logmsg hr { border: none 0; border-top: 2px dashed #fa0; height: 1px; }
#header, #footer { color: #fff; background: #636; border: 1px #300 solid; padding: 6px; }
#patch { width: 100%; }
#patch h4 {font-family: verdana,arial,helvetica,sans-serif;font-size:10pt;padding:8px;background:#369;color:#fff;margin:0;}
#patch .propset h4, #patch .binary h4 {margin:0;}
#patch pre {padding:0;line-height:1.2em;margin:0;}
#patch .diff {width:100%;background:#eee;padding: 0 0 10px 0;overflow:auto;}
#patch .propset .diff, #patch .binary .diff {padding:10px 0;}
#patch span {display:block;padding:0 10px;}
#patch .modfile, #patch .addfile, #patch .delfile, #patch .propset, #patch .binary, #patch .copfile {border:1px solid #ccc;margin:10px 0;}
#patch ins {background:#dfd;text-decoration:none;display:block;padding:0 10px;}
#patch del {background:#fdd;text-decoration:none;display:block;padding:0 10px;}
#patch .lines, .info {color:#888;background:#fff;}
--></style>
<div id="msg">
<dl class="meta">
<dt>Revision</dt> <dd><a href="http://trac.webkit.org/projects/webkit/changeset/189956">189956</a></dd>
<dt>Author</dt> <dd>sbarati@apple.com</dd>
<dt>Date</dt> <dd>2015-09-17 18:34:58 -0700 (Thu, 17 Sep 2015)</dd>
</dl>
<h3>Log Message</h3>
<pre>add a regress test for richards with try/catch.
https://bugs.webkit.org/show_bug.cgi?id=149301
Reviewed by Filip Pizlo.
This adds two variants of Octane/richards benchmark using
try/catch. One try/catch variant that actually throws.
Another that never throws. I've included try/catch inside
every function and every loop.
* js/regress/richards-empty-try-catch-expected.txt: Added.
* js/regress/richards-empty-try-catch.html: Added.
* js/regress/richards-try-catch-expected.txt: Added.
* js/regress/richards-try-catch.html: Added.
* js/regress/script-tests/richards-empty-try-catch.js: Added.
(runRichards):
(Scheduler):
(Scheduler.prototype.addIdleTask):
(Scheduler.prototype.addWorkerTask):
(Scheduler.prototype.addHandlerTask):
(Scheduler.prototype.addDeviceTask):
(Scheduler.prototype.addRunningTask):
(Scheduler.prototype.addTask):
(Scheduler.prototype.schedule):
(Scheduler.prototype.release):
(Scheduler.prototype.holdCurrent):
(Scheduler.prototype.suspendCurrent):
(Scheduler.prototype.queue):
(TaskControlBlock):
(TaskControlBlock.prototype.setRunning):
(TaskControlBlock.prototype.markAsNotHeld):
(TaskControlBlock.prototype.markAsHeld):
(TaskControlBlock.prototype.isHeldOrSuspended):
(TaskControlBlock.prototype.markAsSuspended):
(TaskControlBlock.prototype.markAsRunnable):
(TaskControlBlock.prototype.run):
(TaskControlBlock.prototype.checkPriorityAdd):
(TaskControlBlock.prototype.toString):
(IdleTask):
(IdleTask.prototype.run):
(IdleTask.prototype.toString):
(DeviceTask):
(DeviceTask.prototype.run):
(DeviceTask.prototype.toString):
(WorkerTask):
(WorkerTask.prototype.run):
(WorkerTask.prototype.toString):
(HandlerTask):
(HandlerTask.prototype.run):
(HandlerTask.prototype.toString):
(Packet):
(Packet.prototype.addTo):
(Packet.prototype.toString):
* js/regress/script-tests/richards-try-catch.js: Added.
(randomException):
(runRichards):
(Scheduler):
(Scheduler.prototype.addIdleTask):
(Scheduler.prototype.addWorkerTask):
(Scheduler.prototype.addHandlerTask):
(Scheduler.prototype.addDeviceTask):
(Scheduler.prototype.addRunningTask):
(Scheduler.prototype.addTask):
(Scheduler.prototype.schedule):
(Scheduler.prototype.release):
(Scheduler.prototype.holdCurrent):
(Scheduler.prototype.suspendCurrent):
(Scheduler.prototype.queue):
(TaskControlBlock):
(TaskControlBlock.prototype.setRunning):
(TaskControlBlock.prototype.markAsNotHeld):
(TaskControlBlock.prototype.markAsHeld):
(TaskControlBlock.prototype.isHeldOrSuspended):
(TaskControlBlock.prototype.markAsSuspended):
(TaskControlBlock.prototype.markAsRunnable):
(TaskControlBlock.prototype.run):
(TaskControlBlock.prototype.checkPriorityAdd):
(TaskControlBlock.prototype.toString):
(IdleTask):
(IdleTask.prototype.run):
(IdleTask.prototype.toString):
(DeviceTask):
(DeviceTask.prototype.run):
(DeviceTask.prototype.toString):
(WorkerTask):
(WorkerTask.prototype.run):
(WorkerTask.prototype.toString):
(HandlerTask):
(HandlerTask.prototype.run):
(HandlerTask.prototype.toString):
(Packet):
(Packet.prototype.addTo):
(Packet.prototype.toString):</pre>
<h3>Modified Paths</h3>
<ul>
<li><a href="#trunkLayoutTestsChangeLog">trunk/LayoutTests/ChangeLog</a></li>
</ul>
<h3>Added Paths</h3>
<ul>
<li><a href="#trunkLayoutTestsjsregressrichardsemptytrycatchexpectedtxt">trunk/LayoutTests/js/regress/richards-empty-try-catch-expected.txt</a></li>
<li><a href="#trunkLayoutTestsjsregressrichardsemptytrycatchhtml">trunk/LayoutTests/js/regress/richards-empty-try-catch.html</a></li>
<li><a href="#trunkLayoutTestsjsregressrichardstrycatchexpectedtxt">trunk/LayoutTests/js/regress/richards-try-catch-expected.txt</a></li>
<li><a href="#trunkLayoutTestsjsregressrichardstrycatchhtml">trunk/LayoutTests/js/regress/richards-try-catch.html</a></li>
<li><a href="#trunkLayoutTestsjsregressscripttestsrichardsemptytrycatchjs">trunk/LayoutTests/js/regress/script-tests/richards-empty-try-catch.js</a></li>
<li><a href="#trunkLayoutTestsjsregressscripttestsrichardstrycatchjs">trunk/LayoutTests/js/regress/script-tests/richards-try-catch.js</a></li>
</ul>
</div>
<div id="patch">
<h3>Diff</h3>
<a id="trunkLayoutTestsChangeLog"></a>
<div class="modfile"><h4>Modified: trunk/LayoutTests/ChangeLog (189955 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/ChangeLog 2015-09-18 01:12:43 UTC (rev 189955)
+++ trunk/LayoutTests/ChangeLog 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -1,3 +1,99 @@
</span><ins>+2015-09-17 Saam barati <sbarati@apple.com>
+
+ add a regress test for richards with try/catch.
+ https://bugs.webkit.org/show_bug.cgi?id=149301
+
+ Reviewed by Filip Pizlo.
+
+ This adds two variants of Octane/richards benchmark using
+ try/catch. One try/catch variant that actually throws.
+ Another that never throws. I've included try/catch inside
+ every function and every loop.
+
+ * js/regress/richards-empty-try-catch-expected.txt: Added.
+ * js/regress/richards-empty-try-catch.html: Added.
+ * js/regress/richards-try-catch-expected.txt: Added.
+ * js/regress/richards-try-catch.html: Added.
+ * js/regress/script-tests/richards-empty-try-catch.js: Added.
+ (runRichards):
+ (Scheduler):
+ (Scheduler.prototype.addIdleTask):
+ (Scheduler.prototype.addWorkerTask):
+ (Scheduler.prototype.addHandlerTask):
+ (Scheduler.prototype.addDeviceTask):
+ (Scheduler.prototype.addRunningTask):
+ (Scheduler.prototype.addTask):
+ (Scheduler.prototype.schedule):
+ (Scheduler.prototype.release):
+ (Scheduler.prototype.holdCurrent):
+ (Scheduler.prototype.suspendCurrent):
+ (Scheduler.prototype.queue):
+ (TaskControlBlock):
+ (TaskControlBlock.prototype.setRunning):
+ (TaskControlBlock.prototype.markAsNotHeld):
+ (TaskControlBlock.prototype.markAsHeld):
+ (TaskControlBlock.prototype.isHeldOrSuspended):
+ (TaskControlBlock.prototype.markAsSuspended):
+ (TaskControlBlock.prototype.markAsRunnable):
+ (TaskControlBlock.prototype.run):
+ (TaskControlBlock.prototype.checkPriorityAdd):
+ (TaskControlBlock.prototype.toString):
+ (IdleTask):
+ (IdleTask.prototype.run):
+ (IdleTask.prototype.toString):
+ (DeviceTask):
+ (DeviceTask.prototype.run):
+ (DeviceTask.prototype.toString):
+ (WorkerTask):
+ (WorkerTask.prototype.run):
+ (WorkerTask.prototype.toString):
+ (HandlerTask):
+ (HandlerTask.prototype.run):
+ (HandlerTask.prototype.toString):
+ (Packet):
+ (Packet.prototype.addTo):
+ (Packet.prototype.toString):
+ * js/regress/script-tests/richards-try-catch.js: Added.
+ (randomException):
+ (runRichards):
+ (Scheduler):
+ (Scheduler.prototype.addIdleTask):
+ (Scheduler.prototype.addWorkerTask):
+ (Scheduler.prototype.addHandlerTask):
+ (Scheduler.prototype.addDeviceTask):
+ (Scheduler.prototype.addRunningTask):
+ (Scheduler.prototype.addTask):
+ (Scheduler.prototype.schedule):
+ (Scheduler.prototype.release):
+ (Scheduler.prototype.holdCurrent):
+ (Scheduler.prototype.suspendCurrent):
+ (Scheduler.prototype.queue):
+ (TaskControlBlock):
+ (TaskControlBlock.prototype.setRunning):
+ (TaskControlBlock.prototype.markAsNotHeld):
+ (TaskControlBlock.prototype.markAsHeld):
+ (TaskControlBlock.prototype.isHeldOrSuspended):
+ (TaskControlBlock.prototype.markAsSuspended):
+ (TaskControlBlock.prototype.markAsRunnable):
+ (TaskControlBlock.prototype.run):
+ (TaskControlBlock.prototype.checkPriorityAdd):
+ (TaskControlBlock.prototype.toString):
+ (IdleTask):
+ (IdleTask.prototype.run):
+ (IdleTask.prototype.toString):
+ (DeviceTask):
+ (DeviceTask.prototype.run):
+ (DeviceTask.prototype.toString):
+ (WorkerTask):
+ (WorkerTask.prototype.run):
+ (WorkerTask.prototype.toString):
+ (HandlerTask):
+ (HandlerTask.prototype.run):
+ (HandlerTask.prototype.toString):
+ (Packet):
+ (Packet.prototype.addTo):
+ (Packet.prototype.toString):
+
</ins><span class="cx"> 2015-09-17 Dean Jackson <dino@apple.com>
</span><span class="cx">
</span><span class="cx"> Multi-hop reference cycles not detected.
</span></span></pre></div>
<a id="trunkLayoutTestsjsregressrichardsemptytrycatchexpectedtxt"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/richards-empty-try-catch-expected.txt (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/richards-empty-try-catch-expected.txt (rev 0)
+++ trunk/LayoutTests/js/regress/richards-empty-try-catch-expected.txt 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,10 @@
</span><ins>+JSRegress/richards-empty-try-catch
+
+On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
+
+
+PASS no exception thrown
+PASS successfullyParsed is true
+
+TEST COMPLETE
+
</ins></span></pre></div>
<a id="trunkLayoutTestsjsregressrichardsemptytrycatchhtml"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/richards-empty-try-catch.html (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/richards-empty-try-catch.html (rev 0)
+++ trunk/LayoutTests/js/regress/richards-empty-try-catch.html 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,12 @@
</span><ins>+<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
+<html>
+<head>
+<script src="../../resources/js-test-pre.js"></script>
+</head>
+<body>
+<script src="../../resources/regress-pre.js"></script>
+<script src="script-tests/richards-empty-try-catch.js"></script>
+<script src="../../resources/regress-post.js"></script>
+<script src="../../resources/js-test-post.js"></script>
+</body>
+</html>
</ins></span></pre></div>
<a id="trunkLayoutTestsjsregressrichardstrycatchexpectedtxt"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/richards-try-catch-expected.txt (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/richards-try-catch-expected.txt (rev 0)
+++ trunk/LayoutTests/js/regress/richards-try-catch-expected.txt 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,10 @@
</span><ins>+JSRegress/richards-try-catch
+
+On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
+
+
+PASS no exception thrown
+PASS successfullyParsed is true
+
+TEST COMPLETE
+
</ins></span></pre></div>
<a id="trunkLayoutTestsjsregressrichardstrycatchhtml"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/richards-try-catch.html (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/richards-try-catch.html (rev 0)
+++ trunk/LayoutTests/js/regress/richards-try-catch.html 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,12 @@
</span><ins>+<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
+<html>
+<head>
+<script src="../../resources/js-test-pre.js"></script>
+</head>
+<body>
+<script src="../../resources/regress-pre.js"></script>
+<script src="script-tests/richards-try-catch.js"></script>
+<script src="../../resources/regress-post.js"></script>
+<script src="../../resources/js-test-post.js"></script>
+</body>
+</html>
</ins></span></pre></div>
<a id="trunkLayoutTestsjsregressscripttestsrichardsemptytrycatchjs"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/script-tests/richards-empty-try-catch.js (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/script-tests/richards-empty-try-catch.js (rev 0)
+++ trunk/LayoutTests/js/regress/script-tests/richards-empty-try-catch.js 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,646 @@
</span><ins>+// 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.
+
+
+/**
+ * The Richards benchmark simulates the task dispatcher of an
+ * operating system.
+ **/
+function runRichards() {
+ try {
+ 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);
+ }
+ } catch(e) { }
+}
+
+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() {
+ try {
+ this.queueCount = 0;
+ this.holdCount = 0;
+ this.blocks = new Array(NUMBER_OF_IDS);
+ this.list = null;
+ this.currentTcb = null;
+ this.currentId = null;
+
+ } catch(e) { }
+}
+
+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) {
+ try {
+ this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new HandlerTask(this));
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new DeviceTask(this))
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, task);
+ this.currentTcb.setRunning();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);
+ this.list = this.currentTcb;
+ this.blocks[id] = this.currentTcb;
+ } catch(e) { }
+};
+
+/**
+ * Execute the tasks managed by this scheduler.
+ */
+Scheduler.prototype.schedule = function () {
+ this.currentTcb = this.list;
+ while (this.currentTcb != null) {
+ try {
+ if (this.currentTcb.isHeldOrSuspended()) {
+ this.currentTcb = this.currentTcb.link;
+ } else {
+ this.currentId = this.currentTcb.id;
+ this.currentTcb = this.currentTcb.run();
+ }
+ } catch(e) { }
+ }
+};
+
+/**
+ * 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) {
+ try {
+ var tcb = this.blocks[id];
+ if (tcb == null) return tcb;
+ tcb.markAsNotHeld();
+ } catch(e) { }
+ try {
+ if (tcb.priority > this.currentTcb.priority) {
+ return tcb;
+ } else {
+ return this.currentTcb;
+ }
+ } catch(e) { }
+};
+
+/**
+ * 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 () {
+ try {
+ this.holdCount++;
+ this.currentTcb.markAsHeld();
+ } catch(e) { }
+ 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 () {
+ try {
+ this.currentTcb.markAsSuspended();
+ } catch(e) { }
+ try {
+ return this.currentTcb;
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ var t = this.blocks[packet.id];
+ if (t == null) return t;
+ this.queueCount++;
+ packet.link = null;
+ } catch(e) { }
+ 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) {
+ try {
+ this.link = link;
+ this.id = id;
+ this.priority = priority;
+ this.queue = queue;
+ this.task = task;
+ } catch(e) { }
+ try {
+ if (queue == null) {
+ this.state = STATE_SUSPENDED;
+ } else {
+ this.state = STATE_SUSPENDED_RUNNABLE;
+ }
+ } catch(e) { }
+}
+
+/**
+ * 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 () {
+ try {
+ this.state = STATE_RUNNING;
+ } catch(e){}
+};
+
+TaskControlBlock.prototype.markAsNotHeld = function () {
+ try {
+ this.state = this.state & STATE_NOT_HELD;
+ } catch(e) { }
+};
+
+TaskControlBlock.prototype.markAsHeld = function () {
+ try {
+ this.state = this.state | STATE_HELD;
+ } catch(e) { }
+};
+
+TaskControlBlock.prototype.isHeldOrSuspended = function () {
+ try {
+ return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
+ } catch(e) {
+ return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
+ }
+};
+
+TaskControlBlock.prototype.markAsSuspended = function () {
+ try {
+ this.state = this.state | STATE_SUSPENDED;
+ } catch(e) {
+ this.state = this.state | STATE_SUSPENDED;
+ }
+};
+
+TaskControlBlock.prototype.markAsRunnable = function () {
+ try {
+ this.state = this.state | STATE_RUNNABLE;
+ } catch(e) {
+ 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;
+ try {
+ 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;
+ }
+ } catch(e) { }
+ 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) {
+ try {
+ 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;
+ } catch(e) {
+ return task;
+ }
+};
+
+TaskControlBlock.prototype.toString = function () {
+ try {
+ return "tcb { " + this.task + "@" + this.state + " }";
+ } catch(e) {
+ 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = v1;
+ this.count = count;
+ } catch(e) {
+ this.count = count;
+ }
+}
+
+IdleTask.prototype.run = function (packet) {
+ try {
+ this.count--;
+ if (this.count == 0) return this.scheduler.holdCurrent();
+ } catch(e) { }
+
+ try {
+ 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);
+ }
+ } catch(e) { }
+};
+
+IdleTask.prototype.toString = function () {
+ try {
+ return "IdleTask"
+ } catch(e) {
+ 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = null;
+ } catch(e) { }
+}
+
+DeviceTask.prototype.run = function (packet) {
+ if (packet == null) {
+ try {
+ if (this.v1 == null) return this.scheduler.suspendCurrent();
+ var v = this.v1;
+ this.v1 = null;
+ } catch(e) { }
+ return this.scheduler.queue(v);
+ } else {
+ try {
+ this.v1 = packet;
+ } catch(e) { }
+ return this.scheduler.holdCurrent();
+ }
+};
+
+DeviceTask.prototype.toString = function () {
+ try {
+ return "DeviceTask";
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = v1;
+ this.v2 = v2;
+ } catch(e) { }
+}
+
+WorkerTask.prototype.run = function (packet) {
+ if (packet == null) {
+ return this.scheduler.suspendCurrent();
+ } else {
+ try {
+ if (this.v1 == ID_HANDLER_A) {
+ this.v1 = ID_HANDLER_B;
+ } else {
+ this.v1 = ID_HANDLER_A;
+ }
+ packet.id = this.v1;
+ packet.a1 = 0;
+ } catch(e) { }
+ for (var i = 0; i < DATA_SIZE; i++) {
+ try {
+ this.v2++;
+ if (this.v2 > 26) this.v2 = 1;
+ packet.a2[i] = this.v2;
+ } catch(e) { }
+ }
+ return this.scheduler.queue(packet);
+ }
+};
+
+WorkerTask.prototype.toString = function () {
+ try {
+ return "WorkerTask";
+ } catch(e) { }
+};
+
+/**
+ * A task that manipulates work packets and then suspends itself.
+ * @param {Scheduler} scheduler the scheduler that manages this task
+ * @constructor
+ */
+function HandlerTask(scheduler) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = null;
+ this.v2 = null;
+ } catch(e) { }
+}
+
+HandlerTask.prototype.run = function (packet) {
+ try {
+ if (packet != null) {
+ if (packet.kind == KIND_WORK) {
+ this.v1 = packet.addTo(this.v1);
+ } else {
+ this.v2 = packet.addTo(this.v2);
+ }
+ }
+ } catch(e) { }
+
+ try {
+ 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);
+ }
+ }
+ } catch(e) { }
+ return this.scheduler.suspendCurrent();
+};
+
+HandlerTask.prototype.toString = function () {
+ try {
+ return "HandlerTask";
+ } catch(e) { }
+};
+
+/* --- *
+ * 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) {
+ try {
+ this.link = link;
+ this.id = id;
+ this.kind = kind;
+ this.a1 = 0;
+ this.a2 = new Array(DATA_SIZE);
+ } catch(e) { }
+}
+
+/**
+ * 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) {
+ try {
+ next = peek;
+ } catch(e) { }
+ }
+ next.link = this;
+ return queue;
+};
+
+Packet.prototype.toString = function () {
+ try {
+ return "Packet";
+ } catch(e) { }
+};
+
+for (let i = 0; i < 350; ++i)
+ runRichards();
</ins></span></pre></div>
<a id="trunkLayoutTestsjsregressscripttestsrichardstrycatchjs"></a>
<div class="addfile"><h4>Added: trunk/LayoutTests/js/regress/script-tests/richards-try-catch.js (0 => 189956)</h4>
<pre class="diff"><span>
<span class="info">--- trunk/LayoutTests/js/regress/script-tests/richards-try-catch.js (rev 0)
+++ trunk/LayoutTests/js/regress/script-tests/richards-try-catch.js 2015-09-18 01:34:58 UTC (rev 189956)
</span><span class="lines">@@ -0,0 +1,695 @@
</span><ins>+// 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.
+
+
+let __exceptionCounter = 0;
+function randomException() {
+ __exceptionCounter++;
+ if (__exceptionCounter % 5000 === 0) {
+ throw new Error("rando");
+ }
+}
+noInline(randomException);
+
+/**
+ * The Richards benchmark simulates the task dispatcher of an
+ * operating system.
+ **/
+function runRichards() {
+ try {
+ 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);
+ }
+
+ randomException();
+ } catch(e) { }
+}
+
+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() {
+ try {
+ this.queueCount = 0;
+ this.holdCount = 0;
+ this.blocks = new Array(NUMBER_OF_IDS);
+ this.list = null;
+ this.currentTcb = null;
+ this.currentId = null;
+
+ randomException();
+ } catch(e) { }
+}
+
+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) {
+ try {
+ this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new HandlerTask(this));
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, new DeviceTask(this))
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.addTask(id, priority, queue, task);
+ this.currentTcb.setRunning();
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.currentTcb = new TaskControlBlock(this.list, id, priority, queue, task);
+ this.list = this.currentTcb;
+ this.blocks[id] = this.currentTcb;
+ randomException();
+ } catch(e) { }
+};
+
+/**
+ * Execute the tasks managed by this scheduler.
+ */
+Scheduler.prototype.schedule = function () {
+ this.currentTcb = this.list;
+ while (this.currentTcb != null) {
+ try {
+ if (this.currentTcb.isHeldOrSuspended()) {
+ this.currentTcb = this.currentTcb.link;
+ } else {
+ this.currentId = this.currentTcb.id;
+ this.currentTcb = this.currentTcb.run();
+ }
+ randomException();
+ } catch(e) { }
+ }
+};
+
+/**
+ * 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) {
+ try {
+ var tcb = this.blocks[id];
+ if (tcb == null) return tcb;
+ tcb.markAsNotHeld();
+ randomException();
+ } catch(e) { }
+ try {
+ if (tcb.priority > this.currentTcb.priority) {
+ return tcb;
+ } else {
+ return this.currentTcb;
+ }
+ } catch(e) { }
+};
+
+/**
+ * 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 () {
+ try {
+ this.holdCount++;
+ this.currentTcb.markAsHeld();
+ randomException();
+ } catch(e) { }
+ 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 () {
+ try {
+ this.currentTcb.markAsSuspended();
+ randomException();
+ } catch(e) { }
+ try {
+ return this.currentTcb;
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ var t = this.blocks[packet.id];
+ if (t == null) return t;
+ this.queueCount++;
+ packet.link = null;
+ randomException();
+ } catch(e) { }
+ 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) {
+ try {
+ this.link = link;
+ this.id = id;
+ this.priority = priority;
+ this.queue = queue;
+ this.task = task;
+ randomException();
+ } catch(e) { }
+ try {
+ if (queue == null) {
+ this.state = STATE_SUSPENDED;
+ } else {
+ this.state = STATE_SUSPENDED_RUNNABLE;
+ }
+ randomException();
+ } catch(e) { }
+}
+
+/**
+ * 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 () {
+ try {
+ this.state = STATE_RUNNING;
+ randomException();
+ } catch(e){}
+};
+
+TaskControlBlock.prototype.markAsNotHeld = function () {
+ try {
+ this.state = this.state & STATE_NOT_HELD;
+ randomException();
+ } catch(e) { }
+};
+
+TaskControlBlock.prototype.markAsHeld = function () {
+ try {
+ this.state = this.state | STATE_HELD;
+ randomException();
+ } catch(e) { }
+};
+
+TaskControlBlock.prototype.isHeldOrSuspended = function () {
+ try {
+ randomException();
+ return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
+ } catch(e) {
+ return (this.state & STATE_HELD) != 0 || (this.state == STATE_SUSPENDED);
+ }
+};
+
+TaskControlBlock.prototype.markAsSuspended = function () {
+ try {
+ randomException();
+ this.state = this.state | STATE_SUSPENDED;
+ } catch(e) {
+ this.state = this.state | STATE_SUSPENDED;
+ }
+};
+
+TaskControlBlock.prototype.markAsRunnable = function () {
+ try {
+ randomException();
+ this.state = this.state | STATE_RUNNABLE;
+ } catch(e) {
+ 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;
+ try {
+ 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;
+ }
+ randomException();
+ } catch(e) { }
+ 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) {
+ try {
+ if (this.queue == null) {
+ this.queue = packet;
+ this.markAsRunnable();
+ if (this.priority > task.priority) return this;
+ } else {
+ this.queue = packet.addTo(this.queue);
+ }
+
+ randomException();
+ return task;
+ } catch(e) {
+ return task;
+ }
+};
+
+TaskControlBlock.prototype.toString = function () {
+ try {
+ randomException();
+ return "tcb { " + this.task + "@" + this.state + " }";
+ } catch(e) {
+ 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = v1;
+ randomException();
+ this.count = count;
+ } catch(e) {
+ this.count = count;
+ }
+}
+
+IdleTask.prototype.run = function (packet) {
+ try {
+ this.count--;
+ if (this.count == 0) return this.scheduler.holdCurrent();
+ randomException();
+ } catch(e) { }
+
+ try {
+ 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);
+ }
+ } catch(e) { }
+};
+
+IdleTask.prototype.toString = function () {
+ try {
+ randomException();
+ return "IdleTask"
+ } catch(e) {
+ 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = null;
+ randomException();
+ } catch(e) { }
+}
+
+DeviceTask.prototype.run = function (packet) {
+ if (packet == null) {
+ try {
+ if (this.v1 == null) return this.scheduler.suspendCurrent();
+ var v = this.v1;
+ this.v1 = null;
+ randomException();
+ } catch(e) { }
+ return this.scheduler.queue(v);
+ } else {
+ try {
+ this.v1 = packet;
+ randomException();
+ } catch(e) { }
+ return this.scheduler.holdCurrent();
+ }
+};
+
+DeviceTask.prototype.toString = function () {
+ try {
+ randomException();
+ return "DeviceTask";
+ } catch(e) { }
+};
+
+/**
+ * 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) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = v1;
+ this.v2 = v2;
+ randomException();
+ } catch(e) { }
+}
+
+WorkerTask.prototype.run = function (packet) {
+ if (packet == null) {
+ return this.scheduler.suspendCurrent();
+ } else {
+ try {
+ if (this.v1 == ID_HANDLER_A) {
+ this.v1 = ID_HANDLER_B;
+ } else {
+ this.v1 = ID_HANDLER_A;
+ }
+ packet.id = this.v1;
+ packet.a1 = 0;
+ randomException();
+ } catch(e) { }
+ for (var i = 0; i < DATA_SIZE; i++) {
+ try {
+ this.v2++;
+ if (this.v2 > 26) this.v2 = 1;
+ packet.a2[i] = this.v2;
+ randomException();
+ } catch(e) { }
+ }
+ return this.scheduler.queue(packet);
+ }
+};
+
+WorkerTask.prototype.toString = function () {
+ try {
+ return "WorkerTask";
+ } catch(e) { }
+};
+
+/**
+ * A task that manipulates work packets and then suspends itself.
+ * @param {Scheduler} scheduler the scheduler that manages this task
+ * @constructor
+ */
+function HandlerTask(scheduler) {
+ try {
+ this.scheduler = scheduler;
+ this.v1 = null;
+ this.v2 = null;
+ randomException();
+ } catch(e) { }
+}
+
+HandlerTask.prototype.run = function (packet) {
+ try {
+ if (packet != null) {
+ if (packet.kind == KIND_WORK) {
+ this.v1 = packet.addTo(this.v1);
+ } else {
+ this.v2 = packet.addTo(this.v2);
+ }
+ }
+ randomException();
+ } catch(e) { }
+
+ try {
+ 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);
+ }
+ }
+ randomException();
+ } catch(e) { }
+ return this.scheduler.suspendCurrent();
+};
+
+HandlerTask.prototype.toString = function () {
+ try {
+ return "HandlerTask";
+ } catch(e) { }
+};
+
+/* --- *
+ * 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) {
+ try {
+ this.link = link;
+ this.id = id;
+ this.kind = kind;
+ this.a1 = 0;
+ this.a2 = new Array(DATA_SIZE);
+ randomException();
+ } catch(e) { }
+}
+
+/**
+ * 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) {
+ try {
+ next = peek;
+ randomException();
+ } catch(e) { }
+ }
+ next.link = this;
+ return queue;
+};
+
+Packet.prototype.toString = function () {
+ try {
+ return "Packet";
+ } catch(e) { }
+};
+
+for (let i = 0; i < 350; ++i)
+ runRichards();
</ins></span></pre>
</div>
</div>
</body>
</html>