yann@1: /* yann@1: * Copyright (C) 2002 Roman Zippel yann@1: * Released under the terms of the GNU GPL v2.0. yann@1: */ yann@1: yann@1: #include yann@1: #include yann@1: #include yann@1: #include yann@1: #include yann@1: yann@1: #define LKC_DIRECT_LINK yann@1: #include "lkc.h" yann@1: yann@1: struct symbol symbol_yes = { yann@1: .name = "y", yann@1: .curr = { "y", yes }, yann@1: .flags = SYMBOL_CONST|SYMBOL_VALID, yann@1: }, symbol_mod = { yann@1: .name = "m", yann@1: .curr = { "m", mod }, yann@1: .flags = SYMBOL_CONST|SYMBOL_VALID, yann@1: }, symbol_no = { yann@1: .name = "n", yann@1: .curr = { "n", no }, yann@1: .flags = SYMBOL_CONST|SYMBOL_VALID, yann@1: }, symbol_empty = { yann@1: .name = "", yann@1: .curr = { "", no }, yann@1: .flags = SYMBOL_VALID, yann@1: }; yann@1: yann@1: struct symbol *sym_defconfig_list; yann@1: struct symbol *modules_sym; yann@1: tristate modules_val; yann@1: yann@943: struct expr *sym_env_list; yann@943: yann@2448: static void sym_add_default(struct symbol *sym, const char *def) yann@1: { yann@1: struct property *prop = prop_alloc(P_DEFAULT, sym); yann@1: yann@943: prop->expr = expr_alloc_symbol(sym_lookup(def, SYMBOL_CONST)); yann@1: } yann@1: yann@1: void sym_init(void) yann@1: { yann@1: struct symbol *sym; yann@1: struct utsname uts; yann@1: static bool inited = false; yann@1: yann@1: if (inited) yann@1: return; yann@1: inited = true; yann@1: yann@1: uname(&uts); yann@1: yann@943: sym = sym_lookup("UNAME_RELEASE", 0); yann@1: sym->type = S_STRING; yann@1: sym->flags |= SYMBOL_AUTO; yann@943: sym_add_default(sym, uts.release); yann@1: } yann@1: yann@1: enum symbol_type sym_get_type(struct symbol *sym) yann@1: { yann@1: enum symbol_type type = sym->type; yann@1: yann@1: if (type == S_TRISTATE) { yann@1: if (sym_is_choice_value(sym) && sym->visible == yes) yann@1: type = S_BOOLEAN; yann@1: else if (modules_val == no) yann@1: type = S_BOOLEAN; yann@1: } yann@1: return type; yann@1: } yann@1: yann@1: const char *sym_type_name(enum symbol_type type) yann@1: { yann@1: switch (type) { yann@1: case S_BOOLEAN: yann@1: return "boolean"; yann@1: case S_TRISTATE: yann@1: return "tristate"; yann@1: case S_INT: yann@1: return "integer"; yann@1: case S_HEX: yann@1: return "hex"; yann@1: case S_STRING: yann@1: return "string"; yann@1: case S_UNKNOWN: yann@1: return "unknown"; yann@1: case S_OTHER: yann@1: break; yann@1: } yann@1: return "???"; yann@1: } yann@1: yann@1: struct property *sym_get_choice_prop(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: yann@1: for_all_choices(sym, prop) yann@1: return prop; yann@1: return NULL; yann@1: } yann@1: yann@943: struct property *sym_get_env_prop(struct symbol *sym) yann@943: { yann@943: struct property *prop; yann@943: yann@943: for_all_properties(sym, prop, P_ENV) yann@943: return prop; yann@943: return NULL; yann@943: } yann@943: yann@1: struct property *sym_get_default_prop(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: yann@1: for_all_defaults(sym, prop) { yann@1: prop->visible.tri = expr_calc_value(prop->visible.expr); yann@1: if (prop->visible.tri != no) yann@1: return prop; yann@1: } yann@1: return NULL; yann@1: } yann@1: yann@2448: static struct property *sym_get_range_prop(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: yann@1: for_all_properties(sym, prop, P_RANGE) { yann@1: prop->visible.tri = expr_calc_value(prop->visible.expr); yann@1: if (prop->visible.tri != no) yann@1: return prop; yann@1: } yann@1: return NULL; yann@1: } yann@1: yann@1: static int sym_get_range_val(struct symbol *sym, int base) yann@1: { yann@1: sym_calc_value(sym); yann@1: switch (sym->type) { yann@1: case S_INT: yann@1: base = 10; yann@1: break; yann@1: case S_HEX: yann@1: base = 16; yann@1: break; yann@1: default: yann@1: break; yann@1: } yann@1: return strtol(sym->curr.val, NULL, base); yann@1: } yann@1: yann@1: static void sym_validate_range(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: int base, val, val2; yann@1: char str[64]; yann@1: yann@1: switch (sym->type) { yann@1: case S_INT: yann@1: base = 10; yann@1: break; yann@1: case S_HEX: yann@1: base = 16; yann@1: break; yann@1: default: yann@1: return; yann@1: } yann@1: prop = sym_get_range_prop(sym); yann@1: if (!prop) yann@1: return; yann@1: val = strtol(sym->curr.val, NULL, base); yann@1: val2 = sym_get_range_val(prop->expr->left.sym, base); yann@1: if (val >= val2) { yann@1: val2 = sym_get_range_val(prop->expr->right.sym, base); yann@1: if (val <= val2) yann@1: return; yann@1: } yann@1: if (sym->type == S_INT) yann@1: sprintf(str, "%d", val2); yann@1: else yann@1: sprintf(str, "0x%x", val2); yann@1: sym->curr.val = strdup(str); yann@1: } yann@1: yann@1: static void sym_calc_visibility(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: tristate tri; yann@1: yann@1: /* any prompt visible? */ yann@1: tri = no; yann@1: for_all_prompts(sym, prop) { yann@1: prop->visible.tri = expr_calc_value(prop->visible.expr); yann@943: tri = EXPR_OR(tri, prop->visible.tri); yann@1: } yann@1: if (tri == mod && (sym->type != S_TRISTATE || modules_val == no)) yann@1: tri = yes; yann@1: if (sym->visible != tri) { yann@1: sym->visible = tri; yann@1: sym_set_changed(sym); yann@1: } yann@1: if (sym_is_choice_value(sym)) yann@1: return; yann@2448: /* defaulting to "yes" if no explicit "depends on" are given */ yann@2448: tri = yes; yann@2448: if (sym->dir_dep.expr) yann@2448: tri = expr_calc_value(sym->dir_dep.expr); yann@2448: if (tri == mod) yann@2448: tri = yes; yann@2448: if (sym->dir_dep.tri != tri) { yann@2448: sym->dir_dep.tri = tri; yann@2448: sym_set_changed(sym); yann@2448: } yann@1: tri = no; yann@1: if (sym->rev_dep.expr) yann@1: tri = expr_calc_value(sym->rev_dep.expr); yann@1: if (tri == mod && sym_get_type(sym) == S_BOOLEAN) yann@1: tri = yes; yann@1: if (sym->rev_dep.tri != tri) { yann@1: sym->rev_dep.tri = tri; yann@1: sym_set_changed(sym); yann@1: } yann@1: } yann@1: yann@2448: /* yann@2448: * Find the default symbol for a choice. yann@2448: * First try the default values for the choice symbol yann@2448: * Next locate the first visible choice value yann@2448: * Return NULL if none was found yann@2448: */ yann@2448: struct symbol *sym_choice_default(struct symbol *sym) yann@1: { yann@1: struct symbol *def_sym; yann@1: struct property *prop; yann@1: struct expr *e; yann@1: yann@1: /* any of the defaults visible? */ yann@1: for_all_defaults(sym, prop) { yann@1: prop->visible.tri = expr_calc_value(prop->visible.expr); yann@1: if (prop->visible.tri == no) yann@1: continue; yann@1: def_sym = prop_get_symbol(prop); yann@1: if (def_sym->visible != no) yann@1: return def_sym; yann@1: } yann@1: yann@1: /* just get the first visible value */ yann@1: prop = sym_get_choice_prop(sym); yann@2448: expr_list_for_each_sym(prop->expr, e, def_sym) yann@1: if (def_sym->visible != no) yann@1: return def_sym; yann@1: yann@2448: /* failed to locate any defaults */ yann@1: return NULL; yann@1: } yann@1: yann@2448: static struct symbol *sym_calc_choice(struct symbol *sym) yann@2448: { yann@2448: struct symbol *def_sym; yann@2448: struct property *prop; yann@2448: struct expr *e; yann@2448: yann@2448: /* first calculate all choice values' visibilities */ yann@2448: prop = sym_get_choice_prop(sym); yann@2448: expr_list_for_each_sym(prop->expr, e, def_sym) yann@2448: sym_calc_visibility(def_sym); yann@2448: yann@2448: /* is the user choice visible? */ yann@2448: def_sym = sym->def[S_DEF_USER].val; yann@2448: if (def_sym && def_sym->visible != no) yann@2448: return def_sym; yann@2448: yann@2448: def_sym = sym_choice_default(sym); yann@2448: yann@2448: if (def_sym == NULL) yann@2448: /* no choice? reset tristate value */ yann@2448: sym->curr.tri = no; yann@2448: yann@2448: return def_sym; yann@2448: } yann@2448: yann@1: void sym_calc_value(struct symbol *sym) yann@1: { yann@1: struct symbol_value newval, oldval; yann@1: struct property *prop; yann@1: struct expr *e; yann@1: yann@1: if (!sym) yann@1: return; yann@1: yann@1: if (sym->flags & SYMBOL_VALID) yann@1: return; yann@1: sym->flags |= SYMBOL_VALID; yann@1: yann@1: oldval = sym->curr; yann@1: yann@1: switch (sym->type) { yann@1: case S_INT: yann@1: case S_HEX: yann@1: case S_STRING: yann@1: newval = symbol_empty.curr; yann@1: break; yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: newval = symbol_no.curr; yann@1: break; yann@1: default: yann@1: sym->curr.val = sym->name; yann@1: sym->curr.tri = no; yann@1: return; yann@1: } yann@1: if (!sym_is_choice_value(sym)) yann@1: sym->flags &= ~SYMBOL_WRITE; yann@1: yann@1: sym_calc_visibility(sym); yann@1: yann@1: /* set default if recursively called */ yann@1: sym->curr = newval; yann@1: yann@1: switch (sym_get_type(sym)) { yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: if (sym_is_choice_value(sym) && sym->visible == yes) { yann@1: prop = sym_get_choice_prop(sym); yann@1: newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no; yann@943: } else { yann@943: if (sym->visible != no) { yann@943: /* if the symbol is visible use the user value yann@943: * if available, otherwise try the default value yann@943: */ yann@943: sym->flags |= SYMBOL_WRITE; yann@943: if (sym_has_value(sym)) { yann@943: newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri, yann@943: sym->visible); yann@943: goto calc_newval; yann@943: } yann@943: } yann@943: if (sym->rev_dep.tri != no) yann@943: sym->flags |= SYMBOL_WRITE; yann@943: if (!sym_is_choice(sym)) { yann@1: prop = sym_get_default_prop(sym); yann@943: if (prop) { yann@943: sym->flags |= SYMBOL_WRITE; yann@943: newval.tri = EXPR_AND(expr_calc_value(prop->expr), yann@943: prop->visible.tri); yann@943: } yann@1: } yann@943: calc_newval: yann@2448: if (sym->dir_dep.tri == no && sym->rev_dep.tri != no) { yann@2448: struct expr *e; yann@2448: e = expr_simplify_unmet_dep(sym->rev_dep.expr, yann@2448: sym->dir_dep.expr); yann@2448: fprintf(stderr, "warning: ("); yann@2448: expr_fprint(e, stderr); yann@2448: fprintf(stderr, ") selects %s which has unmet direct dependencies (", yann@2448: sym->name); yann@2448: expr_fprint(sym->dir_dep.expr, stderr); yann@2448: fprintf(stderr, ")\n"); yann@2448: expr_free(e); yann@2448: } yann@943: newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri); yann@1: } yann@1: if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN) yann@1: newval.tri = yes; yann@1: break; yann@1: case S_STRING: yann@1: case S_HEX: yann@1: case S_INT: yann@1: if (sym->visible != no) { yann@1: sym->flags |= SYMBOL_WRITE; yann@1: if (sym_has_value(sym)) { yann@1: newval.val = sym->def[S_DEF_USER].val; yann@1: break; yann@1: } yann@1: } yann@1: prop = sym_get_default_prop(sym); yann@1: if (prop) { yann@1: struct symbol *ds = prop_get_symbol(prop); yann@1: if (ds) { yann@1: sym->flags |= SYMBOL_WRITE; yann@1: sym_calc_value(ds); yann@1: newval.val = ds->curr.val; yann@1: } yann@1: } yann@1: break; yann@1: default: yann@1: ; yann@1: } yann@1: yann@1: sym->curr = newval; yann@1: if (sym_is_choice(sym) && newval.tri == yes) yann@1: sym->curr.val = sym_calc_choice(sym); yann@1: sym_validate_range(sym); yann@1: yann@1: if (memcmp(&oldval, &sym->curr, sizeof(oldval))) { yann@1: sym_set_changed(sym); yann@1: if (modules_sym == sym) { yann@1: sym_set_all_changed(); yann@1: modules_val = modules_sym->curr.tri; yann@1: } yann@1: } yann@1: yann@1: if (sym_is_choice(sym)) { yann@943: struct symbol *choice_sym; yann@943: yann@1: prop = sym_get_choice_prop(sym); yann@943: expr_list_for_each_sym(prop->expr, e, choice_sym) { yann@2448: if ((sym->flags & SYMBOL_WRITE) && yann@2448: choice_sym->visible != no) yann@2448: choice_sym->flags |= SYMBOL_WRITE; yann@2448: if (sym->flags & SYMBOL_CHANGED) yann@943: sym_set_changed(choice_sym); yann@1: } yann@1: } yann@943: yann@943: if (sym->flags & SYMBOL_AUTO) yann@943: sym->flags &= ~SYMBOL_WRITE; yann@1: } yann@1: yann@1: void sym_clear_all_valid(void) yann@1: { yann@1: struct symbol *sym; yann@1: int i; yann@1: yann@1: for_all_symbols(i, sym) yann@1: sym->flags &= ~SYMBOL_VALID; yann@39: sym_add_change_count(1); yann@1: if (modules_sym) yann@1: sym_calc_value(modules_sym); yann@1: } yann@1: yann@1: void sym_set_changed(struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: yann@1: sym->flags |= SYMBOL_CHANGED; yann@1: for (prop = sym->prop; prop; prop = prop->next) { yann@1: if (prop->menu) yann@1: prop->menu->flags |= MENU_CHANGED; yann@1: } yann@1: } yann@1: yann@1: void sym_set_all_changed(void) yann@1: { yann@1: struct symbol *sym; yann@1: int i; yann@1: yann@1: for_all_symbols(i, sym) yann@1: sym_set_changed(sym); yann@1: } yann@1: yann@1: bool sym_tristate_within_range(struct symbol *sym, tristate val) yann@1: { yann@1: int type = sym_get_type(sym); yann@1: yann@1: if (sym->visible == no) yann@1: return false; yann@1: yann@1: if (type != S_BOOLEAN && type != S_TRISTATE) yann@1: return false; yann@1: yann@1: if (type == S_BOOLEAN && val == mod) yann@1: return false; yann@1: if (sym->visible <= sym->rev_dep.tri) yann@1: return false; yann@1: if (sym_is_choice_value(sym) && sym->visible == yes) yann@1: return val == yes; yann@1: return val >= sym->rev_dep.tri && val <= sym->visible; yann@1: } yann@1: yann@1: bool sym_set_tristate_value(struct symbol *sym, tristate val) yann@1: { yann@1: tristate oldval = sym_get_tristate_value(sym); yann@1: yann@1: if (oldval != val && !sym_tristate_within_range(sym, val)) yann@1: return false; yann@1: yann@1: if (!(sym->flags & SYMBOL_DEF_USER)) { yann@1: sym->flags |= SYMBOL_DEF_USER; yann@1: sym_set_changed(sym); yann@1: } yann@1: /* yann@1: * setting a choice value also resets the new flag of the choice yann@1: * symbol and all other choice values. yann@1: */ yann@1: if (sym_is_choice_value(sym) && val == yes) { yann@1: struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym)); yann@1: struct property *prop; yann@1: struct expr *e; yann@1: yann@1: cs->def[S_DEF_USER].val = sym; yann@1: cs->flags |= SYMBOL_DEF_USER; yann@1: prop = sym_get_choice_prop(cs); yann@1: for (e = prop->expr; e; e = e->left.expr) { yann@1: if (e->right.sym->visible != no) yann@1: e->right.sym->flags |= SYMBOL_DEF_USER; yann@1: } yann@1: } yann@1: yann@1: sym->def[S_DEF_USER].tri = val; yann@1: if (oldval != val) yann@1: sym_clear_all_valid(); yann@1: yann@1: return true; yann@1: } yann@1: yann@1: tristate sym_toggle_tristate_value(struct symbol *sym) yann@1: { yann@1: tristate oldval, newval; yann@1: yann@1: oldval = newval = sym_get_tristate_value(sym); yann@1: do { yann@1: switch (newval) { yann@1: case no: yann@1: newval = mod; yann@1: break; yann@1: case mod: yann@1: newval = yes; yann@1: break; yann@1: case yes: yann@1: newval = no; yann@1: break; yann@1: } yann@1: if (sym_set_tristate_value(sym, newval)) yann@1: break; yann@1: } while (oldval != newval); yann@1: return newval; yann@1: } yann@1: yann@1: bool sym_string_valid(struct symbol *sym, const char *str) yann@1: { yann@1: signed char ch; yann@1: yann@1: switch (sym->type) { yann@1: case S_STRING: yann@1: return true; yann@1: case S_INT: yann@1: ch = *str++; yann@1: if (ch == '-') yann@1: ch = *str++; yann@1: if (!isdigit(ch)) yann@1: return false; yann@1: if (ch == '0' && *str != 0) yann@1: return false; yann@1: while ((ch = *str++)) { yann@1: if (!isdigit(ch)) yann@1: return false; yann@1: } yann@1: return true; yann@1: case S_HEX: yann@1: if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X')) yann@1: str += 2; yann@1: ch = *str++; yann@1: do { yann@1: if (!isxdigit(ch)) yann@1: return false; yann@1: } while ((ch = *str++)); yann@1: return true; yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: switch (str[0]) { yann@1: case 'y': case 'Y': yann@1: case 'm': case 'M': yann@1: case 'n': case 'N': yann@1: return true; yann@1: } yann@1: return false; yann@1: default: yann@1: return false; yann@1: } yann@1: } yann@1: yann@1: bool sym_string_within_range(struct symbol *sym, const char *str) yann@1: { yann@1: struct property *prop; yann@1: int val; yann@1: yann@1: switch (sym->type) { yann@1: case S_STRING: yann@1: return sym_string_valid(sym, str); yann@1: case S_INT: yann@1: if (!sym_string_valid(sym, str)) yann@1: return false; yann@1: prop = sym_get_range_prop(sym); yann@1: if (!prop) yann@1: return true; yann@1: val = strtol(str, NULL, 10); yann@1: return val >= sym_get_range_val(prop->expr->left.sym, 10) && yann@1: val <= sym_get_range_val(prop->expr->right.sym, 10); yann@1: case S_HEX: yann@1: if (!sym_string_valid(sym, str)) yann@1: return false; yann@1: prop = sym_get_range_prop(sym); yann@1: if (!prop) yann@1: return true; yann@1: val = strtol(str, NULL, 16); yann@1: return val >= sym_get_range_val(prop->expr->left.sym, 16) && yann@1: val <= sym_get_range_val(prop->expr->right.sym, 16); yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: switch (str[0]) { yann@1: case 'y': case 'Y': yann@1: return sym_tristate_within_range(sym, yes); yann@1: case 'm': case 'M': yann@1: return sym_tristate_within_range(sym, mod); yann@1: case 'n': case 'N': yann@1: return sym_tristate_within_range(sym, no); yann@1: } yann@1: return false; yann@1: default: yann@1: return false; yann@1: } yann@1: } yann@1: yann@1: bool sym_set_string_value(struct symbol *sym, const char *newval) yann@1: { yann@1: const char *oldval; yann@1: char *val; yann@1: int size; yann@1: yann@1: switch (sym->type) { yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: switch (newval[0]) { yann@1: case 'y': case 'Y': yann@1: return sym_set_tristate_value(sym, yes); yann@1: case 'm': case 'M': yann@1: return sym_set_tristate_value(sym, mod); yann@1: case 'n': case 'N': yann@1: return sym_set_tristate_value(sym, no); yann@1: } yann@1: return false; yann@1: default: yann@1: ; yann@1: } yann@1: yann@1: if (!sym_string_within_range(sym, newval)) yann@1: return false; yann@1: yann@1: if (!(sym->flags & SYMBOL_DEF_USER)) { yann@1: sym->flags |= SYMBOL_DEF_USER; yann@1: sym_set_changed(sym); yann@1: } yann@1: yann@1: oldval = sym->def[S_DEF_USER].val; yann@1: size = strlen(newval) + 1; yann@1: if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) { yann@1: size += 2; yann@1: sym->def[S_DEF_USER].val = val = malloc(size); yann@1: *val++ = '0'; yann@1: *val++ = 'x'; yann@1: } else if (!oldval || strcmp(oldval, newval)) yann@1: sym->def[S_DEF_USER].val = val = malloc(size); yann@1: else yann@1: return true; yann@1: yann@1: strcpy(val, newval); yann@1: free((void *)oldval); yann@1: sym_clear_all_valid(); yann@1: yann@1: return true; yann@1: } yann@1: yann@2448: /* yann@2448: * Find the default value associated to a symbol. yann@2448: * For tristate symbol handle the modules=n case yann@2448: * in which case "m" becomes "y". yann@2448: * If the symbol does not have any default then fallback yann@2448: * to the fixed default values. yann@2448: */ yann@2448: const char *sym_get_string_default(struct symbol *sym) yann@2448: { yann@2448: struct property *prop; yann@2448: struct symbol *ds; yann@2448: const char *str; yann@2448: tristate val; yann@2448: yann@2448: sym_calc_visibility(sym); yann@2448: sym_calc_value(modules_sym); yann@2448: val = symbol_no.curr.tri; yann@2448: str = symbol_empty.curr.val; yann@2448: yann@2448: /* If symbol has a default value look it up */ yann@2448: prop = sym_get_default_prop(sym); yann@2448: if (prop != NULL) { yann@2448: switch (sym->type) { yann@2448: case S_BOOLEAN: yann@2448: case S_TRISTATE: yann@2448: /* The visibility may limit the value from yes => mod */ yann@2448: val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri); yann@2448: break; yann@2448: default: yann@2448: /* yann@2448: * The following fails to handle the situation yann@2448: * where a default value is further limited by yann@2448: * the valid range. yann@2448: */ yann@2448: ds = prop_get_symbol(prop); yann@2448: if (ds != NULL) { yann@2448: sym_calc_value(ds); yann@2448: str = (const char *)ds->curr.val; yann@2448: } yann@2448: } yann@2448: } yann@2448: yann@2448: /* Handle select statements */ yann@2448: val = EXPR_OR(val, sym->rev_dep.tri); yann@2448: yann@2448: /* transpose mod to yes if modules are not enabled */ yann@2448: if (val == mod) yann@2448: if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no) yann@2448: val = yes; yann@2448: yann@2448: /* transpose mod to yes if type is bool */ yann@2448: if (sym->type == S_BOOLEAN && val == mod) yann@2448: val = yes; yann@2448: yann@2448: switch (sym->type) { yann@2448: case S_BOOLEAN: yann@2448: case S_TRISTATE: yann@2448: switch (val) { yann@2448: case no: return "n"; yann@2448: case mod: return "m"; yann@2448: case yes: return "y"; yann@2448: } yann@2448: case S_INT: yann@2448: case S_HEX: yann@2448: return str; yann@2448: case S_STRING: yann@2448: return str; yann@2448: case S_OTHER: yann@2448: case S_UNKNOWN: yann@2448: break; yann@2448: } yann@2448: return ""; yann@2448: } yann@2448: yann@1: const char *sym_get_string_value(struct symbol *sym) yann@1: { yann@1: tristate val; yann@1: yann@1: switch (sym->type) { yann@1: case S_BOOLEAN: yann@1: case S_TRISTATE: yann@1: val = sym_get_tristate_value(sym); yann@1: switch (val) { yann@1: case no: yann@1: return "n"; yann@1: case mod: yann@1: return "m"; yann@1: case yes: yann@1: return "y"; yann@1: } yann@1: break; yann@1: default: yann@1: ; yann@1: } yann@1: return (const char *)sym->curr.val; yann@1: } yann@1: yann@1: bool sym_is_changable(struct symbol *sym) yann@1: { yann@1: return sym->visible > sym->rev_dep.tri; yann@1: } yann@1: yann@2448: static unsigned strhash(const char *s) yann@2448: { yann@2448: /* fnv32 hash */ yann@2448: unsigned hash = 2166136261U; yann@2448: for (; *s; s++) yann@2448: hash = (hash ^ *s) * 0x01000193; yann@2448: return hash; yann@2448: } yann@2448: yann@943: struct symbol *sym_lookup(const char *name, int flags) yann@1: { yann@1: struct symbol *symbol; yann@1: char *new_name; yann@2448: int hash; yann@1: yann@1: if (name) { yann@1: if (name[0] && !name[1]) { yann@1: switch (name[0]) { yann@1: case 'y': return &symbol_yes; yann@1: case 'm': return &symbol_mod; yann@1: case 'n': return &symbol_no; yann@1: } yann@1: } yann@2448: hash = strhash(name) % SYMBOL_HASHSIZE; yann@1: yann@1: for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) { yann@2448: if (symbol->name && yann@2448: !strcmp(symbol->name, name) && yann@943: (flags ? symbol->flags & flags yann@943: : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE)))) yann@943: return symbol; yann@1: } yann@1: new_name = strdup(name); yann@1: } else { yann@1: new_name = NULL; yann@2448: hash = 0; yann@1: } yann@1: yann@1: symbol = malloc(sizeof(*symbol)); yann@1: memset(symbol, 0, sizeof(*symbol)); yann@1: symbol->name = new_name; yann@1: symbol->type = S_UNKNOWN; yann@943: symbol->flags |= flags; yann@1: yann@1: symbol->next = symbol_hash[hash]; yann@1: symbol_hash[hash] = symbol; yann@1: yann@1: return symbol; yann@1: } yann@1: yann@1: struct symbol *sym_find(const char *name) yann@1: { yann@1: struct symbol *symbol = NULL; yann@1: int hash = 0; yann@1: yann@1: if (!name) yann@1: return NULL; yann@1: yann@1: if (name[0] && !name[1]) { yann@1: switch (name[0]) { yann@1: case 'y': return &symbol_yes; yann@1: case 'm': return &symbol_mod; yann@1: case 'n': return &symbol_no; yann@1: } yann@1: } yann@2448: hash = strhash(name) % SYMBOL_HASHSIZE; yann@1: yann@1: for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) { yann@2448: if (symbol->name && yann@2448: !strcmp(symbol->name, name) && yann@1: !(symbol->flags & SYMBOL_CONST)) yann@1: break; yann@1: } yann@1: yann@1: return symbol; yann@1: } yann@1: yann@2448: /* yann@2448: * Expand symbol's names embedded in the string given in argument. Symbols' yann@2448: * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to yann@2448: * the empty string. yann@2448: */ yann@2448: const char *sym_expand_string_value(const char *in) yann@2448: { yann@2448: const char *src; yann@2448: char *res; yann@2448: size_t reslen; yann@2448: yann@2448: reslen = strlen(in) + 1; yann@2448: res = malloc(reslen); yann@2448: res[0] = '\0'; yann@2448: yann@2448: while ((src = strchr(in, '$'))) { yann@2448: char *p, name[SYMBOL_MAXLENGTH]; yann@2448: const char *symval = ""; yann@2448: struct symbol *sym; yann@2448: size_t newlen; yann@2448: yann@2448: strncat(res, in, src - in); yann@2448: src++; yann@2448: yann@2448: p = name; yann@2448: while (isalnum(*src) || *src == '_') yann@2448: *p++ = *src++; yann@2448: *p = '\0'; yann@2448: yann@2448: sym = sym_find(name); yann@2448: if (sym != NULL) { yann@2448: sym_calc_value(sym); yann@2448: symval = sym_get_string_value(sym); yann@2448: } yann@2448: yann@2448: newlen = strlen(res) + strlen(symval) + strlen(src) + 1; yann@2448: if (newlen > reslen) { yann@2448: reslen = newlen; yann@2448: res = realloc(res, reslen); yann@2448: } yann@2448: yann@2448: strcat(res, symval); yann@2448: in = src; yann@2448: } yann@2448: strcat(res, in); yann@2448: yann@2448: return res; yann@2448: } yann@2448: yann@1: struct symbol **sym_re_search(const char *pattern) yann@1: { yann@1: struct symbol *sym, **sym_arr = NULL; yann@1: int i, cnt, size; yann@1: regex_t re; yann@1: yann@1: cnt = size = 0; yann@1: /* Skip if empty */ yann@1: if (strlen(pattern) == 0) yann@1: return NULL; yann@1: if (regcomp(&re, pattern, REG_EXTENDED|REG_NOSUB|REG_ICASE)) yann@1: return NULL; yann@1: yann@1: for_all_symbols(i, sym) { yann@1: if (sym->flags & SYMBOL_CONST || !sym->name) yann@1: continue; yann@1: if (regexec(&re, sym->name, 0, NULL, 0)) yann@1: continue; yann@1: if (cnt + 1 >= size) { yann@1: void *tmp = sym_arr; yann@1: size += 16; yann@1: sym_arr = realloc(sym_arr, size * sizeof(struct symbol *)); yann@1: if (!sym_arr) { yann@1: free(tmp); yann@1: return NULL; yann@1: } yann@1: } yann@2448: sym_calc_value(sym); yann@1: sym_arr[cnt++] = sym; yann@1: } yann@1: if (sym_arr) yann@1: sym_arr[cnt] = NULL; yann@1: regfree(&re); yann@1: yann@1: return sym_arr; yann@1: } yann@1: yann@2448: /* yann@2448: * When we check for recursive dependencies we use a stack to save yann@2448: * current state so we can print out relevant info to user. yann@2448: * The entries are located on the call stack so no need to free memory. yann@2448: * Note inser() remove() must always match to properly clear the stack. yann@2448: */ yann@2448: static struct dep_stack { yann@2448: struct dep_stack *prev, *next; yann@2448: struct symbol *sym; yann@2448: struct property *prop; yann@2448: struct expr *expr; yann@2448: } *check_top; yann@2448: yann@2448: static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym) yann@2448: { yann@2448: memset(stack, 0, sizeof(*stack)); yann@2448: if (check_top) yann@2448: check_top->next = stack; yann@2448: stack->prev = check_top; yann@2448: stack->sym = sym; yann@2448: check_top = stack; yann@2448: } yann@2448: yann@2448: static void dep_stack_remove(void) yann@2448: { yann@2448: check_top = check_top->prev; yann@2448: if (check_top) yann@2448: check_top->next = NULL; yann@2448: } yann@2448: yann@2448: /* yann@2448: * Called when we have detected a recursive dependency. yann@2448: * check_top point to the top of the stact so we use yann@2448: * the ->prev pointer to locate the bottom of the stack. yann@2448: */ yann@2448: static void sym_check_print_recursive(struct symbol *last_sym) yann@2448: { yann@2448: struct dep_stack *stack; yann@2448: struct symbol *sym, *next_sym; yann@2448: struct menu *menu = NULL; yann@2448: struct property *prop; yann@2448: struct dep_stack cv_stack; yann@2448: yann@2448: if (sym_is_choice_value(last_sym)) { yann@2448: dep_stack_insert(&cv_stack, last_sym); yann@2448: last_sym = prop_get_symbol(sym_get_choice_prop(last_sym)); yann@2448: } yann@2448: yann@2448: for (stack = check_top; stack != NULL; stack = stack->prev) yann@2448: if (stack->sym == last_sym) yann@2448: break; yann@2448: if (!stack) { yann@2448: fprintf(stderr, "unexpected recursive dependency error\n"); yann@2448: return; yann@2448: } yann@2448: yann@2448: for (; stack; stack = stack->next) { yann@2448: sym = stack->sym; yann@2448: next_sym = stack->next ? stack->next->sym : last_sym; yann@2448: prop = stack->prop; yann@2448: if (prop == NULL) yann@2448: prop = stack->sym->prop; yann@2448: yann@2448: /* for choice values find the menu entry (used below) */ yann@2448: if (sym_is_choice(sym) || sym_is_choice_value(sym)) { yann@2448: for (prop = sym->prop; prop; prop = prop->next) { yann@2448: menu = prop->menu; yann@2448: if (prop->menu) yann@2448: break; yann@2448: } yann@2448: } yann@2448: if (stack->sym == last_sym) yann@2448: fprintf(stderr, "%s:%d:error: recursive dependency detected!\n", yann@2448: prop->file->name, prop->lineno); yann@2448: if (stack->expr) { yann@2448: fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n", yann@2448: prop->file->name, prop->lineno, yann@2448: sym->name ? sym->name : "", yann@2448: prop_get_type_name(prop->type), yann@2448: next_sym->name ? next_sym->name : ""); yann@2448: } else if (stack->prop) { yann@2448: fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n", yann@2448: prop->file->name, prop->lineno, yann@2448: sym->name ? sym->name : "", yann@2448: next_sym->name ? next_sym->name : ""); yann@2448: } else if (sym_is_choice(sym)) { yann@2448: fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n", yann@2448: menu->file->name, menu->lineno, yann@2448: sym->name ? sym->name : "", yann@2448: next_sym->name ? next_sym->name : ""); yann@2448: } else if (sym_is_choice_value(sym)) { yann@2448: fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n", yann@2448: menu->file->name, menu->lineno, yann@2448: sym->name ? sym->name : "", yann@2448: next_sym->name ? next_sym->name : ""); yann@2448: } else { yann@2448: fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n", yann@2448: prop->file->name, prop->lineno, yann@2448: sym->name ? sym->name : "", yann@2448: next_sym->name ? next_sym->name : ""); yann@2448: } yann@2448: } yann@2448: yann@2448: if (check_top == &cv_stack) yann@2448: dep_stack_remove(); yann@2448: } yann@1: yann@1: static struct symbol *sym_check_expr_deps(struct expr *e) yann@1: { yann@1: struct symbol *sym; yann@1: yann@1: if (!e) yann@1: return NULL; yann@1: switch (e->type) { yann@1: case E_OR: yann@1: case E_AND: yann@1: sym = sym_check_expr_deps(e->left.expr); yann@1: if (sym) yann@1: return sym; yann@1: return sym_check_expr_deps(e->right.expr); yann@1: case E_NOT: yann@1: return sym_check_expr_deps(e->left.expr); yann@1: case E_EQUAL: yann@1: case E_UNEQUAL: yann@1: sym = sym_check_deps(e->left.sym); yann@1: if (sym) yann@1: return sym; yann@1: return sym_check_deps(e->right.sym); yann@1: case E_SYMBOL: yann@1: return sym_check_deps(e->left.sym); yann@1: default: yann@1: break; yann@1: } yann@1: printf("Oops! How to check %d?\n", e->type); yann@1: return NULL; yann@1: } yann@1: yann@943: /* return NULL when dependencies are OK */ yann@943: static struct symbol *sym_check_sym_deps(struct symbol *sym) yann@943: { yann@943: struct symbol *sym2; yann@943: struct property *prop; yann@2448: struct dep_stack stack; yann@2448: yann@2448: dep_stack_insert(&stack, sym); yann@943: yann@943: sym2 = sym_check_expr_deps(sym->rev_dep.expr); yann@943: if (sym2) yann@2448: goto out; yann@943: yann@943: for (prop = sym->prop; prop; prop = prop->next) { yann@943: if (prop->type == P_CHOICE || prop->type == P_SELECT) yann@943: continue; yann@2448: stack.prop = prop; yann@943: sym2 = sym_check_expr_deps(prop->visible.expr); yann@943: if (sym2) yann@943: break; yann@943: if (prop->type != P_DEFAULT || sym_is_choice(sym)) yann@943: continue; yann@2448: stack.expr = prop->expr; yann@943: sym2 = sym_check_expr_deps(prop->expr); yann@943: if (sym2) yann@943: break; yann@2448: stack.expr = NULL; yann@943: } yann@943: yann@2448: out: yann@2448: dep_stack_remove(); yann@2448: yann@943: return sym2; yann@943: } yann@943: yann@943: static struct symbol *sym_check_choice_deps(struct symbol *choice) yann@943: { yann@943: struct symbol *sym, *sym2; yann@943: struct property *prop; yann@943: struct expr *e; yann@2448: struct dep_stack stack; yann@2448: yann@2448: dep_stack_insert(&stack, choice); yann@943: yann@943: prop = sym_get_choice_prop(choice); yann@943: expr_list_for_each_sym(prop->expr, e, sym) yann@943: sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED); yann@943: yann@943: choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED); yann@943: sym2 = sym_check_sym_deps(choice); yann@943: choice->flags &= ~SYMBOL_CHECK; yann@943: if (sym2) yann@943: goto out; yann@943: yann@943: expr_list_for_each_sym(prop->expr, e, sym) { yann@943: sym2 = sym_check_sym_deps(sym); yann@2448: if (sym2) yann@943: break; yann@943: } yann@943: out: yann@943: expr_list_for_each_sym(prop->expr, e, sym) yann@943: sym->flags &= ~SYMBOL_CHECK; yann@943: yann@943: if (sym2 && sym_is_choice_value(sym2) && yann@943: prop_get_symbol(sym_get_choice_prop(sym2)) == choice) yann@943: sym2 = choice; yann@943: yann@2448: dep_stack_remove(); yann@2448: yann@943: return sym2; yann@943: } yann@943: yann@1: struct symbol *sym_check_deps(struct symbol *sym) yann@1: { yann@1: struct symbol *sym2; yann@1: struct property *prop; yann@1: yann@1: if (sym->flags & SYMBOL_CHECK) { yann@2448: sym_check_print_recursive(sym); yann@1: return sym; yann@1: } yann@1: if (sym->flags & SYMBOL_CHECKED) yann@1: return NULL; yann@1: yann@943: if (sym_is_choice_value(sym)) { yann@2448: struct dep_stack stack; yann@2448: yann@943: /* for choice groups start the check with main choice symbol */ yann@2448: dep_stack_insert(&stack, sym); yann@943: prop = sym_get_choice_prop(sym); yann@943: sym2 = sym_check_deps(prop_get_symbol(prop)); yann@2448: dep_stack_remove(); yann@943: } else if (sym_is_choice(sym)) { yann@943: sym2 = sym_check_choice_deps(sym); yann@943: } else { yann@943: sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED); yann@943: sym2 = sym_check_sym_deps(sym); yann@943: sym->flags &= ~SYMBOL_CHECK; yann@943: } yann@1: yann@2448: if (sym2 && sym2 == sym) yann@2448: sym2 = NULL; yann@943: yann@1: return sym2; yann@1: } yann@1: yann@1: struct property *prop_alloc(enum prop_type type, struct symbol *sym) yann@1: { yann@1: struct property *prop; yann@1: struct property **propp; yann@1: yann@1: prop = malloc(sizeof(*prop)); yann@1: memset(prop, 0, sizeof(*prop)); yann@1: prop->type = type; yann@1: prop->sym = sym; yann@1: prop->file = current_file; yann@1: prop->lineno = zconf_lineno(); yann@1: yann@1: /* append property to the prop list of symbol */ yann@1: if (sym) { yann@1: for (propp = &sym->prop; *propp; propp = &(*propp)->next) yann@1: ; yann@1: *propp = prop; yann@1: } yann@1: yann@1: return prop; yann@1: } yann@1: yann@1: struct symbol *prop_get_symbol(struct property *prop) yann@1: { yann@1: if (prop->expr && (prop->expr->type == E_SYMBOL || yann@943: prop->expr->type == E_LIST)) yann@1: return prop->expr->left.sym; yann@1: return NULL; yann@1: } yann@1: yann@1: const char *prop_get_type_name(enum prop_type type) yann@1: { yann@1: switch (type) { yann@1: case P_PROMPT: yann@1: return "prompt"; yann@943: case P_ENV: yann@943: return "env"; yann@1: case P_COMMENT: yann@1: return "comment"; yann@1: case P_MENU: yann@1: return "menu"; yann@1: case P_DEFAULT: yann@1: return "default"; yann@1: case P_CHOICE: yann@1: return "choice"; yann@1: case P_SELECT: yann@1: return "select"; yann@1: case P_RANGE: yann@1: return "range"; yann@2448: case P_SYMBOL: yann@2448: return "symbol"; yann@1: case P_UNKNOWN: yann@1: break; yann@1: } yann@1: return "unknown"; yann@1: } yann@943: yann@2448: static void prop_add_env(const char *env) yann@943: { yann@943: struct symbol *sym, *sym2; yann@943: struct property *prop; yann@943: char *p; yann@943: yann@943: sym = current_entry->sym; yann@943: sym->flags |= SYMBOL_AUTO; yann@943: for_all_properties(sym, prop, P_ENV) { yann@943: sym2 = prop_get_symbol(prop); yann@943: if (strcmp(sym2->name, env)) yann@943: menu_warn(current_entry, "redefining environment symbol from %s", yann@943: sym2->name); yann@943: return; yann@943: } yann@943: yann@943: prop = prop_alloc(P_ENV, sym); yann@943: prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST)); yann@943: yann@943: sym_env_list = expr_alloc_one(E_LIST, sym_env_list); yann@943: sym_env_list->right.sym = sym; yann@943: yann@943: p = getenv(env); yann@943: if (p) yann@943: sym_add_default(sym, p); yann@943: }