release/src/router/transmission/qt/torrent-model.cc

   1 /*
   2  * This file Copyright (C) Mnemosyne LLC
   3  *
   4  * This program is free software; you can redistribute it and/or modify
   5  * it under the terms of the GNU General Public License version 2
   6  * as published by the Free Software Foundation.
   7  *
   8  * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
   9  *
  10  * $Id: torrent-model.cc 11092 2010-08-01 20:36:13Z charles $
  11  */
  12
  13 #include <cassert>
  14 #include <iostream>
  15
  16 #include <libtransmission/transmission.h>
  17 #include <libtransmission/bencode.h>
  18
  19 #include "torrent-delegate.h"
  20 #include "torrent-model.h"
  21
  22 void
  23 TorrentModel :: clear( )
  24 {
  25     myIdToRow.clear( );
  26     myIdToTorrent.clear( );
  27     foreach( Torrent * tor, myTorrents ) delete tor;
  28     myTorrents.clear( );
  29     reset( );
  30 }
  31
  32 int
  33 TorrentModel :: rowCount( const QModelIndex& parent ) const
  34 {
  35     Q_UNUSED( parent );
  36
  37     return myTorrents.size( );
  38 }
  39
  40 QVariant
  41 TorrentModel :: data( const QModelIndex& index, int role ) const
  42 {
  43     QVariant var;
  44     const int row = index.row( );
  45     if( row<0 || row>=myTorrents.size() )
  46         return QVariant( );
  47
  48     const Torrent* t = myTorrents.at( row );
  49
  50     switch( role )
  51     {
  52         case Qt::DisplayRole:
  53             var = QString( t->name() );
  54             break;
  55
  56         case Qt::DecorationRole:
  57             var = t->getMimeTypeIcon( );
  58             break;
  59
  60         case TorrentRole:
  61             var = qVariantFromValue( t );
  62             break;
  63
  64         default:
  65             //std::cerr << "Unhandled role: " << role << std::endl;
  66             break;
  67     }
  68
  69     return var;
  70 }
  71
  72 /***
  73 ****
  74 ***/
  75
  76 void
  77 TorrentModel :: addTorrent( Torrent * t )
  78 {
  79     myIdToTorrent.insert( t->id( ), t );
  80     myIdToRow.insert( t->id( ), myTorrents.size( ) );
  81     myTorrents.append( t );
  82 }
  83
  84 TorrentModel :: TorrentModel( Prefs& prefs ):
  85     myPrefs( prefs )
  86 {
  87 }
  88
  89 TorrentModel :: ~TorrentModel( )
  90 {
  91     clear( );
  92 }
  93
  94 /***
  95 ****
  96 ***/
  97
  98 Torrent*
  99 TorrentModel :: getTorrentFromId( int id )
 100 {
 101     id_to_torrent_t::iterator it( myIdToTorrent.find( id ) );
 102     return it == myIdToTorrent.end() ? 0 : it.value( );
 103 }
 104
 105 const Torrent*
 106 TorrentModel :: getTorrentFromId( int id ) const
 107 {
 108     id_to_torrent_t::const_iterator it( myIdToTorrent.find( id ) );
 109     return it == myIdToTorrent.end() ? 0 : it.value( );
 110 }
 111
 112 /***
 113 ****
 114 ***/
 115
 116 void
 117 TorrentModel :: onTorrentChanged( int torrentId )
 118 {
 119     const int row( myIdToRow.value( torrentId, -1 ) );
 120     if( row >= 0 ) {
 121         QModelIndex qmi( index( row, 0 ) );
 122         emit dataChanged( qmi, qmi );
 123     }
 124 }
 125
 126 void
 127 TorrentModel :: removeTorrents( tr_benc * torrents )
 128 {
 129     int i = 0;
 130     tr_benc * child;
 131     while(( child = tr_bencListChild( torrents, i++ ))) {
 132         int64_t intVal;
 133         if( tr_bencGetInt( child, &intVal ) )
 134             removeTorrent( intVal );
 135     }
 136 }
 137
 138 void
 139 TorrentModel :: updateTorrents( tr_benc * torrents, bool isCompleteList )
 140 {
 141     QList<Torrent*> newTorrents;
 142     QSet<int> oldIds( getIds( ) );
 143     QSet<int> addIds;
 144     QSet<int> newIds;
 145     int updatedCount = 0;
 146
 147     if( tr_bencIsList( torrents ) )
 148     {
 149         size_t i( 0 );
 150         tr_benc * child;
 151         while(( child = tr_bencListChild( torrents, i++ )))
 152         {
 153             int64_t id;
 154             if( tr_bencDictFindInt( child, "id", &id ) )
 155             {
 156                 newIds.insert( id );
 157
 158                 Torrent * tor = getTorrentFromId( id );
 159                 if( tor == 0 )
 160                 {
 161                     tor = new Torrent( myPrefs, id );
 162                     tor->update( child );
 163                     if( !tor->hasMetadata() )
 164                         tor->setMagnet( true );
 165                     newTorrents.append( tor );
 166                     connect( tor, SIGNAL(torrentChanged(int)), this, SLOT(onTorrentChanged(int)));
 167                 }
 168                 else
 169                 {
 170                     tor->update( child );
 171                     ++updatedCount;
 172                     if( tor->isMagnet() && tor->hasMetadata() )
 173                     {
 174                         addIds.insert( tor->id() );
 175                         tor->setMagnet( false );
 176                     }
 177                 }
 178             }
 179         }
 180     }
 181
 182     if( !newTorrents.isEmpty( ) )
 183     {
 184         const int oldCount( rowCount( ) );
 185         const int newCount( oldCount + newTorrents.size( ) );
 186         QSet<int> ids;
 187
 188         beginInsertRows( QModelIndex(), oldCount, newCount - 1 );
 189
 190         foreach( Torrent * tor, newTorrents ) {
 191             addTorrent( tor );
 192             addIds.insert( tor->id( ) );
 193         }
 194         endInsertRows( );
 195     }
 196
 197     if( !addIds.isEmpty() )
 198         emit torrentsAdded( addIds );
 199
 200     if( isCompleteList )
 201     {
 202         QSet<int> removedIds( oldIds );
 203         removedIds -= newIds;
 204         foreach( int id, removedIds )
 205             removeTorrent( id );
 206     }
 207 }
 208
 209 void
 210 TorrentModel :: removeTorrent( int id )
 211 {
 212     const int row = myIdToRow.value( id, -1 );
 213     if( row >= 0 )
 214     {
 215         Torrent * tor = myIdToTorrent.value( id, 0 );
 216
 217         beginRemoveRows( QModelIndex(), row, row );
 218         // make the myIdToRow map consistent with list view/model
 219         for( QMap<int,int>::iterator i = myIdToRow.begin(); i != myIdToRow.end(); ++i )
 220             if( i.value() > row )
 221                 --i.value();
 222         myIdToRow.remove( id );
 223         myIdToTorrent.remove( id );
 224         myTorrents.remove( myTorrents.indexOf( tor ) );
 225         endRemoveRows( );
 226
 227         delete tor;
 228     }
 229 }
 230
 231 Speed
 232 TorrentModel :: getUploadSpeed( ) const
 233 {
 234     Speed up;
 235     foreach( const Torrent * tor, myTorrents )
 236         up += tor->uploadSpeed( );
 237     return up;
 238 }
 239
 240 Speed
 241 TorrentModel :: getDownloadSpeed( ) const
 242 {
 243     Speed down;
 244     foreach( const Torrent * tor, myTorrents )
 245         down += tor->downloadSpeed( );
 246     return down;
 247 }
 248
 249 QSet<int>
 250 TorrentModel :: getIds( ) const
 251 {
 252     QSet<int> ids;
 253     foreach( const Torrent * tor, myTorrents )
 254         ids.insert( tor->id( ) );
 255     return ids;
 256 }
 257
 258 bool
 259 TorrentModel :: hasTorrent( const QString& hashString ) const
 260 {
 261     foreach( const Torrent * tor, myTorrents )
 262         if( tor->hashString( ) == hashString )
 263             return true;
 264     return false;
 265 }