kernel/util: Remove kqueue.h.

It is not used anymore, and we have more advanced queuing facilities now.
This commit is contained in:
Augustin Cavalier 2022-06-03 17:18:32 -04:00
parent 679a91d179
commit eb26002b47
2 changed files with 0 additions and 64 deletions

View File

@ -1,63 +0,0 @@
/*
** Copyright 2002, Axel Dörfler, axeld@pinc-software.de. All rights reserved.
** Distributed under the terms of the MIT License.
*/
#ifndef KQUEUE_H
#define KQUEUE_H
/* The name "que" actually means that it is a very
* light-weight implementation of a queue ;-))
*/
/* The object that is put into a queue must begin with these
* fields, but it doesn't have to be this structure.
*/
struct quehead {
struct quehead *next;
struct quehead *prev;
};
/* You can use this macro to iterate through the queue. */
#define kqueue_foreach(head, element) \
for ((element) = (void *)(head)->next; (element) != (void *)(head); (element) = (void *)((struct quehead *)(element))->next)
/** Initializes a queue to be used */
static inline void
initque(void *_head)
{
struct quehead *head = (struct quehead *)_head;
head->next = head->prev = head;
}
/** Inserts an element (_element) to the queue (_head) */
static inline void
insque(void *_element, void *_head)
{
struct quehead *element = (struct quehead *)_element,
*head = (struct quehead *)_head;
element->next = head->next;
element->prev = head;
head->next = element;
element->next->prev = element;
}
/** removes an element from the queue it's currently in */
static inline void
remque(void *_element)
{
struct quehead *element = (struct quehead *)_element;
element->next->prev = element->prev;
element->prev->next = element->next;
element->prev = 0;
}
#endif /* KQUEUE_H */

View File

@ -25,7 +25,6 @@
#include <elf.h>
#include <load_tracking.h>
#include <util/AutoLock.h>
#include <util/kqueue.h>
#include <smp.h>
#include "kernel_debug_config.h"