Changeset 10095

Timestamp:

Feb 5, 2010, 1:16:30 AM (12 years ago)

Author:

charles

Message:

(trunk libT) #2854 "tracker did not respond" -- when both scrapes and announces are vying for a turn, give announces a higher priority

File:

• trunk/libtransmission/announcer.c (modified) (13 diffs)

trunk/libtransmission/announcer.c

@@ -57 +57 @@
     KEYLEN = 8,
 
-    /* how many scrapes we allow at one time */
-    MAX_CONCURRENT_SCRAPES = 48,
-
-    /* how many announces we allow at one time */
-    MAX_CONCURRENT_ANNOUNCES = 48,
+    /* how many web tasks we allow at one time */
+    MAX_CONCURRENT_TASKS = 48,
 
     /* if a tracker takes more than this long to respond,
@@ -206 +203 @@
     tr_session * session;
     struct event * upkeepTimer;
-    int announceSlotsAvailable;
-    int scrapeSlotsAvailable;
+    int slotsAvailable;
 }
 tr_announcer;
@@ -214 +210 @@
 tr_announcerHasBacklog( const struct tr_announcer * announcer )
 {
-    return ( announcer->scrapeSlotsAvailable < 1 )
-        || ( announcer->announceSlotsAvailable < 1 );
+    return announcer->slotsAvailable < 1;
 }
 
@@ -249 +244 @@
     a->stops = TR_PTR_ARRAY_INIT;
     a->session = session;
-    a->announceSlotsAvailable = MAX_CONCURRENT_ANNOUNCES;
-    a->scrapeSlotsAvailable = MAX_CONCURRENT_SCRAPES;
+    a->slotsAvailable = MAX_CONCURRENT_TASKS;
     a->upkeepTimer = tr_new0( struct event, 1 );
     evtimer_set( a->upkeepTimer, onUpkeepTimer, a );
@@ -1336 +1330 @@
     if( announcer != NULL )
     {
-        ++announcer->announceSlotsAvailable;
+        ++announcer->slotsAvailable;
     }
 
@@ -1385 +1379 @@
     tier->isAnnouncing = TRUE;
     tier->lastAnnounceStartTime = now;
-    --announcer->announceSlotsAvailable;
+    --announcer->slotsAvailable;
     tr_webRun( announcer->session, url, NULL, onAnnounceDone, data );
 
@@ -1471 +1465 @@
 
     if( announcer )
-        ++announcer->scrapeSlotsAvailable;
+        ++announcer->slotsAvailable;
 
     if( announcer && tier )
@@ -1563 +1557 @@
     tier->isScraping = TRUE;
     tier->lastScrapeStartTime = now;
-    --announcer->scrapeSlotsAvailable;
+    --announcer->slotsAvailable;
     dbgmsg( tier, "scraping \"%s\"", url );
     tr_webRun( announcer->session, url, NULL, onScrapeDone, data );
@@ -1598 +1592 @@
 tierNeedsToScrape( const tr_tier * tier, const time_t now )
 {
-    return tier->isRunning
-        && !tier->isScraping
+    return ( !tier->isScraping )
         && ( tier->scrapeAt != 0 )
         && ( tier->scrapeAt <= now )
@@ -1609 +1602 @@
 announceMore( tr_announcer * announcer )
 {
-    const tr_bool canAnnounce = announcer->announceSlotsAvailable > 0;
-    const tr_bool canScrape = announcer->scrapeSlotsAvailable > 0;
     tr_torrent * tor = NULL;
     const time_t now = tr_time( );
 
-    if( announcer->announceSlotsAvailable > 0 )
+    if( announcer->slotsAvailable > 0 )
     {
         int i;
@@ -1627 +1618 @@
                 for( i=0; i<n; ++i ) {
                     tr_tier * tier = tr_ptrArrayNth( &tor->tiers->tiers, i );
-                    if( canAnnounce && tierNeedsToAnnounce( tier, now ) )
+                    if( tierNeedsToAnnounce( tier, now ) )
                         tr_ptrArrayAppend( &announceMe, tier );
-                    else if( canScrape && tierNeedsToScrape( tier, now ) )
+                    else if( tierNeedsToScrape( tier, now ) )
                         tr_ptrArrayAppend( &scrapeMe, tier );
                 }
@@ -1637 +1628 @@
         /* if there are more tiers than slots available, prioritize */
         n = tr_ptrArraySize( &announceMe );
-        if( n > announcer->announceSlotsAvailable )
+        if( n > announcer->slotsAvailable )
             qsort( tr_ptrArrayBase( &announceMe ), n, sizeof( tr_tier * ), compareTiers );
 
         /* announce some */
-        n = MIN( tr_ptrArraySize( &announceMe ), announcer->announceSlotsAvailable );
+        n = MIN( tr_ptrArraySize( &announceMe ), announcer->slotsAvailable );
         for( i=0; i<n; ++i ) {
             tr_tier * tier = tr_ptrArrayNth( &announceMe, i );
@@ -1648 +1639 @@
         }
 
-
         /* scrape some */
-        n = MIN( tr_ptrArraySize( &scrapeMe ), announcer->scrapeSlotsAvailable );
+        n = MIN( tr_ptrArraySize( &scrapeMe ), announcer->slotsAvailable );
         for( i=0; i<n; ++i ) {
             tr_tier * tier = tr_ptrArrayNth( &scrapeMe, i );