-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhtml_parser_document_stack.c
More file actions
108 lines (81 loc) · 1.37 KB
/
Copy pathhtml_parser_document_stack.c
File metadata and controls
108 lines (81 loc) · 1.37 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
#include <stdlib.h>
#include <stdio.h>
#include "html_parser_assert.h"
#include "html_parser_mem.h"
#include "html_parser_document_node.h"
#include "html_parser_document_stack.h"
#define T Stack_T
struct T {
int count;
struct elem {
void *n;
struct elem *link;
} *head;
};
T Stack_stack(void)
{
T stk;
NEW(stk);
stk->count = 0;
stk->head = NULL;
return stk;
}
int Stack_empty(T stk)
{
assert(stk);
return (stk->count == 0);
}
void Stack_push(T stk, void *n)
{
struct elem *t;
assert(stk);
NEW(t);
t->n = n;
t->link = stk->head;
stk->head = t;
stk->count++;
}
void *Stack_peek(T stk)
{
assert(stk);
assert(stk->count > 0);
return stk->head->n;
}
/*int Stack_find(T stk, const char *tag_name)*/
/*{*/
/*int index = 0; [> 0 : not found <]*/
/*assert(stk);*/
/*if (!Stack_empty(stk)) {*/
/*struct elem *t = stk->head;*/
/*while (index++ < stk->count) {*/
/*if (tag_name == Node_name(*t->n))*/
/*break;*/
/*t = t->link;*/
/*}*/
/*}*/
/*index = (index > stk->count) ? 0 : index;*/
/*return index;*/
/*}*/
void *Stack_pop(T stk)
{
Node_T *n;
struct elem *t;
assert(stk);
assert(stk->count > 0);
t = stk->head;
stk->head = t->link;
stk->count--;
n = t->n;
FREE(t);
return n;
}
void Stack_free(T *stk)
{
struct elem *t, *u;
assert(stk && *stk);
for (t = (*stk)->head; t; t = u) {
u = t->link;
FREE(t);
}
FREE(*stk);
}