Lines Matching refs:list
31 * SECTION:libudev-list
32 * @short_description: list operation
34 * Libudev list operations.
40 * Opaque object representing one entry in a list. An entry contains
45 struct udev_list *list;
51 /* the list's head points to itself if empty */
52 void udev_list_node_init(struct udev_list_node *list)
54 list->next = list;
55 list->prev = list;
58 int udev_list_node_is_empty(struct udev_list_node *list)
60 return list->next == list;
73 void udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list)
75 udev_list_node_insert_between(new, list->prev, list);
90 /* return list entry which embeds this node */
96 void udev_list_init(struct udev *udev, struct udev_list *list, bool unique)
98 memzero(list, sizeof(struct udev_list));
99 list->udev = udev;
100 list->unique = unique;
101 udev_list_node_init(&list->node);
104 /* insert entry into a list as the last element */
105 static void udev_list_entry_append(struct udev_list_entry *new, struct udev_list *list)
107 /* inserting before the list head make the node the last node in the list */
108 udev_list_node_insert_between(&new->node, list->node.prev, &list->node);
109 new->list = list;
112 /* insert entry into a list, before a given existing entry */
116 new->list = entry->list;
120 static int list_search(struct udev_list *list, const char *name)
125 last = list->entries_cur;
131 cmp = strcmp(name, list->entries[i]->name);
144 struct udev_list_entry *udev_list_entry_add(struct udev_list *list, const char *name, const char *value)
149 if (list->unique) {
151 i = list_search(list, name);
153 entry = list->entries[i];
185 if (list->unique) {
187 if (list->entries_cur >= list->entries_max) {
191 add = list->entries_max;
194 entries = realloc(list->entries, (list->entries_max + add) * sizeof(struct udev_list_entry *));
201 list->entries = entries;
202 list->entries_max += add;
208 /* insert into sorted list */
209 if ((unsigned int)i < list->entries_cur)
210 udev_list_entry_insert_before(entry, list->entries[i]);
212 udev_list_entry_append(entry, list);
215 memmove(&list->entries[i+1], &list->entries[i],
216 (list->entries_cur - i) * sizeof(struct udev_list_entry *));
217 list->entries[i] = entry;
218 list->entries_cur++;
220 udev_list_entry_append(entry, list);
228 if (entry->list->entries != NULL) {
230 struct udev_list *list = entry->list;
233 i = list_search(list, entry->name);
235 memmove(&list->entries[i], &list->entries[i+1],
236 ((list->entries_cur-1) - i) * sizeof(struct udev_list_entry *));
237 list->entries_cur--;
247 void udev_list_cleanup(struct udev_list *list)
252 free(list->entries);
253 list->entries = NULL;
254 list->entries_cur = 0;
255 list->entries_max = 0;
256 udev_list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
260 struct udev_list_entry *udev_list_get_entry(struct udev_list *list)
262 if (udev_list_node_is_empty(&list->node))
264 return list_node_to_entry(list->node.next);
271 * Get the next entry from the list.
282 /* empty list or no more entries */
283 if (next == &list_entry->list->node)
293 * Lookup an entry in the list with a certain name.
304 if (!list_entry->list->unique)
307 i = list_search(list_entry->list, name);
310 return list_entry->list->entries[i];
317 * Get the name of a list entry.
332 * Get the value of list entry.