1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
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 enum symbol_type sym_get_type(struct symbol *sym)
38 enum symbol_type type = sym->type;
40 if (type == S_TRISTATE) {
41 if (sym_is_choice_value(sym) && sym->visible == yes)
43 else if (modules_val == no)
49 const char *sym_type_name(enum symbol_type type)
68 struct property *sym_get_choice_prop(struct symbol *sym)
70 struct property *prop;
72 for_all_choices(sym, prop)
77 static struct property *sym_get_default_prop(struct symbol *sym)
79 struct property *prop;
81 for_all_defaults(sym, prop) {
82 prop->visible.tri = expr_calc_value(prop->visible.expr);
83 if (prop->visible.tri != no)
89 struct property *sym_get_range_prop(struct symbol *sym)
91 struct property *prop;
93 for_all_properties(sym, prop, P_RANGE) {
94 prop->visible.tri = expr_calc_value(prop->visible.expr);
95 if (prop->visible.tri != no)
101 static long long sym_get_range_val(struct symbol *sym, int base)
114 return strtoll(sym->curr.val, NULL, base);
117 static void sym_validate_range(struct symbol *sym)
119 struct property *prop;
134 prop = sym_get_range_prop(sym);
137 val = strtoll(sym->curr.val, NULL, base);
138 val2 = sym_get_range_val(prop->expr->left.sym, base);
140 val2 = sym_get_range_val(prop->expr->right.sym, base);
144 if (sym->type == S_INT)
145 sprintf(str, "%lld", val2);
147 sprintf(str, "0x%llx", val2);
148 sym->curr.val = xstrdup(str);
151 static void sym_set_changed(struct symbol *sym)
153 struct property *prop;
155 sym->flags |= SYMBOL_CHANGED;
156 for (prop = sym->prop; prop; prop = prop->next) {
158 prop->menu->flags |= MENU_CHANGED;
162 static void sym_set_all_changed(void)
167 for_all_symbols(i, sym)
168 sym_set_changed(sym);
171 static void sym_calc_visibility(struct symbol *sym)
173 struct property *prop;
174 struct symbol *choice_sym = NULL;
177 /* any prompt visible? */
180 if (sym_is_choice_value(sym))
181 choice_sym = prop_get_symbol(sym_get_choice_prop(sym));
183 for_all_prompts(sym, prop) {
184 prop->visible.tri = expr_calc_value(prop->visible.expr);
186 * Tristate choice_values with visibility 'mod' are
187 * not visible if the corresponding choice's value is
190 if (choice_sym && sym->type == S_TRISTATE &&
191 prop->visible.tri == mod && choice_sym->curr.tri == yes)
192 prop->visible.tri = no;
194 tri = EXPR_OR(tri, prop->visible.tri);
196 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
198 if (sym->visible != tri) {
200 sym_set_changed(sym);
202 if (sym_is_choice_value(sym))
204 /* defaulting to "yes" if no explicit "depends on" are given */
206 if (sym->dir_dep.expr)
207 tri = expr_calc_value(sym->dir_dep.expr);
208 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
210 if (sym->dir_dep.tri != tri) {
211 sym->dir_dep.tri = tri;
212 sym_set_changed(sym);
215 if (sym->rev_dep.expr)
216 tri = expr_calc_value(sym->rev_dep.expr);
217 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
219 if (sym->rev_dep.tri != tri) {
220 sym->rev_dep.tri = tri;
221 sym_set_changed(sym);
224 if (sym->implied.expr && sym->dir_dep.tri != no)
225 tri = expr_calc_value(sym->implied.expr);
226 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
228 if (sym->implied.tri != tri) {
229 sym->implied.tri = tri;
230 sym_set_changed(sym);
235 * Find the default symbol for a choice.
236 * First try the default values for the choice symbol
237 * Next locate the first visible choice value
238 * Return NULL if none was found
240 struct symbol *sym_choice_default(struct symbol *sym)
242 struct symbol *def_sym;
243 struct property *prop;
246 /* any of the defaults visible? */
247 for_all_defaults(sym, prop) {
248 prop->visible.tri = expr_calc_value(prop->visible.expr);
249 if (prop->visible.tri == no)
251 def_sym = prop_get_symbol(prop);
252 if (def_sym->visible != no)
256 /* just get the first visible value */
257 prop = sym_get_choice_prop(sym);
258 expr_list_for_each_sym(prop->expr, e, def_sym)
259 if (def_sym->visible != no)
262 /* failed to locate any defaults */
266 static struct symbol *sym_calc_choice(struct symbol *sym)
268 struct symbol *def_sym;
269 struct property *prop;
273 /* first calculate all choice values' visibilities */
275 prop = sym_get_choice_prop(sym);
276 expr_list_for_each_sym(prop->expr, e, def_sym) {
277 sym_calc_visibility(def_sym);
278 if (def_sym->visible != no)
279 flags &= def_sym->flags;
282 sym->flags &= flags | ~SYMBOL_DEF_USER;
284 /* is the user choice visible? */
285 def_sym = sym->def[S_DEF_USER].val;
286 if (def_sym && def_sym->visible != no)
289 def_sym = sym_choice_default(sym);
292 /* no choice? reset tristate value */
298 static void sym_warn_unmet_dep(struct symbol *sym)
300 struct gstr gs = str_new();
303 "\nWARNING: unmet direct dependencies detected for %s\n",
306 " Depends on [%c]: ",
307 sym->dir_dep.tri == mod ? 'm' : 'n');
308 expr_gstr_print(sym->dir_dep.expr, &gs);
309 str_printf(&gs, "\n");
311 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, yes,
312 " Selected by [y]:\n");
313 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, mod,
314 " Selected by [m]:\n");
316 fputs(str_get(&gs), stderr);
319 void sym_calc_value(struct symbol *sym)
321 struct symbol_value newval, oldval;
322 struct property *prop;
328 if (sym->flags & SYMBOL_VALID)
331 if (sym_is_choice_value(sym) &&
332 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
333 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
334 prop = sym_get_choice_prop(sym);
335 sym_calc_value(prop_get_symbol(prop));
338 sym->flags |= SYMBOL_VALID;
346 newval = symbol_empty.curr;
350 newval = symbol_no.curr;
353 sym->curr.val = sym->name;
357 sym->flags &= ~SYMBOL_WRITE;
359 sym_calc_visibility(sym);
361 if (sym->visible != no)
362 sym->flags |= SYMBOL_WRITE;
364 /* set default if recursively called */
367 switch (sym_get_type(sym)) {
370 if (sym_is_choice_value(sym) && sym->visible == yes) {
371 prop = sym_get_choice_prop(sym);
372 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
374 if (sym->visible != no) {
375 /* if the symbol is visible use the user value
376 * if available, otherwise try the default value
378 if (sym_has_value(sym)) {
379 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
384 if (sym->rev_dep.tri != no)
385 sym->flags |= SYMBOL_WRITE;
386 if (!sym_is_choice(sym)) {
387 prop = sym_get_default_prop(sym);
389 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
391 if (newval.tri != no)
392 sym->flags |= SYMBOL_WRITE;
394 if (sym->implied.tri != no) {
395 sym->flags |= SYMBOL_WRITE;
396 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
400 if (sym->dir_dep.tri < sym->rev_dep.tri)
401 sym_warn_unmet_dep(sym);
402 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
404 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
410 if (sym->visible != no && sym_has_value(sym)) {
411 newval.val = sym->def[S_DEF_USER].val;
414 prop = sym_get_default_prop(sym);
416 struct symbol *ds = prop_get_symbol(prop);
418 sym->flags |= SYMBOL_WRITE;
420 newval.val = ds->curr.val;
429 if (sym_is_choice(sym) && newval.tri == yes)
430 sym->curr.val = sym_calc_choice(sym);
431 sym_validate_range(sym);
433 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
434 sym_set_changed(sym);
435 if (modules_sym == sym) {
436 sym_set_all_changed();
437 modules_val = modules_sym->curr.tri;
441 if (sym_is_choice(sym)) {
442 struct symbol *choice_sym;
444 prop = sym_get_choice_prop(sym);
445 expr_list_for_each_sym(prop->expr, e, choice_sym) {
446 if ((sym->flags & SYMBOL_WRITE) &&
447 choice_sym->visible != no)
448 choice_sym->flags |= SYMBOL_WRITE;
449 if (sym->flags & SYMBOL_CHANGED)
450 sym_set_changed(choice_sym);
454 if (sym->flags & SYMBOL_NO_WRITE)
455 sym->flags &= ~SYMBOL_WRITE;
457 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
458 set_all_choice_values(sym);
461 void sym_clear_all_valid(void)
466 for_all_symbols(i, sym)
467 sym->flags &= ~SYMBOL_VALID;
468 sym_add_change_count(1);
469 sym_calc_value(modules_sym);
472 bool sym_tristate_within_range(struct symbol *sym, tristate val)
474 int type = sym_get_type(sym);
476 if (sym->visible == no)
479 if (type != S_BOOLEAN && type != S_TRISTATE)
482 if (type == S_BOOLEAN && val == mod)
484 if (sym->visible <= sym->rev_dep.tri)
486 if (sym_is_choice_value(sym) && sym->visible == yes)
488 return val >= sym->rev_dep.tri && val <= sym->visible;
491 bool sym_set_tristate_value(struct symbol *sym, tristate val)
493 tristate oldval = sym_get_tristate_value(sym);
495 if (oldval != val && !sym_tristate_within_range(sym, val))
498 if (!(sym->flags & SYMBOL_DEF_USER)) {
499 sym->flags |= SYMBOL_DEF_USER;
500 sym_set_changed(sym);
503 * setting a choice value also resets the new flag of the choice
504 * symbol and all other choice values.
506 if (sym_is_choice_value(sym) && val == yes) {
507 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
508 struct property *prop;
511 cs->def[S_DEF_USER].val = sym;
512 cs->flags |= SYMBOL_DEF_USER;
513 prop = sym_get_choice_prop(cs);
514 for (e = prop->expr; e; e = e->left.expr) {
515 if (e->right.sym->visible != no)
516 e->right.sym->flags |= SYMBOL_DEF_USER;
520 sym->def[S_DEF_USER].tri = val;
522 sym_clear_all_valid();
527 tristate sym_toggle_tristate_value(struct symbol *sym)
529 tristate oldval, newval;
531 oldval = newval = sym_get_tristate_value(sym);
544 if (sym_set_tristate_value(sym, newval))
546 } while (oldval != newval);
550 bool sym_string_valid(struct symbol *sym, const char *str)
563 if (ch == '0' && *str != 0)
565 while ((ch = *str++)) {
571 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
577 } while ((ch = *str++));
593 bool sym_string_within_range(struct symbol *sym, const char *str)
595 struct property *prop;
600 return sym_string_valid(sym, str);
602 if (!sym_string_valid(sym, str))
604 prop = sym_get_range_prop(sym);
607 val = strtoll(str, NULL, 10);
608 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
609 val <= sym_get_range_val(prop->expr->right.sym, 10);
611 if (!sym_string_valid(sym, str))
613 prop = sym_get_range_prop(sym);
616 val = strtoll(str, NULL, 16);
617 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
618 val <= sym_get_range_val(prop->expr->right.sym, 16);
623 return sym_tristate_within_range(sym, yes);
625 return sym_tristate_within_range(sym, mod);
627 return sym_tristate_within_range(sym, no);
635 bool sym_set_string_value(struct symbol *sym, const char *newval)
646 return sym_set_tristate_value(sym, yes);
648 return sym_set_tristate_value(sym, mod);
650 return sym_set_tristate_value(sym, no);
657 if (!sym_string_within_range(sym, newval))
660 if (!(sym->flags & SYMBOL_DEF_USER)) {
661 sym->flags |= SYMBOL_DEF_USER;
662 sym_set_changed(sym);
665 oldval = sym->def[S_DEF_USER].val;
666 size = strlen(newval) + 1;
667 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
669 sym->def[S_DEF_USER].val = val = xmalloc(size);
672 } else if (!oldval || strcmp(oldval, newval))
673 sym->def[S_DEF_USER].val = val = xmalloc(size);
678 free((void *)oldval);
679 sym_clear_all_valid();
685 * Find the default value associated to a symbol.
686 * For tristate symbol handle the modules=n case
687 * in which case "m" becomes "y".
688 * If the symbol does not have any default then fallback
689 * to the fixed default values.
691 const char *sym_get_string_default(struct symbol *sym)
693 struct property *prop;
698 sym_calc_visibility(sym);
699 sym_calc_value(modules_sym);
700 val = symbol_no.curr.tri;
701 str = symbol_empty.curr.val;
703 /* If symbol has a default value look it up */
704 prop = sym_get_default_prop(sym);
709 /* The visibility may limit the value from yes => mod */
710 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
714 * The following fails to handle the situation
715 * where a default value is further limited by
718 ds = prop_get_symbol(prop);
721 str = (const char *)ds->curr.val;
726 /* Handle select statements */
727 val = EXPR_OR(val, sym->rev_dep.tri);
729 /* transpose mod to yes if modules are not enabled */
731 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
734 /* transpose mod to yes if type is bool */
735 if (sym->type == S_BOOLEAN && val == mod)
738 /* adjust the default value if this symbol is implied by another */
739 if (val < sym->implied.tri)
740 val = sym->implied.tri;
747 case mod: return "m";
748 case yes: return "y";
761 const char *sym_get_string_value(struct symbol *sym)
768 val = sym_get_tristate_value(sym);
773 sym_calc_value(modules_sym);
774 return (modules_sym->curr.tri == no) ? "n" : "m";
782 return (const char *)sym->curr.val;
785 bool sym_is_changeable(struct symbol *sym)
787 return sym->visible > sym->rev_dep.tri;
790 static unsigned strhash(const char *s)
793 unsigned hash = 2166136261U;
795 hash = (hash ^ *s) * 0x01000193;
799 struct symbol *sym_lookup(const char *name, int flags)
801 struct symbol *symbol;
806 if (name[0] && !name[1]) {
808 case 'y': return &symbol_yes;
809 case 'm': return &symbol_mod;
810 case 'n': return &symbol_no;
813 hash = strhash(name) % SYMBOL_HASHSIZE;
815 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
817 !strcmp(symbol->name, name) &&
818 (flags ? symbol->flags & flags
819 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
822 new_name = xstrdup(name);
828 symbol = xmalloc(sizeof(*symbol));
829 memset(symbol, 0, sizeof(*symbol));
830 symbol->name = new_name;
831 symbol->type = S_UNKNOWN;
832 symbol->flags |= flags;
834 symbol->next = symbol_hash[hash];
835 symbol_hash[hash] = symbol;
840 struct symbol *sym_find(const char *name)
842 struct symbol *symbol = NULL;
848 if (name[0] && !name[1]) {
850 case 'y': return &symbol_yes;
851 case 'm': return &symbol_mod;
852 case 'n': return &symbol_no;
855 hash = strhash(name) % SYMBOL_HASHSIZE;
857 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
859 !strcmp(symbol->name, name) &&
860 !(symbol->flags & SYMBOL_CONST))
867 const char *sym_escape_string_value(const char *in)
874 reslen = strlen(in) + strlen("\"\"") + 1;
878 l = strcspn(p, "\"\\");
888 res = xmalloc(reslen);
895 l = strcspn(p, "\"\\");
903 strncat(res, p++, 1);
915 /* Compare matched symbols as thus:
916 * - first, symbols that match exactly
917 * - then, alphabetical sort
919 static int sym_rel_comp(const void *sym1, const void *sym2)
921 const struct sym_match *s1 = sym1;
922 const struct sym_match *s2 = sym2;
926 * - if matched length on symbol s1 is the length of that symbol,
927 * then this symbol should come first;
928 * - if matched length on symbol s2 is the length of that symbol,
929 * then this symbol should come first.
930 * Note: since the search can be a regexp, both symbols may match
931 * exactly; if this is the case, we can't decide which comes first,
932 * and we fallback to sorting alphabetically.
934 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
935 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
936 if (exact1 && !exact2)
938 if (!exact1 && exact2)
941 /* As a fallback, sort symbols alphabetically */
942 return strcmp(s1->sym->name, s2->sym->name);
945 struct symbol **sym_re_search(const char *pattern)
947 struct symbol *sym, **sym_arr = NULL;
948 struct sym_match *sym_match_arr = NULL;
955 if (strlen(pattern) == 0)
957 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
960 for_all_symbols(i, sym) {
961 if (sym->flags & SYMBOL_CONST || !sym->name)
963 if (regexec(&re, sym->name, 1, match, 0))
968 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
970 goto sym_re_search_free;
974 /* As regexec returned 0, we know we have a match, so
975 * we can use match[0].rm_[se]o without further checks
977 sym_match_arr[cnt].so = match[0].rm_so;
978 sym_match_arr[cnt].eo = match[0].rm_eo;
979 sym_match_arr[cnt++].sym = sym;
982 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
983 sym_arr = malloc((cnt+1) * sizeof(struct symbol *));
985 goto sym_re_search_free;
986 for (i = 0; i < cnt; i++)
987 sym_arr[i] = sym_match_arr[i].sym;
991 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
999 * When we check for recursive dependencies we use a stack to save
1000 * current state so we can print out relevant info to user.
1001 * The entries are located on the call stack so no need to free memory.
1002 * Note insert() remove() must always match to properly clear the stack.
1004 static struct dep_stack {
1005 struct dep_stack *prev, *next;
1007 struct property *prop;
1011 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1013 memset(stack, 0, sizeof(*stack));
1015 check_top->next = stack;
1016 stack->prev = check_top;
1021 static void dep_stack_remove(void)
1023 check_top = check_top->prev;
1025 check_top->next = NULL;
1029 * Called when we have detected a recursive dependency.
1030 * check_top point to the top of the stact so we use
1031 * the ->prev pointer to locate the bottom of the stack.
1033 static void sym_check_print_recursive(struct symbol *last_sym)
1035 struct dep_stack *stack;
1036 struct symbol *sym, *next_sym;
1037 struct menu *menu = NULL;
1038 struct property *prop;
1039 struct dep_stack cv_stack;
1041 if (sym_is_choice_value(last_sym)) {
1042 dep_stack_insert(&cv_stack, last_sym);
1043 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1046 for (stack = check_top; stack != NULL; stack = stack->prev)
1047 if (stack->sym == last_sym)
1050 fprintf(stderr, "unexpected recursive dependency error\n");
1054 for (; stack; stack = stack->next) {
1056 next_sym = stack->next ? stack->next->sym : last_sym;
1059 prop = stack->sym->prop;
1061 /* for choice values find the menu entry (used below) */
1062 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1063 for (prop = sym->prop; prop; prop = prop->next) {
1069 if (stack->sym == last_sym)
1070 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1071 prop->file->name, prop->lineno);
1073 if (sym_is_choice(sym)) {
1074 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1075 menu->file->name, menu->lineno,
1076 sym->name ? sym->name : "<choice>",
1077 next_sym->name ? next_sym->name : "<choice>");
1078 } else if (sym_is_choice_value(sym)) {
1079 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1080 menu->file->name, menu->lineno,
1081 sym->name ? sym->name : "<choice>",
1082 next_sym->name ? next_sym->name : "<choice>");
1083 } else if (stack->expr == &sym->dir_dep.expr) {
1084 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1085 prop->file->name, prop->lineno,
1086 sym->name ? sym->name : "<choice>",
1087 next_sym->name ? next_sym->name : "<choice>");
1088 } else if (stack->expr == &sym->rev_dep.expr) {
1089 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1090 prop->file->name, prop->lineno,
1091 sym->name ? sym->name : "<choice>",
1092 next_sym->name ? next_sym->name : "<choice>");
1093 } else if (stack->expr == &sym->implied.expr) {
1094 fprintf(stderr, "%s:%d:\tsymbol %s is implied by %s\n",
1095 prop->file->name, prop->lineno,
1096 sym->name ? sym->name : "<choice>",
1097 next_sym->name ? next_sym->name : "<choice>");
1098 } else if (stack->expr) {
1099 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1100 prop->file->name, prop->lineno,
1101 sym->name ? sym->name : "<choice>",
1102 prop_get_type_name(prop->type),
1103 next_sym->name ? next_sym->name : "<choice>");
1105 fprintf(stderr, "%s:%d:\tsymbol %s %s is visible depending on %s\n",
1106 prop->file->name, prop->lineno,
1107 sym->name ? sym->name : "<choice>",
1108 prop_get_type_name(prop->type),
1109 next_sym->name ? next_sym->name : "<choice>");
1114 "For a resolution refer to Documentation/kbuild/kconfig-language.rst\n"
1115 "subsection \"Kconfig recursive dependency limitations\"\n"
1118 if (check_top == &cv_stack)
1122 static struct symbol *sym_check_expr_deps(struct expr *e)
1131 sym = sym_check_expr_deps(e->left.expr);
1134 return sym_check_expr_deps(e->right.expr);
1136 return sym_check_expr_deps(e->left.expr);
1143 sym = sym_check_deps(e->left.sym);
1146 return sym_check_deps(e->right.sym);
1148 return sym_check_deps(e->left.sym);
1152 fprintf(stderr, "Oops! How to check %d?\n", e->type);
1156 /* return NULL when dependencies are OK */
1157 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1159 struct symbol *sym2;
1160 struct property *prop;
1161 struct dep_stack stack;
1163 dep_stack_insert(&stack, sym);
1165 stack.expr = &sym->dir_dep.expr;
1166 sym2 = sym_check_expr_deps(sym->dir_dep.expr);
1170 stack.expr = &sym->rev_dep.expr;
1171 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1175 stack.expr = &sym->implied.expr;
1176 sym2 = sym_check_expr_deps(sym->implied.expr);
1182 for (prop = sym->prop; prop; prop = prop->next) {
1183 if (prop->type == P_CHOICE || prop->type == P_SELECT ||
1184 prop->type == P_IMPLY)
1187 sym2 = sym_check_expr_deps(prop->visible.expr);
1190 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1192 stack.expr = &prop->expr;
1193 sym2 = sym_check_expr_deps(prop->expr);
1205 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1207 struct symbol *sym, *sym2;
1208 struct property *prop;
1210 struct dep_stack stack;
1212 dep_stack_insert(&stack, choice);
1214 prop = sym_get_choice_prop(choice);
1215 expr_list_for_each_sym(prop->expr, e, sym)
1216 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1218 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1219 sym2 = sym_check_sym_deps(choice);
1220 choice->flags &= ~SYMBOL_CHECK;
1224 expr_list_for_each_sym(prop->expr, e, sym) {
1225 sym2 = sym_check_sym_deps(sym);
1230 expr_list_for_each_sym(prop->expr, e, sym)
1231 sym->flags &= ~SYMBOL_CHECK;
1233 if (sym2 && sym_is_choice_value(sym2) &&
1234 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1242 struct symbol *sym_check_deps(struct symbol *sym)
1244 struct symbol *sym2;
1245 struct property *prop;
1247 if (sym->flags & SYMBOL_CHECK) {
1248 sym_check_print_recursive(sym);
1251 if (sym->flags & SYMBOL_CHECKED)
1254 if (sym_is_choice_value(sym)) {
1255 struct dep_stack stack;
1257 /* for choice groups start the check with main choice symbol */
1258 dep_stack_insert(&stack, sym);
1259 prop = sym_get_choice_prop(sym);
1260 sym2 = sym_check_deps(prop_get_symbol(prop));
1262 } else if (sym_is_choice(sym)) {
1263 sym2 = sym_check_choice_deps(sym);
1265 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1266 sym2 = sym_check_sym_deps(sym);
1267 sym->flags &= ~SYMBOL_CHECK;
1273 struct symbol *prop_get_symbol(struct property *prop)
1275 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1276 prop->expr->type == E_LIST))
1277 return prop->expr->left.sym;
1281 const char *prop_get_type_name(enum prop_type type)