/*************************************************************************
* (C) 2011 AITNET ltd - Sofia/Bulgaria - <misho@aitbg.com>
* by Michael Pounov <misho@openbsd-bg.org>
*
* $Author: misho $
* $Id: tasks.c,v 1.4.2.4 2012/01/24 15:29:09 misho Exp $
*
**************************************************************************
The ELWIX and AITNET software is distributed under the following
terms:
All of the documentation and software included in the ELWIX and AITNET
Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org>
Copyright 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011
by Michael Pounov <misho@elwix.org>. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software
must display the following acknowledgement:
This product includes software developed by Michael Pounov <misho@elwix.org>
ELWIX - Embedded LightWeight unIX and its contributors.
4. Neither the name of AITNET nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
*/
#include "global.h"
#pragma GCC visibility push(hidden)
inline sched_task_t *
_sched_useTask(sched_root_task_t * __restrict root)
{
sched_task_t *task;
TAILQ_FOREACH(task, &root->root_unuse, task_node) {
if (!TASK_ISLOCKED(task)) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskUNUSE]);
#endif
TAILQ_REMOVE(&root->root_unuse, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskUNUSE]);
#endif
break;
}
}
if (!task) {
task = malloc(sizeof(sched_task_t));
if (!task) {
LOGERR;
return NULL;
}
}
return task;
}
inline sched_task_t *
_sched_unuseTask(sched_task_t * __restrict task)
{
TASK_UNLOCK(task);
TASK_TYPE(task) = taskUNUSE;
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
#endif
TAILQ_INSERT_TAIL(&TASK_ROOT(task)->root_unuse, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&TASK_ROOT(task)->root_mtx[taskUNUSE]);
#endif
task = NULL;
return task;
}
#pragma GCC visibility pop
/*
* schedRead() - Add READ I/O task to scheduler queue
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @fd = fd handle
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task
*/
sched_task_t *
schedRead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task;
void *ptr;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskREAD;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_FD(task) = fd;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
if (root->root_hooks.hook_add.read)
ptr = root->root_hooks.hook_add.read(task, NULL);
else
ptr = NULL;
if (!ptr) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskREAD]);
#endif
TAILQ_INSERT_TAIL(&root->root_read, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskREAD]);
#endif
} else
task = _sched_unuseTask(task);
return task;
}
/*
* schedWrite() - Add WRITE I/O task to scheduler queue
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @fd = fd handle
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task
*/
sched_task_t *
schedWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task;
void *ptr;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskWRITE;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_FD(task) = fd;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
if (root->root_hooks.hook_add.write)
ptr = root->root_hooks.hook_add.write(task, NULL);
else
ptr = NULL;
if (!ptr) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskWRITE]);
#endif
TAILQ_INSERT_TAIL(&root->root_write, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskWRITE]);
#endif
} else
task = _sched_unuseTask(task);
return task;
}
/*
* schedTimer() - Add TIMER task to scheduler queue
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @ts = timeout argument structure
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task
*/
sched_task_t *
schedTimer(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task, *t = NULL;
void *ptr;
struct timespec now;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskTIMER;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
/* calculate timeval structure */
clock_gettime(CLOCK_MONOTONIC, &now);
now.tv_sec += ts.tv_sec;
now.tv_nsec += ts.tv_nsec;
if (now.tv_nsec >= 1000000000L) {
now.tv_sec++;
now.tv_nsec -= 1000000000L;
} else if (now.tv_nsec < 0) {
now.tv_sec--;
now.tv_nsec += 1000000000L;
}
TASK_TS(task) = now;
if (root->root_hooks.hook_add.timer)
ptr = root->root_hooks.hook_add.timer(task, NULL);
else
ptr = NULL;
if (!ptr) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskTIMER]);
#endif
#ifdef TIMER_WITHOUT_SORT
TAILQ_INSERT_TAIL(&root->root_timer, task, task_node);
#else
TAILQ_FOREACH(t, &root->root_timer, task_node)
if (sched_timespeccmp(&TASK_TS(task), &TASK_TS(t), -) < 1)
break;
if (!t)
TAILQ_INSERT_TAIL(&root->root_timer, task, task_node);
else
TAILQ_INSERT_BEFORE(t, task, task_node);
#endif
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskTIMER]);
#endif
} else
task = _sched_unuseTask(task);
return task;
}
/*
* schedEvent() - Add EVENT task to scheduler queue
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @val = additional func argument
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task
*/
sched_task_t *
schedEvent(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task;
void *ptr;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskEVENT;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_VAL(task) = val;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
if (root->root_hooks.hook_add.event)
ptr = root->root_hooks.hook_add.event(task, NULL);
else
ptr = NULL;
if (!ptr) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskEVENT]);
#endif
TAILQ_INSERT_TAIL(&root->root_event, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskEVENT]);
#endif
} else
task = _sched_unuseTask(task);
return task;
}
/*
* schedEventLo() - Add EVENT_Lo task to scheduler queue
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @val = additional func argument
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task
*/
sched_task_t *
schedEventLo(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task;
void *ptr;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskEVENT;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_VAL(task) = val;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
if (root->root_hooks.hook_add.eventlo)
ptr = root->root_hooks.hook_add.eventlo(task, NULL);
else
ptr = NULL;
if (!ptr) {
#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskEVENTLO]);
#endif
TAILQ_INSERT_TAIL(&root->root_eventlo, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskEVENTLO]);
#endif
} else
task = _sched_unuseTask(task);
return task;
}
/*
* schedCallOnce() - Call once from scheduler
* @root = root task
* @func = task execution function
* @arg = 1st func argument
* @val = additional func argument
* @opt_data = Optional data
* @opt_dlen = Optional data length
* return: return value from called func
*/
sched_task_t *
schedCallOnce(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,
void *opt_data, size_t opt_dlen)
{
sched_task_t *task;
void *ret;
if (!root || !func)
return NULL;
/* get new task */
if (!(task = _sched_useTask(root)))
return NULL;
memset(task, 0, sizeof(sched_task_t));
task->task_id = 0;
task->task_lock = 0;
task->task_func = func;
TASK_TYPE(task) = taskEVENT;
TASK_ROOT(task) = root;
TASK_ARG(task) = arg;
TASK_VAL(task) = val;
TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;
ret = schedCall(task);
_sched_unuseTask(task);
return ret;
}
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to tasks.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