WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/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 genericadt
 * @{
 */
 
/**
 * @file    list.c
 * @brief   Functions completing doubly linked circular list implementaion.
 *
 * This file contains some of the functions implementing doubly linked circular lists.
 * However, this ADT is mostly implemented in @ref list.h.
 */
 
#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.
 *
 */
bool list_member(const link_t *link, const link_t *head)
{
    bool 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)/kernel/trunk/generic/src/adt/list.c – Rev 1248 → 1702

Rev 1248		Rev 1702
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 genericadt
-		30	* @{
-		31	*/
-		32
29	/**	33	/**
30	* @file list.c	34	* @file list.c
31	* @brief Functions completing doubly linked circular list implementaion.	35	* @brief Functions completing doubly linked circular list implementaion.
32	*	36	*
33	* This file contains some of the functions implementing doubly linked circular lists.	37	* This file contains some of the functions implementing doubly linked circular lists.
34	* However, this ADT is mostly implemented in @ref list.h.	38	* However, this ADT is mostly implemented in @ref list.h.
35	*/	39	*/
36		40
37	#include <adt/list.h>	41	#include <adt/list.h>
38		42
39	/** Check for membership	43	/** Check for membership
40	*	44	*
41	* Check whether link is contained in the list head.	45	* Check whether link is contained in the list head.
42	* The membership is defined as pointer equivalence.	46	* The membership is defined as pointer equivalence.
43	*	47	*
44	* @param link Item to look for.	48	* @param link Item to look for.
45	* @param head List to look in.	49	* @param head List to look in.
46	*	50	*
47	* @return true if link is contained in head, false otherwise.	51	* @return true if link is contained in head, false otherwise.
48	*	52	*
49	*/	53	*/
50	bool list_member(const link_t link, const link_t head)	54	bool list_member(const link_t link, const link_t head)
51	{	55	{
52	bool found = false;	56	bool found = false;
53	link_t *hlp = head->next;	57	link_t *hlp = head->next;
54		58
55	while (hlp != head) {	59	while (hlp != head) {
56	if (hlp == link) {	60	if (hlp == link) {
57	found = true;	61	found = true;
58	break;	62	break;
59	}	63	}
60	hlp = hlp->next;	64	hlp = hlp->next;
61	}	65	}
62		66
63	return found;	67	return found;
64	}	68	}
65		69
66		70
67	/** Concatenate two lists	71	/** Concatenate two lists
68	*	72	*
69	* Concatenate lists head1 and head2, producing a single	73	* Concatenate lists head1 and head2, producing a single
70	* list head1 containing items from both (in head1, head2	74	* list head1 containing items from both (in head1, head2
71	* order) and empty list head2.	75	* order) and empty list head2.
72	*	76	*
73	* @param head1 First list and concatenated output	77	* @param head1 First list and concatenated output
74	* @param head2 Second list and empty output.	78	* @param head2 Second list and empty output.
75	*	79	*
76	*/	80	*/
77	void list_concat(link_t head1, link_t head2)	81	void list_concat(link_t head1, link_t head2)
78	{	82	{
79	if (list_empty(head2))	83	if (list_empty(head2))
80	return;	84	return;
81		85
82	head2->next->prev = head1->prev;	86	head2->next->prev = head1->prev;
83	head2->prev->next = head1;	87	head2->prev->next = head1;
84	head1->prev->next = head2->next;	88	head1->prev->next = head2->next;
85	head1->prev = head2->prev;	89	head1->prev = head2->prev;
86	list_initialize(head2);	90	list_initialize(head2);
87	}	91	}
-		92
-		93	/** @}
-		94	*/
-		95
88		96