4
4
* This file is licensed by the GPL version 2. Works owned by the
5
5
* Transmission project are granted a special exemption to clause 2(b)
6
* so that the bulk of its code can remain under the MIT license.
6
* so that the bulk of its code can remain under the MIT license.
7
7
* This exemption does not extend to derived works not owned by
8
8
* the Transmission project.
10
* $Id: resume.c 6334 2008-07-15 17:16:57Z charles $
10
* $Id: resume.c 6840 2008-10-02 23:37:58Z charles $
13
13
#include <unistd.h> /* unlink */
47
47
#define KEY_PROGRESS_MTIMES "mtimes"
48
48
#define KEY_PROGRESS_BITFIELD "bitfield"
51
getResumeFilename( char * buf, size_t buflen, const tr_torrent * tor )
51
getResumeFilename( const tr_torrent * tor )
53
const char * dir = tr_getResumeDir( tor->handle );
54
char base[MAX_PATH_LENGTH];
55
tr_snprintf( base, sizeof( base ), "%s.%16.16s.resume",
57
tor->info.hashString );
58
tr_buildPath( buf, buflen, dir, base, NULL );
53
return tr_strdup_printf( "%s%c%s.%16.16s.resume",
54
tr_getResumeDir( tor->session ),
57
tor->info.hashString );
66
savePeers( tr_benc * dict, const tr_torrent * tor )
65
savePeers( tr_benc * dict,
66
const tr_torrent * tor )
69
const int count = tr_peerMgrGetPeers( tor->handle->peerMgr,
69
const int count = tr_peerMgrGetPeers( tor->session->peerMgr,
70
70
tor->info.hash, &pex );
72
tr_bencDictAddRaw( dict, KEY_PEERS, pex, sizeof(tr_pex)*count );
73
tr_bencDictAddRaw( dict, KEY_PEERS, pex, sizeof( tr_pex ) * count );
77
loadPeers( tr_benc * dict, tr_torrent * tor )
78
loadPeers( tr_benc * dict,
82
if(( p = tr_bencDictFindType( dict, KEY_PEERS, TYPE_STR )))
85
if( tr_bencDictFindRaw( dict, KEY_PEERS, &str, &len ) )
85
const char * str = p->val.s.s;
86
const size_t len = p->val.s.i;
87
88
const int count = len / sizeof( tr_pex );
88
for( i=0; i<count; ++i ) {
89
for( i = 0; i < count; ++i )
90
memcpy( &pex, str + (i*sizeof(tr_pex)), sizeof(tr_pex) );
91
tr_peerMgrAddPex( tor->handle->peerMgr,
92
memcpy( &pex, str + ( i * sizeof( tr_pex ) ), sizeof( tr_pex ) );
93
tr_peerMgrAddPex( tor->session->peerMgr,
92
94
tor->info.hash, TR_PEER_FROM_CACHE, &pex );
94
96
tr_tordbg( tor, "Loaded %d peers from resume file", count );
106
saveDND( tr_benc * dict, const tr_torrent * tor )
108
saveDND( tr_benc * dict,
109
const tr_torrent * tor )
108
const tr_info * inf = tr_torrentInfo( tor );
111
const tr_info * inf = tr_torrentInfo( tor );
109
112
const tr_file_index_t n = inf->fileCount;
113
116
list = tr_bencDictAddList( dict, KEY_DND, n );
117
for( i = 0; i < n; ++i )
115
118
tr_bencListAddInt( list, inf->files[i].dnd ? 1 : 0 );
119
loadDND( tr_benc * dict, tr_torrent * tor )
122
loadDND( tr_benc * dict,
122
tr_info * inf = &tor->info;
126
tr_info * inf = &tor->info;
123
127
const tr_file_index_t n = inf->fileCount;
124
tr_benc * list = NULL;
128
tr_benc * list = NULL;
126
130
if( tr_bencDictFindList( dict, KEY_DND, &list )
127
&& ( list->val.l.count == (int)n ) )
131
&& ( tr_bencListSize( list ) == n ) )
130
134
tr_file_index_t * dl = tr_new( tr_file_index_t, n );
131
135
tr_file_index_t * dnd = tr_new( tr_file_index_t, n );
132
tr_file_index_t i, dlCount=0, dndCount=0;
136
tr_file_index_t i, dlCount = 0, dndCount = 0;
134
for( i=0; i<n; ++i ) {
135
if( tr_bencGetInt( &list->val.l.vals[i], &tmp ) && tmp )
138
for( i = 0; i < n; ++i )
140
if( tr_bencGetInt( tr_bencListChild( list, i ), &tmp ) && tmp )
136
141
dnd[dndCount++] = i;
138
143
dl[dlCount++] = i;
142
148
tr_torrentInitFileDLs ( tor, dnd, dndCount, FALSE );
143
tr_tordbg( tor, "Resume file found %d files listed as dnd", dndCount );
149
tr_tordbg( tor, "Resume file found %d files listed as dnd",
146
154
tr_torrentInitFileDLs ( tor, dl, dlCount, TRUE );
147
tr_tordbg( tor, "Resume file found %d files marked for download", dlCount );
156
"Resume file found %d files marked for download",
168
savePriorities( tr_benc * dict, const tr_torrent * tor )
180
savePriorities( tr_benc * dict,
181
const tr_torrent * tor )
170
const tr_info * inf = tr_torrentInfo( tor );
183
const tr_info * inf = tr_torrentInfo( tor );
171
184
const tr_file_index_t n = inf->fileCount;
175
188
list = tr_bencDictAddList( dict, KEY_PRIORITY, n );
189
for( i = 0; i < n; ++i )
177
190
tr_bencListAddInt( list, inf->files[i].priority );
181
loadPriorities( tr_benc * dict, tr_torrent * tor )
194
loadPriorities( tr_benc * dict,
184
tr_info * inf = &tor->info;
198
tr_info * inf = &tor->info;
185
199
const tr_file_index_t n = inf->fileCount;
188
202
if( tr_bencDictFindList( dict, KEY_PRIORITY, &list )
189
&& ( list->val.l.count == (int)n ) )
203
&& ( tr_bencListSize( list ) == n ) )
192
206
tr_file_index_t i;
194
if( tr_bencGetInt( &list->val.l.vals[i], &tmp ) )
207
for( i = 0; i < n; ++i )
208
if( tr_bencGetInt( tr_bencListChild( list, i ), &tmp ) )
195
209
inf->files[i].priority = tmp;
196
210
ret = TR_FR_PRIORITY;
207
saveSpeedLimits( tr_benc * dict, const tr_torrent * tor )
221
saveSpeedLimits( tr_benc * dict,
222
const tr_torrent * tor )
209
224
tr_benc * d = tr_bencDictAddDict( dict, KEY_SPEEDLIMIT, 4 );
210
226
tr_bencDictAddInt( d, KEY_SPEEDLIMIT_DOWN_SPEED,
211
tr_torrentGetSpeedLimit( tor, TR_DOWN ) );
227
tr_torrentGetSpeedLimit( tor, TR_DOWN ) );
212
228
tr_bencDictAddInt( d, KEY_SPEEDLIMIT_DOWN_MODE,
213
tr_torrentGetSpeedMode( tor, TR_DOWN ) );
229
tr_torrentGetSpeedMode( tor, TR_DOWN ) );
214
230
tr_bencDictAddInt( d, KEY_SPEEDLIMIT_UP_SPEED,
215
tr_torrentGetSpeedLimit( tor, TR_UP ) );
231
tr_torrentGetSpeedLimit( tor, TR_UP ) );
216
232
tr_bencDictAddInt( d, KEY_SPEEDLIMIT_UP_MODE,
217
tr_torrentGetSpeedMode( tor, TR_UP ) );
233
tr_torrentGetSpeedMode( tor, TR_UP ) );
221
loadSpeedLimits( tr_benc * dict, tr_torrent * tor )
237
loadSpeedLimits( tr_benc * dict,
226
243
if( tr_bencDictFindDict( dict, KEY_SPEEDLIMIT, &d ) )
279
loadProgress( tr_benc * dict, tr_torrent * tor )
297
loadProgress( tr_benc * dict,
284
303
if( tr_bencDictFindDict( dict, KEY_PROGRESS, &p ) )
289
time_t * curMTimes = tr_torrentGetMTimes( tor, &n );
309
time_t * curMTimes = tr_torrentGetMTimes( tor, &n );
291
311
if( tr_bencDictFindList( p, KEY_PROGRESS_MTIMES, &m )
292
&& ( m->val.l.count == (int64_t)tor->info.fileCount )
293
&& ( m->val.l.count == n ) )
312
&& ( n == tor->info.fileCount )
313
&& ( n == tr_bencListSize( m ) ) )
316
for( i = 0; i < n; ++i )
299
if( !tr_bencGetInt( &m->val.l.vals[i], &tmp ) ) {
300
tr_tordbg( tor, "File #%d needs to be verified - couldn't find benc entry", i );
319
if( !tr_bencGetInt( tr_bencListChild( m, i ), &tmp ) )
323
"File #%zu needs to be verified - couldn't find benc entry",
301
325
tr_torrentSetFileChecked( tor, i, FALSE );
303
329
const time_t t = (time_t) tmp;
304
330
if( t == curMTimes[i] )
305
331
tr_torrentSetFileChecked( tor, i, TRUE );
307
tr_tordbg( tor, "File #%d needs to be verified - times %lu and %lu don't match", i, t, curMTimes[i] );
336
"File #%zu needs to be verified - times %lu and %lu don't match",
337
i, t, curMTimes[i] );
308
338
tr_torrentSetFileChecked( tor, i, FALSE );
315
345
tr_torrentUncheck( tor );
316
tr_tordbg( tor, "Torrent needs to be verified - unable to find mtimes" );
347
tor, "Torrent needs to be verified - unable to find mtimes" );
319
if(( b = tr_bencDictFindType( p, KEY_PROGRESS_BITFIELD, TYPE_STR )))
350
if( tr_bencDictFindRaw( p, KEY_PROGRESS_BITFIELD, &raw, &rawlen ) )
322
tmp.byteCount = b->val.s.i;
353
tmp.byteCount = rawlen;
323
354
tmp.bitCount = tmp.byteCount * 8;
324
tmp.bits = (uint8_t*) b->val.s.s;
325
if( tr_cpBlockBitfieldSet( tor->completion, &tmp ) ) {
355
tmp.bits = (uint8_t*) raw;
356
if( !tr_cpBlockBitfieldSet( tor->completion, &tmp ) )
326
358
tr_torrentUncheck( tor );
327
tr_tordbg( tor, "Torrent needs to be verified - error loading bitfield" );
361
"Torrent needs to be verified - error loading bitfield" );
332
366
tr_torrentUncheck( tor );
333
tr_tordbg( tor, "Torrent needs to be verified - unable to find bitfield" );
369
"Torrent needs to be verified - unable to find bitfield" );
336
372
tr_free( curMTimes );
337
373
ret = TR_FR_PROGRESS;
348
384
tr_torrentSaveResume( const tr_torrent * tor )
351
char filename[MAX_PATH_LENGTH];
356
392
tr_bencInitDict( &top, 14 );
357
393
tr_bencDictAddInt( &top, KEY_ACTIVITY_DATE,
359
395
tr_bencDictAddInt( &top, KEY_ADDED_DATE,
361
397
tr_bencDictAddInt( &top, KEY_CORRUPT,
362
tor->corruptPrev + tor->corruptCur );
398
tor->corruptPrev + tor->corruptCur );
363
399
tr_bencDictAddInt( &top, KEY_DONE_DATE,
365
401
tr_bencDictAddStr( &top, KEY_DOWNLOAD_DIR,
367
403
tr_bencDictAddInt( &top, KEY_DOWNLOADED,
368
tor->downloadedPrev + tor->downloadedCur );
404
tor->downloadedPrev + tor->downloadedCur );
369
405
tr_bencDictAddInt( &top, KEY_UPLOADED,
370
tor->uploadedPrev + tor->uploadedCur );
406
tor->uploadedPrev + tor->uploadedCur );
371
407
tr_bencDictAddInt( &top, KEY_MAX_PEERS,
372
tor->maxConnectedPeers );
408
tor->maxConnectedPeers );
373
409
tr_bencDictAddInt( &top, KEY_PAUSED,
374
tor->isRunning ? 0 : 1 );
410
tor->isRunning ? 0 : 1 );
375
411
savePeers( &top, tor );
376
412
savePriorities( &top, tor );
377
413
saveDND( &top, tor );
378
414
saveProgress( &top, tor );
379
415
saveSpeedLimits( &top, tor );
381
getResumeFilename( filename, sizeof( filename ), tor );
417
filename = getResumeFilename( tor );
382
418
tr_bencSaveFile( filename, &top );
384
421
tr_bencFree( &top );
388
loadFromFile( tr_torrent * tor,
389
uint64_t fieldsToLoad )
425
loadFromFile( tr_torrent * tor,
426
uint64_t fieldsToLoad )
392
429
const char * str;
393
uint64_t fieldsLoaded = 0;
394
char filename[MAX_PATH_LENGTH];
430
uint64_t fieldsLoaded = 0;
397
getResumeFilename( filename, sizeof( filename ), tor );
434
filename = getResumeFilename( tor );
399
436
if( tr_bencLoadFile( filename, &top ) )
401
tr_tordbg( tor, "Couldn't read \"%s\"; trying old format.", filename );
438
tr_tordbg( tor, "Couldn't read \"%s\"; trying old format.",
402
440
fieldsLoaded = tr_fastResumeLoad( tor, fieldsToLoad );
404
442
if( ( fieldsLoaded != 0 ) && ( fieldsToLoad == ~(uint64_t)0 ) )
408
446
tr_tordbg( tor, "Migrated resume file to \"%s\"", filename );
411
450
return fieldsLoaded;
414
453
tr_tordbg( tor, "Read resume file \"%s\"", filename );
416
455
if( ( fieldsToLoad & TR_FR_CORRUPT )
417
&& tr_bencDictFindInt( &top, KEY_CORRUPT, &i ) ) {
456
&& tr_bencDictFindInt( &top, KEY_CORRUPT, &i ) )
418
458
tor->corruptPrev = i;
419
459
fieldsLoaded |= TR_FR_CORRUPT;
422
462
if( ( fieldsToLoad & ( TR_FR_PROGRESS | TR_FR_DOWNLOAD_DIR ) )
423
&& tr_bencDictFindStr( &top, KEY_DOWNLOAD_DIR, &str ) ) {
463
&& tr_bencDictFindStr( &top, KEY_DOWNLOAD_DIR, &str ) )
424
465
tr_free( tor->downloadDir );
425
466
tor->downloadDir = tr_strdup( str );
426
467
fieldsLoaded |= TR_FR_DOWNLOAD_DIR;
429
470
if( ( fieldsToLoad & TR_FR_DOWNLOADED )
430
&& tr_bencDictFindInt( &top, KEY_DOWNLOADED, &i ) ) {
471
&& tr_bencDictFindInt( &top, KEY_DOWNLOADED, &i ) )
431
473
tor->downloadedPrev = i;
432
474
fieldsLoaded |= TR_FR_DOWNLOADED;
435
477
if( ( fieldsToLoad & TR_FR_UPLOADED )
436
&& tr_bencDictFindInt( &top, KEY_UPLOADED, &i ) ) {
478
&& tr_bencDictFindInt( &top, KEY_UPLOADED, &i ) )
437
480
tor->uploadedPrev = i;
438
481
fieldsLoaded |= TR_FR_UPLOADED;
441
484
if( ( fieldsToLoad & TR_FR_MAX_PEERS )
442
&& tr_bencDictFindInt( &top, KEY_MAX_PEERS, &i ) ) {
485
&& tr_bencDictFindInt( &top, KEY_MAX_PEERS, &i ) )
443
487
tor->maxConnectedPeers = i;
444
488
fieldsLoaded |= TR_FR_MAX_PEERS;
447
491
if( ( fieldsToLoad & TR_FR_RUN )
448
&& tr_bencDictFindInt( &top, KEY_PAUSED, &i ) ) {
492
&& tr_bencDictFindInt( &top, KEY_PAUSED, &i ) )
449
494
tor->isRunning = i ? 0 : 1;
450
495
fieldsLoaded |= TR_FR_RUN;
453
498
if( ( fieldsToLoad & TR_FR_ADDED_DATE )
454
&& tr_bencDictFindInt( &top, KEY_ADDED_DATE, &i ) ) {
499
&& tr_bencDictFindInt( &top, KEY_ADDED_DATE, &i ) )
455
501
tor->addedDate = i;
456
502
fieldsLoaded |= TR_FR_ADDED_DATE;
459
505
if( ( fieldsToLoad & TR_FR_DONE_DATE )
460
&& tr_bencDictFindInt( &top, KEY_DONE_DATE, &i ) ) {
506
&& tr_bencDictFindInt( &top, KEY_DONE_DATE, &i ) )
461
508
tor->doneDate = i;
462
509
fieldsLoaded |= TR_FR_DONE_DATE;
465
512
if( ( fieldsToLoad & TR_FR_ACTIVITY_DATE )
466
&& tr_bencDictFindInt( &top, KEY_ACTIVITY_DATE, &i ) ) {
513
&& tr_bencDictFindInt( &top, KEY_ACTIVITY_DATE, &i ) )
467
515
tor->activityDate = i;
468
516
fieldsLoaded |= TR_FR_ACTIVITY_DATE;
484
532
fieldsLoaded |= loadSpeedLimits( &top, tor );
486
534
tr_bencFree( &top );
487
536
return fieldsLoaded;
491
setFromCtor( tr_torrent * tor, uint64_t fields, const tr_ctor * ctor, int mode )
540
setFromCtor( tr_torrent * tor,
542
const tr_ctor * ctor,
493
545
uint64_t ret = 0;
495
if( fields & TR_FR_RUN ) {
547
if( fields & TR_FR_RUN )
496
549
uint8_t isPaused;
497
if( !tr_ctorGetPaused( ctor, mode, &isPaused ) ) {
550
if( !tr_ctorGetPaused( ctor, mode, &isPaused ) )
498
552
tor->isRunning = !isPaused;
499
553
ret |= TR_FR_RUN;
503
if( fields & TR_FR_MAX_PEERS )
557
if( fields & TR_FR_MAX_PEERS )
504
558
if( !tr_ctorGetPeerLimit( ctor, mode, &tor->maxConnectedPeers ) )
505
559
ret |= TR_FR_MAX_PEERS;
507
if( fields & TR_FR_DOWNLOAD_DIR ) {
561
if( fields & TR_FR_DOWNLOAD_DIR )
508
563
const char * downloadDir;
509
if( !tr_ctorGetDownloadDir( ctor, mode, &downloadDir ) ) {
564
if( !tr_ctorGetDownloadDir( ctor, mode, &downloadDir ) )
510
566
ret |= TR_FR_DOWNLOAD_DIR;
511
567
tr_free( tor->downloadDir );
512
568
tor->downloadDir = tr_strdup( downloadDir );
520
useManditoryFields( tr_torrent * tor, uint64_t fields, const tr_ctor * ctor )
576
useManditoryFields( tr_torrent * tor,
578
const tr_ctor * ctor )
522
580
return setFromCtor( tor, fields, ctor, TR_FORCE );
526
useFallbackFields( tr_torrent * tor, uint64_t fields, const tr_ctor * ctor )
584
useFallbackFields( tr_torrent * tor,
586
const tr_ctor * ctor )
528
588
return setFromCtor( tor, fields, ctor, TR_FALLBACK );
532
tr_torrentLoadResume( tr_torrent * tor,
592
tr_torrentLoadResume( tr_torrent * tor,
533
593
uint64_t fieldsToLoad,
534
594
const tr_ctor * ctor )