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