-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbanker.h
60 lines (53 loc) · 1.25 KB
/
banker.h
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
#include <iostream>
#include <mutex>
#include <vector>
using namespace std;
class Banker {
vector<mutex *> mutexes;
vector<bool> available;
public:
Banker(int mutex_count) {
for (int i = 0; i < mutex_count; ++i) {
this->mutexes.push_back(new mutex());
}
this->available.resize(mutex_count, 1);
}
void lock(vector<bool> request) {
while (true) {
bool can_lock = true;
vector<bool> result(this->available.size());
for (int i = 0; i < request.size(); ++i) {
if (request[i] && available[i]) {
result[i] = false;
} else if (!request[i]) {
result[i] = available[i];
} else {
can_lock = false;
break;
}
}
if (can_lock) {
for (int i = 0; i < this->available.size(); i++) {
if (request[i]) {
this->mutexes[i]->lock();
}
}
this->available = result;
break;
}
}
}
void unlock(vector<bool> request) {
for (int i = 0; i < request.size(); i++) {
if (request[i]) {
this->mutexes[i]->unlock();
this->available[i] = true;
}
}
}
void cleanup() {
for (int i = 0; i < mutexes.size(); ++i) {
delete this->mutexes[i];
}
}
};