c/libcdsb
1
0
Fork 0
Code Issues 5 Pull Requests Actions Packages Projects Releases Wiki Activity

Add queue_t

Browse Source
This commit is contained in:
Gregory Lirent 2022-09-13 10:37:40 +03:00
parent 828fe1caac
commit c0294bc1f0
2 changed files with 106 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
include/bits/memory.h
View File

@ -12,6 +12,11 @@ typedef struct libcdsb_stack_node {
void* value;
} stack_t;
typedef struct libcdsb_queue {
struct libcdsb_stack_node* back;
struct libcdsb_stack_node* front;
} queue_t;
extern void libcdsb_stack_init (stack_t* stack) Nonnull__(1);
extern void libcdsb_stack_push (stack_t* stack, void* value) Nonnull__(1);
extern void libcdsb_stack_push_many(stack_t* stack, size_t n, ...) Nonnull__(1);
@ -19,6 +24,12 @@ extern void* libcdsb_stack_pop (stack_t* stack) Nonnull__(1)
extern void libcdsb_stack_reverse (stack_t* stack) Nonnull__(1);
extern void libcdsb_stack_flush (stack_t* stack) Nonnull__(1);
extern void libcdsb_queue_init (queue_t* queue) Nonnull__(1);
extern void libcdsb_queue_push (queue_t* queue, void* value) Nonnull__(1);
extern void libcdsb_queue_push_many(queue_t* queue, size_t n, ...) Nonnull__(1);
extern void* libcdsb_queue_pop (queue_t* queue) Nonnull__(1);
extern void libcdsb_queue_flush (queue_t* queue) Nonnull__(1);
extern void* libcdsb_aalloc (size_t a, size_t n) Warn_unused_result__;
extern void* libcdsb_malloc (size_t n) Warn_unused_result__;
extern void* libcdsb_calloc (size_t n, size_t c) Warn_unused_result__;

95
src/queue.c Normal file
View File

@ -0,0 +1,95 @@
/* This software is licensed by the MIT License, see LICENSE file */
/* Copyright © 2022 Gregory Lirent */
#include <stdarg.h>
#include <stdlib.h>
#include "__internal/include.h"
#undef malloc
#undef free
void libcdsb_queue_init(queue_t* x) {
memset(x, 0, sizeof(*x));
}
void libcdsb_queue_push(queue_t* x, void* value) {
stack_t* n;
if (!(n = malloc(sizeof(*n))))
abort();
n->prev = 0;
if (!x->back) {
x->front = n;
x->back = n;
} else x->back->prev = n;
n->value = value;
}
void libcdsb_queue_push_many(queue_t* x, size_t c, ...) {
va_list args;
stack_t* n;
va_start(args, c);
if (c) {
if (!x->back) {
if (!(n = malloc(sizeof(*n))))
abort();
x->front = n;
x->back = n;
n->prev = 0;
n->value = va_arg(args, void*);
--c;
}
while (c--) {
if (!(n = malloc(sizeof(*n))))
abort();
x->back->prev = n;
n->prev = 0;
n->value = va_arg(args, void*);
}
}
va_end(args);
}
void* libcdsb_queue_pop(queue_t* x) {
stack_t* n;
void* v;
if (x->front) {
n = x->front;
v = n->value;
if (!(x->front = n->prev)) {
x->back = 0;
}
free(n);
} else v = 0;
return v;
}
void libcdsb_queue_flush(queue_t* x) {
stack_t* c;
c = x->front;
while (x->front) {
c = x->front;
x->front = c->prev;
free(c);
}
x->back = 0;
}