1: /*************************************************************************
2: * (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com>
3: * by Michael Pounov <misho@openbsd-bg.org>
4: *
5: * $Author: misho $
6: * $Id: tasks.c,v 1.9.6.1 2012/07/24 13:47:02 misho Exp $
7: *
8: **************************************************************************
9: The ELWIX and AITNET software is distributed under the following
10: terms:
11:
12: All of the documentation and software included in the ELWIX and AITNET
13: Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
14:
15: Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
16: by Michael Pounov <misho@elwix.org>. All rights reserved.
17:
18: Redistribution and use in source and binary forms, with or without
19: modification, are permitted provided that the following conditions
20: are met:
21: 1. Redistributions of source code must retain the above copyright
22: notice, this list of conditions and the following disclaimer.
23: 2. Redistributions in binary form must reproduce the above copyright
24: notice, this list of conditions and the following disclaimer in the
25: documentation and/or other materials provided with the distribution.
26: 3. All advertising materials mentioning features or use of this software
27: must display the following acknowledgement:
28: This product includes software developed by Michael Pounov <misho@elwix.org>
29: ELWIX - Embedded LightWeight unIX and its contributors.
30: 4. Neither the name of AITNET nor the names of its contributors
31: may be used to endorse or promote products derived from this software
32: without specific prior written permission.
33:
34: THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
35: ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
36: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
37: ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
38: FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
39: DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
40: OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
41: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
42: LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
43: OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44: SUCH DAMAGE.
45: */
46: #include "global.h"
47:
48:
49: #pragma GCC visibility push(hidden)
50:
51: inline sched_task_t *
52: _sched_useTask(sched_root_task_t * __restrict root)
53: {
54: sched_task_t *task, *tmp;
55:
56: TAILQ_FOREACH_SAFE(task, &root->root_unuse, task_node, tmp) {
57: if (!TASK_ISLOCKED(task)) {
58: #ifdef HAVE_LIBPTHREAD
59: pthread_mutex_lock(&root->root_mtx[taskUNUSE]);
60: #endif
61: TAILQ_REMOVE(&root->root_unuse, task, task_node);
62: #ifdef HAVE_LIBPTHREAD
63: pthread_mutex_unlock(&root->root_mtx[taskUNUSE]);
64: #endif
65: break;
66: }
67: }
68:
69: if (!task) {
70: task = malloc(sizeof(sched_task_t));
71: if (!task) {
72: LOGERR;
73: return NULL;
74: }
75: }
76:
77: memset(task, 0, sizeof(sched_task_t));
78: task->task_id = (uintptr_t) task;
79: return task;
80: }
81:
82: inline sched_task_t *
83: _sched_unuseTask(sched_task_t * __restrict task)
84: {
85: TASK_UNLOCK(task);
86: TASK_TYPE(task) = taskUNUSE;
87: #ifdef HAVE_LIBPTHREAD
88: pthread_mutex_lock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
89: #endif
90: TAILQ_INSERT_TAIL(&TASK_ROOT(task)->root_unuse, TASK_ID(task), task_node);
91: #ifdef HAVE_LIBPTHREAD
92: pthread_mutex_unlock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
93: #endif
94: task = NULL;
95:
96: return task;
97: }
98:
99: #pragma GCC visibility pop
100:
101:
102: /*
103: * schedRead() - Add READ I/O task to scheduler queue
104: *
105: * @root = root task
106: * @func = task execution function
107: * @arg = 1st func argument
108: * @fd = fd handle
109: * @opt_data = Optional data
110: * @opt_dlen = Optional data length
111: * return: NULL error or !=NULL new queued task
112: */
113: sched_task_t *
114: schedRead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
115: void *opt_data, size_t opt_dlen)
116: {
117: sched_task_t *task;
118: void *ptr;
119:
120: if (!root || !func)
121: return NULL;
122:
123: /* get new task */
124: if (!(task = _sched_useTask(root)))
125: return NULL;
126:
127: task->task_func = func;
128: TASK_TYPE(task) = taskREAD;
129: TASK_ROOT(task) = root;
130:
131: TASK_ARG(task) = arg;
132: TASK_FD(task) = fd;
133:
134: TASK_DATA(task) = opt_data;
135: TASK_DATLEN(task) = opt_dlen;
136:
137: if (root->root_hooks.hook_add.read)
138: ptr = root->root_hooks.hook_add.read(task, NULL);
139: else
140: ptr = NULL;
141:
142: if (!ptr) {
143: #ifdef HAVE_LIBPTHREAD
144: pthread_mutex_lock(&root->root_mtx[taskREAD]);
145: #endif
146: TAILQ_INSERT_TAIL(&root->root_read, TASK_ID(task), task_node);
147: #ifdef HAVE_LIBPTHREAD
148: pthread_mutex_unlock(&root->root_mtx[taskREAD]);
149: #endif
150: } else
151: task = _sched_unuseTask(task);
152:
153: return task;
154: }
155:
156: /*
157: * schedWrite() - Add WRITE I/O task to scheduler queue
158: *
159: * @root = root task
160: * @func = task execution function
161: * @arg = 1st func argument
162: * @fd = fd handle
163: * @opt_data = Optional data
164: * @opt_dlen = Optional data length
165: * return: NULL error or !=NULL new queued task
166: */
167: sched_task_t *
168: schedWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
169: void *opt_data, size_t opt_dlen)
170: {
171: sched_task_t *task;
172: void *ptr;
173:
174: if (!root || !func)
175: return NULL;
176:
177: /* get new task */
178: if (!(task = _sched_useTask(root)))
179: return NULL;
180:
181: task->task_func = func;
182: TASK_TYPE(task) = taskWRITE;
183: TASK_ROOT(task) = root;
184:
185: TASK_ARG(task) = arg;
186: TASK_FD(task) = fd;
187:
188: TASK_DATA(task) = opt_data;
189: TASK_DATLEN(task) = opt_dlen;
190:
191: if (root->root_hooks.hook_add.write)
192: ptr = root->root_hooks.hook_add.write(task, NULL);
193: else
194: ptr = NULL;
195:
196: if (!ptr) {
197: #ifdef HAVE_LIBPTHREAD
198: pthread_mutex_lock(&root->root_mtx[taskWRITE]);
199: #endif
200: TAILQ_INSERT_TAIL(&root->root_write, TASK_ID(task), task_node);
201: #ifdef HAVE_LIBPTHREAD
202: pthread_mutex_unlock(&root->root_mtx[taskWRITE]);
203: #endif
204: } else
205: task = _sched_unuseTask(task);
206:
207: return task;
208: }
209:
210: /*
211: * schedNode() - Add NODE task to scheduler queue
212: *
213: * @root = root task
214: * @func = task execution function
215: * @arg = 1st func argument
216: * @fd = fd handle
217: * @opt_data = Optional data
218: * @opt_dlen = Optional data length
219: * return: NULL error or !=NULL new queued task
220: */
221: sched_task_t *
222: schedNode(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
223: void *opt_data, size_t opt_dlen)
224: {
225: sched_task_t *task;
226: void *ptr;
227:
228: if (!root || !func)
229: return NULL;
230:
231: /* get new task */
232: if (!(task = _sched_useTask(root)))
233: return NULL;
234:
235: task->task_func = func;
236: TASK_TYPE(task) = taskNODE;
237: TASK_ROOT(task) = root;
238:
239: TASK_ARG(task) = arg;
240: TASK_FD(task) = fd;
241:
242: TASK_DATA(task) = opt_data;
243: TASK_DATLEN(task) = opt_dlen;
244:
245: if (root->root_hooks.hook_add.node)
246: ptr = root->root_hooks.hook_add.node(task, NULL);
247: else
248: ptr = NULL;
249:
250: if (!ptr) {
251: #ifdef HAVE_LIBPTHREAD
252: pthread_mutex_lock(&root->root_mtx[taskNODE]);
253: #endif
254: TAILQ_INSERT_TAIL(&root->root_node, TASK_ID(task), task_node);
255: #ifdef HAVE_LIBPTHREAD
256: pthread_mutex_unlock(&root->root_mtx[taskNODE]);
257: #endif
258: } else
259: task = _sched_unuseTask(task);
260:
261: return task;
262: }
263:
264: /*
265: * schedProc() - Add PROC task to scheduler queue
266: *
267: * @root = root task
268: * @func = task execution function
269: * @arg = 1st func argument
270: * @pid = PID
271: * @opt_data = Optional data
272: * @opt_dlen = Optional data length
273: * return: NULL error or !=NULL new queued task
274: */
275: sched_task_t *
276: schedProc(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long pid,
277: void *opt_data, size_t opt_dlen)
278: {
279: sched_task_t *task;
280: void *ptr;
281:
282: if (!root || !func)
283: return NULL;
284:
285: /* get new task */
286: if (!(task = _sched_useTask(root)))
287: return NULL;
288:
289: task->task_func = func;
290: TASK_TYPE(task) = taskPROC;
291: TASK_ROOT(task) = root;
292:
293: TASK_ARG(task) = arg;
294: TASK_VAL(task) = pid;
295:
296: TASK_DATA(task) = opt_data;
297: TASK_DATLEN(task) = opt_dlen;
298:
299: if (root->root_hooks.hook_add.proc)
300: ptr = root->root_hooks.hook_add.proc(task, NULL);
301: else
302: ptr = NULL;
303:
304: if (!ptr) {
305: #ifdef HAVE_LIBPTHREAD
306: pthread_mutex_lock(&root->root_mtx[taskPROC]);
307: #endif
308: TAILQ_INSERT_TAIL(&root->root_proc, TASK_ID(task), task_node);
309: #ifdef HAVE_LIBPTHREAD
310: pthread_mutex_unlock(&root->root_mtx[taskPROC]);
311: #endif
312: } else
313: task = _sched_unuseTask(task);
314:
315: return task;
316: }
317:
318: /*
319: * schedUser() - Add trigger USER task to scheduler queue
320: *
321: * @root = root task
322: * @func = task execution function
323: * @arg = 1st func argument
324: * @id = Trigger ID
325: * @opt_data = Optional data
326: * @opt_dlen = Optional user's trigger flags
327: * return: NULL error or !=NULL new queued task
328: */
329: sched_task_t *
330: schedUser(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long id,
331: void *opt_data, size_t opt_dlen)
332: {
333: #ifndef EVFILT_USER
334: sched_SetErr(ENOTSUP, "Not supported kevent() filter");
335: return NULL;
336: #else
337: sched_task_t *task;
338: void *ptr;
339:
340: if (!root || !func)
341: return NULL;
342:
343: /* get new task */
344: if (!(task = _sched_useTask(root)))
345: return NULL;
346:
347: task->task_func = func;
348: TASK_TYPE(task) = taskUSER;
349: TASK_ROOT(task) = root;
350:
351: TASK_ARG(task) = arg;
352: TASK_VAL(task) = id;
353:
354: TASK_DATA(task) = opt_data;
355: TASK_DATLEN(task) = opt_dlen;
356:
357: if (root->root_hooks.hook_add.user)
358: ptr = root->root_hooks.hook_add.user(task, NULL);
359: else
360: ptr = NULL;
361:
362: if (!ptr) {
363: #ifdef HAVE_LIBPTHREAD
364: pthread_mutex_lock(&root->root_mtx[taskUSER]);
365: #endif
366: TAILQ_INSERT_TAIL(&root->root_user, TASK_ID(task), task_node);
367: #ifdef HAVE_LIBPTHREAD
368: pthread_mutex_unlock(&root->root_mtx[taskUSER]);
369: #endif
370: } else
371: task = _sched_unuseTask(task);
372:
373: return task;
374: #endif
375: }
376:
377: /*
378: * schedSignal() - Add SIGNAL task to scheduler queue
379: *
380: * @root = root task
381: * @func = task execution function
382: * @arg = 1st func argument
383: * @sig = Signal
384: * @opt_data = Optional data
385: * @opt_dlen = Optional data length
386: * return: NULL error or !=NULL new queued task
387: */
388: sched_task_t *
389: schedSignal(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long sig,
390: void *opt_data, size_t opt_dlen)
391: {
392: sched_task_t *task;
393: void *ptr;
394:
395: if (!root || !func)
396: return NULL;
397:
398: /* get new task */
399: if (!(task = _sched_useTask(root)))
400: return NULL;
401:
402: task->task_func = func;
403: TASK_TYPE(task) = taskSIGNAL;
404: TASK_ROOT(task) = root;
405:
406: TASK_ARG(task) = arg;
407: TASK_VAL(task) = sig;
408:
409: TASK_DATA(task) = opt_data;
410: TASK_DATLEN(task) = opt_dlen;
411:
412: if (root->root_hooks.hook_add.signal)
413: ptr = root->root_hooks.hook_add.signal(task, NULL);
414: else
415: ptr = NULL;
416:
417: if (!ptr) {
418: #ifdef HAVE_LIBPTHREAD
419: pthread_mutex_lock(&root->root_mtx[taskSIGNAL]);
420: #endif
421: TAILQ_INSERT_TAIL(&root->root_signal, TASK_ID(task), task_node);
422: #ifdef HAVE_LIBPTHREAD
423: pthread_mutex_unlock(&root->root_mtx[taskSIGNAL]);
424: #endif
425: } else
426: task = _sched_unuseTask(task);
427:
428: return task;
429: }
430:
431: /*
432: * schedAlarm() - Add ALARM task to scheduler queue
433: *
434: * @root = root task
435: * @func = task execution function
436: * @arg = 1st func argument
437: * @ts = timeout argument structure, minimum alarm timer resolution is 1msec!
438: * @opt_data = Optional data
439: * @opt_dlen = Optional data length
440: * return: NULL error or !=NULL new queued task
441: */
442: sched_task_t *
443: schedAlarm(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
444: void *opt_data, size_t opt_dlen)
445: {
446: sched_task_t *task;
447: void *ptr;
448:
449: if (!root || !func)
450: return NULL;
451:
452: /* get new task */
453: if (!(task = _sched_useTask(root)))
454: return NULL;
455:
456: task->task_func = func;
457: TASK_TYPE(task) = taskALARM;
458: TASK_ROOT(task) = root;
459:
460: TASK_ARG(task) = arg;
461: TASK_TS(task) = ts;
462:
463: TASK_DATA(task) = opt_data;
464: TASK_DATLEN(task) = opt_dlen;
465:
466: if (root->root_hooks.hook_add.alarm)
467: ptr = root->root_hooks.hook_add.alarm(task, NULL);
468: else
469: ptr = NULL;
470:
471: if (!ptr) {
472: #ifdef HAVE_LIBPTHREAD
473: pthread_mutex_lock(&root->root_mtx[taskALARM]);
474: #endif
475: TAILQ_INSERT_TAIL(&root->root_alarm, TASK_ID(task), task_node);
476: #ifdef HAVE_LIBPTHREAD
477: pthread_mutex_unlock(&root->root_mtx[taskALARM]);
478: #endif
479: } else
480: task = _sched_unuseTask(task);
481:
482: return task;
483: }
484:
485: /*
486: * schedTimer() - Add TIMER task to scheduler queue
487: *
488: * @root = root task
489: * @func = task execution function
490: * @arg = 1st func argument
491: * @ts = timeout argument structure
492: * @opt_data = Optional data
493: * @opt_dlen = Optional data length
494: * return: NULL error or !=NULL new queued task
495: */
496: sched_task_t *
497: schedTimer(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
498: void *opt_data, size_t opt_dlen)
499: {
500: sched_task_t *task, *tmp, *t = NULL;
501: void *ptr;
502: struct timespec now;
503:
504: if (!root || !func)
505: return NULL;
506:
507: /* get new task */
508: if (!(task = _sched_useTask(root)))
509: return NULL;
510:
511: task->task_func = func;
512: TASK_TYPE(task) = taskTIMER;
513: TASK_ROOT(task) = root;
514:
515: TASK_ARG(task) = arg;
516:
517: TASK_DATA(task) = opt_data;
518: TASK_DATLEN(task) = opt_dlen;
519:
520: /* calculate timeval structure */
521: clock_gettime(CLOCK_MONOTONIC, &now);
522: now.tv_sec += ts.tv_sec;
523: now.tv_nsec += ts.tv_nsec;
524: if (now.tv_nsec >= 1000000000L) {
525: now.tv_sec++;
526: now.tv_nsec -= 1000000000L;
527: } else if (now.tv_nsec < 0) {
528: now.tv_sec--;
529: now.tv_nsec += 1000000000L;
530: }
531: TASK_TS(task) = now;
532:
533: if (root->root_hooks.hook_add.timer)
534: ptr = root->root_hooks.hook_add.timer(task, NULL);
535: else
536: ptr = NULL;
537:
538: if (!ptr) {
539: #ifdef HAVE_LIBPTHREAD
540: pthread_mutex_lock(&root->root_mtx[taskTIMER]);
541: #endif
542: #ifdef TIMER_WITHOUT_SORT
543: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
544: #else
545: TAILQ_FOREACH_SAFE(t, &root->root_timer, task_node, tmp)
546: if (sched_timespeccmp(&TASK_TS(task), &TASK_TS(t), -) < 1)
547: break;
548: if (!t)
549: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
550: else
551: TAILQ_INSERT_BEFORE(t, TASK_ID(task), task_node);
552: #endif
553: #ifdef HAVE_LIBPTHREAD
554: pthread_mutex_unlock(&root->root_mtx[taskTIMER]);
555: #endif
556: } else
557: task = _sched_unuseTask(task);
558:
559: return task;
560: }
561:
562: /*
563: * schedEvent() - Add EVENT task to scheduler queue
564: *
565: * @root = root task
566: * @func = task execution function
567: * @arg = 1st func argument
568: * @val = additional func argument
569: * @opt_data = Optional data
570: * @opt_dlen = Optional data length
571: * return: NULL error or !=NULL new queued task
572: */
573: sched_task_t *
574: schedEvent(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
575: void *opt_data, size_t opt_dlen)
576: {
577: sched_task_t *task;
578: void *ptr;
579:
580: if (!root || !func)
581: return NULL;
582:
583: /* get new task */
584: if (!(task = _sched_useTask(root)))
585: return NULL;
586:
587: task->task_func = func;
588: TASK_TYPE(task) = taskEVENT;
589: TASK_ROOT(task) = root;
590:
591: TASK_ARG(task) = arg;
592: TASK_VAL(task) = val;
593:
594: TASK_DATA(task) = opt_data;
595: TASK_DATLEN(task) = opt_dlen;
596:
597: if (root->root_hooks.hook_add.event)
598: ptr = root->root_hooks.hook_add.event(task, NULL);
599: else
600: ptr = NULL;
601:
602: if (!ptr) {
603: #ifdef HAVE_LIBPTHREAD
604: pthread_mutex_lock(&root->root_mtx[taskEVENT]);
605: #endif
606: TAILQ_INSERT_TAIL(&root->root_event, TASK_ID(task), task_node);
607: #ifdef HAVE_LIBPTHREAD
608: pthread_mutex_unlock(&root->root_mtx[taskEVENT]);
609: #endif
610: } else
611: task = _sched_unuseTask(task);
612:
613: return task;
614: }
615:
616:
617: /*
618: * schedEventLo() - Add EVENT_Lo task to scheduler queue
619: *
620: * @root = root task
621: * @func = task execution function
622: * @arg = 1st func argument
623: * @val = additional func argument
624: * @opt_data = Optional data
625: * @opt_dlen = Optional data length
626: * return: NULL error or !=NULL new queued task
627: */
628: sched_task_t *
629: schedEventLo(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
630: void *opt_data, size_t opt_dlen)
631: {
632: sched_task_t *task;
633: void *ptr;
634:
635: if (!root || !func)
636: return NULL;
637:
638: /* get new task */
639: if (!(task = _sched_useTask(root)))
640: return NULL;
641:
642: task->task_func = func;
643: TASK_TYPE(task) = taskEVENT;
644: TASK_ROOT(task) = root;
645:
646: TASK_ARG(task) = arg;
647: TASK_VAL(task) = val;
648:
649: TASK_DATA(task) = opt_data;
650: TASK_DATLEN(task) = opt_dlen;
651:
652: if (root->root_hooks.hook_add.eventlo)
653: ptr = root->root_hooks.hook_add.eventlo(task, NULL);
654: else
655: ptr = NULL;
656:
657: if (!ptr) {
658: #ifdef HAVE_LIBPTHREAD
659: pthread_mutex_lock(&root->root_mtx[taskEVENTLO]);
660: #endif
661: TAILQ_INSERT_TAIL(&root->root_eventlo, TASK_ID(task), task_node);
662: #ifdef HAVE_LIBPTHREAD
663: pthread_mutex_unlock(&root->root_mtx[taskEVENTLO]);
664: #endif
665: } else
666: task = _sched_unuseTask(task);
667:
668: return task;
669: }
670:
671: /*
672: * schedSuspend() - Add Suspended task to scheduler queue
673: *
674: * @root = root task
675: * @func = task execution function
676: * @arg = 1st func argument
677: * @id = Trigger ID
678: * @opt_data = Optional data
679: * @opt_dlen = Optional data length
680: * return: NULL error or !=NULL new queued task
681: */
682: sched_task_t *
683: schedSuspend(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long id,
684: void *opt_data, size_t opt_dlen)
685: {
686: sched_task_t *task;
687: void *ptr;
688:
689: if (!root || !func)
690: return NULL;
691:
692: /* get new task */
693: if (!(task = _sched_useTask(root)))
694: return NULL;
695:
696: task->task_func = func;
697: TASK_TYPE(task) = taskSUSPEND;
698: TASK_ROOT(task) = root;
699:
700: TASK_ARG(task) = arg;
701: TASK_VAL(task) = id;
702:
703: TASK_DATA(task) = opt_data;
704: TASK_DATLEN(task) = opt_dlen;
705:
706: if (root->root_hooks.hook_add.suspend)
707: ptr = root->root_hooks.hook_add.suspend(task, NULL);
708: else
709: ptr = NULL;
710:
711: if (!ptr) {
712: #ifdef HAVE_LIBPTHREAD
713: pthread_mutex_lock(&root->root_mtx[taskSUSPEND]);
714: #endif
715: TAILQ_INSERT_TAIL(&root->root_suspend, TASK_ID(task), task_node);
716: #ifdef HAVE_LIBPTHREAD
717: pthread_mutex_unlock(&root->root_mtx[taskSUSPEND]);
718: #endif
719: } else
720: task = _sched_unuseTask(task);
721:
722: return task;
723: }
724:
725: /*
726: * schedCallOnce() - Call once from scheduler
727: *
728: * @root = root task
729: * @func = task execution function
730: * @arg = 1st func argument
731: * @val = additional func argument
732: * @opt_data = Optional data
733: * @opt_dlen = Optional data length
734: * return: return value from called func
735: */
736: sched_task_t *
737: schedCallOnce(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
738: void *opt_data, size_t opt_dlen)
739: {
740: sched_task_t *task;
741: void *ret;
742:
743: if (!root || !func)
744: return NULL;
745:
746: /* get new task */
747: if (!(task = _sched_useTask(root)))
748: return NULL;
749:
750: task->task_func = func;
751: TASK_TYPE(task) = taskEVENT;
752: TASK_ROOT(task) = root;
753:
754: TASK_ARG(task) = arg;
755: TASK_VAL(task) = val;
756:
757: TASK_DATA(task) = opt_data;
758: TASK_DATLEN(task) = opt_dlen;
759:
760: ret = schedCall(task);
761:
762: _sched_unuseTask(task);
763: return ret;
764: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to tasks.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [ELWIX - Embedded LightWeight unIX -] / libaitsched / src