CS-Performance/awaitStack.abs at master · kazadbakht/CS-Performance · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
module AwaitStack;

def Int maxi() = 10000000;
def Int stackSize() = 10000000;

interface IA {
	Unit recursive_m1(Int s);
	Unit recursive_m2(Int s);
}


class A implements IA{
	Int i=0;
	Bool b = False;
	Unit recursive_m1(Int s){
	   Int x = s;
	   if (s>0){
			this.recursive_m1(s - 1);
			this.t(s);
		}
		else {

			while (i<maxi()) {
				i = i + 1;
				await b == True;
				b = False;
			}
		}
	}

	Unit recursive_m2(Int s){
	   if (s>0){
			this.recursive_m2(s - 1);
			this.t(s);
		}
		else {
			while (i<maxi()) {
				i = i + 1;
				await b == False;
				b = True;
			}
		}
	}

	Unit t(Int i)
	{

	}
}

{
	IA a = new A();
	Fut<Unit> f = a!recursive_m1(stackSize());
	a!recursive_m2(stackSize());
	f.get;
}