Rev 365 | Rev 430 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 365 | Rev 380 | ||
---|---|---|---|
Line 35... | Line 35... | ||
35 | struct link { |
35 | struct link { |
36 | link_t *prev; |
36 | link_t *prev; |
37 | link_t *next; |
37 | link_t *next; |
38 | }; |
38 | }; |
39 | 39 | ||
- | 40 | /** Initialize doubly-linked circular list link |
|
- | 41 | * |
|
- | 42 | * Initialize doubly-linked list link. |
|
- | 43 | * |
|
- | 44 | * @param link Pointer to link_t structure to be initialized. |
|
- | 45 | */ |
|
40 | static inline void link_initialize(link_t *link) |
46 | static inline void link_initialize(link_t *link) |
41 | { |
47 | { |
42 | link->prev = NULL; |
48 | link->prev = NULL; |
43 | link->next = NULL; |
49 | link->next = NULL; |
44 | } |
50 | } |
45 | 51 | ||
- | 52 | /** Initialize doubly-linked circular list |
|
- | 53 | * |
|
- | 54 | * Initialize doubly-linked circular list. |
|
- | 55 | * |
|
- | 56 | * @param head Pointer to link_t structure representing head of the list. |
|
- | 57 | */ |
|
46 | static inline void list_initialize(link_t *head) |
58 | static inline void list_initialize(link_t *head) |
47 | { |
59 | { |
48 | head->prev = head; |
60 | head->prev = head; |
49 | head->next = head; |
61 | head->next = head; |
50 | } |
62 | } |
51 | 63 | ||
- | 64 | /** Add item to the beginning of doubly-linked circular list |
|
- | 65 | * |
|
- | 66 | * Add item to the beginning of doubly-linked circular list. |
|
- | 67 | * |
|
- | 68 | * @param link Pointer to link_t structure to be added. |
|
- | 69 | * @param head Pointer to link_t structure representing head of the list. |
|
- | 70 | */ |
|
52 | static inline void list_prepend(link_t *link, link_t *head) |
71 | static inline void list_prepend(link_t *link, link_t *head) |
53 | { |
72 | { |
54 | link->next = head->next; |
73 | link->next = head->next; |
55 | link->prev = head; |
74 | link->prev = head; |
56 | head->next->prev = link; |
75 | head->next->prev = link; |
57 | head->next = link; |
76 | head->next = link; |
58 | } |
77 | } |
59 | 78 | ||
- | 79 | /** Add item to the end of doubly-linked circular list |
|
- | 80 | * |
|
- | 81 | * Add item to the end 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 | */ |
|
60 | static inline void list_append(link_t *link, link_t *head) |
86 | static inline void list_append(link_t *link, link_t *head) |
61 | { |
87 | { |
62 | link->prev = head->prev; |
88 | link->prev = head->prev; |
63 | link->next = head; |
89 | link->next = head; |
64 | head->prev->next = link; |
90 | head->prev->next = link; |
65 | head->prev = link; |
91 | head->prev = link; |
66 | } |
92 | } |
67 | 93 | ||
- | 94 | /** Remove item from doubly-linked circular list |
|
- | 95 | * |
|
- | 96 | * Remove item from doubly-linked circular list. |
|
- | 97 | * |
|
- | 98 | * @param link Pointer to link_t structure to be removed from the list it is contained in. |
|
- | 99 | */ |
|
68 | static inline void list_remove(link_t *link) |
100 | static inline void list_remove(link_t *link) |
69 | { |
101 | { |
70 | link->next->prev = link->prev; |
102 | link->next->prev = link->prev; |
71 | link->prev->next = link->next; |
103 | link->prev->next = link->next; |
72 | link_initialize(link); |
104 | link_initialize(link); |
73 | } |
105 | } |
74 | 106 | ||
- | 107 | /** Query emptiness of doubly-linked circular list |
|
- | 108 | * |
|
- | 109 | * Query emptiness of doubly-linked circular list. |
|
- | 110 | * |
|
- | 111 | * @param head Pointer to link_t structure representing head of the list. |
|
- | 112 | */ |
|
75 | static inline bool list_empty(link_t *head) { return head->next == head ? true : false; } |
113 | static inline bool list_empty(link_t *head) |
- | 114 | { |
|
- | 115 | return head->next == head ? true : false; |
|
- | 116 | } |
|
- | 117 | ||
- | 118 | ||
- | 119 | /** Split or concatenate headless doubly-linked circular list |
|
- | 120 | * |
|
- | 121 | * Split or concatenate headless doubly-linked circular list. |
|
- | 122 | * |
|
- | 123 | * Note that the algorithm works both directions: |
|
- | 124 | * concatenates splitted lists and splits concatenated lists. |
|
- | 125 | * |
|
- | 126 | * @param part1 Pointer to link_t structure leading the first (half of the headless) list. |
|
- | 127 | * @param part2 Pointer to link_t structure leading the second (half of the headless) list. |
|
- | 128 | */ |
|
- | 129 | static inline void headless_list_split_or_concat(link_t *part1, link_t *part2) |
|
- | 130 | { |
|
- | 131 | link_t *hlp; |
|
- | 132 | ||
- | 133 | part1->prev->next = part2; |
|
- | 134 | part2->prev->next = part1; |
|
- | 135 | hlp = part1->prev; |
|
- | 136 | part1->prev = part2->prev; |
|
- | 137 | part2->prev = hlp; |
|
- | 138 | } |
|
- | 139 | ||
- | 140 | ||
- | 141 | /** Split headless doubly-linked circular list |
|
- | 142 | * |
|
- | 143 | * Split headless doubly-linked circular list. |
|
- | 144 | * |
|
- | 145 | * @param part1 Pointer to link_t structure leading the first half of the headless list. |
|
- | 146 | * @param part2 Pointer to link_t structure leading the second half of the headless list. |
|
- | 147 | */ |
|
- | 148 | static inline void headless_list_split(link_t *part1, link_t *part2) |
|
- | 149 | { |
|
- | 150 | headless_list_split_or_concat(part1, part2); |
|
- | 151 | } |
|
- | 152 | ||
- | 153 | /** Concatenate two headless doubly-linked circular lists |
|
- | 154 | * |
|
- | 155 | * Concatenate two headless doubly-linked circular lists. |
|
- | 156 | * |
|
- | 157 | * @param part1 Pointer to link_t structure leading the first headless list. |
|
- | 158 | * @param part2 Pointer to link_t structure leading the second headless list. |
|
- | 159 | */ |
|
- | 160 | static inline void headless_list_concat(link_t *part1, link_t *part2) |
|
- | 161 | { |
|
- | 162 | headless_list_split_or_concat(part1, part2); |
|
- | 163 | } |
|
76 | 164 | ||
77 | #define list_get_instance(link,type,member) (type *)(((__u8*)(link))-((__u8*)&(((type *)NULL)->member))) |
165 | #define list_get_instance(link,type,member) (type *)(((__u8*)(link))-((__u8*)&(((type *)NULL)->member))) |
78 | 166 | ||
79 | extern bool list_member(const link_t *link, const link_t *head); |
167 | extern bool list_member(const link_t *link, const link_t *head); |
80 | extern void list_concat(link_t *head1, link_t *head2); |
168 | extern void list_concat(link_t *head1, link_t *head2); |