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: hooks.c,v 1.3.4.2 2012/01/24 14:04:58 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
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: #include "hooks.h"
48:
49:
50: /*
51: * sched_hook_init() - Default INIT hook
52: * @root = root task
53: * @data = optional data if !=NULL
54: * return: <0 errors and 0 ok
55: */
56: void *
57: sched_hook_init(void *root, void *data)
58: {
59: sched_root_task_t *r = root;
60:
61: if (!r || r->root_data.iov_base || r->root_data.iov_len)
62: return (void*) -1;
63:
64: r->root_data.iov_base = malloc(sizeof(struct sched_IO));
65: if (!r->root_data.iov_base) {
66: LOGERR;
67: return (void*) -1;
68: } else {
69: r->root_data.iov_len = sizeof(struct sched_IO);
70: memset(r->root_data.iov_base, 0, r->root_data.iov_len);
71: }
72:
73: r->root_kq = kqueue();
74: if (r->root_kq == -1) {
75: LOGERR;
76: return (void*) -1;
77: }
78:
79: return NULL;
80: }
81:
82: /*
83: * sched_hook_fini() - Default FINI hook
84: * @root = root task
85: * @arg = unused
86: * return: <0 errors and 0 ok
87: */
88: void *
89: sched_hook_fini(void *root, void *arg __unused)
90: {
91: sched_root_task_t *r = root;
92:
93: if (!r)
94: return (void*) -1;
95:
96: if (r->root_kq > 2) {
97: close(r->root_kq);
98: r->root_kq = 0;
99: }
100:
101: if (r->root_data.iov_base && r->root_data.iov_len) {
102: free(r->root_data.iov_base);
103: r->root_data.iov_base = NULL;
104: r->root_data.iov_len = 0;
105: }
106:
107: return NULL;
108: }
109:
110: /*
111: * sched_hook_cancel() - Default CANCEL hook
112: * @task = current task
113: * @arg = unused
114: * return: <0 errors and 0 ok
115: */
116: void *
117: sched_hook_cancel(void *task, void *arg __unused)
118: {
119: struct sched_IO *io;
120: sched_task_t *t = task;
121: struct kevent chg[1];
122: struct timespec timeout = { 0, 0 };
123:
124: if (!t || !TASK_ROOT(t) || !ROOT_DATA(t->task_root) || !ROOT_DATLEN(t->task_root))
125: return (void*) -1;
126: else
127: io = ROOT_DATA(t->task_root);
128:
129: switch (TASK_TYPE(t)) {
130: case taskREAD:
131: #ifdef __NetBSD__
132: EV_SET(&chg[0], TASK_FD(t), EVFILT_READ, EV_DELETE, 0, 0, (intptr_t) TASK_FD(t));
133: #else
134: EV_SET(&chg[0], TASK_FD(t), EVFILT_READ, EV_DELETE, 0, 0, (void*) TASK_FD(t));
135: #endif
136: kevent(TASK_ROOT(t)->root_kq, chg, 1, NULL, 0, &timeout);
137: FD_CLR(TASK_FD(t), &io->rfd);
138: break;
139: case taskWRITE:
140: #ifdef __NetBSD__
141: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_DELETE, 0, 0, (intptr_t) TASK_FD(t));
142: #else
143: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_DELETE, 0, 0, (void*) TASK_FD(t));
144: #endif
145: kevent(TASK_ROOT(t)->root_kq, chg, 1, NULL, 0, &timeout);
146: FD_CLR(TASK_FD(t), &io->wfd);
147: break;
148: default:
149: break;
150: }
151:
152: return NULL;
153: }
154:
155: /*
156: * sched_hook_read() - Default READ hook
157: * @task = current task
158: * @arg = unused
159: * return: <0 errors and 0 ok
160: */
161: void *
162: sched_hook_read(void *task, void *arg __unused)
163: {
164: struct sched_IO *io;
165: sched_task_t *t = task;
166: struct kevent chg[1];
167: struct timespec timeout = { 0, 0 };
168:
169: if (!t || !TASK_ROOT(t) || !ROOT_DATA(t->task_root) || !ROOT_DATLEN(t->task_root))
170: return (void*) -1;
171: else
172: io = ROOT_DATA(t->task_root);
173:
174: if (FD_ISSET(TASK_FD(t), &io->rfd))
175: return NULL;
176: else
177: FD_SET(TASK_FD(t), &io->rfd);
178:
179: #ifdef __NetBSD__
180: EV_SET(&chg[0], TASK_FD(t), EVFILT_READ, EV_ADD, 0, 0, (intptr_t) TASK_FD(t));
181: #else
182: EV_SET(&chg[0], TASK_FD(t), EVFILT_READ, EV_ADD, 0, 0, (void*) TASK_FD(t));
183: #endif
184: if (kevent(TASK_ROOT(t)->root_kq, chg, 1, NULL, 0, &timeout) == -1) {
185: if (TASK_ROOT(t)->root_hooks.hook_exec.exception)
186: TASK_ROOT(t)->root_hooks.hook_exec.exception(TASK_ROOT(t), NULL);
187: else
188: LOGERR;
189: return (void*) -1;
190: }
191:
192: return NULL;
193: }
194:
195: /*
196: * sched_hook_write() - Default WRITE hook
197: * @task = current task
198: * @arg = unused
199: * return: <0 errors and 0 ok
200: */
201: void *
202: sched_hook_write(void *task, void *arg __unused)
203: {
204: struct sched_IO *io;
205: sched_task_t *t = task;
206: struct kevent chg[1];
207: struct timespec timeout = { 0, 0 };
208:
209: if (!t || !TASK_ROOT(t) || !ROOT_DATA(t->task_root) || !ROOT_DATLEN(t->task_root))
210: return (void*) -1;
211: else
212: io = ROOT_DATA(t->task_root);
213:
214: if (FD_ISSET(TASK_FD(t), &io->wfd))
215: return NULL;
216: else
217: FD_SET(TASK_FD(t), &io->wfd);
218:
219: #ifdef __NetBSD__
220: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_ADD, 0, 0, (intptr_t) TASK_FD(t));
221: #else
222: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_ADD, 0, 0, (void*) TASK_FD(t));
223: #endif
224: if (kevent(TASK_ROOT(t)->root_kq, chg, 1, NULL, 0, &timeout) == -1) {
225: if (TASK_ROOT(t)->root_hooks.hook_exec.exception)
226: TASK_ROOT(t)->root_hooks.hook_exec.exception(TASK_ROOT(t), NULL);
227: else
228: LOGERR;
229: return (void*) -1;
230: }
231:
232: return NULL;
233: }
234:
235: /*
236: * sched_hook_fetch() - Default FETCH hook
237: * @root = root task
238: * @arg = unused
239: * return: NULL error or !=NULL fetched task
240: */
241: void *
242: sched_hook_fetch(void *root, void *arg __unused)
243: {
244: struct sched_IO *io;
245: sched_root_task_t *r = root;
246: sched_task_t *task;
247: struct timespec now, m, mtmp;
248: struct timespec *timeout;
249: struct kevent evt[1], res[KQ_EVENTS];
250: register int i;
251: int en;
252:
253: if (!r || !ROOT_DATA(r) || !ROOT_DATLEN(r))
254: return NULL;
255:
256: /* get new task by queue priority */
257: retry:
258: while ((task = TAILQ_FIRST(&r->root_event))) {
259: #ifdef HAVE_LIBPTHREAD
260: pthread_mutex_lock(&r->root_mtx[taskEVENT]);
261: #endif
262: TAILQ_REMOVE(&r->root_event, task, task_node);
263: #ifdef HAVE_LIBPTHREAD
264: pthread_mutex_unlock(&r->root_mtx[taskEVENT]);
265: #endif
266: task->task_type = taskUNUSE;
267: #ifdef HAVE_LIBPTHREAD
268: pthread_mutex_lock(&r->root_mtx[taskUNUSE]);
269: #endif
270: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
271: #ifdef HAVE_LIBPTHREAD
272: pthread_mutex_unlock(&r->root_mtx[taskUNUSE]);
273: #endif
274: return task;
275: }
276: while ((task = TAILQ_FIRST(&r->root_ready))) {
277: #ifdef HAVE_LIBPTHREAD
278: pthread_mutex_lock(&r->root_mtx[taskREADY]);
279: #endif
280: TAILQ_REMOVE(&r->root_ready, task, task_node);
281: #ifdef HAVE_LIBPTHREAD
282: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
283: #endif
284: task->task_type = taskUNUSE;
285: #ifdef HAVE_LIBPTHREAD
286: pthread_mutex_lock(&r->root_mtx[taskUNUSE]);
287: #endif
288: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
289: #ifdef HAVE_LIBPTHREAD
290: pthread_mutex_unlock(&r->root_mtx[taskUNUSE]);
291: #endif
292: return task;
293: }
294:
295: #ifdef TIMER_WITHOUT_SORT
296: clock_gettime(CLOCK_MONOTONIC, &now);
297:
298: timespecclear(&r->root_wait);
299: TAILQ_FOREACH(task, &r->root_timer, task_node) {
300: if (!timespecisset(&r->root_wait))
301: r->root_wait = TASK_TS(task);
302: else if (timespeccmp(&TASK_TS(task), &r->root_wait, -) < 0)
303: r->root_wait = TASK_TS(task);
304: }
305:
306: if (TAILQ_FIRST(&r->root_timer)) {
307: m = r->root_wait;
308: timespecsub(&m, &now, &mtmp);
309: r->root_wait = mtmp;
310: } else {
311: /* set wait INFTIM */
312: r->root_wait.tv_sec = r->root_wait.tv_usec = -1;
313: }
314: #else
315: if (!TAILQ_FIRST(&r->root_eventlo) && (task = TAILQ_FIRST(&r->root_timer))) {
316: clock_gettime(CLOCK_MONOTONIC, &now);
317:
318: m = TASK_TS(task);
319: timespecsub(&m, &now, &mtmp);
320: r->root_wait = mtmp;
321: } else {
322: /* set wait INFTIM */
323: r->root_wait.tv_sec = r->root_wait.tv_nsec = -1;
324: }
325: #endif
326: /* if present member of eventLo, set NOWAIT */
327: if (TAILQ_FIRST(&r->root_eventlo))
328: timespecclear(&r->root_wait);
329:
330: if (r->root_wait.tv_sec != -1 && r->root_wait.tv_nsec != -1)
331: timeout = &r->root_wait;
332: else /* wait INFTIM */
333: timeout = NULL;
334: if ((en = kevent(r->root_kq, NULL, 0, res, KQ_EVENTS, timeout)) == -1) {
335: if (r->root_hooks.hook_exec.exception) {
336: if (r->root_hooks.hook_exec.exception(r, NULL))
337: return NULL;
338: } else
339: LOGERR;
340: #ifdef NDEBUG
341: /* kevent no exit by error, if non-debug version */
342: goto retry;
343: #else
344: /* diagnostic exit from scheduler if kevent error occur */
345: return NULL;
346: #endif
347: }
348:
349: now.tv_sec = now.tv_nsec = 0;
350: /* Go and catch the cat into pipes ... */
351: for (i = 0; i < en; i++) {
352: memcpy(evt, &res[i], sizeof evt);
353: evt->flags = EV_DELETE;
354: /* Put read/write task to ready queue */
355: switch (res[i].filter) {
356: case EVFILT_READ:
357: TAILQ_FOREACH(task, &r->root_read, task_node) {
358: if (TASK_FD(task) != ((intptr_t) res[i].udata))
359: continue;
360: /* remove read handle */
361: io = ROOT_DATA(task->task_root);
362: FD_CLR(TASK_FD(task), &io->rfd);
363:
364: #ifdef HAVE_LIBPTHREAD
365: pthread_mutex_lock(&r->root_mtx[taskREAD]);
366: #endif
367: TAILQ_REMOVE(&r->root_read, task, task_node);
368: #ifdef HAVE_LIBPTHREAD
369: pthread_mutex_unlock(&r->root_mtx[taskREAD]);
370: #endif
371: if (r->root_hooks.hook_exec.exception && res[i].flags & EV_EOF) {
372: if (r->root_hooks.hook_exec.exception(r, (void*) EV_EOF)) {
373: task->task_type = taskUNUSE;
374: #ifdef HAVE_LIBPTHREAD
375: pthread_mutex_lock(&r->root_mtx[taskUNUSE]);
376: #endif
377: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
378: #ifdef HAVE_LIBPTHREAD
379: pthread_mutex_unlock(&r->root_mtx[taskUNUSE]);
380: #endif
381: } else {
382: task->task_type = taskREADY;
383: #ifdef HAVE_LIBPTHREAD
384: pthread_mutex_lock(&r->root_mtx[taskREADY]);
385: #endif
386: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
387: #ifdef HAVE_LIBPTHREAD
388: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
389: #endif
390: }
391: } else {
392: task->task_type = taskREADY;
393: #ifdef HAVE_LIBPTHREAD
394: pthread_mutex_lock(&r->root_mtx[taskREADY]);
395: #endif
396: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
397: #ifdef HAVE_LIBPTHREAD
398: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
399: #endif
400: }
401: break;
402: }
403: break;
404: case EVFILT_WRITE:
405: TAILQ_FOREACH(task, &r->root_write, task_node) {
406: if (TASK_FD(task) != ((intptr_t) res[i].udata))
407: continue;
408: /* remove write handle */
409: io = ROOT_DATA(task->task_root);
410: FD_CLR(TASK_FD(task), &io->wfd);
411:
412: #ifdef HAVE_LIBPTHREAD
413: pthread_mutex_lock(&r->root_mtx[taskWRITE]);
414: #endif
415: TAILQ_REMOVE(&r->root_write, task, task_node);
416: #ifdef HAVE_LIBPTHREAD
417: pthread_mutex_unlock(&r->root_mtx[taskWRITE]);
418: #endif
419: if (r->root_hooks.hook_exec.exception && res[i].flags & EV_EOF) {
420: if (r->root_hooks.hook_exec.exception(r, (void*) EV_EOF)) {
421: task->task_type = taskUNUSE;
422: #ifdef HAVE_LIBPTHREAD
423: pthread_mutex_lock(&r->root_mtx[taskUNUSE]);
424: #endif
425: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
426: #ifdef HAVE_LIBPTHREAD
427: pthread_mutex_unlock(&r->root_mtx[taskUNUSE]);
428: #endif
429: } else {
430: task->task_type = taskREADY;
431: #ifdef HAVE_LIBPTHREAD
432: pthread_mutex_lock(&r->root_mtx[taskREADY]);
433: #endif
434: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
435: #ifdef HAVE_LIBPTHREAD
436: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
437: #endif
438: }
439: } else {
440: task->task_type = taskREADY;
441: #ifdef HAVE_LIBPTHREAD
442: pthread_mutex_lock(&r->root_mtx[taskREADY]);
443: #endif
444: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
445: #ifdef HAVE_LIBPTHREAD
446: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
447: #endif
448: }
449: break;
450: }
451: break;
452: }
453: if (kevent(r->root_kq, evt, 1, NULL, 0, &now) == -1) {
454: if (r->root_hooks.hook_exec.exception) {
455: if (r->root_hooks.hook_exec.exception(r, NULL))
456: return NULL;
457: } else
458: LOGERR;
459: }
460: }
461:
462: /* timer update & put in ready queue */
463: clock_gettime(CLOCK_MONOTONIC, &now);
464:
465: TAILQ_FOREACH(task, &r->root_timer, task_node)
466: if (timespeccmp(&now, &TASK_TS(task), -) >= 0) {
467: #ifdef HAVE_LIBPTHREAD
468: pthread_mutex_lock(&r->root_mtx[taskTIMER]);
469: #endif
470: TAILQ_REMOVE(&r->root_timer, task, task_node);
471: #ifdef HAVE_LIBPTHREAD
472: pthread_mutex_unlock(&r->root_mtx[taskTIMER]);
473: #endif
474: task->task_type = taskREADY;
475: #ifdef HAVE_LIBPTHREAD
476: pthread_mutex_lock(&r->root_mtx[taskREADY]);
477: #endif
478: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
479: #ifdef HAVE_LIBPTHREAD
480: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
481: #endif
482: }
483:
484: /* put eventlo priority task to ready queue, if there is no ready task or
485: reach max missed fetch-rotate */
486: if ((task = TAILQ_FIRST(&r->root_eventlo))) {
487: if (!TAILQ_FIRST(&r->root_ready) || r->root_eventlo_miss > MAX_EVENTLO_MISS) {
488: r->root_eventlo_miss = 0;
489:
490: #ifdef HAVE_LIBPTHREAD
491: pthread_mutex_lock(&r->root_mtx[taskEVENTLO]);
492: #endif
493: TAILQ_REMOVE(&r->root_eventlo, task, task_node);
494: #ifdef HAVE_LIBPTHREAD
495: pthread_mutex_unlock(&r->root_mtx[taskEVENTLO]);
496: #endif
497: task->task_type = taskREADY;
498: #ifdef HAVE_LIBPTHREAD
499: pthread_mutex_lock(&r->root_mtx[taskREADY]);
500: #endif
501: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
502: #ifdef HAVE_LIBPTHREAD
503: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
504: #endif
505: } else
506: r->root_eventlo_miss++;
507: } else
508: r->root_eventlo_miss = 0;
509:
510: /* OK, lets get ready task !!! */
511: if (!(task = TAILQ_FIRST(&r->root_ready)))
512: goto retry;
513: #ifdef HAVE_LIBPTHREAD
514: pthread_mutex_lock(&r->root_mtx[taskREADY]);
515: #endif
516: TAILQ_REMOVE(&r->root_ready, task, task_node);
517: #ifdef HAVE_LIBPTHREAD
518: pthread_mutex_unlock(&r->root_mtx[taskREADY]);
519: #endif
520: task->task_type = taskUNUSE;
521: #ifdef HAVE_LIBPTHREAD
522: pthread_mutex_lock(&r->root_mtx[taskUNUSE]);
523: #endif
524: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
525: #ifdef HAVE_LIBPTHREAD
526: pthread_mutex_unlock(&r->root_mtx[taskUNUSE]);
527: #endif
528: return task;
529: }
530:
531: /*
532: * sched_hook_exception() - Default EXCEPTION hook
533: * @root = root task
534: * @arg = custom handling: if arg == EV_EOF or other value; default: arg == NULL log errno
535: * return: <0 errors and 0 ok
536: */
537: void *
538: sched_hook_exception(void *root, void *arg)
539: {
540: sched_root_task_t *r = root;
541:
542: if (!r || !ROOT_DATA(r) || !ROOT_DATLEN(r))
543: return NULL;
544:
545: /* custom exception handling ... */
546: if (arg) {
547: if (arg == (void*) EV_EOF)
548: return NULL;
549: return (void*) -1; /* raise scheduler error!!! */
550: }
551:
552: /* if error hook exists */
553: if (r->root_hooks.hook_root.error)
554: return (r->root_hooks.hook_root.error(root, (void*) ((intptr_t) errno)));
555:
556: /* default case! */
557: LOGERR;
558: return NULL;
559: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to hooks.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