1 | /*
|
---|
2 | * Copyright (c) 2010 Matus Dekanek
|
---|
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 | /** @addtogroup drvusbhub
|
---|
29 | * @{
|
---|
30 | */
|
---|
31 | /** @file
|
---|
32 | * @brief usblist implementation
|
---|
33 | */
|
---|
34 | #include <sys/types.h>
|
---|
35 |
|
---|
36 | #include "usbhub_private.h"
|
---|
37 |
|
---|
38 |
|
---|
39 | usb_general_list_t * usb_lst_create(void) {
|
---|
40 | usb_general_list_t* result = usb_new(usb_general_list_t);
|
---|
41 | usb_lst_init(result);
|
---|
42 | return result;
|
---|
43 | }
|
---|
44 |
|
---|
45 | void usb_lst_init(usb_general_list_t * lst) {
|
---|
46 | lst->prev = lst;
|
---|
47 | lst->next = lst;
|
---|
48 | lst->data = NULL;
|
---|
49 | }
|
---|
50 |
|
---|
51 | void usb_lst_prepend(usb_general_list_t* item, void* data) {
|
---|
52 | usb_general_list_t* appended = usb_new(usb_general_list_t);
|
---|
53 | appended->data = data;
|
---|
54 | appended->next = item;
|
---|
55 | appended->prev = item->prev;
|
---|
56 | item->prev->next = appended;
|
---|
57 | item->prev = appended;
|
---|
58 | }
|
---|
59 |
|
---|
60 | void usb_lst_append(usb_general_list_t* item, void* data) {
|
---|
61 | usb_general_list_t* appended = usb_new(usb_general_list_t);
|
---|
62 | appended->data = data;
|
---|
63 | appended->next = item->next;
|
---|
64 | appended->prev = item;
|
---|
65 | item->next->prev = appended;
|
---|
66 | item->next = appended;
|
---|
67 | }
|
---|
68 |
|
---|
69 | void usb_lst_remove(usb_general_list_t* item) {
|
---|
70 | item->next->prev = item->prev;
|
---|
71 | item->prev->next = item->next;
|
---|
72 | }
|
---|
73 |
|
---|
74 |
|
---|
75 |
|
---|
76 | /**
|
---|
77 | * @}
|
---|
78 | */
|
---|
79 |
|
---|
80 |
|
---|