1
/******************************************************************************
2
* $Id: bencode.c 261 2006-05-29 21:27:31Z titer $
4
* Copyright (c) 2005-2006 Transmission authors and contributors
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:
13
* The above copyright notice and this permission notice shall be included in
14
* all copies or substantial portions of the Software.
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
*****************************************************************************/
25
#include "transmission.h"
28
#define OUTBUF_SIZE 100
30
static int tr_bencSprintf( char ** buf, size_t * used, size_t * max,
33
__attribute__ ((format (printf, 4, 5)))
37
int _tr_bencLoad( char * buf, size_t len, benc_val_t * val, char ** end )
48
/* So we only have to check once */
56
e = memchr( &buf[1], 'e', len - 1 );
65
val->val.i = strtoll( &buf[1], &p, 10 );
75
else if( buf[0] == 'l' || buf[0] == 'd' )
77
/* List: l<item1><item2>e
78
Dict: d<string1><item1><string2><item2>e
79
A dictionary is just a special kind of list with an even
80
count of items, and where even items are strings. */
85
is_dict = ( buf[0] == 'd' );
86
val->type = is_dict ? TYPE_DICT : TYPE_LIST;
87
val->val.l.alloc = LIST_SIZE;
89
val->val.l.vals = malloc( LIST_SIZE * sizeof( benc_val_t ) );
92
while( (size_t)(cur - buf) < len && cur[0] != 'e' )
94
if( val->val.l.count == val->val.l.alloc )
96
/* We need a bigger boat */
97
val->val.l.alloc += LIST_SIZE;
98
val->val.l.vals = realloc( val->val.l.vals,
99
val->val.l.alloc * sizeof( benc_val_t ) );
101
if( tr_bencLoad( cur, len - (cur - buf),
102
&val->val.l.vals[val->val.l.count], &p ) )
106
if( is_dict && str_expected &&
107
val->val.l.vals[val->val.l.count].type != TYPE_STR )
111
str_expected = !str_expected;
117
if( is_dict && ( val->val.l.count & 1 ) )
126
e = memchr( buf, ':', len );
132
/* String: 12:whateverword */
133
val->type = TYPE_STR;
135
val->val.s.i = strtol( buf, &p, 10 );
138
if( p != e || 0 > val->val.s.i ||
139
(size_t)(val->val.s.i) > len - ((p + 1) - buf) )
144
val->val.s.s = malloc( val->val.s.i + 1 );
145
val->val.s.s[val->val.s.i] = 0;
146
memcpy( val->val.s.s, p + 1, val->val.s.i );
148
val->end = p + 1 + val->val.s.i;
156
static void __bencPrint( benc_val_t * val, int space )
160
for( i = 0; i < space; i++ )
162
fprintf( stderr, " " );
168
fprintf( stderr, "int: %"PRIu64"\n", val->val.i );
172
fprintf( stderr, "%s\n", val->val.s.s );
176
fprintf( stderr, "list\n" );
177
for( i = 0; i < val->val.l.count; i++ )
178
__bencPrint( &val->val.l.vals[i], space + 1 );
182
fprintf( stderr, "dict\n" );
183
for( i = 0; i < val->val.l.count; i++ )
184
__bencPrint( &val->val.l.vals[i], space + 1 );
189
void tr_bencPrint( benc_val_t * val )
191
__bencPrint( val, 0 );
194
void tr_bencFree( benc_val_t * val )
206
free( val->val.s.s );
212
for( i = 0; i < val->val.l.count; i++ )
214
tr_bencFree( &val->val.l.vals[i] );
216
free( val->val.l.vals );
221
benc_val_t * tr_bencDictFind( benc_val_t * val, char * key )
224
if( val->type != TYPE_DICT )
229
for( i = 0; i < val->val.l.count; i += 2 )
231
if( !strcmp( val->val.l.vals[i].val.s.s, key ) )
233
return &val->val.l.vals[i+1];
240
char * tr_bencSaveMalloc( benc_val_t * val, size_t * len )
246
if( tr_bencSave( val, &buf, len, &alloc ) )
259
int tr_bencSave( benc_val_t * val, char ** buf, size_t * used, size_t * max )
266
if( tr_bencSprintf( buf, used, max, "i%"PRIu64"e", val->val.i ) )
273
if( (int)strlen(val->val.s.s) != val->val.s.i )
277
if( tr_bencSprintf( buf, used, max, "%i:%s",
278
val->val.s.i, val->val.s.s ) )
286
if( tr_bencSprintf( buf, used, max,
287
(TYPE_LIST == val->type ? "l" : "d") ) )
291
for( ii = 0; val->val.l.count > ii; ii++ )
293
if( tr_bencSave( val->val.l.vals + ii, buf, used, max ) )
298
if( tr_bencSprintf( buf, used, max, "e" ) )
308
static int tr_bencSprintf( char ** buf, size_t * used, size_t * max,
315
va_start( ap, format );
316
want = vsnprintf( NULL, 0, format, ap );
319
while( *used + want + 1 > *max )
322
newbuf = realloc( *buf, *max );
330
va_start( ap, format );
331
*used += vsnprintf( *buf + *used, *max - *used, format, ap );