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