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 static int list_is_empty(struct udev_list_node *list)
48 return list->next == list;
51 static void list_node_insert_between(struct udev_list_node *new,
52 struct udev_list_node *prev,
53 struct udev_list_node *next)
61 static void list_node_remove(struct udev_list_node *entry)
63 struct udev_list_node *prev = entry->prev;
64 struct udev_list_node *next = entry->next;
73 /* return list entry which embeds this node */
74 static struct udev_list_entry *list_node_to_entry(struct udev_list_node *node)
79 list -= offsetof(struct udev_list_entry, node);
80 return (struct udev_list_entry *)list;
83 /* insert entry into a list as the last element */
84 static void list_entry_append(struct udev_list_entry *new, struct udev_list_node *list)
86 /* inserting before the list head make the node the last node in the list */
87 list_node_insert_between(&new->node, list->prev, list);
91 /* insert entry into a list, before a given existing entry */
92 static void list_entry_insert_before(struct udev_list_entry *new, struct udev_list_entry *entry)
94 list_node_insert_between(&new->node, entry->node.prev, &entry->node);
95 new->list = entry->list;
98 struct udev_list_entry *udev_list_entry_add(struct udev *udev, struct udev_list_node *list,
99 const char *name, const char *value,
100 int unique, int sort)
102 struct udev_list_entry *entry_loop = NULL;
103 struct udev_list_entry *entry_new;
106 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
107 if (strcmp(entry_loop->name, name) == 0) {
108 info(udev, "'%s' is already in the list\n", name);
109 free(entry_loop->value);
111 entry_loop->value = NULL;
112 info(udev, "'%s' value unset\n", name);
115 entry_loop->value = strdup(value);
116 if (entry_loop->value == NULL)
118 info(udev, "'%s' value replaced with '%s'\n", name, value);
124 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
125 if (strcmp(entry_loop->name, name) > 0)
129 entry_new = malloc(sizeof(struct udev_list_entry));
130 if (entry_new == NULL)
132 memset(entry_new, 0x00, sizeof(struct udev_list_entry));
133 entry_new->udev = udev;
134 entry_new->name = strdup(name);
135 if (entry_new->name == NULL) {
140 entry_new->value = strdup(value);
141 if (entry_new->value == NULL) {
142 free(entry_new->name);
147 if (entry_loop != NULL)
148 list_entry_insert_before(entry_new, entry_loop);
150 list_entry_append(entry_new, list);
151 info(udev, "'%s=%s' added\n", entry_new->name, entry_new->value);
155 void udev_list_entry_remove(struct udev_list_entry *entry)
157 list_node_remove(&entry->node);
163 void udev_list_cleanup(struct udev *udev, struct udev_list_node *list)
165 struct udev_list_entry *entry_loop;
166 struct udev_list_entry *entry_tmp;
168 list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
169 udev_list_entry_remove(entry_loop);
172 void udev_list_entry_move_to_end(struct udev_list_entry *list_entry)
174 list_node_remove(&list_entry->node);
175 list_node_insert_between(&list_entry->node, list_entry->list->prev, list_entry->list);
178 struct udev_list_entry *udev_list_get_entry(struct udev_list_node *list)
180 if (list_is_empty(list))
182 return list_node_to_entry(list->next);
185 struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry)
187 struct udev_list_node *next;
189 if (list_entry == NULL)
191 next = list_entry->node.next;
192 /* empty list or no more entries */
193 if (next == list_entry->list)
195 return list_node_to_entry(next);
198 struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name)
200 struct udev_list_entry *entry;
202 udev_list_entry_foreach(entry, list_entry) {
203 if (strcmp(udev_list_entry_get_name(entry), name) == 0) {
204 dbg(entry->udev, "found '%s=%s'\n", entry->name, entry->value);
211 const char *udev_list_entry_get_name(struct udev_list_entry *list_entry)
213 if (list_entry == NULL)
215 return list_entry->name;
218 const char *udev_list_entry_get_value(struct udev_list_entry *list_entry)
220 if (list_entry == NULL)
222 return list_entry->value;
225 extern int udev_list_entry_get_flag(struct udev_list_entry *list_entry)
227 if (list_entry == NULL)
229 return list_entry->flag;
232 extern void udev_list_entry_set_flag(struct udev_list_entry *list_entry, int flag)
234 if (list_entry == NULL)
236 list_entry->flag = flag;