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
|
#include <u.h>
#include <libc.h>
#include <thread.h>
typedef struct Ttask Ttask;
typedef struct Tpool Tpool;
struct Ttask
{
void (*fn)(void*);
void *arg;
};
struct Tpool
{
ulong nprocs;
Ref nworking;
Channel *subq; /* task submission queue */
Channel *done; /* task completion signal */
};
void
threadloop(void *arg)
{
Tpool *pool;
Ttask *task;
pool = arg;
while((task = recvp(pool->subq)) != nil){
incref(&pool->nworking);
task->fn(task->arg);
decref(&pool->nworking);
nbsend(pool->done, nil);
}
}
Tpool *
mkthreadpool(ulong nprocs)
{
Tpool *tp;
tp = malloc(sizeof *tp);
memset(tp, 0, sizeof *tp);
tp->nprocs = nprocs;
tp->subq = chancreate(sizeof(void*), nprocs);
tp->done = chancreate(sizeof(void*), 0);
while(nprocs--)
proccreate(threadloop, tp, mainstacksize);
return tp;
}
void
threadpoolexec(Tpool *tp, void (*fn)(void*), void *arg)
{
Ttask *t;
t = malloc(sizeof *t);
t->fn = fn;
t->arg = arg;
sendp(tp->subq, t);
}
typedef struct Tsum Tsum;
struct Tsum
{
int a;
int b;
};
void
sum(void *arg)
{
Tsum *sum;
int cnt;
sum = arg;
cnt = 100;
while(cnt--) sum->a = sum->a+sum->b;
}
void
usage(void)
{
fprint(2, "usage: %s [-t] [-n nprocs]\n", argv0);
exits(nil);
}
void
threadmain(int argc, char *argv[])
{
static int W = 1000, H = 1000;
Tpool *pool;
Tsum *t;
int i, j;
int threaded;
int nprocs;
threaded = 0;
nprocs = 8;
ARGBEGIN{
case 't': threaded++; break;
case 'n': nprocs = strtoul(EARGF(usage()), nil, 0); break;
default: usage();
}ARGEND;
if(argc != 0)
usage();
t = malloc(W*H*sizeof(*t));
if(threaded){
pool = mkthreadpool(nprocs);
for(i = 0; i < H; i++)
for(j = 0; j < W; j++){
t[i*W+j] = (Tsum){i, j};
threadpoolexec(pool, sum, &t[i*W+j]);
}
while(pool->nworking.ref > 0)
recvp(pool->done);
threadexitsall(nil);
}
for(i = 0; i < H; i++)
for(j = 0; j < W; j++){
t[i*W+j] = (Tsum){i, j};
sum(&t[i*W+j]);
}
exits(nil);
}
|
