summaryrefslogtreecommitdiff
path: root/src/libudev-list.c
blob: f74a88ca49e9a15d82aa03721c4081b45478c5fb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
/*
 * libudev - interface to udev device information
 *
 * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 */

#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>

#include "libudev.h"
#include "libudev-private.h"

/**
 * SECTION:libudev-list
 * @short_description: list operation
 *
 * Libudev list operations.
 */

/**
 * udev_list_entry:
 *
 * Opaque object representing one entry in a list. An entry contains
 * contains a name, and optionally a value.
 */
struct udev_list_entry {
	struct udev_list_node node;
	struct udev_list *list;
	char *name;
	char *value;
	int num;
};

/* the list's head points to itself if empty */
void udev_list_node_init(struct udev_list_node *list)
{
	list->next = list;
	list->prev = list;
}

int udev_list_node_is_empty(struct udev_list_node *list)
{
	return list->next == list;
}

static void udev_list_node_insert_between(struct udev_list_node *new,
					  struct udev_list_node *prev,
					  struct udev_list_node *next)
{
	next->prev = new;
	new->next = next;
	new->prev = prev;
	prev->next = new;
}

void udev_list_node_append(struct udev_list_node *new, struct udev_list_node *list)
{
	udev_list_node_insert_between(new, list->prev, list);
}

void udev_list_node_remove(struct udev_list_node *entry)
{
	struct udev_list_node *prev = entry->prev;
	struct udev_list_node *next = entry->next;

	next->prev = prev;
	prev->next = next;

	entry->prev = NULL;
	entry->next = NULL;
}

/* return list entry which embeds this node */
static struct udev_list_entry *list_node_to_entry(struct udev_list_node *node)
{
	char *list;

	list = (char *)node;
	list -= offsetof(struct udev_list_entry, node);
	return (struct udev_list_entry *)list;
}

void udev_list_init(struct udev *udev, struct udev_list *list, bool unique)
{
	memset(list, 0x00, sizeof(struct udev_list));
	list->udev = udev;
	list->unique = unique;
	udev_list_node_init(&list->node);
}

/* insert entry into a list as the last element  */
void udev_list_entry_append(struct udev_list_entry *new, struct udev_list *list)
{
	/* inserting before the list head make the node the last node in the list */
	udev_list_node_insert_between(&new->node, list->node.prev, &list->node);
	new->list = list;
}

/* insert entry into a list, before a given existing entry */
void udev_list_entry_insert_before(struct udev_list_entry *new, struct udev_list_entry *entry)
{
	udev_list_node_insert_between(&new->node, entry->node.prev, &entry->node);
	new->list = entry->list;
}

/* binary search in sorted array */
static int list_search(struct udev_list *list, const char *name)
{
	unsigned int first, last;

	first = 0;
	last = list->entries_cur;
	while (first < last) {
		unsigned int i;
		int cmp;

		i = (first + last)/2;
		cmp = strcmp(name, list->entries[i]->name);
		if (cmp < 0)
			last = i;
		else if (cmp > 0)
			first = i+1;
		else
			return i;
	}

	/* not found, return negative insertion-index+1 */
	return -(first+1);
}

struct udev_list_entry *udev_list_entry_add(struct udev_list *list, const char *name, const char *value)
{
	struct udev_list_entry *entry;
	int i = 0;

	if (list->unique) {
		/* lookup existing name or insertion-index */
		i = list_search(list, name);
		if (i >= 0) {
			entry = list->entries[i];

			dbg(list->udev, "'%s' is already in the list\n", name);
			free(entry->value);
			if (value == NULL) {
				entry->value = NULL;
				dbg(list->udev, "'%s' value unset\n", name);
				return entry;
			}
			entry->value = strdup(value);
			if (entry->value == NULL)
				return NULL;
			dbg(list->udev, "'%s' value replaced with '%s'\n", name, value);
			return entry;
		}
	}

	/* add new name */
	entry = calloc(1, sizeof(struct udev_list_entry));
	if (entry == NULL)
		return NULL;
	entry->name = strdup(name);
	if (entry->name == NULL) {
		free(entry);
		return NULL;
	}
	if (value != NULL) {
		entry->value = strdup(value);
		if (entry->value == NULL) {
			free(entry->name);
			free(entry);
			return NULL;
		}
	}

