1 /* drm_linux_list.h -- linux list functions for the BSDs.
2 * Created: Mon Apr 7 14:30:16 1999 by anholt@FreeBSD.org
5 * Copyright 2003 Eric Anholt
8 * Permission is hereby granted, free of charge, to any person obtaining a
9 * copy of this software and associated documentation files (the "Software"),
10 * to deal in the Software without restriction, including without limitation
11 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
12 * and/or sell copies of the Software, and to permit persons to whom the
13 * Software is furnished to do so, subject to the following conditions:
15 * The above copyright notice and this permission notice (including the next
16 * paragraph) shall be included in all copies or substantial portions of the
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
22 * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
23 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
24 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
25 * OTHER DEALINGS IN THE SOFTWARE.
28 * Eric Anholt <anholt@FreeBSD.org>
33 struct list_head *next, *prev;
36 /* Cheat, assume the list_head is at the start of the struct */
37 #define list_entry(entry, type, member) (type *)(entry)
39 static __inline__ void
40 INIT_LIST_HEAD(struct list_head *head) {
46 list_empty(struct list_head *head) {
47 return (head)->next == head;
50 static __inline__ void
51 list_add_tail(struct list_head *entry, struct list_head *head) {
52 (entry)->prev = (head)->prev;
54 (head)->prev->next = entry;
58 static __inline__ void
59 list_del(struct list_head *entry) {
60 (entry)->next->prev = (entry)->prev;
61 (entry)->prev->next = (entry)->next;
64 #define list_for_each(entry, head) \
65 for (entry = (head)->next; entry != head; entry = (entry)->next)
67 #define list_for_each_safe(entry, temp, head) \
68 for (entry = (head)->next, temp = (entry)->next; \
70 entry = temp, temp = temp->next)