add convenience functions for looking up packages/sections/options
[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 static void uci_list_set_pos(struct uci_list *head, struct uci_list *ptr, int pos)
16 {
17 struct uci_list *new_head = head;
18 struct uci_element *p = NULL;
19
20 uci_list_del(ptr);
21 uci_foreach_element(head, p) {
22 new_head = &p->list;
23 if (pos-- <= 0)
24 break;
25 }
26 uci_list_add(new_head, ptr);
27 }
28
29 static inline void uci_list_fixup(struct uci_list *ptr)
30 {
31 ptr->prev->next = ptr;
32 ptr->next->prev = ptr;
33 }
34
35 /*
36 * uci_alloc_generic allocates a new uci_element with payload
37 * payload is appended to the struct to save memory and reduce fragmentation
38 */
39 __private struct uci_element *
40 uci_alloc_generic(struct uci_context *ctx, int type, const char *name, int size)
41 {
42 struct uci_element *e;
43 int datalen = size;
44 void *ptr;
45
46 ptr = uci_malloc(ctx, datalen);
47 e = (struct uci_element *) ptr;
48 e->type = type;
49 if (name) {
50 UCI_TRAP_SAVE(ctx, error);
51 e->name = uci_strdup(ctx, name);
52 UCI_TRAP_RESTORE(ctx);
53 }
54 uci_list_init(&e->list);
55 goto done;
56
57 error:
58 free(ptr);
59 UCI_THROW(ctx, ctx->err);
60
61 done:
62 return e;
63 }
64
65 __private void
66 uci_free_element(struct uci_element *e)
67 {
68 if (e->name)
69 free(e->name);
70 if (!uci_list_empty(&e->list))
71 uci_list_del(&e->list);
72 free(e);
73 }
74
75 static struct uci_option *
76 uci_alloc_option(struct uci_section *s, const char *name, const char *value)
77 {
78 struct uci_package *p = s->package;
79 struct uci_context *ctx = p->ctx;
80 struct uci_option *o;
81
82 o = uci_alloc_element(ctx, option, name, strlen(value) + 1);
83 o->type = UCI_TYPE_STRING;
84 o->v.string = uci_dataptr(o);
85 o->section = s;
86 strcpy(o->v.string, value);
87 uci_list_add(&s->options, &o->e.list);
88
89 return o;
90 }
91
92 static inline void
93 uci_free_option(struct uci_option *o)
94 {
95 struct uci_element *e, *tmp;
96
97 switch(o->type) {
98 case UCI_TYPE_STRING:
99 if ((o->v.string != uci_dataptr(o)) &&
100 (o->v.string != NULL))
101 free(o->v.string);
102 break;
103 case UCI_TYPE_LIST:
104 uci_foreach_element_safe(&o->v.list, tmp, e) {
105 uci_free_element(e);
106 }
107 break;
108 default:
109 break;
110 }
111 uci_free_element(&o->e);
112 }
113
114 static struct uci_option *
115 uci_alloc_list(struct uci_section *s, const char *name)
116 {
117 struct uci_package *p = s->package;
118 struct uci_context *ctx = p->ctx;
119 struct uci_option *o;
120
121 o = uci_alloc_element(ctx, option, name, 0);
122 o->type = UCI_TYPE_LIST;
123 o->section = s;
124 uci_list_init(&o->v.list);
125 uci_list_add(&s->options, &o->e.list);
126
127 return o;
128 }
129
130 /* Based on an efficient hash function published by D. J. Bernstein */
131 static unsigned int djbhash(unsigned int hash, char *str)
132 {
133 int len = strlen(str);
134 int i;
135
136 /* initial value */
137 if (hash == ~0)
138 hash = 5381;
139
140 for(i = 0; i < len; i++) {
141 hash = ((hash << 5) + hash) + str[i];
142 }
143 return (hash & 0x7FFFFFFF);
144 }
145
146 /* fix up an unnamed section, e.g. after adding options to it */
147 __private void uci_fixup_section(struct uci_context *ctx, struct uci_section *s)
148 {
149 unsigned int hash = ~0;
150 struct uci_element *e;
151 char buf[16];
152
153 if (!s || s->e.name)
154 return;
155
156 /*
157 * Generate a name for unnamed sections. This is used as reference
158 * when locating or updating the section from apps/scripts.
159 * To make multiple concurrent versions somewhat safe for updating,
160 * the name is generated from a hash of its type and name/value
161 * pairs of its option, and it is prefixed by a counter value.
162 * If the order of the unnamed sections changes for some reason,
163 * updates to them will be rejected.
164 */
165 hash = djbhash(hash, s->type);
166 uci_foreach_element(&s->options, e) {
167 struct uci_option *o;
168 hash = djbhash(hash, e->name);
169 o = uci_to_option(e);
170 switch(o->type) {
171 case UCI_TYPE_STRING:
172 hash = djbhash(hash, o->v.string);
173 break;
174 default:
175 break;
176 }
177 }
178 sprintf(buf, "cfg%02x%04x", ++s->package->n_section, hash % (1 << 16));
179 s->e.name = uci_strdup(ctx, buf);
180 }
181
182 static struct uci_section *
183 uci_alloc_section(struct uci_package *p, const char *type, const char *name)
184 {
185 struct uci_context *ctx = p->ctx;
186 struct uci_section *s;
187
188 if (name && !name[0])
189 name = NULL;
190
191 s = uci_alloc_element(ctx, section, name, strlen(type) + 1);
192 uci_list_init(&s->options);
193 s->type = uci_dataptr(s);
194 s->package = p;
195 strcpy(s->type, type);
196 if (name == NULL)
197 s->anonymous = true;
198 p->n_section++;
199
200 uci_list_add(&p->sections, &s->e.list);
201
202 return s;
203 }
204
205 static void
206 uci_free_section(struct uci_section *s)
207 {
208 struct uci_element *o, *tmp;
209
210 uci_foreach_element_safe(&s->options, tmp, o) {
211 uci_free_option(uci_to_option(o));
212 }
213 if ((s->type != uci_dataptr(s)) &&
214 (s->type != NULL))
215 free(s->type);
216 uci_free_element(&s->e);
217 }
218
219 __plugin struct uci_package *
220 uci_alloc_package(struct uci_context *ctx, const char *name)
221 {
222 struct uci_package *p;
223
224 p = uci_alloc_element(ctx, package, name, 0);
225 p->ctx = ctx;
226 uci_list_init(&p->sections);
227 uci_list_init(&p->delta);
228 uci_list_init(&p->saved_delta);
229 return p;
230 }
231
232 __private void
233 uci_free_package(struct uci_package **package)
234 {
235 struct uci_element *e, *tmp;
236 struct uci_package *p = *package;
237
238 if(!p)
239 return;
240
241 if (p->path)
242 free(p->path);
243 uci_foreach_element_safe(&p->sections, tmp, e) {
244 uci_free_section(uci_to_section(e));
245 }
246 uci_foreach_element_safe(&p->delta, tmp, e) {
247 uci_free_delta(uci_to_delta(e));
248 }
249 uci_foreach_element_safe(&p->saved_delta, tmp, e) {
250 uci_free_delta(uci_to_delta(e));
251 }
252 uci_free_element(&p->e);
253 *package = NULL;
254 }
255
256 static void
257 uci_free_any(struct uci_element **e)
258 {
259 switch((*e)->type) {
260 case UCI_TYPE_SECTION:
261 uci_free_section(uci_to_section(*e));
262 break;
263 case UCI_TYPE_OPTION:
264 uci_free_option(uci_to_option(*e));
265 break;
266 default:
267 break;
268 }
269 *e = NULL;
270 }
271
272 __private struct uci_element *
273 uci_lookup_list(struct uci_list *list, const char *name)
274 {
275 struct uci_element *e;
276
277 uci_foreach_element(list, e) {
278 if (!strcmp(e->name, name))
279 return e;
280 }
281 return NULL;
282 }
283
284 static struct uci_element *
285 uci_lookup_ext_section(struct uci_context *ctx, struct uci_ptr *ptr)
286 {
287 char *idxstr, *t, *section, *name;
288 struct uci_element *e = NULL;
289 struct uci_section *s;
290 int idx, c;
291
292 section = uci_strdup(ctx, ptr->section);
293 name = idxstr = section + 1;
294
295 if (section[0] != '@')
296 goto error;
297
298 /* parse the section index part */
299 idxstr = strchr(idxstr, '[');
300 if (!idxstr)
301 goto error;
302 *idxstr = 0;
303 idxstr++;
304
305 t = strchr(idxstr, ']');
306 if (!t)
307 goto error;
308 if (t[1] != 0)
309 goto error;
310 *t = 0;
311
312 t = NULL;
313 idx = strtol(idxstr, &t, 10);
314 if (t && *t)
315 goto error;
316
317 if (!*name)
318 name = NULL;
319 else if (!uci_validate_type(name))
320 goto error;
321
322 /* if the given index is negative, it specifies the section number from
323 * the end of the list */
324 if (idx < 0) {
325 c = 0;
326 uci_foreach_element(&ptr->p->sections, e) {
327 s = uci_to_section(e);
328 if (name && (strcmp(s->type, name) != 0))
329 continue;
330
331 c++;
332 }
333 idx += c;
334 }
335
336 c = 0;
337 uci_foreach_element(&ptr->p->sections, e) {
338 s = uci_to_section(e);
339 if (name && (strcmp(s->type, name) != 0))
340 continue;
341
342 if (idx == c)
343 goto done;
344 c++;
345 }
346 e = NULL;
347 goto done;
348
349 error:
350 e = NULL;
351 memset(ptr, 0, sizeof(struct uci_ptr));
352 UCI_THROW(ctx, UCI_ERR_INVAL);
353 done:
354 free(section);
355 if (e)
356 ptr->section = e->name;
357 return e;
358 }
359
360 int
361 uci_lookup_next(struct uci_context *ctx, struct uci_element **e, struct uci_list *list, const char *name)
362 {
363 UCI_HANDLE_ERR(ctx);
364
365 *e = uci_lookup_list(list, name);
366 if (!*e)
367 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
368
369 return 0;
370 }
371
372 int
373 uci_lookup_ptr(struct uci_context *ctx, struct uci_ptr *ptr, char *str, bool extended)
374 {
375 struct uci_element *e;
376
377 UCI_HANDLE_ERR(ctx);
378 UCI_ASSERT(ctx, ptr != NULL);
379
380 if (str)
381 UCI_INTERNAL(uci_parse_ptr, ctx, ptr, str);
382
383 ptr->flags |= UCI_LOOKUP_DONE;
384
385 /* look up the package first */
386 if (ptr->p)
387 e = &ptr->p->e;
388 else
389 e = uci_lookup_list(&ctx->root, ptr->package);
390
391 if (!e) {
392 UCI_INTERNAL(uci_load, ctx, ptr->package, &ptr->p);
393 if (!ptr->p)
394 goto notfound;
395 ptr->last = &ptr->p->e;
396 } else {
397 ptr->p = uci_to_package(e);
398 ptr->last = e;
399 }
400
401 if (!ptr->section && !ptr->s)
402 goto complete;
403
404 /* if the section name validates as a regular name, pass through
405 * to the regular uci_lookup function call */
406 if (ptr->s) {
407 e = &ptr->s->e;
408 } else if (ptr->flags & UCI_LOOKUP_EXTENDED) {
409 if (extended)
410 e = uci_lookup_ext_section(ctx, ptr);
411 else
412 UCI_THROW(ctx, UCI_ERR_INVAL);
413 } else {
414 e = uci_lookup_list(&ptr->p->sections, ptr->section);
415 }
416
417 if (!e)
418 goto abort;
419
420 ptr->last = e;
421 ptr->s = uci_to_section(e);
422
423 if (ptr->option) {
424 e = uci_lookup_list(&ptr->s->options, ptr->option);
425 if (!e)
426 goto abort;
427
428 ptr->o = uci_to_option(e);
429 ptr->last = e;
430 }
431
432 complete:
433 ptr->flags |= UCI_LOOKUP_COMPLETE;
434 abort:
435 return 0;
436
437 notfound:
438 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
439 return 0;
440 }
441
442 __private struct uci_element *
443 uci_expand_ptr(struct uci_context *ctx, struct uci_ptr *ptr, bool complete)
444 {
445 UCI_ASSERT(ctx, ptr != NULL);
446
447 if (!(ptr->flags & UCI_LOOKUP_DONE))
448 UCI_INTERNAL(uci_lookup_ptr, ctx, ptr, NULL, 1);
449 if (complete && !(ptr->flags & UCI_LOOKUP_COMPLETE))
450 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
451 UCI_ASSERT(ctx, ptr->p != NULL);
452
453 /* fill in missing string info */
454 if (ptr->p && !ptr->package)
455 ptr->package = ptr->p->e.name;
456 if (ptr->s && !ptr->section)
457 ptr->section = ptr->s->e.name;
458 if (ptr->o && !ptr->option)
459 ptr->option = ptr->o->e.name;
460
461 if (ptr->o)
462 return &ptr->o->e;
463 if (ptr->s)
464 return &ptr->s->e;
465 if (ptr->p)
466 return &ptr->p->e;
467 else
468 return NULL;
469 }
470
471 static void uci_add_element_list(struct uci_context *ctx, struct uci_ptr *ptr, bool internal)
472 {
473 struct uci_element *e;
474 struct uci_package *p;
475
476 p = ptr->p;
477 if (!internal && p->has_delta)
478 uci_add_delta(ctx, &p->delta, UCI_CMD_LIST_ADD, ptr->section, ptr->option, ptr->value);
479
480 e = uci_alloc_generic(ctx, UCI_TYPE_ITEM, ptr->value, sizeof(struct uci_option));
481 uci_list_add(&ptr->o->v.list, &e->list);
482 }
483
484 int uci_rename(struct uci_context *ctx, struct uci_ptr *ptr)
485 {
486 /* NB: UCI_INTERNAL use means without delta tracking */
487 bool internal = ctx->internal;
488 struct uci_element *e;
489 struct uci_package *p;
490 char *n;
491
492 UCI_HANDLE_ERR(ctx);
493
494 e = uci_expand_ptr(ctx, ptr, true);
495 p = ptr->p;
496
497 UCI_ASSERT(ctx, ptr->s);
498 UCI_ASSERT(ctx, ptr->value);
499
500 if (!internal && p->has_delta)
501 uci_add_delta(ctx, &p->delta, UCI_CMD_RENAME, ptr->section, ptr->option, ptr->value);
502
503 n = uci_strdup(ctx, ptr->value);
504 if (e->name)
505 free(e->name);
506 e->name = n;
507
508 if (e->type == UCI_TYPE_SECTION)
509 uci_to_section(e)->anonymous = false;
510
511 return 0;
512 }
513
514 int uci_reorder_section(struct uci_context *ctx, struct uci_section *s, int pos)
515 {
516 struct uci_package *p = s->package;
517 char order[32];
518
519 UCI_HANDLE_ERR(ctx);
520
521 uci_list_set_pos(&s->package->sections, &s->e.list, pos);
522 if (!ctx->internal && p->has_delta) {
523 sprintf(order, "%d", pos);
524 uci_add_delta(ctx, &p->delta, UCI_CMD_REORDER, s->e.name, NULL, order);
525 }
526
527 return 0;
528 }
529
530 int uci_add_section(struct uci_context *ctx, struct uci_package *p, const char *type, struct uci_section **res)
531 {
532 bool internal = ctx->internal;
533 struct uci_section *s;
534
535 UCI_HANDLE_ERR(ctx);
536 UCI_ASSERT(ctx, p != NULL);
537 s = uci_alloc_section(p, type, NULL);
538 uci_fixup_section(ctx, s);
539 *res = s;
540 if (!internal && p->has_delta)
541 uci_add_delta(ctx, &p->delta, UCI_CMD_ADD, s->e.name, NULL, type);
542
543 return 0;
544 }
545
546 int uci_delete(struct uci_context *ctx, struct uci_ptr *ptr)
547 {
548 /* NB: pass on internal flag to uci_del_element */
549 bool internal = ctx->internal;
550 struct uci_package *p;
551 struct uci_element *e;
552
553 UCI_HANDLE_ERR(ctx);
554
555 e = uci_expand_ptr(ctx, ptr, true);
556 p = ptr->p;
557
558 UCI_ASSERT(ctx, ptr->s);
559
560 if (!internal && p->has_delta)
561 uci_add_delta(ctx, &p->delta, UCI_CMD_REMOVE, ptr->section, ptr->option, NULL);
562
563 uci_free_any(&e);
564
565 if (ptr->option)
566 ptr->o = NULL;
567 else if (ptr->section)
568 ptr->s = NULL;
569
570 return 0;
571 }
572
573 int uci_add_list(struct uci_context *ctx, struct uci_ptr *ptr)
574 {
575 /* NB: UCI_INTERNAL use means without delta tracking */
576 bool internal = ctx->internal;
577 struct uci_option *prev = NULL;
578 const char *value2 = NULL;
579
580 UCI_HANDLE_ERR(ctx);
581
582 uci_expand_ptr(ctx, ptr, false);
583 UCI_ASSERT(ctx, ptr->s);
584 UCI_ASSERT(ctx, ptr->value);
585
586 if (ptr->o) {
587 switch (ptr->o->type) {
588 case UCI_TYPE_STRING:
589 /* we already have a string value, convert that to a list */
590 prev = ptr->o;
591 value2 = ptr->value;
592 ptr->value = ptr->o->v.string;
593 break;
594 case UCI_TYPE_LIST:
595 uci_add_element_list(ctx, ptr, internal);
596 return 0;
597 default:
598 UCI_THROW(ctx, UCI_ERR_INVAL);
599 break;
600 }
601 }
602
603 ptr->o = uci_alloc_list(ptr->s, ptr->option);
604 if (prev) {
605 uci_add_element_list(ctx, ptr, true);
606 uci_free_option(prev);
607 ptr->value = value2;
608 }
609 uci_add_element_list(ctx, ptr, internal);
610
611 return 0;
612 }
613
614 int uci_set(struct uci_context *ctx, struct uci_ptr *ptr)
615 {
616 /* NB: UCI_INTERNAL use means without delta tracking */
617 bool internal = ctx->internal;
618
619 UCI_HANDLE_ERR(ctx);
620 uci_expand_ptr(ctx, ptr, false);
621 UCI_ASSERT(ctx, ptr->value);
622 UCI_ASSERT(ctx, ptr->s || (!ptr->option && ptr->section));
623 if (!ptr->option && ptr->value[0]) {
624 UCI_ASSERT(ctx, uci_validate_type(ptr->value));
625 }
626
627 if (!ptr->o && ptr->s && ptr->option) {
628 struct uci_element *e;
629 e = uci_lookup_list(&ptr->s->options, ptr->option);
630 if (e)
631 ptr->o = uci_to_option(e);
632 }
633 if (!ptr->value[0]) {
634 /* if setting a nonexistant option/section to a nonexistant value,
635 * exit without errors */
636 if (!(ptr->flags & UCI_LOOKUP_COMPLETE))
637 return 0;
638
639 return uci_delete(ctx, ptr);
640 } else if (!ptr->o && ptr->option) { /* new option */
641 ptr->o = uci_alloc_option(ptr->s, ptr->option, ptr->value);
642 ptr->last = &ptr->o->e;
643 } else if (!ptr->s && ptr->section) { /* new section */
644 ptr->s = uci_alloc_section(ptr->p, ptr->value, ptr->section);
645 ptr->last = &ptr->s->e;
646 } else if (ptr->o && ptr->option) { /* update option */
647 if ((ptr->o->type == UCI_TYPE_STRING) &&
648 !strcmp(ptr->o->v.string, ptr->value))
649 return 0;
650 uci_free_option(ptr->o);
651 ptr->o = uci_alloc_option(ptr->s, ptr->option, ptr->value);
652 ptr->last = &ptr->o->e;
653 } else if (ptr->s && ptr->section) { /* update section */
654 char *s = uci_strdup(ctx, ptr->value);
655
656 if (ptr->s->type == uci_dataptr(ptr->s)) {
657 ptr->last = NULL;
658 ptr->last = uci_realloc(ctx, ptr->s, sizeof(struct uci_section));
659 ptr->s = uci_to_section(ptr->last);
660 uci_list_fixup(&ptr->s->e.list);
661 } else {
662 free(ptr->s->type);
663 }
664 ptr->s->type = s;
665 } else {
666 UCI_THROW(ctx, UCI_ERR_INVAL);
667 }
668
669 if (!internal && ptr->p->has_delta)
670 uci_add_delta(ctx, &ptr->p->delta, UCI_CMD_CHANGE, ptr->section, ptr->option, ptr->value);
671
672 return 0;
673 }
674
675 int uci_unload(struct uci_context *ctx, struct uci_package *p)
676 {
677 UCI_HANDLE_ERR(ctx);
678 UCI_ASSERT(ctx, p != NULL);
679
680 uci_free_package(&p);
681 return 0;
682 }
683