-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSequencer.cpp
401 lines (331 loc) · 9.54 KB
/
Sequencer.cpp
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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
/***************************************************************************
* Copyright (c) 2004 Werner Mayer <wmayer[at]users.sourceforge.net> *
* *
* This file is part of the FreeCAD CAx development system. *
* *
* 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., 59 Temple Place, *
* Suite 330, Boston, MA 02111-1307, USA *
* *
***************************************************************************/
/************** changelog *****************
// change QMutex to std::recursive_mutex
********************************************/
# include <cstdio>
# include <algorithm>
#if defined(QT_VERSION)
# include <QMutex>
# include <QMutexLocker>
typedef QMutex MutexType;
#define SEQUENCER_LOCK();();QMutexLocker locker(&SequencerP::mutex);
#else
# include <mutex>
typedef std::recursive_mutex MutexType;
#define SEQUENCER_LOCK() \
std::lock_guard<std::recursive_mutex> guard(SequencerP::mutex)
#endif
#include "Sequencer.h"
//#include "Console.h"
//#include <CXX/Objects.hxx>
using namespace Base;
namespace Base {
struct SequencerP {
// members
static std::vector<SequencerBase*> _instances; /**< A vector of all created instances */
static SequencerLauncher* _topLauncher; /**< The outermost launcher */
static MutexType mutex; /**< A mutex-locker for the launcher */
/** Sets a global sequencer object.
* Access to the last registered object is performed by @see Sequencer().
*/
static void appendInstance (SequencerBase* s)
{
_instances.push_back(s);
}
static void removeInstance (SequencerBase* s)
{
std::vector<SequencerBase*>::iterator it;
it = std::find(_instances.begin(), _instances.end(), s);
_instances.erase(it);
}
static SequencerBase& getInstance ()
{
return *_instances.back();
}
};
/**
* The _instances member just stores the pointer of the
* all instantiated SequencerBase objects.
*/
std::vector<SequencerBase*> SequencerP::_instances;
SequencerLauncher* SequencerP::_topLauncher = 0;
#if defined(QT_VERSION)
QMutex SequencerP::mutex(QMutex::Recursive);
#else
std::recursive_mutex SequencerP::mutex;
#endif
}
SequencerBase& SequencerBase::Instance ()
{
// not initialized?
if (SequencerP::_instances.size() == 0) {
new ConsoleSequencer();
}
return SequencerP::getInstance();
}
SequencerBase::SequencerBase()
: nProgress(0), nTotalSteps(0), _bLocked(false), _bCanceled(false), _nLastPercentage(-1)
{
SequencerP::appendInstance(this);
}
SequencerBase::~SequencerBase()
{
SequencerP::removeInstance(this);
}
bool SequencerBase::start(const char* pszStr, size_t steps)
{
// reset current state of progress (in percent)
this->_nLastPercentage = -1;
this->nTotalSteps = steps;
this->nProgress = 0;
this->_bCanceled = false;
setText(pszStr);
// reimplemented in sub-classes
if (!this->_bLocked)
startStep();
return true;
}
size_t SequencerBase::numberOfSteps() const
{
return this->nTotalSteps;
}
void SequencerBase::startStep()
{
}
bool SequencerBase::next(bool canAbort)
{
this->nProgress++;
float fDiv = this->nTotalSteps > 0 ? (float)this->nTotalSteps : 1000.0f;
int perc = (int)((float)this->nProgress * (100.0f / fDiv));
// do only an update if we have increased by one percent
if (perc > this->_nLastPercentage) {
this->_nLastPercentage = perc;
// if not locked
if (!this->_bLocked)
nextStep(canAbort);
}
return this->nProgress < this->nTotalSteps;
}
void SequencerBase::nextStep( bool )
{
}
void SequencerBase::setProgress(size_t)
{
}
bool SequencerBase::stop()
{
resetData();
return true;
}
void SequencerBase::pause()
{
}
void SequencerBase::resume()
{
}
bool SequencerBase::isBlocking() const
{
return true;
}
bool SequencerBase::setLocked(bool bLocked)
{
SEQUENCER_LOCK();
bool old = this->_bLocked;
this->_bLocked = bLocked;
return old;
}
bool SequencerBase::isLocked() const
{
SEQUENCER_LOCK();
return this->_bLocked;
}
bool SequencerBase::isRunning() const
{
SEQUENCER_LOCK();
return (SequencerP::_topLauncher != 0);
}
bool SequencerBase::wasCanceled() const
{
SEQUENCER_LOCK();
return this->_bCanceled;
}
void SequencerBase::tryToCancel()
{
this->_bCanceled = true;
}
void SequencerBase::rejectCancel()
{
this->_bCanceled = false;
}
int SequencerBase::progressInPercent() const
{
return this->_nLastPercentage;
}
void SequencerBase::resetData()
{
this->_bCanceled = false;
}
void SequencerBase::setText(const char*)
{
}
// ---------------------------------------------------------
EmptySequencer::EmptySequencer()
{
}
EmptySequencer::~EmptySequencer()
{
}
// ---------------------------------------------------------
using Base::ConsoleSequencer;
ConsoleSequencer::ConsoleSequencer ()
{
}
ConsoleSequencer::~ConsoleSequencer ()
{
}
void ConsoleSequencer::setText (const char* pszTxt)
{
printf("%s...\n", pszTxt);
}
void ConsoleSequencer::startStep()
{
}
void ConsoleSequencer::nextStep( bool )
{
if (this->nTotalSteps != 0)
printf("\t\t\t\t\t\t(%2.1f %%)\t\r", (float)progressInPercent());
}
void ConsoleSequencer::resetData()
{
SequencerBase::resetData();
printf("\t\t\t\t\t\t\t\t\r");
}
// ---------------------------------------------------------
SequencerLauncher::SequencerLauncher(const char* pszStr, size_t steps)
{
SEQUENCER_LOCK();
// Have we already an instance of SequencerLauncher created?
if (!SequencerP::_topLauncher) {
SequencerBase::Instance().start(pszStr, steps);
SequencerP::_topLauncher = this;
}
}
SequencerLauncher::~SequencerLauncher()
{
SEQUENCER_LOCK();
if (SequencerP::_topLauncher == this)
SequencerBase::Instance().stop();
if (SequencerP::_topLauncher == this) {
SequencerP::_topLauncher = 0;
}
}
void SequencerLauncher::setText (const char* pszTxt)
{
SEQUENCER_LOCK();
SequencerBase::Instance().setText(pszTxt);
}
bool SequencerLauncher::next(bool canAbort)
{
SEQUENCER_LOCK();
if (SequencerP::_topLauncher != this)
return true; // ignore
return SequencerBase::Instance().next(canAbort);
}
void SequencerLauncher::setProgress(size_t pos)
{
SEQUENCER_LOCK();
SequencerBase::Instance().setProgress(pos);
}
size_t SequencerLauncher::numberOfSteps() const
{
SEQUENCER_LOCK();
return SequencerBase::Instance().numberOfSteps();
}
bool SequencerLauncher::wasCanceled() const
{
return SequencerBase::Instance().wasCanceled();
}
// ---------------------------------------------------------
/*
void ProgressIndicatorPy::init_type()
{
behaviors().name("ProgressIndicator");
behaviors().doc("Progress indicator");
// you must have overwritten the virtual functions
behaviors().supportRepr();
behaviors().supportGetattr();
behaviors().supportSetattr();
behaviors().set_tp_new(PyMake);
add_varargs_method("start",&ProgressIndicatorPy::start,"start(string,int)");
add_varargs_method("next",&ProgressIndicatorPy::next,"next()");
add_varargs_method("stop",&ProgressIndicatorPy::stop,"stop()");
}
PyObject *ProgressIndicatorPy::PyMake(struct _typeobject *, PyObject *, PyObject *)
{
return new ProgressIndicatorPy();
}
ProgressIndicatorPy::ProgressIndicatorPy()
{
}
ProgressIndicatorPy::~ProgressIndicatorPy()
{
}
Py::Object ProgressIndicatorPy::repr()
{
std::string s = "Base.ProgressIndicator";
return Py::String(s);
}
Py::Object ProgressIndicatorPy::start(const Py::Tuple& args)
{
char* text;
int steps;
if (!PyArg_ParseTuple(args.ptr(), "si",&text,&steps))
throw Py::Exception();
if (!_seq.get())
_seq.reset(new SequencerLauncher(text,steps));
return Py::None();
}
Py::Object ProgressIndicatorPy::next(const Py::Tuple& args)
{
int b=0;
if (!PyArg_ParseTuple(args.ptr(), "|i",&b))
throw Py::Exception();
if (_seq.get()) {
try {
_seq->next(b ? true : false);
}
catch (const Base::AbortException&) {
_seq.reset();
throw Py::RuntimeError("abort progress indicator");
}
}
return Py::None();
}
Py::Object ProgressIndicatorPy::stop(const Py::Tuple& args)
{
if (!PyArg_ParseTuple(args.ptr(), ""))
throw Py::Exception();
_seq.reset();
return Py::None();
}
*/