Mercurial > hg > Members > kono > Cerium
annotate TaskManager/kernel/schedule/Scheduler.cc @ 1015:80b18af207c2
debug mail timing.
author | yutaka@localhost.localdomain |
---|---|
date | Fri, 05 Nov 2010 22:25:33 +0900 |
parents | c67379f9d411 |
children | 19a57960c436 |
rev | line source |
---|---|
48 | 1 #include <stdio.h> |
50 | 2 #include <stdlib.h> |
736 | 3 #include <stdarg.h> |
42 | 4 #include "Scheduler.h" |
736 | 5 #include "SchedTask.h" |
42 | 6 #include "SchedNop.h" |
923
e015a4e5e4b0
fix DMA/Mail wait profiler
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
893
diff
changeset
|
7 #include "SysFunc.h" |
42 | 8 #include "error.h" |
386 | 9 #include <assert.h> |
621 | 10 #include "TaskManagerImpl.h" |
42 | 11 |
313
c9f8cfcdc5c2
fix ppu mail box waiting (mainMem allocate)
kono@localhost.localdomain
parents:
301
diff
changeset
|
12 /* |
c9f8cfcdc5c2
fix ppu mail box waiting (mainMem allocate)
kono@localhost.localdomain
parents:
301
diff
changeset
|
13 * Edit kernel/schedule/xx.cc, Cell/spe/xx.cc will be over writen by this. |
c9f8cfcdc5c2
fix ppu mail box waiting (mainMem allocate)
kono@localhost.localdomain
parents:
301
diff
changeset
|
14 * Do not edit Cell/spe/xx.cc unless there is no kernel/schedule/xx.cc files. |
c9f8cfcdc5c2
fix ppu mail box waiting (mainMem allocate)
kono@localhost.localdomain
parents:
301
diff
changeset
|
15 */ |
c9f8cfcdc5c2
fix ppu mail box waiting (mainMem allocate)
kono@localhost.localdomain
parents:
301
diff
changeset
|
16 |
698
dcaa40ec963d
no compile error for Task Array
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
685
diff
changeset
|
17 TaskObject task_list[MAX_TASK_OBJECT]; |
109 | 18 |
501
4a2c9ff53605
Cell inData/outData DMA removal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
483
diff
changeset
|
19 Scheduler::~Scheduler() |
109 | 20 { |
21 delete connector; | |
22 } | |
23 | |
664 | 24 static int |
25 null_run(SchedTask* smanager, void* r, void *w) | |
26 { | |
923
e015a4e5e4b0
fix DMA/Mail wait profiler
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
893
diff
changeset
|
27 smanager->printf("Calling Undefined Task %d\n", smanager->task->command==TaskArray1? smanager->atask->command: smanager->task->command); |
664 | 28 return 0; |
29 } | |
30 | |
684
458a1ad91427
Task Array generation worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
664
diff
changeset
|
31 static void null_loader(Scheduler *m, int task_id); |
458a1ad91427
Task Array generation worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
664
diff
changeset
|
32 |
301
bcb81858aa62
remove deprecated source. not work.
tkaito@localhost.localdomain
parents:
298
diff
changeset
|
33 /*! @brief speTaskの入出力のパイプラインバッファを確保する |
bcb81858aa62
remove deprecated source. not work.
tkaito@localhost.localdomain
parents:
298
diff
changeset
|
34 */ |
bcb81858aa62
remove deprecated source. not work.
tkaito@localhost.localdomain
parents:
298
diff
changeset
|
35 |
42 | 36 void |
635
8cc609285bbe
SimpleTask worked on Mac OS X
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
634
diff
changeset
|
37 Scheduler::init(TaskManagerImpl *m) |
42 | 38 { |
388
82cb9368e3ff
MemHash (OS X version)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
387
diff
changeset
|
39 hash = 0; |
664 | 40 |
41 for (int i = 0; i< MAX_TASK_OBJECT; i++) { | |
684
458a1ad91427
Task Array generation worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
664
diff
changeset
|
42 task_list[i].run = null_run; |
458a1ad91427
Task Array generation worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
664
diff
changeset
|
43 task_list[i].load = null_loader; |
458a1ad91427
Task Array generation worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
664
diff
changeset
|
44 task_list[i].wait = null_loader; |
664 | 45 } |
46 | |
635
8cc609285bbe
SimpleTask worked on Mac OS X
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
634
diff
changeset
|
47 set_manager(m); |
42 | 48 init_impl(); |
109 | 49 |
50 for (int i = 0; i < 2; i++) { | |
800
2708c4a7bade
run16 word count ( not yet worked. )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
792
diff
changeset
|
51 buff_taskList[i] = (TaskListPtr)m->allocate(sizeof(TaskList)); |
109 | 52 } |
373 | 53 |
109 | 54 buffFlag_taskList = 0; |
55 | |
298 | 56 // bzero でもいいけど |
109 | 57 for (int i = 0; i < MAX_GLOBAL_AREA; i++) { |
373 | 58 globalList[i] = NULL; |
109 | 59 } |
60 | |
61 for (int i = 0; i < MAX_MAINMEM_AREA; i++) { | |
629
8843edf37c0e
Cell 64 bit tried, but not yet worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
625
diff
changeset
|
62 mainMemList[i] = (memaddr)NULL; |
109 | 63 } |
373 | 64 |
109 | 65 |
42 | 66 } |
67 | |
68 void | |
685 | 69 Scheduler::run(SchedTaskBase* task1) |
42 | 70 { |
685 | 71 |
72 // Pipeline Stage | |
73 SchedTaskBase* task2 = new SchedNop(); | |
74 SchedTaskBase* task3 = new SchedNop(); | |
42 | 75 // main loop |
76 do { | |
970
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
77 |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
78 task1->read(); |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
79 task2->exec(); |
1015 | 80 task3->write(); |
970
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
81 |
468
bd5b93d39597
test_nogl on Mac OS X worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
464
diff
changeset
|
82 delete task3; |
42 | 83 |
373 | 84 task3 = task2; |
85 task2 = task1; | |
1015 | 86 //SchedMailの場合、Mailの待ちが入る |
893
96536163c0a0
fix SimpleTask alignment
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
874
diff
changeset
|
87 task1 = task1->next(this, 0); |
970
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
88 |
42 | 89 } while (task1); |
90 | |
91 delete task3; | |
92 delete task2; | |
50 | 93 } |
48 | 94 |
50 | 95 |
96 void | |
501
4a2c9ff53605
Cell inData/outData DMA removal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
483
diff
changeset
|
97 Scheduler::finish() |
50 | 98 { |
109 | 99 free(buff_taskList[0]); |
100 free(buff_taskList[1]); | |
42 | 101 } |
102 | |
109 | 103 /** |
298 | 104 * あらかじめ memory allocte してある TaskList の領域を |
105 * パイプラインの各処理が交代して使う。 | |
109 | 106 */ |
42 | 107 TaskListPtr |
501
4a2c9ff53605
Cell inData/outData DMA removal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
483
diff
changeset
|
108 Scheduler::get_curListBuf() |
42 | 109 { |
109 | 110 buffFlag_taskList ^= 1; |
111 | |
112 return buff_taskList[buffFlag_taskList]; | |
113 } | |
114 | |
115 void | |
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
621
diff
changeset
|
116 Scheduler::dma_load(void *buf, memaddr addr, uint32 size, uint32 mask) |
109 | 117 { |
118 connector->dma_load(buf, addr, size, mask); | |
119 } | |
120 | |
121 void | |
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
621
diff
changeset
|
122 Scheduler::dma_store(void *buf, memaddr addr, uint32 size, uint32 mask) |
109 | 123 { |
124 connector->dma_store(buf, addr, size, mask); | |
125 } | |
126 | |
127 void | |
128 Scheduler::dma_wait(uint32 mask) | |
129 { | |
970
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
130 //printf("%d\n",mask); |
109 | 131 connector->dma_wait(mask); |
132 } | |
133 | |
134 void | |
970
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
135 Scheduler::dma_wait(uint32 mask, int cmd) |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
136 { |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
137 connector->dma_wait(mask,cmd); |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
138 } |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
139 |
33630c6ff445
change pipeline and TaskArray fast
Yutaka Kinjyo <yutaka@cr.ie.u-ryukyu.ac.jp>
parents:
923
diff
changeset
|
140 void |
109 | 141 Scheduler::dma_loadList(ListDataPtr list, void *buff, uint32 mask) |
142 { | |
143 connector->dma_loadList(list, buff, mask); | |
42 | 144 } |
145 | |
146 | |
109 | 147 void |
148 Scheduler::dma_storeList(ListDataPtr list, void *buff, uint32 mask) | |
149 { | |
150 return connector->dma_storeList(list, buff, mask); | |
151 } | |
152 | |
153 void | |
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
621
diff
changeset
|
154 Scheduler::mail_write(memaddr data) |
109 | 155 { |
156 connector->mail_write(data); | |
157 } | |
158 | |
1007 | 159 void |
160 Scheduler::mail_write_queue(memaddr data) | |
161 { | |
162 connector->mail_write_queue(data); | |
163 } | |
164 | |
165 void | |
166 Scheduler::mail_write_finish_list(memaddr data) | |
167 { | |
1009 | 168 connector->mail_write_finish_list(data); |
1007 | 169 } |
170 | |
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
621
diff
changeset
|
171 memaddr |
501
4a2c9ff53605
Cell inData/outData DMA removal
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
483
diff
changeset
|
172 Scheduler::mail_read() |
109 | 173 { |
174 return connector->mail_read(); | |
175 } | |
176 | |
177 | |
871
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
178 |
386 | 179 /* |
180 ここから下は、memory 以下にあるべき | |
181 */ | |
182 | |
109 | 183 void* |
184 Scheduler::global_alloc(int id, int size) | |
185 { | |
792 | 186 |
800
2708c4a7bade
run16 word count ( not yet worked. )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
792
diff
changeset
|
187 globalList[id] = manager->allocate(size); |
792 | 188 |
109 | 189 return globalList[id]; |
190 } | |
191 | |
192 void* | |
193 Scheduler::global_get(int id) | |
194 { | |
195 return globalList[id]; | |
196 } | |
197 | |
198 void | |
373 | 199 Scheduler::global_set(int id, void *addr) |
200 { | |
201 globalList[id] = addr; | |
202 } | |
203 | |
204 void | |
109 | 205 Scheduler::global_free(int id) |
206 { | |
207 free(globalList[id]); | |
208 globalList[id] = NULL; | |
209 } | |
210 | |
211 /** | |
298 | 212 * mainMem_alloc で確保したメインメモリの領域アドレスを返す。 |
213 * これは Fifo, Cell で共通 | |
109 | 214 */ |
629
8843edf37c0e
Cell 64 bit tried, but not yet worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
625
diff
changeset
|
215 memaddr |
109 | 216 Scheduler::mainMem_get(int id) |
217 { | |
218 return mainMemList[id]; | |
42 | 219 } |
220 | |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
221 /** |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
222 * Task load API |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
223 */ |
425 | 224 void |
872 | 225 Scheduler::allocate_code_segment(int size, int count, struct tbl *table) |
425 | 226 { |
437 | 227 // 既に overlay 領域があるので、それを追加する必要がある... |
442 | 228 code_segment_pool = createMemList(size, count); |
872 | 229 if (table) { |
230 MemorySegment* here = (MemorySegment*)( | |
231 manager->allocate(sizeof(MemorySegment))); | |
232 here->data = (void*)(table->vma); | |
233 here->size = size; | |
234 here->address = (memaddr)here; | |
235 code_segment_pool->addLast(here); | |
236 } | |
425 | 237 } |
42 | 238 |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
239 static void |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
240 load_task(Scheduler *m, int task_id) |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
241 { |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
242 MemorySegment *s = m->get_segment( |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
243 task_list[task_id].location, |
437 | 244 m->code_segment_pool, |
245 task_list[task_id].end-task_list[task_id].location); | |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
246 task_list[task_id].segment = s; |
871
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
247 // calcurate call address |
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
248 TaskObjectRun run = |
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
249 (TaskObjectRun)( |
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
250 (char*)task_list[task_id].segment->data + |
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
251 task_list[task_id].entry_offset); |
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
252 task_list[task_id].run = run; |
874 | 253 #if 0 |
873
3b9536925fb8
fix hash problem ( unsigned int-> long overflow )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
872
diff
changeset
|
254 m->printf("loadng task id %d at 0x%x entry 0x%x location 0x%x\n",task_id, |
461 | 255 (unsigned int)(task_list[task_id].segment->data ), |
256 (unsigned int)( | |
257 (char*)task_list[task_id].segment->data + | |
873
3b9536925fb8
fix hash problem ( unsigned int-> long overflow )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
872
diff
changeset
|
258 task_list[task_id].entry_offset), |
3b9536925fb8
fix hash problem ( unsigned int-> long overflow )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
872
diff
changeset
|
259 task_list[task_id].location); |
506 | 260 #endif |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
261 } |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
262 |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
263 static void |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
264 null_loader(Scheduler *m, int task_id) |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
265 { |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
266 } |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
267 |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
268 static void |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
269 wait_load(Scheduler *m, int task_id) |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
270 { |
523 | 271 #if 0 |
442 | 272 MemorySegment *s = task_list[task_id].segment; |
273 if (s) | |
736 | 274 m->printf("wait load task id %d 0x%x\n",task_id,(int)s->data); |
442 | 275 else |
736 | 276 m->printf("wait load task id %d 000000\n",task_id); |
506 | 277 #endif |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
278 // wait for code segment load |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
279 m->wait_segment(task_list[task_id].segment); |
506 | 280 #if 0 |
736 | 281 m->printf("wait load task id %d done. creator = 0x%x entry_offset = 0x%x\n",task_id, |
871
ab3cd3aeacff
fix get segment dma tag zero problem
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
805
diff
changeset
|
282 (unsigned int)(task_list[task_id].run), |
439 | 283 task_list[task_id].entry_offset); |
506 | 284 #endif |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
285 } |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
286 |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
287 static void |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
288 null_waiter(Scheduler *m, int task_id) |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
289 { |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
290 } |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
291 |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
292 extern void |
464
01b321c86747
task run is mere C function now.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
461
diff
changeset
|
293 register_task(int cmd, TaskObjectRun run) |
42 | 294 { |
464
01b321c86747
task run is mere C function now.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
461
diff
changeset
|
295 task_list[cmd].run = run; |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
296 task_list[cmd].load = null_loader; |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
297 task_list[cmd].wait = null_waiter; |
42 | 298 } |
373 | 299 |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
300 extern void |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
301 register_dynamic_task(int cmd, |
441 | 302 memaddr start, int size, |
464
01b321c86747
task run is mere C function now.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
461
diff
changeset
|
303 TaskObjectRun run, int entry_offset) |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
304 { |
464
01b321c86747
task run is mere C function now.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
461
diff
changeset
|
305 task_list[cmd].run = run; |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
306 task_list[cmd].location = start; |
442 | 307 size &= 0xfffffffe; |
441 | 308 task_list[cmd].end = start+size; |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
309 task_list[cmd].entry_offset = entry_offset; |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
310 task_list[cmd].load = load_task; |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
311 task_list[cmd].wait = wait_load; |
506 | 312 #if 0 |
736 | 313 this->printf("cmd = %d\n",cmd); |
314 this->printf("locatation = 0x%x\n",start); | |
315 this->printf("end = 0x%x\n",start+size); | |
316 this->printf("size = 0x%x\n",size); | |
317 this->printf("entry = 0x%x\n",entry_offset); | |
506 | 318 #endif |
439 | 319 |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
320 } |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
321 |
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
322 |
373 | 323 /*! |
386 | 324 |
325 size 単位のMemory Segment を count 個作る | |
326 | |
373 | 327 @param [size] リストの要素1つのサイズ |
328 @param [count] 要素数 | |
329 @return allocate した領域のポインタ | |
330 | |
331 */ | |
332 MemList* | |
333 Scheduler::createMemList(int size, int count) | |
334 { | |
335 uint32 head_size = round_up16(sizeof(MemorySegment)); | |
336 uint32 seg_size = round_up16(head_size+size); | |
800
2708c4a7bade
run16 word count ( not yet worked. )
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
792
diff
changeset
|
337 char* mseg = (char*)manager->allocate(seg_size*count); |
373 | 338 MemList* mlist = new MemList((MemorySegment*)mseg); |
339 | |
388
82cb9368e3ff
MemHash (OS X version)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
387
diff
changeset
|
340 if (!hash) { |
82cb9368e3ff
MemHash (OS X version)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
387
diff
changeset
|
341 hash = new MemHash(); |
82cb9368e3ff
MemHash (OS X version)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
387
diff
changeset
|
342 } |
82cb9368e3ff
MemHash (OS X version)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
387
diff
changeset
|
343 |
373 | 344 for(int i = 0; i < count; i++) { |
345 MemorySegment* next = (MemorySegment*)(mseg+seg_size*i); | |
346 char* data = (char*)next+head_size; | |
347 next->data = (void*)data; | |
386 | 348 next->size = size; |
395 | 349 next->address = (memaddr)next; |
373 | 350 mlist->addLast(next); |
351 } | |
352 | |
353 return mlist; | |
354 } | |
386 | 355 |
356 /*! | |
357 | |
358 Main Memory のSegmentを取得する | |
359 | |
360 @param [addr] Main Memory のアドレス | |
361 @param [m] Mem List | |
362 @return allocate した領域のポインタ | |
363 memory directory にあるべきだが... | |
364 | |
365 */ | |
387
5e2d30bfbf23
no compile error but not worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
386
diff
changeset
|
366 MemorySegment * |
386 | 367 Scheduler::get_segment(memaddr addr, MemList *m) |
368 { | |
449
4f11245e3504
get_segment fixed. and test_nogl rollback to 426. move!
kazz@henri.cr.ie.u-ryukyu.ac.jp
parents:
442
diff
changeset
|
369 MemorySegment *s = m->getFirst(); |
4f11245e3504
get_segment fixed. and test_nogl rollback to 426. move!
kazz@henri.cr.ie.u-ryukyu.ac.jp
parents:
442
diff
changeset
|
370 return get_segment(addr, m, s->size); |
437 | 371 } |
372 | |
373 MemorySegment * | |
374 Scheduler::get_segment(memaddr addr, MemList *m, int size) | |
375 { | |
376 // memory segment のsizeをoverride する場合がある | |
386 | 377 MemorySegment *s = hash->get(addr); |
378 if (s) { | |
379 /* 既に load されている */ | |
736 | 380 // this->printf("get_segement loaded %llx 0x%x size 0x%d\n",addr,s->data,size); |
391 | 381 m->moveToFirst(s); |
386 | 382 return s; |
383 } | |
384 | |
385 /* LRU なので、もっとも使われてない segment を上書きする */ | |
386 s = m->getLast(); | |
387 m->moveToFirst(s); | |
388 | |
389 memaddr old_addr = s->address; | |
387
5e2d30bfbf23
no compile error but not worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
386
diff
changeset
|
390 s->tag = get_tag(); |
5e2d30bfbf23
no compile error but not worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
386
diff
changeset
|
391 dma_load(s->data, addr, |
437 | 392 size, s->tag); |
386 | 393 /* 前のをhashから削除 */ |
394 hash->remove(old_addr); | |
395 /* 新しいaddress を登録 */ | |
396 s->address = addr; | |
397 hash->put(s->address, s); | |
398 | |
736 | 399 // this->printf("get_segement %llx 0x%x size 0x%d\n",addr, s->data,size); |
439 | 400 |
386 | 401 return s; |
402 } | |
403 | |
421
cd77224d4224
Code load implementation... (not yet tested)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
403
diff
changeset
|
404 |
386 | 405 uint32 |
406 Scheduler::get_tag() | |
407 { | |
458 | 408 static int tag = 16; |
409 tag ++; | |
410 tag &= 0x0f; | |
411 return tag+16; | |
386 | 412 } |
413 | |
414 /*! | |
415 | |
416 Main Memory のSegmentを書き出す | |
417 Segment は get_segement されていて、 | |
418 追い出されていてはいけない。 | |
419 それを保証するのは難しい? | |
420 | |
421 @param [addr] Main Memory のアドレス | |
422 @param [m] Mem List | |
423 @return allocate した領域のポインタ | |
424 | |
425 */ | |
426 void | |
427 Scheduler::put_segment(MemorySegment *s) | |
428 { | |
387
5e2d30bfbf23
no compile error but not worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
386
diff
changeset
|
429 dma_store(s->data, s->address, |
386 | 430 s->size, s->tag); |
431 } | |
432 | |
433 /*! | |
434 | |
435 Main Memory のSegmentを読込、書き出しを待つ | |
436 | |
437 @param [id] MemorySegment のid | |
438 | |
439 */ | |
440 void | |
387
5e2d30bfbf23
no compile error but not worked.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
386
diff
changeset
|
441 Scheduler::wait_segment(MemorySegment *s) |
386 | 442 { |
391 | 443 // えーと、dma してない時には、skip しないとだめなんじゃないの? |
444 | |
445 if (s->tag) dma_wait(s->tag); | |
446 s->tag = 0; | |
386 | 447 } |
448 | |
621 | 449 long Scheduler::get_random() { |
450 #if defined(__SPU__) | |
451 return 0; | |
452 #else | |
453 return random(); | |
454 #endif | |
455 | |
456 } | |
457 | |
736 | 458 int |
459 Scheduler::printf(const char * format, ...) | |
460 { | |
786
ccf78a465459
fix early free of TaskArray, add SchedTaskArrayNop stage.
yutaka@localhost.localdomain
parents:
742
diff
changeset
|
461 #if !defined(__SPU__) || 1 |
736 | 462 va_list ap; |
463 va_start(ap,format); | |
742 | 464 int ret= vprintf0(format, ap); |
736 | 465 va_end(ap); |
466 return ret; | |
467 #else | |
468 return 0; | |
469 #endif | |
470 } | |
471 | |
472 | |
473 int | |
742 | 474 Scheduler::vprintf0(const char * format, va_list ap) |
736 | 475 { |
786
ccf78a465459
fix early free of TaskArray, add SchedTaskArrayNop stage.
yutaka@localhost.localdomain
parents:
742
diff
changeset
|
476 #if !defined(__SPU__) || 1 |
736 | 477 int ret= vprintf(format, ap); |
478 return ret; | |
479 #else | |
480 return 0; | |
481 #endif | |
482 } | |
483 | |
484 | |
386 | 485 /* end */ |