1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
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
*modules_sym
;
39 static tristate modules_val
;
41 enum symbol_type
sym_get_type(struct symbol
*sym
)
43 enum symbol_type type
= sym
->type
;
45 if (type
== S_TRISTATE
) {
46 if (sym_is_choice_value(sym
) && sym
->visible
== yes
)
48 else if (modules_val
== no
)
54 const char *sym_type_name(enum symbol_type type
)
73 struct property
*sym_get_choice_prop(struct symbol
*sym
)
75 struct property
*prop
;
77 for_all_choices(sym
, prop
)
82 static struct property
*sym_get_default_prop(struct symbol
*sym
)
84 struct property
*prop
;
86 for_all_defaults(sym
, prop
) {
87 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
88 if (prop
->visible
.tri
!= no
)
94 struct property
*sym_get_range_prop(struct symbol
*sym
)
96 struct property
*prop
;
98 for_all_properties(sym
, prop
, P_RANGE
) {
99 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
100 if (prop
->visible
.tri
!= no
)
106 static long long sym_get_range_val(struct symbol
*sym
, int base
)
119 return strtoll(sym
->curr
.val
, NULL
, base
);
122 static void sym_validate_range(struct symbol
*sym
)
124 struct property
*prop
;
139 prop
= sym_get_range_prop(sym
);
142 val
= strtoll(sym
->curr
.val
, NULL
, base
);
143 val2
= sym_get_range_val(prop
->expr
->left
.sym
, base
);
145 val2
= sym_get_range_val(prop
->expr
->right
.sym
, base
);
149 if (sym
->type
== S_INT
)
150 sprintf(str
, "%lld", val2
);
152 sprintf(str
, "0x%llx", val2
);
153 sym
->curr
.val
= xstrdup(str
);
156 static void sym_set_changed(struct symbol
*sym
)
158 struct property
*prop
;
160 sym
->flags
|= SYMBOL_CHANGED
;
161 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
163 prop
->menu
->flags
|= MENU_CHANGED
;
167 static void sym_set_all_changed(void)
172 for_all_symbols(i
, sym
)
173 sym_set_changed(sym
);
176 static void sym_calc_visibility(struct symbol
*sym
)
178 struct property
*prop
;
179 struct symbol
*choice_sym
= NULL
;
182 /* any prompt visible? */
185 if (sym_is_choice_value(sym
))
186 choice_sym
= prop_get_symbol(sym_get_choice_prop(sym
));
188 for_all_prompts(sym
, prop
) {
189 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
191 * Tristate choice_values with visibility 'mod' are
192 * not visible if the corresponding choice's value is
195 if (choice_sym
&& sym
->type
== S_TRISTATE
&&
196 prop
->visible
.tri
== mod
&& choice_sym
->curr
.tri
== yes
)
197 prop
->visible
.tri
= no
;
199 tri
= EXPR_OR(tri
, prop
->visible
.tri
);
201 if (tri
== mod
&& (sym
->type
!= S_TRISTATE
|| modules_val
== no
))
203 if (sym
->visible
!= tri
) {
205 sym_set_changed(sym
);
207 if (sym_is_choice_value(sym
))
209 /* defaulting to "yes" if no explicit "depends on" are given */
211 if (sym
->dir_dep
.expr
)
212 tri
= expr_calc_value(sym
->dir_dep
.expr
);
213 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
215 if (sym
->dir_dep
.tri
!= tri
) {
216 sym
->dir_dep
.tri
= tri
;
217 sym_set_changed(sym
);
220 if (sym
->rev_dep
.expr
)
221 tri
= expr_calc_value(sym
->rev_dep
.expr
);
222 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
224 if (sym
->rev_dep
.tri
!= tri
) {
225 sym
->rev_dep
.tri
= tri
;
226 sym_set_changed(sym
);
229 if (sym
->implied
.expr
)
230 tri
= expr_calc_value(sym
->implied
.expr
);
231 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
233 if (sym
->implied
.tri
!= tri
) {
234 sym
->implied
.tri
= tri
;
235 sym_set_changed(sym
);
240 * Find the default symbol for a choice.
241 * First try the default values for the choice symbol
242 * Next locate the first visible choice value
243 * Return NULL if none was found
245 struct symbol
*sym_choice_default(struct symbol
*sym
)
247 struct symbol
*def_sym
;
248 struct property
*prop
;
251 /* any of the defaults visible? */
252 for_all_defaults(sym
, prop
) {
253 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
254 if (prop
->visible
.tri
== no
)
256 def_sym
= prop_get_symbol(prop
);
257 if (def_sym
->visible
!= no
)
261 /* just get the first visible value */
262 prop
= sym_get_choice_prop(sym
);
263 expr_list_for_each_sym(prop
->expr
, e
, def_sym
)
264 if (def_sym
->visible
!= no
)
267 /* failed to locate any defaults */
271 static struct symbol
*sym_calc_choice(struct symbol
*sym
)
273 struct symbol
*def_sym
;
274 struct property
*prop
;
278 /* first calculate all choice values' visibilities */
280 prop
= sym_get_choice_prop(sym
);
281 expr_list_for_each_sym(prop
->expr
, e
, def_sym
) {
282 sym_calc_visibility(def_sym
);
283 if (def_sym
->visible
!= no
)
284 flags
&= def_sym
->flags
;
287 sym
->flags
&= flags
| ~SYMBOL_DEF_USER
;
289 /* is the user choice visible? */
290 def_sym
= sym
->def
[S_DEF_USER
].val
;
291 if (def_sym
&& def_sym
->visible
!= no
)
294 def_sym
= sym_choice_default(sym
);
297 /* no choice? reset tristate value */
303 static void sym_warn_unmet_dep(struct symbol
*sym
)
305 struct gstr gs
= str_new();
308 "\nWARNING: unmet direct dependencies detected for %s\n",
311 " Depends on [%c]: ",
312 sym
->dir_dep
.tri
== mod
? 'm' : 'n');
313 expr_gstr_print(sym
->dir_dep
.expr
, &gs
);
314 str_printf(&gs
, "\n");
316 expr_gstr_print_revdep(sym
->rev_dep
.expr
, &gs
, yes
,
317 " Selected by [y]:\n");
318 expr_gstr_print_revdep(sym
->rev_dep
.expr
, &gs
, mod
,
319 " Selected by [m]:\n");
321 fputs(str_get(&gs
), stderr
);
324 void sym_calc_value(struct symbol
*sym
)
326 struct symbol_value newval
, oldval
;
327 struct property
*prop
;
333 if (sym
->flags
& SYMBOL_VALID
)
336 if (sym_is_choice_value(sym
) &&
337 sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
) {
338 sym
->flags
&= ~SYMBOL_NEED_SET_CHOICE_VALUES
;
339 prop
= sym_get_choice_prop(sym
);
340 sym_calc_value(prop_get_symbol(prop
));
343 sym
->flags
|= SYMBOL_VALID
;
351 newval
= symbol_empty
.curr
;
355 newval
= symbol_no
.curr
;
358 sym
->curr
.val
= sym
->name
;
362 sym
->flags
&= ~SYMBOL_WRITE
;
364 sym_calc_visibility(sym
);
366 if (sym
->visible
!= no
)
367 sym
->flags
|= SYMBOL_WRITE
;
369 /* set default if recursively called */
372 switch (sym_get_type(sym
)) {
375 if (sym_is_choice_value(sym
) && sym
->visible
== yes
) {
376 prop
= sym_get_choice_prop(sym
);
377 newval
.tri
= (prop_get_symbol(prop
)->curr
.val
== sym
) ? yes
: no
;
379 if (sym
->visible
!= no
) {
380 /* if the symbol is visible use the user value
381 * if available, otherwise try the default value
383 if (sym_has_value(sym
)) {
384 newval
.tri
= EXPR_AND(sym
->def
[S_DEF_USER
].tri
,
389 if (sym
->rev_dep
.tri
!= no
)
390 sym
->flags
|= SYMBOL_WRITE
;
391 if (!sym_is_choice(sym
)) {
392 prop
= sym_get_default_prop(sym
);
394 newval
.tri
= EXPR_AND(expr_calc_value(prop
->expr
),
396 if (newval
.tri
!= no
)
397 sym
->flags
|= SYMBOL_WRITE
;
399 if (sym
->implied
.tri
!= no
) {
400 sym
->flags
|= SYMBOL_WRITE
;
401 newval
.tri
= EXPR_OR(newval
.tri
, sym
->implied
.tri
);
402 newval
.tri
= EXPR_AND(newval
.tri
,
407 if (sym
->dir_dep
.tri
< sym
->rev_dep
.tri
)
408 sym_warn_unmet_dep(sym
);
409 newval
.tri
= EXPR_OR(newval
.tri
, sym
->rev_dep
.tri
);
411 if (newval
.tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
417 if (sym
->visible
!= no
&& sym_has_value(sym
)) {
418 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_NO_WRITE
)
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 conf_set_changed(true);
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
)
745 /* adjust the default value if this symbol is implied by another */
746 if (val
< sym
->implied
.tri
)
747 val
= sym
->implied
.tri
;
754 case mod
: return "m";
755 case yes
: return "y";
768 const char *sym_get_string_value(struct symbol
*sym
)
775 val
= sym_get_tristate_value(sym
);
780 sym_calc_value(modules_sym
);
781 return (modules_sym
->curr
.tri
== no
) ? "n" : "m";
789 return (const char *)sym
->curr
.val
;
792 bool sym_is_changeable(struct symbol
*sym
)
794 return sym
->visible
> sym
->rev_dep
.tri
;
797 static unsigned strhash(const char *s
)
800 unsigned hash
= 2166136261U;
802 hash
= (hash
^ *s
) * 0x01000193;
806 struct symbol
*sym_lookup(const char *name
, int flags
)
808 struct symbol
*symbol
;
813 if (name
[0] && !name
[1]) {
815 case 'y': return &symbol_yes
;
816 case 'm': return &symbol_mod
;
817 case 'n': return &symbol_no
;
820 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
822 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
824 !strcmp(symbol
->name
, name
) &&
825 (flags
? symbol
->flags
& flags
826 : !(symbol
->flags
& (SYMBOL_CONST
|SYMBOL_CHOICE
))))
829 new_name
= xstrdup(name
);
835 symbol
= xmalloc(sizeof(*symbol
));
836 memset(symbol
, 0, sizeof(*symbol
));
837 symbol
->name
= new_name
;
838 symbol
->type
= S_UNKNOWN
;
839 symbol
->flags
= flags
;
841 symbol
->next
= symbol_hash
[hash
];
842 symbol_hash
[hash
] = symbol
;
847 struct symbol
*sym_find(const char *name
)
849 struct symbol
*symbol
= NULL
;
855 if (name
[0] && !name
[1]) {
857 case 'y': return &symbol_yes
;
858 case 'm': return &symbol_mod
;
859 case 'n': return &symbol_no
;
862 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
864 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
866 !strcmp(symbol
->name
, name
) &&
867 !(symbol
->flags
& SYMBOL_CONST
))
874 const char *sym_escape_string_value(const char *in
)
881 reslen
= strlen(in
) + strlen("\"\"") + 1;
885 l
= strcspn(p
, "\"\\");
895 res
= xmalloc(reslen
);
902 l
= strcspn(p
, "\"\\");
910 strncat(res
, p
++, 1);
922 /* Compare matched symbols as thus:
923 * - first, symbols that match exactly
924 * - then, alphabetical sort
926 static int sym_rel_comp(const void *sym1
, const void *sym2
)
928 const struct sym_match
*s1
= sym1
;
929 const struct sym_match
*s2
= sym2
;
933 * - if matched length on symbol s1 is the length of that symbol,
934 * then this symbol should come first;
935 * - if matched length on symbol s2 is the length of that symbol,
936 * then this symbol should come first.
937 * Note: since the search can be a regexp, both symbols may match
938 * exactly; if this is the case, we can't decide which comes first,
939 * and we fallback to sorting alphabetically.
941 exact1
= (s1
->eo
- s1
->so
) == strlen(s1
->sym
->name
);
942 exact2
= (s2
->eo
- s2
->so
) == strlen(s2
->sym
->name
);
943 if (exact1
&& !exact2
)
945 if (!exact1
&& exact2
)
948 /* As a fallback, sort symbols alphabetically */
949 return strcmp(s1
->sym
->name
, s2
->sym
->name
);
952 struct symbol
**sym_re_search(const char *pattern
)
954 struct symbol
*sym
, **sym_arr
= NULL
;
955 struct sym_match
*sym_match_arr
= NULL
;
962 if (strlen(pattern
) == 0)
964 if (regcomp(&re
, pattern
, REG_EXTENDED
|REG_ICASE
))
967 for_all_symbols(i
, sym
) {
968 if (sym
->flags
& SYMBOL_CONST
|| !sym
->name
)
970 if (regexec(&re
, sym
->name
, 1, match
, 0))
975 tmp
= realloc(sym_match_arr
, size
* sizeof(struct sym_match
));
977 goto sym_re_search_free
;
981 /* As regexec returned 0, we know we have a match, so
982 * we can use match[0].rm_[se]o without further checks
984 sym_match_arr
[cnt
].so
= match
[0].rm_so
;
985 sym_match_arr
[cnt
].eo
= match
[0].rm_eo
;
986 sym_match_arr
[cnt
++].sym
= sym
;
989 qsort(sym_match_arr
, cnt
, sizeof(struct sym_match
), sym_rel_comp
);
990 sym_arr
= malloc((cnt
+1) * sizeof(struct symbol
*));
992 goto sym_re_search_free
;
993 for (i
= 0; i
< cnt
; i
++)
994 sym_arr
[i
] = sym_match_arr
[i
].sym
;
998 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1006 * When we check for recursive dependencies we use a stack to save
1007 * current state so we can print out relevant info to user.
1008 * The entries are located on the call stack so no need to free memory.
1009 * Note insert() remove() must always match to properly clear the stack.
1011 static struct dep_stack
{
1012 struct dep_stack
*prev
, *next
;
1014 struct property
*prop
;
1018 static void dep_stack_insert(struct dep_stack
*stack
, struct symbol
*sym
)
1020 memset(stack
, 0, sizeof(*stack
));
1022 check_top
->next
= stack
;
1023 stack
->prev
= check_top
;
1028 static void dep_stack_remove(void)
1030 check_top
= check_top
->prev
;
1032 check_top
->next
= NULL
;
1036 * Called when we have detected a recursive dependency.
1037 * check_top point to the top of the stact so we use
1038 * the ->prev pointer to locate the bottom of the stack.
1040 static void sym_check_print_recursive(struct symbol
*last_sym
)
1042 struct dep_stack
*stack
;
1043 struct symbol
*sym
, *next_sym
;
1044 struct menu
*menu
= NULL
;
1045 struct property
*prop
;
1046 struct dep_stack cv_stack
;
1048 if (sym_is_choice_value(last_sym
)) {
1049 dep_stack_insert(&cv_stack
, last_sym
);
1050 last_sym
= prop_get_symbol(sym_get_choice_prop(last_sym
));
1053 for (stack
= check_top
; stack
!= NULL
; stack
= stack
->prev
)
1054 if (stack
->sym
== last_sym
)
1057 fprintf(stderr
, "unexpected recursive dependency error\n");
1061 for (; stack
; stack
= stack
->next
) {
1063 next_sym
= stack
->next
? stack
->next
->sym
: last_sym
;
1066 prop
= stack
->sym
->prop
;
1068 /* for choice values find the menu entry (used below) */
1069 if (sym_is_choice(sym
) || sym_is_choice_value(sym
)) {
1070 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1076 if (stack
->sym
== last_sym
)
1077 fprintf(stderr
, "%s:%d:error: recursive dependency detected!\n",
1078 prop
->file
->name
, prop
->lineno
);
1080 if (sym_is_choice(sym
)) {
1081 fprintf(stderr
, "%s:%d:\tchoice %s contains symbol %s\n",
1082 menu
->file
->name
, menu
->lineno
,
1083 sym
->name
? sym
->name
: "<choice>",
1084 next_sym
->name
? next_sym
->name
: "<choice>");
1085 } else if (sym_is_choice_value(sym
)) {
1086 fprintf(stderr
, "%s:%d:\tsymbol %s is part of choice %s\n",
1087 menu
->file
->name
, menu
->lineno
,
1088 sym
->name
? sym
->name
: "<choice>",
1089 next_sym
->name
? next_sym
->name
: "<choice>");
1090 } else if (stack
->expr
== &sym
->dir_dep
.expr
) {
1091 fprintf(stderr
, "%s:%d:\tsymbol %s depends on %s\n",
1092 prop
->file
->name
, prop
->lineno
,
1093 sym
->name
? sym
->name
: "<choice>",
1094 next_sym
->name
? next_sym
->name
: "<choice>");
1095 } else if (stack
->expr
== &sym
->rev_dep
.expr
) {
1096 fprintf(stderr
, "%s:%d:\tsymbol %s is selected by %s\n",
1097 prop
->file
->name
, prop
->lineno
,
1098 sym
->name
? sym
->name
: "<choice>",
1099 next_sym
->name
? next_sym
->name
: "<choice>");
1100 } else if (stack
->expr
== &sym
->implied
.expr
) {
1101 fprintf(stderr
, "%s:%d:\tsymbol %s is implied by %s\n",
1102 prop
->file
->name
, prop
->lineno
,
1103 sym
->name
? sym
->name
: "<choice>",
1104 next_sym
->name
? next_sym
->name
: "<choice>");
1105 } else if (stack
->expr
) {
1106 fprintf(stderr
, "%s:%d:\tsymbol %s %s value contains %s\n",
1107 prop
->file
->name
, prop
->lineno
,
1108 sym
->name
? sym
->name
: "<choice>",
1109 prop_get_type_name(prop
->type
),
1110 next_sym
->name
? next_sym
->name
: "<choice>");
1112 fprintf(stderr
, "%s:%d:\tsymbol %s %s is visible depending on %s\n",
1113 prop
->file
->name
, prop
->lineno
,
1114 sym
->name
? sym
->name
: "<choice>",
1115 prop_get_type_name(prop
->type
),
1116 next_sym
->name
? next_sym
->name
: "<choice>");
1121 "For a resolution refer to Documentation/kbuild/kconfig-language.rst\n"
1122 "subsection \"Kconfig recursive dependency limitations\"\n"
1125 if (check_top
== &cv_stack
)
1129 static struct symbol
*sym_check_expr_deps(struct expr
*e
)
1138 sym
= sym_check_expr_deps(e
->left
.expr
);
1141 return sym_check_expr_deps(e
->right
.expr
);
1143 return sym_check_expr_deps(e
->left
.expr
);
1150 sym
= sym_check_deps(e
->left
.sym
);
1153 return sym_check_deps(e
->right
.sym
);
1155 return sym_check_deps(e
->left
.sym
);
1159 fprintf(stderr
, "Oops! How to check %d?\n", e
->type
);
1163 /* return NULL when dependencies are OK */
1164 static struct symbol
*sym_check_sym_deps(struct symbol
*sym
)
1166 struct symbol
*sym2
;
1167 struct property
*prop
;
1168 struct dep_stack stack
;
1170 dep_stack_insert(&stack
, sym
);
1172 stack
.expr
= &sym
->dir_dep
.expr
;
1173 sym2
= sym_check_expr_deps(sym
->dir_dep
.expr
);
1177 stack
.expr
= &sym
->rev_dep
.expr
;
1178 sym2
= sym_check_expr_deps(sym
->rev_dep
.expr
);
1182 stack
.expr
= &sym
->implied
.expr
;
1183 sym2
= sym_check_expr_deps(sym
->implied
.expr
);
1189 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1190 if (prop
->type
== P_CHOICE
|| prop
->type
== P_SELECT
||
1191 prop
->type
== P_IMPLY
)
1194 sym2
= sym_check_expr_deps(prop
->visible
.expr
);
1197 if (prop
->type
!= P_DEFAULT
|| sym_is_choice(sym
))
1199 stack
.expr
= &prop
->expr
;
1200 sym2
= sym_check_expr_deps(prop
->expr
);
1212 static struct symbol
*sym_check_choice_deps(struct symbol
*choice
)
1214 struct symbol
*sym
, *sym2
;
1215 struct property
*prop
;
1217 struct dep_stack stack
;
1219 dep_stack_insert(&stack
, choice
);
1221 prop
= sym_get_choice_prop(choice
);
1222 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1223 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1225 choice
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1226 sym2
= sym_check_sym_deps(choice
);
1227 choice
->flags
&= ~SYMBOL_CHECK
;
1231 expr_list_for_each_sym(prop
->expr
, e
, sym
) {
1232 sym2
= sym_check_sym_deps(sym
);
1237 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1238 sym
->flags
&= ~SYMBOL_CHECK
;
1240 if (sym2
&& sym_is_choice_value(sym2
) &&
1241 prop_get_symbol(sym_get_choice_prop(sym2
)) == choice
)
1249 struct symbol
*sym_check_deps(struct symbol
*sym
)
1251 struct symbol
*sym2
;
1252 struct property
*prop
;
1254 if (sym
->flags
& SYMBOL_CHECK
) {
1255 sym_check_print_recursive(sym
);
1258 if (sym
->flags
& SYMBOL_CHECKED
)
1261 if (sym_is_choice_value(sym
)) {
1262 struct dep_stack stack
;
1264 /* for choice groups start the check with main choice symbol */
1265 dep_stack_insert(&stack
, sym
);
1266 prop
= sym_get_choice_prop(sym
);
1267 sym2
= sym_check_deps(prop_get_symbol(prop
));
1269 } else if (sym_is_choice(sym
)) {
1270 sym2
= sym_check_choice_deps(sym
);
1272 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1273 sym2
= sym_check_sym_deps(sym
);
1274 sym
->flags
&= ~SYMBOL_CHECK
;
1280 struct symbol
*prop_get_symbol(struct property
*prop
)
1282 if (prop
->expr
&& (prop
->expr
->type
== E_SYMBOL
||
1283 prop
->expr
->type
== E_LIST
))
1284 return prop
->expr
->left
.sym
;
1288 const char *prop_get_type_name(enum prop_type type
)