implement uci_set, improve error handling
[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 void *ptr;
62
63 ptr = uci_malloc(ctx, size + strlen(name) + 1);
64 e = (struct uci_element *) ptr;
65 e->type = type;
66 e->name = (char *) ptr + size;
67 strcpy(e->name, name);
68 uci_list_init(&e->list);
69
70 return e;
71 }
72
73 static void
74 uci_free_element(struct uci_element *e)
75 {
76 if (!uci_list_empty(&e->list))
77 uci_list_del(&e->list);
78 free(e);
79 }
80
81 static struct uci_option *
82 uci_alloc_option(struct uci_section *s, const char *name, const char *value)
83 {
84 struct uci_package *p = s->package;
85 struct uci_context *ctx = p->ctx;
86 struct uci_option *o;
87
88 o = uci_alloc_element(ctx, option, name, strlen(value) + 1);
89 o->value = uci_dataptr(o);
90 o->section = s;
91 strcpy(o->value, value);
92 uci_list_add(&s->options, &o->e.list);
93
94 return o;
95 }
96
97 static inline void
98 uci_free_option(struct uci_option *o)
99 {
100 uci_free_element(&o->e);
101 }
102
103 static struct uci_section *
104 uci_alloc_section(struct uci_package *p, const char *type, const char *name)
105 {
106 struct uci_context *ctx = p->ctx;
107 struct uci_section *s;
108 char buf[16];
109
110 if (!name || !name[0]) {
111 snprintf(buf, 16, "cfg%d", p->n_section);
112 name = buf;
113 }
114
115 s = uci_alloc_element(ctx, section, name, strlen(type) + 1);
116 s->type = uci_dataptr(s);
117 s->package = p;
118 strcpy(s->type, type);
119 uci_list_init(&s->options);
120 uci_list_add(&p->sections, &s->e.list);
121
122 return s;
123 }
124
125 static void
126 uci_free_section(struct uci_section *s)
127 {
128 struct uci_element *o, *tmp;
129
130 uci_foreach_element_safe(&s->options, tmp, o) {
131 uci_free_option(uci_to_option(o));
132 }
133 uci_free_element(&s->e);
134 }
135
136 static struct uci_package *
137 uci_alloc_package(struct uci_context *ctx, const char *name)
138 {
139 struct uci_package *p;
140
141 p = uci_alloc_element(ctx, package, name, 0);
142 p->ctx = ctx;
143 uci_list_init(&p->sections);
144 uci_list_init(&p->history);
145 return p;
146 }
147
148 static void
149 uci_free_package(struct uci_package *p)
150 {
151 struct uci_element *e, *tmp;
152
153 if(!p)
154 return;
155
156 uci_foreach_element_safe(&p->sections, tmp, e) {
157 uci_free_section(uci_to_section(e));
158 }
159 uci_free_element(&p->e);
160 }
161
162 /* record a change that was done to a package */
163 static inline void
164 uci_add_history(struct uci_context *ctx, struct uci_package *p, int cmd, char *section, char *option, char *value)
165 {
166 struct uci_history *h = (struct uci_history *) uci_malloc(ctx, sizeof(struct uci_history));
167
168 uci_list_init(&h->list);
169 h->cmd = cmd;
170 h->section = section;
171 h->option = option;
172 h->value = value;
173 uci_list_add(&p->history, &h->list);
174 }
175
176
177 static struct uci_element *uci_lookup_list(struct uci_context *ctx, struct uci_list *list, char *name)
178 {
179 struct uci_element *e;
180
181 uci_foreach_element(list, e) {
182 if (!strcmp(e->name, name))
183 return e;
184 }
185 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
186 }
187
188 int uci_lookup(struct uci_context *ctx, struct uci_element **res, char *package, char *section, char *option)
189 {
190 struct uci_element *e;
191 struct uci_package *p;
192 struct uci_section *s;
193 struct uci_option *o;
194
195 UCI_HANDLE_ERR(ctx);
196 UCI_ASSERT(ctx, res != NULL);
197 UCI_ASSERT(ctx, package != NULL);
198
199 e = uci_lookup_list(ctx, &ctx->root, package);
200 if (!section)
201 goto found;
202
203 p = uci_to_package(e);
204 e = uci_lookup_list(ctx, &p->sections, section);
205 if (!option)
206 goto found;
207
208 s = uci_to_section(e);
209 e = uci_lookup_list(ctx, &s->options, option);
210
211 found:
212 *res = e;
213 return 0;
214 }
215
216 int uci_set_element_value(struct uci_context *ctx, struct uci_element **element, char *value)
217 {
218 int size;
219 char *str;
220 struct uci_list *list;
221 struct uci_element *e;
222
223 UCI_HANDLE_ERR(ctx);
224 UCI_ASSERT(ctx, value != NULL);
225 UCI_ASSERT(ctx, element != NULL);
226 UCI_ASSERT(ctx, *element != NULL);
227
228 /* what the 'value' of an element means depends on the type
229 * for a section, the 'value' means its type
230 * for an option, the 'value' means its value string
231 * when changing the value, shrink the element to its actual size
232 * (it may have been allocated with a bigger size, to include
233 * its buffer)
234 * then duplicate the string passed on the command line and
235 * insert it into the structure.
236 */
237 e = *element;
238 list = e->list.prev;
239 switch(e->type) {
240 case UCI_TYPE_SECTION:
241 size = sizeof(struct uci_section);
242 break;
243 case UCI_TYPE_OPTION:
244 size = sizeof(struct uci_option);
245 break;
246 default:
247 UCI_THROW(ctx, UCI_ERR_INVAL);
248 break;
249 }
250
251 uci_list_del(&e->list);
252 e = uci_realloc(ctx, e, size);
253 str = uci_strdup(ctx, value);
254 uci_list_insert(list, &e->list);
255 *element = e;
256
257 switch(e->type) {
258 case UCI_TYPE_SECTION:
259 uci_to_section(e)->type = value;
260 break;
261 case UCI_TYPE_OPTION:
262 uci_to_option(e)->value = value;
263 break;
264 default:
265 break;
266 }
267
268 return 0;
269 }
270
271 int uci_set(struct uci_context *ctx, char *package, char *section, char *option, char *value)
272 {
273 struct uci_element *e;
274 struct uci_package *p = NULL;
275 struct uci_section *s = NULL;
276 struct uci_option *o = NULL;
277 struct uci_history *h;
278
279 UCI_HANDLE_ERR(ctx);
280 UCI_ASSERT(ctx, package != NULL);
281 UCI_ASSERT(ctx, section != NULL);
282
283 fprintf(stderr, "uci_set: '%s' '%s' '%s' = '%s'\n", package, section, option, value);
284
285 /*
286 * look up the package, section and option (if set)
287 * if the section/option is to be modified and it is not found
288 * create a new element in the appropriate list
289 */
290 UCI_TRAP_SAVE(ctx, notfound);
291 e = uci_lookup_list(ctx, &ctx->root, package);
292 if (!e)
293 goto notfound;
294
295 p = uci_to_package(e);
296 e = uci_lookup_list(ctx, &p->sections, section);
297 if (!e)
298 goto notfound;
299 s = uci_to_section(e);
300
301 if (option) {
302 e = uci_lookup_list(ctx, &s->options, option);
303 if (!e)
304 goto notfound;
305 o = uci_to_option(e);
306 }
307 UCI_TRAP_RESTORE(ctx);
308
309 /*
310 * no unknown element was supplied, assume that we can just update
311 * an existing entry
312 */
313 if (o)
314 e = &o->e;
315 else
316 e = &s->e;
317
318 uci_add_history(ctx, p, UCI_CMD_CHANGE, section, option, value);
319 return uci_set_element_value(ctx, &e, value);
320
321 notfound:
322 /*
323 * the entry that we need to update was not found,
324 * check if the search failed prematurely.
325 * this can happen if the package was not found, or if
326 * an option was supplied, but the section wasn't found
327 */
328 if (!p || (!s && option))
329 UCI_THROW(ctx, ctx->errno);
330
331 /* now add the missing entry */
332 uci_add_history(ctx, p, UCI_CMD_ADD, section, option, value);
333 if (s)
334 uci_alloc_option(s, option, value);
335 else
336 uci_alloc_section(p, section, value);
337
338 return 0;
339 }
340
341 int uci_unload(struct uci_context *ctx, const char *name)
342 {
343 struct uci_element *e;
344
345 UCI_HANDLE_ERR(ctx);
346 UCI_ASSERT(ctx, name != NULL);
347
348 uci_foreach_element(&ctx->root, e) {
349 if (!strcmp(e->name, name))
350 goto found;
351 }
352 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
353
354 found:
355 uci_free_package(uci_to_package(e));
356
357 return 0;
358 }
359