src/gui/torrentcontentmodelfolder.cpp

   1 /*
   2  * Bittorrent Client using Qt and libtorrent.
   3  * Copyright (C) 2006-2012  Christophe Dumez <chris@qbittorrent.org>
   4  *
   5  * This program is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU General Public License
   7  * as published by the Free Software Foundation; either version 2
   8  * of the License, or (at your option) any later version.
   9  *
  10  * This program is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13  * GNU General Public License for more details.
  14  *
  15  * You should have received a copy of the GNU General Public License
  16  * along with this program; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  18  *
  19  * In addition, as a special exception, the copyright holders give permission to
  20  * link this program with the OpenSSL project's "OpenSSL" library (or with
  21  * modified versions of it that use the same license as the "OpenSSL" library),
  22  * and distribute the linked executables. You must obey the GNU General Public
  23  * License in all respects for all of the code used other than "OpenSSL".  If you
  24  * modify file(s), you may extend this exception to your version of the file(s),
  25  * but you are not obligated to do so. If you do not wish to do so, delete this
  26  * exception statement from your version.
  27  */
  28
  29 #include "torrentcontentmodelfolder.h"
  30
  31 #include <QVariant>
  32
  33 #include "base/global.h"
  34
  35 TorrentContentModelFolder::TorrentContentModelFolder(const QString &name, TorrentContentModelFolder *parent)
  36     : TorrentContentModelItem(parent)
  37 {
  38     Q_ASSERT(parent);
  39     m_name = name;
  40 }
  41
  42 TorrentContentModelFolder::TorrentContentModelFolder(const QVector<QString> &data)
  43     : TorrentContentModelItem(nullptr)
  44 {
  45     Q_ASSERT(data.size() == NB_COL);
  46     m_itemData = data;
  47 }
  48
  49 TorrentContentModelFolder::~TorrentContentModelFolder()
  50 {
  51     qDeleteAll(m_childItems);
  52 }
  53
  54 TorrentContentModelItem::ItemType TorrentContentModelFolder::itemType() const
  55 {
  56     return FolderType;
  57 }
  58
  59 void TorrentContentModelFolder::deleteAllChildren()
  60 {
  61     Q_ASSERT(isRootItem());
  62     qDeleteAll(m_childItems);
  63     m_childItems.clear();
  64 }
  65
  66 const QVector<TorrentContentModelItem *> &TorrentContentModelFolder::children() const
  67 {
  68     return m_childItems;
  69 }
  70
  71 void TorrentContentModelFolder::appendChild(TorrentContentModelItem *item)
  72 {
  73     Q_ASSERT(item);
  74     m_childItems.append(item);
  75     // Update own size
  76     if (item->itemType() == FileType)
  77         increaseSize(item->size());
  78 }
  79
  80 TorrentContentModelItem *TorrentContentModelFolder::child(int row) const
  81 {
  82     return m_childItems.value(row, nullptr);
  83 }
  84 int TorrentContentModelFolder::childCount() const
  85 {
  86     return m_childItems.count();
  87 }
  88
  89 // Only non-root folders use this function
  90 void TorrentContentModelFolder::updatePriority()
  91 {
  92     if (isRootItem())
  93         return;
  94
  95     Q_ASSERT(!m_childItems.isEmpty());
  96
  97     // If all children have the same priority
  98     // then the folder should have the same
  99     // priority
 100     const BitTorrent::DownloadPriority prio = m_childItems.first()->priority();
 101     for (int i = 1; i < m_childItems.size(); ++i)
 102     {
 103         if (m_childItems.at(i)->priority() != prio)
 104         {
 105             setPriority(BitTorrent::DownloadPriority::Mixed);
 106             return;
 107         }
 108     }
 109     // All child items have the same priority
 110     // Update own if necessary
 111     setPriority(prio);
 112 }
 113
 114 void TorrentContentModelFolder::setPriority(BitTorrent::DownloadPriority newPriority, bool updateParent)
 115 {
 116     if (m_priority == newPriority)
 117         return;
 118
 119     m_priority = newPriority;
 120
 121     // Update parent priority
 122     if (updateParent)
 123         m_parentItem->updatePriority();
 124
 125     // Update children
 126     if (m_priority != BitTorrent::DownloadPriority::Mixed)
 127     {
 128         for (TorrentContentModelItem *child : asConst(m_childItems))
 129             child->setPriority(m_priority, false);
 130     }
 131 }
 132
 133 void TorrentContentModelFolder::recalculateProgress()
 134 {
 135     qreal tProgress = 0;
 136     qulonglong tSize = 0;
 137     qulonglong tRemaining = 0;
 138     for (TorrentContentModelItem *child : asConst(m_childItems))
 139     {
 140         if (child->priority() == BitTorrent::DownloadPriority::Ignored)
 141             continue;
 142
 143         if (child->itemType() == FolderType)
 144             static_cast<TorrentContentModelFolder *>(child)->recalculateProgress();
 145         tProgress += child->progress() * child->size();
 146         tSize += child->size();
 147         tRemaining += child->remaining();
 148     }
 149
 150     if (!isRootItem() && (tSize > 0))
 151     {
 152         m_progress = tProgress / tSize;
 153         m_remaining = tRemaining;
 154         Q_ASSERT(m_progress <= 1.);
 155     }
 156 }
 157
 158 void TorrentContentModelFolder::recalculateAvailability()
 159 {
 160     qreal tAvailability = 0;
 161     qulonglong tSize = 0;
 162     bool foundAnyData = false;
 163     for (TorrentContentModelItem *child : asConst(m_childItems))
 164     {
 165         if (child->priority() == BitTorrent::DownloadPriority::Ignored)
 166             continue;
 167
 168         if (child->itemType() == FolderType)
 169             static_cast<TorrentContentModelFolder*>(child)->recalculateAvailability();
 170         const qreal childAvailability = child->availability();
 171         if (childAvailability >= 0)
 172         { // -1 means "no data"
 173             tAvailability += childAvailability * child->size();
 174             foundAnyData = true;
 175         }
 176         tSize += child->size();
 177     }
 178
 179     if (!isRootItem() && (tSize > 0) && foundAnyData)
 180     {
 181         m_availability = tAvailability / tSize;
 182         Q_ASSERT(m_availability <= 1.);
 183     }
 184     else
 185     {
 186         m_availability = -1.;
 187     }
 188 }
 189
 190 void TorrentContentModelFolder::increaseSize(qulonglong delta)
 191 {
 192     if (isRootItem())
 193         return;
 194
 195     m_size += delta;
 196     m_parentItem->increaseSize(delta);
 197 }