-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy pathOwnerLock.cpp
58 lines (51 loc) · 1.81 KB
/
OwnerLock.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
/*******************************************************************************
* Copyright © 2015, 2016 Saman Barghi
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*******************************************************************************/
#include <uThreads/uThreads.h>
#include <stdio.h>
#include <iostream>
#include <unistd.h>
static OwnerLock mtx;
static mword counter = 0;
using namespace std;
static void run(void* args){
//assume args is an int
int value = *(int*)args;
mtx.acquire();
cout << uThread::currentUThread()->getCurrentCluster().getID() << ":uThreadID: " << uThread::currentUThread()->getID() << ": This is run #" << value << " - counter #" << counter++ << endl;
mtx.release();
}
int main(){
std::cout<<"Start of Main Function"<<std::endl;
Cluster cluster;
kThread kt(cluster);
kThread kt1(cluster);
kThread kt2(cluster);
kThread kt3(cluster);
uThread* ut;
int value[100000];
for (int i=0; i< 100000; i++){
ut = uThread::create();
//Numbers should be written in order
value[i] = i;
ut->start(cluster, (ptr_t)run, &value[i]);
}
while(uThread::getTotalNumberofUTs() > 1){
uThread::yield();
}
cout << "End of Main Function!" << endl;
return 0;
}