plug a memleak
[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 if ((o->value != uci_dataptr(o)) &&
106 (o->value != NULL))
107 free(o->value);
108 uci_free_element(&o->e);
109 }
110
111 static struct uci_section *
112 uci_alloc_section(struct uci_package *p, const char *type, const char *name)
113 {
114 struct uci_context *ctx = p->ctx;
115 struct uci_section *s;
116 char buf[16];
117
118 if (!name || !name[0]) {
119 snprintf(buf, 16, "cfg%d", p->n_section);
120 name = buf;
121 }
122
123 s = uci_alloc_element(ctx, section, name, strlen(type) + 1);
124 s->type = uci_dataptr(s);
125 s->package = p;
126 strcpy(s->type, type);
127 uci_list_init(&s->options);
128 uci_list_add(&p->sections, &s->e.list);
129
130 return s;
131 }
132
133 static void
134 uci_free_section(struct uci_section *s)
135 {
136 struct uci_element *o, *tmp;
137
138 uci_foreach_element_safe(&s->options, tmp, o) {
139 uci_free_option(uci_to_option(o));
140 }
141 if ((s->type != uci_dataptr(s)) &&
142 (s->type != NULL))
143 free(s->type);
144 uci_free_element(&s->e);
145 }
146
147 static struct uci_package *
148 uci_alloc_package(struct uci_context *ctx, const char *name)
149 {
150 struct uci_package *p;
151
152 p = uci_alloc_element(ctx, package, name, 0);
153 p->ctx = ctx;
154 uci_list_init(&p->sections);
155 uci_list_init(&p->history);
156 return p;
157 }
158
159 static void
160 uci_free_package(struct uci_package *p)
161 {
162 struct uci_element *e, *tmp;
163
164 if(!p)
165 return;
166
167 if (p->path)
168 free(p->path);
169 uci_foreach_element_safe(&p->sections, tmp, e) {
170 uci_free_section(uci_to_section(e));
171 }
172 uci_free_element(&p->e);
173 }
174
175 /* record a change that was done to a package */
176 static inline void
177 uci_add_history(struct uci_context *ctx, struct uci_package *p, int cmd, char *section, char *option, char *value)
178 {
179 struct uci_history *h;
180 int size = strlen(section) + 1;
181 char *ptr;
182
183 if (!p->confdir)
184 return;
185
186 if (value)
187 size += strlen(section) + 1;
188
189 h = uci_alloc_element(ctx, history, option, size);
190 ptr = uci_dataptr(h);
191 h->cmd = cmd;
192 h->section = strcpy(ptr, section);
193 if (value) {
194 ptr += strlen(ptr) + 1;
195 h->value = strcpy(ptr, value);
196 }
197 uci_list_add(&p->history, &h->e.list);
198 }
199
200 static struct uci_element *uci_lookup_list(struct uci_context *ctx, struct uci_list *list, const char *name)
201 {
202 struct uci_element *e;
203
204 uci_foreach_element(list, e) {
205 if (!strcmp(e->name, name))
206 return e;
207 }
208 return NULL;
209 }
210
211 int uci_lookup(struct uci_context *ctx, struct uci_element **res, struct uci_package *p, char *section, char *option)
212 {
213 struct uci_element *e;
214 struct uci_section *s;
215 struct uci_option *o;
216
217 UCI_HANDLE_ERR(ctx);
218 UCI_ASSERT(ctx, res != NULL);
219 UCI_ASSERT(ctx, p != NULL);
220 UCI_ASSERT(ctx, section != NULL);
221
222 e = uci_lookup_list(ctx, &p->sections, section);
223 if (!e)
224 goto notfound;
225
226 if (option) {
227 s = uci_to_section(e);
228 e = uci_lookup_list(ctx, &s->options, option);
229 }
230
231 *res = e;
232 return 0;
233
234 notfound:
235 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
236 return 0;
237 }
238
239 int uci_del_element(struct uci_context *ctx, struct uci_element *e)
240 {
241 bool internal = ctx->internal;
242 struct uci_package *p = NULL;
243 struct uci_section *s = NULL;
244 struct uci_option *o = NULL;
245 struct uci_element *i, *tmp;
246 char *option = NULL;
247
248 UCI_HANDLE_ERR(ctx);
249 UCI_ASSERT(ctx, e != NULL);
250
251 switch(e->type) {
252 case UCI_TYPE_SECTION:
253 s = uci_to_section(e);
254 uci_foreach_element_safe(&s->options, tmp, i) {
255 uci_del_element(ctx, i);
256 }
257 break;
258 case UCI_TYPE_OPTION:
259 o = uci_to_option(e);
260 s = o->section;
261 p = s->package;
262 option = e->name;
263 break;
264 default:
265 UCI_THROW(ctx, UCI_ERR_INVAL);
266 break;
267 }
268
269 p = s->package;
270 if (!internal)
271 uci_add_history(ctx, p, UCI_CMD_REMOVE, s->e.name, option, NULL);
272
273 switch(e->type) {
274 case UCI_TYPE_SECTION:
275 uci_free_section(s);
276 break;
277 case UCI_TYPE_OPTION:
278 uci_free_option(o);
279 break;
280 default:
281 break;
282 }
283 return 0;
284 }
285
286 int uci_set_element_value(struct uci_context *ctx, struct uci_element **element, char *value)
287 {
288 bool internal = ctx->internal;
289 struct uci_list *list;
290 struct uci_element *e;
291 struct uci_package *p;
292 struct uci_section *s;
293 char *section;
294 char *option;
295 char *str;
296 int size;
297
298 UCI_HANDLE_ERR(ctx);
299 UCI_ASSERT(ctx, value != NULL);
300 UCI_ASSERT(ctx, element != NULL);
301 UCI_ASSERT(ctx, *element != NULL);
302
303 /* what the 'value' of an element means depends on the type
304 * for a section, the 'value' means its type
305 * for an option, the 'value' means its value string
306 * when changing the value, shrink the element to its actual size
307 * (it may have been allocated with a bigger size, to include
308 * its buffer)
309 * then duplicate the string passed on the command line and
310 * insert it into the structure.
311 */
312 e = *element;
313 list = e->list.prev;
314 switch(e->type) {
315 case UCI_TYPE_SECTION:
316 size = sizeof(struct uci_section);
317 s = uci_to_section(e);
318 section = e->name;
319 option = NULL;
320 break;
321 case UCI_TYPE_OPTION:
322 size = sizeof(struct uci_option);
323 s = uci_to_option(e)->section;
324 section = s->e.name;
325 option = e->name;
326 break;
327 default:
328 UCI_THROW(ctx, UCI_ERR_INVAL);
329 return 0;
330 }
331 p = s->package;
332 if (!internal)
333 uci_add_history(ctx, p, UCI_CMD_CHANGE, section, option, value);
334
335 uci_list_del(&e->list);
336 e = uci_realloc(ctx, e, size);
337 str = uci_strdup(ctx, value);
338 uci_list_insert(list, &e->list);
339 *element = e;
340
341 switch(e->type) {
342 case UCI_TYPE_SECTION:
343 uci_to_section(e)->type = str;
344 break;
345 case UCI_TYPE_OPTION:
346 uci_to_option(e)->value = str;
347 break;
348 default:
349 break;
350 }
351
352 return 0;
353 }
354
355 int uci_del(struct uci_context *ctx, struct uci_package *p, char *section, char *option)
356 {
357 bool internal = ctx->internal;
358 struct uci_element *e;
359 struct uci_section *s = NULL;
360 struct uci_option *o = NULL;
361
362 UCI_HANDLE_ERR(ctx);
363 UCI_ASSERT(ctx, p != NULL);
364 UCI_ASSERT(ctx, section != NULL);
365
366 UCI_INTERNAL(uci_lookup, ctx, &e, p, section, option);
367
368 if (!internal)
369 return uci_del_element(ctx, e);
370 UCI_INTERNAL(uci_del_element, ctx, e);
371
372 return 0;
373 }
374
375 int uci_set(struct uci_context *ctx, struct uci_package *p, char *section, char *option, char *value)
376 {
377 bool internal = ctx->internal;
378 struct uci_element *e = NULL;
379 struct uci_section *s = NULL;
380 struct uci_option *o = NULL;
381 struct uci_history *h;
382
383 UCI_HANDLE_ERR(ctx);
384 UCI_ASSERT(ctx, p != NULL);
385 UCI_ASSERT(ctx, section != NULL);
386 UCI_ASSERT(ctx, value != NULL);
387
388 /*
389 * look up the package, section and option (if set)
390 * if the section/option is to be modified and it is not found
391 * create a new element in the appropriate list
392 */
393 UCI_INTERNAL(uci_lookup, ctx, &e, p, section, NULL);
394 s = uci_to_section(e);
395 if (option) {
396 e = uci_lookup_list(ctx, &s->options, option);
397 if (!e)
398 goto notfound;
399 o = uci_to_option(e);
400 }
401
402 /*
403 * no unknown element was supplied, assume that we can just update
404 * an existing entry
405 */
406 if (o)
407 e = &o->e;
408 else
409 e = &s->e;
410
411 if (!internal)
412 return uci_set_element_value(ctx, &e, value);
413
414 UCI_INTERNAL(uci_set_element_value, ctx, &e, value);
415 return 0;
416
417 notfound:
418 /*
419 * the entry that we need to update was not found,
420 * check if the search failed prematurely.
421 * this can happen if the package was not found, or if
422 * an option was supplied, but the section wasn't found
423 */
424 if (!p || (!s && option))
425 UCI_THROW(ctx, UCI_ERR_NOTFOUND);
426
427 /* now add the missing entry */
428 if (!internal)
429 uci_add_history(ctx, p, UCI_CMD_ADD, section, option, value);
430 if (s)
431 uci_alloc_option(s, option, value);
432 else
433 uci_alloc_section(p, value, section);
434
435 return 0;
436 }
437
438 int uci_unload(struct uci_context *ctx, struct uci_package *p)
439 {
440 struct uci_element *e;
441
442 UCI_HANDLE_ERR(ctx);
443 UCI_ASSERT(ctx, p != NULL);
444
445 uci_free_package(p);
446 return 0;
447 }
448