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 633a642 was
604e76d,
checked in by Peter A. Buhr <pabuhr@…>, 7 years ago
|
initial setup for general and concurrency papers
|
-
Property mode set to
100644
|
File size:
1.1 KB
|
Rev | Line | |
---|
[604e76d] | 1 | #include <stdlib.h> |
---|
| 2 | #include "c-stack.h" |
---|
| 3 | |
---|
| 4 | struct stack_node { |
---|
| 5 | void* value; |
---|
| 6 | struct stack_node* next; |
---|
| 7 | }; |
---|
| 8 | |
---|
| 9 | struct stack new_stack() { return (struct stack){ NULL }; /***/ } |
---|
| 10 | |
---|
| 11 | void copy_stack(struct stack* s, const struct stack* t, void* (*copy)(const void*)) { |
---|
| 12 | struct stack_node** crnt = &s->head; |
---|
| 13 | for ( struct stack_node* next = t->head; next; next = next->next ) { |
---|
| 14 | *crnt = malloc(sizeof(struct stack_node)); /***/ |
---|
| 15 | **crnt = (struct stack_node){ copy(next->value) }; /***/ |
---|
| 16 | crnt = &(*crnt)->next; |
---|
| 17 | } |
---|
| 18 | *crnt = 0; |
---|
| 19 | } |
---|
| 20 | |
---|
| 21 | void clear_stack(struct stack* s, void (*free_el)(void*)) { |
---|
| 22 | for ( struct stack_node* next = s->head; next; ) { |
---|
| 23 | struct stack_node* crnt = next; |
---|
| 24 | next = crnt->next; |
---|
| 25 | free_el(crnt->value); |
---|
| 26 | free(crnt); |
---|
| 27 | } |
---|
| 28 | s->head = NULL; |
---|
| 29 | } |
---|
| 30 | |
---|
| 31 | _Bool stack_empty(const struct stack* s) { return s->head == NULL; } |
---|
| 32 | |
---|
| 33 | void push_stack(struct stack* s, void* value) { |
---|
| 34 | struct stack_node* n = malloc(sizeof(struct stack_node)); /***/ |
---|
| 35 | *n = (struct stack_node){ value, s->head }; /***/ |
---|
| 36 | s->head = n; |
---|
| 37 | } |
---|
| 38 | |
---|
| 39 | void* pop_stack(struct stack* s) { |
---|
| 40 | struct stack_node* n = s->head; |
---|
| 41 | s->head = n->next; |
---|
| 42 | void* x = n->value; |
---|
| 43 | free(n); |
---|
| 44 | return x; |
---|
| 45 | } |
---|
Note: See
TracBrowser
for help on using the repository browser.