fb5e686c19c25d74e060887fd94292896482b21b
[project/uci.git] / list.c
1 /*
2 * libuci - Library for the Unified Configuration Interface
3 * Copyright (C) 2008 Felix Fietkau <nbd@openwrt.org>
4 *
5 * this program is free software; you can redistribute it and/or modify
6 * it under the terms of the gnu lesser general public license version 2.1
7 * as published by the free software foundation
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 */
14
15 #include <glob.h>
16
17 /* initialize a list head/item */
18 static inline void uci_list_init(struct uci_list *ptr)
19 {
20 ptr->prev = ptr;
21 ptr->next = ptr;
22 }
23
24 /* inserts a new list entry after a given entry */
25 static inline void uci_list_insert(struct uci_list *list, struct uci_list *ptr)
26 {
27 list->next->prev = ptr;
28 ptr->prev = list;
29 ptr->next = list->next;
30 list->next = ptr;
31 }
32
33 /* inserts a new list entry at the tail of the list */
34 static inline void uci_list_add(struct uci_list *head, struct uci_list *ptr)
35 {
36 /* NB: head->prev points at the tail */
37 uci_list_insert(head->prev, ptr);
38 }
39
40 static inline void uci_list_del(struct uci_list *ptr)
41 {
42 struct uci_list *next, *prev;
43
44 next = ptr->next;
45 prev = ptr->prev;
46
47 prev->next = next;
48 next->prev = prev;
49
50 uci_list_init(ptr);
51 }
52
53 /*
54 * uci_alloc_generic allocates a new uci_element with payload
55 * payload is appended to the struct to save memory and reduce fragmentation
56 */
57 static struct uci_element *
58 uci_alloc_generic(struct uci_context *ctx, int type, const char *name, int size)
59 {
60 struct uci_element *e;
61 int datalen = size;
62 void *ptr;
63
64 if (name)
65 datalen += strlen(name) + 1;
66 ptr = uci_malloc(ctx, datalen);
67 e = (struct uci_element *) ptr;
68 e->type = type;
69 if (name) {
70 e->name = (char *) ptr + size;
71 strcpy(e->name, name);
72 }
73 uci_list_init(&e->list);
74
75 return e;
76 }
77
78 static void
79 uci_free_element(struct uci_element *e)
80 {
81 if (!uci_list_empty(&e->list))
82 uci_list_del(&e->list);
83 free(e);
84 }
85
86 static struct uci_option *
87 uci_alloc_option(struct uci_section *s, const char *name, const char *value)
88 {
89 struct uci_package *p = s->package;
90 struct uci_context *ctx = p->ctx;
91 struct uci_option *o;
92
93 o = uci_alloc_element(ctx, option, name, strlen(value) + 1);
94 o->value = uci_dataptr(o);
95 o->section = s;
96 strcpy(o->value, value);
97 uci_list_add(&s->options, &o->e.list);
98
99 return o;
100 }
101
102 static inline void
103 uci_free_option(struct uci_option *o)
104 {
105 uci_free_element(&o->e);
106 }
107
108 static struct uci_section *
109 uci_alloc_section(struct uci_package *p, const char *type, const char *name)
110 {
111 struct uci_context *ctx = p->ctx;
112 struct uci_section *s;
113 char buf[16];
114
115 if (!name || !name[0]) {
116 snprintf(buf, 16, "cfg%d", p->n_section);
117 name = buf;
118 }
119
120 s = uci_alloc_element(ctx, section, name, strlen(type) + 1);
121 s->type = uci_dataptr(s);
122 s->package = p;
123 strcpy(s->type, type);
124 uci_list_init(&s->options);
125 uci_list_add(&p->sections, &s->e.list);
126
127 return s;
128 }
129
130 static void
131 uci_free_section(struct uci_section *s)
132 {
133 struct uci_element *o, *tmp;
134
135 uci_foreach_element_safe(&s->options, tmp, o) {
136 uci_free_option(uci_to_option(o));
137 }
138 uci_free_element(&s->e);
139 }
140
141 static struct uci_package *
142 uci_alloc_package(struct uci_context *ctx, const char *name)
143 {
144 struct uci_package *p;
145
146 p = uci_alloc_element(ctx, package, name, 0);
147 p->ctx = ctx;
148 uci_list_init(&p->sections);
149 uci_list_init(&p->history);
150 return p;
151 }
152
153 static void
154 uci_free_package(struct uci_package *p)
155 {
156 struct uci_element *e, *tmp;
157
158 if(!p)
159 return;
160
161 if (p->path)
162 free(p->path);
163 uci_foreach_element_safe(&p->sections, tmp, e) {
164 uci_free_section(uci_to_section(e));
165 }
166 uci_free_element(&p->e);
167 }
168
169 /* record a change that was done to a package */
170 static inline void
171 uci_add_history(struct uci_context *ctx, struct uci_package *p, int cmd, char *section, char *option, char *value)
172 {
173 struct uci_history *h;
174 int size = strlen(section) + 1;
175 char *ptr;
176
177 if (value)
178 size += strlen(section) + 1;
179
180 h = uci_alloc_element(ctx, history, option, size);
181 ptr = uci_dataptr(h);
182 h->cmd = cmd;
183 h->section = strcpy(ptr, section);
184 if (value) {
185 ptr += strlen(ptr) + 1;
186 h->value = strcpy(ptr, value);
187 }
188 uci_list_add(&p->history, &h->e.list);
189 }
190
191 static struct uci_element *uci_lookup_list(struct uci_context *ctx, struct uci_list *list, const char *name)
192 {
193 struct uci_element *e;
194
195 uci_foreach_element(list, e) {
196 if (!strcmp(e->name, name))
197 return e;
198 }
199 return NULL;
200 }
201
202 int uci_lookup(struct uci_context *ctx, struct uci_element **res, struct uci_package *p, char *section, char *option)
203 {
204 struct uci_element *e;
205 struct uci_section *s;
206 struct uci_option *o;
207
208 UCI_HANDLE_ERR(ctx);
209 UCI_ASSERT(ctx, res != NULL);
210 UCI_ASSERT(ctx, p != NULL);
211 UCI_ASSERT(ctx, section != NULL);
212
213 e = uci_lookup_list(ctx, &p->sections, section);
214 if (!e)
215 goto notfound;
216
217 if (option) {
218 s = uci_to_section(e);
219 e = uci_lookup_list(ctx, &s->options, option);
220 }
221
222 *res = e;
223 return 0;
224
225 notfound:
226 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
227 return 0;
228 }
229
230 int uci_del_element(struct uci_context *ctx, struct uci_element *e)
231 {
232 bool internal = ctx->internal;
233 struct uci_package *p = NULL;
234 struct uci_section *s = NULL;
235 struct uci_option *o = NULL;
236 struct uci_element *i, *tmp;
237 char *option = NULL;
238
239 UCI_HANDLE_ERR(ctx);
240 UCI_ASSERT(ctx, e != NULL);
241
242 switch(e->type) {
243 case UCI_TYPE_SECTION:
244 s = uci_to_section(e);
245 uci_foreach_element_safe(&s->options, tmp, i) {
246 uci_del_element(ctx, i);
247 }
248 break;
249 case UCI_TYPE_OPTION:
250 o = uci_to_option(e);
251 s = o->section;
252 p = s->package;
253 option = e->name;
254 break;
255 default:
256 UCI_THROW(ctx, UCI_ERR_INVAL);
257 break;
258 }
259
260 p = s->package;
261 if (!internal)
262 uci_add_history(ctx, p, UCI_CMD_REMOVE, s->e.name, option, NULL);
263
264 switch(e->type) {
265 case UCI_TYPE_SECTION:
266 uci_free_section(s);
267 break;
268 case UCI_TYPE_OPTION:
269 uci_free_option(o);
270 break;
271 default:
272 break;
273 }
274 return 0;
275 }
276
277 int uci_set_element_value(struct uci_context *ctx, struct uci_element **element, char *value)
278 {
279 bool internal = ctx->internal;
280 struct uci_list *list;
281 struct uci_element *e;
282 struct uci_package *p;
283 struct uci_section *s;
284 char *section;
285 char *option;
286 char *str;
287 int size;
288
289 UCI_HANDLE_ERR(ctx);
290 UCI_ASSERT(ctx, value != NULL);
291 UCI_ASSERT(ctx, element != NULL);
292 UCI_ASSERT(ctx, *element != NULL);
293
294 /* what the 'value' of an element means depends on the type
295 * for a section, the 'value' means its type
296 * for an option, the 'value' means its value string
297 * when changing the value, shrink the element to its actual size
298 * (it may have been allocated with a bigger size, to include
299 * its buffer)
300 * then duplicate the string passed on the command line and
301 * insert it into the structure.
302 */
303 e = *element;
304 list = e->list.prev;
305 switch(e->type) {
306 case UCI_TYPE_SECTION:
307 size = sizeof(struct uci_section);
308 s = uci_to_section(e);
309 section = e->name;
310 option = NULL;
311 break;
312 case UCI_TYPE_OPTION:
313 size = sizeof(struct uci_option);
314 s = uci_to_option(e)->section;
315 section = s->e.name;
316 option = e->name;
317 break;
318 default:
319 UCI_THROW(ctx, UCI_ERR_INVAL);
320 return 0;
321 }
322 p = s->package;
323 if (!internal)
324 uci_add_history(ctx, p, UCI_CMD_CHANGE, section, option, value);
325
326 uci_list_del(&e->list);
327 e = uci_realloc(ctx, e, size);
328 str = uci_strdup(ctx, value);
329 uci_list_insert(list, &e->list);
330 *element = e;
331
332 switch(e->type) {
333 case UCI_TYPE_SECTION:
334 uci_to_section(e)->type = str;
335 break;
336 case UCI_TYPE_OPTION:
337 uci_to_option(e)->value = str;
338 break;
339 default:
340 break;
341 }
342
343 return 0;
344 }
345
346 int uci_del(struct uci_context *ctx, struct uci_package *p, char *section, char *option)
347 {
348 bool internal = ctx->internal;
349 struct uci_element *e;
350 struct uci_section *s = NULL;
351 struct uci_option *o = NULL;
352
353 UCI_HANDLE_ERR(ctx);
354 UCI_ASSERT(ctx, p != NULL);
355 UCI_ASSERT(ctx, section != NULL);
356
357 UCI_INTERNAL(uci_lookup, ctx, &e, p, section, option);
358
359 if (!internal)
360 return uci_del_element(ctx, e);
361 UCI_INTERNAL(uci_del_element, ctx, e);
362
363 return 0;
364 }
365
366 int uci_set(struct uci_context *ctx, struct uci_package *p, char *section, char *option, char *value)
367 {
368 bool internal = ctx->internal;
369 struct uci_element *e = NULL;
370 struct uci_section *s = NULL;
371 struct uci_option *o = NULL;
372 struct uci_history *h;
373
374 UCI_HANDLE_ERR(ctx);
375 UCI_ASSERT(ctx, p != NULL);
376 UCI_ASSERT(ctx, section != NULL);
377 UCI_ASSERT(ctx, value != NULL);
378
379 /*
380 * look up the package, section and option (if set)
381 * if the section/option is to be modified and it is not found
382 * create a new element in the appropriate list
383 */
384 UCI_INTERNAL(uci_lookup, ctx, &e, p, section, NULL);
385 s = uci_to_section(e);
386 if (option) {
387 e = uci_lookup_list(ctx, &s->options, option);
388 if (!e)
389 goto notfound;
390 o = uci_to_option(e);
391 }
392
393 /*
394 * no unknown element was supplied, assume that we can just update
395 * an existing entry
396 */
397 if (o)
398 e = &o->e;
399 else
400 e = &s->e;
401
402 if (!internal)
403 return uci_set_element_value(ctx, &e, value);
404
405 UCI_INTERNAL(uci_set_element_value, ctx, &e, value);
406 return 0;
407
408 notfound:
409 /*
410 * the entry that we need to update was not found,
411 * check if the search failed prematurely.
412 * this can happen if the package was not found, or if
413 * an option was supplied, but the section wasn't found
414 */
415 if (!p || (!s && option))
416 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
417
418 /* now add the missing entry */
419 if (!internal)
420 uci_add_history(ctx, p, UCI_CMD_ADD, section, option, value);
421 if (s)
422 uci_alloc_option(s, option, value);
423 else
424 uci_alloc_section(p, value, section);
425
426 return 0;
427 }
428
429 int uci_unload(struct uci_context *ctx, struct uci_package *p)
430 {
431 struct uci_element *e;
432
433 UCI_HANDLE_ERR(ctx);
434 UCI_ASSERT(ctx, p != NULL);
435
436 uci_free_package(p);
437 return 0;
438 }
439