Subversion Repositories HelenOS-historic

Rev

Rev 999 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
996 cejka 1 
/*
2 
 * Copyright (C) 2001-2004 Jakub Jermar
3 
 * All rights reserved.
4 
 *
5 
 * Redistribution and use in source and binary forms, with or without
6 
 * modification, are permitted provided that the following conditions
7 
 * are met:
8 
 *
9 
 * - Redistributions of source code must retain the above copyright
10 
 *   notice, this list of conditions and the following disclaimer.
11 
 * - Redistributions in binary form must reproduce the above copyright
12 
 *   notice, this list of conditions and the following disclaimer in the
13 
 *   documentation and/or other materials provided with the distribution.
14 
 * - The name of the author may not be used to endorse or promote products
15 
 *   derived from this software without specific prior written permission.
16 
 *
17 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 
 */
28 
 
29 
#ifndef __LIST_H__
30 
#define __LIST_H__
31 
 
32 
#include<unistd.h>
33 
 
34 
#ifndef true
35 
# define true 1
36 
#endif
37 
#ifndef false
38 
# define false 0
39 
#endif
40 
 
41 
typedef struct link link_t;
42 
 
43 
/** Doubly linked list head and link type. */
44 
struct link {
45 
    link_t *prev;   /**< Pointer to the previous item in the list. */
46 
    link_t *next;   /**< Pointer to the next item in the list. */
47 
};
48 
 
49 
/** Declare and initialize statically allocated list.
50 
 *
51 
 * @param name Name of the new statically allocated list.
52 
 */
53 
#define LIST_INITIALIZE(name)       link_t name = { .prev = &name, .next = &name }
54 
 
55 
/** Initialize doubly-linked circular list link
56 
 *
57 
 * Initialize doubly-linked list link.
58 
 *
59 
 * @param link Pointer to link_t structure to be initialized.
60 
 */
61 
static inline void link_initialize(link_t *link)
62 
{
63 
    link->prev = NULL;
64 
    link->next = NULL;
65 
}
66 
 
67 
/** Initialize doubly-linked circular list
68 
 *
69 
 * Initialize doubly-linked circular list.
70 
 *
71 
 * @param head Pointer to link_t structure representing head of the list.
72 
 */
73 
static inline void list_initialize(link_t *head)
74 
{
75 
    head->prev = head;
76 
    head->next = head;
77 
}
78 
 
79 
/** Add item to the beginning of doubly-linked circular list
80 
 *
81 
 * Add item to the beginning of doubly-linked circular list.
82 
 *
83 
 * @param link Pointer to link_t structure to be added.
84 
 * @param head Pointer to link_t structure representing head of the list.
85 
 */
86 
static inline void list_prepend(link_t *link, link_t *head)
87 
{
88 
    link->next = head->next;
89 
    link->prev = head;
90 
    head->next->prev = link;
91 
    head->next = link;
92 
}
93 
 
94 
/** Add item to the end of doubly-linked circular list
95 
 *
96 
 * Add item to the end of doubly-linked circular list.
97 
 *
98 
 * @param link Pointer to link_t structure to be added.
99 
 * @param head Pointer to link_t structure representing head of the list.
100 
 */
101 
static inline void list_append(link_t *link, link_t *head)
102 
{
103 
    link->prev = head->prev;
104 
    link->next = head;
105 
    head->prev->next = link;
106 
    head->prev = link;
107 
}
108 
 
109 
/** Remove item from doubly-linked circular list
110 
 *
111 
 * Remove item from doubly-linked circular list.
112 
 *
113 
 * @param link Pointer to link_t structure to be removed from the list it is contained in.
114 
 */
115 
static inline void list_remove(link_t *link)
116 
{
117 
    link->next->prev = link->prev;
118 
    link->prev->next = link->next;
119 
    link_initialize(link);
120 
}
121 
 
122 
/** Query emptiness of doubly-linked circular list
123 
 *
124 
 * Query emptiness of doubly-linked circular list.
125 
 *
126 
 * @param head Pointer to link_t structure representing head of the list.
127 
 */
128 
static inline int list_empty(link_t *head)
129 
{
130 
    return head->next == head ? true : false;
131 
}
132 
 
133 
 
134 
/** Split or concatenate headless doubly-linked circular list
135 
 *
136 
 * Split or concatenate headless doubly-linked circular list.
137 
 *
138 
 * Note that the algorithm works both directions:
139 
 * concatenates splitted lists and splits concatenated lists.
140 
 *
141 
 * @param part1 Pointer to link_t structure leading the first (half of the headless) list.
142 
 * @param part2 Pointer to link_t structure leading the second (half of the headless) list.
143 
 */
144 
static inline void headless_list_split_or_concat(link_t *part1, link_t *part2)
145 
{
146 
    link_t *hlp;
147 
 
148 
    part1->prev->next = part2;
149 
    part2->prev->next = part1; 
150 
    hlp = part1->prev;
151 
    part1->prev = part2->prev;
152 
    part2->prev = hlp;
153 
}
154 
 
155 
 
156 
/** Split headless doubly-linked circular list
157 
 *
158 
 * Split headless doubly-linked circular list.
159 
 *
160 
 * @param part1 Pointer to link_t structure leading the first half of the headless list.
161 
 * @param part2 Pointer to link_t structure leading the second half of the headless list.
162 
 */
163 
static inline void headless_list_split(link_t *part1, link_t *part2)
164 
{
165 
    headless_list_split_or_concat(part1, part2);
166 
}
167 
 
168 
/** Concatenate two headless doubly-linked circular lists
169 
 *
170 
 * Concatenate two headless doubly-linked circular lists.
171 
 *
172 
 * @param part1 Pointer to link_t structure leading the first headless list.
173 
 * @param part2 Pointer to link_t structure leading the second headless list.
174 
 */
175 
static inline void headless_list_concat(link_t *part1, link_t *part2)
176 
{
177 
    headless_list_split_or_concat(part1, part2);
178 
}
179 
 
999 palkovsky 180 
#define list_get_instance(link,type,member) (type *)(((char *)(link))-((char *)&(((type *)NULL)->member)))
996 cejka 181 
 
182 
extern int list_member(const link_t *link, const link_t *head);
183 
extern void list_concat(link_t *head1, link_t *head2);
184 
 
185 
#endif