WebSVN – HelenOS – Diff – /trunk/uspace/lib/libc/generic/adt/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.
 */
 
/** @addtogroup libc
 * @{
 */
/** @file
 */
 
#include <adt/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 = 0;
    link_t *hlp = head->next;
   
    while (hlp != head) {
        if (hlp == link) {
            found = 1;
            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);
}
 
 
/** Count list items
 *
 * Return the number of items in the list.
 *
 * @param link List to count.
 *
 * @return Number of items in the list.
 *
 */
unsigned int list_count(const link_t *link)
{
    unsigned int count = 0;
    link_t *hlp = link->next;
   
    while (hlp != link) {
        count++;
        hlp = hlp->next;
    }
   
    return count;
}
 
/** @}
 */
 

Rev 4415	Rev 4509
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	/** @addtogroup libc	29	/** @addtogroup libc
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#include <libadt/list.h>	35	#include <adt/list.h>
36		36
37		37
38	/** Check for membership	38	/** Check for membership
39	*	39	*
40	* Check whether link is contained in the list head.	40	* Check whether link is contained in the list head.
41	* The membership is defined as pointer equivalence.	41	* The membership is defined as pointer equivalence.
42	*	42	*
43	* @param link Item to look for.	43	* @param link Item to look for.
44	* @param head List to look in.	44	* @param head List to look in.
45	*	45	*
46	* @return true if link is contained in head, false otherwise.	46	* @return true if link is contained in head, false otherwise.
47	*	47	*
48	*/	48	*/
49	int list_member(const link_t link, const link_t head)	49	int list_member(const link_t link, const link_t head)
50	{	50	{
51	int found = 0;	51	int found = 0;
52	link_t *hlp = head->next;	52	link_t *hlp = head->next;
53		53
54	while (hlp != head) {	54	while (hlp != head) {
55	if (hlp == link) {	55	if (hlp == link) {
56	found = 1;	56	found = 1;
57	break;	57	break;
58	}	58	}
59	hlp = hlp->next;	59	hlp = hlp->next;
60	}	60	}
61		61
62	return found;	62	return found;
63	}	63	}
64		64
65		65
66	/** Concatenate two lists	66	/** Concatenate two lists
67	*	67	*
68	* Concatenate lists head1 and head2, producing a single	68	* Concatenate lists head1 and head2, producing a single
69	* list head1 containing items from both (in head1, head2	69	* list head1 containing items from both (in head1, head2
70	* order) and empty list head2.	70	* order) and empty list head2.
71	*	71	*
72	* @param head1 First list and concatenated output	72	* @param head1 First list and concatenated output
73	* @param head2 Second list and empty output.	73	* @param head2 Second list and empty output.
74	*	74	*
75	*/	75	*/
76	void list_concat(link_t head1, link_t head2)	76	void list_concat(link_t head1, link_t head2)
77	{	77	{
78	if (list_empty(head2))	78	if (list_empty(head2))
79	return;	79	return;
80		80
81	head2->next->prev = head1->prev;	81	head2->next->prev = head1->prev;
82	head2->prev->next = head1;	82	head2->prev->next = head1;
83	head1->prev->next = head2->next;	83	head1->prev->next = head2->next;
84	head1->prev = head2->prev;	84	head1->prev = head2->prev;
85	list_initialize(head2);	85	list_initialize(head2);
86	}	86	}
87		87
88		88
89	/** Count list items	89	/** Count list items
90	*	90	*
91	* Return the number of items in the list.	91	* Return the number of items in the list.
92	*	92	*
93	* @param link List to count.	93	* @param link List to count.
94	*	94	*
95	* @return Number of items in the list.	95	* @return Number of items in the list.
96	*	96	*
97	*/	97	*/
98	unsigned int list_count(const link_t *link)	98	unsigned int list_count(const link_t *link)
99	{	99	{
100	unsigned int count = 0;	100	unsigned int count = 0;
101	link_t *hlp = link->next;	101	link_t *hlp = link->next;
102		102
103	while (hlp != link) {	103	while (hlp != link) {
104	count++;	104	count++;
105	hlp = hlp->next;	105	hlp = hlp->next;
106	}	106	}
107		107
108	return count;	108	return count;
109	}	109	}
110		110
111	/** @}	111	/** @}
112	*/	112	*/
113		113

Subversion Repositories HelenOS

(root)/trunk/uspace/lib/libc/generic/adt/list.c – Rev 4415 → 4509