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 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_calc_visibility(struct symbol
*sym
)
191 struct property
*prop
;
194 /* any prompt visible? */
196 for_all_prompts(sym
, prop
) {
197 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
198 tri
= EXPR_OR(tri
, prop
->visible
.tri
);
200 if (tri
== mod
&& (sym
->type
!= S_TRISTATE
|| modules_val
== no
))
202 if (sym
->visible
!= tri
) {
204 sym_set_changed(sym
);
206 if (sym_is_choice_value(sym
))
208 /* defaulting to "yes" if no explicit "depends on" are given */
210 if (sym
->dir_dep
.expr
)
211 tri
= expr_calc_value(sym
->dir_dep
.expr
);
214 if (sym
->dir_dep
.tri
!= tri
) {
215 sym
->dir_dep
.tri
= tri
;
216 sym_set_changed(sym
);
219 if (sym
->rev_dep
.expr
)
220 tri
= expr_calc_value(sym
->rev_dep
.expr
);
221 if (tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
223 if (sym
->rev_dep
.tri
!= tri
) {
224 sym
->rev_dep
.tri
= tri
;
225 sym_set_changed(sym
);
230 * Find the default symbol for a choice.
231 * First try the default values for the choice symbol
232 * Next locate the first visible choice value
233 * Return NULL if none was found
235 struct symbol
*sym_choice_default(struct symbol
*sym
)
237 struct symbol
*def_sym
;
238 struct property
*prop
;
241 /* any of the defaults visible? */
242 for_all_defaults(sym
, prop
) {
243 prop
->visible
.tri
= expr_calc_value(prop
->visible
.expr
);
244 if (prop
->visible
.tri
== no
)
246 def_sym
= prop_get_symbol(prop
);
247 if (def_sym
->visible
!= no
)
251 /* just get the first visible value */
252 prop
= sym_get_choice_prop(sym
);
253 expr_list_for_each_sym(prop
->expr
, e
, def_sym
)
254 if (def_sym
->visible
!= no
)
257 /* failed to locate any defaults */
261 static struct symbol
*sym_calc_choice(struct symbol
*sym
)
263 struct symbol
*def_sym
;
264 struct property
*prop
;
268 /* first calculate all choice values' visibilities */
270 prop
= sym_get_choice_prop(sym
);
271 expr_list_for_each_sym(prop
->expr
, e
, def_sym
) {
272 sym_calc_visibility(def_sym
);
273 if (def_sym
->visible
!= no
)
274 flags
&= def_sym
->flags
;
277 sym
->flags
&= flags
| ~SYMBOL_DEF_USER
;
279 /* is the user choice visible? */
280 def_sym
= sym
->def
[S_DEF_USER
].val
;
281 if (def_sym
&& def_sym
->visible
!= no
)
284 def_sym
= sym_choice_default(sym
);
287 /* no choice? reset tristate value */
293 void sym_calc_value(struct symbol
*sym
)
295 struct symbol_value newval
, oldval
;
296 struct property
*prop
;
302 if (sym
->flags
& SYMBOL_VALID
)
305 if (sym_is_choice_value(sym
) &&
306 sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
) {
307 sym
->flags
&= ~SYMBOL_NEED_SET_CHOICE_VALUES
;
308 prop
= sym_get_choice_prop(sym
);
309 sym_calc_value(prop_get_symbol(prop
));
312 sym
->flags
|= SYMBOL_VALID
;
320 newval
= symbol_empty
.curr
;
324 newval
= symbol_no
.curr
;
327 sym
->curr
.val
= sym
->name
;
331 if (!sym_is_choice_value(sym
))
332 sym
->flags
&= ~SYMBOL_WRITE
;
334 sym_calc_visibility(sym
);
336 /* set default if recursively called */
339 switch (sym_get_type(sym
)) {
342 if (sym_is_choice_value(sym
) && sym
->visible
== yes
) {
343 prop
= sym_get_choice_prop(sym
);
344 newval
.tri
= (prop_get_symbol(prop
)->curr
.val
== sym
) ? yes
: no
;
346 if (sym
->visible
!= no
) {
347 /* if the symbol is visible use the user value
348 * if available, otherwise try the default value
350 sym
->flags
|= SYMBOL_WRITE
;
351 if (sym_has_value(sym
)) {
352 newval
.tri
= EXPR_AND(sym
->def
[S_DEF_USER
].tri
,
357 if (sym
->rev_dep
.tri
!= no
)
358 sym
->flags
|= SYMBOL_WRITE
;
359 if (!sym_is_choice(sym
)) {
360 prop
= sym_get_default_prop(sym
);
362 sym
->flags
|= SYMBOL_WRITE
;
363 newval
.tri
= EXPR_AND(expr_calc_value(prop
->expr
),
368 if (sym
->dir_dep
.tri
== no
&& sym
->rev_dep
.tri
!= no
) {
370 e
= expr_simplify_unmet_dep(sym
->rev_dep
.expr
,
372 fprintf(stderr
, "warning: (");
373 expr_fprint(e
, stderr
);
374 fprintf(stderr
, ") selects %s which has unmet direct dependencies (",
376 expr_fprint(sym
->dir_dep
.expr
, stderr
);
377 fprintf(stderr
, ")\n");
380 newval
.tri
= EXPR_OR(newval
.tri
, sym
->rev_dep
.tri
);
382 if (newval
.tri
== mod
&& sym_get_type(sym
) == S_BOOLEAN
)
388 if (sym
->visible
!= no
) {
389 sym
->flags
|= SYMBOL_WRITE
;
390 if (sym_has_value(sym
)) {
391 newval
.val
= sym
->def
[S_DEF_USER
].val
;
395 prop
= sym_get_default_prop(sym
);
397 struct symbol
*ds
= prop_get_symbol(prop
);
399 sym
->flags
|= SYMBOL_WRITE
;
401 newval
.val
= ds
->curr
.val
;
410 if (sym_is_choice(sym
) && newval
.tri
== yes
)
411 sym
->curr
.val
= sym_calc_choice(sym
);
412 sym_validate_range(sym
);
414 if (memcmp(&oldval
, &sym
->curr
, sizeof(oldval
))) {
415 sym_set_changed(sym
);
416 if (modules_sym
== sym
) {
417 sym_set_all_changed();
418 modules_val
= modules_sym
->curr
.tri
;
422 if (sym_is_choice(sym
)) {
423 struct symbol
*choice_sym
;
425 prop
= sym_get_choice_prop(sym
);
426 expr_list_for_each_sym(prop
->expr
, e
, choice_sym
) {
427 if ((sym
->flags
& SYMBOL_WRITE
) &&
428 choice_sym
->visible
!= no
)
429 choice_sym
->flags
|= SYMBOL_WRITE
;
430 if (sym
->flags
& SYMBOL_CHANGED
)
431 sym_set_changed(choice_sym
);
435 if (sym
->flags
& SYMBOL_AUTO
)
436 sym
->flags
&= ~SYMBOL_WRITE
;
438 if (sym
->flags
& SYMBOL_NEED_SET_CHOICE_VALUES
)
439 set_all_choice_values(sym
);
442 void sym_clear_all_valid(void)
447 for_all_symbols(i
, sym
)
448 sym
->flags
&= ~SYMBOL_VALID
;
449 sym_add_change_count(1);
451 sym_calc_value(modules_sym
);
454 void sym_set_changed(struct symbol
*sym
)
456 struct property
*prop
;
458 sym
->flags
|= SYMBOL_CHANGED
;
459 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
461 prop
->menu
->flags
|= MENU_CHANGED
;
465 void sym_set_all_changed(void)
470 for_all_symbols(i
, sym
)
471 sym_set_changed(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
);
920 /* Compare matched symbols as thus:
921 * - first, symbols that match exactly
922 * - then, alphabetical sort
924 static int sym_rel_comp(const void *sym1
, const void *sym2
)
926 const struct sym_match
*s1
= sym1
;
927 const struct sym_match
*s2
= sym2
;
931 * - if matched length on symbol s1 is the length of that symbol,
932 * then this symbol should come first;
933 * - if matched length on symbol s2 is the length of that symbol,
934 * then this symbol should come first.
935 * Note: since the search can be a regexp, both symbols may match
936 * exactly; if this is the case, we can't decide which comes first,
937 * and we fallback to sorting alphabetically.
939 exact1
= (s1
->eo
- s1
->so
) == strlen(s1
->sym
->name
);
940 exact2
= (s2
->eo
- s2
->so
) == strlen(s2
->sym
->name
);
941 if (exact1
&& !exact2
)
943 if (!exact1
&& exact2
)
946 /* As a fallback, sort symbols alphabetically */
947 return strcmp(s1
->sym
->name
, s2
->sym
->name
);
950 struct symbol
**sym_re_search(const char *pattern
)
952 struct symbol
*sym
, **sym_arr
= NULL
;
953 struct sym_match
*sym_match_arr
= NULL
;
960 if (strlen(pattern
) == 0)
962 if (regcomp(&re
, pattern
, REG_EXTENDED
|REG_ICASE
))
965 for_all_symbols(i
, sym
) {
966 if (sym
->flags
& SYMBOL_CONST
|| !sym
->name
)
968 if (regexec(&re
, sym
->name
, 1, match
, 0))
973 tmp
= realloc(sym_match_arr
, size
* sizeof(struct sym_match
));
975 goto sym_re_search_free
;
979 /* As regexec returned 0, we know we have a match, so
980 * we can use match[0].rm_[se]o without further checks
982 sym_match_arr
[cnt
].so
= match
[0].rm_so
;
983 sym_match_arr
[cnt
].eo
= match
[0].rm_eo
;
984 sym_match_arr
[cnt
++].sym
= sym
;
987 qsort(sym_match_arr
, cnt
, sizeof(struct sym_match
), sym_rel_comp
);
988 sym_arr
= malloc((cnt
+1) * sizeof(struct symbol
));
990 goto sym_re_search_free
;
991 for (i
= 0; i
< cnt
; i
++)
992 sym_arr
[i
] = sym_match_arr
[i
].sym
;
996 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1004 * When we check for recursive dependencies we use a stack to save
1005 * current state so we can print out relevant info to user.
1006 * The entries are located on the call stack so no need to free memory.
1007 * Note insert() remove() must always match to properly clear the stack.
1009 static struct dep_stack
{
1010 struct dep_stack
*prev
, *next
;
1012 struct property
*prop
;
1016 static void dep_stack_insert(struct dep_stack
*stack
, struct symbol
*sym
)
1018 memset(stack
, 0, sizeof(*stack
));
1020 check_top
->next
= stack
;
1021 stack
->prev
= check_top
;
1026 static void dep_stack_remove(void)
1028 check_top
= check_top
->prev
;
1030 check_top
->next
= NULL
;
1034 * Called when we have detected a recursive dependency.
1035 * check_top point to the top of the stact so we use
1036 * the ->prev pointer to locate the bottom of the stack.
1038 static void sym_check_print_recursive(struct symbol
*last_sym
)
1040 struct dep_stack
*stack
;
1041 struct symbol
*sym
, *next_sym
;
1042 struct menu
*menu
= NULL
;
1043 struct property
*prop
;
1044 struct dep_stack cv_stack
;
1046 if (sym_is_choice_value(last_sym
)) {
1047 dep_stack_insert(&cv_stack
, last_sym
);
1048 last_sym
= prop_get_symbol(sym_get_choice_prop(last_sym
));
1051 for (stack
= check_top
; stack
!= NULL
; stack
= stack
->prev
)
1052 if (stack
->sym
== last_sym
)
1055 fprintf(stderr
, "unexpected recursive dependency error\n");
1059 for (; stack
; stack
= stack
->next
) {
1061 next_sym
= stack
->next
? stack
->next
->sym
: last_sym
;
1064 prop
= stack
->sym
->prop
;
1066 /* for choice values find the menu entry (used below) */
1067 if (sym_is_choice(sym
) || sym_is_choice_value(sym
)) {
1068 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1074 if (stack
->sym
== last_sym
)
1075 fprintf(stderr
, "%s:%d:error: recursive dependency detected!\n",
1076 prop
->file
->name
, prop
->lineno
);
1078 fprintf(stderr
, "%s:%d:\tsymbol %s %s value contains %s\n",
1079 prop
->file
->name
, prop
->lineno
,
1080 sym
->name
? sym
->name
: "<choice>",
1081 prop_get_type_name(prop
->type
),
1082 next_sym
->name
? next_sym
->name
: "<choice>");
1083 } else if (stack
->prop
) {
1084 fprintf(stderr
, "%s:%d:\tsymbol %s depends on %s\n",
1085 prop
->file
->name
, prop
->lineno
,
1086 sym
->name
? sym
->name
: "<choice>",
1087 next_sym
->name
? next_sym
->name
: "<choice>");
1088 } else if (sym_is_choice(sym
)) {
1089 fprintf(stderr
, "%s:%d:\tchoice %s contains symbol %s\n",
1090 menu
->file
->name
, menu
->lineno
,
1091 sym
->name
? sym
->name
: "<choice>",
1092 next_sym
->name
? next_sym
->name
: "<choice>");
1093 } else if (sym_is_choice_value(sym
)) {
1094 fprintf(stderr
, "%s:%d:\tsymbol %s is part of choice %s\n",
1095 menu
->file
->name
, menu
->lineno
,
1096 sym
->name
? sym
->name
: "<choice>",
1097 next_sym
->name
? next_sym
->name
: "<choice>");
1099 fprintf(stderr
, "%s:%d:\tsymbol %s is selected by %s\n",
1100 prop
->file
->name
, prop
->lineno
,
1101 sym
->name
? sym
->name
: "<choice>",
1102 next_sym
->name
? next_sym
->name
: "<choice>");
1106 if (check_top
== &cv_stack
)
1110 static struct symbol
*sym_check_expr_deps(struct expr
*e
)
1119 sym
= sym_check_expr_deps(e
->left
.expr
);
1122 return sym_check_expr_deps(e
->right
.expr
);
1124 return sym_check_expr_deps(e
->left
.expr
);
1127 sym
= sym_check_deps(e
->left
.sym
);
1130 return sym_check_deps(e
->right
.sym
);
1132 return sym_check_deps(e
->left
.sym
);
1136 printf("Oops! How to check %d?\n", e
->type
);
1140 /* return NULL when dependencies are OK */
1141 static struct symbol
*sym_check_sym_deps(struct symbol
*sym
)
1143 struct symbol
*sym2
;
1144 struct property
*prop
;
1145 struct dep_stack stack
;
1147 dep_stack_insert(&stack
, sym
);
1149 sym2
= sym_check_expr_deps(sym
->rev_dep
.expr
);
1153 for (prop
= sym
->prop
; prop
; prop
= prop
->next
) {
1154 if (prop
->type
== P_CHOICE
|| prop
->type
== P_SELECT
)
1157 sym2
= sym_check_expr_deps(prop
->visible
.expr
);
1160 if (prop
->type
!= P_DEFAULT
|| sym_is_choice(sym
))
1162 stack
.expr
= prop
->expr
;
1163 sym2
= sym_check_expr_deps(prop
->expr
);
1175 static struct symbol
*sym_check_choice_deps(struct symbol
*choice
)
1177 struct symbol
*sym
, *sym2
;
1178 struct property
*prop
;
1180 struct dep_stack stack
;
1182 dep_stack_insert(&stack
, choice
);
1184 prop
= sym_get_choice_prop(choice
);
1185 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1186 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1188 choice
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1189 sym2
= sym_check_sym_deps(choice
);
1190 choice
->flags
&= ~SYMBOL_CHECK
;
1194 expr_list_for_each_sym(prop
->expr
, e
, sym
) {
1195 sym2
= sym_check_sym_deps(sym
);
1200 expr_list_for_each_sym(prop
->expr
, e
, sym
)
1201 sym
->flags
&= ~SYMBOL_CHECK
;
1203 if (sym2
&& sym_is_choice_value(sym2
) &&
1204 prop_get_symbol(sym_get_choice_prop(sym2
)) == choice
)
1212 struct symbol
*sym_check_deps(struct symbol
*sym
)
1214 struct symbol
*sym2
;
1215 struct property
*prop
;
1217 if (sym
->flags
& SYMBOL_CHECK
) {
1218 sym_check_print_recursive(sym
);
1221 if (sym
->flags
& SYMBOL_CHECKED
)
1224 if (sym_is_choice_value(sym
)) {
1225 struct dep_stack stack
;
1227 /* for choice groups start the check with main choice symbol */
1228 dep_stack_insert(&stack
, sym
);
1229 prop
= sym_get_choice_prop(sym
);
1230 sym2
= sym_check_deps(prop_get_symbol(prop
));
1232 } else if (sym_is_choice(sym
)) {
1233 sym2
= sym_check_choice_deps(sym
);
1235 sym
->flags
|= (SYMBOL_CHECK
| SYMBOL_CHECKED
);
1236 sym2
= sym_check_sym_deps(sym
);
1237 sym
->flags
&= ~SYMBOL_CHECK
;
1240 if (sym2
&& sym2
== sym
)
1246 struct property
*prop_alloc(enum prop_type type
, struct symbol
*sym
)
1248 struct property
*prop
;
1249 struct property
**propp
;
1251 prop
= xmalloc(sizeof(*prop
));
1252 memset(prop
, 0, sizeof(*prop
));
1255 prop
->file
= current_file
;
1256 prop
->lineno
= zconf_lineno();
1258 /* append property to the prop list of symbol */
1260 for (propp
= &sym
->prop
; *propp
; propp
= &(*propp
)->next
)
1268 struct symbol
*prop_get_symbol(struct property
*prop
)
1270 if (prop
->expr
&& (prop
->expr
->type
== E_SYMBOL
||
1271 prop
->expr
->type
== E_LIST
))
1272 return prop
->expr
->left
.sym
;
1276 const char *prop_get_type_name(enum prop_type type
)
1303 static void prop_add_env(const char *env
)
1305 struct symbol
*sym
, *sym2
;
1306 struct property
*prop
;
1309 sym
= current_entry
->sym
;
1310 sym
->flags
|= SYMBOL_AUTO
;
1311 for_all_properties(sym
, prop
, P_ENV
) {
1312 sym2
= prop_get_symbol(prop
);
1313 if (strcmp(sym2
->name
, env
))
1314 menu_warn(current_entry
, "redefining environment symbol from %s",
1319 prop
= prop_alloc(P_ENV
, sym
);
1320 prop
->expr
= expr_alloc_symbol(sym_lookup(env
, SYMBOL_CONST
));
1322 sym_env_list
= expr_alloc_one(E_LIST
, sym_env_list
);
1323 sym_env_list
->right
.sym
= sym
;
1327 sym_add_default(sym
, p
);
1329 menu_warn(current_entry
, "environment variable %s undefined", env
);