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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
/* $Id: bencode.c,v 1.41 2008-10-21 19:01:15 niallo Exp $ */
/*
* Copyright (c) 2006, 2007, 2008 Niall O'Higgins <niallo@p2presearch.com>
*
* Permission to use, copy, modify, and 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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "includes.h"
#define IS_CONTAINER_TYPE(x) \
(x->flags & BDICT || x->flags & BLIST)
struct benc_node *root;
/*
* benc_node_add()
*
* Add new node to tail of node's child queue.
*/
void
benc_node_add(struct benc_node *node, struct benc_node *new)
{
TAILQ_INSERT_TAIL(&node->children, new, benc_nodes);
}
/*
* benc_node_add_head()
*
* Add new node to head of node's child queue
*/
void
benc_node_add_head(struct benc_node *node, struct benc_node *new)
{
TAILQ_INSERT_HEAD(&node->children, new, benc_nodes);
}
/*
* benc_node_create()
*
* Create and initialise a benc_node
*/
struct benc_node *
benc_node_create(void)
{
struct benc_node *node;
node = xmalloc(sizeof(*node));
memset(node, 0, sizeof(*node));
TAILQ_INIT(&(node->children));
return (node);
}
/*
* benc_node_find()
*
* Find BDICT_ENTRY node with specified key.
*/
struct benc_node *
benc_node_find(struct benc_node *node, char *key)
{
struct benc_node *childnode, *ret;
if (node->flags & BDICT_ENTRY
&& strcmp(key, node->body.dict_entry.key) == 0)
return (node->body.dict_entry.value);
if (node->flags & BDICT_ENTRY
&& IS_CONTAINER_TYPE(node))
TAILQ_FOREACH(childnode,
&node->body.dict_entry.value->children, benc_nodes)
if ((ret = benc_node_find(childnode, key)) != NULL)
return (ret);
if (IS_CONTAINER_TYPE(node))
TAILQ_FOREACH(childnode, &node->children, benc_nodes)
if ((ret = benc_node_find(childnode, key)) != NULL)
return (ret);
return (NULL);
}
/*
* benc_node_print()
*
* Pretty-print a node tree.
*/
void
benc_node_print(struct benc_node *node, int level)
{
struct benc_node *childnode;
int i;
for (i = 0; i < level; i++)
printf("\t");
if (node->flags & BDICT_ENTRY) {
printf("key: %s", node->body.dict_entry.key);
benc_node_print(node->body.dict_entry.value, level);
} else if (node->flags & BSTRING) {
printf("string len: %zu value: %s\n", node->body.string.len,
node->body.string.value);
} else if (node->flags & BINT) {
printf("int value: %lld\n", node->body.number);
}
if (node->flags & BLIST) {
printf("blist\n");
TAILQ_FOREACH(childnode, &node->children, benc_nodes)
benc_node_print(childnode, level + 1);
}
if (node->flags & BDICT) {
printf("bdict, end: %zu\n", node->end);
TAILQ_FOREACH(childnode, &node->children, benc_nodes)
benc_node_print(childnode, level + 1);
}
}
/*
* benc_node_freeall()
*
* Walk the tree from this node down, freeing everything.
*/
void
benc_node_freeall(struct benc_node *node)
{
struct benc_node *childnode;
if (node->flags & BDICT_ENTRY) {
xfree(node->body.dict_entry.key);
benc_node_freeall(node->body.dict_entry.value);
} else if (node->flags & BSTRING) {
xfree(node->body.string.value);
}
if (IS_CONTAINER_TYPE(node)) {
while ((childnode = TAILQ_FIRST(&node->children)) != NULL) {
TAILQ_REMOVE(&node->children, childnode, benc_nodes);
benc_node_freeall(childnode);
}
}
if (node != NULL)
xfree(node);
}
/*
* benc_root_create()
*
* Create a root node, which parser needs to be passed during init
*/
struct benc_node *
benc_root_create(void)
{
struct benc_node *n = benc_node_create();
n->flags = BLIST;
return (n);
}
|
