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
= strdup(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
;
214 /* any prompt visible? */
216 for_all_prompts(sym
, prop
) {
217 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
218 tri
= EXPR_OR(tri
, prop
->visible
.tri
);
220 if (tri
== mod
&& (sym
->type
!= S_TRISTATE
|| modules_val
== no
))
222 if (sym
->visible
!= tri
) {
224 sym_set_changed(sym
);
226 if (sym_is_choice_value(sym
))
228 /* defaulting to "yes" if no explicit "depends on" are given */
230 if (sym
->dir_dep
.expr
)
231 tri
= expr_calc_value(sym
->dir_dep
.expr
);
234 if (sym
->dir_dep
.tri
!= tri
) {
235 sym
->dir_dep
.tri
= tri
;
236 sym_set_changed(sym
);
239 if (sym
->rev_dep
.expr
)
240 tri
= expr_calc_value(sym
->rev_dep
.expr
);
241 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
243 if (sym
->rev_dep
.tri
!= tri
) {
244 sym
->rev_dep
.tri
= tri
;
245 sym_set_changed(sym
);
250 * Find the default symbol for a choice.
251 * First try the default values for the choice symbol
252 * Next locate the first visible choice value
253 * Return NULL if none was found
255 struct symbol
*sym_choice_default(struct symbol
*sym
)
257 struct symbol
*def_sym
;
258 struct property
*prop
;
261 /* any of the defaults visible? */
262 for_all_defaults(sym
, prop
) {
263 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
264 if (prop
->visible
.tri
== no
)
266 def_sym
= prop_get_symbol(prop
);
267 if (def_sym
->visible
!= no
)
271 /* just get the first visible value */
272 prop
= sym_get_choice_prop(sym
);
273 expr_list_for_each_sym(prop
->expr
, e
, def_sym
)
274 if (def_sym
->visible
!= no
)
277 /* failed to locate any defaults */
281 static struct symbol
*sym_calc_choice(struct symbol
*sym
)
283 struct symbol
*def_sym
;
284 struct property
*prop
;
288 /* first calculate all choice values' visibilities */
290 prop
= sym_get_choice_prop(sym
);
291 expr_list_for_each_sym(prop
->expr
, e
, def_sym
) {
292 sym_calc_visibility(def_sym
);
293 if (def_sym
->visible
!= no
)
294 flags
&= def_sym
->flags
;
297 sym
->flags
&= flags
| ~SYMBOL_DEF_USER
;
299 /* is the user choice visible? */
300 def_sym
= sym
->def
[S_DEF_USER
].val
;
301 if (def_sym
&& def_sym
->visible
!= no
)
304 def_sym
= sym_choice_default(sym
);
307 /* no choice? reset tristate value */
313 void sym_calc_value(struct symbol
*sym
)
315 struct symbol_value newval
, oldval
;
316 struct property
*prop
;
322 if (sym
->flags
& SYMBOL_VALID
)
325 if (sym_is_choice_value(sym
) &&
326 sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
) {
327 sym
->flags
&= ~SYMBOL_NEED_SET_CHOICE_VALUES
;
328 prop
= sym_get_choice_prop(sym
);
329 sym_calc_value(prop_get_symbol(prop
));
332 sym
->flags
|= SYMBOL_VALID
;
340 newval
= symbol_empty
.curr
;
344 newval
= symbol_no
.curr
;
347 sym
->curr
.val
= sym
->name
;
351 if (!sym_is_choice_value(sym
))
352 sym
->flags
&= ~SYMBOL_WRITE
;
354 sym_calc_visibility(sym
);
356 /* set default if recursively called */
359 switch (sym_get_type(sym
)) {
362 if (sym_is_choice_value(sym
) && sym
->visible
== yes
) {
363 prop
= sym_get_choice_prop(sym
);
364 newval
.tri
= (prop_get_symbol(prop
)->curr
.val
== sym
) ? yes
: no
;
366 if (sym
->visible
!= no
) {
367 /* if the symbol is visible use the user value
368 * if available, otherwise try the default value
370 sym
->flags
|= SYMBOL_WRITE
;
371 if (sym_has_value(sym
)) {
372 newval
.tri
= EXPR_AND(sym
->def
[S_DEF_USER
].tri
,
377 if (sym
->rev_dep
.tri
!= no
)
378 sym
->flags
|= SYMBOL_WRITE
;
379 if (!sym_is_choice(sym
)) {
380 prop
= sym_get_default_prop(sym
);
382 sym
->flags
|= SYMBOL_WRITE
;
383 newval
.tri
= EXPR_AND(expr_calc_value(prop
->expr
),
388 if (sym
->dir_dep
.tri
== no
&& sym
->rev_dep
.tri
!= no
) {
390 e
= expr_simplify_unmet_dep(sym
->rev_dep
.expr
,
392 fprintf(stderr
, "warning: (");
393 expr_fprint(e
, stderr
);
394 fprintf(stderr
, ") selects %s which has unmet direct dependencies (",
396 expr_fprint(sym
->dir_dep
.expr
, stderr
);
397 fprintf(stderr
, ")\n");
400 newval
.tri
= EXPR_OR(newval
.tri
, sym
->rev_dep
.tri
);
402 if (newval
.tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
408 if (sym
->visible
!= no
) {
409 sym
->flags
|= SYMBOL_WRITE
;
410 if (sym_has_value(sym
)) {
411 newval
.val
= sym
->def
[S_DEF_USER
].val
;
415 prop
= sym_get_default_prop(sym
);
417 struct symbol
*ds
= prop_get_symbol(prop
);
419 sym
->flags
|= SYMBOL_WRITE
;
421 newval
.val
= ds
->curr
.val
;
430 if (sym_is_choice(sym
) && newval
.tri
== yes
)
431 sym
->curr
.val
= sym_calc_choice(sym
);
432 sym_validate_range(sym
);
434 if (memcmp(&oldval
, &sym
->curr
, sizeof(oldval
))) {
435 sym_set_changed(sym
);
436 if (modules_sym
== sym
) {
437 sym_set_all_changed();
438 modules_val
= modules_sym
->curr
.tri
;
442 if (sym_is_choice(sym
)) {
443 struct symbol
*choice_sym
;
445 prop
= sym_get_choice_prop(sym
);
446 expr_list_for_each_sym(prop
->expr
, e
, choice_sym
) {
447 if ((sym
->flags
& SYMBOL_WRITE
) &&
448 choice_sym
->visible
!= no
)
449 choice_sym
->flags
|= SYMBOL_WRITE
;
450 if (sym
->flags
& SYMBOL_CHANGED
)
451 sym_set_changed(choice_sym
);
455 if (sym
->flags
& SYMBOL_AUTO
)
456 sym
->flags
&= ~SYMBOL_WRITE
;
458 if (sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
)
459 set_all_choice_values(sym
);
462 void sym_clear_all_valid(void)
467 for_all_symbols(i
, sym
)
468 sym
->flags
&= ~SYMBOL_VALID
;
469 sym_add_change_count(1);
471 sym_calc_value(modules_sym
);
474 bool sym_tristate_within_range(struct symbol
*sym
, tristate val
)
476 int type
= sym_get_type(sym
);
478 if (sym
->visible
== no
)
481 if (type
!= S_BOOLEAN
&& type
!= S_TRISTATE
)
484 if (type
== S_BOOLEAN
&& val
== mod
)
486 if (sym
->visible
<= sym
->rev_dep
.tri
)
488 if (sym_is_choice_value(sym
) && sym
->visible
== yes
)
490 return val
>= sym
->rev_dep
.tri
&& val
<= sym
->visible
;
493 bool sym_set_tristate_value(struct symbol
*sym
, tristate val
)
495 tristate oldval
= sym_get_tristate_value(sym
);
497 if (oldval
!= val
&& !sym_tristate_within_range(sym
, val
))
500 if (!(sym
->flags
& SYMBOL_DEF_USER
)) {
501 sym
->flags
|= SYMBOL_DEF_USER
;
502 sym_set_changed(sym
);
505 * setting a choice value also resets the new flag of the choice
506 * symbol and all other choice values.
508 if (sym_is_choice_value(sym
) && val
== yes
) {
509 struct symbol
*cs
= prop_get_symbol(sym_get_choice_prop(sym
));
510 struct property
*prop
;
513 cs
->def
[S_DEF_USER
].val
= sym
;
514 cs
->flags
|= SYMBOL_DEF_USER
;
515 prop
= sym_get_choice_prop(cs
);
516 for (e
= prop
->expr
; e
; e
= e
->left
.expr
) {
517 if (e
->right
.sym
->visible
!= no
)
518 e
->right
.sym
->flags
|= SYMBOL_DEF_USER
;
522 sym
->def
[S_DEF_USER
].tri
= val
;
524 sym_clear_all_valid();
529 tristate
sym_toggle_tristate_value(struct symbol
*sym
)
531 tristate oldval
, newval
;
533 oldval
= newval
= sym_get_tristate_value(sym
);
546 if (sym_set_tristate_value(sym
, newval
))
548 } while (oldval
!= newval
);
552 bool sym_string_valid(struct symbol
*sym
, const char *str
)
565 if (ch
== '0' && *str
!= 0)
567 while ((ch
= *str
++)) {
573 if (str
[0] == '0' && (str
[1] == 'x' || str
[1] == 'X'))
579 } while ((ch
= *str
++));
595 bool sym_string_within_range(struct symbol
*sym
, const char *str
)
597 struct property
*prop
;
602 return sym_string_valid(sym
, str
);
604 if (!sym_string_valid(sym
, str
))
606 prop
= sym_get_range_prop(sym
);
609 val
= strtoll(str
, NULL
, 10);
610 return val
>= sym_get_range_val(prop
->expr
->left
.sym
, 10) &&
611 val
<= sym_get_range_val(prop
->expr
->right
.sym
, 10);
613 if (!sym_string_valid(sym
, str
))
615 prop
= sym_get_range_prop(sym
);
618 val
= strtoll(str
, NULL
, 16);
619 return val
>= sym_get_range_val(prop
->expr
->left
.sym
, 16) &&
620 val
<= sym_get_range_val(prop
->expr
->right
.sym
, 16);
625 return sym_tristate_within_range(sym
, yes
);
627 return sym_tristate_within_range(sym
, mod
);
629 return sym_tristate_within_range(sym
, no
);
637 bool sym_set_string_value(struct symbol
*sym
, const char *newval
)
648 return sym_set_tristate_value(sym
, yes
);
650 return sym_set_tristate_value(sym
, mod
);
652 return sym_set_tristate_value(sym
, no
);
659 if (!sym_string_within_range(sym
, newval
))
662 if (!(sym
->flags
& SYMBOL_DEF_USER
)) {
663 sym
->flags
|= SYMBOL_DEF_USER
;
664 sym_set_changed(sym
);
667 oldval
= sym
->def
[S_DEF_USER
].val
;
668 size
= strlen(newval
) + 1;
669 if (sym
->type
== S_HEX
&& (newval
[0] != '0' || (newval
[1] != 'x' && newval
[1] != 'X'))) {
671 sym
->def
[S_DEF_USER
].val
= val
= xmalloc(size
);
674 } else if (!oldval
|| strcmp(oldval
, newval
))
675 sym
->def
[S_DEF_USER
].val
= val
= xmalloc(size
);
680 free((void *)oldval
);
681 sym_clear_all_valid();
687 * Find the default value associated to a symbol.
688 * For tristate symbol handle the modules=n case
689 * in which case "m" becomes "y".
690 * If the symbol does not have any default then fallback
691 * to the fixed default values.
693 const char *sym_get_string_default(struct symbol
*sym
)
695 struct property
*prop
;
700 sym_calc_visibility(sym
);
701 sym_calc_value(modules_sym
);
702 val
= symbol_no
.curr
.tri
;
703 str
= symbol_empty
.curr
.val
;
705 /* If symbol has a default value look it up */
706 prop
= sym_get_default_prop(sym
);
711 /* The visibility may limit the value from yes => mod */
712 val
= EXPR_AND(expr_calc_value(prop
->expr
), prop
->visible
.tri
);
716 * The following fails to handle the situation
717 * where a default value is further limited by
720 ds
= prop_get_symbol(prop
);
723 str
= (const char *)ds
->curr
.val
;
728 /* Handle select statements */
729 val
= EXPR_OR(val
, sym
->rev_dep
.tri
);
731 /* transpose mod to yes if modules are not enabled */
733 if (!sym_is_choice_value(sym
) && modules_sym
->curr
.tri
== no
)
736 /* transpose mod to yes if type is bool */
737 if (sym
->type
== S_BOOLEAN
&& val
== mod
)
745 case mod
: return "m";
746 case yes
: return "y";
760 const char *sym_get_string_value(struct symbol
*sym
)
767 val
= sym_get_tristate_value(sym
);
772 sym_calc_value(modules_sym
);
773 return (modules_sym
->curr
.tri
== no
) ? "n" : "m";
781 return (const char *)sym
->curr
.val
;
784 bool sym_is_changable(struct symbol
*sym
)
786 return sym
->visible
> sym
->rev_dep
.tri
;
789 static unsigned strhash(const char *s
)
792 unsigned hash
= 2166136261U;
794 hash
= (hash
^ *s
) * 0x01000193;
798 struct symbol
*sym_lookup(const char *name
, int flags
)
800 struct symbol
*symbol
;
805 if (name
[0] && !name
[1]) {
807 case 'y': return &symbol_yes
;
808 case 'm': return &symbol_mod
;
809 case 'n': return &symbol_no
;
812 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
814 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
816 !strcmp(symbol
->name
, name
) &&
817 (flags
? symbol
->flags
& flags
818 : !(symbol
->flags
& (SYMBOL_CONST
|SYMBOL_CHOICE
))))
821 new_name
= strdup(name
);
827 symbol
= xmalloc(sizeof(*symbol
));
828 memset(symbol
, 0, sizeof(*symbol
));
829 symbol
->name
= new_name
;
830 symbol
->type
= S_UNKNOWN
;
831 symbol
->flags
|= flags
;
833 symbol
->next
= symbol_hash
[hash
];
834 symbol_hash
[hash
] = symbol
;
839 struct symbol
*sym_find(const char *name
)
841 struct symbol
*symbol
= NULL
;
847 if (name
[0] && !name
[1]) {
849 case 'y': return &symbol_yes
;
850 case 'm': return &symbol_mod
;
851 case 'n': return &symbol_no
;
854 hash
= strhash(name
) % SYMBOL_HASHSIZE
;
856 for (symbol
= symbol_hash
[hash
]; symbol
; symbol
= symbol
->next
) {
858 !strcmp(symbol
->name
, name
) &&
859 !(symbol
->flags
& SYMBOL_CONST
))
867 * Expand symbol's names embedded in the string given in argument. Symbols'
868 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
871 const char *sym_expand_string_value(const char *in
)
877 reslen
= strlen(in
) + 1;
878 res
= xmalloc(reslen
);
881 while ((src
= strchr(in
, '$'))) {
882 char *p
, name
[SYMBOL_MAXLENGTH
];
883 const char *symval
= "";
887 strncat(res
, in
, src
- in
);
891 while (isalnum(*src
) || *src
== '_')
895 sym
= sym_find(name
);
898 symval
= sym_get_string_value(sym
);
901 newlen
= strlen(res
) + strlen(symval
) + strlen(src
) + 1;
902 if (newlen
> reslen
) {
904 res
= realloc(res
, reslen
);
915 const char *sym_escape_string_value(const char *in
)
922 reslen
= strlen(in
) + strlen("\"\"") + 1;
926 l
= strcspn(p
, "\"\\");
936 res
= xmalloc(reslen
);
943 l
= strcspn(p
, "\"\\");
951 strncat(res
, p
++, 1);
963 /* Compare matched symbols as thus:
964 * - first, symbols that match exactly
965 * - then, alphabetical sort
967 static int sym_rel_comp(const void *sym1
, const void *sym2
)
969 const struct sym_match
*s1
= sym1
;
970 const struct sym_match
*s2
= sym2
;
974 * - if matched length on symbol s1 is the length of that symbol,
975 * then this symbol should come first;
976 * - if matched length on symbol s2 is the length of that symbol,
977 * then this symbol should come first.
978 * Note: since the search can be a regexp, both symbols may match
979 * exactly; if this is the case, we can't decide which comes first,
980 * and we fallback to sorting alphabetically.
982 exact1
= (s1
->eo
- s1
->so
) == strlen(s1
->sym
->name
);
983 exact2
= (s2
->eo
- s2
->so
) == strlen(s2
->sym
->name
);
984 if (exact1
&& !exact2
)
986 if (!exact1
&& exact2
)
989 /* As a fallback, sort symbols alphabetically */
990 return strcmp(s1
->sym
->name
, s2
->sym
->name
);
993 struct symbol
**sym_re_search(const char *pattern
)
995 struct symbol
*sym
, **sym_arr
= NULL
;
996 struct sym_match
*sym_match_arr
= NULL
;
1003 if (strlen(pattern
) == 0)
1005 if (regcomp(&re
, pattern
, REG_EXTENDED
|REG_ICASE
))
1008 for_all_symbols(i
, sym
) {
1009 if (sym
->flags
& SYMBOL_CONST
|| !sym
->name
)
1011 if (regexec(&re
, sym
->name
, 1, match
, 0))
1016 tmp
= realloc(sym_match_arr
, size
* sizeof(struct sym_match
));
1018 goto sym_re_search_free
;
1019 sym_match_arr
= tmp
;
1021 sym_calc_value(sym
);
1022 /* As regexec returned 0, we know we have a match, so
1023 * we can use match[0].rm_[se]o without further checks
1025 sym_match_arr
[cnt
].so
= match
[0].rm_so
;
1026 sym_match_arr
[cnt
].eo
= match
[0].rm_eo
;
1027 sym_match_arr
[cnt
++].sym
= sym
;
1029 if (sym_match_arr
) {
1030 qsort(sym_match_arr
, cnt
, sizeof(struct sym_match
), sym_rel_comp
);
1031 sym_arr
= malloc((cnt
+1) * sizeof(struct symbol
));
1033 goto sym_re_search_free
;
1034 for (i
= 0; i
< cnt
; i
++)
1035 sym_arr
[i
] = sym_match_arr
[i
].sym
;
1036 sym_arr
[cnt
] = NULL
;
1039 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1040 free(sym_match_arr
);
1047 * When we check for recursive dependencies we use a stack to save
1048 * current state so we can print out relevant info to user.
1049 * The entries are located on the call stack so no need to free memory.
1050 * Note insert() remove() must always match to properly clear the stack.
1052 static struct dep_stack
{
1053 struct dep_stack
*prev
, *next
;
1055 struct property
*prop
;
1059 static void dep_stack_insert(struct dep_stack
*stack
, struct symbol
*sym
)
1061 memset(stack
, 0, sizeof(*stack
));
1063 check_top
->next
= stack
;
1064 stack
->prev
= check_top
;
1069 static void dep_stack_remove(void)
1071 check_top
= check_top
->prev
;
1073 check_top
->next
= NULL
;
1077 * Called when we have detected a recursive dependency.
1078 * check_top point to the top of the stact so we use
1079 * the ->prev pointer to locate the bottom of the stack.
1081 static void sym_check_print_recursive(struct symbol
*last_sym
)
1083 struct dep_stack
*stack
;
1084 struct symbol
*sym
, *next_sym
;
1085 struct menu
*menu
= NULL
;
1086 struct property
*prop
;
1087 struct dep_stack cv_stack
;
1089 if (sym_is_choice_value(last_sym
)) {
1090 dep_stack_insert(&cv_stack
, last_sym
);
1091 last_sym
= prop_get_symbol(sym_get_choice_prop(last_sym
));
1094 for (stack
= check_top
; stack
!= NULL
; stack
= stack
->prev
)
1095 if (stack
->sym
== last_sym
)
1098 fprintf(stderr
, "unexpected recursive dependency error\n");
1102 for (; stack
; stack
= stack
->next
) {
1104 next_sym
= stack
->next
? stack
->next
->sym
: last_sym
;
1107 prop
= stack
->sym
->prop
;
1109 /* for choice values find the menu entry (used below) */
1110 if (sym_is_choice(sym
) || sym_is_choice_value(sym
)) {
1111 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1117 if (stack
->sym
== last_sym
)
1118 fprintf(stderr
, "%s:%d:error: recursive dependency detected!\n",
1119 prop
->file
->name
, prop
->lineno
);
1121 fprintf(stderr
, "%s:%d:\tsymbol %s %s value contains %s\n",
1122 prop
->file
->name
, prop
->lineno
,
1123 sym
->name
? sym
->name
: "<choice>",
1124 prop_get_type_name(prop
->type
),
1125 next_sym
->name
? next_sym
->name
: "<choice>");
1126 } else if (stack
->prop
) {
1127 fprintf(stderr
, "%s:%d:\tsymbol %s depends on %s\n",
1128 prop
->file
->name
, prop
->lineno
,
1129 sym
->name
? sym
->name
: "<choice>",
1130 next_sym
->name
? next_sym
->name
: "<choice>");
1131 } else if (sym_is_choice(sym
)) {
1132 fprintf(stderr
, "%s:%d:\tchoice %s contains symbol %s\n",
1133 menu
->file
->name
, menu
->lineno
,
1134 sym
->name
? sym
->name
: "<choice>",
1135 next_sym
->name
? next_sym
->name
: "<choice>");
1136 } else if (sym_is_choice_value(sym
)) {
1137 fprintf(stderr
, "%s:%d:\tsymbol %s is part of choice %s\n",
1138 menu
->file
->name
, menu
->lineno
,
1139 sym
->name
? sym
->name
: "<choice>",
1140 next_sym
->name
? next_sym
->name
: "<choice>");
1142 fprintf(stderr
, "%s:%d:\tsymbol %s is selected by %s\n",
1143 prop
->file
->name
, prop
->lineno
,
1144 sym
->name
? sym
->name
: "<choice>",
1145 next_sym
->name
? next_sym
->name
: "<choice>");
1149 if (check_top
== &cv_stack
)
1153 static struct symbol
*sym_check_expr_deps(struct expr
*e
)
1162 sym
= sym_check_expr_deps(e
->left
.expr
);
1165 return sym_check_expr_deps(e
->right
.expr
);
1167 return sym_check_expr_deps(e
->left
.expr
);
1174 sym
= sym_check_deps(e
->left
.sym
);
1177 return sym_check_deps(e
->right
.sym
);
1179 return sym_check_deps(e
->left
.sym
);
1183 printf("Oops! How to check %d?\n", e
->type
);
1187 /* return NULL when dependencies are OK */
1188 static struct symbol
*sym_check_sym_deps(struct symbol
*sym
)
1190 struct symbol
*sym2
;
1191 struct property
*prop
;
1192 struct dep_stack stack
;
1194 dep_stack_insert(&stack
, sym
);
1196 sym2
= sym_check_expr_deps(sym
->rev_dep
.expr
);
1200 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1201 if (prop
->type
== P_CHOICE
|| prop
->type
== P_SELECT
)
1204 sym2
= sym_check_expr_deps(prop
->visible
.expr
);
1207 if (prop
->type
!= P_DEFAULT
|| sym_is_choice(sym
))
1209 stack
.expr
= prop
->expr
;
1210 sym2
= sym_check_expr_deps(prop
->expr
);
1222 static struct symbol
*sym_check_choice_deps(struct symbol
*choice
)
1224 struct symbol
*sym
, *sym2
;
1225 struct property
*prop
;
1227 struct dep_stack stack
;
1229 dep_stack_insert(&stack
, choice
);
1231 prop
= sym_get_choice_prop(choice
);
1232 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1233 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1235 choice
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1236 sym2
= sym_check_sym_deps(choice
);
1237 choice
->flags
&= ~SYMBOL_CHECK
;
1241 expr_list_for_each_sym(prop
->expr
, e
, sym
) {
1242 sym2
= sym_check_sym_deps(sym
);
1247 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1248 sym
->flags
&= ~SYMBOL_CHECK
;
1250 if (sym2
&& sym_is_choice_value(sym2
) &&
1251 prop_get_symbol(sym_get_choice_prop(sym2
)) == choice
)
1259 struct symbol
*sym_check_deps(struct symbol
*sym
)
1261 struct symbol
*sym2
;
1262 struct property
*prop
;
1264 if (sym
->flags
& SYMBOL_CHECK
) {
1265 sym_check_print_recursive(sym
);
1268 if (sym
->flags
& SYMBOL_CHECKED
)
1271 if (sym_is_choice_value(sym
)) {
1272 struct dep_stack stack
;
1274 /* for choice groups start the check with main choice symbol */
1275 dep_stack_insert(&stack
, sym
);
1276 prop
= sym_get_choice_prop(sym
);
1277 sym2
= sym_check_deps(prop_get_symbol(prop
));
1279 } else if (sym_is_choice(sym
)) {
1280 sym2
= sym_check_choice_deps(sym
);
1282 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1283 sym2
= sym_check_sym_deps(sym
);
1284 sym
->flags
&= ~SYMBOL_CHECK
;
1287 if (sym2
&& sym2
== sym
)
1293 struct property
*prop_alloc(enum prop_type type
, struct symbol
*sym
)
1295 struct property
*prop
;
1296 struct property
**propp
;
1298 prop
= xmalloc(sizeof(*prop
));
1299 memset(prop
, 0, sizeof(*prop
));
1302 prop
->file
= current_file
;
1303 prop
->lineno
= zconf_lineno();
1305 /* append property to the prop list of symbol */
1307 for (propp
= &sym
->prop
; *propp
; propp
= &(*propp
)->next
)
1315 struct symbol
*prop_get_symbol(struct property
*prop
)
1317 if (prop
->expr
&& (prop
->expr
->type
== E_SYMBOL
||
1318 prop
->expr
->type
== E_LIST
))
1319 return prop
->expr
->left
.sym
;
1323 const char *prop_get_type_name(enum prop_type type
)
1350 static void prop_add_env(const char *env
)
1352 struct symbol
*sym
, *sym2
;
1353 struct property
*prop
;
1356 sym
= current_entry
->sym
;
1357 sym
->flags
|= SYMBOL_AUTO
;
1358 for_all_properties(sym
, prop
, P_ENV
) {
1359 sym2
= prop_get_symbol(prop
);
1360 if (strcmp(sym2
->name
, env
))
1361 menu_warn(current_entry
, "redefining environment symbol from %s",
1366 prop
= prop_alloc(P_ENV
, sym
);
1367 prop
->expr
= expr_alloc_symbol(sym_lookup(env
, SYMBOL_CONST
));
1369 sym_env_list
= expr_alloc_one(E_LIST
, sym_env_list
);
1370 sym_env_list
->right
.sym
= sym
;
1374 sym_add_default(sym
, p
);
1376 menu_warn(current_entry
, "environment variable %s undefined", env
);