WebSVN – HelenOS-historic – Diff – /uspace/trunk/libc/generic/libadt/list.c


/*
 * Copyright (C) 2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <libadt/list.h>
 
 
/** Check for membership
 *
 * Check whether link is contained in the list head.
 * The membership is defined as pointer equivalence.
 *
 * @param link Item to look for.
 * @param head List to look in.
 *
 * @return true if link is contained in head, false otherwise.
 *
 */
int list_member(const link_t *link, const link_t *head)
{
    int found = false;
    link_t *hlp = head->next;
   
    while (hlp != head) {
        if (hlp == link) {
            found = true;
            break;
        }
        hlp = hlp->next;
    }
   
    return found;
}
 
 
/** Concatenate two lists
 *
 * Concatenate lists head1 and head2, producing a single
 * list head1 containing items from both (in head1, head2
 * order) and empty list head2.
 *
 * @param head1 First list and concatenated output
 * @param head2 Second list and empty output.
 *
 */
void list_concat(link_t *head1, link_t *head2)
{
    if (list_empty(head2))
        return;
 
    head2->next->prev = head1->prev;
    head2->prev->next = head1; 
    head1->prev->next = head2->next;
    head1->prev = head2->prev;
    list_initialize(head2);
}
 

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/libc/generic/libadt/list.c – Rev 996 → 1392

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