kget/core/jobqueue.cpp

   1 /* This file is part of the KDE project
   2
   3    Copyright (C) 2004 Dario Massarin <nekkar@libero.it>
   4
   5    This program is free software; you can redistribute it and/or
   6    modify it under the terms of the GNU General Public
   7    License as published by the Free Software Foundation; either
   8    version 2 of the License, or (at your option) any later version.
   9 */
  10
  11
  12 #include "core/jobqueue.h"
  13
  14 #include "core/scheduler.h"
  15 #include "settings.h"
  16
  17 #include <kdebug.h>
  18
  19 JobQueue::JobQueue(Scheduler * scheduler)
  20     : m_maxSimultaneousJobs(2),
  21       m_scheduler(scheduler),
  22       m_status(Stopped)
  23 {
  24     m_scheduler->addQueue(this);
  25 }
  26
  27 JobQueue::~JobQueue()
  28 {
  29     m_scheduler->delQueue(this);
  30 }
  31
  32 Job * JobQueue::operator[] (int i) const
  33 {
  34     return m_jobs[i];
  35 }
  36
  37 const QList<Job *> JobQueue::runningJobs()
  38 {
  39     QList<Job *> jobs;
  40
  41     iterator it = begin();
  42     iterator itEnd = end();
  43
  44     for( ; it!=itEnd ; ++it )
  45     {
  46         if( (*it)->status() == Job::Running )
  47             jobs.append(*it);
  48     }
  49     return jobs;
  50 }
  51
  52 void JobQueue::setStatus(Status queueStatus)
  53 {
  54     m_status = queueStatus;
  55
  56     // Now make sure to reset all the job policy that shouldn't
  57     // be applied anymore.
  58     iterator it = begin();
  59     iterator itEnd = end();
  60
  61     for( ; it!=itEnd  ; ++it )
  62     {
  63         if( ( m_status == JobQueue::Running ) &&
  64             ( (*it)->status() == Job::Running ) )
  65         {
  66             (*it)->setPolicy(Job::None);
  67         }
  68
  69         if( ( m_status == JobQueue::Stopped ) &&
  70             ( (*it)->status() == Job::Stopped ) )
  71         {
  72             (*it)->setPolicy(Job::None);
  73         }
  74     }
  75
  76     m_scheduler->jobQueueChangedEvent(this, m_status);
  77 }
  78
  79 int JobQueue::maxSimultaneousJobs() const
  80 {
  81     if(Settings::limitDownloads())
  82         return Settings::maxConnections();
  83     else
  84         return 1000;    // High value just to indicate no limit
  85 }
  86
  87 void JobQueue::append(Job * job)
  88 {
  89     m_jobs.append(job);
  90
  91     m_scheduler->jobQueueAddedJobEvent(this, job);
  92 }
  93
  94 void JobQueue::prepend(Job * job)
  95 {
  96     m_jobs.prepend(job);
  97
  98     m_scheduler->jobQueueAddedJobEvent(this, job);
  99 }
 100
 101 void JobQueue::insert(Job * job, Job * after)
 102 {
 103     if((job->jobQueue() == this) || ((after) && (after->jobQueue() != this)))
 104         return;
 105
 106     m_jobs.insert(m_jobs.indexOf(after) +1, job);
 107     m_scheduler->jobQueueAddedJobEvent(this, job);
 108 }
 109
 110 void JobQueue::remove(Job * job)
 111 {
 112     m_jobs.removeAll(job);
 113
 114     m_scheduler->jobQueueRemovedJobEvent(this, job);
 115 }
 116
 117 void JobQueue::move(Job * job, Job * after)
 118 {
 119     kDebug(5001) << "JobQueue::move";
 120
 121     if( (m_jobs.removeAll(job) == 0) || (job == after)  ||
 122         ((after) && (after->jobQueue() != this)) )
 123     {
 124         //The job doesn't belong to this JobQueue or the requested
 125         //operations doesn't make any sense since job==after
 126         return;
 127     }
 128
 129     if(!after)
 130     {
 131         //The job must be inserted in front of the list
 132         m_jobs.prepend(job);
 133     }
 134     else
 135     {
 136         m_jobs.insert(m_jobs.indexOf(after) +1, job);
 137     }
 138
 139     m_scheduler->jobQueueMovedJobEvent(this, job);
 140 }
 141
 142