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 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451
|
/* parser.c -- convert the command line args into an expression tree.
Copyright (C) 1990-1994, 2000-2001, 2003-2011, 2016 Free Software
Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/* config.h must always come first. */
#include <config.h>
/* system headers. */
#include <assert.h>
#include <ctype.h>
#include <errno.h>
#include <fcntl.h>
#include <grp.h>
#include <math.h>
#include <pwd.h>
#include <regex.h>
#include <sys/stat.h>
#include <unistd.h>
/* gnulib headers. */
#include "error.h"
#include "fnmatch.h"
#include "fts_.h"
#include "gettext.h"
#include "modechange.h"
#include "mountlist.h"
#include "parse-datetime.h"
#include "print.h"
#include "progname.h"
#include "quotearg.h"
#include "regextype.h"
#include "safe-atoi.h"
#include "selinux-at.h"
#include "splitstring.h"
#include "stat-time.h"
#include "xalloc.h"
#include "xstrtod.h"
#include "xstrtol.h"
/* At the moment, we include this after gnulib headers, since it uses
some of the same names for function attribute macros as gnulib does,
since I plan to make gcc-sttrigbutes a gnulib module. However, for
now, I haven't made the wholesale edits to gnulib that this would
require. Including this file last simply minimises the number of
compiler warnings about macro redefinition (in gnulib headers).
*/
#include "gcc-function-attributes.h"
/* find headers. */
#include "buildcmd.h"
#include "defs.h"
#include "fdleak.h"
#include "findutils-version.h"
#if ENABLE_NLS
# include <libintl.h>
# define _(Text) gettext (Text)
#else
# define _(Text) Text
#endif
#ifndef HAVE_ENDGRENT
#define endgrent ()
#endif
#ifndef HAVE_ENDPWENT
#define endpwent ()
#endif
static bool parse_accesscheck (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_amin (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_and (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_anewer (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_cmin (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_cnewer (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_comma (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_daystart (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_delete (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_d (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_depth (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_empty (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_exec (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_execdir (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_false (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_fls (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_fprintf (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_follow (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_fprint (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_fprint0 (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_fstype (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_gid (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_group (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_ilname (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_iname (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_inum (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_ipath (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_iregex (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_iwholename (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_links (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_lname (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_ls (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_maxdepth (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_mindepth (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_mmin (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_name (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_negate (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_newer (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_newerXY (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_noleaf (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_nogroup (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_nouser (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_nowarn (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_ok (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_okdir (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_or (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_path (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_perm (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_print0 (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_printf (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_prune (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_regex (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_regextype (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_samefile (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_size (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_time (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_true (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_type (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_uid (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_used (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_user (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_wholename (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_xdev (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_ignore_race (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_noignore_race (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_warn (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_xtype (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_quit (const struct parser_table*, char *argv[], int *arg_ptr);
static bool parse_context (const struct parser_table*, char *argv[], int *arg_ptr);
#if 0
static bool parse_show_control_chars (const struct parser_table*, char *argv[], int *arg_ptr);
#endif
static bool parse_help (const struct parser_table* entry, char **argv, int *arg_ptr)
_GL_ATTRIBUTE_NORETURN;
static bool parse_version (const struct parser_table*, char *argv[], int *arg_ptr)
_GL_ATTRIBUTE_NORETURN;
static bool insert_type (char **argv, int *arg_ptr,
const struct parser_table *entry,
PRED_FUNC which_pred);
static bool insert_regex (char *argv[], int *arg_ptr,
const struct parser_table *entry,
int regex_options);
static bool insert_exec_ok (const char *action,
const struct parser_table *entry,
char *argv[],
int *arg_ptr);
static bool get_comp_type (const char **str,
enum comparison_type *comp_type);
static bool get_relative_timestamp (const char *str,
struct time_val *tval,
struct timespec origin,
double sec_per_unit,
const char *overflowmessage);
static bool get_num (const char *str,
uintmax_t *num,
enum comparison_type *comp_type);
static struct predicate* insert_num (char *argv[], int *arg_ptr,
const struct parser_table *entry);
static void open_output_file (const char *path, struct format_val *p);
static void open_stdout (struct format_val *p);
static bool stream_is_tty(FILE *fp);
static bool parse_noop (const struct parser_table* entry,
char **argv, int *arg_ptr);
#define PASTE(x,y) x##y
#define PARSE_OPTION(what,suffix) \
{ (ARG_OPTION), (what), PASTE(parse_,suffix), NULL }
#define PARSE_POSOPT(what,suffix) \
{ (ARG_POSITIONAL_OPTION), (what), PASTE(parse_,suffix), NULL }
#define PARSE_TEST(what,suffix) \
{ (ARG_TEST), (what), PASTE(parse_,suffix), PASTE(pred_,suffix) }
#define PARSE_TEST_NP(what,suffix) \
{ (ARG_TEST), (what), PASTE(parse_,suffix), NULL }
#define PARSE_ACTION(what,suffix) \
{ (ARG_ACTION), (what), PASTE(parse_,suffix), PASTE(pred_,suffix) }
#define PARSE_PUNCTUATION(what,suffix) \
{ (ARG_PUNCTUATION), (what), PASTE(parse_,suffix), PASTE(pred_,suffix) }
/* Predicates we cannot handle in the usual way. If you add an entry
* to this table, double-check the switch statement in
* pred_sanity_check() to make sure that the new case is being
* correctly handled.
*/
static struct parser_table const parse_entry_newerXY =
{
ARG_SPECIAL_PARSE, "newerXY", parse_newerXY, pred_newerXY /* BSD */
};
/* GNU find predicates that are not mentioned in POSIX.2 are marked `GNU'.
If they are in some Unix versions of find, they are marked `Unix'. */
static struct parser_table const parse_table[] =
{
PARSE_PUNCTUATION("!", negate), /* POSIX */
PARSE_PUNCTUATION("not", negate), /* GNU */
PARSE_PUNCTUATION("(", openparen), /* POSIX */
PARSE_PUNCTUATION(")", closeparen), /* POSIX */
PARSE_PUNCTUATION(",", comma), /* GNU */
PARSE_PUNCTUATION("a", and), /* POSIX */
PARSE_TEST ("amin", amin), /* GNU */
PARSE_PUNCTUATION("and", and), /* GNU */
PARSE_TEST ("anewer", anewer), /* GNU */
{ARG_TEST, "atime", parse_time, pred_atime}, /* POSIX */
PARSE_TEST ("cmin", cmin), /* GNU */
PARSE_TEST ("cnewer", cnewer), /* GNU */
{ARG_TEST, "ctime", parse_time, pred_ctime}, /* POSIX */
PARSE_TEST ("context", context), /* GNU */
PARSE_POSOPT ("daystart", daystart), /* GNU */
PARSE_ACTION ("delete", delete), /* GNU, Mac OS, FreeBSD */
PARSE_OPTION ("d", d), /* Mac OS X, FreeBSD, NetBSD, OpenBSD, but deprecated in favour of -depth */
PARSE_OPTION ("depth", depth), /* POSIX */
PARSE_TEST ("empty", empty), /* GNU */
{ARG_ACTION, "exec", parse_exec, pred_exec}, /* POSIX */
{ARG_TEST, "executable", parse_accesscheck, pred_executable}, /* GNU, 4.3.0+ */
PARSE_ACTION ("execdir", execdir), /* *BSD, GNU */
PARSE_ACTION ("fls", fls), /* GNU */
PARSE_POSOPT ("follow", follow), /* GNU, Unix */
PARSE_ACTION ("fprint", fprint), /* GNU */
PARSE_ACTION ("fprint0", fprint0), /* GNU */
{ARG_ACTION, "fprintf", parse_fprintf, pred_fprintf}, /* GNU */
PARSE_TEST ("fstype", fstype), /* GNU, Unix */
PARSE_TEST ("gid", gid), /* GNU */
PARSE_TEST ("group", group), /* POSIX */
PARSE_OPTION ("ignore_readdir_race", ignore_race), /* GNU */
PARSE_TEST ("ilname", ilname), /* GNU */
PARSE_TEST ("iname", iname), /* GNU */
PARSE_TEST ("inum", inum), /* GNU, Unix */
PARSE_TEST ("ipath", ipath), /* GNU, deprecated in favour of iwholename */
PARSE_TEST_NP ("iregex", iregex), /* GNU */
PARSE_TEST_NP ("iwholename", iwholename), /* GNU */
PARSE_TEST ("links", links), /* POSIX */
PARSE_TEST ("lname", lname), /* GNU */
PARSE_ACTION ("ls", ls), /* GNU, Unix */
PARSE_OPTION ("maxdepth", maxdepth), /* GNU */
PARSE_OPTION ("mindepth", mindepth), /* GNU */
PARSE_TEST ("mmin", mmin), /* GNU */
PARSE_OPTION ("mount", xdev), /* Unix */
{ARG_TEST, "mtime", parse_time, pred_mtime}, /* POSIX */
PARSE_TEST ("name", name),
#ifdef UNIMPLEMENTED_UNIX
PARSE(ARG_UNIMPLEMENTED, "ncpio", ncpio), /* Unix */
#endif
PARSE_TEST ("newer", newer), /* POSIX */
{ARG_TEST, "atime", parse_time, pred_atime}, /* POSIX */
PARSE_OPTION ("noleaf", noleaf), /* GNU */
PARSE_TEST ("nogroup", nogroup), /* POSIX */
PARSE_TEST ("nouser", nouser), /* POSIX */
PARSE_OPTION ("noignore_readdir_race", noignore_race), /* GNU */
PARSE_POSOPT ("nowarn", nowarn), /* GNU */
PARSE_POSOPT ("warn", warn), /* GNU */
PARSE_PUNCTUATION("o", or), /* POSIX */
PARSE_PUNCTUATION("or", or), /* GNU */
PARSE_ACTION ("ok", ok), /* POSIX */
PARSE_ACTION ("okdir", okdir), /* GNU (-execdir is BSD) */
PARSE_TEST ("path", path), /* POSIX */
PARSE_TEST ("perm", perm), /* POSIX */
PARSE_ACTION ("print", print), /* POSIX */
PARSE_ACTION ("print0", print0), /* GNU */
{ARG_ACTION, "printf", parse_printf, NULL}, /* GNU */
PARSE_ACTION ("prune", prune), /* POSIX */
PARSE_ACTION ("quit", quit), /* GNU */
{ARG_TEST, "readable", parse_accesscheck, pred_readable}, /* GNU, 4.3.0+ */
PARSE_TEST ("regex", regex), /* GNU */
PARSE_POSOPT ("regextype", regextype), /* GNU */
PARSE_TEST ("samefile", samefile), /* GNU */
#if 0
PARSE_OPTION ("show-control-chars", show_control_chars), /* GNU, 4.3.0+ */
#endif
PARSE_TEST ("size", size), /* POSIX */
PARSE_TEST ("type", type), /* POSIX */
PARSE_TEST ("uid", uid), /* GNU */
PARSE_TEST ("used", used), /* GNU */
PARSE_TEST ("user", user), /* POSIX */
PARSE_TEST_NP ("wholename", wholename), /* GNU, replaced -path, but now -path is standardized since POSIX 2008 */
{ARG_TEST, "writable", parse_accesscheck, pred_writable}, /* GNU, 4.3.0+ */
PARSE_OPTION ("xdev", xdev), /* POSIX */
PARSE_TEST ("xtype", xtype), /* GNU */
#ifdef UNIMPLEMENTED_UNIX
/* It's pretty ugly for find to know about archive formats.
Plus what it could do with cpio archives is very limited.
Better to leave it out. */
PARSE(ARG_UNIMPLEMENTED, "cpio", cpio), /* Unix */
#endif
/* gnulib's stdbool.h might have made true and false into macros,
* so we can't leave named 'true' and 'false' tokens, so we have
* to expeant the relevant entries longhand.
*/
{ARG_TEST, "false", parse_false, pred_false}, /* GNU */
{ARG_TEST, "true", parse_true, pred_true }, /* GNU */
/* Internal pseudo-option, therefore 3 minus: ---noop. */
{ARG_NOOP, "--noop", NULL, pred_true }, /* GNU, internal use only */
/* Various other cases that don't fit neatly into our macro scheme. */
{ARG_TEST, "help", parse_help, NULL}, /* GNU */
{ARG_TEST, "-help", parse_help, NULL}, /* GNU */
{ARG_TEST, "version", parse_version, NULL}, /* GNU */
{ARG_TEST, "-version", parse_version, NULL}, /* GNU */
{0, 0, 0, 0}
};
static const char *first_nonoption_arg = NULL;
static const struct parser_table *noop = NULL;
static int
fallback_getfilecon (int fd, const char *name, security_context_t *p,
int prev_rv)
{
/* Our original getfilecon () call failed. Perhaps we can't follow a
* symbolic link. If that might be the problem, lgetfilecon () the link.
* Otherwise, admit defeat. */
switch (errno)
{
case ENOENT:
case ENOTDIR:
if (options.debug_options & DebugStat)
{
fprintf (stderr, "fallback_getfilecon(): getfilecon(%s) failed; falling "
"back on lgetfilecon()\n", name);
}
return lgetfileconat (fd, name, p);
case EACCES:
case EIO:
case ELOOP:
case ENAMETOOLONG:
#ifdef EOVERFLOW
case EOVERFLOW: /* EOVERFLOW is not #defined on UNICOS. */
#endif
default:
return prev_rv;
}
}
/* optionh_getfilecon () implements the getfilecon operation when the
* -H option is in effect.
*
* If the item to be examined is a command-line argument, we follow
* symbolic links. If the getfilecon () call fails on the command-line
* item, we fall back on the properties of the symbolic link.
*
* If the item to be examined is not a command-line argument, we
* examine the link itself. */
static int
optionh_getfilecon (int fd, const char *name, security_context_t *p)
{
int rv;
if (0 == state.curdepth)
{
/* This file is from the command line; dereference the link (if it is
a link). */
rv = getfileconat (fd, name, p);
if (0 == rv)
return 0; /* success */
else
return fallback_getfilecon (fd, name, p, rv);
}
else
{
/* Not a file on the command line; do not dereference the link. */
return lgetfileconat (fd, name, p);
}
}
/* optionl_getfilecon () implements the getfilecon operation when the
* -L option is in effect. That option makes us examine the thing the
* symbolic link points to, not the symbolic link itself. */
static int
optionl_getfilecon (int fd, const char *name, security_context_t *p)
{
int rv = getfileconat (fd, name, p);
if (0 == rv)
return 0; /* normal case. */
else
return fallback_getfilecon (fd, name, p, rv);
}
/* optionp_getfilecon () implements the stat operation when the -P
* option is in effect (this is also the default). That option makes
* us examine the symbolic link itself, not the thing it points to. */
static int
optionp_getfilecon (int fd, const char *name, security_context_t *p)
{
return lgetfileconat (fd, name, p);
}
void
check_option_combinations (const struct predicate *p)
{
enum { seen_delete=1u, seen_prune=2u };
unsigned int predicates = 0u;
while (p)
{
if (p->pred_func == pred_delete)
predicates |= seen_delete;
else if (p->pred_func == pred_prune)
predicates |= seen_prune;
p = p->pred_next;
}
if ((predicates & seen_prune) && (predicates & seen_delete))
{
/* The user specified both -delete and -prune. One might test
* this by first doing
* find dirs .... -prune ..... -print
* to fnd out what's going to get deleted, and then switch to
* find dirs .... -prune ..... -delete
* once we are happy. Unfortunately, the -delete action also
* implicitly turns on -depth, which will affect the behaviour
* of -prune (in fact, it makes it a no-op). In this case we
* would like to prevent unfortunate accidents, so we require
* the user to have explicitly used -depth.
*
* We only get away with this because the -delete predicate is not
* in POSIX. If it was, we couldn't issue a fatal error here.
*/
if (!options.explicit_depth)
{
/* This fixes Savannah bug #20865. */
error (EXIT_FAILURE, 0,
_("The -delete action automatically turns on -depth, "
"but -prune does nothing when -depth is in effect. "
"If you want to carry on anyway, just explicitly use "
"the -depth option."));
}
}
}
static const struct parser_table*
get_noop (void)
{
int i;
if (NULL == noop)
{
for (i = 0; parse_table[i].parser_name != 0; i++)
{
if (ARG_NOOP ==parse_table[i].type)
{
noop = &(parse_table[i]);
break;
}
}
}
return noop;
}
static int
get_stat_Ytime (const struct stat *p,
char what,
struct timespec *ret)
{
switch (what)
{
case 'a':
*ret = get_stat_atime (p);
return 1;
case 'B':
*ret = get_stat_birthtime (p);
return (ret->tv_nsec >= 0);
case 'c':
*ret = get_stat_ctime (p);
return 1;
case 'm':
*ret = get_stat_mtime (p);
return 1;
default:
assert (0);
abort ();
}
}
void
set_follow_state (enum SymlinkOption opt)
{
if (options.debug_options & DebugStat)
{
/* For DebugStat, the choice is made at runtime within debug_stat()
* by checking the contents of the symlink_handling variable.
*/
options.xstat = debug_stat;
}
else
{
switch (opt)
{
case SYMLINK_ALWAYS_DEREF: /* -L */
options.xstat = optionl_stat;
options.x_getfilecon = optionl_getfilecon;
options.no_leaf_check = true;
break;
case SYMLINK_NEVER_DEREF: /* -P (default) */
options.xstat = optionp_stat;
options.x_getfilecon = optionp_getfilecon;
/* Can't turn no_leaf_check off because the user might have specified
* -noleaf anyway
*/
break;
case SYMLINK_DEREF_ARGSONLY: /* -H */
options.xstat = optionh_stat;
options.x_getfilecon = optionh_getfilecon;
options.no_leaf_check = true;
}
}
options.symlink_handling = opt;
}
void
parse_begin_user_args (char **args, int argno,
const struct predicate *last,
const struct predicate *predicates)
{
(void) args;
(void) argno;
(void) last;
(void) predicates;
first_nonoption_arg = NULL;
}
void
parse_end_user_args (char **args, int argno,
const struct predicate *last,
const struct predicate *predicates)
{
/* does nothing */
(void) args;
(void) argno;
(void) last;
(void) predicates;
}
static bool
should_issue_warnings (void)
{
if (options.posixly_correct)
return false;
else
return options.warnings;
}
/* Check that it is legal to fid the given primary in its
* position and return it.
*/
static const struct parser_table*
found_parser (const char *original_arg, const struct parser_table *entry)
{
/* If this is an option, but we have already had a
* non-option argument, the user may be under the
* impression that the behaviour of the option
* argument is conditional on some preceding
* tests. This might typically be the case with,
* for example, -maxdepth.
*
* The options -daystart and -follow are exempt
* from this treatment, since their positioning
* in the command line does have an effect on
* subsequent tests but not previous ones. That
* might be intentional on the part of the user.
*/
if (entry->type != ARG_POSITIONAL_OPTION)
{
if (entry->type == ARG_NOOP)
return NULL; /* internal use only, trap -noop here. */
/* Something other than -follow/-daystart.
* If this is an option, check if it followed
* a non-option and if so, issue a warning.
*/
if (entry->type == ARG_OPTION)
{
if ((first_nonoption_arg != NULL)
&& should_issue_warnings ())
{
/* option which follows a non-option */
error (0, 0,
_("warning: you have specified the %s "
"option after a non-option argument %s, "
"but options are not positional (%s affects "
"tests specified before it as well as those "
"specified after it). Please specify options "
"before other arguments.\n"),
original_arg,
first_nonoption_arg,
original_arg);
}
}
else
{
/* Not an option or a positional option,
* so remember we've seen it in order to
* use it in a possible future warning message.
*/
if (first_nonoption_arg == NULL)
{
first_nonoption_arg = original_arg;
}
}
}
return entry;
}
/* Return a pointer to the parser function to invoke for predicate
SEARCH_NAME.
Return NULL if SEARCH_NAME is not a valid predicate name. */
const struct parser_table*
find_parser (const char *search_name)
{
int i;
const char *original_arg = search_name;
/* Ugh. Special case -newerXY. */
if (0 == strncmp ("-newer", search_name, 6)
&& (8 == strlen (search_name)))
{
return found_parser (original_arg, &parse_entry_newerXY);
}
if (*search_name == '-')
search_name++;
for (i = 0; parse_table[i].parser_name != 0; i++)
{
if (strcmp (parse_table[i].parser_name, search_name) == 0)
{
return found_parser (original_arg, &parse_table[i]);
}
}
return NULL;
}
static float
estimate_file_age_success_rate (float num_days)
{
if (num_days < 0.1f)
{
/* Assume 1% of files have timestamps in the future */
return 0.01f;
}
else if (num_days < 1.0f)
{
/* Assume 30% of files have timestamps today */
return 0.3f;
}
else if (num_days > 100.0f)
{
/* Assume 30% of files are very old */
return 0.3f;
}
else
{
/* Assume 39% of files are between 1 and 100 days old. */
return 0.39f;
}
}
static float
estimate_timestamp_success_rate (time_t when)
{
/* This calculation ignores the nanoseconds field of the
* origin, but I don't think that makes much difference
* to our estimate.
*/
int num_days = (options.cur_day_start.tv_sec - when) / 86400;
return estimate_file_age_success_rate (num_days);
}
/* Collect an argument from the argument list, or
* return false.
*/
static bool
collect_arg_nonconst (char **argv, int *arg_ptr, char **collected_arg)
{
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
{
*collected_arg = NULL;
return false;
}
else
{
*collected_arg = argv[*arg_ptr];
(*arg_ptr)++;
return true;
}
}
static bool
collect_arg (char **argv, int *arg_ptr, const char **collected_arg)
{
char *arg;
const bool result = collect_arg_nonconst (argv, arg_ptr, &arg);
*collected_arg = arg;
return result;
}
static bool
collect_arg_stat_info (char **argv, int *arg_ptr, struct stat *p,
const char **argument)
{
const char *filename;
if (collect_arg (argv, arg_ptr, &filename))
{
*argument = filename;
if (0 == (options.xstat)(filename, p))
{
return true;
}
else
{
fatal_target_file_error (errno, filename);
}
}
else
{
*argument = NULL;
return false;
}
}
/* The parsers are responsible to continue scanning ARGV for
their arguments. Each parser knows what is and isn't
allowed for itself.
ARGV is the argument array.
*ARG_PTR is the index to start at in ARGV,
updated to point beyond the last element consumed.
The predicate structure is updated with the new information. */
static bool
parse_and (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = get_new_pred_noarg (entry);
our_pred->pred_func = pred_and;
our_pred->p_type = BI_OP;
our_pred->p_prec = AND_PREC;
our_pred->need_stat = our_pred->need_type = false;
return true;
}
static bool
parse_anewer (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct stat stat_newer;
const char *arg;
set_stat_placeholders (&stat_newer);
if (collect_arg_stat_info (argv, arg_ptr, &stat_newer, &arg))
{
struct predicate *our_pred = insert_primary (entry, arg);
our_pred->args.reftime.xval = XVAL_ATIME;
our_pred->args.reftime.ts = get_stat_mtime (&stat_newer);
our_pred->args.reftime.kind = COMP_GT;
our_pred->est_success_rate = estimate_timestamp_success_rate (stat_newer.st_mtime);
return true;
}
return false;
}
bool
parse_closeparen (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = get_new_pred_noarg (entry);
our_pred->pred_func = pred_closeparen;
our_pred->p_type = CLOSE_PAREN;
our_pred->p_prec = NO_PREC;
our_pred->need_stat = our_pred->need_type = false;
return true;
}
static bool
parse_cnewer (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct stat stat_newer;
const char *arg;
set_stat_placeholders (&stat_newer);
if (collect_arg_stat_info (argv, arg_ptr, &stat_newer, &arg))
{
struct predicate *our_pred = insert_primary (entry, arg);
our_pred->args.reftime.xval = XVAL_CTIME; /* like -newercm */
our_pred->args.reftime.ts = get_stat_mtime (&stat_newer);
our_pred->args.reftime.kind = COMP_GT;
our_pred->est_success_rate = estimate_timestamp_success_rate (stat_newer.st_mtime);
return true;
}
return false;
}
static bool
parse_comma (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = get_new_pred_noarg (entry);
our_pred->pred_func = pred_comma;
our_pred->p_type = BI_OP;
our_pred->p_prec = COMMA_PREC;
our_pred->need_stat = our_pred->need_type = false;
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_daystart (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct tm *local;
(void) entry;
(void) argv;
(void) arg_ptr;
if (options.full_days == false)
{
options.cur_day_start.tv_sec += DAYSECS;
options.cur_day_start.tv_nsec = 0;
local = localtime (&options.cur_day_start.tv_sec);
options.cur_day_start.tv_sec -= (local
? (local->tm_sec + local->tm_min * 60
+ local->tm_hour * 3600)
: options.cur_day_start.tv_sec % DAYSECS);
options.full_days = true;
}
return true;
}
static bool
parse_delete (const struct parser_table* entry, char *argv[], int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
our_pred->side_effects = our_pred->no_default_print = true;
/* -delete implies -depth */
options.do_dir_first = false;
/* We do not need stat information because we check for the case
* (errno==EISDIR) in pred_delete.
*/
our_pred->need_stat = our_pred->need_type = false;
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_depth (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) entry;
(void) argv;
options.do_dir_first = false;
options.explicit_depth = true;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_d (const struct parser_table* entry, char **argv, int *arg_ptr)
{
if (should_issue_warnings ())
{
error (0, 0,
_("warning: the -d option is deprecated; please use "
"-depth instead, because the latter is a "
"POSIX-compliant feature."));
}
return parse_depth (entry, argv, arg_ptr);
}
static bool
parse_empty (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
our_pred->est_success_rate = 0.01f; /* assume 1% of files are empty. */
return true;
}
static bool
parse_exec (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_exec_ok ("-exec", entry, argv, arg_ptr);
}
static bool
parse_execdir (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_exec_ok ("-execdir", entry, argv, arg_ptr);
}
static bool
insert_false(void)
{
struct predicate *our_pred;
const struct parser_table *entry_false;
entry_false = find_parser("false");
our_pred = insert_primary_noarg (entry_false);
our_pred->need_stat = our_pred->need_type = false;
our_pred->side_effects = our_pred->no_default_print = false;
our_pred->est_success_rate = 0.0f;
return true;
}
static bool
parse_false (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) entry;
(void) argv;
(void) arg_ptr;
return insert_false ();
}
static bool
insert_fls (const struct parser_table* entry, const char *filename)
{
struct predicate *our_pred = insert_primary_noarg (entry);
if (filename)
open_output_file (filename, &our_pred->args.printf_vec);
else
open_stdout (&our_pred->args.printf_vec);
our_pred->side_effects = our_pred->no_default_print = true;
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_fls (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *filename;
if (collect_arg (argv, arg_ptr, &filename))
{
if (insert_fls (entry, filename))
return true;
else
--*arg_ptr; /* don't consume the invalid arg. */
}
return false;
}
static bool
parse_follow (const struct parser_table* entry, char **argv, int *arg_ptr)
{
set_follow_state (SYMLINK_ALWAYS_DEREF);
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_fprint (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
const char *filename;
if (collect_arg (argv, arg_ptr, &filename))
{
our_pred = insert_primary (entry, filename);
open_output_file (filename, &our_pred->args.printf_vec);
our_pred->side_effects = our_pred->no_default_print = true;
our_pred->need_stat = our_pred->need_type = false;
our_pred->est_success_rate = 1.0f;
return true;
}
else
{
return false;
}
}
static bool
insert_fprint (const struct parser_table* entry, const char *filename)
{
struct predicate *our_pred = insert_primary (entry, filename);
if (filename)
open_output_file (filename, &our_pred->args.printf_vec);
else
open_stdout (&our_pred->args.printf_vec);
our_pred->side_effects = our_pred->no_default_print = true;
our_pred->need_stat = our_pred->need_type = false;
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_fprint0 (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *filename;
if (collect_arg (argv, arg_ptr, &filename))
{
if (insert_fprint (entry, filename))
return true;
else
--*arg_ptr; /* don't consume the bad arg. */
}
return false;
}
static float estimate_fstype_success_rate (const char *fsname)
{
struct stat dir_stat;
const char *the_root_dir = "/";
if (0 == stat (the_root_dir, &dir_stat)) /* it's an absolute path anyway */
{
const char *fstype = filesystem_type (&dir_stat, the_root_dir);
/* Assume most files are on the same file system type as the root fs. */
if (0 == strcmp (fsname, fstype))
return 0.7f;
else
return 0.3f;
}
return 1.0f;
}
static bool
is_used_fs_type(const char *name)
{
if (0 == strcmp("afs", name))
{
/* I guess AFS may not appear in /etc/mtab (or equivalent) but still be in use,
so assume we always need to check for AFS. */
return true;
}
else
{
const struct mount_entry *entries = read_file_system_list(false);
if (entries)
{
const struct mount_entry *entry;
for (entry = entries; entry; entry = entry->me_next)
{
if (0 == strcmp(name, entry->me_type))
return true;
}
}
else
{
return true;
}
}
return false;
}
static bool
parse_fstype (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *typename;
if (collect_arg (argv, arg_ptr, &typename))
{
if (options.optimisation_level < 2 || is_used_fs_type (typename))
{
struct predicate *our_pred = insert_primary (entry, typename);
our_pred->args.str = typename;
/* This is an expensive operation, so although there are
* circumstances where it is selective, we ignore this fact
* because we probably don't want to promote this test to the
* front anyway.
*/
our_pred->est_success_rate = estimate_fstype_success_rate (typename);
return true;
}
else
{
/* This filesystem type is not listed in the mount table.
* Hence this predicate will always return false (with this argument).
* Substitute a predicate with the same effect as -false.
*/
if (options.debug_options & DebugTreeOpt)
{
fprintf (stderr,
"-fstype %s can never succeed, substituting -false\n",
typename);
}
return insert_false ();
}
}
else
{
return false;
}
}
static bool
parse_gid (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *p = insert_num (argv, arg_ptr, entry);
if (p)
{
p->est_success_rate = (p->args.numinfo.l_val < 100) ? 0.99 : 0.2;
return true;
}
else
{
--*arg_ptr; /* don't consume the invalid argument. */
return false;
}
}
static bool
parse_group (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *groupname;
const int saved_argc = *arg_ptr;
if (collect_arg (argv, arg_ptr, &groupname))
{
gid_t gid;
struct predicate *our_pred;
struct group *cur_gr = getgrnam (groupname);
endgrent ();
if (cur_gr)
{
gid = cur_gr->gr_gid;
}
else
{
const int gid_len = strspn (groupname, "0123456789");
if (gid_len)
{
if (groupname[gid_len] == 0)
{
gid = safe_atoi (groupname, options.err_quoting_style);
}
else
{
/* XXX: no test in test suite for this */
error (EXIT_FAILURE, 0,
_("%s is not the name of an existing group and"
" it does not look like a numeric group ID "
"because it has the unexpected suffix %s"),
quotearg_n_style (0, options.err_quoting_style, groupname),
quotearg_n_style (1, options.err_quoting_style, groupname+gid_len));
*arg_ptr = saved_argc; /* don't consume the invalid argument. */
return false;
}
}
else
{
if (*groupname)
{
/* XXX: no test in test suite for this */
error (EXIT_FAILURE, 0,
_("%s is not the name of an existing group"),
quotearg_n_style (0, options.err_quoting_style, groupname));
}
else
{
error (EXIT_FAILURE, 0,
_("argument to -group is empty, but should be a group name"));
}
*arg_ptr = saved_argc; /* don't consume the invalid argument. */
return false;
}
}
our_pred = insert_primary (entry, groupname);
our_pred->args.gid = gid;
our_pred->est_success_rate = (our_pred->args.numinfo.l_val < 100) ? 0.99 : 0.2;
return true;
}
return false;
}
static bool
parse_help (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) entry;
(void) argv;
(void) arg_ptr;
usage (EXIT_SUCCESS);
}
static float
estimate_pattern_match_rate (const char *pattern, int is_regex)
{
if (strpbrk (pattern, "*?[") || (is_regex && strpbrk(pattern, ".")))
{
/* A wildcard; assume the pattern matches most files. */
return 0.8f;
}
else
{
return 0.1f;
}
}
static bool
parse_ilname (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *name;
if (collect_arg (argv, arg_ptr, &name))
{
struct predicate *our_pred = insert_primary (entry, name);
our_pred->args.str = name;
/* Use the generic glob pattern estimator to figure out how many
* links will match, but bear in mind that most files won't be links.
*/
our_pred->est_success_rate = 0.1f * estimate_pattern_match_rate (name, 0);
return true;
}
else
{
return false;
}
}
/* sanity check the fnmatch() function to make sure that case folding
* is supported (as opposed to just having the flag ignored).
*/
static bool
fnmatch_sanitycheck (void)
{
static bool checked = false;
if (!checked)
{
if (0 != fnmatch ("foo", "foo", 0)
|| 0 == fnmatch ("Foo", "foo", 0)
|| 0 != fnmatch ("Foo", "foo", FNM_CASEFOLD))
{
error (EXIT_FAILURE, 0,
_("sanity check of the fnmatch() library function failed."));
return false;
}
checked = true;
}
return checked;
}
static bool
check_name_arg (const char *pred, const char *arg)
{
if (should_issue_warnings () && strchr (arg, '/'))
{
error (0, 0,_("warning: Unix filenames usually don't contain slashes "
"(though pathnames do). That means that '%s %s' will "
"probably evaluate to false all the time on this system. "
"You might find the '-wholename' test more useful, or "
"perhaps '-samefile'. Alternatively, if you are using "
"GNU grep, you could "
"use 'find ... -print0 | grep -FzZ %s'."),
pred,
safely_quote_err_filename (0, arg),
safely_quote_err_filename (1, arg));
}
return true; /* allow it anyway */
}
static bool
parse_iname (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *name;
fnmatch_sanitycheck ();
if (collect_arg (argv, arg_ptr, &name))
{
if (check_name_arg ("-iname", name))
{
struct predicate *our_pred = insert_primary (entry, name);
our_pred->need_stat = our_pred->need_type = false;
our_pred->args.str = name;
our_pred->est_success_rate = estimate_pattern_match_rate (name, 0);
return true;
}
}
return false;
}
static bool
parse_inum (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *p = insert_num (argv, arg_ptr, entry);
if (p)
{
/* inode number is exact match only, so very low proportions of
* files match
*/
p->est_success_rate = 1e-6;
p->need_inum = true;
p->need_stat = false;
p->need_type = false;
return true;
}
else
{
--*arg_ptr; /* don't consume the invalid argument. */
return false;
}
}
static bool
parse_iregex (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_regex (argv, arg_ptr, entry, RE_ICASE|options.regex_options);
}
static bool
parse_links (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *p = insert_num (argv, arg_ptr, entry);
if (p)
{
if (p->args.numinfo.l_val == 1)
p->est_success_rate = 0.99;
else if (p->args.numinfo.l_val == 2)
p->est_success_rate = 0.01;
else
p->est_success_rate = 1e-3;
return true;
}
else
{
--*arg_ptr; /* don't consume the invalid argument. */
return false;
}
}
static bool
parse_lname (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *name;
fnmatch_sanitycheck ();
if (collect_arg (argv, arg_ptr, &name))
{
struct predicate *our_pred = insert_primary (entry, name);
our_pred->args.str = name;
our_pred->est_success_rate = 0.1f * estimate_pattern_match_rate (name, 0);
return true;
}
return false;
}
static bool
parse_ls (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) &argv;
(void) &arg_ptr;
return insert_fls (entry, NULL);
}
static bool
insert_depthspec (const struct parser_table* entry, char **argv, int *arg_ptr,
int *limitptr)
{
const char *depthstr;
int depth_len;
const char *predicate = argv[(*arg_ptr)-1];
if (collect_arg (argv, arg_ptr, &depthstr))
{
depth_len = strspn (depthstr, "0123456789");
if ((depth_len > 0) && (depthstr[depth_len] == 0))
{
(*limitptr) = safe_atoi (depthstr, options.err_quoting_style);
if (*limitptr >= 0)
{
return parse_noop (entry, argv, arg_ptr);
}
}
error (EXIT_FAILURE, 0,
_("Expected a positive decimal integer argument to %s, but got %s"),
predicate,
quotearg_n_style (0, options.err_quoting_style, depthstr));
/* NOTREACHED */
return false;
}
/* missing argument */
return false;
}
static bool
parse_maxdepth (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_depthspec (entry, argv, arg_ptr, &options.maxdepth);
}
static bool
parse_mindepth (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_depthspec (entry, argv, arg_ptr, &options.mindepth);
}
static bool
do_parse_xmin (const struct parser_table* entry,
char **argv,
int *arg_ptr,
enum xval xv)
{
const char *minutes;
const int saved_argc = *arg_ptr;
if (collect_arg (argv, arg_ptr, &minutes))
{
struct time_val tval;
struct timespec origin = options.cur_day_start;
tval.xval = xv;
origin.tv_sec += DAYSECS;
if (get_relative_timestamp (minutes, &tval, origin, 60,
"arithmetic overflow while converting %s "
"minutes to a number of seconds"))
{
struct predicate *our_pred = insert_primary (entry, minutes);
our_pred->args.reftime = tval;
our_pred->est_success_rate = estimate_timestamp_success_rate (tval.ts.tv_sec);
return true;
}
else
{
/* Don't consume the invalid argument. */
*arg_ptr = saved_argc;
}
}
return false;
}
static bool
parse_amin (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return do_parse_xmin (entry, argv, arg_ptr, XVAL_ATIME);
}
static bool
parse_cmin (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return do_parse_xmin (entry, argv, arg_ptr, XVAL_CTIME);
}
static bool
parse_mmin (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return do_parse_xmin (entry, argv, arg_ptr, XVAL_MTIME);
}
static bool
parse_name (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *name;
const int saved_argc = *arg_ptr;
if (collect_arg (argv, arg_ptr, &name))
{
fnmatch_sanitycheck ();
if (check_name_arg ("-name", name))
{
struct predicate *our_pred = insert_primary (entry, name);
our_pred->need_stat = our_pred->need_type = false;
our_pred->args.str = name;
our_pred->est_success_rate = estimate_pattern_match_rate (name, 0);
return true;
}
else
{
*arg_ptr = saved_argc; /* don't consume the invalid argument. */
}
}
return false;
}
static bool
parse_negate (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) &argv;
(void) &arg_ptr;
our_pred = get_new_pred_chk_op (entry, NULL);
our_pred->pred_func = pred_negate;
our_pred->p_type = UNI_OP;
our_pred->p_prec = NEGATE_PREC;
our_pred->need_stat = our_pred->need_type = false;
return true;
}
static bool
parse_newer (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
struct stat stat_newer;
const char *arg;
set_stat_placeholders (&stat_newer);
if (collect_arg_stat_info (argv, arg_ptr, &stat_newer, &arg))
{
our_pred = insert_primary (entry, arg);
our_pred->args.reftime.ts = get_stat_mtime (&stat_newer);
our_pred->args.reftime.xval = XVAL_MTIME;
our_pred->args.reftime.kind = COMP_GT;
our_pred->est_success_rate = estimate_timestamp_success_rate (stat_newer.st_mtime);
return true;
}
return false;
}
static bool
parse_newerXY (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) argv;
(void) arg_ptr;
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
{
return false;
}
else if (8u != strlen (argv[*arg_ptr]))
{
return false;
}
else
{
char x, y;
const char validchars[] = "aBcmt";
assert (0 == strncmp ("-newer", argv[*arg_ptr], 6));
x = argv[*arg_ptr][6];
y = argv[*arg_ptr][7];
#if !defined HAVE_STRUCT_STAT_ST_BIRTHTIME && !defined HAVE_STRUCT_STAT_ST_BIRTHTIMENSEC && !defined HAVE_STRUCT_STAT_ST_BIRTHTIMESPEC_TV_NSEC && !defined HAVE_STRUCT_STAT_ST_BIRTHTIM_TV_NSEC
if ('B' == x || 'B' == y)
{
error (0, 0,
_("This system does not provide a way to find the birth time of a file."));
return false;
}
#endif
/* -newertY (for any Y) is invalid. */
if (x == 't'
|| (NULL == strchr (validchars, x))
|| (NULL == strchr ( validchars, y)))
{
return false;
}
else
{
struct predicate *our_pred;
/* Because this item is ARG_SPECIAL_PARSE, we have to advance arg_ptr
* past the test name (for most other tests, this is already done)
*/
if (argv[1+*arg_ptr] == NULL)
{
error (EXIT_FAILURE, 0, _("The %s test needs an argument"),
quotearg_n_style (0, options.err_quoting_style, argv[*arg_ptr]));
}
else
{
(*arg_ptr)++;
}
our_pred = insert_primary (entry, argv[*arg_ptr]);
switch (x)
{
case 'a':
our_pred->args.reftime.xval = XVAL_ATIME;
break;
case 'B':
our_pred->args.reftime.xval = XVAL_BIRTHTIME;
break;
case 'c':
our_pred->args.reftime.xval = XVAL_CTIME;
break;
case 'm':
our_pred->args.reftime.xval = XVAL_MTIME;
break;
default:
assert (strchr (validchars, x));
assert (0);
}
if ('t' == y)
{
if (!parse_datetime (&our_pred->args.reftime.ts,
argv[*arg_ptr],
&options.start_time))
{
error (EXIT_FAILURE, 0,
_("I cannot figure out how to interpret %s as a date or time"),
quotearg_n_style (0, options.err_quoting_style, argv[*arg_ptr]));
}
}
else
{
struct stat stat_newer;
/* Stat the named file. */
set_stat_placeholders (&stat_newer);
if ((*options.xstat) (argv[*arg_ptr], &stat_newer))
fatal_target_file_error (errno, argv[*arg_ptr]);
if (!get_stat_Ytime (&stat_newer, y, &our_pred->args.reftime.ts))
{
/* We cannot extract a timestamp from the struct stat. */
error (EXIT_FAILURE, 0,
_("Cannot obtain birth time of file %s"),
safely_quote_err_filename (0, argv[*arg_ptr]));
}
}
our_pred->args.reftime.kind = COMP_GT;
our_pred->est_success_rate = estimate_timestamp_success_rate (our_pred->args.reftime.ts.tv_sec);
(*arg_ptr)++;
assert (our_pred->pred_func != NULL);
assert (our_pred->pred_func == pred_newerXY);
assert (our_pred->need_stat);
return true;
}
}
}
static bool
parse_noleaf (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.no_leaf_check = true;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_nogroup (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) &argv;
(void) &arg_ptr;
our_pred = insert_primary (entry, NULL);
our_pred->est_success_rate = 1e-4;
return true;
}
static bool
parse_nouser (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
our_pred->est_success_rate = 1e-3;
return true;
}
static bool
parse_nowarn (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.warnings = false;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_ok (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_exec_ok ("-ok", entry, argv, arg_ptr);
}
static bool
parse_okdir (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_exec_ok ("-okdir", entry, argv, arg_ptr);
}
bool
parse_openparen (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = get_new_pred_chk_op (entry, NULL);
our_pred->pred_func = pred_openparen;
our_pred->p_type = OPEN_PAREN;
our_pred->p_prec = NO_PREC;
our_pred->need_stat = our_pred->need_type = false;
return true;
}
static bool
parse_or (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = get_new_pred_noarg (entry);
our_pred->pred_func = pred_or;
our_pred->p_type = BI_OP;
our_pred->p_prec = OR_PREC;
our_pred->need_stat = our_pred->need_type = false;
return true;
}
static bool
is_feasible_path_argument (const char *arg, bool foldcase)
{
const char *last = strrchr (arg, '/');
if (last && !last[1])
{
/* The name ends with "/". */
if (matches_start_point (arg, foldcase))
{
/* "-path foo/" can succeed if one of the start points is "foo/". */
return true;
}
else
{
return false;
}
}
return true;
}
static bool
insert_path_check (const struct parser_table* entry, char **argv, int *arg_ptr,
const char *predicate_name, PREDICATEFUNCTION pred)
{
const char *name;
bool foldcase = false;
if (pred == pred_ipath)
foldcase = true;
fnmatch_sanitycheck ();
if (collect_arg (argv, arg_ptr, &name))
{
struct predicate *our_pred = insert_primary_withpred (entry, pred, name);
our_pred->need_stat = our_pred->need_type = false;
our_pred->args.str = name;
our_pred->est_success_rate = estimate_pattern_match_rate (name, 0);
if (!options.posixly_correct
&& !is_feasible_path_argument (name, foldcase))
{
error (0, 0, _("warning: -%s %s will not match anything "
"because it ends with /."),
predicate_name, name);
our_pred->est_success_rate = 1.0e-8;
}
return true;
}
return false;
}
/* For some time, -path was deprecated (at RMS's request) in favour of
* -iwholename. See the node "GNU Manuals" in standards.texi for the
* rationale for this (basically, GNU prefers the use of the phrase
* "file name" to "path name".
*
* We do not issue a warning that this usage is deprecated
* since it is standardized since POSIX 2008.
*/
static bool
parse_path (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_path_check (entry, argv, arg_ptr, "path", pred_path);
}
static bool
parse_wholename (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_path_check (entry, argv, arg_ptr, "wholename", pred_path);
}
/* -ipath was deprecated (at RMS's request) in favour of
* -iwholename. See the node "GNU Manuals" in standards.texi
* for the rationale for this (basically, GNU prefers the use
* of the phrase "file name" to "path name".
* However, -path is now standardised so I un-deprecated -ipath.
*/
static bool
parse_ipath (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_path_check (entry, argv, arg_ptr, "ipath", pred_ipath);
}
static bool
parse_iwholename (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_path_check (entry, argv, arg_ptr, "iwholename", pred_ipath);
}
static bool
parse_perm (const struct parser_table* entry, char **argv, int *arg_ptr)
{
mode_t perm_val[2];
float rate;
int mode_start = 0;
enum permissions_type kind = PERM_EXACT;
struct mode_change *change;
struct predicate *our_pred;
const char *perm_expr;
if (!collect_arg (argv, arg_ptr, &perm_expr))
return false;
switch (perm_expr[0])
{
case '-':
mode_start = 1;
kind = PERM_AT_LEAST;
rate = 0.2;
break;
case '/': /* GNU extension */
mode_start = 1;
kind = PERM_ANY;
rate = 0.3;
break;
default:
/* For example, '-perm 0644', which is valid and matches
* only files whose mode is exactly 0644.
*/
mode_start = 0;
kind = PERM_EXACT;
rate = 0.01;
break;
}
change = mode_compile (perm_expr + mode_start);
/* Reject invalid modes, or modes of the form +NUMERICMODE.
The latter were formerly accepted as a GNU extension, but that
extension was incompatible with how GNU 'chmod' treats these modes now,
and it would be confusing if 'find' continued to support it. */
if (NULL == change
|| (perm_expr[0] == '+' && '0' <= perm_expr[1] && perm_expr[1] < '8'))
error (EXIT_FAILURE, 0, _("invalid mode %s"),
quotearg_n_style (0, options.err_quoting_style, perm_expr));
perm_val[0] = mode_adjust (0, false, 0, change, NULL);
perm_val[1] = mode_adjust (0, true, 0, change, NULL);
free (change);
if (('/' == perm_expr[0]) && (0 == perm_val[0]) && (0 == perm_val[1]))
{
/* The meaning of -perm /000 will change in the future. It
* currently matches no files, but like -perm -000 it should
* match all files.
*
* Starting in 2005, we used to issue a warning message
* informing the user that the behaviour would change in the
* future. We have now changed the behaviour and issue a
* warning message that the behaviour recently changed.
*/
error (0, 0,
_("warning: you have specified a mode pattern %s (which is "
"equivalent to /000). The meaning of -perm /000 has now been "
"changed to be consistent with -perm -000; that is, while it "
"used to match no files, it now matches all files."),
perm_expr);
kind = PERM_AT_LEAST;
/* The "magic" number below is just the fraction of files on my
* own system that "-type l -xtype l" fails for (i.e. unbroken symlinks).
* Actual totals are 1472 and 1073833.
*/
rate = 0.9986; /* probably matches anything but a broken symlink */
}
our_pred = insert_primary (entry, perm_expr);
our_pred->est_success_rate = rate;
our_pred->args.perm.kind = kind;
memcpy (our_pred->args.perm.val, perm_val, sizeof perm_val);
return true;
}
bool
parse_print (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
/* -print has the side effect of printing. This prevents us
from doing undesired multiple printing when the user has
already specified -print. */
our_pred->side_effects = our_pred->no_default_print = true;
our_pred->need_stat = our_pred->need_type = false;
open_stdout (&our_pred->args.printf_vec);
return true;
}
static bool
parse_print0 (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) entry;
(void) argv;
(void) arg_ptr;
return insert_fprint (entry, NULL);
}
static bool
parse_printf (const struct parser_table* entry, char **argv, int *arg_ptr)
{
char *format;
const int saved_argc = *arg_ptr;
if (collect_arg_nonconst (argv, arg_ptr, &format))
{
struct format_val fmt;
open_stdout (&fmt);
if (insert_fprintf (&fmt, entry, format))
{
return true;
}
else
{
*arg_ptr = saved_argc; /* don't consume the invalid argument. */
return false;
}
}
return false;
}
static bool
parse_fprintf (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *filename;
char *format;
int saved_argc = *arg_ptr;
if (collect_arg (argv, arg_ptr, &filename))
{
if (collect_arg_nonconst (argv, arg_ptr, &format))
{
struct format_val fmt;
open_output_file (filename, &fmt);
saved_argc = *arg_ptr;
if (insert_fprintf (&fmt, entry, format))
return true;
}
}
*arg_ptr = saved_argc; /* don't consume the invalid argument. */
return false;
}
static bool
parse_prune (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
if (options.do_dir_first == false)
our_pred->need_stat = our_pred->need_type = false;
/* -prune has a side effect that it does not descend into
the current directory. */
our_pred->side_effects = true;
our_pred->no_default_print = false;
return true;
}
static bool
parse_quit (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred = insert_primary_noarg (entry);
(void) argv;
(void) arg_ptr;
our_pred->need_stat = our_pred->need_type = false;
our_pred->side_effects = true; /* Exiting is a side effect... */
our_pred->no_default_print = false; /* Don't inhibit the default print, though. */
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_regextype (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *type_name;
if (collect_arg (argv, arg_ptr, &type_name))
{
/* collect the regex type name */
options.regex_options = get_regex_type (type_name);
return parse_noop (entry, argv, arg_ptr);
}
return false;
}
static bool
parse_regex (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_regex (argv, arg_ptr, entry, options.regex_options);
}
static bool
insert_regex (char **argv,
int *arg_ptr,
const struct parser_table *entry,
int regex_options)
{
const char *rx;
if (collect_arg (argv, arg_ptr, &rx))
{
struct re_pattern_buffer *re;
const char *error_message;
struct predicate *our_pred = insert_primary_withpred (entry, pred_regex, rx);
our_pred->need_stat = our_pred->need_type = false;
re = xmalloc (sizeof (struct re_pattern_buffer));
our_pred->args.regex = re;
re->allocated = 100;
re->buffer = xmalloc (re->allocated);
re->fastmap = NULL;
re_set_syntax (regex_options);
re->syntax = regex_options;
re->translate = NULL;
error_message = re_compile_pattern (rx, strlen (rx), re);
if (error_message)
error (EXIT_FAILURE, 0,
_("failed to compile regular expression '%s': %s"),
rx, error_message);
our_pred->est_success_rate = estimate_pattern_match_rate (rx, 1);
return true;
}
return false;
}
static bool
parse_size (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
char *arg;
uintmax_t num;
char suffix;
enum comparison_type c_type;
int blksize = 512;
int len;
/* XXX: cannot (yet) convert to ue collect_arg() as this
* function modifies the args in-place.
*/
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
return false;
arg = argv[*arg_ptr];
len = strlen (arg);
if (len == 0)
error (EXIT_FAILURE, 0, _("invalid null argument to -size"));
suffix = arg[len - 1];
switch (suffix)
{
case 'b':
blksize = 512;
arg[len - 1] = '\0';
break;
case 'c':
blksize = 1;
arg[len - 1] = '\0';
break;
case 'k':
blksize = 1024;
arg[len - 1] = '\0';
break;
case 'M': /* Megabytes */
blksize = 1024*1024;
arg[len - 1] = '\0';
break;
case 'G': /* Gigabytes */
blksize = 1024*1024*1024;
arg[len - 1] = '\0';
break;
case 'w':
blksize = 2;
arg[len - 1] = '\0';
break;
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
suffix = 0;
break;
default:
error (EXIT_FAILURE, 0,
_("invalid -size type `%c'"), argv[*arg_ptr][len - 1]);
}
/* TODO: accept fractional megabytes etc. ? */
if (!get_num (arg, &num, &c_type))
{
char tail[2];
tail[0] = suffix;
tail[1] = 0;
error (EXIT_FAILURE, 0,
_("Invalid argument `%s%s' to -size"),
arg, tail);
return false;
}
our_pred = insert_primary (entry, arg);
our_pred->args.size.kind = c_type;
our_pred->args.size.blocksize = blksize;
our_pred->args.size.size = num;
our_pred->need_stat = true;
our_pred->need_type = false;
if (COMP_GT == c_type)
our_pred->est_success_rate = (num*blksize > 20480) ? 0.1 : 0.9;
else if (COMP_LT == c_type)
our_pred->est_success_rate = (num*blksize > 20480) ? 0.9 : 0.1;
else
our_pred->est_success_rate = 0.01;
(*arg_ptr)++;
return true;
}
static bool
parse_samefile (const struct parser_table* entry, char **argv, int *arg_ptr)
{
/* General idea: stat the file, remember device and inode numbers.
* If a candidate file matches those, it's the same file.
*/
struct predicate *our_pred;
struct stat st, fst;
int fd, openflags;
const char *filename;
set_stat_placeholders (&st);
if (!collect_arg_stat_info (argv, arg_ptr, &st, &filename))
return false;
set_stat_placeholders (&fst);
/* POSIX systems are free to re-use the inode number of a deleted
* file. To ensure that we are not fooled by inode reuse, we hold
* the file open if we can. This would prevent the system reusing
* the file.
*/
fd = -3; /* -3 means uninitialized */
openflags = O_RDONLY;
if (options.symlink_handling == SYMLINK_NEVER_DEREF)
{
if (options.open_nofollow_available)
{
assert (O_NOFOLLOW != 0);
openflags |= O_NOFOLLOW;
fd = -1; /* safe to open it. */
}
else
{
if (S_ISLNK(st.st_mode))
{
/* no way to ensure that a symlink will not be followed
* by open(2), so fall back on using lstat(). Accept
* the risk that the named file will be deleted and
* replaced with another having the same inode.
*
* Avoid opening the file.
*/
fd = -2; /* Do not open it */
}
else
{
fd = -1;
/* Race condition here: the file might become a symlink here. */
}
}
}
else
{
/* We want to dereference the symlink anyway */
fd = -1; /* safe to open it without O_NOFOLLOW */
}
assert (fd != -3); /* check we made a decision */
if (fd == -1)
{
/* Race condition here. The file might become a
* symbolic link in between our call to stat and
* the call to open_cloexec.
*/
fd = open_cloexec (filename, openflags);
if (fd >= 0)
{
/* We stat the file again here to prevent a race condition
* between the first stat and the call to open(2).
*/
if (0 != fstat (fd, &fst))
{
fatal_target_file_error (errno, filename);
}
else
{
/* Worry about the race condition. If the file became a
* symlink after our first stat and before our call to
* open, fst may contain the stat information for the
* destination of the link, not the link itself.
*/
if ((*options.xstat) (filename, &st))
fatal_target_file_error (errno, filename);
if ((options.symlink_handling == SYMLINK_NEVER_DEREF)
&& (!options.open_nofollow_available))
{
if (S_ISLNK(st.st_mode))
{
/* We lost the race. Leave the data in st. The
* file descriptor points to the wrong thing.
*/
close (fd);
fd = -1;
}
else
{
/* Several possibilities here:
* 1. There was no race
* 2. The file changed into a symlink after the stat and
* before the open, and then back into a non-symlink
* before the second stat.
*
* In case (1) there is no problem. In case (2),
* the stat() and fstat() calls will have returned
* different data. O_NOFOLLOW was not available,
* so the open() call may have followed a symlink
* even if the -P option is in effect.
*/
if ((st.st_dev == fst.st_dev)
&& (st.st_ino == fst.st_ino))
{
/* No race. No need to copy fst to st,
* since they should be identical (modulo
* differences in padding bytes).
*/
}
else
{
/* We lost the race. Leave the data in st. The
* file descriptor points to the wrong thing.
*/
close (fd);
fd = -1;
}
}
}
else
{
st = fst;
}
}
}
}
our_pred = insert_primary (entry, filename);
our_pred->args.samefileid.ino = st.st_ino;
our_pred->args.samefileid.dev = st.st_dev;
our_pred->args.samefileid.fd = fd;
our_pred->need_type = false;
/* smarter way: compare type and inode number first. */
/* TODO: maybe optimise this away by being optimistic */
our_pred->need_stat = true;
our_pred->est_success_rate = 0.01f;
return true;
}
#if 0
/* This function is commented out partly because support for it is
* uneven.
*/
static bool
parse_show_control_chars (const struct parser_table* entry,
char **argv,
int *arg_ptr)
{
const char *arg;
const char *errmsg = _("The -show-control-chars option takes "
"a single argument which "
"must be 'literal' or 'safe'");
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
{
error (EXIT_FAILURE, errno, "%s", errmsg);
return false;
}
else
{
arg = argv[*arg_ptr];
if (0 == strcmp ("literal", arg))
{
options.literal_control_chars = true;
}
else if (0 == strcmp ("safe", arg))
{
options.literal_control_chars = false;
}
else
{
error (EXIT_FAILURE, errno, "%s", errmsg);
return false;
}
(*arg_ptr)++; /* consume the argument. */
return true;
}
}
#endif
static bool
parse_true (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
our_pred->need_stat = our_pred->need_type = false;
our_pred->est_success_rate = 1.0f;
return true;
}
static bool
parse_noop (const struct parser_table* entry, char **argv, int *arg_ptr)
{
(void) entry;
return parse_true (get_noop (), argv, arg_ptr);
}
static bool
parse_accesscheck (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
(void) argv;
(void) arg_ptr;
our_pred = insert_primary_noarg (entry);
our_pred->need_stat = our_pred->need_type = false;
our_pred->side_effects = our_pred->no_default_print = false;
if (pred_is(our_pred, pred_executable))
our_pred->est_success_rate = 0.2;
else
our_pred->est_success_rate = 0.9;
return true;
}
static bool
parse_type (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_type (argv, arg_ptr, entry, pred_type);
}
static bool
parse_uid (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *p = insert_num (argv, arg_ptr, entry);
if (p)
{
p->est_success_rate = (p->args.numinfo.l_val < 100) ? 0.99 : 0.2;
return true;
}
else
{
--*arg_ptr; /* don't consume the invalid argument. */
return false;
}
}
static bool
parse_used (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
struct time_val tval;
const char *offset_str;
const char *errmsg = "arithmetic overflow while converting %s days to a number of seconds";
if (collect_arg (argv, arg_ptr, &offset_str))
{
/* The timespec is actually a delta value, so we use an origin of 0. */
struct timespec zero = {0,0};
if (get_relative_timestamp (offset_str, &tval, zero, DAYSECS, errmsg))
{
our_pred = insert_primary (entry, offset_str);
our_pred->args.reftime = tval;
our_pred->est_success_rate = estimate_file_age_success_rate (tval.ts.tv_sec / DAYSECS);
return true;
}
else
{
error (EXIT_FAILURE, 0,
_("Invalid argument %s to -used"), offset_str);
/*NOTREACHED*/
return false;
}
}
else
{
return false; /* missing argument */
}
}
static bool
parse_user (const struct parser_table* entry, char **argv, int *arg_ptr)
{
const char *username;
if (collect_arg (argv, arg_ptr, &username))
{
struct predicate *our_pred;
uid_t uid;
struct passwd *cur_pwd = getpwnam (username);
endpwent ();
if (cur_pwd != NULL)
{
uid = cur_pwd->pw_uid;
}
else
{
const size_t uid_len = strspn (username, "0123456789");
if (uid_len && (username[uid_len]==0))
{
uid = safe_atoi (username, options.err_quoting_style);
}
else
{
/* This is a fatal error (if we just return false, the caller
* will say "invalid argument `username' to -user", which is
* not as helpful). */
if (username[0])
{
error (EXIT_FAILURE, 0,
_("%s is not the name of a known user"),
quotearg_n_style (0, options.err_quoting_style,
username));
}
else
{
error (EXIT_FAILURE, 0,
_("The argument to -user should not be empty"));
}
/*NOTREACHED*/
return false;
}
}
our_pred = insert_primary (entry, username);
our_pred->args.uid = uid;
our_pred->est_success_rate = (our_pred->args.uid < 100) ? 0.99 : 0.2;
return true;
}
return false;
}
static bool
parse_version (const struct parser_table* entry, char **argv, int *arg_ptr)
{
bool has_features = false;
int flags;
(void) argv;
(void) arg_ptr;
(void) entry;
display_findutils_version ("find");
printf (_("Features enabled: "));
#if CACHE_IDS
printf ("CACHE_IDS(ignored) ");
has_features = true;
#endif
#if defined HAVE_STRUCT_DIRENT_D_TYPE
printf ("D_TYPE ");
has_features = true;
#endif
#if defined O_NOFOLLOW
printf ("O_NOFOLLOW(%s) ",
(options.open_nofollow_available ? "enabled" : "disabled"));
has_features = true;
#endif
#if defined LEAF_OPTIMISATION
printf ("LEAF_OPTIMISATION ");
has_features = true;
#endif
if (0 < is_selinux_enabled ())
{
printf ("SELINUX ");
has_features = true;
}
flags = 0;
if (is_fts_enabled (&flags))
{
int nflags = 0;
printf ("FTS(");
has_features = true;
if (flags & FTS_CWDFD)
{
if (nflags)
{
printf (",");
}
printf ("FTS_CWDFD");
has_features = true;
}
printf (") ");
}
printf ("CBO(level=%d) ", (int)(options.optimisation_level));
has_features = true;
if (!has_features)
{
/* For the moment, leave this as English in case someone wants
to parse these strings. */
printf ("none");
}
printf ("\n");
exit (EXIT_SUCCESS);
}
static bool
parse_context (const struct parser_table* entry, char **argv, int *arg_ptr)
{
struct predicate *our_pred;
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
return false;
if (is_selinux_enabled () <= 0)
{
error (EXIT_FAILURE, 0,
_("invalid predicate -context: SELinux is not enabled."));
return false;
}
our_pred = insert_primary (entry, NULL);
our_pred->est_success_rate = 0.01f;
our_pred->need_stat = false;
#ifdef DEBUG
our_pred->p_name = find_pred_name (pred_context);
#endif /*DEBUG*/
our_pred->args.scontext = argv[*arg_ptr];
(*arg_ptr)++;
return true;
}
static bool
parse_xdev (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.stay_on_filesystem = true;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_ignore_race (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.ignore_readdir_race = true;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_noignore_race (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.ignore_readdir_race = false;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_warn (const struct parser_table* entry, char **argv, int *arg_ptr)
{
options.warnings = true;
return parse_noop (entry, argv, arg_ptr);
}
static bool
parse_xtype (const struct parser_table* entry, char **argv, int *arg_ptr)
{
return insert_type (argv, arg_ptr, entry, pred_xtype);
}
static bool
insert_type (char **argv, int *arg_ptr,
const struct parser_table *entry,
PRED_FUNC which_pred)
{
struct predicate *our_pred;
const char *typeletter;
const char *pred_string = which_pred == pred_xtype ? "-xtype" : "-type";
if (! collect_arg (argv, arg_ptr, &typeletter))
return false;
if (!*typeletter)
{
error (EXIT_FAILURE, 0,
_("Arguments to %s should contain at least one letter"),
pred_string);
/*NOTREACHED*/
return false;
}
our_pred = insert_primary_withpred (entry, which_pred, typeletter);
our_pred->est_success_rate = 0.0;
/* Figure out if we will need to stat the file, because if we don't
* need to follow symlinks, we can avoid a stat call by using
* struct dirent.d_type.
*/
if (which_pred == pred_xtype)
{
our_pred->need_stat = true;
our_pred->need_type = false;
}
else
{
our_pred->need_stat = false; /* struct dirent is enough */
our_pred->need_type = true;
}
/* From a real system here are the counts of files by type:
Type Count Fraction
f 4410884 0.875
d 464722 0.0922
l 156662 0.0311
b 4476 0.000888
c 2233 0.000443
s 80 1.59e-05
p 38 7.54e-06
*/
for (; *typeletter; )
{
unsigned int type_cell;
float rate = 0.01;
switch (*typeletter)
{
case 'b': /* block special */
type_cell = FTYPE_BLK;
rate = 0.000888f;
break;
case 'c': /* character special */
type_cell = FTYPE_CHR;
rate = 0.000443f;
break;
case 'd': /* directory */
type_cell = FTYPE_DIR;
rate = 0.0922f;
break;
case 'f': /* regular file */
type_cell = FTYPE_REG;
rate = 0.875f;
break;
case 'l': /* symbolic link */
#ifdef S_IFLNK
type_cell = FTYPE_LNK;
rate = 0.0311f;
#else
type_cell = 0;
error (EXIT_FAILURE, 0,
_("%s %c is not supported because symbolic links "
"are not supported on the platform find was compiled on."),
pred_string, (*typeletter));
#endif
break;
case 'p': /* pipe */
#ifdef S_IFIFO
type_cell = FTYPE_FIFO;
rate = 7.554e-6f;
#else
type_cell = 0;
error (EXIT_FAILURE, 0,
_("%s %c is not supported because FIFOs "
"are not supported on the platform find was compiled on."),
pred_string, (*typeletter));
#endif
break;
case 's': /* socket */
#ifdef S_IFSOCK
type_cell = FTYPE_SOCK;
rate = 1.59e-5f;
#else
type_cell = 0;
error (EXIT_FAILURE, 0,
_("%s %c is not supported because named sockets "
"are not supported on the platform find was compiled on."),
pred_string, (*typeletter));
#endif
break;
case 'D': /* Solaris door */
#ifdef S_IFDOOR
type_cell = FTYPE_DOOR;
/* There are no Solaris doors on the example system surveyed
* above, but if someone uses -type D, they are presumably
* expecting to find a non-zero number. We guess at a
* rate. */
rate = 1.0e-5f;
#else
type_cell = 0;
error (EXIT_FAILURE, 0,
_("%s %c is not supported because Solaris doors "
"are not supported on the platform find was compiled on."),
pred_string, (*typeletter));
#endif
break;
default: /* None of the above ... nuke 'em. */
type_cell = 0;
error (EXIT_FAILURE, 0,
_("Unknown argument to %s: %c"), pred_string, (*typeletter));
/*NOTREACHED*/
return false;
}
if (our_pred->args.types[type_cell])
{
error (EXIT_FAILURE, 0,
_("Duplicate file type '%c' in the argument list to %s."),
(*typeletter), pred_string);
}
our_pred->est_success_rate += rate;
our_pred->args.types[type_cell] = true;
/* Advance.
* Currently, only 1-character file types separated by ',' are supported.
*/
typeletter++;
if (*typeletter)
{
if (*typeletter != ',')
{
error (EXIT_FAILURE, 0,
_("Must separate multiple arguments to %s using: ','"),
pred_string);
/*NOTREACHED*/
return false;
}
typeletter++;
if (!*typeletter)
{
error (EXIT_FAILURE, 0,
_("Last file type in list argument to %s "
"is missing, i.e., list is ending on: ','"),
pred_string);
/*NOTREACHED*/
return false;
}
}
}
return true;
}
/* Return true if the file accessed via FP is a terminal.
*/
static bool
stream_is_tty (FILE *fp)
{
int fd = fileno (fp);
if (-1 == fd)
{
return false; /* not a valid stream */
}
else
{
return isatty (fd) ? true : false;
}
}
static void
check_path_safety (const char *action)
{
const char *path = getenv ("PATH");
const char *path_separators = ":";
size_t pos, len;
if (NULL == path)
{
/* $PATH is not set. Assume the OS default is safe.
* That may not be true on Windows, but I'm not aware
* of a way to get Windows to avoid searching the
* current directory anyway.
*/
return;
}
splitstring (path, path_separators, true, &pos, &len);
do
{
if (0 == len || (1 == len && path[pos] == '.'))
{
/* empty field signifies . */
error (EXIT_FAILURE, 0,
_("The current directory is included in the PATH "
"environment variable, which is insecure in "
"combination with the %s action of find. "
"Please remove the current directory from your "
"$PATH (that is, remove \".\", doubled colons, "
"or leading or trailing colons)"),
action);
}
else if (path[pos] != '/')
{
char *relpath = strndup (&path[pos], len);
error (EXIT_FAILURE, 0,
_("The relative path %s is included in the PATH "
"environment variable, which is insecure in "
"combination with the %s action of find. "
"Please remove that entry from $PATH"),
safely_quote_err_filename (0, relpath ? relpath : &path[pos]),
action);
/*NOTREACHED*/
free (relpath);
}
} while (splitstring (path, path_separators, false, &pos, &len));
}
/* handles both exec and ok predicate */
static bool
insert_exec_ok (const char *action,
const struct parser_table *entry,
char **argv,
int *arg_ptr)
{
int start, end; /* Indexes in ARGV of start & end of cmd. */
int i; /* Index into cmd args */
int saw_braces; /* True if previous arg was '{}'. */
bool allow_plus; /* True if + is a valid terminator */
int brace_count; /* Number of instances of {}. */
const char *brace_arg; /* Which arg did {} appear in? */
PRED_FUNC func = entry->pred_func;
enum BC_INIT_STATUS bcstatus;
struct predicate *our_pred;
struct exec_val *execp; /* Pointer for efficiency. */
if ((argv == NULL) || (argv[*arg_ptr] == NULL))
return false;
our_pred = insert_primary_withpred (entry, func, "(some -exec* arguments)");
our_pred->side_effects = our_pred->no_default_print = true;
our_pred->need_type = our_pred->need_stat = false;
execp = &our_pred->args.exec_vec;
execp->wd_for_exec = NULL;
if ((func != pred_okdir) && (func != pred_ok))
{
allow_plus = true;
execp->close_stdin = false;
}
else
{
allow_plus = false;
/* If find reads stdin (i.e. for -ok and similar), close stdin
* in the child to prevent some script from consiming the output
* intended for find.
*/
execp->close_stdin = true;
}
if ((func == pred_execdir) || (func == pred_okdir))
{
execp->wd_for_exec = NULL;
options.ignore_readdir_race = false;
check_path_safety (action);
}
else
{
assert (NULL != initial_wd);
execp->wd_for_exec = initial_wd;
}
our_pred->args.exec_vec.multiple = 0;
/* Count the number of args with path replacements, up until the ';'.
* Also figure out if the command is terminated by ";" or by "+".
*/
start = *arg_ptr;
for (end = start, saw_braces=0, brace_count=0, brace_arg=NULL;
(argv[end] != NULL)
&& ((argv[end][0] != ';') || (argv[end][1] != '\0'));
end++)
{
/* For -exec and -execdir, "{} +" can terminate the command. */
if ( allow_plus
&& argv[end][0] == '+' && argv[end][1] == 0
&& saw_braces)
{
our_pred->args.exec_vec.multiple = 1;
break;
}
saw_braces = 0;
if (mbsstr (argv[end], "{}"))
{
saw_braces = 1;
brace_arg = argv[end];
++brace_count;
if (0 == end && (func == pred_execdir || func == pred_okdir))
{
/* The POSIX standard says that {} replacement should
* occur even in the utility name. This is insecure
* since it means we will be executing a command whose
* name is chosen according to whatever find finds in
* the file system. That can be influenced by an
* attacker. Hence for -execdir and -okdir this is not
* allowed. We can specify this as those options are
* not defined by POSIX.
*/
error (EXIT_FAILURE, 0,
_("You may not use {} within the utility name for "
"-execdir and -okdir, because this is a potential "
"security problem."));
}
}
}
/* Fail if no command given or no semicolon found. */
if ((end == start) || (argv[end] == NULL))
{
*arg_ptr = end;
free (our_pred);
return false;
}
if (our_pred->args.exec_vec.multiple)
{
const char *suffix;
if (func == pred_execdir)
suffix = "dir";
else
suffix = "";
if (brace_count > 1)
{
error (EXIT_FAILURE, 0,
_("Only one instance of {} is supported with -exec%s ... +"),
suffix);
}
else if (strlen (brace_arg) != 2u)
{
enum { MsgBufSize = 19 };
char buf[MsgBufSize];
const size_t needed = snprintf (buf, MsgBufSize, "-exec%s ... {} +", suffix);
assert (needed <= MsgBufSize); /* If this assertion fails, correct the value of MsgBufSize. */
error (EXIT_FAILURE, 0,
_("In %s the %s must appear by itself, but you specified %s"),
quotearg_n_style (0, options.err_quoting_style, buf),
quotearg_n_style (1, options.err_quoting_style, "{}"),
quotearg_n_style (2, options.err_quoting_style, brace_arg));
}
}
/* We use a switch statement here so that the compiler warns us when
* we forget to handle a newly invented enum value.
*
* Like xargs, we allow 2KiB of headroom for the launched utility to
* export its own environment variables before calling something
* else.
*/
bcstatus = bc_init_controlinfo (&execp->ctl, 2048u);
switch (bcstatus)
{
case BC_INIT_ENV_TOO_BIG:
case BC_INIT_CANNOT_ACCOMODATE_HEADROOM:
error (EXIT_FAILURE, 0,
_("The environment is too large for exec()."));
break;
case BC_INIT_OK:
/* Good news. Carry on. */
break;
}
bc_use_sensible_arg_max (&execp->ctl);
execp->ctl.exec_callback = launch;
if (our_pred->args.exec_vec.multiple)
{
/* "+" terminator, so we can just append our arguments after the
* command and initial arguments.
*/
execp->replace_vec = NULL;
execp->ctl.replace_pat = NULL;
execp->ctl.rplen = 0;
execp->ctl.lines_per_exec = 0; /* no limit */
execp->ctl.args_per_exec = 0; /* no limit */
/* remember how many arguments there are */
execp->ctl.initial_argc = (end-start) - 1;
/* execp->state = xmalloc(sizeof struct buildcmd_state); */
bc_init_state (&execp->ctl, &execp->state, execp);
/* Gather the initial arguments. Skip the {}. */
for (i=start; i<end-1; ++i)
{
bc_push_arg (&execp->ctl, &execp->state,
argv[i], strlen (argv[i])+1,
NULL, 0,
1);
}
}
else
{
/* Semicolon terminator - more than one {} is supported, so we
* have to do brace-replacement.
*/
execp->num_args = end - start;
execp->ctl.replace_pat = "{}";
execp->ctl.rplen = strlen (execp->ctl.replace_pat);
execp->ctl.lines_per_exec = 0; /* no limit */
execp->ctl.args_per_exec = 0; /* no limit */
execp->replace_vec = xmalloc (sizeof(char*)*execp->num_args);
/* execp->state = xmalloc(sizeof(*(execp->state))); */
bc_init_state (&execp->ctl, &execp->state, execp);
/* Remember the (pre-replacement) arguments for later. */
for (i=0; i<execp->num_args; ++i)
{
execp->replace_vec[i] = argv[i+start];
}
}
if (argv[end] == NULL)
*arg_ptr = end;
else
*arg_ptr = end + 1;
return true;
}
/* Get a timestamp and comparison type.
STR is the ASCII representation.
Set *NUM_DAYS to the number of days/minutes/whatever, taken as being
relative to ORIGIN (usually the current moment or midnight).
Thus the sense of the comparison type appears to be reversed.
Set *COMP_TYPE to the kind of comparison that is requested.
Issue OVERFLOWMESSAGE if overflow occurs.
Return true if all okay, false if input error.
Used by -atime, -ctime and -mtime (parsers) to
get the appropriate information for a time predicate processor. */
static bool
get_relative_timestamp (const char *str,
struct time_val *result,
struct timespec origin,
double sec_per_unit,
const char *overflowmessage)
{
double offset, seconds, nanosec;
static const long nanosec_per_sec = 1000000000;
if (get_comp_type (&str, &result->kind))
{
/* Invert the sense of the comparison */
switch (result->kind)
{
case COMP_LT: result->kind = COMP_GT; break;
case COMP_GT: result->kind = COMP_LT; break;
case COMP_EQ:
break; /* inversion leaves it unchanged */
}
/* Convert the ASCII number into floating-point. */
if (xstrtod (str, NULL, &offset, strtod))
{
/* Separate the floating point number the user specified
* (which is a number of days, or minutes, etc) into an
* integral number of seconds (SECONDS) and a fraction (NANOSEC).
*/
nanosec = modf (offset * sec_per_unit, &seconds);
nanosec *= 1.0e9; /* convert from fractional seconds to ns. */
assert (nanosec < nanosec_per_sec);
/* Perform the subtraction, and then check for overflow.
* On systems where signed aritmetic overflow does not
* wrap, this check may be unreliable. The C standard
* does not require this approach to work, but I am aware
* of no platforms where it fails.
*/
result->ts.tv_sec = origin.tv_sec - seconds;
if ((origin.tv_sec < result->ts.tv_sec) != (seconds < 0))
{
/* an overflow has occurred. */
error (EXIT_FAILURE, 0, overflowmessage, str);
}
result->ts.tv_nsec = origin.tv_nsec - nanosec;
if (origin.tv_nsec < nanosec)
{
/* Perform a carry operation */
result->ts.tv_nsec += nanosec_per_sec;
result->ts.tv_sec -= 1;
}
return true;
}
else
{
/* Conversion from ASCII to double failed. */
return false;
}
}
else
{
return false;
}
}
/* Insert a time predicate based on the information in ENTRY.
ARGV is a pointer to the argument array.
ARG_PTR is a pointer to an index into the array, incremented if
all went well.
Return true if input is valid, false if not.
A new predicate node is assigned, along with an argument node
obtained with malloc.
Used by -atime, -ctime, and -mtime parsers. */
static bool
parse_time (const struct parser_table* entry, char *argv[], int *arg_ptr)
{
struct predicate *our_pred;
struct time_val tval;
enum comparison_type comp;
const char *timearg, *orig_timearg;
const char *errmsg = _("arithmetic overflow while converting %s "
"days to a number of seconds");
struct timespec origin;
const int saved_argc = *arg_ptr;
if (!collect_arg (argv, arg_ptr, &timearg))
return false;
orig_timearg = timearg;
/* Decide the origin by previewing the comparison type. */
origin = options.cur_day_start;
if (get_comp_type (&timearg, &comp))
{
/* Remember, we invert the sense of the comparison, so this tests
* against COMP_LT instead of COMP_GT...
*/
if (COMP_LT == comp)
{
uintmax_t expected = origin.tv_sec + (DAYSECS-1);
origin.tv_sec += (DAYSECS-1);
if (expected != (uintmax_t)origin.tv_sec)
{
error (EXIT_FAILURE, 0,
_("arithmetic overflow when trying to calculate the end of today"));
}
}
}
/* We discard the value of comp here, as get_relative_timestamp
* will set tval.kind. For that to work, we have to restore
* timearg so that it points to the +/- prefix, if any. get_comp_type()
* will have advanced timearg, so we restore it.
*/
timearg = orig_timearg;
if (!get_relative_timestamp (timearg, &tval, origin, DAYSECS, errmsg))
{
*arg_ptr = saved_argc; /* don't consume the invalid argument */
return false;
}
our_pred = insert_primary (entry, orig_timearg);
our_pred->args.reftime = tval;
our_pred->est_success_rate = estimate_timestamp_success_rate (tval.ts.tv_sec);
if (options.debug_options & DebugExpressionTree)
{
time_t t;
fprintf (stderr, "inserting %s\n", our_pred->p_name);
fprintf (stderr, " type: %s %s ",
(tval.kind == COMP_GT) ? "gt" :
((tval.kind == COMP_LT) ? "lt" : ((tval.kind == COMP_EQ) ? "eq" : "?")),
(tval.kind == COMP_GT) ? " >" :
((tval.kind == COMP_LT) ? " <" : ((tval.kind == COMP_EQ) ? ">=" : " ?")));
t = our_pred->args.reftime.ts.tv_sec;
fprintf (stderr, "%ju %s",
(uintmax_t) our_pred->args.reftime.ts.tv_sec,
ctime (&t));
if (tval.kind == COMP_EQ)
{
t = our_pred->args.reftime.ts.tv_sec + DAYSECS;
fprintf (stderr, " < %ju %s",
(uintmax_t) t, ctime (&t));
}
}
return true;
}
/* Get the comparison type prefix (if any) from a number argument.
The prefix is at *STR.
Set *COMP_TYPE to the kind of comparison that is requested.
Advance *STR beyond any initial comparison prefix.
Return true if all okay, false if input error. */
static bool
get_comp_type (const char **str, enum comparison_type *comp_type)
{
switch (**str)
{
case '+':
*comp_type = COMP_GT;
(*str)++;
break;
case '-':
*comp_type = COMP_LT;
(*str)++;
break;
default:
*comp_type = COMP_EQ;
break;
}
return true;
}
/* Get a number with comparison information.
The sense of the comparison information is 'normal'; that is,
'+' looks for a count > than the number and '-' less than.
STR is the ASCII representation of the number.
Set *NUM to the number.
Set *COMP_TYPE to the kind of comparison that is requested.
Return true if all okay, false if input error. */
static bool
get_num (const char *str,
uintmax_t *num,
enum comparison_type *comp_type)
{
char *pend;
if (str == NULL)
return false;
/* Figure out the comparison type if the caller accepts one. */
if (comp_type)
{
if (!get_comp_type (&str, comp_type))
return false;
}
return xstrtoumax (str, &pend, 10, num, "") == LONGINT_OK;
}
/* Insert a number predicate.
ARGV is a pointer to the argument array.
*ARG_PTR is an index into ARGV, incremented if all went well.
*PRED is the predicate processor to insert.
Return true if input is valid, false if error.
A new predicate node is assigned, along with an argument node
obtained with malloc.
Used by -inum and -links parsers. */
static struct predicate *
insert_num (char **argv, int *arg_ptr, const struct parser_table *entry)
{
const char *numstr;
if (collect_arg (argv, arg_ptr, &numstr))
{
uintmax_t num;
enum comparison_type c_type;
if (get_num (numstr, &num, &c_type))
{
struct predicate *our_pred = insert_primary (entry, numstr);
our_pred->args.numinfo.kind = c_type;
our_pred->args.numinfo.l_val = num;
if (options.debug_options & DebugExpressionTree)
{
fprintf (stderr, "inserting %s\n", our_pred->p_name);
fprintf (stderr, " type: %s %s ",
(c_type == COMP_GT) ? "gt" :
((c_type == COMP_LT) ? "lt" : ((c_type == COMP_EQ) ? "eq" : "?")),
(c_type == COMP_GT) ? " >" :
((c_type == COMP_LT) ? " <" : ((c_type == COMP_EQ) ? " =" : " ?")));
fprintf (stderr, "%ju\n", our_pred->args.numinfo.l_val);
}
return our_pred;
}
}
return NULL;
}
static void
open_output_file (const char *path, struct format_val *p)
{
p->segment = NULL;
p->quote_opts = clone_quoting_options (NULL);
if (!strcmp (path, "/dev/stderr"))
{
p->stream = stderr;
p->filename = _("standard error");
}
else if (!strcmp (path, "/dev/stdout"))
{
p->stream = stdout;
p->filename = _("standard output");
}
else
{
p->stream = sharefile_fopen (state.shared_files, path);
p->filename = path;
if (p->stream == NULL)
{
fatal_nontarget_file_error (errno, path);
}
}
p->dest_is_tty = stream_is_tty (p->stream);
}
static void
open_stdout (struct format_val *p)
{
open_output_file ("/dev/stdout", p);
}
|