	if (list->unique) {
		/* allocate or enlarge sorted array if needed */
		if (list->entries_cur >= list->entries_max) {
			unsigned int add;

			add = list->entries_max;
			if (add < 1)
				add = 64;
			list->entries = realloc(list->entries, (list->entries_max + add) * sizeof(struct udev_list_entry *));
			if (list->entries == NULL) {
				free(entry->name);
				free(entry->value);
				return NULL;
			}
			list->entries_max += add;
		}

		/* the negative i returned the insertion index */
		i = (-i)-1;

		/* insert into sorted list */
		if ((unsigned int)i < list->entries_cur)
			udev_list_entry_insert_before(entry, list->entries[i]);
		else
			udev_list_entry_append(entry, list);

		/* insert into sorted array */
		memmove(&list->entries[i+1], &list->entries[i],
		        (list->entries_cur - i) * sizeof(struct udev_list_entry *));
		list->entries[i] = entry;
		list->entries_cur++;
	} else {
		udev_list_entry_append(entry, list);
	}

	dbg(list->udev, "'%s=%s' added\n", entry->name, entry->value);
	return entry;
}

void udev_list_entry_delete(struct udev_list_entry *entry)
{
	if (entry->list->entries != NULL) {
		int i;
		struct udev_list *list = entry->list;

		/* remove entry from sorted array */
		i = list_search(list, entry->name);
		if (i >= 0) {
			memmove(&list->entries[i], &list->entries[i+1],
			        ((list->entries_cur-1) - i) * sizeof(struct udev_list_entry *));
			list->entries_cur--;
		}
	}

	udev_list_node_remove(&entry->node);
	free(entry->name);
	free(entry->value);
	free(entry);
}

void udev_list_cleanup(struct udev_list *list)
{
	struct udev_list_entry *entry_loop;
	struct udev_list_entry *entry_tmp;

	free(list->entries);
	list->entries = NULL;
	list->entries_cur = 0;
	list->entries_max = 0;
	udev_list_entry_foreach_safe(entry_loop, entry_tmp, udev_list_get_entry(list))
		udev_list_entry_delete(entry_loop);
}

struct udev_list_entry *udev_list_get_entry(struct udev_list *list)
{
	if (udev_list_node_is_empty(&list->node))
		return NULL;
	return list_node_to_entry(list->node.next);
}

/**
 * udev_list_entry_get_next:
 * @list_entry: current entry
 *
 * Returns: the next entry from the list, #NULL is no more entries are found.
 */
UDEV_EXPORT struct udev_list_entry *udev_list_entry_get_next(struct udev_list_entry *list_entry)
{
	struct udev_list_node *next;

	if (list_entry == NULL)
		return NULL;
	next = list_entry->node.next;
	/* empty list or no more entries */
	if (next == &list_entry->list->node)
		return NULL;
	return list_node_to_entry(next);
}

/**
 * udev_list_entry_get_by_name:
 * @list_entry: current entry
 * @name: name string to match
 *
 * Returns: the entry where @name matched, #NULL if no matching entry is found.
 */
UDEV_EXPORT struct udev_list_entry *udev_list_entry_get_by_name(struct udev_list_entry *list_entry, const char *name)
{
	int i;

	if (list_entry == NULL)
		return NULL;

	if (!list_entry->list->unique)
		return NULL;

	i = list_search(list_entry->list, name);
	if (i < 0)
		return NULL;
	return list_entry->list->entries[i];
}

/**
 * udev_list_entry_get_name:
 * @list_entry: current entry
 *
 * Returns: the name string of this entry.
 */
UDEV_EXPORT const char *udev_list_entry_get_name(struct udev_list_entry *list_entry)
{
	if (list_entry == NULL)
		return NULL;
	return list_entry->name;
}

/**
 * udev_list_entry_get_value:
 * @list_entry: current entry
 *
 * Returns: the value string of this entry.
 */
UDEV_EXPORT const char *udev_list_entry_get_value(struct udev_list_entry *list_entry)
{
	if (list_entry == NULL)
		return NULL;
	return list_entry->value;
}

int udev_list_entry_get_num(struct udev_list_entry *list_entry)
{
	if (list_entry == NULL)
		return -EINVAL;
	return list_entry->num;
}

void udev_list_entry_set_num(struct udev_list_entry *list_entry, int num)
{
	if (list_entry == NULL)
		return;
	list_entry->num = num;
}