2 * libudev - interface to udev device information
4 * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org>
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
20 #include "libudev-private.h"
22 struct udev_list_entry {
23 struct udev_list_node node;
25 struct udev_list_node *list;
31 /* list head point to itself if empty */
32 void udev_list_init(struct udev_list_node *list)
38 int udev_list_is_empty(struct udev_list_node *list)
40 return list->next == list;
43 static void udev_list_node_insert_between(struct udev_list_node *new,
44 struct udev_list_node *prev,
45 struct udev_list_node *next)
53 void udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list)
55 udev_list_node_insert_between(new, list->prev, list);
58 void udev_list_node_remove(struct udev_list_node *entry)
60 struct udev_list_node *prev = entry->prev;
61 struct udev_list_node *next = entry->next;
70 /* return list entry which embeds this node */
71 static struct udev_list_entry *list_node_to_entry(struct udev_list_node *node)
76 list -= offsetof(struct udev_list_entry, node);
77 return (struct udev_list_entry *)list;
80 /* insert entry into a list as the last element */
81 void udev_list_entry_append(struct udev_list_entry *new, struct udev_list_node *list)
83 /* inserting before the list head make the node the last node in the list */
84 udev_list_node_insert_between(&new->node, list->prev, list);
88 /* remove entry from a list */
89 void udev_list_entry_remove(struct udev_list_entry *entry)
91 udev_list_node_remove(&entry->node);
95 /* insert entry into a list, before a given existing entry */
96 void udev_list_entry_insert_before(struct udev_list_entry *new, struct udev_list_entry *entry)
98 udev_list_node_insert_between(&new->node, entry->node.prev, &entry->node);
99 new->list = entry->list;
102 struct udev_list_entry *udev_list_entry_add(struct udev *udev, struct udev_list_node *list,
103 const char *name, const char *value,
104 int unique, int sort)
106 struct udev_list_entry *entry_loop = NULL;
107 struct udev_list_entry *entry_new;
110 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
111 if (strcmp(entry_loop->name, name) == 0) {
112 dbg(udev, "'%s' is already in the list\n", name);
113 free(entry_loop->value);
115 entry_loop->value = NULL;
116 dbg(udev, "'%s' value unset\n", name);
119 entry_loop->value = strdup(value);
120 if (entry_loop->value == NULL)
122 dbg(udev, "'%s' value replaced with '%s'\n", name, value);
128 udev_list_entry_foreach(entry_loop, udev_list_get_entry(list)) {
129 if (strcmp(entry_loop->name, name) > 0)
133 entry_new = malloc(sizeof(struct udev_list_entry));
134 if (entry_new == NULL)
136 memset(entry_new, 0x00, sizeof(struct udev_list_entry));
137 entry_new->udev = udev;
138 entry_new->name = strdup(name);
139 if (entry_new->name == NULL) {
144 entry_new->value = strdup(value);
145 if (entry_new->value == NULL) {
146 free(entry_new->name);
151 if (entry_loop != NULL)
152 udev_list_entry_insert_before(entry_new, entry_loop);
154 udev_list_entry_append(entry_new, list);
155 dbg(udev, "'%s=%s' added\n", entry_new->name, entry_new->value);
159 void udev_list_entry_delete(struct udev_list_entry *entry)
161 udev_list_node_remove(&entry->node);
167 void udev_list_cleanup_entries(struct udev *udev, struct udev_list_node *list)
169 struct udev_list_entry *entry_loop;
170 struct udev_list_entry *entry_tmp;
172 udev_list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
173 udev_list_entry_delete(entry_loop);
176 struct udev_list_entry *udev_list_get_entry(struct udev_list_node *list)
178 if (udev_list_is_empty(list))
180 return list_node_to_entry(list->next);
183 struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry)
185 struct udev_list_node *next;
187 if (list_entry == NULL)
189 next = list_entry->node.next;
190 /* empty list or no more entries */
191 if (next == list_entry->list)
193 return list_node_to_entry(next);
196 struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name)
198 struct udev_list_entry *entry;
200 udev_list_entry_foreach(entry, list_entry) {
201 if (strcmp(udev_list_entry_get_name(entry), name) == 0) {
202 dbg(entry->udev, "found '%s=%s'\n", entry->name, entry->value);
209 const char *udev_list_entry_get_name(struct udev_list_entry *list_entry)
211 if (list_entry == NULL)
213 return list_entry->name;
216 const char *udev_list_entry_get_value(struct udev_list_entry *list_entry)
218 if (list_entry == NULL)
220 return list_entry->value;
223 int udev_list_entry_get_flag(struct udev_list_entry *list_entry)
225 if (list_entry == NULL)
227 return list_entry->flag;
230 void udev_list_entry_set_flag(struct udev_list_entry *list_entry, int flag)
232 if (list_entry == NULL)
234 list_entry->flag = flag;