Subversion Repositories HelenOS

Rev

Rev 68 | Rev 380 | Go to most recent revision | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  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. static inline void link_initialize(link_t *link)
  41. {
  42.     link->prev = NULL;
  43.     link->next = NULL;
  44. }
  45.  
  46. static inline void list_initialize(link_t *head)
  47. {
  48.     head->prev = head;
  49.     head->next = head;
  50. }
  51.  
  52. static inline void list_prepend(link_t *link, link_t *head)
  53. {
  54.     link->next = head->next;
  55.     link->prev = head;
  56.     head->next->prev = link;
  57.     head->next = link;
  58. }
  59.  
  60. static inline void list_append(link_t *link, link_t *head)
  61. {
  62.     link->prev = head->prev;
  63.     link->next = head;
  64.     head->prev->next = link;
  65.     head->prev = link;
  66. }
  67.  
  68. static inline void list_remove(link_t *link)
  69. {
  70.     link->next->prev = link->prev;
  71.     link->prev->next = link->next;
  72.     link_initialize(link);
  73. }
  74.  
  75. static inline bool list_empty(link_t *head) { return head->next == head ? true : false; }
  76.  
  77. #define list_get_instance(link,type,member) (type *)(((__u8*)(link))-((__u8*)&(((type *)NULL)->member)))
  78.  
  79. extern bool list_member(const link_t *link, const link_t *head);
  80. extern void list_concat(link_t *head1, link_t *head2);
  81.  
  82. #endif
  83.