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 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884
|
/****************************************************************************
** $Id: qt/src/kernel/qthread_unix.cpp 2.3.1 edited 2001-06-11 $
**
** QThread class for Unix
**
** Created : 931107
**
** Copyright (C) 1992-2000 Trolltech AS. All rights reserved.
**
** This file is part of the kernel module of the Qt GUI Toolkit.
**
** This file may be distributed under the terms of the Q Public License
** as defined by Trolltech AS of Norway and appearing in the file
** LICENSE.QPL included in the packaging of this file.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition
** licenses for Unix/X11 or for Qt/Embedded may use this file in accordance
** with the Qt Commercial License Agreement provided with the Software.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
** information about Qt Commercial License Agreements.
** See http://www.trolltech.com/qpl/ for QPL licensing information.
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#include "qglobal.h"
#if defined(_OS_LINUX_)
# define _GNU_SOURCE
# define __USE_UNIX98
#endif
#include "qthread.h"
#if defined(QT_THREAD_SUPPORT)
#include <qapplication.h>
#include <qlist.h>
#include "qthread_p.h"
/**************************************************************************
** QMutex
*************************************************************************/
/*!
\class QMutex qthread.h
\brief The QMutex class provides access serialization between threads.
\ingroup environment
The purpose of a QMutex is to protect an object, data structure
or section of code so that only one thread can access it at a time
(In Java terms, this is similar to the synchronized keyword).
For example, say there is a method which prints a message to the
user on two lines:
\code
void someMethod()
{
qDebug("Hello");
qDebug("World");
}
\endcode
If this method is called simultaneously from two threads then
the following sequence could result:
\code
Hello
Hello
World
World
\endcode
If we add a mutex:
\code
QMutex mutex;
void someMethod()
{
mutex.lock();
qDebug("Hello");
qDebug("World");
mutex.unlock();
}
\endcode
In Java terms this would be:
\code
void someMethod()
{
synchronized {
qDebug("Hello");
qDebug("World");
}
}
\endcode
Then only one thread can execute someMethod at a time and the order
of messages is always correct. This is a trivial example, of course,
but applies to any other case where things need to happen in a particular
sequence.
*/
/*!
Constructs a new mutex. The mutex is created in an unlocked state. A
recursive mutex is created if \a recursive is TRUE; a normal mutex is
created if \a recursive is FALSE (default argument). With a recursive
mutex, a thread can lock the same mutex multiple times and it will
not be unlocked until a corresponding number of unlock() calls have
been made.
*/
QMutex::QMutex(bool recursive)
{
if (recursive)
d = new QRMutexPrivate();
else
d = new QMutexPrivate();
}
/*!
Destroys the mutex.
*/
QMutex::~QMutex()
{
delete d;
}
/*!
Attempt to lock the mutex. If another thread has locked the mutex
then this call will block until that thread has unlocked it.
\sa unlock()
*/
void QMutex::lock()
{
d->lock();
}
/*!
Unlocks the mutex. Attempting to unlock a mutex in a different thread
to the one that locked it results in an error. Unlocking a mutex that
is not locked results in undefined behaviour (varies between
different Operating Systems' thread implementations).
\sa lock()
*/
void QMutex::unlock()
{
d->unlock();
}
/*!
Returns TRUE if the mutex is locked by another thread and FALSE if not.
\e NOTE: Due to differing implementations of recursive mutexes on various
platforms, calling this function from the same thread that previous locked
the mutex will return undefined results.
*/
bool QMutex::locked()
{
return d->locked();
}
/**************************************************************************
** QThreadQtEvent
*************************************************************************/
// this is for the magic QThread::postEvent()
class QThreadQtEvent
{
public:
QThreadQtEvent(QObject *r, QEvent *e)
: receiver(r), event(e)
{ ; }
QObject *receiver;
QEvent *event;
};
class QThreadPostEventPrivate : public QObject
{
Q_OBJECT
public:
QThreadPostEventPrivate();
QList<QThreadQtEvent> events;
QMutex eventmutex;
public slots:
void sendEvents();
};
QThreadPostEventPrivate::QThreadPostEventPrivate()
{
events.setAutoDelete( TRUE );
connect( qApp, SIGNAL( guiThreadAwake() ), this, SLOT( sendEvents() ) );
}
// this is called from the QApplication::guiThreadAwake signal, and the
// application mutex is already locked
void QThreadPostEventPrivate::sendEvents()
{
eventmutex.lock();
QThreadQtEvent *qte;
for( qte = events.first(); qte != 0; qte = events.next() ) {
qApp->postEvent( qte->receiver, qte->event );
}
events.clear();
// ## let event compression take full effect
// qApp->sendPostedEvents();
eventmutex.unlock();
}
static QThreadPostEventPrivate * qthreadposteventprivate = 0;
/**************************************************************************
** QThread
*************************************************************************/
/*!
\class QThread qthread.h
\brief The QThread class provides platform-independent threads
\ingroup environment
A QThread represents a separate thread of control within the program;
it shares all data with other threads within the process but
executes independently in the way that a separate program does on
a multitasking operating system. Instead of starting in main(),
however, QThreads begin executing in run(), which you inherit
to provide your code. For instance:
\code
class MyThread : public QThread {
public:
virtual void run();
};
void MyThread::run()
{
for(int count=0;count<20;count++) {
sleep(1);
qDebug("Ping!");
}
}
int main()
{
MyThread a;
MyThread b;
a.start();
b.start();
a.wait();
b.wait();
}
\endcode
This will start two threads, each of which writes Ping! 20 times
to the screen and exits. The wait() calls at the end of main() are
necessary because exiting main() ends the program, unceremoniously
killing all other threads. Each MyThread stops executing when it
reaches the end of MyThread::run(), just as an application does when
it leaves main().
See also the paragraph on <a href="threads.html">Thread Support in Qt</a>.
*/
/*!
This returns the thread handle of the currently executing thread. The
handle returned by this function is used for internal reasons and
should not be used in any application code.
On Windows, the returned value is a pseudo handle for the current thread,
and it can not be used for numerical comparison.
*/
HANDLE QThread::currentThread()
{
#if defined(_OS_SOLARIS_)
return (HANDLE) thr_self();
#else
return (HANDLE) pthread_self();
#endif
}
/*!
Provides a way of posting an event from a thread which is not the
event thread to an object. The event is put into a queue, then the
event thread is woken which then sends the event to the object.
It is important to note that the event handler for the event, when called,
will be called from the event thread and not from the thread calling
QThread::postEvent().
Same as with \l QApplication::postEvent(), \a event must be allocated on the
heap, as it is deleted when the event has been posted.
*/
void QThread::postEvent( QObject * receiver, QEvent * event )
{
if( !qthreadposteventprivate )
qthreadposteventprivate = new QThreadPostEventPrivate();
qthreadposteventprivate->eventmutex.lock();
qthreadposteventprivate->events.append( new QThreadQtEvent(receiver, event) );
qApp->wakeUpGuiThread();
qthreadposteventprivate->eventmutex.unlock();
}
/*!
System independent sleep. This causes the current thread to sleep for
\a secs seconds.
*/
void QThread::sleep( unsigned long secs )
{
::sleep(secs);
}
/*!
System independent sleep. This causes the current thread to sleep for
\a msecs milliseconds
*/
void QThread::msleep( unsigned long msecs )
{
QThread::usleep(msecs * 1000);
}
/*!
System independent sleep. This causes the current thread to sleep for
\a usecs microseconds
*/
void QThread::usleep( unsigned long usecs )
{
if ( usecs > 1000000 )
::sleep( usecs / 1000000 );
::usleep( usecs % 1000000 );
}
/*!
Constructs a new thread. The thread does not actually begin executing
until start() is called.
*/
QThread::QThread()
{
d = new QThreadPrivate;
}
/*!
QThread destructor. Note that deleting a QThread object will not stop
the execution of the thread it represents, and that deleting a QThread
object while the thread is running is unsafe.
*/
QThread::~QThread()
{
delete d;
}
/*!
Ends execution of the calling thread and wakes up any threads waiting
for its termination.
*/
void QThread::exit()
{
dictMutex->lock();
QThread *there = thrDict->find(QThread::currentThread());
if (there) {
there->d->running = FALSE;
there->d->finished = TRUE;
there->d->thread_done.wakeAll();
}
dictMutex->unlock();
#if defined(_OS_SOLARIS_)
thr_exit(0);
#else
pthread_exit(0);
#endif
}
/*!
This allows similar functionality to POSIX pthread_join. A thread
calling this will block until one of 2 conditions is met:
<ul>
<li> The thread associated with this QThread object has finished
execution (i.e. when it returns from run() ). This
function will return TRUE if the thread has finished.
It also returns TRUE if the thread has not been started yet.
<li> \a time milliseconds has elapsed. If \a time is ULONG_MAX (default
argument), then the wait will never timeout (the thread must
return from run() ). This function will return FALSE
if the wait timed out.
</ul>
*/
bool QThread::wait(unsigned long time)
{
if (d->finished || ! d->running)
return TRUE;
return d->thread_done.wait(time);
}
/*!
This begins actual execution of the thread by calling run(),
which should be reimplemented in a QThread subclass to contain your code.
If you try to start a thread that is already running, this call will
wait until the thread has finished, and then restart the thread.
*/
void QThread::start()
{
if (d->running) {
#ifdef CHECK_RANGE
qWarning("QThread::start: thread already running");
#endif
wait();
}
d->init(this);
}
/*!
Returns TRUE is the thread is finished.
*/
bool QThread::finished() const
{
return d->finished;
}
/*!
Returns TRUE if the thread is running.
*/
bool QThread::running() const
{
return d->running;
}
/*! \fn void QThread::run()
This method is pure virtual, and it must be implemented in derived classes
in order to do useful work. Returning from this method will end execution
of the thread.
*/
/**************************************************************************
** QWaitCondition
*************************************************************************/
/*!
\class QWaitCondition qthread.h
\brief The QWaitCondition class allows waiting/waking for conditions
between threads
\ingroup environment
QWaitConditions allow a thread to tell other threads that some sort of
condition has been met; one or many threads can block waiting for a
QWaitCondition to set a condition with wakeOne() or wakeAll. Use
wakeOne() to wake one randomly-selected event or wakeAll() to wake them
all. For example, say we have three tasks that should be performed every
time the user presses a key; each task could be split into a thread, each
of which would have a run() body like so:
\code
QWaitCondition key_pressed;
while(1) {
key_pressed.wait(); // This is a QWaitCondition global variable
// Key was pressed, do something interesting
do_something();
}
\endcode
A fourth thread would read key presses and wake the other three threads
up every time it receives one, like so:
\code
QWaitCondition key_pressed;
while(1) {
getchar();
// Causes any thread in key_pressed.wait() to return from
// that method and continue processing
key_pressed.wakeAll();
}
\endcode
Note that the order the three threads are woken up in is undefined,
and that if some or all of the threads are still in do_something()
when the key is pressed, they won't be woken up (since they're not
waiting on the condition variable) and so the task will not be performed
for that key press. This can be avoided by, for example, doing something
like this:
\code
QMutex mymutex;
QWaitCondition key_pressed;
int mycount=0;
// Worker thread code
while(1) {
key_pressed.wait(); // This is a QWaitCondition global variable
mymutex.lock();
mycount++;
mymutex.unlock();
do_something();
mymutex.lock();
mycount--;
mymutex.unlock();
}
// Key reading thread code
while(1) {
getchar();
mymutex.lock();
// Sleep until there are no busy worker threads
while(count>0) {
mymutex.unlock();
sleep(1);
mymutex.lock();
}
mymutex.unlock();
key_pressed.wakeAll();
}
\endcode
The mutexes are necessary because the results if two threads
attempt to change the value of the same variable simultaneously
are unpredictable.
*/
/*!
Constructs a new event signalling object.
*/
QWaitCondition::QWaitCondition()
{
d = new QWaitConditionPrivate;
}
/*!
Deletes the event signalling object.
*/
QWaitCondition::~QWaitCondition()
{
delete d;
}
/*!
Wait on the thread event object. The thread calling this will block
until one of 2 conditions is met:
<ul>
<li> Another thread signals it using wakeOne() or wakeAll(). This
function will return TRUE in this case.
<li> \a time milliseconds has elapsed. If \a time is ULONG_MAX (default
argument), then the wait will never timeout (the event must
signalled). This function will return FALSE if the
wait timed out.
</ul>
\sa wakeOne(), wakeAll()
*/
bool QWaitCondition::wait(unsigned long time)
{
return d->wait(time);
}
/*!
Release the locked \a mutex and wait on the thread event object. The
\a mutex must be initially locked by the calling thread. If \a mutex
is not in a locked state, this function returns immediately. The
\a mutex will be unlocked, and the thread calling will block until
one of 2 conditions is met:
<ul>
<li> Another thread signals it using wakeOne() or wakeAll(). This
function will return TRUE in this case.
<li> \a time milliseconds has elapsed. If \a time is ULONG_MAX (default
argument), then the wait will never timeout (the event must
signalled). This function will return FALSE if the
wait timed out.
</ul>
The mutex will be returned to the same locked state. This function is
provided to allow the atomic transition from the locked state to the
wait state.
\sa wakeOne(), wakeAll()
*/
bool QWaitCondition::wait(QMutex *mutex, unsigned long time)
{
return d->wait(mutex, time);
}
/*!
This wakes one thread waiting on the QWaitCondition. The thread that
woken up depends on the operating system's scheduling policies, and
cannot be controlled or predicted.
\sa wakeAll()
*/
void QWaitCondition::wakeOne()
{
d->wakeOne();
}
/*!
This wakes all threads waiting on the QWaitCondition. The order in
which the threads are woken up depends on the operating system's
scheduling policies, and cannot be controlled or predicted.
\sa wakeOne()
*/
void QWaitCondition::wakeAll()
{
d->wakeAll();
}
/**************************************************************************
** QSemaphore
*************************************************************************/
/*!
\class QSemaphore qthread.h
\brief The QSemaphore class provides a robust integer semaphore.
\ingroup environment
QSemaphore can be used to serialize thread execution, similar to a
QMutex. A semaphore differs from a mutex, in that a semaphore can be
accessed by more than one thread at a time.
An example would be an application that stores data in a large tree
structure. The application creates 10 threads (commonly called a
thread pool) to do searches on the tree. When the application searches
the tree for some piece of data, it uses one thread per base node to
do the searching. A semaphore could be used to make sure that 2 threads
don't try to search the same branch of the tree.
A real world example of a semaphore would be dining at a restuarant.
A semaphore initialized to have a maximum count equal to the number
of chairs in the restuarant. As people arrive, they want a seat. As
seats are filled, the semaphore is accessed, once per person. As people
leave, the access is released, allowing more people to enter. If a
party of 10 people want to be seated, but there are only 9 seats, those
10 people will wait, but a party of 4 people would be seated (taking
the available seats to 5, making the party of 10 people wait longer).
*/
class QSemaphorePrivate {
public:
QSemaphorePrivate(int);
~QSemaphorePrivate();
QMutex mutex;
QWaitCondition cond;
int value, max;
};
QSemaphorePrivate::QSemaphorePrivate(int m)
: mutex(FALSE), value(0), max(m)
{
}
QSemaphorePrivate::~QSemaphorePrivate()
{
}
/*!
Creates a new semaphore. The semaphore can be concurrently accessed at
most \a maxcount times.
*/
QSemaphore::QSemaphore(int maxcount)
{
d = new QSemaphorePrivate(maxcount);
}
/*!
Destroys the semaphore.
*/
QSemaphore::~QSemaphore()
{
delete d;
}
/*!
Postfix ++ operator.
Try to get access to the semaphore. If \l available() is >= \l total(),
this call will block until it can get access.
*/
int QSemaphore::operator++(int)
{
int ret;
d->mutex.lock();
while (d->value >= d->max)
d->cond.wait(&(d->mutex));
++(d->value);
if (d->value > d->max) d->value = d->max;
ret = d->value;
d->mutex.unlock();
return ret;
}
/*!
Postfix -- operator.
Release access of the semaphore. This wakes all threads waiting for
access to the semaphore.
*/
int QSemaphore::operator--(int)
{
int ret;
d->mutex.lock();
--(d->value);
if (d->value < 0) d->value = 0;
ret = d->value;
d->cond.wakeAll();
d->mutex.unlock();
return ret;
}
/*!
Try to get access to the semaphore. If \l available() is >= \l total(),
the calling thread blocks until it can get access. The calling will
only get access from the semaphore if it can get all \a n accesses
at once.
*/
int QSemaphore::operator+=(int n)
{
int ret;
d->mutex.lock();
while (d->value + n > d->max)
d->cond.wait(&(d->mutex));
d->value += n;
#ifdef CHECK_RANGE
if (d->value > d->max) {
qWarning("QSemaphore::operator+=: attempt to allocate more resources than available");
d->value = d->max;
}
#endif
ret = d->value;
d->mutex.unlock();
return ret;
}
/*!
Release \a n accesses to the semaphore.
*/
int QSemaphore::operator-=(int n)
{
int ret;
d->mutex.lock();
d->value -= n;
#ifdef CHECK_RANGE
if (d->value < 0) {
qWarning("QSemaphore::operator-=: attempt to deallocate more resources than taken");
d->value = 0;
}
#endif
ret = d->value;
d->cond.wakeOne();
d->mutex.unlock();
return ret;
}
/*!
This function returns the number of accesses currently available to
the semaphore.
*/
int QSemaphore::available() const {
int ret;
d->mutex.lock();
ret = d->max - d->value;
d->mutex.unlock();
return ret;
}
/*!
This function returns the total number of accesses to the semaphore.
*/
int QSemaphore::total() const {
int ret;
d->mutex.lock();
ret = d->max;
d->mutex.unlock();
return ret;
}
#include "qthread_unix.moc"
#endif
|