Lines Matching defs:list
29 * SECTION:libudev-list
30 * @short_description: list operation
32 * Libudev list operations.
38 * Opaque object representing one entry in a list. An entry contains
43 struct udev_list *list;
49 /* the list's head points to itself if empty */
50 void udev_list_node_init(struct udev_list_node *list)
52 list->next = list;
53 list->prev = list;
56 int udev_list_node_is_empty(struct udev_list_node *list)
58 return list->next == list;
71 void udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list)
73 udev_list_node_insert_between(new, list->prev, list);
88 /* return list entry which embeds this node */
94 void udev_list_init(struct udev *udev, struct udev_list *list, bool unique)
96 memzero(list, sizeof(struct udev_list));
97 list->udev = udev;
98 list->unique = unique;
99 udev_list_node_init(&list->node);
102 /* insert entry into a list as the last element */
103 static void udev_list_entry_append(struct udev_list_entry *new, struct udev_list *list)
105 /* inserting before the list head make the node the last node in the list */
106 udev_list_node_insert_between(&new->node, list->node.prev, &list->node);
107 new->list = list;
110 /* insert entry into a list, before a given existing entry */
114 new->list = entry->list;
118 static int list_search(struct udev_list *list, const char *name)
123 last = list->entries_cur;
129 cmp = strcmp(name, list->entries[i]->name);
142 struct udev_list_entry *udev_list_entry_add(struct udev_list *list, const char *name, const char *value)
147 if (list->unique) {
149 i = list_search(list, name);
151 entry = list->entries[i];
183 if (list->unique) {
185 if (list->entries_cur >= list->entries_max) {
189 add = list->entries_max;
192 entries = realloc(list->entries, (list->entries_max + add) * sizeof(struct udev_list_entry *));
199 list->entries = entries;
200 list->entries_max += add;
206 /* insert into sorted list */
207 if ((unsigned int)i < list->entries_cur)
208 udev_list_entry_insert_before(entry, list->entries[i]);
210 udev_list_entry_append(entry, list);
213 memmove(&list->entries[i+1], &list->entries[i],
214 (list->entries_cur - i) * sizeof(struct udev_list_entry *));
215 list->entries[i] = entry;
216 list->entries_cur++;
218 udev_list_entry_append(entry, list);
226 if (entry->list->entries != NULL) {
228 struct udev_list *list = entry->list;
231 i = list_search(list, entry->name);
233 memmove(&list->entries[i], &list->entries[i+1],
234 ((list->entries_cur-1) - i) * sizeof(struct udev_list_entry *));
235 list->entries_cur--;
245 void udev_list_cleanup(struct udev_list *list)
250 list->entries = mfree(list->entries);
251 list->entries_cur = 0;
252 list->entries_max = 0;
253 udev_list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
257 struct udev_list_entry *udev_list_get_entry(struct udev_list *list)
259 if (udev_list_node_is_empty(&list->node))
261 return list_node_to_entry(list->node.next);
268 * Get the next entry from the list.
279 /* empty list or no more entries */
280 if (next == &list_entry->list->node)
290 * Lookup an entry in the list with a certain name.
301 if (!list_entry->list->unique)
304 i = list_search(list_entry->list, name);
307 return list_entry->list->entries[i];
314 * Get the name of a list entry.
329 * Get the value of list entry.