Annotation of libaitsched/src/hooks.c, revision 1.2
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.2 ! misho 6: * $Id: hooks.c,v 1.1.1.1.2.8 2011/09/30 08:13:41 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:
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];
1.2 ! misho 122: struct timespec timeout = { 0, 0 };
1.1 misho 123:
124: if (!t || !t->task_root || !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 (t->task_type) {
130: case taskREAD:
1.2 ! misho 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
1.1 misho 136: kevent(t->task_root->root_kq, chg, 1, NULL, 0, &timeout);
137: FD_CLR(TASK_FD(t), &io->rfd);
138: break;
139: case taskWRITE:
1.2 ! misho 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
1.1 misho 145: kevent(t->task_root->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];
1.2 ! misho 167: struct timespec timeout = { 0, 0 };
1.1 misho 168:
169: if (!t || !t->task_root || !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:
1.2 ! misho 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
1.1 misho 184: if (kevent(t->task_root->root_kq, chg, 1, NULL, 0, &timeout) == -1) {
185: LOGERR;
186: return (void*) -1;
187: }
188:
189: return NULL;
190: }
191:
192: /*
193: * sched_hook_write() - Default WRITE hook
194: * @task = current task
195: * @arg = unused
196: * return: <0 errors and 0 ok
197: */
198: void *
199: sched_hook_write(void *task, void *arg __unused)
200: {
201: struct sched_IO *io;
202: sched_task_t *t = task;
203: struct kevent chg[1];
1.2 ! misho 204: struct timespec timeout = { 0, 0 };
1.1 misho 205:
206: if (!t || !t->task_root || !ROOT_DATA(t->task_root) || !ROOT_DATLEN(t->task_root))
207: return (void*) -1;
208: else
209: io = ROOT_DATA(t->task_root);
210:
211: if (FD_ISSET(TASK_FD(t), &io->wfd))
212: return NULL;
213: else
214: FD_SET(TASK_FD(t), &io->wfd);
215:
1.2 ! misho 216: #ifdef __NetBSD__
! 217: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_ADD, 0, 0, (intptr_t) TASK_FD(t));
! 218: #else
! 219: EV_SET(&chg[0], TASK_FD(t), EVFILT_WRITE, EV_ADD, 0, 0, (void*) TASK_FD(t));
! 220: #endif
1.1 misho 221: if (kevent(t->task_root->root_kq, chg, 1, NULL, 0, &timeout) == -1) {
222: LOGERR;
223: return (void*) -1;
224: }
225:
226: return NULL;
227: }
228:
229: /*
230: * sched_hook_fetch() - Default FETCH hook
231: * @root = root task
232: * @arg = unused
233: * return: NULL error or !=NULL fetched task
234: */
235: void *
236: sched_hook_fetch(void *root, void *arg __unused)
237: {
238: struct sched_IO *io;
239: sched_root_task_t *r = root;
240: sched_task_t *task;
241: struct timeval now, m, mtmp;
242: struct timespec nw, *timeout;
243: struct kevent evt[1], res[KQ_EVENTS];
244: register int i;
245: int en;
246:
247: if (!r || !ROOT_DATA(r) || !ROOT_DATLEN(r))
248: return NULL;
249:
250: /* get new task by queue priority */
251: retry:
252: while ((task = TAILQ_FIRST(&r->root_event))) {
253: TAILQ_REMOVE(&r->root_event, task, task_node);
254: task->task_type = taskUNUSE;
255: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
256: return task;
257: }
258: while ((task = TAILQ_FIRST(&r->root_ready))) {
259: TAILQ_REMOVE(&r->root_ready, task, task_node);
260: task->task_type = taskUNUSE;
261: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
262: return task;
263: }
264:
265: #ifdef TIMER_WITHOUT_SORT
266: clock_gettime(CLOCK_MONOTONIC, &nw);
267: now.tv_sec = nw.tv_sec;
268: now.tv_usec = nw.tv_nsec / 1000;
269:
270: timerclear(&r->root_wait);
271: TAILQ_FOREACH(task, &r->root_timer, task_node) {
272: if (!timerisset(&r->root_wait))
273: r->root_wait = TASK_TV(task);
274: else if (timercmp(&TASK_TV(task), &r->root_wait, -) < 0)
275: r->root_wait = TASK_TV(task);
276: }
277:
278: if (TAILQ_FIRST(&r->root_timer)) {
279: m = r->root_wait;
280: timersub(&m, &now, &mtmp);
281: r->root_wait = mtmp;
282: } else {
283: /* set wait INFTIM */
284: r->root_wait.tv_sec = r->root_wait.tv_usec = -1;
285: }
286: #else
287: if (!TAILQ_FIRST(&r->root_eventlo) && (task = TAILQ_FIRST(&r->root_timer))) {
288: clock_gettime(CLOCK_MONOTONIC, &nw);
289: now.tv_sec = nw.tv_sec;
290: now.tv_usec = nw.tv_nsec / 1000;
291:
292: m = TASK_TV(task);
293: timersub(&m, &now, &mtmp);
294: r->root_wait = mtmp;
295: } else {
296: /* set wait INFTIM */
297: r->root_wait.tv_sec = r->root_wait.tv_usec = -1;
298: }
299: #endif
300: /* if present member of eventLo, set NOWAIT */
301: if (TAILQ_FIRST(&r->root_eventlo))
302: timerclear(&r->root_wait);
303:
304: if (r->root_wait.tv_sec != -1 && r->root_wait.tv_usec != -1) {
305: nw.tv_sec = r->root_wait.tv_sec;
306: nw.tv_nsec = r->root_wait.tv_usec * 1000;
307: timeout = &nw;
308: } else /* wait INFTIM */
309: timeout = NULL;
310: if ((en = kevent(r->root_kq, NULL, 0, res, KQ_EVENTS, timeout)) == -1) {
311: LOGERR;
1.2 ! misho 312: #ifdef NDEBUG
! 313: /* kevent no exit by error, if non-debug version */
1.1 misho 314: goto retry;
1.2 ! misho 315: #else
! 316: /* diagnostic exit from scheduler if kevent error occur */
! 317: return NULL;
! 318: #endif
1.1 misho 319: }
320:
1.2 ! misho 321: nw.tv_sec = nw.tv_nsec = 0;
1.1 misho 322: /* Go and catch the cat into pipes ... */
323: for (i = 0; i < en; i++) {
324: memcpy(evt, &res[i], sizeof evt);
325: evt->flags = EV_DELETE;
326: /* Put read/write task to ready queue */
327: switch (res[i].filter) {
328: case EVFILT_READ:
329: TAILQ_FOREACH(task, &r->root_read, task_node) {
1.2 ! misho 330: if (TASK_FD(task) != ((int) res[i].udata))
1.1 misho 331: continue;
332: /* remove read handle */
333: io = ROOT_DATA(task->task_root);
334: FD_CLR(TASK_FD(task), &io->rfd);
335:
336: TAILQ_REMOVE(&r->root_read, task, task_node);
1.2 ! misho 337: /* if (res[i].flags & EV_EOF) {
! 338: task->task_type = taskUNUSE;
! 339: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
! 340: } else { */
! 341: task->task_type = taskREADY;
! 342: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
! 343: /* } */
1.1 misho 344: break;
345: }
346: break;
347: case EVFILT_WRITE:
348: TAILQ_FOREACH(task, &r->root_write, task_node) {
1.2 ! misho 349: if (TASK_FD(task) != ((int) res[i].udata))
1.1 misho 350: continue;
351: /* remove write handle */
352: io = ROOT_DATA(task->task_root);
353: FD_CLR(TASK_FD(task), &io->wfd);
354:
355: TAILQ_REMOVE(&r->root_write, task, task_node);
1.2 ! misho 356: /* if (res[i].flags & EV_EOF) {
! 357: task->task_type = taskUNUSE;
! 358: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
! 359: } else { */
! 360: task->task_type = taskREADY;
! 361: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
! 362: /* } */
1.1 misho 363: break;
364: }
365: break;
366: }
367: if (kevent(r->root_kq, evt, 1, NULL, 0, &nw) == -1)
368: LOGERR;
369: }
370:
1.2 ! misho 371: /* timer update & put in ready queue */
1.1 misho 372: clock_gettime(CLOCK_MONOTONIC, &nw);
373: now.tv_sec = nw.tv_sec;
374: now.tv_usec = nw.tv_nsec / 1000;
375:
376: TAILQ_FOREACH(task, &r->root_timer, task_node)
377: if (timercmp(&now, &TASK_TV(task), -) >= 0) {
378: TAILQ_REMOVE(&r->root_timer, task, task_node);
379: task->task_type = taskREADY;
380: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
381: }
382:
383: /* put eventlo priority task to ready queue, if there is no ready task or
384: reach max missed fetch-rotate */
385: if ((task = TAILQ_FIRST(&r->root_eventlo))) {
386: if (!TAILQ_FIRST(&r->root_ready) || r->root_eventlo_miss > MAX_EVENTLO_MISS) {
387: r->root_eventlo_miss = 0;
388:
389: TAILQ_REMOVE(&r->root_eventlo, task, task_node);
390: task->task_type = taskREADY;
391: TAILQ_INSERT_TAIL(&r->root_ready, task, task_node);
392: } else
393: r->root_eventlo_miss++;
394: } else
395: r->root_eventlo_miss = 0;
396:
397: /* OK, lets get ready task !!! */
398: if (!(task = TAILQ_FIRST(&r->root_ready)))
399: goto retry;
400: TAILQ_REMOVE(&r->root_ready, task, task_node);
401: task->task_type = taskUNUSE;
402: TAILQ_INSERT_TAIL(&r->root_unuse, task, task_node);
403: return task;
404: }
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