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