source:
CIVL/examples/concurrency/spawnBad.cvl
| Last change on this file was ea777aa, checked in by , 3 years ago | |
|---|---|
|
|
| File size: 395 bytes | |
| Rev | Line | |
|---|---|---|
| [9fb69d3] | 1 | /* Commandline execution: |
| 2 | * civl verify -inputN=10 spawnBad.cvl | |
| 3 | * */ | |
| [e6b02c8] | 4 | #include<civlc.cvh> |
| [20d2740] | 5 | |
| [0baeebd] | 6 | $input int N = 10; |
| [20d2740] | 7 | int s1, s2; |
| 8 | ||
| 9 | void f1(int n) { | |
| 10 | s1 = 0; | |
| 11 | for (int i=0; i<n; i++) s1 += i; | |
| 12 | } | |
| 13 | ||
| 14 | void f2(int n) { | |
| 15 | s2 = 0; | |
| 16 | for (int i=0; i<n; i++) s2 += i; | |
| 17 | } | |
| 18 | ||
| 19 | void main() { | |
| 20 | $proc p = $spawn f1(N); | |
| 21 | $proc q = $spawn f2(N); | |
| 22 | ||
| [d980649] | 23 | $assert(s1==s2); // oops, should wait first |
| [a82987f] | 24 | $wait(p); |
| 25 | $wait(q); | |
| [20d2740] | 26 | } |
Note:
See TracBrowser
for help on using the repository browser.
