- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/papers/general/evaluation/cfa-stack.c
r29db723 r81e8ab0 17 17 } 18 18 *crnt = 0; 19 } 20 21 forall( otype T ) void clear( stack(T) & s ) with( s ) { 22 for ( stack_node(T) * next = head; next; ) { 23 stack_node(T) * crnt = next; 24 next = crnt->next; 25 ^(*crnt){}; 26 free(crnt); 27 } 28 head = 0; 19 29 } 20 30 … … 44 54 return v; 45 55 } 46 47 forall( otype T ) void clear( stack(T) & s ) with( s ) {48 for ( stack_node(T) * next = head; next; ) {49 stack_node(T) * crnt = next;50 next = crnt->next;51 ^(*crnt){};52 free(crnt);53 }54 head = 0;55 }
Note: See TracChangeset
for help on using the changeset viewer.