wash/mango
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

kernel: don't use typedef for enums or non-opaque structs

Browse Source
This commit is contained in:
max 🍓
2023-04-12 20:17:11 +01:00
parent 0d75e347e9
commit b6f8c1ccaa
51 changed files with 663 additions and 665 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
ds/queue.c
View File

@@ -1,9 +1,9 @@
#include <socks/queue.h>
size_t queue_length(queue_t *q)
size_t queue_length(struct queue *q)
{
size_t i = 0;
queue_entry_t *x = q->q_first;
struct queue_entry *x = q->q_first;
while (x) {
i++;
x = x->qe_next;
@@ -12,9 +12,9 @@ size_t queue_length(queue_t *q)
return i;
}
void queue_insert_before(queue_t *q, queue_entry_t *entry, queue_entry_t *before)
void queue_insert_before(struct queue *q, struct queue_entry *entry, struct queue_entry *before)
{
queue_entry_t *x = before->qe_prev;
struct queue_entry *x = before->qe_prev;
if (x) {
x->qe_next = entry;
} else {
@@ -27,9 +27,9 @@ void queue_insert_before(queue_t *q, queue_entry_t *entry, queue_entry_t *before
entry->qe_next = before;
}
void queue_insert_after(queue_t *q, queue_entry_t *entry, queue_entry_t *after)
void queue_insert_after(struct queue *q, struct queue_entry *entry, struct queue_entry *after)
{
queue_entry_t *x = after->qe_next;
struct queue_entry *x = after->qe_next;
if (x) {
x->qe_prev = entry;
} else {
@@ -42,7 +42,7 @@ void queue_insert_after(queue_t *q, queue_entry_t *entry, queue_entry_t *after)
entry->qe_prev = after;
}
void queue_push_front(queue_t *q, queue_entry_t *entry)
void queue_push_front(struct queue *q, struct queue_entry *entry)
{
if (q->q_first) {
q->q_first->qe_prev = entry;
@@ -58,7 +58,7 @@ void queue_push_front(queue_t *q, queue_entry_t *entry)
}
}
void queue_push_back(queue_t *q, queue_entry_t *entry)
void queue_push_back(struct queue *q, struct queue_entry *entry)
{
if (q->q_last) {
q->q_last->qe_next = entry;
@@ -74,9 +74,9 @@ void queue_push_back(queue_t *q, queue_entry_t *entry)
}
}
queue_entry_t *queue_pop_front(queue_t *q)
struct queue_entry *queue_pop_front(struct queue *q)
{
queue_entry_t *x = q->q_first;
struct queue_entry *x = q->q_first;
if (x) {
queue_delete(q, x);
}
@@ -84,9 +84,9 @@ queue_entry_t *queue_pop_front(queue_t *q)
return x;
}
queue_entry_t *queue_pop_back(queue_t *q)
struct queue_entry *queue_pop_back(struct queue *q)
{
queue_entry_t *x = q->q_last;
struct queue_entry *x = q->q_last;
if (x) {
queue_delete(q, x);
}
@@ -94,7 +94,7 @@ queue_entry_t *queue_pop_back(queue_t *q)
return x;
}
void queue_delete(queue_t *q, queue_entry_t *entry)
void queue_delete(struct queue *q, struct queue_entry *entry)
{
if (!entry) {
return;
@@ -119,11 +119,11 @@ void queue_delete(queue_t *q, queue_entry_t *entry)
entry->qe_next = entry->qe_prev = NULL;
}
void queue_delete_all(queue_t *q)
void queue_delete_all(struct queue *q)
{
queue_entry_t *x = q->q_first;
struct queue_entry *x = q->q_first;
while (x) {
queue_entry_t *next = x->qe_next;
struct queue_entry *next = x->qe_next;
x->qe_next = x->qe_prev = NULL;
x = next;
}