1 // SPDX-License-Identifier: GPL-2.0
17 struct symbol symbol_yes = {
21 .menus = LIST_HEAD_INIT(symbol_yes.menus),
22 .flags = SYMBOL_CONST|SYMBOL_VALID,
25 struct symbol symbol_mod = {
29 .menus = LIST_HEAD_INIT(symbol_mod.menus),
30 .flags = SYMBOL_CONST|SYMBOL_VALID,
33 struct symbol symbol_no = {
37 .menus = LIST_HEAD_INIT(symbol_no.menus),
38 .flags = SYMBOL_CONST|SYMBOL_VALID,
41 struct symbol *modules_sym;
42 static tristate modules_val;
43 static int sym_warnings;
45 enum symbol_type sym_get_type(const struct symbol *sym)
47 enum symbol_type type = sym->type;
49 if (type == S_TRISTATE && modules_val == no)
54 const char *sym_type_name(enum symbol_type type)
74 * sym_get_prompt_menu - get the menu entry with a prompt
76 * @sym: a symbol pointer
78 * Return: the menu entry with a prompt.
80 struct menu *sym_get_prompt_menu(const struct symbol *sym)
84 list_for_each_entry(m, &sym->menus, link)
92 * sym_get_choice_menu - get the parent choice menu if present
94 * @sym: a symbol pointer
96 * Return: a choice menu if this function is called against a choice member.
98 struct menu *sym_get_choice_menu(const struct symbol *sym)
100 struct menu *menu = NULL;
103 * Choice members must have a prompt. Find a menu entry with a prompt,
104 * and assume it resides inside a choice block.
106 menu = sym_get_prompt_menu(sym);
112 } while (menu && !menu->sym);
114 if (menu && menu->sym && sym_is_choice(menu->sym))
120 static struct property *sym_get_default_prop(struct symbol *sym)
122 struct property *prop;
124 for_all_defaults(sym, prop) {
125 prop->visible.tri = expr_calc_value(prop->visible.expr);
126 if (prop->visible.tri != no)
132 struct property *sym_get_range_prop(struct symbol *sym)
134 struct property *prop;
136 for_all_properties(sym, prop, P_RANGE) {
137 prop->visible.tri = expr_calc_value(prop->visible.expr);
138 if (prop->visible.tri != no)
144 static long long sym_get_range_val(struct symbol *sym, int base)
157 return strtoll(sym->curr.val, NULL, base);
160 static void sym_validate_range(struct symbol *sym)
162 struct property *prop;
163 struct symbol *range_sym;
177 prop = sym_get_range_prop(sym);
180 val = strtoll(sym->curr.val, NULL, base);
181 range_sym = prop->expr->left.sym;
182 val2 = sym_get_range_val(range_sym, base);
184 range_sym = prop->expr->right.sym;
185 val2 = sym_get_range_val(range_sym, base);
189 sym->curr.val = range_sym->curr.val;
192 static void sym_set_changed(struct symbol *sym)
196 list_for_each_entry(menu, &sym->menus, link)
197 menu->flags |= MENU_CHANGED;
200 static void sym_set_all_changed(void)
205 sym_set_changed(sym);
208 static void sym_calc_visibility(struct symbol *sym)
210 struct property *prop;
213 /* any prompt visible? */
215 for_all_prompts(sym, prop) {
216 prop->visible.tri = expr_calc_value(prop->visible.expr);
217 tri = EXPR_OR(tri, prop->visible.tri);
219 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
221 if (sym->visible != tri) {
223 sym_set_changed(sym);
225 if (sym_is_choice_value(sym))
227 /* defaulting to "yes" if no explicit "depends on" are given */
229 if (sym->dir_dep.expr)
230 tri = expr_calc_value(sym->dir_dep.expr);
231 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
233 if (sym->dir_dep.tri != tri) {
234 sym->dir_dep.tri = tri;
235 sym_set_changed(sym);
238 if (sym->rev_dep.expr)
239 tri = expr_calc_value(sym->rev_dep.expr);
240 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
242 if (sym->rev_dep.tri != tri) {
243 sym->rev_dep.tri = tri;
244 sym_set_changed(sym);
247 if (sym->implied.expr)
248 tri = expr_calc_value(sym->implied.expr);
249 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
251 if (sym->implied.tri != tri) {
252 sym->implied.tri = tri;
253 sym_set_changed(sym);
258 * Find the default symbol for a choice.
259 * First try the default values for the choice symbol
260 * Next locate the first visible choice value
261 * Return NULL if none was found
263 struct symbol *sym_choice_default(struct menu *choice)
266 struct symbol *def_sym;
267 struct property *prop;
269 /* any of the defaults visible? */
270 for_all_defaults(choice->sym, prop) {
271 prop->visible.tri = expr_calc_value(prop->visible.expr);
272 if (prop->visible.tri == no)
274 def_sym = prop_get_symbol(prop);
275 if (def_sym->visible != no)
279 /* just get the first visible value */
280 menu_for_each_sub_entry(menu, choice)
281 if (menu->sym && menu->sym->visible != no)
284 /* failed to locate any defaults */
289 * sym_calc_choice - calculate symbol values in a choice
291 * @choice: a menu of the choice
293 * Return: a chosen symbol
295 struct symbol *sym_calc_choice(struct menu *choice)
297 struct symbol *res = NULL;
301 /* Traverse the list of choice members in the priority order. */
302 list_for_each_entry(sym, &choice->choice_members, choice_link) {
303 sym_calc_visibility(sym);
304 if (sym->visible == no)
307 /* The first visible symble with the user value 'y'. */
308 if (sym_has_value(sym) && sym->def[S_DEF_USER].tri == yes) {
315 * If 'y' is not found in the user input, use the default, unless it is
316 * explicitly set to 'n'.
319 res = sym_choice_default(choice);
320 if (res && sym_has_value(res) && res->def[S_DEF_USER].tri == no)
324 /* Still not found. Pick up the first visible, user-unspecified symbol. */
326 menu_for_each_sub_entry(menu, choice) {
329 if (!sym || sym->visible == no || sym_has_value(sym))
338 * Still not found. Traverse the linked list in the _reverse_ order to
339 * pick up the least prioritized 'n'.
342 list_for_each_entry_reverse(sym, &choice->choice_members,
344 if (sym->visible == no)
352 menu_for_each_sub_entry(menu, choice) {
357 if (!sym || sym->visible == no)
360 val = sym == res ? yes : no;
362 if (sym->curr.tri != val)
363 sym_set_changed(sym);
366 sym->flags |= SYMBOL_VALID | SYMBOL_WRITE;
372 static void sym_warn_unmet_dep(const struct symbol *sym)
374 struct gstr gs = str_new();
377 "\nWARNING: unmet direct dependencies detected for %s\n",
380 " Depends on [%c]: ",
381 sym->dir_dep.tri == mod ? 'm' : 'n');
382 expr_gstr_print(sym->dir_dep.expr, &gs);
383 str_printf(&gs, "\n");
385 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, yes,
386 " Selected by [y]:\n");
387 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, mod,
388 " Selected by [m]:\n");
390 fputs(str_get(&gs), stderr);
394 bool sym_dep_errors(void)
397 return getenv("KCONFIG_WERROR");
401 void sym_calc_value(struct symbol *sym)
403 struct symbol_value newval, oldval;
404 struct property *prop;
405 struct menu *choice_menu;
410 if (sym->flags & SYMBOL_VALID)
413 sym->flags |= SYMBOL_VALID;
434 sym->curr.val = sym->name;
438 sym->flags &= ~SYMBOL_WRITE;
440 sym_calc_visibility(sym);
442 if (sym->visible != no)
443 sym->flags |= SYMBOL_WRITE;
445 /* set default if recursively called */
448 switch (sym_get_type(sym)) {
451 choice_menu = sym_get_choice_menu(sym);
454 sym_calc_choice(choice_menu);
455 newval.tri = sym->curr.tri;
457 if (sym->visible != no) {
458 /* if the symbol is visible use the user value
459 * if available, otherwise try the default value
461 if (sym_has_value(sym)) {
462 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
467 if (sym->rev_dep.tri != no)
468 sym->flags |= SYMBOL_WRITE;
469 if (!sym_is_choice(sym)) {
470 prop = sym_get_default_prop(sym);
472 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
474 if (newval.tri != no)
475 sym->flags |= SYMBOL_WRITE;
477 if (sym->implied.tri != no) {
478 sym->flags |= SYMBOL_WRITE;
479 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
480 newval.tri = EXPR_AND(newval.tri,
485 if (sym->dir_dep.tri < sym->rev_dep.tri)
486 sym_warn_unmet_dep(sym);
487 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
489 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
495 if (sym->visible != no && sym_has_value(sym)) {
496 newval.val = sym->def[S_DEF_USER].val;
499 prop = sym_get_default_prop(sym);
501 struct symbol *ds = prop_get_symbol(prop);
503 sym->flags |= SYMBOL_WRITE;
505 newval.val = ds->curr.val;
514 sym_validate_range(sym);
516 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
517 sym_set_changed(sym);
518 if (modules_sym == sym) {
519 sym_set_all_changed();
520 modules_val = modules_sym->curr.tri;
524 if (sym_is_choice(sym))
525 sym->flags &= ~SYMBOL_WRITE;
528 void sym_clear_all_valid(void)
533 sym->flags &= ~SYMBOL_VALID;
534 expr_invalidate_all();
535 conf_set_changed(true);
536 sym_calc_value(modules_sym);
539 bool sym_tristate_within_range(const struct symbol *sym, tristate val)
541 int type = sym_get_type(sym);
543 if (sym->visible == no)
546 if (type != S_BOOLEAN && type != S_TRISTATE)
549 if (type == S_BOOLEAN && val == mod)
551 if (sym->visible <= sym->rev_dep.tri)
553 return val >= sym->rev_dep.tri && val <= sym->visible;
556 bool sym_set_tristate_value(struct symbol *sym, tristate val)
558 tristate oldval = sym_get_tristate_value(sym);
560 if (!sym_tristate_within_range(sym, val))
563 if (!(sym->flags & SYMBOL_DEF_USER) || sym->def[S_DEF_USER].tri != val) {
564 sym->def[S_DEF_USER].tri = val;
565 sym->flags |= SYMBOL_DEF_USER;
566 sym_set_changed(sym);
570 sym_clear_all_valid();
576 * choice_set_value - set the user input to a choice
578 * @choice: menu entry for the choice
579 * @sym: selected symbol
581 void choice_set_value(struct menu *choice, struct symbol *sym)
584 bool changed = false;
586 menu_for_each_sub_entry(menu, choice) {
592 if (menu->sym->visible == no)
595 val = menu->sym == sym ? yes : no;
597 if (menu->sym->curr.tri != val)
600 menu->sym->def[S_DEF_USER].tri = val;
601 menu->sym->flags |= SYMBOL_DEF_USER;
604 * Now, the user has explicitly enabled or disabled this symbol,
605 * it should be given the highest priority. We are possibly
606 * setting multiple symbols to 'n', where the first symbol is
607 * given the least prioritized 'n'. This works well when the
608 * choice block ends up with selecting 'n' symbol.
609 * (see sym_calc_choice())
611 list_move(&menu->sym->choice_link, &choice->choice_members);
615 sym_clear_all_valid();
618 tristate sym_toggle_tristate_value(struct symbol *sym)
621 tristate oldval, newval;
623 choice = sym_get_choice_menu(sym);
625 choice_set_value(choice, sym);
629 oldval = newval = sym_get_tristate_value(sym);
642 if (sym_set_tristate_value(sym, newval))
644 } while (oldval != newval);
648 bool sym_string_valid(struct symbol *sym, const char *str)
661 if (ch == '0' && *str != 0)
663 while ((ch = *str++)) {
669 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
675 } while ((ch = *str++));
691 bool sym_string_within_range(struct symbol *sym, const char *str)
693 struct property *prop;
698 return sym_string_valid(sym, str);
700 if (!sym_string_valid(sym, str))
702 prop = sym_get_range_prop(sym);
705 val = strtoll(str, NULL, 10);
706 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
707 val <= sym_get_range_val(prop->expr->right.sym, 10);
709 if (!sym_string_valid(sym, str))
711 prop = sym_get_range_prop(sym);
714 val = strtoll(str, NULL, 16);
715 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
716 val <= sym_get_range_val(prop->expr->right.sym, 16);
721 return sym_tristate_within_range(sym, yes);
723 return sym_tristate_within_range(sym, mod);
725 return sym_tristate_within_range(sym, no);
733 bool sym_set_string_value(struct symbol *sym, const char *newval)
744 return sym_set_tristate_value(sym, yes);
746 return sym_set_tristate_value(sym, mod);
748 return sym_set_tristate_value(sym, no);
755 if (!sym_string_within_range(sym, newval))
758 if (!(sym->flags & SYMBOL_DEF_USER)) {
759 sym->flags |= SYMBOL_DEF_USER;
760 sym_set_changed(sym);
763 oldval = sym->def[S_DEF_USER].val;
764 size = strlen(newval) + 1;
765 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
767 sym->def[S_DEF_USER].val = val = xmalloc(size);
770 } else if (!oldval || strcmp(oldval, newval))
771 sym->def[S_DEF_USER].val = val = xmalloc(size);
776 free((void *)oldval);
777 sym_clear_all_valid();
783 * Find the default value associated to a symbol.
784 * For tristate symbol handle the modules=n case
785 * in which case "m" becomes "y".
786 * If the symbol does not have any default then fallback
787 * to the fixed default values.
789 const char *sym_get_string_default(struct symbol *sym)
791 struct property *prop;
793 const char *str = "";
796 sym_calc_visibility(sym);
797 sym_calc_value(modules_sym);
798 val = symbol_no.curr.tri;
800 /* If symbol has a default value look it up */
801 prop = sym_get_default_prop(sym);
806 /* The visibility may limit the value from yes => mod */
807 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
811 * The following fails to handle the situation
812 * where a default value is further limited by
815 ds = prop_get_symbol(prop);
818 str = (const char *)ds->curr.val;
823 /* Handle select statements */
824 val = EXPR_OR(val, sym->rev_dep.tri);
826 /* transpose mod to yes if modules are not enabled */
828 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
831 /* transpose mod to yes if type is bool */
832 if (sym->type == S_BOOLEAN && val == mod)
835 /* adjust the default value if this symbol is implied by another */
836 if (val < sym->implied.tri)
837 val = sym->implied.tri;
844 case mod: return "m";
845 case yes: return "y";
861 const char *sym_get_string_value(struct symbol *sym)
868 val = sym_get_tristate_value(sym);
881 return (const char *)sym->curr.val;
884 bool sym_is_changeable(const struct symbol *sym)
886 return !sym_is_choice(sym) && sym->visible > sym->rev_dep.tri;
889 bool sym_is_choice_value(const struct symbol *sym)
891 return !list_empty(&sym->choice_link);
894 HASHTABLE_DEFINE(sym_hashtable, SYMBOL_HASHSIZE);
896 struct symbol *sym_lookup(const char *name, int flags)
898 struct symbol *symbol;
903 if (name[0] && !name[1]) {
905 case 'y': return &symbol_yes;
906 case 'm': return &symbol_mod;
907 case 'n': return &symbol_no;
910 hash = hash_str(name);
912 hash_for_each_possible(sym_hashtable, symbol, node, hash) {
914 !strcmp(symbol->name, name) &&
915 (flags ? symbol->flags & flags
916 : !(symbol->flags & SYMBOL_CONST)))
919 new_name = xstrdup(name);
925 symbol = xmalloc(sizeof(*symbol));
926 memset(symbol, 0, sizeof(*symbol));
927 symbol->name = new_name;
928 symbol->type = S_UNKNOWN;
929 symbol->flags = flags;
930 INIT_LIST_HEAD(&symbol->menus);
931 INIT_LIST_HEAD(&symbol->choice_link);
933 hash_add(sym_hashtable, &symbol->node, hash);
938 struct symbol *sym_find(const char *name)
940 struct symbol *symbol = NULL;
946 if (name[0] && !name[1]) {
948 case 'y': return &symbol_yes;
949 case 'm': return &symbol_mod;
950 case 'n': return &symbol_no;
953 hash = hash_str(name);
955 hash_for_each_possible(sym_hashtable, symbol, node, hash) {
957 !strcmp(symbol->name, name) &&
958 !(symbol->flags & SYMBOL_CONST))
970 /* Compare matched symbols as thus:
971 * - first, symbols that match exactly
972 * - then, alphabetical sort
974 static int sym_rel_comp(const void *sym1, const void *sym2)
976 const struct sym_match *s1 = sym1;
977 const struct sym_match *s2 = sym2;
981 * - if matched length on symbol s1 is the length of that symbol,
982 * then this symbol should come first;
983 * - if matched length on symbol s2 is the length of that symbol,
984 * then this symbol should come first.
985 * Note: since the search can be a regexp, both symbols may match
986 * exactly; if this is the case, we can't decide which comes first,
987 * and we fallback to sorting alphabetically.
989 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
990 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
991 if (exact1 && !exact2)
993 if (!exact1 && exact2)
996 /* As a fallback, sort symbols alphabetically */
997 return strcmp(s1->sym->name, s2->sym->name);
1000 struct symbol **sym_re_search(const char *pattern)
1002 struct symbol *sym, **sym_arr = NULL;
1003 struct sym_match *sym_match_arr = NULL;
1006 regmatch_t match[1];
1010 if (strlen(pattern) == 0)
1012 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1015 for_all_symbols(sym) {
1016 if (sym->flags & SYMBOL_CONST || !sym->name)
1018 if (regexec(&re, sym->name, 1, match, 0))
1023 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
1025 goto sym_re_search_free;
1026 sym_match_arr = tmp;
1028 sym_calc_value(sym);
1029 /* As regexec returned 0, we know we have a match, so
1030 * we can use match[0].rm_[se]o without further checks
1032 sym_match_arr[cnt].so = match[0].rm_so;
1033 sym_match_arr[cnt].eo = match[0].rm_eo;
1034 sym_match_arr[cnt++].sym = sym;
1036 if (sym_match_arr) {
1037 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
1038 sym_arr = malloc((cnt+1) * sizeof(struct symbol *));
1040 goto sym_re_search_free;
1041 for (i = 0; i < cnt; i++)
1042 sym_arr[i] = sym_match_arr[i].sym;
1043 sym_arr[cnt] = NULL;
1046 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1047 free(sym_match_arr);
1054 * When we check for recursive dependencies we use a stack to save
1055 * current state so we can print out relevant info to user.
1056 * The entries are located on the call stack so no need to free memory.
1057 * Note insert() remove() must always match to properly clear the stack.
1059 static struct dep_stack {
1060 struct dep_stack *prev, *next;
1062 struct property *prop;
1066 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1068 memset(stack, 0, sizeof(*stack));
1070 check_top->next = stack;
1071 stack->prev = check_top;
1076 static void dep_stack_remove(void)
1078 check_top = check_top->prev;
1080 check_top->next = NULL;
1084 * Called when we have detected a recursive dependency.
1085 * check_top point to the top of the stact so we use
1086 * the ->prev pointer to locate the bottom of the stack.
1088 static void sym_check_print_recursive(struct symbol *last_sym)
1090 struct dep_stack *stack;
1091 struct symbol *sym, *next_sym;
1092 struct menu *choice;
1093 struct dep_stack cv_stack;
1094 enum prop_type type;
1096 choice = sym_get_choice_menu(last_sym);
1098 dep_stack_insert(&cv_stack, last_sym);
1099 last_sym = choice->sym;
1102 for (stack = check_top; stack != NULL; stack = stack->prev)
1103 if (stack->sym == last_sym)
1106 fprintf(stderr, "unexpected recursive dependency error\n");
1110 for (; stack; stack = stack->next) {
1112 next_sym = stack->next ? stack->next->sym : last_sym;
1113 type = stack->prop ? stack->prop->type : P_UNKNOWN;
1115 if (stack->sym == last_sym)
1116 fprintf(stderr, "error: recursive dependency detected!\n");
1118 if (sym_is_choice(next_sym)) {
1119 choice = list_first_entry(&next_sym->menus, struct menu, link);
1121 fprintf(stderr, "\tsymbol %s is part of choice block at %s:%d\n",
1122 sym->name ? sym->name : "<choice>",
1123 choice->filename, choice->lineno);
1124 } else if (stack->expr == &sym->dir_dep.expr) {
1125 fprintf(stderr, "\tsymbol %s depends on %s\n",
1126 sym->name ? sym->name : "<choice>",
1128 } else if (stack->expr == &sym->rev_dep.expr) {
1129 fprintf(stderr, "\tsymbol %s is selected by %s\n",
1130 sym->name, next_sym->name);
1131 } else if (stack->expr == &sym->implied.expr) {
1132 fprintf(stderr, "\tsymbol %s is implied by %s\n",
1133 sym->name, next_sym->name);
1134 } else if (stack->expr) {
1135 fprintf(stderr, "\tsymbol %s %s value contains %s\n",
1136 sym->name ? sym->name : "<choice>",
1137 prop_get_type_name(type),
1140 fprintf(stderr, "\tsymbol %s %s is visible depending on %s\n",
1141 sym->name ? sym->name : "<choice>",
1142 prop_get_type_name(type),
1148 "For a resolution refer to Documentation/kbuild/kconfig-language.rst\n"
1149 "subsection \"Kconfig recursive dependency limitations\"\n"
1152 if (check_top == &cv_stack)
1156 static struct symbol *sym_check_expr_deps(const struct expr *e)
1165 sym = sym_check_expr_deps(e->left.expr);
1168 return sym_check_expr_deps(e->right.expr);
1170 return sym_check_expr_deps(e->left.expr);
1177 sym = sym_check_deps(e->left.sym);
1180 return sym_check_deps(e->right.sym);
1182 return sym_check_deps(e->left.sym);
1186 fprintf(stderr, "Oops! How to check %d?\n", e->type);
1190 /* return NULL when dependencies are OK */
1191 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1193 struct symbol *sym2;
1194 struct property *prop;
1195 struct dep_stack stack;
1197 dep_stack_insert(&stack, sym);
1199 stack.expr = &sym->dir_dep.expr;
1200 sym2 = sym_check_expr_deps(sym->dir_dep.expr);
1204 stack.expr = &sym->rev_dep.expr;
1205 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1209 stack.expr = &sym->implied.expr;
1210 sym2 = sym_check_expr_deps(sym->implied.expr);
1216 for (prop = sym->prop; prop; prop = prop->next) {
1217 if (prop->type == P_SELECT || prop->type == P_IMPLY)
1220 sym2 = sym_check_expr_deps(prop->visible.expr);
1223 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1225 stack.expr = &prop->expr;
1226 sym2 = sym_check_expr_deps(prop->expr);
1238 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1240 struct menu *choice_menu, *menu;
1241 struct symbol *sym2;
1242 struct dep_stack stack;
1244 dep_stack_insert(&stack, choice);
1246 choice_menu = list_first_entry(&choice->menus, struct menu, link);
1248 menu_for_each_sub_entry(menu, choice_menu) {
1250 menu->sym->flags |= SYMBOL_CHECK | SYMBOL_CHECKED;
1253 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1254 sym2 = sym_check_sym_deps(choice);
1255 choice->flags &= ~SYMBOL_CHECK;
1259 menu_for_each_sub_entry(menu, choice_menu) {
1262 sym2 = sym_check_sym_deps(menu->sym);
1267 menu_for_each_sub_entry(menu, choice_menu)
1269 menu->sym->flags &= ~SYMBOL_CHECK;
1272 struct menu *choice_menu2;
1274 choice_menu2 = sym_get_choice_menu(sym2);
1275 if (choice_menu2 == choice_menu)
1284 struct symbol *sym_check_deps(struct symbol *sym)
1286 struct menu *choice;
1287 struct symbol *sym2;
1289 if (sym->flags & SYMBOL_CHECK) {
1290 sym_check_print_recursive(sym);
1293 if (sym->flags & SYMBOL_CHECKED)
1296 choice = sym_get_choice_menu(sym);
1298 struct dep_stack stack;
1300 /* for choice groups start the check with main choice symbol */
1301 dep_stack_insert(&stack, sym);
1302 sym2 = sym_check_deps(choice->sym);
1304 } else if (sym_is_choice(sym)) {
1305 sym2 = sym_check_choice_deps(sym);
1307 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1308 sym2 = sym_check_sym_deps(sym);
1309 sym->flags &= ~SYMBOL_CHECK;
1315 struct symbol *prop_get_symbol(const struct property *prop)
1317 if (prop->expr && prop->expr->type == E_SYMBOL)
1318 return prop->expr->left.sym;
1322 const char *prop_get_type_name(enum prop_type type)