byedpi/conev.c

198 lines
4.2 KiB
C
Raw Normal View History

2023-06-03 19:52:10 +00:00
#define CONEV_H
#include <conev.h>
#include <stdlib.h>
#include <string.h>
struct poolhd *init_pool(int count)
{
struct poolhd *pool = malloc(sizeof(struct poolhd));
if (!pool) {
return 0;
}
pool->max = count;
pool->count = 0;
#ifndef NOEPOLL
int efd = epoll_create(count);
if (efd < 0) {
free(pool);
return 0;
}
pool->efd = efd;
#endif
pool->pevents = malloc(sizeof(*pool->pevents) * count);
pool->links = malloc(sizeof(*pool->links) * count);
pool->items = malloc(sizeof(*pool->items) * count);
if (!pool->pevents || !pool->links || !pool->items) {
destroy_pool(pool);
return 0;
}
for (int i = 0; i < count; i++) {
pool->links[i] = &(pool->items[i]);
}
return pool;
}
struct eval *add_event(struct poolhd *pool, enum eid type,
int fd, int e)
{
if (pool->count >= pool->max)
return 0;
struct eval *val = pool->links[pool->count];
2024-03-08 00:37:02 +00:00
memset(val, 0, sizeof(*val));
2023-06-03 19:52:10 +00:00
val->fd = fd;
val->index = pool->count;
val->type = type;
#ifndef NOEPOLL
struct epoll_event ev = {
EPOLLIN | EPOLLERR | EPOLLRDHUP | e, {val}
};
if (epoll_ctl(pool->efd, EPOLL_CTL_ADD, fd, &ev)) {
return 0;
}
val->events = ev.events;
#else
struct pollfd *pfd = &(pool->pevents[pool->count]);
pfd->fd = fd;
2024-02-18 20:20:52 +00:00
pfd->events = POLLIN | e;
2023-06-03 19:52:10 +00:00
pfd->revents = 0;
#endif
pool->count++;
return val;
}
void del_event(struct poolhd *pool, struct eval *val)
{
if (!val->fd) {
return;
}
2024-03-08 00:37:02 +00:00
if (val->buff.data) {
free(val->buff.data);
val->buff.data = 0;
2023-07-03 17:59:39 +00:00
}
2023-06-03 19:52:10 +00:00
close(val->fd);
val->fd = 0;
pool->count--;
struct eval *ev = pool->links[pool->count];
if (ev != val)
{
int index = val->index;
pool->links[index] = ev;
pool->links[pool->count] = val;
#ifdef NOEPOLL
pool->pevents[index] = pool->pevents[pool->count];
#endif
ev->index = index;
}
if (val->pair) {
2023-07-06 18:21:44 +00:00
if (val->pair == val) {
val->pair->pair = 0;
}
2023-06-03 19:52:10 +00:00
del_event(pool, val->pair);
2023-07-06 18:21:44 +00:00
val->pair = 0;
2023-06-03 19:52:10 +00:00
}
}
void destroy_pool(struct poolhd *pool)
{
for (int x = 0; x < pool->count; x++) {
struct eval *val = pool->links[x];
2023-07-03 17:59:39 +00:00
if (val->fd) {
close(val->fd);
2023-08-20 13:30:03 +00:00
val->fd = 0;
2023-07-03 17:59:39 +00:00
}
2024-03-08 00:37:02 +00:00
if (val->buff.data) {
free(val->buff.data);
val->buff.data = 0;
2023-07-03 17:59:39 +00:00
}
2023-06-03 19:52:10 +00:00
}
if (pool->items) {
free(pool->items);
}
if (pool->links) {
free(pool->links);
}
if (pool->pevents) {
free(pool->pevents);
}
#ifndef NOEPOLL
if (pool->efd)
close(pool->efd);
#endif
memset(pool, 0, sizeof(*pool));
free(pool);
}
#ifndef NOEPOLL
struct eval *next_event(struct poolhd *pool, int *offs, int *type)
{
int i = *offs;
if (i < 0) {
i = (epoll_wait(pool->efd, pool->pevents, pool->max, -1) - 1);
if (i < 0) {
return 0;
}
}
*offs = i - 1;
*type = pool->pevents[i].events;
return pool->pevents[i].data.ptr;
}
int mod_etype(struct poolhd *pool, struct eval *val, int type, char add)
{
struct epoll_event ev = {
.events = val->events, .data = {val}
};
if (add)
ev.events |= type;
else
ev.events &= ~type;
val->events = ev.events;
return epoll_ctl(pool->efd, EPOLL_CTL_MOD, val->fd, &ev);
2023-06-03 19:52:10 +00:00
}
#else
struct eval *next_event(struct poolhd *pool, int *offs, int *typel)
{
for (int i = *offs; ; i--) {
if (i < 0) {
if (poll(pool->pevents, pool->count, -1) <= 0) {
return 0;
}
i = pool->count - 1;
}
short type = pool->pevents[i].revents;
if (!type)
continue;
pool->pevents[i].revents = 0;
*offs = i - 1;
*typel = type;
return pool->links[i];
}
}
int mod_etype(struct poolhd *pool, struct eval *val, int type, char add)
{
int index = val->index;
if (add)
pool->pevents[index].events |= type;
else
pool->pevents[index].events &= ~type;
return 0;
}
#endif