Annotation of libaitsched/src/tasks.c, revision 1.10.2.11
1.1 misho 1: /*************************************************************************
2: * (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com>
3: * by Michael Pounov <misho@openbsd-bg.org>
4: *
5: * $Author: misho $
1.10.2.11! misho 6: * $Id: tasks.c,v 1.10.2.10 2012/08/02 12:58:02 misho Exp $
1.1 misho 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:
1.6 misho 15: Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
1.1 misho 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:
1.4 misho 49: #pragma GCC visibility push(hidden)
50:
51: inline sched_task_t *
52: _sched_useTask(sched_root_task_t * __restrict root)
53: {
1.7 misho 54: sched_task_t *task, *tmp;
1.4 misho 55:
1.7 misho 56: TAILQ_FOREACH_SAFE(task, &root->root_unuse, task_node, tmp) {
1.4 misho 57: if (!TASK_ISLOCKED(task)) {
1.5 misho 58: #ifdef HAVE_LIBPTHREAD
59: pthread_mutex_lock(&root->root_mtx[taskUNUSE]);
60: #endif
1.4 misho 61: TAILQ_REMOVE(&root->root_unuse, task, task_node);
1.5 misho 62: #ifdef HAVE_LIBPTHREAD
63: pthread_mutex_unlock(&root->root_mtx[taskUNUSE]);
64: #endif
1.4 misho 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:
1.9 misho 77: memset(task, 0, sizeof(sched_task_t));
78: task->task_id = (uintptr_t) task;
1.4 misho 79: return task;
80: }
81:
82: inline sched_task_t *
83: _sched_unuseTask(sched_task_t * __restrict task)
84: {
85: TASK_UNLOCK(task);
1.5 misho 86: TASK_TYPE(task) = taskUNUSE;
87: #ifdef HAVE_LIBPTHREAD
88: pthread_mutex_lock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
89: #endif
1.9 misho 90: TAILQ_INSERT_TAIL(&TASK_ROOT(task)->root_unuse, TASK_ID(task), task_node);
1.5 misho 91: #ifdef HAVE_LIBPTHREAD
92: pthread_mutex_unlock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
93: #endif
1.4 misho 94: task = NULL;
95:
96: return task;
97: }
98:
99: #pragma GCC visibility pop
100:
101:
1.1 misho 102: /*
1.2 misho 103: * schedRead() - Add READ I/O task to scheduler queue
1.6 misho 104: *
1.1 misho 105: * @root = root task
106: * @func = task execution function
107: * @arg = 1st func argument
1.2 misho 108: * @fd = fd handle
1.5 misho 109: * @opt_data = Optional data
110: * @opt_dlen = Optional data length
1.1 misho 111: * return: NULL error or !=NULL new queued task
112: */
113: sched_task_t *
1.5 misho 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)
1.1 misho 116: {
117: sched_task_t *task;
118: void *ptr;
119:
120: if (!root || !func)
121: return NULL;
122:
123: /* get new task */
1.4 misho 124: if (!(task = _sched_useTask(root)))
125: return NULL;
1.1 misho 126:
127: task->task_func = func;
1.5 misho 128: TASK_TYPE(task) = taskREAD;
129: TASK_ROOT(task) = root;
1.1 misho 130:
131: TASK_ARG(task) = arg;
1.2 misho 132: TASK_FD(task) = fd;
1.1 misho 133:
1.5 misho 134: TASK_DATA(task) = opt_data;
135: TASK_DATLEN(task) = opt_dlen;
136:
1.1 misho 137: if (root->root_hooks.hook_add.read)
138: ptr = root->root_hooks.hook_add.read(task, NULL);
139: else
140: ptr = NULL;
141:
1.5 misho 142: if (!ptr) {
143: #ifdef HAVE_LIBPTHREAD
144: pthread_mutex_lock(&root->root_mtx[taskREAD]);
145: #endif
1.9 misho 146: TAILQ_INSERT_TAIL(&root->root_read, TASK_ID(task), task_node);
1.5 misho 147: #ifdef HAVE_LIBPTHREAD
148: pthread_mutex_unlock(&root->root_mtx[taskREAD]);
149: #endif
150: } else
1.4 misho 151: task = _sched_unuseTask(task);
1.1 misho 152:
153: return task;
154: }
155:
156: /*
1.2 misho 157: * schedWrite() - Add WRITE I/O task to scheduler queue
1.6 misho 158: *
1.1 misho 159: * @root = root task
160: * @func = task execution function
161: * @arg = 1st func argument
1.2 misho 162: * @fd = fd handle
1.5 misho 163: * @opt_data = Optional data
164: * @opt_dlen = Optional data length
1.1 misho 165: * return: NULL error or !=NULL new queued task
166: */
167: sched_task_t *
1.5 misho 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)
1.1 misho 170: {
171: sched_task_t *task;
172: void *ptr;
173:
174: if (!root || !func)
175: return NULL;
176:
177: /* get new task */
1.4 misho 178: if (!(task = _sched_useTask(root)))
179: return NULL;
1.1 misho 180:
181: task->task_func = func;
1.5 misho 182: TASK_TYPE(task) = taskWRITE;
183: TASK_ROOT(task) = root;
1.1 misho 184:
185: TASK_ARG(task) = arg;
1.2 misho 186: TASK_FD(task) = fd;
1.1 misho 187:
1.5 misho 188: TASK_DATA(task) = opt_data;
189: TASK_DATLEN(task) = opt_dlen;
190:
1.1 misho 191: if (root->root_hooks.hook_add.write)
192: ptr = root->root_hooks.hook_add.write(task, NULL);
193: else
194: ptr = NULL;
195:
1.5 misho 196: if (!ptr) {
197: #ifdef HAVE_LIBPTHREAD
198: pthread_mutex_lock(&root->root_mtx[taskWRITE]);
199: #endif
1.9 misho 200: TAILQ_INSERT_TAIL(&root->root_write, TASK_ID(task), task_node);
1.5 misho 201: #ifdef HAVE_LIBPTHREAD
202: pthread_mutex_unlock(&root->root_mtx[taskWRITE]);
203: #endif
204: } else
1.4 misho 205: task = _sched_unuseTask(task);
1.1 misho 206:
207: return task;
208: }
209:
210: /*
1.9 misho 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: /*
1.8 misho 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
1.9 misho 475: TAILQ_INSERT_TAIL(&root->root_alarm, TASK_ID(task), task_node);
1.8 misho 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:
1.10.2.10 misho 485: #ifdef AIO_SUPPORT
1.8 misho 486: /*
1.10.2.1 misho 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 *
1.10.2.2 misho 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)
1.10.2.1 misho 500: {
501: sched_task_t *task;
502: void *ptr;
503:
1.10.2.6 misho 504: if (!root || !func || !acb || !opt_dlen)
1.10.2.1 misho 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;
1.10.2.2 misho 516: TASK_VAL(task) = (u_long) acb;
1.10.2.1 misho 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: /*
1.10.2.2 misho 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
1.10.2.8 misho 549: * @offset = Offset from start of file, if =-1 from current position
1.10.2.2 misho 550: * return: NULL error or !=NULL new queued task
551: */
552: inline sched_task_t *
553: schedAIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
1.10.2.8 misho 554: void *buffer, size_t buflen, off_t offset)
1.10.2.2 misho 555: {
556: struct aiocb *acb;
1.10.2.8 misho 557: off_t off;
1.10.2.2 misho 558:
1.10.2.6 misho 559: if (!root || !func || !buffer || !buflen)
1.10.2.2 misho 560: return NULL;
1.10.2.8 misho 561:
562: if (offset == (off_t) -1) {
563: off = lseek(fd, 0, SEEK_CUR);
564: if (off == -1) {
565: LOGERR;
566: return NULL;
567: }
568: } else
569: off = offset;
1.10.2.2 misho 570:
571: if (!(acb = malloc(sizeof(struct aiocb)))) {
572: LOGERR;
573: return NULL;
574: } else
575: memset(acb, 0, sizeof(struct aiocb));
576:
577: acb->aio_fildes = fd;
578: acb->aio_nbytes = buflen;
579: acb->aio_buf = buffer;
1.10.2.8 misho 580: acb->aio_offset = off;
1.10.2.2 misho 581: acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
582: acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
1.10.2.4 misho 583: acb->aio_sigevent.sigev_value.sival_ptr = acb;
1.10.2.2 misho 584:
585: if (aio_read(acb)) {
586: LOGERR;
587: free(acb);
588: return NULL;
589: }
590:
591: return schedAIO(root, func, arg, acb, buffer, buflen);
592: }
593:
594: /*
595: * schedAIOWrite() - Add AIO write task to scheduler queue
596: *
597: * @root = root task
598: * @func = task execution function
599: * @arg = 1st func argument
600: * @fd = file descriptor
601: * @buffer = Buffer
602: * @buflen = Buffer length
1.10.2.8 misho 603: * @offset = Offset from start of file, if =-1 from current position
1.10.2.2 misho 604: * return: NULL error or !=NULL new queued task
605: */
606: inline sched_task_t *
607: schedAIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
1.10.2.8 misho 608: void *buffer, size_t buflen, off_t offset)
1.10.2.2 misho 609: {
610: struct aiocb *acb;
1.10.2.8 misho 611: off_t off;
1.10.2.2 misho 612:
1.10.2.6 misho 613: if (!root || !func || !buffer || !buflen)
1.10.2.2 misho 614: return NULL;
615:
1.10.2.8 misho 616: if (offset == (off_t) -1) {
617: off = lseek(fd, 0, SEEK_CUR);
618: if (off == -1) {
619: LOGERR;
620: return NULL;
621: }
622: } else
623: off = offset;
624:
1.10.2.2 misho 625: if (!(acb = malloc(sizeof(struct aiocb)))) {
626: LOGERR;
627: return NULL;
628: } else
629: memset(acb, 0, sizeof(struct aiocb));
630:
631: acb->aio_fildes = fd;
632: acb->aio_nbytes = buflen;
633: acb->aio_buf = buffer;
1.10.2.8 misho 634: acb->aio_offset = off;
1.10.2.2 misho 635: acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
636: acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
1.10.2.4 misho 637: acb->aio_sigevent.sigev_value.sival_ptr = acb;
1.10.2.2 misho 638:
639: if (aio_write(acb)) {
640: LOGERR;
641: free(acb);
642: return NULL;
643: }
644:
645: return schedAIO(root, func, arg, acb, buffer, buflen);
646: }
647:
1.10.2.6 misho 648: #ifdef EVFILT_LIO
649: /*
1.10.2.11! misho 650: * schedLIO() - Add AIO bulk tasks to scheduler queue
! 651: *
! 652: * @root = root task
! 653: * @func = task execution function
! 654: * @arg = 1st func argument
! 655: * @acbs = AIO cb structure addresses
! 656: * @opt_data = Optional data
! 657: * @opt_dlen = Optional data length
! 658: * return: NULL error or !=NULL new queued task
! 659: */
! 660: sched_task_t *
! 661: schedLIO(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg,
! 662: struct aiocb ** __restrict acbs, void *opt_data, size_t opt_dlen)
! 663: {
! 664: sched_task_t *task;
! 665: void *ptr;
! 666:
! 667: if (!root || !func || !acbs || !opt_dlen)
! 668: return NULL;
! 669:
! 670: /* get new task */
! 671: if (!(task = _sched_useTask(root)))
! 672: return NULL;
! 673:
! 674: task->task_func = func;
! 675: TASK_TYPE(task) = taskLIO;
! 676: TASK_ROOT(task) = root;
! 677:
! 678: TASK_ARG(task) = arg;
! 679: TASK_VAL(task) = (u_long) acbs;
! 680:
! 681: TASK_DATA(task) = opt_data;
! 682: TASK_DATLEN(task) = opt_dlen;
! 683:
! 684: if (root->root_hooks.hook_add.lio)
! 685: ptr = root->root_hooks.hook_add.lio(task, NULL);
! 686: else
! 687: ptr = NULL;
! 688:
! 689: if (!ptr) {
! 690: #ifdef HAVE_LIBPTHREAD
! 691: pthread_mutex_lock(&root->root_mtx[taskLIO]);
! 692: #endif
! 693: TAILQ_INSERT_TAIL(&root->root_lio, TASK_ID(task), task_node);
! 694: #ifdef HAVE_LIBPTHREAD
! 695: pthread_mutex_unlock(&root->root_mtx[taskLIO]);
! 696: #endif
! 697: } else
! 698: task = _sched_unuseTask(task);
! 699:
! 700: return task;
! 701: }
! 702:
! 703: /*
1.10.2.6 misho 704: * schedLIORead() - Add list of AIO read tasks to scheduler queue
705: *
706: * @root = root task
707: * @func = task execution function
708: * @arg = 1st func argument
709: * @fd = file descriptor
710: * @bufs = Buffer's list
711: * @nbufs = Number of Buffers
1.10.2.7 misho 712: * @offset = Offset from start of file, if =-1 from current position
1.10.2.6 misho 713: * return: NULL error or !=NULL new queued task
714: */
1.10.2.7 misho 715: sched_task_t *
1.10.2.6 misho 716: schedLIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
1.10.2.7 misho 717: struct iovec *bufs, size_t nbufs, off_t offset)
1.10.2.6 misho 718: {
719: struct sigevent sig;
720: struct aiocb **acb;
721: off_t off;
722: register int i;
723:
724: if (!root || !func || !bufs || !nbufs)
725: return NULL;
726:
1.10.2.7 misho 727: if (offset == (off_t) -1) {
728: off = lseek(fd, 0, SEEK_CUR);
729: if (off == -1) {
730: LOGERR;
731: return NULL;
732: }
733: } else
734: off = offset;
1.10.2.6 misho 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_READ;
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:
1.10.2.11! misho 768: return schedLIO(root, func, arg, (void*) acb, bufs, nbufs);
1.10.2.6 misho 769: }
770:
771: /*
772: * schedLIOWrite() - Add list of AIO write tasks to scheduler queue
773: *
774: * @root = root task
775: * @func = task execution function
776: * @arg = 1st func argument
777: * @fd = file descriptor
778: * @bufs = Buffer's list
779: * @nbufs = Number of Buffers
1.10.2.7 misho 780: * @offset = Offset from start of file, if =-1 from current position
1.10.2.6 misho 781: * return: NULL error or !=NULL new queued task
782: */
783: inline sched_task_t *
784: schedLIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
1.10.2.7 misho 785: struct iovec *bufs, size_t nbufs, off_t offset)
1.10.2.6 misho 786: {
787: struct sigevent sig;
788: struct aiocb **acb;
789: off_t off;
790: register int i;
791:
792: if (!root || !func || !bufs || !nbufs)
793: return NULL;
794:
1.10.2.7 misho 795: if (offset == (off_t) -1) {
796: off = lseek(fd, 0, SEEK_CUR);
797: if (off == -1) {
798: LOGERR;
799: return NULL;
800: }
801: } else
802: off = offset;
1.10.2.6 misho 803:
804: if (!(acb = calloc(sizeof(void*), nbufs))) {
805: LOGERR;
806: return NULL;
807: } else
808: memset(acb, 0, sizeof(void*) * nbufs);
809: for (i = 0; i < nbufs; off += bufs[i++].iov_len) {
810: acb[i] = malloc(sizeof(struct aiocb));
811: if (!acb[i]) {
812: LOGERR;
813: for (i = 0; i < nbufs; i++)
814: if (acb[i])
815: free(acb[i]);
816: free(acb);
817: return NULL;
818: } else
819: memset(acb[i], 0, sizeof(struct aiocb));
820: acb[i]->aio_fildes = fd;
821: acb[i]->aio_nbytes = bufs[i].iov_len;
822: acb[i]->aio_buf = bufs[i].iov_base;
823: acb[i]->aio_offset = off;
824: acb[i]->aio_lio_opcode = LIO_WRITE;
825: }
826: memset(&sig, 0, sizeof sig);
827: sig.sigev_notify = SIGEV_KEVENT;
828: sig.sigev_notify_kqueue = root->root_kq;
829: sig.sigev_value.sival_ptr = acb;
830:
831: if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {
832: LOGERR;
833: return NULL;
834: }
835:
1.10.2.11! misho 836: return schedLIO(root, func, arg, (void*) acb, bufs, nbufs);
1.10.2.6 misho 837: }
838: #endif /* EVFILT_LIO */
1.10.2.10 misho 839: #endif /* AIO_SUPPORT */
1.10.2.6 misho 840:
1.10.2.2 misho 841: /*
1.1 misho 842: * schedTimer() - Add TIMER task to scheduler queue
1.6 misho 843: *
1.1 misho 844: * @root = root task
845: * @func = task execution function
846: * @arg = 1st func argument
1.5 misho 847: * @ts = timeout argument structure
848: * @opt_data = Optional data
849: * @opt_dlen = Optional data length
1.1 misho 850: * return: NULL error or !=NULL new queued task
851: */
852: sched_task_t *
1.5 misho 853: schedTimer(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
854: void *opt_data, size_t opt_dlen)
1.1 misho 855: {
1.9 misho 856: sched_task_t *task, *tmp, *t = NULL;
1.1 misho 857: void *ptr;
1.5 misho 858: struct timespec now;
1.1 misho 859:
860: if (!root || !func)
861: return NULL;
862:
863: /* get new task */
1.4 misho 864: if (!(task = _sched_useTask(root)))
865: return NULL;
1.1 misho 866:
867: task->task_func = func;
1.5 misho 868: TASK_TYPE(task) = taskTIMER;
869: TASK_ROOT(task) = root;
1.1 misho 870:
871: TASK_ARG(task) = arg;
872:
1.5 misho 873: TASK_DATA(task) = opt_data;
874: TASK_DATLEN(task) = opt_dlen;
875:
1.1 misho 876: /* calculate timeval structure */
1.5 misho 877: clock_gettime(CLOCK_MONOTONIC, &now);
878: now.tv_sec += ts.tv_sec;
879: now.tv_nsec += ts.tv_nsec;
880: if (now.tv_nsec >= 1000000000L) {
1.1 misho 881: now.tv_sec++;
1.5 misho 882: now.tv_nsec -= 1000000000L;
883: } else if (now.tv_nsec < 0) {
1.1 misho 884: now.tv_sec--;
1.5 misho 885: now.tv_nsec += 1000000000L;
1.1 misho 886: }
1.5 misho 887: TASK_TS(task) = now;
1.1 misho 888:
889: if (root->root_hooks.hook_add.timer)
890: ptr = root->root_hooks.hook_add.timer(task, NULL);
891: else
892: ptr = NULL;
893:
894: if (!ptr) {
1.5 misho 895: #ifdef HAVE_LIBPTHREAD
896: pthread_mutex_lock(&root->root_mtx[taskTIMER]);
897: #endif
1.1 misho 898: #ifdef TIMER_WITHOUT_SORT
1.9 misho 899: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
1.1 misho 900: #else
1.9 misho 901: TAILQ_FOREACH_SAFE(t, &root->root_timer, task_node, tmp)
1.5 misho 902: if (sched_timespeccmp(&TASK_TS(task), &TASK_TS(t), -) < 1)
1.1 misho 903: break;
904: if (!t)
1.9 misho 905: TAILQ_INSERT_TAIL(&root->root_timer, TASK_ID(task), task_node);
1.1 misho 906: else
1.9 misho 907: TAILQ_INSERT_BEFORE(t, TASK_ID(task), task_node);
1.1 misho 908: #endif
1.5 misho 909: #ifdef HAVE_LIBPTHREAD
910: pthread_mutex_unlock(&root->root_mtx[taskTIMER]);
911: #endif
1.4 misho 912: } else
913: task = _sched_unuseTask(task);
1.1 misho 914:
915: return task;
916: }
917:
918: /*
919: * schedEvent() - Add EVENT task to scheduler queue
1.6 misho 920: *
1.1 misho 921: * @root = root task
922: * @func = task execution function
923: * @arg = 1st func argument
1.2 misho 924: * @val = additional func argument
1.5 misho 925: * @opt_data = Optional data
926: * @opt_dlen = Optional data length
1.1 misho 927: * return: NULL error or !=NULL new queued task
928: */
929: sched_task_t *
1.5 misho 930: schedEvent(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
931: void *opt_data, size_t opt_dlen)
1.1 misho 932: {
933: sched_task_t *task;
934: void *ptr;
935:
936: if (!root || !func)
937: return NULL;
938:
939: /* get new task */
1.4 misho 940: if (!(task = _sched_useTask(root)))
941: return NULL;
1.1 misho 942:
943: task->task_func = func;
1.5 misho 944: TASK_TYPE(task) = taskEVENT;
945: TASK_ROOT(task) = root;
1.1 misho 946:
947: TASK_ARG(task) = arg;
1.2 misho 948: TASK_VAL(task) = val;
1.1 misho 949:
1.5 misho 950: TASK_DATA(task) = opt_data;
951: TASK_DATLEN(task) = opt_dlen;
952:
1.1 misho 953: if (root->root_hooks.hook_add.event)
954: ptr = root->root_hooks.hook_add.event(task, NULL);
955: else
956: ptr = NULL;
957:
1.5 misho 958: if (!ptr) {
959: #ifdef HAVE_LIBPTHREAD
960: pthread_mutex_lock(&root->root_mtx[taskEVENT]);
961: #endif
1.9 misho 962: TAILQ_INSERT_TAIL(&root->root_event, TASK_ID(task), task_node);
1.5 misho 963: #ifdef HAVE_LIBPTHREAD
964: pthread_mutex_unlock(&root->root_mtx[taskEVENT]);
965: #endif
966: } else
1.4 misho 967: task = _sched_unuseTask(task);
1.1 misho 968:
969: return task;
970: }
971:
972:
973: /*
974: * schedEventLo() - Add EVENT_Lo task to scheduler queue
1.6 misho 975: *
1.1 misho 976: * @root = root task
977: * @func = task execution function
978: * @arg = 1st func argument
1.2 misho 979: * @val = additional func argument
1.5 misho 980: * @opt_data = Optional data
981: * @opt_dlen = Optional data length
1.1 misho 982: * return: NULL error or !=NULL new queued task
983: */
984: sched_task_t *
1.5 misho 985: schedEventLo(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
986: void *opt_data, size_t opt_dlen)
1.1 misho 987: {
988: sched_task_t *task;
989: void *ptr;
990:
991: if (!root || !func)
992: return NULL;
993:
994: /* get new task */
1.4 misho 995: if (!(task = _sched_useTask(root)))
996: return NULL;
1.1 misho 997:
998: task->task_func = func;
1.5 misho 999: TASK_TYPE(task) = taskEVENT;
1000: TASK_ROOT(task) = root;
1.1 misho 1001:
1002: TASK_ARG(task) = arg;
1.2 misho 1003: TASK_VAL(task) = val;
1.1 misho 1004:
1.5 misho 1005: TASK_DATA(task) = opt_data;
1006: TASK_DATLEN(task) = opt_dlen;
1007:
1.1 misho 1008: if (root->root_hooks.hook_add.eventlo)
1009: ptr = root->root_hooks.hook_add.eventlo(task, NULL);
1010: else
1011: ptr = NULL;
1012:
1.5 misho 1013: if (!ptr) {
1014: #ifdef HAVE_LIBPTHREAD
1015: pthread_mutex_lock(&root->root_mtx[taskEVENTLO]);
1016: #endif
1.9 misho 1017: TAILQ_INSERT_TAIL(&root->root_eventlo, TASK_ID(task), task_node);
1.5 misho 1018: #ifdef HAVE_LIBPTHREAD
1019: pthread_mutex_unlock(&root->root_mtx[taskEVENTLO]);
1020: #endif
1021: } else
1.4 misho 1022: task = _sched_unuseTask(task);
1.1 misho 1023:
1024: return task;
1025: }
1026:
1027: /*
1.10 misho 1028: * schedSuspend() - Add Suspended task to scheduler queue
1029: *
1030: * @root = root task
1031: * @func = task execution function
1032: * @arg = 1st func argument
1033: * @id = Trigger ID
1034: * @opt_data = Optional data
1035: * @opt_dlen = Optional data length
1036: * return: NULL error or !=NULL new queued task
1037: */
1038: sched_task_t *
1039: schedSuspend(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long id,
1040: void *opt_data, size_t opt_dlen)
1041: {
1042: sched_task_t *task;
1043: void *ptr;
1044:
1045: if (!root || !func)
1046: return NULL;
1047:
1048: /* get new task */
1049: if (!(task = _sched_useTask(root)))
1050: return NULL;
1051:
1052: task->task_func = func;
1053: TASK_TYPE(task) = taskSUSPEND;
1054: TASK_ROOT(task) = root;
1055:
1056: TASK_ARG(task) = arg;
1057: TASK_VAL(task) = id;
1058:
1059: TASK_DATA(task) = opt_data;
1060: TASK_DATLEN(task) = opt_dlen;
1061:
1062: if (root->root_hooks.hook_add.suspend)
1063: ptr = root->root_hooks.hook_add.suspend(task, NULL);
1064: else
1065: ptr = NULL;
1066:
1067: if (!ptr) {
1068: #ifdef HAVE_LIBPTHREAD
1069: pthread_mutex_lock(&root->root_mtx[taskSUSPEND]);
1070: #endif
1071: TAILQ_INSERT_TAIL(&root->root_suspend, TASK_ID(task), task_node);
1072: #ifdef HAVE_LIBPTHREAD
1073: pthread_mutex_unlock(&root->root_mtx[taskSUSPEND]);
1074: #endif
1075: } else
1076: task = _sched_unuseTask(task);
1077:
1078: return task;
1079: }
1080:
1081: /*
1.1 misho 1082: * schedCallOnce() - Call once from scheduler
1.6 misho 1083: *
1.1 misho 1084: * @root = root task
1085: * @func = task execution function
1086: * @arg = 1st func argument
1.2 misho 1087: * @val = additional func argument
1.5 misho 1088: * @opt_data = Optional data
1089: * @opt_dlen = Optional data length
1.2 misho 1090: * return: return value from called func
1.1 misho 1091: */
1092: sched_task_t *
1.5 misho 1093: schedCallOnce(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
1094: void *opt_data, size_t opt_dlen)
1.1 misho 1095: {
1096: sched_task_t *task;
1.2 misho 1097: void *ret;
1.1 misho 1098:
1099: if (!root || !func)
1100: return NULL;
1101:
1102: /* get new task */
1.4 misho 1103: if (!(task = _sched_useTask(root)))
1104: return NULL;
1.1 misho 1105:
1106: task->task_func = func;
1.5 misho 1107: TASK_TYPE(task) = taskEVENT;
1108: TASK_ROOT(task) = root;
1.1 misho 1109:
1110: TASK_ARG(task) = arg;
1.2 misho 1111: TASK_VAL(task) = val;
1.1 misho 1112:
1.5 misho 1113: TASK_DATA(task) = opt_data;
1114: TASK_DATLEN(task) = opt_dlen;
1115:
1.2 misho 1116: ret = schedCall(task);
1.1 misho 1117:
1.4 misho 1118: _sched_unuseTask(task);
1.2 misho 1119: return ret;
1.1 misho 1120: }
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