ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsdeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerpthread-emulationqualifiedEnumresolv-newwith_gc
Last change
on this file since 3d8f2f8 was
8b001bd,
checked in by Peter A. Buhr <pabuhr@…>, 7 years ago
|
more changes
|
-
Property mode set to
100644
|
File size:
1.2 KB
|
Line | |
---|
1 | #include <stdlib> |
---|
2 | #include "cfa-stack.h" |
---|
3 | |
---|
4 | forall( otype T ) struct stack_node { |
---|
5 | T value; |
---|
6 | stack_node(T) * next; |
---|
7 | }; |
---|
8 | |
---|
9 | forall( otype T ) void clear( stack(T) & s ) with( s ) { |
---|
10 | for ( stack_node(T) * next = head; next; ) { |
---|
11 | stack_node(T) * crnt = next; |
---|
12 | next = crnt->next; |
---|
13 | ^(*crnt){}; |
---|
14 | free(crnt); |
---|
15 | } |
---|
16 | head = 0; |
---|
17 | } |
---|
18 | |
---|
19 | forall( otype T ) void ?{}( stack(T) & s ) { (s.head){ 0 }; } |
---|
20 | |
---|
21 | forall( otype T ) void ?{}( stack(T) & s, stack(T) t ) { |
---|
22 | stack_node(T) ** crnt = &s.head; |
---|
23 | for ( stack_node(T) * next = t.head; next; next = next->next ) { |
---|
24 | *crnt = alloc(); |
---|
25 | ((*crnt)->value){ next->value }; |
---|
26 | crnt = &(*crnt)->next; |
---|
27 | } |
---|
28 | *crnt = 0; |
---|
29 | } |
---|
30 | |
---|
31 | forall( otype T ) stack(T) ?=?( stack(T) & s, stack(T) t ) { |
---|
32 | if ( s.head == t.head ) return s; |
---|
33 | clear( s ); |
---|
34 | s{ t }; |
---|
35 | return s; |
---|
36 | } |
---|
37 | |
---|
38 | forall( otype T ) void ^?{}( stack(T) & s) { clear( s ); } |
---|
39 | |
---|
40 | forall( otype T ) _Bool empty( const stack(T) & s ) { return s.head == 0; } |
---|
41 | |
---|
42 | forall( otype T ) void push( stack(T) & s, T value ) with( s ) { |
---|
43 | stack_node(T) * n = alloc(); |
---|
44 | (*n){ value, head }; |
---|
45 | head = n; |
---|
46 | } |
---|
47 | |
---|
48 | forall( otype T ) T pop( stack(T) & s ) with( s ) { |
---|
49 | stack_node(T) * n = head; |
---|
50 | head = n->next; |
---|
51 | T v = n->value; |
---|
52 | ^(*n){}; |
---|
53 | free( n ); |
---|
54 | return v; |
---|
55 | } |
---|
Note: See
TracBrowser
for help on using the repository browser.