Mercurial > hg > Members > yutaka > manager

comparison ppe/Menu.cc @ 3:8b4d6bf8c43d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
add entry_head function
author yutaka@localhost.localdomain
date Wed, 07 Apr 2010 17:35:34 +0900
parents 1e1b0d280427
children 39d405bc46b7
comparison
equal deleted inserted replaced
2:1e1b0d280427 3:8b4d6bf8c43d
8 8
9 task_head_t* 9 task_head_t*
10 menu(int &list_num) { 10 menu(int &list_num) {
11 11
12 list_num = SPE_NUM; 12 list_num = SPE_NUM;
13 int all_task_num = SPE_NUM*1000; 13 int all_task_num = SPE_NUM*10;
14 //int all_task_num = 1;
15 //int task_size = MAX_DMA_SIZE;
16 int task_size = 16*1024; 14 int task_size = 16*1024;
17 //int in_size = (task_size - sizeof(task_head_t)) * all_task_num;
18 //int out_size = (task_size - sizeof(task_head_t)) * all_task_num;
19 15
20 int in_size = (task_size - sizeof(task_head_t)); 16 int in_size = (task_size - sizeof(task_head_t));
21 int out_size = (task_size - sizeof(task_head_t)); 17 int out_size = (task_size - sizeof(task_head_t));
22 18
23 task_head_t *list_head = (task_head_t*)allocate(sizeof(task_head_t)*list_num); 19 task_head_t *list_head = (task_head_t*)allocate(sizeof(task_head_t)*list_num);
24 20
25 int list_length = all_task_num / list_num; 21 int list_length = all_task_num / list_num;
26 22
27 for (int i = 0; i < list_num; i++) { 23 for (int i = 0; i < list_num; i++) {
28 24
29 list_head[i].ea_out = 0; 25 task_t *tail = entry_head(&list_head[i]);
30 list_head[i].size_out = 0;
31 list_head[i].pin_in = 0;
32 list_head[i].pin_out = 0;
33
34 task_t *tail = (task_t*)allocate(sizeof(task_t));
35 tail->head = &list_head[i];
36 tail->input = NULL;
37 26
38 for (int j = 0; j < list_length; j++) { 27 for (int j = 0; j < list_length; j++) {
39 28
40 task_t *task = task_allocate(in_size, out_size); 29 task_t *task = task_allocate(in_size, out_size);
41 int *in = (int*)task->input; 30 int *in = (int*)task->input;