1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127
|
/* -*- C++ -*-
This file implements the DestructedState class.
$ Author: Mirko Boehm $
$ Copyright: (C) 2005-2013 Mirko Boehm $
$ Contact: mirko@kde.org
http://www.kde.org
http://creative-destruction.me $
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
$Id: DestructedState.cpp 30 2005-08-16 16:16:04Z mirko $
*/
#include "destructedstate.h"
namespace ThreadWeaver
{
DestructedState::DestructedState(QueueSignals *)
: WeaverImplState(nullptr) // make sure we cannot use weaver, ever :-)
{
}
void DestructedState::shutDown()
{
}
Weaver *DestructedState::weaver()
{
return nullptr;
}
const Weaver *DestructedState::weaver() const
{
return nullptr;
}
void DestructedState::setMaximumNumberOfThreads(int)
{
}
int DestructedState::maximumNumberOfThreads() const
{
return 0;
}
int DestructedState::currentNumberOfThreads() const
{
return 0;
}
void DestructedState::enqueue(const QVector<JobPointer> &)
{
}
bool DestructedState::dequeue(const JobPointer &)
{
return false;
}
void DestructedState::dequeue()
{
}
void DestructedState::finish()
{
}
bool DestructedState::isEmpty() const
{
return true;
}
bool DestructedState::isIdle() const
{
return true;
}
int DestructedState::queueLength() const
{
return 0;
}
void DestructedState::requestAbort()
{
}
void DestructedState::suspend()
{
}
void DestructedState::resume()
{
}
JobPointer DestructedState::applyForWork(Thread *, bool wasBusy)
{
Q_UNUSED(wasBusy) // except in Q_ASSERT
Q_ASSERT(wasBusy == false);
return JobPointer();
}
void DestructedState::waitForAvailableJob(Thread *)
{
}
StateId DestructedState::stateId() const
{
return Destructed;
}
}
|