2 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
3 * Released under the terms of the GNU GPL v2.0.
10 #include <sys/utsname.h>
14 struct symbol symbol_yes = {
17 .flags = SYMBOL_CONST|SYMBOL_VALID,
21 .flags = SYMBOL_CONST|SYMBOL_VALID,
25 .flags = SYMBOL_CONST|SYMBOL_VALID,
29 .flags = SYMBOL_VALID,
32 struct symbol *sym_defconfig_list;
33 struct symbol *modules_sym;
36 struct expr *sym_env_list;
38 static void sym_add_default(struct symbol *sym, const char *def)
40 struct property *prop = prop_alloc(P_DEFAULT, sym);
42 prop->expr = expr_alloc_symbol(sym_lookup(def, SYMBOL_CONST));
49 static bool inited = false;
57 sym = sym_lookup("UNAME_RELEASE", 0);
59 sym->flags |= SYMBOL_AUTO;
60 sym_add_default(sym, uts.release);
63 enum symbol_type sym_get_type(struct symbol *sym)
65 enum symbol_type type = sym->type;
67 if (type == S_TRISTATE) {
68 if (sym_is_choice_value(sym) && sym->visible == yes)
70 else if (modules_val == no)
76 const char *sym_type_name(enum symbol_type type)
97 struct property *sym_get_choice_prop(struct symbol *sym)
99 struct property *prop;
101 for_all_choices(sym, prop)
106 struct property *sym_get_env_prop(struct symbol *sym)
108 struct property *prop;
110 for_all_properties(sym, prop, P_ENV)
115 static struct property *sym_get_default_prop(struct symbol *sym)
117 struct property *prop;
119 for_all_defaults(sym, prop) {
120 prop->visible.tri = expr_calc_value(prop->visible.expr);
121 if (prop->visible.tri != no)
127 static struct property *sym_get_range_prop(struct symbol *sym)
129 struct property *prop;
131 for_all_properties(sym, prop, P_RANGE) {
132 prop->visible.tri = expr_calc_value(prop->visible.expr);
133 if (prop->visible.tri != no)
139 static long long sym_get_range_val(struct symbol *sym, int base)
152 return strtoll(sym->curr.val, NULL, base);
155 static void sym_validate_range(struct symbol *sym)
157 struct property *prop;
172 prop = sym_get_range_prop(sym);
175 val = strtoll(sym->curr.val, NULL, base);
176 val2 = sym_get_range_val(prop->expr->left.sym, base);
178 val2 = sym_get_range_val(prop->expr->right.sym, base);
182 if (sym->type == S_INT)
183 sprintf(str, "%lld", val2);
185 sprintf(str, "0x%llx", val2);
186 sym->curr.val = strdup(str);
189 static void sym_set_changed(struct symbol *sym)
191 struct property *prop;
193 sym->flags |= SYMBOL_CHANGED;
194 for (prop = sym->prop; prop; prop = prop->next) {
196 prop->menu->flags |= MENU_CHANGED;
200 static void sym_set_all_changed(void)
205 for_all_symbols(i, sym)
206 sym_set_changed(sym);
209 static void sym_calc_visibility(struct symbol *sym)
211 struct property *prop;
212 struct symbol *choice_sym = NULL;
215 /* any prompt visible? */
218 if (sym_is_choice_value(sym))
219 choice_sym = prop_get_symbol(sym_get_choice_prop(sym));
221 for_all_prompts(sym, prop) {
222 prop->visible.tri = expr_calc_value(prop->visible.expr);
224 * Tristate choice_values with visibility 'mod' are
225 * not visible if the corresponding choice's value is
228 if (choice_sym && sym->type == S_TRISTATE &&
229 prop->visible.tri == mod && choice_sym->curr.tri == yes)
230 prop->visible.tri = no;
232 tri = EXPR_OR(tri, prop->visible.tri);
234 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
236 if (sym->visible != tri) {
238 sym_set_changed(sym);
240 if (sym_is_choice_value(sym))
242 /* defaulting to "yes" if no explicit "depends on" are given */
244 if (sym->dir_dep.expr)
245 tri = expr_calc_value(sym->dir_dep.expr);
248 if (sym->dir_dep.tri != tri) {
249 sym->dir_dep.tri = tri;
250 sym_set_changed(sym);
253 if (sym->rev_dep.expr)
254 tri = expr_calc_value(sym->rev_dep.expr);
255 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
257 if (sym->rev_dep.tri != tri) {
258 sym->rev_dep.tri = tri;
259 sym_set_changed(sym);
264 * Find the default symbol for a choice.
265 * First try the default values for the choice symbol
266 * Next locate the first visible choice value
267 * Return NULL if none was found
269 struct symbol *sym_choice_default(struct symbol *sym)
271 struct symbol *def_sym;
272 struct property *prop;
275 /* any of the defaults visible? */
276 for_all_defaults(sym, prop) {
277 prop->visible.tri = expr_calc_value(prop->visible.expr);
278 if (prop->visible.tri == no)
280 def_sym = prop_get_symbol(prop);
281 if (def_sym->visible != no)
285 /* just get the first visible value */
286 prop = sym_get_choice_prop(sym);
287 expr_list_for_each_sym(prop->expr, e, def_sym)
288 if (def_sym->visible != no)
291 /* failed to locate any defaults */
295 static struct symbol *sym_calc_choice(struct symbol *sym)
297 struct symbol *def_sym;
298 struct property *prop;
302 /* first calculate all choice values' visibilities */
304 prop = sym_get_choice_prop(sym);
305 expr_list_for_each_sym(prop->expr, e, def_sym) {
306 sym_calc_visibility(def_sym);
307 if (def_sym->visible != no)
308 flags &= def_sym->flags;
311 sym->flags &= flags | ~SYMBOL_DEF_USER;
313 /* is the user choice visible? */
314 def_sym = sym->def[S_DEF_USER].val;
315 if (def_sym && def_sym->visible != no)
318 def_sym = sym_choice_default(sym);
321 /* no choice? reset tristate value */
327 void sym_calc_value(struct symbol *sym)
329 struct symbol_value newval, oldval;
330 struct property *prop;
336 if (sym->flags & SYMBOL_VALID)
339 if (sym_is_choice_value(sym) &&
340 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
341 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
342 prop = sym_get_choice_prop(sym);
343 sym_calc_value(prop_get_symbol(prop));
346 sym->flags |= SYMBOL_VALID;
354 newval = symbol_empty.curr;
358 newval = symbol_no.curr;
361 sym->curr.val = sym->name;
365 if (!sym_is_choice_value(sym))
366 sym->flags &= ~SYMBOL_WRITE;
368 sym_calc_visibility(sym);
370 /* set default if recursively called */
373 switch (sym_get_type(sym)) {
376 if (sym_is_choice_value(sym) && sym->visible == yes) {
377 prop = sym_get_choice_prop(sym);
378 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
380 if (sym->visible != no) {
381 /* if the symbol is visible use the user value
382 * if available, otherwise try the default value
384 sym->flags |= SYMBOL_WRITE;
385 if (sym_has_value(sym)) {
386 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
391 if (sym->rev_dep.tri != no)
392 sym->flags |= SYMBOL_WRITE;
393 if (!sym_is_choice(sym)) {
394 prop = sym_get_default_prop(sym);
396 sym->flags |= SYMBOL_WRITE;
397 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
402 if (sym->dir_dep.tri == no && sym->rev_dep.tri != no) {
404 e = expr_simplify_unmet_dep(sym->rev_dep.expr,
406 fprintf(stderr, "warning: (");
407 expr_fprint(e, stderr);
408 fprintf(stderr, ") selects %s which has unmet direct dependencies (",
410 expr_fprint(sym->dir_dep.expr, stderr);
411 fprintf(stderr, ")\n");
414 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
416 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
422 if (sym->visible != no) {
423 sym->flags |= SYMBOL_WRITE;
424 if (sym_has_value(sym)) {
425 newval.val = sym->def[S_DEF_USER].val;
429 prop = sym_get_default_prop(sym);
431 struct symbol *ds = prop_get_symbol(prop);
433 sym->flags |= SYMBOL_WRITE;
435 newval.val = ds->curr.val;
444 if (sym_is_choice(sym) && newval.tri == yes)
445 sym->curr.val = sym_calc_choice(sym);
446 sym_validate_range(sym);
448 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
449 sym_set_changed(sym);
450 if (modules_sym == sym) {
451 sym_set_all_changed();
452 modules_val = modules_sym->curr.tri;
456 if (sym_is_choice(sym)) {
457 struct symbol *choice_sym;
459 prop = sym_get_choice_prop(sym);
460 expr_list_for_each_sym(prop->expr, e, choice_sym) {
461 if ((sym->flags & SYMBOL_WRITE) &&
462 choice_sym->visible != no)
463 choice_sym->flags |= SYMBOL_WRITE;
464 if (sym->flags & SYMBOL_CHANGED)
465 sym_set_changed(choice_sym);
469 if (sym->flags & SYMBOL_AUTO)
470 sym->flags &= ~SYMBOL_WRITE;
472 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
473 set_all_choice_values(sym);
476 void sym_clear_all_valid(void)
481 for_all_symbols(i, sym)
482 sym->flags &= ~SYMBOL_VALID;
483 sym_add_change_count(1);
484 sym_calc_value(modules_sym);
487 bool sym_tristate_within_range(struct symbol *sym, tristate val)
489 int type = sym_get_type(sym);
491 if (sym->visible == no)
494 if (type != S_BOOLEAN && type != S_TRISTATE)
497 if (type == S_BOOLEAN && val == mod)
499 if (sym->visible <= sym->rev_dep.tri)
501 if (sym_is_choice_value(sym) && sym->visible == yes)
503 return val >= sym->rev_dep.tri && val <= sym->visible;
506 bool sym_set_tristate_value(struct symbol *sym, tristate val)
508 tristate oldval = sym_get_tristate_value(sym);
510 if (oldval != val && !sym_tristate_within_range(sym, val))
513 if (!(sym->flags & SYMBOL_DEF_USER)) {
514 sym->flags |= SYMBOL_DEF_USER;
515 sym_set_changed(sym);
518 * setting a choice value also resets the new flag of the choice
519 * symbol and all other choice values.
521 if (sym_is_choice_value(sym) && val == yes) {
522 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
523 struct property *prop;
526 cs->def[S_DEF_USER].val = sym;
527 cs->flags |= SYMBOL_DEF_USER;
528 prop = sym_get_choice_prop(cs);
529 for (e = prop->expr; e; e = e->left.expr) {
530 if (e->right.sym->visible != no)
531 e->right.sym->flags |= SYMBOL_DEF_USER;
535 sym->def[S_DEF_USER].tri = val;
537 sym_clear_all_valid();
542 tristate sym_toggle_tristate_value(struct symbol *sym)
544 tristate oldval, newval;
546 oldval = newval = sym_get_tristate_value(sym);
559 if (sym_set_tristate_value(sym, newval))
561 } while (oldval != newval);
565 bool sym_string_valid(struct symbol *sym, const char *str)
578 if (ch == '0' && *str != 0)
580 while ((ch = *str++)) {
586 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
592 } while ((ch = *str++));
608 bool sym_string_within_range(struct symbol *sym, const char *str)
610 struct property *prop;
615 return sym_string_valid(sym, str);
617 if (!sym_string_valid(sym, str))
619 prop = sym_get_range_prop(sym);
622 val = strtoll(str, NULL, 10);
623 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
624 val <= sym_get_range_val(prop->expr->right.sym, 10);
626 if (!sym_string_valid(sym, str))
628 prop = sym_get_range_prop(sym);
631 val = strtoll(str, NULL, 16);
632 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
633 val <= sym_get_range_val(prop->expr->right.sym, 16);
638 return sym_tristate_within_range(sym, yes);
640 return sym_tristate_within_range(sym, mod);
642 return sym_tristate_within_range(sym, no);
650 bool sym_set_string_value(struct symbol *sym, const char *newval)
661 return sym_set_tristate_value(sym, yes);
663 return sym_set_tristate_value(sym, mod);
665 return sym_set_tristate_value(sym, no);
672 if (!sym_string_within_range(sym, newval))
675 if (!(sym->flags & SYMBOL_DEF_USER)) {
676 sym->flags |= SYMBOL_DEF_USER;
677 sym_set_changed(sym);
680 oldval = sym->def[S_DEF_USER].val;
681 size = strlen(newval) + 1;
682 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
684 sym->def[S_DEF_USER].val = val = xmalloc(size);
687 } else if (!oldval || strcmp(oldval, newval))
688 sym->def[S_DEF_USER].val = val = xmalloc(size);
693 free((void *)oldval);
694 sym_clear_all_valid();
700 * Find the default value associated to a symbol.
701 * For tristate symbol handle the modules=n case
702 * in which case "m" becomes "y".
703 * If the symbol does not have any default then fallback
704 * to the fixed default values.
706 const char *sym_get_string_default(struct symbol *sym)
708 struct property *prop;
713 sym_calc_visibility(sym);
714 sym_calc_value(modules_sym);
715 val = symbol_no.curr.tri;
716 str = symbol_empty.curr.val;
718 /* If symbol has a default value look it up */
719 prop = sym_get_default_prop(sym);
724 /* The visibility may limit the value from yes => mod */
725 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
729 * The following fails to handle the situation
730 * where a default value is further limited by
733 ds = prop_get_symbol(prop);
736 str = (const char *)ds->curr.val;
741 /* Handle select statements */
742 val = EXPR_OR(val, sym->rev_dep.tri);
744 /* transpose mod to yes if modules are not enabled */
746 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
749 /* transpose mod to yes if type is bool */
750 if (sym->type == S_BOOLEAN && val == mod)
758 case mod: return "m";
759 case yes: return "y";
773 const char *sym_get_string_value(struct symbol *sym)
780 val = sym_get_tristate_value(sym);
785 sym_calc_value(modules_sym);
786 return (modules_sym->curr.tri == no) ? "n" : "m";
794 return (const char *)sym->curr.val;
797 bool sym_is_changable(struct symbol *sym)
799 return sym->visible > sym->rev_dep.tri;
802 static unsigned strhash(const char *s)
805 unsigned hash = 2166136261U;
807 hash = (hash ^ *s) * 0x01000193;
811 struct symbol *sym_lookup(const char *name, int flags)
813 struct symbol *symbol;
818 if (name[0] && !name[1]) {
820 case 'y': return &symbol_yes;
821 case 'm': return &symbol_mod;
822 case 'n': return &symbol_no;
825 hash = strhash(name) % SYMBOL_HASHSIZE;
827 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
829 !strcmp(symbol->name, name) &&
830 (flags ? symbol->flags & flags
831 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
834 new_name = strdup(name);
840 symbol = xmalloc(sizeof(*symbol));
841 memset(symbol, 0, sizeof(*symbol));
842 symbol->name = new_name;
843 symbol->type = S_UNKNOWN;
844 symbol->flags |= flags;
846 symbol->next = symbol_hash[hash];
847 symbol_hash[hash] = symbol;
852 struct symbol *sym_find(const char *name)
854 struct symbol *symbol = NULL;
860 if (name[0] && !name[1]) {
862 case 'y': return &symbol_yes;
863 case 'm': return &symbol_mod;
864 case 'n': return &symbol_no;
867 hash = strhash(name) % SYMBOL_HASHSIZE;
869 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
871 !strcmp(symbol->name, name) &&
872 !(symbol->flags & SYMBOL_CONST))
880 * Expand symbol's names embedded in the string given in argument. Symbols'
881 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
884 const char *sym_expand_string_value(const char *in)
890 reslen = strlen(in) + 1;
891 res = xmalloc(reslen);
894 while ((src = strchr(in, '$'))) {
895 char *p, name[SYMBOL_MAXLENGTH];
896 const char *symval = "";
900 strncat(res, in, src - in);
904 while (isalnum(*src) || *src == '_')
908 sym = sym_find(name);
911 symval = sym_get_string_value(sym);
914 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
915 if (newlen > reslen) {
917 res = realloc(res, reslen);
928 const char *sym_escape_string_value(const char *in)
935 reslen = strlen(in) + strlen("\"\"") + 1;
939 l = strcspn(p, "\"\\");
949 res = xmalloc(reslen);
956 l = strcspn(p, "\"\\");
964 strncat(res, p++, 1);
976 /* Compare matched symbols as thus:
977 * - first, symbols that match exactly
978 * - then, alphabetical sort
980 static int sym_rel_comp(const void *sym1, const void *sym2)
982 const struct sym_match *s1 = sym1;
983 const struct sym_match *s2 = sym2;
987 * - if matched length on symbol s1 is the length of that symbol,
988 * then this symbol should come first;
989 * - if matched length on symbol s2 is the length of that symbol,
990 * then this symbol should come first.
991 * Note: since the search can be a regexp, both symbols may match
992 * exactly; if this is the case, we can't decide which comes first,
993 * and we fallback to sorting alphabetically.
995 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
996 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
997 if (exact1 && !exact2)
999 if (!exact1 && exact2)
1002 /* As a fallback, sort symbols alphabetically */
1003 return strcmp(s1->sym->name, s2->sym->name);
1006 struct symbol **sym_re_search(const char *pattern)
1008 struct symbol *sym, **sym_arr = NULL;
1009 struct sym_match *sym_match_arr = NULL;
1012 regmatch_t match[1];
1016 if (strlen(pattern) == 0)
1018 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1021 for_all_symbols(i, sym) {
1022 if (sym->flags & SYMBOL_CONST || !sym->name)
1024 if (regexec(&re, sym->name, 1, match, 0))
1029 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
1031 goto sym_re_search_free;
1032 sym_match_arr = tmp;
1034 sym_calc_value(sym);
1035 /* As regexec returned 0, we know we have a match, so
1036 * we can use match[0].rm_[se]o without further checks
1038 sym_match_arr[cnt].so = match[0].rm_so;
1039 sym_match_arr[cnt].eo = match[0].rm_eo;
1040 sym_match_arr[cnt++].sym = sym;
1042 if (sym_match_arr) {
1043 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
1044 sym_arr = malloc((cnt+1) * sizeof(struct symbol));
1046 goto sym_re_search_free;
1047 for (i = 0; i < cnt; i++)
1048 sym_arr[i] = sym_match_arr[i].sym;
1049 sym_arr[cnt] = NULL;
1052 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1053 free(sym_match_arr);
1060 * When we check for recursive dependencies we use a stack to save
1061 * current state so we can print out relevant info to user.
1062 * The entries are located on the call stack so no need to free memory.
1063 * Note insert() remove() must always match to properly clear the stack.
1065 static struct dep_stack {
1066 struct dep_stack *prev, *next;
1068 struct property *prop;
1072 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1074 memset(stack, 0, sizeof(*stack));
1076 check_top->next = stack;
1077 stack->prev = check_top;
1082 static void dep_stack_remove(void)
1084 check_top = check_top->prev;
1086 check_top->next = NULL;
1090 * Called when we have detected a recursive dependency.
1091 * check_top point to the top of the stact so we use
1092 * the ->prev pointer to locate the bottom of the stack.
1094 static void sym_check_print_recursive(struct symbol *last_sym)
1096 struct dep_stack *stack;
1097 struct symbol *sym, *next_sym;
1098 struct menu *menu = NULL;
1099 struct property *prop;
1100 struct dep_stack cv_stack;
1102 if (sym_is_choice_value(last_sym)) {
1103 dep_stack_insert(&cv_stack, last_sym);
1104 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1107 for (stack = check_top; stack != NULL; stack = stack->prev)
1108 if (stack->sym == last_sym)
1111 fprintf(stderr, "unexpected recursive dependency error\n");
1115 for (; stack; stack = stack->next) {
1117 next_sym = stack->next ? stack->next->sym : last_sym;
1120 prop = stack->sym->prop;
1122 /* for choice values find the menu entry (used below) */
1123 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1124 for (prop = sym->prop; prop; prop = prop->next) {
1130 if (stack->sym == last_sym)
1131 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1132 prop->file->name, prop->lineno);
1133 fprintf(stderr, "For a resolution refer to Documentation/kbuild/kconfig-language.txt\n");
1134 fprintf(stderr, "subsection \"Kconfig recursive dependency limitations\"\n");
1136 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1137 prop->file->name, prop->lineno,
1138 sym->name ? sym->name : "<choice>",
1139 prop_get_type_name(prop->type),
1140 next_sym->name ? next_sym->name : "<choice>");
1141 } else if (stack->prop) {
1142 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1143 prop->file->name, prop->lineno,
1144 sym->name ? sym->name : "<choice>",
1145 next_sym->name ? next_sym->name : "<choice>");
1146 } else if (sym_is_choice(sym)) {
1147 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1148 menu->file->name, menu->lineno,
1149 sym->name ? sym->name : "<choice>",
1150 next_sym->name ? next_sym->name : "<choice>");
1151 } else if (sym_is_choice_value(sym)) {
1152 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1153 menu->file->name, menu->lineno,
1154 sym->name ? sym->name : "<choice>",
1155 next_sym->name ? next_sym->name : "<choice>");
1157 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1158 prop->file->name, prop->lineno,
1159 sym->name ? sym->name : "<choice>",
1160 next_sym->name ? next_sym->name : "<choice>");
1164 if (check_top == &cv_stack)
1168 static struct symbol *sym_check_expr_deps(struct expr *e)
1177 sym = sym_check_expr_deps(e->left.expr);
1180 return sym_check_expr_deps(e->right.expr);
1182 return sym_check_expr_deps(e->left.expr);
1189 sym = sym_check_deps(e->left.sym);
1192 return sym_check_deps(e->right.sym);
1194 return sym_check_deps(e->left.sym);
1198 printf("Oops! How to check %d?\n", e->type);
1202 /* return NULL when dependencies are OK */
1203 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1205 struct symbol *sym2;
1206 struct property *prop;
1207 struct dep_stack stack;
1209 dep_stack_insert(&stack, sym);
1211 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1215 for (prop = sym->prop; prop; prop = prop->next) {
1216 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1219 sym2 = sym_check_expr_deps(prop->visible.expr);
1222 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1224 stack.expr = prop->expr;
1225 sym2 = sym_check_expr_deps(prop->expr);
1237 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1239 struct symbol *sym, *sym2;
1240 struct property *prop;
1242 struct dep_stack stack;
1244 dep_stack_insert(&stack, choice);
1246 prop = sym_get_choice_prop(choice);
1247 expr_list_for_each_sym(prop->expr, e, sym)
1248 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1250 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1251 sym2 = sym_check_sym_deps(choice);
1252 choice->flags &= ~SYMBOL_CHECK;
1256 expr_list_for_each_sym(prop->expr, e, sym) {
1257 sym2 = sym_check_sym_deps(sym);
1262 expr_list_for_each_sym(prop->expr, e, sym)
1263 sym->flags &= ~SYMBOL_CHECK;
1265 if (sym2 && sym_is_choice_value(sym2) &&
1266 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1274 struct symbol *sym_check_deps(struct symbol *sym)
1276 struct symbol *sym2;
1277 struct property *prop;
1279 if (sym->flags & SYMBOL_CHECK) {
1280 sym_check_print_recursive(sym);
1283 if (sym->flags & SYMBOL_CHECKED)
1286 if (sym_is_choice_value(sym)) {
1287 struct dep_stack stack;
1289 /* for choice groups start the check with main choice symbol */
1290 dep_stack_insert(&stack, sym);
1291 prop = sym_get_choice_prop(sym);
1292 sym2 = sym_check_deps(prop_get_symbol(prop));
1294 } else if (sym_is_choice(sym)) {
1295 sym2 = sym_check_choice_deps(sym);
1297 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1298 sym2 = sym_check_sym_deps(sym);
1299 sym->flags &= ~SYMBOL_CHECK;
1302 if (sym2 && sym2 == sym)
1308 struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1310 struct property *prop;
1311 struct property **propp;
1313 prop = xmalloc(sizeof(*prop));
1314 memset(prop, 0, sizeof(*prop));
1317 prop->file = current_file;
1318 prop->lineno = zconf_lineno();
1320 /* append property to the prop list of symbol */
1322 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1330 struct symbol *prop_get_symbol(struct property *prop)
1332 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1333 prop->expr->type == E_LIST))
1334 return prop->expr->left.sym;
1338 const char *prop_get_type_name(enum prop_type type)
1365 static void prop_add_env(const char *env)
1367 struct symbol *sym, *sym2;
1368 struct property *prop;
1371 sym = current_entry->sym;
1372 sym->flags |= SYMBOL_AUTO;
1373 for_all_properties(sym, prop, P_ENV) {
1374 sym2 = prop_get_symbol(prop);
1375 if (strcmp(sym2->name, env))
1376 menu_warn(current_entry, "redefining environment symbol from %s",
1381 prop = prop_alloc(P_ENV, sym);
1382 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1384 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1385 sym_env_list->right.sym = sym;
1389 sym_add_default(sym, p);
1391 menu_warn(current_entry, "environment variable %s undefined", env);