summaryrefslogtreecommitdiff
path: root/bencode.h
blob: 2264f4167ef44114f894a55ac2b8201d248ae8ac (plain)
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
/* $Id$ */
/*
 * Copyright (c) 2005 Dimitri Sokolyuk <demon@dim13.org>
 *
 * 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.
 */

#ifndef _BENCODE_H_
#define _BENCODE_H_

enum node {
	NODE_DICT,
	NODE_LIST,
	NODE_INT,
	NODE_STR
};

struct btnode {
	enum	node type;
	char	*str;
	int	len;
	off_t	num;
	struct	btnode *list;
	struct {
		struct btnode *key;
		struct btnode *val;
	} dict;
	struct	btnode *next;

	/* auxiliary variables, needed only to calculate info_hash */
	struct {	
		char *off;		/* offset of node in string */
		long len;		/* entire length of node */
	} aux;
};

__BEGIN_DECLS
struct	btnode *btbencode(char *);
void	btfreenode(struct btnode *);
struct	btnode *btfinddict(struct btnode *, char *);
#if DEBUG
void	btdumpnode(struct btnode *);
#endif /* DEBUG */
__END_DECLS

#endif /* Not _BENCODE_H_ */