-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnode.c
124 lines (99 loc) · 2.33 KB
/
node.c
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
/*
* ISC License
*
* Copyright (c) 2022, Tommi Leino <[email protected]>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include "node.h"
#include "elem.h"
#include "cdata.h"
#include "document.h"
#include <stdlib.h>
#include <err.h>
#include <assert.h>
static struct node *node_create(T_NODE type);
struct node *
node_create_from_cdata(struct cdata *cdata)
{
struct node *node;
assert(cdata != NULL);
node = node_create(NODE_CDATA);
node->u.cdata = cdata;
cdata->node = node;
return node;
}
struct node *
node_create_from_elem(struct elem *elem)
{
struct node *node;
assert(elem != NULL);
node = node_create(NODE_ELEM);
node->u.elem = elem;
elem->node = node;
return node;
}
static size_t
node_free_internal(struct node *node, int want_sum)
{
size_t sum = sizeof(struct node);
switch (node->type) {
case NODE_ELEM:
if (want_sum)
sum += elem_size(node->u.elem);
else
elem_free(node->u.elem);
break;
case NODE_CDATA:
if (want_sum)
sum += cdata_size(node->u.cdata);
else
cdata_free(node->u.cdata);
break;
default:
break;
}
if (!want_sum)
free(node);
return sum;
}
size_t
node_size(struct node *node)
{
return node_free_internal(node, 1);
}
void
node_free(struct node *node)
{
(void) node_free_internal(node, 0);
}
struct node *
node_create_from_document(struct document *document)
{
struct node *node;
assert(document != NULL);
node = node_create(NODE_DOCUMENT);
node->u.document = document;
document->node = node;
return node;
}
static struct node *
node_create(T_NODE type)
{
struct node *node;
node = calloc(1, sizeof(struct node));
if (node == NULL)
err(1, "calloc node");
node->type = type;
return node;
}