/* $Id$ */ /* * Copyright (c) 2005 Dimitri Sokolyuk * * 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_ */