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) {
405 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
408 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
414 if (sym->visible != no) {
415 sym->flags |= SYMBOL_WRITE;
416 if (sym_has_value(sym)) {
417 newval.val = sym->def[S_DEF_USER].val;
421 prop = sym_get_default_prop(sym);
423 struct symbol *ds = prop_get_symbol(prop);
425 sym->flags |= SYMBOL_WRITE;
427 newval.val = ds->curr.val;
436 if (sym_is_choice(sym) && newval.tri == yes)
437 sym->curr.val = sym_calc_choice(sym);
438 sym_validate_range(sym);
440 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
441 sym_set_changed(sym);
442 if (modules_sym == sym) {
443 sym_set_all_changed();
444 modules_val = modules_sym->curr.tri;
448 if (sym_is_choice(sym)) {
449 struct symbol *choice_sym;
451 prop = sym_get_choice_prop(sym);
452 expr_list_for_each_sym(prop->expr, e, choice_sym) {
453 if ((sym->flags & SYMBOL_WRITE) &&
454 choice_sym->visible != no)
455 choice_sym->flags |= SYMBOL_WRITE;
456 if (sym->flags & SYMBOL_CHANGED)
457 sym_set_changed(choice_sym);
461 if (sym->flags & SYMBOL_AUTO)
462 sym->flags &= ~SYMBOL_WRITE;
464 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
465 set_all_choice_values(sym);
468 void sym_clear_all_valid(void)
473 for_all_symbols(i, sym)
474 sym->flags &= ~SYMBOL_VALID;
475 sym_add_change_count(1);
476 sym_calc_value(modules_sym);
479 bool sym_tristate_within_range(struct symbol *sym, tristate val)
481 int type = sym_get_type(sym);
483 if (sym->visible == no)
486 if (type != S_BOOLEAN && type != S_TRISTATE)
489 if (type == S_BOOLEAN && val == mod)
491 if (sym->visible <= sym->rev_dep.tri)
493 if (sym_is_choice_value(sym) && sym->visible == yes)
495 return val >= sym->rev_dep.tri && val <= sym->visible;
498 bool sym_set_tristate_value(struct symbol *sym, tristate val)
500 tristate oldval = sym_get_tristate_value(sym);
502 if (oldval != val && !sym_tristate_within_range(sym, val))
505 if (!(sym->flags & SYMBOL_DEF_USER)) {
506 sym->flags |= SYMBOL_DEF_USER;
507 sym_set_changed(sym);
510 * setting a choice value also resets the new flag of the choice
511 * symbol and all other choice values.
513 if (sym_is_choice_value(sym) && val == yes) {
514 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
515 struct property *prop;
518 cs->def[S_DEF_USER].val = sym;
519 cs->flags |= SYMBOL_DEF_USER;
520 prop = sym_get_choice_prop(cs);
521 for (e = prop->expr; e; e = e->left.expr) {
522 if (e->right.sym->visible != no)
523 e->right.sym->flags |= SYMBOL_DEF_USER;
527 sym->def[S_DEF_USER].tri = val;
529 sym_clear_all_valid();
534 tristate sym_toggle_tristate_value(struct symbol *sym)
536 tristate oldval, newval;
538 oldval = newval = sym_get_tristate_value(sym);
551 if (sym_set_tristate_value(sym, newval))
553 } while (oldval != newval);
557 bool sym_string_valid(struct symbol *sym, const char *str)
570 if (ch == '0' && *str != 0)
572 while ((ch = *str++)) {
578 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
584 } while ((ch = *str++));
600 bool sym_string_within_range(struct symbol *sym, const char *str)
602 struct property *prop;
607 return sym_string_valid(sym, str);
609 if (!sym_string_valid(sym, str))
611 prop = sym_get_range_prop(sym);
614 val = strtoll(str, NULL, 10);
615 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
616 val <= sym_get_range_val(prop->expr->right.sym, 10);
618 if (!sym_string_valid(sym, str))
620 prop = sym_get_range_prop(sym);
623 val = strtoll(str, NULL, 16);
624 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
625 val <= sym_get_range_val(prop->expr->right.sym, 16);
630 return sym_tristate_within_range(sym, yes);
632 return sym_tristate_within_range(sym, mod);
634 return sym_tristate_within_range(sym, no);
642 bool sym_set_string_value(struct symbol *sym, const char *newval)
653 return sym_set_tristate_value(sym, yes);
655 return sym_set_tristate_value(sym, mod);
657 return sym_set_tristate_value(sym, no);
664 if (!sym_string_within_range(sym, newval))
667 if (!(sym->flags & SYMBOL_DEF_USER)) {
668 sym->flags |= SYMBOL_DEF_USER;
669 sym_set_changed(sym);
672 oldval = sym->def[S_DEF_USER].val;
673 size = strlen(newval) + 1;
674 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
676 sym->def[S_DEF_USER].val = val = xmalloc(size);
679 } else if (!oldval || strcmp(oldval, newval))
680 sym->def[S_DEF_USER].val = val = xmalloc(size);
685 free((void *)oldval);
686 sym_clear_all_valid();
692 * Find the default value associated to a symbol.
693 * For tristate symbol handle the modules=n case
694 * in which case "m" becomes "y".
695 * If the symbol does not have any default then fallback
696 * to the fixed default values.
698 const char *sym_get_string_default(struct symbol *sym)
700 struct property *prop;
705 sym_calc_visibility(sym);
706 sym_calc_value(modules_sym);
707 val = symbol_no.curr.tri;
708 str = symbol_empty.curr.val;
710 /* If symbol has a default value look it up */
711 prop = sym_get_default_prop(sym);
716 /* The visibility may limit the value from yes => mod */
717 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
721 * The following fails to handle the situation
722 * where a default value is further limited by
725 ds = prop_get_symbol(prop);
728 str = (const char *)ds->curr.val;
733 /* Handle select statements */
734 val = EXPR_OR(val, sym->rev_dep.tri);
736 /* transpose mod to yes if modules are not enabled */
738 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
741 /* transpose mod to yes if type is bool */
742 if (sym->type == S_BOOLEAN && val == mod)
750 case mod: return "m";
751 case yes: return "y";
765 const char *sym_get_string_value(struct symbol *sym)
772 val = sym_get_tristate_value(sym);
777 sym_calc_value(modules_sym);
778 return (modules_sym->curr.tri == no) ? "n" : "m";
786 return (const char *)sym->curr.val;
789 bool sym_is_changable(struct symbol *sym)
791 return sym->visible > sym->rev_dep.tri;
794 static unsigned strhash(const char *s)
797 unsigned hash = 2166136261U;
799 hash = (hash ^ *s) * 0x01000193;
803 struct symbol *sym_lookup(const char *name, int flags)
805 struct symbol *symbol;
810 if (name[0] && !name[1]) {
812 case 'y': return &symbol_yes;
813 case 'm': return &symbol_mod;
814 case 'n': return &symbol_no;
817 hash = strhash(name) % SYMBOL_HASHSIZE;
819 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
821 !strcmp(symbol->name, name) &&
822 (flags ? symbol->flags & flags
823 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
826 new_name = strdup(name);
832 symbol = xmalloc(sizeof(*symbol));
833 memset(symbol, 0, sizeof(*symbol));
834 symbol->name = new_name;
835 symbol->type = S_UNKNOWN;
836 symbol->flags |= flags;
838 symbol->next = symbol_hash[hash];
839 symbol_hash[hash] = symbol;
844 struct symbol *sym_find(const char *name)
846 struct symbol *symbol = NULL;
852 if (name[0] && !name[1]) {
854 case 'y': return &symbol_yes;
855 case 'm': return &symbol_mod;
856 case 'n': return &symbol_no;
859 hash = strhash(name) % SYMBOL_HASHSIZE;
861 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
863 !strcmp(symbol->name, name) &&
864 !(symbol->flags & SYMBOL_CONST))
872 * Expand symbol's names embedded in the string given in argument. Symbols'
873 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
876 const char *sym_expand_string_value(const char *in)
882 reslen = strlen(in) + 1;
883 res = xmalloc(reslen);
886 while ((src = strchr(in, '$'))) {
887 char *p, name[SYMBOL_MAXLENGTH];
888 const char *symval = "";
892 strncat(res, in, src - in);
896 while (isalnum(*src) || *src == '_')
900 sym = sym_find(name);
903 symval = sym_get_string_value(sym);
906 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
907 if (newlen > reslen) {
909 res = realloc(res, reslen);
920 const char *sym_escape_string_value(const char *in)
927 reslen = strlen(in) + strlen("\"\"") + 1;
931 l = strcspn(p, "\"\\");
941 res = xmalloc(reslen);
948 l = strcspn(p, "\"\\");
956 strncat(res, p++, 1);
968 /* Compare matched symbols as thus:
969 * - first, symbols that match exactly
970 * - then, alphabetical sort
972 static int sym_rel_comp(const void *sym1, const void *sym2)
974 const struct sym_match *s1 = sym1;
975 const struct sym_match *s2 = sym2;
979 * - if matched length on symbol s1 is the length of that symbol,
980 * then this symbol should come first;
981 * - if matched length on symbol s2 is the length of that symbol,
982 * then this symbol should come first.
983 * Note: since the search can be a regexp, both symbols may match
984 * exactly; if this is the case, we can't decide which comes first,
985 * and we fallback to sorting alphabetically.
987 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
988 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
989 if (exact1 && !exact2)
991 if (!exact1 && exact2)
994 /* As a fallback, sort symbols alphabetically */
995 return strcmp(s1->sym->name, s2->sym->name);
998 struct symbol **sym_re_search(const char *pattern)
1000 struct symbol *sym, **sym_arr = NULL;
1001 struct sym_match *sym_match_arr = NULL;
1004 regmatch_t match[1];
1008 if (strlen(pattern) == 0)
1010 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1013 for_all_symbols(i, sym) {
1014 if (sym->flags & SYMBOL_CONST || !sym->name)
1016 if (regexec(&re, sym->name, 1, match, 0))
1021 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
1023 goto sym_re_search_free;
1024 sym_match_arr = tmp;
1026 sym_calc_value(sym);
1027 /* As regexec returned 0, we know we have a match, so
1028 * we can use match[0].rm_[se]o without further checks
1030 sym_match_arr[cnt].so = match[0].rm_so;
1031 sym_match_arr[cnt].eo = match[0].rm_eo;
1032 sym_match_arr[cnt++].sym = sym;
1034 if (sym_match_arr) {
1035 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
1036 sym_arr = malloc((cnt+1) * sizeof(struct symbol));
1038 goto sym_re_search_free;
1039 for (i = 0; i < cnt; i++)
1040 sym_arr[i] = sym_match_arr[i].sym;
1041 sym_arr[cnt] = NULL;
1044 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1045 free(sym_match_arr);
1052 * When we check for recursive dependencies we use a stack to save
1053 * current state so we can print out relevant info to user.
1054 * The entries are located on the call stack so no need to free memory.
1055 * Note insert() remove() must always match to properly clear the stack.
1057 static struct dep_stack {
1058 struct dep_stack *prev, *next;
1060 struct property *prop;
1064 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1066 memset(stack, 0, sizeof(*stack));
1068 check_top->next = stack;
1069 stack->prev = check_top;
1074 static void dep_stack_remove(void)
1076 check_top = check_top->prev;
1078 check_top->next = NULL;
1082 * Called when we have detected a recursive dependency.
1083 * check_top point to the top of the stact so we use
1084 * the ->prev pointer to locate the bottom of the stack.
1086 static void sym_check_print_recursive(struct symbol *last_sym)
1088 struct dep_stack *stack;
1089 struct symbol *sym, *next_sym;
1090 struct menu *menu = NULL;
1091 struct property *prop;
1092 struct dep_stack cv_stack;
1094 if (sym_is_choice_value(last_sym)) {
1095 dep_stack_insert(&cv_stack, last_sym);
1096 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1099 for (stack = check_top; stack != NULL; stack = stack->prev)
1100 if (stack->sym == last_sym)
1103 fprintf(stderr, "unexpected recursive dependency error\n");
1107 for (; stack; stack = stack->next) {
1109 next_sym = stack->next ? stack->next->sym : last_sym;
1112 prop = stack->sym->prop;
1114 /* for choice values find the menu entry (used below) */
1115 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1116 for (prop = sym->prop; prop; prop = prop->next) {
1122 if (stack->sym == last_sym)
1123 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1124 prop->file->name, prop->lineno);
1125 fprintf(stderr, "For a resolution refer to Documentation/kbuild/kconfig-language.txt\n");
1126 fprintf(stderr, "subsection \"Kconfig recursive dependency limitations\"\n");
1128 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1129 prop->file->name, prop->lineno,
1130 sym->name ? sym->name : "<choice>",
1131 prop_get_type_name(prop->type),
1132 next_sym->name ? next_sym->name : "<choice>");
1133 } else if (stack->prop) {
1134 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1135 prop->file->name, prop->lineno,
1136 sym->name ? sym->name : "<choice>",
1137 next_sym->name ? next_sym->name : "<choice>");
1138 } else if (sym_is_choice(sym)) {
1139 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1140 menu->file->name, menu->lineno,
1141 sym->name ? sym->name : "<choice>",
1142 next_sym->name ? next_sym->name : "<choice>");
1143 } else if (sym_is_choice_value(sym)) {
1144 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1145 menu->file->name, menu->lineno,
1146 sym->name ? sym->name : "<choice>",
1147 next_sym->name ? next_sym->name : "<choice>");
1149 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1150 prop->file->name, prop->lineno,
1151 sym->name ? sym->name : "<choice>",
1152 next_sym->name ? next_sym->name : "<choice>");
1156 if (check_top == &cv_stack)
1160 static struct symbol *sym_check_expr_deps(struct expr *e)
1169 sym = sym_check_expr_deps(e->left.expr);
1172 return sym_check_expr_deps(e->right.expr);
1174 return sym_check_expr_deps(e->left.expr);
1181 sym = sym_check_deps(e->left.sym);
1184 return sym_check_deps(e->right.sym);
1186 return sym_check_deps(e->left.sym);
1190 printf("Oops! How to check %d?\n", e->type);
1194 /* return NULL when dependencies are OK */
1195 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1197 struct symbol *sym2;
1198 struct property *prop;
1199 struct dep_stack stack;
1201 dep_stack_insert(&stack, sym);
1203 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1207 for (prop = sym->prop; prop; prop = prop->next) {
1208 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1211 sym2 = sym_check_expr_deps(prop->visible.expr);
1214 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1216 stack.expr = prop->expr;
1217 sym2 = sym_check_expr_deps(prop->expr);
1229 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1231 struct symbol *sym, *sym2;
1232 struct property *prop;
1234 struct dep_stack stack;
1236 dep_stack_insert(&stack, choice);
1238 prop = sym_get_choice_prop(choice);
1239 expr_list_for_each_sym(prop->expr, e, sym)
1240 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1242 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1243 sym2 = sym_check_sym_deps(choice);
1244 choice->flags &= ~SYMBOL_CHECK;
1248 expr_list_for_each_sym(prop->expr, e, sym) {
1249 sym2 = sym_check_sym_deps(sym);
1254 expr_list_for_each_sym(prop->expr, e, sym)
1255 sym->flags &= ~SYMBOL_CHECK;
1257 if (sym2 && sym_is_choice_value(sym2) &&
1258 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1266 struct symbol *sym_check_deps(struct symbol *sym)
1268 struct symbol *sym2;
1269 struct property *prop;
1271 if (sym->flags & SYMBOL_CHECK) {
1272 sym_check_print_recursive(sym);
1275 if (sym->flags & SYMBOL_CHECKED)
1278 if (sym_is_choice_value(sym)) {
1279 struct dep_stack stack;
1281 /* for choice groups start the check with main choice symbol */
1282 dep_stack_insert(&stack, sym);
1283 prop = sym_get_choice_prop(sym);
1284 sym2 = sym_check_deps(prop_get_symbol(prop));
1286 } else if (sym_is_choice(sym)) {
1287 sym2 = sym_check_choice_deps(sym);
1289 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1290 sym2 = sym_check_sym_deps(sym);
1291 sym->flags &= ~SYMBOL_CHECK;
1294 if (sym2 && sym2 == sym)
1300 struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1302 struct property *prop;
1303 struct property **propp;
1305 prop = xmalloc(sizeof(*prop));
1306 memset(prop, 0, sizeof(*prop));
1309 prop->file = current_file;
1310 prop->lineno = zconf_lineno();
1312 /* append property to the prop list of symbol */
1314 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1322 struct symbol *prop_get_symbol(struct property *prop)
1324 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1325 prop->expr->type == E_LIST))
1326 return prop->expr->left.sym;
1330 const char *prop_get_type_name(enum prop_type type)
1359 static void prop_add_env(const char *env)
1361 struct symbol *sym, *sym2;
1362 struct property *prop;
1365 sym = current_entry->sym;
1366 sym->flags |= SYMBOL_AUTO;
1367 for_all_properties(sym, prop, P_ENV) {
1368 sym2 = prop_get_symbol(prop);
1369 if (strcmp(sym2->name, env))
1370 menu_warn(current_entry, "redefining environment symbol from %s",
1375 prop = prop_alloc(P_ENV, sym);
1376 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1378 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1379 sym_env_list->right.sym = sym;
1383 sym_add_default(sym, p);
1385 menu_warn(current_entry, "environment variable %s undefined", env);