2 * UCW Library -- Reading of configuration files
4 * (c) 2001--2006 Robert Spalek <robert@ucw.cz>
5 * (c) 2003--2006 Martin Mares <mj@ucw.cz>
7 * This software may be freely distributed and used according to the terms
8 * of the GNU Lesser General Public License.
12 #include "lib/conf2.h"
13 #include "lib/mempool.h"
14 #include "lib/clists.h"
15 #include "lib/fastbuf.h"
16 #include "lib/chartype.h"
18 #include "lib/stkstring.h"
19 #include "lib/binsearch.h"
28 #define TRY(f) do { byte *_msg = f; if (_msg) return _msg; } while (0)
30 /* Memory allocation */
32 struct mempool *cf_pool; // current pool for loading new configuration
33 static struct old_pools {
34 struct old_pools *prev;
36 } *pools; // link-list of older cf_pool's
41 return mp_alloc(cf_pool, size);
45 cf_malloc_zero(uns size)
47 return mp_alloc_zero(cf_pool, size);
53 return mp_strdup(cf_pool, s);
57 cf_printf(char *fmt, ...)
61 byte *res = mp_vprintf(cf_pool, fmt, args);
68 uns cf_need_journal = 1; // some programs do not need journal
69 static struct journal_item {
70 struct journal_item *prev;
77 cf_journal_block(void *ptr, uns len)
81 struct journal_item *ji = cf_malloc(sizeof(struct journal_item) + len);
85 memcpy(ji->copy, ptr, len);
91 // swaps the contents of the memory and the journal, and reverses the list
93 struct journal_item *curr, *prev, *next;
94 for (next=NULL, curr=journal; curr; next=curr, curr=prev)
98 for (uns i=0; i<curr->len; i++)
100 byte x = curr->copy[i];
101 curr->copy[i] = curr->ptr[i];
108 static struct journal_item *
109 journal_new_transaction(uns new_pool)
112 cf_pool = mp_new(1<<10);
113 struct journal_item *oldj = journal;
119 journal_commit_transaction(uns new_pool, struct journal_item *oldj)
123 struct old_pools *p = cf_malloc(sizeof(struct old_pools));
130 struct journal_item **j = &journal;
138 journal_rollback_transaction(uns new_pool, struct journal_item *oldj)
140 if (!cf_need_journal)
141 die("Cannot rollback the configuration, because the journal is disabled.");
147 cf_pool = pools ? pools->pool : NULL;
153 struct dirty_section {
154 struct cf_section *sec;
157 #define GBUF_TYPE struct dirty_section
158 #define GBUF_PREFIX(x) dirtsec_##x
159 #include "lib/gbuf.h"
160 static dirtsec_t dirty;
162 static uns everything_committed; // after the 1st load, this flag is set on
165 add_dirty(struct cf_section *sec, void *ptr)
167 dirtsec_grow(&dirty, dirties+1);
168 struct dirty_section *dest = dirty.ptr + dirties;
169 if (dirties && dest[-1].sec == sec && dest[-1].ptr == ptr)
176 #define ASORT_PREFIX(x) dirtsec_##x
177 #define ASORT_KEY_TYPE struct dirty_section
178 #define ASORT_ELT(i) dirty.ptr[i]
179 #define ASORT_LT(x,y) x.sec < y.sec || x.sec == y.sec && x.ptr < y.ptr
180 #include "lib/arraysort.h"
187 dirtsec_sort(dirties);
188 struct dirty_section *read = dirty.ptr + 1, *write = dirty.ptr + 1, *limit = dirty.ptr + dirties;
189 while (read < limit) {
190 if (read->sec != read[-1].sec || read->ptr != read[-1].ptr) {
197 dirties = write - dirty.ptr;
202 #define SEC_FLAG_DYNAMIC 0x80000000 // contains a dynamic attribute
203 #define SEC_FLAG_UNKNOWN 0x40000000 // ignore unknown entriies
204 #define SEC_FLAG_NUMBER 0x0fffffff // number of entries
206 static struct cf_section sections; // root section
208 static struct cf_item *
209 find_subitem(struct cf_section *sec, byte *name)
211 struct cf_item *ci = sec->cfg;
212 for (; ci->cls; ci++)
213 if (!strcasecmp(ci->name, name))
219 inspect_section(struct cf_section *sec)
223 for (ci=sec->cfg; ci->cls; ci++)
224 if (ci->cls == CC_SECTION) {
225 inspect_section(ci->u.sec);
226 sec->flags |= ci->u.sec->flags & SEC_FLAG_DYNAMIC;
227 } else if (ci->cls == CC_LIST) {
228 inspect_section(ci->u.sec);
229 sec->flags |= SEC_FLAG_DYNAMIC;
230 } else if (ci->cls == CC_DYNAMIC || ci->cls == CC_PARSER && ci->number < 0)
231 sec->flags |= SEC_FLAG_DYNAMIC;
232 sec->flags |= ci - sec->cfg; // record the number of entries
236 cf_declare_section(byte *name, struct cf_section *sec, uns allow_unknown)
241 sections.cfg = xmalloc_zero(sections.size * sizeof(struct cf_item));
243 struct cf_item *ci = find_subitem(§ions, name);
245 die("Cannot register section %s twice", name);
246 ci->cls = CC_SECTION;
251 inspect_section(sec);
253 sec->flags |= SEC_FLAG_UNKNOWN;
255 if (ci - sections.cfg >= (int) sections.size)
257 sections.cfg = xrealloc(sections.cfg, 2*sections.size * sizeof(struct cf_item));
258 bzero(sections.cfg + sections.size, sections.size * sizeof(struct cf_item));
264 cf_init_section(byte *name, struct cf_section *sec, void *ptr, uns do_bzero)
268 bzero(ptr, sec->size);
270 for (uns i=0; sec->cfg[i].cls; i++)
271 if (sec->cfg[i].cls == CC_SECTION)
272 cf_init_section(sec->cfg[i].name, sec->cfg[i].u.sec, ptr + (addr_int_t) sec->cfg[i].ptr, 0);
273 else if (sec->cfg[i].cls == CC_LIST)
274 clist_init(ptr + (addr_int_t) sec->cfg[i].ptr);
276 byte *msg = sec->init(ptr);
278 die("Cannot initialize section %s: %s", name, msg);
285 static uns initialized = 0;
288 sections.flags |= SEC_FLAG_UNKNOWN;
289 sections.size = 0; // size of allocated array used to be stored here
290 cf_init_section("top-level", §ions, NULL, 0);
294 commit_section(byte *name, struct cf_section *sec, void *ptr, uns commit_all)
297 for (ci=sec->cfg; ci->cls; ci++)
298 if (ci->cls == CC_SECTION) {
299 if (commit_section(ci->name, ci->u.sec, ptr + (addr_int_t) ci->ptr, commit_all)) {
300 log(L_ERROR, "It happened in section %s", ci->name);
303 } else if (ci->cls == CC_LIST) {
306 CLIST_WALK(n, * (clist*) (ptr + (addr_int_t) ci->ptr))
307 if (idx++, commit_section(ci->name, ci->u.sec, n, commit_all)) {
308 log(L_ERROR, "It happened in node #%d of list %s", idx, ci->name);
313 /* We have to process the whole tree of sections even if just a few changes
314 * have been made, because there are dependencies between commit-hooks and
315 * hence we need to call them in a fixed order. */
316 #define ARY_LT_X(ary,i,x) ary[i].sec < x.sec || ary[i].sec == x.sec && ary[i].ptr < x.ptr
317 struct dirty_section comp = { sec, ptr };
318 uns pos = BIN_SEARCH_FIRST_GE_CMP(dirty.ptr, dirties, comp, ARY_LT_X);
321 || (pos < dirties && dirty.ptr[pos].sec == sec && dirty.ptr[pos].ptr == ptr)) {
322 byte *msg = sec->commit(ptr);
324 log(L_ERROR, "Cannot commit section %s: %s", name, msg);
332 static struct cf_item *
333 find_item(struct cf_section *curr_sec, byte *name, byte **msg, void **ptr)
336 if (name[0] == '^') // absolute name instead of relative
337 name++, curr_sec = §ions, *ptr = NULL;
338 if (!curr_sec) // don't even search in an unknown section
342 if (curr_sec != §ions)
343 add_dirty(curr_sec, *ptr);
344 byte *c = strchr(name, '.');
347 struct cf_item *ci = find_subitem(curr_sec, name);
350 if (!(curr_sec->flags & SEC_FLAG_UNKNOWN)) // ignore silently unknown top-level sections and unknown attributes in flagged sections
351 *msg = cf_printf("Unknown item %s", name);
354 *ptr += (addr_int_t) ci->ptr;
357 if (ci->cls != CC_SECTION)
359 *msg = cf_printf("Item %s is not a section", name);
362 curr_sec = ci->u.sec;
368 cf_find_item(byte *name, struct cf_item *item)
372 struct cf_item *ci = find_item(§ions, name, &msg, &ptr);
380 /* Safe loading and reloading */
382 static int load_file(byte *file);
383 static int load_string(byte *string);
386 cf_reload(byte *file)
389 struct journal_item *oldj = journal_new_transaction(1);
390 uns ec = everything_committed;
391 everything_committed = 0;
392 int err = load_file(file);
395 for (struct old_pools *p=pools; p; p=pools)
400 journal_commit_transaction(1, NULL);
404 everything_committed = ec;
405 journal_rollback_transaction(1, oldj);
414 struct journal_item *oldj = journal_new_transaction(1);
415 int err = load_file(file);
417 journal_commit_transaction(1, oldj);
419 journal_rollback_transaction(1, oldj);
426 struct journal_item *oldj = journal_new_transaction(0);
427 int err = load_string(string);
429 journal_commit_transaction(0, oldj);
431 journal_rollback_transaction(0, oldj);
435 /* Parsers for standard types */
438 uns name; // one-letter name of the unit
439 uns num, den; // fraction
442 static const struct unit units[] = {
447 { 'g', 1000000000, 1 },
450 { 'G', 1073741824, 1 },
455 static const struct unit *
456 lookup_unit(byte *value, byte *end, byte **msg)
459 if (end == value || end[1] || *end >= '0' && *end <= '9')
460 *msg = "Invalid number";
462 for (const struct unit *u=units; u->name; u++)
465 *msg = "Invalid unit";
471 static char cf_rngerr[] = "Number out of range";
474 cf_parse_int(byte *str, int *ptr)
478 msg = "Missing number";
480 const struct unit *u;
483 uns x = strtoul(str, &end, 0);
486 else if (u = lookup_unit(str, end, &msg)) {
487 u64 y = (u64)x * u->num;
489 msg = "Number is not an integer";
503 cf_parse_u64(byte *str, u64 *ptr)
507 msg = "Missing number";
509 const struct unit *u;
512 u64 x = strtoull(str, &end, 0);
515 else if (u = lookup_unit(str, end, &msg)) {
516 if (x > ~(u64)0 / u->num)
517 msg = "Number out of range";
521 msg = "Number is not an integer";
532 cf_parse_double(byte *str, double *ptr)
536 msg = "Missing number";
538 const struct unit *u;
541 if (sscanf(str, "%lf%n", &x, &read_chars) != 1)
542 msg = "Invalid number";
543 else if (u = lookup_unit(str, str + read_chars, &msg))
544 *ptr = x * u->num / u->den;
552 cf_parse_ip(byte *p, u32 *varp)
555 return "Missing IP address";
558 if (*p == '0' && (p[1] | 32) == 'x' && Cxdigit(p[2])) {
560 x = strtoul(p, &p2, 16);
561 if (errno == ERANGE || x > 0xffffffff)
566 for (uns i = 0; i < 4; i++) {
574 uns y = strtoul(p, &p2, 10);
575 if (errno == ERANGE || p2 == (char*) p || y > 255)
581 return *p ? "Trailing characters" : NULL;
583 return "Invalid IP address";
587 cf_parse_string(byte *str, byte **ptr)
589 *ptr = cf_strdup(str);
594 cf_parse_lookup(byte *str, int *ptr, char **t)
598 while (*n && strcasecmp(*n, str)) {
599 total_len += strlen(*n) + 2;
606 byte *err = cf_malloc(total_len + strlen(str) + 60), *c = err;
607 c += sprintf(err, "Invalid value %s, possible values are: ", str);
609 c+= sprintf(c, "%s, ", *n);
614 /* Register size of and parser for each basic type */
616 typedef byte *cf_basic_parser(byte *str, void *ptr);
621 { sizeof(int), cf_parse_int },
622 { sizeof(u64), cf_parse_u64 },
623 { sizeof(double), cf_parse_double },
624 { sizeof(u32), cf_parse_ip },
625 { sizeof(byte*), cf_parse_string },
626 { sizeof(int), NULL }, // lookups are parsed extra
627 { 0, NULL }, // user-defined types are parsed extra
631 type_size(enum cf_type type, struct cf_user_type *utype)
634 return parsers[type].size;
640 cf_parse_ary(uns number, byte **pars, void *ptr, enum cf_type type, union cf_union *u)
642 for (uns i=0; i<number; i++)
645 uns size = type_size(type, u->utype);
646 if (type < CT_LOOKUP)
647 msg = ((cf_basic_parser*) parsers[type].parser) (pars[i], ptr + i * size);
648 else if (type == CT_LOOKUP)
649 msg = cf_parse_lookup(pars[i], ptr + i * size, u->lookup);
650 else if (type == CT_USER)
651 msg = u->utype->parser(pars[i], ptr + i * size);
655 return cf_printf("Cannot parse item %d: %s", i+1, msg);
663 static byte *op_names[] = { CF_OPERATIONS };
666 #define OP_MASK 0xff // only get the operation
667 #define OP_OPEN 0x100 // here we only get an opening brace instead of parameters
668 #define OP_1ST 0x200 // in the 1st phase selectors are recorded into the mask
669 #define OP_2ND 0x400 // in the 2nd phase real data are entered
672 interpret_set_dynamic(struct cf_item *item, int number, byte **pars, void **ptr)
674 enum cf_type type = item->type;
675 cf_journal_block(ptr, sizeof(void*));
676 // boundary checks done by the caller
677 uns size = type_size(item->type, item->u.utype);
678 ASSERT(size >= sizeof(uns));
679 *ptr = cf_malloc((number+1) * size) + size;
680 * (uns*) (*ptr - size) = number;
681 return cf_parse_ary(number, pars, *ptr, type, &item->u);
685 interpret_add_dynamic(struct cf_item *item, int number, byte **pars, int *processed, void **ptr, enum cf_operation op)
687 enum cf_type type = item->type;
689 uns size = type_size(item->type, item->u.utype);
690 ASSERT(size >= sizeof(uns));
691 int old_nr = * (int*) (old_p - size);
692 int taken = MIN(number, item->number-old_nr);
694 // stretch the dynamic array
695 void *new_p = cf_malloc((old_nr + taken + 1) * size) + size;
696 * (uns*) (new_p - size) = old_nr + taken;
697 cf_journal_block(ptr, sizeof(void*));
699 if (op == OP_APPEND) {
700 memcpy(new_p, old_p, old_nr * size);
701 return cf_parse_ary(taken, pars, new_p + old_nr * size, type, &item->u);
702 } else if (op == OP_PREPEND) {
703 memcpy(new_p + taken * size, old_p, old_nr * size);
704 return cf_parse_ary(taken, pars, new_p, type, &item->u);
706 return cf_printf("Dynamic arrays do not support operation %s", op_names[op]);
709 static byte *interpret_set_item(struct cf_item *item, int number, byte **pars, int *processed, void *ptr, uns allow_dynamic);
712 interpret_section(struct cf_section *sec, int number, byte **pars, int *processed, void *ptr, uns allow_dynamic)
716 for (struct cf_item *ci=sec->cfg; ci->cls; ci++)
719 byte *msg = interpret_set_item(ci, number, pars, &taken, ptr + (addr_int_t) ci->ptr, allow_dynamic && !ci[1].cls);
721 return cf_printf("Item %s: %s", ci->name, msg);
725 if (!number) // stop parsing, because many parsers would otherwise complain that number==0
732 add_to_list(struct cnode *where, struct cnode *new_node, enum cf_operation op)
736 case OP_EDIT: // edition has been done in-place
739 cf_journal_block(&where->prev->next, sizeof(void*));
740 cf_journal_block(&where->next->prev, sizeof(void*));
743 case OP_AFTER: // implementation dependend (prepend_head = after(list)), and where==list, see clists.h:74
745 cf_journal_block(&where->next->prev, sizeof(void*));
746 cf_journal_block(&where->next, sizeof(void*));
747 clist_insert_after(new_node, where);
749 case OP_BEFORE: // implementation dependend (append_tail = before(list))
752 cf_journal_block(&where->prev->next, sizeof(void*));
753 cf_journal_block(&where->prev, sizeof(void*));
754 clist_insert_before(new_node, where);
762 interpret_add_list(struct cf_item *item, int number, byte **pars, int *processed, void *ptr, enum cf_operation op)
765 return cf_printf("You have to open a block for operation %s", op_names[op]);
767 return "Nothing to add to the list";
768 struct cf_section *sec = item->u.sec;
772 void *node = cf_malloc(sec->size);
773 cf_init_section(item->name, sec, node, 1);
774 add_to_list(ptr, node, op);
776 /* If the node contains any dynamic attribute at the end, we suppress
777 * auto-repetition here and pass the flag inside instead. */
778 TRY( interpret_section(sec, number, pars, &taken, node, sec->flags & SEC_FLAG_DYNAMIC) );
782 if (sec->flags & SEC_FLAG_DYNAMIC)
789 interpret_set_item(struct cf_item *item, int number, byte **pars, int *processed, void *ptr, uns allow_dynamic)
796 return "Missing value";
797 taken = MIN(number, item->number);
799 uns size = type_size(item->type, item->u.utype);
800 cf_journal_block(ptr, taken * size);
801 return cf_parse_ary(taken, pars, ptr, item->type, &item->u);
804 return "Dynamic array cannot be used here";
805 taken = MIN(number, item->number);
807 return interpret_set_dynamic(item, taken, pars, ptr);
809 if (item->number < 0 && !allow_dynamic)
810 return "Parsers with variable number of parameters cannot be used here";
811 if (item->number > 0 && number < item->number)
812 return "Not enough parameters available for the parser";
813 taken = MIN(number, ABS(item->number));
815 for (int i=0; i<taken; i++)
816 pars[i] = cf_strdup(pars[i]);
817 return item->u.par(taken, pars, ptr);
819 return interpret_section(item->u.sec, number, pars, processed, ptr, allow_dynamic);
822 return "Lists cannot be used here";
823 return interpret_add_list(item, number, pars, processed, ptr, OP_SET);
830 interpret_clear(struct cf_item *item, void *ptr)
832 if (item->cls == CC_LIST) {
833 cf_journal_block(ptr, sizeof(struct clist));
835 } else if (item->cls == CC_DYNAMIC) {
836 cf_journal_block(ptr, sizeof(void *));
837 * (void**) ptr = NULL;
839 return "The item is not a list or a dynamic array";
844 cmp_items(void *i1, void *i2, struct cf_item *item)
846 ASSERT(item->cls == CC_STATIC);
847 i1 += (addr_int_t) item->ptr;
848 i2 += (addr_int_t) item->ptr;
849 if (item->type == CT_STRING)
850 return strcmp(* (byte**) i1, * (byte**) i2);
851 else // all numeric types
852 return memcmp(i1, i2, type_size(item->type, item->u.utype));
856 find_list_node(struct clist *list, void *query, struct cf_section *sec, u32 mask)
862 for (uns i=0; i<32; i++)
864 if (cmp_items(n, query, sec->cfg+i))
876 record_selector(struct cf_item *item, struct cf_section *sec, u32 *mask)
878 uns nr = sec->flags & SEC_FLAG_NUMBER;
879 if (item >= sec->cfg && item < sec->cfg + nr) // setting an attribute relative to this section
881 uns i = item - sec->cfg;
883 return "Cannot select list nodes by this attribute";
884 if (sec->cfg[i].cls != CC_STATIC)
885 return "Selection can only be done based on basic attributes";
891 #define MAX_STACK_SIZE 100
892 static struct item_stack {
893 struct cf_section *sec; // nested section
894 void *base_ptr; // because original pointers are often relative
895 enum cf_operation op; // it is performed when a closing brace is encountered
896 void *list; // list the operations should be done on
897 u32 mask; // bit array of selectors searching in a list
898 struct cf_item *item; // cf_item of the list
899 } stack[MAX_STACK_SIZE];
903 opening_brace(struct cf_item *item, void *ptr, enum cf_operation op)
905 if (level >= MAX_STACK_SIZE-1)
906 return "Too many nested sections";
907 stack[++level] = (struct item_stack) {
915 if (!item) // unknown is ignored; we just need to trace recursion
917 stack[level].sec = item->u.sec;
918 if (item->cls == CC_SECTION)
920 stack[level].base_ptr = ptr;
921 stack[level].op = OP_EDIT | OP_2ND; // this list operation does nothing
923 else if (item->cls == CC_LIST)
925 stack[level].base_ptr = cf_malloc(item->u.sec->size);
926 cf_init_section(item->name, item->u.sec, stack[level].base_ptr, 1);
927 stack[level].list = ptr;
928 stack[level].item = item;
929 if ((op & OP_MASK) < OP_REMOVE) {
930 add_to_list(ptr, stack[level].base_ptr, op & OP_MASK);
931 stack[level].op |= OP_2ND;
933 stack[level].op |= OP_1ST;
936 return "Opening brace can only be used on sections and lists";
941 closing_brace(struct item_stack *st, enum cf_operation op, int number, byte **pars)
943 if (st->op == OP_CLOSE) // top-level
944 return "Unmatched } parenthesis";
945 if (!st->sec) { // dummy run on unknown section
950 enum cf_operation pure_op = st->op & OP_MASK;
953 st->list = find_list_node(st->list, st->base_ptr, st->sec, st->mask);
955 return "Cannot find a node matching the query";
956 if (pure_op != OP_REMOVE)
958 if (pure_op == OP_EDIT)
959 st->base_ptr = st->list;
960 else if (pure_op == OP_AFTER || pure_op == OP_BEFORE)
961 cf_init_section(st->item->name, st->sec, st->base_ptr, 1);
964 if (op & OP_OPEN) { // stay at the same recursion level
965 st->op = (st->op | OP_2ND) & ~OP_1ST;
966 add_to_list(st->list, st->base_ptr, pure_op);
969 int taken; // parse parameters on 1 line immediately
970 TRY( interpret_section(st->sec, number, pars, &taken, st->base_ptr, 1) );
973 // and fall-thru to the 2nd phase
975 add_to_list(st->list, st->base_ptr, pure_op);
979 return "No parameters expected after the }";
980 else if (op & OP_OPEN)
981 return "No { is expected";
987 interpret_line(byte *name, enum cf_operation op, int number, byte **pars)
990 if ((op & OP_MASK) == OP_CLOSE)
991 return closing_brace(stack+level, op, number, pars);
992 void *ptr = stack[level].base_ptr;
993 struct cf_item *item = find_item(stack[level].sec, name, &msg, &ptr);
996 if (stack[level].op & OP_1ST)
997 TRY( record_selector(item, stack[level].sec, &stack[level].mask) );
998 if (op & OP_OPEN) { // the operation will be performed after the closing brace
1000 return "Cannot open a block after a parameter has been passed on a line";
1001 return opening_brace(item, ptr, op);
1003 if (!item) // ignored item in an unknown section
1007 int taken; // process as many parameters as possible
1009 taken = 0, msg = interpret_clear(item, ptr);
1010 else if (op == OP_SET)
1011 msg = interpret_set_item(item, number, pars, &taken, ptr, 1);
1012 else if (item->cls == CC_DYNAMIC)
1013 msg = interpret_add_dynamic(item, number, pars, &taken, ptr, op);
1014 else if (item->cls == CC_LIST)
1015 msg = interpret_add_list(item, number, pars, &taken, ptr, op);
1017 return cf_printf("Operation %s not supported on attribute %s", op_names[op], name);
1021 return cf_printf("Too many parameters: %d>%d", number, taken);
1027 cf_write_item(struct cf_item *item, enum cf_operation op, int number, byte **pars)
1033 msg = interpret_set_item(item, number, pars, &taken, item->ptr, 1);
1037 msg = interpret_clear(item, item->ptr);
1041 if (item->cls == CC_DYNAMIC)
1042 msg = interpret_add_dynamic(item, number, pars, &taken, item->ptr, op);
1043 else if (item->cls == CC_LIST)
1044 msg = interpret_add_list(item, number, pars, &taken, item->ptr, op);
1046 return "The attribute class does not support append/prepend";
1049 return "Unsupported operation";
1054 return "Too many parameters";
1063 stack[0] = (struct item_stack) {
1077 log(L_ERROR, "Unterminated block");
1081 if (commit_section("top-level", §ions, NULL, !everything_committed))
1083 everything_committed = 1;
1088 /* Text file parser */
1090 static byte *name_parse_fb;
1091 static struct fastbuf *parse_fb;
1092 static uns line_num;
1094 #define MAX_LINE 4096
1095 static byte line_buf[MAX_LINE];
1096 static byte *line = line_buf;
1098 #include "lib/bbuf.h"
1099 static bb_t copy_buf;
1102 #define GBUF_TYPE uns
1103 #define GBUF_PREFIX(x) split_##x
1104 #include "lib/gbuf.h"
1105 static split_t word_buf;
1107 static uns ends_by_brace; // the line is ended by "{"
1112 if (!bgets(parse_fb, line_buf, MAX_LINE))
1116 while (Cblank(*line))
1122 append(byte *start, byte *end)
1124 uns len = end - start;
1125 bb_grow(©_buf, copied + len + 1);
1126 memcpy(copy_buf.ptr + copied, start, len);
1128 copy_buf.ptr[copied-1] = 0;
1131 #define CONTROL_CHAR(x) (x == '{' || x == '}' || x == ';')
1132 // these characters separate words like blanks
1135 get_word(uns is_command_name)
1137 if (*line == '\'') {
1141 while (*line && *line != '\'')
1143 append(start, line);
1146 copy_buf.ptr[copied-1] = '\n';
1148 return "Unterminated apostrophe word at the end";
1152 } else if (*line == '"') {
1154 uns start_copy = copied;
1159 if (*line == '"' && !escape)
1161 else if (*line == '\\')
1167 append(start, line);
1171 copy_buf.ptr[copied-1] = '\n';
1172 else // merge two lines
1175 return "Unterminated quoted word at the end";
1179 byte *tmp = stk_str_unesc(copy_buf.ptr + start_copy);
1180 uns l = strlen(tmp);
1181 bb_grow(©_buf, start_copy + l + 1);
1182 strcpy(copy_buf.ptr + start_copy, tmp);
1183 copied = start_copy + l + 1;
1186 // promised that *line is non-null and non-blank
1188 while (*line && !Cblank(*line) && !CONTROL_CHAR(*line)
1189 && (*line != '=' || !is_command_name))
1191 if (*line == '=') { // nice for setting from a command-line
1193 return "Assignment without a variable";
1196 if (line == start) // already the first char is control
1198 append(start, line);
1200 while (Cblank(*line))
1206 get_token(uns is_command_name, byte **msg)
1210 if (!*line || *line == '#') {
1211 if (!is_command_name || !get_line())
1213 } else if (*line == ';') {
1215 if (!is_command_name || *msg)
1217 } else if (*line == '\\' && !line[1]) {
1219 *msg = "Last line ends by a backslash";
1222 if (!*line || *line == '#')
1223 log(L_WARN, "The line %s:%d following a backslash is empty", name_parse_fb, line_num);
1225 split_grow(&word_buf, words+1);
1227 word_buf.ptr[words++] = copied;
1228 *msg = get_word(is_command_name);
1229 return *msg ? NULL : copy_buf.ptr + start;
1237 words = copied = ends_by_brace = 0;
1238 byte *msg, *start_word;
1239 if (!(start_word = get_token(1, &msg)))
1241 if (*start_word == '{') // only one opening brace
1242 return "Unexpected opening brace";
1243 while (*line != '}') // stays for the next time
1245 if (!(start_word = get_token(0, &msg)))
1247 if (*start_word == '{') {
1248 words--; // discard the brace
1256 /* Parsing multiple files */
1259 parse_fastbuf(byte *name_fb, struct fastbuf *fb, uns depth)
1262 name_parse_fb = name_fb;
1269 msg = split_command();
1274 byte *name = copy_buf.ptr + word_buf.ptr[0];
1275 byte *pars[words-1];
1276 for (uns i=1; i<words; i++)
1277 pars[i-1] = copy_buf.ptr + word_buf.ptr[i];
1278 if (!strcasecmp(name, "include"))
1281 msg = "Expecting one filename";
1283 msg = "Too many nested files";
1284 else if (*line && *line != '#') // because the contents of line_buf is not re-entrant and will be cleared
1285 msg = "The input command must be the last one on a line";
1288 struct fastbuf *new_fb = bopen_try(pars[0], O_RDONLY, 1<<14);
1290 msg = cf_printf("Cannot open file %s: %m", pars[0]);
1294 msg = parse_fastbuf(pars[0], new_fb, depth+1);
1301 enum cf_operation op;
1302 byte *c = strchr(name, ':');
1304 op = strcmp(name, "}") ? OP_SET : OP_CLOSE;
1307 switch (Clocase(*c)) {
1308 case 's': op = OP_SET; break;
1309 case 'c': op = OP_CLEAR; break;
1310 case 'a': op = Clocase(c[1]) == 'p' ? OP_APPEND : OP_AFTER; break;
1311 case 'p': op = OP_PREPEND; break;
1312 case 'r': op = OP_REMOVE; break;
1313 case 'e': op = OP_EDIT; break;
1314 case 'b': op = OP_BEFORE; break;
1315 default: op = OP_SET; break;
1317 if (strcasecmp(c, op_names[op])) {
1318 msg = cf_printf("Unknown operation %s", c);
1324 msg = interpret_line(name, op, words-1, pars);
1329 log(L_ERROR, "File %s, line %d: %s", name_fb, line_num, msg);
1330 return "included from here";
1333 #undef DEFAULT_CONFIG /* FIXME */
1334 #define DEFAULT_CONFIG "cf/sherlock2"
1336 #ifndef DEFAULT_CONFIG
1337 #define DEFAULT_CONFIG NULL
1339 byte *cf_def_file = DEFAULT_CONFIG;
1342 load_file(byte *file)
1345 struct fastbuf *fb = bopen_try(file, O_RDONLY, 1<<14);
1347 log(L_ERROR, "Cannot open %s: %m", file);
1350 byte *msg = parse_fastbuf(file, fb, 0);
1352 int err = !!msg || done_stack();
1359 load_string(byte *string)
1363 fbbuf_init_read(&fb, string, strlen(string), 0);
1364 byte *msg = parse_fastbuf("memory string", &fb, 0);
1365 return !!msg || done_stack();
1368 /* Command-line parser */
1374 if (cf_load(cf_def_file))
1375 die("Cannot load default config %s", cf_def_file);
1379 cf_get_opt(int argc, char * const argv[], const char *short_opts, const struct option *long_opts, int *long_index)
1381 static int other_options = 0;
1383 int res = getopt_long (argc, argv, short_opts, long_opts, long_index);
1384 if (res == 'S' || res == 'C')
1387 die("The -S and -C options must precede all other arguments");
1391 die("Cannot set %s", optarg);
1393 if (cf_load(optarg))
1394 die("Cannot load config file %s", optarg);
1397 /* unhandled option or end of options */
1398 if (res != ':' && res != '?')
1409 spaces(struct fastbuf *fb, uns nr)
1411 for (uns i=0; i<nr; i++)
1416 dump_basic(struct fastbuf *fb, void *ptr, enum cf_type type, union cf_union *u)
1419 case CT_INT: bprintf(fb, "%d ", *(uns*)ptr); break;
1420 case CT_U64: bprintf(fb, "%llu ", *(u64*)ptr); break;
1421 case CT_DOUBLE: bprintf(fb, "%lg ", *(double*)ptr); break;
1422 case CT_IP: bprintf(fb, "%08x ", *(uns*)ptr); break;
1423 case CT_STRING: bprintf(fb, "'%s' ", *(byte**)ptr); break;
1424 case CT_LOOKUP: bprintf(fb, "%s ", *(int*)ptr >= 0 ? u->lookup[ *(int*)ptr ] : "???"); break;
1426 if (u->utype->dumper)
1427 u->utype->dumper(fb, ptr);
1429 bprintf(fb, "??? ");
1434 static void dump_section(struct fastbuf *fb, struct cf_section *sec, int level, void *ptr);
1437 dump_item(struct fastbuf *fb, struct cf_item *item, int level, void *ptr)
1439 ptr += (addr_int_t) item->ptr;
1440 enum cf_type type = item->type;
1441 uns size = type_size(item->type, item->u.utype);
1444 bprintf(fb, "%s: c%d #%d ", item->name, item->cls, item->number);
1445 if (item->cls == CC_STATIC || item->cls == CC_DYNAMIC)
1446 bprintf(fb, "t%d ", type);
1447 if (item->cls == CC_STATIC) {
1448 if (item->type == CT_USER)
1449 bprintf(fb, "S%d ", size);
1450 for (i=0; i<item->number; i++)
1451 dump_basic(fb, ptr + i * size, type, &item->u);
1452 } else if (item->cls == CC_DYNAMIC) {
1453 if (item->type == CT_USER)
1454 bprintf(fb, "S%d ", size);
1455 ptr = * (void**) ptr;
1457 int real_nr = * (int*) (ptr - size);
1458 bprintf(fb, "##%d ", real_nr);
1459 for (i=0; i<real_nr; i++)
1460 dump_basic(fb, ptr + i * size, type, &item->u);
1462 bprintf(fb, "NULL ");
1465 if (item->cls == CC_SECTION)
1466 dump_section(fb, item->u.sec, level+1, ptr);
1467 else if (item->cls == CC_LIST) {
1470 CLIST_WALK(n, * (clist*) ptr) {
1471 spaces(fb, level+1);
1472 bprintf(fb, "item %d\n", ++idx);
1473 dump_section(fb, item->u.sec, level+2, n);
1479 dump_section(struct fastbuf *fb, struct cf_section *sec, int level, void *ptr)
1482 bprintf(fb, "S%d F%x:\n", sec->size, sec->flags);
1483 for (struct cf_item *item=sec->cfg; item->cls; item++)
1484 dump_item(fb, item, level, ptr);
1488 cf_dump_sections(struct fastbuf *fb)
1490 dump_section(fb, §ions, 0, NULL);
1494 * - more space efficient journal