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 sym_get_range_val(struct symbol *sym, int base)
152 return strtol(sym->curr.val, NULL, base);
155 static void sym_validate_range(struct symbol *sym)
157 struct property *prop;
158 long base, val, val2;
171 prop = sym_get_range_prop(sym);
174 val = strtol(sym->curr.val, NULL, base);
175 val2 = sym_get_range_val(prop->expr->left.sym, base);
177 val2 = sym_get_range_val(prop->expr->right.sym, base);
181 if (sym->type == S_INT)
182 sprintf(str, "%ld", val2);
184 sprintf(str, "0x%lx", val2);
185 sym->curr.val = strdup(str);
188 static void sym_calc_visibility(struct symbol *sym)
190 struct property *prop;
193 /* any prompt visible? */
195 for_all_prompts(sym, prop) {
196 prop->visible.tri = expr_calc_value(prop->visible.expr);
197 tri = EXPR_OR(tri, prop->visible.tri);
199 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
201 if (sym->visible != tri) {
203 sym_set_changed(sym);
205 if (sym_is_choice_value(sym))
207 /* defaulting to "yes" if no explicit "depends on" are given */
209 if (sym->dir_dep.expr)
210 tri = expr_calc_value(sym->dir_dep.expr);
213 if (sym->dir_dep.tri != tri) {
214 sym->dir_dep.tri = tri;
215 sym_set_changed(sym);
218 if (sym->rev_dep.expr)
219 tri = expr_calc_value(sym->rev_dep.expr);
220 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
222 if (sym->rev_dep.tri != tri) {
223 sym->rev_dep.tri = tri;
224 sym_set_changed(sym);
229 * Find the default symbol for a choice.
230 * First try the default values for the choice symbol
231 * Next locate the first visible choice value
232 * Return NULL if none was found
234 struct symbol *sym_choice_default(struct symbol *sym)
236 struct symbol *def_sym;
237 struct property *prop;
240 /* any of the defaults visible? */
241 for_all_defaults(sym, prop) {
242 prop->visible.tri = expr_calc_value(prop->visible.expr);
243 if (prop->visible.tri == no)
245 def_sym = prop_get_symbol(prop);
246 if (def_sym->visible != no)
250 /* just get the first visible value */
251 prop = sym_get_choice_prop(sym);
252 expr_list_for_each_sym(prop->expr, e, def_sym)
253 if (def_sym->visible != no)
256 /* failed to locate any defaults */
260 static struct symbol *sym_calc_choice(struct symbol *sym)
262 struct symbol *def_sym;
263 struct property *prop;
267 /* first calculate all choice values' visibilities */
269 prop = sym_get_choice_prop(sym);
270 expr_list_for_each_sym(prop->expr, e, def_sym) {
271 sym_calc_visibility(def_sym);
272 if (def_sym->visible != no)
273 flags &= def_sym->flags;
276 sym->flags &= flags | ~SYMBOL_DEF_USER;
278 /* is the user choice visible? */
279 def_sym = sym->def[S_DEF_USER].val;
280 if (def_sym && def_sym->visible != no)
283 def_sym = sym_choice_default(sym);
286 /* no choice? reset tristate value */
292 void sym_calc_value(struct symbol *sym)
294 struct symbol_value newval, oldval;
295 struct property *prop;
301 if (sym->flags & SYMBOL_VALID)
304 if (sym_is_choice_value(sym) &&
305 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
306 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
307 prop = sym_get_choice_prop(sym);
308 sym_calc_value(prop_get_symbol(prop));
311 sym->flags |= SYMBOL_VALID;
319 newval = symbol_empty.curr;
323 newval = symbol_no.curr;
326 sym->curr.val = sym->name;
330 if (!sym_is_choice_value(sym))
331 sym->flags &= ~SYMBOL_WRITE;
333 sym_calc_visibility(sym);
335 /* set default if recursively called */
338 switch (sym_get_type(sym)) {
341 if (sym_is_choice_value(sym) && sym->visible == yes) {
342 prop = sym_get_choice_prop(sym);
343 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
345 if (sym->visible != no) {
346 /* if the symbol is visible use the user value
347 * if available, otherwise try the default value
349 sym->flags |= SYMBOL_WRITE;
350 if (sym_has_value(sym)) {
351 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
356 if (sym->rev_dep.tri != no)
357 sym->flags |= SYMBOL_WRITE;
358 if (!sym_is_choice(sym)) {
359 prop = sym_get_default_prop(sym);
361 sym->flags |= SYMBOL_WRITE;
362 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
367 if (sym->dir_dep.tri == no && sym->rev_dep.tri != no) {
369 e = expr_simplify_unmet_dep(sym->rev_dep.expr,
371 fprintf(stderr, "warning: (");
372 expr_fprint(e, stderr);
373 fprintf(stderr, ") selects %s which has unmet direct dependencies (",
375 expr_fprint(sym->dir_dep.expr, stderr);
376 fprintf(stderr, ")\n");
379 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
381 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
387 if (sym->visible != no) {
388 sym->flags |= SYMBOL_WRITE;
389 if (sym_has_value(sym)) {
390 newval.val = sym->def[S_DEF_USER].val;
394 prop = sym_get_default_prop(sym);
396 struct symbol *ds = prop_get_symbol(prop);
398 sym->flags |= SYMBOL_WRITE;
400 newval.val = ds->curr.val;
409 if (sym_is_choice(sym) && newval.tri == yes)
410 sym->curr.val = sym_calc_choice(sym);
411 sym_validate_range(sym);
413 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
414 sym_set_changed(sym);
415 if (modules_sym == sym) {
416 sym_set_all_changed();
417 modules_val = modules_sym->curr.tri;
421 if (sym_is_choice(sym)) {
422 struct symbol *choice_sym;
424 prop = sym_get_choice_prop(sym);
425 expr_list_for_each_sym(prop->expr, e, choice_sym) {
426 if ((sym->flags & SYMBOL_WRITE) &&
427 choice_sym->visible != no)
428 choice_sym->flags |= SYMBOL_WRITE;
429 if (sym->flags & SYMBOL_CHANGED)
430 sym_set_changed(choice_sym);
434 if (sym->flags & SYMBOL_AUTO)
435 sym->flags &= ~SYMBOL_WRITE;
437 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
438 set_all_choice_values(sym);
441 void sym_clear_all_valid(void)
446 for_all_symbols(i, sym)
447 sym->flags &= ~SYMBOL_VALID;
448 sym_add_change_count(1);
450 sym_calc_value(modules_sym);
453 void sym_set_changed(struct symbol *sym)
455 struct property *prop;
457 sym->flags |= SYMBOL_CHANGED;
458 for (prop = sym->prop; prop; prop = prop->next) {
460 prop->menu->flags |= MENU_CHANGED;
464 void sym_set_all_changed(void)
469 for_all_symbols(i, sym)
470 sym_set_changed(sym);
473 bool sym_tristate_within_range(struct symbol *sym, tristate val)
475 int type = sym_get_type(sym);
477 if (sym->visible == no)
480 if (type != S_BOOLEAN && type != S_TRISTATE)
483 if (type == S_BOOLEAN && val == mod)
485 if (sym->visible <= sym->rev_dep.tri)
487 if (sym_is_choice_value(sym) && sym->visible == yes)
489 return val >= sym->rev_dep.tri && val <= sym->visible;
492 bool sym_set_tristate_value(struct symbol *sym, tristate val)
494 tristate oldval = sym_get_tristate_value(sym);
496 if (oldval != val && !sym_tristate_within_range(sym, val))
499 if (!(sym->flags & SYMBOL_DEF_USER)) {
500 sym->flags |= SYMBOL_DEF_USER;
501 sym_set_changed(sym);
504 * setting a choice value also resets the new flag of the choice
505 * symbol and all other choice values.
507 if (sym_is_choice_value(sym) && val == yes) {
508 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
509 struct property *prop;
512 cs->def[S_DEF_USER].val = sym;
513 cs->flags |= SYMBOL_DEF_USER;
514 prop = sym_get_choice_prop(cs);
515 for (e = prop->expr; e; e = e->left.expr) {
516 if (e->right.sym->visible != no)
517 e->right.sym->flags |= SYMBOL_DEF_USER;
521 sym->def[S_DEF_USER].tri = val;
523 sym_clear_all_valid();
528 tristate sym_toggle_tristate_value(struct symbol *sym)
530 tristate oldval, newval;
532 oldval = newval = sym_get_tristate_value(sym);
545 if (sym_set_tristate_value(sym, newval))
547 } while (oldval != newval);
551 bool sym_string_valid(struct symbol *sym, const char *str)
564 if (ch == '0' && *str != 0)
566 while ((ch = *str++)) {
572 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
578 } while ((ch = *str++));
594 bool sym_string_within_range(struct symbol *sym, const char *str)
596 struct property *prop;
601 return sym_string_valid(sym, str);
603 if (!sym_string_valid(sym, str))
605 prop = sym_get_range_prop(sym);
608 val = strtol(str, NULL, 10);
609 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
610 val <= sym_get_range_val(prop->expr->right.sym, 10);
612 if (!sym_string_valid(sym, str))
614 prop = sym_get_range_prop(sym);
617 val = strtol(str, NULL, 16);
618 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
619 val <= sym_get_range_val(prop->expr->right.sym, 16);
624 return sym_tristate_within_range(sym, yes);
626 return sym_tristate_within_range(sym, mod);
628 return sym_tristate_within_range(sym, no);
636 bool sym_set_string_value(struct symbol *sym, const char *newval)
647 return sym_set_tristate_value(sym, yes);
649 return sym_set_tristate_value(sym, mod);
651 return sym_set_tristate_value(sym, no);
658 if (!sym_string_within_range(sym, newval))
661 if (!(sym->flags & SYMBOL_DEF_USER)) {
662 sym->flags |= SYMBOL_DEF_USER;
663 sym_set_changed(sym);
666 oldval = sym->def[S_DEF_USER].val;
667 size = strlen(newval) + 1;
668 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
670 sym->def[S_DEF_USER].val = val = xmalloc(size);
673 } else if (!oldval || strcmp(oldval, newval))
674 sym->def[S_DEF_USER].val = val = xmalloc(size);
679 free((void *)oldval);
680 sym_clear_all_valid();
686 * Find the default value associated to a symbol.
687 * For tristate symbol handle the modules=n case
688 * in which case "m" becomes "y".
689 * If the symbol does not have any default then fallback
690 * to the fixed default values.
692 const char *sym_get_string_default(struct symbol *sym)
694 struct property *prop;
699 sym_calc_visibility(sym);
700 sym_calc_value(modules_sym);
701 val = symbol_no.curr.tri;
702 str = symbol_empty.curr.val;
704 /* If symbol has a default value look it up */
705 prop = sym_get_default_prop(sym);
710 /* The visibility may limit the value from yes => mod */
711 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
715 * The following fails to handle the situation
716 * where a default value is further limited by
719 ds = prop_get_symbol(prop);
722 str = (const char *)ds->curr.val;
727 /* Handle select statements */
728 val = EXPR_OR(val, sym->rev_dep.tri);
730 /* transpose mod to yes if modules are not enabled */
732 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
735 /* transpose mod to yes if type is bool */
736 if (sym->type == S_BOOLEAN && val == mod)
744 case mod: return "m";
745 case yes: return "y";
759 const char *sym_get_string_value(struct symbol *sym)
766 val = sym_get_tristate_value(sym);
771 sym_calc_value(modules_sym);
772 return (modules_sym->curr.tri == no) ? "n" : "m";
780 return (const char *)sym->curr.val;
783 bool sym_is_changable(struct symbol *sym)
785 return sym->visible > sym->rev_dep.tri;
788 static unsigned strhash(const char *s)
791 unsigned hash = 2166136261U;
793 hash = (hash ^ *s) * 0x01000193;
797 struct symbol *sym_lookup(const char *name, int flags)
799 struct symbol *symbol;
804 if (name[0] && !name[1]) {
806 case 'y': return &symbol_yes;
807 case 'm': return &symbol_mod;
808 case 'n': return &symbol_no;
811 hash = strhash(name) % SYMBOL_HASHSIZE;
813 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
815 !strcmp(symbol->name, name) &&
816 (flags ? symbol->flags & flags
817 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
820 new_name = strdup(name);
826 symbol = xmalloc(sizeof(*symbol));
827 memset(symbol, 0, sizeof(*symbol));
828 symbol->name = new_name;
829 symbol->type = S_UNKNOWN;
830 symbol->flags |= flags;
832 symbol->next = symbol_hash[hash];
833 symbol_hash[hash] = symbol;
838 struct symbol *sym_find(const char *name)
840 struct symbol *symbol = NULL;
846 if (name[0] && !name[1]) {
848 case 'y': return &symbol_yes;
849 case 'm': return &symbol_mod;
850 case 'n': return &symbol_no;
853 hash = strhash(name) % SYMBOL_HASHSIZE;
855 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
857 !strcmp(symbol->name, name) &&
858 !(symbol->flags & SYMBOL_CONST))
866 * Expand symbol's names embedded in the string given in argument. Symbols'
867 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
870 const char *sym_expand_string_value(const char *in)
876 reslen = strlen(in) + 1;
877 res = xmalloc(reslen);
880 while ((src = strchr(in, '$'))) {
881 char *p, name[SYMBOL_MAXLENGTH];
882 const char *symval = "";
886 strncat(res, in, src - in);
890 while (isalnum(*src) || *src == '_')
894 sym = sym_find(name);
897 symval = sym_get_string_value(sym);
900 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
901 if (newlen > reslen) {
903 res = realloc(res, reslen);
914 const char *sym_escape_string_value(const char *in)
921 reslen = strlen(in) + strlen("\"\"") + 1;
925 l = strcspn(p, "\"\\");
935 res = xmalloc(reslen);
942 l = strcspn(p, "\"\\");
950 strncat(res, p++, 1);
962 /* Compare matched symbols as thus:
963 * - first, symbols that match exactly
964 * - then, alphabetical sort
966 static int sym_rel_comp( const void *sym1, const void *sym2 )
968 struct sym_match *s1 = *(struct sym_match **)sym1;
969 struct sym_match *s2 = *(struct sym_match **)sym2;
973 * - if matched length on symbol s1 is the length of that symbol,
974 * then this symbol should come first;
975 * - if matched length on symbol s2 is the length of that symbol,
976 * then this symbol should come first.
977 * Note: since the search can be a regexp, both symbols may match
978 * exactly; if this is the case, we can't decide which comes first,
979 * and we fallback to sorting alphabetically.
981 l1 = s1->eo - s1->so;
982 l2 = s2->eo - s2->so;
983 if (l1 == strlen(s1->sym->name) && l2 != strlen(s2->sym->name))
985 if (l1 != strlen(s1->sym->name) && l2 == strlen(s2->sym->name))
988 /* As a fallback, sort symbols alphabetically */
989 return strcmp(s1->sym->name, s2->sym->name);
992 struct symbol **sym_re_search(const char *pattern)
994 struct symbol *sym, **sym_arr = NULL;
995 struct sym_match **sym_match_arr = NULL;
1002 if (strlen(pattern) == 0)
1004 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
1007 for_all_symbols(i, sym) {
1008 struct sym_match *tmp_sym_match;
1009 if (sym->flags & SYMBOL_CONST || !sym->name)
1011 if (regexec(&re, sym->name, 1, match, 0))
1013 if (cnt + 1 >= size) {
1016 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match *));
1018 goto sym_re_search_free;
1020 sym_match_arr = tmp;
1022 sym_calc_value(sym);
1023 tmp_sym_match = (struct sym_match*)malloc(sizeof(struct sym_match));
1025 goto sym_re_search_free;
1026 tmp_sym_match->sym = sym;
1027 /* As regexec return 0, we know we have a match, so
1028 * we can use match[0].rm_[se]o without further checks
1030 tmp_sym_match->so = match[0].rm_so;
1031 tmp_sym_match->eo = match[0].rm_eo;
1032 sym_match_arr[cnt++] = tmp_sym_match;
1034 if (sym_match_arr) {
1035 qsort(sym_match_arr, cnt, sizeof(struct sym_match*), sym_rel_comp);
1036 sym_arr = malloc((cnt+1) * sizeof(struct symbol));
1038 goto sym_re_search_free;
1039 for (i = 0; i < cnt; i++)
1040 sym_arr[i] = sym_match_arr[i]->sym;
1041 sym_arr[cnt] = NULL;
1044 if (sym_match_arr) {
1045 for (i = 0; i < cnt; i++)
1046 free(sym_match_arr[i]);
1047 free(sym_match_arr);
1055 * When we check for recursive dependencies we use a stack to save
1056 * current state so we can print out relevant info to user.
1057 * The entries are located on the call stack so no need to free memory.
1058 * Note inser() remove() must always match to properly clear the stack.
1060 static struct dep_stack {
1061 struct dep_stack *prev, *next;
1063 struct property *prop;
1067 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1069 memset(stack, 0, sizeof(*stack));
1071 check_top->next = stack;
1072 stack->prev = check_top;
1077 static void dep_stack_remove(void)
1079 check_top = check_top->prev;
1081 check_top->next = NULL;
1085 * Called when we have detected a recursive dependency.
1086 * check_top point to the top of the stact so we use
1087 * the ->prev pointer to locate the bottom of the stack.
1089 static void sym_check_print_recursive(struct symbol *last_sym)
1091 struct dep_stack *stack;
1092 struct symbol *sym, *next_sym;
1093 struct menu *menu = NULL;
1094 struct property *prop;
1095 struct dep_stack cv_stack;
1097 if (sym_is_choice_value(last_sym)) {
1098 dep_stack_insert(&cv_stack, last_sym);
1099 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1102 for (stack = check_top; stack != NULL; stack = stack->prev)
1103 if (stack->sym == last_sym)
1106 fprintf(stderr, "unexpected recursive dependency error\n");
1110 for (; stack; stack = stack->next) {
1112 next_sym = stack->next ? stack->next->sym : last_sym;
1115 prop = stack->sym->prop;
1117 /* for choice values find the menu entry (used below) */
1118 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1119 for (prop = sym->prop; prop; prop = prop->next) {
1125 if (stack->sym == last_sym)
1126 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1127 prop->file->name, prop->lineno);
1129 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1130 prop->file->name, prop->lineno,
1131 sym->name ? sym->name : "<choice>",
1132 prop_get_type_name(prop->type),
1133 next_sym->name ? next_sym->name : "<choice>");
1134 } else if (stack->prop) {
1135 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1136 prop->file->name, prop->lineno,
1137 sym->name ? sym->name : "<choice>",
1138 next_sym->name ? next_sym->name : "<choice>");
1139 } else if (sym_is_choice(sym)) {
1140 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1141 menu->file->name, menu->lineno,
1142 sym->name ? sym->name : "<choice>",
1143 next_sym->name ? next_sym->name : "<choice>");
1144 } else if (sym_is_choice_value(sym)) {
1145 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1146 menu->file->name, menu->lineno,
1147 sym->name ? sym->name : "<choice>",
1148 next_sym->name ? next_sym->name : "<choice>");
1150 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1151 prop->file->name, prop->lineno,
1152 sym->name ? sym->name : "<choice>",
1153 next_sym->name ? next_sym->name : "<choice>");
1157 if (check_top == &cv_stack)
1161 static struct symbol *sym_check_expr_deps(struct expr *e)
1170 sym = sym_check_expr_deps(e->left.expr);
1173 return sym_check_expr_deps(e->right.expr);
1175 return sym_check_expr_deps(e->left.expr);
1178 sym = sym_check_deps(e->left.sym);
1181 return sym_check_deps(e->right.sym);
1183 return sym_check_deps(e->left.sym);
1187 printf("Oops! How to check %d?\n", e->type);
1191 /* return NULL when dependencies are OK */
1192 static struct symbol *sym_check_sym_deps(struct symbol *sym)
1194 struct symbol *sym2;
1195 struct property *prop;
1196 struct dep_stack stack;
1198 dep_stack_insert(&stack, sym);
1200 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1204 for (prop = sym->prop; prop; prop = prop->next) {
1205 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1208 sym2 = sym_check_expr_deps(prop->visible.expr);
1211 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1213 stack.expr = prop->expr;
1214 sym2 = sym_check_expr_deps(prop->expr);
1226 static struct symbol *sym_check_choice_deps(struct symbol *choice)
1228 struct symbol *sym, *sym2;
1229 struct property *prop;
1231 struct dep_stack stack;
1233 dep_stack_insert(&stack, choice);
1235 prop = sym_get_choice_prop(choice);
1236 expr_list_for_each_sym(prop->expr, e, sym)
1237 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1239 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1240 sym2 = sym_check_sym_deps(choice);
1241 choice->flags &= ~SYMBOL_CHECK;
1245 expr_list_for_each_sym(prop->expr, e, sym) {
1246 sym2 = sym_check_sym_deps(sym);
1251 expr_list_for_each_sym(prop->expr, e, sym)
1252 sym->flags &= ~SYMBOL_CHECK;
1254 if (sym2 && sym_is_choice_value(sym2) &&
1255 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1263 struct symbol *sym_check_deps(struct symbol *sym)
1265 struct symbol *sym2;
1266 struct property *prop;
1268 if (sym->flags & SYMBOL_CHECK) {
1269 sym_check_print_recursive(sym);
1272 if (sym->flags & SYMBOL_CHECKED)
1275 if (sym_is_choice_value(sym)) {
1276 struct dep_stack stack;
1278 /* for choice groups start the check with main choice symbol */
1279 dep_stack_insert(&stack, sym);
1280 prop = sym_get_choice_prop(sym);
1281 sym2 = sym_check_deps(prop_get_symbol(prop));
1283 } else if (sym_is_choice(sym)) {
1284 sym2 = sym_check_choice_deps(sym);
1286 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1287 sym2 = sym_check_sym_deps(sym);
1288 sym->flags &= ~SYMBOL_CHECK;
1291 if (sym2 && sym2 == sym)
1297 struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1299 struct property *prop;
1300 struct property **propp;
1302 prop = xmalloc(sizeof(*prop));
1303 memset(prop, 0, sizeof(*prop));
1306 prop->file = current_file;
1307 prop->lineno = zconf_lineno();
1309 /* append property to the prop list of symbol */
1311 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1319 struct symbol *prop_get_symbol(struct property *prop)
1321 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1322 prop->expr->type == E_LIST))
1323 return prop->expr->left.sym;
1327 const char *prop_get_type_name(enum prop_type type)
1354 static void prop_add_env(const char *env)
1356 struct symbol *sym, *sym2;
1357 struct property *prop;
1360 sym = current_entry->sym;
1361 sym->flags |= SYMBOL_AUTO;
1362 for_all_properties(sym, prop, P_ENV) {
1363 sym2 = prop_get_symbol(prop);
1364 if (strcmp(sym2->name, env))
1365 menu_warn(current_entry, "redefining environment symbol from %s",
1370 prop = prop_alloc(P_ENV, sym);
1371 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1373 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1374 sym_env_list->right.sym = sym;
1378 sym_add_default(sym, p);
1380 menu_warn(current_entry, "environment variable %s undefined", env);