cli: remove unused variable assigment
[project/uci.git] / ucimap.c
1 /*
2 * ucimap.c - Library for the Unified Configuration Interface
3 * Copyright (C) 2008-2009 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 Lesser General Public License for more details.
13 */
14
15 /*
16 * This file contains ucimap, an API for mapping UCI to C data structures
17 */
18
19 #include <strings.h>
20 #include <stdbool.h>
21 #include <string.h>
22 #include <stdlib.h>
23 #include <unistd.h>
24 #include <limits.h>
25 #include <stdio.h>
26 #include <ctype.h>
27 #include <errno.h>
28 #include "ucimap.h"
29 #include "uci_internal.h"
30
31 struct ucimap_alloc {
32 void *ptr;
33 };
34
35 struct ucimap_alloc_custom {
36 void *section;
37 struct uci_optmap *om;
38 void *ptr;
39 };
40
41 struct ucimap_fixup {
42 struct ucimap_fixup *next;
43 struct uci_sectionmap *sm;
44 const char *name;
45 enum ucimap_type type;
46 union ucimap_data *data;
47 };
48
49 #define ucimap_foreach_option(_sm, _o) \
50 if (!(_sm)->options_size) \
51 (_sm)->options_size = sizeof(struct uci_optmap); \
52 for (_o = &(_sm)->options[0]; \
53 ((char *)(_o)) < ((char *) &(_sm)->options[0] + \
54 (_sm)->options_size * (_sm)->n_options); \
55 _o = (struct uci_optmap *) ((char *)(_o) + \
56 (_sm)->options_size))
57
58
59 static inline bool
60 ucimap_is_alloc(enum ucimap_type type)
61 {
62 return (type & UCIMAP_SUBTYPE) == UCIMAP_STRING;
63 }
64
65 static inline bool
66 ucimap_is_fixup(enum ucimap_type type)
67 {
68 return (type & UCIMAP_SUBTYPE) == UCIMAP_SECTION;
69 }
70
71 static inline bool
72 ucimap_is_simple(enum ucimap_type type)
73 {
74 return ((type & UCIMAP_TYPE) == UCIMAP_SIMPLE);
75 }
76
77 static inline bool
78 ucimap_is_list(enum ucimap_type type)
79 {
80 return ((type & UCIMAP_TYPE) == UCIMAP_LIST);
81 }
82
83 static inline bool
84 ucimap_is_list_auto(enum ucimap_type type)
85 {
86 return ucimap_is_list(type) && !!(type & UCIMAP_LIST_AUTO);
87 }
88
89 static inline bool
90 ucimap_is_custom(enum ucimap_type type)
91 {
92 return ((type & UCIMAP_SUBTYPE) == UCIMAP_CUSTOM);
93 }
94
95 static inline void *
96 ucimap_section_ptr(struct ucimap_section_data *sd)
97 {
98 return ((char *) sd - sd->sm->smap_offset);
99 }
100
101 static inline struct ucimap_section_data *
102 ucimap_ptr_section(struct uci_sectionmap *sm, void *ptr) {
103 ptr = (char *) ptr + sm->smap_offset;
104 return ptr;
105 }
106
107 static inline union ucimap_data *
108 ucimap_get_data(struct ucimap_section_data *sd, struct uci_optmap *om)
109 {
110 void *data;
111
112 data = (char *) ucimap_section_ptr(sd) + om->offset;
113 return data;
114 }
115
116 int
117 ucimap_init(struct uci_map *map)
118 {
119 map->fixup = NULL;
120 map->sdata = NULL;
121 map->fixup_tail = &map->fixup;
122 map->sdata_tail = &map->sdata;
123 return 0;
124 }
125
126 static void
127 ucimap_add_alloc(struct ucimap_section_data *sd, void *ptr)
128 {
129 struct ucimap_alloc *a = &sd->allocmap[sd->allocmap_len++];
130 a->ptr = ptr;
131 }
132
133 void
134 ucimap_free_section(struct uci_map *map, struct ucimap_section_data *sd)
135 {
136 void *section;
137 unsigned int i;
138
139 section = ucimap_section_ptr(sd);
140 if (sd->ref)
141 *sd->ref = sd->next;
142
143 if (sd->sm->free)
144 sd->sm->free(map, section);
145
146 for (i = 0; i < sd->allocmap_len; i++) {
147 free(sd->allocmap[i].ptr);
148 }
149
150 if (sd->alloc_custom) {
151 for (i = 0; i < sd->alloc_custom_len; i++) {
152 struct ucimap_alloc_custom *a = &sd->alloc_custom[i];
153 a->om->free(a->section, a->om, a->ptr);
154 }
155 free(sd->alloc_custom);
156 }
157
158 free(sd->allocmap);
159 free(sd);
160 }
161
162 void
163 ucimap_cleanup(struct uci_map *map)
164 {
165 struct ucimap_section_data *sd, *sd_next;
166
167 for (sd = map->sdata; sd; sd = sd_next) {
168 sd_next = sd->next;
169 ucimap_free_section(map, sd);
170 }
171 }
172
173 static void *
174 ucimap_find_section(struct uci_map *map, struct ucimap_fixup *f)
175 {
176 struct ucimap_section_data *sd;
177
178 for (sd = map->sdata; sd; sd = sd->next) {
179 if (sd->sm != f->sm)
180 continue;
181 if (strcmp(f->name, sd->section_name) != 0)
182 continue;
183 return ucimap_section_ptr(sd);
184 }
185 for (sd = map->pending; sd; sd = sd->next) {
186 if (sd->sm != f->sm)
187 continue;
188 if (strcmp(f->name, sd->section_name) != 0)
189 continue;
190 return ucimap_section_ptr(sd);
191 }
192 return NULL;
193 }
194
195 static union ucimap_data *
196 ucimap_list_append(struct ucimap_list *list)
197 {
198 if (unlikely(list->size <= list->n_items)) {
199 /* should not happen */
200 DPRINTF("ERROR: overflow while filling a list (size=%d)\n", list->size);
201 return NULL;
202 }
203 return &list->item[list->n_items++];
204 }
205
206
207 static bool
208 ucimap_handle_fixup(struct uci_map *map, struct ucimap_fixup *f)
209 {
210 void *ptr = ucimap_find_section(map, f);
211 union ucimap_data *data;
212
213 if (!ptr)
214 return false;
215
216 switch(f->type & UCIMAP_TYPE) {
217 case UCIMAP_SIMPLE:
218 f->data->ptr = ptr;
219 break;
220 case UCIMAP_LIST:
221 data = ucimap_list_append(f->data->list);
222 if (!data)
223 return false;
224
225 data->ptr = ptr;
226 break;
227 }
228 return true;
229 }
230
231 void
232 ucimap_free_item(struct ucimap_section_data *sd, void *item)
233 {
234 struct ucimap_alloc_custom *ac;
235 struct ucimap_alloc *a;
236 void *ptr = *((void **) item);
237 unsigned int i;
238
239 if (!ptr)
240 return;
241
242 *((void **)item) = NULL;
243 for (i = 0, a = sd->allocmap; i < sd->allocmap_len; i++, a++) {
244 if (a->ptr != ptr)
245 continue;
246
247 if (i != sd->allocmap_len - 1)
248 a->ptr = sd->allocmap[sd->allocmap_len - 1].ptr;
249
250 sd->allocmap_len--;
251 return;
252 }
253
254 for (i = 0, ac = sd->alloc_custom; i < sd->alloc_custom_len; i++, ac++) {
255 if (ac->ptr != ptr)
256 continue;
257
258 if (i != sd->alloc_custom_len - 1)
259 memcpy(ac, &sd->alloc_custom[sd->alloc_custom_len - 1],
260 sizeof(struct ucimap_alloc_custom));
261
262 ac->om->free(ac->section, ac->om, ac->ptr);
263 sd->alloc_custom_len--;
264 return;
265 }
266 }
267
268 int
269 ucimap_resize_list(struct ucimap_section_data *sd, struct ucimap_list **list, int items)
270 {
271 struct ucimap_list *new;
272 struct ucimap_alloc *a;
273 unsigned int i;
274 int offset = 0;
275 int size = sizeof(struct ucimap_list) + items * sizeof(union ucimap_data);
276
277 if (!*list) {
278 new = calloc(1, size);
279 if (!new)
280 return -ENOMEM;
281
282 ucimap_add_alloc(sd, new);
283 goto set;
284 }
285
286 for (i = 0, a = sd->allocmap; i < sd->allocmap_len; i++, a++) {
287 if (a->ptr != *list)
288 continue;
289
290 goto realloc;
291 }
292 return -ENOENT;
293
294 realloc:
295 if (items > (*list)->size)
296 offset = (items - (*list)->size) * sizeof(union ucimap_data);
297
298 a->ptr = realloc(a->ptr, size);
299 if (!a->ptr)
300 return -ENOMEM;
301
302 if (offset)
303 memset((char *) a->ptr + offset, 0, size - offset);
304 new = a->ptr;
305
306 set:
307 new->size = items;
308 *list = new;
309 return 0;
310 }
311
312 static void
313 ucimap_add_fixup(struct ucimap_section_data *sd, union ucimap_data *data, struct uci_optmap *om, const char *str)
314 {
315 struct ucimap_fixup *f, tmp;
316 struct uci_map *map = sd->map;
317
318 tmp.next = NULL;
319 tmp.sm = om->data.sm;
320 tmp.name = str;
321 tmp.type = om->type;
322 tmp.data = data;
323 if (ucimap_handle_fixup(map, &tmp))
324 return;
325
326 f = malloc(sizeof(struct ucimap_fixup));
327 if (!f)
328 return;
329
330 memcpy(f, &tmp, sizeof(tmp));
331 f->next = NULL;
332 *map->fixup_tail = f;
333 map->fixup_tail = &f->next;
334 }
335
336 static void
337 ucimap_add_custom_alloc(struct ucimap_section_data *sd, struct uci_optmap *om, void *ptr)
338 {
339 struct ucimap_alloc_custom *a = &sd->alloc_custom[sd->alloc_custom_len++];
340
341 a->section = ucimap_section_ptr(sd);
342 a->om = om;
343 a->ptr = ptr;
344 }
345
346 static void
347 ucimap_add_value(union ucimap_data *data, struct uci_optmap *om, struct ucimap_section_data *sd, const char *str)
348 {
349 union ucimap_data tdata = *data;
350 char *eptr = NULL;
351 long lval;
352 char *s;
353 int val;
354
355 if (ucimap_is_list(om->type) && !ucimap_is_fixup(om->type)) {
356 data = ucimap_list_append(data->list);
357 if (!data)
358 return;
359 }
360
361 switch(om->type & UCIMAP_SUBTYPE) {
362 case UCIMAP_STRING:
363 if ((om->data.s.maxlen > 0) &&
364 (strlen(str) > (unsigned) om->data.s.maxlen))
365 return;
366
367 s = strdup(str);
368 tdata.s = s;
369 ucimap_add_alloc(sd, s);
370 break;
371 case UCIMAP_BOOL:
372 if (!strcmp(str, "on"))
373 val = true;
374 else if (!strcmp(str, "1"))
375 val = true;
376 else if (!strcmp(str, "enabled"))
377 val = true;
378 else if (!strcmp(str, "off"))
379 val = false;
380 else if (!strcmp(str, "0"))
381 val = false;
382 else if (!strcmp(str, "disabled"))
383 val = false;
384 else
385 return;
386
387 tdata.b = val;
388 break;
389 case UCIMAP_INT:
390 lval = strtol(str, &eptr, om->data.i.base);
391 if (lval < INT_MIN || lval > INT_MAX)
392 return;
393
394 if (!eptr || *eptr == '\0')
395 tdata.i = (int) lval;
396 else
397 return;
398 break;
399 case UCIMAP_SECTION:
400 ucimap_add_fixup(sd, data, om, str);
401 return;
402 case UCIMAP_CUSTOM:
403 break;
404 }
405 if (om->parse) {
406 if (om->parse(ucimap_section_ptr(sd), om, data, str) < 0)
407 return;
408 if (ucimap_is_custom(om->type) && om->free) {
409 if (tdata.ptr != data->ptr)
410 ucimap_add_custom_alloc(sd, om, data->ptr);
411 }
412 }
413 if (ucimap_is_custom(om->type))
414 return;
415 memcpy(data, &tdata, sizeof(union ucimap_data));
416 }
417
418
419 static void
420 ucimap_convert_list(union ucimap_data *data, struct uci_optmap *om, struct ucimap_section_data *sd, const char *str)
421 {
422 char *s, *p;
423
424 s = strdup(str);
425 if (!s)
426 return;
427
428 ucimap_add_alloc(sd, s);
429
430 do {
431 while (isspace(*s))
432 s++;
433
434 if (!*s)
435 break;
436
437 p = s;
438 while (*s && !isspace(*s))
439 s++;
440
441 if (isspace(*s)) {
442 *s = 0;
443 s++;
444 }
445
446 ucimap_add_value(data, om, sd, p);
447 } while (*s);
448 }
449
450 static int
451 ucimap_parse_options(struct uci_map *map, struct uci_sectionmap *sm, struct ucimap_section_data *sd, struct uci_section *s)
452 {
453 struct uci_element *e, *l;
454 struct uci_option *o;
455 union ucimap_data *data;
456
457 uci_foreach_element(&s->options, e) {
458 struct uci_optmap *om = NULL, *tmp;
459
460 ucimap_foreach_option(sm, tmp) {
461 if (strcmp(e->name, tmp->name) == 0) {
462 om = tmp;
463 break;
464 }
465 }
466 if (!om)
467 continue;
468
469 data = ucimap_get_data(sd, om);
470 o = uci_to_option(e);
471 if ((o->type == UCI_TYPE_STRING) && ucimap_is_simple(om->type)) {
472 ucimap_add_value(data, om, sd, o->v.string);
473 } else if ((o->type == UCI_TYPE_LIST) && ucimap_is_list(om->type)) {
474 uci_foreach_element(&o->v.list, l) {
475 ucimap_add_value(data, om, sd, l->name);
476 }
477 } else if ((o->type == UCI_TYPE_STRING) && ucimap_is_list_auto(om->type)) {
478 ucimap_convert_list(data, om, sd, o->v.string);
479 }
480 }
481
482 return 0;
483 }
484
485 static void
486 ucimap_add_section_list(struct uci_map *map, struct ucimap_section_data *sd)
487 {
488 sd->ref = map->sdata_tail;
489 *sd->ref = sd;
490 map->sdata_tail = &sd->next;
491 }
492
493 static void
494 ucimap_add_section(struct ucimap_section_data *sd)
495 {
496 struct uci_map *map = sd->map;
497
498 sd->next = NULL;
499 if (sd->sm->add(map, ucimap_section_ptr(sd)) < 0)
500 ucimap_free_section(map, sd);
501 else
502 ucimap_add_section_list(map, sd);
503 }
504
505 #ifdef UCI_DEBUG
506 static const char *ucimap_type_names[] = {
507 [UCIMAP_STRING] = "string",
508 [UCIMAP_INT] = "integer",
509 [UCIMAP_BOOL] = "boolean",
510 [UCIMAP_SECTION] = "section",
511 [UCIMAP_LIST] = "list",
512 };
513
514 static const char *
515 ucimap_get_type_name(int type)
516 {
517 static char buf[32];
518 const char *name;
519
520 if (ucimap_is_list(type))
521 return ucimap_type_names[UCIMAP_LIST];
522
523 name = ucimap_type_names[type & UCIMAP_SUBTYPE];
524 if (!name) {
525 sprintf(buf, "Unknown (%d)", type & UCIMAP_SUBTYPE);
526 name = buf;
527 }
528
529 return name;
530 }
531 #endif
532
533 static bool
534 ucimap_check_optmap_type(struct uci_sectionmap *sm, struct uci_optmap *om)
535 {
536 int type;
537
538 if (unlikely(sm->type_name != om->type_name) &&
539 unlikely(strcmp(sm->type_name, om->type_name) != 0)) {
540 DPRINTF("Option '%s' of section type '%s' refereces unknown "
541 "section type '%s', should be '%s'.\n",
542 om->name, sm->type, om->type_name, sm->type_name);
543 return false;
544 }
545
546 if (om->detected_type < 0)
547 return true;
548
549 if (ucimap_is_custom(om->type))
550 return true;
551
552 if (ucimap_is_list(om->type) !=
553 ucimap_is_list(om->detected_type))
554 goto failed;
555
556 if (ucimap_is_list(om->type))
557 return true;
558
559 type = om->type & UCIMAP_SUBTYPE;
560 switch(type) {
561 case UCIMAP_STRING:
562 case UCIMAP_INT:
563 case UCIMAP_BOOL:
564 if (type != om->detected_type)
565 goto failed;
566 break;
567 case UCIMAP_SECTION:
568 goto failed;
569 default:
570 break;
571 }
572 return true;
573
574 failed:
575 DPRINTF("Invalid type in option '%s' of section type '%s', "
576 "declared type is %s, detected type is %s\n",
577 om->name, sm->type,
578 ucimap_get_type_name(om->type),
579 ucimap_get_type_name(om->detected_type));
580 return false;
581 }
582
583 static void
584 ucimap_count_alloc(struct uci_optmap *om, int *n_alloc, int *n_custom)
585 {
586 if (ucimap_is_alloc(om->type))
587 (*n_alloc)++;
588 else if (ucimap_is_custom(om->type) && om->free)
589 (*n_custom)++;
590 }
591
592 int
593 ucimap_parse_section(struct uci_map *map, struct uci_sectionmap *sm, struct ucimap_section_data *sd, struct uci_section *s)
594 {
595 struct uci_optmap *om;
596 char *section_name;
597 void *section;
598 int n_alloc = 2;
599 int n_alloc_custom = 0;
600 int err;
601
602 sd->map = map;
603 sd->sm = sm;
604
605 ucimap_foreach_option(sm, om) {
606 if (!ucimap_check_optmap_type(sm, om))
607 continue;
608
609 if (ucimap_is_list(om->type)) {
610 union ucimap_data *data;
611 struct uci_element *e;
612 int n_elements = 0;
613 int n_elements_alloc = 0;
614 int n_elements_custom = 0;
615 int size;
616
617 data = ucimap_get_data(sd, om);
618 uci_foreach_element(&s->options, e) {
619 struct uci_option *o = uci_to_option(e);
620 struct uci_element *tmp;
621
622 if (strcmp(e->name, om->name) != 0)
623 continue;
624
625 if (o->type == UCI_TYPE_LIST) {
626 uci_foreach_element(&o->v.list, tmp) {
627 ucimap_count_alloc(om, &n_elements_alloc, &n_elements_custom);
628 n_elements++;
629 }
630 } else if ((o->type == UCI_TYPE_STRING) &&
631 ucimap_is_list_auto(om->type)) {
632 const char *data = o->v.string;
633 do {
634 while (isspace(*data))
635 data++;
636
637 if (!*data)
638 break;
639
640 n_elements++;
641 ucimap_count_alloc(om, &n_elements_alloc, &n_elements_custom);
642
643 while (*data && !isspace(*data))
644 data++;
645 } while (*data);
646
647 /* for the duplicated data string */
648 if (n_elements)
649 n_alloc++;
650 }
651 break;
652 }
653 /* add one more for the ucimap_list */
654 n_alloc += n_elements_alloc + 1;
655 n_alloc_custom += n_elements_custom;
656 size = sizeof(struct ucimap_list) +
657 n_elements * sizeof(union ucimap_data);
658
659 data->list = malloc(size);
660 if (!data->list)
661 goto error_mem;
662
663 memset(data->list, 0, size);
664 data->list->size = n_elements;
665 } else {
666 ucimap_count_alloc(om, &n_alloc, &n_alloc_custom);
667 }
668 }
669
670 sd->allocmap = calloc(n_alloc, sizeof(struct ucimap_alloc));
671 if (!sd->allocmap)
672 goto error_mem;
673
674 if (n_alloc_custom > 0) {
675 sd->alloc_custom = calloc(n_alloc_custom, sizeof(struct ucimap_alloc_custom));
676 if (!sd->alloc_custom)
677 goto error_mem;
678 }
679
680 section_name = strdup(s->e.name);
681 if (!section_name)
682 goto error_mem;
683
684 sd->section_name = section_name;
685
686 sd->cmap = calloc(1, BITFIELD_SIZE(sm->n_options));
687 if (!sd->cmap)
688 goto error_mem;
689
690 ucimap_add_alloc(sd, (void *)section_name);
691 ucimap_add_alloc(sd, (void *)sd->cmap);
692 ucimap_foreach_option(sm, om) {
693 if (!ucimap_is_list(om->type))
694 continue;
695
696 ucimap_add_alloc(sd, ucimap_get_data(sd, om)->list);
697 }
698
699 section = ucimap_section_ptr(sd);
700 err = sm->init(map, section, s);
701 if (err)
702 goto error;
703
704 if (map->parsed) {
705 ucimap_add_section(sd);
706 } else {
707 ucimap_add_section_list(map, sd);
708 }
709
710 err = ucimap_parse_options(map, sm, sd, s);
711 if (err)
712 goto error;
713
714 return 0;
715
716 error_mem:
717 free(sd->alloc_custom);
718 free(sd->allocmap);
719 free(sd);
720 return UCI_ERR_MEM;
721
722 error:
723 ucimap_free_section(map, sd);
724 return err;
725 }
726
727 static int
728 ucimap_fill_ptr(struct uci_ptr *ptr, struct uci_section *s, const char *option)
729 {
730 struct uci_package *p = s->package;
731
732 memset(ptr, 0, sizeof(struct uci_ptr));
733
734 ptr->package = p->e.name;
735 ptr->p = p;
736
737 ptr->section = s->e.name;
738 ptr->s = s;
739
740 ptr->option = option;
741 return uci_lookup_ptr(p->ctx, ptr, NULL, false);
742 }
743
744 void
745 ucimap_set_changed(struct ucimap_section_data *sd, void *field)
746 {
747 void *section = ucimap_section_ptr(sd);
748 struct uci_sectionmap *sm = sd->sm;
749 struct uci_optmap *om;
750 unsigned int ofs = (char *)field - (char *)section;
751 int i = 0;
752
753 ucimap_foreach_option(sm, om) {
754 if (om->offset == ofs) {
755 SET_BIT(sd->cmap, i);
756 break;
757 }
758 i++;
759 }
760 }
761
762 static char *
763 ucimap_data_to_string(struct ucimap_section_data *sd, struct uci_optmap *om, union ucimap_data *data)
764 {
765 static char buf[32];
766 char *str = NULL;
767
768 switch(om->type & UCIMAP_SUBTYPE) {
769 case UCIMAP_STRING:
770 str = data->s;
771 break;
772 case UCIMAP_INT:
773 sprintf(buf, "%d", data->i);
774 str = buf;
775 break;
776 case UCIMAP_BOOL:
777 sprintf(buf, "%d", !!data->b);
778 str = buf;
779 break;
780 case UCIMAP_SECTION:
781 if (data->ptr)
782 str = (char *) ucimap_ptr_section(om->data.sm, data->ptr)->section_name;
783 else
784 str = "";
785 break;
786 case UCIMAP_CUSTOM:
787 break;
788 default:
789 return NULL;
790 }
791
792 if (om->format) {
793 if (om->format(ucimap_section_ptr(sd), om, data, &str) < 0)
794 return NULL;
795
796 if (!str)
797 str = "";
798 }
799 return str;
800 }
801
802 int
803 ucimap_store_section(struct uci_map *map, struct uci_package *p, struct ucimap_section_data *sd)
804 {
805 struct uci_sectionmap *sm = sd->sm;
806 struct uci_section *s = NULL;
807 struct uci_optmap *om;
808 struct uci_element *e;
809 struct uci_ptr ptr;
810 int i = 0;
811 int ret;
812
813 uci_foreach_element(&p->sections, e) {
814 if (!strcmp(e->name, sd->section_name)) {
815 s = uci_to_section(e);
816 break;
817 }
818 }
819 if (!s)
820 return UCI_ERR_NOTFOUND;
821
822 ucimap_foreach_option(sm, om) {
823 union ucimap_data *data;
824
825 i++;
826 data = ucimap_get_data(sd, om);
827 if (!TEST_BIT(sd->cmap, i - 1))
828 continue;
829
830 ucimap_fill_ptr(&ptr, s, om->name);
831 if (ucimap_is_list(om->type)) {
832 struct ucimap_list *list = data->list;
833 bool first = true;
834 int j;
835
836 for (j = 0; j < list->n_items; j++) {
837 ptr.value = ucimap_data_to_string(sd, om, &list->item[j]);
838 if (!ptr.value)
839 continue;
840
841 if (first) {
842 ret = uci_set(s->package->ctx, &ptr);
843 first = false;
844 } else {
845 ret = uci_add_list(s->package->ctx, &ptr);
846 }
847 if (ret)
848 return ret;
849 }
850 } else {
851 ptr.value = ucimap_data_to_string(sd, om, data);
852 if (!ptr.value)
853 continue;
854
855 ret = uci_set(s->package->ctx, &ptr);
856 if (ret)
857 return ret;
858 }
859
860 CLR_BIT(sd->cmap, i - 1);
861 }
862
863 return 0;
864 }
865
866 void
867 ucimap_parse(struct uci_map *map, struct uci_package *pkg)
868 {
869 struct uci_element *e;
870 struct ucimap_section_data *sd, **sd_tail;
871 struct ucimap_fixup *f;
872 unsigned int i;
873
874 sd_tail = map->sdata_tail;
875 map->parsed = false;
876 map->sdata_tail = &map->pending;
877 uci_foreach_element(&pkg->sections, e) {
878 struct uci_section *s = uci_to_section(e);
879
880 for (i = 0; i < map->n_sections; i++) {
881 struct uci_sectionmap *sm = map->sections[i];
882 struct ucimap_section_data *sd;
883
884 if (strcmp(s->type, map->sections[i]->type) != 0)
885 continue;
886
887 if (sm->alloc) {
888 sd = sm->alloc(map, sm, s);
889 memset(sd, 0, sizeof(struct ucimap_section_data));
890 } else {
891 sd = malloc(sm->alloc_len);
892 memset(sd, 0, sm->alloc_len);
893 sd = ucimap_ptr_section(sm, sd);
894 }
895 if (!sd)
896 continue;
897
898 ucimap_parse_section(map, sm, sd, s);
899 }
900 }
901 if (!map->parsed) {
902 map->parsed = true;
903 map->sdata_tail = sd_tail;
904 }
905
906 f = map->fixup;
907 while (f) {
908 struct ucimap_fixup *next = f->next;
909 ucimap_handle_fixup(map, f);
910 free(f);
911 f = next;
912 }
913 map->fixup_tail = &map->fixup;
914 map->fixup = NULL;
915
916 sd = map->pending;
917 while (sd) {
918 struct ucimap_section_data *next = sd->next;
919 ucimap_add_section(sd);
920 sd = next;
921 }
922 map->pending = NULL;
923 }