coffee/wepoll
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

queue: move implementation from header to queue.c

Browse Source
This commit is contained in:
Bert Belder 2017-09-14 16:24:48 +02:00
parent 2a8fd0f5a2
commit 34df608b98
2 changed files with 61 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
src/queue.c Normal file
View File

@ -0,0 +1,50 @@
#include <stdbool.h>
#include <stdlib.h>
#include "queue.h"
void queue_init(queue_t* queue) {
queue_node_init(&queue->head);
}
void queue_node_init(queue_node_t* node) {
node->prev = node;
node->next = node;
}
queue_node_t* queue_first(const queue_t* queue) {
return !queue_empty(queue) ? queue->head.next : NULL;
}
queue_node_t* queue_last(const queue_t* queue) {
return !queue_empty(queue) ? queue->head.prev : NULL;
}
void queue_prepend(queue_t* queue, queue_node_t* node) {
node->next = queue->head.next;
node->prev = &queue->head;
node->next->prev = node;
queue->head.next = node;
}
void queue_append(queue_t* queue, queue_node_t* node) {
node->next = &queue->head;
node->prev = queue->head.prev;
node->prev->next = node;
queue->head.prev = node;
}
void queue_remove(queue_node_t* node) {
node->prev->next = node->next;
node->next->prev = node->prev;
node->prev = node;
node->next = node;
}
bool queue_empty(const queue_t* queue) {
return !queue_enqueued(&queue->head);
}
bool queue_enqueued(const queue_node_t* node) {
return node->prev != node;
}

54
src/queue.h
View File

@ -2,63 +2,31 @@
#define QUEUE_H_
#include <stdbool.h>
#include <stdlib.h>
#include "internal.h"
typedef struct queue_node queue_node_t;
typedef struct queue_node {
queue_node_t* prev;
queue_node_t* next;
} queue_node_t;
typedef struct queue {
queue_node_t head;
} queue_t;
EPOLL_INTERNAL inline void queue_node_init(queue_node_t* node) {
node->prev = node;
node->next = node;
}
EPOLL_INTERNAL void queue_init(queue_t* queue);
EPOLL_INTERNAL void queue_node_init(queue_node_t* node);
EPOLL_INTERNAL inline void queue_init(queue_t* queue) {
queue_node_init(&queue->head);
}
EPOLL_INTERNAL queue_node_t* queue_first(const queue_t* queue);
EPOLL_INTERNAL queue_node_t* queue_last(const queue_t* queue);
EPOLL_INTERNAL inline bool queue_enqueued(const queue_node_t* node) {
return node->prev != node;
}
EPOLL_INTERNAL void queue_prepend(queue_t* queue, queue_node_t* node);
EPOLL_INTERNAL void queue_append(queue_t* queue, queue_node_t* node);
EPOLL_INTERNAL void queue_remove(queue_node_t* node);
EPOLL_INTERNAL inline bool queue_empty(const queue_t* queue) {
return !queue_enqueued(&queue->head);
}
EPOLL_INTERNAL inline queue_node_t* queue_first(const queue_t* queue) {
return !queue_empty(queue) ? queue->head.next : NULL;
}
EPOLL_INTERNAL inline queue_node_t* queue_last(const queue_t* queue) {
return !queue_empty(queue) ? queue->head.prev : NULL;
}
EPOLL_INTERNAL inline void queue_prepend(queue_t* queue, queue_node_t* node) {
node->next = queue->head.next;
node->prev = &queue->head;
node->next->prev = node;
queue->head.next = node;
}
EPOLL_INTERNAL inline void queue_append(queue_t* queue, queue_node_t* node) {
node->next = &queue->head;
node->prev = queue->head.prev;
node->prev->next = node;
queue->head.prev = node;
}
EPOLL_INTERNAL inline void queue_remove(queue_node_t* node) {
node->prev->next = node->next;
node->next->prev = node->prev;
node->prev = node;
node->next = node;
}
EPOLL_INTERNAL bool queue_empty(const queue_t* queue);
EPOLL_INTERNAL bool queue_enqueued(const queue_node_t* node);
#endif /* QUEUE_H_ */