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
|
/* This file is part of Mailfromd.
Copyright (C) 2005, 2006, 2007, 2008, 2010, 2011 Sergey Poznyakoff
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <stdlib.h>
#include <xalloc.h>
#include "mailfromd.h"
struct mf_stack {
char *base;
size_t tos;
size_t elsize;
size_t elcount;
};
#define STACK_PTR(s, n) (void*)((s)->base + (n) * (s)->elsize)
mf_stack_t
mf_stack_create(size_t elsize, size_t count)
{
mf_stack_t stk = xmalloc(sizeof *stk);
stk->elsize = elsize;
stk->base = NULL;
if (!count)
count = 64;
stk->elcount = count;
stk->base = x2nrealloc(stk->base,
&stk->elcount,
stk->elsize);
stk->tos = 0;
return stk;
}
void
mf_stack_destroy(mf_stack_t *pstk)
{
free((*pstk)->base);
free(*pstk);
*pstk = NULL;
}
void
mf_stack_push(mf_stack_t stk, void *item)
{
if (stk->tos == stk->elcount)
stk->base = x2nrealloc(stk->base,
&stk->elcount,
stk->elsize);
memcpy(STACK_PTR(stk, stk->tos), item, stk->elsize);
stk->tos++;
}
int
mf_stack_pop(mf_stack_t stk, void *ptr)
{
if (stk->tos == 0)
return 1;
--stk->tos;
if (ptr)
memcpy(ptr, STACK_PTR(stk, stk->tos), stk->elsize);
return 0;
}
int
mf_stack_peek(mf_stack_t stk, size_t n, void *ptr)
{
if (stk->tos == 0 || n + 1 > stk->tos)
return 1;
if (ptr)
memcpy(ptr, STACK_PTR(stk, stk->tos - 1 - n), stk->elsize);
return 0;
}
size_t
mf_stack_count(mf_stack_t stk)
{
return stk->tos;
}
int
mf_stack_enumerate_desc(mf_stack_t stk, mf_stack_enumerator fun, void *data)
{
size_t i;
for (i = stk->tos; i > 0; i--) {
int rc = fun(STACK_PTR(stk, i - 1), data);
if (rc)
return rc;
}
return 0;
}
int
mf_stack_enumerate_asc(mf_stack_t stk, mf_stack_enumerator fun, void *data)
{
size_t i;
for (i = 0; i < stk->tos; i++) {
int rc = fun(STACK_PTR(stk, i), data);
if (rc)
return rc;
}
return 0;
}
|