1 /* drm_linux_list.h -- linux list functions for the BSDs. 2 * Created: Mon Apr 7 14:30:16 1999 by anholt@FreeBSD.org 3 */ 4 /*- 5 * Copyright 2003 Eric Anholt 6 * All Rights Reserved. 7 * 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: 14 * 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 17 * Software. 18 * 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. 26 * 27 * Authors: 28 * Eric Anholt <anholt@FreeBSD.org> 29 * 30 */ 31 32 struct list_head { 33 struct list_head *next, *prev; 34 }; 35 36 /* Cheat, assume the list_head is at the start of the struct */ 37 #define list_entry(entry, type, member) (type *)(entry) 38 39 static __inline__ void 40 INIT_LIST_HEAD(struct list_head *head) { 41 (head)->next = head; 42 (head)->prev = head; 43 } 44 45 static __inline__ int 46 list_empty(struct list_head *head) { 47 return (head)->next == head; 48 } 49 50 static __inline__ void 51 list_add_tail(struct list_head *entry, struct list_head *head) { 52 (entry)->prev = (head)->prev; 53 (entry)->next = head; 54 (head)->prev->next = entry; 55 (head)->prev = entry; 56 } 57 58 static __inline__ void 59 list_del(struct list_head *entry) { 60 (entry)->next->prev = (entry)->prev; 61 (entry)->prev->next = (entry)->next; 62 } 63 64 #define list_for_each(entry, head) \ 65 for (entry = (head)->next; entry != head; entry = (entry)->next) 66 67 #define list_for_each_prev(entry, head) \ 68 for (entry = (head)->prev; entry != (head); \ 69 entry = entry->prev) 70 71 #define list_for_each_safe(entry, temp, head) \ 72 for (entry = (head)->next, temp = (entry)->next; \ 73 entry != head; \ 74 entry = temp, temp = entry->next) 75 76