forked from lightspark/lightspark
-
Notifications
You must be signed in to change notification settings - Fork 0
/
threading.cpp
142 lines (116 loc) · 2.69 KB
/
threading.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
/**************************************************************************
Lightspark, a free flash player implementation
Copyright (C) 2009,2010 Alessandro Pignotti ([email protected])
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
**************************************************************************/
#include <assert.h>
#include "threading.h"
#include "exceptions.h"
#include "logger.h"
#include "compat.h"
using namespace lightspark;
//NOTE: thread jobs can be run only once
IThreadJob::IThreadJob():jobHasTerminated(false),destroyMe(false),executing(false),aborting(false)
{
sem_init(&jobTerminated, 0, 0);
}
IThreadJob::~IThreadJob()
{
if(executing)
waitForJobTermination();
sem_destroy(&jobTerminated);
}
void IThreadJob::waitForJobTermination()
{
if(!jobHasTerminated)
sem_wait(&jobTerminated);
jobHasTerminated = true;
}
void IThreadJob::run()
{
try
{
assert(thisJob);
execute();
}
catch(JobTerminationException& ex)
{
LOG(LOG_NOT_IMPLEMENTED,_("Job terminated"));
}
sem_post(&jobTerminated);
}
void IThreadJob::stop()
{
if(executing)
{
aborting=true;
this->threadAbort();
}
}
Mutex::Mutex(const char* n):name(n),foundBusy(0)
{
sem_init(&sem,0,1);
}
Mutex::~Mutex()
{
if(name)
LOG(LOG_TRACE,_("Mutex ") << name << _(" waited ") << foundBusy << _(" times"));
sem_destroy(&sem);
}
void Mutex::lock()
{
if(name)
{
//If the semaphore can be acquired immediately just return
if(sem_trywait(&sem)==0)
return;
//Otherwise log the busy event and do a real wait
foundBusy++;
}
sem_wait(&sem);
}
void Mutex::unlock()
{
sem_post(&sem);
}
Semaphore::Semaphore(uint32_t init)//:blocked(0),maxBlocked(max)
{
sem_init(&sem,0,init);
}
Semaphore::~Semaphore()
{
//On destrucion unblocks the blocked thread
signal();
sem_destroy(&sem);
}
void Semaphore::wait()
{
sem_wait(&sem);
}
bool Semaphore::try_wait()
{
return sem_trywait(&sem)==0;
}
void Semaphore::signal()
{
sem_post(&sem);
}
Sheep::~Sheep()
{
if(lockOwner())
{
//The owner will not be destroyed until unlocked
if(owner)
owner->removeSheep(this);
}
unlockOwner();
}