Subversion Repositories HelenOS-historic

Rev

Rev 534 | Rev 1248 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
1 jermar 1
/*
2
 * Copyright (C) 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
 
788 jermar 29
#include <adt/list.h>
1 jermar 30
 
62 decky 31
 
32
/** Check for membership
33
 *
34
 * Check whether link is contained in the list head.
35
 * The membership is defined as pointer equivalence.
36
 *
37
 * @param link Item to look for.
38
 * @param head List to look in.
39
 *
67 decky 40
 * @return true if link is contained in head, false otherwise.
62 decky 41
 *
42
 */
67 decky 43
bool list_member(const link_t *link, const link_t *head)
1 jermar 44
{
67 decky 45
	bool found = false;
1 jermar 46
	link_t *hlp = head->next;
47
 
48
	while (hlp != head) {
49
		if (hlp == link) {
67 decky 50
			found = true;
1 jermar 51
			break;
52
		}
53
		hlp = hlp->next;
54
	}
55
 
56
	return found;
57
}
58
 
62 decky 59
 
60
/** Concatenate two lists
61
 *
62
 * Concatenate lists head1 and head2, producing a single
63
 * list head1 containing items from both (in head1, head2
64
 * order) and empty list head2.
65
 *
66
 * @param head1 First list and concatenated output
67
 * @param head2 Second list and empty output.
68
 *
69
 */
1 jermar 70
void list_concat(link_t *head1, link_t *head2)
71
{
72
	if (list_empty(head2))
73
		return;
74
 
75
	head2->next->prev = head1->prev;
76
	head2->prev->next = head1;	
77
	head1->prev->next = head2->next;
78
	head1->prev = head2->prev;
79
	list_initialize(head2);
80
}