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;
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 if (!sym_is_choice_value(sym))
375 sym->flags &= ~SYMBOL_WRITE;
377 sym_calc_visibility(sym);
379 /* set default if recursively called */
382 switch (sym_get_type(sym)) {
385 if (sym_is_choice_value(sym) && sym->visible == yes) {
386 prop = sym_get_choice_prop(sym);
387 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
389 if (sym->visible != no) {
390 /* if the symbol is visible use the user value
391 * if available, otherwise try the default value
393 sym->flags |= SYMBOL_WRITE;
394 if (sym_has_value(sym)) {
395 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
400 if (sym->rev_dep.tri != no)
401 sym->flags |= SYMBOL_WRITE;
402 if (!sym_is_choice(sym)) {
403 prop = sym_get_default_prop(sym);
405 sym->flags |= SYMBOL_WRITE;
406 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
409 if (sym->implied.tri != no) {
410 sym->flags |= SYMBOL_WRITE;
411 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
415 if (sym->dir_dep.tri == no && sym->rev_dep.tri != no) {
417 e = expr_simplify_unmet_dep(sym->rev_dep.expr,
419 fprintf(stderr, "warning: (");
420 expr_fprint(e, stderr);
421 fprintf(stderr, ") selects %s which has unmet direct dependencies (",
423 expr_fprint(sym->dir_dep.expr, stderr);
424 fprintf(stderr, ")\n");
427 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
429 if (newval.tri == mod &&
430 (sym_get_type(sym) == S_BOOLEAN || sym->implied.tri == yes))
436 if (sym->visible != no) {
437 sym->flags |= SYMBOL_WRITE;
438 if (sym_has_value(sym)) {
439 newval.val = sym->def[S_DEF_USER].val;
443 prop = sym_get_default_prop(sym);
445 struct symbol *ds = prop_get_symbol(prop);
447 sym->flags |= SYMBOL_WRITE;
449 newval.val = ds->curr.val;
458 if (sym_is_choice(sym) && newval.tri == yes)
459 sym->curr.val = sym_calc_choice(sym);
460 sym_validate_range(sym);
462 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
463 sym_set_changed(sym);
464 if (modules_sym == sym) {
465 sym_set_all_changed();
466 modules_val = modules_sym->curr.tri;
470 if (sym_is_choice(sym)) {
471 struct symbol *choice_sym;
473 prop = sym_get_choice_prop(sym);
474 expr_list_for_each_sym(prop->expr, e, choice_sym) {
475 if ((sym->flags & SYMBOL_WRITE) &&
476 choice_sym->visible != no)
477 choice_sym->flags |= SYMBOL_WRITE;
478 if (sym->flags & SYMBOL_CHANGED)
479 sym_set_changed(choice_sym);
483 if (sym->flags & SYMBOL_AUTO)
484 sym->flags &= ~SYMBOL_WRITE;
486 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
487 set_all_choice_values(sym);
490 void sym_clear_all_valid(void)
495 for_all_symbols(i, sym)
496 sym->flags &= ~SYMBOL_VALID;
497 sym_add_change_count(1);
498 sym_calc_value(modules_sym);
501 bool sym_tristate_within_range(struct symbol *sym, tristate val)
503 int type = sym_get_type(sym);
505 if (sym->visible == no)
508 if (type != S_BOOLEAN && type != S_TRISTATE)
511 if (type == S_BOOLEAN && val == mod)
513 if (sym->visible <= sym->rev_dep.tri)
515 if (sym->implied.tri == yes && val == mod)
517 if (sym_is_choice_value(sym) && sym->visible == yes)
519 return val >= sym->rev_dep.tri && val <= sym->visible;
522 bool sym_set_tristate_value(struct symbol *sym, tristate val)
524 tristate oldval = sym_get_tristate_value(sym);
526 if (oldval != val && !sym_tristate_within_range(sym, val))
529 if (!(sym->flags & SYMBOL_DEF_USER)) {
530 sym->flags |= SYMBOL_DEF_USER;
531 sym_set_changed(sym);
534 * setting a choice value also resets the new flag of the choice
535 * symbol and all other choice values.
537 if (sym_is_choice_value(sym) && val == yes) {
538 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
539 struct property *prop;
542 cs->def[S_DEF_USER].val = sym;
543 cs->flags |= SYMBOL_DEF_USER;
544 prop = sym_get_choice_prop(cs);
545 for (e = prop->expr; e; e = e->left.expr) {
546 if (e->right.sym->visible != no)
547 e->right.sym->flags |= SYMBOL_DEF_USER;
551 sym->def[S_DEF_USER].tri = val;
553 sym_clear_all_valid();
558 tristate sym_toggle_tristate_value(struct symbol *sym)
560 tristate oldval, newval;
562 oldval = newval = sym_get_tristate_value(sym);
575 if (sym_set_tristate_value(sym, newval))
577 } while (oldval != newval);
581 bool sym_string_valid(struct symbol *sym, const char *str)
594 if (ch == '0' && *str != 0)
596 while ((ch = *str++)) {
602 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
608 } while ((ch = *str++));
624 bool sym_string_within_range(struct symbol *sym, const char *str)
626 struct property *prop;
631 return sym_string_valid(sym, str);
633 if (!sym_string_valid(sym, str))
635 prop = sym_get_range_prop(sym);
638 val = strtoll(str, NULL, 10);
639 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
640 val <= sym_get_range_val(prop->expr->right.sym, 10);
642 if (!sym_string_valid(sym, str))
644 prop = sym_get_range_prop(sym);
647 val = strtoll(str, NULL, 16);
648 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
649 val <= sym_get_range_val(prop->expr->right.sym, 16);
654 return sym_tristate_within_range(sym, yes);
656 return sym_tristate_within_range(sym, mod);
658 return sym_tristate_within_range(sym, no);
666 bool sym_set_string_value(struct symbol *sym, const char *newval)
677 return sym_set_tristate_value(sym, yes);
679 return sym_set_tristate_value(sym, mod);
681 return sym_set_tristate_value(sym, no);
688 if (!sym_string_within_range(sym, newval))
691 if (!(sym->flags & SYMBOL_DEF_USER)) {
692 sym->flags |= SYMBOL_DEF_USER;
693 sym_set_changed(sym);
696 oldval = sym->def[S_DEF_USER].val;
697 size = strlen(newval) + 1;
698 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
700 sym->def[S_DEF_USER].val = val = xmalloc(size);
703 } else if (!oldval || strcmp(oldval, newval))
704 sym->def[S_DEF_USER].val = val = xmalloc(size);
709 free((void *)oldval);
710 sym_clear_all_valid();
716 * Find the default value associated to a symbol.
717 * For tristate symbol handle the modules=n case
718 * in which case "m" becomes "y".
719 * If the symbol does not have any default then fallback
720 * to the fixed default values.
722 const char *sym_get_string_default(struct symbol *sym)
724 struct property *prop;
729 sym_calc_visibility(sym);
730 sym_calc_value(modules_sym);
731 val = symbol_no.curr.tri;
732 str = symbol_empty.curr.val;
734 /* If symbol has a default value look it up */
735 prop = sym_get_default_prop(sym);
740 /* The visibility may limit the value from yes => mod */
741 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
745 * The following fails to handle the situation
746 * where a default value is further limited by
749 ds = prop_get_symbol(prop);
752 str = (const char *)ds->curr.val;
757 /* Handle select statements */
758 val = EXPR_OR(val, sym->rev_dep.tri);
760 /* transpose mod to yes if modules are not enabled */
762 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
765 /* transpose mod to yes if type is bool */
766 if (sym->type == S_BOOLEAN && val == mod)
769 /* adjust the default value if this symbol is implied by another */
770 if (val < sym->implied.tri)
771 val = sym->implied.tri;
778 case mod: return "m";
779 case yes: return "y";
793 const char *sym_get_string_value(struct symbol *sym)
800 val = sym_get_tristate_value(sym);
805 sym_calc_value(modules_sym);
806 return (modules_sym->curr.tri == no) ? "n" : "m";
814 return (const char *)sym->curr.val;
817 bool sym_is_changable(struct symbol *sym)
819 return sym->visible > sym->rev_dep.tri;
822 static unsigned strhash(const char *s)
825 unsigned hash = 2166136261U;
827 hash = (hash ^ *s) * 0x01000193;
831 struct symbol *sym_lookup(const char *name, int flags)
833 struct symbol *symbol;
838 if (name[0] && !name[1]) {
840 case 'y': return &symbol_yes;
841 case 'm': return &symbol_mod;
842 case 'n': return &symbol_no;
845 hash = strhash(name) % SYMBOL_HASHSIZE;
847 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
849 !strcmp(symbol->name, name) &&
850 (flags ? symbol->flags & flags
851 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
854 new_name = strdup(name);
860 symbol = xmalloc(sizeof(*symbol));
861 memset(symbol, 0, sizeof(*symbol));
862 symbol->name = new_name;
863 symbol->type = S_UNKNOWN;
864 symbol->flags |= flags;
866 symbol->next = symbol_hash[hash];
867 symbol_hash[hash] = symbol;
872 struct symbol *sym_find(const char *name)
874 struct symbol *symbol = NULL;
880 if (name[0] && !name[1]) {
882 case 'y': return &symbol_yes;
883 case 'm': return &symbol_mod;
884 case 'n': return &symbol_no;
887 hash = strhash(name) % SYMBOL_HASHSIZE;
889 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
891 !strcmp(symbol->name, name) &&
892 !(symbol->flags & SYMBOL_CONST))
900 * Expand symbol's names embedded in the string given in argument. Symbols'
901 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
904 const char *sym_expand_string_value(const char *in)
910 reslen = strlen(in) + 1;
911 res = xmalloc(reslen);
914 while ((src = strchr(in, '$'))) {
915 char *p, name[SYMBOL_MAXLENGTH];
916 const char *symval = "";
920 strncat(res, in, src - in);
924 while (isalnum(*src) || *src == '_')
928 sym = sym_find(name);
931 symval = sym_get_string_value(sym);
934 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
935 if (newlen > reslen) {
937 res = realloc(res, reslen);
948 const char *sym_escape_string_value(const char *in)
955 reslen = strlen(in) + strlen("\"\"") + 1;
959 l = strcspn(p, "\"\\");
969 res = xmalloc(reslen);
976 l = strcspn(p, "\"\\");
984 strncat(res, p++, 1);
996 /* Compare matched symbols as thus:
997 * - first, symbols that match exactly
998 * - then, alphabetical sort
1000 static int sym_rel_comp(const void *sym1, const void *sym2)
1002 const struct sym_match *s1 = sym1;
1003 const struct sym_match *s2 = sym2;
1007 * - if matched length on symbol s1 is the length of that symbol,
1008 * then this symbol should come first;
1009 * - if matched length on symbol s2 is the length of that symbol,
1010 * then this symbol should come first.
1011 * Note: since the search can be a regexp, both symbols may match
1012 * exactly; if this is the case, we can't decide which comes first,
1013 * and we fallback to sorting alphabetically.
1015 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
1016 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
1017 if (exact1 && !exact2)
1019 if (!exact1 && exact2)
1022 /* As a fallback, sort symbols alphabetically */
1023 return strcmp(s1->sym->name, s2->sym->name);
1026 struct symbol **sym_re_search(const char *pattern)
1028 struct symbol *sym, **sym_arr = NULL;
1029 struct sym_match *sym_match_arr = NULL;
1032 regmatch_t match[1];
1036 if (strlen(pattern) == 0)
1038 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1041 for_all_symbols(i, sym) {
1042 if (sym->flags & SYMBOL_CONST || !sym->name)
1044 if (regexec(&re, sym->name, 1, match, 0))
1049 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
1051 goto sym_re_search_free;
1052 sym_match_arr = tmp;
1054 sym_calc_value(sym);
1055 /* As regexec returned 0, we know we have a match, so
1056 * we can use match[0].rm_[se]o without further checks
1058 sym_match_arr[cnt].so = match[0].rm_so;
1059 sym_match_arr[cnt].eo = match[0].rm_eo;
1060 sym_match_arr[cnt++].sym = sym;
1062 if (sym_match_arr) {
1063 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
1064 sym_arr = malloc((cnt+1) * sizeof(struct symbol));
1066 goto sym_re_search_free;
1067 for (i = 0; i < cnt; i++)
1068 sym_arr[i] = sym_match_arr[i].sym;
1069 sym_arr[cnt] = NULL;
1072 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
1073 free(sym_match_arr);
1080 * When we check for recursive dependencies we use a stack to save
1081 * current state so we can print out relevant info to user.
1082 * The entries are located on the call stack so no need to free memory.
1083 * Note insert() remove() must always match to properly clear the stack.
1085 static struct dep_stack {
1086 struct dep_stack *prev, *next;
1088 struct property *prop;
1092 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1094 memset(stack, 0, sizeof(*stack));
1096 check_top->next = stack;
1097 stack->prev = check_top;
1102 static void dep_stack_remove(void)
1104 check_top = check_top->prev;
1106 check_top->next = NULL;
1110 * Called when we have detected a recursive dependency.
1111 * check_top point to the top of the stact so we use
1112 * the ->prev pointer to locate the bottom of the stack.
1114 static void sym_check_print_recursive(struct symbol *last_sym)
1116 struct dep_stack *stack;
1117 struct symbol *sym, *next_sym;
1118 struct menu *menu = NULL;
1119 struct property *prop;
1120 struct dep_stack cv_stack;
1122 if (sym_is_choice_value(last_sym)) {
1123 dep_stack_insert(&cv_stack, last_sym);
1124 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1127 for (stack = check_top; stack != NULL; stack = stack->prev)
1128 if (stack->sym == last_sym)
1131 fprintf(stderr, "unexpected recursive dependency error\n");
1135 for (; stack; stack = stack->next) {
1137 next_sym = stack->next ? stack->next->sym : last_sym;
1140 prop = stack->sym->prop;
1142 /* for choice values find the menu entry (used below) */
1143 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1144 for (prop = sym->prop; prop; prop = prop->next) {
1150 if (stack->sym == last_sym)
1151 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1152 prop->file->name, prop->lineno);
1153 fprintf(stderr, "For a resolution refer to Documentation/kbuild/kconfig-language.txt\n");
1154 fprintf(stderr, "subsection \"Kconfig recursive dependency limitations\"\n");
1156 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1157 prop->file->name, prop->lineno,
1158 sym->name ? sym->name : "<choice>",
1159 prop_get_type_name(prop->type),
1160 next_sym->name ? next_sym->name : "<choice>");
1161 } else if (stack->prop) {
1162 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1163 prop->file->name, prop->lineno,
1164 sym->name ? sym->name : "<choice>",
1165 next_sym->name ? next_sym->name : "<choice>");
1166 } else if (sym_is_choice(sym)) {
1167 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1168 menu->file->name, menu->lineno,
1169 sym->name ? sym->name : "<choice>",
1170 next_sym->name ? next_sym->name : "<choice>");
1171 } else if (sym_is_choice_value(sym)) {
1172 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1173 menu->file->name, menu->lineno,
1174 sym->name ? sym->name : "<choice>",
1175 next_sym->name ? next_sym->name : "<choice>");
1177 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1178 prop->file->name, prop->lineno,
1179 sym->name ? sym->name : "<choice>",
1180 next_sym->name ? next_sym->name : "<choice>");
1184 if (check_top == &cv_stack)
1188 static struct symbol *sym_check_expr_deps(struct expr *e)
1197 sym = sym_check_expr_deps(e->left.expr);
1200 return sym_check_expr_deps(e->right.expr);
1202 return sym_check_expr_deps(e->left.expr);
1209 sym = sym_check_deps(e->left.sym);
1212 return sym_check_deps(e->right.sym);
1214 return sym_check_deps(e->left.sym);
1218 printf("Oops! How to check %d?\n", e->type);
1222 /* return NULL when dependencies are OK */
1223 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1225 struct symbol *sym2;
1226 struct property *prop;
1227 struct dep_stack stack;
1229 dep_stack_insert(&stack, sym);
1231 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1235 for (prop = sym->prop; prop; prop = prop->next) {
1236 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1239 sym2 = sym_check_expr_deps(prop->visible.expr);
1242 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1244 stack.expr = prop->expr;
1245 sym2 = sym_check_expr_deps(prop->expr);
1257 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1259 struct symbol *sym, *sym2;
1260 struct property *prop;
1262 struct dep_stack stack;
1264 dep_stack_insert(&stack, choice);
1266 prop = sym_get_choice_prop(choice);
1267 expr_list_for_each_sym(prop->expr, e, sym)
1268 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1270 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1271 sym2 = sym_check_sym_deps(choice);
1272 choice->flags &= ~SYMBOL_CHECK;
1276 expr_list_for_each_sym(prop->expr, e, sym) {
1277 sym2 = sym_check_sym_deps(sym);
1282 expr_list_for_each_sym(prop->expr, e, sym)
1283 sym->flags &= ~SYMBOL_CHECK;
1285 if (sym2 && sym_is_choice_value(sym2) &&
1286 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1294 struct symbol *sym_check_deps(struct symbol *sym)
1296 struct symbol *sym2;
1297 struct property *prop;
1299 if (sym->flags & SYMBOL_CHECK) {
1300 sym_check_print_recursive(sym);
1303 if (sym->flags & SYMBOL_CHECKED)
1306 if (sym_is_choice_value(sym)) {
1307 struct dep_stack stack;
1309 /* for choice groups start the check with main choice symbol */
1310 dep_stack_insert(&stack, sym);
1311 prop = sym_get_choice_prop(sym);
1312 sym2 = sym_check_deps(prop_get_symbol(prop));
1314 } else if (sym_is_choice(sym)) {
1315 sym2 = sym_check_choice_deps(sym);
1317 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1318 sym2 = sym_check_sym_deps(sym);
1319 sym->flags &= ~SYMBOL_CHECK;
1322 if (sym2 && sym2 == sym)
1328 struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1330 struct property *prop;
1331 struct property **propp;
1333 prop = xmalloc(sizeof(*prop));
1334 memset(prop, 0, sizeof(*prop));
1337 prop->file = current_file;
1338 prop->lineno = zconf_lineno();
1340 /* append property to the prop list of symbol */
1342 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1350 struct symbol *prop_get_symbol(struct property *prop)
1352 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1353 prop->expr->type == E_LIST))
1354 return prop->expr->left.sym;
1358 const char *prop_get_type_name(enum prop_type type)
1387 static void prop_add_env(const char *env)
1389 struct symbol *sym, *sym2;
1390 struct property *prop;
1393 sym = current_entry->sym;
1394 sym->flags |= SYMBOL_AUTO;
1395 for_all_properties(sym, prop, P_ENV) {
1396 sym2 = prop_get_symbol(prop);
1397 if (strcmp(sym2->name, env))
1398 menu_warn(current_entry, "redefining environment symbol from %s",
1403 prop = prop_alloc(P_ENV, sym);
1404 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1406 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1407 sym_env_list->right.sym = sym;
1411 sym_add_default(sym, p);
1413 menu_warn(current_entry, "environment variable %s undefined", env);