1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104
|
/*
* Asterisk -- An open source telephony toolkit.
*
* Copyright (C) 2005 - 2010, Digium, Inc.
*
* Russell Bryant <russell@digium.com>
*
* See http://www.asterisk.org for more information about
* the Asterisk project. Please do not directly contact
* any of the maintainers of this project for assistance;
* the project provides a web site, mailing lists and IRC
* channels for your use.
*
* This program is free software, distributed under the terms of
* the GNU General Public License Version 2. See the LICENSE file
* at the top of the source tree.
*/
/*!
* \file
*
* \author Russell Bryant <russell@digium.com>
*
* \brief A menu-driven system for Asterisk module selection
*/
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <stdarg.h>
#include <getopt.h>
#include "autoconfig.h"
#include "mxml/mxml.h"
#include "linkedlists.h"
#include "menuselect.h"
#ifdef MENUSELECT_DEBUG
static FILE *debug;
#endif
/*! The list of categories */
struct categories categories = AST_LIST_HEAD_NOLOCK_INIT_VALUE;
/*!
We have to maintain a pointer to the root of the trees generated from reading
the build options XML files so that we can free it when we're done. We don't
copy any of the information over from these trees. Our list is just a
convenient mapping to the information contained in these lists with one
additional piece of information - whether the build option is enabled or not.
*/
struct tree {
/*! the root of the tree */
mxml_node_t *root;
/*! for linking */
AST_LIST_ENTRY(tree) list;
};
/*! The list of trees from menuselect-tree files */
static AST_LIST_HEAD_NOLOCK_STATIC(trees, tree);
static const char * const tree_files[] = {
"menuselect-tree"
};
static char *output_makeopts = OUTPUT_MAKEOPTS_DEFAULT;
static char *output_makedeps = OUTPUT_MAKEDEPS_DEFAULT;
/*! This is set to 1 if menuselect.makeopts pre-existed the execution of this app */
static int existing_config = 0;
/*! This is set when the --check-deps argument is provided. */
static int check_deps = 0;
/*! These are set when the --list-options or --list-groups arguments are provided. */
static int list_options = 0, list_groups = 0;
/*! This variable is non-zero when any changes are made */
int changes_made = 0;
/*! Menu name */
const char *menu_name = "Menuselect";
enum dep_file_state {
DEP_FILE_UNKNOWN = -2,
DEP_FILE_DISABLED = -1,
DEP_FILE_UNMET = 0,
DEP_FILE_MET = 1,
};
/*! Global list of dependencies that are external to the tree */
struct dep_file {
char name[32];
enum dep_file_state met;
enum dep_file_state previously_met;
AST_LIST_ENTRY(dep_file) list;
};
AST_LIST_HEAD_NOLOCK_STATIC(deps_file, dep_file);
#if !defined(ast_strdupa) && defined(__GNUC__)
#define ast_strdupa(s) \
(__extension__ \
({ \
const char *__old = (s); \
size_t __len = strlen(__old) + 1; \
char *__new = __builtin_alloca(__len); \
memcpy (__new, __old, __len); \
__new; \
}))
#endif
/*! \brief return a pointer to the first non-whitespace character */
static inline char *skip_blanks(char *str)
{
if (!str)
return NULL;
while (*str && *str < 33)
str++;
return str;
}
static int open_debug(void)
{
#ifdef MENUSELECT_DEBUG
if (!(debug = fopen("menuselect_debug.txt", "w"))) {
fprintf(stderr, "Failed to open menuselect_debug.txt for debug output.\n");
return -1;
}
#endif
return 0;
}
#define print_debug(f, ...) __print_debug(__LINE__, f, ## __VA_ARGS__)
static void __attribute__((format(printf, 2, 3))) __print_debug(int line, const char *format, ...)
{
#ifdef MENUSELECT_DEBUG
va_list ap;
fprintf(debug, "%d -", line);
va_start(ap, format);
vfprintf(debug, format, ap);
va_end(ap);
fflush(debug);
#endif
}
static void close_debug(void)
{
#ifdef MENUSELECT_DEBUG
if (debug)
fclose(debug);
#endif
}
/*! \brief Add a category to the category list, ensuring that there are no duplicates */
static struct category *add_category(struct category *cat)
{
struct category *tmp;
AST_LIST_TRAVERSE(&categories, tmp, list) {
if (!strcmp(tmp->name, cat->name)) {
return tmp;
}
}
AST_LIST_INSERT_TAIL(&categories, cat, list);
return cat;
}
#if 0
/*! \brief Add a member to the member list of a category, ensuring that there are no duplicates */
static int add_member(struct member *mem, struct category *cat)
{
struct member *tmp;
AST_LIST_TRAVERSE(&cat->members, tmp, list) {
if (!strcmp(tmp->name, mem->name)) {
fprintf(stderr, "Member '%s' already exists in category '%s', ignoring.\n", mem->name, cat->name);
return -1;
}
}
AST_LIST_INSERT_TAIL(&cat->members, mem, list);
return 0;
}
#endif
static int add_member_after(struct member *mem, struct category *cat, struct member *place)
{
struct member *tmp;
AST_LIST_TRAVERSE(&cat->members, tmp, list) {
if (!strcmp(tmp->name, mem->name)) {
fprintf(stderr, "Member '%s' already exists in category '%s', ignoring.\n", mem->name, cat->name);
return -1;
}
}
AST_LIST_INSERT_AFTER(&cat->members, place, mem, list);
return 0;
}
static int add_member_head(struct member *mem, struct category *cat)
{
struct member *tmp;
AST_LIST_TRAVERSE(&cat->members, tmp, list) {
if (!strcmp(tmp->name, mem->name)) {
fprintf(stderr, "Member '%s' already exists in category '%s', ignoring.\n", mem->name, cat->name);
return -1;
}
}
AST_LIST_INSERT_HEAD(&cat->members, mem, list);
return 0;
}
/*! \brief Free a member structure and all of its members */
static void free_member(struct member *mem)
{
struct reference *dep;
struct reference *cnf;
struct reference *use;
while ((dep = AST_LIST_REMOVE_HEAD(&mem->deps, list)))
free(dep);
while ((cnf = AST_LIST_REMOVE_HEAD(&mem->conflicts, list)))
free(cnf);
while ((use = AST_LIST_REMOVE_HEAD(&mem->uses, list)))
free(use);
free(mem);
}
/*! \assigns values to support level strings */
static enum support_level_values string_to_support_level(const char *support_level)
{
if (!support_level) {
return SUPPORT_UNSPECIFIED;
}
if (!strcasecmp(support_level, "core")) {
return SUPPORT_CORE;
}
if (!strcasecmp(support_level, "extended")) {
return SUPPORT_EXTENDED;
}
if (!strcasecmp(support_level, "deprecated")) {
return SUPPORT_DEPRECATED;
}
return SUPPORT_UNSPECIFIED;
}
/*! \gets const separator strings from support level values */
static const char *support_level_to_string(enum support_level_values support_level)
{
switch (support_level) {
case SUPPORT_CORE:
return "core";
case SUPPORT_EXTENDED:
return "extended";
case SUPPORT_DEPRECATED:
return "deprecated";
default:
return "unspecified";
}
}
/*! \sets default values for a given separator */
static int initialize_separator(struct member *separators[], enum support_level_values level)
{
separators[level] = calloc(1, sizeof(*(separators[level])));
separators[level]->name = support_level_to_string(level);
separators[level]->displayname = "";
separators[level]->is_separator = 1;
return 0;
}
/*! \Iterates through an existing category's members. If separators are found, they are
added to the provided separator array. Any separators left unfound will then be
initialized with initialize_separator. */
static void find_or_initialize_separators(struct member *separators[], struct category *cat, int used[])
{
enum support_level_values level;
struct member *tmp;
AST_LIST_TRAVERSE(&cat->members, tmp, list) {
if (tmp->is_separator) {
level = string_to_support_level(tmp->name);
separators[level] = tmp;
used[level] = 1;
}
}
for (level = 0; level < SUPPORT_COUNT; level++) {
if (!used[level]) {
initialize_separator(separators, level);
}
}
}
/*! \adds a member to a category and attaches it to the last element of a particular support level used */
static int add_member_list_order(struct member *mem, struct category *cat, struct member *tails[], int used[], struct member *separators[])
{
enum support_level_values support_level = string_to_support_level(mem->support_level);
int tail_index;
/* Works backwards from support_level to find properly ordered linked list member to insert from */
for (tail_index = support_level; ; tail_index--) {
if (tail_index == -1) {
break;
}
if (used[tail_index]) {
break;
}
}
if (tail_index == -1) { /* None of the nodes that should come before the list were in use, so use head. */
if (add_member_head(mem, cat)) { /* Failure to insert the node... */
return -1;
}
/* If we successfully added the member, we need to update its support level pointer info */
tails[support_level] = mem;
used[support_level] = 1;
if (add_member_head(separators[support_level], cat)) {
printf("Separator insertion failed. This should be impossible, report an issue if this occurs.\n");
return -1;
}
return 0;
} else { /* We found an appropriate node to use to insert before we reached the head. */
if (add_member_after(mem, cat, tails[tail_index])) {
return -1;
}
tails[support_level] = mem;
used[support_level] = 1;
if (support_level != tail_index) {
if (add_member_after(separators[support_level], cat, tails[tail_index])) {
printf("Separator insertion failed. This should be impossible, report an issue if this occurs.\n");
return -1;
}
}
return 0;
}
return -2; /* failed to place... for whatever reason. This should be impossible to reach. */
}
/*! \brief Parse an input makeopts file */
static int parse_tree(const char *tree_file)
{
FILE *f;
struct tree *tree;
struct member *mem;
struct reference *dep;
struct reference *cnf;
struct reference *use;
mxml_node_t *cur;
mxml_node_t *cur2;
mxml_node_t *cur3;
mxml_node_t *menu;
const char *tmp;
if (!(f = fopen(tree_file, "r"))) {
fprintf(stderr, "Unable to open '%s' for reading!\n", tree_file);
return -1;
}
if (!(tree = calloc(1, sizeof(*tree)))) {
fclose(f);
return -1;
}
if (!(tree->root = mxmlLoadFile(NULL, f, MXML_OPAQUE_CALLBACK))) {
fclose(f);
free(tree);
return -1;
}
AST_LIST_INSERT_HEAD(&trees, tree, list);
menu = mxmlFindElement(tree->root, tree->root, "menu", NULL, NULL, MXML_DESCEND);
if ((tmp = mxmlElementGetAttr(menu, "name")))
menu_name = tmp;
for (cur = mxmlFindElement(menu, menu, "category", NULL, NULL, MXML_DESCEND_FIRST);
cur;
cur = mxmlFindElement(cur, menu, "category", NULL, NULL, MXML_NO_DESCEND))
{
struct category *cat;
struct category *newcat;
/* Member seperator definitions */
struct member *separators[SUPPORT_COUNT];
/* link list tails... used to put new elements in in order of support level */
struct member *support_tails[SUPPORT_COUNT];
int support_tails_placed[SUPPORT_COUNT] = { 0 };
if (!(cat = calloc(1, sizeof(*cat))))
return -1;
cat->name = mxmlElementGetAttr(cur, "name");
newcat = add_category(cat);
if (newcat != cat) {
/* want to append members, and potentially update the category. */
free(cat);
cat = newcat;
}
find_or_initialize_separators(separators, cat, support_tails_placed);
if ((tmp = mxmlElementGetAttr(cur, "displayname")))
cat->displayname = tmp;
if ((tmp = mxmlElementGetAttr(cur, "positive_output")))
cat->positive_output = !strcasecmp(tmp, "yes");
if ((tmp = mxmlElementGetAttr(cur, "exclusive")))
cat->exclusive = !strcasecmp(tmp, "yes");
if ((tmp = mxmlElementGetAttr(cur, "remove_on_change")))
cat->remove_on_change = tmp;
if ((tmp = mxmlElementGetAttr(cur, "touch_on_change")))
cat->touch_on_change = tmp;
for (cur2 = mxmlFindElement(cur, cur, "member", NULL, NULL, MXML_DESCEND_FIRST);
cur2;
cur2 = mxmlFindElement(cur2, cur, "member", NULL, NULL, MXML_NO_DESCEND))
{
if (!(mem = calloc(1, sizeof(*mem))))
return -1;
mem->name = mxmlElementGetAttr(cur2, "name");
mem->displayname = mxmlElementGetAttr(cur2, "displayname");
mem->touch_on_change = mxmlElementGetAttr(cur2, "touch_on_change");
mem->remove_on_change = mxmlElementGetAttr(cur2, "remove_on_change");
mem->support_level = "unspecified";
if ((tmp = mxmlElementGetAttr(cur2, "explicitly_enabled_only"))) {
mem->explicitly_enabled_only = !strcasecmp(tmp, "yes");
}
cur3 = mxmlFindElement(cur2, cur2, "defaultenabled", NULL, NULL, MXML_DESCEND);
if (cur3 && cur3->child) {
mem->defaultenabled = cur3->child->value.opaque;
}
if (!cat->positive_output) {
mem->enabled = 1;
if (!mem->defaultenabled || strcasecmp(mem->defaultenabled, "no")) {
mem->was_enabled = 1;
print_debug("Enabled %s because the category does not have positive output\n", mem->name);
}
}
cur3 = mxmlFindElement(cur2, cur2, "support_level", NULL, NULL, MXML_DESCEND);
if (cur3 && cur3->child) {
mem->support_level = cur3->child->value.opaque;
print_debug("Set support_level for %s to %s\n", mem->name, mem->support_level);
}
cur3 = mxmlFindElement(cur2, cur2, "replacement", NULL, NULL, MXML_DESCEND);
if (cur3 && cur3->child) {
mem->replacement = cur3->child->value.opaque;
}
for (cur3 = mxmlFindElement(cur2, cur2, "depend", NULL, NULL, MXML_DESCEND_FIRST);
cur3 && cur3->child;
cur3 = mxmlFindElement(cur3, cur2, "depend", NULL, NULL, MXML_NO_DESCEND))
{
if (!(dep = calloc(1, sizeof(*dep)))) {
free_member(mem);
return -1;
}
if ((tmp = mxmlElementGetAttr(cur3, "name"))) {
if (!strlen_zero(tmp)) {
dep->name = tmp;
}
}
if (!strlen_zero(cur3->child->value.opaque)) {
dep->displayname = cur3->child->value.opaque;
if (!dep->name) {
dep->name = dep->displayname;
}
AST_LIST_INSERT_TAIL(&mem->deps, dep, list);
} else
free(dep);
}
for (cur3 = mxmlFindElement(cur2, cur2, "conflict", NULL, NULL, MXML_DESCEND_FIRST);
cur3 && cur3->child;
cur3 = mxmlFindElement(cur3, cur2, "conflict", NULL, NULL, MXML_NO_DESCEND))
{
if (!(cnf = calloc(1, sizeof(*cnf)))) {
free_member(mem);
return -1;
}
if ((tmp = mxmlElementGetAttr(cur3, "name"))) {
if (!strlen_zero(tmp)) {
cnf->name = tmp;
}
}
if (!strlen_zero(cur3->child->value.opaque)) {
cnf->displayname = cur3->child->value.opaque;
if (!cnf->name) {
cnf->name = cnf->displayname;
}
AST_LIST_INSERT_TAIL(&mem->conflicts, cnf, list);
} else
free(cnf);
}
for (cur3 = mxmlFindElement(cur2, cur2, "use", NULL, NULL, MXML_DESCEND_FIRST);
cur3 && cur3->child;
cur3 = mxmlFindElement(cur3, cur2, "use", NULL, NULL, MXML_NO_DESCEND))
{
if (!(use = calloc(1, sizeof(*use)))) {
free_member(mem);
return -1;
}
if ((tmp = mxmlElementGetAttr(cur3, "name"))) {
if (!strlen_zero(tmp)) {
use->name = tmp;
}
}
if (!strlen_zero(cur3->child->value.opaque)) {
use->displayname = cur3->child->value.opaque;
if (!use->name) {
use->name = use->displayname;
}
AST_LIST_INSERT_TAIL(&mem->uses, use, list);
} else {
free(use);
}
}
if (add_member_list_order(mem, cat, support_tails, support_tails_placed, separators)) {
free_member(mem);
}
}
}
fclose(f);
return 0;
}
/*!
* \arg interactive Set to non-zero if being called while user is making changes
*/
static unsigned int calc_dep_failures(int interactive, int pre_confload)
{
unsigned int result = 0;
struct category *cat;
struct member *mem;
struct reference *dep;
struct dep_file *dep_file;
unsigned int changed, old_failure;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
old_failure = mem->depsfailed;
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
if (dep->member)
continue;
mem->depsfailed = HARD_FAILURE;
AST_LIST_TRAVERSE(&deps_file, dep_file, list) {
if (!strcasecmp(dep_file->name, dep->name)) {
if (dep_file->met == DEP_FILE_MET) {
mem->depsfailed = NO_FAILURE;
}
break;
}
}
if (mem->depsfailed != NO_FAILURE) {
break; /* This dependency is not met, so we can stop now */
}
}
if (old_failure == SOFT_FAILURE && mem->depsfailed != HARD_FAILURE)
mem->depsfailed = SOFT_FAILURE;
}
}
if (pre_confload) {
return 0;
}
do {
changed = 0;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
old_failure = mem->depsfailed;
if (mem->depsfailed == HARD_FAILURE)
continue;
mem->depsfailed = NO_FAILURE;
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
if (!dep->member)
continue;
if (dep->member->depsfailed == HARD_FAILURE) {
mem->depsfailed = HARD_FAILURE;
break;
} else if (dep->member->depsfailed == SOFT_FAILURE) {
mem->depsfailed = SOFT_FAILURE;
} else if (!dep->member->enabled) {
mem->depsfailed = SOFT_FAILURE;
}
}
if (mem->depsfailed != old_failure) {
if ((mem->depsfailed == NO_FAILURE) && mem->was_defaulted) {
mem->enabled = !strcasecmp(mem->defaultenabled, "yes");
print_debug("Just set %s enabled to %d\n", mem->name, mem->enabled);
} else {
mem->enabled = interactive ? 0 : mem->was_enabled;
print_debug("Just set %s enabled to %d\n", mem->name, mem->enabled);
}
changed = 1;
break; /* This dependency is not met, so we can stop now */
}
}
if (changed)
break;
}
if (changed)
result = 1;
} while (changed);
return result;
}
static unsigned int calc_conflict_failures(int interactive, int pre_confload)
{
unsigned int result = 0;
struct category *cat;
struct member *mem;
struct reference *cnf;
struct dep_file *dep_file;
unsigned int changed, old_failure;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
old_failure = mem->conflictsfailed;
AST_LIST_TRAVERSE(&mem->conflicts, cnf, list) {
if (cnf->member)
continue;
mem->conflictsfailed = NO_FAILURE;
AST_LIST_TRAVERSE(&deps_file, dep_file, list) {
if (!strcasecmp(dep_file->name, cnf->name)) {
if (dep_file->met == DEP_FILE_MET) {
mem->conflictsfailed = HARD_FAILURE;
print_debug("Setting %s conflictsfailed to HARD_FAILURE\n", mem->name);
}
break;
}
}
if (mem->conflictsfailed != NO_FAILURE)
break; /* This conflict was found, so we can stop now */
}
if (old_failure == SOFT_FAILURE && mem->conflictsfailed != HARD_FAILURE) {
print_debug("%d - Setting %s conflictsfailed to SOFT_FAILURE\n", __LINE__, mem->name);
mem->conflictsfailed = SOFT_FAILURE;
}
}
}
if (pre_confload) {
return 0;
}
do {
changed = 0;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
old_failure = mem->conflictsfailed;
if (mem->conflictsfailed == HARD_FAILURE)
continue;
mem->conflictsfailed = NO_FAILURE;
AST_LIST_TRAVERSE(&mem->conflicts, cnf, list) {
if (!cnf->member)
continue;
if (cnf->member->enabled) {
mem->conflictsfailed = SOFT_FAILURE;
print_debug("%d - Setting %s conflictsfailed to SOFT_FAILURE because %s is enabled\n", __LINE__, mem->name, cnf->member->name);
break;
}
}
if (mem->conflictsfailed != old_failure && mem->conflictsfailed != NO_FAILURE) {
mem->enabled = 0;
print_debug("Just set %s enabled to %d because of conflicts\n", mem->name, mem->enabled);
changed = 1;
break; /* This conflict has been found, so we can stop now */
}
}
if (changed)
break;
}
if (changed)
result = 1;
} while (changed);
return result;
}
/*! \brief Process dependencies against the input dependencies file */
static int process_deps(void)
{
FILE *f;
char buf[80];
int res = 0;
struct dep_file *dep_file;
if (!(f = fopen(MENUSELECT_DEPS, "r"))) {
fprintf(stderr, "Unable to open '%s' for reading! Did you run ./configure ?\n", MENUSELECT_DEPS);
return -1;
}
/* Build a dependency list from the file generated by configure */
while (memset(buf, 0, sizeof(buf)), fgets(buf, sizeof(buf), f)) {
char *name, *cur, *prev, *p;
int val;
/* Strip trailing CR/NL */
while ((p = strchr(buf, '\r')) || (p = strchr(buf, '\n'))) {
*p = '\0';
}
p = buf;
name = strsep(&p, "=");
if (!p)
continue;
cur = strsep(&p, ":");
prev = strsep(&p, ":");
if (!(dep_file = calloc(1, sizeof(*dep_file))))
break;
strncpy(dep_file->name, name, sizeof(dep_file->name) - 1);
dep_file->met = DEP_FILE_UNKNOWN;
dep_file->previously_met = DEP_FILE_UNKNOWN;
if (sscanf(cur, "%d", &val) != 1) {
fprintf(stderr, "Unknown value '%s' found in %s for %s\n", cur, MENUSELECT_DEPS, name);
} else {
switch (val) {
case DEP_FILE_MET:
case DEP_FILE_UNMET:
case DEP_FILE_DISABLED:
dep_file->met = val;
break;
default:
fprintf(stderr, "Unknown value '%s' found in %s for %s\n", cur, MENUSELECT_DEPS, name);
break;
}
}
if (prev) {
if (sscanf(prev, "%d", &val) != 1) {
fprintf(stderr, "Unknown value '%s' found in %s for %s\n", prev, MENUSELECT_DEPS, name);
} else {
switch (val) {
case DEP_FILE_MET:
case DEP_FILE_UNMET:
case DEP_FILE_DISABLED:
dep_file->previously_met = val;
break;
default:
fprintf(stderr, "Unknown value '%s' found in %s for %s\n", prev, MENUSELECT_DEPS, name);
break;
}
}
}
AST_LIST_INSERT_TAIL(&deps_file, dep_file, list);
}
fclose(f);
return res;
}
static void free_deps_file(void)
{
struct dep_file *dep_file;
/* Free the dependency list we built from the file */
while ((dep_file = AST_LIST_REMOVE_HEAD(&deps_file, list)))
free(dep_file);
}
static int match_member_relations(void)
{
struct category *cat, *cat2;
struct member *mem, *mem2;
struct reference *dep;
struct reference *cnf;
struct reference *use;
/* Traverse through each module's dependency list and determine whether each is another module */
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
AST_LIST_TRAVERSE(&cat->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, dep->name))
continue;
dep->member = mem2;
break;
}
if (dep->member)
continue;
AST_LIST_TRAVERSE(&categories, cat2, list) {
AST_LIST_TRAVERSE(&cat2->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, dep->name))
continue;
dep->member = mem2;
break;
}
if (dep->member)
break;
}
}
}
}
/* Traverse through each module's use list and determine whether each is another module */
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE(&mem->uses, use, list) {
AST_LIST_TRAVERSE(&cat->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, use->name))
continue;
use->member = mem2;
break;
}
if (use->member)
continue;
AST_LIST_TRAVERSE(&categories, cat2, list) {
AST_LIST_TRAVERSE(&cat2->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, use->name))
continue;
use->member = mem2;
break;
}
if (use->member)
break;
}
}
}
}
/* If weak linking is not supported, move module uses which are other modules to the dependency list */
#if !defined(HAVE_ATTRIBUTE_weak_import) && !defined(HAVE_ATTRIBUTE_weakref) && !defined(HAVE_ATTRIBUTE_weak)
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE_SAFE_BEGIN(&mem->uses, use, list) {
if (use->member) {
AST_LIST_REMOVE_CURRENT(&mem->uses, list);
AST_LIST_INSERT_TAIL(&mem->deps, use, list);
}
}
AST_LIST_TRAVERSE_SAFE_END;
}
}
#endif
/* Traverse through each category marked as exclusive and mark every member as conflicting with every other member */
AST_LIST_TRAVERSE(&categories, cat, list) {
if (!cat->exclusive)
continue;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE(&cat->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (mem2 == mem)
continue;
if (!(cnf = calloc(1, sizeof(*cnf))))
return -1;
cnf->name = mem2->name;
cnf->member = mem2;
AST_LIST_INSERT_TAIL(&mem->conflicts, cnf, list);
}
}
}
/* Traverse through each category and determine whether named conflicts for each module are other modules */
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE(&mem->conflicts, cnf, list) {
AST_LIST_TRAVERSE(&cat->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, cnf->name))
continue;
cnf->member = mem2;
break;
}
if (cnf->member)
continue;
AST_LIST_TRAVERSE(&categories, cat2, list) {
AST_LIST_TRAVERSE(&cat2->members, mem2, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem2->name, cnf->name))
continue;
cnf->member = mem2;
break;
}
if (cnf->member)
break;
}
}
}
}
return 0;
}
/*! \brief Iterate through all of the input tree files and call the parse function on them */
static int build_member_list(void)
{
int i;
int res = -1;
for (i = 0; i < (sizeof(tree_files) / sizeof(tree_files[0])); i++) {
if ((res = parse_tree(tree_files[i]))) {
fprintf(stderr, "Error parsing '%s'!\n", tree_files[i]);
break;
}
}
if (!res)
res = match_member_relations();
return res;
}
/*! \brief Given the string representation of a member and category, mark it as present in a given input file */
static void mark_as_present(const char *member, const char *category)
{
struct category *cat;
struct member *mem;
char negate = 0;
if (*member == '-') {
member++;
negate = 1;
}
print_debug("Marking %s of %s as present\n", member, category);
AST_LIST_TRAVERSE(&categories, cat, list) {
if (strcmp(category, cat->name))
continue;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (!strcmp(member, mem->name)) {
mem->was_enabled = mem->enabled = (negate ? !cat->positive_output : cat->positive_output);
print_debug("Just set %s enabled to %d\n", mem->name, mem->enabled);
break;
}
}
if (!mem)
fprintf(stderr, "member '%s' in category '%s' not found, ignoring.\n", member, category);
break;
}
if (!cat)
fprintf(stderr, "category '%s' not found! Can't mark '%s' as disabled.\n", category, member);
}
unsigned int enable_member(struct member *mem)
{
struct reference *dep;
unsigned int can_enable = 1;
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
if (!dep->member)
continue;
if (!dep->member->enabled) {
if (dep->member->conflictsfailed != NO_FAILURE) {
can_enable = 0;
break;
}
if (dep->member->depsfailed == HARD_FAILURE) {
can_enable = 0;
break;
}
if (dep->member->explicitly_enabled_only) {
can_enable = 0;
break;
}
if (!(can_enable = enable_member(dep->member)))
break;
}
}
if ((mem->enabled = can_enable)) {
print_debug("Just set %s enabled to %d\n", mem->name, mem->enabled);
while (calc_dep_failures(1, 0) || calc_conflict_failures(1, 0));
}
return can_enable;
}
void toggle_enabled(struct member *mem)
{
if ((mem->depsfailed == HARD_FAILURE) || (mem->conflictsfailed == HARD_FAILURE) || (mem->is_separator))
return;
if (!mem->enabled)
enable_member(mem);
else
mem->enabled = 0;
print_debug("3- changed %s to %d\n", mem->name, mem->enabled);
mem->was_defaulted = 0;
changes_made++;
while (calc_dep_failures(1, 0) || calc_conflict_failures(1, 0));
}
/*! \brief Toggle a member of a category at the specified index to enabled/disabled */
void toggle_enabled_index(struct category *cat, int index)
{
struct member *mem;
int i = 0;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (i++ == index)
break;
}
if (!mem)
return;
toggle_enabled(mem);
}
static void set_member_enabled(struct member *mem)
{
if ((mem->depsfailed == HARD_FAILURE) || (mem->conflictsfailed == HARD_FAILURE))
return;
if ((mem->enabled) || (mem->is_separator))
return;
enable_member(mem);
mem->was_defaulted = 0;
changes_made++;
while (calc_dep_failures(1, 0) || calc_conflict_failures(1, 0));
}
void set_enabled(struct category *cat, int index)
{
struct member *mem;
int i = 0;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (i++ == index)
break;
}
if (!mem)
return;
set_member_enabled(mem);
}
static void clear_member_enabled(struct member *mem)
{
if (!mem->enabled)
return;
mem->enabled = 0;
mem->was_defaulted = 0;
changes_made++;
while (calc_dep_failures(1, 0) || calc_conflict_failures(1, 0));
}
void clear_enabled(struct category *cat, int index)
{
struct member *mem;
int i = 0;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (i++ == index)
break;
}
if (!mem)
return;
clear_member_enabled(mem);
}
/*! \brief Process a previously failed dependency
*
* If a module was previously disabled because of a failed dependency
* or a conflict, and not because the user selected it to be that way,
* then it needs to be re-enabled by default if the problem is no longer present.
*/
static void process_prev_failed_deps(char *buf)
{
const char *cat_name, *mem_name;
struct category *cat;
struct member *mem;
cat_name = strsep(&buf, "=");
mem_name = strsep(&buf, "\n");
if (!cat_name || !mem_name)
return;
AST_LIST_TRAVERSE(&categories, cat, list) {
if (strcasecmp(cat->name, cat_name))
continue;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (strcasecmp(mem->name, mem_name))
continue;
if (!mem->depsfailed && !mem->conflictsfailed) {
mem->enabled = 1;
print_debug("Just set %s enabled to %d in processing of previously failed deps\n", mem->name, mem->enabled);
mem->was_defaulted = 0;
}
break;
}
break;
}
if (!cat || !mem)
fprintf(stderr, "Unable to find '%s' in category '%s'\n", mem_name, cat_name);
}
/*! \brief Parse an existing output makeopts file and enable members previously selected */
static int parse_existing_config(const char *infile)
{
FILE *f;
#define PARSE_BUF_SIZE 8192
char *buf = NULL;
char *category, *parse, *member;
int lineno = 0;
if (!(f = fopen(infile, "r"))) {
/* This isn't really an error, so only print the message in debug mode */
print_debug("Unable to open '%s' for reading existing config.\n", infile);
return -1;
}
buf = malloc(PARSE_BUF_SIZE);
if (!buf) {
fprintf(stderr, "Unable to allocate buffer for reading existing config.\n");
exit(1);
}
while (fgets(buf, PARSE_BUF_SIZE, f)) {
lineno++;
if (strlen_zero(buf))
continue;
/* skip lines that are not for this tool */
if (strncasecmp(buf, "MENUSELECT_", strlen("MENUSELECT_")))
continue;
if (!strncasecmp(buf, "MENUSELECT_DEPENDS_", strlen("MENUSELECT_DEPENDS_")))
continue;
if (!strncasecmp(buf, "MENUSELECT_BUILD_DEPS", strlen("MENUSELECT_BUILD_DEPS")))
continue;
parse = buf;
parse = skip_blanks(parse);
if (strlen_zero(parse))
continue;
/* Grab the category name */
category = strsep(&parse, "=");
if (!parse) {
fprintf(stderr, "Invalid string in '%s' at line '%d'!\n", output_makeopts, lineno);
continue;
}
parse = skip_blanks(parse);
if (!strcasecmp(category, "MENUSELECT_DEPSFAILED")) {
process_prev_failed_deps(parse);
continue;
}
while ((member = strsep(&parse, " \n"))) {
member = skip_blanks(member);
if (strlen_zero(member))
continue;
mark_as_present(member, category);
}
}
free(buf);
fclose(f);
return 0;
}
/*! \brief Create the output dependencies file */
static int generate_makedeps_file(void)
{
FILE *f;
struct category *cat;
struct member *mem;
struct reference *dep;
struct reference *use;
struct dep_file *dep_file;
if (!(f = fopen(output_makedeps, "w"))) {
fprintf(stderr, "Unable to open dependencies file (%s) for writing!\n", output_makedeps);
return -1;
}
/* Traverse all categories and members and mark which used packages were found,
* skipping other members
*/
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
AST_LIST_TRAVERSE(&mem->uses, use, list) {
if (use->member) {
use->met = 0;
continue;
}
AST_LIST_TRAVERSE(&deps_file, dep_file, list) {
if ((use->met = !strcasecmp(use->name, dep_file->name))) {
break;
}
}
}
}
}
/* Traverse all categories and members and output dependencies for each member */
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
unsigned char header_printed = 0;
if (AST_LIST_EMPTY(&mem->deps) && AST_LIST_EMPTY(&mem->uses))
continue;
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
const char *c;
if (dep->member) {
continue;
}
if (!header_printed) {
fprintf(f, "MENUSELECT_DEPENDS_%s=", mem->name);
header_printed = 1;
}
for (c = dep->name; *c; c++)
fputc(toupper(*c), f);
fputc(' ', f);
}
AST_LIST_TRAVERSE(&mem->uses, use, list) {
const char *c;
if (!use->met) {
continue;
}
if (!header_printed) {
fprintf(f, "MENUSELECT_DEPENDS_%s=", mem->name);
header_printed = 1;
}
for (c = use->name; *c; c++)
fputc(toupper(*c), f);
fputc(' ', f);
}
if (header_printed) {
fprintf(f, "\n");
}
}
}
fclose(f);
return 0;
}
/*! \brief Create the output makeopts file that results from the user's selections */
static int generate_makeopts_file(void)
{
FILE *f;
struct category *cat;
struct member *mem;
struct reference *dep;
struct reference *use;
if (!(f = fopen(output_makeopts, "w"))) {
fprintf(stderr, "Unable to open build configuration file (%s) for writing!\n", output_makeopts);
return -1;
}
/* Traverse all categories and members and output them as var/val pairs */
AST_LIST_TRAVERSE(&categories, cat, list) {
fprintf(f, "%s=", cat->name);
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if ((!cat->positive_output && (!mem->enabled || mem->depsfailed || mem->conflictsfailed)) ||
(cat->positive_output && mem->enabled && !mem->depsfailed && !mem->conflictsfailed))
fprintf(f, "%s ", mem->name);
}
fprintf(f, "\n");
}
/* Traverse all categories and members, and for every member that is not disabled,
if it has internal dependencies (other members), list those members one time only
in a special variable */
fprintf(f, "MENUSELECT_BUILD_DEPS=");
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if ((!cat->positive_output && (!mem->enabled || mem->depsfailed || mem->conflictsfailed)) ||
(cat->positive_output && mem->enabled && !mem->depsfailed && !mem->conflictsfailed))
continue;
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
/* we only care about dependencies between members (internal, not external) */
if (!dep->member)
continue;
/* if this has already been output, continue */
if (dep->member->build_deps_output)
continue;
fprintf(f, "%s ", dep->member->name);
dep->member->build_deps_output = 1;
}
AST_LIST_TRAVERSE(&mem->uses, use, list) {
/* we only care about dependencies between members (internal, not external) */
if (!use->member)
continue;
/* if the dependency module is not going to be built, don't list it */
if (!use->member->enabled)
continue;
/* if this has already been output, continue */
if (use->member->build_deps_output)
continue;
fprintf(f, "%s ", use->member->name);
use->member->build_deps_output = 1;
}
}
}
fprintf(f, "\n");
/* Output which members were disabled because of failed dependencies or conflicts */
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (mem->depsfailed != HARD_FAILURE && mem->conflictsfailed != HARD_FAILURE)
continue;
if (!mem->defaultenabled || !strcasecmp(mem->defaultenabled, "yes"))
fprintf(f, "MENUSELECT_DEPSFAILED=%s=%s\n", cat->name, mem->name);
}
}
fclose(f);
/* there is no need to process remove_on_change rules if we did not have
configuration information to start from
*/
if (!existing_config)
return 0;
/* Traverse all categories and members and remove any files that are supposed
to be removed when an item has been changed */
AST_LIST_TRAVERSE(&categories, cat, list) {
unsigned int had_changes = 0;
char rmcommand[256] = "rm -rf ";
char touchcommand[256] = "touch -c ";
char *file, *buf;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if ((mem->enabled == mem->was_enabled) && !mem->was_defaulted)
continue;
had_changes = 1;
if (mem->touch_on_change) {
for (buf = ast_strdupa(mem->touch_on_change), file = strsep(&buf, " ");
file;
file = strsep(&buf, " ")) {
strcpy(&touchcommand[9], file);
system(touchcommand);
}
}
if (mem->remove_on_change) {
for (buf = ast_strdupa(mem->remove_on_change), file = strsep(&buf, " ");
file;
file = strsep(&buf, " ")) {
strcpy(&rmcommand[7], file);
system(rmcommand);
}
}
}
if (cat->touch_on_change && had_changes) {
for (buf = ast_strdupa(cat->touch_on_change), file = strsep(&buf, " ");
file;
file = strsep(&buf, " ")) {
strcpy(&touchcommand[9], file);
system(touchcommand);
}
}
if (cat->remove_on_change && had_changes) {
for (buf = ast_strdupa(cat->remove_on_change), file = strsep(&buf, " ");
file;
file = strsep(&buf, " ")) {
strcpy(&rmcommand[7], file);
system(rmcommand);
}
}
}
return 0;
}
/*! \brief Print out all of the information contained in our tree */
static void dump_member_list(void)
{
#ifdef MENUSELECT_DEBUG
struct category *cat;
struct member *mem;
struct reference *dep;
struct reference *cnf;
AST_LIST_TRAVERSE(&categories, cat, list) {
fprintf(stderr, "Category: '%s'\n", cat->name);
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
fprintf(stderr, " ==>> Member: '%s' (%s)", mem->name, mem->enabled ? "Enabled" : "Disabled");
fprintf(stderr, " Was %s\n", mem->was_enabled ? "Enabled" : "Disabled");
if (mem->defaultenabled)
fprintf(stderr, " Defaults to %s\n", !strcasecmp(mem->defaultenabled, "yes") ? "Enabled" : "Disabled");
AST_LIST_TRAVERSE(&mem->deps, dep, list)
fprintf(stderr, " --> Depends on: '%s'\n", dep->name);
if (!AST_LIST_EMPTY(&mem->deps))
fprintf(stderr, " --> Dependencies Met: %s\n", mem->depsfailed ? "No" : "Yes");
AST_LIST_TRAVERSE(&mem->conflicts, cnf, list)
fprintf(stderr, " --> Conflicts with: '%s'\n", cnf->name);
if (!AST_LIST_EMPTY(&mem->conflicts))
fprintf(stderr, " --> Conflicts Found: %s\n", mem->conflictsfailed ? "Yes" : "No");
}
}
#endif
}
/*! \brief Free all categories and their members */
static void free_member_list(void)
{
struct category *cat;
struct member *mem;
struct reference *dep;
struct reference *cnf;
struct reference *use;
while ((cat = AST_LIST_REMOVE_HEAD(&categories, list))) {
while ((mem = AST_LIST_REMOVE_HEAD(&cat->members, list))) {
while ((dep = AST_LIST_REMOVE_HEAD(&mem->deps, list)))
free(dep);
while ((cnf = AST_LIST_REMOVE_HEAD(&mem->conflicts, list)))
free(cnf);
while ((use = AST_LIST_REMOVE_HEAD(&mem->uses, list)))
free(use);
free(mem);
}
free(cat);
}
}
/*! \brief Free all of the XML trees */
static void free_trees(void)
{
struct tree *tree;
while ((tree = AST_LIST_REMOVE_HEAD(&trees, list))) {
mxmlDelete(tree->root);
free(tree);
}
}
/*! \brief Enable/Disable all members of a category as long as dependencies have been met and no conflicts are found */
void set_all(struct category *cat, int val)
{
struct member *mem;
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->enabled == val)
continue;
if (mem->is_separator)
continue;
if ((mem->depsfailed == HARD_FAILURE) || (mem->conflictsfailed == HARD_FAILURE))
continue;
if (val) {
enable_member(mem);
} else {
mem->enabled = 0;
}
mem->was_defaulted = 0;
changes_made++;
}
while (calc_dep_failures(1, 0) || calc_conflict_failures(1, 0));
}
int count_categories(void)
{
struct category *cat;
int count = 0;
AST_LIST_TRAVERSE(&categories, cat, list)
count++;
return count;
}
int count_members(struct category *cat)
{
struct member *mem;
int count = 0;
AST_LIST_TRAVERSE(&cat->members, mem, list)
count++;
return count;
}
static void print_sanity_dep_header(struct dep_file *dep_file, unsigned int *flag)
{
fprintf(stderr, "\n"
"***********************************************************\n"
" The '%s' dependency was previously satisfied but \n"
" is now unsatisfied. \n",
dep_file->name);
*flag = 1;
}
/*! \brief Make sure an existing menuselect.makeopts disabled everything it should have */
static int sanity_check(void)
{
unsigned int insane = 0;
struct category *cat;
struct member *mem;
struct reference *dep;
struct reference *use;
struct dep_file *dep_file;
unsigned int dep_header_printed;
unsigned int group_header_printed;
AST_LIST_TRAVERSE(&deps_file, dep_file, list) {
if (!((dep_file->previously_met == DEP_FILE_MET) &&
(dep_file->met == DEP_FILE_UNMET))) {
continue;
}
/* this dependency was previously met, but now is not, so
warn the user about members that could be affected by it
*/
dep_header_printed = 0;
group_header_printed = 0;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (!mem->enabled) {
continue;
}
AST_LIST_TRAVERSE(&mem->deps, dep, list) {
if (strcasecmp(dep->name, dep_file->name)) {
continue;
}
if (!group_header_printed) {
if (!dep_header_printed) {
print_sanity_dep_header(dep_file, &dep_header_printed);
}
fprintf(stderr, "\n"
" The following modules will no longer be available:\n");
group_header_printed = 1;
}
fprintf(stderr, " %s\n", mem->name);
insane = 1;
}
}
}
group_header_printed = 0;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (!mem->enabled) {
continue;
}
AST_LIST_TRAVERSE(&mem->uses, use, list) {
if (strcasecmp(use->name, dep_file->name)) {
continue;
}
if (!group_header_printed) {
if (!dep_header_printed) {
print_sanity_dep_header(dep_file, &dep_header_printed);
}
fprintf(stderr, "\n"
" The functionality of the following modules will\n"
" be affected:\n");
group_header_printed = 1;
}
fprintf(stderr, " %s\n", mem->name);
insane = 1;
}
}
}
if (dep_header_printed) {
fprintf(stderr,
"***********************************************************\n");
}
}
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if ((mem->depsfailed || mem->conflictsfailed) && mem->enabled) {
fprintf(stderr, "\n"
"***********************************************************\n"
" The existing menuselect.makeopts file did not specify \n"
" that '%s' should not be included. However, either some \n"
" dependencies for this module were not found or a \n"
" conflict exists. \n"
" \n"
" Either run 'make menuselect' or remove the existing \n"
" menuselect.makeopts file to resolve this issue. \n"
"***********************************************************\n"
"\n", mem->name);
insane = 1;
}
}
}
return insane ? -1 : 0;
}
/* \brief Set the forced default values if they exist */
static void process_defaults(void)
{
struct category *cat;
struct member *mem;
print_debug("Processing default values since config was not present\n");
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (!mem->defaultenabled)
continue;
if (mem->depsfailed == HARD_FAILURE)
continue;
if (mem->conflictsfailed == HARD_FAILURE)
continue;
if (!strcasecmp(mem->defaultenabled, "yes")) {
mem->enabled = 1;
mem->was_defaulted = 1;
} else if (!strcasecmp(mem->defaultenabled, "no")) {
mem->enabled = 0;
mem->was_defaulted = 1;
} else
fprintf(stderr, "Invalid defaultenabled value for '%s' in category '%s'\n", mem->name, cat->name);
}
}
}
struct member *find_member(const char *name)
{
struct category *cat;
struct member *mem;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
if (!strcasecmp(name, mem->name)) {
return mem;
}
}
}
return NULL;
}
struct category *find_category(const char *name)
{
struct category *cat;
AST_LIST_TRAVERSE(&categories, cat, list) {
if (!strcasecmp(name, cat->name)) {
return cat;
}
}
return NULL;
}
static int usage(const char *argv0)
{
fprintf(stderr, "Usage: %s [--enable <option>] [--disable <option>]\n", argv0);
fprintf(stderr, " [--enable-category <category>] [--enable-all]\n");
fprintf(stderr, " [--disable-category <category>] [--disable-all] [...]\n");
fprintf(stderr, " [<config-file> [...]]\n");
fprintf(stderr, "Usage: %s { --check-deps | --list-options\n", argv0);
fprintf(stderr, " | --list-category <category> | --category-list | --help }\n");
fprintf(stderr, " [<config-file> [...]]\n");
return 0;
}
int main(int argc, char *argv[])
{
int res = 0;
const char *list_group = NULL;
unsigned int x;
static struct option long_options[] = {
/*
* The --check-deps option is used to ask this application to check to
* see if that an existing menuselect.makeopts file contains all of the
* modules that have dependencies that have not been met. If this
* is not the case, an informative message will be printed to the
* user and the build will fail.
*/
{ "check-deps", no_argument, &check_deps, 1 },
{ "enable", required_argument, 0, 'e' },
{ "enable-category", required_argument, 0, 'E' },
{ "enable-all", no_argument, 0, 'a' },
{ "disable", required_argument, 0, 'd' },
{ "disable-category", required_argument, 0, 'D' },
{ "disable-all", no_argument, 0, 'A' },
{ "list-options", no_argument, &list_options, 1 },
{ "list-category", required_argument, 0, 'L' },
{ "category-list", no_argument, &list_groups, 1 },
{ "help", no_argument, 0, 'h' },
{ 0, 0, 0, 0 },
};
int do_menu = 1, do_settings = 1;
int c, option_index = 0;
if (open_debug()) {
exit(1);
}
/* Parse the input XML files to build the list of available options */
if ((res = build_member_list()))
exit(res);
/* Load module dependencies */
if ((res = process_deps()))
exit(res);
while (calc_dep_failures(0, 1) || calc_conflict_failures(0, 1));
while ((c = getopt_long(argc, argv, "", long_options, &option_index)) != -1) {
switch (c) {
case 'L':
list_group = optarg;
do_settings = 0;
/* Fall-through */
case 'a':
case 'A':
case 'e':
case 'E':
case 'd':
case 'D':
do_menu = 0;
break;
case 'h':
return usage(argv[0]);
break;
default:
break;
}
}
if (check_deps || list_options || list_groups) {
do_menu = 0;
do_settings = 0;
}
if (optind < argc) {
for (x = optind; x < argc; x++) {
res = parse_existing_config(argv[x]);
if (!res && !strcasecmp(argv[x], OUTPUT_MAKEOPTS_DEFAULT))
existing_config = 1;
res = 0;
}
}
/* Dump the list produced by parsing the various input files */
dump_member_list();
while (calc_dep_failures(0, 0) || calc_conflict_failures(0, 0));
if (!existing_config)
process_defaults();
else if (check_deps)
res = sanity_check();
while (calc_dep_failures(0, 0) || calc_conflict_failures(0, 0));
print_debug("do_menu=%d, do_settings=%d\n", do_menu, do_settings);
if (do_menu && !res) {
res = run_menu();
} else if (!do_settings) {
if (list_groups) {
struct category *cat;
AST_LIST_TRAVERSE(&categories, cat, list) {
fprintf(stdout, "%s\n", cat->name);
}
} else if (list_options) {
struct category *cat;
struct member *mem;
AST_LIST_TRAVERSE(&categories, cat, list) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
fprintf(stdout, "%c %-30.30s %s\n", mem->enabled ? '+' : '-', mem->name, cat->name);
}
}
} else if (!strlen_zero(list_group)) {
struct category *cat;
struct member *mem;
if ((cat = find_category(list_group))) {
AST_LIST_TRAVERSE(&cat->members, mem, list) {
if (mem->is_separator) {
continue;
}
fprintf(stdout, "%c %s\n", mem->enabled ? '+' : '-', mem->name);
}
}
}
} else if (!do_menu && do_settings) {
struct member *mem;
struct category *cat;
print_debug("Doing settings with argc=%d\n", argc);
/* Reset options processing */
option_index = 0;
optind = 1;
while ((c = getopt_long(argc, argv, "", long_options, &option_index)) != -1) {
print_debug("Got option %c\n", c);
switch (c) {
case 'e':
if (!strlen_zero(optarg)) {
if ((mem = find_member(optarg))) {
set_member_enabled(mem);
} else {
fprintf(stderr, "'%s' not found\n", optarg);
}
}
break;
case 'E':
if (!strlen_zero(optarg)) {
if ((cat = find_category(optarg))) {
set_all(cat, 1);
} else {
fprintf(stderr, "'%s' not found\n", optarg);
}
}
break;
case 'a': /* enable-all */
AST_LIST_TRAVERSE(&categories, cat, list) {
set_all(cat, 1);
}
break;
case 'd':
if (!strlen_zero(optarg)) {
if ((mem = find_member(optarg))) {
clear_member_enabled(mem);
} else {
fprintf(stderr, "'%s' not found\n", optarg);
}
}
break;
case 'D':
if (!strlen_zero(optarg)) {
if ((cat = find_category(optarg))) {
set_all(cat, 0);
} else {
fprintf(stderr, "'%s' not found\n", optarg);
}
}
break;
case 'A': /* disable-all */
AST_LIST_TRAVERSE(&categories, cat, list) {
set_all(cat, 0);
}
break;
case '?':
break;
default:
break;
}
}
res = 0;
}
if (!res) {
res = generate_makeopts_file();
}
/* Always generate the dependencies file */
if (!res) {
generate_makedeps_file();
}
/* free everything we allocated */
free_deps_file();
free_trees();
free_member_list();
close_debug();
exit(res);
}
|