2006-07-16 19:39:23 +00:00
|
|
|
/******************************************************************************
|
|
|
|
* $Id$
|
|
|
|
*
|
|
|
|
* Copyright (c) 2005-2006 Transmission authors and contributors
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
|
|
* DEALINGS IN THE SOFTWARE.
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
#include "transmission.h"
|
|
|
|
|
|
|
|
#define TORRENT_MAX_SIZE (5*1024*1024)
|
|
|
|
|
|
|
|
/***********************************************************************
|
|
|
|
* Local prototypes
|
|
|
|
**********************************************************************/
|
2007-03-05 00:07:48 +00:00
|
|
|
static int getfile( char * buf, int size,
|
|
|
|
const char * prefix, const benc_val_t * name );
|
2006-12-17 16:36:27 +00:00
|
|
|
static int getannounce( tr_info_t * inf, benc_val_t * meta );
|
2007-02-27 04:00:38 +00:00
|
|
|
static char * announceToScrape( const char * announce );
|
2007-03-05 00:07:48 +00:00
|
|
|
static void strcatUTF8( char *, int, const char *, int );
|
2006-07-16 19:39:23 +00:00
|
|
|
|
|
|
|
/***********************************************************************
|
|
|
|
* tr_metainfoParse
|
|
|
|
***********************************************************************
|
|
|
|
*
|
|
|
|
**********************************************************************/
|
|
|
|
int tr_metainfoParse( tr_info_t * inf, const char * path,
|
|
|
|
const char * savedHash, int saveCopy )
|
|
|
|
{
|
|
|
|
FILE * file;
|
|
|
|
char * buf;
|
|
|
|
benc_val_t meta, * beInfo, * list, * val;
|
|
|
|
int i;
|
2006-12-17 16:36:27 +00:00
|
|
|
struct stat sb;
|
2006-07-16 19:39:23 +00:00
|
|
|
|
|
|
|
assert( NULL == path || NULL == savedHash );
|
|
|
|
/* if savedHash isn't null, saveCopy should be false */
|
|
|
|
assert( NULL == savedHash || !saveCopy );
|
|
|
|
|
2006-12-17 16:36:27 +00:00
|
|
|
if( NULL != savedHash )
|
2006-07-16 19:39:23 +00:00
|
|
|
{
|
|
|
|
snprintf( inf->torrent, MAX_PATH_LENGTH, "%s/%s",
|
|
|
|
tr_getTorrentsDirectory(), savedHash );
|
|
|
|
path = inf->torrent;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( stat( path, &sb ) )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Could not stat file (%s)", path );
|
2006-07-16 19:39:23 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if( ( sb.st_mode & S_IFMT ) != S_IFREG )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Not a regular file (%s)", path );
|
2006-07-16 19:39:23 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if( sb.st_size > TORRENT_MAX_SIZE )
|
|
|
|
{
|
2006-09-25 18:37:45 +00:00
|
|
|
tr_err( "Torrent file is too big (%d bytes)", (int)sb.st_size );
|
2006-07-16 19:39:23 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Load the torrent file into our buffer */
|
|
|
|
file = fopen( path, "rb" );
|
|
|
|
if( !file )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Could not open file (%s)", path );
|
2006-07-16 19:39:23 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
buf = malloc( sb.st_size );
|
|
|
|
fseek( file, 0, SEEK_SET );
|
|
|
|
if( fread( buf, sb.st_size, 1, file ) != 1 )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Read error (%s)", path );
|
2006-07-16 19:39:23 +00:00
|
|
|
free( buf );
|
|
|
|
fclose( file );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
fclose( file );
|
|
|
|
|
|
|
|
/* Parse bencoded infos */
|
|
|
|
if( tr_bencLoad( buf, sb.st_size, &meta, NULL ) )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Error while parsing bencoded data" );
|
2006-07-16 19:39:23 +00:00
|
|
|
free( buf );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get info hash */
|
2007-03-05 00:07:48 +00:00
|
|
|
beInfo = tr_bencDictFind( &meta, "info" );
|
|
|
|
if( NULL == beInfo || TYPE_DICT != beInfo->type )
|
2006-07-16 19:39:23 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
tr_err( "%s \"info\" dictionary", ( beInfo ? "Invalid" : "Missing" ) );
|
2006-07-16 19:39:23 +00:00
|
|
|
tr_bencFree( &meta );
|
|
|
|
free( buf );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
SHA1( (uint8_t *) beInfo->begin,
|
|
|
|
(long) beInfo->end - (long) beInfo->begin, inf->hash );
|
|
|
|
for( i = 0; i < SHA_DIGEST_LENGTH; i++ )
|
|
|
|
{
|
|
|
|
sprintf( inf->hashString + i * 2, "%02x", inf->hash[i] );
|
|
|
|
}
|
|
|
|
|
|
|
|
if( saveCopy )
|
|
|
|
{
|
|
|
|
/* Save a copy of the torrent file in the private torrent directory */
|
|
|
|
snprintf( inf->torrent, MAX_PATH_LENGTH, "%s/%s",
|
|
|
|
tr_getTorrentsDirectory(), inf->hashString );
|
|
|
|
file = fopen( inf->torrent, "wb" );
|
|
|
|
if( !file )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Could not open file (%s) (%s)",
|
|
|
|
inf->torrent, strerror(errno) );
|
2006-07-16 19:39:23 +00:00
|
|
|
tr_bencFree( &meta );
|
|
|
|
free( buf );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
fseek( file, 0, SEEK_SET );
|
|
|
|
if( fwrite( buf, sb.st_size, 1, file ) != 1 )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Write error (%s)", inf->torrent );
|
2006-07-16 19:39:23 +00:00
|
|
|
tr_bencFree( &meta );
|
|
|
|
free( buf );
|
|
|
|
fclose( file );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
fclose( file );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
snprintf( inf->torrent, MAX_PATH_LENGTH, "%s", path );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We won't need this anymore */
|
|
|
|
free( buf );
|
2006-12-17 16:36:27 +00:00
|
|
|
|
2006-11-23 01:38:18 +00:00
|
|
|
/* Comment info */
|
2007-03-05 00:07:48 +00:00
|
|
|
val = tr_bencDictFindFirst( &meta, "comment.utf-8", "comment", NULL );
|
|
|
|
if( NULL != val && TYPE_STR == val->type )
|
2006-11-23 01:38:18 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
strcatUTF8( inf->comment, sizeof( inf->comment ), val->val.s.s, 0 );
|
2006-11-23 01:38:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Creator info */
|
2007-03-05 00:07:48 +00:00
|
|
|
tr_bencDictFindFirst( &meta, "created by.utf-8", "created by", NULL );
|
|
|
|
if( NULL != val && TYPE_STR == val->type )
|
2006-11-23 01:38:18 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
strcatUTF8( inf->creator, sizeof( inf->creator ), val->val.s.s, 0 );
|
2006-11-23 01:38:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Date created */
|
2007-03-05 00:07:48 +00:00
|
|
|
inf->dateCreated = 0;
|
|
|
|
val = tr_bencDictFind( &meta, "creation date" );
|
|
|
|
if( NULL != val && TYPE_INT == val->type )
|
2006-11-23 01:38:18 +00:00
|
|
|
{
|
|
|
|
inf->dateCreated = val->val.i;
|
|
|
|
}
|
2006-12-17 16:36:27 +00:00
|
|
|
|
|
|
|
/* Private torrent */
|
2007-03-05 00:07:48 +00:00
|
|
|
if( tr_bencDictFind( beInfo, "private" ) ||
|
|
|
|
tr_bencDictFind( &meta, "private" ) )
|
2006-12-17 16:36:27 +00:00
|
|
|
{
|
2007-01-27 22:37:10 +00:00
|
|
|
inf->flags |= TR_FLAG_PRIVATE;
|
2006-12-17 16:36:27 +00:00
|
|
|
}
|
|
|
|
|
2006-07-16 19:39:23 +00:00
|
|
|
/* Piece length */
|
2007-03-05 00:07:48 +00:00
|
|
|
val = tr_bencDictFind( beInfo, "piece length" );
|
|
|
|
if( NULL == val || TYPE_INT != val->type )
|
2006-07-16 19:39:23 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
tr_err( "%s \"piece length\" entry", ( val ? "Invalid" : "Missing" ) );
|
|
|
|
goto fail;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
inf->pieceSize = val->val.i;
|
|
|
|
|
|
|
|
/* Hashes */
|
|
|
|
val = tr_bencDictFind( beInfo, "pieces" );
|
2007-03-05 00:07:48 +00:00
|
|
|
if( NULL == val || TYPE_STR != val->type )
|
|
|
|
{
|
|
|
|
tr_err( "%s \"pieces\" entry", ( val ? "Invalid" : "Missing" ) );
|
|
|
|
goto fail;
|
|
|
|
}
|
2006-07-16 19:39:23 +00:00
|
|
|
if( val->val.s.i % SHA_DIGEST_LENGTH )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Invalid \"piece\" string (size is %d)", val->val.s.i );
|
2007-03-05 00:07:48 +00:00
|
|
|
goto fail;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
inf->pieceCount = val->val.s.i / SHA_DIGEST_LENGTH;
|
|
|
|
inf->pieces = (uint8_t *) val->val.s.s; /* Ugly, but avoids a memcpy */
|
|
|
|
val->val.s.s = NULL;
|
|
|
|
|
|
|
|
/* TODO add more tests so we don't crash on weird files */
|
|
|
|
|
2007-03-05 00:07:48 +00:00
|
|
|
/* get file or top directory name */
|
|
|
|
val = tr_bencDictFindFirst( beInfo, "name.utf-8", "name", NULL );
|
|
|
|
if( NULL == val || TYPE_STR != val->type )
|
|
|
|
{
|
|
|
|
tr_err( "%s \"name\" string", ( val ? "Invalid" : "Missing" ) );
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
strcatUTF8( inf->name, sizeof( inf->name ), val->val.s.s, 1 );
|
2007-03-05 00:18:05 +00:00
|
|
|
if( '\0' == inf->name[0] )
|
|
|
|
{
|
|
|
|
tr_err( "Invalid \"name\" string" );
|
|
|
|
goto fail;
|
|
|
|
}
|
2006-07-16 19:39:23 +00:00
|
|
|
inf->totalSize = 0;
|
2007-03-05 00:07:48 +00:00
|
|
|
|
2006-07-16 19:39:23 +00:00
|
|
|
if( ( list = tr_bencDictFind( beInfo, "files" ) ) )
|
|
|
|
{
|
|
|
|
/* Multi-file mode */
|
|
|
|
inf->multifile = 1;
|
|
|
|
inf->fileCount = list->val.l.count;
|
|
|
|
inf->files = calloc( inf->fileCount * sizeof( tr_file_t ), 1 );
|
|
|
|
|
|
|
|
for( i = 0; i < list->val.l.count; i++ )
|
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
val = tr_bencDictFindFirst( &list->val.l.vals[i],
|
|
|
|
"path.utf-8", "path", NULL );
|
|
|
|
if( getfile( inf->files[i].name, sizeof( inf->files[i].name ),
|
|
|
|
inf->name, val ) )
|
2006-08-12 21:52:09 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
tr_err( "%s \"path\" entry", ( val ? "Invalid" : "Missing" ) );
|
|
|
|
goto fail;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
val = tr_bencDictFind( &list->val.l.vals[i], "length" );
|
|
|
|
inf->files[i].length = val->val.i;
|
|
|
|
inf->totalSize += val->val.i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Single-file mode */
|
|
|
|
inf->multifile = 0;
|
|
|
|
inf->fileCount = 1;
|
|
|
|
inf->files = calloc( sizeof( tr_file_t ), 1 );
|
|
|
|
|
2007-03-05 00:07:48 +00:00
|
|
|
strcatUTF8( inf->files[0].name, sizeof( inf->files[0].name),
|
|
|
|
val->val.s.s, 1 );
|
2006-07-16 19:39:23 +00:00
|
|
|
|
|
|
|
val = tr_bencDictFind( beInfo, "length" );
|
2007-03-05 00:07:48 +00:00
|
|
|
if( NULL == val || TYPE_INT != val->type )
|
|
|
|
{
|
|
|
|
tr_err( "%s \"length\" entry", ( val ? "Invalid" : "Missing" ) );
|
|
|
|
goto fail;
|
|
|
|
}
|
2006-07-16 19:39:23 +00:00
|
|
|
inf->files[0].length = val->val.i;
|
|
|
|
inf->totalSize += val->val.i;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( (uint64_t) inf->pieceCount !=
|
|
|
|
( inf->totalSize + inf->pieceSize - 1 ) / inf->pieceSize )
|
|
|
|
{
|
2006-07-16 23:40:22 +00:00
|
|
|
tr_err( "Size of hashes and files don't match" );
|
2007-03-05 00:07:48 +00:00
|
|
|
goto fail;
|
2006-12-17 16:36:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* get announce or announce-list */
|
|
|
|
if( getannounce( inf, &meta ) )
|
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
goto fail;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
tr_bencFree( &meta );
|
|
|
|
return 0;
|
2007-03-05 00:07:48 +00:00
|
|
|
|
|
|
|
fail:
|
|
|
|
tr_metainfoFree( inf );
|
|
|
|
tr_bencFree( &meta );
|
|
|
|
return 1;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
|
2006-12-17 16:36:27 +00:00
|
|
|
void tr_metainfoFree( tr_info_t * inf )
|
|
|
|
{
|
|
|
|
int ii, jj;
|
|
|
|
|
|
|
|
free( inf->pieces );
|
|
|
|
free( inf->files );
|
|
|
|
|
|
|
|
for( ii = 0; ii < inf->trackerTiers; ii++ )
|
|
|
|
{
|
|
|
|
for( jj = 0; jj < inf->trackerList[ii].count; jj++ )
|
|
|
|
{
|
|
|
|
free( inf->trackerList[ii].list[jj].address );
|
|
|
|
free( inf->trackerList[ii].list[jj].announce );
|
2007-02-27 04:00:38 +00:00
|
|
|
free( inf->trackerList[ii].list[jj].scrape );
|
2006-12-17 16:36:27 +00:00
|
|
|
}
|
|
|
|
free( inf->trackerList[ii].list );
|
|
|
|
}
|
|
|
|
free( inf->trackerList );
|
|
|
|
}
|
|
|
|
|
2007-03-05 00:07:48 +00:00
|
|
|
static int getfile( char * buf, int size,
|
|
|
|
const char * prefix, const benc_val_t * name )
|
|
|
|
{
|
|
|
|
const benc_val_t * dir;
|
|
|
|
const char ** list;
|
|
|
|
int ii, jj;
|
|
|
|
|
|
|
|
if( TYPE_LIST != name->type )
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
list = calloc( name->val.l.count, sizeof( list[0] ) );
|
|
|
|
if( NULL == list )
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ii = jj = 0; name->val.l.count > ii; ii++ )
|
|
|
|
{
|
|
|
|
if( TYPE_STR != name->val.l.vals[ii].type )
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
dir = &name->val.l.vals[ii];
|
|
|
|
if( 0 == strcmp( "..", dir->val.s.s ) )
|
|
|
|
{
|
|
|
|
if( 0 < jj )
|
|
|
|
{
|
|
|
|
jj--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if( 0 != strcmp( ".", dir->val.s.s ) )
|
|
|
|
{
|
|
|
|
list[jj] = dir->val.s.s;
|
|
|
|
jj++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if( 0 == jj )
|
|
|
|
{
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
strcatUTF8( buf, size, prefix, 0 );
|
|
|
|
for( ii = 0; jj > ii; ii++ )
|
|
|
|
{
|
|
|
|
strcatUTF8( buf, size, "/", 0 );
|
|
|
|
strcatUTF8( buf, size, list[ii], 1 );
|
|
|
|
}
|
|
|
|
free( list );
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-12-17 16:36:27 +00:00
|
|
|
static int getannounce( tr_info_t * inf, benc_val_t * meta )
|
|
|
|
{
|
|
|
|
benc_val_t * val, * subval, * urlval;
|
|
|
|
char * address, * announce;
|
|
|
|
int ii, jj, port, random;
|
|
|
|
tr_tracker_info_t * sublist;
|
|
|
|
int subcount;
|
|
|
|
void * swapping;
|
|
|
|
|
|
|
|
/* Announce-list */
|
|
|
|
val = tr_bencDictFind( meta, "announce-list" );
|
|
|
|
if( NULL != val && TYPE_LIST == val->type && 0 < val->val.l.count )
|
|
|
|
{
|
|
|
|
inf->trackerTiers = 0;
|
|
|
|
inf->trackerList = calloc( sizeof( inf->trackerList[0] ),
|
|
|
|
val->val.l.count );
|
|
|
|
|
|
|
|
/* iterate through the announce-list's tiers */
|
|
|
|
for( ii = 0; ii < val->val.l.count; ii++ )
|
|
|
|
{
|
|
|
|
subval = &val->val.l.vals[ii];
|
|
|
|
if( TYPE_LIST != subval->type || 0 >= subval->val.l.count )
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
subcount = 0;
|
|
|
|
sublist = calloc( sizeof( sublist[0] ), subval->val.l.count );
|
|
|
|
|
|
|
|
/* iterate through the tier's items */
|
|
|
|
for( jj = 0; jj < subval->val.l.count; jj++ )
|
|
|
|
{
|
|
|
|
urlval = &subval->val.l.vals[jj];
|
|
|
|
if( TYPE_STR != urlval->type ||
|
|
|
|
tr_httpParseUrl( urlval->val.s.s, urlval->val.s.i,
|
|
|
|
&address, &port, &announce ) )
|
|
|
|
{
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* place the item info in a random location in the sublist */
|
|
|
|
random = tr_rand( subcount + 1 );
|
|
|
|
if( random != subcount )
|
|
|
|
{
|
|
|
|
sublist[subcount] = sublist[random];
|
|
|
|
}
|
|
|
|
sublist[random].address = address;
|
|
|
|
sublist[random].port = port;
|
|
|
|
sublist[random].announce = announce;
|
2007-02-27 04:00:38 +00:00
|
|
|
sublist[random].scrape = announceToScrape( announce );
|
2006-12-17 16:36:27 +00:00
|
|
|
subcount++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* just use sublist as is if it's full */
|
|
|
|
if( subcount == subval->val.l.count )
|
|
|
|
{
|
|
|
|
inf->trackerList[inf->trackerTiers].list = sublist;
|
|
|
|
inf->trackerList[inf->trackerTiers].count = subcount;
|
|
|
|
inf->trackerTiers++;
|
|
|
|
}
|
|
|
|
/* if we skipped some of the tier's items then trim the sublist */
|
|
|
|
else if( 0 < subcount )
|
|
|
|
{
|
|
|
|
inf->trackerList[inf->trackerTiers].list = calloc( sizeof( sublist[0] ), subcount );
|
|
|
|
memcpy( inf->trackerList[inf->trackerTiers].list, sublist,
|
|
|
|
sizeof( sublist[0] ) * subcount );
|
|
|
|
inf->trackerList[inf->trackerTiers].count = subcount;
|
|
|
|
inf->trackerTiers++;
|
|
|
|
free( sublist );
|
|
|
|
}
|
|
|
|
/* drop the whole sublist if we didn't use any items at all */
|
|
|
|
else
|
|
|
|
{
|
|
|
|
free( sublist );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* did we use any of the tiers? */
|
|
|
|
if( 0 == inf->trackerTiers )
|
|
|
|
{
|
|
|
|
tr_inf( "No valid entries in \"announce-list\"" );
|
|
|
|
free( inf->trackerList );
|
|
|
|
inf->trackerList = NULL;
|
|
|
|
}
|
|
|
|
/* trim unused sublist pointers */
|
|
|
|
else if( inf->trackerTiers < val->val.l.count )
|
|
|
|
{
|
|
|
|
swapping = inf->trackerList;
|
|
|
|
inf->trackerList = calloc( sizeof( inf->trackerList[0] ),
|
|
|
|
inf->trackerTiers );
|
|
|
|
memcpy( inf->trackerList, swapping,
|
|
|
|
sizeof( inf->trackerList[0] ) * inf->trackerTiers );
|
|
|
|
free( swapping );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Regular announce value */
|
|
|
|
if( 0 == inf->trackerTiers )
|
|
|
|
{
|
|
|
|
val = tr_bencDictFind( meta, "announce" );
|
|
|
|
if( NULL == val || TYPE_STR != val->type )
|
|
|
|
{
|
|
|
|
tr_err( "No \"announce\" entry" );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( tr_httpParseUrl( val->val.s.s, val->val.s.i,
|
|
|
|
&address, &port, &announce ) )
|
|
|
|
{
|
|
|
|
tr_err( "Invalid announce URL (%s)", val->val.s.s );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
sublist = calloc( sizeof( sublist[0] ), 1 );
|
|
|
|
sublist[0].address = address;
|
|
|
|
sublist[0].port = port;
|
|
|
|
sublist[0].announce = announce;
|
2007-02-27 04:00:38 +00:00
|
|
|
sublist[0].scrape = announceToScrape( announce );
|
2006-12-17 16:36:27 +00:00
|
|
|
inf->trackerList = calloc( sizeof( inf->trackerList[0] ), 1 );
|
|
|
|
inf->trackerList[0].list = sublist;
|
|
|
|
inf->trackerList[0].count = 1;
|
|
|
|
inf->trackerTiers = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-02-27 04:00:38 +00:00
|
|
|
static char * announceToScrape( const char * announce )
|
|
|
|
{
|
|
|
|
char old[] = "announce";
|
|
|
|
int oldlen = 8;
|
|
|
|
char new[] = "scrape";
|
|
|
|
int newlen = 6;
|
|
|
|
char * slash, * scrape;
|
|
|
|
|
|
|
|
slash = strrchr( announce, '/' );
|
|
|
|
if( NULL == slash )
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
slash++;
|
|
|
|
|
|
|
|
if( 0 != strncmp( slash, old, oldlen ) )
|
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
scrape = calloc( strlen( announce ) - oldlen + newlen + 1, 1 );
|
|
|
|
strncat( scrape, announce, slash - announce );
|
|
|
|
strcat( scrape, new );
|
|
|
|
strcat( scrape, slash + oldlen );
|
|
|
|
|
|
|
|
return scrape;
|
|
|
|
}
|
|
|
|
|
2006-07-16 19:39:23 +00:00
|
|
|
void tr_metainfoRemoveSaved( const char * hashString )
|
|
|
|
{
|
|
|
|
char file[MAX_PATH_LENGTH];
|
|
|
|
|
|
|
|
snprintf( file, MAX_PATH_LENGTH, "%s/%s",
|
|
|
|
tr_getTorrentsDirectory(), hashString );
|
|
|
|
unlink(file);
|
|
|
|
}
|
|
|
|
|
|
|
|
/***********************************************************************
|
|
|
|
* strcatUTF8
|
|
|
|
***********************************************************************
|
|
|
|
* According to the official specification, all strings in the torrent
|
|
|
|
* file are supposed to be UTF-8 encoded. However, there are
|
|
|
|
* non-compliant torrents around... If we encounter an invalid UTF-8
|
|
|
|
* character, we assume it is ISO 8859-1 and convert it to UTF-8.
|
|
|
|
**********************************************************************/
|
2006-10-13 00:26:35 +00:00
|
|
|
#define WANTBYTES( want, got ) \
|
|
|
|
if( (want) > (got) ) { return; } else { (got) -= (want); }
|
2007-03-05 00:07:48 +00:00
|
|
|
static void strcatUTF8( char * s, int len, const char * append, int deslash )
|
2006-07-16 19:39:23 +00:00
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
const char * p;
|
|
|
|
|
|
|
|
/* don't overwrite the nul at the end */
|
|
|
|
len--;
|
2006-07-16 19:39:23 +00:00
|
|
|
|
|
|
|
/* Go to the end of the destination string */
|
|
|
|
while( s[0] )
|
|
|
|
{
|
|
|
|
s++;
|
2006-10-13 00:26:35 +00:00
|
|
|
len--;
|
2006-07-16 19:39:23 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Now start appending, converting on the fly if necessary */
|
|
|
|
for( p = append; p[0]; )
|
|
|
|
{
|
2007-03-05 00:07:48 +00:00
|
|
|
/* skip over / if requested */
|
|
|
|
if( deslash && '/' == p[0] )
|
|
|
|
{
|
|
|
|
p++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2006-07-16 19:39:23 +00:00
|
|
|
if( !( p[0] & 0x80 ) )
|
|
|
|
{
|
|
|
|
/* ASCII character */
|
2006-10-13 00:26:35 +00:00
|
|
|
WANTBYTES( 1, len );
|
2006-07-16 19:39:23 +00:00
|
|
|
*(s++) = *(p++);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( ( p[0] & 0xE0 ) == 0xC0 && ( p[1] & 0xC0 ) == 0x80 )
|
|
|
|
{
|
|
|
|
/* 2-bytes UTF-8 character */
|
2006-10-13 00:26:35 +00:00
|
|
|
WANTBYTES( 2, len );
|
2006-07-16 19:39:23 +00:00
|
|
|
*(s++) = *(p++); *(s++) = *(p++);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( ( p[0] & 0xF0 ) == 0xE0 && ( p[1] & 0xC0 ) == 0x80 &&
|
|
|
|
( p[2] & 0xC0 ) == 0x80 )
|
|
|
|
{
|
|
|
|
/* 3-bytes UTF-8 character */
|
2006-10-13 00:26:35 +00:00
|
|
|
WANTBYTES( 3, len );
|
2006-07-16 19:39:23 +00:00
|
|
|
*(s++) = *(p++); *(s++) = *(p++);
|
|
|
|
*(s++) = *(p++);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( ( p[0] & 0xF8 ) == 0xF0 && ( p[1] & 0xC0 ) == 0x80 &&
|
|
|
|
( p[2] & 0xC0 ) == 0x80 && ( p[3] & 0xC0 ) == 0x80 )
|
|
|
|
{
|
|
|
|
/* 4-bytes UTF-8 character */
|
2006-10-13 00:26:35 +00:00
|
|
|
WANTBYTES( 4, len );
|
2006-07-16 19:39:23 +00:00
|
|
|
*(s++) = *(p++); *(s++) = *(p++);
|
|
|
|
*(s++) = *(p++); *(s++) = *(p++);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ISO 8859-1 -> UTF-8 conversion */
|
2006-10-13 00:26:35 +00:00
|
|
|
WANTBYTES( 2, len );
|
2006-07-16 19:39:23 +00:00
|
|
|
*(s++) = 0xC0 | ( ( *p & 0xFF ) >> 6 );
|
|
|
|
*(s++) = 0x80 | ( *(p++) & 0x3F );
|
|
|
|
}
|
|
|
|
}
|