libaitsched/src/tasks.c - diff

Return to tasks.c CVS log

Up to [ELWIX - Embedded LightWeight unIX -] / libaitsched / src

Diff for /libaitsched/src/tasks.c between versions 1.10.2.7 and 1.21.2.2

version 1.10.2.7, 2012/08/02 11:37:08	version 1.21.2.2, 2013/09/02 11:19:20
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 46 SUCH DAMAGE.	Line 46 SUCH DAMAGE.
#include "global.h"	#include "global.h"


#pragma GCC visibility push(hidden)	/*
	* sched_useTask() - Get and init new task
inline sched_task_t *	*
_sched_useTask(sched_root_task_t * __restrict root)	* @root = root task
	* return: NULL error or !=NULL prepared task
	*/
	sched_task_t *
	sched_useTask(sched_root_task_t * __restrict root)
{	{
sched_task_t task, tmp;	sched_task_t task, tmp;

TAILQ_FOREACH_SAFE(task, &root->root_unuse, task_node, tmp) {
if (!TASK_ISLOCKED(task)) {
#ifdef HAVE_LIBPTHREAD	#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskUNUSE]);	pthread_mutex_lock(&root->root_mtx[taskUNUSE]);
#endif	#endif
	TAILQ_FOREACH_SAFE(task, &root->root_unuse, task_node, tmp) {
	if (!TASK_ISLOCKED(task)) {
TAILQ_REMOVE(&root->root_unuse, task, task_node);	TAILQ_REMOVE(&root->root_unuse, task, task_node);
#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskUNUSE]);
#endif
break;	break;
}	}
}	}
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_unlock(&root->root_mtx[taskUNUSE]);
	#endif

if (!task) {	if (!task) {
task = malloc(sizeof(sched_task_t));	task = malloc(sizeof(sched_task_t));
Line 79 _sched_useTask(sched_root_task_t * __restrict root)	Line 83 _sched_useTask(sched_root_task_t * __restrict root)
return task;	return task;
}	}

inline sched_task_t *	/*
_sched_unuseTask(sched_task_t * __restrict task)	* sched_unuseTask() - Unlock and put task to unuse queue
	*
	* @task = task
	* return: always is NULL
	*/
	sched_task_t *
	sched_unuseTask(sched_task_t * __restrict task)
{	{
TASK_UNLOCK(task);	TASK_UNLOCK(task);
TASK_TYPE(task) = taskUNUSE;	TASK_TYPE(task) = taskUNUSE;
Line 96 _sched_unuseTask(sched_task_t * __restrict task)	Line 106 _sched_unuseTask(sched_task_t * __restrict task)
return task;	return task;
}	}

	#pragma GCC visibility push(hidden)

	#ifdef HAVE_LIBPTHREAD
	static void
	_sched_threadCleanup(sched_task_t *t)
	{
	if (!t \|\| !TASK_ROOT(t))
	return;

	pthread_mutex_lock(&TASK_ROOT(t)->root_mtx[taskTHREAD]);
	TAILQ_REMOVE(&TASK_ROOT(t)->root_thread, t, task_node);
	pthread_mutex_unlock(&TASK_ROOT(t)->root_mtx[taskTHREAD]);
	sched_unuseTask(t);
	}
	void *
	_sched_threadWrapper(sched_task_t *t)
	{
	void *ret = NULL;

	pthread_cleanup_push((void ()(void)) _sched_threadCleanup, t);

	if (!t \|\| !TASK_ROOT(t))
	pthread_exit(ret);

	pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, NULL);
	/*
	pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);
	*/

	/* notify parent, thread is ready for execution */
	pthread_testcancel();

	ret = schedCall(t);

	pthread_cleanup_pop(42);
	TASK_ROOT(t)->root_ret = ret;
	pthread_exit(ret);
	}
	#endif

	#if defined(HAVE_TIMER_CREATE) && defined(HAVE_TIMER_SETTIME)
	void *
	_sched_rtcWrapper(sched_task_t *t)
	{
	sched_task_func_t func;
	sched_task_t *task;
	sched_root_task_t *r;

	if (!t \|\| !TASK_ROOT(t) \|\| !TASK_DATA(t))
	return NULL;
	else {
	r = TASK_ROOT(t);
	task = (sched_task_t*) TASK_DATA(t);
	func = TASK_FUNC(task);
	}

	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_lock(&r->root_mtx[taskRTC]);
	#endif
	TAILQ_REMOVE(&r->root_rtc, task, task_node);
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_unlock(&r->root_mtx[taskRTC]);
	#endif
	sched_unuseTask(task);

	timer_delete((timer_t) TASK_DATLEN(t));

	return schedCall(task);
	}
	#endif

#pragma GCC visibility pop	#pragma GCC visibility pop

	/*
	* sched_taskExit() - Exit routine for scheduler task, explicit required for thread tasks
	*
	* @task = current task
	* @retcode = return code
	* return: return code
	*/
	void *
	sched_taskExit(sched_task_t *task, intptr_t retcode)
	{
	if (!task \|\| !TASK_ROOT(task))
	return (void*) -1;

	if (TASK_ROOT(task)->root_hooks.hook_exec.exit)
	TASK_ROOT(task)->root_hooks.hook_exec.exit(task, (void*) retcode);

	TASK_ROOT(task)->root_ret = (void*) retcode;
	return (void*) retcode;
	}


/*	/*
* schedRead() - Add READ I/O task to scheduler queue	* schedRead() - Add READ I/O task to scheduler queue
*	*
Line 121 schedRead(sched_root_task_t * __restrict root, sched_t	Line 222 schedRead(sched_root_task_t * __restrict root, sched_t
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 148 schedRead(sched_root_task_t * __restrict root, sched_t	Line 249 schedRead(sched_root_task_t * __restrict root, sched_t
pthread_mutex_unlock(&root->root_mtx[taskREAD]);	pthread_mutex_unlock(&root->root_mtx[taskREAD]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 175 schedWrite(sched_root_task_t * __restrict root, sched_	Line 276 schedWrite(sched_root_task_t * __restrict root, sched_
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 202 schedWrite(sched_root_task_t * __restrict root, sched_	Line 303 schedWrite(sched_root_task_t * __restrict root, sched_
pthread_mutex_unlock(&root->root_mtx[taskWRITE]);	pthread_mutex_unlock(&root->root_mtx[taskWRITE]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 229 schedNode(sched_root_task_t * __restrict root, sched_t	Line 330 schedNode(sched_root_task_t * __restrict root, sched_t
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 256 schedNode(sched_root_task_t * __restrict root, sched_t	Line 357 schedNode(sched_root_task_t * __restrict root, sched_t
pthread_mutex_unlock(&root->root_mtx[taskNODE]);	pthread_mutex_unlock(&root->root_mtx[taskNODE]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 283 schedProc(sched_root_task_t * __restrict root, sched_t	Line 384 schedProc(sched_root_task_t * __restrict root, sched_t
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 310 schedProc(sched_root_task_t * __restrict root, sched_t	Line 411 schedProc(sched_root_task_t * __restrict root, sched_t
pthread_mutex_unlock(&root->root_mtx[taskPROC]);	pthread_mutex_unlock(&root->root_mtx[taskPROC]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 341 schedUser(sched_root_task_t * __restrict root, sched_t	Line 442 schedUser(sched_root_task_t * __restrict root, sched_t
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 368 schedUser(sched_root_task_t * __restrict root, sched_t	Line 469 schedUser(sched_root_task_t * __restrict root, sched_t
pthread_mutex_unlock(&root->root_mtx[taskUSER]);	pthread_mutex_unlock(&root->root_mtx[taskUSER]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
#endif	#endif
Line 396 schedSignal(sched_root_task_t * __restrict root, sched	Line 497 schedSignal(sched_root_task_t * __restrict root, sched
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 423 schedSignal(sched_root_task_t * __restrict root, sched	Line 524 schedSignal(sched_root_task_t * __restrict root, sched
pthread_mutex_unlock(&root->root_mtx[taskSIGNAL]);	pthread_mutex_unlock(&root->root_mtx[taskSIGNAL]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 435 schedSignal(sched_root_task_t * __restrict root, sched	Line 536 schedSignal(sched_root_task_t * __restrict root, sched
* @func = task execution function	* @func = task execution function
* @arg = 1st func argument	* @arg = 1st func argument
* @ts = timeout argument structure, minimum alarm timer resolution is 1msec!	* @ts = timeout argument structure, minimum alarm timer resolution is 1msec!
* @opt_data = Optional data	* @opt_data = Alarm timer ID
* @opt_dlen = Optional data length	* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task	* return: NULL error or !=NULL new queued task
*/	*/
Line 450 schedAlarm(sched_root_task_t * __restrict root, sched_	Line 551 schedAlarm(sched_root_task_t * __restrict root, sched_
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 477 schedAlarm(sched_root_task_t * __restrict root, sched_	Line 578 schedAlarm(sched_root_task_t * __restrict root, sched_
pthread_mutex_unlock(&root->root_mtx[taskALARM]);	pthread_mutex_unlock(&root->root_mtx[taskALARM]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}

#ifdef EVFILT_AIO	#ifdef AIO_SUPPORT
/*	/*
* schedAIO() - Add AIO task to scheduler queue	* schedAIO() - Add AIO task to scheduler queue
*	*
Line 505 schedAIO(sched_root_task_t * __restrict root, sched_ta	Line 606 schedAIO(sched_root_task_t * __restrict root, sched_ta
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 532 schedAIO(sched_root_task_t * __restrict root, sched_ta	Line 633 schedAIO(sched_root_task_t * __restrict root, sched_ta
pthread_mutex_unlock(&root->root_mtx[taskAIO]);	pthread_mutex_unlock(&root->root_mtx[taskAIO]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 546 schedAIO(sched_root_task_t * __restrict root, sched_ta	Line 647 schedAIO(sched_root_task_t * __restrict root, sched_ta
* @fd = file descriptor	* @fd = file descriptor
* @buffer = Buffer	* @buffer = Buffer
* @buflen = Buffer length	* @buflen = Buffer length
	* @offset = Offset from start of file, if =-1 from current position
* return: NULL error or !=NULL new queued task	* return: NULL error or !=NULL new queued task
*/	*/
inline sched_task_t *	sched_task_t *
schedAIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,	schedAIORead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
void *buffer, size_t buflen)	void *buffer, size_t buflen, off_t offset)
{	{
struct aiocb *acb;	struct aiocb *acb;
off_t off = 0;	off_t off;

if (!root \|\| !func \|\| !buffer \|\| !buflen)	if (!root \|\| !func \|\| !buffer \|\| !buflen)
return NULL;	return NULL;
else
memset(buffer, 0, buflen);

	if (offset == (off_t) -1) {
	off = lseek(fd, 0, SEEK_CUR);
	if (off == -1) {
	LOGERR;
	return NULL;
	}
	} else
	off = offset;

if (!(acb = malloc(sizeof(struct aiocb)))) {	if (!(acb = malloc(sizeof(struct aiocb)))) {
LOGERR;	LOGERR;
return NULL;	return NULL;
Line 569 schedAIORead(sched_root_task_t * __restrict root, sche	Line 678 schedAIORead(sched_root_task_t * __restrict root, sche
acb->aio_fildes = fd;	acb->aio_fildes = fd;
acb->aio_nbytes = buflen;	acb->aio_nbytes = buflen;
acb->aio_buf = buffer;	acb->aio_buf = buffer;
off = lseek(fd, 0, SEEK_CUR);	acb->aio_offset = off;
if (off == -1) {
LOGERR;
free(acb);
return NULL;
} else
acb->aio_offset = off;
acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;	acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;	acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
acb->aio_sigevent.sigev_value.sival_ptr = acb;	acb->aio_sigevent.sigev_value.sival_ptr = acb;
Line 598 schedAIORead(sched_root_task_t * __restrict root, sche	Line 701 schedAIORead(sched_root_task_t * __restrict root, sche
* @fd = file descriptor	* @fd = file descriptor
* @buffer = Buffer	* @buffer = Buffer
* @buflen = Buffer length	* @buflen = Buffer length
	* @offset = Offset from start of file, if =-1 from current position
* return: NULL error or !=NULL new queued task	* return: NULL error or !=NULL new queued task
*/	*/
inline sched_task_t *	sched_task_t *
schedAIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,	schedAIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
void *buffer, size_t buflen)	void *buffer, size_t buflen, off_t offset)
{	{
struct aiocb *acb;	struct aiocb *acb;
off_t off = 0;	off_t off;

if (!root \|\| !func \|\| !buffer \|\| !buflen)	if (!root \|\| !func \|\| !buffer \|\| !buflen)
return NULL;	return NULL;

	if (offset == (off_t) -1) {
	off = lseek(fd, 0, SEEK_CUR);
	if (off == -1) {
	LOGERR;
	return NULL;
	}
	} else
	off = offset;

if (!(acb = malloc(sizeof(struct aiocb)))) {	if (!(acb = malloc(sizeof(struct aiocb)))) {
LOGERR;	LOGERR;
return NULL;	return NULL;
Line 619 schedAIOWrite(sched_root_task_t * __restrict root, sch	Line 732 schedAIOWrite(sched_root_task_t * __restrict root, sch
acb->aio_fildes = fd;	acb->aio_fildes = fd;
acb->aio_nbytes = buflen;	acb->aio_nbytes = buflen;
acb->aio_buf = buffer;	acb->aio_buf = buffer;
off = lseek(fd, 0, SEEK_CUR);	acb->aio_offset = off;
if (off == -1) {
LOGERR;
free(acb);
return NULL;
} else
acb->aio_offset = off;
acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;	acb->aio_sigevent.sigev_notify = SIGEV_KEVENT;
acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;	acb->aio_sigevent.sigev_notify_kqueue = root->root_kq;
acb->aio_sigevent.sigev_value.sival_ptr = acb;	acb->aio_sigevent.sigev_value.sival_ptr = acb;
Line 641 schedAIOWrite(sched_root_task_t * __restrict root, sch	Line 748 schedAIOWrite(sched_root_task_t * __restrict root, sch

#ifdef EVFILT_LIO	#ifdef EVFILT_LIO
/*	/*
	* schedLIO() - Add AIO bulk tasks to scheduler queue
	*
	* @root = root task
	* @func = task execution function
	* @arg = 1st func argument
	* @acbs = AIO cb structure addresses
	* @opt_data = Optional data
	* @opt_dlen = Optional data length
	* return: NULL error or !=NULL new queued task
	*/
	sched_task_t *
	schedLIO(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg,
	struct aiocb ** __restrict acbs, void *opt_data, size_t opt_dlen)
	{
	sched_task_t *task;
	void *ptr;

	if (!root \|\| !func \|\| !acbs \|\| !opt_dlen)
	return NULL;

	/* get new task */
	if (!(task = sched_useTask(root)))
	return NULL;

	task->task_func = func;
	TASK_TYPE(task) = taskLIO;
	TASK_ROOT(task) = root;

	TASK_ARG(task) = arg;
	TASK_VAL(task) = (u_long) acbs;

	TASK_DATA(task) = opt_data;
	TASK_DATLEN(task) = opt_dlen;

	if (root->root_hooks.hook_add.lio)
	ptr = root->root_hooks.hook_add.lio(task, NULL);
	else
	ptr = NULL;

	if (!ptr) {
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_lock(&root->root_mtx[taskLIO]);
	#endif
	TAILQ_INSERT_TAIL(&root->root_lio, TASK_ID(task), task_node);
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_unlock(&root->root_mtx[taskLIO]);
	#endif
	} else
	task = sched_unuseTask(task);

	return task;
	}

	/*
* schedLIORead() - Add list of AIO read tasks to scheduler queue	* schedLIORead() - Add list of AIO read tasks to scheduler queue
*	*
* @root = root task	* @root = root task
Line 685 schedLIORead(sched_root_task_t * __restrict root, sche	Line 846 schedLIORead(sched_root_task_t * __restrict root, sche
for (i = 0; i < nbufs; i++)	for (i = 0; i < nbufs; i++)
if (acb[i])	if (acb[i])
free(acb[i]);	free(acb[i]);
free(acb);	free(acb);
return NULL;	return NULL;
} else	} else
memset(acb[i], 0, sizeof(struct aiocb));	memset(acb[i], 0, sizeof(struct aiocb));
Line 702 schedLIORead(sched_root_task_t * __restrict root, sche	Line 863 schedLIORead(sched_root_task_t * __restrict root, sche

if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {	if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {
LOGERR;	LOGERR;
	for (i = 0; i < nbufs; i++)
	if (acb[i])
	free(acb[i]);
	free(acb);
return NULL;	return NULL;
}	}

return schedAIO(root, func, arg, (void*) acb, bufs, nbufs);	return schedLIO(root, func, arg, (void*) acb, bufs, nbufs);
}	}

/*	/*
Line 720 schedLIORead(sched_root_task_t * __restrict root, sche	Line 885 schedLIORead(sched_root_task_t * __restrict root, sche
* @offset = Offset from start of file, if =-1 from current position	* @offset = Offset from start of file, if =-1 from current position
* return: NULL error or !=NULL new queued task	* return: NULL error or !=NULL new queued task
*/	*/
inline sched_task_t *	sched_task_t *
schedLIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,	schedLIOWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd,
struct iovec *bufs, size_t nbufs, off_t offset)	struct iovec *bufs, size_t nbufs, off_t offset)
{	{
Line 753 schedLIOWrite(sched_root_task_t * __restrict root, sch	Line 918 schedLIOWrite(sched_root_task_t * __restrict root, sch
for (i = 0; i < nbufs; i++)	for (i = 0; i < nbufs; i++)
if (acb[i])	if (acb[i])
free(acb[i]);	free(acb[i]);
free(acb);	free(acb);
return NULL;	return NULL;
} else	} else
memset(acb[i], 0, sizeof(struct aiocb));	memset(acb[i], 0, sizeof(struct aiocb));
Line 770 schedLIOWrite(sched_root_task_t * __restrict root, sch	Line 935 schedLIOWrite(sched_root_task_t * __restrict root, sch

if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {	if (lio_listio(LIO_NOWAIT, acb, nbufs, &sig)) {
LOGERR;	LOGERR;
	for (i = 0; i < nbufs; i++)
	if (acb[i])
	free(acb[i]);
	free(acb);
return NULL;	return NULL;
}	}

return schedAIO(root, func, arg, (void*) acb, bufs, nbufs);	return schedLIO(root, func, arg, (void*) acb, bufs, nbufs);
}	}
#endif /* EVFILT_LIO */	#endif /* EVFILT_LIO */
#endif /* EVFILT_AIO */	#endif /* AIO_SUPPORT */

/*	/*
* schedTimer() - Add TIMER task to scheduler queue	* schedTimer() - Add TIMER task to scheduler queue
Line 801 schedTimer(sched_root_task_t * __restrict root, sched_	Line 970 schedTimer(sched_root_task_t * __restrict root, sched_
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 850 schedTimer(sched_root_task_t * __restrict root, sched_	Line 1019 schedTimer(sched_root_task_t * __restrict root, sched_
pthread_mutex_unlock(&root->root_mtx[taskTIMER]);	pthread_mutex_unlock(&root->root_mtx[taskTIMER]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 877 schedEvent(sched_root_task_t * __restrict root, sched_	Line 1046 schedEvent(sched_root_task_t * __restrict root, sched_
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 904 schedEvent(sched_root_task_t * __restrict root, sched_	Line 1073 schedEvent(sched_root_task_t * __restrict root, sched_
pthread_mutex_unlock(&root->root_mtx[taskEVENT]);	pthread_mutex_unlock(&root->root_mtx[taskEVENT]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}


/*	/*
* schedEventLo() - Add EVENT_Lo task to scheduler queue	* schedTask() - Add regular task to scheduler queue
*	*
* @root = root task	* @root = root task
* @func = task execution function	* @func = task execution function
* @arg = 1st func argument	* @arg = 1st func argument
* @val = additional func argument	* @prio = regular task priority, 0 is hi priority for regular tasks
* @opt_data = Optional data	* @opt_data = Optional data
* @opt_dlen = Optional data length	* @opt_dlen = Optional data length
* return: NULL error or !=NULL new queued task	* return: NULL error or !=NULL new queued task
*/	*/
sched_task_t *	sched_task_t *
schedEventLo(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long val,	schedTask(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, u_long prio,
void *opt_data, size_t opt_dlen)	void *opt_data, size_t opt_dlen)
{	{
sched_task_t *task;	sched_task_t task, tmp, *t = NULL;
void *ptr;	void *ptr;

if (!root \|\| !func)	if (!root \|\| !func)
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
TASK_TYPE(task) = taskEVENT;	TASK_TYPE(task) = taskTASK;
TASK_ROOT(task) = root;	TASK_ROOT(task) = root;

TASK_ARG(task) = arg;	TASK_ARG(task) = arg;
TASK_VAL(task) = val;	TASK_VAL(task) = prio;

TASK_DATA(task) = opt_data;	TASK_DATA(task) = opt_data;
TASK_DATLEN(task) = opt_dlen;	TASK_DATLEN(task) = opt_dlen;

if (root->root_hooks.hook_add.eventlo)	if (root->root_hooks.hook_add.task)
ptr = root->root_hooks.hook_add.eventlo(task, NULL);	ptr = root->root_hooks.hook_add.task(task, NULL);
else	else
ptr = NULL;	ptr = NULL;

if (!ptr) {	if (!ptr) {
#ifdef HAVE_LIBPTHREAD	#ifdef HAVE_LIBPTHREAD
pthread_mutex_lock(&root->root_mtx[taskEVENTLO]);	pthread_mutex_lock(&root->root_mtx[taskTASK]);
#endif	#endif
TAILQ_INSERT_TAIL(&root->root_eventlo, TASK_ID(task), task_node);	TAILQ_FOREACH_SAFE(t, &root->root_task, task_node, tmp)
	if (TASK_VAL(task) < TASK_VAL(t))
	break;
	if (!t)
	TAILQ_INSERT_TAIL(&root->root_task, TASK_ID(task), task_node);
	else
	TAILQ_INSERT_BEFORE(t, TASK_ID(task), task_node);
#ifdef HAVE_LIBPTHREAD	#ifdef HAVE_LIBPTHREAD
pthread_mutex_unlock(&root->root_mtx[taskEVENTLO]);	pthread_mutex_unlock(&root->root_mtx[taskTASK]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 986 schedSuspend(sched_root_task_t * __restrict root, sche	Line 1161 schedSuspend(sched_root_task_t * __restrict root, sche
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 1013 schedSuspend(sched_root_task_t * __restrict root, sche	Line 1188 schedSuspend(sched_root_task_t * __restrict root, sche
pthread_mutex_unlock(&root->root_mtx[taskSUSPEND]);	pthread_mutex_unlock(&root->root_mtx[taskSUSPEND]);
#endif	#endif
} else	} else
task = _sched_unuseTask(task);	task = sched_unuseTask(task);

return task;	return task;
}	}
Line 1040 schedCallOnce(sched_root_task_t * __restrict root, sch	Line 1215 schedCallOnce(sched_root_task_t * __restrict root, sch
return NULL;	return NULL;

/* get new task */	/* get new task */
if (!(task = _sched_useTask(root)))	if (!(task = sched_useTask(root)))
return NULL;	return NULL;

task->task_func = func;	task->task_func = func;
Line 1055 schedCallOnce(sched_root_task_t * __restrict root, sch	Line 1230 schedCallOnce(sched_root_task_t * __restrict root, sch

ret = schedCall(task);	ret = schedCall(task);

_sched_unuseTask(task);	sched_unuseTask(task);
return ret;	return ret;
	}

	/*
	* schedThread() - Add thread task to scheduler queue
	*
	* @root = root task
	* @func = task execution function
	* @arg = 1st func argument
	* @ss = stack size
	* @opt_data = Optional data
	* @opt_dlen = Optional data length
	* return: NULL error or !=NULL new queued task
	*/
	sched_task_t *
	schedThread(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg,
	size_t ss, void *opt_data, size_t opt_dlen)
	{
	#ifndef HAVE_LIBPTHREAD
	sched_SetErr(ENOTSUP, "Not supported thread tasks");
	return NULL;
	#endif
	sched_task_t *task;
	pthread_attr_t attr;

	if (!root \|\| !func)
	return NULL;

	/* get new task */
	if (!(task = sched_useTask(root))) {

	return NULL;
	}

	task->task_func = func;
	TASK_TYPE(task) = taskTHREAD;
	TASK_ROOT(task) = root;

	TASK_ARG(task) = arg;

	TASK_DATA(task) = opt_data;
	TASK_DATLEN(task) = opt_dlen;

	pthread_attr_init(&attr);
	pthread_attr_setdetachstate(&attr, PTHREAD_DETACHED);
	if (ss && (errno = pthread_attr_setstacksize(&attr, ss))) {
	LOGERR;
	pthread_attr_destroy(&attr);
	return sched_unuseTask(task);
	}
	if ((errno = pthread_attr_getstacksize(&attr, &ss))) {
	LOGERR;
	pthread_attr_destroy(&attr);
	return sched_unuseTask(task);
	} else
	TASK_FLAG(task) = ss;
	if ((errno = pthread_attr_setguardsize(&attr, ss))) {
	LOGERR;
	pthread_attr_destroy(&attr);
	return sched_unuseTask(task);
	}
	#ifdef SCHED_RR
	pthread_attr_setschedpolicy(&attr, SCHED_RR);
	#else
	pthread_attr_setschedpolicy(&attr, SCHED_OTHER);
	#endif

	pthread_mutex_lock(&root->root_mtx[taskTHREAD]);
	TAILQ_INSERT_TAIL(&root->root_thread, TASK_ID(task), task_node);
	pthread_mutex_unlock(&root->root_mtx[taskTHREAD]);

	if (root->root_hooks.hook_add.thread)
	if (root->root_hooks.hook_add.thread(task, &attr)) {
	schedCancel(task);
	task = NULL;
	}
	pthread_attr_destroy(&attr);
	return task;
	}

	/*
	* schedRTC() - Add RTC task to scheduler queue
	*
	* @root = root task
	* @func = task execution function
	* @arg = 1st func argument
	* @ts = timeout argument structure, minimum alarm timer resolution is 1msec!
	* @opt_data = Optional RTC ID
	* @opt_dlen = Optional data length
	* return: NULL error or !=NULL new queued task
	*/
	sched_task_t *
	schedRTC(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, struct timespec ts,
	void *opt_data, size_t opt_dlen)
	{
	#if defined(HAVE_TIMER_CREATE) && defined(HAVE_TIMER_SETTIME)
	sched_task_t *task;
	void *ptr;

	if (!root \|\| !func)
	return NULL;

	/* get new task */
	if (!(task = sched_useTask(root)))
	return NULL;

	task->task_func = func;
	TASK_TYPE(task) = taskRTC;
	TASK_ROOT(task) = root;

	TASK_ARG(task) = arg;
	TASK_TS(task) = ts;

	TASK_DATA(task) = opt_data;
	TASK_DATLEN(task) = opt_dlen;

	if (root->root_hooks.hook_add.rtc)
	ptr = root->root_hooks.hook_add.rtc(task, NULL);
	else
	ptr = NULL;

	if (!ptr) {
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_lock(&root->root_mtx[taskRTC]);
	#endif
	TAILQ_INSERT_TAIL(&root->root_rtc, TASK_ID(task), task_node);
	#ifdef HAVE_LIBPTHREAD
	pthread_mutex_unlock(&root->root_mtx[taskRTC]);
	#endif
	} else
	task = sched_unuseTask(task);

	return task;
	#else
	sched_SetErr(ENOTSUP, "Not supported realtime clock extensions");
	return NULL;
	#endif
}	}

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>

Removed from v.1.10.2.7
changed lines
	Added in v.1.21.2.2