Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added a initque() inline function.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/trunk/current@1972 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler 2002-11-17 01:35:01 +00:00
parent b795251564
commit ab25550f8e
1 changed files with 20 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
headers/private/kernel/kqueue.h
View File

@ -5,6 +5,9 @@
#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.
@ -15,13 +18,24 @@ struct quehead {
};
/** Inserts an element (a) to the queue (b) */
/** Initializes a queue to be used */
static inline void
insque(void *a, void *b)
initque(void *_head)
{
struct quehead *element = (struct quehead *)a,
*head = (struct quehead *)b;
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;
@ -33,9 +47,9 @@ insque(void *a, void *b)
/** removes an element from the queue it's currently in */
static inline void
remque(void *a)
remque(void *_element)
{
struct quehead *element = (struct quehead *)a;
struct quehead *element = (struct quehead *)_element;
element->next->prev = element->prev;
element->prev->next = element->next;