source: branches/pex/libtransmission/bencode.h @ 1540

Last change on this file since 1540 was 1540, checked in by joshe, 15 years ago

Implement Azureus peer protocol, including PEX message.
Implement extended messages, including uTorrent PEX.

  • Property svn:keywords set to Date Rev Author Id
File size: 3.3 KB
Line 
1/******************************************************************************
2 * $Id: bencode.h 1540 2007-03-08 04:06:58Z joshe $
3 *
4 * Copyright (c) 2005-2007 Transmission authors and contributors
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the "Software"),
8 * to deal in the Software without restriction, including without limitation
9 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
10 * and/or sell copies of the Software, and to permit persons to whom the
11 * Software is furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
22 * DEALINGS IN THE SOFTWARE.
23 *****************************************************************************/
24
25#ifndef TR_BENCODE_H
26#define TR_BENCODE_H 1
27
28typedef struct benc_val_s
29{
30    char * begin;
31    char * end;
32#define TYPE_INT  1
33#define TYPE_STR  2
34#define TYPE_LIST 4
35#define TYPE_DICT 8
36    char   type;
37    union
38    {
39        int64_t i;
40        struct
41        {
42            int    i;
43            char * s;
44            int    nofree;
45        } s;
46        struct
47        {
48            int                 alloc;
49            int                 count;
50            struct benc_val_s * vals;
51        } l;
52    } val;
53} benc_val_t;
54
55#define tr_bencLoad(b,l,v,e) _tr_bencLoad((char*)(b),(l),(v),(char**)(e))
56int          _tr_bencLoad( char * buf, int len, benc_val_t * val,
57                           char ** end );
58void         tr_bencPrint( benc_val_t * val );
59void         tr_bencFree( benc_val_t * val );
60benc_val_t * tr_bencDictFind( benc_val_t * val, const char * key );
61benc_val_t * tr_bencDictFindFirst( benc_val_t * val, ... );
62
63/* marks a string as 'do not free' and returns it */
64char *       tr_bencStealStr( benc_val_t * val );
65
66/* convenience functions for building benc_val_t structures */
67
68static inline void tr_bencInit( benc_val_t * val, int type )
69{
70    memset( val, 0, sizeof( *val ) );
71    val->type = type;
72}
73
74void   tr_bencInitStr( benc_val_t * val, char * str, int len, int nofree );
75int    tr_bencInitStrDup( benc_val_t * val, const char * str );
76void   tr_bencInitInt( benc_val_t * val, int64_t num );
77/* args are a NULL terminated list of benc_val_t** */
78int    tr_bencListAppend( benc_val_t * val, ... );
79/* args are a NULL terminated list of pairs of char * key, benc_val_t ** val */
80int    tr_bencDictAppend( benc_val_t * val, ... );
81/* like tr_bencDictAppend but char * key args are marked nofree */
82int    tr_bencDictAppendNofree( benc_val_t * val, ... );
83
84/* insure val has room for at least count more items */
85int tr_bencListExtend( benc_val_t * val, int count );
86
87char * tr_bencSaveMalloc( benc_val_t * val, int * len );
88int    tr_bencSave( benc_val_t * val, char ** buf,
89                          int * used, int * max );
90
91#endif
Note: See TracBrowser for help on using the repository browser.