1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
2 /* ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
15 * The Original Code is JavaScript Engine testing utilities.
17 * The Initial Developer of the Original Code is
19 * Portions created by the Initial Developer are Copyright (C) 2005
20 * the Initial Developer. All Rights Reserved.
22 * Contributor(s): Guoxin Fan <gfan@sta.samsung.com>
23 * Jason Orendorff <jorendorff@mozilla.com>
25 * Alternatively, the contents of this file may be used under the terms of
26 * either the GNU General Public License Version 2 or later (the "GPL"), or
27 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 * in which case the provisions of the GPL or the LGPL are applicable instead
29 * of those above. If you wish to allow use of your version of this file only
30 * under the terms of either the GPL or the LGPL, and not to allow others to
31 * use your version of this file under the terms of the MPL, indicate your
32 * decision by deleting the provisions above and replace them with the notice
33 * and other provisions required by the GPL or the LGPL. If you do not delete
34 * the provisions above, a recipient may use your version of this file under
35 * the terms of any one of the MPL, the GPL or the LGPL.
37 * ***** END LICENSE BLOCK ***** */
39 var gTestfile
= 'lamport.js'
40 //-----------------------------------------------------------------------
42 var summary
= "Lamport Bakery's algorithm for mutual exclusion";
43 // Adapted from pseudocode in Wikipedia:
44 // http://en.wikipedia.org/wiki/Lamport%27s_bakery_algorithm
48 var N
= 15; // Number of threads.
49 var LOOP_COUNT
= 10; // Number of times each thread should loop
52 for (let i
= 0; i
< n
; i
++)
57 let x
= Number
.NEGATIVE_INFINITY
;
64 // the mutex mechanism
65 var entering
= [false for (i
in range(N
))];
66 var ticket
= [0 for (i
in range(N
))];
68 // the object being protected
74 ticket
[i
] = 1 + max(ticket
);
77 for (let j
= 0; j
< N
; j
++) {
78 // If thread j is in the middle of getting a ticket, wait for that to
83 // Wait until all threads with smaller ticket numbers or with the same
84 // ticket number, but with higher priority, finish their work.
85 while ((ticket
[j
] != 0) && ((ticket
[j
] < ticket
[i
]) ||
86 ((ticket
[j
] == ticket
[i
]) && (i
< j
))))
96 for (let k
= 0; k
< LOOP_COUNT
; k
++) {
99 // The critical section
109 function makeWorker(id
) {
110 return function () { return worker(id
); };
116 if (typeof scatter
== 'undefined' || typeof sleep
== 'undefined') {
117 print('Test skipped. scatter or sleep not defined.');
118 expect
= actual
= 'Test skipped.';
120 scatter([makeWorker(i
) for (i
in range(N
))]);
122 expect
= "counter: " + (N
* LOOP_COUNT
);
123 actual
= "counter: " + counter
;
126 reportCompare(expect
, actual
, summary
);