|
version 1.12, 2012/08/08 08:25:39
|
version 1.17.2.1, 2013/06/03 20:52:21
|
|
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, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 | Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 |
| 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 110 sched_hook_cancel(void *task, void *arg __unused)
|
Line 110 sched_hook_cancel(void *task, void *arg __unused)
|
| #ifdef AIO_SUPPORT |
#ifdef AIO_SUPPORT |
| struct aiocb *acb; |
struct aiocb *acb; |
| #ifdef EVFILT_LIO |
#ifdef EVFILT_LIO |
| |
register int i = 0; |
| struct aiocb **acbs; |
struct aiocb **acbs; |
| register int i; |
|
| #endif /* EVFILT_LIO */ |
#endif /* EVFILT_LIO */ |
| #endif /* AIO_SUPPORT */ |
#endif /* AIO_SUPPORT */ |
| |
|
|
Line 162 sched_hook_cancel(void *task, void *arg __unused)
|
Line 162 sched_hook_cancel(void *task, void *arg __unused)
|
| #else |
#else |
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_DELETE, 0, 0, (void*) TASK_VAL(t)); |
EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_DELETE, 0, 0, (void*) TASK_VAL(t)); |
| #endif |
#endif |
| |
/* restore signal */ |
| |
signal(TASK_VAL(t), SIG_DFL); |
| break; |
break; |
| #ifdef AIO_SUPPORT |
#ifdef AIO_SUPPORT |
| case taskAIO: |
case taskAIO: |
|
Line 207 sched_hook_cancel(void *task, void *arg __unused)
|
Line 209 sched_hook_cancel(void *task, void *arg __unused)
|
| #endif |
#endif |
| break; |
break; |
| #endif |
#endif |
| |
case taskTHREAD: |
| |
#ifdef HAVE_LIBPTHREAD |
| |
pthread_cancel((pthread_t) TASK_VAL(t)); |
| |
#endif |
| default: |
default: |
| return NULL; |
return NULL; |
| } |
} |
|
Line 215 sched_hook_cancel(void *task, void *arg __unused)
|
Line 221 sched_hook_cancel(void *task, void *arg __unused)
|
| return NULL; |
return NULL; |
| } |
} |
| |
|
| |
#ifdef HAVE_LIBPTHREAD |
| /* |
/* |
| |
* sched_hook_thread() - Default THREAD hook |
| |
* |
| |
* @task = current task |
| |
* @arg = pthread attributes |
| |
* return: <0 errors and 0 ok |
| |
*/ |
| |
void * |
| |
sched_hook_thread(void *task, void *arg) |
| |
{ |
| |
sched_task_t *t = task; |
| |
pthread_t tid; |
| |
sigset_t s, o; |
| |
|
| |
if (!t || !TASK_ROOT(t)) |
| |
return (void*) -1; |
| |
|
| |
sigfillset(&s); |
| |
pthread_sigmask(SIG_BLOCK, &s, &o); |
| |
if ((errno = pthread_create(&tid, (pthread_attr_t*) arg, |
| |
(void *(*)(void*)) _sched_threadWrapper, t))) { |
| |
LOGERR; |
| |
pthread_sigmask(SIG_SETMASK, &o, NULL); |
| |
return (void*) -1; |
| |
} else |
| |
TASK_VAL(t) = (u_long) tid; |
| |
|
| |
if (!TASK_ISLOCKED(t)) |
| |
TASK_LOCK(t); |
| |
|
| |
pthread_sigmask(SIG_SETMASK, &o, NULL); |
| |
return NULL; |
| |
} |
| |
#endif |
| |
|
| |
/* |
| * sched_hook_read() - Default READ hook |
* sched_hook_read() - Default READ hook |
| * |
* |
| * @task = current task |
* @task = current task |
|
Line 407 sched_hook_signal(void *task, void *arg __unused)
|
Line 449 sched_hook_signal(void *task, void *arg __unused)
|
| if (!t || !TASK_ROOT(t)) |
if (!t || !TASK_ROOT(t)) |
| return (void*) -1; |
return (void*) -1; |
| |
|
| |
/* ignore signal */ |
| |
signal(TASK_VAL(t), SIG_IGN); |
| |
|
| #ifdef __NetBSD__ |
#ifdef __NetBSD__ |
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_ADD, 0, 0, (intptr_t) TASK_VAL(t)); |
EV_SET(&chg[0], TASK_VAL(t), EVFILT_SIGNAL, EV_ADD, 0, 0, (intptr_t) TASK_VAL(t)); |
| #else |
#else |
|
Line 592 sched_hook_fetch(void *root, void *arg __unused)
|
Line 637 sched_hook_fetch(void *root, void *arg __unused)
|
| TAILQ_FOREACH_SAFE(task, &r->root_read, task_node, tmp) { |
TAILQ_FOREACH_SAFE(task, &r->root_read, task_node, tmp) { |
| if (TASK_FD(task) != ((intptr_t) res[i].udata)) |
if (TASK_FD(task) != ((intptr_t) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove read handle */ |
/* remove read handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskREAD]); |
pthread_mutex_lock(&r->root_mtx[taskREAD]); |
|
Line 642 sched_hook_fetch(void *root, void *arg __unused)
|
Line 690 sched_hook_fetch(void *root, void *arg __unused)
|
| TAILQ_FOREACH_SAFE(task, &r->root_write, task_node, tmp) { |
TAILQ_FOREACH_SAFE(task, &r->root_write, task_node, tmp) { |
| if (TASK_FD(task) != ((intptr_t) res[i].udata)) |
if (TASK_FD(task) != ((intptr_t) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove write handle */ |
/* remove write handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskWRITE]); |
pthread_mutex_lock(&r->root_mtx[taskWRITE]); |
|
Line 692 sched_hook_fetch(void *root, void *arg __unused)
|
Line 743 sched_hook_fetch(void *root, void *arg __unused)
|
| TAILQ_FOREACH_SAFE(task, &r->root_alarm, task_node, tmp) { |
TAILQ_FOREACH_SAFE(task, &r->root_alarm, task_node, tmp) { |
| if ((uintptr_t) TASK_DATA(task) != ((uintptr_t) res[i].udata)) |
if ((uintptr_t) TASK_DATA(task) != ((uintptr_t) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove alarm handle */ |
/* remove alarm handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskALARM]); |
pthread_mutex_lock(&r->root_mtx[taskALARM]); |
|
Line 722 sched_hook_fetch(void *root, void *arg __unused)
|
Line 776 sched_hook_fetch(void *root, void *arg __unused)
|
| continue; |
continue; |
| else { |
else { |
| flg++; |
flg++; |
| TASK_DATA(task) = (void*) (uintptr_t) res[i].data; | TASK_RET(task) = res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_FLAG(task) = res[i].fflags; |
| } |
} |
| /* remove node handle */ |
/* remove node handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
|
Line 753 sched_hook_fetch(void *root, void *arg __unused)
|
Line 807 sched_hook_fetch(void *root, void *arg __unused)
|
| continue; |
continue; |
| else { |
else { |
| flg++; |
flg++; |
| TASK_DATA(task) = (void*) (uintptr_t) res[i].data; | TASK_RET(task) = res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_FLAG(task) = res[i].fflags; |
| } |
} |
| /* remove proc handle */ |
/* remove proc handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
|
Line 782 sched_hook_fetch(void *root, void *arg __unused)
|
Line 836 sched_hook_fetch(void *root, void *arg __unused)
|
| TAILQ_FOREACH_SAFE(task, &r->root_signal, task_node, tmp) { |
TAILQ_FOREACH_SAFE(task, &r->root_signal, task_node, tmp) { |
| if (TASK_VAL(task) != ((uintptr_t) res[i].udata)) |
if (TASK_VAL(task) != ((uintptr_t) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove signal handle */ |
/* remove signal handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskSIGNAL]); |
pthread_mutex_lock(&r->root_mtx[taskSIGNAL]); |
|
Line 812 sched_hook_fetch(void *root, void *arg __unused)
|
Line 869 sched_hook_fetch(void *root, void *arg __unused)
|
| acb = (struct aiocb*) TASK_VAL(task); |
acb = (struct aiocb*) TASK_VAL(task); |
| if (acb != ((struct aiocb*) res[i].udata)) |
if (acb != ((struct aiocb*) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove user handle */ |
/* remove user handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskAIO]); |
pthread_mutex_lock(&r->root_mtx[taskAIO]); |
|
Line 851 sched_hook_fetch(void *root, void *arg __unused)
|
Line 911 sched_hook_fetch(void *root, void *arg __unused)
|
| acbs = (struct aiocb**) TASK_VAL(task); |
acbs = (struct aiocb**) TASK_VAL(task); |
| if (acbs != ((struct aiocb**) res[i].udata)) |
if (acbs != ((struct aiocb**) res[i].udata)) |
| continue; |
continue; |
| else | else { |
| flg++; |
flg++; |
| |
TASK_RET(task) = res[i].data; |
| |
TASK_FLAG(task) = res[i].fflags; |
| |
} |
| /* remove user handle */ |
/* remove user handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskLIO]); |
pthread_mutex_lock(&r->root_mtx[taskLIO]); |
|
Line 900 sched_hook_fetch(void *root, void *arg __unused)
|
Line 963 sched_hook_fetch(void *root, void *arg __unused)
|
| continue; |
continue; |
| else { |
else { |
| flg++; |
flg++; |
| TASK_DATA(task) = (void*) res[i].data; | TASK_RET(task) = res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_FLAG(task) = res[i].fflags; |
| } |
} |
| /* remove user handle */ |
/* remove user handle */ |
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
|
Line 958 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1021 sched_hook_fetch(void *root, void *arg __unused)
|
| } |
} |
| |
|
| /* put regular task priority task to ready queue, |
/* put regular task priority task to ready queue, |
| if there is no ready task or reach max missing hit events */ | if there is no ready task or reach max missing hit for regular task */ |
| if ((task = TAILQ_FIRST(&r->root_task))) { |
if ((task = TAILQ_FIRST(&r->root_task))) { |
| if (!TAILQ_FIRST(&r->root_ready) || r->root_task_miss > r->root_miss) { | if (!TAILQ_FIRST(&r->root_ready) || r->root_miss >= TASK_VAL(task)) { |
| r->root_task_miss ^= r->root_task_miss; | r->root_miss ^= r->root_miss; |
| |
|
| #ifdef HAVE_LIBPTHREAD |
#ifdef HAVE_LIBPTHREAD |
| pthread_mutex_lock(&r->root_mtx[taskTASK]); |
pthread_mutex_lock(&r->root_mtx[taskTASK]); |
|
Line 979 sched_hook_fetch(void *root, void *arg __unused)
|
Line 1042 sched_hook_fetch(void *root, void *arg __unused)
|
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif |
#endif |
| } else |
} else |
| r->root_task_miss++; | r->root_miss++; |
| } else |
} else |
| r->root_task_miss ^= r->root_task_miss; | r->root_miss ^= r->root_miss; |
| |
|
| /* OK, lets get ready task !!! */ |
/* OK, lets get ready task !!! */ |
| task = TAILQ_FIRST(&r->root_ready); |
task = TAILQ_FIRST(&r->root_ready); |