|
5
|
1 #include <stdio.h>
|
|
|
2 #include <stdlib.h>
|
|
3
|
3 #include "TaskInfo.h"
|
|
|
4
|
|
|
5 TaskInfo::TaskInfo(int num)
|
|
|
6 {
|
|
|
7 machineNum = num;
|
|
|
8
|
|
10
|
9 taskListPool = NULL;
|
|
|
10 freeTaskList = NULL;
|
|
|
11
|
|
|
12 taskQueuePool = NULL;
|
|
|
13 freeTaskQueue = NULL;
|
|
|
14 activeTaskQueue = NULL;
|
|
|
15 waitTaskQueue = NULL;
|
|
|
16
|
|
|
17 taskPool = NULL;
|
|
|
18 freeTask = NULL;
|
|
19
|
19 }
|
|
10
|
20
|
|
19
|
21 void
|
|
|
22 TaskInfo::init(void)
|
|
|
23 {
|
|
10
|
24 init_taskList(machineNum*2);
|
|
|
25 init_taskQueue(TASK_MAX_SIZE*4);
|
|
|
26 init_task(TASK_MAX_SIZE*2);
|
|
|
27
|
|
|
28 machineTaskList = new TaskListPtr[machineNum];
|
|
|
29
|
|
|
30 for (int i = 0; i < machineNum; i++) {
|
|
|
31 machineTaskList[i] = get_free_taskList();
|
|
|
32 }
|
|
|
33 }
|
|
|
34
|
|
3
|
35 /**
|
|
|
36 * initialize pool of task_pack_list
|
|
|
37 * @return if (success) ? 0 : -1
|
|
|
38 */
|
|
|
39 int
|
|
6
|
40 TaskInfo::init_taskList(int num)
|
|
3
|
41 {
|
|
|
42 if (!taskListPool) {
|
|
|
43 return extend_pool_taskList(num);
|
|
|
44 }
|
|
|
45 return 0;
|
|
|
46 }
|
|
|
47
|
|
|
48 /**
|
|
|
49 * @return free list from pool of task_pack_list
|
|
|
50 */
|
|
|
51 TaskListPtr
|
|
|
52 TaskInfo::get_free_taskList(void)
|
|
|
53 {
|
|
|
54 TaskListPtr q;
|
|
|
55
|
|
|
56 if (!freeTaskList) {
|
|
|
57 extend_pool_taskList(10);
|
|
|
58 }
|
|
|
59 q = freeTaskList;
|
|
6
|
60 freeTaskList = freeTaskList->next;
|
|
3
|
61
|
|
|
62 q->length = 0;
|
|
|
63 q->next = 0;
|
|
|
64
|
|
|
65 return q;
|
|
|
66 }
|
|
|
67
|
|
|
68 /**
|
|
|
69 * initialize pool of task_queue
|
|
|
70 * @return if (success) ? 0 : -1
|
|
|
71 */
|
|
|
72 int
|
|
6
|
73 TaskInfo::init_taskQueue(int num)
|
|
3
|
74 {
|
|
|
75 if (!taskQueuePool) {
|
|
|
76 return extend_pool_taskQueue(num);
|
|
|
77 }
|
|
|
78 return 0;
|
|
|
79 }
|
|
|
80
|
|
|
81 int
|
|
|
82 TaskInfo::extend_pool_taskQueue(int num)
|
|
|
83 {
|
|
6
|
84 TaskQueuePtr q = NULL;
|
|
3
|
85
|
|
5
|
86 q = (TaskQueuePtr)malloc(sizeof(TaskQueue)*(num+1));
|
|
3
|
87
|
|
|
88 if (q == NULL) {
|
|
|
89 return -1;
|
|
|
90 }
|
|
|
91 q->next = taskQueuePool;
|
|
|
92 taskQueuePool = q;
|
|
|
93
|
|
|
94 /* Connect all free queue in the pool */
|
|
6
|
95 for (q = taskQueuePool + 1; --num > 0; q++) {
|
|
3
|
96 q->next = q + 1;
|
|
|
97 }
|
|
|
98 q->next = freeTaskQueue;
|
|
|
99 freeTaskQueue = taskQueuePool + 1;
|
|
|
100
|
|
|
101 return 0;
|
|
|
102 }
|
|
|
103
|
|
|
104 TaskQueuePtr
|
|
|
105 TaskInfo::get_free_taskQueue(HTaskPtr task)
|
|
|
106 {
|
|
|
107 TaskQueuePtr q;
|
|
|
108
|
|
|
109 if (!freeTaskQueue) {
|
|
|
110 extend_pool_taskQueue(100);
|
|
|
111 }
|
|
|
112 q = freeTaskQueue;
|
|
|
113 freeTaskQueue = freeTaskQueue->next;
|
|
|
114
|
|
|
115 q->task = task;
|
|
|
116 q->next = NULL;
|
|
|
117
|
|
|
118 return q;
|
|
|
119 }
|
|
|
120
|
|
5
|
121
|
|
3
|
122 int
|
|
6
|
123 TaskInfo::init_task(int num)
|
|
3
|
124 {
|
|
|
125 if (!taskPool) {
|
|
5
|
126 return extend_pool_task(num);
|
|
3
|
127 }
|
|
5
|
128 return 0;
|
|
|
129 }
|
|
|
130
|
|
|
131 int
|
|
|
132 TaskInfo::extend_pool_task(int num)
|
|
|
133 {
|
|
6
|
134 HTaskPtr q = NULL;
|
|
5
|
135
|
|
|
136 q = (HTaskPtr)malloc(sizeof(HTask)*(num+1));
|
|
3
|
137
|
|
5
|
138 if (q == NULL) {
|
|
|
139 return -1;
|
|
|
140 }
|
|
|
141 q->next = taskPool;
|
|
|
142 taskPool = q;
|
|
|
143
|
|
|
144 /* Connect all free queue in the pool */
|
|
6
|
145 for (q = taskPool + 1; --num > 0; q++) {
|
|
5
|
146 q->next = q + 1;
|
|
|
147 }
|
|
|
148 q->next = freeTask;
|
|
|
149 freeTask = taskPool + 1;
|
|
|
150
|
|
3
|
151 return 0;
|
|
|
152 }
|
|
|
153
|
|
|
154 HTaskPtr
|
|
|
155 TaskInfo::get_free_task(int cmd, int size,
|
|
|
156 unsigned long long in_addr,
|
|
|
157 unsigned long long out_addr)
|
|
|
158 {
|
|
|
159 HTaskPtr q;
|
|
5
|
160
|
|
|
161 if (!freeTask) {
|
|
|
162 extend_pool_task(100);
|
|
|
163 }
|
|
|
164 q = freeTask;
|
|
|
165 freeTask = freeTask->next;
|
|
3
|
166
|
|
|
167 q->command = cmd;
|
|
|
168 q->in_addr = in_addr;
|
|
|
169 q->out_addr = out_addr;
|
|
|
170 q->in_size = size;
|
|
|
171 q->wait_me = NULL;
|
|
|
172 q->wait_i = NULL;
|
|
|
173 q->post_func = NULL;
|
|
|
174
|
|
|
175 return q;
|
|
|
176 }
|
|
|
177
|
|
|
178 void
|
|
|
179 TaskInfo::free_taskList(TaskListPtr q)
|
|
|
180 {
|
|
|
181 q->next = freeTaskList;
|
|
|
182 freeTaskList = q;
|
|
|
183 }
|
|
|
184
|
|
|
185 void
|
|
|
186 TaskInfo::free_taskQueue(TaskQueuePtr q)
|
|
|
187 {
|
|
|
188 q->next = freeTaskQueue;
|
|
|
189 freeTaskQueue = q;
|
|
|
190 }
|
|
|
191
|
|
|
192 void
|
|
|
193 TaskInfo::free_task(HTaskPtr q)
|
|
|
194 {
|
|
5
|
195 q->next = freeTask;
|
|
|
196 freeTask = q;
|
|
3
|
197 }
|
|
|
198
|
|
|
199 /**
|
|
|
200 * [task] is added to active_task
|
|
|
201 */
|
|
|
202 void
|
|
|
203 TaskInfo::append_activeTask(HTaskPtr task)
|
|
|
204 {
|
|
|
205 TaskQueuePtr q;
|
|
|
206
|
|
|
207 q = get_free_taskQueue(task);
|
|
|
208 activeTaskQueue = append_taskQueue(activeTaskQueue, q);
|
|
|
209 }
|
|
|
210
|
|
|
211 /**
|
|
|
212 * [task] is added to wait_task
|
|
|
213 */
|
|
|
214 void
|
|
|
215 TaskInfo::append_waitTask(HTaskPtr task)
|
|
|
216 {
|
|
|
217 TaskQueuePtr q;
|
|
|
218
|
|
|
219 q = get_free_taskQueue(task);
|
|
|
220 waitTaskQueue = append_taskQueue(waitTaskQueue, q);
|
|
|
221 }
|
|
|
222
|
|
|
223 void
|
|
|
224 TaskInfo::check_task_finish(HTaskPtr task)
|
|
|
225 {
|
|
|
226 notify_wait_taskQueue(task, task->wait_me);
|
|
|
227 task->post_func();
|
|
|
228
|
|
|
229 free_task(task);
|
|
|
230 }
|
|
|
231
|
|
|
232 void
|
|
|
233 TaskInfo::notify_wait_taskQueue(HTaskPtr depend, TaskQueuePtr list)
|
|
|
234 {
|
|
|
235 TaskQueuePtr p, d;
|
|
|
236 HTaskPtr task;
|
|
|
237
|
|
|
238 p = list; // wait task list
|
|
|
239
|
|
|
240 while (p) {
|
|
|
241 task = p->task;
|
|
|
242 task->wait_i = remove_taskQueue_eq_task(task->wait_i, depend);
|
|
|
243 if (task->wait_i == NULL) {
|
|
|
244 d = p;
|
|
|
245 p = p->next;
|
|
|
246 append_activeTask(task);
|
|
|
247 waitTaskQueue = remove_taskQueue(waitTaskQueue, d);
|
|
|
248 } else {
|
|
|
249 p = p->next;
|
|
|
250 }
|
|
|
251 }
|
|
|
252 }
|
|
|
253
|
|
|
254 TaskQueuePtr
|
|
|
255 TaskInfo::remove_taskQueue_eq_task(TaskQueuePtr list, HTaskPtr task)
|
|
|
256 {
|
|
|
257 TaskQueuePtr p = list;
|
|
|
258 TaskQueuePtr p1;
|
|
|
259
|
|
|
260 if (!p) return p;
|
|
|
261
|
|
|
262 if (p->task == task) {
|
|
|
263 list = list->next;
|
|
|
264 free_taskQueue(p);
|
|
|
265 } else {
|
|
|
266 p1 = p->next;
|
|
|
267 while (p1 && p1->task && p1->task != task) {
|
|
|
268 p1 = p1->next;
|
|
|
269 p = p->next;
|
|
|
270 }
|
|
|
271 if (p1) {
|
|
|
272 p->next = p1->next;
|
|
|
273 free_taskQueue(p1);
|
|
|
274 }
|
|
|
275 }
|
|
|
276
|
|
|
277 return list;
|
|
|
278 }
|
|
|
279
|
|
|
280 TaskQueuePtr
|
|
|
281 TaskInfo::remove_taskQueue(TaskQueuePtr list, TaskQueuePtr q)
|
|
|
282 {
|
|
|
283 TaskQueuePtr p = list;
|
|
|
284 TaskQueuePtr p1;
|
|
|
285
|
|
|
286 if (!p) return p;
|
|
|
287
|
|
|
288 if (p == q) {
|
|
|
289 list = list->next;
|
|
|
290 free_taskQueue(p);
|
|
|
291 } else {
|
|
|
292 p1 = p->next;
|
|
|
293 while (p1 && p1 != q) {
|
|
|
294 p1 = p1->next;
|
|
|
295 p = p->next;
|
|
|
296 }
|
|
|
297 if (p1) {
|
|
|
298 p->next = p1->next;
|
|
|
299 free_taskQueue(p1);
|
|
|
300 }
|
|
|
301 }
|
|
|
302
|
|
|
303 return list;
|
|
|
304 }
|
|
|
305
|
|
10
|
306
|
|
|
307 void
|
|
|
308 TaskInfo::finish(void)
|
|
|
309 {
|
|
|
310 destroy_taskList();
|
|
|
311 destroy_taskQueue();
|
|
|
312 destroy_task();
|
|
|
313
|
|
|
314 delete [] machineTaskList;
|
|
|
315 }
|
|
|
316
|
|
|
317 void
|
|
|
318 TaskInfo::destroy_taskList(void)
|
|
|
319 {
|
|
|
320 TaskListPtr q;
|
|
|
321
|
|
|
322 for (q = taskListPool; q; q = q->next) {
|
|
|
323 free(q);
|
|
|
324 }
|
|
|
325 freeTaskList = taskListPool = NULL;
|
|
|
326 }
|
|
|
327
|
|
|
328 void
|
|
|
329 TaskInfo::destroy_taskQueue(void)
|
|
|
330 {
|
|
|
331 TaskQueuePtr q;
|
|
|
332
|
|
|
333 for (q = taskQueuePool; q; q = q->next) {
|
|
|
334 free(q);
|
|
|
335 }
|
|
|
336 freeTaskQueue = taskQueuePool = NULL;
|
|
|
337 }
|
|
|
338
|
|
|
339 void
|
|
|
340 TaskInfo::destroy_task(void)
|
|
|
341 {
|
|
|
342 HTaskPtr q;
|
|
|
343
|
|
|
344 for (q = taskPool; q; q = q->next) {
|
|
|
345 free(q);
|
|
|
346 }
|
|
|
347 freeTask = taskPool = NULL;
|
|
|
348 }
|
|
|
349
|
|
3
|
350 TaskListPtr
|
|
|
351 append_taskList(TaskListPtr list, TaskListPtr q)
|
|
|
352 {
|
|
|
353 TaskListPtr p = list;
|
|
|
354
|
|
|
355 if (!p) {
|
|
|
356 return q;
|
|
|
357 } else {
|
|
|
358 while (p->next) p = p->next;
|
|
|
359 p->next = q;
|
|
|
360 return list;
|
|
|
361 }
|
|
|
362 }
|
|
|
363
|
|
|
364 TaskQueuePtr
|
|
|
365 append_taskQueue(TaskQueuePtr list, TaskQueuePtr q)
|
|
|
366 {
|
|
|
367 TaskQueuePtr p = list;
|
|
|
368
|
|
|
369 if (!p) {
|
|
|
370 return q;
|
|
|
371 } else {
|
|
|
372 while(p->next) p = p->next;
|
|
|
373 p->next = q;
|
|
|
374 return list;
|
|
|
375 }
|
|
|
376 }
|
