-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathstack.c
More file actions
156 lines (129 loc) · 2.82 KB
/
stack.c
File metadata and controls
156 lines (129 loc) · 2.82 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "stack.h"
#include "mem.h"
#include "log.h"
#define STACK_SIZE 512
static void error(char *msg) {
fprintf(stderr, "%s\n", msg);
exit(-1);
}
stack* stack_new() {
stack_elem *p;
stack *s;
p = sc_malloc(sizeof(stack_elem) * STACK_SIZE);
if (p == NULL) {
error("no memory for stack\n");
}
memset(p, 0, sizeof(stack_elem) * STACK_SIZE);
s = sc_malloc(sizeof(stack));
if (s == NULL) {
sc_free(p);
error("no memory for stack\n");
}
s->elems = p;
s->capacity = STACK_SIZE;
s->size = 0;
return s;
}
void stack_dispose(stack *s) {
if (s == NULL) {
return;
}
sc_free(s->elems);
sc_free(s);
}
void stack_push(stack *s, stack_elem obj) {
int i;
if (s == NULL) {
return;
}
if (s->size == s->capacity) {
stack_elem *p;
int cap = s->capacity * 2;
p = sc_realloc(s->elems, cap * sizeof(stack_elem));
if (p == NULL) {
error("no memory for stack\n");
}
s->capacity = cap;
s->elems = p;
}
i = s->size;
s->elems[i] = obj;
i++;
s->size = i;
}
void stack_pop(stack *s) {
int i;
if (s == NULL) {
return;
}
i = s->size;
assert(i != 0);
if (i == 0) {
sc_log("%s", "no elements in stack");
return;
}
i--;
s->elems[i] = NULL;
s->size = i;
}
void stack_for_each(stack *s, visitor_fn fn) {
stack_elem *p = s->elems;
stack_elem *q = p + s->size;
if (s == NULL || fn == NULL) {
return;
}
for (; p != q; p++) {
fn(*p);
}
}
object** stack_deepcopy(stack *s) {
stack_elem *p = s->elems;
stack_elem *q = p + s->size;
object **buf, **base;
if (s == NULL) {
return NULL;
}
buf = sc_malloc(sizeof(object*) * s->size);
if (buf == NULL) {
return NULL;
}
base = buf;
for (; p != q; p++, buf++) {
*buf = **p;
}
return base;
}
int stack_swap(stack *this, stack *src) {
stack_elem *buf;
if (this == NULL || src == NULL) {
return -1;
}
buf = sc_malloc(src->capacity * sizeof(stack_elem));
if (buf == NULL) {
return -1;
}
memcpy(buf, src->elems, sizeof(stack_elem) * src->size);
sc_free(this->elems);
this->elems = buf;
this->capacity = src->capacity;
this->size = src->size;
return 0;
}
int stack_copy(stack *this, stack *dst) {
stack_elem *buf;
if (this == NULL || dst == NULL) {
return -1;
}
buf = sc_malloc(this->size * sizeof(stack_elem));
if (buf == NULL) {
return -1;
}
memcpy(buf, this->elems, this->size * sizeof(stack_elem));
dst->elems = buf;
dst->capacity = dst->size = this->size;
return 0;
}