2 * libudev - interface to udev device information
4 * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org>
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
28 #include "libudev-private.h"
30 struct udev_list_entry {
32 struct udev_list_node node;
33 struct udev_list_node *list;
39 /* list head point to itself if empty */
40 void udev_list_init(struct udev_list_node *list)
46 int udev_list_is_empty(struct udev_list_node *list)
48 return list->next == list;
51 static void udev_list_node_insert_between(struct udev_list_node *new,
52 struct udev_list_node *prev,
53 struct udev_list_node *next)
61 void udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list)
63 udev_list_node_insert_between(new, list->prev, list);
66 void udev_list_node_remove(struct udev_list_node *entry)
68 struct udev_list_node *prev = entry->prev;
69 struct udev_list_node *next = entry->next;
78 /* return list entry which embeds this node */
79 static struct udev_list_entry *list_node_to_entry(struct udev_list_node *node)
84 list -= offsetof(struct udev_list_entry, node);
85 return (struct udev_list_entry *)list;
88 /* insert entry into a list as the last element */
89 static void list_entry_append(struct udev_list_entry *new, struct udev_list_node *list)
91 /* inserting before the list head make the node the last node in the list */
92 udev_list_node_insert_between(&new->node, list->prev, list);
96 /* insert entry into a list, before a given existing entry */
97 static void list_entry_insert_before(struct udev_list_entry *new, struct udev_list_entry *entry)
99 udev_list_node_insert_between(&new->node, entry->node.prev, &entry->node);
100 new->list = entry->list;
103 struct udev_list_entry *udev_list_entry_add(struct udev *udev, struct udev_list_node *list,
104 const char *name, const char *value,
105 int unique, int sort)
107 struct udev_list_entry *entry_loop = NULL;
108 struct udev_list_entry *entry_new;
111 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
112 if (strcmp(entry_loop->name, name) == 0) {
113 info(udev, "'%s' is already in the list\n", name);
114 free(entry_loop->value);
116 entry_loop->value = NULL;
117 info(udev, "'%s' value unset\n", name);
120 entry_loop->value = strdup(value);
121 if (entry_loop->value == NULL)
123 info(udev, "'%s' value replaced with '%s'\n", name, value);
129 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
130 if (strcmp(entry_loop->name, name) > 0)
134 entry_new = malloc(sizeof(struct udev_list_entry));
135 if (entry_new == NULL)
137 memset(entry_new, 0x00, sizeof(struct udev_list_entry));
138 entry_new->udev = udev;
139 entry_new->name = strdup(name);
140 if (entry_new->name == NULL) {
145 entry_new->value = strdup(value);
146 if (entry_new->value == NULL) {
147 free(entry_new->name);
152 if (entry_loop != NULL)
153 list_entry_insert_before(entry_new, entry_loop);
155 list_entry_append(entry_new, list);
156 dbg(udev, "'%s=%s' added\n", entry_new->name, entry_new->value);
160 void udev_list_entry_remove(struct udev_list_entry *entry)
162 udev_list_node_remove(&entry->node);
168 void udev_list_cleanup_entries(struct udev *udev, struct udev_list_node *list)
170 struct udev_list_entry *entry_loop;
171 struct udev_list_entry *entry_tmp;
173 udev_list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
174 udev_list_entry_remove(entry_loop);
177 void udev_list_entry_move_to_end(struct udev_list_entry *list_entry)
179 udev_list_node_remove(&list_entry->node);
180 udev_list_node_insert_between(&list_entry->node, list_entry->list->prev, list_entry->list);
183 void udev_list_entry_move_before(struct udev_list_entry *list_entry, struct udev_list_entry *entry)
185 udev_list_node_remove(&list_entry->node);
186 udev_list_node_insert_between(&list_entry->node, entry->node.prev, &entry->node);
187 list_entry->list = entry->list;
190 struct udev_list_entry *udev_list_get_entry(struct udev_list_node *list)
192 if (udev_list_is_empty(list))
194 return list_node_to_entry(list->next);
197 struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry)
199 struct udev_list_node *next;
201 if (list_entry == NULL)
203 next = list_entry->node.next;
204 /* empty list or no more entries */
205 if (next == list_entry->list)
207 return list_node_to_entry(next);
210 struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name)
212 struct udev_list_entry *entry;
214 udev_list_entry_foreach(entry, list_entry) {
215 if (strcmp(udev_list_entry_get_name(entry), name) == 0) {
216 dbg(entry->udev, "found '%s=%s'\n", entry->name, entry->value);
223 const char *udev_list_entry_get_name(struct udev_list_entry *list_entry)
225 if (list_entry == NULL)
227 return list_entry->name;
230 const char *udev_list_entry_get_value(struct udev_list_entry *list_entry)
232 if (list_entry == NULL)
234 return list_entry->value;
237 extern int udev_list_entry_get_flag(struct udev_list_entry *list_entry)
239 if (list_entry == NULL)
241 return list_entry->flag;
244 extern void udev_list_entry_set_flag(struct udev_list_entry *list_entry, int flag)
246 if (list_entry == NULL)
248 list_entry->flag = flag;