Mercurial > hg > Members > kono > Cerium
view example/word_count/main.cc @ 946:a8b6ee80c108
unify word count examples....
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Sun, 01 Aug 2010 21:05:35 +0900 |
parents | 45c141669de7 |
children | 6a8941ee8294 |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <sys/mman.h> #include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> #include <unistd.h> #include "TaskManager.h" #include "SchedTask.h" #include "Func.h" #include "WordCount.h" extern void task_init(); int all = 0; int use_task_array = 1; int use_compat = 0; const char *usr_help_str = "Usage: ./word_count [-a -c -s] [-cpu spe_num] [-file filename]\n"; typedef struct { caddr_t file_mmap; off_t size; } st_mmap_t; /*与えられたsizeをfix_byte_sizeの倍数にする(丸め込むっていうのかな?)*/ static int fix_byte(int size,int fix_byte_size) { size = (size/fix_byte_size)*fix_byte_size + ((size%fix_byte_size)!= 0)*fix_byte_size; return size; } static st_mmap_t my_mmap(char *filename) { /*マッピングだよ!*/ int fd = -1; int map = MAP_PRIVATE; st_mmap_t st_mmap; struct stat sb; if ((fd=open(filename,O_RDONLY,0666))==0) { fprintf(stderr,"can't open %s\n",filename); } if (fstat(fd,&sb)) { fprintf(stderr,"can't fstat %s\n",filename); } printf("file size %d\n",(int)sb.st_size); /*sizeをページングサイズの倍数にあわせる*/ st_mmap.size = fix_byte(sb.st_size,4096); printf("fix 4096byte file size %d\n",(int)st_mmap.size); st_mmap.file_mmap = (char*)mmap(NULL,st_mmap.size,PROT_READ,map,fd,(off_t)0); if (st_mmap.file_mmap == (caddr_t)-1) { fprintf(stderr,"Can't mmap file\n"); perror(NULL); exit(0); } return st_mmap; } static void run_tasks(SchedTask *manager, WordCount *w, int task_count, HTaskPtr t_next, int size) { int array_task_num = 8; if (task_count < array_task_num) { array_task_num = task_count; } for (int i = 0; i < task_count; i += array_task_num) { HTask *task_array; if (use_task_array) { task_array = manager->create_task_array(TASK_EXEC,array_task_num,0,1,1); if (!all) t_next->wait_for(task_array); } Task *t_exec = 0; HTask *h_exec; for (int j = 0; j < array_task_num; j++) { int i = w->task_spwaned++; if (use_task_array) { t_exec = task_array->next_task_array(TASK_EXEC,t_exec); t_exec->set_inData(0,w->file_mmap + i*w->division_size, size); t_exec->set_outData(0,w->o_data + i*w->out_size, w->division_out_size); } else if (use_compat) { h_exec = manager->create_task(TASK_EXEC); h_exec->set_inData(0,w->file_mmap + i*w->division_size, size); h_exec->set_outData(0,w->o_data + i*w->out_size, w->division_out_size); h_exec->set_cpu(SPE_ANY); h_exec->spawn(); } else { h_exec = manager->create_task(TASK_EXEC, (memaddr)(w->file_mmap + i*w->division_size), size, (memaddr)(w->o_data + i*w->out_size), w->division_out_size); h_exec->set_cpu(SPE_ANY); h_exec->spawn(); } w->size -= size; w->task_num--; } if (!use_task_array) { task_array->spawn_task_array(t_exec->next()); task_array->set_cpu(SPE_ANY); task_array->spawn(); } else { if (!all) t_next->wait_for(h_exec); } } } /** * このTaskは、PPE上で実行されるので、並列に実行されることはない * 二つ実行されていて、Task が足りなくなることがないようにしている。 */ SchedDefineTask1(RUN_TASK_BLOCKS,run16); static int run16(SchedTask *manager, void *in, void *out) { WordCount *w = *(WordCount **)in; if (w->task_num < w->task_blocks) { if (w->size >= w->division_size) run_tasks(manager,w,w->task_num, w->t_print, w->division_size); while (w->size>0) run_tasks(manager,w,1, w->t_print, w->size); // printf("run16 last %d\n",w->task_num); } else { HTaskPtr t_next = manager->create_task(RUN_TASK_BLOCKS, (memaddr)&w->self,sizeof(memaddr),0,0); w->t_print->wait_for(t_next); run_tasks(manager,w, w->task_blocks, t_next, w->division_size); t_next->spawn(); // printf("run16 next %d\n",w->task_num); } return 0; } static int blocks = 48; static int division = 16; // in Kbyte static void run_start(TaskManager *manager, char *filename) { HTaskPtr t_print; st_mmap_t st_mmap; st_mmap = my_mmap(filename); WordCount *w = (WordCount*)manager->allocate(sizeof(WordCount)); // bzero(w,sizeof(WordCount)); w->self = w; w->task_blocks = blocks; w->task_spwaned = 0; /*sizeはdivision_sizeの倍数にしている。*/ w->size = st_mmap.size; w->file_mmap = st_mmap.file_mmap; /* 1task分のデータサイズ(byte) */ if (w->size >= 1024*division) { w->division_size = 1024 * division;/*16kbyte*/ } else { w->division_size = w->size; } printf("dvision_size %d\n",w->division_size); /* "word num" and "line num" */ w->status_num = 2; /* taskの数 */ w->task_num = w->size / w->division_size; w->task_num = w->task_num + (w->division_size*w->task_num < w->size); int out_task_num = w->task_num; w->out_task_num = out_task_num; printf("task_num %d\n",w->task_num); printf("out_task_num %d\n",w->out_task_num); /* out用のdivision_size. statusが2つなので、あわせて16byteになるように、long long(8byte)を使用 */ w->division_out_size = sizeof(unsigned long long)*4; int out_size = w->division_out_size*out_task_num; w->o_data = (unsigned long long *)manager->allocate(out_size); w->out_size = 4; printf("out size %d\n",out_size); /*各SPEの結果を合計して出力するタスク*/ t_print = manager->create_task(TASK_PRINT, (memaddr)&w->self,sizeof(memaddr),0,0); w->t_print = t_print; for(int i = 0;i<2;i++) { /* Task を task_blocks ずつ起動する Task */ /* serialize されていると仮定する... */ HTaskPtr t_exec = manager->create_task(RUN_TASK_BLOCKS, (memaddr)&w->self,sizeof(memaddr),0,0); t_print->wait_for(t_exec); t_exec->spawn(); } t_print->spawn(); } static char* init(int argc, char **argv) { char *filename = 0; for (int i = 1; argv[i]; ++i) { if (strcmp(argv[i], "-file") == 0) { filename = argv[i+1]; } else if (strcmp(argv[i], "-division") == 0) { division = atoi(argv[i+1]); } else if (strcmp(argv[i], "-block") == 0) { blocks = atoi(argv[i+1]); } else if (strcmp(argv[i], "-a") == 0) { // create task all at once all = 1; } else if (strcmp(argv[i], "-c") == 0) { use_task_array = 0; use_compat = 1; } else if (strcmp(argv[i], "-s") == 0) { use_task_array = 0; use_compat = 0; } } if (filename==0) { puts(usr_help_str); exit(1); } return filename; } int TMmain(TaskManager *manager, int argc, char *argv[]) { char *filename = 0; filename = init(argc, argv); if (filename < 0) { return -1; } task_init(); run_start(manager, filename); return 0; } /* end */