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.10.2.6 2012/08/02 09:19:31 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: #ifdef EVFILT_AIO
486: /*
487: * schedAIO() - Add AIO task to scheduler queue
488: *
489: * @root = root task
490: * @func = task execution function
491: * @arg = 1st func argument
492: * @acb = AIO cb structure address
493: * @opt_data = Optional data
494: * @opt_dlen = Optional data length
495: * return: NULL error or !=NULL new queued task
496: */
497: sched_task_t *
498: schedAIO(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg,
499: struct aiocb * __restrict acb, void *opt_data, size_t opt_dlen)
500: {
501: sched_task_t *task;
502: void *ptr;
503:
504: if (!root || !func || !acb || !opt_dlen)
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) = taskAIO;
513: TASK_ROOT(task) = root;
514:
515: TASK_ARG(task) = arg;
516: TASK_VAL(task) = (u_long) acb;
517:
518: TASK_DATA(task) = opt_data;
519: TASK_DATLEN(task) = opt_dlen;
520:
521: if (root->root_hooks.hook_add.aio)
522: ptr = root->root_hooks.hook_add.aio(task, NULL);
523: else
524: ptr = NULL;
525:
526: if (!ptr) {
527: #ifdef HAVE_LIBPTHREAD
528: pthread_mutex_lock(&root->root_mtx[taskAIO]);
529: #endif
530: TAILQ_INSERT_TAIL(&root->root_aio, TASK_ID(task), task_node);
531: #ifdef HAVE_LIBPTHREAD
532: pthread_mutex_unlock(&root->root_mtx[taskAIO]);
533: #endif
534: } else
535: task = _sched_unuseTask(task);
536:
537: return task;
538: }
539:
540: /*
541: * schedAIORead() - Add AIO read task to scheduler queue
542: *
543: * @root = root task
544: * @func = task execution function
545: * @arg = 1st func argument
546: * @fd = file descriptor
547: * @buffer = Buffer
548: * @buflen = Buffer length
549: * return: NULL error or !=NULL new queued task
550: */
551: inline sched_task_t *
552: schedAIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
553: void *buffer, size_t buflen)
554: {
555: struct aiocb *acb;
556: off_t off = 0;
557:
558: if (!root || !func || !buffer || !buflen)
559: return NULL;
560: else
561: memset(buffer, 0, buflen);
562:
563: if (!(acb = malloc(sizeof(struct aiocb)))) {
564: LOGERR;
565: return NULL;
566: } else
567: memset(acb, 0, sizeof(struct aiocb));
568:
569: acb->aio_fildes = fd;
570: acb->aio_nbytes = buflen;
571: acb->aio_buf = buffer;
572: off = lseek(fd, 0, SEEK_CUR);
573: if (off == -1) {
574: LOGERR;
575: free(acb);
576: return NULL;
577: } else
578: acb->aio_offset = off;
579: acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
580: acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
581: acb->aio_sigevent.sigev_value.sival_ptr = acb;
582:
583: if (aio_read(acb)) {
584: LOGERR;
585: free(acb);
586: return NULL;
587: }
588:
589: return schedAIO(root, func, arg, acb, buffer, buflen);
590: }
591:
592: /*
593: * schedAIOWrite() - Add AIO write task to scheduler queue
594: *
595: * @root = root task
596: * @func = task execution function
597: * @arg = 1st func argument
598: * @fd = file descriptor
599: * @buffer = Buffer
600: * @buflen = Buffer length
601: * return: NULL error or !=NULL new queued task
602: */
603: inline sched_task_t *
604: schedAIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
605: void *buffer, size_t buflen)
606: {
607: struct aiocb *acb;
608: off_t off = 0;
609:
610: if (!root || !func || !buffer || !buflen)
611: return NULL;
612:
613: if (!(acb = malloc(sizeof(struct aiocb)))) {
614: LOGERR;
615: return NULL;
616: } else
617: memset(acb, 0, sizeof(struct aiocb));
618:
619: acb->aio_fildes = fd;
620: acb->aio_nbytes = buflen;
621: acb->aio_buf = buffer;
622: off = lseek(fd, 0, SEEK_CUR);
623: if (off == -1) {
624: LOGERR;
625: free(acb);
626: return NULL;
627: } else
628: acb->aio_offset = off;
629: acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
630: acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
631: acb->aio_sigevent.sigev_value.sival_ptr = acb;
632:
633: if (aio_write(acb)) {
634: LOGERR;
635: free(acb);
636: return NULL;
637: }
638:
639: return schedAIO(root, func, arg, acb, buffer, buflen);
640: }
641:
642: #ifdef EVFILT_LIO
643: /*
644: * schedLIORead() - Add list of AIO read tasks to scheduler queue
645: *
646: * @root = root task
647: * @func = task execution function
648: * @arg = 1st func argument
649: * @fd = file descriptor
650: * @bufs = Buffer's list
651: * @nbufs = Number of Buffers
652: * return: NULL error or !=NULL new queued task
653: */
654: inline sched_task_t *
655: schedLIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
656: struct iovec *bufs, size_t nbufs)
657: {
658: struct sigevent sig;
659: struct aiocb **acb;
660: off_t off;
661: register int i;
662:
663: if (!root || !func || !bufs || !nbufs)
664: return NULL;
665:
666: off = lseek(fd, 0, SEEK_CUR);
667: if (off == -1) {
668: LOGERR;
669: return NULL;
670: }
671:
672: if (!(acb = calloc(sizeof(void*), nbufs))) {
673: LOGERR;
674: return NULL;
675: } else
676: memset(acb, 0, sizeof(void*) * nbufs);
677: for (i = 0; i < nbufs; off += bufs[i++].iov_len) {
678: acb[i] = malloc(sizeof(struct aiocb));
679: if (!acb[i]) {
680: LOGERR;
681: for (i = 0; i < nbufs; i++)
682: if (acb[i])
683: free(acb[i]);
684: free(acb);
685: return NULL;
686: } else
687: memset(acb[i], 0, sizeof(struct aiocb));
688: acb[i]->aio_fildes = fd;
689: acb[i]->aio_nbytes = bufs[i].iov_len;
690: acb[i]->aio_buf = bufs[i].iov_base;
691: acb[i]->aio_offset = off;
692: acb[i]->aio_lio_opcode = LIO_READ;
693: }
694: memset(&sig, 0, sizeof sig);
695: sig.sigev_notify = SIGEV_KEVENT;
696: sig.sigev_notify_kqueue = root->root_kq;
697: sig.sigev_value.sival_ptr = acb;
698:
699: if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {
700: LOGERR;
701: return NULL;
702: }
703:
704: return schedAIO(root, func, arg, (void*) acb, bufs, nbufs);
705: }
706:
707: /*
708: * schedLIOWrite() - Add list of AIO write tasks to scheduler queue
709: *
710: * @root = root task
711: * @func = task execution function
712: * @arg = 1st func argument
713: * @fd = file descriptor
714: * @bufs = Buffer's list
715: * @nbufs = Number of Buffers
716: * return: NULL error or !=NULL new queued task
717: */
718: inline sched_task_t *
719: schedLIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
720: struct iovec *bufs, size_t nbufs)
721: {
722: struct sigevent sig;
723: struct aiocb **acb;
724: off_t off;
725: register int i;
726:
727: if (!root || !func || !bufs || !nbufs)
728: return NULL;
729:
730: off = lseek(fd, 0, SEEK_CUR);
731: if (off == -1) {
732: LOGERR;
733: return NULL;
734: }
735:
736: if (!(acb = calloc(sizeof(void*), nbufs))) {
737: LOGERR;
738: return NULL;
739: } else
740: memset(acb, 0, sizeof(void*) * nbufs);
741: for (i = 0; i < nbufs; off += bufs[i++].iov_len) {
742: acb[i] = malloc(sizeof(struct aiocb));
743: if (!acb[i]) {
744: LOGERR;
745: for (i = 0; i < nbufs; i++)
746: if (acb[i])
747: free(acb[i]);
748: free(acb);
749: return NULL;
750: } else
751: memset(acb[i], 0, sizeof(struct aiocb));
752: acb[i]->aio_fildes = fd;
753: acb[i]->aio_nbytes = bufs[i].iov_len;
754: acb[i]->aio_buf = bufs[i].iov_base;
755: acb[i]->aio_offset = off;
756: acb[i]->aio_lio_opcode = LIO_WRITE;
757: }
758: memset(&sig, 0, sizeof sig);
759: sig.sigev_notify = SIGEV_KEVENT;
760: sig.sigev_notify_kqueue = root->root_kq;
761: sig.sigev_value.sival_ptr = acb;
762:
763: if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {
764: LOGERR;
765: return NULL;
766: }
767:
768: return schedAIO(root, func, arg, (void*) acb, bufs, nbufs);
769: }
770: #endif /* EVFILT_LIO */
771: #endif /* EVFILT_AIO */
772:
773: /*
774: * schedTimer() - Add TIMER task to scheduler queue
775: *
776: * @root = root task
777: * @func = task execution function
778: * @arg = 1st func argument
779: * @ts = timeout argument structure
780: * @opt_data = Optional data
781: * @opt_dlen = Optional data length
782: * return: NULL error or !=NULL new queued task
783: */
784: sched_task_t *
785: schedTimer(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
786: void *opt_data, size_t opt_dlen)
787: {
788: sched_task_t *task, *tmp, *t = NULL;
789: void *ptr;
790: struct timespec now;
791:
792: if (!root || !func)
793: return NULL;
794:
795: /* get new task */
796: if (!(task = _sched_useTask(root)))
797: return NULL;
798:
799: task->task_func = func;
800: TASK_TYPE(task) = taskTIMER;
801: TASK_ROOT(task) = root;
802:
803: TASK_ARG(task) = arg;
804:
805: TASK_DATA(task) = opt_data;
806: TASK_DATLEN(task) = opt_dlen;
807:
808: /* calculate timeval structure */
809: clock_gettime(CLOCK_MONOTONIC, &now);
810: now.tv_sec += ts.tv_sec;
811: now.tv_nsec += ts.tv_nsec;
812: if (now.tv_nsec >= 1000000000L) {
813: now.tv_sec++;
814: now.tv_nsec -= 1000000000L;
815: } else if (now.tv_nsec < 0) {
816: now.tv_sec--;
817: now.tv_nsec += 1000000000L;
818: }
819: TASK_TS(task) = now;
820:
821: if (root->root_hooks.hook_add.timer)
822: ptr = root->root_hooks.hook_add.timer(task, NULL);
823: else
824: ptr = NULL;
825:
826: if (!ptr) {
827: #ifdef HAVE_LIBPTHREAD
828: pthread_mutex_lock(&root->root_mtx[taskTIMER]);
829: #endif
830: #ifdef TIMER_WITHOUT_SORT
831: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
832: #else
833: TAILQ_FOREACH_SAFE(t, &root->root_timer, task_node, tmp)
834: if (sched_timespeccmp(&TASK_TS(task), &TASK_TS(t), -) < 1)
835: break;
836: if (!t)
837: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
838: else
839: TAILQ_INSERT_BEFORE(t, TASK_ID(task), task_node);
840: #endif
841: #ifdef HAVE_LIBPTHREAD
842: pthread_mutex_unlock(&root->root_mtx[taskTIMER]);
843: #endif
844: } else
845: task = _sched_unuseTask(task);
846:
847: return task;
848: }
849:
850: /*
851: * schedEvent() - Add EVENT task to scheduler queue
852: *
853: * @root = root task
854: * @func = task execution function
855: * @arg = 1st func argument
856: * @val = additional func argument
857: * @opt_data = Optional data
858: * @opt_dlen = Optional data length
859: * return: NULL error or !=NULL new queued task
860: */
861: sched_task_t *
862: schedEvent(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
863: void *opt_data, size_t opt_dlen)
864: {
865: sched_task_t *task;
866: void *ptr;
867:
868: if (!root || !func)
869: return NULL;
870:
871: /* get new task */
872: if (!(task = _sched_useTask(root)))
873: return NULL;
874:
875: task->task_func = func;
876: TASK_TYPE(task) = taskEVENT;
877: TASK_ROOT(task) = root;
878:
879: TASK_ARG(task) = arg;
880: TASK_VAL(task) = val;
881:
882: TASK_DATA(task) = opt_data;
883: TASK_DATLEN(task) = opt_dlen;
884:
885: if (root->root_hooks.hook_add.event)
886: ptr = root->root_hooks.hook_add.event(task, NULL);
887: else
888: ptr = NULL;
889:
890: if (!ptr) {
891: #ifdef HAVE_LIBPTHREAD
892: pthread_mutex_lock(&root->root_mtx[taskEVENT]);
893: #endif
894: TAILQ_INSERT_TAIL(&root->root_event, TASK_ID(task), task_node);
895: #ifdef HAVE_LIBPTHREAD
896: pthread_mutex_unlock(&root->root_mtx[taskEVENT]);
897: #endif
898: } else
899: task = _sched_unuseTask(task);
900:
901: return task;
902: }
903:
904:
905: /*
906: * schedEventLo() - Add EVENT_Lo task to scheduler queue
907: *
908: * @root = root task
909: * @func = task execution function
910: * @arg = 1st func argument
911: * @val = additional func argument
912: * @opt_data = Optional data
913: * @opt_dlen = Optional data length
914: * return: NULL error or !=NULL new queued task
915: */
916: sched_task_t *
917: schedEventLo(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
918: void *opt_data, size_t opt_dlen)
919: {
920: sched_task_t *task;
921: void *ptr;
922:
923: if (!root || !func)
924: return NULL;
925:
926: /* get new task */
927: if (!(task = _sched_useTask(root)))
928: return NULL;
929:
930: task->task_func = func;
931: TASK_TYPE(task) = taskEVENT;
932: TASK_ROOT(task) = root;
933:
934: TASK_ARG(task) = arg;
935: TASK_VAL(task) = val;
936:
937: TASK_DATA(task) = opt_data;
938: TASK_DATLEN(task) = opt_dlen;
939:
940: if (root->root_hooks.hook_add.eventlo)
941: ptr = root->root_hooks.hook_add.eventlo(task, NULL);
942: else
943: ptr = NULL;
944:
945: if (!ptr) {
946: #ifdef HAVE_LIBPTHREAD
947: pthread_mutex_lock(&root->root_mtx[taskEVENTLO]);
948: #endif
949: TAILQ_INSERT_TAIL(&root->root_eventlo, TASK_ID(task), task_node);
950: #ifdef HAVE_LIBPTHREAD
951: pthread_mutex_unlock(&root->root_mtx[taskEVENTLO]);
952: #endif
953: } else
954: task = _sched_unuseTask(task);
955:
956: return task;
957: }
958:
959: /*
960: * schedSuspend() - Add Suspended task to scheduler queue
961: *
962: * @root = root task
963: * @func = task execution function
964: * @arg = 1st func argument
965: * @id = Trigger ID
966: * @opt_data = Optional data
967: * @opt_dlen = Optional data length
968: * return: NULL error or !=NULL new queued task
969: */
970: sched_task_t *
971: schedSuspend(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long id,
972: void *opt_data, size_t opt_dlen)
973: {
974: sched_task_t *task;
975: void *ptr;
976:
977: if (!root || !func)
978: return NULL;
979:
980: /* get new task */
981: if (!(task = _sched_useTask(root)))
982: return NULL;
983:
984: task->task_func = func;
985: TASK_TYPE(task) = taskSUSPEND;
986: TASK_ROOT(task) = root;
987:
988: TASK_ARG(task) = arg;
989: TASK_VAL(task) = id;
990:
991: TASK_DATA(task) = opt_data;
992: TASK_DATLEN(task) = opt_dlen;
993:
994: if (root->root_hooks.hook_add.suspend)
995: ptr = root->root_hooks.hook_add.suspend(task, NULL);
996: else
997: ptr = NULL;
998:
999: if (!ptr) {
1000: #ifdef HAVE_LIBPTHREAD
1001: pthread_mutex_lock(&root->root_mtx[taskSUSPEND]);
1002: #endif
1003: TAILQ_INSERT_TAIL(&root->root_suspend, TASK_ID(task), task_node);
1004: #ifdef HAVE_LIBPTHREAD
1005: pthread_mutex_unlock(&root->root_mtx[taskSUSPEND]);
1006: #endif
1007: } else
1008: task = _sched_unuseTask(task);
1009:
1010: return task;
1011: }
1012:
1013: /*
1014: * schedCallOnce() - Call once from scheduler
1015: *
1016: * @root = root task
1017: * @func = task execution function
1018: * @arg = 1st func argument
1019: * @val = additional func argument
1020: * @opt_data = Optional data
1021: * @opt_dlen = Optional data length
1022: * return: return value from called func
1023: */
1024: sched_task_t *
1025: schedCallOnce(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
1026: void *opt_data, size_t opt_dlen)
1027: {
1028: sched_task_t *task;
1029: void *ret;
1030:
1031: if (!root || !func)
1032: return NULL;
1033:
1034: /* get new task */
1035: if (!(task = _sched_useTask(root)))
1036: return NULL;
1037:
1038: task->task_func = func;
1039: TASK_TYPE(task) = taskEVENT;
1040: TASK_ROOT(task) = root;
1041:
1042: TASK_ARG(task) = arg;
1043: TASK_VAL(task) = val;
1044:
1045: TASK_DATA(task) = opt_data;
1046: TASK_DATLEN(task) = opt_dlen;
1047:
1048: ret = schedCall(task);
1049:
1050: _sched_unuseTask(task);
1051: return ret;
1052: }
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