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);
246 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
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 static void sym_warn_unmet_dep(struct symbol *sym)
338 struct gstr gs = str_new();
341 "\nWARNING: unmet direct dependencies detected for %s\n",
344 " Depends on [%c]: ",
345 sym->dir_dep.tri == mod ? 'm' : 'n');
346 expr_gstr_print(sym->dir_dep.expr, &gs);
347 str_printf(&gs, "\n");
349 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, yes,
350 " Selected by [y]:\n");
351 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, mod,
352 " Selected by [m]:\n");
354 fputs(str_get(&gs), stderr);
357 void sym_calc_value(struct symbol *sym)
359 struct symbol_value newval, oldval;
360 struct property *prop;
366 if (sym->flags & SYMBOL_VALID)
369 if (sym_is_choice_value(sym) &&
370 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
371 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
372 prop = sym_get_choice_prop(sym);
373 sym_calc_value(prop_get_symbol(prop));
376 sym->flags |= SYMBOL_VALID;
384 newval = symbol_empty.curr;
388 newval = symbol_no.curr;
391 sym->curr.val = sym->name;
395 sym->flags &= ~SYMBOL_WRITE;
397 sym_calc_visibility(sym);
399 if (sym->visible != no)
400 sym->flags |= SYMBOL_WRITE;
402 /* set default if recursively called */
405 switch (sym_get_type(sym)) {
408 if (sym_is_choice_value(sym) && sym->visible == yes) {
409 prop = sym_get_choice_prop(sym);
410 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
412 if (sym->visible != no) {
413 /* if the symbol is visible use the user value
414 * if available, otherwise try the default value
416 if (sym_has_value(sym)) {
417 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
422 if (sym->rev_dep.tri != no)
423 sym->flags |= SYMBOL_WRITE;
424 if (!sym_is_choice(sym)) {
425 prop = sym_get_default_prop(sym);
427 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
429 if (newval.tri != no)
430 sym->flags |= SYMBOL_WRITE;
432 if (sym->implied.tri != no) {
433 sym->flags |= SYMBOL_WRITE;
434 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
438 if (sym->dir_dep.tri < sym->rev_dep.tri)
439 sym_warn_unmet_dep(sym);
440 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
442 if (newval.tri == mod &&
443 (sym_get_type(sym) == S_BOOLEAN || sym->implied.tri == yes))
449 if (sym->visible != no && sym_has_value(sym)) {
450 newval.val = sym->def[S_DEF_USER].val;
453 prop = sym_get_default_prop(sym);
455 struct symbol *ds = prop_get_symbol(prop);
457 sym->flags |= SYMBOL_WRITE;
459 newval.val = ds->curr.val;
468 if (sym_is_choice(sym) && newval.tri == yes)
469 sym->curr.val = sym_calc_choice(sym);
470 sym_validate_range(sym);
472 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
473 sym_set_changed(sym);
474 if (modules_sym == sym) {
475 sym_set_all_changed();
476 modules_val = modules_sym->curr.tri;
480 if (sym_is_choice(sym)) {
481 struct symbol *choice_sym;
483 prop = sym_get_choice_prop(sym);
484 expr_list_for_each_sym(prop->expr, e, choice_sym) {
485 if ((sym->flags & SYMBOL_WRITE) &&
486 choice_sym->visible != no)
487 choice_sym->flags |= SYMBOL_WRITE;
488 if (sym->flags & SYMBOL_CHANGED)
489 sym_set_changed(choice_sym);
493 if (sym->flags & SYMBOL_AUTO)
494 sym->flags &= ~SYMBOL_WRITE;
496 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
497 set_all_choice_values(sym);
500 void sym_clear_all_valid(void)
505 for_all_symbols(i, sym)
506 sym->flags &= ~SYMBOL_VALID;
507 sym_add_change_count(1);
508 sym_calc_value(modules_sym);
511 bool sym_tristate_within_range(struct symbol *sym, tristate val)
513 int type = sym_get_type(sym);
515 if (sym->visible == no)
518 if (type != S_BOOLEAN && type != S_TRISTATE)
521 if (type == S_BOOLEAN && val == mod)
523 if (sym->visible <= sym->rev_dep.tri)
525 if (sym->implied.tri == yes && val == mod)
527 if (sym_is_choice_value(sym) && sym->visible == yes)
529 return val >= sym->rev_dep.tri && val <= sym->visible;
532 bool sym_set_tristate_value(struct symbol *sym, tristate val)
534 tristate oldval = sym_get_tristate_value(sym);
536 if (oldval != val && !sym_tristate_within_range(sym, val))
539 if (!(sym->flags & SYMBOL_DEF_USER)) {
540 sym->flags |= SYMBOL_DEF_USER;
541 sym_set_changed(sym);
544 * setting a choice value also resets the new flag of the choice
545 * symbol and all other choice values.
547 if (sym_is_choice_value(sym) && val == yes) {
548 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
549 struct property *prop;
552 cs->def[S_DEF_USER].val = sym;
553 cs->flags |= SYMBOL_DEF_USER;
554 prop = sym_get_choice_prop(cs);
555 for (e = prop->expr; e; e = e->left.expr) {
556 if (e->right.sym->visible != no)
557 e->right.sym->flags |= SYMBOL_DEF_USER;
561 sym->def[S_DEF_USER].tri = val;
563 sym_clear_all_valid();
568 tristate sym_toggle_tristate_value(struct symbol *sym)
570 tristate oldval, newval;
572 oldval = newval = sym_get_tristate_value(sym);
585 if (sym_set_tristate_value(sym, newval))
587 } while (oldval != newval);
591 bool sym_string_valid(struct symbol *sym, const char *str)
604 if (ch == '0' && *str != 0)
606 while ((ch = *str++)) {
612 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
618 } while ((ch = *str++));
634 bool sym_string_within_range(struct symbol *sym, const char *str)
636 struct property *prop;
641 return sym_string_valid(sym, str);
643 if (!sym_string_valid(sym, str))
645 prop = sym_get_range_prop(sym);
648 val = strtoll(str, NULL, 10);
649 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
650 val <= sym_get_range_val(prop->expr->right.sym, 10);
652 if (!sym_string_valid(sym, str))
654 prop = sym_get_range_prop(sym);
657 val = strtoll(str, NULL, 16);
658 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
659 val <= sym_get_range_val(prop->expr->right.sym, 16);
664 return sym_tristate_within_range(sym, yes);
666 return sym_tristate_within_range(sym, mod);
668 return sym_tristate_within_range(sym, no);
676 bool sym_set_string_value(struct symbol *sym, const char *newval)
687 return sym_set_tristate_value(sym, yes);
689 return sym_set_tristate_value(sym, mod);
691 return sym_set_tristate_value(sym, no);
698 if (!sym_string_within_range(sym, newval))
701 if (!(sym->flags & SYMBOL_DEF_USER)) {
702 sym->flags |= SYMBOL_DEF_USER;
703 sym_set_changed(sym);
706 oldval = sym->def[S_DEF_USER].val;
707 size = strlen(newval) + 1;
708 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
710 sym->def[S_DEF_USER].val = val = xmalloc(size);
713 } else if (!oldval || strcmp(oldval, newval))
714 sym->def[S_DEF_USER].val = val = xmalloc(size);
719 free((void *)oldval);
720 sym_clear_all_valid();
726 * Find the default value associated to a symbol.
727 * For tristate symbol handle the modules=n case
728 * in which case "m" becomes "y".
729 * If the symbol does not have any default then fallback
730 * to the fixed default values.
732 const char *sym_get_string_default(struct symbol *sym)
734 struct property *prop;
739 sym_calc_visibility(sym);
740 sym_calc_value(modules_sym);
741 val = symbol_no.curr.tri;
742 str = symbol_empty.curr.val;
744 /* If symbol has a default value look it up */
745 prop = sym_get_default_prop(sym);
750 /* The visibility may limit the value from yes => mod */
751 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
755 * The following fails to handle the situation
756 * where a default value is further limited by
759 ds = prop_get_symbol(prop);
762 str = (const char *)ds->curr.val;
767 /* Handle select statements */
768 val = EXPR_OR(val, sym->rev_dep.tri);
770 /* transpose mod to yes if modules are not enabled */
772 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
775 /* transpose mod to yes if type is bool */
776 if (sym->type == S_BOOLEAN && val == mod)
779 /* adjust the default value if this symbol is implied by another */
780 if (val < sym->implied.tri)
781 val = sym->implied.tri;
788 case mod: return "m";
789 case yes: return "y";
803 const char *sym_get_string_value(struct symbol *sym)
810 val = sym_get_tristate_value(sym);
815 sym_calc_value(modules_sym);
816 return (modules_sym->curr.tri == no) ? "n" : "m";
824 return (const char *)sym->curr.val;
827 bool sym_is_changable(struct symbol *sym)
829 return sym->visible > sym->rev_dep.tri;
832 static unsigned strhash(const char *s)
835 unsigned hash = 2166136261U;
837 hash = (hash ^ *s) * 0x01000193;
841 struct symbol *sym_lookup(const char *name, int flags)
843 struct symbol *symbol;
848 if (name[0] && !name[1]) {
850 case 'y': return &symbol_yes;
851 case 'm': return &symbol_mod;
852 case 'n': return &symbol_no;
855 hash = strhash(name) % SYMBOL_HASHSIZE;
857 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
859 !strcmp(symbol->name, name) &&
860 (flags ? symbol->flags & flags
861 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
864 new_name = xstrdup(name);
870 symbol = xmalloc(sizeof(*symbol));
871 memset(symbol, 0, sizeof(*symbol));
872 symbol->name = new_name;
873 symbol->type = S_UNKNOWN;
874 symbol->flags |= flags;
876 symbol->next = symbol_hash[hash];
877 symbol_hash[hash] = symbol;
882 struct symbol *sym_find(const char *name)
884 struct symbol *symbol = NULL;
890 if (name[0] && !name[1]) {
892 case 'y': return &symbol_yes;
893 case 'm': return &symbol_mod;
894 case 'n': return &symbol_no;
897 hash = strhash(name) % SYMBOL_HASHSIZE;
899 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
901 !strcmp(symbol->name, name) &&
902 !(symbol->flags & SYMBOL_CONST))
910 * Expand symbol's names embedded in the string given in argument. Symbols'
911 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
914 char *sym_expand_string_value(const char *in)
921 * Note: 'in' might come from a token that's about to be
922 * freed, so make sure to always allocate a new string
924 reslen = strlen(in) + 1;
925 res = xmalloc(reslen);
928 while ((src = strchr(in, '$'))) {
929 char *p, name[SYMBOL_MAXLENGTH];
930 const char *symval = "";
934 strncat(res, in, src - in);
938 while (isalnum(*src) || *src == '_')
942 sym = sym_find(name);
945 symval = sym_get_string_value(sym);
948 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
949 if (newlen > reslen) {
951 res = xrealloc(res, reslen);
962 const char *sym_escape_string_value(const char *in)
969 reslen = strlen(in) + strlen("\"\"") + 1;
973 l = strcspn(p, "\"\\");
983 res = xmalloc(reslen);
990 l = strcspn(p, "\"\\");
998 strncat(res, p++, 1);
1010 /* Compare matched symbols as thus:
1011 * - first, symbols that match exactly
1012 * - then, alphabetical sort
1014 static int sym_rel_comp(const void *sym1, const void *sym2)
1016 const struct sym_match *s1 = sym1;
1017 const struct sym_match *s2 = sym2;
1021 * - if matched length on symbol s1 is the length of that symbol,
1022 * then this symbol should come first;
1023 * - if matched length on symbol s2 is the length of that symbol,
1024 * then this symbol should come first.
1025 * Note: since the search can be a regexp, both symbols may match
1026 * exactly; if this is the case, we can't decide which comes first,
1027 * and we fallback to sorting alphabetically.
1029 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
1030 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
1031 if (exact1 && !exact2)
1033 if (!exact1 && exact2)
1036 /* As a fallback, sort symbols alphabetically */
1037 return strcmp(s1->sym->name, s2->sym->name);
1040 struct symbol **sym_re_search(const char *pattern)
1042 struct symbol *sym, **sym_arr = NULL;
1043 struct sym_match *sym_match_arr = NULL;
1046 regmatch_t match[1];
1050 if (strlen(pattern) == 0)
1052 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1055 for_all_symbols(i, sym) {
1056 if (sym->flags & SYMBOL_CONST || !sym->name)
1058 if (regexec(&re, sym->name, 1, match, 0))
1063 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
1065 goto sym_re_search_free;
1066 sym_match_arr = tmp;
1068 sym_calc_value(sym);
1069 /* As regexec returned 0, we know we have a match, so
1070 * we can use match[0].rm_[se]o without further checks
1072 sym_match_arr[cnt].so = match[0].rm_so;
1073 sym_match_arr[cnt].eo = match[0].rm_eo;
1074 sym_match_arr[cnt++].sym = sym;
1076 if (sym_match_arr) {
1077 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
1078 sym_arr = malloc((cnt+1) * sizeof(struct symbol *));
1080 goto sym_re_search_free;
1081 for (i = 0; i < cnt; i++)
1082 sym_arr[i] = sym_match_arr[i].sym;
1083 sym_arr[cnt] = NULL;
1086 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1087 free(sym_match_arr);
1094 * When we check for recursive dependencies we use a stack to save
1095 * current state so we can print out relevant info to user.
1096 * The entries are located on the call stack so no need to free memory.
1097 * Note insert() remove() must always match to properly clear the stack.
1099 static struct dep_stack {
1100 struct dep_stack *prev, *next;
1102 struct property *prop;
1106 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1108 memset(stack, 0, sizeof(*stack));
1110 check_top->next = stack;
1111 stack->prev = check_top;
1116 static void dep_stack_remove(void)
1118 check_top = check_top->prev;
1120 check_top->next = NULL;
1124 * Called when we have detected a recursive dependency.
1125 * check_top point to the top of the stact so we use
1126 * the ->prev pointer to locate the bottom of the stack.
1128 static void sym_check_print_recursive(struct symbol *last_sym)
1130 struct dep_stack *stack;
1131 struct symbol *sym, *next_sym;
1132 struct menu *menu = NULL;
1133 struct property *prop;
1134 struct dep_stack cv_stack;
1136 if (sym_is_choice_value(last_sym)) {
1137 dep_stack_insert(&cv_stack, last_sym);
1138 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1141 for (stack = check_top; stack != NULL; stack = stack->prev)
1142 if (stack->sym == last_sym)
1145 fprintf(stderr, "unexpected recursive dependency error\n");
1149 for (; stack; stack = stack->next) {
1151 next_sym = stack->next ? stack->next->sym : last_sym;
1154 prop = stack->sym->prop;
1156 /* for choice values find the menu entry (used below) */
1157 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1158 for (prop = sym->prop; prop; prop = prop->next) {
1164 if (stack->sym == last_sym)
1165 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1166 prop->file->name, prop->lineno);
1169 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1170 prop->file->name, prop->lineno,
1171 sym->name ? sym->name : "<choice>",
1172 prop_get_type_name(prop->type),
1173 next_sym->name ? next_sym->name : "<choice>");
1174 } else if (stack->prop) {
1175 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1176 prop->file->name, prop->lineno,
1177 sym->name ? sym->name : "<choice>",
1178 next_sym->name ? next_sym->name : "<choice>");
1179 } else if (sym_is_choice(sym)) {
1180 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1181 menu->file->name, menu->lineno,
1182 sym->name ? sym->name : "<choice>",
1183 next_sym->name ? next_sym->name : "<choice>");
1184 } else if (sym_is_choice_value(sym)) {
1185 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1186 menu->file->name, menu->lineno,
1187 sym->name ? sym->name : "<choice>",
1188 next_sym->name ? next_sym->name : "<choice>");
1190 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1191 prop->file->name, prop->lineno,
1192 sym->name ? sym->name : "<choice>",
1193 next_sym->name ? next_sym->name : "<choice>");
1198 "For a resolution refer to Documentation/kbuild/kconfig-language.txt\n"
1199 "subsection \"Kconfig recursive dependency limitations\"\n"
1202 if (check_top == &cv_stack)
1206 static struct symbol *sym_check_expr_deps(struct expr *e)
1215 sym = sym_check_expr_deps(e->left.expr);
1218 return sym_check_expr_deps(e->right.expr);
1220 return sym_check_expr_deps(e->left.expr);
1227 sym = sym_check_deps(e->left.sym);
1230 return sym_check_deps(e->right.sym);
1232 return sym_check_deps(e->left.sym);
1236 fprintf(stderr, "Oops! How to check %d?\n", e->type);
1240 /* return NULL when dependencies are OK */
1241 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1243 struct symbol *sym2;
1244 struct property *prop;
1245 struct dep_stack stack;
1247 dep_stack_insert(&stack, sym);
1249 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1253 for (prop = sym->prop; prop; prop = prop->next) {
1254 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1257 sym2 = sym_check_expr_deps(prop->visible.expr);
1260 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1262 stack.expr = prop->expr;
1263 sym2 = sym_check_expr_deps(prop->expr);
1275 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1277 struct symbol *sym, *sym2;
1278 struct property *prop;
1280 struct dep_stack stack;
1282 dep_stack_insert(&stack, choice);
1284 prop = sym_get_choice_prop(choice);
1285 expr_list_for_each_sym(prop->expr, e, sym)
1286 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1288 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1289 sym2 = sym_check_sym_deps(choice);
1290 choice->flags &= ~SYMBOL_CHECK;
1294 expr_list_for_each_sym(prop->expr, e, sym) {
1295 sym2 = sym_check_sym_deps(sym);
1300 expr_list_for_each_sym(prop->expr, e, sym)
1301 sym->flags &= ~SYMBOL_CHECK;
1303 if (sym2 && sym_is_choice_value(sym2) &&
1304 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1312 struct symbol *sym_check_deps(struct symbol *sym)
1314 struct symbol *sym2;
1315 struct property *prop;
1317 if (sym->flags & SYMBOL_CHECK) {
1318 sym_check_print_recursive(sym);
1321 if (sym->flags & SYMBOL_CHECKED)
1324 if (sym_is_choice_value(sym)) {
1325 struct dep_stack stack;
1327 /* for choice groups start the check with main choice symbol */
1328 dep_stack_insert(&stack, sym);
1329 prop = sym_get_choice_prop(sym);
1330 sym2 = sym_check_deps(prop_get_symbol(prop));
1332 } else if (sym_is_choice(sym)) {
1333 sym2 = sym_check_choice_deps(sym);
1335 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1336 sym2 = sym_check_sym_deps(sym);
1337 sym->flags &= ~SYMBOL_CHECK;
1340 if (sym2 && sym2 == sym)
1346 struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1348 struct property *prop;
1349 struct property **propp;
1351 prop = xmalloc(sizeof(*prop));
1352 memset(prop, 0, sizeof(*prop));
1355 prop->file = current_file;
1356 prop->lineno = zconf_lineno();
1358 /* append property to the prop list of symbol */
1360 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1368 struct symbol *prop_get_symbol(struct property *prop)
1370 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1371 prop->expr->type == E_LIST))
1372 return prop->expr->left.sym;
1376 const char *prop_get_type_name(enum prop_type type)
1405 static void prop_add_env(const char *env)
1407 struct symbol *sym, *sym2;
1408 struct property *prop;
1411 sym = current_entry->sym;
1412 sym->flags |= SYMBOL_AUTO;
1413 for_all_properties(sym, prop, P_ENV) {
1414 sym2 = prop_get_symbol(prop);
1415 if (strcmp(sym2->name, env))
1416 menu_warn(current_entry, "redefining environment symbol from %s",
1421 prop = prop_alloc(P_ENV, sym);
1422 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1424 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1425 sym_env_list->right.sym = sym;
1429 sym_add_default(sym, p);
1431 menu_warn(current_entry, "environment variable %s undefined", env);