|
|
| version 1.8, 2012/05/31 22:31:48 | version 1.10, 2012/07/24 14:06:11 |
|---|---|
| Line 163 sched_hook_cancel(void *task, void *arg __unused) | Line 163 sched_hook_cancel(void *task, void *arg __unused) |
| #else | #else |
| EV_SET(&chg[0], TASK_VAL(t), EVFILT_USER, EV_DELETE, 0, 0, (void*) TASK_VAL(t)); | EV_SET(&chg[0], TASK_VAL(t), EVFILT_USER, EV_DELETE, 0, 0, (void*) TASK_VAL(t)); |
| #endif | #endif |
| #endif | |
| break; | break; |
| #endif | |
| default: | default: |
| return NULL; | return NULL; |
| } | } |
| Line 433 sched_hook_fetch(void *root, void *arg __unused) | Line 433 sched_hook_fetch(void *root, void *arg __unused) |
| struct timespec now, m, mtmp; | struct timespec now, m, mtmp; |
| struct timespec *timeout; | struct timespec *timeout; |
| struct kevent evt[1], res[KQ_EVENTS]; | struct kevent evt[1], res[KQ_EVENTS]; |
| register int i; | register int i, flg; |
| int en; | int en; |
| if (!r) | if (!r) |
| Line 535 sched_hook_fetch(void *root, void *arg __unused) | Line 535 sched_hook_fetch(void *root, void *arg __unused) |
| /* Put read/write task to ready queue */ | /* Put read/write task to ready queue */ |
| switch (res[i].filter) { | switch (res[i].filter) { |
| case EVFILT_READ: | case EVFILT_READ: |
| flg = 0; | |
| 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 | |
| flg++; | |
| /* 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 576 sched_hook_fetch(void *root, void *arg __unused) | Line 579 sched_hook_fetch(void *root, void *arg __unused) |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| } | } |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| case EVFILT_WRITE: | case EVFILT_WRITE: |
| flg = 0; | |
| 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 | |
| flg++; | |
| /* 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 621 sched_hook_fetch(void *root, void *arg __unused) | Line 629 sched_hook_fetch(void *root, void *arg __unused) |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| } | } |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| case EVFILT_TIMER: | case EVFILT_TIMER: |
| flg = 0; | |
| 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 | |
| flg++; | |
| /* 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 644 sched_hook_fetch(void *root, void *arg __unused) | Line 657 sched_hook_fetch(void *root, void *arg __unused) |
| #ifdef HAVE_LIBPTHREAD | #ifdef HAVE_LIBPTHREAD |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| case EVFILT_VNODE: | case EVFILT_VNODE: |
| flg = 0; | |
| TAILQ_FOREACH_SAFE(task, &r->root_node, task_node, tmp) { | TAILQ_FOREACH_SAFE(task, &r->root_node, 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++; | |
| TASK_DATA(task) = (void*) (uintptr_t) res[i].data; | TASK_DATA(task) = (void*) (uintptr_t) res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_DATLEN(task) = res[i].fflags; |
| } | } |
| Line 671 sched_hook_fetch(void *root, void *arg __unused) | Line 688 sched_hook_fetch(void *root, void *arg __unused) |
| #ifdef HAVE_LIBPTHREAD | #ifdef HAVE_LIBPTHREAD |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| case EVFILT_PROC: | case EVFILT_PROC: |
| flg = 0; | |
| TAILQ_FOREACH_SAFE(task, &r->root_proc, task_node, tmp) { | TAILQ_FOREACH_SAFE(task, &r->root_proc, 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++; | |
| TASK_DATA(task) = (void*) (uintptr_t) res[i].data; | TASK_DATA(task) = (void*) (uintptr_t) res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_DATLEN(task) = res[i].fflags; |
| } | } |
| Line 698 sched_hook_fetch(void *root, void *arg __unused) | Line 719 sched_hook_fetch(void *root, void *arg __unused) |
| #ifdef HAVE_LIBPTHREAD | #ifdef HAVE_LIBPTHREAD |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| case EVFILT_SIGNAL: | case EVFILT_SIGNAL: |
| flg = 0; | |
| 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 | |
| flg++; | |
| /* 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 721 sched_hook_fetch(void *root, void *arg __unused) | Line 747 sched_hook_fetch(void *root, void *arg __unused) |
| #ifdef HAVE_LIBPTHREAD | #ifdef HAVE_LIBPTHREAD |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| #ifdef EVFILT_USER | #ifdef EVFILT_USER |
| case EVFILT_USER: | case EVFILT_USER: |
| flg = 0; | |
| TAILQ_FOREACH_SAFE(task, &r->root_user, task_node, tmp) { | TAILQ_FOREACH_SAFE(task, &r->root_user, 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++; | |
| TASK_DATA(task) = (void*) res[i].data; | TASK_DATA(task) = (void*) res[i].data; |
| TASK_DATLEN(task) = res[i].fflags; | TASK_DATLEN(task) = res[i].fflags; |
| } | } |
| Line 749 sched_hook_fetch(void *root, void *arg __unused) | Line 779 sched_hook_fetch(void *root, void *arg __unused) |
| #ifdef HAVE_LIBPTHREAD | #ifdef HAVE_LIBPTHREAD |
| pthread_mutex_unlock(&r->root_mtx[taskREADY]); | pthread_mutex_unlock(&r->root_mtx[taskREADY]); |
| #endif | #endif |
| break; | |
| } | } |
| /* if match at least 2, don't remove resouce of event */ | |
| if (flg > 1) | |
| evt->flags ^= evt->flags; | |
| break; | break; |
| #endif | #endif |
| } | } |