comparison regexParser/cerium/ppe/Print.cc @ 303:cc770cd8d000

parallel retrying seach worked
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Mon, 08 Feb 2016 11:56:13 +0900
parents 27414e6fb33c
children
comparison
equal deleted inserted replaced
302:27414e6fb33c 303:cc770cd8d000
37 r = r->next; 37 r = r->next;
38 if (r == NULL) { 38 if (r == NULL) {
39 prev = NULL; 39 prev = NULL;
40 continue; 40 continue;
41 } 41 }
42 StatePtr blockBegin = (StatePtr)w->o_data[i*out_size+1]; 42 // StatePtr blockBegin = (StatePtr)w->o_data[i*out_size+1];
43 if (prev) { 43 if (prev) {
44 if (i >= out_task_num) break; 44 if (i >= out_task_num) break;
45 // 最後のブロックでなく、前の prevBlockEnd が state 1 でない場合) 45 // 最後のブロックでなく、前の prevBlockEnd が state 1 でない場合)
46 StatePtr prevBlockEnd = (StatePtr)w->o_data[i*out_size-1]; 46 StatePtr prevBlockEnd = (StatePtr)w->o_data[i*out_size-1];
47 #if 0 47 #if 0
66 tsv.blk->resultEnd = &result; 66 tsv.blk->resultEnd = &result;
67 tsv.matchBegin = prev->begin; 67 tsv.matchBegin = prev->begin;
68 tsv.matchEnd = prev->end; 68 tsv.matchEnd = prev->end;
69 tsv = tSearch(tsv); 69 tsv = tSearch(tsv);
70 if (result) { 70 if (result) {
71 resultPrint(prev->next,"Print"); 71 resultPrint(result,"Print");
72 } 72 }
73 } 73 }
74 // printf("%p\n",r); 74 // printf("%p\n",r);
75 } else {
76 if ((blockBegin->bitState.bitContainer & 1)!=1) r = r->next;
77 } 75 }
78 prev = resultPrint(r,"Print"); 76 prev = resultPrint(r,"Print");
79 } 77 }
80 return 0; 78 return 0;
81 } 79 }