|
version 1.39, 2022/12/20 22:40:32
|
version 1.43, 2026/11/13 10:07:22
|
|
Line 12 terms:
|
Line 12 terms:
|
| All of the documentation and software included in the ELWIX and AITNET |
All of the documentation and software included in the ELWIX and AITNET |
| Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org> |
Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org> |
| |
|
| Copyright 2004 - 2022 | Copyright 2004 - 2026 |
| by Michael Pounov <misho@elwix.org>. All rights reserved. |
by Michael Pounov <misho@elwix.org>. All rights reserved. |
| |
|
| Redistribution and use in source and binary forms, with or without |
Redistribution and use in source and binary forms, with or without |
|
Line 47 SUCH DAMAGE.
|
Line 47 SUCH DAMAGE.
|
| #include "hooks.h" |
#include "hooks.h" |
| |
|
| |
|
| static inline void |
|
| transit_task2ready(sched_task_t * __restrict t, sched_queue_t * __restrict q) |
|
| { |
|
| remove_task_from(t, q); |
|
| |
|
| t->task_type = taskREADY; |
|
| insert_task_to(t, &(TASK_ROOT(t))->root_ready); |
|
| } |
|
| |
|
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| static void * |
static void * |
| _sched_threadWrapper(sched_task_t *t) |
_sched_threadWrapper(sched_task_t *t) |
|
Line 158 sched_hook_init(void *root, void *arg __unused)
|
Line 149 sched_hook_init(void *root, void *arg __unused)
|
| r->root_kq ^= r->root_kq; |
r->root_kq ^= r->root_kq; |
| #endif |
#endif |
| |
|
| FD_ZERO(&r->root_fds[0]); | SCHED_FD_ZERO(&r->root_fds[0]); |
| FD_ZERO(&r->root_fds[1]); | SCHED_FD_ZERO(&r->root_fds[1]); |
| FD_ZERO(&r->root_fds[2]); | SCHED_FD_ZERO(&r->root_fds[2]); |
| |
|
| return NULL; |
return NULL; |
| } |
} |
|
Line 189 sched_hook_fini(void *root, void *arg __unused)
|
Line 180 sched_hook_fini(void *root, void *arg __unused)
|
| r->root_kq ^= r->root_kq; |
r->root_kq ^= r->root_kq; |
| #endif |
#endif |
| |
|
| FD_ZERO(&r->root_fds[2]); | SCHED_FD_ZERO(&r->root_fds[2]); |
| FD_ZERO(&r->root_fds[1]); | SCHED_FD_ZERO(&r->root_fds[1]); |
| FD_ZERO(&r->root_fds[0]); | SCHED_FD_ZERO(&r->root_fds[0]); |
| |
|
| return NULL; |
return NULL; |
| } |
} |
|
Line 247 sched_hook_cancel(void *task, void *arg __unused)
|
Line 238 sched_hook_cancel(void *task, void *arg __unused)
|
| #elif SUP_ENABLE == EP_SUPPORT |
#elif SUP_ENABLE == EP_SUPPORT |
| ee.data.fd = TASK_FD(t); |
ee.data.fd = TASK_FD(t); |
| ee.events ^= ee.events; |
ee.events ^= ee.events; |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[1])) | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[1])) |
| ee.events |= EPOLLOUT; |
ee.events |= EPOLLOUT; |
| |
|
| if (flg < 2) { |
if (flg < 2) { |
| FD_CLR(TASK_FD(t), &r->root_fds[0]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[0]); |
| FD_CLR(TASK_FD(t), &r->root_fds[2]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[2]); |
| } else { |
} else { |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[0])) | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[0])) |
| ee.events |= EPOLLIN; |
ee.events |= EPOLLIN; |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[2])) | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[2])) |
| ee.events |= EPOLLPRI; |
ee.events |= EPOLLPRI; |
| } |
} |
| #else |
#else |
| if (flg < 2) { |
if (flg < 2) { |
| FD_CLR(TASK_FD(t), &r->root_fds[0]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[0]); |
| FD_CLR(TASK_FD(t), &r->root_fds[2]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[2]); |
| |
|
| /* optimize select */ |
/* optimize select */ |
| for (i = r->root_kq - 1; i >= 0; i--) |
for (i = r->root_kq - 1; i >= 0; i--) |
| if (FD_ISSET(i, &r->root_fds[0]) || | if (SCHED_FD_ISSET(i, &r->root_fds[0]) || |
| FD_ISSET(i, &r->root_fds[1]) || | SCHED_FD_ISSET(i, &r->root_fds[1]) || |
| FD_ISSET(i, &r->root_fds[2])) | SCHED_FD_ISSET(i, &r->root_fds[2])) |
| break; |
break; |
| r->root_kq = i + 1; |
r->root_kq = i + 1; |
| } |
} |
|
Line 290 sched_hook_cancel(void *task, void *arg __unused)
|
Line 281 sched_hook_cancel(void *task, void *arg __unused)
|
| #elif SUP_ENABLE == EP_SUPPORT |
#elif SUP_ENABLE == EP_SUPPORT |
| ee.data.fd = TASK_FD(t); |
ee.data.fd = TASK_FD(t); |
| ee.events ^= ee.events; |
ee.events ^= ee.events; |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[0])) | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[0])) |
| ee.events |= EPOLLIN; |
ee.events |= EPOLLIN; |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[2])) | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[2])) |
| ee.events |= EPOLLPRI; |
ee.events |= EPOLLPRI; |
| |
|
| if (flg < 2) |
if (flg < 2) |
| FD_CLR(TASK_FD(t), &r->root_fds[1]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[1]); |
| else |
else |
| ee.events |= EPOLLOUT; |
ee.events |= EPOLLOUT; |
| #else |
#else |
| if (flg < 2) { |
if (flg < 2) { |
| FD_CLR(TASK_FD(t), &r->root_fds[1]); | SCHED_FD_CLR(TASK_FD(t), &r->root_fds[1]); |
| |
|
| /* optimize select */ |
/* optimize select */ |
| for (i = r->root_kq - 1; i >= 0; i--) |
for (i = r->root_kq - 1; i >= 0; i--) |
| if (FD_ISSET(i, &r->root_fds[0]) || | if (SCHED_FD_ISSET(i, &r->root_fds[0]) || |
| FD_ISSET(i, &r->root_fds[1]) || | SCHED_FD_ISSET(i, &r->root_fds[1]) || |
| FD_ISSET(i, &r->root_fds[2])) | SCHED_FD_ISSET(i, &r->root_fds[2])) |
| break; |
break; |
| r->root_kq = i + 1; |
r->root_kq = i + 1; |
| } |
} |
|
Line 359 sched_hook_cancel(void *task, void *arg __unused)
|
Line 350 sched_hook_cancel(void *task, void *arg __unused)
|
| #endif |
#endif |
| break; |
break; |
| case taskSIGNAL: |
case taskSIGNAL: |
| #if SUP_ENABLE == KQ_SUPPORT |
|
| /* check for multi subscribers */ |
/* check for multi subscribers */ |
| TAILQ_FOREACH_SAFE(tt, &r->root_signal, task_node, tmp) |
TAILQ_FOREACH_SAFE(tt, &r->root_signal, task_node, tmp) |
| if (TASK_VAL(tt) == TASK_VAL(t)) |
if (TASK_VAL(tt) == TASK_VAL(t)) |
| flg++; |
flg++; |
| |
#if SUP_ENABLE == KQ_SUPPORT |
| #ifdef __NetBSD__ |
#ifdef __NetBSD__ |
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, flg < 2 ? EV_DELETE : 0, |
EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, flg < 2 ? EV_DELETE : 0, |
| 0, 0, (intptr_t) TASK_VAL(t)); |
0, 0, (intptr_t) TASK_VAL(t)); |
|
Line 371 sched_hook_cancel(void *task, void *arg __unused)
|
Line 362 sched_hook_cancel(void *task, void *arg __unused)
|
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, flg < 2 ? EV_DELETE : 0, |
EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, flg < 2 ? EV_DELETE : 0, |
| 0, 0, (void*) TASK_VAL(t)); |
0, 0, (void*) TASK_VAL(t)); |
| #endif |
#endif |
| /* restore signal */ |
|
| if (flg < 2) |
|
| signal(TASK_VAL(t), SIG_DFL); |
|
| #endif |
#endif |
| |
if (flg < 2) { |
| |
pthread_mutex_lock(&TASK_ROOT(t)->root_sigmtx); |
| |
sigdelset(&TASK_ROOT(t)->root_sigset, TASK_VAL(t)); |
| |
pthread_mutex_unlock(&TASK_ROOT(t)->root_sigmtx); |
| |
} |
| break; |
break; |
| #ifdef AIO_SUPPORT |
#ifdef AIO_SUPPORT |
| case taskAIO: |
case taskAIO: |
|
Line 571 sched_hook_read(void *task, void *arg)
|
Line 564 sched_hook_read(void *task, void *arg)
|
| mask = EPOLLIN | EPOLLPRI; |
mask = EPOLLIN | EPOLLPRI; |
| ee.data.fd = TASK_FD(t); |
ee.data.fd = TASK_FD(t); |
| ee.events = mask; |
ee.events = mask; |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[2])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[2])) { |
| flg |= 4; |
flg |= 4; |
| ee.events |= EPOLLPRI; |
ee.events |= EPOLLPRI; |
| } |
} |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[0])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[0])) { |
| flg |= 1; |
flg |= 1; |
| ee.events |= EPOLLIN; |
ee.events |= EPOLLIN; |
| } |
} |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[1])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[1])) { |
| flg |= 2; |
flg |= 2; |
| ee.events |= EPOLLOUT; |
ee.events |= EPOLLOUT; |
| } |
} |
|
Line 592 sched_hook_read(void *task, void *arg)
|
Line 585 sched_hook_read(void *task, void *arg)
|
| return (void*) -1; |
return (void*) -1; |
| } else { |
} else { |
| if (mask & EPOLLIN) |
if (mask & EPOLLIN) |
| FD_SET(TASK_FD(t), &r->root_fds[0]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[0]); |
| if (mask & EPOLLPRI) |
if (mask & EPOLLPRI) |
| FD_SET(TASK_FD(t), &r->root_fds[2]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[2]); |
| } |
} |
| #else |
#else |
| if (!mask) { |
if (!mask) { |
| FD_SET(TASK_FD(t), &r->root_fds[0]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[0]); |
| FD_SET(TASK_FD(t), &r->root_fds[2]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[2]); |
| } else { |
} else { |
| if (mask & 1) |
if (mask & 1) |
| FD_SET(TASK_FD(t), &r->root_fds[0]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[0]); |
| if (mask & 2) |
if (mask & 2) |
| FD_SET(TASK_FD(t), &r->root_fds[2]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[2]); |
| } |
} |
| |
|
| if (TASK_FD(t) >= r->root_kq) |
if (TASK_FD(t) >= r->root_kq) |
|
Line 661 sched_hook_write(void *task, void *arg)
|
Line 654 sched_hook_write(void *task, void *arg)
|
| ee.data.fd = TASK_FD(t); |
ee.data.fd = TASK_FD(t); |
| ee.events = mask; |
ee.events = mask; |
| |
|
| if (FD_ISSET(TASK_FD(t), &r->root_fds[2])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[2])) { |
| flg |= 4; |
flg |= 4; |
| ee.events |= EPOLLPRI; |
ee.events |= EPOLLPRI; |
| } |
} |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[0])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[0])) { |
| flg |= 1; |
flg |= 1; |
| ee.events |= EPOLLIN; |
ee.events |= EPOLLIN; |
| } |
} |
| if (FD_ISSET(TASK_FD(t), &r->root_fds[1])) { | if (SCHED_FD_ISSET(TASK_FD(t), &r->root_fds[1])) { |
| flg |= 2; |
flg |= 2; |
| ee.events |= EPOLLOUT; |
ee.events |= EPOLLOUT; |
| } |
} |
|
Line 682 sched_hook_write(void *task, void *arg)
|
Line 675 sched_hook_write(void *task, void *arg)
|
| return (void*) -1; |
return (void*) -1; |
| } else |
} else |
| if (mask & EPOLLOUT) |
if (mask & EPOLLOUT) |
| FD_SET(TASK_FD(t), &r->root_fds[1]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[1]); |
| #else |
#else |
| if (!mask) |
if (!mask) |
| FD_SET(TASK_FD(t), &r->root_fds[1]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[1]); |
| else |
else |
| if (mask & 1) |
if (mask & 1) |
| FD_SET(TASK_FD(t), &r->root_fds[1]); | SCHED_FD_SET(TASK_FD(t), &r->root_fds[1]); |
| |
|
| if (TASK_FD(t) >= r->root_kq) |
if (TASK_FD(t) >= r->root_kq) |
| r->root_kq = TASK_FD(t) + 1; |
r->root_kq = TASK_FD(t) + 1; |
|
Line 823 sched_hook_proc(void *task, void *arg __unused)
|
Line 816 sched_hook_proc(void *task, void *arg __unused)
|
| void * |
void * |
| sched_hook_signal(void *task, void *arg __unused) |
sched_hook_signal(void *task, void *arg __unused) |
| { |
{ |
| #if SUP_ENABLE == KQ_SUPPORT |
|
| sched_task_t *t = task; |
sched_task_t *t = task; |
| |
#if SUP_ENABLE == KQ_SUPPORT |
| struct kevent chg[1]; |
struct kevent chg[1]; |
| struct timespec timeout = { 0, 0 }; |
struct timespec timeout = { 0, 0 }; |
| |
#endif |
| |
|
| if (!t || !TASK_ROOT(t)) |
if (!t || !TASK_ROOT(t)) |
| return (void*) -1; |
return (void*) -1; |
| |
|
| /* ignore signal */ | #if SUP_ENABLE == KQ_SUPPORT |
| signal(TASK_VAL(t), SIG_IGN); | |
| |
| #ifdef __NetBSD__ |
#ifdef __NetBSD__ |
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_ADD | EV_CLEAR, 0, 0, (intptr_t) TASK_VAL(t)); |
EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_ADD | EV_CLEAR, 0, 0, (intptr_t) TASK_VAL(t)); |
| #else |
#else |
|
Line 847 sched_hook_signal(void *task, void *arg __unused)
|
Line 839 sched_hook_signal(void *task, void *arg __unused)
|
| return (void*) -1; |
return (void*) -1; |
| } |
} |
| #endif |
#endif |
| |
|
| |
pthread_mutex_lock(&TASK_ROOT(t)->root_sigmtx); |
| |
sigaddset(&TASK_ROOT(t)->root_sigset, TASK_VAL(t)); |
| |
pthread_mutex_unlock(&TASK_ROOT(t)->root_sigmtx); |
| |
|
| return NULL; |
return NULL; |
| } |
} |
| |
|
|
Line 1159 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
Line 1156 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
| insert_task_to(task, &r->root_ready); |
insert_task_to(task, &r->root_ready); |
| } |
} |
| |
|
| if (!(res[i].events & EPOLLOUT) && FD_ISSET(evt->data.fd, &r->root_fds[1])) { | if (!(res[i].events & EPOLLOUT) && SCHED_FD_ISSET(evt->data.fd, &r->root_fds[1])) { |
| evt->events |= EPOLLOUT; |
evt->events |= EPOLLOUT; |
| wflg = 42; |
wflg = 42; |
| } |
} |
| if (rflg > 1) { |
if (rflg > 1) { |
| if (FD_ISSET(evt->data.fd, &r->root_fds[0])) | if (SCHED_FD_ISSET(evt->data.fd, &r->root_fds[0])) |
| evt->events |= EPOLLIN; |
evt->events |= EPOLLIN; |
| if (FD_ISSET(evt->data.fd, &r->root_fds[2])) | if (SCHED_FD_ISSET(evt->data.fd, &r->root_fds[2])) |
| evt->events |= EPOLLPRI; |
evt->events |= EPOLLPRI; |
| } else { |
} else { |
| FD_CLR(evt->data.fd, &r->root_fds[0]); | SCHED_FD_CLR(evt->data.fd, &r->root_fds[0]); |
| FD_CLR(evt->data.fd, &r->root_fds[2]); | SCHED_FD_CLR(evt->data.fd, &r->root_fds[2]); |
| } |
} |
| } |
} |
| } |
} |
|
Line 1203 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
Line 1200 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
| insert_task_to(task, &r->root_ready); |
insert_task_to(task, &r->root_ready); |
| } |
} |
| |
|
| if (!(res[i].events & EPOLLIN) && FD_ISSET(evt->data.fd, &r->root_fds[0])) { | if (!(res[i].events & EPOLLIN) && SCHED_FD_ISSET(evt->data.fd, &r->root_fds[0])) { |
| evt->events |= EPOLLIN; |
evt->events |= EPOLLIN; |
| rflg = 42; |
rflg = 42; |
| } |
} |
| if (!(res[i].events & EPOLLPRI) && FD_ISSET(evt->data.fd, &r->root_fds[2])) { | if (!(res[i].events & EPOLLPRI) && SCHED_FD_ISSET(evt->data.fd, &r->root_fds[2])) { |
| evt->events |= EPOLLPRI; |
evt->events |= EPOLLPRI; |
| rflg = 42; |
rflg = 42; |
| } |
} |
| if (wflg > 1) |
if (wflg > 1) |
| evt->events |= EPOLLOUT; |
evt->events |= EPOLLOUT; |
| else |
else |
| FD_CLR(evt->data.fd, &r->root_fds[1]); | SCHED_FD_CLR(evt->data.fd, &r->root_fds[1]); |
| } |
} |
| } |
} |
| |
|
|
Line 1234 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
Line 1231 fetch_hook_epoll_proceed(int en, struct epoll_event *r
|
| |
|
| #if SUP_ENABLE == NO_SUPPORT |
#if SUP_ENABLE == NO_SUPPORT |
| static inline void |
static inline void |
| fetch_hook_select_proceed(int en, fd_set rfd, fd_set wfd, fd_set xfd, sched_root_task_t *r) | fetch_hook_select_proceed(int en, sched_fd_set rfd, sched_fd_set wfd, sched_fd_set xfd, sched_root_task_t *r) |
| { |
{ |
| register int i, rflg, wflg; |
register int i, rflg, wflg; |
| sched_task_t *t, *tmp, *task; |
sched_task_t *t, *tmp, *task; |
|
Line 1244 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
Line 1241 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
| return; |
return; |
| |
|
| for (i = 0; i < r->root_kq; i++) { |
for (i = 0; i < r->root_kq; i++) { |
| if (!FD_ISSET(i, &r->root_fds[0]) && | if (!SCHED_FD_ISSET(i, &r->root_fds[0]) && |
| !FD_ISSET(i, &r->root_fds[1]) && | !SCHED_FD_ISSET(i, &r->root_fds[1]) && |
| !FD_ISSET(i, &r->root_fds[2])) | !SCHED_FD_ISSET(i, &r->root_fds[2])) |
| continue; |
continue; |
| |
|
| rflg = wflg = 0; |
rflg = wflg = 0; |
| |
|
| if (FD_ISSET(i, &rfd) || FD_ISSET(i, &xfd)) { | if (SCHED_FD_ISSET(i, &rfd) || SCHED_FD_ISSET(i, &xfd)) { |
| task = NULL; |
task = NULL; |
| TAILQ_FOREACH_SAFE(t, &r->root_read, task_node, tmp) { |
TAILQ_FOREACH_SAFE(t, &r->root_read, task_node, tmp) { |
| if (TASK_FD(t) == i) { |
if (TASK_FD(t) == i) { |
|
Line 1282 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
Line 1279 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
| |
|
| /* remove resouce */ |
/* remove resouce */ |
| if (rflg == 1) { |
if (rflg == 1) { |
| FD_CLR(i, &r->root_fds[0]); | SCHED_FD_CLR(i, &r->root_fds[0]); |
| FD_CLR(i, &r->root_fds[2]); | SCHED_FD_CLR(i, &r->root_fds[2]); |
| } |
} |
| } |
} |
| } |
} |
| if (FD_ISSET(i, &wfd)) { | if (SCHED_FD_ISSET(i, &wfd)) { |
| task = NULL; |
task = NULL; |
| TAILQ_FOREACH_SAFE(t, &r->root_write, task_node, tmp) { |
TAILQ_FOREACH_SAFE(t, &r->root_write, task_node, tmp) { |
| if (TASK_FD(t) == i) { |
if (TASK_FD(t) == i) { |
|
Line 1318 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
Line 1315 fetch_hook_select_proceed(int en, fd_set rfd, fd_set w
|
| |
|
| /* remove resouce */ |
/* remove resouce */ |
| if (wflg == 1) |
if (wflg == 1) |
| FD_CLR(i, &r->root_fds[1]); | SCHED_FD_CLR(i, &r->root_fds[1]); |
| } |
} |
| } |
} |
| } |
} |
| |
|
| /* optimize select */ |
/* optimize select */ |
| for (i = r->root_kq - 1; i >= 0; i--) |
for (i = r->root_kq - 1; i >= 0; i--) |
| if (FD_ISSET(i, &r->root_fds[0]) || | if (SCHED_FD_ISSET(i, &r->root_fds[0]) || |
| FD_ISSET(i, &r->root_fds[1]) || | SCHED_FD_ISSET(i, &r->root_fds[1]) || |
| FD_ISSET(i, &r->root_fds[2])) | SCHED_FD_ISSET(i, &r->root_fds[2])) |
| break; |
break; |
| r->root_kq = i + 1; |
r->root_kq = i + 1; |
| } |
} |
|
Line 1345 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1342 sched_hook_fetch(void *root, void *arg __unused)
|
| { |
{ |
| sched_root_task_t *r = root; |
sched_root_task_t *r = root; |
| sched_task_t *task, *tmp; |
sched_task_t *task, *tmp; |
| struct timespec now, m, mtmp; | struct timespec now, m, mtmp, *tsmin; |
| #if SUP_ENABLE == KQ_SUPPORT |
#if SUP_ENABLE == KQ_SUPPORT |
| struct kevent res[KQ_EVENTS]; |
struct kevent res[KQ_EVENTS]; |
| struct timespec *timeout; |
struct timespec *timeout; |
|
Line 1354 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1351 sched_hook_fetch(void *root, void *arg __unused)
|
| u_long timeout = 0; |
u_long timeout = 0; |
| #else |
#else |
| struct timeval *timeout, tv; |
struct timeval *timeout, tv; |
| fd_set rfd, wfd, xfd; | sched_fd_set rfd, wfd, xfd; |
| #endif |
#endif |
| int en; |
int en; |
| |
|
|
Line 1388 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1385 sched_hook_fetch(void *root, void *arg __unused)
|
| if (TAILQ_FIRST(&r->root_timer)) { |
if (TAILQ_FIRST(&r->root_timer)) { |
| m = r->root_wait; |
m = r->root_wait; |
| sched_timespecsub(&m, &now, &mtmp); |
sched_timespecsub(&m, &now, &mtmp); |
| r->root_wait = mtmp; | if (mtmp.tv_sec < 0 || mtmp.tv_nsec < 0) |
| | /* don't wait for events. we have ready timer */ |
| | sched_timespecclear(&r->root_wait); |
| | else |
| | r->root_wait = mtmp; |
| } else { |
} else { |
| /* set wait INFTIM */ |
/* set wait INFTIM */ |
| sched_timespecinf(&r->root_wait); |
sched_timespecinf(&r->root_wait); |
|
Line 1399 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1400 sched_hook_fetch(void *root, void *arg __unused)
|
| |
|
| m = TASK_TS(task); |
m = TASK_TS(task); |
| sched_timespecsub(&m, &now, &mtmp); |
sched_timespecsub(&m, &now, &mtmp); |
| r->root_wait = mtmp; | if (mtmp.tv_sec < 0 || mtmp.tv_nsec < 0) |
| | /* don't wait for events. we have ready timer */ |
| | sched_timespecclear(&r->root_wait); |
| | else |
| | r->root_wait = mtmp; |
| } else { |
} else { |
| /* set wait INFTIM */ |
/* set wait INFTIM */ |
| sched_timespecinf(&r->root_wait); |
sched_timespecinf(&r->root_wait); |
|
Line 1408 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1413 sched_hook_fetch(void *root, void *arg __unused)
|
| } else /* no waiting for event, because we have ready task */ |
} else /* no waiting for event, because we have ready task */ |
| sched_timespecclear(&r->root_wait); |
sched_timespecclear(&r->root_wait); |
| |
|
| if (r->root_wait.tv_sec != -1 && r->root_wait.tv_nsec != -1) { | if (!sched_timespecisinf(&r->root_wait)) { |
| | tsmin = sched_timespecmin(&r->root_wait, &r->root_poll); |
| #if SUP_ENABLE == KQ_SUPPORT |
#if SUP_ENABLE == KQ_SUPPORT |
| timeout = &r->root_wait; | timeout = tsmin; |
| #elif SUP_ENABLE == EP_SUPPORT |
#elif SUP_ENABLE == EP_SUPPORT |
| timeout = r->root_wait.tv_sec * 1000 + r->root_wait.tv_nsec / 1000000; | timeout = tsmin->tv_sec * 1000 + tsmin->tv_nsec / 1000000; |
| #else |
#else |
| sched_timespec2val(&r->root_wait, &tv); | sched_timespec2val(tsmin, &tv); |
| timeout = &tv; |
timeout = &tv; |
| #endif /* KQ_SUPPORT */ |
#endif /* KQ_SUPPORT */ |
| } else if (sched_timespecisinf(&r->root_poll)) |
} else if (sched_timespecisinf(&r->root_poll)) |
|
Line 1442 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1448 sched_hook_fetch(void *root, void *arg __unused)
|
| xfd = r->root_fds[2]; |
xfd = r->root_fds[2]; |
| rfd = r->root_fds[0]; |
rfd = r->root_fds[0]; |
| wfd = r->root_fds[1]; |
wfd = r->root_fds[1]; |
| if ((en = select(r->root_kq, &rfd, &wfd, &xfd, timeout)) == -1) { | if ((en = select(r->root_kq, (fd_set*) &rfd, (fd_set*) &wfd, (fd_set*) &xfd, timeout)) == -1) { |
| #endif /* KQ_SUPPORT */ |
#endif /* KQ_SUPPORT */ |
| if (r->root_hooks.hook_exec.exception) { |
if (r->root_hooks.hook_exec.exception) { |
| if (r->root_hooks.hook_exec.exception(r, NULL)) |
if (r->root_hooks.hook_exec.exception(r, NULL)) |