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
|
/* SPDX-FileCopyrightText: 2026 Project Tick
* SPDX-FileContributor: Project Tick
* SPDX-License-Identifier: GPL-3.0-or-later
*
* MeshMC - A Custom Launcher for Minecraft
* Copyright (C) 2026 Project Tick
*
* 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 of the License, 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 <https://www.gnu.org/licenses/>.
*/
#include "hoedown/stack.h"
#include "hoedown/buffer.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
void hoedown_stack_init(hoedown_stack* st, size_t initial_size)
{
assert(st);
st->item = NULL;
st->size = st->asize = 0;
if (!initial_size)
initial_size = 8;
hoedown_stack_grow(st, initial_size);
}
void hoedown_stack_uninit(hoedown_stack* st)
{
assert(st);
free(st->item);
}
void hoedown_stack_grow(hoedown_stack* st, size_t neosz)
{
assert(st);
if (st->asize >= neosz)
return;
st->item = hoedown_realloc(st->item, neosz * sizeof(void*));
memset(st->item + st->asize, 0x0, (neosz - st->asize) * sizeof(void*));
st->asize = neosz;
if (st->size > neosz)
st->size = neosz;
}
void hoedown_stack_push(hoedown_stack* st, void* item)
{
assert(st);
if (st->size >= st->asize)
hoedown_stack_grow(st, st->size * 2);
st->item[st->size++] = item;
}
void* hoedown_stack_pop(hoedown_stack* st)
{
assert(st);
if (!st->size)
return NULL;
return st->item[--st->size];
}
void* hoedown_stack_top(const hoedown_stack* st)
{
assert(st);
if (!st->size)
return NULL;
return st->item[st->size - 1];
}
|
