Mercurial > hg > Members > Moririn
annotate src/parallel_execution/main.c @ 111:556e203de999
Add dependency.c
| author | Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Mon, 02 May 2016 20:39:02 +0900 |
| parents | 059b26a250cc |
| children | e3cba827d489 |
| rev | line source |
|---|---|
| 86 | 1 #include <stdio.h> |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
2 #include <string.h> |
| 86 | 3 |
| 4 #include "context.h" | |
| 5 #include "origin_cs.h" | |
| 6 | |
| 7 extern __code initContext(struct Context* context); | |
| 90 | 8 extern void allocator(struct Context* context); |
| 86 | 9 |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
10 int cpu_num = 1; |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
11 int length = 1024; |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
12 int split; |
| 90 | 13 int* array_ptr; |
| 14 | |
| 15 void print_queue(struct Element* element) { | |
| 16 while (element) { | |
| 17 printf("%d\n", element->task->key); | |
| 18 element = element->next; | |
| 19 } | |
| 20 } | |
| 21 | |
| 22 void print_tree(struct Node* node) { | |
| 23 if (node != 0) { | |
| 24 printf("%d\n", node->value->array.index); | |
| 25 print_tree(node->left); | |
| 26 print_tree(node->right); | |
| 27 } | |
| 28 } | |
| 86 | 29 |
| 30 __code code1(struct Context* context) { | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
31 printf("cpus:\t\t%d\n", cpu_num); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
32 printf("length:\t\t%d\n", length); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
33 printf("length/task:\t%d\n", length/split); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
34 /* puts("queue"); */ |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
35 /* print_queue(context->data[ActiveQueue]->queue.first); */ |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
36 /* puts("tree"); */ |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
37 /* print_tree(context->data[Tree]->tree.root); */ |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
38 /* puts("result"); */ |
| 90 | 39 |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
40 context->next = CreateWorker; |
| 102 | 41 |
| 42 struct Time *t = &context->data[Time]->time; | |
| 43 t->next = CreateWorker; | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
44 goto meta(context, StartTime); |
| 86 | 45 } |
| 46 | |
| 47 __code code1_stub(struct Context* context) { | |
| 48 goto code1(context); | |
| 49 } | |
| 50 | |
| 92 | 51 __code code2(struct Context* context, struct Array* array, struct LoopCounter* loopCounter) { |
| 52 int i = loopCounter->i; | |
| 111 | 53 |
| 92 | 54 if (i < length) { |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
55 // printf("%d\n", array->array[i]); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
56 if (array->array[i] == (i*2)) { |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
57 loopCounter->i++; |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
58 goto meta(context, Code2); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
59 } else |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
60 puts("wrong result"); |
| 92 | 61 |
| 62 } | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
63 |
| 92 | 64 goto meta(context, Exit); |
| 65 } | |
| 66 | |
| 67 __code code2_stub(struct Context* context) { | |
| 68 goto code2(context, &context->data[Node]->node.value->array, &context->data[LoopCounter]->loopCounter); | |
| 69 } | |
| 70 | |
| 90 | 71 __code createData1(struct Context* context, struct Allocate* allocate, struct LoopCounter* loopCounter) { |
| 72 int i = loopCounter->i; | |
| 73 | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
74 if ((length/split*i) < length) { |
| 90 | 75 allocate->size = sizeof(struct Array); |
| 76 allocator(context); | |
| 77 | |
| 78 goto meta(context, CreateData2); | |
| 79 } | |
| 80 | |
| 92 | 81 loopCounter->i = 0; |
| 90 | 82 goto meta(context, Code1); |
| 83 } | |
| 111 | 84 |
| 90 | 85 __code createData1_stub(struct Context* context) { |
| 86 goto createData1(context, &context->data[Allocate]->allocate, &context->data[LoopCounter]->loopCounter); | |
| 87 } | |
| 88 | |
| 89 __code createData2(struct Context* context, struct LoopCounter* loopCounter, struct Array* array, struct Node* node) { | |
| 90 int i = loopCounter->i; | |
| 91 | |
| 92 array->index = i; | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
93 array->prefix = length/split; |
| 90 | 94 array->array = array_ptr; |
| 95 | |
| 96 node->key = i; | |
| 97 node->value = (union Data*)array; | |
| 111 | 98 |
| 90 | 99 context->next = CreateTask1; |
| 100 | |
| 101 goto meta(context, PutTree); | |
| 102 } | |
| 103 | |
| 104 __code createData2_stub(struct Context* context) { | |
| 105 goto createData2(context, | |
| 111 | 106 &context->data[LoopCounter]->loopCounter, |
| 107 &context->data[context->dataNum]->array, | |
| 108 &context->data[Node]->node); | |
| 90 | 109 } |
| 110 | |
| 111 __code createTask1(struct Context* context, struct Allocate* allocate) { | |
| 112 allocate->size = sizeof(struct Task); | |
| 113 allocator(context); | |
| 114 | |
| 115 goto meta(context, CreateTask2); | |
| 116 } | |
| 117 | |
| 118 __code createTask1_stub(struct Context* context) { | |
| 119 goto createTask1(context, &context->data[Allocate]->allocate); | |
| 120 } | |
| 121 | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
122 __code meta_createTask2(struct Context* context, struct Queue* activeQueue, enum Code next) { |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
123 context->data[Queue] = (union Data *)activeQueue; |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
124 goto (context->code[next])(context); |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
125 } |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
126 |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
127 __code createTask2(struct Context* context, struct LoopCounter* loopCounter, struct Task* task, struct Element* element, struct Queue* activeQueue) { |
| 90 | 128 int i = loopCounter->i; |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
129 |
| 92 | 130 task->code = Twice; |
| 90 | 131 task->key = i; |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
132 |
| 90 | 133 element->task = task; |
| 134 | |
| 135 context->next = CreateData1; | |
| 136 loopCounter->i++; | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
137 |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
138 goto meta_createTask2(context, activeQueue, PutQueue1); |
| 90 | 139 } |
| 140 | |
| 141 __code createTask2_stub(struct Context* context) { | |
| 142 goto createTask2(context, | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
143 &context->data[LoopCounter]->loopCounter, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
144 &context->data[context->dataNum]->task, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
145 &context->data[Element]->element, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
146 &context->data[ActiveQueue]->queue); |
| 90 | 147 } |
| 148 | |
| 111 | 149 |
| 150 //__code createTask2(struct Context* context, struct LoopCounter* loopCounter, struct Task* task, struct Element* element) { | |
| 151 // int i = loopCounter->i; | |
| 152 // | |
| 153 // task->code = TaskC; | |
| 154 // task->key = i; | |
| 155 // | |
| 156 // element->task = task; | |
| 157 // | |
| 158 // context->next = CreateData1; | |
| 159 // loopCounter->i++; | |
| 160 // | |
| 161 // goto meta(context, PutQueue1); | |
| 162 //} | |
| 163 // | |
| 164 //__code createTask2_stub(struct Context* context) { | |
| 165 // goto createTask2(context, | |
| 166 // &context->data[LoopCounter]->loopCounter, | |
| 167 // &context->data[context->dataNum]->task, | |
| 168 // &context->data[Element]->element); | |
| 169 //} | |
| 170 // | |
| 171 //__code createTask3(struct Context* context, struct LoopCounter* loopCounter, struct Task* task, struct Task* slave, struct Element* element) { | |
| 172 // int i = loopCounter->i; | |
| 173 // | |
| 174 // task->code = TaskB; | |
| 175 // task->key = i; | |
| 176 // element->task = task; | |
| 177 // | |
| 178 // context->next = CreateData1; | |
| 179 // loopCounter->i++; | |
| 180 // | |
| 181 // goto meta(context, WaitFor1); | |
| 182 //} | |
| 183 // | |
| 184 //__code createTask3_stub(struct Context* context) { | |
| 185 // goto createTask2(context, | |
| 186 // &context->data[context->dataNum]->task, | |
| 187 // &context->data[Element]->element); | |
| 188 //} | |
| 189 | |
| 90 | 190 __code putQueue1(struct Context* context, struct Allocate* allocate) { |
| 191 allocate->size = sizeof(struct Element); | |
| 192 allocator(context); | |
| 193 | |
| 194 goto meta(context, PutQueue2); | |
| 195 } | |
| 196 | |
| 197 __code putQueue1_stub(struct Context* context) { | |
| 198 goto putQueue1(context, &context->data[Allocate]->allocate); | |
| 199 } | |
| 200 | |
| 201 __code putQueue2(struct Context* context, struct Element* new_element, struct Element* element, struct Queue* queue) { | |
| 202 new_element->task = element->task; | |
| 203 | |
| 204 if (queue->first) | |
| 205 goto meta(context, PutQueue3); | |
| 206 else | |
| 207 goto meta(context, PutQueue4); | |
| 208 } | |
| 209 | |
| 210 __code putQueue2_stub(struct Context* context) { | |
| 211 goto putQueue2(context, | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
212 &context->data[context->dataNum]->element, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
213 &context->data[Element]->element, |
|
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
214 &context->data[Queue]->queue); |
| 90 | 215 } |
| 216 | |
| 217 __code putQueue3(struct Context* context, struct Queue* queue, struct Element* new_element) { | |
| 218 struct Element* last = queue->last; | |
| 219 | |
| 220 if (__sync_bool_compare_and_swap(&queue->last, last, new_element)) { | |
| 221 last->next = new_element; | |
| 222 queue->count++; | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
223 |
| 90 | 224 goto meta(context, context->next); |
| 225 } else { | |
| 226 goto meta(context, PutQueue3); | |
| 227 } | |
| 228 } | |
| 229 | |
| 230 __code putQueue3_stub(struct Context* context) { | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
231 goto putQueue3(context, &context->data[Queue]->queue, &context->data[context->dataNum]->element); |
| 90 | 232 } |
| 233 | |
| 234 __code putQueue4(struct Context* context, struct Queue* queue, struct Element* new_element) { | |
| 235 if (__sync_bool_compare_and_swap(&queue->first, 0, new_element)) { | |
| 236 queue->last = new_element; | |
| 237 queue->count++; | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
238 |
| 90 | 239 goto meta(context, context->next); |
| 240 } else { | |
| 241 goto meta(context, PutQueue3); | |
| 242 } | |
| 243 } | |
| 244 | |
| 245 __code putQueue4_stub(struct Context* context) { | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
246 goto putQueue4(context, &context->data[Queue]->queue, &context->data[context->dataNum]->element); |
| 90 | 247 } |
| 248 | |
| 86 | 249 __code createWorker(struct Context* context, struct LoopCounter* loopCounter, struct Worker* worker) { |
| 250 int i = loopCounter->i; | |
| 251 | |
| 252 if (i < worker->num) { | |
| 253 struct Context* worker_context = &worker->contexts[i]; | |
| 91 | 254 worker_context->next = GetQueue; |
| 255 worker_context->data[Tree] = context->data[Tree]; | |
| 256 worker_context->data[ActiveQueue] = context->data[ActiveQueue]; | |
| 86 | 257 pthread_create(&worker_context->thread, NULL, (void*)&start_code, worker_context); |
| 92 | 258 worker_context->thread_num = i; |
| 86 | 259 loopCounter->i++; |
| 260 | |
| 261 goto meta(context, CreateWorker); | |
| 262 } | |
| 263 | |
| 264 loopCounter->i = 0; | |
| 265 goto meta(context, TaskManager); | |
| 266 } | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
267 |
| 86 | 268 __code createWorker_stub(struct Context* context) { |
| 269 goto createWorker(context, &context->data[LoopCounter]->loopCounter, &context->data[Worker]->worker); | |
| 270 } | |
| 271 | |
| 272 __code taskManager(struct Context* context, struct LoopCounter* loopCounter, struct Worker* worker) { | |
| 273 int i = loopCounter->i; | |
| 274 | |
| 275 if (i < worker->num) { | |
| 276 pthread_join(worker->contexts[i].thread, NULL); | |
| 277 loopCounter->i++; | |
| 278 | |
| 279 goto meta(context, TaskManager); | |
| 280 } | |
| 281 | |
| 282 loopCounter->i = 0; | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
283 |
| 102 | 284 struct Time *t = &context->data[Time]->time; |
| 285 t->next = Code2; | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
286 goto meta(context, EndTime); |
| 86 | 287 } |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
288 |
| 86 | 289 __code taskManager_stub(struct Context* context) { |
| 290 goto taskManager(context, &context->data[LoopCounter]->loopCounter, &context->data[Worker]->worker); | |
| 291 } | |
| 292 | |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
293 void init(int argc, char** argv) { |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
294 for (int i = 1; argv[i]; ++i) { |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
295 if (strcmp(argv[i], "-cpu") == 0) |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
296 cpu_num = (int)atoi(argv[i+1]); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
297 else if (strcmp(argv[i], "-l") == 0) |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
298 length = (int)atoi(argv[i+1]); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
299 else if (strcmp(argv[i], "-s") == 0) |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
300 split = (int)atoi(argv[i+1]); |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
301 } |
|
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
302 } |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
303 |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
304 |
| 86 | 305 int main(int argc, char** argv) { |
|
95
3e28ee215c0e
modify twice, use OSAtomiceCompareAndSwap
Shohei KOKUBO <e105744@ie.u-ryukyu.ac.jp>
parents:
92
diff
changeset
|
306 init(argc, argv); |
| 90 | 307 |
| 101 | 308 array_ptr = NEWN(length, int); |
| 90 | 309 |
| 310 for(int i=0; i<length; i++) | |
| 311 array_ptr[i]=i; | |
| 86 | 312 |
| 101 | 313 struct Context* main_context = NEW(struct Context); |
| 86 | 314 initContext(main_context); |
| 90 | 315 main_context->next = CreateData1; |
| 86 | 316 |
| 101 | 317 struct Context* worker_contexts = NEWN(cpu_num, struct Context); |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
318 |
| 86 | 319 struct Worker* worker = &main_context->data[Worker]->worker; |
| 320 worker->num = cpu_num; | |
| 321 worker->contexts = worker_contexts; | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
322 |
| 86 | 323 for (int i = 0;i<cpu_num;i++) |
| 324 initContext(&worker_contexts[i]); | |
|
109
059b26a250cc
Change put_queue process
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
102
diff
changeset
|
325 |
| 86 | 326 goto start_code(main_context); |
| 327 } |