Rev 67 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 1 | jermar | 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 <arch/types.h> |
||
| 33 | #include <typedefs.h> |
||
| 34 | |||
| 35 | struct link { |
||
| 36 | link_t *prev; |
||
| 37 | link_t *next; |
||
| 38 | }; |
||
| 39 | |||
| 40 | |||
| 41 | #define link_initialize(link) { \ |
||
| 42 | (link)->prev = NULL; \ |
||
| 43 | (link)->next = NULL; \ |
||
| 44 | } |
||
| 45 | |||
| 46 | #define list_initialize(head) { \ |
||
| 47 | (head)->prev = (head); \ |
||
| 48 | (head)->next = (head); \ |
||
| 49 | } |
||
| 50 | |||
| 51 | #define list_prepend(link, head) { \ |
||
| 52 | (link)->next = (head)->next; \ |
||
| 53 | (link)->prev = (head); \ |
||
| 54 | (head)->next->prev = (link); \ |
||
| 55 | (head)->next = (link); \ |
||
| 56 | } |
||
| 57 | |||
| 58 | #define list_append(link, head) { \ |
||
| 59 | (link)->prev = (head)->prev; \ |
||
| 60 | (link)->next = (head); \ |
||
| 61 | (head)->prev->next = (link); \ |
||
| 62 | (head)->prev = (link); \ |
||
| 63 | } |
||
| 64 | |||
| 65 | #define list_remove(link) { \ |
||
| 66 | (link)->next->prev = (link)->prev; \ |
||
| 67 | (link)->prev->next = (link)->next; \ |
||
| 68 | link_initialize(link); \ |
||
| 69 | } |
||
| 70 | |||
| 71 | #define list_empty(head) (((head)->next == (head))?1:0) |
||
| 72 | |||
| 73 | #define list_get_instance(link,type,member) (type *)(((__u8*)(link))-((__u8*)&(((type *)NULL)->member))) |
||
| 74 | |||
| 75 | extern int list_member(link_t *link, link_t *head); |
||
| 76 | extern void list_concat(link_t *head1, link_t *head2); |
||
| 77 | |||
| 78 | #endif |