|
version 1.28, 2021/06/08 21:45:07
|
version 1.30, 2022/11/29 20:15:18
|
|
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 - 2019 | Copyright 2004 - 2022 |
| 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 67 sched_useTask(sched_root_task_t * __restrict root)
|
Line 67 sched_useTask(sched_root_task_t * __restrict root)
|
| SCHED_QUNLOCK(root, taskUNUSE); |
SCHED_QUNLOCK(root, taskUNUSE); |
| |
|
| if (!task) { |
if (!task) { |
| task = malloc(sizeof(sched_task_t)); | task = e_malloc(sizeof(sched_task_t)); |
| if (!task) { |
if (!task) { |
| LOGERR; |
LOGERR; |
| return NULL; |
return NULL; |
|
Line 133 sched_task_t *
|
Line 133 sched_task_t *
|
| schedRead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
schedRead(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
| void *opt_data, size_t opt_dlen) |
void *opt_data, size_t opt_dlen) |
| { |
{ |
| |
return schedReadExt(root, func, arg, fd, opt_data, opt_dlen, 0); |
| |
} |
| |
|
| |
/* |
| |
* schedReadExt() - Add READ I/O task to scheduler queue with custom event mask |
| |
* |
| |
* @root = root task |
| |
* @func = task execution function |
| |
* @arg = 1st func argument |
| |
* @fd = fd handle |
| |
* @opt_data = Optional data |
| |
* @opt_dlen = Optional data length |
| |
* @mask = Event mask |
| |
* return: NULL error or !=NULL new queued task |
| |
*/ |
| |
sched_task_t * |
| |
schedReadExt(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
| |
void *opt_data, size_t opt_dlen, u_long mask) |
| |
{ |
| sched_task_t *task; |
sched_task_t *task; |
| void *ptr; |
void *ptr; |
| |
|
|
Line 153 schedRead(sched_root_task_t * __restrict root, sched_t
|
Line 172 schedRead(sched_root_task_t * __restrict root, sched_t
|
| TASK_DATA(task) = opt_data; |
TASK_DATA(task) = opt_data; |
| TASK_DATLEN(task) = opt_dlen; |
TASK_DATLEN(task) = opt_dlen; |
| |
|
| |
TASK_HARG(task) = mask; |
| |
|
| if (root->root_hooks.hook_add.read) |
if (root->root_hooks.hook_add.read) |
| ptr = root->root_hooks.hook_add.read(task, NULL); | ptr = root->root_hooks.hook_add.read(task, |
| | (void*) task->task_harg); |
| else |
else |
| ptr = NULL; |
ptr = NULL; |
| |
|
|
Line 181 sched_task_t *
|
Line 203 sched_task_t *
|
| schedWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
schedWrite(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
| void *opt_data, size_t opt_dlen) |
void *opt_data, size_t opt_dlen) |
| { |
{ |
| |
return schedWriteExt(root, func, arg, fd, opt_data, opt_dlen, 0); |
| |
} |
| |
|
| |
/* |
| |
* schedWriteExt() - Add WRITE I/O task to scheduler queue with custom event mask |
| |
* |
| |
* @root = root task |
| |
* @func = task execution function |
| |
* @arg = 1st func argument |
| |
* @fd = fd handle |
| |
* @opt_data = Optional data |
| |
* @opt_dlen = Optional data length |
| |
* @mask = Event mask |
| |
* return: NULL error or !=NULL new queued task |
| |
*/ |
| |
sched_task_t * |
| |
schedWriteExt(sched_root_task_t * __restrict root, sched_task_func_t func, void *arg, int fd, |
| |
void *opt_data, size_t opt_dlen, u_long mask) |
| |
{ |
| sched_task_t *task; |
sched_task_t *task; |
| void *ptr; |
void *ptr; |
| |
|
|
Line 201 schedWrite(sched_root_task_t * __restrict root, sched_
|
Line 242 schedWrite(sched_root_task_t * __restrict root, sched_
|
| TASK_DATA(task) = opt_data; |
TASK_DATA(task) = opt_data; |
| TASK_DATLEN(task) = opt_dlen; |
TASK_DATLEN(task) = opt_dlen; |
| |
|
| |
TASK_HARG(task) = mask; |
| |
|
| if (root->root_hooks.hook_add.write) |
if (root->root_hooks.hook_add.write) |
| ptr = root->root_hooks.hook_add.write(task, NULL); | ptr = root->root_hooks.hook_add.write(task, |
| | (void*) task->task_harg); |
| else |
else |
| ptr = NULL; |
ptr = NULL; |
| |
|
|
Line 631 schedAIORead(sched_root_task_t * __restrict root, sche
|
Line 675 schedAIORead(sched_root_task_t * __restrict root, sche
|
| } else |
} else |
| off = offset; |
off = offset; |
| |
|
| if (!(acb = malloc(sizeof(struct aiocb)))) { | if (!(acb = e_malloc(sizeof(struct aiocb)))) { |
| LOGERR; |
LOGERR; |
| return NULL; |
return NULL; |
| } else |
} else |
|
Line 647 schedAIORead(sched_root_task_t * __restrict root, sche
|
Line 691 schedAIORead(sched_root_task_t * __restrict root, sche
|
| |
|
| if (aio_read(acb)) { |
if (aio_read(acb)) { |
| LOGERR; |
LOGERR; |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } |
} |
| |
|
|
Line 690 schedAIOWrite(sched_root_task_t * __restrict root, sch
|
Line 734 schedAIOWrite(sched_root_task_t * __restrict root, sch
|
| } else |
} else |
| off = offset; |
off = offset; |
| |
|
| if (!(acb = malloc(sizeof(struct aiocb)))) { | if (!(acb = e_malloc(sizeof(struct aiocb)))) { |
| LOGERR; |
LOGERR; |
| return NULL; |
return NULL; |
| } else |
} else |
|
Line 706 schedAIOWrite(sched_root_task_t * __restrict root, sch
|
Line 750 schedAIOWrite(sched_root_task_t * __restrict root, sch
|
| |
|
| if (aio_write(acb)) { |
if (aio_write(acb)) { |
| LOGERR; |
LOGERR; |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } |
} |
| |
|
|
Line 805 schedLIORead(sched_root_task_t * __restrict root, sche
|
Line 849 schedLIORead(sched_root_task_t * __restrict root, sche
|
| } else |
} else |
| off = offset; |
off = offset; |
| |
|
| if (!(acb = calloc(sizeof(void*), nbufs))) { | if (!(acb = e_calloc(sizeof(void*), nbufs))) { |
| LOGERR; |
LOGERR; |
| return NULL; |
return NULL; |
| } else |
} else |
| memset(acb, 0, sizeof(void*) * nbufs); |
memset(acb, 0, sizeof(void*) * nbufs); |
| for (i = 0; i < nbufs; off += bufs[i++].iov_len) { |
for (i = 0; i < nbufs; off += bufs[i++].iov_len) { |
| acb[i] = malloc(sizeof(struct aiocb)); | acb[i] = e_malloc(sizeof(struct aiocb)); |
| if (!acb[i]) { |
if (!acb[i]) { |
| LOGERR; |
LOGERR; |
| for (i = 0; i < nbufs; i++) |
for (i = 0; i < nbufs; i++) |
| if (acb[i]) |
if (acb[i]) |
| free(acb[i]); | e_free(acb[i]); |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } else |
} else |
| memset(acb[i], 0, sizeof(struct aiocb)); |
memset(acb[i], 0, sizeof(struct aiocb)); |
|
Line 836 schedLIORead(sched_root_task_t * __restrict root, sche
|
Line 880 schedLIORead(sched_root_task_t * __restrict root, sche
|
| LOGERR; |
LOGERR; |
| for (i = 0; i < nbufs; i++) |
for (i = 0; i < nbufs; i++) |
| if (acb[i]) |
if (acb[i]) |
| free(acb[i]); | e_free(acb[i]); |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } |
} |
| |
|
|
Line 882 schedLIOWrite(sched_root_task_t * __restrict root, sch
|
Line 926 schedLIOWrite(sched_root_task_t * __restrict root, sch
|
| } else |
} else |
| off = offset; |
off = offset; |
| |
|
| if (!(acb = calloc(sizeof(void*), nbufs))) { | if (!(acb = e_calloc(sizeof(void*), nbufs))) { |
| LOGERR; |
LOGERR; |
| return NULL; |
return NULL; |
| } else |
} else |
| memset(acb, 0, sizeof(void*) * nbufs); |
memset(acb, 0, sizeof(void*) * nbufs); |
| for (i = 0; i < nbufs; off += bufs[i++].iov_len) { |
for (i = 0; i < nbufs; off += bufs[i++].iov_len) { |
| acb[i] = malloc(sizeof(struct aiocb)); | acb[i] = e_malloc(sizeof(struct aiocb)); |
| if (!acb[i]) { |
if (!acb[i]) { |
| LOGERR; |
LOGERR; |
| for (i = 0; i < nbufs; i++) |
for (i = 0; i < nbufs; i++) |
| if (acb[i]) |
if (acb[i]) |
| free(acb[i]); | e_free(acb[i]); |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } else |
} else |
| memset(acb[i], 0, sizeof(struct aiocb)); |
memset(acb[i], 0, sizeof(struct aiocb)); |
|
Line 913 schedLIOWrite(sched_root_task_t * __restrict root, sch
|
Line 957 schedLIOWrite(sched_root_task_t * __restrict root, sch
|
| LOGERR; |
LOGERR; |
| for (i = 0; i < nbufs; i++) |
for (i = 0; i < nbufs; i++) |
| if (acb[i]) |
if (acb[i]) |
| free(acb[i]); | e_free(acb[i]); |
| free(acb); | e_free(acb); |
| return NULL; |
return NULL; |
| } |
} |
| |
|