Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
4 */
5
6#include <sys/types.h>
7#include <ctype.h>
8#include <stdlib.h>
9#include <string.h>
10#include <regex.h>
11
12#include "lkc.h"
13
14struct symbol symbol_yes = {
15 .name = "y",
16 .curr = { "y", yes },
17 .flags = SYMBOL_CONST|SYMBOL_VALID,
18};
19
20struct symbol symbol_mod = {
21 .name = "m",
22 .curr = { "m", mod },
23 .flags = SYMBOL_CONST|SYMBOL_VALID,
24};
25
26struct symbol symbol_no = {
27 .name = "n",
28 .curr = { "n", no },
29 .flags = SYMBOL_CONST|SYMBOL_VALID,
30};
31
32static struct symbol symbol_empty = {
33 .name = "",
34 .curr = { "", no },
35 .flags = SYMBOL_VALID,
36};
37
38struct symbol *modules_sym;
39static tristate modules_val;
40
41enum symbol_type sym_get_type(struct symbol *sym)
42{
43 enum symbol_type type = sym->type;
44
45 if (type == S_TRISTATE) {
46 if (sym_is_choice_value(sym) && sym->visible == yes)
47 type = S_BOOLEAN;
48 else if (modules_val == no)
49 type = S_BOOLEAN;
50 }
51 return type;
52}
53
54const char *sym_type_name(enum symbol_type type)
55{
56 switch (type) {
57 case S_BOOLEAN:
58 return "bool";
59 case S_TRISTATE:
60 return "tristate";
61 case S_INT:
62 return "integer";
63 case S_HEX:
64 return "hex";
65 case S_STRING:
66 return "string";
67 case S_UNKNOWN:
68 return "unknown";
69 }
70 return "???";
71}
72
73struct property *sym_get_choice_prop(struct symbol *sym)
74{
75 struct property *prop;
76
77 for_all_choices(sym, prop)
78 return prop;
79 return NULL;
80}
81
82static struct property *sym_get_default_prop(struct symbol *sym)
83{
84 struct property *prop;
85
86 for_all_defaults(sym, prop) {
87 prop->visible.tri = expr_calc_value(prop->visible.expr);
88 if (prop->visible.tri != no)
89 return prop;
90 }
91 return NULL;
92}
93
94struct property *sym_get_range_prop(struct symbol *sym)
95{
96 struct property *prop;
97
98 for_all_properties(sym, prop, P_RANGE) {
99 prop->visible.tri = expr_calc_value(prop->visible.expr);
100 if (prop->visible.tri != no)
101 return prop;
102 }
103 return NULL;
104}
105
106static long long sym_get_range_val(struct symbol *sym, int base)
107{
108 sym_calc_value(sym);
109 switch (sym->type) {
110 case S_INT:
111 base = 10;
112 break;
113 case S_HEX:
114 base = 16;
115 break;
116 default:
117 break;
118 }
119 return strtoll(sym->curr.val, NULL, base);
120}
121
122static void sym_validate_range(struct symbol *sym)
123{
124 struct property *prop;
125 int base;
126 long long val, val2;
127 char str[64];
128
129 switch (sym->type) {
130 case S_INT:
131 base = 10;
132 break;
133 case S_HEX:
134 base = 16;
135 break;
136 default:
137 return;
138 }
139 prop = sym_get_range_prop(sym);
140 if (!prop)
141 return;
142 val = strtoll(sym->curr.val, NULL, base);
143 val2 = sym_get_range_val(prop->expr->left.sym, base);
144 if (val >= val2) {
145 val2 = sym_get_range_val(prop->expr->right.sym, base);
146 if (val <= val2)
147 return;
148 }
149 if (sym->type == S_INT)
150 sprintf(str, "%lld", val2);
151 else
152 sprintf(str, "0x%llx", val2);
153 sym->curr.val = xstrdup(str);
154}
155
156static void sym_set_changed(struct symbol *sym)
157{
158 struct property *prop;
159
160 sym->flags |= SYMBOL_CHANGED;
161 for (prop = sym->prop; prop; prop = prop->next) {
162 if (prop->menu)
163 prop->menu->flags |= MENU_CHANGED;
164 }
165}
166
167static void sym_set_all_changed(void)
168{
169 struct symbol *sym;
170 int i;
171
172 for_all_symbols(i, sym)
173 sym_set_changed(sym);
174}
175
176static void sym_calc_visibility(struct symbol *sym)
177{
178 struct property *prop;
179 struct symbol *choice_sym = NULL;
180 tristate tri;
181
182 /* any prompt visible? */
183 tri = no;
184
185 if (sym_is_choice_value(sym))
186 choice_sym = prop_get_symbol(sym_get_choice_prop(sym));
187
188 for_all_prompts(sym, prop) {
189 prop->visible.tri = expr_calc_value(prop->visible.expr);
190 /*
191 * Tristate choice_values with visibility 'mod' are
192 * not visible if the corresponding choice's value is
193 * 'yes'.
194 */
195 if (choice_sym && sym->type == S_TRISTATE &&
196 prop->visible.tri == mod && choice_sym->curr.tri == yes)
197 prop->visible.tri = no;
198
199 tri = EXPR_OR(tri, prop->visible.tri);
200 }
201 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
202 tri = yes;
203 if (sym->visible != tri) {
204 sym->visible = tri;
205 sym_set_changed(sym);
206 }
207 if (sym_is_choice_value(sym))
208 return;
209 /* defaulting to "yes" if no explicit "depends on" are given */
210 tri = yes;
211 if (sym->dir_dep.expr)
212 tri = expr_calc_value(sym->dir_dep.expr);
213 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
214 tri = yes;
215 if (sym->dir_dep.tri != tri) {
216 sym->dir_dep.tri = tri;
217 sym_set_changed(sym);
218 }
219 tri = no;
220 if (sym->rev_dep.expr)
221 tri = expr_calc_value(sym->rev_dep.expr);
222 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
223 tri = yes;
224 if (sym->rev_dep.tri != tri) {
225 sym->rev_dep.tri = tri;
226 sym_set_changed(sym);
227 }
228 tri = no;
229 if (sym->implied.expr)
230 tri = expr_calc_value(sym->implied.expr);
231 if (tri == mod && sym_get_type(sym) == S_BOOLEAN)
232 tri = yes;
233 if (sym->implied.tri != tri) {
234 sym->implied.tri = tri;
235 sym_set_changed(sym);
236 }
237}
238
239/*
240 * Find the default symbol for a choice.
241 * First try the default values for the choice symbol
242 * Next locate the first visible choice value
243 * Return NULL if none was found
244 */
245struct symbol *sym_choice_default(struct symbol *sym)
246{
247 struct symbol *def_sym;
248 struct property *prop;
249 struct expr *e;
250
251 /* any of the defaults visible? */
252 for_all_defaults(sym, prop) {
253 prop->visible.tri = expr_calc_value(prop->visible.expr);
254 if (prop->visible.tri == no)
255 continue;
256 def_sym = prop_get_symbol(prop);
257 if (def_sym->visible != no)
258 return def_sym;
259 }
260
261 /* just get the first visible value */
262 prop = sym_get_choice_prop(sym);
263 expr_list_for_each_sym(prop->expr, e, def_sym)
264 if (def_sym->visible != no)
265 return def_sym;
266
267 /* failed to locate any defaults */
268 return NULL;
269}
270
271static struct symbol *sym_calc_choice(struct symbol *sym)
272{
273 struct symbol *def_sym;
274 struct property *prop;
275 struct expr *e;
276 int flags;
277
278 /* first calculate all choice values' visibilities */
279 flags = sym->flags;
280 prop = sym_get_choice_prop(sym);
281 expr_list_for_each_sym(prop->expr, e, def_sym) {
282 sym_calc_visibility(def_sym);
283 if (def_sym->visible != no)
284 flags &= def_sym->flags;
285 }
286
287 sym->flags &= flags | ~SYMBOL_DEF_USER;
288
289 /* is the user choice visible? */
290 def_sym = sym->def[S_DEF_USER].val;
291 if (def_sym && def_sym->visible != no)
292 return def_sym;
293
294 def_sym = sym_choice_default(sym);
295
296 if (def_sym == NULL)
297 /* no choice? reset tristate value */
298 sym->curr.tri = no;
299
300 return def_sym;
301}
302
303static void sym_warn_unmet_dep(struct symbol *sym)
304{
305 struct gstr gs = str_new();
306
307 str_printf(&gs,
308 "\nWARNING: unmet direct dependencies detected for %s\n",
309 sym->name);
310 str_printf(&gs,
311 " Depends on [%c]: ",
312 sym->dir_dep.tri == mod ? 'm' : 'n');
313 expr_gstr_print(sym->dir_dep.expr, &gs);
314 str_printf(&gs, "\n");
315
316 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, yes,
317 " Selected by [y]:\n");
318 expr_gstr_print_revdep(sym->rev_dep.expr, &gs, mod,
319 " Selected by [m]:\n");
320
321 fputs(str_get(&gs), stderr);
322}
323
324void sym_calc_value(struct symbol *sym)
325{
326 struct symbol_value newval, oldval;
327 struct property *prop;
328 struct expr *e;
329
330 if (!sym)
331 return;
332
333 if (sym->flags & SYMBOL_VALID)
334 return;
335
336 if (sym_is_choice_value(sym) &&
337 sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES) {
338 sym->flags &= ~SYMBOL_NEED_SET_CHOICE_VALUES;
339 prop = sym_get_choice_prop(sym);
340 sym_calc_value(prop_get_symbol(prop));
341 }
342
343 sym->flags |= SYMBOL_VALID;
344
345 oldval = sym->curr;
346
347 switch (sym->type) {
348 case S_INT:
349 case S_HEX:
350 case S_STRING:
351 newval = symbol_empty.curr;
352 break;
353 case S_BOOLEAN:
354 case S_TRISTATE:
355 newval = symbol_no.curr;
356 break;
357 default:
358 sym->curr.val = sym->name;
359 sym->curr.tri = no;
360 return;
361 }
362 sym->flags &= ~SYMBOL_WRITE;
363
364 sym_calc_visibility(sym);
365
366 if (sym->visible != no)
367 sym->flags |= SYMBOL_WRITE;
368
369 /* set default if recursively called */
370 sym->curr = newval;
371
372 switch (sym_get_type(sym)) {
373 case S_BOOLEAN:
374 case S_TRISTATE:
375 if (sym_is_choice_value(sym) && sym->visible == yes) {
376 prop = sym_get_choice_prop(sym);
377 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
378 } else {
379 if (sym->visible != no) {
380 /* if the symbol is visible use the user value
381 * if available, otherwise try the default value
382 */
383 if (sym_has_value(sym)) {
384 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
385 sym->visible);
386 goto calc_newval;
387 }
388 }
389 if (sym->rev_dep.tri != no)
390 sym->flags |= SYMBOL_WRITE;
391 if (!sym_is_choice(sym)) {
392 prop = sym_get_default_prop(sym);
393 if (prop) {
394 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
395 prop->visible.tri);
396 if (newval.tri != no)
397 sym->flags |= SYMBOL_WRITE;
398 }
399 if (sym->implied.tri != no) {
400 sym->flags |= SYMBOL_WRITE;
401 newval.tri = EXPR_OR(newval.tri, sym->implied.tri);
402 newval.tri = EXPR_AND(newval.tri,
403 sym->dir_dep.tri);
404 }
405 }
406 calc_newval:
407 if (sym->dir_dep.tri < sym->rev_dep.tri)
408 sym_warn_unmet_dep(sym);
409 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
410 }
411 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
412 newval.tri = yes;
413 break;
414 case S_STRING:
415 case S_HEX:
416 case S_INT:
417 if (sym->visible != no && sym_has_value(sym)) {
418 newval.val = sym->def[S_DEF_USER].val;
419 break;
420 }
421 prop = sym_get_default_prop(sym);
422 if (prop) {
423 struct symbol *ds = prop_get_symbol(prop);
424 if (ds) {
425 sym->flags |= SYMBOL_WRITE;
426 sym_calc_value(ds);
427 newval.val = ds->curr.val;
428 }
429 }
430 break;
431 default:
432 ;
433 }
434
435 sym->curr = newval;
436 if (sym_is_choice(sym) && newval.tri == yes)
437 sym->curr.val = sym_calc_choice(sym);
438 sym_validate_range(sym);
439
440 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
441 sym_set_changed(sym);
442 if (modules_sym == sym) {
443 sym_set_all_changed();
444 modules_val = modules_sym->curr.tri;
445 }
446 }
447
448 if (sym_is_choice(sym)) {
449 struct symbol *choice_sym;
450
451 prop = sym_get_choice_prop(sym);
452 expr_list_for_each_sym(prop->expr, e, choice_sym) {
453 if ((sym->flags & SYMBOL_WRITE) &&
454 choice_sym->visible != no)
455 choice_sym->flags |= SYMBOL_WRITE;
456 if (sym->flags & SYMBOL_CHANGED)
457 sym_set_changed(choice_sym);
458 }
459 }
460
461 if (sym->flags & SYMBOL_NO_WRITE)
462 sym->flags &= ~SYMBOL_WRITE;
463
464 if (sym->flags & SYMBOL_NEED_SET_CHOICE_VALUES)
465 set_all_choice_values(sym);
466}
467
468void sym_clear_all_valid(void)
469{
470 struct symbol *sym;
471 int i;
472
473 for_all_symbols(i, sym)
474 sym->flags &= ~SYMBOL_VALID;
475 conf_set_changed(true);
476 sym_calc_value(modules_sym);
477}
478
479bool sym_tristate_within_range(struct symbol *sym, tristate val)
480{
481 int type = sym_get_type(sym);
482
483 if (sym->visible == no)
484 return false;
485
486 if (type != S_BOOLEAN && type != S_TRISTATE)
487 return false;
488
489 if (type == S_BOOLEAN && val == mod)
490 return false;
491 if (sym->visible <= sym->rev_dep.tri)
492 return false;
493 if (sym_is_choice_value(sym) && sym->visible == yes)
494 return val == yes;
495 return val >= sym->rev_dep.tri && val <= sym->visible;
496}
497
498bool sym_set_tristate_value(struct symbol *sym, tristate val)
499{
500 tristate oldval = sym_get_tristate_value(sym);
501
502 if (oldval != val && !sym_tristate_within_range(sym, val))
503 return false;
504
505 if (!(sym->flags & SYMBOL_DEF_USER)) {
506 sym->flags |= SYMBOL_DEF_USER;
507 sym_set_changed(sym);
508 }
509 /*
510 * setting a choice value also resets the new flag of the choice
511 * symbol and all other choice values.
512 */
513 if (sym_is_choice_value(sym) && val == yes) {
514 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
515 struct property *prop;
516 struct expr *e;
517
518 cs->def[S_DEF_USER].val = sym;
519 cs->flags |= SYMBOL_DEF_USER;
520 prop = sym_get_choice_prop(cs);
521 for (e = prop->expr; e; e = e->left.expr) {
522 if (e->right.sym->visible != no)
523 e->right.sym->flags |= SYMBOL_DEF_USER;
524 }
525 }
526
527 sym->def[S_DEF_USER].tri = val;
528 if (oldval != val)
529 sym_clear_all_valid();
530
531 return true;
532}
533
534tristate sym_toggle_tristate_value(struct symbol *sym)
535{
536 tristate oldval, newval;
537
538 oldval = newval = sym_get_tristate_value(sym);
539 do {
540 switch (newval) {
541 case no:
542 newval = mod;
543 break;
544 case mod:
545 newval = yes;
546 break;
547 case yes:
548 newval = no;
549 break;
550 }
551 if (sym_set_tristate_value(sym, newval))
552 break;
553 } while (oldval != newval);
554 return newval;
555}
556
557bool sym_string_valid(struct symbol *sym, const char *str)
558{
559 signed char ch;
560
561 switch (sym->type) {
562 case S_STRING:
563 return true;
564 case S_INT:
565 ch = *str++;
566 if (ch == '-')
567 ch = *str++;
568 if (!isdigit(ch))
569 return false;
570 if (ch == '0' && *str != 0)
571 return false;
572 while ((ch = *str++)) {
573 if (!isdigit(ch))
574 return false;
575 }
576 return true;
577 case S_HEX:
578 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
579 str += 2;
580 ch = *str++;
581 do {
582 if (!isxdigit(ch))
583 return false;
584 } while ((ch = *str++));
585 return true;
586 case S_BOOLEAN:
587 case S_TRISTATE:
588 switch (str[0]) {
589 case 'y': case 'Y':
590 case 'm': case 'M':
591 case 'n': case 'N':
592 return true;
593 }
594 return false;
595 default:
596 return false;
597 }
598}
599
600bool sym_string_within_range(struct symbol *sym, const char *str)
601{
602 struct property *prop;
603 long long val;
604
605 switch (sym->type) {
606 case S_STRING:
607 return sym_string_valid(sym, str);
608 case S_INT:
609 if (!sym_string_valid(sym, str))
610 return false;
611 prop = sym_get_range_prop(sym);
612 if (!prop)
613 return true;
614 val = strtoll(str, NULL, 10);
615 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
616 val <= sym_get_range_val(prop->expr->right.sym, 10);
617 case S_HEX:
618 if (!sym_string_valid(sym, str))
619 return false;
620 prop = sym_get_range_prop(sym);
621 if (!prop)
622 return true;
623 val = strtoll(str, NULL, 16);
624 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
625 val <= sym_get_range_val(prop->expr->right.sym, 16);
626 case S_BOOLEAN:
627 case S_TRISTATE:
628 switch (str[0]) {
629 case 'y': case 'Y':
630 return sym_tristate_within_range(sym, yes);
631 case 'm': case 'M':
632 return sym_tristate_within_range(sym, mod);
633 case 'n': case 'N':
634 return sym_tristate_within_range(sym, no);
635 }
636 return false;
637 default:
638 return false;
639 }
640}
641
642bool sym_set_string_value(struct symbol *sym, const char *newval)
643{
644 const char *oldval;
645 char *val;
646 int size;
647
648 switch (sym->type) {
649 case S_BOOLEAN:
650 case S_TRISTATE:
651 switch (newval[0]) {
652 case 'y': case 'Y':
653 return sym_set_tristate_value(sym, yes);
654 case 'm': case 'M':
655 return sym_set_tristate_value(sym, mod);
656 case 'n': case 'N':
657 return sym_set_tristate_value(sym, no);
658 }
659 return false;
660 default:
661 ;
662 }
663
664 if (!sym_string_within_range(sym, newval))
665 return false;
666
667 if (!(sym->flags & SYMBOL_DEF_USER)) {
668 sym->flags |= SYMBOL_DEF_USER;
669 sym_set_changed(sym);
670 }
671
672 oldval = sym->def[S_DEF_USER].val;
673 size = strlen(newval) + 1;
674 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
675 size += 2;
676 sym->def[S_DEF_USER].val = val = xmalloc(size);
677 *val++ = '0';
678 *val++ = 'x';
679 } else if (!oldval || strcmp(oldval, newval))
680 sym->def[S_DEF_USER].val = val = xmalloc(size);
681 else
682 return true;
683
684 strcpy(val, newval);
685 free((void *)oldval);
686 sym_clear_all_valid();
687
688 return true;
689}
690
691/*
692 * Find the default value associated to a symbol.
693 * For tristate symbol handle the modules=n case
694 * in which case "m" becomes "y".
695 * If the symbol does not have any default then fallback
696 * to the fixed default values.
697 */
698const char *sym_get_string_default(struct symbol *sym)
699{
700 struct property *prop;
701 struct symbol *ds;
702 const char *str;
703 tristate val;
704
705 sym_calc_visibility(sym);
706 sym_calc_value(modules_sym);
707 val = symbol_no.curr.tri;
708 str = symbol_empty.curr.val;
709
710 /* If symbol has a default value look it up */
711 prop = sym_get_default_prop(sym);
712 if (prop != NULL) {
713 switch (sym->type) {
714 case S_BOOLEAN:
715 case S_TRISTATE:
716 /* The visibility may limit the value from yes => mod */
717 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
718 break;
719 default:
720 /*
721 * The following fails to handle the situation
722 * where a default value is further limited by
723 * the valid range.
724 */
725 ds = prop_get_symbol(prop);
726 if (ds != NULL) {
727 sym_calc_value(ds);
728 str = (const char *)ds->curr.val;
729 }
730 }
731 }
732
733 /* Handle select statements */
734 val = EXPR_OR(val, sym->rev_dep.tri);
735
736 /* transpose mod to yes if modules are not enabled */
737 if (val == mod)
738 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
739 val = yes;
740
741 /* transpose mod to yes if type is bool */
742 if (sym->type == S_BOOLEAN && val == mod)
743 val = yes;
744
745 /* adjust the default value if this symbol is implied by another */
746 if (val < sym->implied.tri)
747 val = sym->implied.tri;
748
749 switch (sym->type) {
750 case S_BOOLEAN:
751 case S_TRISTATE:
752 switch (val) {
753 case no: return "n";
754 case mod: return "m";
755 case yes: return "y";
756 }
757 case S_INT:
758 case S_HEX:
759 return str;
760 case S_STRING:
761 return str;
762 case S_UNKNOWN:
763 break;
764 }
765 return "";
766}
767
768const char *sym_get_string_value(struct symbol *sym)
769{
770 tristate val;
771
772 switch (sym->type) {
773 case S_BOOLEAN:
774 case S_TRISTATE:
775 val = sym_get_tristate_value(sym);
776 switch (val) {
777 case no:
778 return "n";
779 case mod:
780 sym_calc_value(modules_sym);
781 return (modules_sym->curr.tri == no) ? "n" : "m";
782 case yes:
783 return "y";
784 }
785 break;
786 default:
787 ;
788 }
789 return (const char *)sym->curr.val;
790}
791
792bool sym_is_changeable(struct symbol *sym)
793{
794 return sym->visible > sym->rev_dep.tri;
795}
796
797static unsigned strhash(const char *s)
798{
799 /* fnv32 hash */
800 unsigned hash = 2166136261U;
801 for (; *s; s++)
802 hash = (hash ^ *s) * 0x01000193;
803 return hash;
804}
805
806struct symbol *sym_lookup(const char *name, int flags)
807{
808 struct symbol *symbol;
809 char *new_name;
810 int hash;
811
812 if (name) {
813 if (name[0] && !name[1]) {
814 switch (name[0]) {
815 case 'y': return &symbol_yes;
816 case 'm': return &symbol_mod;
817 case 'n': return &symbol_no;
818 }
819 }
820 hash = strhash(name) % SYMBOL_HASHSIZE;
821
822 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
823 if (symbol->name &&
824 !strcmp(symbol->name, name) &&
825 (flags ? symbol->flags & flags
826 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
827 return symbol;
828 }
829 new_name = xstrdup(name);
830 } else {
831 new_name = NULL;
832 hash = 0;
833 }
834
835 symbol = xmalloc(sizeof(*symbol));
836 memset(symbol, 0, sizeof(*symbol));
837 symbol->name = new_name;
838 symbol->type = S_UNKNOWN;
839 symbol->flags = flags;
840
841 symbol->next = symbol_hash[hash];
842 symbol_hash[hash] = symbol;
843
844 return symbol;
845}
846
847struct symbol *sym_find(const char *name)
848{
849 struct symbol *symbol = NULL;
850 int hash = 0;
851
852 if (!name)
853 return NULL;
854
855 if (name[0] && !name[1]) {
856 switch (name[0]) {
857 case 'y': return &symbol_yes;
858 case 'm': return &symbol_mod;
859 case 'n': return &symbol_no;
860 }
861 }
862 hash = strhash(name) % SYMBOL_HASHSIZE;
863
864 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
865 if (symbol->name &&
866 !strcmp(symbol->name, name) &&
867 !(symbol->flags & SYMBOL_CONST))
868 break;
869 }
870
871 return symbol;
872}
873
874const char *sym_escape_string_value(const char *in)
875{
876 const char *p;
877 size_t reslen;
878 char *res;
879 size_t l;
880
881 reslen = strlen(in) + strlen("\"\"") + 1;
882
883 p = in;
884 for (;;) {
885 l = strcspn(p, "\"\\");
886 p += l;
887
888 if (p[0] == '\0')
889 break;
890
891 reslen++;
892 p++;
893 }
894
895 res = xmalloc(reslen);
896 res[0] = '\0';
897
898 strcat(res, "\"");
899
900 p = in;
901 for (;;) {
902 l = strcspn(p, "\"\\");
903 strncat(res, p, l);
904 p += l;
905
906 if (p[0] == '\0')
907 break;
908
909 strcat(res, "\\");
910 strncat(res, p++, 1);
911 }
912
913 strcat(res, "\"");
914 return res;
915}
916
917struct sym_match {
918 struct symbol *sym;
919 off_t so, eo;
920};
921
922/* Compare matched symbols as thus:
923 * - first, symbols that match exactly
924 * - then, alphabetical sort
925 */
926static int sym_rel_comp(const void *sym1, const void *sym2)
927{
928 const struct sym_match *s1 = sym1;
929 const struct sym_match *s2 = sym2;
930 int exact1, exact2;
931
932 /* Exact match:
933 * - if matched length on symbol s1 is the length of that symbol,
934 * then this symbol should come first;
935 * - if matched length on symbol s2 is the length of that symbol,
936 * then this symbol should come first.
937 * Note: since the search can be a regexp, both symbols may match
938 * exactly; if this is the case, we can't decide which comes first,
939 * and we fallback to sorting alphabetically.
940 */
941 exact1 = (s1->eo - s1->so) == strlen(s1->sym->name);
942 exact2 = (s2->eo - s2->so) == strlen(s2->sym->name);
943 if (exact1 && !exact2)
944 return -1;
945 if (!exact1 && exact2)
946 return 1;
947
948 /* As a fallback, sort symbols alphabetically */
949 return strcmp(s1->sym->name, s2->sym->name);
950}
951
952struct symbol **sym_re_search(const char *pattern)
953{
954 struct symbol *sym, **sym_arr = NULL;
955 struct sym_match *sym_match_arr = NULL;
956 int i, cnt, size;
957 regex_t re;
958 regmatch_t match[1];
959
960 cnt = size = 0;
961 /* Skip if empty */
962 if (strlen(pattern) == 0)
963 return NULL;
964 if (regcomp(&re, pattern, REG_EXTENDED|REG_ICASE))
965 return NULL;
966
967 for_all_symbols(i, sym) {
968 if (sym->flags & SYMBOL_CONST || !sym->name)
969 continue;
970 if (regexec(&re, sym->name, 1, match, 0))
971 continue;
972 if (cnt >= size) {
973 void *tmp;
974 size += 16;
975 tmp = realloc(sym_match_arr, size * sizeof(struct sym_match));
976 if (!tmp)
977 goto sym_re_search_free;
978 sym_match_arr = tmp;
979 }
980 sym_calc_value(sym);
981 /* As regexec returned 0, we know we have a match, so
982 * we can use match[0].rm_[se]o without further checks
983 */
984 sym_match_arr[cnt].so = match[0].rm_so;
985 sym_match_arr[cnt].eo = match[0].rm_eo;
986 sym_match_arr[cnt++].sym = sym;
987 }
988 if (sym_match_arr) {
989 qsort(sym_match_arr, cnt, sizeof(struct sym_match), sym_rel_comp);
990 sym_arr = malloc((cnt+1) * sizeof(struct symbol *));
991 if (!sym_arr)
992 goto sym_re_search_free;
993 for (i = 0; i < cnt; i++)
994 sym_arr[i] = sym_match_arr[i].sym;
995 sym_arr[cnt] = NULL;
996 }
997sym_re_search_free:
998 /* sym_match_arr can be NULL if no match, but free(NULL) is OK */
999 free(sym_match_arr);
1000 regfree(&re);
1001
1002 return sym_arr;
1003}
1004
1005/*
1006 * When we check for recursive dependencies we use a stack to save
1007 * current state so we can print out relevant info to user.
1008 * The entries are located on the call stack so no need to free memory.
1009 * Note insert() remove() must always match to properly clear the stack.
1010 */
1011static struct dep_stack {
1012 struct dep_stack *prev, *next;
1013 struct symbol *sym;
1014 struct property *prop;
1015 struct expr **expr;
1016} *check_top;
1017
1018static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
1019{
1020 memset(stack, 0, sizeof(*stack));
1021 if (check_top)
1022 check_top->next = stack;
1023 stack->prev = check_top;
1024 stack->sym = sym;
1025 check_top = stack;
1026}
1027
1028static void dep_stack_remove(void)
1029{
1030 check_top = check_top->prev;
1031 if (check_top)
1032 check_top->next = NULL;
1033}
1034
1035/*
1036 * Called when we have detected a recursive dependency.
1037 * check_top point to the top of the stact so we use
1038 * the ->prev pointer to locate the bottom of the stack.
1039 */
1040static void sym_check_print_recursive(struct symbol *last_sym)
1041{
1042 struct dep_stack *stack;
1043 struct symbol *sym, *next_sym;
1044 struct menu *menu = NULL;
1045 struct property *prop;
1046 struct dep_stack cv_stack;
1047
1048 if (sym_is_choice_value(last_sym)) {
1049 dep_stack_insert(&cv_stack, last_sym);
1050 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1051 }
1052
1053 for (stack = check_top; stack != NULL; stack = stack->prev)
1054 if (stack->sym == last_sym)
1055 break;
1056 if (!stack) {
1057 fprintf(stderr, "unexpected recursive dependency error\n");
1058 return;
1059 }
1060
1061 for (; stack; stack = stack->next) {
1062 sym = stack->sym;
1063 next_sym = stack->next ? stack->next->sym : last_sym;
1064 prop = stack->prop;
1065 if (prop == NULL)
1066 prop = stack->sym->prop;
1067
1068 /* for choice values find the menu entry (used below) */
1069 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1070 for (prop = sym->prop; prop; prop = prop->next) {
1071 menu = prop->menu;
1072 if (prop->menu)
1073 break;
1074 }
1075 }
1076 if (stack->sym == last_sym)
1077 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1078 prop->file->name, prop->lineno);
1079
1080 if (sym_is_choice(sym)) {
1081 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1082 menu->file->name, menu->lineno,
1083 sym->name ? sym->name : "<choice>",
1084 next_sym->name ? next_sym->name : "<choice>");
1085 } else if (sym_is_choice_value(sym)) {
1086 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1087 menu->file->name, menu->lineno,
1088 sym->name ? sym->name : "<choice>",
1089 next_sym->name ? next_sym->name : "<choice>");
1090 } else if (stack->expr == &sym->dir_dep.expr) {
1091 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1092 prop->file->name, prop->lineno,
1093 sym->name ? sym->name : "<choice>",
1094 next_sym->name ? next_sym->name : "<choice>");
1095 } else if (stack->expr == &sym->rev_dep.expr) {
1096 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1097 prop->file->name, prop->lineno,
1098 sym->name ? sym->name : "<choice>",
1099 next_sym->name ? next_sym->name : "<choice>");
1100 } else if (stack->expr == &sym->implied.expr) {
1101 fprintf(stderr, "%s:%d:\tsymbol %s is implied by %s\n",
1102 prop->file->name, prop->lineno,
1103 sym->name ? sym->name : "<choice>",
1104 next_sym->name ? next_sym->name : "<choice>");
1105 } else if (stack->expr) {
1106 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1107 prop->file->name, prop->lineno,
1108 sym->name ? sym->name : "<choice>",
1109 prop_get_type_name(prop->type),
1110 next_sym->name ? next_sym->name : "<choice>");
1111 } else {
1112 fprintf(stderr, "%s:%d:\tsymbol %s %s is visible depending on %s\n",
1113 prop->file->name, prop->lineno,
1114 sym->name ? sym->name : "<choice>",
1115 prop_get_type_name(prop->type),
1116 next_sym->name ? next_sym->name : "<choice>");
1117 }
1118 }
1119
1120 fprintf(stderr,
1121 "For a resolution refer to Documentation/kbuild/kconfig-language.rst\n"
1122 "subsection \"Kconfig recursive dependency limitations\"\n"
1123 "\n");
1124
1125 if (check_top == &cv_stack)
1126 dep_stack_remove();
1127}
1128
1129static struct symbol *sym_check_expr_deps(struct expr *e)
1130{
1131 struct symbol *sym;
1132
1133 if (!e)
1134 return NULL;
1135 switch (e->type) {
1136 case E_OR:
1137 case E_AND:
1138 sym = sym_check_expr_deps(e->left.expr);
1139 if (sym)
1140 return sym;
1141 return sym_check_expr_deps(e->right.expr);
1142 case E_NOT:
1143 return sym_check_expr_deps(e->left.expr);
1144 case E_EQUAL:
1145 case E_GEQ:
1146 case E_GTH:
1147 case E_LEQ:
1148 case E_LTH:
1149 case E_UNEQUAL:
1150 sym = sym_check_deps(e->left.sym);
1151 if (sym)
1152 return sym;
1153 return sym_check_deps(e->right.sym);
1154 case E_SYMBOL:
1155 return sym_check_deps(e->left.sym);
1156 default:
1157 break;
1158 }
1159 fprintf(stderr, "Oops! How to check %d?\n", e->type);
1160 return NULL;
1161}
1162
1163/* return NULL when dependencies are OK */
1164static struct symbol *sym_check_sym_deps(struct symbol *sym)
1165{
1166 struct symbol *sym2;
1167 struct property *prop;
1168 struct dep_stack stack;
1169
1170 dep_stack_insert(&stack, sym);
1171
1172 stack.expr = &sym->dir_dep.expr;
1173 sym2 = sym_check_expr_deps(sym->dir_dep.expr);
1174 if (sym2)
1175 goto out;
1176
1177 stack.expr = &sym->rev_dep.expr;
1178 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1179 if (sym2)
1180 goto out;
1181
1182 stack.expr = &sym->implied.expr;
1183 sym2 = sym_check_expr_deps(sym->implied.expr);
1184 if (sym2)
1185 goto out;
1186
1187 stack.expr = NULL;
1188
1189 for (prop = sym->prop; prop; prop = prop->next) {
1190 if (prop->type == P_CHOICE || prop->type == P_SELECT ||
1191 prop->type == P_IMPLY)
1192 continue;
1193 stack.prop = prop;
1194 sym2 = sym_check_expr_deps(prop->visible.expr);
1195 if (sym2)
1196 break;
1197 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1198 continue;
1199 stack.expr = &prop->expr;
1200 sym2 = sym_check_expr_deps(prop->expr);
1201 if (sym2)
1202 break;
1203 stack.expr = NULL;
1204 }
1205
1206out:
1207 dep_stack_remove();
1208
1209 return sym2;
1210}
1211
1212static struct symbol *sym_check_choice_deps(struct symbol *choice)
1213{
1214 struct symbol *sym, *sym2;
1215 struct property *prop;
1216 struct expr *e;
1217 struct dep_stack stack;
1218
1219 dep_stack_insert(&stack, choice);
1220
1221 prop = sym_get_choice_prop(choice);
1222 expr_list_for_each_sym(prop->expr, e, sym)
1223 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1224
1225 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1226 sym2 = sym_check_sym_deps(choice);
1227 choice->flags &= ~SYMBOL_CHECK;
1228 if (sym2)
1229 goto out;
1230
1231 expr_list_for_each_sym(prop->expr, e, sym) {
1232 sym2 = sym_check_sym_deps(sym);
1233 if (sym2)
1234 break;
1235 }
1236out:
1237 expr_list_for_each_sym(prop->expr, e, sym)
1238 sym->flags &= ~SYMBOL_CHECK;
1239
1240 if (sym2 && sym_is_choice_value(sym2) &&
1241 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1242 sym2 = choice;
1243
1244 dep_stack_remove();
1245
1246 return sym2;
1247}
1248
1249struct symbol *sym_check_deps(struct symbol *sym)
1250{
1251 struct symbol *sym2;
1252 struct property *prop;
1253
1254 if (sym->flags & SYMBOL_CHECK) {
1255 sym_check_print_recursive(sym);
1256 return sym;
1257 }
1258 if (sym->flags & SYMBOL_CHECKED)
1259 return NULL;
1260
1261 if (sym_is_choice_value(sym)) {
1262 struct dep_stack stack;
1263
1264 /* for choice groups start the check with main choice symbol */
1265 dep_stack_insert(&stack, sym);
1266 prop = sym_get_choice_prop(sym);
1267 sym2 = sym_check_deps(prop_get_symbol(prop));
1268 dep_stack_remove();
1269 } else if (sym_is_choice(sym)) {
1270 sym2 = sym_check_choice_deps(sym);
1271 } else {
1272 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1273 sym2 = sym_check_sym_deps(sym);
1274 sym->flags &= ~SYMBOL_CHECK;
1275 }
1276
1277 return sym2;
1278}
1279
1280struct symbol *prop_get_symbol(struct property *prop)
1281{
1282 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1283 prop->expr->type == E_LIST))
1284 return prop->expr->left.sym;
1285 return NULL;
1286}
1287
1288const char *prop_get_type_name(enum prop_type type)
1289{
1290 switch (type) {
1291 case P_PROMPT:
1292 return "prompt";
1293 case P_COMMENT:
1294 return "comment";
1295 case P_MENU:
1296 return "menu";
1297 case P_DEFAULT:
1298 return "default";
1299 case P_CHOICE:
1300 return "choice";
1301 case P_SELECT:
1302 return "select";
1303 case P_IMPLY:
1304 return "imply";
1305 case P_RANGE:
1306 return "range";
1307 case P_SYMBOL:
1308 return "symbol";
1309 case P_UNKNOWN:
1310 break;
1311 }
1312 return "unknown";
1313}
1/*
2 * Copyright (C) 2002 Roman Zippel <zippel@linux-m68k.org>
3 * Released under the terms of the GNU GPL v2.0.
4 */
5
6#include <ctype.h>
7#include <stdlib.h>
8#include <string.h>
9#include <regex.h>
10#include <sys/utsname.h>
11
12#include "lkc.h"
13
14struct symbol symbol_yes = {
15 .name = "y",
16 .curr = { "y", yes },
17 .flags = SYMBOL_CONST|SYMBOL_VALID,
18}, symbol_mod = {
19 .name = "m",
20 .curr = { "m", mod },
21 .flags = SYMBOL_CONST|SYMBOL_VALID,
22}, symbol_no = {
23 .name = "n",
24 .curr = { "n", no },
25 .flags = SYMBOL_CONST|SYMBOL_VALID,
26}, symbol_empty = {
27 .name = "",
28 .curr = { "", no },
29 .flags = SYMBOL_VALID,
30};
31
32struct symbol *sym_defconfig_list;
33struct symbol *modules_sym;
34tristate modules_val;
35
36struct expr *sym_env_list;
37
38static void sym_add_default(struct symbol *sym, const char *def)
39{
40 struct property *prop = prop_alloc(P_DEFAULT, sym);
41
42 prop->expr = expr_alloc_symbol(sym_lookup(def, SYMBOL_CONST));
43}
44
45void sym_init(void)
46{
47 struct symbol *sym;
48 struct utsname uts;
49 static bool inited = false;
50
51 if (inited)
52 return;
53 inited = true;
54
55 uname(&uts);
56
57 sym = sym_lookup("UNAME_RELEASE", 0);
58 sym->type = S_STRING;
59 sym->flags |= SYMBOL_AUTO;
60 sym_add_default(sym, uts.release);
61}
62
63enum symbol_type sym_get_type(struct symbol *sym)
64{
65 enum symbol_type type = sym->type;
66
67 if (type == S_TRISTATE) {
68 if (sym_is_choice_value(sym) && sym->visible == yes)
69 type = S_BOOLEAN;
70 else if (modules_val == no)
71 type = S_BOOLEAN;
72 }
73 return type;
74}
75
76const char *sym_type_name(enum symbol_type type)
77{
78 switch (type) {
79 case S_BOOLEAN:
80 return "boolean";
81 case S_TRISTATE:
82 return "tristate";
83 case S_INT:
84 return "integer";
85 case S_HEX:
86 return "hex";
87 case S_STRING:
88 return "string";
89 case S_UNKNOWN:
90 return "unknown";
91 case S_OTHER:
92 break;
93 }
94 return "???";
95}
96
97struct property *sym_get_choice_prop(struct symbol *sym)
98{
99 struct property *prop;
100
101 for_all_choices(sym, prop)
102 return prop;
103 return NULL;
104}
105
106struct property *sym_get_env_prop(struct symbol *sym)
107{
108 struct property *prop;
109
110 for_all_properties(sym, prop, P_ENV)
111 return prop;
112 return NULL;
113}
114
115struct property *sym_get_default_prop(struct symbol *sym)
116{
117 struct property *prop;
118
119 for_all_defaults(sym, prop) {
120 prop->visible.tri = expr_calc_value(prop->visible.expr);
121 if (prop->visible.tri != no)
122 return prop;
123 }
124 return NULL;
125}
126
127static struct property *sym_get_range_prop(struct symbol *sym)
128{
129 struct property *prop;
130
131 for_all_properties(sym, prop, P_RANGE) {
132 prop->visible.tri = expr_calc_value(prop->visible.expr);
133 if (prop->visible.tri != no)
134 return prop;
135 }
136 return NULL;
137}
138
139static int sym_get_range_val(struct symbol *sym, int base)
140{
141 sym_calc_value(sym);
142 switch (sym->type) {
143 case S_INT:
144 base = 10;
145 break;
146 case S_HEX:
147 base = 16;
148 break;
149 default:
150 break;
151 }
152 return strtol(sym->curr.val, NULL, base);
153}
154
155static void sym_validate_range(struct symbol *sym)
156{
157 struct property *prop;
158 int base, val, val2;
159 char str[64];
160
161 switch (sym->type) {
162 case S_INT:
163 base = 10;
164 break;
165 case S_HEX:
166 base = 16;
167 break;
168 default:
169 return;
170 }
171 prop = sym_get_range_prop(sym);
172 if (!prop)
173 return;
174 val = strtol(sym->curr.val, NULL, base);
175 val2 = sym_get_range_val(prop->expr->left.sym, base);
176 if (val >= val2) {
177 val2 = sym_get_range_val(prop->expr->right.sym, base);
178 if (val <= val2)
179 return;
180 }
181 if (sym->type == S_INT)
182 sprintf(str, "%d", val2);
183 else
184 sprintf(str, "0x%x", val2);
185 sym->curr.val = strdup(str);
186}
187
188static void sym_calc_visibility(struct symbol *sym)
189{
190 struct property *prop;
191 tristate tri;
192
193 /* any prompt visible? */
194 tri = no;
195 for_all_prompts(sym, prop) {
196 prop->visible.tri = expr_calc_value(prop->visible.expr);
197 tri = EXPR_OR(tri, prop->visible.tri);
198 }
199 if (tri == mod && (sym->type != S_TRISTATE || modules_val == no))
200 tri = yes;
201 if (sym->visible != tri) {
202 sym->visible = tri;
203 sym_set_changed(sym);
204 }
205 if (sym_is_choice_value(sym))
206 return;
207 /* defaulting to "yes" if no explicit "depends on" are given */
208 tri = yes;
209 if (sym->dir_dep.expr)
210 tri = expr_calc_value(sym->dir_dep.expr);
211 if (tri == mod)
212 tri = yes;
213 if (sym->dir_dep.tri != tri) {
214 sym->dir_dep.tri = tri;
215 sym_set_changed(sym);
216 }
217 tri = no;
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)
221 tri = yes;
222 if (sym->rev_dep.tri != tri) {
223 sym->rev_dep.tri = tri;
224 sym_set_changed(sym);
225 }
226}
227
228/*
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
233 */
234struct symbol *sym_choice_default(struct symbol *sym)
235{
236 struct symbol *def_sym;
237 struct property *prop;
238 struct expr *e;
239
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)
244 continue;
245 def_sym = prop_get_symbol(prop);
246 if (def_sym->visible != no)
247 return def_sym;
248 }
249
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)
254 return def_sym;
255
256 /* failed to locate any defaults */
257 return NULL;
258}
259
260static struct symbol *sym_calc_choice(struct symbol *sym)
261{
262 struct symbol *def_sym;
263 struct property *prop;
264 struct expr *e;
265
266 /* first calculate all choice values' visibilities */
267 prop = sym_get_choice_prop(sym);
268 expr_list_for_each_sym(prop->expr, e, def_sym)
269 sym_calc_visibility(def_sym);
270
271 /* is the user choice visible? */
272 def_sym = sym->def[S_DEF_USER].val;
273 if (def_sym && def_sym->visible != no)
274 return def_sym;
275
276 def_sym = sym_choice_default(sym);
277
278 if (def_sym == NULL)
279 /* no choice? reset tristate value */
280 sym->curr.tri = no;
281
282 return def_sym;
283}
284
285void sym_calc_value(struct symbol *sym)
286{
287 struct symbol_value newval, oldval;
288 struct property *prop;
289 struct expr *e;
290
291 if (!sym)
292 return;
293
294 if (sym->flags & SYMBOL_VALID)
295 return;
296 sym->flags |= SYMBOL_VALID;
297
298 oldval = sym->curr;
299
300 switch (sym->type) {
301 case S_INT:
302 case S_HEX:
303 case S_STRING:
304 newval = symbol_empty.curr;
305 break;
306 case S_BOOLEAN:
307 case S_TRISTATE:
308 newval = symbol_no.curr;
309 break;
310 default:
311 sym->curr.val = sym->name;
312 sym->curr.tri = no;
313 return;
314 }
315 if (!sym_is_choice_value(sym))
316 sym->flags &= ~SYMBOL_WRITE;
317
318 sym_calc_visibility(sym);
319
320 /* set default if recursively called */
321 sym->curr = newval;
322
323 switch (sym_get_type(sym)) {
324 case S_BOOLEAN:
325 case S_TRISTATE:
326 if (sym_is_choice_value(sym) && sym->visible == yes) {
327 prop = sym_get_choice_prop(sym);
328 newval.tri = (prop_get_symbol(prop)->curr.val == sym) ? yes : no;
329 } else {
330 if (sym->visible != no) {
331 /* if the symbol is visible use the user value
332 * if available, otherwise try the default value
333 */
334 sym->flags |= SYMBOL_WRITE;
335 if (sym_has_value(sym)) {
336 newval.tri = EXPR_AND(sym->def[S_DEF_USER].tri,
337 sym->visible);
338 goto calc_newval;
339 }
340 }
341 if (sym->rev_dep.tri != no)
342 sym->flags |= SYMBOL_WRITE;
343 if (!sym_is_choice(sym)) {
344 prop = sym_get_default_prop(sym);
345 if (prop) {
346 sym->flags |= SYMBOL_WRITE;
347 newval.tri = EXPR_AND(expr_calc_value(prop->expr),
348 prop->visible.tri);
349 }
350 }
351 calc_newval:
352 if (sym->dir_dep.tri == no && sym->rev_dep.tri != no) {
353 struct expr *e;
354 e = expr_simplify_unmet_dep(sym->rev_dep.expr,
355 sym->dir_dep.expr);
356 fprintf(stderr, "warning: (");
357 expr_fprint(e, stderr);
358 fprintf(stderr, ") selects %s which has unmet direct dependencies (",
359 sym->name);
360 expr_fprint(sym->dir_dep.expr, stderr);
361 fprintf(stderr, ")\n");
362 expr_free(e);
363 }
364 newval.tri = EXPR_OR(newval.tri, sym->rev_dep.tri);
365 }
366 if (newval.tri == mod && sym_get_type(sym) == S_BOOLEAN)
367 newval.tri = yes;
368 break;
369 case S_STRING:
370 case S_HEX:
371 case S_INT:
372 if (sym->visible != no) {
373 sym->flags |= SYMBOL_WRITE;
374 if (sym_has_value(sym)) {
375 newval.val = sym->def[S_DEF_USER].val;
376 break;
377 }
378 }
379 prop = sym_get_default_prop(sym);
380 if (prop) {
381 struct symbol *ds = prop_get_symbol(prop);
382 if (ds) {
383 sym->flags |= SYMBOL_WRITE;
384 sym_calc_value(ds);
385 newval.val = ds->curr.val;
386 }
387 }
388 break;
389 default:
390 ;
391 }
392
393 sym->curr = newval;
394 if (sym_is_choice(sym) && newval.tri == yes)
395 sym->curr.val = sym_calc_choice(sym);
396 sym_validate_range(sym);
397
398 if (memcmp(&oldval, &sym->curr, sizeof(oldval))) {
399 sym_set_changed(sym);
400 if (modules_sym == sym) {
401 sym_set_all_changed();
402 modules_val = modules_sym->curr.tri;
403 }
404 }
405
406 if (sym_is_choice(sym)) {
407 struct symbol *choice_sym;
408
409 prop = sym_get_choice_prop(sym);
410 expr_list_for_each_sym(prop->expr, e, choice_sym) {
411 if ((sym->flags & SYMBOL_WRITE) &&
412 choice_sym->visible != no)
413 choice_sym->flags |= SYMBOL_WRITE;
414 if (sym->flags & SYMBOL_CHANGED)
415 sym_set_changed(choice_sym);
416 }
417 }
418
419 if (sym->flags & SYMBOL_AUTO)
420 sym->flags &= ~SYMBOL_WRITE;
421}
422
423void sym_clear_all_valid(void)
424{
425 struct symbol *sym;
426 int i;
427
428 for_all_symbols(i, sym)
429 sym->flags &= ~SYMBOL_VALID;
430 sym_add_change_count(1);
431 if (modules_sym)
432 sym_calc_value(modules_sym);
433}
434
435void sym_set_changed(struct symbol *sym)
436{
437 struct property *prop;
438
439 sym->flags |= SYMBOL_CHANGED;
440 for (prop = sym->prop; prop; prop = prop->next) {
441 if (prop->menu)
442 prop->menu->flags |= MENU_CHANGED;
443 }
444}
445
446void sym_set_all_changed(void)
447{
448 struct symbol *sym;
449 int i;
450
451 for_all_symbols(i, sym)
452 sym_set_changed(sym);
453}
454
455bool sym_tristate_within_range(struct symbol *sym, tristate val)
456{
457 int type = sym_get_type(sym);
458
459 if (sym->visible == no)
460 return false;
461
462 if (type != S_BOOLEAN && type != S_TRISTATE)
463 return false;
464
465 if (type == S_BOOLEAN && val == mod)
466 return false;
467 if (sym->visible <= sym->rev_dep.tri)
468 return false;
469 if (sym_is_choice_value(sym) && sym->visible == yes)
470 return val == yes;
471 return val >= sym->rev_dep.tri && val <= sym->visible;
472}
473
474bool sym_set_tristate_value(struct symbol *sym, tristate val)
475{
476 tristate oldval = sym_get_tristate_value(sym);
477
478 if (oldval != val && !sym_tristate_within_range(sym, val))
479 return false;
480
481 if (!(sym->flags & SYMBOL_DEF_USER)) {
482 sym->flags |= SYMBOL_DEF_USER;
483 sym_set_changed(sym);
484 }
485 /*
486 * setting a choice value also resets the new flag of the choice
487 * symbol and all other choice values.
488 */
489 if (sym_is_choice_value(sym) && val == yes) {
490 struct symbol *cs = prop_get_symbol(sym_get_choice_prop(sym));
491 struct property *prop;
492 struct expr *e;
493
494 cs->def[S_DEF_USER].val = sym;
495 cs->flags |= SYMBOL_DEF_USER;
496 prop = sym_get_choice_prop(cs);
497 for (e = prop->expr; e; e = e->left.expr) {
498 if (e->right.sym->visible != no)
499 e->right.sym->flags |= SYMBOL_DEF_USER;
500 }
501 }
502
503 sym->def[S_DEF_USER].tri = val;
504 if (oldval != val)
505 sym_clear_all_valid();
506
507 return true;
508}
509
510tristate sym_toggle_tristate_value(struct symbol *sym)
511{
512 tristate oldval, newval;
513
514 oldval = newval = sym_get_tristate_value(sym);
515 do {
516 switch (newval) {
517 case no:
518 newval = mod;
519 break;
520 case mod:
521 newval = yes;
522 break;
523 case yes:
524 newval = no;
525 break;
526 }
527 if (sym_set_tristate_value(sym, newval))
528 break;
529 } while (oldval != newval);
530 return newval;
531}
532
533bool sym_string_valid(struct symbol *sym, const char *str)
534{
535 signed char ch;
536
537 switch (sym->type) {
538 case S_STRING:
539 return true;
540 case S_INT:
541 ch = *str++;
542 if (ch == '-')
543 ch = *str++;
544 if (!isdigit(ch))
545 return false;
546 if (ch == '0' && *str != 0)
547 return false;
548 while ((ch = *str++)) {
549 if (!isdigit(ch))
550 return false;
551 }
552 return true;
553 case S_HEX:
554 if (str[0] == '0' && (str[1] == 'x' || str[1] == 'X'))
555 str += 2;
556 ch = *str++;
557 do {
558 if (!isxdigit(ch))
559 return false;
560 } while ((ch = *str++));
561 return true;
562 case S_BOOLEAN:
563 case S_TRISTATE:
564 switch (str[0]) {
565 case 'y': case 'Y':
566 case 'm': case 'M':
567 case 'n': case 'N':
568 return true;
569 }
570 return false;
571 default:
572 return false;
573 }
574}
575
576bool sym_string_within_range(struct symbol *sym, const char *str)
577{
578 struct property *prop;
579 int val;
580
581 switch (sym->type) {
582 case S_STRING:
583 return sym_string_valid(sym, str);
584 case S_INT:
585 if (!sym_string_valid(sym, str))
586 return false;
587 prop = sym_get_range_prop(sym);
588 if (!prop)
589 return true;
590 val = strtol(str, NULL, 10);
591 return val >= sym_get_range_val(prop->expr->left.sym, 10) &&
592 val <= sym_get_range_val(prop->expr->right.sym, 10);
593 case S_HEX:
594 if (!sym_string_valid(sym, str))
595 return false;
596 prop = sym_get_range_prop(sym);
597 if (!prop)
598 return true;
599 val = strtol(str, NULL, 16);
600 return val >= sym_get_range_val(prop->expr->left.sym, 16) &&
601 val <= sym_get_range_val(prop->expr->right.sym, 16);
602 case S_BOOLEAN:
603 case S_TRISTATE:
604 switch (str[0]) {
605 case 'y': case 'Y':
606 return sym_tristate_within_range(sym, yes);
607 case 'm': case 'M':
608 return sym_tristate_within_range(sym, mod);
609 case 'n': case 'N':
610 return sym_tristate_within_range(sym, no);
611 }
612 return false;
613 default:
614 return false;
615 }
616}
617
618bool sym_set_string_value(struct symbol *sym, const char *newval)
619{
620 const char *oldval;
621 char *val;
622 int size;
623
624 switch (sym->type) {
625 case S_BOOLEAN:
626 case S_TRISTATE:
627 switch (newval[0]) {
628 case 'y': case 'Y':
629 return sym_set_tristate_value(sym, yes);
630 case 'm': case 'M':
631 return sym_set_tristate_value(sym, mod);
632 case 'n': case 'N':
633 return sym_set_tristate_value(sym, no);
634 }
635 return false;
636 default:
637 ;
638 }
639
640 if (!sym_string_within_range(sym, newval))
641 return false;
642
643 if (!(sym->flags & SYMBOL_DEF_USER)) {
644 sym->flags |= SYMBOL_DEF_USER;
645 sym_set_changed(sym);
646 }
647
648 oldval = sym->def[S_DEF_USER].val;
649 size = strlen(newval) + 1;
650 if (sym->type == S_HEX && (newval[0] != '0' || (newval[1] != 'x' && newval[1] != 'X'))) {
651 size += 2;
652 sym->def[S_DEF_USER].val = val = malloc(size);
653 *val++ = '0';
654 *val++ = 'x';
655 } else if (!oldval || strcmp(oldval, newval))
656 sym->def[S_DEF_USER].val = val = malloc(size);
657 else
658 return true;
659
660 strcpy(val, newval);
661 free((void *)oldval);
662 sym_clear_all_valid();
663
664 return true;
665}
666
667/*
668 * Find the default value associated to a symbol.
669 * For tristate symbol handle the modules=n case
670 * in which case "m" becomes "y".
671 * If the symbol does not have any default then fallback
672 * to the fixed default values.
673 */
674const char *sym_get_string_default(struct symbol *sym)
675{
676 struct property *prop;
677 struct symbol *ds;
678 const char *str;
679 tristate val;
680
681 sym_calc_visibility(sym);
682 sym_calc_value(modules_sym);
683 val = symbol_no.curr.tri;
684 str = symbol_empty.curr.val;
685
686 /* If symbol has a default value look it up */
687 prop = sym_get_default_prop(sym);
688 if (prop != NULL) {
689 switch (sym->type) {
690 case S_BOOLEAN:
691 case S_TRISTATE:
692 /* The visibility may limit the value from yes => mod */
693 val = EXPR_AND(expr_calc_value(prop->expr), prop->visible.tri);
694 break;
695 default:
696 /*
697 * The following fails to handle the situation
698 * where a default value is further limited by
699 * the valid range.
700 */
701 ds = prop_get_symbol(prop);
702 if (ds != NULL) {
703 sym_calc_value(ds);
704 str = (const char *)ds->curr.val;
705 }
706 }
707 }
708
709 /* Handle select statements */
710 val = EXPR_OR(val, sym->rev_dep.tri);
711
712 /* transpose mod to yes if modules are not enabled */
713 if (val == mod)
714 if (!sym_is_choice_value(sym) && modules_sym->curr.tri == no)
715 val = yes;
716
717 /* transpose mod to yes if type is bool */
718 if (sym->type == S_BOOLEAN && val == mod)
719 val = yes;
720
721 switch (sym->type) {
722 case S_BOOLEAN:
723 case S_TRISTATE:
724 switch (val) {
725 case no: return "n";
726 case mod: return "m";
727 case yes: return "y";
728 }
729 case S_INT:
730 case S_HEX:
731 return str;
732 case S_STRING:
733 return str;
734 case S_OTHER:
735 case S_UNKNOWN:
736 break;
737 }
738 return "";
739}
740
741const char *sym_get_string_value(struct symbol *sym)
742{
743 tristate val;
744
745 switch (sym->type) {
746 case S_BOOLEAN:
747 case S_TRISTATE:
748 val = sym_get_tristate_value(sym);
749 switch (val) {
750 case no:
751 return "n";
752 case mod:
753 sym_calc_value(modules_sym);
754 return (modules_sym->curr.tri == no) ? "n" : "m";
755 case yes:
756 return "y";
757 }
758 break;
759 default:
760 ;
761 }
762 return (const char *)sym->curr.val;
763}
764
765bool sym_is_changable(struct symbol *sym)
766{
767 return sym->visible > sym->rev_dep.tri;
768}
769
770static unsigned strhash(const char *s)
771{
772 /* fnv32 hash */
773 unsigned hash = 2166136261U;
774 for (; *s; s++)
775 hash = (hash ^ *s) * 0x01000193;
776 return hash;
777}
778
779struct symbol *sym_lookup(const char *name, int flags)
780{
781 struct symbol *symbol;
782 char *new_name;
783 int hash;
784
785 if (name) {
786 if (name[0] && !name[1]) {
787 switch (name[0]) {
788 case 'y': return &symbol_yes;
789 case 'm': return &symbol_mod;
790 case 'n': return &symbol_no;
791 }
792 }
793 hash = strhash(name) % SYMBOL_HASHSIZE;
794
795 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
796 if (symbol->name &&
797 !strcmp(symbol->name, name) &&
798 (flags ? symbol->flags & flags
799 : !(symbol->flags & (SYMBOL_CONST|SYMBOL_CHOICE))))
800 return symbol;
801 }
802 new_name = strdup(name);
803 } else {
804 new_name = NULL;
805 hash = 0;
806 }
807
808 symbol = malloc(sizeof(*symbol));
809 memset(symbol, 0, sizeof(*symbol));
810 symbol->name = new_name;
811 symbol->type = S_UNKNOWN;
812 symbol->flags |= flags;
813
814 symbol->next = symbol_hash[hash];
815 symbol_hash[hash] = symbol;
816
817 return symbol;
818}
819
820struct symbol *sym_find(const char *name)
821{
822 struct symbol *symbol = NULL;
823 int hash = 0;
824
825 if (!name)
826 return NULL;
827
828 if (name[0] && !name[1]) {
829 switch (name[0]) {
830 case 'y': return &symbol_yes;
831 case 'm': return &symbol_mod;
832 case 'n': return &symbol_no;
833 }
834 }
835 hash = strhash(name) % SYMBOL_HASHSIZE;
836
837 for (symbol = symbol_hash[hash]; symbol; symbol = symbol->next) {
838 if (symbol->name &&
839 !strcmp(symbol->name, name) &&
840 !(symbol->flags & SYMBOL_CONST))
841 break;
842 }
843
844 return symbol;
845}
846
847/*
848 * Expand symbol's names embedded in the string given in argument. Symbols'
849 * name to be expanded shall be prefixed by a '$'. Unknown symbol expands to
850 * the empty string.
851 */
852const char *sym_expand_string_value(const char *in)
853{
854 const char *src;
855 char *res;
856 size_t reslen;
857
858 reslen = strlen(in) + 1;
859 res = malloc(reslen);
860 res[0] = '\0';
861
862 while ((src = strchr(in, '$'))) {
863 char *p, name[SYMBOL_MAXLENGTH];
864 const char *symval = "";
865 struct symbol *sym;
866 size_t newlen;
867
868 strncat(res, in, src - in);
869 src++;
870
871 p = name;
872 while (isalnum(*src) || *src == '_')
873 *p++ = *src++;
874 *p = '\0';
875
876 sym = sym_find(name);
877 if (sym != NULL) {
878 sym_calc_value(sym);
879 symval = sym_get_string_value(sym);
880 }
881
882 newlen = strlen(res) + strlen(symval) + strlen(src) + 1;
883 if (newlen > reslen) {
884 reslen = newlen;
885 res = realloc(res, reslen);
886 }
887
888 strcat(res, symval);
889 in = src;
890 }
891 strcat(res, in);
892
893 return res;
894}
895
896const char *sym_escape_string_value(const char *in)
897{
898 const char *p;
899 size_t reslen;
900 char *res;
901 size_t l;
902
903 reslen = strlen(in) + strlen("\"\"") + 1;
904
905 p = in;
906 for (;;) {
907 l = strcspn(p, "\"\\");
908 p += l;
909
910 if (p[0] == '\0')
911 break;
912
913 reslen++;
914 p++;
915 }
916
917 res = malloc(reslen);
918 res[0] = '\0';
919
920 strcat(res, "\"");
921
922 p = in;
923 for (;;) {
924 l = strcspn(p, "\"\\");
925 strncat(res, p, l);
926 p += l;
927
928 if (p[0] == '\0')
929 break;
930
931 strcat(res, "\\");
932 strncat(res, p++, 1);
933 }
934
935 strcat(res, "\"");
936 return res;
937}
938
939struct symbol **sym_re_search(const char *pattern)
940{
941 struct symbol *sym, **sym_arr = NULL;
942 int i, cnt, size;
943 regex_t re;
944
945 cnt = size = 0;
946 /* Skip if empty */
947 if (strlen(pattern) == 0)
948 return NULL;
949 if (regcomp(&re, pattern, REG_EXTENDED|REG_NOSUB|REG_ICASE))
950 return NULL;
951
952 for_all_symbols(i, sym) {
953 if (sym->flags & SYMBOL_CONST || !sym->name)
954 continue;
955 if (regexec(&re, sym->name, 0, NULL, 0))
956 continue;
957 if (cnt + 1 >= size) {
958 void *tmp = sym_arr;
959 size += 16;
960 sym_arr = realloc(sym_arr, size * sizeof(struct symbol *));
961 if (!sym_arr) {
962 free(tmp);
963 return NULL;
964 }
965 }
966 sym_calc_value(sym);
967 sym_arr[cnt++] = sym;
968 }
969 if (sym_arr)
970 sym_arr[cnt] = NULL;
971 regfree(&re);
972
973 return sym_arr;
974}
975
976/*
977 * When we check for recursive dependencies we use a stack to save
978 * current state so we can print out relevant info to user.
979 * The entries are located on the call stack so no need to free memory.
980 * Note inser() remove() must always match to properly clear the stack.
981 */
982static struct dep_stack {
983 struct dep_stack *prev, *next;
984 struct symbol *sym;
985 struct property *prop;
986 struct expr *expr;
987} *check_top;
988
989static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym)
990{
991 memset(stack, 0, sizeof(*stack));
992 if (check_top)
993 check_top->next = stack;
994 stack->prev = check_top;
995 stack->sym = sym;
996 check_top = stack;
997}
998
999static void dep_stack_remove(void)
1000{
1001 check_top = check_top->prev;
1002 if (check_top)
1003 check_top->next = NULL;
1004}
1005
1006/*
1007 * Called when we have detected a recursive dependency.
1008 * check_top point to the top of the stact so we use
1009 * the ->prev pointer to locate the bottom of the stack.
1010 */
1011static void sym_check_print_recursive(struct symbol *last_sym)
1012{
1013 struct dep_stack *stack;
1014 struct symbol *sym, *next_sym;
1015 struct menu *menu = NULL;
1016 struct property *prop;
1017 struct dep_stack cv_stack;
1018
1019 if (sym_is_choice_value(last_sym)) {
1020 dep_stack_insert(&cv_stack, last_sym);
1021 last_sym = prop_get_symbol(sym_get_choice_prop(last_sym));
1022 }
1023
1024 for (stack = check_top; stack != NULL; stack = stack->prev)
1025 if (stack->sym == last_sym)
1026 break;
1027 if (!stack) {
1028 fprintf(stderr, "unexpected recursive dependency error\n");
1029 return;
1030 }
1031
1032 for (; stack; stack = stack->next) {
1033 sym = stack->sym;
1034 next_sym = stack->next ? stack->next->sym : last_sym;
1035 prop = stack->prop;
1036 if (prop == NULL)
1037 prop = stack->sym->prop;
1038
1039 /* for choice values find the menu entry (used below) */
1040 if (sym_is_choice(sym) || sym_is_choice_value(sym)) {
1041 for (prop = sym->prop; prop; prop = prop->next) {
1042 menu = prop->menu;
1043 if (prop->menu)
1044 break;
1045 }
1046 }
1047 if (stack->sym == last_sym)
1048 fprintf(stderr, "%s:%d:error: recursive dependency detected!\n",
1049 prop->file->name, prop->lineno);
1050 if (stack->expr) {
1051 fprintf(stderr, "%s:%d:\tsymbol %s %s value contains %s\n",
1052 prop->file->name, prop->lineno,
1053 sym->name ? sym->name : "<choice>",
1054 prop_get_type_name(prop->type),
1055 next_sym->name ? next_sym->name : "<choice>");
1056 } else if (stack->prop) {
1057 fprintf(stderr, "%s:%d:\tsymbol %s depends on %s\n",
1058 prop->file->name, prop->lineno,
1059 sym->name ? sym->name : "<choice>",
1060 next_sym->name ? next_sym->name : "<choice>");
1061 } else if (sym_is_choice(sym)) {
1062 fprintf(stderr, "%s:%d:\tchoice %s contains symbol %s\n",
1063 menu->file->name, menu->lineno,
1064 sym->name ? sym->name : "<choice>",
1065 next_sym->name ? next_sym->name : "<choice>");
1066 } else if (sym_is_choice_value(sym)) {
1067 fprintf(stderr, "%s:%d:\tsymbol %s is part of choice %s\n",
1068 menu->file->name, menu->lineno,
1069 sym->name ? sym->name : "<choice>",
1070 next_sym->name ? next_sym->name : "<choice>");
1071 } else {
1072 fprintf(stderr, "%s:%d:\tsymbol %s is selected by %s\n",
1073 prop->file->name, prop->lineno,
1074 sym->name ? sym->name : "<choice>",
1075 next_sym->name ? next_sym->name : "<choice>");
1076 }
1077 }
1078
1079 if (check_top == &cv_stack)
1080 dep_stack_remove();
1081}
1082
1083static struct symbol *sym_check_expr_deps(struct expr *e)
1084{
1085 struct symbol *sym;
1086
1087 if (!e)
1088 return NULL;
1089 switch (e->type) {
1090 case E_OR:
1091 case E_AND:
1092 sym = sym_check_expr_deps(e->left.expr);
1093 if (sym)
1094 return sym;
1095 return sym_check_expr_deps(e->right.expr);
1096 case E_NOT:
1097 return sym_check_expr_deps(e->left.expr);
1098 case E_EQUAL:
1099 case E_UNEQUAL:
1100 sym = sym_check_deps(e->left.sym);
1101 if (sym)
1102 return sym;
1103 return sym_check_deps(e->right.sym);
1104 case E_SYMBOL:
1105 return sym_check_deps(e->left.sym);
1106 default:
1107 break;
1108 }
1109 printf("Oops! How to check %d?\n", e->type);
1110 return NULL;
1111}
1112
1113/* return NULL when dependencies are OK */
1114static struct symbol *sym_check_sym_deps(struct symbol *sym)
1115{
1116 struct symbol *sym2;
1117 struct property *prop;
1118 struct dep_stack stack;
1119
1120 dep_stack_insert(&stack, sym);
1121
1122 sym2 = sym_check_expr_deps(sym->rev_dep.expr);
1123 if (sym2)
1124 goto out;
1125
1126 for (prop = sym->prop; prop; prop = prop->next) {
1127 if (prop->type == P_CHOICE || prop->type == P_SELECT)
1128 continue;
1129 stack.prop = prop;
1130 sym2 = sym_check_expr_deps(prop->visible.expr);
1131 if (sym2)
1132 break;
1133 if (prop->type != P_DEFAULT || sym_is_choice(sym))
1134 continue;
1135 stack.expr = prop->expr;
1136 sym2 = sym_check_expr_deps(prop->expr);
1137 if (sym2)
1138 break;
1139 stack.expr = NULL;
1140 }
1141
1142out:
1143 dep_stack_remove();
1144
1145 return sym2;
1146}
1147
1148static struct symbol *sym_check_choice_deps(struct symbol *choice)
1149{
1150 struct symbol *sym, *sym2;
1151 struct property *prop;
1152 struct expr *e;
1153 struct dep_stack stack;
1154
1155 dep_stack_insert(&stack, choice);
1156
1157 prop = sym_get_choice_prop(choice);
1158 expr_list_for_each_sym(prop->expr, e, sym)
1159 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1160
1161 choice->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1162 sym2 = sym_check_sym_deps(choice);
1163 choice->flags &= ~SYMBOL_CHECK;
1164 if (sym2)
1165 goto out;
1166
1167 expr_list_for_each_sym(prop->expr, e, sym) {
1168 sym2 = sym_check_sym_deps(sym);
1169 if (sym2)
1170 break;
1171 }
1172out:
1173 expr_list_for_each_sym(prop->expr, e, sym)
1174 sym->flags &= ~SYMBOL_CHECK;
1175
1176 if (sym2 && sym_is_choice_value(sym2) &&
1177 prop_get_symbol(sym_get_choice_prop(sym2)) == choice)
1178 sym2 = choice;
1179
1180 dep_stack_remove();
1181
1182 return sym2;
1183}
1184
1185struct symbol *sym_check_deps(struct symbol *sym)
1186{
1187 struct symbol *sym2;
1188 struct property *prop;
1189
1190 if (sym->flags & SYMBOL_CHECK) {
1191 sym_check_print_recursive(sym);
1192 return sym;
1193 }
1194 if (sym->flags & SYMBOL_CHECKED)
1195 return NULL;
1196
1197 if (sym_is_choice_value(sym)) {
1198 struct dep_stack stack;
1199
1200 /* for choice groups start the check with main choice symbol */
1201 dep_stack_insert(&stack, sym);
1202 prop = sym_get_choice_prop(sym);
1203 sym2 = sym_check_deps(prop_get_symbol(prop));
1204 dep_stack_remove();
1205 } else if (sym_is_choice(sym)) {
1206 sym2 = sym_check_choice_deps(sym);
1207 } else {
1208 sym->flags |= (SYMBOL_CHECK | SYMBOL_CHECKED);
1209 sym2 = sym_check_sym_deps(sym);
1210 sym->flags &= ~SYMBOL_CHECK;
1211 }
1212
1213 if (sym2 && sym2 == sym)
1214 sym2 = NULL;
1215
1216 return sym2;
1217}
1218
1219struct property *prop_alloc(enum prop_type type, struct symbol *sym)
1220{
1221 struct property *prop;
1222 struct property **propp;
1223
1224 prop = malloc(sizeof(*prop));
1225 memset(prop, 0, sizeof(*prop));
1226 prop->type = type;
1227 prop->sym = sym;
1228 prop->file = current_file;
1229 prop->lineno = zconf_lineno();
1230
1231 /* append property to the prop list of symbol */
1232 if (sym) {
1233 for (propp = &sym->prop; *propp; propp = &(*propp)->next)
1234 ;
1235 *propp = prop;
1236 }
1237
1238 return prop;
1239}
1240
1241struct symbol *prop_get_symbol(struct property *prop)
1242{
1243 if (prop->expr && (prop->expr->type == E_SYMBOL ||
1244 prop->expr->type == E_LIST))
1245 return prop->expr->left.sym;
1246 return NULL;
1247}
1248
1249const char *prop_get_type_name(enum prop_type type)
1250{
1251 switch (type) {
1252 case P_PROMPT:
1253 return "prompt";
1254 case P_ENV:
1255 return "env";
1256 case P_COMMENT:
1257 return "comment";
1258 case P_MENU:
1259 return "menu";
1260 case P_DEFAULT:
1261 return "default";
1262 case P_CHOICE:
1263 return "choice";
1264 case P_SELECT:
1265 return "select";
1266 case P_RANGE:
1267 return "range";
1268 case P_SYMBOL:
1269 return "symbol";
1270 case P_UNKNOWN:
1271 break;
1272 }
1273 return "unknown";
1274}
1275
1276static void prop_add_env(const char *env)
1277{
1278 struct symbol *sym, *sym2;
1279 struct property *prop;
1280 char *p;
1281
1282 sym = current_entry->sym;
1283 sym->flags |= SYMBOL_AUTO;
1284 for_all_properties(sym, prop, P_ENV) {
1285 sym2 = prop_get_symbol(prop);
1286 if (strcmp(sym2->name, env))
1287 menu_warn(current_entry, "redefining environment symbol from %s",
1288 sym2->name);
1289 return;
1290 }
1291
1292 prop = prop_alloc(P_ENV, sym);
1293 prop->expr = expr_alloc_symbol(sym_lookup(env, SYMBOL_CONST));
1294
1295 sym_env_list = expr_alloc_one(E_LIST, sym_env_list);
1296 sym_env_list->right.sym = sym;
1297
1298 p = getenv(env);
1299 if (p)
1300 sym_add_default(sym, p);
1301 else
1302 menu_warn(current_entry, "environment variable %s undefined", env);
1303}