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,
20 struct symbol symbol_mod = {
23 .flags = SYMBOL_CONST|SYMBOL_VALID,
26 struct symbol symbol_no = {
29 .flags = SYMBOL_CONST|SYMBOL_VALID,
32 static struct symbol symbol_empty = {
35 .flags = SYMBOL_VALID,
38 struct symbol *sym_defconfig_list;
39 struct symbol *modules_sym;
40 static tristate modules_val;
42 enum symbol_type sym_get_type(struct symbol *sym)
44 enum symbol_type type = sym->type;
46 if (type == S_TRISTATE) {
47 if (sym_is_choice_value(sym) && sym->visible == yes)
49 else if (modules_val == no)
55 const char *sym_type_name(enum symbol_type type)
74 struct property *sym_get_choice_prop(struct symbol *sym)
76 struct property *prop;
78 for_all_choices(sym, prop)
83 static struct property *sym_get_default_prop(struct symbol *sym)
85 struct property *prop;
87 for_all_defaults(sym, prop) {
88 prop->visible.tri = expr_calc_value(prop->visible.expr);
89 if (prop->visible.tri != no)
95 struct property *sym_get_range_prop(struct symbol *sym)
97 struct property *prop;
99 for_all_properties(sym, prop, P_RANGE) {
100 prop->visible.tri = expr_calc_value(prop->visible.expr);
101 if (prop->visible.tri != no)
107 static long long sym_get_range_val(struct symbol *sym, int base)
120 return strtoll(sym->curr.val, NULL, base);
123 static void sym_validate_range(struct symbol *sym)
125 struct property *prop;
140 prop = sym_get_range_prop(sym);
143 val = strtoll(sym->curr.val, NULL, base);
144 val2 = sym_get_range_val(prop->expr->left.sym, base);
146 val2 = sym_get_range_val(prop->expr->right.sym, base);
150 if (sym->type == S_INT)
151 sprintf(str, "%lld", val2);
153 sprintf(str, "0x%llx", val2);
154 sym->curr.val = xstrdup(str);
157 static void sym_set_changed(struct symbol *sym)
159 struct property *prop;
161 sym->flags |= SYMBOL_CHANGED;
162 for (prop = sym->prop; prop; prop = prop->next) {
164 prop->menu->flags |= MENU_CHANGED;
168 static void sym_set_all_changed(void)
173 for_all_symbols(i, sym)
174 sym_set_changed(sym);
177 static void sym_calc_visibility(struct symbol *sym)
179 struct property *prop;
180 struct symbol *choice_sym = NULL;
183 /* any prompt visible? */
186 if (sym_is_choice_value(sym))
187 choice_sym = prop_get_symbol(sym_get_choice_prop(sym));
189 for_all_prompts(sym, prop) {
190 prop->visible.tri = expr_calc_value(prop->visible.expr);
192 * Tristate choice_values with visibility 'mod' are
193 * not visible if the corresponding choice's value is
196 if (choice_sym && sym->type == S_TRISTATE &&
197 prop->visible.tri == mod && choice_sym->curr.tri == yes)
198 prop->visible.tri = no;
200 tri = EXPR_OR(tri, prop->visible.tri);
202 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
204 if (sym->visible != tri) {
206 sym_set_changed(sym);
208 if (sym_is_choice_value(sym))
210 /* defaulting to "yes" if no explicit "depends on" are given */
212 if (sym->dir_dep.expr)
213 tri = expr_calc_value(sym->dir_dep.expr);
214 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
216 if (sym->dir_dep.tri != tri) {
217 sym->dir_dep.tri = tri;
218 sym_set_changed(sym);
221 if (sym->rev_dep.expr)
222 tri = expr_calc_value(sym->rev_dep.expr);
223 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
225 if (sym->rev_dep.tri != tri) {
226 sym->rev_dep.tri = tri;
227 sym_set_changed(sym);
230 if (sym->implied.expr)
231 tri = expr_calc_value(sym->implied.expr);
232 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
234 if (sym->implied.tri != tri) {
235 sym->implied.tri = tri;
236 sym_set_changed(sym);
241 * Find the default symbol for a choice.
242 * First try the default values for the choice symbol
243 * Next locate the first visible choice value
244 * Return NULL if none was found
246 struct symbol *sym_choice_default(struct symbol *sym)
248 struct symbol *def_sym;
249 struct property *prop;
252 /* any of the defaults visible? */
253 for_all_defaults(sym, prop) {
254 prop->visible.tri = expr_calc_value(prop->visible.expr);
255 if (prop->visible.tri == no)
257 def_sym = prop_get_symbol(prop);
258 if (def_sym->visible != no)
262 /* just get the first visible value */
263 prop = sym_get_choice_prop(sym);
264 expr_list_for_each_sym(prop->expr, e, def_sym)
265 if (def_sym->visible != no)
268 /* failed to locate any defaults */
272 static struct symbol *sym_calc_choice(struct symbol *sym)
274 struct symbol *def_sym;
275 struct property *prop;
279 /* first calculate all choice values' visibilities */
281 prop = sym_get_choice_prop(sym);
282 expr_list_for_each_sym(prop->expr, e, def_sym) {
283 sym_calc_visibility(def_sym);
284 if (def_sym->visible != no)
285 flags &= def_sym->flags;
288 sym->flags &= flags | ~SYMBOL_DEF_USER;
290 /* is the user choice visible? */
291 def_sym = sym->def[S_DEF_USER].val;
292 if (def_sym && def_sym->visible != no)
295 def_sym = sym_choice_default(sym);
298 /* no choice? reset tristate value */
304 static void sym_warn_unmet_dep(struct symbol *sym)
306 struct gstr gs = str_new();
309 "\nWARNING: unmet direct dependencies detected for %s\n",
312 " Depends on [%c]: ",
313 sym->dir_dep.tri == mod ? 'm' : 'n');
314 expr_gstr_print(sym->dir_dep.expr, &gs);
315 str_printf(&gs, "\n");
317 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, yes,
318 " Selected by [y]:\n");
319 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, mod,
320 " Selected by [m]:\n");
322 fputs(str_get(&gs), stderr);
325 void sym_calc_value(struct symbol *sym)
327 struct symbol_value newval, oldval;
328 struct property *prop;
334 if (sym->flags & SYMBOL_VALID)
337 if (sym_is_choice_value(sym) &&
338 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
339 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
340 prop = sym_get_choice_prop(sym);
341 sym_calc_value(prop_get_symbol(prop));
344 sym->flags |= SYMBOL_VALID;
352 newval = symbol_empty.curr;
356 newval = symbol_no.curr;
359 sym->curr.val = sym->name;
363 sym->flags &= ~SYMBOL_WRITE;
365 sym_calc_visibility(sym);
367 if (sym->visible != no)
368 sym->flags |= SYMBOL_WRITE;
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 if (sym_has_value(sym)) {
385 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
390 if (sym->rev_dep.tri != no)
391 sym->flags |= SYMBOL_WRITE;
392 if (!sym_is_choice(sym)) {
393 prop = sym_get_default_prop(sym);
395 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
397 if (newval.tri != no)
398 sym->flags |= SYMBOL_WRITE;
400 if (sym->implied.tri != no) {
401 sym->flags |= SYMBOL_WRITE;
402 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
403 newval.tri = EXPR_AND(newval.tri,
408 if (sym->dir_dep.tri < sym->rev_dep.tri)
409 sym_warn_unmet_dep(sym);
410 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
412 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
418 if (sym->visible != no && sym_has_value(sym)) {
419 newval.val = sym->def[S_DEF_USER].val;
422 prop = sym_get_default_prop(sym);
424 struct symbol *ds = prop_get_symbol(prop);
426 sym->flags |= SYMBOL_WRITE;
428 newval.val = ds->curr.val;
437 if (sym_is_choice(sym) && newval.tri == yes)
438 sym->curr.val = sym_calc_choice(sym);
439 sym_validate_range(sym);
441 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
442 sym_set_changed(sym);
443 if (modules_sym == sym) {
444 sym_set_all_changed();
445 modules_val = modules_sym->curr.tri;
449 if (sym_is_choice(sym)) {
450 struct symbol *choice_sym;
452 prop = sym_get_choice_prop(sym);
453 expr_list_for_each_sym(prop->expr, e, choice_sym) {
454 if ((sym->flags & SYMBOL_WRITE) &&
455 choice_sym->visible != no)
456 choice_sym->flags |= SYMBOL_WRITE;
457 if (sym->flags & SYMBOL_CHANGED)
458 sym_set_changed(choice_sym);
462 if (sym->flags & SYMBOL_NO_WRITE)
463 sym->flags &= ~SYMBOL_WRITE;
465 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
466 set_all_choice_values(sym);
469 void sym_clear_all_valid(void)
474 for_all_symbols(i, sym)
475 sym->flags &= ~SYMBOL_VALID;
476 sym_add_change_count(1);
477 sym_calc_value(modules_sym);
480 bool sym_tristate_within_range(struct symbol *sym, tristate val)
482 int type = sym_get_type(sym);
484 if (sym->visible == no)
487 if (type != S_BOOLEAN && type != S_TRISTATE)
490 if (type == S_BOOLEAN && val == mod)
492 if (sym->visible <= sym->rev_dep.tri)
494 if (sym_is_choice_value(sym) && sym->visible == yes)
496 return val >= sym->rev_dep.tri && val <= sym->visible;
499 bool sym_set_tristate_value(struct symbol *sym, tristate val)
501 tristate oldval = sym_get_tristate_value(sym);
503 if (oldval != val && !sym_tristate_within_range(sym, val))
506 if (!(sym->flags & SYMBOL_DEF_USER)) {
507 sym->flags |= SYMBOL_DEF_USER;
508 sym_set_changed(sym);
511 * setting a choice value also resets the new flag of the choice
512 * symbol and all other choice values.
514 if (sym_is_choice_value(sym) && val == yes) {
515 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
516 struct property *prop;
519 cs->def[S_DEF_USER].val = sym;
520 cs->flags |= SYMBOL_DEF_USER;
521 prop = sym_get_choice_prop(cs);
522 for (e = prop->expr; e; e = e->left.expr) {
523 if (e->right.sym->visible != no)
524 e->right.sym->flags |= SYMBOL_DEF_USER;
528 sym->def[S_DEF_USER].tri = val;
530 sym_clear_all_valid();
535 tristate sym_toggle_tristate_value(struct symbol *sym)
537 tristate oldval, newval;
539 oldval = newval = sym_get_tristate_value(sym);
552 if (sym_set_tristate_value(sym, newval))
554 } while (oldval != newval);
558 bool sym_string_valid(struct symbol *sym, const char *str)
571 if (ch == '0' && *str != 0)
573 while ((ch = *str++)) {
579 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
585 } while ((ch = *str++));
601 bool sym_string_within_range(struct symbol *sym, const char *str)
603 struct property *prop;
608 return sym_string_valid(sym, str);
610 if (!sym_string_valid(sym, str))
612 prop = sym_get_range_prop(sym);
615 val = strtoll(str, NULL, 10);
616 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
617 val <= sym_get_range_val(prop->expr->right.sym, 10);
619 if (!sym_string_valid(sym, str))
621 prop = sym_get_range_prop(sym);
624 val = strtoll(str, NULL, 16);
625 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
626 val <= sym_get_range_val(prop->expr->right.sym, 16);
631 return sym_tristate_within_range(sym, yes);
633 return sym_tristate_within_range(sym, mod);
635 return sym_tristate_within_range(sym, no);
643 bool sym_set_string_value(struct symbol *sym, const char *newval)
654 return sym_set_tristate_value(sym, yes);
656 return sym_set_tristate_value(sym, mod);
658 return sym_set_tristate_value(sym, no);
665 if (!sym_string_within_range(sym, newval))
668 if (!(sym->flags & SYMBOL_DEF_USER)) {
669 sym->flags |= SYMBOL_DEF_USER;
670 sym_set_changed(sym);
673 oldval = sym->def[S_DEF_USER].val;
674 size = strlen(newval) + 1;
675 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
677 sym->def[S_DEF_USER].val = val = xmalloc(size);
680 } else if (!oldval || strcmp(oldval, newval))
681 sym->def[S_DEF_USER].val = val = xmalloc(size);
686 free((void *)oldval);
687 sym_clear_all_valid();
693 * Find the default value associated to a symbol.
694 * For tristate symbol handle the modules=n case
695 * in which case "m" becomes "y".
696 * If the symbol does not have any default then fallback
697 * to the fixed default values.
699 const char *sym_get_string_default(struct symbol *sym)
701 struct property *prop;
706 sym_calc_visibility(sym);
707 sym_calc_value(modules_sym);
708 val = symbol_no.curr.tri;
709 str = symbol_empty.curr.val;
711 /* If symbol has a default value look it up */
712 prop = sym_get_default_prop(sym);
717 /* The visibility may limit the value from yes => mod */
718 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
722 * The following fails to handle the situation
723 * where a default value is further limited by
726 ds = prop_get_symbol(prop);
729 str = (const char *)ds->curr.val;
734 /* Handle select statements */
735 val = EXPR_OR(val, sym->rev_dep.tri);
737 /* transpose mod to yes if modules are not enabled */
739 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
742 /* transpose mod to yes if type is bool */
743 if (sym->type == S_BOOLEAN && val == mod)
746 /* adjust the default value if this symbol is implied by another */
747 if (val < sym->implied.tri)
748 val = sym->implied.tri;
755 case mod: return "m";
756 case yes: return "y";
769 const char *sym_get_string_value(struct symbol *sym)
776 val = sym_get_tristate_value(sym);
781 sym_calc_value(modules_sym);
782 return (modules_sym->curr.tri == no) ? "n" : "m";
790 return (const char *)sym->curr.val;
793 bool sym_is_changeable(struct symbol *sym)
795 return sym->visible > sym->rev_dep.tri;
798 static unsigned strhash(const char *s)
801 unsigned hash = 2166136261U;
803 hash = (hash ^ *s) * 0x01000193;
807 struct symbol *sym_lookup(const char *name, int flags)
809 struct symbol *symbol;
814 if (name[0] && !name[1]) {
816 case 'y': return &symbol_yes;
817 case 'm': return &symbol_mod;
818 case 'n': return &symbol_no;
821 hash = strhash(name) % SYMBOL_HASHSIZE;
823 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
825 !strcmp(symbol->name, name) &&
826 (flags ? symbol->flags & flags
827 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
830 new_name = xstrdup(name);
836 symbol = xmalloc(sizeof(*symbol));
837 memset(symbol, 0, sizeof(*symbol));
838 symbol->name = new_name;
839 symbol->type = S_UNKNOWN;
840 symbol->flags = flags;
842 symbol->next = symbol_hash[hash];
843 symbol_hash[hash] = symbol;
848 struct symbol *sym_find(const char *name)
850 struct symbol *symbol = NULL;
856 if (name[0] && !name[1]) {
858 case 'y': return &symbol_yes;
859 case 'm': return &symbol_mod;
860 case 'n': return &symbol_no;
863 hash = strhash(name) % SYMBOL_HASHSIZE;
865 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
867 !strcmp(symbol->name, name) &&
868 !(symbol->flags & SYMBOL_CONST))
875 const char *sym_escape_string_value(const char *in)
882 reslen = strlen(in) + strlen("\"\"") + 1;
886 l = strcspn(p, "\"\\");
896 res = xmalloc(reslen);
903 l = strcspn(p, "\"\\");
911 strncat(res, p++, 1);
923 /* Compare matched symbols as thus:
924 * - first, symbols that match exactly
925 * - then, alphabetical sort
927 static int sym_rel_comp(const void *sym1, const void *sym2)
929 const struct sym_match *s1 = sym1;
930 const struct sym_match *s2 = sym2;
934 * - if matched length on symbol s1 is the length of that symbol,
935 * then this symbol should come first;
936 * - if matched length on symbol s2 is the length of that symbol,
937 * then this symbol should come first.
938 * Note: since the search can be a regexp, both symbols may match
939 * exactly; if this is the case, we can't decide which comes first,
940 * and we fallback to sorting alphabetically.
942 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
943 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
944 if (exact1 && !exact2)
946 if (!exact1 && exact2)
949 /* As a fallback, sort symbols alphabetically */
950 return strcmp(s1->sym->name, s2->sym->name);
953 struct symbol **sym_re_search(const char *pattern)
955 struct symbol *sym, **sym_arr = NULL;
956 struct sym_match *sym_match_arr = NULL;
963 if (strlen(pattern) == 0)
965 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
968 for_all_symbols(i, sym) {
969 if (sym->flags & SYMBOL_CONST || !sym->name)
971 if (regexec(&re, sym->name, 1, match, 0))
976 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
978 goto sym_re_search_free;
982 /* As regexec returned 0, we know we have a match, so
983 * we can use match[0].rm_[se]o without further checks
985 sym_match_arr[cnt].so = match[0].rm_so;
986 sym_match_arr[cnt].eo = match[0].rm_eo;
987 sym_match_arr[cnt++].sym = sym;
990 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
991 sym_arr = malloc((cnt+1) * sizeof(struct symbol *));
993 goto sym_re_search_free;
994 for (i = 0; i < cnt; i++)
995 sym_arr[i] = sym_match_arr[i].sym;
999 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1000 free(sym_match_arr);
1007 * When we check for recursive dependencies we use a stack to save
1008 * current state so we can print out relevant info to user.
1009 * The entries are located on the call stack so no need to free memory.
1010 * Note insert() remove() must always match to properly clear the stack.
1012 static struct dep_stack {
1013 struct dep_stack *prev, *next;
1015 struct property *prop;
1019 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1021 memset(stack, 0, sizeof(*stack));
1023 check_top->next = stack;
1024 stack->prev = check_top;
1029 static void dep_stack_remove(void)
1031 check_top = check_top->prev;
1033 check_top->next = NULL;
1037 * Called when we have detected a recursive dependency.
1038 * check_top point to the top of the stact so we use
1039 * the ->prev pointer to locate the bottom of the stack.
1041 static void sym_check_print_recursive(struct symbol *last_sym)
1043 struct dep_stack *stack;
1044 struct symbol *sym, *next_sym;
1045 struct menu *menu = NULL;
1046 struct property *prop;
1047 struct dep_stack cv_stack;
1049 if (sym_is_choice_value(last_sym)) {
1050 dep_stack_insert(&cv_stack, last_sym);
1051 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1054 for (stack = check_top; stack != NULL; stack = stack->prev)
1055 if (stack->sym == last_sym)
1058 fprintf(stderr, "unexpected recursive dependency error\n");
1062 for (; stack; stack = stack->next) {
1064 next_sym = stack->next ? stack->next->sym : last_sym;
1067 prop = stack->sym->prop;
1069 /* for choice values find the menu entry (used below) */
1070 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1071 for (prop = sym->prop; prop; prop = prop->next) {
1077 if (stack->sym == last_sym)
1078 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1079 prop->file->name, prop->lineno);
1081 if (sym_is_choice(sym)) {
1082 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1083 menu->file->name, menu->lineno,
1084 sym->name ? sym->name : "<choice>",
1085 next_sym->name ? next_sym->name : "<choice>");
1086 } else if (sym_is_choice_value(sym)) {
1087 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1088 menu->file->name, menu->lineno,
1089 sym->name ? sym->name : "<choice>",
1090 next_sym->name ? next_sym->name : "<choice>");
1091 } else if (stack->expr == &sym->dir_dep.expr) {
1092 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1093 prop->file->name, prop->lineno,
1094 sym->name ? sym->name : "<choice>",
1095 next_sym->name ? next_sym->name : "<choice>");
1096 } else if (stack->expr == &sym->rev_dep.expr) {
1097 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1098 prop->file->name, prop->lineno,
1099 sym->name ? sym->name : "<choice>",
1100 next_sym->name ? next_sym->name : "<choice>");
1101 } else if (stack->expr == &sym->implied.expr) {
1102 fprintf(stderr, "%s:%d:\tsymbol %s is implied by %s\n",
1103 prop->file->name, prop->lineno,
1104 sym->name ? sym->name : "<choice>",
1105 next_sym->name ? next_sym->name : "<choice>");
1106 } else if (stack->expr) {
1107 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1108 prop->file->name, prop->lineno,
1109 sym->name ? sym->name : "<choice>",
1110 prop_get_type_name(prop->type),
1111 next_sym->name ? next_sym->name : "<choice>");
1113 fprintf(stderr, "%s:%d:\tsymbol %s %s is visible depending on %s\n",
1114 prop->file->name, prop->lineno,
1115 sym->name ? sym->name : "<choice>",
1116 prop_get_type_name(prop->type),
1117 next_sym->name ? next_sym->name : "<choice>");
1122 "For a resolution refer to Documentation/kbuild/kconfig-language.rst\n"
1123 "subsection \"Kconfig recursive dependency limitations\"\n"
1126 if (check_top == &cv_stack)
1130 static struct symbol *sym_check_expr_deps(struct expr *e)
1139 sym = sym_check_expr_deps(e->left.expr);
1142 return sym_check_expr_deps(e->right.expr);
1144 return sym_check_expr_deps(e->left.expr);
1151 sym = sym_check_deps(e->left.sym);
1154 return sym_check_deps(e->right.sym);
1156 return sym_check_deps(e->left.sym);
1160 fprintf(stderr, "Oops! How to check %d?\n", e->type);
1164 /* return NULL when dependencies are OK */
1165 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1167 struct symbol *sym2;
1168 struct property *prop;
1169 struct dep_stack stack;
1171 dep_stack_insert(&stack, sym);
1173 stack.expr = &sym->dir_dep.expr;
1174 sym2 = sym_check_expr_deps(sym->dir_dep.expr);
1178 stack.expr = &sym->rev_dep.expr;
1179 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1183 stack.expr = &sym->implied.expr;
1184 sym2 = sym_check_expr_deps(sym->implied.expr);
1190 for (prop = sym->prop; prop; prop = prop->next) {
1191 if (prop->type == P_CHOICE || prop->type == P_SELECT ||
1192 prop->type == P_IMPLY)
1195 sym2 = sym_check_expr_deps(prop->visible.expr);
1198 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1200 stack.expr = &prop->expr;
1201 sym2 = sym_check_expr_deps(prop->expr);
1213 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1215 struct symbol *sym, *sym2;
1216 struct property *prop;
1218 struct dep_stack stack;
1220 dep_stack_insert(&stack, choice);
1222 prop = sym_get_choice_prop(choice);
1223 expr_list_for_each_sym(prop->expr, e, sym)
1224 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1226 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1227 sym2 = sym_check_sym_deps(choice);
1228 choice->flags &= ~SYMBOL_CHECK;
1232 expr_list_for_each_sym(prop->expr, e, sym) {
1233 sym2 = sym_check_sym_deps(sym);
1238 expr_list_for_each_sym(prop->expr, e, sym)
1239 sym->flags &= ~SYMBOL_CHECK;
1241 if (sym2 && sym_is_choice_value(sym2) &&
1242 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1250 struct symbol *sym_check_deps(struct symbol *sym)
1252 struct symbol *sym2;
1253 struct property *prop;
1255 if (sym->flags & SYMBOL_CHECK) {
1256 sym_check_print_recursive(sym);
1259 if (sym->flags & SYMBOL_CHECKED)
1262 if (sym_is_choice_value(sym)) {
1263 struct dep_stack stack;
1265 /* for choice groups start the check with main choice symbol */
1266 dep_stack_insert(&stack, sym);
1267 prop = sym_get_choice_prop(sym);
1268 sym2 = sym_check_deps(prop_get_symbol(prop));
1270 } else if (sym_is_choice(sym)) {
1271 sym2 = sym_check_choice_deps(sym);
1273 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1274 sym2 = sym_check_sym_deps(sym);
1275 sym->flags &= ~SYMBOL_CHECK;
1281 struct symbol *prop_get_symbol(struct property *prop)
1283 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1284 prop->expr->type == E_LIST))
1285 return prop->expr->left.sym;
1289 const char *prop_get_type_name(enum prop_type type)