mirror of
https://github.com/RetroShare/RetroShare.git
synced 2024-10-01 02:35:48 -04:00
83 lines
1.9 KiB
C
83 lines
1.9 KiB
C
|
/*
|
||
|
|
* C implementation of a bencode decoder.
|
||
|
|
* This is the format defined by BitTorrent:
|
||
|
|
* http://wiki.theory.org/BitTorrentSpecification#bencoding
|
||
|
|
*
|
||
|
|
* The only external requirements are a few [standard] function calls and
|
||
|
|
* the long long type. Any sane system should provide all of these things.
|
||
|
|
*
|
||
|
|
* This is released into the public domain.
|
||
|
|
* Written by Mike Frysinger <vapier@gmail.com>.
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* USAGE:
|
||
|
|
* - pass the string full of the bencoded data to be_decode()
|
||
|
|
* - parse the resulting tree however you like
|
||
|
|
* - call be_free() on the tree to release resources
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef _BENCODE_H
|
||
|
|
#define _BENCODE_H
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
typedef enum {
|
||
|
|
BE_STR,
|
||
|
|
BE_INT,
|
||
|
|
BE_LIST,
|
||
|
|
BE_DICT,
|
||
|
|
} be_type;
|
||
|
|
|
||
|
|
struct be_dict;
|
||
|
|
struct be_node;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* XXX: the "val" field of be_dict and be_node can be confusing ...
|
||
|
|
*/
|
||
|
|
|
||
|
|
typedef struct be_dict {
|
||
|
|
char *key;
|
||
|
|
struct be_node *val;
|
||
|
|
} be_dict;
|
||
|
|
|
||
|
|
typedef struct be_node {
|
||
|
|
be_type type;
|
||
|
|
union {
|
||
|
|
char *s;
|
||
|
|
long long i;
|
||
|
|
struct be_node **l;
|
||
|
|
struct be_dict *d;
|
||
|
|
} val;
|
||
|
|
} be_node;
|
||
|
|
|
||
|
|
extern long long be_str_len(be_node *node);
|
||
|
|
// This function uses strlen, so is unreliable.
|
||
|
|
//extern be_node *be_decode(const char *bencode);
|
||
|
|
extern be_node *be_decoden(const char *bencode, long long bencode_len);
|
||
|
|
extern void be_free(be_node *node);
|
||
|
|
extern void be_dump(be_node *node);
|
||
|
|
extern void be_dump_str(be_node *node);
|
||
|
|
|
||
|
|
// New Functions for the other half of the work - encoding */
|
||
|
|
|
||
|
|
extern int be_encode(be_node *node, char *str, int len);
|
||
|
|
|
||
|
|
|
||
|
|
// Creating the data structure.
|
||
|
|
extern int be_add_list(be_node *list, be_node *node);
|
||
|
|
extern int be_add_keypair(be_node *dict, const char *str, be_node *node);
|
||
|
|
extern be_node *be_create_int(long long int num);
|
||
|
|
extern be_node *be_create_list();
|
||
|
|
extern be_node *be_create_str(const char *str);
|
||
|
|
extern be_node *be_create_str_wlen(const char *str, int len); /* not including \0 */
|
||
|
|
extern be_node *be_create_dict();
|
||
|
|
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif
|