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