Mercurial > hg > Members > kono > Cerium

annotate example/many_task/sort-compat.cc @ 1015:80b18af207c2

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
debug mail timing.
author yutaka@localhost.localdomain
date Fri, 05 Nov 2010 22:25:33 +0900
parents a9c7784e5dae
children
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
945
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1 #include "TaskManager.h"
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2 #include "SchedTask.h"
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
3 #include "sort.h"
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
4 #include "Func.h"
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
5 #include <string.h>
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
6
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
7 extern void check_data();
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
8 extern int all; // allocate task at once
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
9
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
10 SchedDefineTask1(SortCompat, sort_start_compat );
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
11
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
12 static int sort_start_compat(SchedTask *manager, void *a, void *b)
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
13 {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
14 Sort *s = (Sort*)manager->get_param(0);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
15 int half_num = s->split_num-1;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
16 static int sort_count = s->split_num; // sort 完了に必要な回数
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
17
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
18 // 一つのタスクで sort する data 数
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
19 int block_num = (s->data_length + s->split_num -1)/s->split_num;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
20 int half_block_num = block_num/2;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
21
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
22 int last_block_num = s->data_length - (s->split_num-1)*block_num;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
23 int last_half_block_num = half_block_num+(last_block_num/2);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
24
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
25
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
26 if (--sort_count < 0) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
27 return 0;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
28 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
29
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
30 for (int i = 0; i < s->split_num-1; i++) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
31 s->fsort[i] = manager->create_task(QUICK_SORT);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
32 s->fsort[i]->add_inData(&s->data[i*block_num], sizeof(Data)*block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
33 s->fsort[i]->add_outData(&s->data[i*block_num], sizeof(Data)*block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
34 if (i>0 && s->bsort[i-1]) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
35 s->fsort[i]->wait_for(s->bsort[i-1]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
36 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
37 if (i<s->split_num-2 && s->bsort[i]) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
38 s->fsort[i]->wait_for(s->bsort[i]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
39 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
40 s->fsort[i]->set_cpu(SPE_ANY);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
41 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
42
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
43 // 最後の block は端数なので last_block_num を使う
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
44 {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
45 int i = s->split_num-1;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
46
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
47 s->fsort[i] = manager->create_task(QUICK_SORT);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
48 s->fsort[i]->add_inData(&s->data[i*block_num], sizeof(Data)*last_block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
49 s->fsort[i]->add_outData(&s->data[i*block_num], sizeof(Data)*last_block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
50 if (i>0 && s->bsort[i-1]) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
51 s->fsort[i]->wait_for(s->bsort[i-1]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
52 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
53 s->fsort[i]->set_cpu(SPE_ANY);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
54 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
55
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
56 if (s->split_num > 1) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
57
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
58 for (int i = 0; i < half_num-1; i++) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
59 if (s->bsort[i]) manager->free_htask(s->bsort[i]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
60 s->bsort[i] = manager->create_task(QUICK_SORT);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
61 s->bsort[i]->add_inData(&s->data[i*block_num+half_block_num],
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
62 sizeof(Data)*block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
63 s->bsort[i]->add_outData(&s->data[i*block_num+half_block_num],
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
64 sizeof(Data)*block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
65 s->bsort[i]->set_cpu(SPE_ANY);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
66 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
67
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
68 {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
69 int i = half_num-1;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
70
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
71 if (s->bsort[i]) manager->free_htask(s->bsort[i]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
72 s->bsort[i] = manager->create_task(QUICK_SORT);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
73 s->bsort[i]->add_inData(&s->data[i*block_num+half_block_num],
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
74 sizeof(Data)*last_half_block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
75 s->bsort[i]->add_outData(&s->data[i*block_num+half_block_num],
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
76 sizeof(Data)*last_half_block_num);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
77 s->bsort[i]->set_cpu(SPE_ANY);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
78 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
79
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
80 for (int i = 0; i < half_num; i++) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
81 s->bsort[i]->wait_for(s->fsort[i]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
82 s->bsort[i]->wait_for(s->fsort[i+1]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
83 s->bsort[i]->no_auto_free();
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
84 s->bsort[i]->spawn();
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
85 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
86 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
87
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
88 HTaskPtr restart = manager->create_task(SortCompat,0,0,0,0);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
89 restart->set_param(0,(memaddr)s);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
90 if (!all) restart->wait_for(s->fsort[0]);
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
91 for (int i = 0; i < s->split_num; i++) {
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
92 s->fsort[i]->spawn();
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
93 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
94 restart->spawn();
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
95
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
96 return 0;
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
97 }
a9c7784e5dae sort example fix ( simple task accepts one param and more compatible with old task)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
diff changeset
98