Rev 788 | Rev 1702 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 788 | Rev 1248 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2004 Jakub Jermar |
2 | * Copyright (C) 2004 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
- | 29 | /** |
|
29 | #include <adt/list.h> |
30 | * @file list.c |
- | 31 | * @brief Functions completing doubly linked circular list implementaion. |
|
- | 32 | * |
|
- | 33 | * This file contains some of the functions implementing doubly linked circular lists. |
|
- | 34 | * However, this ADT is mostly implemented in @ref list.h. |
|
- | 35 | */ |
|
30 | 36 | ||
- | 37 | #include <adt/list.h> |
|
31 | 38 | ||
32 | /** Check for membership |
39 | /** Check for membership |
33 | * |
40 | * |
34 | * Check whether link is contained in the list head. |
41 | * Check whether link is contained in the list head. |
35 | * The membership is defined as pointer equivalence. |
42 | * The membership is defined as pointer equivalence. |
36 | * |
43 | * |
37 | * @param link Item to look for. |
44 | * @param link Item to look for. |
38 | * @param head List to look in. |
45 | * @param head List to look in. |
39 | * |
46 | * |
40 | * @return true if link is contained in head, false otherwise. |
47 | * @return true if link is contained in head, false otherwise. |
41 | * |
48 | * |
42 | */ |
49 | */ |
43 | bool list_member(const link_t *link, const link_t *head) |
50 | bool list_member(const link_t *link, const link_t *head) |
44 | { |
51 | { |
45 | bool found = false; |
52 | bool found = false; |
46 | link_t *hlp = head->next; |
53 | link_t *hlp = head->next; |
47 | 54 | ||
48 | while (hlp != head) { |
55 | while (hlp != head) { |
49 | if (hlp == link) { |
56 | if (hlp == link) { |
50 | found = true; |
57 | found = true; |
51 | break; |
58 | break; |
52 | } |
59 | } |
53 | hlp = hlp->next; |
60 | hlp = hlp->next; |
54 | } |
61 | } |
55 | 62 | ||
56 | return found; |
63 | return found; |
57 | } |
64 | } |
58 | 65 | ||
59 | 66 | ||
60 | /** Concatenate two lists |
67 | /** Concatenate two lists |
61 | * |
68 | * |
62 | * Concatenate lists head1 and head2, producing a single |
69 | * Concatenate lists head1 and head2, producing a single |
63 | * list head1 containing items from both (in head1, head2 |
70 | * list head1 containing items from both (in head1, head2 |
64 | * order) and empty list head2. |
71 | * order) and empty list head2. |
65 | * |
72 | * |
66 | * @param head1 First list and concatenated output |
73 | * @param head1 First list and concatenated output |
67 | * @param head2 Second list and empty output. |
74 | * @param head2 Second list and empty output. |
68 | * |
75 | * |
69 | */ |
76 | */ |
70 | void list_concat(link_t *head1, link_t *head2) |
77 | void list_concat(link_t *head1, link_t *head2) |
71 | { |
78 | { |
72 | if (list_empty(head2)) |
79 | if (list_empty(head2)) |
73 | return; |
80 | return; |
74 | 81 | ||
75 | head2->next->prev = head1->prev; |
82 | head2->next->prev = head1->prev; |
76 | head2->prev->next = head1; |
83 | head2->prev->next = head1; |
77 | head1->prev->next = head2->next; |
84 | head1->prev->next = head2->next; |
78 | head1->prev = head2->prev; |
85 | head1->prev = head2->prev; |
79 | list_initialize(head2); |
86 | list_initialize(head2); |
80 | } |
87 | } |
81 | 88 |