2 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
3 * Released under the terms of the GNU GPL v2.0.
10 #include <sys/utsname.h>
14 struct symbol symbol_yes
= {
17 .flags
= SYMBOL_CONST
|SYMBOL_VALID
,
21 .flags
= SYMBOL_CONST
|SYMBOL_VALID
,
25 .flags
= SYMBOL_CONST
|SYMBOL_VALID
,
29 .flags
= SYMBOL_VALID
,
32 struct symbol
*sym_defconfig_list
;
33 struct symbol
*modules_sym
;
36 struct expr
*sym_env_list
;
38 static void sym_add_default(struct symbol
*sym
, const char *def
)
40 struct property
*prop
= prop_alloc(P_DEFAULT
, sym
);
42 prop
->expr
= expr_alloc_symbol(sym_lookup(def
, SYMBOL_CONST
));
49 static bool inited
= false;
57 sym
= sym_lookup("UNAME_RELEASE", 0);
59 sym
->flags
|= SYMBOL_AUTO
;
60 sym_add_default(sym
, uts
.release
);
63 enum symbol_type
sym_get_type(struct symbol
*sym
)
65 enum symbol_type type
= sym
->type
;
67 if (type
== S_TRISTATE
) {
68 if (sym_is_choice_value(sym
) && sym
->visible
== yes
)
70 else if (modules_val
== no
)
76 const char *sym_type_name(enum symbol_type type
)
97 struct property
*sym_get_choice_prop(struct symbol
*sym
)
99 struct property
*prop
;
101 for_all_choices(sym
, prop
)
106 struct property
*sym_get_env_prop(struct symbol
*sym
)
108 struct property
*prop
;
110 for_all_properties(sym
, prop
, P_ENV
)
115 static struct property
*sym_get_default_prop(struct symbol
*sym
)
117 struct property
*prop
;
119 for_all_defaults(sym
, prop
) {
120 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
121 if (prop
->visible
.tri
!= no
)
127 static struct property
*sym_get_range_prop(struct symbol
*sym
)
129 struct property
*prop
;
131 for_all_properties(sym
, prop
, P_RANGE
) {
132 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
133 if (prop
->visible
.tri
!= no
)
139 static long long sym_get_range_val(struct symbol
*sym
, int base
)
152 return strtoll(sym
->curr
.val
, NULL
, base
);
155 static void sym_validate_range(struct symbol
*sym
)
157 struct property
*prop
;
172 prop
= sym_get_range_prop(sym
);
175 val
= strtoll(sym
->curr
.val
, NULL
, base
);
176 val2
= sym_get_range_val(prop
->expr
->left
.sym
, base
);
178 val2
= sym_get_range_val(prop
->expr
->right
.sym
, base
);
182 if (sym
->type
== S_INT
)
183 sprintf(str
, "%lld", val2
);
185 sprintf(str
, "0x%llx", val2
);
186 sym
->curr
.val
= xstrdup(str
);
189 static void sym_set_changed(struct symbol
*sym
)
191 struct property
*prop
;
193 sym
->flags
|= SYMBOL_CHANGED
;
194 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
196 prop
->menu
->flags
|= MENU_CHANGED
;
200 static void sym_set_all_changed(void)
205 for_all_symbols(i
, sym
)
206 sym_set_changed(sym
);
209 static void sym_calc_visibility(struct symbol
*sym
)
211 struct property
*prop
;
212 struct symbol
*choice_sym
= NULL
;
215 /* any prompt visible? */
218 if (sym_is_choice_value(sym
))
219 choice_sym
= prop_get_symbol(sym_get_choice_prop(sym
));
221 for_all_prompts(sym
, prop
) {
222 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
224 * Tristate choice_values with visibility 'mod' are
225 * not visible if the corresponding choice's value is
228 if (choice_sym
&& sym
->type
== S_TRISTATE
&&
229 prop
->visible
.tri
== mod
&& choice_sym
->curr
.tri
== yes
)
230 prop
->visible
.tri
= no
;
232 tri
= EXPR_OR(tri
, prop
->visible
.tri
);
234 if (tri
== mod
&& (sym
->type
!= S_TRISTATE
|| modules_val
== no
))
236 if (sym
->visible
!= tri
) {
238 sym_set_changed(sym
);
240 if (sym_is_choice_value(sym
))
242 /* defaulting to "yes" if no explicit "depends on" are given */
244 if (sym
->dir_dep
.expr
)
245 tri
= expr_calc_value(sym
->dir_dep
.expr
);
248 if (sym
->dir_dep
.tri
!= tri
) {
249 sym
->dir_dep
.tri
= tri
;
250 sym_set_changed(sym
);
253 if (sym
->rev_dep
.expr
)
254 tri
= expr_calc_value(sym
->rev_dep
.expr
);
255 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
257 if (sym
->rev_dep
.tri
!= tri
) {
258 sym
->rev_dep
.tri
= tri
;
259 sym_set_changed(sym
);
262 if (sym
->implied
.expr
&& sym
->dir_dep
.tri
!= no
)
263 tri
= expr_calc_value(sym
->implied
.expr
);
264 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
266 if (sym
->implied
.tri
!= tri
) {
267 sym
->implied
.tri
= tri
;
268 sym_set_changed(sym
);
273 * Find the default symbol for a choice.
274 * First try the default values for the choice symbol
275 * Next locate the first visible choice value
276 * Return NULL if none was found
278 struct symbol
*sym_choice_default(struct symbol
*sym
)
280 struct symbol
*def_sym
;
281 struct property
*prop
;
284 /* any of the defaults visible? */
285 for_all_defaults(sym
, prop
) {
286 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
287 if (prop
->visible
.tri
== no
)
289 def_sym
= prop_get_symbol(prop
);
290 if (def_sym
->visible
!= no
)
294 /* just get the first visible value */
295 prop
= sym_get_choice_prop(sym
);
296 expr_list_for_each_sym(prop
->expr
, e
, def_sym
)
297 if (def_sym
->visible
!= no
)
300 /* failed to locate any defaults */
304 static struct symbol
*sym_calc_choice(struct symbol
*sym
)
306 struct symbol
*def_sym
;
307 struct property
*prop
;
311 /* first calculate all choice values' visibilities */
313 prop
= sym_get_choice_prop(sym
);
314 expr_list_for_each_sym(prop
->expr
, e
, def_sym
) {
315 sym_calc_visibility(def_sym
);
316 if (def_sym
->visible
!= no
)
317 flags
&= def_sym
->flags
;
320 sym
->flags
&= flags
| ~SYMBOL_DEF_USER
;
322 /* is the user choice visible? */
323 def_sym
= sym
->def
[S_DEF_USER
].val
;
324 if (def_sym
&& def_sym
->visible
!= no
)
327 def_sym
= sym_choice_default(sym
);
330 /* no choice? reset tristate value */
336 void sym_calc_value(struct symbol
*sym
)
338 struct symbol_value newval
, oldval
;
339 struct property
*prop
;
345 if (sym
->flags
& SYMBOL_VALID
)
348 if (sym_is_choice_value(sym
) &&
349 sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
) {
350 sym
->flags
&= ~SYMBOL_NEED_SET_CHOICE_VALUES
;
351 prop
= sym_get_choice_prop(sym
);
352 sym_calc_value(prop_get_symbol(prop
));
355 sym
->flags
|= SYMBOL_VALID
;
363 newval
= symbol_empty
.curr
;
367 newval
= symbol_no
.curr
;
370 sym
->curr
.val
= sym
->name
;
374 sym
->flags
&= ~SYMBOL_WRITE
;
376 sym_calc_visibility(sym
);
378 if (sym
->visible
!= no
)
379 sym
->flags
|= SYMBOL_WRITE
;
381 /* set default if recursively called */
384 switch (sym_get_type(sym
)) {
387 if (sym_is_choice_value(sym
) && sym
->visible
== yes
) {
388 prop
= sym_get_choice_prop(sym
);
389 newval
.tri
= (prop_get_symbol(prop
)->curr
.val
== sym
) ? yes
: no
;
391 if (sym
->visible
!= no
) {
392 /* if the symbol is visible use the user value
393 * if available, otherwise try the default value
395 if (sym_has_value(sym
)) {
396 newval
.tri
= EXPR_AND(sym
->def
[S_DEF_USER
].tri
,
401 if (sym
->rev_dep
.tri
!= no
)
402 sym
->flags
|= SYMBOL_WRITE
;
403 if (!sym_is_choice(sym
)) {
404 prop
= sym_get_default_prop(sym
);
406 sym
->flags
|= SYMBOL_WRITE
;
407 newval
.tri
= EXPR_AND(expr_calc_value(prop
->expr
),
410 if (sym
->implied
.tri
!= no
) {
411 sym
->flags
|= SYMBOL_WRITE
;
412 newval
.tri
= EXPR_OR(newval
.tri
, sym
->implied
.tri
);
416 if (sym
->dir_dep
.tri
== no
&& sym
->rev_dep
.tri
!= no
) {
418 e
= expr_simplify_unmet_dep(sym
->rev_dep
.expr
,
420 fprintf(stderr
, "warning: (");
421 expr_fprint(e
, stderr
);
422 fprintf(stderr
, ") selects %s which has unmet direct dependencies (",
424 expr_fprint(sym
->dir_dep
.expr
, stderr
);
425 fprintf(stderr
, ")\n");
428 newval
.tri
= EXPR_OR(newval
.tri
, sym
->rev_dep
.tri
);
430 if (newval
.tri
== mod
&&
431 (sym_get_type(sym
) == S_BOOLEAN
|| sym
->implied
.tri
== yes
))
437 if (sym
->visible
!= no
&& sym_has_value(sym
)) {
438 newval
.val
= sym
->def
[S_DEF_USER
].val
;
441 prop
= sym_get_default_prop(sym
);
443 struct symbol
*ds
= prop_get_symbol(prop
);
445 sym
->flags
|= SYMBOL_WRITE
;
447 newval
.val
= ds
->curr
.val
;
456 if (sym_is_choice(sym
) && newval
.tri
== yes
)
457 sym
->curr
.val
= sym_calc_choice(sym
);
458 sym_validate_range(sym
);
460 if (memcmp(&oldval
, &sym
->curr
, sizeof(oldval
))) {
461 sym_set_changed(sym
);
462 if (modules_sym
== sym
) {
463 sym_set_all_changed();
464 modules_val
= modules_sym
->curr
.tri
;
468 if (sym_is_choice(sym
)) {
469 struct symbol
*choice_sym
;
471 prop
= sym_get_choice_prop(sym
);
472 expr_list_for_each_sym(prop
->expr
, e
, choice_sym
) {
473 if ((sym
->flags
& SYMBOL_WRITE
) &&
474 choice_sym
->visible
!= no
)
475 choice_sym
->flags
|= SYMBOL_WRITE
;
476 if (sym
->flags
& SYMBOL_CHANGED
)
477 sym_set_changed(choice_sym
);
481 if (sym
->flags
& SYMBOL_AUTO
)
482 sym
->flags
&= ~SYMBOL_WRITE
;
484 if (sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
)
485 set_all_choice_values(sym
);
488 void sym_clear_all_valid(void)
493 for_all_symbols(i
, sym
)
494 sym
->flags
&= ~SYMBOL_VALID
;
495 sym_add_change_count(1);
496 sym_calc_value(modules_sym
);
499 bool sym_tristate_within_range(struct symbol
*sym
, tristate val
)
501 int type
= sym_get_type(sym
);
503 if (sym
->visible
== no
)
506 if (type
!= S_BOOLEAN
&& type
!= S_TRISTATE
)
509 if (type
== S_BOOLEAN
&& val
== mod
)
511 if (sym
->visible
<= sym
->rev_dep
.tri
)
513 if (sym
->implied
.tri
== yes
&& val
== mod
)
515 if (sym_is_choice_value(sym
) && sym
->visible
== yes
)
517 return val
>= sym
->rev_dep
.tri
&& val
<= sym
->visible
;
520 bool sym_set_tristate_value(struct symbol
*sym
, tristate val
)
522 tristate oldval
= sym_get_tristate_value(sym
);
524 if (oldval
!= val
&& !sym_tristate_within_range(sym
, val
))
527 if (!(sym
->flags
& SYMBOL_DEF_USER
)) {
528 sym
->flags
|= SYMBOL_DEF_USER
;
529 sym_set_changed(sym
);
532 * setting a choice value also resets the new flag of the choice
533 * symbol and all other choice values.
535 if (sym_is_choice_value(sym
) && val
== yes
) {
536 struct symbol
*cs
= prop_get_symbol(sym_get_choice_prop(sym
));
537 struct property
*prop
;
540 cs
->def
[S_DEF_USER
].val
= sym
;
541 cs
->flags
|= SYMBOL_DEF_USER
;
542 prop
= sym_get_choice_prop(cs
);
543 for (e
= prop
->expr
; e
; e
= e
->left
.expr
) {
544 if (e
->right
.sym
->visible
!= no
)
545 e
->right
.sym
->flags
|= SYMBOL_DEF_USER
;
549 sym
->def
[S_DEF_USER
].tri
= val
;
551 sym_clear_all_valid();
556 tristate
sym_toggle_tristate_value(struct symbol
*sym
)
558 tristate oldval
, newval
;
560 oldval
= newval
= sym_get_tristate_value(sym
);
573 if (sym_set_tristate_value(sym
, newval
))
575 } while (oldval
!= newval
);
579 bool sym_string_valid(struct symbol
*sym
, const char *str
)
592 if (ch
== '0' && *str
!= 0)
594 while ((ch
= *str
++)) {
600 if (str
[0] == '0' && (str
[1] == 'x' || str
[1] == 'X'))
606 } while ((ch
= *str
++));
622 bool sym_string_within_range(struct symbol
*sym
, const char *str
)
624 struct property
*prop
;
629 return sym_string_valid(sym
, str
);
631 if (!sym_string_valid(sym
, str
))
633 prop
= sym_get_range_prop(sym
);
636 val
= strtoll(str
, NULL
, 10);
637 return val
>= sym_get_range_val(prop
->expr
->left
.sym
, 10) &&
638 val
<= sym_get_range_val(prop
->expr
->right
.sym
, 10);
640 if (!sym_string_valid(sym
, str
))
642 prop
= sym_get_range_prop(sym
);
645 val
= strtoll(str
, NULL
, 16);
646 return val
>= sym_get_range_val(prop
->expr
->left
.sym
, 16) &&
647 val
<= sym_get_range_val(prop
->expr
->right
.sym
, 16);
652 return sym_tristate_within_range(sym
, yes
);
654 return sym_tristate_within_range(sym
, mod
);
656 return sym_tristate_within_range(sym
, no
);
664 bool sym_set_string_value(struct symbol
*sym
, const char *newval
)
675 return sym_set_tristate_value(sym
, yes
);
677 return sym_set_tristate_value(sym
, mod
);
679 return sym_set_tristate_value(sym
, no
);
686 if (!sym_string_within_range(sym
, newval
))
689 if (!(sym
->flags
& SYMBOL_DEF_USER
)) {
690 sym
->flags
|= SYMBOL_DEF_USER
;
691 sym_set_changed(sym
);
694 oldval
= sym
->def
[S_DEF_USER
].val
;
695 size
= strlen(newval
) + 1;
696 if (sym
->type
== S_HEX
&& (newval
[0] != '0' || (newval
[1] != 'x' && newval
[1] != 'X'))) {
698 sym
->def
[S_DEF_USER
].val
= val
= xmalloc(size
);
701 } else if (!oldval
|| strcmp(oldval
, newval
))
702 sym
->def
[S_DEF_USER
].val
= val
= xmalloc(size
);
707 free((void *)oldval
);
708 sym_clear_all_valid();
714 * Find the default value associated to a symbol.
715 * For tristate symbol handle the modules=n case
716 * in which case "m" becomes "y".
717 * If the symbol does not have any default then fallback
718 * to the fixed default values.
720 const char *sym_get_string_default(struct symbol
*sym
)
722 struct property
*prop
;
727 sym_calc_visibility(sym
);
728 sym_calc_value(modules_sym
);
729 val
= symbol_no
.curr
.tri
;
730 str
= symbol_empty
.curr
.val
;
732 /* If symbol has a default value look it up */
733 prop
= sym_get_default_prop(sym
);
738 /* The visibility may limit the value from yes => mod */
739 val
= EXPR_AND(expr_calc_value(prop
->expr
), prop
->visible
.tri
);
743 * The following fails to handle the situation
744 * where a default value is further limited by
747 ds
= prop_get_symbol(prop
);
750 str
= (const char *)ds
->curr
.val
;
755 /* Handle select statements */
756 val
= EXPR_OR(val
, sym
->rev_dep
.tri
);
758 /* transpose mod to yes if modules are not enabled */
760 if (!sym_is_choice_value(sym
) && modules_sym
->curr
.tri
== no
)
763 /* transpose mod to yes if type is bool */
764 if (sym
->type
== S_BOOLEAN
&& val
== mod
)
767 /* adjust the default value if this symbol is implied by another */
768 if (val
< sym
->implied
.tri
)
769 val
= sym
->implied
.tri
;
776 case mod
: return "m";
777 case yes
: return "y";
791 const char *sym_get_string_value(struct symbol
*sym
)
798 val
= sym_get_tristate_value(sym
);
803 sym_calc_value(modules_sym
);
804 return (modules_sym
->curr
.tri
== no
) ? "n" : "m";
812 return (const char *)sym
->curr
.val
;
815 bool sym_is_changable(struct symbol
*sym
)
817 return sym
->visible
> sym
->rev_dep
.tri
;
820 static unsigned strhash(const char *s
)
823 unsigned hash
= 2166136261U;
825 hash
= (hash
^ *s
) * 0x01000193;
829 struct symbol
*sym_lookup(const char *name
, int flags
)
831 struct symbol
*symbol
;
836 if (name
[0] && !name
[1]) {
838 case 'y': return &symbol_yes
;
839 case 'm': return &symbol_mod
;
840 case 'n': return &symbol_no
;
843 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
845 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
847 !strcmp(symbol
->name
, name
) &&
848 (flags
? symbol
->flags
& flags
849 : !(symbol
->flags
& (SYMBOL_CONST
|SYMBOL_CHOICE
))))
852 new_name
= xstrdup(name
);
858 symbol
= xmalloc(sizeof(*symbol
));
859 memset(symbol
, 0, sizeof(*symbol
));
860 symbol
->name
= new_name
;
861 symbol
->type
= S_UNKNOWN
;
862 symbol
->flags
|= flags
;
864 symbol
->next
= symbol_hash
[hash
];
865 symbol_hash
[hash
] = symbol
;
870 struct symbol
*sym_find(const char *name
)
872 struct symbol
*symbol
= NULL
;
878 if (name
[0] && !name
[1]) {
880 case 'y': return &symbol_yes
;
881 case 'm': return &symbol_mod
;
882 case 'n': return &symbol_no
;
885 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
887 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
889 !strcmp(symbol
->name
, name
) &&
890 !(symbol
->flags
& SYMBOL_CONST
))
898 * Expand symbol's names embedded in the string given in argument. Symbols'
899 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
902 char *sym_expand_string_value(const char *in
)
909 * Note: 'in' might come from a token that's about to be
910 * freed, so make sure to always allocate a new string
912 reslen
= strlen(in
) + 1;
913 res
= xmalloc(reslen
);
916 while ((src
= strchr(in
, '$'))) {
917 char *p
, name
[SYMBOL_MAXLENGTH
];
918 const char *symval
= "";
922 strncat(res
, in
, src
- in
);
926 while (isalnum(*src
) || *src
== '_')
930 sym
= sym_find(name
);
933 symval
= sym_get_string_value(sym
);
936 newlen
= strlen(res
) + strlen(symval
) + strlen(src
) + 1;
937 if (newlen
> reslen
) {
939 res
= xrealloc(res
, reslen
);
950 const char *sym_escape_string_value(const char *in
)
957 reslen
= strlen(in
) + strlen("\"\"") + 1;
961 l
= strcspn(p
, "\"\\");
971 res
= xmalloc(reslen
);
978 l
= strcspn(p
, "\"\\");
986 strncat(res
, p
++, 1);
998 /* Compare matched symbols as thus:
999 * - first, symbols that match exactly
1000 * - then, alphabetical sort
1002 static int sym_rel_comp(const void *sym1
, const void *sym2
)
1004 const struct sym_match
*s1
= sym1
;
1005 const struct sym_match
*s2
= sym2
;
1009 * - if matched length on symbol s1 is the length of that symbol,
1010 * then this symbol should come first;
1011 * - if matched length on symbol s2 is the length of that symbol,
1012 * then this symbol should come first.
1013 * Note: since the search can be a regexp, both symbols may match
1014 * exactly; if this is the case, we can't decide which comes first,
1015 * and we fallback to sorting alphabetically.
1017 exact1
= (s1
->eo
- s1
->so
) == strlen(s1
->sym
->name
);
1018 exact2
= (s2
->eo
- s2
->so
) == strlen(s2
->sym
->name
);
1019 if (exact1
&& !exact2
)
1021 if (!exact1
&& exact2
)
1024 /* As a fallback, sort symbols alphabetically */
1025 return strcmp(s1
->sym
->name
, s2
->sym
->name
);
1028 struct symbol
**sym_re_search(const char *pattern
)
1030 struct symbol
*sym
, **sym_arr
= NULL
;
1031 struct sym_match
*sym_match_arr
= NULL
;
1034 regmatch_t match
[1];
1038 if (strlen(pattern
) == 0)
1040 if (regcomp(&re
, pattern
, REG_EXTENDED
|REG_ICASE
))
1043 for_all_symbols(i
, sym
) {
1044 if (sym
->flags
& SYMBOL_CONST
|| !sym
->name
)
1046 if (regexec(&re
, sym
->name
, 1, match
, 0))
1051 tmp
= realloc(sym_match_arr
, size
* sizeof(struct sym_match
));
1053 goto sym_re_search_free
;
1054 sym_match_arr
= tmp
;
1056 sym_calc_value(sym
);
1057 /* As regexec returned 0, we know we have a match, so
1058 * we can use match[0].rm_[se]o without further checks
1060 sym_match_arr
[cnt
].so
= match
[0].rm_so
;
1061 sym_match_arr
[cnt
].eo
= match
[0].rm_eo
;
1062 sym_match_arr
[cnt
++].sym
= sym
;
1064 if (sym_match_arr
) {
1065 qsort(sym_match_arr
, cnt
, sizeof(struct sym_match
), sym_rel_comp
);
1066 sym_arr
= malloc((cnt
+1) * sizeof(struct symbol
*));
1068 goto sym_re_search_free
;
1069 for (i
= 0; i
< cnt
; i
++)
1070 sym_arr
[i
] = sym_match_arr
[i
].sym
;
1071 sym_arr
[cnt
] = NULL
;
1074 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1075 free(sym_match_arr
);
1082 * When we check for recursive dependencies we use a stack to save
1083 * current state so we can print out relevant info to user.
1084 * The entries are located on the call stack so no need to free memory.
1085 * Note insert() remove() must always match to properly clear the stack.
1087 static struct dep_stack
{
1088 struct dep_stack
*prev
, *next
;
1090 struct property
*prop
;
1094 static void dep_stack_insert(struct dep_stack
*stack
, struct symbol
*sym
)
1096 memset(stack
, 0, sizeof(*stack
));
1098 check_top
->next
= stack
;
1099 stack
->prev
= check_top
;
1104 static void dep_stack_remove(void)
1106 check_top
= check_top
->prev
;
1108 check_top
->next
= NULL
;
1112 * Called when we have detected a recursive dependency.
1113 * check_top point to the top of the stact so we use
1114 * the ->prev pointer to locate the bottom of the stack.
1116 static void sym_check_print_recursive(struct symbol
*last_sym
)
1118 struct dep_stack
*stack
;
1119 struct symbol
*sym
, *next_sym
;
1120 struct menu
*menu
= NULL
;
1121 struct property
*prop
;
1122 struct dep_stack cv_stack
;
1124 if (sym_is_choice_value(last_sym
)) {
1125 dep_stack_insert(&cv_stack
, last_sym
);
1126 last_sym
= prop_get_symbol(sym_get_choice_prop(last_sym
));
1129 for (stack
= check_top
; stack
!= NULL
; stack
= stack
->prev
)
1130 if (stack
->sym
== last_sym
)
1133 fprintf(stderr
, "unexpected recursive dependency error\n");
1137 for (; stack
; stack
= stack
->next
) {
1139 next_sym
= stack
->next
? stack
->next
->sym
: last_sym
;
1142 prop
= stack
->sym
->prop
;
1144 /* for choice values find the menu entry (used below) */
1145 if (sym_is_choice(sym
) || sym_is_choice_value(sym
)) {
1146 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1152 if (stack
->sym
== last_sym
)
1153 fprintf(stderr
, "%s:%d:error: recursive dependency detected!\n",
1154 prop
->file
->name
, prop
->lineno
);
1157 fprintf(stderr
, "%s:%d:\tsymbol %s %s value contains %s\n",
1158 prop
->file
->name
, prop
->lineno
,
1159 sym
->name
? sym
->name
: "<choice>",
1160 prop_get_type_name(prop
->type
),
1161 next_sym
->name
? next_sym
->name
: "<choice>");
1162 } else if (stack
->prop
) {
1163 fprintf(stderr
, "%s:%d:\tsymbol %s depends on %s\n",
1164 prop
->file
->name
, prop
->lineno
,
1165 sym
->name
? sym
->name
: "<choice>",
1166 next_sym
->name
? next_sym
->name
: "<choice>");
1167 } else if (sym_is_choice(sym
)) {
1168 fprintf(stderr
, "%s:%d:\tchoice %s contains symbol %s\n",
1169 menu
->file
->name
, menu
->lineno
,
1170 sym
->name
? sym
->name
: "<choice>",
1171 next_sym
->name
? next_sym
->name
: "<choice>");
1172 } else if (sym_is_choice_value(sym
)) {
1173 fprintf(stderr
, "%s:%d:\tsymbol %s is part of choice %s\n",
1174 menu
->file
->name
, menu
->lineno
,
1175 sym
->name
? sym
->name
: "<choice>",
1176 next_sym
->name
? next_sym
->name
: "<choice>");
1178 fprintf(stderr
, "%s:%d:\tsymbol %s is selected by %s\n",
1179 prop
->file
->name
, prop
->lineno
,
1180 sym
->name
? sym
->name
: "<choice>",
1181 next_sym
->name
? next_sym
->name
: "<choice>");
1186 "For a resolution refer to Documentation/kbuild/kconfig-language.txt\n"
1187 "subsection \"Kconfig recursive dependency limitations\"\n"
1190 if (check_top
== &cv_stack
)
1194 static struct symbol
*sym_check_expr_deps(struct expr
*e
)
1203 sym
= sym_check_expr_deps(e
->left
.expr
);
1206 return sym_check_expr_deps(e
->right
.expr
);
1208 return sym_check_expr_deps(e
->left
.expr
);
1215 sym
= sym_check_deps(e
->left
.sym
);
1218 return sym_check_deps(e
->right
.sym
);
1220 return sym_check_deps(e
->left
.sym
);
1224 fprintf(stderr
, "Oops! How to check %d?\n", e
->type
);
1228 /* return NULL when dependencies are OK */
1229 static struct symbol
*sym_check_sym_deps(struct symbol
*sym
)
1231 struct symbol
*sym2
;
1232 struct property
*prop
;
1233 struct dep_stack stack
;
1235 dep_stack_insert(&stack
, sym
);
1237 sym2
= sym_check_expr_deps(sym
->rev_dep
.expr
);
1241 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1242 if (prop
->type
== P_CHOICE
|| prop
->type
== P_SELECT
)
1245 sym2
= sym_check_expr_deps(prop
->visible
.expr
);
1248 if (prop
->type
!= P_DEFAULT
|| sym_is_choice(sym
))
1250 stack
.expr
= prop
->expr
;
1251 sym2
= sym_check_expr_deps(prop
->expr
);
1263 static struct symbol
*sym_check_choice_deps(struct symbol
*choice
)
1265 struct symbol
*sym
, *sym2
;
1266 struct property
*prop
;
1268 struct dep_stack stack
;
1270 dep_stack_insert(&stack
, choice
);
1272 prop
= sym_get_choice_prop(choice
);
1273 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1274 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1276 choice
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1277 sym2
= sym_check_sym_deps(choice
);
1278 choice
->flags
&= ~SYMBOL_CHECK
;
1282 expr_list_for_each_sym(prop
->expr
, e
, sym
) {
1283 sym2
= sym_check_sym_deps(sym
);
1288 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1289 sym
->flags
&= ~SYMBOL_CHECK
;
1291 if (sym2
&& sym_is_choice_value(sym2
) &&
1292 prop_get_symbol(sym_get_choice_prop(sym2
)) == choice
)
1300 struct symbol
*sym_check_deps(struct symbol
*sym
)
1302 struct symbol
*sym2
;
1303 struct property
*prop
;
1305 if (sym
->flags
& SYMBOL_CHECK
) {
1306 sym_check_print_recursive(sym
);
1309 if (sym
->flags
& SYMBOL_CHECKED
)
1312 if (sym_is_choice_value(sym
)) {
1313 struct dep_stack stack
;
1315 /* for choice groups start the check with main choice symbol */
1316 dep_stack_insert(&stack
, sym
);
1317 prop
= sym_get_choice_prop(sym
);
1318 sym2
= sym_check_deps(prop_get_symbol(prop
));
1320 } else if (sym_is_choice(sym
)) {
1321 sym2
= sym_check_choice_deps(sym
);
1323 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1324 sym2
= sym_check_sym_deps(sym
);
1325 sym
->flags
&= ~SYMBOL_CHECK
;
1328 if (sym2
&& sym2
== sym
)
1334 struct property
*prop_alloc(enum prop_type type
, struct symbol
*sym
)
1336 struct property
*prop
;
1337 struct property
**propp
;
1339 prop
= xmalloc(sizeof(*prop
));
1340 memset(prop
, 0, sizeof(*prop
));
1343 prop
->file
= current_file
;
1344 prop
->lineno
= zconf_lineno();
1346 /* append property to the prop list of symbol */
1348 for (propp
= &sym
->prop
; *propp
; propp
= &(*propp
)->next
)
1356 struct symbol
*prop_get_symbol(struct property
*prop
)
1358 if (prop
->expr
&& (prop
->expr
->type
== E_SYMBOL
||
1359 prop
->expr
->type
== E_LIST
))
1360 return prop
->expr
->left
.sym
;
1364 const char *prop_get_type_name(enum prop_type type
)
1393 static void prop_add_env(const char *env
)
1395 struct symbol
*sym
, *sym2
;
1396 struct property
*prop
;
1399 sym
= current_entry
->sym
;
1400 sym
->flags
|= SYMBOL_AUTO
;
1401 for_all_properties(sym
, prop
, P_ENV
) {
1402 sym2
= prop_get_symbol(prop
);
1403 if (strcmp(sym2
->name
, env
))
1404 menu_warn(current_entry
, "redefining environment symbol from %s",
1409 prop
= prop_alloc(P_ENV
, sym
);
1410 prop
->expr
= expr_alloc_symbol(sym_lookup(env
, SYMBOL_CONST
));
1412 sym_env_list
= expr_alloc_one(E_LIST
, sym_env_list
);
1413 sym_env_list
->right
.sym
= sym
;
1417 sym_add_default(sym
, p
);
1419 menu_warn(current_entry
, "environment variable %s undefined", env
);