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
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
|
# Copyright 1999-2024 Gentoo Authors
# Distributed under the terms of the GNU General Public License v2
import errno
import functools
import logging
import stat
import textwrap
import time
import warnings
import collections
from collections import deque, OrderedDict
from itertools import chain
import portage
from portage import os
from portage import _unicode_decode, _unicode_encode, _encodings
from portage.const import (
PORTAGE_PACKAGE_ATOM,
USER_CONFIG_PATH,
VCS_DIRS,
SUPPORTED_XPAK_EXTENSIONS,
SUPPORTED_GPKG_EXTENSIONS,
)
from portage.dbapi import dbapi
from portage.dbapi.dep_expand import dep_expand
from portage.dbapi.DummyTree import DummyTree
from portage.dbapi.IndexedPortdb import IndexedPortdb
from portage.dbapi._similar_name_search import similar_name_search
from portage.dep import (
Atom,
best_match_to_list,
extract_affecting_use,
check_required_use,
human_readable_required_use,
match_from_list,
_repo_separator,
)
from portage.dep.libc import find_libc_deps, strip_libc_deps
from portage.dep._slot_operator import ignore_built_slot_operator_deps, strip_slots
from portage.eapi import eapi_has_strong_blocks, eapi_has_required_use, _get_eapi_attrs
from portage.exception import (
InvalidAtom,
InvalidBinaryPackageFormat,
InvalidData,
InvalidDependString,
PackageNotFound,
PortageException,
)
from portage.output import colorize, create_color_func, darkgreen, green
bad = create_color_func("BAD")
from portage.package.ebuild.config import _get_feature_flags
from portage.package.ebuild.getmaskingstatus import _getmaskingstatus, _MaskReason
from portage._sets import SETPREFIX
from portage._sets.base import InternalPackageSet
from portage.dep._slot_operator import evaluate_slot_operator_equal_deps
from portage.util import ConfigProtect, new_protect_filename
from portage.util import cmp_sort_key, writemsg, writemsg_stdout
from portage.util import ensure_dirs, normalize_path
from portage.util import writemsg_level, write_atomic
from portage.util.digraph import digraph
from portage.util.futures import asyncio
from portage.util._async.TaskScheduler import TaskScheduler
from portage.versions import _pkg_str, catpkgsplit
from portage.binpkg import get_binpkg_format
from _emerge.AtomArg import AtomArg
from _emerge.Blocker import Blocker
from _emerge.BlockerCache import BlockerCache
from _emerge.BlockerDepPriority import BlockerDepPriority
from .chk_updated_cfg_files import chk_updated_cfg_files
from _emerge.countdown import countdown
from _emerge.create_world_atom import create_world_atom
from _emerge.Dependency import Dependency
from _emerge.DependencyArg import DependencyArg
from _emerge.DepPriority import DepPriority
from _emerge.DepPriorityNormalRange import DepPriorityNormalRange
from _emerge.DepPrioritySatisfiedRange import DepPrioritySatisfiedRange
from _emerge.EbuildMetadataPhase import EbuildMetadataPhase
from _emerge.FakeVartree import FakeVartree
from _emerge._find_deep_system_runtime_deps import _find_deep_system_runtime_deps
from _emerge.is_valid_package_atom import (
insert_category_into_atom,
is_valid_package_atom,
)
from _emerge.Package import Package
from _emerge.PackageArg import PackageArg
from _emerge.PackageVirtualDbapi import PackageVirtualDbapi
from _emerge.RootConfig import RootConfig
from _emerge.search import search
from _emerge.SetArg import SetArg
from _emerge.show_invalid_depstring_notice import show_invalid_depstring_notice
from _emerge.UnmergeDepPriority import UnmergeDepPriority
from _emerge.UseFlagDisplay import pkg_use_display
from _emerge.UserQuery import UserQuery
from _emerge.resolver.backtracking import Backtracker, BacktrackParameter
from _emerge.resolver.DbapiProvidesIndex import DbapiProvidesIndex
from _emerge.resolver.package_tracker import PackageTracker, PackageTrackerDbapiWrapper
from _emerge.resolver.slot_collision import slot_conflict_handler
from _emerge.resolver.circular_dependency import circular_dependency_handler
from _emerge.resolver.output import Display, format_unmatched_atom
# Type annotation imports
from typing import Any, Optional, Union, TYPE_CHECKING
if TYPE_CHECKING:
import _emerge.stdout_spinner.stdout_spinner
# Exposes a depgraph interface to dep_check.
_dep_check_graph_interface = collections.namedtuple(
"_dep_check_graph_interface",
(
# Checks if parent package will replace child.
"will_replace_child",
# Indicates a removal action, like depclean or prune.
"removal_action",
# Checks if update is desirable for a given package.
"want_update_pkg",
),
)
class _scheduler_graph_config:
def __init__(self, trees, pkg_cache, graph, mergelist):
self.trees = trees
self.pkg_cache = pkg_cache
self.graph = graph
self.mergelist = mergelist
def _wildcard_set(atoms):
pkgs = InternalPackageSet(allow_wildcard=True)
for x in atoms:
try:
x = Atom(x, allow_wildcard=True, allow_repo=False)
except portage.exception.InvalidAtom:
x = Atom("*/" + x, allow_wildcard=True, allow_repo=False)
pkgs.add(x)
return pkgs
class _frozen_depgraph_config:
def __init__(self, settings, trees, myopts, params, spinner):
self.settings = settings
self.target_root = settings["EROOT"]
self.myopts = myopts
self.edebug = 0
if settings.get("PORTAGE_DEBUG", "") == "1":
self.edebug = 1
self.spinner = spinner
self.requested_depth = params.get("deep", 0)
self._running_root = trees[trees._running_eroot]["root_config"]
self.pkgsettings = {}
self.trees = {}
self._trees_orig = trees
self.roots = {}
# All Package instances
self._pkg_cache = {}
self._highest_license_masked = {}
# We can't know that an soname dep is unsatisfied if there are
# any unbuilt ebuilds in the graph, since unbuilt ebuilds have
# no soname data. Therefore, only enable soname dependency
# resolution if --usepkgonly is enabled, or for removal actions.
self.soname_deps_enabled = (
"--usepkgonly" in myopts or "remove" in params
) and params.get("ignore_soname_deps") != "y"
dynamic_deps = "dynamic_deps" in params
ignore_built_slot_operator_deps = (
myopts.get("--ignore-built-slot-operator-deps", "n") == "y"
)
for myroot in trees:
self.trees[myroot] = {}
# Create a RootConfig instance that references
# the FakeVartree instead of the real one.
self.roots[myroot] = RootConfig(
trees[myroot]["vartree"].settings,
self.trees[myroot],
trees[myroot]["root_config"].setconfig,
)
for tree in ("porttree", "bintree"):
self.trees[myroot][tree] = trees[myroot][tree]
self.trees[myroot]["vartree"] = FakeVartree(
trees[myroot]["root_config"],
pkg_cache=self._pkg_cache,
pkg_root_config=self.roots[myroot],
dynamic_deps=dynamic_deps,
ignore_built_slot_operator_deps=ignore_built_slot_operator_deps,
soname_deps=self.soname_deps_enabled,
)
self.pkgsettings[myroot] = portage.config(
clone=self.trees[myroot]["vartree"].settings
)
if self.soname_deps_enabled and "remove" not in params:
self.trees[myroot]["bintree"] = DummyTree(
DbapiProvidesIndex(trees[myroot]["bintree"].dbapi)
)
if params.get("ignore_world", False):
self._required_set_names = set()
else:
self._required_set_names = {"world"}
atoms = " ".join(myopts.get("--exclude", [])).split()
self.excluded_pkgs = _wildcard_set(atoms)
atoms = " ".join(myopts.get("--reinstall-atoms", [])).split()
self.reinstall_atoms = _wildcard_set(atoms)
atoms = " ".join(myopts.get("--usepkg-exclude", [])).split()
self.usepkg_exclude = _wildcard_set(atoms)
atoms = " ".join(myopts.get("--useoldpkg-atoms", [])).split()
self.useoldpkg_atoms = _wildcard_set(atoms)
atoms = " ".join(myopts.get("--rebuild-exclude", [])).split()
self.rebuild_exclude = _wildcard_set(atoms)
atoms = " ".join(myopts.get("--rebuild-ignore", [])).split()
self.rebuild_ignore = _wildcard_set(atoms)
self.rebuild_if_new_rev = "--rebuild-if-new-rev" in myopts
self.rebuild_if_new_ver = "--rebuild-if-new-ver" in myopts
self.rebuild_if_unbuilt = "--rebuild-if-unbuilt" in myopts
class _depgraph_sets:
def __init__(self):
# contains all sets added to the graph
self.sets = {}
# contains non-set atoms given as arguments
self.sets["__non_set_args__"] = InternalPackageSet(allow_repo=True)
# contains all atoms from all sets added to the graph, including
# atoms given as arguments
self.atoms = InternalPackageSet(allow_repo=True)
self.atom_arg_map = {}
class _rebuild_config:
def __init__(self, frozen_config, backtrack_parameters):
self._graph = digraph()
self._frozen_config = frozen_config
self.rebuild_list = backtrack_parameters.rebuild_list.copy()
self.orig_rebuild_list = self.rebuild_list.copy()
self.reinstall_list = backtrack_parameters.reinstall_list.copy()
self.rebuild_if_new_rev = frozen_config.rebuild_if_new_rev
self.rebuild_if_new_ver = frozen_config.rebuild_if_new_ver
self.rebuild_if_unbuilt = frozen_config.rebuild_if_unbuilt
self.rebuild = (
self.rebuild_if_new_rev
or self.rebuild_if_new_ver
or self.rebuild_if_unbuilt
)
def add(self, dep_pkg, dep):
parent = dep.collapsed_parent
priority = dep.collapsed_priority
rebuild_exclude = self._frozen_config.rebuild_exclude
rebuild_ignore = self._frozen_config.rebuild_ignore
if (
self.rebuild
and isinstance(parent, Package)
and parent.built
and priority.buildtime
and isinstance(dep_pkg, Package)
and not rebuild_exclude.findAtomForPackage(parent)
and not rebuild_ignore.findAtomForPackage(dep_pkg)
):
self._graph.add(dep_pkg, parent, priority)
def _needs_rebuild(self, dep_pkg):
"""Check whether packages that depend on dep_pkg need to be rebuilt."""
dep_root_slot = (dep_pkg.root, dep_pkg.slot_atom)
if dep_pkg.built or dep_root_slot in self.orig_rebuild_list:
return False
if self.rebuild_if_unbuilt:
# dep_pkg is being installed from source, so binary
# packages for parents are invalid. Force rebuild
return True
trees = self._frozen_config.trees
vardb = trees[dep_pkg.root]["vartree"].dbapi
if self.rebuild_if_new_rev:
# Parent packages are valid if a package with the same
# cpv is already installed.
return dep_pkg.cpv not in vardb.match(dep_pkg.slot_atom)
# Otherwise, parent packages are valid if a package with the same
# version (excluding revision) is already installed.
assert self.rebuild_if_new_ver
cpv_norev = catpkgsplit(dep_pkg.cpv)[:-1]
for inst_cpv in vardb.match(dep_pkg.slot_atom):
inst_cpv_norev = catpkgsplit(inst_cpv)[:-1]
if inst_cpv_norev == cpv_norev:
return False
return True
def _trigger_rebuild(self, parent, build_deps):
root_slot = (parent.root, parent.slot_atom)
if root_slot in self.rebuild_list:
return False
trees = self._frozen_config.trees
reinstall = False
for slot_atom, dep_pkg in build_deps.items():
dep_root_slot = (dep_pkg.root, slot_atom)
if self._needs_rebuild(dep_pkg):
self.rebuild_list.add(root_slot)
return True
if "--usepkg" in self._frozen_config.myopts and (
dep_root_slot in self.reinstall_list
or dep_root_slot in self.rebuild_list
or not dep_pkg.installed
):
# A direct rebuild dependency is being installed. We
# should update the parent as well to the latest binary,
# if that binary is valid.
#
# To validate the binary, we check whether all of the
# rebuild dependencies are present on the same binhost.
#
# 1) If parent is present on the binhost, but one of its
# rebuild dependencies is not, then the parent should
# be rebuilt from source.
# 2) Otherwise, the parent binary is assumed to be valid,
# because all of its rebuild dependencies are
# consistent.
bintree = trees[parent.root]["bintree"]
uri = bintree.get_pkgindex_uri(parent.cpv)
dep_uri = bintree.get_pkgindex_uri(dep_pkg.cpv)
bindb = bintree.dbapi
if self.rebuild_if_new_ver and uri and uri != dep_uri:
cpv_norev = catpkgsplit(dep_pkg.cpv)[:-1]
for cpv in bindb.match(dep_pkg.slot_atom):
if cpv_norev == catpkgsplit(cpv)[:-1]:
dep_uri = bintree.get_pkgindex_uri(cpv)
if uri == dep_uri:
break
if uri and uri != dep_uri:
# 1) Remote binary package is invalid because it was
# built without dep_pkg. Force rebuild.
self.rebuild_list.add(root_slot)
return True
if parent.installed and root_slot not in self.reinstall_list:
try:
(bin_build_time,) = bindb.aux_get(parent.cpv, ["BUILD_TIME"])
except KeyError:
continue
if bin_build_time != str(parent.build_time):
# 2) Remote binary package is valid, and local package
# is not up to date. Force reinstall.
reinstall = True
if reinstall:
self.reinstall_list.add(root_slot)
return reinstall
def trigger_rebuilds(self):
"""
Trigger rebuilds where necessary. If pkgA has been updated, and pkgB
depends on pkgA at both build-time and run-time, pkgB needs to be
rebuilt.
"""
need_restart = False
graph = self._graph
build_deps = {}
leaf_nodes = deque(graph.leaf_nodes())
# Trigger rebuilds bottom-up (starting with the leaves) so that parents
# will always know which children are being rebuilt.
while graph:
if not leaf_nodes:
# We'll have to drop an edge. This should be quite rare.
leaf_nodes.append(graph.order[-1])
node = leaf_nodes.popleft()
if node not in graph:
# This can be triggered by circular dependencies.
continue
slot_atom = node.slot_atom
# Remove our leaf node from the graph, keeping track of deps.
parents = graph.parent_nodes(node)
graph.remove(node)
node_build_deps = build_deps.get(node, {})
for parent in parents:
if parent == node:
# Ignore a direct cycle.
continue
parent_bdeps = build_deps.setdefault(parent, {})
parent_bdeps[slot_atom] = node
if not graph.child_nodes(parent):
leaf_nodes.append(parent)
# Trigger rebuilds for our leaf node. Because all of our children
# have been processed, the build_deps will be completely filled in,
# and self.rebuild_list / self.reinstall_list will tell us whether
# any of our children need to be rebuilt or reinstalled.
if self._trigger_rebuild(node, node_build_deps):
need_restart = True
return need_restart
class _use_changes(tuple):
def __new__(cls, new_use, new_changes, required_use_satisfied=True):
obj = tuple.__new__(cls, [new_use, new_changes])
obj.required_use_satisfied = required_use_satisfied
return obj
class _dynamic_depgraph_config:
"""
``dynamic_depgraph_config`` is an object that is used to collect settings and important data structures that are
used in calculating Portage dependencies. Each depgraph created by the depgraph.py code gets its own
``dynamic_depgraph_config``, whereas ``frozen_depgraph_config`` is shared among all depgraphs.
**self.digraph**
Of particular importance is the instance variable ``self.digraph``, which is an instance of
``portage.util.digraph``, a directed graph data structure. ``portage.util.digraph`` is used for a variety of
purposes in the Portage codebase, but in this particular scenario as ``self.digraph``, it is used to create a
dependency tree of Portage packages. So for ``self.digraph``, each *node* of the directed graph is a ``Package``,
while *edges* connect nodes and each edge can have a Priority. The Priority setting is used to help resolve
circular dependencies, and should be interpreted in the direction of parent to child.
Conceptually, think of ``self.digraph`` as containing user-specified packages or sets at the very top, with
dependencies hanging down as children, and dependencies of those children as children of children, etc. The depgraph
is intended to model dependency relationships, not the order that packages should be installed.
**resolving the digraph**
To convert a digraph to an ordered list of packages to merge in an order where all dependencies are properly
satisfied, we would first start by looking at leaf nodes, which are nodes that have no dependencies of their own. We
could then traverse the digraph upwards from the leaf nodes, towards the parents. Along the way, depending on emerge
options, we could make decisions what packages should be installed or rebuilt. This is how ``self.digraph`` is used
in the code.
**digraph creation**
The ``depgraph.py`` code creates the digraph by first adding emerge arguments to the digraph as the main parents,
so if ``@world`` is specified, then the world set is added as the main parents. Then, ``emerge`` will determine
the dependencies of these packages, and depending on what options are passed to ``emerge``, will look at installed
packages, binary packages and available ebuilds that could be merged to satisfy dependencies, and these will be
added as children in the digraph. Children of children will be added as dependencies as needed, depending on the
depth setting used by ``emerge``.
As the digraph is created, it is perfectly fine for Packages to be added to the digraph that conflict with one
another. After the digraph has been fully populated to the necessary depth, code within ``depgraph.py`` will
identify any conflicts that are modeled within the digraph and determine the best way to handle them.
"""
_ENABLE_PRUNE_REBUILDS = True
def __init__(self, depgraph, myparams, allow_backtracking, backtrack_parameters):
self.myparams = myparams.copy()
self._vdb_loaded = False
self._allow_backtracking = allow_backtracking
# Maps nodes to the reasons they were selected for reinstallation.
self._reinstall_nodes = {}
# Contains a filtered view of preferred packages that are selected
# from available repositories.
self._filtered_trees = {}
# Contains installed packages and new packages that have been added
# to the graph.
self._graph_trees = portage._trees_dict()
# Caches visible packages returned from _select_package, for use in
# depgraph._iter_atoms_for_pkg() SLOT logic.
self._visible_pkgs = {}
# contains the args created by select_files
self._initial_arg_list = []
self.digraph = portage.digraph()
# manages sets added to the graph
self.sets = {}
# contains all nodes pulled in by self.sets
self._set_nodes = set()
# Contains only Blocker -> Uninstall edges
self._blocker_uninstalls = digraph()
# Contains only Package -> Blocker edges
self._blocker_parents = digraph()
# Contains only irrelevant Package -> Blocker edges
self._irrelevant_blockers = digraph()
# Contains only unsolvable Package -> Blocker edges
self._unsolvable_blockers = digraph()
# Contains all Blocker -> Blocked Package edges
# Do not initialize this until the depgraph _validate_blockers
# method is called, so that the _in_blocker_conflict method can
# assert that _validate_blockers has been called first.
self._blocked_pkgs = None
# Contains world packages that have been protected from
# uninstallation but may not have been added to the graph
# if the graph is not complete yet.
self._blocked_world_pkgs = {}
# Contains packages whose dependencies have been traversed.
# This use used to check if we have accounted for blockers
# relevant to a package.
self._traversed_pkg_deps = set()
self._parent_atoms = {}
self._slot_conflict_handler = None
self._circular_dependency_handler = None
self._serialized_tasks_cache = None
self._scheduler_graph = None
self._displayed_list = None
self._pprovided_args = []
self._missing_args = []
self._masked_installed = set()
self._masked_license_updates = set()
self._unsatisfied_deps_for_display = []
self._unsatisfied_blockers_for_display = None
self._circular_deps_for_display = None
self._dep_stack = []
self._dep_disjunctive_stack = []
self._unsatisfied_deps = []
self._initially_unsatisfied_deps = []
self._ignored_deps = []
self._highest_pkg_cache = {}
self._highest_pkg_cache_cp_map = {}
self._flatten_atoms_cache = {}
self._changed_deps_pkgs = {}
# Binary packages that have been rejected because their USE
# didn't match the user's config. It maps packages to a set
# of flags causing the rejection.
self.ignored_binaries = {}
self._circular_dependency = backtrack_parameters.circular_dependency
self._needed_unstable_keywords = backtrack_parameters.needed_unstable_keywords
self._needed_p_mask_changes = backtrack_parameters.needed_p_mask_changes
self._needed_license_changes = backtrack_parameters.needed_license_changes
self._needed_use_config_changes = backtrack_parameters.needed_use_config_changes
self._runtime_pkg_mask = backtrack_parameters.runtime_pkg_mask
self._slot_operator_replace_installed = (
backtrack_parameters.slot_operator_replace_installed
)
self._prune_rebuilds = backtrack_parameters.prune_rebuilds
self._need_restart = False
self._need_config_reload = False
# For conditions that always require user intervention, such as
# unsatisfied REQUIRED_USE (currently has no autounmask support).
self._skip_restart = False
self._backtrack_infos = {}
self._buildpkgonly_deps_unsatisfied = False
self._quickpkg_direct_deps_unsatisfied = False
self._autounmask = self.myparams["autounmask"]
self._displayed_autounmask = False
self._success_without_autounmask = False
self._autounmask_backtrack_disabled = False
self._required_use_unsatisfied = False
self._traverse_ignored_deps = False
self._complete_mode = False
self._slot_operator_deps = {}
self._installed_sonames = collections.defaultdict(list)
self._package_tracker = PackageTracker(
soname_deps=depgraph._frozen_config.soname_deps_enabled
)
# Track missed updates caused by solved conflicts.
self._conflict_missed_update = collections.defaultdict(dict)
dep_check_iface = _dep_check_graph_interface(
will_replace_child=depgraph._will_replace_child,
removal_action="remove" in myparams,
want_update_pkg=depgraph._want_update_pkg,
)
for myroot in depgraph._frozen_config.trees:
self.sets[myroot] = _depgraph_sets()
vardb = depgraph._frozen_config.trees[myroot]["vartree"].dbapi
# This dbapi instance will model the state that the vdb will
# have after new packages have been installed.
fakedb = PackageTrackerDbapiWrapper(myroot, self._package_tracker)
def graph_tree():
pass
graph_tree.dbapi = fakedb
self._graph_trees[myroot] = {}
self._graph_trees._running_eroot = (
depgraph._frozen_config._trees_orig._running_eroot
)
self._graph_trees._target_eroot = (
depgraph._frozen_config._trees_orig._target_eroot
)
self._filtered_trees[myroot] = {}
# Substitute the graph tree for the vartree in dep_check() since we
# want atom selections to be consistent with package selections
# have already been made.
self._graph_trees[myroot]["porttree"] = graph_tree
self._graph_trees[myroot]["vartree"] = graph_tree
self._graph_trees[myroot]["graph_db"] = graph_tree.dbapi
self._graph_trees[myroot]["graph"] = self.digraph
self._graph_trees[myroot]["graph_interface"] = dep_check_iface
self._graph_trees[myroot]["downgrade_probe"] = depgraph._downgrade_probe
def filtered_tree():
pass
filtered_tree.dbapi = _dep_check_composite_db(depgraph, myroot)
self._filtered_trees[myroot]["porttree"] = filtered_tree
self._visible_pkgs[myroot] = PackageVirtualDbapi(vardb.settings)
# Passing in graph_tree as the vartree here could lead to better
# atom selections in some cases by causing atoms for packages that
# have been added to the graph to be preferred over other choices.
# However, it can trigger atom selections that result in
# unresolvable direct circular dependencies. For example, this
# happens with gwydion-dylan which depends on either itself or
# gwydion-dylan-bin. In case gwydion-dylan is not yet installed,
# gwydion-dylan-bin needs to be selected in order to avoid a
# an unresolvable direct circular dependency.
#
# To solve the problem described above, pass in "graph_db" so that
# packages that have been added to the graph are distinguishable
# from other available packages and installed packages. Also, pass
# the parent package into self._select_atoms() calls so that
# unresolvable direct circular dependencies can be detected and
# avoided when possible.
self._filtered_trees[myroot]["graph_db"] = graph_tree.dbapi
self._filtered_trees[myroot]["graph"] = self.digraph
self._filtered_trees[myroot]["vartree"] = depgraph._frozen_config.trees[
myroot
]["vartree"]
self._filtered_trees[myroot]["graph_interface"] = dep_check_iface
self._filtered_trees[myroot]["downgrade_probe"] = depgraph._downgrade_probe
dbs = []
# (db, pkg_type, built, installed, db_keys)
if "remove" in self.myparams:
# For removal operations, use _dep_check_composite_db
# for availability and visibility checks. This provides
# consistency with install operations, so we don't
# get install/uninstall cycles like in bug #332719.
self._graph_trees[myroot]["porttree"] = filtered_tree
else:
if "--usepkgonly" not in depgraph._frozen_config.myopts:
portdb = depgraph._frozen_config.trees[myroot]["porttree"].dbapi
db_keys = list(portdb._aux_cache_keys)
dbs.append((portdb, "ebuild", False, False, db_keys))
if "--usepkg" in depgraph._frozen_config.myopts:
bindb = depgraph._frozen_config.trees[myroot]["bintree"].dbapi
db_keys = list(bindb._aux_cache_keys)
dbs.append((bindb, "binary", True, False, db_keys))
vardb = depgraph._frozen_config.trees[myroot]["vartree"].dbapi
db_keys = list(
depgraph._frozen_config._trees_orig[myroot][
"vartree"
].dbapi._aux_cache_keys
)
dbs.append((vardb, "installed", True, True, db_keys))
self._filtered_trees[myroot]["dbs"] = dbs
class depgraph:
# Represents the depth of a node that is unreachable from explicit
# user arguments (or their deep dependencies). Such nodes are pulled
# in by the _complete_graph method.
_UNREACHABLE_DEPTH = object()
pkg_tree_map = RootConfig.pkg_tree_map
def __init__(
self,
settings,
trees,
myopts,
myparams,
spinner,
frozen_config=None,
backtrack_parameters=BacktrackParameter(),
allow_backtracking=False,
):
if frozen_config is None:
frozen_config = _frozen_depgraph_config(
settings, trees, myopts, myparams, spinner
)
self._frozen_config = frozen_config
self._dynamic_config = _dynamic_depgraph_config(
self, myparams, allow_backtracking, backtrack_parameters
)
self._rebuild = _rebuild_config(frozen_config, backtrack_parameters)
self._select_atoms = self._select_atoms_highest_available
self._select_package = self._select_pkg_highest_available
self._event_loop = asyncio._safe_loop()
self._select_atoms_parent = None
self.query = UserQuery(myopts).query
# Set up a per-instance memoization cache for the
# _slot_operator_check_reverse_dependencies() method:
self._slot_operator_check_reverse_dependencies = functools.lru_cache(
maxsize=1000
)(self._slot_operator_check_reverse_dependencies)
def _index_binpkgs(self):
for root in self._frozen_config.trees:
bindb = self._frozen_config.trees[root]["bintree"].dbapi
if bindb._provides_index:
# don't repeat this when backtracking
continue
root_config = self._frozen_config.roots[root]
for cpv in self._frozen_config._trees_orig[root]["bintree"].dbapi.cpv_all():
bindb._provides_inject(self._pkg(cpv, "binary", root_config))
def _load_vdb(self):
"""
Load installed package metadata if appropriate. This used to be called
from the constructor, but that wasn't very nice since this procedure
is slow and it generates spinner output. So, now it's called on-demand
by various methods when necessary.
"""
if self._dynamic_config._vdb_loaded:
return
for myroot in self._frozen_config.trees:
dynamic_deps = "dynamic_deps" in self._dynamic_config.myparams
preload_installed_pkgs = "--nodeps" not in self._frozen_config.myopts
fake_vartree = self._frozen_config.trees[myroot]["vartree"]
if not fake_vartree.dbapi:
# This needs to be called for the first depgraph, but not for
# backtracking depgraphs that share the same frozen_config.
fake_vartree.sync()
# FakeVartree.sync() populates virtuals, and we want
# self.pkgsettings to have them populated too.
self._frozen_config.pkgsettings[myroot] = portage.config(
clone=fake_vartree.settings
)
if preload_installed_pkgs:
vardb = fake_vartree.dbapi
if not dynamic_deps:
for pkg in vardb:
self._dynamic_config._package_tracker.add_installed_pkg(pkg)
self._add_installed_sonames(pkg)
else:
max_jobs = self._frozen_config.myopts.get("--jobs")
max_load = self._frozen_config.myopts.get("--load-average")
scheduler = TaskScheduler(
self._dynamic_deps_preload(fake_vartree),
max_jobs=max_jobs,
max_load=max_load,
event_loop=fake_vartree._portdb._event_loop,
)
scheduler.start()
scheduler.wait()
self._dynamic_config._vdb_loaded = True
def _dynamic_deps_preload(self, fake_vartree):
portdb = fake_vartree._portdb
config_pool = []
for pkg in fake_vartree.dbapi:
self._spinner_update()
self._dynamic_config._package_tracker.add_installed_pkg(pkg)
self._add_installed_sonames(pkg)
ebuild_path, repo_path = portdb.findname2(pkg.cpv, myrepo=pkg.repo)
if ebuild_path is None:
fake_vartree.dynamic_deps_preload(pkg, None)
continue
metadata, ebuild_hash = portdb._pull_valid_cache(
pkg.cpv, ebuild_path, repo_path
)
if metadata is not None:
fake_vartree.dynamic_deps_preload(pkg, metadata)
else:
if config_pool:
settings = config_pool.pop()
else:
settings = portage.config(clone=portdb.settings)
deallocate_config = portdb._event_loop.create_future()
deallocate_config.add_done_callback(
lambda future: config_pool.append(future.result())
)
proc = EbuildMetadataPhase(
cpv=pkg.cpv,
ebuild_hash=ebuild_hash,
portdb=portdb,
repo_path=repo_path,
settings=settings,
deallocate_config=deallocate_config,
)
proc.addExitListener(self._dynamic_deps_proc_exit(pkg, fake_vartree))
yield proc
class _dynamic_deps_proc_exit:
__slots__ = ("_pkg", "_fake_vartree")
def __init__(self, pkg, fake_vartree):
self._pkg = pkg
self._fake_vartree = fake_vartree
def __call__(self, proc):
metadata = None
if proc.returncode == os.EX_OK:
metadata = proc.metadata
self._fake_vartree.dynamic_deps_preload(self._pkg, metadata)
def _spinner_update(self):
if self._frozen_config.spinner:
self._frozen_config.spinner.update()
def _compute_abi_rebuild_info(self):
"""
Fill self._forced_rebuilds with packages that cause rebuilds.
"""
debug = "--debug" in self._frozen_config.myopts
installed_sonames = self._dynamic_config._installed_sonames
package_tracker = self._dynamic_config._package_tracker
# Get all atoms that might have caused a forced rebuild.
atoms = {}
for s in self._dynamic_config._initial_arg_list:
if s.force_reinstall:
root = s.root_config.root
atoms.setdefault(root, set()).update(s.pset)
if debug:
writemsg_level(
"forced reinstall atoms:\n", level=logging.DEBUG, noiselevel=-1
)
for root in atoms:
writemsg_level(f" root: {root}\n", level=logging.DEBUG, noiselevel=-1)
for atom in atoms[root]:
writemsg_level(
f" atom: {atom}\n", level=logging.DEBUG, noiselevel=-1
)
writemsg_level("\n\n", level=logging.DEBUG, noiselevel=-1)
# Go through all slot operator deps and check if one of these deps
# has a parent that is matched by one of the atoms from above.
forced_rebuilds = {}
for root, rebuild_atoms in atoms.items():
for slot_atom in rebuild_atoms:
inst_pkg, reinst_pkg = self._select_pkg_from_installed(root, slot_atom)
if inst_pkg is reinst_pkg or reinst_pkg is None:
continue
if inst_pkg is not None and inst_pkg.requires is not None:
for atom in inst_pkg.requires:
initial_providers = installed_sonames.get((root, atom))
if initial_providers is None:
continue
final_provider = next(package_tracker.match(root, atom), None)
if final_provider:
continue
for provider in initial_providers:
# Find the replacement child.
child = next(
(
pkg
for pkg in package_tracker.match(
root, provider.slot_atom
)
if not pkg.installed
),
None,
)
if child is None:
continue
forced_rebuilds.setdefault(root, {}).setdefault(
child, set()
).add(inst_pkg)
# Generate pseudo-deps for any slot-operator deps of
# inst_pkg. Its deps aren't in _slot_operator_deps
# because it hasn't been added to the graph, but we
# are interested in any rebuilds that it triggered.
built_slot_op_atoms = []
if inst_pkg is not None:
selected_atoms = self._select_atoms_probe(inst_pkg.root, inst_pkg)
for atom in selected_atoms:
if atom.slot_operator_built:
built_slot_op_atoms.append(atom)
if not built_slot_op_atoms:
continue
# Use a cloned list, since we may append to it below.
deps = self._dynamic_config._slot_operator_deps.get(
(root, slot_atom), []
)[:]
if built_slot_op_atoms and reinst_pkg is not None:
for child in self._dynamic_config.digraph.child_nodes(reinst_pkg):
if child.installed:
continue
for atom in built_slot_op_atoms:
# NOTE: Since atom comes from inst_pkg, and
# reinst_pkg is the replacement parent, there's
# no guarantee that atom will completely match
# child. So, simply use atom.cp and atom.slot
# for matching.
if atom.cp != child.cp:
continue
if atom.slot and atom.slot != child.slot:
continue
deps.append(
Dependency(
atom=atom,
child=child,
root=child.root,
parent=reinst_pkg,
)
)
for dep in deps:
if dep.child.installed:
# Find the replacement child.
child = next(
(
pkg
for pkg in self._dynamic_config._package_tracker.match(
dep.root, dep.child.slot_atom
)
if not pkg.installed
),
None,
)
if child is None:
continue
inst_child = dep.child
else:
child = dep.child
inst_child = self._select_pkg_from_installed(
child.root, child.slot_atom
)[0]
# Make sure the child's slot/subslot has changed. If it
# hasn't, then another child has forced this rebuild.
if (
inst_child
and inst_child.slot == child.slot
and inst_child.sub_slot == child.sub_slot
):
continue
if dep.parent.installed:
# Find the replacement parent.
parent = next(
(
pkg
for pkg in self._dynamic_config._package_tracker.match(
dep.parent.root, dep.parent.slot_atom
)
if not pkg.installed
),
None,
)
if parent is None:
continue
else:
parent = dep.parent
# The child has forced a rebuild of the parent
forced_rebuilds.setdefault(root, {}).setdefault(child, set()).add(
parent
)
if debug:
writemsg_level(
"slot operator dependencies:\n", level=logging.DEBUG, noiselevel=-1
)
for (
root,
slot_atom,
), deps in self._dynamic_config._slot_operator_deps.items():
writemsg_level(
f" ({root}, {slot_atom})\n",
level=logging.DEBUG,
noiselevel=-1,
)
for dep in deps:
writemsg_level(
f" parent: {dep.parent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level(
f" child: {dep.child} ({dep.priority})\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level("\n\n", level=logging.DEBUG, noiselevel=-1)
writemsg_level("forced rebuilds:\n", level=logging.DEBUG, noiselevel=-1)
for root in forced_rebuilds:
writemsg_level(f" root: {root}\n", level=logging.DEBUG, noiselevel=-1)
for child in forced_rebuilds[root]:
writemsg_level(
f" child: {child}\n", level=logging.DEBUG, noiselevel=-1
)
for parent in forced_rebuilds[root][child]:
writemsg_level(
f" parent: {parent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level("\n\n", level=logging.DEBUG, noiselevel=-1)
self._forced_rebuilds = forced_rebuilds
def _show_abi_rebuild_info(self):
if not self._forced_rebuilds:
return
writemsg_stdout(
"\nThe following packages are causing rebuilds:\n\n", noiselevel=-1
)
for root in self._forced_rebuilds:
for child in self._forced_rebuilds[root]:
writemsg_stdout(f" {child} causes rebuilds for:\n", noiselevel=-1)
for parent in self._forced_rebuilds[root][child]:
writemsg_stdout(f" {parent}\n", noiselevel=-1)
def _eliminate_ignored_binaries(self):
"""
Eliminate any package from self._dynamic_config.ignored_binaries
for which a more optimal alternative exists.
"""
for pkg in list(self._dynamic_config.ignored_binaries):
for selected_pkg in self._dynamic_config._package_tracker.match(
pkg.root, pkg.slot_atom
):
if selected_pkg > pkg:
self._dynamic_config.ignored_binaries.pop(pkg)
break
# NOTE: The Package.__ge__ implementation accounts for
# differences in build_time, so the warning about "ignored"
# packages will be triggered if both packages are the same
# version and selected_pkg is not the most recent build.
if selected_pkg.type_name == "binary" and selected_pkg >= pkg:
self._dynamic_config.ignored_binaries.pop(pkg)
break
if (
selected_pkg.installed
and selected_pkg.cpv == pkg.cpv
and selected_pkg.build_time == pkg.build_time
):
# We don't care about ignored binaries when an
# identical installed instance is selected to
# fill the slot.
self._dynamic_config.ignored_binaries.pop(pkg)
break
def _ignored_binaries_autounmask_backtrack(self):
"""
Check if there are ignored binaries that would have been
accepted with the current autounmask USE changes.
@rtype: bool
@return: True if there are unnecessary rebuilds that
can be avoided by backtracking
"""
if not all(
[
self._dynamic_config._allow_backtracking,
self._dynamic_config._needed_use_config_changes,
self._dynamic_config.ignored_binaries,
]
):
return False
self._eliminate_ignored_binaries()
# _eliminate_ignored_binaries may have eliminated
# all of the ignored binaries
if not self._dynamic_config.ignored_binaries:
return False
use_changes = collections.defaultdict(
functools.partial(collections.defaultdict, dict)
)
for pkg, (
new_use,
changes,
) in self._dynamic_config._needed_use_config_changes.items():
if pkg in self._dynamic_config.digraph:
use_changes[pkg.root][pkg.slot_atom] = (pkg, new_use)
for pkg in self._dynamic_config.ignored_binaries:
selected_pkg, new_use = use_changes[pkg.root].get(
pkg.slot_atom, (None, None)
)
if new_use is None:
continue
if new_use != pkg.use.enabled:
continue
if selected_pkg > pkg:
continue
return True
return False
def _changed_deps_report(self):
"""
Report ebuilds for which the ebuild dependencies have
changed since the installed instance was built. This is
completely silent in the following cases:
* --changed-deps or --dynamic-deps is enabled
* none of the packages with changed deps are in the graph
"""
if (
self._dynamic_config.myparams.get("changed_deps", "n") == "y"
or "dynamic_deps" in self._dynamic_config.myparams
):
return
report_pkgs = []
for pkg, ebuild in self._dynamic_config._changed_deps_pkgs.items():
if pkg.repo != ebuild.repo:
continue
report_pkgs.append((pkg, ebuild))
if not report_pkgs:
return
# TODO: Detect and report various issues:
# - packages with unsatisfiable dependencies
# - packages involved directly in slot or blocker conflicts
# - direct parents of conflict packages
# - packages that prevent upgrade of dependencies to latest versions
graph = self._dynamic_config.digraph
in_graph = False
for pkg, ebuild in report_pkgs:
if pkg in graph:
in_graph = True
break
# Packages with changed deps are harmless if they're not in the
# graph, so it's safe to silently ignore them. This suppresses
# noise for the unaffected user, even though some of the changed
# dependencies might be worthy of revision bumps.
if not in_graph:
return
writemsg(
f"\n{colorize('WARN','!!! Detected ebuild dependency change(s) without revision bump:')}\n\n",
noiselevel=-1,
)
for pkg, ebuild in report_pkgs:
writemsg(f" {pkg.cpv}::{pkg.repo}", noiselevel=-1)
if pkg.root_config.settings["ROOT"] != "/":
writemsg(f" for {pkg.root}", noiselevel=-1)
writemsg("\n", noiselevel=-1)
msg = []
if "--quiet" not in self._frozen_config.myopts:
msg.extend(
[
"",
"NOTE: Refer to the following page for more information about dependency",
" change(s) without revision bump:",
"",
" https://wiki.gentoo.org/wiki/Project:Portage/Changed_dependencies",
"",
" In order to suppress reports about dependency changes, add",
" --changed-deps-report=n to the EMERGE_DEFAULT_OPTS variable in",
" '/etc/portage/make.conf'.",
]
)
# Include this message for --quiet mode, since the user may be experiencing
# problems that are solvable by using --changed-deps.
msg.extend(
[
"",
"HINT: In order to avoid problems involving changed dependencies, use the",
" --changed-deps option to automatically trigger rebuilds when changed",
" dependencies are detected. Refer to the emerge man page for more",
" information about this option.",
]
)
for line in msg:
if line:
line = colorize("INFORM", line)
writemsg(line + "\n", noiselevel=-1)
def _show_ignored_binaries(self):
"""
Show binaries that have been ignored because their USE didn't
match the user's config.
"""
if (
not self._dynamic_config.ignored_binaries
or "--quiet" in self._frozen_config.myopts
):
return
self._eliminate_ignored_binaries()
ignored_binaries = {}
for pkg in self._dynamic_config.ignored_binaries:
for reason, info in self._dynamic_config.ignored_binaries[pkg].items():
ignored_binaries.setdefault(reason, {})[pkg] = info
if self._dynamic_config.myparams.get("binpkg_respect_use") in ("y", "n"):
ignored_binaries.pop("respect_use", None)
if self._dynamic_config.myparams.get("binpkg_changed_deps") in ("y", "n"):
ignored_binaries.pop("changed_deps", None)
if not ignored_binaries:
return
self._show_merge_list()
if "respect_use" in ignored_binaries:
self._show_ignored_binaries_respect_use(ignored_binaries["respect_use"])
if "changed_deps" in ignored_binaries:
self._show_ignored_binaries_changed_deps(ignored_binaries["changed_deps"])
def _show_ignored_binaries_respect_use(self, respect_use):
seen = {}
messages = []
merging = {
(pkg.root, pkg.cpv)
for pkg in self._dynamic_config._displayed_list or ()
if isinstance(pkg, Package)
}
for pkg, flags in respect_use.items():
# Don't include recursive deps which aren't in the merge list anyway.
if (pkg.root, pkg.cpv) not in merging:
continue
flag_display = []
for flag in sorted(flags):
if flag not in pkg.use.enabled:
flag = "-" + flag
flag_display.append(flag)
flag_display = " ".join(flag_display)
# We don't want to list the same USE flags for multiple build IDs
seen.setdefault(pkg.root, dict())
if (
pkg.cpv not in seen[pkg.root]
or flag_display not in seen[pkg.root][pkg.cpv]
):
seen[pkg.root].setdefault(pkg.cpv, set()).add(flag_display)
# The user can paste this line into package.use
messages.append(f" ={pkg.cpv} {flag_display}")
if pkg.root_config.settings["ROOT"] != "/":
messages.append(f" # for {pkg.root}")
messages.append("\n")
if not messages:
return
writemsg(
"\n!!! The following binary packages have been ignored "
+ "due to non matching USE:\n\n",
noiselevel=-1,
)
for line in messages:
writemsg(line, noiselevel=-1)
msg = [
"",
"NOTE: The --binpkg-respect-use=n option will prevent emerge",
" from ignoring these binary packages if possible.",
" Using --binpkg-respect-use=y will silence this warning.",
]
for line in msg:
if line:
line = colorize("INFORM", line)
writemsg(line + "\n", noiselevel=-1)
def _show_ignored_binaries_changed_deps(self, changed_deps):
merging = {
(pkg.root, pkg.cpv)
for pkg in self._dynamic_config._displayed_list or ()
if isinstance(pkg, Package)
}
messages = []
for pkg in changed_deps:
# Don't include recursive deps which aren't in the merge list anyway.
if (pkg.root, pkg.cpv) not in merging:
continue
msg = f" {pkg.cpv}{_repo_separator}{pkg.repo}"
if pkg.root_config.settings["ROOT"] != "/":
msg += f" for {pkg.root}"
messages.append(f"{msg}\n")
if not messages:
return
writemsg(
"\n!!! The following binary packages have been "
"ignored due to changed dependencies:\n\n",
noiselevel=-1,
)
for line in messages:
writemsg(line, noiselevel=-1)
msg = [
"",
"NOTE: The --binpkg-changed-deps=n option will prevent emerge",
" from ignoring these binary packages if possible.",
" Using --binpkg-changed-deps=y will silence this warning.",
]
for line in msg:
if line:
line = colorize("INFORM", line)
writemsg(line + "\n", noiselevel=-1)
def _get_missed_updates(self):
# In order to minimize noise, show only the highest
# missed update from each SLOT.
missed_updates = {}
for pkg, mask_reasons in chain(
self._dynamic_config._runtime_pkg_mask.items(),
self._dynamic_config._conflict_missed_update.items(),
):
if pkg.installed:
# Exclude installed here since we only
# want to show available updates.
continue
missed_update = True
any_selected = False
for chosen_pkg in self._dynamic_config._package_tracker.match(
pkg.root, pkg.slot_atom
):
any_selected = True
if chosen_pkg > pkg or (
not chosen_pkg.installed and chosen_pkg.version == pkg.version
):
missed_update = False
break
if any_selected and missed_update:
k = (pkg.root, pkg.slot_atom)
if k in missed_updates:
other_pkg, mask_type, parent_atoms = missed_updates[k]
if other_pkg > pkg:
continue
for mask_type, parent_atoms in mask_reasons.items():
if not parent_atoms:
continue
missed_updates[k] = (pkg, mask_type, parent_atoms)
break
return missed_updates
def _show_missed_update(self):
missed_updates = self._get_missed_updates()
if not missed_updates:
return
missed_update_types = {}
for pkg, mask_type, parent_atoms in missed_updates.values():
missed_update_types.setdefault(mask_type, []).append((pkg, parent_atoms))
if (
"--quiet" in self._frozen_config.myopts
and "--debug" not in self._frozen_config.myopts
):
missed_update_types.pop("slot conflict", None)
missed_update_types.pop("missing dependency", None)
self._show_missed_update_slot_conflicts(
missed_update_types.get("slot conflict")
)
self._show_missed_update_unsatisfied_dep(
missed_update_types.get("missing dependency")
)
def _show_missed_update_unsatisfied_dep(self, missed_updates):
if not missed_updates:
return
self._show_merge_list()
backtrack_masked = []
for pkg, parent_atoms in missed_updates:
try:
for parent, root, atom in parent_atoms:
self._show_unsatisfied_dep(
root, atom, myparent=parent, check_backtrack=True
)
except self._backtrack_mask:
# This is displayed below in abbreviated form.
backtrack_masked.append((pkg, parent_atoms))
continue
writemsg(
"\n!!! The following update has been skipped "
+ "due to unsatisfied dependencies:\n\n",
noiselevel=-1,
)
writemsg(str(pkg.slot_atom), noiselevel=-1)
if pkg.root_config.settings["ROOT"] != "/":
writemsg(f" for {pkg.root}", noiselevel=-1)
writemsg("\n\n", noiselevel=-1)
selected_pkg = next(
self._dynamic_config._package_tracker.match(pkg.root, pkg.slot_atom),
None,
)
writemsg(f" selected: {selected_pkg}\n", noiselevel=-1)
writemsg(
f" skipped: {pkg} (see unsatisfied dependency below)\n",
noiselevel=-1,
)
for parent, root, atom in parent_atoms:
self._show_unsatisfied_dep(root, atom, myparent=parent)
writemsg("\n", noiselevel=-1)
if backtrack_masked:
# These are shown in abbreviated form, in order to avoid terminal
# flooding from mask messages as reported in bug #285832.
writemsg(
"\n!!! The following update(s) have been skipped "
+ "due to unsatisfied dependencies\n"
+ "!!! triggered by backtracking:\n\n",
noiselevel=-1,
)
for pkg, parent_atoms in backtrack_masked:
writemsg(str(pkg.slot_atom), noiselevel=-1)
if pkg.root_config.settings["ROOT"] != "/":
writemsg(f" for {pkg.root}", noiselevel=-1)
writemsg("\n", noiselevel=-1)
def _show_missed_update_slot_conflicts(self, missed_updates):
if not missed_updates:
return
self._show_merge_list()
msg = [
"\nWARNING: One or more updates/rebuilds have been "
"skipped due to a dependency conflict:\n\n"
]
indent = " "
for pkg, parent_atoms in missed_updates:
msg.append(str(pkg.slot_atom))
if pkg.root_config.settings["ROOT"] != "/":
msg.append(f" for {pkg.root}")
msg.append("\n\n")
msg.append(indent)
msg.append(
f"{pkg} "
+ str(
pkg_use_display(
pkg,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(pkg),
)
)
)
msg.append(" conflicts with\n")
for parent, atom in parent_atoms:
if isinstance(parent, (PackageArg, AtomArg)):
# For PackageArg and AtomArg types, it's
# redundant to display the atom attribute.
msg.append(2 * indent)
msg.append(str(parent))
msg.append("\n")
else:
# Display the specific atom from SetArg or
# Package types.
atom, marker = format_unmatched_atom(
pkg, atom, self._pkg_use_enabled
)
if isinstance(parent, Package):
use_display = pkg_use_display(
parent,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(parent),
)
else:
use_display = ""
msg.append(2 * indent)
msg.append(f"{atom} required by {parent} {use_display}\n")
msg.append(2 * indent)
msg.append(marker)
msg.append("\n")
msg.append("\n")
writemsg("".join(msg), noiselevel=-1)
def _show_slot_collision_notice(self):
"""Show an informational message advising the user to mask one of the
the packages. In some cases it may be possible to resolve this
automatically, but support for backtracking (removal nodes that have
already been selected) will be required in order to handle all possible
cases.
"""
if not any(self._dynamic_config._package_tracker.slot_conflicts()):
return
self._show_merge_list()
if self._dynamic_config._slot_conflict_handler is None:
self._dynamic_config._slot_conflict_handler = slot_conflict_handler(self)
handler = self._dynamic_config._slot_conflict_handler
conflict = handler.get_conflict()
writemsg(conflict, noiselevel=-1)
explanation = handler.get_explanation()
if explanation:
writemsg(explanation, noiselevel=-1)
return
if "--quiet" in self._frozen_config.myopts:
return
msg = [
"It may be possible to solve this problem "
"by using package.mask to prevent one of "
"those packages from being selected. "
"However, it is also possible that conflicting "
"dependencies exist such that they are impossible to "
"satisfy simultaneously. If such a conflict exists in "
"the dependencies of two different packages, then those "
"packages can not be installed simultaneously."
]
backtrack_opt = self._frozen_config.myopts.get("--backtrack")
if not self._dynamic_config._allow_backtracking and (
backtrack_opt is None or (backtrack_opt > 0 and backtrack_opt < 30)
):
msg.append(
" You may want to try a larger value of the "
"--backtrack option, such as --backtrack=30, "
"in order to see if that will solve this conflict "
"automatically."
)
for line in textwrap.wrap("".join(msg), 70):
writemsg(line + "\n", noiselevel=-1)
writemsg("\n", noiselevel=-1)
msg = (
"For more information, see MASKED PACKAGES "
"section in the emerge man page or refer "
"to the Gentoo Handbook."
)
for line in textwrap.wrap(msg, 70):
writemsg(line + "\n", noiselevel=-1)
writemsg("\n", noiselevel=-1)
def _solve_non_slot_operator_slot_conflicts(self):
"""
This function solves slot conflicts which can
be solved by simply choosing one of the conflicting
and removing all the other ones.
It is able to solve somewhat more complex cases where
conflicts can only be solved simultaniously.
"""
debug = "--debug" in self._frozen_config.myopts
# List all conflicts. Ignore those that involve slot operator rebuilds
# as the logic there needs special slot conflict behavior which isn't
# provided by this function.
conflicts = []
for conflict in self._dynamic_config._package_tracker.slot_conflicts():
slot_key = conflict.root, conflict.atom
if slot_key not in self._dynamic_config._slot_operator_replace_installed:
conflicts.append(conflict)
if not conflicts:
return
if debug:
writemsg_level(
"\n!!! Slot conflict handler started.\n",
level=logging.DEBUG,
noiselevel=-1,
)
# Get a set of all conflicting packages.
conflict_pkgs = set()
for conflict in conflicts:
conflict_pkgs.update(conflict)
# Get the list of other packages which are only
# required by conflict packages.
indirect_conflict_candidates = set()
for pkg in conflict_pkgs:
indirect_conflict_candidates.update(
self._dynamic_config.digraph.child_nodes(pkg)
)
indirect_conflict_candidates -= conflict_pkgs
indirect_conflict_pkgs = set()
while indirect_conflict_candidates:
pkg = indirect_conflict_candidates.pop()
only_conflict_parents = True
for parent, atom in self._dynamic_config._parent_atoms.get(pkg, []):
if parent not in conflict_pkgs and parent not in indirect_conflict_pkgs:
only_conflict_parents = False
break
if not only_conflict_parents:
continue
indirect_conflict_pkgs.add(pkg)
for child in self._dynamic_config.digraph.child_nodes(pkg):
if child in conflict_pkgs or child in indirect_conflict_pkgs:
continue
indirect_conflict_candidates.add(child)
# Create a graph containing the conflict packages
# and a special 'non_conflict_node' that represents
# all non-conflict packages.
conflict_graph = digraph()
non_conflict_node = "(non-conflict package)"
conflict_graph.add(non_conflict_node, None)
for pkg in chain(conflict_pkgs, indirect_conflict_pkgs):
conflict_graph.add(pkg, None)
# Add parent->child edges for each conflict package.
# Parents, which aren't conflict packages are represented
# by 'non_conflict_node'.
# If several conflicting packages are matched, but not all,
# add a tuple with the matched packages to the graph.
class or_tuple(tuple):
"""
Helper class for debug printing.
"""
def __str__(self):
return f"({','.join(str(pkg) for pkg in self)})"
non_matching_forced = set()
for conflict in conflicts:
if debug:
writemsg_level(" conflict:\n", level=logging.DEBUG, noiselevel=-1)
writemsg_level(
f" root: {conflict.root}\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level(
f" atom: {conflict.atom}\n",
level=logging.DEBUG,
noiselevel=-1,
)
for pkg in conflict:
writemsg_level(
f" pkg: {pkg}\n", level=logging.DEBUG, noiselevel=-1
)
all_parent_atoms = set()
highest_pkg = None
inst_pkg = None
for pkg in conflict:
if pkg.installed:
inst_pkg = pkg
if highest_pkg is None or highest_pkg < pkg:
highest_pkg = pkg
all_parent_atoms.update(self._dynamic_config._parent_atoms.get(pkg, []))
for parent, atom in all_parent_atoms:
is_arg_parent = inst_pkg is not None and not self._want_installed_pkg(
inst_pkg
)
is_non_conflict_parent = (
parent not in conflict_pkgs and parent not in indirect_conflict_pkgs
)
if debug:
writemsg_level(
f" parent: {parent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level(
f" arg, non-conflict: {is_arg_parent}, {is_non_conflict_parent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
writemsg_level(
f" atom: {atom}\n", level=logging.DEBUG, noiselevel=-1
)
if is_non_conflict_parent:
parent = non_conflict_node
matched = []
for pkg in conflict:
if atom.match(pkg.with_use(self._pkg_use_enabled(pkg))) and not (
is_arg_parent and pkg.installed
):
matched.append(pkg)
if debug:
for match in matched:
writemsg_level(
f" match: {match}\n",
level=logging.DEBUG,
noiselevel=-1,
)
if len(matched) > 1:
# Even if all packages match, this parent must still
# be added to the conflict_graph. Otherwise, we risk
# removing all of these packages from the depgraph,
# which could cause a missed update (bug #522084).
conflict_graph.add(or_tuple(matched), parent)
elif len(matched) == 1:
conflict_graph.add(matched[0], parent)
else:
# This typically means that autounmask broke a
# USE-dep, but it could also be due to the slot
# not matching due to multislot (bug #220341).
# Either way, don't try to solve this conflict.
# Instead, force them all into the graph so that
# they are protected from removal.
non_matching_forced.update(conflict)
if debug:
for pkg in conflict:
writemsg_level(
f" non-match: {pkg}\n",
level=logging.DEBUG,
noiselevel=-1,
)
for pkg in indirect_conflict_pkgs:
for parent, atom in self._dynamic_config._parent_atoms.get(pkg, []):
if parent not in conflict_pkgs and parent not in indirect_conflict_pkgs:
parent = non_conflict_node
conflict_graph.add(pkg, parent)
if debug:
writemsg_level(
"\n!!! Slot conflict graph:\n", level=logging.DEBUG, noiselevel=-1
)
conflict_graph.debug_print()
# Now select required packages. Collect them in the
# 'forced' set.
forced = {non_conflict_node}
forced |= non_matching_forced
unexplored = {non_conflict_node}
# or_tuples get special handling. We first explore
# all packages in the hope of having forced one of
# the packages in the tuple. This way we don't have
# to choose one.
unexplored_tuples = set()
explored_nodes = set()
while unexplored:
while True:
try:
node = unexplored.pop()
except KeyError:
break
for child in conflict_graph.child_nodes(node):
# Don't explore a node more than once, in order
# to avoid infinite recursion. The forced set
# cannot be used for this purpose, since it can
# contain unexplored nodes from non_matching_forced.
if child in explored_nodes:
continue
explored_nodes.add(child)
forced.add(child)
if isinstance(child, Package):
unexplored.add(child)
else:
unexplored_tuples.add(child)
# Now handle unexplored or_tuples. Move on with packages
# once we had to choose one.
while unexplored_tuples:
nodes = unexplored_tuples.pop()
if any(node in forced for node in nodes):
# At least one of the packages in the
# tuple is already forced, which means the
# dependency represented by this tuple
# is satisfied.
continue
# We now have to choose one of packages in the tuple.
# In theory one could solve more conflicts if we'd be
# able to try different choices here, but that has lots
# of other problems. For now choose the package that was
# pulled first, as this should be the most desirable choice
# (otherwise it wouldn't have been the first one).
forced.add(nodes[0])
unexplored.add(nodes[0])
break
# Remove 'non_conflict_node' and or_tuples from 'forced'.
forced = {pkg for pkg in forced if isinstance(pkg, Package)}
# Add dependendencies of forced packages.
stack = list(forced)
traversed = set()
while stack:
pkg = stack.pop()
traversed.add(pkg)
for child in conflict_graph.child_nodes(pkg):
if isinstance(child, Package) and child not in traversed:
forced.add(child)
stack.append(child)
non_forced = {pkg for pkg in conflict_pkgs if pkg not in forced}
if debug:
writemsg_level(
"\n!!! Slot conflict solution:\n", level=logging.DEBUG, noiselevel=-1
)
for conflict in conflicts:
writemsg_level(
f" Conflict: ({conflict.root}, {conflict.atom})\n",
level=logging.DEBUG,
noiselevel=-1,
)
for pkg in conflict:
if pkg in forced:
writemsg_level(
f" keep: {pkg}\n",
level=logging.DEBUG,
noiselevel=-1,
)
else:
writemsg_level(
f" remove: {pkg}\n",
level=logging.DEBUG,
noiselevel=-1,
)
broken_packages = set()
for pkg in non_forced:
for parent, atom in self._dynamic_config._parent_atoms.get(pkg, []):
if isinstance(parent, Package) and parent not in non_forced:
# Non-forcing set args are expected to be a parent of all
# packages in the conflict.
broken_packages.add(parent)
self._remove_pkg(pkg)
# Process the dependencies of choosen conflict packages
# again to properly account for blockers.
broken_packages |= forced
# Filter out broken packages which have been removed during
# recursive removal in self._remove_pkg.
broken_packages = [
pkg
for pkg in broken_packages
if pkg in broken_packages
and self._dynamic_config._package_tracker.contains(pkg, installed=False)
]
self._dynamic_config._dep_stack.extend(broken_packages)
if broken_packages:
# Process dependencies. This cannot fail because we just ensured that
# the remaining packages satisfy all dependencies.
self._create_graph()
# Record missed updates.
for conflict in conflicts:
for pkg in conflict:
if pkg not in non_forced:
continue
for other in conflict:
if other is pkg:
continue
for parent, atom in self._dynamic_config._parent_atoms.get(
other, []
):
if not atom.match(pkg.with_use(self._pkg_use_enabled(pkg))):
self._dynamic_config._conflict_missed_update[
pkg
].setdefault("slot conflict", set())
self._dynamic_config._conflict_missed_update[pkg][
"slot conflict"
].add((parent, atom))
def _process_slot_conflicts(self):
"""
If there are any slot conflicts and backtracking is enabled,
_complete_graph should complete the graph before this method
is called, so that all relevant reverse dependencies are
available for use in backtracking decisions.
"""
self._solve_non_slot_operator_slot_conflicts()
if not self._validate_blockers():
# Blockers don't trigger the _skip_restart flag, since
# backtracking may solve blockers when it solves slot
# conflicts (or by blind luck).
raise self._unknown_internal_error()
# Both _process_slot_conflict and _slot_operator_trigger_reinstalls
# can call _slot_operator_update_probe, which requires that
# self._dynamic_config._blocked_pkgs has been initialized by a
# call to the _validate_blockers method.
for conflict in self._dynamic_config._package_tracker.slot_conflicts():
self._process_slot_conflict(conflict)
if self._dynamic_config._allow_backtracking:
self._slot_operator_trigger_reinstalls()
def _process_slot_conflict(self, conflict):
"""
Process slot conflict data to identify specific atoms which
lead to conflict. These atoms only match a subset of the
packages that have been pulled into a given slot.
"""
root = conflict.root
slot_atom = conflict.atom
slot_nodes = conflict.pkgs
debug = "--debug" in self._frozen_config.myopts
slot_parent_atoms = set()
for pkg in slot_nodes:
parent_atoms = self._dynamic_config._parent_atoms.get(pkg)
if not parent_atoms:
continue
slot_parent_atoms.update(parent_atoms)
conflict_pkgs = []
conflict_atoms = {}
for pkg in slot_nodes:
if (
self._dynamic_config._allow_backtracking
and pkg in self._dynamic_config._runtime_pkg_mask
):
if debug:
writemsg_level(
f"!!! backtracking loop detected: {pkg} "
f"{self._dynamic_config._runtime_pkg_mask[pkg]}\n",
level=logging.DEBUG,
noiselevel=-1,
)
parent_atoms = self._dynamic_config._parent_atoms.get(pkg)
if parent_atoms is None:
parent_atoms = set()
self._dynamic_config._parent_atoms[pkg] = parent_atoms
all_match = True
for parent_atom in slot_parent_atoms:
if parent_atom in parent_atoms:
continue
parent, atom = parent_atom
if atom.match(pkg.with_use(self._pkg_use_enabled(pkg))):
parent_atoms.add(parent_atom)
else:
all_match = False
conflict_atoms.setdefault(parent_atom, set()).add(pkg)
if not all_match:
conflict_pkgs.append(pkg)
if (
conflict_pkgs
and self._dynamic_config._allow_backtracking
and not self._accept_blocker_conflicts()
):
remaining = []
for pkg in conflict_pkgs:
if self._slot_conflict_backtrack_abi(pkg, slot_nodes, conflict_atoms):
backtrack_infos = self._dynamic_config._backtrack_infos
config = backtrack_infos.setdefault("config", {})
config.setdefault("slot_conflict_abi", set()).add(pkg)
else:
remaining.append(pkg)
if remaining:
self._slot_confict_backtrack(
root, slot_atom, slot_parent_atoms, remaining
)
def _slot_confict_backtrack(self, root, slot_atom, all_parents, conflict_pkgs):
debug = "--debug" in self._frozen_config.myopts
existing_node = next(
self._dynamic_config._package_tracker.match(
root, slot_atom, installed=False
)
)
if existing_node not in conflict_pkgs:
# Even though all parent atoms match existing_node,
# consider masking it in order to avoid a missed update
# as in bug 692746.
conflict_pkgs.append(existing_node)
# In order to avoid a missed update, first mask lower versions
# that conflict with higher versions (the backtracker visits
# these in reverse order).
conflict_pkgs.sort(reverse=True)
backtrack_data = []
for to_be_masked in conflict_pkgs:
# For missed update messages, find out which
# atoms matched to_be_selected that did not
# match to_be_masked.
parent_atoms = self._dynamic_config._parent_atoms.get(to_be_masked, set())
conflict_atoms = {
parent_atom
for parent_atom in all_parents
if parent_atom not in parent_atoms
}
similar_pkgs = []
if conflict_atoms:
# If the conflict has been triggered by a missed update, then
# we can avoid excessive backtracking if we detect similar missed
# updates and mask them as part of the same backtracking choice.
for similar_pkg in self._iter_similar_available(
to_be_masked, slot_atom
):
if similar_pkg in conflict_pkgs:
continue
similar_conflict_atoms = []
for parent_atom in conflict_atoms:
parent, atom = parent_atom
if not atom.match(similar_pkg):
similar_conflict_atoms.append(parent_atom)
if similar_conflict_atoms:
similar_pkgs.append((similar_pkg, set(similar_conflict_atoms)))
similar_pkgs.append((to_be_masked, conflict_atoms))
backtrack_data.append(tuple(similar_pkgs))
# Prefer choices that minimize conflict atoms. This is intended
# to take precedence over the earlier package version sort. The
# package version sort is still needed or else choices for the
# testOverlapSlotConflict method of VirtualMinimizeChildrenTestCase
# become non-deterministic.
backtrack_data.sort(key=lambda similar_pkgs: len(similar_pkgs[-1][1]))
to_be_masked = [item[0] for item in backtrack_data[-1]]
self._dynamic_config._backtrack_infos.setdefault("slot conflict", []).append(
backtrack_data
)
self._dynamic_config._need_restart = True
if debug:
msg = [
"",
"",
"backtracking due to slot conflict:",
f" first package: {existing_node}",
f" package(s) to mask: {str(to_be_masked)}",
f" slot: {slot_atom}",
" parents: {}".format(
", ".join(f"({ppkg}, '{atom}')" for ppkg, atom in all_parents)
),
"",
]
writemsg_level(
"".join(f"{l}\n" for l in msg), noiselevel=-1, level=logging.DEBUG
)
def _slot_conflict_backtrack_abi(self, pkg, slot_nodes, conflict_atoms):
"""
If one or more conflict atoms have a slot/sub-slot dep that can be resolved
by rebuilding the parent package, then schedule the rebuild via
backtracking, and return True. Otherwise, return False.
"""
found_update = False
for parent_atom, conflict_pkgs in conflict_atoms.items():
parent, atom = parent_atom
if not isinstance(parent, Package):
continue
if not parent.built:
continue
if not atom.soname and not (atom.package and atom.slot_operator_built):
continue
for other_pkg in slot_nodes:
if other_pkg in conflict_pkgs:
continue
dep = Dependency(
atom=atom, child=other_pkg, parent=parent, root=pkg.root
)
new_dep = self._slot_operator_update_probe_slot_conflict(dep)
if new_dep is not None:
self._slot_operator_update_backtrack(dep, new_dep=new_dep)
found_update = True
return found_update
def _slot_change_probe(self, dep):
"""
@rtype: bool
@return: True if dep.child should be rebuilt due to a change
in sub-slot (without revbump, as in bug #456208).
"""
if not (
isinstance(dep.parent, Package) and not dep.parent.built and dep.child.built
):
return None
root_config = self._frozen_config.roots[dep.root]
matches = []
try:
matches.append(
self._pkg(dep.child.cpv, "ebuild", root_config, myrepo=dep.child.repo)
)
except PackageNotFound:
pass
for unbuilt_child in chain(
matches,
self._iter_match_pkgs(root_config, "ebuild", Atom(f"={dep.child.cpv}")),
):
if unbuilt_child in self._dynamic_config._runtime_pkg_mask:
continue
if self._frozen_config.excluded_pkgs.findAtomForPackage(
unbuilt_child, modified_use=self._pkg_use_enabled(unbuilt_child)
):
continue
if not self._pkg_visibility_check(unbuilt_child):
continue
break
else:
return None
if (
unbuilt_child.slot == dep.child.slot
and unbuilt_child.sub_slot == dep.child.sub_slot
):
return None
return unbuilt_child
def _slot_change_backtrack(self, dep, new_child_slot):
child = dep.child
if "--debug" in self._frozen_config.myopts:
msg = [
"",
"",
"backtracking due to slot/sub-slot change:",
f" child package: {child}",
f" child slot: {child.slot}/{child.sub_slot}",
f" new child: {new_child_slot}",
f" new child slot: {new_child_slot.slot}/{new_child_slot.sub_slot}",
f" parent package: {dep.parent}",
f" atom: {dep.atom}",
"",
]
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
backtrack_infos = self._dynamic_config._backtrack_infos
config = backtrack_infos.setdefault("config", {})
# mask unwanted binary packages if necessary
masks = {}
if not child.installed:
masks.setdefault(dep.child, {})["slot_operator_mask_built"] = None
if masks:
config.setdefault("slot_operator_mask_built", {}).update(masks)
# trigger replacement of installed packages if necessary
reinstalls = set()
if child.installed:
replacement_atom = self._replace_installed_atom(child)
if replacement_atom is not None:
reinstalls.add((child.root, replacement_atom))
if reinstalls:
config.setdefault("slot_operator_replace_installed", set()).update(
reinstalls
)
self._dynamic_config._need_restart = True
def _slot_operator_update_backtrack(self, dep, new_child_slot=None, new_dep=None):
if new_child_slot is None:
child = dep.child
else:
child = new_child_slot
if "--debug" in self._frozen_config.myopts:
msg = [
"",
"",
"backtracking due to missed slot abi update:",
f" child package: {child}",
]
if new_child_slot is not None:
msg.append(f" new child slot package: {new_child_slot}")
msg.append(f" parent package: {dep.parent}")
if new_dep is not None:
msg.append(f" new parent pkg: {new_dep.parent}")
msg.append(f" atom: {dep.atom}")
msg.append("")
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
backtrack_infos = self._dynamic_config._backtrack_infos
config = backtrack_infos.setdefault("config", {})
# mask unwanted binary packages if necessary
abi_masks = {}
if new_child_slot is None:
if not child.installed:
abi_masks.setdefault(child, {})["slot_operator_mask_built"] = None
if not dep.parent.installed:
abi_masks.setdefault(dep.parent, {})["slot_operator_mask_built"] = None
if abi_masks:
config.setdefault("slot_operator_mask_built", {}).update(abi_masks)
# trigger replacement of installed packages if necessary
abi_reinstalls = set()
if dep.parent.installed:
if new_dep is not None:
replacement_atom = new_dep.parent.slot_atom
else:
replacement_atom = self._replace_installed_atom(dep.parent)
if replacement_atom is not None:
abi_reinstalls.add((dep.parent.root, replacement_atom))
if new_child_slot is None and child.installed:
replacement_atom = self._replace_installed_atom(child)
if replacement_atom is not None:
abi_reinstalls.add((child.root, replacement_atom))
if abi_reinstalls:
config.setdefault("slot_operator_replace_installed", set()).update(
abi_reinstalls
)
self._dynamic_config._need_restart = True
def _slot_operator_update_probe_slot_conflict(self, dep):
new_dep = self._slot_operator_update_probe(dep, slot_conflict=True)
if new_dep is not None:
return new_dep
if self._dynamic_config._autounmask is True:
for autounmask_level in self._autounmask_levels():
new_dep = self._slot_operator_update_probe(
dep, slot_conflict=True, autounmask_level=autounmask_level
)
if new_dep is not None:
return new_dep
return None
# This method is memoized on a per-instance basis via a decorator applied
# in __init__().
def _slot_operator_check_reverse_dependencies(
self, existing_pkg, candidate_pkg, replacement_parent=None
):
"""
Check if candidate_pkg satisfies all of existing_pkg's non-
slot operator parents.
"""
debug = "--debug" in self._frozen_config.myopts
built_slot_operator_parents = set()
for parent, atom in self._dynamic_config._parent_atoms.get(existing_pkg, []):
if atom.soname or atom.slot_operator_built:
built_slot_operator_parents.add(parent)
for parent, atom in self._dynamic_config._parent_atoms.get(existing_pkg, []):
if isinstance(parent, Package):
if parent in built_slot_operator_parents:
if hasattr(atom, "_orig_atom"):
# If atom is the result of virtual expansion, then
# dereference it to _orig_atom so that it will be correctly
# handled as a built slot operator dependency when
# appropriate (see bug 764764).
atom = atom._orig_atom
# This parent may need to be rebuilt, therefore
# discard its soname and built slot operator
# dependency components which are not necessarily
# relevant.
if atom.soname:
continue
elif atom.package and atom.slot_operator_built:
# This discards the slot/subslot component.
atom = atom.with_slot("=")
if replacement_parent is not None and (
replacement_parent.slot_atom == parent.slot_atom
or replacement_parent.cpv == parent.cpv
):
# This parent is irrelevant because we intend to
# replace it with replacement_parent.
continue
if any(
pkg is not parent
and (pkg.slot_atom == parent.slot_atom or pkg.cpv == parent.cpv)
for pkg in self._dynamic_config._package_tracker.match(
parent.root, Atom(parent.cp)
)
):
# This parent may need to be eliminated due to a
# slot conflict, so its dependencies aren't
# necessarily relevant.
continue
if not self._too_deep(
parent.depth
) and not self._frozen_config.excluded_pkgs.findAtomForPackage(
parent, modified_use=self._pkg_use_enabled(parent)
):
# Check for common reasons that the parent's
# dependency might be irrelevant.
if self._upgrade_available(parent):
# This parent could be replaced by
# an upgrade (bug 584626).
continue
if parent.installed and self._in_blocker_conflict(parent):
# This parent could be uninstalled in order
# to solve a blocker conflict (bug 612772).
continue
if self._dynamic_config.digraph.has_edge(parent, existing_pkg):
# There is a direct circular dependency between
# parent and existing_pkg. This type of
# relationship tends to prevent updates
# of packages (bug 612874). Since candidate_pkg
# is available, we risk a missed update if we
# don't try to eliminate this parent from the
# graph. Therefore, we give candidate_pkg a
# chance, and assume that it will be masked
# by backtracking if necessary.
continue
atom_set = InternalPackageSet(initial_atoms=(atom,), allow_repo=True)
if not atom_set.findAtomForPackage(
candidate_pkg, modified_use=self._pkg_use_enabled(candidate_pkg)
):
if debug:
parent_atoms = []
for (
other_parent,
other_atom,
) in self._dynamic_config._parent_atoms.get(existing_pkg, []):
if other_parent is parent:
parent_atoms.append(other_atom)
msg = (
"",
"",
"_slot_operator_check_reverse_dependencies:",
f" candidate package does not match atom '{atom}': {candidate_pkg}",
f" parent: {parent}",
f" parent atoms: {' '.join(parent_atoms)}",
"",
)
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
return False
return True
def _slot_operator_update_probe(
self, dep, new_child_slot=False, slot_conflict=False, autounmask_level=None
):
"""
slot/sub-slot := operators tend to prevent updates from getting pulled in,
since installed packages pull in packages with the slot/sub-slot that they
were built against. Detect this case so that we can schedule rebuilds
and reinstalls when appropriate.
NOTE: This function only searches for updates that involve upgrades
to higher versions, since the logic required to detect when a
downgrade would be desirable is not implemented.
"""
if (
dep.child.installed
and self._frozen_config.excluded_pkgs.findAtomForPackage(
dep.child, modified_use=self._pkg_use_enabled(dep.child)
)
):
return None
if (
dep.parent.installed
and self._frozen_config.excluded_pkgs.findAtomForPackage(
dep.parent, modified_use=self._pkg_use_enabled(dep.parent)
)
):
return None
debug = "--debug" in self._frozen_config.myopts
selective = "selective" in self._dynamic_config.myparams
want_downgrade = None
want_downgrade_parent = None
for replacement_parent in self._iter_similar_available(
dep.parent, dep.parent.slot_atom, autounmask_level=autounmask_level
):
if replacement_parent is dep.parent:
continue
if replacement_parent < dep.parent:
if want_downgrade_parent is None:
want_downgrade_parent = self._downgrade_probe(dep.parent)
if not want_downgrade_parent:
continue
if not self._slot_operator_check_reverse_dependencies(
dep.parent, replacement_parent
):
continue
selected_atoms = None
try:
atoms = self._flatten_atoms(
replacement_parent, self._pkg_use_enabled(replacement_parent)
)
except InvalidDependString:
continue
if replacement_parent.requires is not None:
atoms = list(atoms)
atoms.extend(replacement_parent.requires)
# List of list of child,atom pairs for each atom.
replacement_candidates = []
# Set of all packages all atoms can agree on.
all_candidate_pkgs = None
for atom in atoms:
# The _select_atoms_probe method is expensive, so initialization
# of this variable is only performed on demand.
atom_not_selected = None
if not atom.package:
unevaluated_atom = None
if atom.match(dep.child):
# We are searching for a replacement_parent
# atom that will pull in a different child,
# so continue checking the rest of the atoms.
continue
else:
if atom.blocker or atom.cp != dep.child.cp:
continue
# Discard USE deps, we're only searching for an
# approximate pattern, and dealing with USE states
# is too complex for this purpose.
unevaluated_atom = atom.unevaluated_atom
atom = atom.without_use
if replacement_parent.built and portage.dep._match_slot(
atom, dep.child
):
# We are searching for a replacement_parent
# atom that will pull in a different child,
# so continue checking the rest of the atoms.
continue
candidate_pkg_atoms = []
candidate_pkgs = []
for pkg in self._iter_similar_available(dep.child, atom):
if (
dep.atom.package
and pkg.slot == dep.child.slot
and pkg.sub_slot == dep.child.sub_slot
):
# If slot/sub-slot is identical, then there's
# no point in updating.
continue
if new_child_slot:
if pkg.slot == dep.child.slot:
continue
if pkg < dep.child:
# the new slot only matters if the
# package version is higher
continue
else:
if pkg.slot != dep.child.slot:
continue
if pkg < dep.child:
if want_downgrade is None:
want_downgrade = self._downgrade_probe(dep.child)
# be careful not to trigger a rebuild when
# the only version available with a
# different slot_operator is an older version
if not want_downgrade:
continue
if pkg.version == dep.child.version and not dep.child.built:
continue
insignificant = False
if (
not slot_conflict
and selective
and dep.parent.installed
and dep.child.installed
and dep.parent >= replacement_parent
and dep.child.cpv == pkg.cpv
):
# Then can happen if the child's sub-slot changed
# without a revision bump. The sub-slot change is
# considered insignificant until one of its parent
# packages needs to be rebuilt (which may trigger a
# slot conflict).
insignificant = True
if not insignificant and unevaluated_atom is not None:
# Evaluate USE conditionals and || deps, in order
# to see if this atom is really desirable, since
# otherwise we may trigger an undesirable rebuild
# as in bug #460304.
if selected_atoms is None:
selected_atoms = self._select_atoms_probe(
dep.child.root, replacement_parent
)
atom_not_selected = unevaluated_atom not in selected_atoms
if atom_not_selected:
break
if (
not insignificant
and self._slot_operator_check_reverse_dependencies(
dep.child, pkg, replacement_parent=replacement_parent
)
):
candidate_pkg_atoms.append((pkg, unevaluated_atom or atom))
candidate_pkgs.append(pkg)
# When unevaluated_atom is None, it means that atom is
# an soname atom which is unconditionally selected, and
# _select_atoms_probe is not applicable.
if atom_not_selected is None and unevaluated_atom is not None:
if selected_atoms is None:
selected_atoms = self._select_atoms_probe(
dep.child.root, replacement_parent
)
atom_not_selected = unevaluated_atom not in selected_atoms
if atom_not_selected:
continue
replacement_candidates.append(candidate_pkg_atoms)
if all_candidate_pkgs is None:
all_candidate_pkgs = set(candidate_pkgs)
else:
all_candidate_pkgs.intersection_update(candidate_pkgs)
if not all_candidate_pkgs:
# If the atoms that connect parent and child can't agree on
# any replacement child, we can't do anything.
continue
# Now select one of the pkgs as replacement. This is as easy as
# selecting the highest version.
# The more complicated part is to choose an atom for the
# new Dependency object. Choose the one which ranked the selected
# parent highest.
selected = None
for candidate_pkg_atoms in replacement_candidates:
for i, (pkg, atom) in enumerate(candidate_pkg_atoms):
if pkg not in all_candidate_pkgs:
continue
if (
selected is None
or selected[0] < pkg
or (selected[0] is pkg and i < selected[2])
):
selected = (pkg, atom, i)
if debug:
msg = (
"",
"",
"slot_operator_update_probe:",
f" existing child package: {dep.child}",
f" existing parent package: {dep.parent}",
f" new child package: {selected[0]}",
f" new parent package: {replacement_parent}",
"",
)
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
return Dependency(
parent=replacement_parent, child=selected[0], atom=selected[1]
)
if debug:
msg = (
"",
"",
"slot_operator_update_probe:",
f" existing child package: {dep.child}",
f" existing parent package: {dep.parent}",
" new child package: None",
" new parent package: None",
"",
)
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
return None
def _slot_operator_unsatisfied_probe(self, dep):
if (
dep.parent.installed
and self._frozen_config.excluded_pkgs.findAtomForPackage(
dep.parent, modified_use=self._pkg_use_enabled(dep.parent)
)
):
return False
debug = "--debug" in self._frozen_config.myopts
for replacement_parent in self._iter_similar_available(
dep.parent, dep.parent.slot_atom
):
for atom in replacement_parent.validated_atoms:
if (
not atom.slot_operator == "="
or atom.blocker
or atom.cp != dep.atom.cp
):
continue
# Discard USE deps, we're only searching for an approximate
# pattern, and dealing with USE states is too complex for
# this purpose.
atom = atom.without_use
pkg, existing_node = self._select_package(
dep.root, atom, onlydeps=dep.onlydeps
)
if pkg is not None:
if debug:
msg = (
"",
"",
"slot_operator_unsatisfied_probe:",
f" existing parent package: {dep.parent}",
f" existing parent atom: {dep.atom}",
f" new parent package: {replacement_parent}",
f" new child package: {pkg}",
"",
)
writemsg_level(
"\n".join(msg), noiselevel=-1, level=logging.DEBUG
)
return True
if debug:
msg = (
"",
"",
"slot_operator_unsatisfied_probe:",
f" existing parent package: {dep.parent}",
f" existing parent atom: {dep.atom}",
" new parent package: None",
" new child package: None",
"",
)
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
return False
def _slot_operator_unsatisfied_backtrack(self, dep):
parent = dep.parent
if "--debug" in self._frozen_config.myopts:
msg = (
"",
"",
"backtracking due to unsatisfied built slot-operator dep:",
f" parent package: {parent}",
f" atom: {dep.atom}",
"",
)
writemsg_level("\n".join(msg), noiselevel=-1, level=logging.DEBUG)
backtrack_infos = self._dynamic_config._backtrack_infos
config = backtrack_infos.setdefault("config", {})
# mask unwanted binary packages if necessary
masks = {}
if not parent.installed:
masks.setdefault(parent, {})["slot_operator_mask_built"] = None
if masks:
config.setdefault("slot_operator_mask_built", {}).update(masks)
# trigger replacement of installed packages if necessary
reinstalls = set()
if parent.installed:
replacement_atom = self._replace_installed_atom(parent)
if replacement_atom is not None:
reinstalls.add((parent.root, replacement_atom))
if reinstalls:
config.setdefault("slot_operator_replace_installed", set()).update(
reinstalls
)
self._dynamic_config._need_restart = True
def _in_blocker_conflict(self, pkg):
"""
Check if pkg is involved in a blocker conflict. This method
only works after the _validate_blockers method has been called.
"""
if self._dynamic_config._blocked_pkgs is None and not self._validate_blockers():
raise self._unknown_internal_error()
if pkg in self._dynamic_config._blocked_pkgs:
return True
if pkg in self._dynamic_config._blocker_parents:
return True
return False
def _upgrade_available(self, pkg):
"""
Detect cases where an upgrade of the given package is available
within the same slot.
"""
for available_pkg in self._iter_similar_available(pkg, pkg.slot_atom):
if available_pkg > pkg:
return True
return False
def _downgrade_probe(self, pkg):
"""
Detect cases where a downgrade of the given package is considered
desirable due to the current version being masked or unavailable.
"""
available_pkg = None
for available_pkg in self._iter_similar_available(pkg, pkg.slot_atom):
if available_pkg >= pkg:
# There's an available package of the same or higher
# version, so downgrade seems undesirable.
return False
return available_pkg is not None
def _select_atoms_probe(self, root, pkg):
selected_atoms = []
use = self._pkg_use_enabled(pkg)
for k in pkg._dep_keys:
v = pkg._metadata.get(k)
if not v:
continue
selected_atoms.extend(
self._select_atoms(root, v, myuse=use, parent=pkg)[pkg]
)
return frozenset(x.unevaluated_atom for x in selected_atoms)
def _flatten_atoms(self, pkg, use):
"""
Evaluate all dependency atoms of the given package, and return
them as a frozenset. For performance, results are cached.
@param pkg: a Package instance
@type pkg: Package
@param pkg: set of enabled USE flags
@type pkg: frozenset
@rtype: frozenset
@return: set of evaluated atoms
"""
cache_key = (pkg, use)
try:
return self._dynamic_config._flatten_atoms_cache[cache_key]
except KeyError:
pass
atoms = []
for dep_key in pkg._dep_keys:
dep_string = pkg._metadata[dep_key]
if not dep_string:
continue
dep_string = portage.dep.use_reduce(
dep_string,
uselist=use,
is_valid_flag=pkg.iuse.is_valid_flag,
flat=True,
token_class=Atom,
eapi=pkg.eapi,
)
atoms.extend(token for token in dep_string if isinstance(token, Atom))
atoms = frozenset(atoms)
self._dynamic_config._flatten_atoms_cache[cache_key] = atoms
return atoms
def _iter_similar_available(self, graph_pkg, atom, autounmask_level=None):
"""
Given a package that's in the graph, do a rough check to
see if a similar package is available to install. The given
graph_pkg itself may be yielded only if it's not installed.
"""
usepkgonly = "--usepkgonly" in self._frozen_config.myopts
useoldpkg_atoms = self._frozen_config.useoldpkg_atoms
use_ebuild_visibility = (
self._frozen_config.myopts.get("--use-ebuild-visibility", "n") != "n"
)
for pkg in self._iter_match_pkgs_any(graph_pkg.root_config, atom):
if pkg.cp != graph_pkg.cp:
# discard old-style virtual match
continue
if pkg.installed:
continue
if pkg in self._dynamic_config._runtime_pkg_mask:
continue
if self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
continue
if pkg.built:
if self._equiv_binary_installed(pkg):
continue
if not (
not use_ebuild_visibility
and (
usepkgonly
or useoldpkg_atoms.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
)
) and not self._equiv_ebuild_visible(
pkg, autounmask_level=autounmask_level
):
continue
if not self._pkg_visibility_check(pkg, autounmask_level=autounmask_level):
continue
yield pkg
def _replace_installed_atom(self, inst_pkg):
"""
Given an installed package, generate an atom suitable for
slot_operator_replace_installed backtracking info. The replacement
SLOT may differ from the installed SLOT, so first search by cpv.
"""
built_pkgs = []
for pkg in self._iter_similar_available(inst_pkg, Atom(f"={inst_pkg.cpv}")):
if not pkg.built:
return pkg.slot_atom
if not pkg.installed:
# avoid using SLOT from a built instance
built_pkgs.append(pkg)
for pkg in self._iter_similar_available(inst_pkg, inst_pkg.slot_atom):
if not pkg.built:
return pkg.slot_atom
if not pkg.installed:
# avoid using SLOT from a built instance
built_pkgs.append(pkg)
if built_pkgs:
best_version = None
for pkg in built_pkgs:
if best_version is None or pkg > best_version:
best_version = pkg
return best_version.slot_atom
return None
def _slot_operator_trigger_reinstalls(self):
"""
Search for packages with slot-operator deps on older slots, and schedule
rebuilds if they can link to a newer slot that's in the graph.
"""
rebuild_if_new_slot = (
self._dynamic_config.myparams.get("rebuild_if_new_slot", "y") == "y"
)
for slot_key, slot_info in self._dynamic_config._slot_operator_deps.items():
for dep in slot_info:
atom = dep.atom
if not (atom.soname or atom.slot_operator_built):
new_child_slot = self._slot_change_probe(dep)
if new_child_slot is not None:
self._slot_change_backtrack(dep, new_child_slot)
continue
if not (
dep.parent and isinstance(dep.parent, Package) and dep.parent.built
):
continue
# If the parent is not installed, check if it needs to be
# rebuilt against an installed instance, since otherwise
# it could trigger downgrade of an installed instance as
# in bug #652938.
want_update_probe = dep.want_update or not dep.parent.installed
# Check for slot update first, since we don't want to
# trigger reinstall of the child package when a newer
# slot will be used instead.
if rebuild_if_new_slot and want_update_probe:
new_dep = self._slot_operator_update_probe(dep, new_child_slot=True)
if new_dep is not None:
self._slot_operator_update_backtrack(
dep, new_child_slot=new_dep.child
)
if want_update_probe:
if self._slot_operator_update_probe(dep):
self._slot_operator_update_backtrack(dep)
def _reinstall_for_flags(
self, pkg, forced_flags, orig_use, orig_iuse, cur_use, cur_iuse
):
"""Return a set of flags that trigger reinstallation, or None if there
are no such flags."""
# binpkg_respect_use: Behave like newuse by default. If newuse is
# False and changed_use is True, then behave like changed_use.
binpkg_respect_use = pkg.built and self._dynamic_config.myparams.get(
"binpkg_respect_use"
) in ("y", "auto")
newuse = "--newuse" in self._frozen_config.myopts
changed_use = "changed-use" == self._frozen_config.myopts.get("--reinstall")
feature_flags = _get_feature_flags(_get_eapi_attrs(pkg.eapi))
if newuse or (binpkg_respect_use and not changed_use):
flags = set(orig_iuse)
flags ^= cur_iuse
flags -= forced_flags
flags |= orig_iuse.intersection(orig_use) ^ cur_iuse.intersection(cur_use)
flags -= feature_flags
if flags:
return flags
elif changed_use or binpkg_respect_use:
flags = set(orig_iuse)
flags.intersection_update(orig_use)
flags ^= cur_iuse.intersection(cur_use)
flags -= feature_flags
if flags:
return flags
return None
def _installed_libc_deps(self, eroot):
"""
Return find_libc_deps result for installed packages from the
given EROOT.
"""
try:
return self._frozen_config._libc_deps_cache[eroot]
except (AttributeError, KeyError) as e:
if isinstance(e, AttributeError):
self._frozen_config._libc_deps_cache = {}
self._frozen_config._libc_deps_cache[eroot] = find_libc_deps(
self._frozen_config._trees_orig[eroot]["vartree"].dbapi,
False,
)
return self._frozen_config._libc_deps_cache[eroot]
def _changed_deps(self, pkg):
ebuild = None
try:
ebuild = self._pkg(pkg.cpv, "ebuild", pkg.root_config, myrepo=pkg.repo)
except PackageNotFound:
# Use first available instance of the same version.
for ebuild in self._iter_match_pkgs(
pkg.root_config, "ebuild", Atom("=" + pkg.cpv)
):
break
if ebuild is None:
changed = False
else:
if self._dynamic_config.myparams.get("bdeps") in ("y", "auto"):
depvars = Package._dep_keys
else:
depvars = Package._runtime_keys
libc_deps = self._installed_libc_deps(pkg.root)
# Use _raw_metadata, in order to avoid interaction
# with --dynamic-deps.
try:
built_deps = []
for k in depvars:
dep_struct = portage.dep.use_reduce(
pkg._raw_metadata[k],
uselist=pkg.use.enabled,
eapi=pkg.eapi,
token_class=Atom,
)
strip_slots(dep_struct)
# This strip_libc_deps call is done with non-realized deps;
# we can change that later if we're having trouble with
# matching/intersecting them.
strip_libc_deps(dep_struct, libc_deps)
built_deps.append(dep_struct)
except InvalidDependString:
changed = True
else:
unbuilt_deps = []
for k in depvars:
dep_struct = portage.dep.use_reduce(
ebuild._raw_metadata[k],
uselist=pkg.use.enabled,
eapi=ebuild.eapi,
token_class=Atom,
)
strip_slots(dep_struct)
# This strip_libc_deps call is done with non-realized deps;
# we can change that later if we're having trouble with
# matching/intersecting them.
strip_libc_deps(dep_struct, libc_deps)
unbuilt_deps.append(dep_struct)
changed = built_deps != unbuilt_deps
if (
changed
and pkg.installed
and self._dynamic_config.myparams.get("changed_deps_report")
):
self._dynamic_config._changed_deps_pkgs[pkg] = ebuild
return changed
def _changed_slot(self, pkg):
ebuild = self._equiv_ebuild(pkg)
return ebuild is not None and (ebuild.slot, ebuild.sub_slot) != (
pkg.slot,
pkg.sub_slot,
)
def _create_graph(self, allow_unsatisfied=False):
dep_stack = self._dynamic_config._dep_stack
dep_disjunctive_stack = self._dynamic_config._dep_disjunctive_stack
while dep_stack or dep_disjunctive_stack:
self._spinner_update()
while dep_stack:
dep = dep_stack.pop()
if isinstance(dep, Package):
if not self._add_pkg_deps(dep, allow_unsatisfied=allow_unsatisfied):
return 0
continue
if not self._add_dep(dep, allow_unsatisfied=allow_unsatisfied):
return 0
if dep_disjunctive_stack:
if not self._pop_disjunction(allow_unsatisfied):
return 0
return 1
def _expand_set_args(self, input_args, add_to_digraph=False):
"""
Iterate over a list of DependencyArg instances and yield all
instances given in the input together with additional SetArg
instances that are generated from nested sets.
@param input_args: An iterable of DependencyArg instances
@type input_args: Iterable
@param add_to_digraph: If True then add SetArg instances
to the digraph, in order to record parent -> child
relationships from nested sets
@type add_to_digraph: Boolean
@rtype: Iterable
@return: All args given in the input together with additional
SetArg instances that are generated from nested sets
"""
traversed_set_args = set()
for arg in input_args:
if not isinstance(arg, SetArg):
yield arg
continue
root_config = arg.root_config
depgraph_sets = self._dynamic_config.sets[root_config.root]
arg_stack = [arg]
while arg_stack:
arg = arg_stack.pop()
if arg in traversed_set_args:
continue
# If a node with the same hash already exists in
# the digraph, preserve the existing instance which
# may have a different reset_depth attribute
# (distiguishes user arguments from sets added for
# another reason such as complete mode).
arg = self._dynamic_config.digraph.get(arg, arg)
traversed_set_args.add(arg)
if add_to_digraph:
self._dynamic_config.digraph.add(
arg, None, priority=BlockerDepPriority.instance
)
yield arg
# Traverse nested sets and add them to the stack
# if they're not already in the graph. Also, graph
# edges between parent and nested sets.
for token in sorted(arg.pset.getNonAtoms()):
if not token.startswith(SETPREFIX):
continue
s = token[len(SETPREFIX) :]
nested_set = depgraph_sets.sets.get(s)
if nested_set is None:
nested_set = root_config.sets.get(s)
if nested_set is not None:
# Propagate the reset_depth attribute from
# parent set to nested set.
nested_arg = SetArg(
arg=token,
pset=nested_set,
reset_depth=arg.reset_depth,
root_config=root_config,
)
# Preserve instances already in the graph (same
# reason as for the "arg" variable above).
nested_arg = self._dynamic_config.digraph.get(
nested_arg, nested_arg
)
arg_stack.append(nested_arg)
if add_to_digraph:
self._dynamic_config.digraph.add(
nested_arg, arg, priority=BlockerDepPriority.instance
)
depgraph_sets.sets[nested_arg.name] = nested_arg.pset
def _add_dep(self, dep, allow_unsatisfied=False):
debug = "--debug" in self._frozen_config.myopts
nodeps = "--nodeps" in self._frozen_config.myopts
if dep.blocker:
# Slot collision nodes are not allowed to block other packages since
# blocker validation is only able to account for one package per slot.
is_slot_conflict_parent = any(
dep.parent in conflict.pkgs[1:]
for conflict in self._dynamic_config._package_tracker.slot_conflicts()
)
if (
not nodeps
and not dep.collapsed_priority.ignored
and not dep.collapsed_priority.optional
and not is_slot_conflict_parent
):
if dep.parent.onlydeps:
# It's safe to ignore blockers if the
# parent is an --onlydeps node.
return 1
# The blocker applies to the root where
# the parent is or will be installed.
blocker = Blocker(
atom=dep.atom,
eapi=dep.parent.eapi,
priority=dep.priority,
root=dep.parent.root,
)
self._dynamic_config._blocker_parents.add(blocker, dep.parent)
return 1
if dep.child is None:
dep_pkg, existing_node = self._select_package(
dep.root, dep.atom, onlydeps=dep.onlydeps
)
else:
# The caller has selected a specific package
# via self._minimize_packages().
dep_pkg = dep.child
existing_node = next(
self._dynamic_config._package_tracker.match(
dep.root, dep_pkg.slot_atom, installed=False
),
None,
)
if not dep_pkg:
if dep.collapsed_priority.optional or dep.collapsed_priority.ignored:
# This is an unnecessary build-time dep.
return 1
# NOTE: For removal actions, allow_unsatisfied is always
# True since all existing removal actions traverse all
# installed deps deeply via the _complete_graph method,
# which calls _create_graph with allow_unsatisfied = True.
if allow_unsatisfied:
self._dynamic_config._unsatisfied_deps.append(dep)
return 1
# The following case occurs when
# _solve_non_slot_operator_slot_conflicts calls
# _create_graph. In this case, ignore unsatisfied deps for
# installed packages only if their depth is beyond the depth
# requested by the user and the dep was initially
# unsatisfied (not broken by a slot conflict in the current
# graph). See bug #520950.
# NOTE: The value of dep.parent.depth is guaranteed to be
# either an integer or _UNREACHABLE_DEPTH, where
# _UNREACHABLE_DEPTH indicates that the parent has been
# pulled in by the _complete_graph method (rather than by
# explicit arguments or their deep dependencies). These
# cases must be distinguished because depth is meaningless
# for packages that are not reachable as deep dependencies
# of arguments.
if (
self._dynamic_config._complete_mode
and isinstance(dep.parent, Package)
and dep.parent.installed
and (
dep.parent.depth is self._UNREACHABLE_DEPTH
or (
self._frozen_config.requested_depth is not True
and dep.parent.depth >= self._frozen_config.requested_depth
)
)
):
inst_pkg, in_graph = self._select_pkg_from_installed(dep.root, dep.atom)
if inst_pkg is None:
self._dynamic_config._initially_unsatisfied_deps.append(dep)
return 1
self._dynamic_config._unsatisfied_deps_for_display.append(
((dep.root, dep.atom), {"myparent": dep.parent})
)
# The parent node should not already be in
# runtime_pkg_mask, since that would trigger an
# infinite backtracking loop.
if self._dynamic_config._allow_backtracking:
if (
dep.parent not in self._dynamic_config._runtime_pkg_mask
and dep.atom.package
and dep.atom.slot_operator_built
and self._slot_operator_unsatisfied_probe(dep)
):
self._slot_operator_unsatisfied_backtrack(dep)
return 1
# This is for backward-compatibility with previous
# behavior, so that installed packages with unsatisfied
# dependencies trigger an error message but do not
# cause the dependency calculation to fail. Only do
# this if the parent is already in the runtime package
# mask, since otherwise we need to backtrack.
if (
dep.parent.installed
and dep.parent in self._dynamic_config._runtime_pkg_mask
and not any(
self._iter_match_pkgs_any(dep.parent.root_config, dep.atom)
)
):
self._dynamic_config._initially_unsatisfied_deps.append(dep)
return 1
# Do not backtrack if only USE have to be changed in
# order to satisfy the dependency. Note that when
# want_restart_for_use_change sets the need_restart
# flag, it causes _select_pkg_highest_available to
# return None, and eventually we come through here
# and skip the "missing dependency" backtracking path.
dep_pkg, existing_node = self._select_package(
dep.root,
dep.atom.without_use if dep.atom.package else dep.atom,
onlydeps=dep.onlydeps,
)
if dep_pkg is None:
# In order to suppress the sort of aggressive
# backtracking that can trigger undesirable downgrades
# as in bug 693836, do not backtrack if there's an
# available package which was involved in a slot
# conflict and satisfied all involved parent atoms.
for (
dep_pkg,
reasons,
) in self._dynamic_config._runtime_pkg_mask.items():
if (
dep.atom.match(dep_pkg)
and len(reasons) == 1
and not reasons.get("slot conflict", True)
):
self._dynamic_config._skip_restart = True
return 0
self._dynamic_config._backtrack_infos["missing dependency"] = dep
self._dynamic_config._need_restart = True
if debug:
msg = []
msg.append("")
msg.append("")
msg.append("backtracking due to unsatisfied dep:")
msg.append(f" parent: {dep.parent}")
msg.append(f" priority: {dep.priority}")
msg.append(f" root: {dep.root}")
msg.append(f" atom: {dep.atom}")
msg.append("")
writemsg_level(
"".join(f"{l}\n" for l in msg),
noiselevel=-1,
level=logging.DEBUG,
)
return 0
self._rebuild.add(dep_pkg, dep)
ignore = (
dep.collapsed_priority.ignored
and not self._dynamic_config._traverse_ignored_deps
)
if not ignore and not self._add_pkg(dep_pkg, dep):
return 0
return 1
def _check_slot_conflict(self, pkg, atom):
existing_node = next(
self._dynamic_config._package_tracker.match(
pkg.root, pkg.slot_atom, installed=False
),
None,
)
matches = None
if existing_node:
matches = pkg.cpv == existing_node.cpv
if pkg != existing_node and atom is not None:
matches = atom.match(
existing_node.with_use(self._pkg_use_enabled(existing_node))
)
return (existing_node, matches)
def _add_pkg(self, pkg, dep):
"""
Adds a package to the depgraph, queues dependencies, and handles
slot conflicts.
"""
debug = "--debug" in self._frozen_config.myopts
myparent = None
priority = None
depth = 0
if dep is None:
dep = Dependency()
else:
myparent = dep.parent
priority = dep.priority
depth = dep.depth
if priority is None:
priority = DepPriority()
if debug:
writemsg_level(
f"\n{'Child:':15}{pkg} "
+ str(
pkg_use_display(
pkg,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(pkg),
)
)
+ "\n",
level=logging.DEBUG,
noiselevel=-1,
)
if isinstance(myparent, (PackageArg, AtomArg)):
# For PackageArg and AtomArg types, it's
# redundant to display the atom attribute.
writemsg_level(
f"{'Parent Dep:'.ljust(15)}{myparent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
else:
# Display the specific atom from SetArg or
# Package types.
uneval = ""
if (
dep.atom
and dep.atom.package
and dep.atom is not dep.atom.unevaluated_atom
):
uneval = f" ({dep.atom.unevaluated_atom})"
writemsg_level(
f"{'Parent Dep:':15}{dep.atom}{uneval} required by {myparent}\n",
level=logging.DEBUG,
noiselevel=-1,
)
# Ensure that the dependencies of the same package
# are never processed more than once.
previously_added = pkg in self._dynamic_config.digraph
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
arg_atoms = None
if True:
try:
arg_atoms = list(self._iter_atoms_for_pkg(pkg))
except portage.exception.InvalidDependString as e:
if not pkg.installed:
# should have been masked before it was selected
raise
del e
# NOTE: REQUIRED_USE checks are delayed until after
# package selection, since we want to prompt the user
# for USE adjustment rather than have REQUIRED_USE
# affect package selection and || dep choices.
if (
not pkg.built
and pkg._metadata.get("REQUIRED_USE")
and eapi_has_required_use(pkg.eapi)
):
required_use_is_sat = check_required_use(
pkg._metadata["REQUIRED_USE"],
self._pkg_use_enabled(pkg),
pkg.iuse.is_valid_flag,
eapi=pkg.eapi,
)
if not required_use_is_sat:
if dep.atom is not None and dep.parent is not None:
self._add_parent_atom(pkg, (dep.parent, dep.atom))
if arg_atoms:
for parent_atom in arg_atoms:
parent, atom = parent_atom
self._add_parent_atom(pkg, parent_atom)
atom = dep.atom
if atom is None:
atom = Atom("=" + pkg.cpv)
self._dynamic_config._unsatisfied_deps_for_display.append(
((pkg.root, atom), {"myparent": dep.parent, "show_req_use": pkg})
)
self._dynamic_config._required_use_unsatisfied = True
self._dynamic_config._skip_restart = True
# Add pkg to digraph in order to enable autounmask messages
# for this package, which is useful when autounmask USE
# changes have violated REQUIRED_USE.
self._dynamic_config.digraph.add(pkg, dep.parent, priority=priority)
return 0
if not pkg.onlydeps:
existing_node, existing_node_matches = self._check_slot_conflict(
pkg, dep.atom
)
if existing_node:
if existing_node_matches:
# The existing node can be reused.
if pkg != existing_node:
pkg = existing_node
previously_added = True
try:
arg_atoms = list(self._iter_atoms_for_pkg(pkg))
except InvalidDependString as e:
if not pkg.installed:
# should have been masked before
# it was selected
raise
if debug:
writemsg_level(
f"{'Re-used Child:':15}{pkg} "
+ str(
pkg_use_display(
pkg,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(pkg),
)
)
+ "\n",
level=logging.DEBUG,
noiselevel=-1,
)
elif (
pkg.installed
and isinstance(myparent, Package)
and pkg.root == myparent.root
and pkg.slot_atom == myparent.slot_atom
):
# If the parent package is replacing the child package then
# there's no slot conflict. Since the child will be replaced,
# do not add it to the graph. No attempt will be made to
# satisfy its dependencies, which is unsafe if it has any
# missing dependencies, as discussed in bug 199856.
if debug:
writemsg_level(
f"{'Replace Child:':15}{pkg} "
+ str(
pkg_use_display(
pkg,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(pkg),
)
)
+ "\n",
level=logging.DEBUG,
noiselevel=-1,
)
return 1
else:
if debug:
writemsg_level(
f"{'Slot Conflict:':15}{existing_node} "
+ str(
pkg_use_display(
existing_node,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(existing_node),
)
)
+ "\n",
level=logging.DEBUG,
noiselevel=-1,
)
if not previously_added:
self._dynamic_config._package_tracker.add_pkg(pkg)
self._dynamic_config._filtered_trees[pkg.root][
"porttree"
].dbapi._clear_cache()
self._check_masks(pkg)
self._prune_highest_pkg_cache(pkg)
if not pkg.installed:
# Allow this package to satisfy old-style virtuals in case it
# doesn't already. Any pre-existing providers will be preferred
# over this one.
try:
pkgsettings.setinst(pkg.cpv, pkg._metadata)
# For consistency, also update the global virtuals.
settings = self._frozen_config.roots[pkg.root].settings
settings.unlock()
settings.setinst(pkg.cpv, pkg._metadata)
settings.lock()
except portage.exception.InvalidDependString:
if not pkg.installed:
# should have been masked before it was selected
raise
if arg_atoms:
self._dynamic_config._set_nodes.add(pkg)
# Do this even for onlydeps, so that the
# parent/child relationship is always known in case
# self._show_slot_collision_notice() needs to be called later.
# If a direct circular dependency is not an unsatisfied
# buildtime dependency then drop it here since otherwise
# it can skew the merge order calculation in an unwanted
# way.
if pkg != dep.parent or (priority.buildtime and not priority.satisfied):
self._dynamic_config.digraph.add(pkg, dep.parent, priority=priority)
if dep.atom is not None and dep.parent is not None:
self._add_parent_atom(pkg, (dep.parent, dep.atom))
if arg_atoms:
for parent_atom in arg_atoms:
parent, atom = parent_atom
self._dynamic_config.digraph.add(pkg, parent, priority=priority)
self._add_parent_atom(pkg, parent_atom)
# This section determines whether we go deeper into dependencies or not.
# We want to go deeper on a few occasions:
# Installing package A, we need to make sure package A's deps are met.
# emerge --deep <pkgspec>; we need to recursively check dependencies of pkgspec
# If we are in --nodeps (no recursion) mode, we obviously only check 1 level of dependencies.
if arg_atoms and depth != 0:
for parent, atom in arg_atoms:
if parent.reset_depth:
depth = 0
break
if previously_added and depth != 0 and isinstance(pkg.depth, int):
# Use pkg.depth if it is less than depth.
if isinstance(depth, int):
depth = min(pkg.depth, depth)
else:
# depth is _UNREACHABLE_DEPTH and pkg.depth is
# an int, so use the int because it's considered
# to be less than _UNREACHABLE_DEPTH.
depth = pkg.depth
pkg.depth = depth
deep = self._dynamic_config.myparams.get("deep", 0)
update = "--update" in self._frozen_config.myopts
dep.want_update = (
not self._dynamic_config._complete_mode
and (arg_atoms or update)
and not self._too_deep(depth)
)
dep.child = pkg
if (
not pkg.onlydeps
and dep.atom
and (dep.atom.soname or dep.atom.slot_operator == "=")
):
self._add_slot_operator_dep(dep)
recurse = deep is True or not self._too_deep(self._depth_increment(depth, n=1))
dep_stack = self._dynamic_config._dep_stack
if "recurse" not in self._dynamic_config.myparams:
return 1
if pkg.installed and not recurse:
dep_stack = self._dynamic_config._ignored_deps
self._spinner_update()
if not previously_added:
dep_stack.append(pkg)
return 1
def _add_installed_sonames(self, pkg):
if self._frozen_config.soname_deps_enabled and pkg.provides is not None:
for atom in pkg.provides:
self._dynamic_config._installed_sonames[(pkg.root, atom)].append(pkg)
def _add_pkg_soname_deps(self, pkg, allow_unsatisfied=False):
if self._frozen_config.soname_deps_enabled and pkg.requires is not None:
if isinstance(pkg.depth, int):
depth = pkg.depth + 1
else:
depth = pkg.depth
soname_provided = self._frozen_config.roots[
pkg.root
].settings.soname_provided
for atom in pkg.requires:
if atom in soname_provided:
continue
dep = Dependency(
atom=atom,
blocker=False,
depth=depth,
parent=pkg,
priority=self._priority(cross=self._cross(pkg.root), runtime=True),
root=pkg.root,
)
if not self._add_dep(dep, allow_unsatisfied=allow_unsatisfied):
return False
return True
def _eliminate_rebuilds(self):
"""
Compare package rebuilds/reinstalls to installed packages of the same
exact version, and eliminate unnecessary rebuilds/reinstalls triggered
solely by the @__auto_slot_operator_replace_installed__ set. This is
careful to obey the user's wishes if they have explicitly requested
for a package to be rebuilt or reinstalled for some reason.
"""
# Skip for slot conflicts since the merge list is not valid
# anyway, and possible state inconsistencies can trigger
# unexpected exceptions as in bug 922038.
if "empty" in self._dynamic_config.myparams or any(
self._dynamic_config._package_tracker.slot_conflicts()
):
return False
# Track packages that we remove from the graph during
# this method call, in order to help trace any detected
# inconsistency back to this method or some other source
# such as _solve_non_slot_operator_slot_conflicts.
removed = []
modified = False
selective = "selective" in self._dynamic_config.myparams
for root, atom in self._dynamic_config._slot_operator_replace_installed:
for pkg in self._dynamic_config._package_tracker.match(
root, atom, installed=False
):
installed_instance = self._frozen_config.trees[root][
"vartree"
].dbapi.match_pkgs(pkg.slot_atom)
if not installed_instance:
continue
installed_instance = installed_instance[0]
if installed_instance.cpv != pkg.cpv:
continue
if pkg in self._dynamic_config._reinstall_nodes:
# --newuse, --changed-use
continue
if self._dynamic_config.myparams.get("changed_slot") and (
self._changed_slot(pkg) or self._changed_slot(installed_instance)
):
continue
unsatisfied_parent = any(
not atom.match(installed_instance)
for parent, atom in self._dynamic_config._parent_atoms[pkg]
)
if unsatisfied_parent:
continue
have_arg = False
if not selective:
for parent, atom in self._dynamic_config._parent_atoms[pkg]:
if isinstance(parent, AtomArg):
have_arg = True
break
elif (
isinstance(parent, SetArg)
and parent.name
!= "__auto_slot_operator_replace_installed__"
):
have_arg = True
break
if have_arg:
continue
if (installed_instance.slot, installed_instance.sub_slot) != (
pkg.slot,
pkg.sub_slot,
):
continue
if pkg.built:
if pkg.provides != installed_instance.provides:
continue
if pkg.requires != installed_instance.requires:
continue
libc_deps = self._installed_libc_deps(pkg.root)
depvars = Package._dep_keys
try:
installed_deps = []
for k in depvars:
dep_struct = portage.dep.use_reduce(
installed_instance._raw_metadata[k],
uselist=pkg.use.enabled,
eapi=pkg.eapi,
token_class=Atom,
)
strip_libc_deps(dep_struct, libc_deps)
installed_deps.append(dep_struct)
except InvalidDependString:
continue
else:
new_deps = []
new_use = self._pkg_use_enabled(pkg)
if pkg.built:
pkg_metadata = pkg._raw_metadata
else:
pkgsettings = self._frozen_config.pkgsettings[root]
pkgsettings.setcpv(pkg)
evaluate_slot_operator_equal_deps(
pkgsettings, new_use, self._dynamic_config._graph_trees
)
pkg_metadata = pkgsettings.configdict["pkg"]
for k in depvars:
dep_struct = portage.dep.use_reduce(
pkg_metadata[k],
uselist=new_use,
eapi=pkg.eapi,
token_class=Atom,
)
strip_libc_deps(dep_struct, libc_deps)
new_deps.append(dep_struct)
if new_deps != installed_deps:
continue
modified = True
parent_atoms = []
for parent, parent_atom in self._dynamic_config._parent_atoms[pkg]:
try:
priorities = self._dynamic_config.digraph.nodes[pkg][1][parent][
:
]
except KeyError:
optional_msg = " ({} previously removed from graph)"
warnings.warn(
f"_eliminate_rebuilds inconsistency: parent priorities missing for {parent} -> {pkg} edge"
+ (
optional_msg.format("parent and child")
if parent in removed and pkg in removed
else (
optional_msg.format("parent")
if parent in removed
else (
optional_msg.format("child")
if pkg in removed
else ""
)
)
)
)
priorities = []
parent_atoms.append((parent, parent_atom, priorities))
child_parents = {}
for child in self._dynamic_config.digraph.child_nodes(pkg):
try:
priorities = self._dynamic_config.digraph.nodes[child][1][pkg][
:
]
except KeyError:
optional_msg = " ({} previously removed from graph)"
warnings.warn(
f"_eliminate_rebuilds inconsistency: parent priorities missing for {pkg} -> {child} edge"
+ (
optional_msg.format("parent and child")
if pkg in removed and child in removed
else (
optional_msg.format("parent")
if pkg in removed
else (
optional_msg.format("child")
if child in removed
else ""
)
)
)
)
priorities = []
child_parents[child] = (
[
atom
for parent, atom in self._dynamic_config._parent_atoms[
child
]
if parent is pkg
],
priorities,
)
self._remove_pkg(pkg, remove_orphans=False)
removed.append(pkg)
for parent, atom, priorities in parent_atoms:
self._add_parent_atom(installed_instance, (parent, atom))
for priority in priorities:
self._dynamic_config.digraph.add(
installed_instance,
parent,
priority=priority,
)
for child, (atoms, priorities) in child_parents.items():
for child_atom in atoms:
self._add_parent_atom(child, (installed_instance, child_atom))
for priority in priorities:
self._dynamic_config.digraph.add(
child,
installed_instance,
priority=priority,
)
return modified
def _remove_pkg(self, pkg, remove_orphans=True):
"""
Remove a package and all its then parentless digraph
children from all depgraph datastructures.
"""
debug = "--debug" in self._frozen_config.myopts
if debug:
writemsg_level(
f"Removing package: {pkg}\n", level=logging.DEBUG, noiselevel=-1
)
try:
children = [
child
for child in self._dynamic_config.digraph.child_nodes(pkg)
if child is not pkg
]
self._dynamic_config.digraph.remove(pkg)
except KeyError:
children = []
self._dynamic_config._package_tracker.discard_pkg(pkg)
self._dynamic_config._parent_atoms.pop(pkg, None)
self._dynamic_config._set_nodes.discard(pkg)
for child in children:
try:
self._dynamic_config._parent_atoms[child] = {
(parent, atom)
for (parent, atom) in self._dynamic_config._parent_atoms[child]
if parent is not pkg
}
except KeyError:
pass
# Remove slot operator dependencies.
slot_key = (pkg.root, pkg.slot_atom)
if slot_key in self._dynamic_config._slot_operator_deps:
self._dynamic_config._slot_operator_deps[slot_key] = [
dep
for dep in self._dynamic_config._slot_operator_deps[slot_key]
if dep.child is not pkg
]
if not self._dynamic_config._slot_operator_deps[slot_key]:
del self._dynamic_config._slot_operator_deps[slot_key]
# Remove blockers.
self._dynamic_config._blocker_parents.discard(pkg)
self._dynamic_config._irrelevant_blockers.discard(pkg)
self._dynamic_config._unsolvable_blockers.discard(pkg)
if self._dynamic_config._blocked_pkgs is not None:
self._dynamic_config._blocked_pkgs.discard(pkg)
self._dynamic_config._blocked_world_pkgs.pop(pkg, None)
if remove_orphans:
for child in children:
if (
child in self._dynamic_config.digraph
and not self._dynamic_config.digraph.parent_nodes(child)
):
self._remove_pkg(child)
# Clear caches.
self._dynamic_config._filtered_trees[pkg.root]["porttree"].dbapi._clear_cache()
self._dynamic_config._highest_pkg_cache.clear()
self._dynamic_config._highest_pkg_cache_cp_map.clear()
def _check_masks(self, pkg):
slot_key = (pkg.root, pkg.slot_atom)
# Check for upgrades in the same slot that are
# masked due to a LICENSE change in a newer
# version that is not masked for any other reason.
other_pkg = self._frozen_config._highest_license_masked.get(slot_key)
if other_pkg is not None and pkg < other_pkg:
self._dynamic_config._masked_license_updates.add(other_pkg)
def _add_parent_atom(self, pkg, parent_atom):
parent_atoms = self._dynamic_config._parent_atoms.get(pkg)
if parent_atoms is None:
parent_atoms = set()
self._dynamic_config._parent_atoms[pkg] = parent_atoms
parent_atoms.add(parent_atom)
def _add_slot_operator_dep(self, dep):
slot_key = (dep.root, dep.child.slot_atom)
slot_info = self._dynamic_config._slot_operator_deps.get(slot_key)
if slot_info is None:
slot_info = []
self._dynamic_config._slot_operator_deps[slot_key] = slot_info
slot_info.append(dep)
def _add_pkg_deps(self, pkg, allow_unsatisfied=False):
if not self._add_pkg_soname_deps(pkg, allow_unsatisfied=allow_unsatisfied):
return False
myroot = pkg.root
metadata = pkg._metadata
removal_action = "remove" in self._dynamic_config.myparams
eapi_attrs = _get_eapi_attrs(pkg.eapi)
edepend = {}
for k in Package._dep_keys:
edepend[k] = metadata[k]
use_enabled = self._pkg_use_enabled(pkg)
with_test_deps = (
not removal_action
and "with_test_deps" in self._dynamic_config.myparams
and pkg.depth == 0
and "test" not in use_enabled
and pkg.iuse.is_valid_flag("test")
and self._is_argument(pkg)
)
if (
not pkg.built
and "--buildpkgonly" in self._frozen_config.myopts
and "deep" not in self._dynamic_config.myparams
):
edepend["RDEPEND"] = ""
edepend["PDEPEND"] = ""
edepend["IDEPEND"] = ""
if (
pkg.onlydeps
and self._frozen_config.myopts.get("--onlydeps-with-rdeps") == "n"
):
edepend["RDEPEND"] = ""
edepend["PDEPEND"] = ""
if self._frozen_config.myopts.get("--onlydeps-with-ideps") in ("n", None):
edepend["IDEPEND"] = ""
ignore_build_time_deps = False
if pkg.built and not removal_action:
if self._dynamic_config.myparams.get("bdeps") in ("y", "auto"):
# Pull in build time deps as requested, but marked them as
# "optional" since they are not strictly required. This allows
# more freedom in the merge order calculation for solving
# circular dependencies. Don't convert to PDEPEND since that
# could make --with-bdeps=y less effective if it is used to
# adjust merge order to prevent built_with_use() calls from
# failing.
pass
else:
ignore_build_time_deps = True
if removal_action and self._dynamic_config.myparams.get("bdeps", "y") == "n":
# Removal actions never traverse ignored buildtime
# dependencies, so it's safe to discard them early.
edepend["DEPEND"] = ""
edepend["BDEPEND"] = ""
ignore_build_time_deps = True
ignore_depend_deps = ignore_build_time_deps
ignore_bdepend_deps = ignore_build_time_deps
if removal_action:
depend_root = myroot
else:
if eapi_attrs.bdepend:
depend_root = pkg.root_config.settings["ESYSROOT"]
else:
depend_root = self._frozen_config._running_root.root
root_deps = self._frozen_config.myopts.get("--root-deps")
if root_deps is not None:
if root_deps is True:
depend_root = myroot
elif root_deps == "rdeps":
ignore_depend_deps = True
# If rebuild mode is not enabled, it's safe to discard ignored
# build-time dependencies. If you want these deps to be traversed
# in "complete" mode then you need to specify --with-bdeps=y.
if not self._rebuild.rebuild:
if ignore_depend_deps:
edepend["DEPEND"] = ""
if ignore_bdepend_deps:
edepend["BDEPEND"] = ""
# Since build-time deps tend to be a superset of run-time deps, order
# dep processing such that build-time deps are popped from
# _dep_disjunctive_stack first, so that choices for build-time
# deps influence choices for run-time deps (bug 639346).
deps = (
(
myroot,
edepend["RDEPEND"],
self._priority(cross=self._cross(pkg.root), runtime=True),
),
(
self._frozen_config._running_root.root,
edepend["IDEPEND"],
self._priority(
cross=self._cross(pkg.root), installtime=True, runtime=True
),
),
(
myroot,
edepend["PDEPEND"],
self._priority(cross=self._cross(pkg.root), runtime_post=True),
),
(
depend_root,
edepend["DEPEND"],
self._priority(
cross=self._cross(pkg.root),
buildtime=True,
optional=(pkg.built or ignore_depend_deps),
ignored=ignore_depend_deps,
),
),
(
self._frozen_config._running_root.root,
edepend["BDEPEND"],
self._priority(
cross=self._cross(pkg.root),
buildtime=True,
optional=(pkg.built or ignore_bdepend_deps),
ignored=ignore_bdepend_deps,
),
),
)
debug = "--debug" in self._frozen_config.myopts
for dep_root, dep_string, dep_priority in deps:
if not dep_string:
continue
if debug:
writemsg_level(
f"\nParent: {pkg}\n", noiselevel=-1, level=logging.DEBUG
)
writemsg_level(
f"Depstring: {dep_string}\n",
noiselevel=-1,
level=logging.DEBUG,
)
writemsg_level(
f"Priority: {dep_priority}\n",
noiselevel=-1,
level=logging.DEBUG,
)
try:
if (
with_test_deps
and "test" not in use_enabled
and pkg.iuse.is_valid_flag("test")
):
test_deps = portage.dep.use_reduce(
dep_string,
uselist=use_enabled | {"test"},
is_valid_flag=pkg.iuse.is_valid_flag,
opconvert=True,
token_class=Atom,
eapi=pkg.eapi,
subset={"test"},
)
if test_deps:
test_deps = list(
self._queue_disjunctive_deps(
pkg,
dep_root,
self._priority(
cross=self._cross(pkg.root), runtime_post=True
),
test_deps,
)
)
if test_deps and not self._add_pkg_dep_string(
pkg,
dep_root,
self._priority(
cross=self._cross(pkg.root), runtime_post=True
),
test_deps,
allow_unsatisfied,
):
return 0
dep_string = portage.dep.use_reduce(
dep_string,
uselist=use_enabled,
is_valid_flag=pkg.iuse.is_valid_flag,
opconvert=True,
token_class=Atom,
eapi=pkg.eapi,
)
except portage.exception.InvalidDependString as e:
if not pkg.installed:
# should have been masked before it was selected
raise
del e
# Try again, but omit the is_valid_flag argument, since
# invalid USE conditionals are a common problem and it's
# practical to ignore this issue for installed packages.
try:
dep_string = portage.dep.use_reduce(
dep_string,
uselist=use_enabled,
opconvert=True,
token_class=Atom,
eapi=pkg.eapi,
)
except portage.exception.InvalidDependString as e:
self._dynamic_config._masked_installed.add(pkg)
del e
continue
try:
dep_string = list(
self._queue_disjunctive_deps(
pkg, dep_root, dep_priority, dep_string
)
)
except portage.exception.InvalidDependString as e:
if pkg.installed:
self._dynamic_config._masked_installed.add(pkg)
del e
continue
# should have been masked before it was selected
raise
if not dep_string:
continue
if not self._add_pkg_dep_string(
pkg, dep_root, dep_priority, dep_string, allow_unsatisfied
):
return 0
self._dynamic_config._traversed_pkg_deps.add(pkg)
return 1
def _add_pkg_dep_string(
self, pkg, dep_root, dep_priority, dep_string, allow_unsatisfied
):
_autounmask_backup = self._dynamic_config._autounmask
if dep_priority.optional or dep_priority.ignored:
# Temporarily disable autounmask for deps that
# don't necessarily need to be satisfied.
self._dynamic_config._autounmask = False
try:
return self._wrapped_add_pkg_dep_string(
pkg, dep_root, dep_priority, dep_string, allow_unsatisfied
)
finally:
self._dynamic_config._autounmask = _autounmask_backup
def _ignore_dependency(self, atom, pkg, child, dep, mypriority, recurse_satisfied):
"""
In some cases, dep_check will return deps that shouldn't
be processed any further, so they are identified and
discarded here. Try to discard as few as possible since
discarded dependencies reduce the amount of information
available for optimization of merge order.
Don't ignore dependencies if pkg has a slot operator dependency on the child
and the child has changed slot/sub_slot.
"""
if not mypriority.satisfied:
return False
slot_operator_rebuild = False
if (
atom.slot_operator == "="
and (pkg.root, pkg.slot_atom)
in self._dynamic_config._slot_operator_replace_installed
and mypriority.satisfied is not child
and mypriority.satisfied.installed
and child
and not child.installed
and (
child.slot != mypriority.satisfied.slot
or child.sub_slot != mypriority.satisfied.sub_slot
)
):
slot_operator_rebuild = True
return (
not atom.blocker
and not recurse_satisfied
and mypriority.satisfied.visible
and dep.child is not None
and not dep.child.installed
and not any(
self._dynamic_config._package_tracker.match(
dep.child.root, dep.child.slot_atom, installed=False
)
)
and not slot_operator_rebuild
)
def _wrapped_add_pkg_dep_string(
self, pkg, dep_root, dep_priority, dep_string, allow_unsatisfied
):
if isinstance(pkg.depth, int):
depth = pkg.depth + 1
else:
depth = pkg.depth
deep = self._dynamic_config.myparams.get("deep", 0)
recurse_satisfied = deep is True or depth <= deep
debug = "--debug" in self._frozen_config.myopts
strict = pkg.type_name != "installed"
if debug:
writemsg_level(f"\nParent: {pkg}\n", noiselevel=-1, level=logging.DEBUG)
dep_repr = portage.dep.paren_enclose(
dep_string, unevaluated_atom=True, opconvert=True
)
writemsg_level(
f"Depstring: {dep_repr}\n", noiselevel=-1, level=logging.DEBUG
)
writemsg_level(
f"Priority: {dep_priority}\n",
noiselevel=-1,
level=logging.DEBUG,
)
try:
selected_atoms = self._select_atoms(
dep_root,
dep_string,
myuse=self._pkg_use_enabled(pkg),
parent=pkg,
strict=strict,
priority=dep_priority,
)
except portage.exception.InvalidDependString:
if pkg.installed:
self._dynamic_config._masked_installed.add(pkg)
return 1
# should have been masked before it was selected
raise
if debug:
writemsg_level(
f"Candidates: {[str(x) for x in selected_atoms[pkg]]}\n",
noiselevel=-1,
level=logging.DEBUG,
)
root_config = self._frozen_config.roots[dep_root]
vardb = root_config.trees["vartree"].dbapi
traversed_virt_pkgs = set()
reinstall_atoms = self._frozen_config.reinstall_atoms
for atom, child in self._minimize_children(
pkg, dep_priority, root_config, selected_atoms[pkg]
):
# If this was a specially generated virtual atom
# from dep_check, map it back to the original, in
# order to avoid distortion in places like display
# or conflict resolution code.
is_virt = hasattr(atom, "_orig_atom")
atom = getattr(atom, "_orig_atom", atom)
if atom.blocker and (dep_priority.optional or dep_priority.ignored):
# For --with-bdeps, ignore build-time only blockers
# that originate from built packages.
continue
mypriority = dep_priority.copy()
if not atom.blocker:
if atom.slot_operator == "=":
if mypriority.buildtime:
mypriority.buildtime_slot_op = True
if mypriority.runtime:
mypriority.runtime_slot_op = True
inst_pkgs = [
inst_pkg
for inst_pkg in reversed(vardb.match_pkgs(atom))
if not reinstall_atoms.findAtomForPackage(
inst_pkg, modified_use=self._pkg_use_enabled(inst_pkg)
)
]
# Do not allow slotted deps to be satisfied by wrong slots.
# Otherwise, slot-operator-dependent packages may rebuild
# before the slotted package they are dependent on.
if child and atom.slot_operator == "=":
inst_pkgs = [
inst_pkg
for inst_pkg in inst_pkgs
if inst_pkg.slot == child.slot
and inst_pkg.sub_slot == child.sub_slot
]
if inst_pkgs:
for inst_pkg in inst_pkgs:
if self._pkg_visibility_check(inst_pkg):
# highest visible
mypriority.satisfied = inst_pkg
break
if not mypriority.satisfied:
# none visible, so use highest
mypriority.satisfied = inst_pkgs[0]
dep = Dependency(
atom=atom,
blocker=atom.blocker,
child=child,
depth=depth,
parent=pkg,
priority=mypriority,
root=dep_root,
)
# In some cases, dep_check will return deps that shouldn't
# be processed any further, so they are identified and
# discarded here. Try to discard as few as possible since
# discarded dependencies reduce the amount of information
# available for optimization of merge order.
ignored = False
if self._ignore_dependency(
atom, pkg, child, dep, mypriority, recurse_satisfied
):
myarg = None
try:
myarg = next(self._iter_atoms_for_pkg(dep.child), None)
except InvalidDependString:
if not dep.child.installed:
raise
if myarg is None:
# Existing child selection may not be valid unless
# it's added to the graph immediately, since "complete"
# mode may select a different child later.
ignored = True
dep.child = None
self._dynamic_config._ignored_deps.append(dep)
if not ignored:
if (
dep_priority.ignored
and not self._dynamic_config._traverse_ignored_deps
):
if is_virt and dep.child is not None:
traversed_virt_pkgs.add(dep.child)
dep.child = None
self._dynamic_config._ignored_deps.append(dep)
else:
if not self._add_dep(dep, allow_unsatisfied=allow_unsatisfied):
return 0
if is_virt and dep.child is not None:
traversed_virt_pkgs.add(dep.child)
selected_atoms.pop(pkg)
# Add selected indirect virtual deps to the graph. This
# takes advantage of circular dependency avoidance that's done
# by dep_zapdeps. We preserve actual parent/child relationships
# here in order to avoid distorting the dependency graph like
# <=portage-2.1.6.x did.
for virt_dep, atoms in selected_atoms.items():
virt_pkg = virt_dep.child
if virt_pkg not in traversed_virt_pkgs:
continue
if debug:
writemsg_level(
f"\nCandidates: {virt_pkg.cpv}: {[str(x) for x in atoms]}\n",
noiselevel=-1,
level=logging.DEBUG,
)
if not dep_priority.ignored or self._dynamic_config._traverse_ignored_deps:
inst_pkgs = [
inst_pkg
for inst_pkg in reversed(vardb.match_pkgs(virt_dep.atom))
if not reinstall_atoms.findAtomForPackage(
inst_pkg, modified_use=self._pkg_use_enabled(inst_pkg)
)
]
if inst_pkgs:
for inst_pkg in inst_pkgs:
if self._pkg_visibility_check(inst_pkg):
# highest visible
virt_dep.priority.satisfied = inst_pkg
break
if not virt_dep.priority.satisfied:
# none visible, so use highest
virt_dep.priority.satisfied = inst_pkgs[0]
if not self._add_pkg(virt_pkg, virt_dep):
return 0
for atom, child in self._minimize_children(
pkg,
self._priority(cross=self._cross(pkg.root), runtime=True),
root_config,
atoms,
):
# If this was a specially generated virtual atom
# from dep_check, map it back to the original, in
# order to avoid distortion in places like display
# or conflict resolution code.
is_virt = hasattr(atom, "_orig_atom")
atom = getattr(atom, "_orig_atom", atom)
# This is a GLEP 37 virtual, so its deps are all runtime.
mypriority = self._priority(cross=self._cross(pkg.root), runtime=True)
if not atom.blocker:
inst_pkgs = [
inst_pkg
for inst_pkg in reversed(vardb.match_pkgs(atom))
if not reinstall_atoms.findAtomForPackage(
inst_pkg, modified_use=self._pkg_use_enabled(inst_pkg)
)
]
# Do not allow slotted deps to be satisfied by wrong slots.
if child and atom.slot_operator == "=":
inst_pkgs = [
inst_pkg
for inst_pkg in inst_pkgs
if inst_pkg.slot == child.slot
and inst_pkg.sub_slot == child.sub_slot
]
if inst_pkgs:
for inst_pkg in inst_pkgs:
if self._pkg_visibility_check(inst_pkg):
# highest visible
mypriority.satisfied = inst_pkg
break
if not mypriority.satisfied:
# none visible, so use highest
mypriority.satisfied = inst_pkgs[0]
# Dependencies of virtuals are considered to have the
# same depth as the virtual itself.
dep = Dependency(
atom=atom,
blocker=atom.blocker,
child=child,
depth=virt_dep.depth,
parent=virt_pkg,
priority=mypriority,
root=dep_root,
collapsed_parent=pkg,
collapsed_priority=dep_priority,
)
ignored = False
if self._ignore_dependency(
atom, pkg, child, dep, mypriority, recurse_satisfied
):
myarg = None
try:
myarg = next(self._iter_atoms_for_pkg(dep.child), None)
except InvalidDependString:
if not dep.child.installed:
raise
if myarg is None:
ignored = True
dep.child = None
self._dynamic_config._ignored_deps.append(dep)
if not ignored:
if (
dep_priority.ignored
and not self._dynamic_config._traverse_ignored_deps
):
if is_virt and dep.child is not None:
traversed_virt_pkgs.add(dep.child)
dep.child = None
self._dynamic_config._ignored_deps.append(dep)
else:
if not self._add_dep(dep, allow_unsatisfied=allow_unsatisfied):
return 0
if is_virt and dep.child is not None:
traversed_virt_pkgs.add(dep.child)
if debug:
writemsg_level(f"\nExiting... {pkg}\n", noiselevel=-1, level=logging.DEBUG)
return 1
def _minimize_children(self, parent, priority, root_config, atoms):
"""
Selects packages to satisfy the given atoms, and minimizes the
number of selected packages. This serves to identify and eliminate
redundant package selections when multiple atoms happen to specify
a version range.
"""
atom_pkg_map = {}
for atom in atoms:
if atom.blocker:
yield (atom, None)
continue
dep_pkg, existing_node = self._select_package(
root_config.root, atom, parent=parent
)
if dep_pkg is None:
yield (atom, None)
continue
atom_pkg_map[atom] = dep_pkg
if len(atom_pkg_map) < 2:
yield from atom_pkg_map.items()
return
cp_pkg_map = {}
pkg_atom_map = {}
for atom, pkg in atom_pkg_map.items():
pkg_atom_map.setdefault(pkg, set()).add(atom)
cp_pkg_map.setdefault(pkg.cp, set()).add(pkg)
for pkgs in cp_pkg_map.values():
if len(pkgs) < 2:
for pkg in pkgs:
for atom in pkg_atom_map[pkg]:
yield (atom, pkg)
continue
# Use a digraph to identify and eliminate any
# redundant package selections.
atom_pkg_graph = digraph()
cp_atoms = set()
for pkg1 in pkgs:
for atom in pkg_atom_map[pkg1]:
cp_atoms.add(atom)
atom_pkg_graph.add(pkg1, atom)
atom_set = InternalPackageSet(
initial_atoms=(atom,), allow_repo=True
)
for pkg2 in pkgs:
if pkg2 is pkg1:
continue
if atom_set.findAtomForPackage(
pkg2, modified_use=self._pkg_use_enabled(pkg2)
):
atom_pkg_graph.add(pkg2, atom)
# In order for the following eliminate_pkg loop to produce
# deterministic results, the order of the pkgs list must
# not be random (bug 631894). Prefer to eliminate installed
# packages first, in case rebuilds are needed, and also sort
# in ascending order so that older versions are eliminated
# first.
pkgs = sorted(pkg for pkg in pkgs if pkg.installed) + sorted(
pkg for pkg in pkgs if not pkg.installed
)
for pkg in pkgs:
eliminate_pkg = True
for atom in atom_pkg_graph.parent_nodes(pkg):
if len(atom_pkg_graph.child_nodes(atom)) < 2:
eliminate_pkg = False
break
if eliminate_pkg:
atom_pkg_graph.remove(pkg)
# Yield ~, =*, < and <= atoms first, since those are more likely to
# cause slot conflicts, and we want those atoms to be displayed
# in the resulting slot conflict message (see bug #291142).
# Give similar treatment to slot/sub-slot atoms.
conflict_atoms = []
normal_atoms = []
abi_atoms = []
for atom in cp_atoms:
if atom.slot_operator_built:
abi_atoms.append(atom)
continue
conflict = False
for child_pkg in atom_pkg_graph.child_nodes(atom):
existing_node, matches = self._check_slot_conflict(child_pkg, atom)
if existing_node and not matches:
conflict = True
break
if conflict:
conflict_atoms.append(atom)
else:
normal_atoms.append(atom)
for atom in chain(abi_atoms, conflict_atoms, normal_atoms):
child_pkgs = atom_pkg_graph.child_nodes(atom)
# if more than one child, yield highest version
if len(child_pkgs) > 1:
child_pkgs.sort()
yield (atom, child_pkgs[-1])
def _queue_disjunctive_deps(
self, pkg, dep_root, dep_priority, dep_struct, _disjunctions_recursive=None
):
"""
Queue disjunctive (virtual and ||) deps in self._dynamic_config._dep_disjunctive_stack.
Yields non-disjunctive deps. Raises InvalidDependString when
necessary.
"""
disjunctions = (
[] if _disjunctions_recursive is None else _disjunctions_recursive
)
for x in dep_struct:
if isinstance(x, list):
if x and x[0] == "||":
disjunctions.append(x)
else:
yield from self._queue_disjunctive_deps(
pkg,
dep_root,
dep_priority,
x,
_disjunctions_recursive=disjunctions,
)
else:
# Note: Eventually this will check for PROPERTIES=virtual
# or whatever other metadata gets implemented for this
# purpose.
if x.cp.startswith("virtual/"):
disjunctions.append(x)
else:
yield x
if _disjunctions_recursive is None and disjunctions:
self._queue_disjunction(pkg, dep_root, dep_priority, disjunctions)
def _queue_disjunction(self, pkg, dep_root, dep_priority, dep_struct):
self._dynamic_config._dep_disjunctive_stack.append(
(pkg, dep_root, dep_priority, dep_struct)
)
def _pop_disjunction(self, allow_unsatisfied):
"""
Pop one disjunctive dep from self._dynamic_config._dep_disjunctive_stack, and use it to
populate self._dynamic_config._dep_stack.
"""
(
pkg,
dep_root,
dep_priority,
dep_struct,
) = self._dynamic_config._dep_disjunctive_stack.pop()
if not self._add_pkg_dep_string(
pkg, dep_root, dep_priority, dep_struct, allow_unsatisfied
):
return 0
return 1
def _priority(self, **kwargs):
if "remove" in self._dynamic_config.myparams:
priority_constructor = UnmergeDepPriority
else:
priority_constructor = DepPriority
return priority_constructor(**kwargs)
def _cross(self, eroot):
"""
Returns True if the ROOT for the given EROOT is not /,
or EROOT is cross-prefix.
"""
return eroot != self._frozen_config._running_root.root
def _dep_expand(self, root_config, atom_without_category):
"""
@param root_config: a root config instance
@type root_config: RootConfig
@param atom_without_category: an atom without a category component
@type atom_without_category: String
@rtype: list
@return: a list of atoms containing categories (possibly empty)
"""
null_cp = portage.dep_getkey(
insert_category_into_atom(atom_without_category, "null")
)
cat, atom_pn = portage.catsplit(null_cp)
dbs = self._dynamic_config._filtered_trees[root_config.root]["dbs"]
categories = set()
for db, pkg_type, built, installed, db_keys in dbs:
for cat in db.categories:
if db.cp_list(f"{cat}/{atom_pn}"):
categories.add(cat)
deps = []
for cat in categories:
deps.append(
Atom(
insert_category_into_atom(atom_without_category, cat),
allow_repo=True,
)
)
return deps
def _have_new_virt(self, root, atom_cp):
ret = False
for (
db,
pkg_type,
built,
installed,
db_keys,
) in self._dynamic_config._filtered_trees[root]["dbs"]:
if db.cp_list(atom_cp):
ret = True
break
return ret
def _iter_atoms_for_pkg(self, pkg):
depgraph_sets = self._dynamic_config.sets[pkg.root]
atom_arg_map = depgraph_sets.atom_arg_map
for atom in depgraph_sets.atoms.iterAtomsForPackage(pkg):
if atom.cp != pkg.cp and self._have_new_virt(pkg.root, atom.cp):
continue
visible_pkgs = self._dynamic_config._visible_pkgs[pkg.root].match_pkgs(atom)
visible_pkgs.reverse() # descending order
higher_slot = None
for visible_pkg in visible_pkgs:
if visible_pkg.cp != atom.cp:
continue
if pkg >= visible_pkg:
# This is descending order, and we're not
# interested in any versions <= pkg given.
break
if pkg.slot_atom != visible_pkg.slot_atom:
higher_slot = visible_pkg
break
if higher_slot is not None:
continue
for arg in atom_arg_map[(atom, pkg.root)]:
if isinstance(arg, PackageArg) and arg.package != pkg:
continue
yield arg, atom
def select_files(self, args):
# Use the global event loop for spinner progress
# indication during file owner lookups (bug #461412).
def spinner_cb():
self._frozen_config.spinner.update()
spinner_cb.handle = self._event_loop.call_soon(spinner_cb)
spinner_cb.handle = None
try:
spinner = self._frozen_config.spinner
if spinner is not None and spinner.update is not spinner.update_quiet:
spinner_cb.handle = self._event_loop.call_soon(spinner_cb)
return self._select_files(args)
finally:
if spinner_cb.handle is not None:
spinner_cb.handle.cancel()
def _select_files(self, myfiles):
"""Given a list of .tbz2s, .ebuilds sets, and deps, populate
self._dynamic_config._initial_arg_list and call self._resolve to create the
appropriate depgraph and return a favorite list."""
self._load_vdb()
if (
self._frozen_config.soname_deps_enabled
and "remove" not in self._dynamic_config.myparams
):
self._index_binpkgs()
debug = "--debug" in self._frozen_config.myopts
root_config = self._frozen_config.roots[self._frozen_config.target_root]
sets = root_config.sets
depgraph_sets = self._dynamic_config.sets[root_config.root]
myfavorites = []
eroot = root_config.root
root = root_config.settings["ROOT"]
vardb = self._frozen_config.trees[eroot]["vartree"].dbapi
real_vardb = self._frozen_config._trees_orig[eroot]["vartree"].dbapi
portdb = self._frozen_config.trees[eroot]["porttree"].dbapi
bindb = self._frozen_config.trees[eroot]["bintree"].dbapi
pkgsettings = self._frozen_config.pkgsettings[eroot]
args = []
onlydeps = "--onlydeps" in self._frozen_config.myopts
lookup_owners = []
for x in myfiles:
if x.endswith(SUPPORTED_XPAK_EXTENSIONS) or x.endswith(
SUPPORTED_GPKG_EXTENSIONS
):
if not os.path.exists(x):
if os.path.exists(os.path.join(pkgsettings["PKGDIR"], "All", x)):
x = os.path.join(pkgsettings["PKGDIR"], "All", x)
elif os.path.exists(os.path.join(pkgsettings["PKGDIR"], x)):
x = os.path.join(pkgsettings["PKGDIR"], x)
else:
writemsg(
"\n\n!!! Binary package '" + str(x) + "' does not exist.\n",
noiselevel=-1,
)
writemsg(
"!!! Please ensure the binpkg exists as specified.\n\n",
noiselevel=-1,
)
return 0, myfavorites
try:
binpkg_format = get_binpkg_format(x)
except InvalidBinaryPackageFormat as e:
writemsg(
colorize(
"BAD",
f"\n{e}\n",
),
noiselevel=-1,
)
continue
if binpkg_format == "xpak":
mytbz2 = portage.xpak.tbz2(x)
mykey = None
cat = mytbz2.getfile("CATEGORY")
elif binpkg_format == "gpkg":
mygpkg = portage.gpkg.gpkg(root_config.settings, None, x)
mykey = None
cat = mygpkg.get_metadata("CATEGORY")
else:
raise InvalidBinaryPackageFormat(x)
if cat is not None:
cat = _unicode_decode(
cat.strip(), encoding=_encodings["repo.content"]
)
if binpkg_format == "xpak":
mykey = cat + "/" + os.path.basename(x)[:-5]
elif binpkg_format == "gpkg":
mykey = cat + "/" + os.path.basename(x)[:-9]
else:
raise InvalidBinaryPackageFormat(x)
if mykey is None:
writemsg(
colorize(
"BAD",
f"\n*** Package is missing CATEGORY metadata: {x}.\n\n",
),
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, myfavorites
x = os.path.realpath(x)
for pkg in self._iter_match_pkgs(
root_config, "binary", Atom(f"={mykey}")
):
if x == os.path.realpath(bindb.bintree.getname(pkg.cpv)):
break
else:
writemsg(
"\n"
+ colorize(
"BAD",
f"*** You need to adjust PKGDIR to emerge this package: {x}",
)
+ "\n\n",
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, myfavorites
args.append(PackageArg(arg=x, package=pkg, root_config=root_config))
elif x.endswith(".ebuild"):
ebuild_path = portage.util.normalize_path(os.path.abspath(x))
pkgdir = os.path.dirname(ebuild_path)
tree_root = os.path.dirname(os.path.dirname(pkgdir))
cp = pkgdir[len(tree_root) + 1 :]
error_msg = (
f"\n\n!!! '{x}' is not in a valid ebuild repository "
"hierarchy or does not exist\n"
)
if not portage.isvalidatom(cp):
writemsg(error_msg, noiselevel=-1)
return 0, myfavorites
cat = portage.catsplit(cp)[0]
mykey = cat + "/" + os.path.basename(ebuild_path[:-7])
if not portage.isvalidatom("=" + mykey):
writemsg(error_msg, noiselevel=-1)
return 0, myfavorites
ebuild_path = portdb.findname(mykey)
if ebuild_path:
if ebuild_path != os.path.join(
os.path.realpath(tree_root), cp, os.path.basename(ebuild_path)
):
writemsg(
colorize(
"BAD",
"\n*** You need to adjust repos.conf to emerge this package.\n\n",
),
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, myfavorites
if mykey not in portdb.xmatch(
"match-visible", portage.cpv_getkey(mykey)
):
writemsg(
colorize(
"BAD",
"\n*** You are emerging a masked package. It is MUCH better to use\n",
),
noiselevel=-1,
)
writemsg(
colorize(
"BAD",
"*** /etc/portage/package.* to accomplish this. See portage(5) man\n",
),
noiselevel=-1,
)
writemsg(
colorize("BAD", "*** page for details.\n"), noiselevel=-1
)
countdown(
int(self._frozen_config.settings["EMERGE_WARNING_DELAY"]),
"Continuing...",
)
else:
writemsg(error_msg, noiselevel=-1)
return 0, myfavorites
pkg = self._pkg(
mykey,
"ebuild",
root_config,
onlydeps=onlydeps,
myrepo=portdb.getRepositoryName(
os.path.dirname(os.path.dirname(os.path.dirname(ebuild_path)))
),
)
args.append(PackageArg(arg=x, package=pkg, root_config=root_config))
elif x.startswith(os.path.sep):
if not x.startswith(eroot):
portage.writemsg(
f"\n\n!!! '{x}' does not start with $EROOT.\n",
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, []
# Queue these up since it's most efficient to handle
# multiple files in a single iter_owners() call.
lookup_owners.append(x)
elif x.startswith("." + os.sep) or x.startswith(".." + os.sep):
f = os.path.abspath(x)
if not f.startswith(eroot):
portage.writemsg(
f"\n\n!!! '{f}' (resolved from '{x}') does not start with $EROOT.\n",
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, []
lookup_owners.append(f)
else:
if x in ("system", "world"):
x = SETPREFIX + x
if x.startswith(SETPREFIX):
s = x[len(SETPREFIX) :]
if s not in sets:
raise portage.exception.PackageSetNotFound(s)
if s in depgraph_sets.sets:
continue
try:
set_atoms = root_config.setconfig.getSetAtoms(s)
except portage.exception.PackageSetNotFound as e:
writemsg_level("\n\n", level=logging.ERROR, noiselevel=-1)
for pset in list(depgraph_sets.sets.values()) + [sets[s]]:
for error_msg in pset.errors:
writemsg_level(
f"{error_msg}\n",
level=logging.ERROR,
noiselevel=-1,
)
writemsg_level(
f"emerge: the given set '{s}' contains a non-existent set named "
f"'{e}'.\n",
level=logging.ERROR,
noiselevel=-1,
)
if (
s in ("world", "selected")
and SETPREFIX + e.value in sets["selected"]
):
writemsg_level(
f"Use `emerge --deselect {SETPREFIX}{e}` to remove this set from "
"world_sets.\n",
level=logging.ERROR,
noiselevel=-1,
)
writemsg_level("\n", level=logging.ERROR, noiselevel=-1)
return False, myfavorites
pset = sets[s]
depgraph_sets.sets[s] = pset
args.append(SetArg(arg=x, pset=pset, root_config=root_config))
continue
if not is_valid_package_atom(x, allow_repo=True):
portage.writemsg(
f"\n\n!!! '{x}' is not a valid package atom.\n", noiselevel=-1
)
portage.writemsg("!!! Please check ebuild(5) for full details.\n")
portage.writemsg(
"!!! (Did you specify a version but forget to prefix with '='?)\n"
)
self._dynamic_config._skip_restart = True
return (0, [])
# Don't expand categories or old-style virtuals here unless
# necessary. Expansion of old-style virtuals here causes at
# least the following problems:
# 1) It's more difficult to determine which set(s) an atom
# came from, if any.
# 2) It takes away freedom from the resolver to choose other
# possible expansions when necessary.
if "/" in x.split(":")[0]:
args.append(
AtomArg(
arg=x,
atom=Atom(x, allow_repo=True),
root_config=root_config,
)
)
continue
expanded_atoms = self._dep_expand(root_config, x)
installed_cp_set = set()
for atom in expanded_atoms:
if vardb.cp_list(atom.cp):
installed_cp_set.add(atom.cp)
if len(installed_cp_set) > 1:
non_virtual_cps = set()
for atom_cp in installed_cp_set:
if not atom_cp.startswith("virtual/"):
non_virtual_cps.add(atom_cp)
if len(non_virtual_cps) == 1:
installed_cp_set = non_virtual_cps
# If a non-virtual package and one or more virtual packages
# are in expanded_atoms, use the non-virtual package.
if len(expanded_atoms) > 1:
number_of_virtuals = 0
for expanded_atom in expanded_atoms:
if expanded_atom.cp.startswith(
("acct-group/", "acct-user/", "virtual/")
):
number_of_virtuals += 1
else:
candidate = expanded_atom
if len(expanded_atoms) - number_of_virtuals == 1:
expanded_atoms = [candidate]
if len(expanded_atoms) > 1:
writemsg("\n\n", noiselevel=-1)
ambiguous_package_name(
x,
expanded_atoms,
root_config,
self._frozen_config.spinner,
self._frozen_config.myopts,
)
self._dynamic_config._skip_restart = True
return False, myfavorites
if expanded_atoms:
atom = expanded_atoms[0]
else:
null_atom = Atom(
insert_category_into_atom(x, "null"), allow_repo=True
)
cat, atom_pn = portage.catsplit(null_atom.cp)
virts_p = root_config.settings.get_virts_p().get(atom_pn)
if virts_p:
# Allow the depgraph to choose which virtual.
atom = Atom(
null_atom.replace("null/", "virtual/", 1), allow_repo=True
)
else:
atom = null_atom
if atom.use and atom.use.conditional:
writemsg(
f"\n\n!!! '{x}' contains a conditional which is not allowed.\n",
noiselevel=-1,
)
writemsg("!!! Please check ebuild(5) for full details.\n")
self._dynamic_config._skip_restart = True
return (0, [])
args.append(AtomArg(arg=x, atom=atom, root_config=root_config))
if lookup_owners:
relative_paths = []
search_for_multiple = False
if len(lookup_owners) > 1:
search_for_multiple = True
for x in lookup_owners:
if not search_for_multiple and os.path.isdir(x):
search_for_multiple = True
relative_paths.append(x[len(root) - 1 :])
owners = set()
for pkg, relative_path in real_vardb._owners.iter_owners(relative_paths):
owners.add(pkg.mycpv)
if not search_for_multiple:
break
if not owners:
portage.writemsg(
f"\n\n!!! '{lookup_owners[0]}' is not claimed by any package.\n",
noiselevel=-1,
)
self._dynamic_config._skip_restart = True
return 0, []
for cpv in owners:
pkg = vardb._pkg_str(cpv, None)
atom = Atom(f"{pkg.cp}:{pkg.slot}")
args.append(AtomArg(arg=atom, atom=atom, root_config=root_config))
if "--update" in self._frozen_config.myopts:
# In some cases, the greedy slots behavior can pull in a slot that
# the user would want to uninstall due to it being blocked by a
# newer version in a different slot. Therefore, it's necessary to
# detect and discard any that should be uninstalled. Each time
# that arguments are updated, package selections are repeated in
# order to ensure consistency with the current arguments:
#
# 1) Initialize args
# 2) Select packages and generate initial greedy atoms
# 3) Update args with greedy atoms
# 4) Select packages and generate greedy atoms again, while
# accounting for any blockers between selected packages
# 5) Update args with revised greedy atoms
self._set_args(args)
greedy_args = []
for arg in args:
greedy_args.append(arg)
if not isinstance(arg, AtomArg):
continue
for atom in self._greedy_slots(arg.root_config, arg.atom):
greedy_args.append(
AtomArg(arg=arg.arg, atom=atom, root_config=arg.root_config)
)
self._set_args(greedy_args)
del greedy_args
# Revise greedy atoms, accounting for any blockers
# between selected packages.
revised_greedy_args = []
for arg in args:
revised_greedy_args.append(arg)
if not isinstance(arg, AtomArg):
continue
for atom in self._greedy_slots(
arg.root_config, arg.atom, blocker_lookahead=True
):
revised_greedy_args.append(
AtomArg(arg=arg.arg, atom=atom, root_config=arg.root_config)
)
args = revised_greedy_args
del revised_greedy_args
args.extend(self._gen_reinstall_sets())
self._set_args(args)
myfavorites = set(myfavorites)
for arg in args:
if isinstance(arg, (AtomArg, PackageArg)):
myfavorites.add(arg.atom)
elif isinstance(arg, SetArg):
if not arg.internal:
myfavorites.add(arg.arg)
myfavorites = list(myfavorites)
if debug:
portage.writemsg("\n", noiselevel=-1)
# Order needs to be preserved since a feature of --nodeps
# is to allow the user to force a specific merge order.
self._dynamic_config._initial_arg_list = args[:]
return self._resolve(myfavorites)
def _gen_reinstall_sets(self):
atom_list = []
for root, atom in self._rebuild.rebuild_list:
atom_list.append((root, "__auto_rebuild__", atom))
for root, atom in self._rebuild.reinstall_list:
atom_list.append((root, "__auto_reinstall__", atom))
for root, atom in self._dynamic_config._slot_operator_replace_installed:
atom_list.append((root, "__auto_slot_operator_replace_installed__", atom))
set_dict = {}
for root, set_name, atom in atom_list:
set_dict.setdefault((root, set_name), []).append(atom)
for (root, set_name), atoms in set_dict.items():
yield SetArg(
arg=(SETPREFIX + set_name),
# Set reset_depth=False here, since we don't want these
# special sets to interact with depth calculations (see
# the emerge --deep=DEPTH option), though we want them
# to behave like normal arguments in most other respects.
pset=InternalPackageSet(initial_atoms=atoms),
force_reinstall=True,
internal=True,
reset_depth=False,
root_config=self._frozen_config.roots[root],
)
def _resolve(self, myfavorites):
"""Given self._dynamic_config._initial_arg_list, pull in the root nodes,
call self._creategraph to process theier deps and return
a favorite list."""
debug = "--debug" in self._frozen_config.myopts
onlydeps = "--onlydeps" in self._frozen_config.myopts
args = self._dynamic_config._initial_arg_list[:]
for arg in self._expand_set_args(args, add_to_digraph=True):
myroot = arg.root_config.root
pkgsettings = self._frozen_config.pkgsettings[myroot]
pprovideddict = pkgsettings.pprovideddict
virtuals = pkgsettings.getvirtuals()
for atom in sorted(arg.pset.getAtoms()):
self._spinner_update()
dep = Dependency(atom=atom, onlydeps=onlydeps, root=myroot, parent=arg)
try:
pprovided = pprovideddict.get(atom.cp)
if pprovided and portage.match_from_list(atom, pprovided):
# A provided package has been specified on the command line.
self._dynamic_config._pprovided_args.append((arg, atom))
continue
if isinstance(arg, PackageArg):
if (
not self._add_pkg(arg.package, dep)
or not self._create_graph()
):
if not self.need_restart():
writemsg(
f"\n\n!!! Problem resolving dependencies for {arg.arg}\n",
noiselevel=-1,
)
return 0, myfavorites
continue
if debug:
writemsg_level(
f"\n Arg: {arg}\n Atom: {atom}\n",
noiselevel=-1,
level=logging.DEBUG,
)
pkg, existing_node = self._select_package(
myroot, atom, onlydeps=onlydeps
)
# Is the package installed (at any version)?
if pkg and "update_if_installed" in self._dynamic_config.myparams:
package_is_installed = any(
self._iter_match_pkgs(
self._frozen_config.roots[myroot], "installed", atom
)
)
# This package isn't eligible for selection in the
# merge list as the user passed --update-if-installed
# and it isn't installed.
if not package_is_installed:
continue
if not pkg:
pprovided_match = False
for virt_choice in virtuals.get(atom.cp, []):
expanded_atom = portage.dep.Atom(
atom.replace(atom.cp, virt_choice.cp, 1)
)
pprovided = pprovideddict.get(expanded_atom.cp)
if pprovided and portage.match_from_list(
expanded_atom, pprovided
):
# A provided package has been
# specified on the command line.
self._dynamic_config._pprovided_args.append((arg, atom))
pprovided_match = True
break
if pprovided_match:
continue
excluded = False
for any_match in self._iter_match_pkgs_any(
self._frozen_config.roots[myroot], atom
):
if self._frozen_config.excluded_pkgs.findAtomForPackage(
any_match, modified_use=self._pkg_use_enabled(any_match)
):
excluded = True
break
if excluded:
continue
if not (
isinstance(arg, SetArg)
and arg.name in ("selected", "world")
):
self._dynamic_config._unsatisfied_deps_for_display.append(
((myroot, atom), {"myparent": arg})
)
return 0, myfavorites
self._dynamic_config._missing_args.append((arg, atom))
continue
if atom.cp != pkg.cp:
# For old-style virtuals, we need to repeat the
# package.provided check against the selected package.
expanded_atom = atom.replace(atom.cp, pkg.cp)
pprovided = pprovideddict.get(pkg.cp)
if pprovided and portage.match_from_list(
expanded_atom, pprovided
):
# A provided package has been
# specified on the command line.
self._dynamic_config._pprovided_args.append((arg, atom))
continue
if (
pkg.installed
and "selective" not in self._dynamic_config.myparams
and not self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
self._dynamic_config._unsatisfied_deps_for_display.append(
((myroot, atom), {"myparent": arg})
)
# Previous behavior was to bail out in this case, but
# since the dep is satisfied by the installed package,
# it's more friendly to continue building the graph
# and just show a warning message. Therefore, only bail
# out here if the atom is not from either the system or
# world set.
if not (
isinstance(arg, SetArg)
and arg.name in ("selected", "system", "world")
):
return 0, myfavorites
# Add the selected package to the graph as soon as possible
# so that later dep_check() calls can use it as feedback
# for making more consistent atom selections.
if not self._add_pkg(pkg, dep):
if self.need_restart():
pass
elif isinstance(arg, SetArg):
writemsg(
f"\n\n!!! Problem resolving dependencies for {atom} from "
f"{arg.arg}\n",
noiselevel=-1,
)
else:
writemsg(
f"\n\n!!! Problem resolving dependencies for {atom}\n",
noiselevel=-1,
)
return 0, myfavorites
except SystemExit as e:
raise # Needed else can't exit
except Exception as e:
writemsg(
f"\n\n!!! Problem in '{atom}' dependencies.\n", noiselevel=-1
)
writemsg(f"!!! {str(e)} {str(getattr(e, '__module__', None))}\n")
raise
try:
del myroot, pkgsettings, pprovideddict, virtuals
except NameError:
pass
# Now that the root packages have been added to the graph,
# process the dependencies.
if not self._create_graph():
self._apply_parent_use_changes()
return 0, myfavorites
try:
self.altlist()
except self._unknown_internal_error:
return False, myfavorites
have_slot_conflict = any(self._dynamic_config._package_tracker.slot_conflicts())
if (have_slot_conflict and not self._accept_blocker_conflicts()) or (
self._dynamic_config._allow_backtracking
and "slot conflict" in self._dynamic_config._backtrack_infos
):
return False, myfavorites
if self._rebuild.trigger_rebuilds():
backtrack_infos = self._dynamic_config._backtrack_infos
config = backtrack_infos.setdefault("config", {})
config["rebuild_list"] = self._rebuild.rebuild_list
config["reinstall_list"] = self._rebuild.reinstall_list
self._dynamic_config._need_restart = True
return False, myfavorites
if (
"config" in self._dynamic_config._backtrack_infos
and (
"slot_operator_mask_built"
in self._dynamic_config._backtrack_infos["config"]
or "slot_operator_replace_installed"
in self._dynamic_config._backtrack_infos["config"]
)
and self.need_restart()
):
return False, myfavorites
if self.need_restart():
# want_restart_for_use_change triggers this
return False, myfavorites
if (
"--fetchonly" not in self._frozen_config.myopts
and "--buildpkgonly" in self._frozen_config.myopts
):
graph_copy = self._dynamic_config.digraph.copy()
removed_nodes = set()
for node in graph_copy:
if not isinstance(node, Package) or node.operation == "nomerge":
removed_nodes.add(node)
graph_copy.difference_update(removed_nodes)
if not graph_copy.hasallzeros(
ignore_priority=DepPrioritySatisfiedRange.ignore_medium
):
self._dynamic_config._buildpkgonly_deps_unsatisfied = True
self._dynamic_config._skip_restart = True
return False, myfavorites
# Since --quickpkg-direct assumes that --quickpkg-direct-root is
# immutable, assert that there are no merge or unmerge tasks
# for --quickpkg-direct-root.
quickpkg_root = (
normalize_path(
os.path.abspath(
self._frozen_config.myopts.get(
"--quickpkg-direct-root",
self._frozen_config._running_root.settings["ROOT"],
)
)
).rstrip(os.path.sep)
+ os.path.sep
)
if (
self._frozen_config.myopts.get("--quickpkg-direct", "n") == "y"
and self._frozen_config.settings["ROOT"] != quickpkg_root
and self._frozen_config._running_root.settings["ROOT"] == quickpkg_root
):
running_root = self._frozen_config._running_root.root
for node in self._dynamic_config.digraph:
if (
isinstance(node, Package)
and node.operation in ("merge", "uninstall")
and node.root == running_root
):
self._dynamic_config._quickpkg_direct_deps_unsatisfied = True
self._dynamic_config._skip_restart = True
return False, myfavorites
if not self._dynamic_config._prune_rebuilds and (
self._ignored_binaries_autounmask_backtrack()
or (
self._dynamic_config._ENABLE_PRUNE_REBUILDS
and self._dynamic_config._slot_operator_replace_installed
and self._get_missed_updates()
)
):
config = self._dynamic_config._backtrack_infos.setdefault("config", {})
config["prune_rebuilds"] = True
self._dynamic_config._need_restart = True
return False, myfavorites
if (
self._dynamic_config._slot_operator_replace_installed
and self._eliminate_rebuilds()
):
self._dynamic_config._serialized_tasks_cache = None
try:
self.altlist()
except self._unknown_internal_error:
return False, myfavorites
# Any failures except those due to autounmask *alone* should return
# before this point, since the success_without_autounmask flag that's
# set below is reserved for cases where there are *zero* other
# problems. For reference, see backtrack_depgraph, where it skips the
# get_best_run() call when success_without_autounmask is True.
if self._have_autounmask_changes():
# We failed if the user needs to change the configuration
self._dynamic_config._success_without_autounmask = True
if (
self._frozen_config.myopts.get("--autounmask-continue") is True
and "--pretend" not in self._frozen_config.myopts
):
# This will return false if it fails or if the user
# aborts via --ask.
if self._display_autounmask(autounmask_continue=True):
self._apply_autounmask_continue_state()
self._dynamic_config._need_config_reload = True
return True, myfavorites
return False, myfavorites
# We're true here unless we are missing binaries.
return (True, myfavorites)
def _apply_autounmask_continue_state(self):
"""
Apply autounmask changes to Package instances, so that their
state will be consistent configuration file changes.
"""
for node in self._dynamic_config._serialized_tasks_cache:
if isinstance(node, Package):
effective_use = self._pkg_use_enabled(node)
if effective_use != node.use.enabled:
node._metadata["USE"] = " ".join(effective_use)
def _apply_parent_use_changes(self):
"""
For parents with unsatisfied conditional dependencies, translate
USE change suggestions into autounmask changes.
"""
if (
self._dynamic_config._unsatisfied_deps_for_display
and self._dynamic_config._autounmask
):
remaining_items = []
for item in self._dynamic_config._unsatisfied_deps_for_display:
pargs, kwargs = item
kwargs = kwargs.copy()
kwargs["collect_use_changes"] = True
if not self._show_unsatisfied_dep(*pargs, **kwargs):
remaining_items.append(item)
if len(remaining_items) != len(
self._dynamic_config._unsatisfied_deps_for_display
):
self._dynamic_config._unsatisfied_deps_for_display = remaining_items
def _set_args(self, args):
"""
Create the "__non_set_args__" package set from atoms and packages given as
arguments. This method can be called multiple times if necessary.
The package selection cache is automatically invalidated, since
arguments influence package selections.
"""
set_atoms = {}
non_set_atoms = {}
for root in self._dynamic_config.sets:
depgraph_sets = self._dynamic_config.sets[root]
depgraph_sets.sets.setdefault(
"__non_set_args__", InternalPackageSet(allow_repo=True)
).clear()
depgraph_sets.atoms.clear()
depgraph_sets.atom_arg_map.clear()
set_atoms[root] = []
non_set_atoms[root] = []
# We don't add set args to the digraph here since that
# happens at a later stage and we don't want to make
# any state changes here that aren't reversed by a
# another call to this method.
for arg in self._expand_set_args(args, add_to_digraph=False):
atom_arg_map = self._dynamic_config.sets[arg.root_config.root].atom_arg_map
if isinstance(arg, SetArg):
atom_group = set_atoms[arg.root_config.root]
else:
atom_group = non_set_atoms[arg.root_config.root]
for atom in arg.pset.getAtoms():
atom_group.append(atom)
atom_key = (atom, arg.root_config.root)
refs = atom_arg_map.get(atom_key)
if refs is None:
refs = []
atom_arg_map[atom_key] = refs
if arg not in refs:
refs.append(arg)
for root in self._dynamic_config.sets:
depgraph_sets = self._dynamic_config.sets[root]
depgraph_sets.atoms.update(
chain(set_atoms.get(root, []), non_set_atoms.get(root, []))
)
depgraph_sets.sets["__non_set_args__"].update(non_set_atoms.get(root, []))
# Invalidate the package selection cache, since
# arguments influence package selections.
self._dynamic_config._highest_pkg_cache.clear()
self._dynamic_config._highest_pkg_cache_cp_map.clear()
for trees in self._dynamic_config._filtered_trees.values():
trees["porttree"].dbapi._clear_cache()
def _greedy_slots(self, root_config, atom, blocker_lookahead=False):
"""
Return a list of slot atoms corresponding to installed slots that
differ from the slot of the highest visible match. When
blocker_lookahead is True, slot atoms that would trigger a blocker
conflict are automatically discarded, potentially allowing automatic
uninstallation of older slots when appropriate.
"""
highest_pkg, in_graph = self._select_package(root_config.root, atom)
if highest_pkg is None:
return []
vardb = root_config.trees["vartree"].dbapi
slots = set()
for cpv in vardb.match(atom):
# don't mix new virtuals with old virtuals
pkg = vardb._pkg_str(cpv, None)
if pkg.cp == highest_pkg.cp:
slots.add(pkg.slot)
slots.add(highest_pkg.slot)
if len(slots) == 1:
return []
greedy_pkgs = []
slots.remove(highest_pkg.slot)
while slots:
slot = slots.pop()
slot_atom = portage.dep.Atom(f"{highest_pkg.cp}:{slot}")
pkg, in_graph = self._select_package(root_config.root, slot_atom)
if pkg is not None and pkg.cp == highest_pkg.cp and pkg < highest_pkg:
greedy_pkgs.append(pkg)
if not greedy_pkgs:
return []
if not blocker_lookahead:
return [pkg.slot_atom for pkg in greedy_pkgs]
blockers = {}
blocker_dep_keys = Package._dep_keys
for pkg in greedy_pkgs + [highest_pkg]:
dep_str = " ".join(pkg._metadata[k] for k in blocker_dep_keys)
try:
selected_atoms = self._select_atoms(
pkg.root,
dep_str,
self._pkg_use_enabled(pkg),
parent=pkg,
strict=True,
)
except portage.exception.InvalidDependString:
continue
blocker_atoms = []
for atoms in selected_atoms.values():
blocker_atoms.extend(x for x in atoms if x.blocker)
blockers[pkg] = InternalPackageSet(initial_atoms=blocker_atoms)
if highest_pkg not in blockers:
return []
# filter packages with invalid deps
greedy_pkgs = [pkg for pkg in greedy_pkgs if pkg in blockers]
# filter packages that conflict with highest_pkg
greedy_pkgs = [
pkg
for pkg in greedy_pkgs
if not (
blockers[highest_pkg].findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
or blockers[pkg].findAtomForPackage(
highest_pkg, modified_use=self._pkg_use_enabled(highest_pkg)
)
)
]
if not greedy_pkgs:
return []
# If two packages conflict, discard the lower version.
discard_pkgs = set()
greedy_pkgs.sort(reverse=True)
for i in range(len(greedy_pkgs) - 1):
pkg1 = greedy_pkgs[i]
if pkg1 in discard_pkgs:
continue
for j in range(i + 1, len(greedy_pkgs)):
pkg2 = greedy_pkgs[j]
if pkg2 in discard_pkgs:
continue
if blockers[pkg1].findAtomForPackage(
pkg2, modified_use=self._pkg_use_enabled(pkg2)
) or blockers[pkg2].findAtomForPackage(
pkg1, modified_use=self._pkg_use_enabled(pkg1)
):
# pkg1 > pkg2
discard_pkgs.add(pkg2)
return [pkg.slot_atom for pkg in greedy_pkgs if pkg not in discard_pkgs]
def _select_atoms_from_graph(self, *pargs, **kwargs):
"""
Prefer atoms matching packages that have already been
added to the graph or those that are installed and have
not been scheduled for replacement.
"""
kwargs["trees"] = self._dynamic_config._graph_trees
return self._select_atoms_highest_available(*pargs, **kwargs)
def _select_atoms_highest_available(
self,
root,
depstring,
myuse=None,
parent=None,
strict=True,
trees=None,
priority=None,
):
"""This will raise InvalidDependString if necessary. If trees is
None then self._dynamic_config._filtered_trees is used."""
if not isinstance(depstring, list):
eapi = None
is_valid_flag = None
if parent is not None:
eapi = parent.eapi
if not parent.installed:
is_valid_flag = parent.iuse.is_valid_flag
depstring = portage.dep.use_reduce(
depstring,
uselist=myuse,
opconvert=True,
token_class=Atom,
is_valid_flag=is_valid_flag,
eapi=eapi,
)
if (
self._dynamic_config.myparams.get("ignore_built_slot_operator_deps", "n")
== "y"
and parent
and parent.built
):
ignore_built_slot_operator_deps(depstring)
pkgsettings = self._frozen_config.pkgsettings[root]
if trees is None:
trees = self._dynamic_config._filtered_trees
mytrees = trees[root]
atom_graph = digraph()
if True:
# Temporarily disable autounmask so that || preferences
# account for masking and USE settings.
_autounmask_backup = self._dynamic_config._autounmask
self._dynamic_config._autounmask = False
# backup state for restoration, in case of recursive
# calls to this method
backup_parent = self._select_atoms_parent
backup_state = mytrees.copy()
try:
# clear state from previous call, in case this
# call is recursive (we have a backup, that we
# will use to restore it later)
self._select_atoms_parent = None
mytrees.pop("pkg_use_enabled", None)
mytrees.pop("parent", None)
mytrees.pop("atom_graph", None)
mytrees.pop("circular_dependency", None)
mytrees.pop("priority", None)
mytrees["pkg_use_enabled"] = self._pkg_use_enabled
if parent is not None:
self._select_atoms_parent = parent
mytrees["parent"] = parent
mytrees["atom_graph"] = atom_graph
mytrees["circular_dependency"] = (
self._dynamic_config._circular_dependency
)
if priority is not None:
mytrees["priority"] = priority
mycheck = portage.dep_check(
depstring, None, pkgsettings, myuse=myuse, myroot=root, trees=trees
)
finally:
# restore state
self._dynamic_config._autounmask = _autounmask_backup
self._select_atoms_parent = backup_parent
mytrees.pop("pkg_use_enabled", None)
mytrees.pop("parent", None)
mytrees.pop("atom_graph", None)
mytrees.pop("circular_dependency", None)
mytrees.pop("priority", None)
mytrees.update(backup_state)
if not mycheck[0]:
raise portage.exception.InvalidDependString(mycheck[1])
if parent is None:
selected_atoms = mycheck[1]
elif parent not in atom_graph:
selected_atoms = {parent: mycheck[1]}
else:
# Recursively traversed virtual dependencies, and their
# direct dependencies, are considered to have the same
# depth as direct dependencies.
if isinstance(parent.depth, int):
virt_depth = parent.depth + 1
else:
# The depth may be None when called via
# _select_atoms_probe, or it may be
# _UNREACHABLE_DEPTH for complete mode.
virt_depth = parent.depth
chosen_atom_ids = frozenset(
chain(
(id(atom) for atom in mycheck[1]),
(
id(atom._orig_atom)
for atom in mycheck[1]
if hasattr(atom, "_orig_atom")
),
)
)
selected_atoms = OrderedDict()
node_stack = [(parent, None, None)]
traversed_nodes = set()
while node_stack:
node, node_parent, parent_atom = node_stack.pop()
traversed_nodes.add(node)
if node is parent:
k = parent
else:
if node_parent is parent:
if priority is None:
node_priority = None
else:
node_priority = priority.copy()
else:
# virtuals only have runtime deps
node_priority = self._priority(
cross=self._cross(node_parent.root), runtime=True
)
k = Dependency(
atom=parent_atom,
blocker=parent_atom.blocker,
child=node,
depth=virt_depth,
parent=node_parent,
priority=node_priority,
root=node.root,
)
child_atoms = []
selected_atoms[k] = child_atoms
for atom_node in atom_graph.child_nodes(node):
child_atom = atom_node[0]
if id(child_atom) not in chosen_atom_ids:
continue
child_atoms.append(child_atom)
for child_node in atom_graph.child_nodes(atom_node):
if child_node in traversed_nodes:
continue
if not portage.match_from_list(child_atom, [child_node]):
# Typically this means that the atom
# specifies USE deps that are unsatisfied
# by the selected package. The caller will
# record this as an unsatisfied dependency
# when necessary.
continue
node_stack.append((child_node, node, child_atom))
return selected_atoms
def _expand_virt_from_graph(self, root, atom):
if not isinstance(atom, Atom):
atom = Atom(atom)
if not atom.cp.startswith("virtual/"):
yield atom
return
any_match = False
for pkg in self._dynamic_config._package_tracker.match(root, atom):
try:
rdepend = self._select_atoms_from_graph(
pkg.root,
pkg._metadata.get("RDEPEND", ""),
myuse=self._pkg_use_enabled(pkg),
parent=pkg,
strict=False,
)
except InvalidDependString as e:
writemsg_level(
"!!! Invalid RDEPEND in "
+ f"'{pkg.root}var/db/pkg/{pkg.cpv}/RDEPEND': {e}\n",
noiselevel=-1,
level=logging.ERROR,
)
continue
for atoms in rdepend.values():
for atom in atoms:
if hasattr(atom, "_orig_atom"):
# Ignore virtual atoms since we're only
# interested in expanding the real atoms.
continue
yield atom
any_match = True
if not any_match:
yield atom
def _virt_deps_visible(self, pkg, ignore_use=False):
"""
Assumes pkg is a virtual package. Traverses virtual deps recursively
and returns True if all deps are visible, False otherwise. This is
useful for checking if it will be necessary to expand virtual slots,
for cases like bug #382557.
"""
try:
rdepend = self._select_atoms(
pkg.root,
pkg._metadata.get("RDEPEND", ""),
myuse=self._pkg_use_enabled(pkg),
parent=pkg,
priority=self._priority(cross=self._cross(pkg.root), runtime=True),
)
except InvalidDependString as e:
if not pkg.installed:
raise
writemsg_level(
"!!! Invalid RDEPEND in "
+ f"'{pkg.root}var/db/pkg/{pkg.cpv}/RDEPEND': {e}\n",
noiselevel=-1,
level=logging.ERROR,
)
return False
for atoms in rdepend.values():
for atom in atoms:
if ignore_use:
atom = atom.without_use
pkg, existing = self._select_package(pkg.root, atom)
if pkg is None or not self._pkg_visibility_check(pkg):
return False
return True
def _get_dep_chain(
self, start_node, target_atom=None, unsatisfied_dependency=False
):
"""
Returns a list of (atom, node_type) pairs that represent a dep chain.
If target_atom is None, the first package shown is pkg's parent.
If target_atom is not None the first package shown is pkg.
If unsatisfied_dependency is True, the first parent is select who's
dependency is not satisfied by 'pkg'. This is need for USE changes.
(Does not support target_atom.)
"""
traversed_nodes = set()
dep_chain = []
node = start_node
child = None
all_parents = self._dynamic_config._parent_atoms
graph = self._dynamic_config.digraph
def format_pkg(pkg):
pkg_name = f"{pkg.cpv}{_repo_separator}{pkg.repo}"
return pkg_name
if target_atom is not None and isinstance(node, Package):
affecting_use = set()
for dep_str in Package._dep_keys:
try:
affecting_use.update(
extract_affecting_use(
node._metadata[dep_str], target_atom, eapi=node.eapi
)
)
except InvalidDependString:
if not node.installed:
raise
affecting_use.difference_update(node.use.mask, node.use.force)
pkg_name = format_pkg(node)
if affecting_use:
usedep = []
for flag in affecting_use:
if flag in self._pkg_use_enabled(node):
usedep.append(flag)
else:
usedep.append("-" + flag)
pkg_name += f"[{','.join(usedep)}]"
dep_chain.append((pkg_name, node.type_name))
# To build a dep chain for the given package we take
# "random" parents form the digraph, except for the
# first package, because we want a parent that forced
# the corresponding change (i.e '>=foo-2', instead 'foo').
traversed_nodes.add(start_node)
start_node_parent_atoms = {}
for ppkg, patom in all_parents.get(node, []):
# Get a list of suitable atoms. For use deps
# (aka unsatisfied_dependency is not None) we
# need that the start_node doesn't match the atom.
if not unsatisfied_dependency or not patom.match(start_node):
start_node_parent_atoms.setdefault(patom, []).append(ppkg)
if start_node_parent_atoms:
# If there are parents in all_parents then use one of them.
# If not, then this package got pulled in by an Arg and
# will be correctly handled by the code that handles later
# packages in the dep chain.
if any(not x.package for x in start_node_parent_atoms) and any(
x.package for x in start_node_parent_atoms
):
for x in list(start_node_parent_atoms):
if not x.package:
del start_node_parent_atoms[x]
if next(iter(start_node_parent_atoms)).package:
best_match = best_match_to_list(node.cpv, start_node_parent_atoms)
else:
best_match = next(iter(start_node_parent_atoms))
child = node
for ppkg in start_node_parent_atoms[best_match]:
node = ppkg
if ppkg in self._dynamic_config._initial_arg_list:
# Stop if reached the top level of the dep chain.
break
while node is not None:
traversed_nodes.add(node)
if node not in graph:
# The parent is not in the graph due to backtracking.
break
elif isinstance(node, DependencyArg):
if graph.parent_nodes(node):
node_type = "set"
else:
node_type = "argument"
dep_chain.append((f"{node}", node_type))
elif node is not start_node:
for ppkg, patom in all_parents[child]:
if ppkg == node:
if (
child is start_node
and unsatisfied_dependency
and patom.match(child)
):
# This atom is satisfied by child, there must be another atom.
continue
atom = patom.unevaluated_atom if patom.package else patom
break
dep_strings = set()
priorities = graph.nodes[node][0].get(child)
if priorities is None:
# This edge comes from _parent_atoms and was not added to
# the graph, and _parent_atoms does not contain priorities.
for k in Package._dep_keys:
dep_strings.add(node._metadata[k])
else:
for priority in priorities:
if priority.buildtime:
for k in Package._buildtime_keys:
dep_strings.add(node._metadata[k])
if priority.runtime:
dep_strings.add(node._metadata["RDEPEND"])
dep_strings.add(node._metadata["IDEPEND"])
if priority.runtime_post:
dep_strings.add(node._metadata["PDEPEND"])
affecting_use = set()
for dep_str in dep_strings:
try:
affecting_use.update(
extract_affecting_use(dep_str, atom, eapi=node.eapi)
)
except InvalidDependString:
if not node.installed:
raise
# Don't show flags as 'affecting' if the user can't change them,
affecting_use.difference_update(node.use.mask, node.use.force)
pkg_name = format_pkg(node)
if affecting_use:
usedep = []
for flag in affecting_use:
if flag in self._pkg_use_enabled(node):
usedep.append(flag)
else:
usedep.append("-" + flag)
pkg_name += f"[{','.join(usedep)}]"
dep_chain.append((pkg_name, node.type_name))
# When traversing to parents, prefer arguments over packages
# since arguments are root nodes. Never traverse the same
# package twice, in order to prevent an infinite loop.
child = node
selected_parent = None
parent_arg = None
parent_merge = None
parent_unsatisfied = None
for parent in self._dynamic_config.digraph.parent_nodes(node):
if parent in traversed_nodes:
continue
if isinstance(parent, DependencyArg):
parent_arg = parent
else:
if isinstance(parent, Package) and parent.operation == "merge":
parent_merge = parent
if unsatisfied_dependency and node is start_node:
# Make sure that pkg doesn't satisfy parent's dependency.
# This ensures that we select the correct parent for use
# flag changes.
for ppkg, atom in all_parents[start_node]:
if parent is ppkg:
if not atom.match(start_node):
parent_unsatisfied = parent
break
else:
selected_parent = parent
if parent_unsatisfied is not None:
selected_parent = parent_unsatisfied
elif parent_merge is not None:
# Prefer parent in the merge list (bug #354747).
selected_parent = parent_merge
elif parent_arg is not None:
if self._dynamic_config.digraph.parent_nodes(parent_arg):
selected_parent = parent_arg
else:
dep_chain.append((f"{parent_arg}", "argument"))
selected_parent = None
node = selected_parent
return dep_chain
def _get_dep_chain_as_comment(self, pkg, unsatisfied_dependency=False):
dep_chain = self._get_dep_chain(
pkg, unsatisfied_dependency=unsatisfied_dependency
)
display_list = []
for node, node_type in dep_chain:
if node_type == "argument":
display_list.append(f"required by {node} (argument)")
else:
display_list.append(f"required by {node}")
msg = "# " + "\n# ".join(display_list) + "\n"
return msg
def _show_unsatisfied_dep(
self,
root,
atom,
myparent=None,
arg=None,
check_backtrack=False,
check_autounmask_breakage=False,
show_req_use=None,
collect_use_changes=False,
):
"""
When check_backtrack=True, no output is produced and
the method either returns or raises _backtrack_mask if
a matching package has been masked by backtracking.
"""
backtrack_mask = False
autounmask_broke_use_dep = False
if atom.package:
xinfo = f'"{atom.unevaluated_atom}"'
atom_without_use = atom.without_use
else:
xinfo = f'"{atom}"'
atom_without_use = None
if arg:
xinfo = f'"{arg}"'
if isinstance(myparent, AtomArg):
xinfo = f'"{myparent}"'
# Discard null/ from failed cpv_expand category expansion.
xinfo = xinfo.replace("null/", "")
if root != self._frozen_config._running_root.root:
xinfo = f"{xinfo} for {root}"
masked_packages = []
missing_use = []
missing_use_adjustable = set()
required_use_unsatisfied = []
masked_pkg_instances = set()
have_eapi_mask = False
pkgsettings = self._frozen_config.pkgsettings[root]
root_config = self._frozen_config.roots[root]
portdb = self._frozen_config.roots[root].trees["porttree"].dbapi
vardb = self._frozen_config.roots[root].trees["vartree"].dbapi
bindb = self._frozen_config.roots[root].trees["bintree"].dbapi
dbs = self._dynamic_config._filtered_trees[root]["dbs"]
use_ebuild_visibility = (
self._frozen_config.myopts.get("--use-ebuild-visibility", "n") != "n"
)
for db, pkg_type, built, installed, db_keys in dbs:
if installed:
continue
if atom.soname:
if not isinstance(db, DbapiProvidesIndex):
continue
cpv_list = db.match(atom)
elif hasattr(db, "xmatch"):
cpv_list = db.xmatch("match-all-cpv-only", atom.without_use)
else:
cpv_list = db.match(atom.without_use)
if atom.soname:
repo_list = [None]
elif atom.repo is None and hasattr(db, "getRepositories"):
repo_list = db.getRepositories(catpkg=atom.cp)
else:
repo_list = [atom.repo]
# descending order
cpv_list.reverse()
for cpv in cpv_list:
for repo in repo_list:
if not db.cpv_exists(cpv, myrepo=repo):
continue
metadata, mreasons = get_mask_info(
root_config,
cpv,
pkgsettings,
db,
pkg_type,
built,
installed,
db_keys,
myrepo=repo,
_pkg_use_enabled=self._pkg_use_enabled,
)
if metadata is not None and portage.eapi_is_supported(
metadata["EAPI"]
):
if not repo:
repo = metadata.get("repository")
pkg = self._pkg(
cpv, pkg_type, root_config, installed=installed, myrepo=repo
)
# pkg._metadata contains calculated USE for ebuilds,
# required later for getMissingLicenses.
metadata = pkg._metadata
if pkg.invalid:
# Avoid doing any operations with packages that
# have invalid metadata. It would be unsafe at
# least because it could trigger unhandled
# exceptions in places like check_required_use().
masked_packages.append(
(
root_config,
pkgsettings,
cpv,
repo,
metadata,
mreasons,
)
)
continue
if atom.soname and not atom.match(pkg):
continue
if atom_without_use is not None and not atom_without_use.match(
pkg
):
continue
if pkg in self._dynamic_config._runtime_pkg_mask:
backtrack_reasons = self._dynamic_config._runtime_pkg_mask[
pkg
]
mreasons.append(
f"backtracking: {', '.join(sorted(backtrack_reasons))}"
)
backtrack_mask = True
if (
not mreasons
and self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
mreasons = ["exclude option"]
if mreasons:
masked_pkg_instances.add(pkg)
if atom.package and atom.unevaluated_atom.use:
try:
if (
not pkg.iuse.is_valid_flag(
atom.unevaluated_atom.use.required
)
or atom.violated_conditionals(
self._pkg_use_enabled(pkg),
pkg.iuse.is_valid_flag,
).use
):
missing_use.append(pkg)
if atom.match(pkg):
autounmask_broke_use_dep = True
if not mreasons:
continue
except InvalidAtom:
writemsg(
"violated_conditionals raised "
+ f"InvalidAtom: '{atom}' parent: {myparent}",
noiselevel=-1,
)
raise
if (
not mreasons
and not pkg.built
and pkg._metadata.get("REQUIRED_USE")
and eapi_has_required_use(pkg.eapi)
):
if not check_required_use(
pkg._metadata["REQUIRED_USE"],
self._pkg_use_enabled(pkg),
pkg.iuse.is_valid_flag,
eapi=pkg.eapi,
):
required_use_unsatisfied.append(pkg)
continue
root_slot = (pkg.root, pkg.slot_atom)
if pkg.built and root_slot in self._rebuild.rebuild_list:
mreasons = ["need to rebuild from source"]
elif (
pkg.installed and root_slot in self._rebuild.reinstall_list
):
mreasons = ["need to rebuild from source"]
elif (
pkg.built
and not mreasons
and self._dynamic_config.ignored_binaries.get(pkg, {}).get(
"respect_use"
)
):
mreasons = ["use flag configuration mismatch"]
elif (
pkg.built
and not mreasons
and self._dynamic_config.ignored_binaries.get(pkg, {}).get(
"changed_deps"
)
):
mreasons = ["changed deps"]
elif (
pkg.built
and use_ebuild_visibility
and not self._equiv_ebuild_visible(pkg)
):
equiv_ebuild = self._equiv_ebuild(pkg)
if equiv_ebuild is None:
if portdb.cpv_exists(pkg.cpv):
mreasons = ["ebuild corrupt"]
else:
mreasons = ["ebuild not available"]
elif not mreasons:
mreasons = get_masking_status(
equiv_ebuild,
pkgsettings,
root_config,
use=self._pkg_use_enabled(equiv_ebuild),
)
if mreasons:
metadata = equiv_ebuild._metadata
masked_packages.append(
(root_config, pkgsettings, cpv, repo, metadata, mreasons)
)
if check_backtrack:
if backtrack_mask:
raise self._backtrack_mask()
else:
return
if check_autounmask_breakage:
if autounmask_broke_use_dep:
raise self._autounmask_breakage()
else:
return
missing_use_reasons = []
missing_iuse_reasons = []
for pkg in missing_use:
use = self._pkg_use_enabled(pkg)
missing_iuse = []
# Use the unevaluated atom here, because some flags might have gone
# lost during evaluation.
required_flags = atom.unevaluated_atom.use.required
missing_iuse = pkg.iuse.get_missing_iuse(required_flags)
mreasons = []
if missing_iuse:
mreasons.append(f"Missing IUSE: {' '.join(missing_iuse)}")
missing_iuse_reasons.append((pkg, mreasons))
else:
need_enable = sorted((atom.use.enabled - use) & pkg.iuse.all)
need_disable = sorted((atom.use.disabled & use) & pkg.iuse.all)
untouchable_flags = frozenset(chain(pkg.use.mask, pkg.use.force))
if any(
x in untouchable_flags for x in chain(need_enable, need_disable)
):
continue
missing_use_adjustable.add(pkg)
required_use = pkg._metadata.get("REQUIRED_USE")
required_use_warning = ""
if required_use:
old_use = self._pkg_use_enabled(pkg)
new_use = set(self._pkg_use_enabled(pkg))
for flag in need_enable:
new_use.add(flag)
for flag in need_disable:
new_use.discard(flag)
if check_required_use(
required_use, old_use, pkg.iuse.is_valid_flag, eapi=pkg.eapi
) and not check_required_use(
required_use, new_use, pkg.iuse.is_valid_flag, eapi=pkg.eapi
):
required_use_warning = (
", this change violates use flag constraints "
f"defined by {pkg.cpv}: "
f"'{human_readable_required_use(required_use)}'"
)
if need_enable or need_disable:
changes = []
changes.extend(colorize("red", "+" + x) for x in need_enable)
changes.extend(colorize("blue", "-" + x) for x in need_disable)
mreasons.append(
f"Change USE: {' '.join(changes)}" + required_use_warning
)
missing_use_reasons.append((pkg, mreasons))
if not missing_iuse and myparent and atom.unevaluated_atom.use.conditional:
# Lets see if the violated use deps are conditional.
# If so, suggest to change them on the parent.
# If the child package is masked then a change to
# parent USE is not a valid solution (a normal mask
# message should be displayed instead).
if pkg in masked_pkg_instances:
continue
mreasons = []
violated_atom = atom.unevaluated_atom.violated_conditionals(
self._pkg_use_enabled(pkg),
pkg.iuse.is_valid_flag,
self._pkg_use_enabled(myparent),
)
if not (violated_atom.use.enabled or violated_atom.use.disabled):
# all violated use deps are conditional
changes = []
conditional = violated_atom.use.conditional
involved_flags = set(
chain(
conditional.equal,
conditional.not_equal,
conditional.enabled,
conditional.disabled,
)
)
untouchable_flags = frozenset(
chain(myparent.use.mask, myparent.use.force)
)
if any(x in untouchable_flags for x in involved_flags):
continue
required_use = myparent._metadata.get("REQUIRED_USE")
required_use_warning = ""
if required_use:
old_use = self._pkg_use_enabled(myparent)
new_use = set(self._pkg_use_enabled(myparent))
for flag in involved_flags:
if flag in old_use:
new_use.discard(flag)
else:
new_use.add(flag)
if check_required_use(
required_use,
old_use,
myparent.iuse.is_valid_flag,
eapi=myparent.eapi,
) and not check_required_use(
required_use,
new_use,
myparent.iuse.is_valid_flag,
eapi=myparent.eapi,
):
required_use_warning = (
", this change violates use flag constraints "
f"defined by {myparent.cpv}: "
f"'{human_readable_required_use(required_use)}'"
)
target_use = {}
for flag in involved_flags:
if flag in self._pkg_use_enabled(myparent):
target_use[flag] = False
changes.append(colorize("blue", "-" + flag))
else:
target_use[flag] = True
changes.append(colorize("red", "+" + flag))
if collect_use_changes and not required_use_warning:
previous_changes = (
self._dynamic_config._needed_use_config_changes.get(
myparent
)
)
self._pkg_use_enabled(myparent, target_use=target_use)
if (
previous_changes
is not self._dynamic_config._needed_use_config_changes.get(
myparent
)
):
return True
mreasons.append(
f"Change USE: {' '.join(changes)}" + required_use_warning
)
if (myparent, mreasons) not in missing_use_reasons:
missing_use_reasons.append((myparent, mreasons))
if collect_use_changes:
return False
unmasked_use_reasons = [
(pkg, mreasons)
for (pkg, mreasons) in missing_use_reasons
if pkg not in masked_pkg_instances
]
unmasked_iuse_reasons = [
(pkg, mreasons)
for (pkg, mreasons) in missing_iuse_reasons
if pkg not in masked_pkg_instances
]
show_missing_use = False
if unmasked_use_reasons:
# Only show the latest version.
show_missing_use = []
pkg_reason = None
parent_reason = None
for pkg, mreasons in unmasked_use_reasons:
if pkg is myparent:
if parent_reason is None:
# This happens if a use change on the parent
# leads to a satisfied conditional use dep.
parent_reason = (pkg, mreasons)
elif pkg_reason is None:
# Don't rely on the first pkg in unmasked_use_reasons,
# being the highest version of the dependency.
pkg_reason = (pkg, mreasons)
if pkg_reason:
show_missing_use.append(pkg_reason)
if parent_reason:
show_missing_use.append(parent_reason)
elif unmasked_iuse_reasons:
masked_with_iuse = False
for pkg in masked_pkg_instances:
# Use atom.unevaluated here, because some flags might have gone
# lost during evaluation.
if not pkg.iuse.get_missing_iuse(atom.unevaluated_atom.use.required):
# Package(s) with required IUSE are masked,
# so display a normal masking message.
masked_with_iuse = True
break
if not masked_with_iuse:
show_missing_use = unmasked_iuse_reasons
if required_use_unsatisfied:
# If there's a higher unmasked version in missing_use_adjustable
# then we want to show that instead.
for pkg in missing_use_adjustable:
if (
pkg not in masked_pkg_instances
and pkg > required_use_unsatisfied[0]
):
required_use_unsatisfied = False
break
mask_docs = False
if show_req_use is None and required_use_unsatisfied:
# We have an unmasked package that only requires USE adjustment
# in order to satisfy REQUIRED_USE, and nothing more. We assume
# that the user wants the latest version, so only the first
# instance is displayed.
show_req_use = required_use_unsatisfied[0]
if show_req_use is not None:
pkg = show_req_use
output_cpv = pkg.cpv + _repo_separator + pkg.repo
writemsg(
"\n!!! "
+ colorize("BAD", "The ebuild selected to satisfy ")
+ colorize("INFORM", xinfo)
+ colorize("BAD", " has unmet requirements.")
+ "\n",
noiselevel=-1,
)
use_display = pkg_use_display(pkg, self._frozen_config.myopts)
writemsg(f"- {output_cpv} {use_display}\n", noiselevel=-1)
writemsg(
"\n The following REQUIRED_USE flag constraints "
+ "are unsatisfied:\n",
noiselevel=-1,
)
reduced_noise = check_required_use(
pkg._metadata["REQUIRED_USE"],
self._pkg_use_enabled(pkg),
pkg.iuse.is_valid_flag,
eapi=pkg.eapi,
).tounicode()
writemsg(
f" {human_readable_required_use(reduced_noise)}\n", noiselevel=-1
)
normalized_required_use = " ".join(pkg._metadata["REQUIRED_USE"].split())
if reduced_noise != normalized_required_use:
writemsg(
"\n The above constraints "
+ "are a subset of the following complete expression:\n",
noiselevel=-1,
)
writemsg(
f" {human_readable_required_use(normalized_required_use)}\n",
noiselevel=-1,
)
writemsg("\n", noiselevel=-1)
elif show_missing_use:
writemsg(
"\nemerge: there are no ebuilds built with USE flags to satisfy "
+ green(xinfo)
+ ".\n",
noiselevel=-1,
)
writemsg(
"!!! One of the following packages is required to complete your request:\n",
noiselevel=-1,
)
for pkg, mreasons in show_missing_use:
writemsg(
"- "
+ pkg.cpv
+ _repo_separator
+ pkg.repo
+ " ("
+ ", ".join(mreasons)
+ ")\n",
noiselevel=-1,
)
elif masked_packages:
writemsg(
"\n!!! "
+ colorize("BAD", "All ebuilds that could satisfy ")
+ colorize("INFORM", xinfo)
+ colorize("BAD", " have been masked.")
+ "\n",
noiselevel=-1,
)
writemsg(
"!!! One of the following masked packages is required to complete your request:\n",
noiselevel=-1,
)
have_eapi_mask = show_masked_packages(masked_packages)
if have_eapi_mask:
writemsg("\n", noiselevel=-1)
msg = (
"The current version of portage supports "
f"EAPI '{portage.const.EAPI}'. You must upgrade to a newer version"
" of portage before EAPI masked packages can"
" be installed."
)
writemsg("\n".join(textwrap.wrap(msg, 75)), noiselevel=-1)
writemsg("\n", noiselevel=-1)
mask_docs = True
else:
cp_exists = False
if atom.package and not atom.cp.startswith("null/"):
for pkg in self._iter_match_pkgs_any(root_config, Atom(atom.cp)):
cp_exists = True
break
if self._frozen_config.myopts.get("--usepkgonly", False):
writemsg(
f"\nemerge: there are no binary packages to satisfy {green(xinfo)}.\n",
noiselevel=-1,
)
else:
writemsg(
f"\nemerge: there are no ebuilds to satisfy {green(xinfo)}.\n",
noiselevel=-1,
)
if (
isinstance(myparent, AtomArg)
and not cp_exists
and self._frozen_config.myopts.get("--misspell-suggestions", "y") != "n"
):
writemsg("\nemerge: searching for similar names...", noiselevel=-1)
search_index = (
self._frozen_config.myopts.get("--search-index", "y") != "n"
)
# fakedbapi is indexed
dbs = [vardb]
if "--usepkgonly" not in self._frozen_config.myopts:
dbs.append(IndexedPortdb(portdb) if search_index else portdb)
if "--usepkg" in self._frozen_config.myopts:
# bindbapi is indexed
dbs.append(bindb)
matches = similar_name_search(dbs, atom)
if len(matches) == 1:
writemsg(
"\nemerge: Maybe you meant " + matches[0] + "?\n", noiselevel=-1
)
elif len(matches) > 1:
writemsg(
f"\nemerge: Maybe you meant any of these: {', '.join(matches)}?\n",
noiselevel=-1,
)
else:
# Generally, this would only happen if
# all dbapis are empty.
writemsg(" nothing similar found.\n", noiselevel=-1)
msg = []
if not isinstance(myparent, AtomArg):
# It's redundant to show parent for AtomArg since
# it's the same as 'xinfo' displayed above.
dep_chain = self._get_dep_chain(myparent, atom)
for node, node_type in dep_chain:
msg.append(
f'(dependency required by "{colorize("INFORM", str(node))}" [{node_type}])'
)
if msg:
writemsg("\n".join(msg), noiselevel=-1)
writemsg("\n", noiselevel=-1)
if mask_docs:
show_mask_docs()
writemsg("\n", noiselevel=-1)
def _iter_match_pkgs_any(self, root_config, atom, onlydeps=False):
for (
db,
pkg_type,
built,
installed,
db_keys,
) in self._dynamic_config._filtered_trees[root_config.root]["dbs"]:
yield from self._iter_match_pkgs(
root_config, pkg_type, atom, onlydeps=onlydeps
)
def _iter_match_pkgs(self, root_config, pkg_type, atom, onlydeps=False):
if atom.package:
return self._iter_match_pkgs_atom(
root_config, pkg_type, atom, onlydeps=onlydeps
)
return self._iter_match_pkgs_soname(
root_config, pkg_type, atom, onlydeps=onlydeps
)
def _iter_match_pkgs_soname(self, root_config, pkg_type, atom, onlydeps=False):
db = root_config.trees[self.pkg_tree_map[pkg_type]].dbapi
installed = pkg_type == "installed"
if isinstance(db, DbapiProvidesIndex):
# descending order
for cpv in reversed(db.match(atom)):
yield self._pkg(
cpv, pkg_type, root_config, installed=installed, onlydeps=onlydeps
)
def _iter_match_pkgs_atom(self, root_config, pkg_type, atom, onlydeps=False):
"""
Iterate over Package instances of pkg_type matching the given atom.
This does not check visibility and it also does not match USE for
unbuilt ebuilds since USE are lazily calculated after visibility
checks (to avoid the expense when possible).
"""
db = root_config.trees[self.pkg_tree_map[pkg_type]].dbapi
atom_exp = dep_expand(atom, mydb=db, settings=root_config.settings)
cp_list = db.cp_list(atom_exp.cp)
matched_something = False
installed = pkg_type == "installed"
if cp_list:
atom_set = InternalPackageSet(initial_atoms=(atom,), allow_repo=True)
# descending order
cp_list.reverse()
for cpv in cp_list:
# Call match_from_list on one cpv at a time, in order
# to avoid unnecessary match_from_list comparisons on
# versions that are never yielded from this method.
if match_from_list(atom_exp, [cpv]):
try:
pkg = self._pkg(
cpv,
pkg_type,
root_config,
installed=installed,
onlydeps=onlydeps,
myrepo=getattr(cpv, "repo", None),
)
except portage.exception.PackageNotFound:
pass
else:
# A cpv can be returned from dbapi.match() as an
# old-style virtual match even in cases when the
# package does not actually PROVIDE the virtual.
# Filter out any such false matches here.
# Make sure that cpv from the current repo satisfies the atom.
# This might not be the case if there are several repos with
# the same cpv, but different metadata keys, like SLOT.
# Also, parts of the match that require metadata access
# are deferred until we have cached the metadata in a
# Package instance.
if not atom_set.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
continue
matched_something = True
yield pkg
# USE=multislot can make an installed package appear as if
# it doesn't satisfy a slot dependency. Rebuilding the ebuild
# won't do any good as long as USE=multislot is enabled since
# the newly built package still won't have the expected slot.
# Therefore, assume that such SLOT dependencies are already
# satisfied rather than forcing a rebuild.
if (
not matched_something
and installed
and atom.slot is not None
and not atom.slot_operator_built
):
if "remove" in self._dynamic_config.myparams:
# We need to search the portdbapi, which is not in our
# normal dbs list, in order to find the real SLOT.
portdb = self._frozen_config.trees[root_config.root]["porttree"].dbapi
db_keys = list(portdb._aux_cache_keys)
dbs = [(portdb, "ebuild", False, False, db_keys)]
else:
dbs = self._dynamic_config._filtered_trees[root_config.root]["dbs"]
cp_list = db.cp_list(atom_exp.cp)
if cp_list:
atom_set = InternalPackageSet(
initial_atoms=(atom.without_slot,), allow_repo=True
)
atom_exp_without_slot = atom_exp.without_slot
cp_list.reverse()
for cpv in cp_list:
if not match_from_list(atom_exp_without_slot, [cpv]):
continue
slot_available = False
for (
other_db,
other_type,
other_built,
other_installed,
other_keys,
) in dbs:
try:
if portage.dep._match_slot(
atom, other_db._pkg_str(str(cpv), None)
):
slot_available = True
break
except (KeyError, InvalidData):
pass
if not slot_available:
continue
inst_pkg = self._pkg(
cpv,
"installed",
root_config,
installed=installed,
myrepo=atom.repo,
)
# Remove the slot from the atom and verify that
# the package matches the resulting atom.
if atom_set.findAtomForPackage(inst_pkg):
yield inst_pkg
return
def _select_pkg_highest_available(self, root, atom, onlydeps=False, parent=None):
if atom.package:
cache_key = (
root,
atom,
atom.unevaluated_atom,
onlydeps,
self._dynamic_config._autounmask,
)
self._dynamic_config._highest_pkg_cache_cp_map.setdefault(
(root, atom.cp), []
).append(cache_key)
else:
cache_key = (root, atom, onlydeps, self._dynamic_config._autounmask)
self._dynamic_config._highest_pkg_cache_cp_map.setdefault(
(root, atom), []
).append(cache_key)
ret = self._dynamic_config._highest_pkg_cache.get(cache_key)
if ret is not None:
return ret
ret = self._select_pkg_highest_available_imp(
root, atom, onlydeps=onlydeps, parent=parent
)
self._dynamic_config._highest_pkg_cache[cache_key] = ret
pkg, existing = ret
if pkg is not None:
if self._pkg_visibility_check(pkg) and not (pkg.installed and pkg.masks):
self._dynamic_config._visible_pkgs[pkg.root].cpv_inject(pkg)
return ret
def _is_argument(self, pkg):
for arg, atom in self._iter_atoms_for_pkg(pkg):
if isinstance(arg, (AtomArg, PackageArg)):
return True
return False
def _prune_highest_pkg_cache(self, pkg):
cache = self._dynamic_config._highest_pkg_cache
key_map = self._dynamic_config._highest_pkg_cache_cp_map
for cp in pkg.provided_cps:
for cache_key in key_map.pop((pkg.root, cp), []):
cache.pop(cache_key, None)
if pkg.provides is not None:
for atom in pkg.provides:
for cache_key in key_map.pop((pkg.root, atom), []):
cache.pop(cache_key, None)
def _want_installed_pkg(self, pkg):
"""
Given an installed package returned from select_pkg, return
True if the user has not explicitly requested for this package
to be replaced (typically via an atom on the command line).
"""
if self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
return True
arg = False
try:
for arg, atom in self._iter_atoms_for_pkg(pkg):
if arg.force_reinstall:
return False
except InvalidDependString:
pass
if "selective" in self._dynamic_config.myparams:
return True
return not arg
def _want_update_pkg(self, parent, pkg):
if self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
return False
arg_atoms = None
try:
arg_atoms = list(self._iter_atoms_for_pkg(pkg))
except InvalidDependString:
if not pkg.installed:
# should have been masked before it was selected
raise
depth = parent.depth or 0
if isinstance(depth, int):
depth += 1
if arg_atoms:
for arg, atom in arg_atoms:
if arg.reset_depth:
depth = 0
break
update = "--update" in self._frozen_config.myopts
return (
not self._dynamic_config._complete_mode
and (arg_atoms or update)
and not self._too_deep(depth)
)
def _will_replace_child(self, parent, root, atom):
"""
Check if a given parent package will replace a child package
for the given root and atom.
@param parent: parent package
@type parent: Package
@param root: child root
@type root: str
@param atom: child atom
@type atom: Atom
@rtype: Package
@return: child package to replace, or None
"""
if parent.root != root or parent.cp != atom.cp:
return None
for child in self._iter_match_pkgs(
self._frozen_config.roots[root], "installed", atom
):
if parent.slot_atom == child.slot_atom:
return child
return None
def _too_deep(self, depth):
"""
Check if a package depth is deeper than the max allowed depth.
@param depth: the depth of a particular package
@type depth: int or _UNREACHABLE_DEPTH
@rtype: bool
@return: True if the package is deeper than the max allowed depth
"""
deep = self._dynamic_config.myparams.get("deep", 0)
if depth is self._UNREACHABLE_DEPTH:
return True
if deep is True:
return False
# All non-integer cases are handled above,
# so both values must be int type.
return depth > deep
def _depth_increment(self, depth, n=1):
"""
Return depth + n if depth is an int, otherwise return depth.
@param depth: the depth of a particular package
@type depth: int or _UNREACHABLE_DEPTH
@param n: number to add (default is 1)
@type n: int
@rtype: int or _UNREACHABLE_DEPTH
@return: depth + 1 or _UNREACHABLE_DEPTH
"""
return depth + n if isinstance(depth, int) else depth
def _equiv_ebuild(self, pkg):
try:
return self._pkg(pkg.cpv, "ebuild", pkg.root_config, myrepo=pkg.repo)
except portage.exception.PackageNotFound:
return next(
self._iter_match_pkgs(pkg.root_config, "ebuild", Atom(f"={pkg.cpv}")),
None,
)
def _equiv_ebuild_visible(self, pkg, autounmask_level=None):
try:
pkg_eb = self._pkg(pkg.cpv, "ebuild", pkg.root_config, myrepo=pkg.repo)
except portage.exception.PackageNotFound:
pkg_eb_visible = False
for pkg_eb in self._iter_match_pkgs(
pkg.root_config, "ebuild", Atom(f"={pkg.cpv}")
):
if self._pkg_visibility_check(pkg_eb, autounmask_level):
pkg_eb_visible = True
break
if not pkg_eb_visible:
return False
else:
if not self._pkg_visibility_check(pkg_eb, autounmask_level):
return False
return True
def _equiv_binary_installed(self, pkg):
build_time = pkg.build_time
if not build_time:
return False
try:
inst_pkg = self._pkg(pkg.cpv, "installed", pkg.root_config, installed=True)
except PackageNotFound:
return False
return build_time == inst_pkg.build_time
class _AutounmaskLevel:
__slots__ = (
"allow_use_changes",
"allow_unstable_keywords",
"allow_license_changes",
"allow_missing_keywords",
"allow_unmasks",
)
def __init__(self):
self.allow_use_changes = False
self.allow_license_changes = False
self.allow_unstable_keywords = False
self.allow_missing_keywords = False
self.allow_unmasks = False
def _autounmask_levels(self):
"""
Iterate over the different allowed things to unmask.
0. USE
1. USE + license
2. USE + ~arch + license
3. USE + ~arch + license + missing keywords
4. USE + license + masks
5. USE + ~arch + license + masks
6. USE + ~arch + license + missing keywords + masks
Some thoughts:
* Do least invasive changes first.
* Try unmasking alone before unmasking + missing keywords
to avoid -9999 versions if possible
"""
if self._dynamic_config._autounmask is not True:
return
autounmask_keep_keywords = self._dynamic_config.myparams[
"autounmask_keep_keywords"
]
autounmask_keep_license = self._dynamic_config.myparams[
"autounmask_keep_license"
]
autounmask_keep_masks = self._dynamic_config.myparams["autounmask_keep_masks"]
autounmask_keep_use = self._dynamic_config.myparams["autounmask_keep_use"]
autounmask_level = self._AutounmaskLevel()
if not autounmask_keep_use:
autounmask_level.allow_use_changes = True
yield autounmask_level
if not autounmask_keep_license:
autounmask_level.allow_license_changes = True
yield autounmask_level
if not autounmask_keep_keywords:
autounmask_level.allow_unstable_keywords = True
yield autounmask_level
if not (autounmask_keep_keywords or autounmask_keep_masks):
autounmask_level.allow_unstable_keywords = True
autounmask_level.allow_missing_keywords = True
yield autounmask_level
if not autounmask_keep_masks:
# 4. USE + license + masks
# Try to respect keywords while discarding
# package.mask (see bug #463394).
autounmask_level.allow_unstable_keywords = False
autounmask_level.allow_missing_keywords = False
autounmask_level.allow_unmasks = True
yield autounmask_level
if not (autounmask_keep_keywords or autounmask_keep_masks):
autounmask_level.allow_unstable_keywords = True
for missing_keyword, unmask in ((False, True), (True, True)):
autounmask_level.allow_missing_keywords = missing_keyword
autounmask_level.allow_unmasks = unmask
yield autounmask_level
def _select_pkg_highest_available_imp(
self, root, atom, onlydeps=False, parent=None
):
pkg, existing = self._wrapped_select_pkg_highest_available_imp(
root, atom, onlydeps=onlydeps, parent=parent
)
default_selection = (pkg, existing)
if self._dynamic_config._autounmask is True:
if pkg is not None and pkg.installed and not self._want_installed_pkg(pkg):
pkg = None
# Temporarily reset _need_restart state, in order to
# avoid interference as reported in bug #459832.
earlier_need_restart = self._dynamic_config._need_restart
self._dynamic_config._need_restart = False
try:
for autounmask_level in self._autounmask_levels():
if pkg is not None:
break
pkg, existing = self._wrapped_select_pkg_highest_available_imp(
root,
atom,
onlydeps=onlydeps,
autounmask_level=autounmask_level,
parent=parent,
)
if (
pkg is not None
and pkg.installed
and not self._want_installed_pkg(pkg)
):
pkg = None
if self._dynamic_config._need_restart:
return None, None
finally:
if earlier_need_restart:
self._dynamic_config._need_restart = True
if pkg is None:
# This ensures that we can fall back to an installed package
# that may have been rejected in the autounmask path above.
return default_selection
return pkg, existing
def _pkg_visibility_check(self, pkg, autounmask_level=None, trust_graph=True):
if pkg.visible:
return True
if trust_graph and pkg in self._dynamic_config.digraph:
# Sometimes we need to temporarily disable
# dynamic_config._autounmask, but for overall
# consistency in dependency resolution, in most
# cases we want to treat packages in the graph
# as though they are visible.
return True
if not self._dynamic_config._autounmask or autounmask_level is None:
return False
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
root_config = self._frozen_config.roots[pkg.root]
mreasons = _get_masking_status(
pkg, pkgsettings, root_config, use=self._pkg_use_enabled(pkg)
)
masked_by_unstable_keywords = False
masked_by_missing_keywords = False
missing_licenses = None
masked_by_something_else = False
masked_by_p_mask = False
for reason in mreasons:
hint = reason.unmask_hint
if hint is None:
masked_by_something_else = True
elif hint.key == "unstable keyword":
masked_by_unstable_keywords = True
if hint.value == "**":
masked_by_missing_keywords = True
elif hint.key == "p_mask":
masked_by_p_mask = True
elif hint.key == "license":
missing_licenses = hint.value
else:
masked_by_something_else = True
if masked_by_something_else:
return False
if pkg in self._dynamic_config._needed_unstable_keywords:
# If the package is already keyworded, remove the mask.
masked_by_unstable_keywords = False
masked_by_missing_keywords = False
if pkg in self._dynamic_config._needed_p_mask_changes:
# If the package is already keyworded, remove the mask.
masked_by_p_mask = False
if missing_licenses:
# If the needed licenses are already unmasked, remove the mask.
missing_licenses.difference_update(
self._dynamic_config._needed_license_changes.get(pkg, set())
)
if not (masked_by_unstable_keywords or masked_by_p_mask or missing_licenses):
# Package has already been unmasked.
return True
if (
(
masked_by_unstable_keywords
and not autounmask_level.allow_unstable_keywords
)
or (
masked_by_missing_keywords
and not autounmask_level.allow_missing_keywords
)
or (masked_by_p_mask and not autounmask_level.allow_unmasks)
or (missing_licenses and not autounmask_level.allow_license_changes)
):
# We are not allowed to do the needed changes.
return False
if masked_by_unstable_keywords:
self._dynamic_config._needed_unstable_keywords.add(pkg)
backtrack_infos = self._dynamic_config._backtrack_infos
backtrack_infos.setdefault("config", {})
backtrack_infos["config"].setdefault("needed_unstable_keywords", set())
backtrack_infos["config"]["needed_unstable_keywords"].add(pkg)
if masked_by_p_mask:
self._dynamic_config._needed_p_mask_changes.add(pkg)
backtrack_infos = self._dynamic_config._backtrack_infos
backtrack_infos.setdefault("config", {})
backtrack_infos["config"].setdefault("needed_p_mask_changes", set())
backtrack_infos["config"]["needed_p_mask_changes"].add(pkg)
if missing_licenses:
self._dynamic_config._needed_license_changes.setdefault(pkg, set()).update(
missing_licenses
)
backtrack_infos = self._dynamic_config._backtrack_infos
backtrack_infos.setdefault("config", {})
backtrack_infos["config"].setdefault("needed_license_changes", set())
backtrack_infos["config"]["needed_license_changes"].add(
(pkg, frozenset(missing_licenses))
)
return True
def _pkg_use_enabled(self, pkg, target_use=None):
"""
If target_use is None, returns pkg.use.enabled + changes in _needed_use_config_changes.
If target_use is given, the need changes are computed to make the package useable.
Example: target_use = { "foo": True, "bar": False }
The flags target_use must be in the pkg's IUSE.
@rtype: frozenset
@return: set of effectively enabled USE flags, including changes
made by autounmask
"""
if pkg.built:
return pkg.use.enabled
needed_use_config_change = self._dynamic_config._needed_use_config_changes.get(
pkg
)
if target_use is None:
if needed_use_config_change is None:
return pkg.use.enabled
return needed_use_config_change[0]
if needed_use_config_change is not None:
old_use = needed_use_config_change[0]
new_use = set()
old_changes = needed_use_config_change[1]
new_changes = old_changes.copy()
else:
old_use = pkg.use.enabled
new_use = set()
old_changes = {}
new_changes = {}
for flag, state in target_use.items():
flag = pkg.iuse.get_flag(flag)
if flag is None:
# Triggered by use-dep defaults.
continue
if state:
if flag not in old_use:
if new_changes.get(flag) == False:
return old_use
new_changes[flag] = True
new_use.add(flag)
else:
if flag in old_use:
if new_changes.get(flag) == True:
return old_use
new_changes[flag] = False
new_use |= old_use.difference(target_use)
def want_restart_for_use_change(pkg, new_use):
if pkg not in self._dynamic_config.digraph.nodes:
return False
for key in Package._dep_keys + ("LICENSE",):
dep = pkg._metadata[key]
old_val = set(
portage.dep.use_reduce(
dep,
pkg.use.enabled,
is_valid_flag=pkg.iuse.is_valid_flag,
flat=True,
)
)
new_val = set(
portage.dep.use_reduce(
dep, new_use, is_valid_flag=pkg.iuse.is_valid_flag, flat=True
)
)
if old_val != new_val:
return True
parent_atoms = self._dynamic_config._parent_atoms.get(pkg)
if not parent_atoms:
return False
new_use, changes = self._dynamic_config._needed_use_config_changes.get(pkg)
for ppkg, atom in parent_atoms:
if not atom.use:
continue
# Backtrack only if changes break a USE dependency.
enabled = atom.use.enabled
disabled = atom.use.disabled
for k, v in changes.items():
want_enabled = k in enabled
if (want_enabled or k in disabled) and want_enabled != v:
return True
return False
# Always return frozenset since the result needs to be
# hashable (see bug #531112).
new_use = frozenset(new_use)
if new_changes != old_changes:
# Don't do the change if it violates REQUIRED_USE.
required_use_satisfied = True
required_use = pkg._metadata.get("REQUIRED_USE")
if (
required_use
and check_required_use(
required_use, old_use, pkg.iuse.is_valid_flag, eapi=pkg.eapi
)
and not check_required_use(
required_use, new_use, pkg.iuse.is_valid_flag, eapi=pkg.eapi
)
):
required_use_satisfied = False
if any(x in pkg.use.mask for x in new_changes) or any(
x in pkg.use.force for x in new_changes
):
return old_use
changes = _use_changes(
new_use, new_changes, required_use_satisfied=required_use_satisfied
)
self._dynamic_config._needed_use_config_changes[pkg] = changes
backtrack_infos = self._dynamic_config._backtrack_infos
backtrack_infos.setdefault("config", {})
backtrack_infos["config"].setdefault("needed_use_config_changes", [])
backtrack_infos["config"]["needed_use_config_changes"].append(
(pkg, changes)
)
if want_restart_for_use_change(pkg, new_use):
self._dynamic_config._need_restart = True
return new_use
def _wrapped_select_pkg_highest_available_imp(
self, root, atom, onlydeps=False, autounmask_level=None, parent=None
):
root_config = self._frozen_config.roots[root]
pkgsettings = self._frozen_config.pkgsettings[root]
dbs = self._dynamic_config._filtered_trees[root]["dbs"]
vardb = self._frozen_config.roots[root].trees["vartree"].dbapi
# List of acceptable packages, ordered by type preference.
matched_packages = []
highest_version = None
atom_cp = None
have_new_virt = None
if atom.package:
atom_cp = atom.cp
have_new_virt = atom_cp.startswith("virtual/") and self._have_new_virt(
root, atom_cp
)
existing_node = None
myeb = None
rebuilt_binaries = "rebuilt_binaries" in self._dynamic_config.myparams
usepkg = "--usepkg" in self._frozen_config.myopts
usepkgonly = "--usepkgonly" in self._frozen_config.myopts
usepkg_exclude_live = "--usepkg-exclude-live" in self._frozen_config.myopts
empty = "empty" in self._dynamic_config.myparams
selective = "selective" in self._dynamic_config.myparams
reinstall = False
avoid_update = "--update" not in self._frozen_config.myopts
dont_miss_updates = "--update" in self._frozen_config.myopts
use_ebuild_visibility = (
self._frozen_config.myopts.get("--use-ebuild-visibility", "n") != "n"
)
reinstall_atoms = self._frozen_config.reinstall_atoms
usepkg_exclude = self._frozen_config.usepkg_exclude
useoldpkg_atoms = self._frozen_config.useoldpkg_atoms
matched_oldpkg = []
# Behavior of the "selective" parameter depends on
# whether or not a package matches an argument atom.
# If an installed package provides an old-style
# virtual that is no longer provided by an available
# package, the installed package may match an argument
# atom even though none of the available packages do.
# Therefore, "selective" logic does not consider
# whether or not an installed package matches an
# argument atom. It only considers whether or not
# available packages match argument atoms, which is
# represented by the found_available_arg flag.
found_available_arg = False
packages_with_invalid_use_config = []
for find_existing_node in True, False:
if existing_node:
break
for db, pkg_type, built, installed, db_keys in dbs:
if existing_node:
break
if installed and not find_existing_node:
want_reinstall = (
reinstall or empty or (found_available_arg and not selective)
)
if want_reinstall and matched_packages:
continue
# For unbuilt ebuilds, ignore USE deps for the initial
# match since we want to ensure that updates aren't
# missed solely due to the user's USE configuration.
for pkg in self._iter_match_pkgs(
root_config,
pkg_type,
atom.without_use if (atom.package and not built) else atom,
onlydeps=onlydeps,
):
if have_new_virt is True and pkg.cp != atom_cp:
# pull in a new-style virtual instead
continue
if pkg in self._dynamic_config._runtime_pkg_mask:
# The package has been masked by the backtracking logic
continue
root_slot = (pkg.root, pkg.slot_atom)
if pkg.built and root_slot in self._rebuild.rebuild_list:
continue
if pkg.installed and root_slot in self._rebuild.reinstall_list:
continue
if (
empty
and pkg.installed
and not self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
# With --emptytree option we assume no packages
# are installed, so we do not select them.
# But we allow installed packages to satisfy dependency requirements
# if they're explicitly excluded, so we allow them to be selected.
continue
if (
not pkg.installed
and self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
continue
if (
built
and not installed
and usepkg_exclude.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
break
# We can choose not to install a live package from using binary
# cache by disabling it with option --usepkg-exclude-live in the
# emerge call.
if (
usepkg_exclude_live
and built
and not installed
and "live" in pkg._metadata.get("PROPERTIES", "").split()
):
continue
useoldpkg = useoldpkg_atoms.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
if (
packages_with_invalid_use_config
and (not built or not useoldpkg)
and (not pkg.installed or dont_miss_updates)
):
# Check if a higher version was rejected due to user
# USE configuration. The packages_with_invalid_use_config
# list only contains unbuilt ebuilds since USE can't
# be changed for built packages.
higher_version_rejected = False
repo_priority = pkg.repo_priority
for rejected in packages_with_invalid_use_config:
if rejected.cp != pkg.cp:
continue
if rejected > pkg:
higher_version_rejected = True
break
if portage.dep.cpvequal(rejected.cpv, pkg.cpv):
# If version is identical then compare
# repo priority (see bug #350254).
rej_repo_priority = rejected.repo_priority
if rej_repo_priority is not None and (
repo_priority is None
or rej_repo_priority > repo_priority
):
higher_version_rejected = True
break
if higher_version_rejected:
continue
cpv = pkg.cpv
reinstall_for_flags = None
if (
pkg.installed
and parent is not None
and not self._want_update_pkg(parent, pkg)
):
# Ensure that --deep=<depth> is respected even when the
# installed package is masked and --update is enabled.
pass
elif not pkg.installed or (matched_packages and not avoid_update):
# Only enforce visibility on installed packages
# if there is at least one other visible package
# available. By filtering installed masked packages
# here, packages that have been masked since they
# were installed can be automatically downgraded
# to an unmasked version. NOTE: This code needs to
# be consistent with masking behavior inside
# _dep_check_composite_db, in order to prevent
# incorrect choices in || deps like bug #351828.
if not self._pkg_visibility_check(pkg, autounmask_level):
continue
# Enable upgrade or downgrade to a version
# with visible KEYWORDS when the installed
# version is masked by KEYWORDS, but never
# reinstall the same exact version only due
# to a KEYWORDS mask. See bug #252167.
identical_binary = False
if pkg.type_name != "ebuild" and matched_packages:
# Don't re-install a binary package that is
# identical to the currently installed package
# (see bug #354441).
if usepkg and pkg.installed:
for selected_pkg in matched_packages:
if (
selected_pkg.type_name == "binary"
and selected_pkg.cpv == pkg.cpv
and selected_pkg.build_time == pkg.build_time
):
identical_binary = True
break
if (
not identical_binary
and pkg.built
and (use_ebuild_visibility or matched_packages)
):
# If the ebuild no longer exists or it's
# keywords have been dropped, reject built
# instances (installed or binary).
# If --usepkgonly is enabled, assume that
# the ebuild status should be ignored unless
# --use-ebuild-visibility has been specified.
if not use_ebuild_visibility and (usepkgonly or useoldpkg):
if pkg.installed and pkg.masks:
continue
elif not self._equiv_ebuild_visible(
pkg, autounmask_level=autounmask_level
):
continue
# Calculation of USE for unbuilt ebuilds is relatively
# expensive, so it is only performed lazily, after the
# above visibility checks are complete.
effective_parent = parent or self._select_atoms_parent
if not (
effective_parent
and self._will_replace_child(effective_parent, root, atom)
):
myarg = None
try:
for myarg, myarg_atom in self._iter_atoms_for_pkg(pkg):
if myarg.force_reinstall:
reinstall = True
break
except InvalidDependString:
if not installed:
# masked by corruption
continue
if not installed and myarg:
found_available_arg = True
if atom.package and atom.unevaluated_atom.use:
# Make sure we don't miss a 'missing IUSE'.
if pkg.iuse.get_missing_iuse(
atom.unevaluated_atom.use.required
):
# Don't add this to packages_with_invalid_use_config
# since IUSE cannot be adjusted by the user.
continue
if atom.package and atom.use is not None:
if (
autounmask_level
and autounmask_level.allow_use_changes
and not pkg.built
):
target_use = {}
for flag in atom.use.enabled:
target_use[flag] = True
for flag in atom.use.disabled:
target_use[flag] = False
use = self._pkg_use_enabled(pkg, target_use)
else:
use = self._pkg_use_enabled(pkg)
use_match = True
can_adjust_use = not pkg.built
is_valid_flag = pkg.iuse.is_valid_flag
missing_enabled = frozenset(
x for x in atom.use.missing_enabled if not is_valid_flag(x)
)
missing_disabled = frozenset(
x for x in atom.use.missing_disabled if not is_valid_flag(x)
)
if atom.use.enabled:
if any(x in atom.use.enabled for x in missing_disabled):
use_match = False
can_adjust_use = False
need_enabled = atom.use.enabled - use
if need_enabled:
need_enabled -= missing_enabled
if need_enabled:
use_match = False
if can_adjust_use:
if any(x in pkg.use.mask for x in need_enabled):
can_adjust_use = False
if atom.use.disabled:
if any(x in atom.use.disabled for x in missing_enabled):
use_match = False
can_adjust_use = False
need_disabled = atom.use.disabled & use
if need_disabled:
need_disabled -= missing_disabled
if need_disabled:
use_match = False
if can_adjust_use:
if any(
x in pkg.use.force and x not in pkg.use.mask
for x in need_disabled
):
can_adjust_use = False
if not use_match:
if can_adjust_use:
# Above we must ensure that this package has
# absolutely no use.force, use.mask, or IUSE
# issues that the user typically can't make
# adjustments to solve (see bug #345979).
# FIXME: Conditional USE deps complicate
# issues. This code currently excludes cases
# in which the user can adjust the parent
# package's USE in order to satisfy the dep.
packages_with_invalid_use_config.append(pkg)
continue
if atom_cp is None or pkg.cp == atom_cp:
if highest_version is None:
highest_version = pkg
elif pkg > highest_version:
highest_version = pkg
# At this point, we've found the highest visible
# match from the current repo. Any lower versions
# from this repo are ignored, so this so the loop
# will always end with a break statement below
# this point.
if find_existing_node:
# Use reversed iteration in order to get
# descending order here, so that the highest
# version involved in a slot conflict is
# selected. This is needed for correct operation
# of conflict_downgrade logic in the dep_zapdeps
# function (see bug 554070).
e_pkg = next(
reversed(
list(
self._dynamic_config._package_tracker.match(
root, pkg.slot_atom, installed=False
)
)
),
None,
)
if not e_pkg:
break
# Use PackageSet.findAtomForPackage()
# for PROVIDE support.
if atom.match(e_pkg.with_use(self._pkg_use_enabled(e_pkg))):
if (
highest_version
and (atom_cp is None or e_pkg.cp == atom_cp)
and e_pkg < highest_version
and e_pkg.slot_atom != highest_version.slot_atom
):
# There is a higher version available in a
# different slot, so this existing node is
# irrelevant.
pass
else:
matched_packages.append(e_pkg)
existing_node = e_pkg
break
# Compare built package to current config and
# reject the built package if necessary.
reinstall_use = (
"--newuse" in self._frozen_config.myopts
or "--reinstall" in self._frozen_config.myopts
)
changed_deps = (
self._dynamic_config.myparams.get("changed_deps", "n") != "n"
)
changed_deps_report = self._dynamic_config.myparams.get(
"changed_deps_report"
)
binpkg_changed_deps = (
self._dynamic_config.myparams.get("binpkg_changed_deps", "n")
!= "n"
)
respect_use = self._dynamic_config.myparams.get(
"binpkg_respect_use"
) in ("y", "auto")
if (
built
and not useoldpkg
and (not installed or matched_packages)
and not (
installed
and self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
)
):
if (
myeb
and "--newrepo" in self._frozen_config.myopts
and myeb.repo != pkg.repo
):
break
elif self._dynamic_config.myparams.get(
"changed_slot"
) and self._changed_slot(pkg):
if installed:
break
else:
# Continue searching for a binary package
# with the desired SLOT metadata.
continue
elif reinstall_use or (not installed and respect_use):
iuses = pkg.iuse.all
old_use = self._pkg_use_enabled(pkg)
if myeb:
now_use = self._pkg_use_enabled(myeb)
forced_flags = set(chain(myeb.use.force, myeb.use.mask))
else:
pkgsettings.setcpv(pkg)
now_use = pkgsettings["PORTAGE_USE"].split()
forced_flags = set(
chain(pkgsettings.useforce, pkgsettings.usemask)
)
cur_iuse = iuses
if myeb and not usepkgonly and not useoldpkg:
cur_iuse = myeb.iuse.all
reinstall_for_flags = self._reinstall_for_flags(
pkg, forced_flags, old_use, iuses, now_use, cur_iuse
)
if reinstall_for_flags:
if not pkg.installed:
self._dynamic_config.ignored_binaries.setdefault(
pkg, {}
).setdefault("respect_use", set()).update(
reinstall_for_flags
)
# Continue searching for a binary
# package instance built with the
# desired USE settings.
continue
break
installed_changed_deps = False
if installed and (changed_deps or changed_deps_report):
installed_changed_deps = self._changed_deps(pkg)
if (installed_changed_deps and changed_deps) or (
not installed
and binpkg_changed_deps
and self._changed_deps(pkg)
):
if not installed:
self._dynamic_config.ignored_binaries.setdefault(
pkg, {}
)["changed_deps"] = True
# Continue searching for a binary
# package instance built with the
# desired USE settings.
continue
break
# Compare current config to installed package
# and do not reinstall if possible.
if not installed and not useoldpkg and cpv in vardb.match(atom):
inst_pkg = vardb.match_pkgs(Atom("=" + pkg.cpv))[0]
if (
"--newrepo" in self._frozen_config.myopts
and pkg.repo != inst_pkg.repo
):
reinstall = True
elif reinstall_use:
forced_flags = set()
forced_flags.update(pkg.use.force)
forced_flags.update(pkg.use.mask)
old_use = inst_pkg.use.enabled
old_iuse = inst_pkg.iuse.all
cur_use = self._pkg_use_enabled(pkg)
cur_iuse = pkg.iuse.all
reinstall_for_flags = self._reinstall_for_flags(
pkg, forced_flags, old_use, old_iuse, cur_use, cur_iuse
)
if reinstall_for_flags:
reinstall = True
if reinstall_atoms.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
reinstall = True
if not built:
myeb = pkg
elif useoldpkg:
matched_oldpkg.append(pkg)
matched_packages.append(pkg)
if reinstall_for_flags:
self._dynamic_config._reinstall_nodes[pkg] = reinstall_for_flags
break
if not matched_packages:
return None, None
if "--debug" in self._frozen_config.myopts:
for pkg in matched_packages:
portage.writemsg(
f"{pkg.type_name + ':':>10} {pkg.cpv}{_repo_separator}{pkg.repo}\n",
noiselevel=-1,
)
# Filter out any old-style virtual matches if they are
# mixed with new-style virtual matches.
cp = atom_cp
if (
len(matched_packages) > 1
and cp is not None
and "virtual" == portage.catsplit(cp)[0]
):
for pkg in matched_packages:
if pkg.cp != cp:
continue
# Got a new-style virtual, so filter
# out any old-style virtuals.
matched_packages = [pkg for pkg in matched_packages if pkg.cp == cp]
break
if existing_node is not None and existing_node in matched_packages:
return existing_node, existing_node
if len(matched_packages) > 1:
if (
parent is not None
and (parent.root, parent.slot_atom)
in self._dynamic_config._slot_operator_replace_installed
):
# We're forcing a rebuild of the parent because we missed some
# update because of a slot operator dep.
if atom.slot_operator == "=" and atom.sub_slot is None:
# This one is a slot operator dep. Exclude the installed packages if a newer non-installed
# pkg exists.
highest_installed = None
for pkg in matched_packages:
if pkg.installed:
if (
highest_installed is None
or pkg.version > highest_installed.version
):
highest_installed = pkg
if highest_installed and self._want_update_pkg(
parent, highest_installed
):
non_installed = [
pkg
for pkg in matched_packages
if not pkg.installed
and pkg.version > highest_installed.version
]
if non_installed:
matched_packages = non_installed
if rebuilt_binaries:
inst_pkg = None
built_pkg = None
unbuilt_pkg = None
for pkg in matched_packages:
if pkg.installed:
inst_pkg = pkg
elif pkg.built:
built_pkg = pkg
else:
if unbuilt_pkg is None or pkg > unbuilt_pkg:
unbuilt_pkg = pkg
if built_pkg is not None and inst_pkg is not None:
# Only reinstall if binary package BUILD_TIME is
# non-empty, in order to avoid cases like to
# bug #306659 where BUILD_TIME fields are missing
# in local and/or remote Packages file.
built_timestamp = built_pkg.build_time
installed_timestamp = inst_pkg.build_time
if unbuilt_pkg is not None and unbuilt_pkg > built_pkg:
pass
elif "--rebuilt-binaries-timestamp" in self._frozen_config.myopts:
minimal_timestamp = self._frozen_config.myopts[
"--rebuilt-binaries-timestamp"
]
if (
built_timestamp
and built_timestamp > installed_timestamp
and built_timestamp >= minimal_timestamp
):
return built_pkg, existing_node
else:
# Don't care if the binary has an older BUILD_TIME than the installed
# package. This is for closely tracking a binhost.
# Use --rebuilt-binaries-timestamp 0 if you want only newer binaries
# pulled in here.
if built_timestamp and built_timestamp != installed_timestamp:
return built_pkg, existing_node
inst_pkg = None
for pkg in matched_packages:
if pkg.installed:
inst_pkg = pkg
if pkg.installed and pkg.invalid:
matched_packages = [x for x in matched_packages if x is not pkg]
if (
inst_pkg is not None
and parent is not None
and not self._want_update_pkg(parent, inst_pkg)
):
return inst_pkg, existing_node
if avoid_update:
for pkg in matched_packages:
if pkg.installed and self._pkg_visibility_check(
pkg, autounmask_level
):
return pkg, existing_node
visible_matches = []
if matched_oldpkg:
visible_matches = [
pkg.cpv
for pkg in matched_oldpkg
if self._pkg_visibility_check(pkg, autounmask_level)
]
if not visible_matches:
visible_matches = [
pkg.cpv
for pkg in matched_packages
if self._pkg_visibility_check(pkg, autounmask_level)
]
if visible_matches:
bestmatch = portage.best(visible_matches)
else:
# all are masked, so ignore visibility
bestmatch = portage.best([pkg.cpv for pkg in matched_packages])
matched_packages = [
pkg
for pkg in matched_packages
if portage.dep.cpvequal(pkg.cpv, bestmatch)
]
# ordered by type preference ("ebuild" type is the last resort)
return matched_packages[-1], existing_node
def _select_pkg_from_graph(self, root, atom, onlydeps=False, parent=None):
"""
Select packages that have already been added to the graph or
those that are installed and have not been scheduled for
replacement.
"""
graph_db = self._dynamic_config._graph_trees[root]["porttree"].dbapi
matches = graph_db.match_pkgs(atom)
if not matches:
return None, None
# There may be multiple matches, and they may
# conflict with eachother, so choose the highest
# version that has already been added to the graph.
for pkg in reversed(matches):
if pkg in self._dynamic_config.digraph:
return pkg, pkg
# Fall back to installed packages
return self._select_pkg_from_installed(
root, atom, onlydeps=onlydeps, parent=parent
)
def _select_pkg_from_installed(self, root, atom, onlydeps=False, parent=None):
"""
Select packages that are installed.
"""
matches = list(
self._iter_match_pkgs(self._frozen_config.roots[root], "installed", atom)
)
if not matches:
return None, None
if len(matches) > 1:
matches.reverse() # ascending order
unmasked = [pkg for pkg in matches if self._pkg_visibility_check(pkg)]
if unmasked:
if len(unmasked) == 1:
matches = unmasked
else:
# Account for packages with masks (like KEYWORDS masks)
# that are usually ignored in visibility checks for
# installed packages, in order to handle cases like
# bug #350285.
unmasked = [pkg for pkg in matches if not pkg.masks]
if unmasked:
matches = unmasked
if len(matches) > 1:
# Now account for packages for which existing
# ebuilds are masked or unavailable (bug #445506).
unmasked = [
pkg
for pkg in matches
if self._equiv_ebuild_visible(pkg)
]
if unmasked:
matches = unmasked
pkg = matches[-1] # highest match
in_graph = next(
self._dynamic_config._package_tracker.match(
root, pkg.slot_atom, installed=False
),
None,
)
return pkg, in_graph
def _complete_graph(self, required_sets=None):
"""
Add any deep dependencies of required sets (args, system, world) that
have not been pulled into the graph yet. This ensures that the graph
is consistent such that initially satisfied deep dependencies are not
broken in the new graph. Initially unsatisfied dependencies are
irrelevant since we only want to avoid breaking dependencies that are
initially satisfied.
Since this method can consume enough time to disturb users, it is
currently only enabled by the --complete-graph option.
@param required_sets: contains required sets (currently only used
for depclean and prune removal operations)
@type required_sets: dict
"""
if "recurse" not in self._dynamic_config.myparams:
return 1
complete_if_new_use = (
self._dynamic_config.myparams.get("complete_if_new_use", "y") == "y"
)
complete_if_new_ver = (
self._dynamic_config.myparams.get("complete_if_new_ver", "y") == "y"
)
rebuild_if_new_slot = (
self._dynamic_config.myparams.get("rebuild_if_new_slot", "y") == "y"
)
complete_if_new_slot = rebuild_if_new_slot
if "complete" not in self._dynamic_config.myparams and (
complete_if_new_use or complete_if_new_ver or complete_if_new_slot
):
# Enable complete mode if an installed package will change somehow.
use_change = False
version_change = False
for node in self._dynamic_config.digraph:
if not isinstance(node, Package) or node.operation != "merge":
continue
vardb = self._frozen_config.roots[node.root].trees["vartree"].dbapi
if complete_if_new_use or complete_if_new_ver:
inst_pkg = vardb.match_pkgs(node.slot_atom)
if inst_pkg and inst_pkg[0].cp == node.cp:
inst_pkg = inst_pkg[0]
if complete_if_new_ver:
if inst_pkg < node or node < inst_pkg:
version_change = True
break
elif not (
inst_pkg.slot == node.slot
and inst_pkg.sub_slot == node.sub_slot
):
# slot/sub-slot change without revbump gets
# similar treatment to a version change
version_change = True
break
# Intersect enabled USE with IUSE, in order to
# ignore forced USE from implicit IUSE flags, since
# they're probably irrelevant and they are sensitive
# to use.mask/force changes in the profile.
if complete_if_new_use and (
node.iuse.all != inst_pkg.iuse.all
or (self._pkg_use_enabled(node) & node.iuse.all)
!= self._pkg_use_enabled(inst_pkg).intersection(
inst_pkg.iuse.all
)
):
use_change = True
break
if complete_if_new_slot:
cp_list = vardb.match_pkgs(Atom(node.cp))
if (
cp_list
and cp_list[0].cp == node.cp
and not any(
node.slot == pkg.slot and node.sub_slot == pkg.sub_slot
for pkg in cp_list
)
):
version_change = True
break
if use_change or version_change:
self._dynamic_config.myparams["complete"] = True
if "complete" not in self._dynamic_config.myparams:
return 1
self._load_vdb()
# Put the depgraph into a mode that causes it to only
# select packages that have already been added to the
# graph or those that are installed and have not been
# scheduled for replacement. Also, toggle the "deep"
# parameter so that all dependencies are traversed and
# accounted for.
self._dynamic_config._complete_mode = True
self._select_atoms = self._select_atoms_from_graph
if "remove" in self._dynamic_config.myparams:
self._select_package = self._select_pkg_from_installed
else:
self._select_package = self._select_pkg_from_graph
self._dynamic_config._traverse_ignored_deps = True
already_deep = self._dynamic_config.myparams.get("deep") is True
if not already_deep:
self._dynamic_config.myparams["deep"] = True
# Invalidate the package selection cache, since
# _select_package has just changed implementations.
for trees in self._dynamic_config._filtered_trees.values():
trees["porttree"].dbapi._clear_cache()
args = self._dynamic_config._initial_arg_list[:]
for root in self._frozen_config.roots:
if root != self._frozen_config.target_root and (
"remove" in self._dynamic_config.myparams
or self._frozen_config.myopts.get("--root-deps") is not None
):
# Only pull in deps for the relevant root.
continue
depgraph_sets = self._dynamic_config.sets[root]
required_set_names = self._frozen_config._required_set_names.copy()
remaining_args = required_set_names.copy()
if required_sets is None or root not in required_sets:
pass
else:
# Removal actions may override sets with temporary
# replacements that have had atoms removed in order
# to implement --deselect behavior.
depgraph_sets.sets.clear()
depgraph_sets.sets.update(required_sets[root])
if "world" in depgraph_sets.sets:
# For consistent order of traversal for both update
# and removal (depclean) actions, sets other that
# world are always nested under the world set.
world_atoms = list(depgraph_sets.sets["world"])
world_atoms.extend(
SETPREFIX + s for s in required_sets[root] if s != "world"
)
depgraph_sets.sets["world"] = InternalPackageSet(
initial_atoms=world_atoms
)
required_set_names = {"world"}
else:
required_set_names = set(required_sets[root])
if (
"remove" not in self._dynamic_config.myparams
and root == self._frozen_config.target_root
and already_deep
):
remaining_args.difference_update(depgraph_sets.sets)
if (
not remaining_args
and not self._dynamic_config._ignored_deps
and not self._dynamic_config._dep_stack
):
continue
root_config = self._frozen_config.roots[root]
for s in sorted(required_set_names):
pset = depgraph_sets.sets.get(s)
if pset is None:
pset = root_config.sets[s]
atom = SETPREFIX + s
args.append(
SetArg(
arg=atom, pset=pset, reset_depth=False, root_config=root_config
)
)
self._set_args(args)
for arg in self._expand_set_args(args, add_to_digraph=True):
for atom in sorted(arg.pset.getAtoms()):
if not self._add_dep(
Dependency(
atom=atom,
root=arg.root_config.root,
parent=arg,
depth=self._UNREACHABLE_DEPTH,
),
allow_unsatisfied=True,
):
return 0
if True:
if self._dynamic_config._ignored_deps:
self._dynamic_config._dep_stack.extend(
self._dynamic_config._ignored_deps
)
self._dynamic_config._ignored_deps = []
if not self._create_graph(allow_unsatisfied=True):
return 0
# Check the unsatisfied deps to see if any initially satisfied deps
# will become unsatisfied due to an upgrade. Initially unsatisfied
# deps are irrelevant since we only want to avoid breaking deps
# that are initially satisfied.
while self._dynamic_config._unsatisfied_deps:
dep = self._dynamic_config._unsatisfied_deps.pop()
vardb = self._frozen_config.roots[dep.root].trees["vartree"].dbapi
matches = vardb.match_pkgs(dep.atom)
if not matches:
self._dynamic_config._initially_unsatisfied_deps.append(dep)
continue
# An scheduled installation broke a deep dependency.
# Add the installed package to the graph so that it
# will be appropriately reported as a slot collision
# (possibly solvable via backtracking).
pkg = matches[-1] # highest match
if (
self._dynamic_config._allow_backtracking
and not self._want_installed_pkg(pkg)
and (
dep.atom.soname
or (dep.atom.package and dep.atom.slot_operator_built)
)
):
# If pkg was already scheduled for rebuild by the previous
# calculation, then pulling in the installed instance will
# trigger a slot conflict that may go unsolved. Therefore,
# trigger a rebuild of the parent if appropriate.
dep.child = pkg
new_dep = self._slot_operator_update_probe(dep)
if new_dep is not None:
self._slot_operator_update_backtrack(dep, new_dep=new_dep)
continue
if not self._add_pkg(pkg, dep):
return 0
if not self._create_graph(allow_unsatisfied=True):
return 0
return 1
def _pkg(
self, cpv, type_name, root_config, installed=False, onlydeps=False, myrepo=None
):
"""
Get a package instance from the cache, or create a new
one if necessary. Raises PackageNotFound from aux_get if it
failures for some reason (package does not exist or is
corrupt).
"""
# Ensure that we use the specially optimized RootConfig instance
# that refers to FakeVartree instead of the real vartree.
root_config = self._frozen_config.roots[root_config.root]
pkg = self._frozen_config._pkg_cache.get(
Package._gen_hash_key(
cpv=cpv,
type_name=type_name,
repo_name=myrepo,
root_config=root_config,
installed=installed,
onlydeps=onlydeps,
)
)
if pkg is None and onlydeps and not installed:
# Maybe it already got pulled in as a "merge" node.
for candidate in self._dynamic_config._package_tracker.match(
root_config.root, Atom("=" + cpv)
):
if (
candidate.type_name == type_name
and candidate.repo_name == myrepo
and candidate.root_config is root_config
and candidate.installed == installed
and not candidate.onlydeps
):
pkg = candidate
if pkg is None:
tree_type = self.pkg_tree_map[type_name]
db = root_config.trees[tree_type].dbapi
db_keys = list(
self._frozen_config._trees_orig[root_config.root][
tree_type
].dbapi._aux_cache_keys
)
try:
metadata = zip(db_keys, db.aux_get(cpv, db_keys, myrepo=myrepo))
except KeyError:
raise portage.exception.PackageNotFound(cpv)
# Ensure that this cpv is linked to the correct db, since the
# caller might have passed in a cpv from a different db, in
# order get an instance from this db with the same cpv.
# If db has a _db attribute, use that instead, in order to
# to use the underlying db of DbapiProvidesIndex or similar.
db = getattr(db, "_db", db)
if getattr(cpv, "_db", None) is not db:
cpv = _pkg_str(cpv, db=db)
pkg = Package(
built=(type_name != "ebuild"),
cpv=cpv,
installed=installed,
metadata=metadata,
onlydeps=onlydeps,
root_config=root_config,
type_name=type_name,
)
self._frozen_config._pkg_cache[pkg] = pkg
if (
not self._pkg_visibility_check(pkg)
and "LICENSE" in pkg.masks
and len(pkg.masks) == 1
):
slot_key = (pkg.root, pkg.slot_atom)
other_pkg = self._frozen_config._highest_license_masked.get(slot_key)
if other_pkg is None or pkg > other_pkg:
self._frozen_config._highest_license_masked[slot_key] = pkg
return pkg
def _validate_blockers(self):
"""Remove any blockers from the digraph that do not match any of the
packages within the graph. If necessary, create hard deps to ensure
correct merge order such that mutually blocking packages are never
installed simultaneously. Also add runtime blockers from all installed
packages if any of them haven't been added already (bug 128809).
Normally, this method is called only after the graph is complete, and
after _solve_non_slot_operator_slot_conflicts has had an opportunity
to solve slot conflicts (possibly removing some blockers). It can also
be called earlier, in order to get a preview of the blocker data, but
then it needs to be called again after the graph is complete.
"""
# The _in_blocker_conflict method needs to assert that this method
# has been called before it, by checking that it is not None.
self._dynamic_config._blocked_pkgs = digraph()
if "--nodeps" in self._frozen_config.myopts:
return True
if True:
# Pull in blockers from all installed packages that haven't already
# been pulled into the depgraph, in order to ensure that they are
# respected (bug 128809). Due to the performance penalty that is
# incurred by all the additional dep_check calls that are required,
# blockers returned from dep_check are cached on disk by the
# BlockerCache class.
# For installed packages, always ignore blockers from DEPEND since
# only runtime dependencies should be relevant for packages that
# are already built.
dep_keys = Package._runtime_keys
for myroot in self._frozen_config.trees:
if (
self._frozen_config.myopts.get("--root-deps") is not None
and myroot != self._frozen_config.target_root
):
continue
vardb = self._frozen_config.trees[myroot]["vartree"].dbapi
pkgsettings = self._frozen_config.pkgsettings[myroot]
root_config = self._frozen_config.roots[myroot]
final_db = PackageTrackerDbapiWrapper(
myroot, self._dynamic_config._package_tracker
)
blocker_cache = BlockerCache(myroot, vardb)
stale_cache = set(blocker_cache)
for pkg in vardb:
cpv = pkg.cpv
stale_cache.discard(cpv)
pkg_in_graph = self._dynamic_config.digraph.contains(pkg)
pkg_deps_added = pkg in self._dynamic_config._traversed_pkg_deps
# Check for masked installed packages. Only warn about
# packages that are in the graph in order to avoid warning
# about those that will be automatically uninstalled during
# the merge process or by --depclean. Always warn about
# packages masked by license, since the user likely wants
# to adjust ACCEPT_LICENSE.
if pkg in self._dynamic_config._package_tracker:
if not self._pkg_visibility_check(pkg, trust_graph=False) and (
pkg_in_graph or "LICENSE" in pkg.masks
):
self._dynamic_config._masked_installed.add(pkg)
else:
self._check_masks(pkg)
blocker_atoms = None
blockers = None
if pkg_deps_added:
blockers = []
try:
blockers.extend(
self._dynamic_config._blocker_parents.child_nodes(pkg)
)
except KeyError:
pass
try:
blockers.extend(
self._dynamic_config._irrelevant_blockers.child_nodes(
pkg
)
)
except KeyError:
pass
if blockers:
# Select just the runtime blockers.
blockers = [
blocker
for blocker in blockers
if blocker.priority.runtime
or blocker.priority.runtime_post
]
if blockers is not None:
blockers = {blocker.atom for blocker in blockers}
# If this node has any blockers, create a "nomerge"
# node for it so that they can be enforced.
self._spinner_update()
blocker_data = blocker_cache.get(cpv)
if blocker_data is not None and blocker_data.counter != pkg.counter:
blocker_data = None
# If blocker data from the graph is available, use
# it to validate the cache and update the cache if
# it seems invalid.
if blocker_data is not None and blockers is not None:
if not blockers.symmetric_difference(blocker_data.atoms):
continue
blocker_data = None
if blocker_data is None and blockers is not None:
# Re-use the blockers from the graph.
blocker_atoms = sorted(blockers)
blocker_data = blocker_cache.BlockerData(
pkg.counter, blocker_atoms
)
blocker_cache[pkg.cpv] = blocker_data
continue
if blocker_data:
blocker_atoms = [Atom(atom) for atom in blocker_data.atoms]
else:
# Use aux_get() to trigger FakeVartree global
# updates on *DEPEND when appropriate.
depstr = " ".join(vardb.aux_get(pkg.cpv, dep_keys))
# It is crucial to pass in final_db here in order to
# optimize dep_check calls by eliminating atoms via
# dep_wordreduce and dep_eval calls.
try:
success, atoms = portage.dep_check(
depstr,
final_db,
pkgsettings,
myuse=self._pkg_use_enabled(pkg),
trees=self._dynamic_config._graph_trees,
myroot=myroot,
)
except SystemExit:
raise
except Exception as e:
# This is helpful, for example, if a ValueError
# is thrown from cpv_expand due to multiple
# matches (this can happen if an atom lacks a
# category).
show_invalid_depstring_notice(pkg, f"{e}")
del e
raise
if not success:
replacement_pkgs = (
self._dynamic_config._package_tracker.match(
myroot, pkg.slot_atom
)
)
if any(
replacement_pkg.operation == "merge"
for replacement_pkg in replacement_pkgs
):
# This package is being replaced anyway, so
# ignore invalid dependencies so as not to
# annoy the user too much (otherwise they'd be
# forced to manually unmerge it first).
continue
show_invalid_depstring_notice(pkg, atoms)
return False
blocker_atoms = [myatom for myatom in atoms if myatom.blocker]
blocker_atoms.sort()
blocker_cache[cpv] = blocker_cache.BlockerData(
pkg.counter, blocker_atoms
)
if blocker_atoms:
try:
for atom in blocker_atoms:
blocker = Blocker(
atom=atom,
eapi=pkg.eapi,
priority=self._priority(runtime=True),
root=myroot,
)
self._dynamic_config._blocker_parents.add(blocker, pkg)
except portage.exception.InvalidAtom as e:
depstr = " ".join(vardb.aux_get(pkg.cpv, dep_keys))
show_invalid_depstring_notice(pkg, f"Invalid Atom: {e}")
return False
for cpv in stale_cache:
del blocker_cache[cpv]
blocker_cache.flush()
del blocker_cache
# Discard any "uninstall" tasks scheduled by previous calls
# to this method, since those tasks may not make sense given
# the current graph state.
previous_uninstall_tasks = self._dynamic_config._blocker_uninstalls.leaf_nodes()
if previous_uninstall_tasks:
self._dynamic_config._blocker_uninstalls = digraph()
self._dynamic_config.digraph.difference_update(previous_uninstall_tasks)
# Revert state from previous calls.
self._dynamic_config._blocker_parents.update(
self._dynamic_config._irrelevant_blockers
)
self._dynamic_config._irrelevant_blockers.clear()
self._dynamic_config._unsolvable_blockers.clear()
for blocker in self._dynamic_config._blocker_parents.leaf_nodes():
self._spinner_update()
root_config = self._frozen_config.roots[blocker.root]
virtuals = root_config.settings.getvirtuals()
myroot = blocker.root
initial_db = self._frozen_config.trees[myroot]["vartree"].dbapi
provider_virtual = False
if blocker.cp in virtuals and not self._have_new_virt(
blocker.root, blocker.cp
):
provider_virtual = True
# Use this to check PROVIDE for each matched package
# when necessary.
atom_set = InternalPackageSet(initial_atoms=[blocker.atom])
if provider_virtual:
atoms = []
for provider_entry in virtuals[blocker.cp]:
atoms.append(
Atom(blocker.atom.replace(blocker.cp, provider_entry.cp, 1))
)
else:
atoms = [blocker.atom]
blocked_initial = set()
for atom in atoms:
for pkg in initial_db.match_pkgs(atom):
if atom_set.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
blocked_initial.add(pkg)
blocked_final = set()
for atom in atoms:
for pkg in self._dynamic_config._package_tracker.match(myroot, atom):
if atom_set.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
blocked_final.add(pkg)
if not blocked_initial and not blocked_final:
parent_pkgs = self._dynamic_config._blocker_parents.parent_nodes(
blocker
)
self._dynamic_config._blocker_parents.remove(blocker)
# Discard any parents that don't have any more blockers.
for pkg in parent_pkgs:
self._dynamic_config._irrelevant_blockers.add(blocker, pkg)
if not self._dynamic_config._blocker_parents.child_nodes(pkg):
self._dynamic_config._blocker_parents.remove(pkg)
continue
for parent in self._dynamic_config._blocker_parents.parent_nodes(blocker):
unresolved_blocks = False
depends_on_order = set()
for pkg in blocked_initial:
if (
pkg.slot_atom == parent.slot_atom
and not blocker.atom.blocker.overlap.forbid
):
# New !!atom blockers do not allow temporary
# simulaneous installation, so unlike !atom
# blockers, !!atom blockers aren't ignored
# when they match other packages occupying
# the same slot.
continue
if parent.installed:
# Two currently installed packages conflict with
# eachother. Ignore this case since the damage
# is already done and this would be likely to
# confuse users if displayed like a normal blocker.
continue
self._dynamic_config._blocked_pkgs.add(pkg, blocker)
if parent.operation == "merge":
# Maybe the blocked package can be replaced or simply
# unmerged to resolve this block.
depends_on_order.add((pkg, parent))
continue
# None of the above blocker resolutions techniques apply,
# so apparently this one is unresolvable.
unresolved_blocks = True
for pkg in blocked_final:
if (
pkg.slot_atom == parent.slot_atom
and not blocker.atom.blocker.overlap.forbid
):
# New !!atom blockers do not allow temporary
# simulaneous installation, so unlike !atom
# blockers, !!atom blockers aren't ignored
# when they match other packages occupying
# the same slot.
continue
if parent.operation == "nomerge" and pkg.operation == "nomerge":
# This blocker will be handled the next time that a
# merge of either package is triggered.
continue
self._dynamic_config._blocked_pkgs.add(pkg, blocker)
# Maybe the blocking package can be
# unmerged to resolve this block.
if parent.operation == "merge" and pkg.installed:
depends_on_order.add((pkg, parent))
continue
elif parent.operation == "nomerge":
depends_on_order.add((parent, pkg))
continue
# None of the above blocker resolutions techniques apply,
# so apparently this one is unresolvable.
unresolved_blocks = True
if "--buildpkgonly" in self._frozen_config.myopts and not (
blocker.priority.buildtime and blocker.atom.blocker.overlap.forbid
):
depends_on_order.clear()
# Make sure we don't unmerge any package that have been pulled
# into the graph.
if not unresolved_blocks and depends_on_order:
for inst_pkg, inst_task in depends_on_order:
if self._dynamic_config.digraph.contains(
inst_pkg
) and self._dynamic_config.digraph.parent_nodes(inst_pkg):
unresolved_blocks = True
break
if not unresolved_blocks and depends_on_order:
for inst_pkg, inst_task in depends_on_order:
uninst_task = Package(
built=inst_pkg.built,
cpv=inst_pkg.cpv,
installed=inst_pkg.installed,
metadata=inst_pkg._metadata,
operation="uninstall",
root_config=inst_pkg.root_config,
type_name=inst_pkg.type_name,
)
# Enforce correct merge order with a hard dep.
self._dynamic_config.digraph.addnode(
uninst_task, inst_task, priority=BlockerDepPriority.instance
)
# Count references to this blocker so that it can be
# invalidated after nodes referencing it have been
# merged.
self._dynamic_config._blocker_uninstalls.addnode(
uninst_task, blocker
)
if not unresolved_blocks and not depends_on_order:
self._dynamic_config._irrelevant_blockers.add(blocker, parent)
self._dynamic_config._blocker_parents.remove_edge(blocker, parent)
if not self._dynamic_config._blocker_parents.parent_nodes(blocker):
self._dynamic_config._blocker_parents.remove(blocker)
if not self._dynamic_config._blocker_parents.child_nodes(parent):
self._dynamic_config._blocker_parents.remove(parent)
if unresolved_blocks:
self._dynamic_config._unsolvable_blockers.add(blocker, parent)
return True
def _accept_blocker_conflicts(self):
"""
Always returns False when backtracking is enabled, for
consistent results. When backtracking is disabled, returns
True for options that tolerate conflicts.
"""
if self._dynamic_config._allow_backtracking:
return False
acceptable = False
for x in ("--buildpkgonly", "--fetchonly", "--fetch-all-uri", "--nodeps"):
if x in self._frozen_config.myopts:
acceptable = True
break
return acceptable
def _merge_order_bias(self, mygraph):
"""
For optimal leaf node selection, promote deep system runtime deps and
order nodes from highest to lowest overall reference count.
"""
if not self._dynamic_config.myparams["implicit_system_deps"]:
return
node_info = {}
for node in mygraph.order:
node_info[node] = len(mygraph.parent_nodes(node))
deep_system_deps = _find_deep_system_runtime_deps(mygraph)
def cmp_merge_preference(node1, node2):
if node1.operation == "uninstall":
if node2.operation == "uninstall":
return 0
return 1
if node2.operation == "uninstall":
if node1.operation == "uninstall":
return 0
return -1
node1_sys = node1 in deep_system_deps
node2_sys = node2 in deep_system_deps
if node1_sys != node2_sys:
if node1_sys:
return -1
return 1
return node_info[node2] - node_info[node1]
mygraph.order.sort(key=cmp_sort_key(cmp_merge_preference))
def altlist(self, reversed=DeprecationWarning): # pylint: disable=redefined-builtin
if reversed is not DeprecationWarning:
warnings.warn(
"The reversed parameter of "
"_emerge.depgraph.depgraph.altlist() is deprecated",
DeprecationWarning,
stacklevel=2,
)
while self._dynamic_config._serialized_tasks_cache is None:
self._resolve_conflicts()
try:
(
self._dynamic_config._serialized_tasks_cache,
self._dynamic_config._scheduler_graph,
) = self._serialize_tasks()
except self._serialize_tasks_retry:
pass
retlist = self._dynamic_config._serialized_tasks_cache
if reversed is not DeprecationWarning and reversed:
# TODO: remove the "reversed" parameter (builtin name collision)
retlist = list(retlist)
retlist.reverse()
retlist = tuple(retlist)
return retlist
def _implicit_libc_deps(self, mergelist, graph):
"""
Create implicit dependencies on libc, in order to ensure that libc
is installed as early as possible (see bug #303567).
"""
libc_pkgs = {}
implicit_libc_roots = (self._frozen_config._running_root.root,)
for root in implicit_libc_roots:
vardb = self._frozen_config.trees[root]["vartree"].dbapi
for atom in self._expand_virt_from_graph(
root, portage.const.LIBC_PACKAGE_ATOM
):
if atom.blocker:
continue
for pkg in self._dynamic_config._package_tracker.match(root, atom):
if pkg.operation == "merge" and not vardb.cpv_exists(pkg.cpv):
libc_pkgs.setdefault(pkg.root, set()).add(pkg)
if not libc_pkgs:
return
earlier_libc_pkgs = set()
for pkg in mergelist:
if not isinstance(pkg, Package):
# a satisfied blocker
continue
root_libc_pkgs = libc_pkgs.get(pkg.root)
if root_libc_pkgs is not None and pkg.operation == "merge":
if pkg in root_libc_pkgs:
earlier_libc_pkgs.add(pkg)
else:
for libc_pkg in root_libc_pkgs:
if libc_pkg in earlier_libc_pkgs:
graph.add(
libc_pkg, pkg, priority=DepPriority(buildtime=True)
)
def schedulerGraph(self):
"""
The scheduler graph is identical to the normal one except that
uninstall edges are reversed in specific cases that require
conflicting packages to be temporarily installed simultaneously.
This is intended for use by the Scheduler in it's parallelization
logic. It ensures that temporary simultaneous installation of
conflicting packages is avoided when appropriate (especially for
!!atom blockers), but allowed in specific cases that require it.
Note that this method calls break_refs() which alters the state of
internal Package instances such that this depgraph instance should
not be used to perform any more calculations.
"""
# NOTE: altlist initializes self._dynamic_config._scheduler_graph
mergelist = self.altlist()
self._implicit_libc_deps(mergelist, self._dynamic_config._scheduler_graph)
# Break DepPriority.satisfied attributes which reference
# installed Package instances.
for (
parents,
children,
node,
) in self._dynamic_config._scheduler_graph.nodes.values():
for priorities in chain(parents.values(), children.values()):
for priority in priorities:
if priority.satisfied:
priority.satisfied = True
pkg_cache = self._frozen_config._pkg_cache
graph = self._dynamic_config._scheduler_graph
trees = self._frozen_config.trees
pruned_pkg_cache = {}
for key, pkg in pkg_cache.items():
if pkg in graph or (
pkg.installed and pkg in trees[pkg.root]["vartree"].dbapi
):
pruned_pkg_cache[key] = pkg
for root in trees:
trees[root]["vartree"]._pkg_cache = pruned_pkg_cache
self.break_refs()
sched_config = _scheduler_graph_config(
trees, pruned_pkg_cache, graph, mergelist
)
return sched_config
def break_refs(self):
"""
Break any references in Package instances that lead back to the depgraph.
This is useful if you want to hold references to packages without also
holding the depgraph on the heap. It should only be called after the
depgraph and _frozen_config will not be used for any more calculations.
"""
for root_config in self._frozen_config.roots.values():
root_config.update(
self._frozen_config._trees_orig[root_config.root]["root_config"]
)
# Both instances are now identical, so discard the
# original which should have no other references.
self._frozen_config._trees_orig[root_config.root][
"root_config"
] = root_config
def _resolve_conflicts(self):
if (
"complete" not in self._dynamic_config.myparams
and self._dynamic_config._allow_backtracking
and any(self._dynamic_config._package_tracker.slot_conflicts())
and not self._accept_blocker_conflicts()
):
self._dynamic_config.myparams["complete"] = True
if not self._complete_graph():
raise self._unknown_internal_error()
self._process_slot_conflicts()
def _serialize_tasks(self):
debug = "--debug" in self._frozen_config.myopts
if debug:
writemsg("\ndigraph:\n\n", noiselevel=-1)
self._dynamic_config.digraph.debug_print()
writemsg("\n", noiselevel=-1)
scheduler_graph = self._dynamic_config.digraph.copy()
if "--nodeps" in self._frozen_config.myopts:
# Preserve the package order given on the command line.
return (
[
node
for node in scheduler_graph
if isinstance(node, Package) and node.operation == "merge"
],
scheduler_graph,
)
mygraph = self._dynamic_config.digraph.copy()
removed_nodes = set()
# Prune off all DependencyArg instances since they aren't
# needed, and because of nested sets this is faster than doing
# it with multiple digraph.root_nodes() calls below. This also
# takes care of nested sets that have circular references,
# which wouldn't be matched by digraph.root_nodes().
for node in mygraph:
if isinstance(node, DependencyArg):
removed_nodes.add(node)
if removed_nodes:
mygraph.difference_update(removed_nodes)
removed_nodes.clear()
# Prune "nomerge" root nodes if nothing depends on them, since
# otherwise they slow down merge order calculation. Don't remove
# non-root nodes since they help optimize merge order in some cases
# such as revdep-rebuild.
while True:
for node in mygraph.root_nodes():
if not isinstance(node, Package) or node.installed or node.onlydeps:
removed_nodes.add(node)
if removed_nodes:
self._spinner_update()
mygraph.difference_update(removed_nodes)
if not removed_nodes:
break
removed_nodes.clear()
self._merge_order_bias(mygraph)
myblocker_uninstalls = self._dynamic_config._blocker_uninstalls.copy()
retlist = []
# Contains uninstall tasks that have been scheduled to
# occur after overlapping blockers have been installed.
scheduled_uninstalls = set()
# Contains any Uninstall tasks that have been ignored
# in order to avoid the circular deps code path. These
# correspond to blocker conflicts that could not be
# resolved.
ignored_uninstall_tasks = set()
have_uninstall_task = False
complete = "complete" in self._dynamic_config.myparams
ignore_world = self._dynamic_config.myparams.get("ignore_world", False)
asap_nodes = []
def get_nodes(**kwargs):
"""
Returns leaf nodes excluding Uninstall instances
since those should be executed as late as possible.
"""
return [
node
for node in mygraph.leaf_nodes(**kwargs)
if isinstance(node, Package)
and (node.operation != "uninstall" or node in scheduled_uninstalls)
]
# sys-apps/portage needs special treatment if ROOT="/"
running_root = self._frozen_config._running_root.root
runtime_deps = InternalPackageSet(initial_atoms=[PORTAGE_PACKAGE_ATOM])
running_portage = self._frozen_config.trees[running_root][
"vartree"
].dbapi.match_pkgs(Atom(PORTAGE_PACKAGE_ATOM))
replacement_portage = list(
self._dynamic_config._package_tracker.match(
running_root, Atom(PORTAGE_PACKAGE_ATOM)
)
)
if running_portage:
running_portage = running_portage[0]
else:
running_portage = None
if replacement_portage:
replacement_portage = replacement_portage[0]
else:
replacement_portage = None
if replacement_portage == running_portage:
replacement_portage = None
if running_portage is not None:
try:
portage_rdepend = self._select_atoms_highest_available(
running_root,
running_portage._metadata["RDEPEND"],
myuse=self._pkg_use_enabled(running_portage),
parent=running_portage,
strict=False,
)
except portage.exception.InvalidDependString as e:
portage.writemsg(
"!!! Invalid RDEPEND in "
f"'{running_root}var/db/pkg/{running_portage.cpv}/RDEPEND': {e}\n",
noiselevel=-1,
)
del e
portage_rdepend = {running_portage: []}
for atoms in portage_rdepend.values():
runtime_deps.update(atom for atom in atoms if not atom.blocker)
# Merge libc asap, in order to account for implicit
# dependencies. See bug #303567.
implicit_libc_roots = (running_root,)
for root in implicit_libc_roots:
libc_pkgs = set()
vardb = self._frozen_config.trees[root]["vartree"].dbapi
for atom in self._expand_virt_from_graph(
root, portage.const.LIBC_PACKAGE_ATOM
):
if atom.blocker:
continue
for pkg in self._dynamic_config._package_tracker.match(root, atom):
if pkg.operation == "merge" and not vardb.cpv_exists(pkg.cpv):
libc_pkgs.add(pkg)
if libc_pkgs:
# If there's also an os-headers upgrade, we need to
# pull that in first. See bug #328317.
for atom in self._expand_virt_from_graph(
root, portage.const.OS_HEADERS_PACKAGE_ATOM
):
if atom.blocker:
continue
for pkg in self._dynamic_config._package_tracker.match(root, atom):
if pkg.operation == "merge" and not vardb.cpv_exists(pkg.cpv):
asap_nodes.append(pkg)
asap_nodes.extend(libc_pkgs)
def gather_deps(
ignore_priority,
mergeable_nodes,
selected_nodes,
node,
smallest_cycle=None,
traversed_nodes=None,
):
"""
Recursively gather a group of nodes that RDEPEND on
eachother. This ensures that they are merged as a group
and get their RDEPENDs satisfied as soon as possible.
"""
if node in selected_nodes:
return True
if node not in mergeable_nodes:
return False
if node == replacement_portage and any(
getattr(rdep, "operation", None) != "uninstall"
for rdep in mygraph.child_nodes(
node, ignore_priority=priority_range.ignore_medium_soft
)
):
# Make sure that portage always has all of its
# RDEPENDs installed first, but ignore uninstalls
# (these occur when new portage blocks an older package version).
return False
if traversed_nodes is not None:
if node in traversed_nodes:
# Identical to a previously traversed cycle.
return False
traversed_nodes.add(node)
selected_nodes.add(node)
if smallest_cycle is not None and len(selected_nodes) >= len(
smallest_cycle
):
return False
for child in mygraph.child_nodes(node, ignore_priority=ignore_priority):
if not gather_deps(
ignore_priority,
mergeable_nodes,
selected_nodes,
child,
smallest_cycle=smallest_cycle,
traversed_nodes=traversed_nodes,
):
return False
return True
def ignore_uninst_or_med(priority):
if priority is BlockerDepPriority.instance:
return True
return priority_range.ignore_medium(priority)
def ignore_uninst_or_med_soft(priority):
if priority is BlockerDepPriority.instance:
return True
return priority_range.ignore_medium_soft(priority)
tree_mode = "--tree" in self._frozen_config.myopts
# Tracks whether or not the current iteration should prefer asap_nodes
# if available. This is set to False when the previous iteration
# failed to select any nodes. It is reset whenever nodes are
# successfully selected.
prefer_asap = True
# Controls whether or not the current iteration should drop edges that
# are "satisfied" by installed packages, in order to solve circular
# dependencies. The deep runtime dependencies of installed packages are
# not checked in this case (bug #199856), so it must be avoided
# whenever possible.
drop_satisfied = False
# State of variables for successive iterations that loosen the
# criteria for node selection.
#
# iteration prefer_asap drop_satisfied
# 1 True False
# 2 False False
# 3 False True
#
# If no nodes are selected on the last iteration, it is due to
# unresolved blockers or circular dependencies.
while mygraph:
self._spinner_update()
selected_nodes = None
ignore_priority = None
cycle_digraph = None
if prefer_asap and asap_nodes:
priority_range = DepPrioritySatisfiedRange
else:
priority_range = DepPriorityNormalRange
if prefer_asap and asap_nodes:
# ASAP nodes are merged before their soft deps. Go ahead and
# select root nodes here if necessary, since it's typical for
# the parent to have been removed from the graph already.
asap_nodes = [node for node in asap_nodes if mygraph.contains(node)]
for i in range(priority_range.SOFT, priority_range.MEDIUM_SOFT + 1):
ignore_priority = priority_range.ignore_priority[i]
for node in asap_nodes:
if not mygraph.child_nodes(
node, ignore_priority=ignore_priority
):
selected_nodes = [node]
asap_nodes.remove(node)
break
if selected_nodes:
break
if not selected_nodes and not (prefer_asap and asap_nodes):
for i in range(priority_range.NONE, priority_range.MEDIUM_SOFT + 1):
ignore_priority = priority_range.ignore_priority[i]
nodes = get_nodes(ignore_priority=ignore_priority)
if nodes:
# If there is a mixture of merges and uninstalls,
# do the uninstalls first.
good_uninstalls = None
if len(nodes) > 1:
good_uninstalls = [
node for node in nodes if node.operation == "uninstall"
]
if good_uninstalls:
nodes = good_uninstalls
else:
nodes = nodes
if (
good_uninstalls
or len(nodes) == 1
or (
ignore_priority is None
and not asap_nodes
and not tree_mode
)
):
# Greedily pop all of these nodes since no
# relationship has been ignored. This optimization
# destroys --tree output, so it's disabled in tree
# mode.
selected_nodes = nodes
else:
# For optimal merge order:
# * Only pop one node.
# * Removing a root node (node without a parent)
# will not produce a leaf node, so avoid it.
# * It's normal for a selected uninstall to be a
# root node, so don't check them for parents.
if asap_nodes:
prefer_asap_parents = (True, False)
else:
prefer_asap_parents = (False,)
for check_asap_parent in prefer_asap_parents:
if check_asap_parent:
for node in nodes:
parents = mygraph.parent_nodes(
node,
ignore_priority=DepPrioritySatisfiedRange.ignore_medium_soft,
)
if any(x in asap_nodes for x in parents):
selected_nodes = [node]
break
else:
for node in nodes:
if mygraph.parent_nodes(node):
selected_nodes = [node]
break
if selected_nodes:
break
if selected_nodes:
break
if not selected_nodes:
def find_smallest_cycle(mergeable_nodes, local_priority_range):
if prefer_asap and asap_nodes:
nodes = asap_nodes
else:
nodes = mergeable_nodes
# When gathering the nodes belonging to a runtime cycle,
# we want to minimize the number of nodes gathered, since
# this tends to produce a more optimal merge order.
# Ignoring all medium_soft deps serves this purpose.
# In the case of multiple runtime cycles, where some cycles
# may depend on smaller independent cycles, it's optimal
# to merge smaller independent cycles before other cycles
# that depend on them. Therefore, we search for the
# smallest cycle in order to try and identify and prefer
# these smaller independent cycles.
smallest_cycle = None
ignore_priority = None
# Sort nodes for deterministic results.
nodes = sorted(nodes)
for priority in (
local_priority_range.ignore_priority[i]
for i in range(
local_priority_range.MEDIUM_POST,
local_priority_range.MEDIUM_SOFT + 1,
)
):
# Traversed nodes for current priority
traversed_nodes = set()
for node in nodes:
if not mygraph.parent_nodes(node):
continue
if node in traversed_nodes:
continue
selected_nodes = set()
if gather_deps(
priority,
mergeable_nodes,
selected_nodes,
node,
smallest_cycle=smallest_cycle,
traversed_nodes=traversed_nodes,
):
if smallest_cycle is None or len(selected_nodes) < len(
smallest_cycle
):
smallest_cycle = selected_nodes
ignore_priority = priority
# Exit this loop with the lowest possible priority, which
# minimizes the use of installed packages to break cycles.
if smallest_cycle is not None:
break
return smallest_cycle, ignore_priority
priority_ranges = []
if priority_range is not DepPriorityNormalRange:
priority_ranges.append(DepPriorityNormalRange)
priority_ranges.append(priority_range)
if drop_satisfied and priority_range is not DepPrioritySatisfiedRange:
priority_ranges.append(DepPrioritySatisfiedRange)
for local_priority_range in priority_ranges:
mergeable_nodes = set(
get_nodes(ignore_priority=local_priority_range.ignore_medium)
)
if mergeable_nodes:
selected_nodes, ignore_priority = find_smallest_cycle(
mergeable_nodes, local_priority_range
)
if selected_nodes:
break
if not selected_nodes:
if prefer_asap and asap_nodes:
# We failed to find any asap nodes to merge, so ignore
# them for the next iteration.
prefer_asap = False
continue
else:
cycle_digraph = mygraph.copy()
cycle_digraph.difference_update(
[x for x in cycle_digraph if x not in selected_nodes]
)
leaves = cycle_digraph.leaf_nodes()
if leaves:
# NOTE: This case should only be triggered when
# prefer_asap is True, since otherwise these
# leaves would have been selected to merge
# before this point. Since these "leaves" may
# actually have some low-priority dependencies
# that we have intentionally ignored, select
# only one node here, so that merge order
# accounts for as many dependencies as possible.
selected_nodes = [leaves[0]]
if debug:
writemsg(
f"\nruntime cycle digraph ({len(selected_nodes)} nodes):\n\n",
noiselevel=-1,
)
cycle_digraph.debug_print()
writemsg("\n", noiselevel=-1)
if leaves:
writemsg(
f"runtime cycle leaf: {selected_nodes[0]}\n\n",
noiselevel=-1,
)
if selected_nodes and ignore_priority is not None:
# Try to merge neglected medium_post deps as soon as possible
# if they're not satisfied by installed packages.
for node in selected_nodes:
children = set(mygraph.child_nodes(node))
medium_post_satisifed = children.difference(
mygraph.child_nodes(
node,
ignore_priority=DepPrioritySatisfiedRange.ignore_medium_post_satisifed,
)
)
medium_post = children.difference(
mygraph.child_nodes(
node,
ignore_priority=DepPrioritySatisfiedRange.ignore_medium_post,
)
)
medium_post -= medium_post_satisifed
for child in medium_post:
if child in selected_nodes:
continue
if child in asap_nodes:
continue
# Merge PDEPEND asap for bug #180045.
asap_nodes.append(child)
if selected_nodes and len(selected_nodes) > 1 and cycle_digraph is not None:
# Sort nodes to account for direct circular relationships. Relevant
# priorities here are: runtime < buildtime < buildtime slot operator
ignore_priorities = list(
filter(
None,
chain(
DepPriorityNormalRange.ignore_priority,
DepPrioritySatisfiedRange.ignore_priority,
),
)
)
selected_nodes = []
while cycle_digraph:
leaves = None
for ignore_priority in ignore_priorities:
leaves = cycle_digraph.leaf_nodes(
ignore_priority=ignore_priority
)
if leaves:
# Select leaves with minimum ignore_priority,
# in order to ignore as few deps as possible.
break
if not leaves:
leaves = [cycle_digraph.order[-1]]
# Prefer installed leaves, in order to avoid
# merging something too early as in bug 917259.
installed_leaves = [pkg for pkg in leaves if pkg.installed]
if installed_leaves:
leaves = installed_leaves
# Only harvest one node at a time, in order to
# minimize the number of ignored dependencies.
cycle_digraph.remove(leaves[0])
selected_nodes.append(leaves[0])
if not selected_nodes and myblocker_uninstalls:
# An Uninstall task needs to be executed in order to
# avoid conflict if possible.
if drop_satisfied:
priority_range = DepPrioritySatisfiedRange
else:
priority_range = DepPriorityNormalRange
mergeable_nodes = get_nodes(ignore_priority=ignore_uninst_or_med)
min_parent_deps = None
uninst_task = None
for task in myblocker_uninstalls.leaf_nodes():
# Do some sanity checks so that system or world packages
# don't get uninstalled inappropriately here (only really
# necessary when --complete-graph has not been enabled).
if task in ignored_uninstall_tasks:
continue
if task in scheduled_uninstalls:
# It's been scheduled but it hasn't
# been executed yet due to dependence
# on installation of blocking packages.
continue
root_config = self._frozen_config.roots[task.root]
inst_pkg = self._pkg(
task.cpv, "installed", root_config, installed=True
)
if self._dynamic_config.digraph.contains(inst_pkg):
continue
forbid_overlap = False
heuristic_overlap = False
for blocker in myblocker_uninstalls.parent_nodes(task):
if not eapi_has_strong_blocks(blocker.eapi):
heuristic_overlap = True
elif blocker.atom.blocker.overlap.forbid:
forbid_overlap = True
break
if forbid_overlap and running_root == task.root:
continue
if heuristic_overlap and running_root == task.root:
# Never uninstall sys-apps/portage or it's essential
# dependencies, except through replacement.
try:
runtime_dep_atoms = list(
runtime_deps.iterAtomsForPackage(task)
)
except portage.exception.InvalidDependString as e:
portage.writemsg(
"!!! Invalid PROVIDE in "
+ f"'{task.root}var/db/pkg/{task.cpv}/PROVIDE': {e}\n",
noiselevel=-1,
)
del e
continue
# Don't uninstall a runtime dep if it appears
# to be the only suitable one installed.
skip = False
vardb = root_config.trees["vartree"].dbapi
for atom in runtime_dep_atoms:
other_version = None
for pkg in vardb.match_pkgs(atom):
if pkg.cpv == task.cpv and pkg.counter == task.counter:
continue
other_version = pkg
break
if other_version is None:
skip = True
break
if skip:
continue
# For packages in the system set, don't take
# any chances. If the conflict can't be resolved
# by a normal replacement operation then abort.
skip = False
try:
if self._dynamic_config.myparams[
"implicit_system_deps"
] and any(
root_config.sets["system"].iterAtomsForPackage(task)
):
skip = True
except portage.exception.InvalidDependString as e:
portage.writemsg(
"!!! Invalid PROVIDE in "
+ f"'{task.root}var/db/pkg/{task.cpv}/PROVIDE': {e}\n",
noiselevel=-1,
)
del e
skip = True
if skip:
continue
# Note that the world check isn't always
# necessary since self._complete_graph() will
# add all packages from the system and world sets to the
# graph. This just allows unresolved conflicts to be
# detected as early as possible, which makes it possible
# to avoid calling self._complete_graph() when it is
# unnecessary due to blockers triggering an abortion.
if not (complete or ignore_world):
# For packages in the world set, go ahead an uninstall
# when necessary, as long as the atom will be satisfied
# in the final state.
skip = False
try:
for atom in root_config.sets[
"selected"
].iterAtomsForPackage(task):
satisfied = False
for pkg in self._dynamic_config._package_tracker.match(
task.root, atom
):
if pkg == inst_pkg:
continue
satisfied = True
break
if not satisfied:
skip = True
self._dynamic_config._blocked_world_pkgs[
inst_pkg
] = atom
break
except portage.exception.InvalidDependString as e:
portage.writemsg(
"!!! Invalid PROVIDE in "
+ f"'{task.root}var/db/pkg/{task.cpv}/PROVIDE': {e}\n",
noiselevel=-1,
)
del e
skip = True
if skip:
continue
# Check the deps of parent nodes to ensure that
# the chosen task produces a leaf node. Maybe
# this can be optimized some more to make the
# best possible choice, but the current algorithm
# is simple and should be near optimal for most
# common cases.
self._spinner_update()
mergeable_parent = False
parent_deps = {task}
for parent in mygraph.parent_nodes(task):
parent_deps.update(
mygraph.child_nodes(
parent,
ignore_priority=priority_range.ignore_medium_soft,
)
)
if (
min_parent_deps is not None
and len(parent_deps) >= min_parent_deps
):
# This task is no better than a previously selected
# task, so abort search now in order to avoid wasting
# any more cpu time on this task. This increases
# performance dramatically in cases when there are
# hundreds of blockers to solve, like when
# upgrading to a new slot of kde-meta.
mergeable_parent = None
break
if parent in mergeable_nodes and gather_deps(
ignore_uninst_or_med_soft, mergeable_nodes, set(), parent
):
mergeable_parent = True
if not mergeable_parent:
continue
if min_parent_deps is None or len(parent_deps) < min_parent_deps:
min_parent_deps = len(parent_deps)
uninst_task = task
if uninst_task is not None and min_parent_deps == 1:
# This is the best possible result, so so abort search
# now in order to avoid wasting any more cpu time.
break
if uninst_task is not None:
# The uninstall is performed only after blocking
# packages have been merged on top of it. File
# collisions between blocking packages are detected
# and removed from the list of files to be uninstalled.
scheduled_uninstalls.add(uninst_task)
parent_nodes = mygraph.parent_nodes(uninst_task)
# Reverse the parent -> uninstall edges since we want
# to do the uninstall after blocking packages have
# been merged on top of it.
mygraph.remove(uninst_task)
for blocked_pkg in parent_nodes:
mygraph.add(
blocked_pkg,
uninst_task,
priority=BlockerDepPriority.instance,
)
scheduler_graph.remove_edge(uninst_task, blocked_pkg)
scheduler_graph.add(
blocked_pkg,
uninst_task,
priority=BlockerDepPriority.instance,
)
# Sometimes a merge node will render an uninstall
# node unnecessary (due to occupying the same SLOT),
# and we want to avoid executing a separate uninstall
# task in that case.
for slot_node in self._dynamic_config._package_tracker.match(
uninst_task.root, uninst_task.slot_atom
):
if slot_node.operation == "merge":
mygraph.add(
slot_node,
uninst_task,
priority=BlockerDepPriority.instance,
)
# Reset the state variables for leaf node selection and
# continue trying to select leaf nodes.
prefer_asap = True
drop_satisfied = False
continue
if not selected_nodes:
# Only select root nodes as a last resort. This case should
# only trigger when the graph is nearly empty and the only
# remaining nodes are isolated (no parents or children). Since
# the nodes must be isolated, ignore_priority is not needed.
selected_nodes = get_nodes()
if not selected_nodes and not drop_satisfied:
drop_satisfied = True
continue
if not selected_nodes and myblocker_uninstalls:
# If possible, drop an uninstall task here in order to avoid
# the circular deps code path. The corresponding blocker will
# still be counted as an unresolved conflict.
uninst_task = None
for node in myblocker_uninstalls.leaf_nodes():
try:
mygraph.remove(node)
except KeyError:
pass
else:
uninst_task = node
ignored_uninstall_tasks.add(node)
break
if uninst_task is not None:
# Reset the state variables for leaf node selection and
# continue trying to select leaf nodes.
prefer_asap = True
drop_satisfied = False
continue
if not selected_nodes:
self._dynamic_config._circular_deps_for_display = mygraph
unsolved_cycle = False
if self._dynamic_config._allow_backtracking:
backtrack_infos = self._dynamic_config._backtrack_infos
backtrack_infos.setdefault("config", {})
circular_dependency = backtrack_infos["config"].setdefault(
"circular_dependency", {}
)
cycles = mygraph.get_cycles(
ignore_priority=DepPrioritySatisfiedRange.ignore_medium_soft
)
for cycle in cycles:
for index, node in enumerate(cycle):
if node in self._dynamic_config._circular_dependency:
unsolved_cycle = True
if index == 0:
circular_child = cycle[-1]
else:
circular_child = cycle[index - 1]
circular_dependency.setdefault(node, set()).add(
circular_child
)
if unsolved_cycle or not self._dynamic_config._allow_backtracking:
self._dynamic_config._skip_restart = True
else:
self._dynamic_config._need_restart = True
raise self._unknown_internal_error()
# At this point, we've succeeded in selecting one or more nodes, so
# reset state variables for leaf node selection.
prefer_asap = True
drop_satisfied = False
mygraph.difference_update(selected_nodes)
for node in selected_nodes:
if isinstance(node, Package) and node.operation == "nomerge":
continue
# Handle interactions between blockers
# and uninstallation tasks.
solved_blockers = set()
uninst_task = None
if isinstance(node, Package) and "uninstall" == node.operation:
have_uninstall_task = True
uninst_task = node
else:
vardb = self._frozen_config.trees[node.root]["vartree"].dbapi
inst_pkg = vardb.match_pkgs(node.slot_atom)
if inst_pkg:
# The package will be replaced by this one, so remove
# the corresponding Uninstall task if necessary.
inst_pkg = inst_pkg[0]
uninst_task = Package(
built=inst_pkg.built,
cpv=inst_pkg.cpv,
installed=inst_pkg.installed,
metadata=inst_pkg._metadata,
operation="uninstall",
root_config=inst_pkg.root_config,
type_name=inst_pkg.type_name,
)
try:
mygraph.remove(uninst_task)
except KeyError:
pass
if (
uninst_task is not None
and uninst_task not in ignored_uninstall_tasks
and myblocker_uninstalls.contains(uninst_task)
):
blocker_nodes = myblocker_uninstalls.parent_nodes(uninst_task)
myblocker_uninstalls.remove(uninst_task)
# Discard any blockers that this Uninstall solves.
for blocker in blocker_nodes:
if not myblocker_uninstalls.child_nodes(blocker):
myblocker_uninstalls.remove(blocker)
if blocker not in self._dynamic_config._unsolvable_blockers:
solved_blockers.add(blocker)
retlist.append(node)
if (isinstance(node, Package) and "uninstall" == node.operation) or (
uninst_task is not None and uninst_task in scheduled_uninstalls
):
# Include satisfied blockers in the merge list
# since the user might be interested and also
# it serves as an indicator that blocking packages
# will be temporarily installed simultaneously.
retlist.extend(solved_blockers)
unsolvable_blockers = set(
self._dynamic_config._unsolvable_blockers.leaf_nodes()
)
unsolvable_blockers.update(myblocker_uninstalls.root_nodes())
# If any Uninstall tasks need to be executed in order
# to avoid a conflict, complete the graph with any
# dependencies that may have been initially
# neglected (to ensure that unsafe Uninstall tasks
# are properly identified and blocked from execution).
if have_uninstall_task and not complete and not unsolvable_blockers:
self._dynamic_config.myparams["complete"] = True
if "--debug" in self._frozen_config.myopts:
msg = [
"enabling 'complete' depgraph mode " "due to uninstall task(s):",
"",
]
for node in retlist:
if isinstance(node, Package) and node.operation == "uninstall":
msg.append(f"\t{node}")
temp_joined = "".join(f"{line}\n" for line in msg)
writemsg_level(
f"\n{temp_joined}\n",
level=logging.DEBUG,
noiselevel=-1,
)
raise self._serialize_tasks_retry("")
# Set satisfied state on blockers, but not before the
# above retry path, since we don't want to modify the
# state in that case.
for node in retlist:
if isinstance(node, Blocker):
node.satisfied = True
retlist.extend(unsolvable_blockers)
retlist = tuple(retlist)
buildtime_blockers = []
if unsolvable_blockers and "--buildpkgonly" in self._frozen_config.myopts:
for blocker in unsolvable_blockers:
if blocker.priority.buildtime and blocker.atom.blocker.overlap.forbid:
buildtime_blockers.append(blocker)
if unsolvable_blockers and (
buildtime_blockers or not self._accept_blocker_conflicts()
):
self._dynamic_config._unsatisfied_blockers_for_display = (
tuple(buildtime_blockers) if buildtime_blockers else unsolvable_blockers
)
self._dynamic_config._serialized_tasks_cache = retlist
self._dynamic_config._scheduler_graph = scheduler_graph
# Blockers don't trigger the _skip_restart flag, since
# backtracking may solve blockers when it solves slot
# conflicts (or by blind luck).
raise self._unknown_internal_error()
have_slot_conflict = any(self._dynamic_config._package_tracker.slot_conflicts())
if have_slot_conflict and not self._accept_blocker_conflicts():
self._dynamic_config._serialized_tasks_cache = retlist
self._dynamic_config._scheduler_graph = scheduler_graph
raise self._unknown_internal_error()
return retlist, scheduler_graph
def _show_circular_deps(self, mygraph):
self._dynamic_config._circular_dependency_handler = circular_dependency_handler(
self, mygraph
)
handler = self._dynamic_config._circular_dependency_handler
self._frozen_config.myopts.pop("--quiet", None)
self._frozen_config.myopts["--verbose"] = True
self._frozen_config.myopts["--tree"] = True
portage.writemsg("\n\n", noiselevel=-1)
self.display(handler.merge_list)
prefix = colorize("BAD", " * ")
portage.writemsg("\n", noiselevel=-1)
portage.writemsg(prefix + "Error: circular dependencies:\n", noiselevel=-1)
portage.writemsg("\n", noiselevel=-1)
if handler.circular_dep_message is None:
handler.debug_print()
portage.writemsg("\n", noiselevel=-1)
if handler.circular_dep_message is not None:
portage.writemsg(handler.circular_dep_message, noiselevel=-1)
suggestions = handler.suggestions
if suggestions:
writemsg("\n\nIt might be possible to break this cycle\n", noiselevel=-1)
if len(suggestions) == 1:
writemsg("by applying the following change:\n", noiselevel=-1)
else:
writemsg(
"by applying "
+ colorize("bold", "any of")
+ " the following changes:\n",
noiselevel=-1,
)
writemsg("".join(suggestions), noiselevel=-1)
writemsg(
"\nNote that this change can be reverted, once the package has"
+ " been installed.\n",
noiselevel=-1,
)
if handler.large_cycle_count:
writemsg(
"\nNote that the dependency graph contains a lot of cycles.\n"
+ "Several changes might be required to resolve all cycles.\n"
+ "Temporarily changing some use flag for all packages might be the better option.\n",
noiselevel=-1,
)
else:
writemsg("\n\n", noiselevel=-1)
writemsg(
prefix
+ "Note that circular dependencies "
+ "can often be avoided by temporarily\n",
noiselevel=-1,
)
writemsg(
prefix
+ "disabling USE flags that trigger "
+ "optional dependencies.\n",
noiselevel=-1,
)
def _show_merge_list(self):
if self._dynamic_config._serialized_tasks_cache is not None and not (
self._dynamic_config._displayed_list is not None
and self._dynamic_config._displayed_list
is self._dynamic_config._serialized_tasks_cache
):
self.display(self._dynamic_config._serialized_tasks_cache)
def _show_unsatisfied_blockers(self, blockers):
self._show_merge_list()
msg = (
"Error: The above package list contains "
+ "packages which cannot be installed "
+ "at the same time on the same system."
)
prefix = colorize("BAD", " * ")
portage.writemsg("\n", noiselevel=-1)
for line in textwrap.wrap(msg, 70):
portage.writemsg(prefix + line + "\n", noiselevel=-1)
# Display the conflicting packages along with the packages
# that pulled them in. This is helpful for troubleshooting
# cases in which blockers don't solve automatically and
# the reasons are not apparent from the normal merge list
# display.
conflict_pkgs = {}
for blocker in blockers:
for pkg in chain(
self._dynamic_config._blocked_pkgs.child_nodes(blocker),
self._dynamic_config._blocker_parents.parent_nodes(blocker),
):
is_slot_conflict_pkg = False
for conflict in self._dynamic_config._package_tracker.slot_conflicts():
if conflict.root == pkg.root and conflict.atom == pkg.slot_atom:
is_slot_conflict_pkg = True
break
if is_slot_conflict_pkg:
# The slot conflict display has better noise reduction
# than the unsatisfied blockers display, so skip
# unsatisfied blockers display for packages involved
# directly in slot conflicts (see bug #385391).
continue
parent_atoms = self._dynamic_config._parent_atoms.get(pkg)
if not parent_atoms:
atom = self._dynamic_config._blocked_world_pkgs.get(pkg)
if atom is not None:
parent_atoms = {("@selected", atom)}
if parent_atoms:
conflict_pkgs[pkg] = parent_atoms
if conflict_pkgs:
# Reduce noise by pruning packages that are only
# pulled in by other conflict packages.
pruned_pkgs = set()
for pkg, parent_atoms in conflict_pkgs.items():
relevant_parent = False
for parent, atom in parent_atoms:
if parent not in conflict_pkgs:
relevant_parent = True
break
if not relevant_parent:
pruned_pkgs.add(pkg)
for pkg in pruned_pkgs:
del conflict_pkgs[pkg]
if conflict_pkgs:
msg = ["\n"]
indent = " "
for pkg, parent_atoms in conflict_pkgs.items():
# Prefer packages that are not directly involved in a conflict.
# It can be essential to see all the packages here, so don't
# omit any. If the list is long, people can simply use a pager.
preferred_parents = set()
for parent_atom in parent_atoms:
parent, atom = parent_atom
if parent not in conflict_pkgs:
preferred_parents.add(parent_atom)
ordered_list = list(preferred_parents)
if len(parent_atoms) > len(ordered_list):
for parent_atom in parent_atoms:
if parent_atom not in preferred_parents:
ordered_list.append(parent_atom)
msg.append(indent + f"{pkg} pulled in by\n")
for parent_atom in ordered_list:
parent, atom = parent_atom
msg.append(2 * indent)
if isinstance(parent, (PackageArg, AtomArg)):
# For PackageArg and AtomArg types, it's
# redundant to display the atom attribute.
msg.append(str(parent))
else:
# Display the specific atom from SetArg or
# Package types.
if isinstance(parent, Package):
use_display = pkg_use_display(
parent,
self._frozen_config.myopts,
modified_use=self._pkg_use_enabled(parent),
)
else:
use_display = ""
if atom.package and atom != atom.unevaluated_atom:
# Show the unevaluated atom, since it can reveal
# issues with conditional use-flags missing
# from IUSE.
msg.append(
f"{atom.unevaluated_atom} ({atom}) "
f"required by {parent} {use_display}"
)
else:
msg.append(f"{atom} required by {parent} {use_display}")
msg.append("\n")
msg.append("\n")
writemsg("".join(msg), noiselevel=-1)
if "--quiet" not in self._frozen_config.myopts:
show_blocker_docs_link()
def display(self, mylist, favorites=[], verbosity=None):
# This is used to prevent display_problems() from
# redundantly displaying this exact same merge list
# again via _show_merge_list().
self._dynamic_config._displayed_list = mylist
if "--tree" in self._frozen_config.myopts:
mylist = tuple(reversed(mylist))
display = Display()
return display(self, mylist, favorites, verbosity)
def _display_autounmask(self, autounmask_continue=False):
"""
Display --autounmask message and optionally write it to config files
(using CONFIG_PROTECT). The message includes the comments and the changes.
"""
if self._dynamic_config._displayed_autounmask:
return
self._dynamic_config._displayed_autounmask = True
ask = "--ask" in self._frozen_config.myopts
autounmask_write = (
autounmask_continue
or self._frozen_config.myopts.get("--autounmask-write", ask) is True
)
autounmask_unrestricted_atoms = (
self._frozen_config.myopts.get("--autounmask-unrestricted-atoms", "n")
== True
)
quiet = "--quiet" in self._frozen_config.myopts
pretend = "--pretend" in self._frozen_config.myopts
enter_invalid = "--ask-enter-invalid" in self._frozen_config.myopts
def check_if_latest(pkg, check_visibility=False):
is_latest = True
is_latest_in_slot = True
dbs = self._dynamic_config._filtered_trees[pkg.root]["dbs"]
root_config = self._frozen_config.roots[pkg.root]
for db, pkg_type, built, installed, db_keys in dbs:
for other_pkg in self._iter_match_pkgs(
root_config, pkg_type, Atom(pkg.cp)
):
if check_visibility and not self._pkg_visibility_check(other_pkg):
continue
if other_pkg.cp != pkg.cp:
# old-style PROVIDE virtual means there are no
# normal matches for this pkg_type
break
if other_pkg > pkg:
is_latest = False
if other_pkg.slot_atom == pkg.slot_atom:
is_latest_in_slot = False
break
else:
# iter_match_pkgs yields highest version first, so
# there's no need to search this pkg_type any further
break
if not is_latest_in_slot:
break
return is_latest, is_latest_in_slot
# Set of roots we have autounmask changes for.
roots = set()
masked_by_missing_keywords = False
unstable_keyword_msg = {}
for pkg in self._dynamic_config._needed_unstable_keywords:
self._show_merge_list()
if pkg in self._dynamic_config.digraph:
root = pkg.root
roots.add(root)
unstable_keyword_msg.setdefault(root, [])
is_latest, is_latest_in_slot = check_if_latest(pkg)
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
mreasons = _get_masking_status(
pkg, pkgsettings, pkg.root_config, use=self._pkg_use_enabled(pkg)
)
for reason in mreasons:
if (
reason.unmask_hint
and reason.unmask_hint.key == "unstable keyword"
):
keyword = reason.unmask_hint.value
if keyword == "**":
masked_by_missing_keywords = True
unstable_keyword_msg[root].append(
self._get_dep_chain_as_comment(pkg)
)
if autounmask_unrestricted_atoms:
if is_latest:
unstable_keyword_msg[root].append(
f">={pkg.cpv} {keyword}\n"
)
elif is_latest_in_slot:
unstable_keyword_msg[root].append(
f">={pkg.cpv}:{pkg.slot} {keyword}\n"
)
else:
unstable_keyword_msg[root].append(
f"={pkg.cpv} {keyword}\n"
)
else:
unstable_keyword_msg[root].append(f"={pkg.cpv} {keyword}\n")
p_mask_change_msg = {}
for pkg in self._dynamic_config._needed_p_mask_changes:
self._show_merge_list()
if pkg in self._dynamic_config.digraph:
root = pkg.root
roots.add(root)
p_mask_change_msg.setdefault(root, [])
is_latest, is_latest_in_slot = check_if_latest(pkg)
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
mreasons = _get_masking_status(
pkg, pkgsettings, pkg.root_config, use=self._pkg_use_enabled(pkg)
)
for reason in mreasons:
if reason.unmask_hint and reason.unmask_hint.key == "p_mask":
keyword = reason.unmask_hint.value
comment, filename = portage.getmaskingreason(
pkg.cpv,
metadata=pkg._metadata,
settings=pkgsettings,
portdb=pkg.root_config.trees["porttree"].dbapi,
return_location=True,
)
p_mask_change_msg[root].append(
self._get_dep_chain_as_comment(pkg)
)
if filename:
p_mask_change_msg[root].append(f"# {filename}:\n")
if comment:
comment = [line for line in comment.splitlines() if line]
for line in comment:
p_mask_change_msg[root].append(f"{line}\n")
if autounmask_unrestricted_atoms:
if is_latest:
p_mask_change_msg[root].append(f">={pkg.cpv}\n")
elif is_latest_in_slot:
p_mask_change_msg[root].append(
f">={pkg.cpv}:{pkg.slot}\n"
)
else:
p_mask_change_msg[root].append(f"={pkg.cpv}\n")
else:
p_mask_change_msg[root].append(f"={pkg.cpv}\n")
use_changes_msg = {}
for (
pkg,
needed_use_config_change,
) in self._dynamic_config._needed_use_config_changes.items():
self._show_merge_list()
if pkg in self._dynamic_config.digraph:
root = pkg.root
roots.add(root)
use_changes_msg.setdefault(root, [])
# NOTE: For USE changes, call check_if_latest with
# check_visibility=True, since we want to generate
# a >= atom if possible. Don't do this for keyword
# or mask changes, since that may cause undesired
# versions to be unmasked! See bug #536392.
is_latest, is_latest_in_slot = check_if_latest(
pkg, check_visibility=True
)
changes = needed_use_config_change[1]
adjustments = []
for flag, state in changes.items():
if state:
adjustments.append(flag)
else:
adjustments.append("-" + flag)
use_changes_msg[root].append(
self._get_dep_chain_as_comment(pkg, unsatisfied_dependency=True)
)
if is_latest:
use_changes_msg[root].append(
f">={pkg.cpv} {' '.join(adjustments)}\n"
)
elif is_latest_in_slot:
use_changes_msg[root].append(
f">={pkg.cpv}:{pkg.slot} {' '.join(adjustments)}\n"
)
else:
use_changes_msg[root].append(
f"={pkg.cpv} {' '.join(adjustments)}\n"
)
license_msg = {}
for (
pkg,
missing_licenses,
) in self._dynamic_config._needed_license_changes.items():
self._show_merge_list()
if pkg in self._dynamic_config.digraph:
root = pkg.root
roots.add(root)
license_msg.setdefault(root, [])
is_latest, is_latest_in_slot = check_if_latest(pkg)
license_msg[root].append(self._get_dep_chain_as_comment(pkg))
if is_latest:
license_msg[root].append(
f">={pkg.cpv} {' '.join(sorted(missing_licenses))}\n"
)
elif is_latest_in_slot:
license_msg[root].append(
f">={pkg.cpv}:{pkg.slot} {' '.join(sorted(missing_licenses))}\n"
)
else:
license_msg[root].append(
f"={pkg.cpv} {' '.join(sorted(missing_licenses))}\n"
)
def find_config_file(abs_user_config, file_name):
"""
Searches /etc/portage for an appropriate file to append changes to.
If the file_name is a file it is returned, if it is a directory, the
last file in it is returned. Order of traversal is the identical to
portage.util.grablines(recursive=True).
file_name - String containing a file name like "package.use"
return value - String. Absolute path of file to write to. None if
no suitable file exists.
"""
file_path = os.path.join(abs_user_config, file_name)
try:
os.lstat(file_path)
except OSError as e:
if e.errno == errno.ENOENT:
# The file doesn't exist, so we'll
# simply create it.
return file_path
# Disk or file system trouble?
return None
last_file_path = None
stack = [file_path]
while stack:
p = stack.pop()
try:
st = os.stat(p)
except OSError:
pass
else:
if stat.S_ISREG(st.st_mode):
last_file_path = p
elif stat.S_ISDIR(st.st_mode):
if os.path.basename(p) in VCS_DIRS:
continue
try:
contents = os.listdir(p)
except OSError:
pass
else:
contents.sort(reverse=True)
for child in contents:
if child.startswith(".") or child.endswith("~"):
continue
stack.append(os.path.join(p, child))
# If the directory is empty add a file with name
# pattern file_name.default
if last_file_path is None:
last_file_path = os.path.join(file_path, file_path, "zz-autounmask")
with open(last_file_path, "a+") as default:
default.write("# " + file_name)
return last_file_path
write_to_file = autounmask_write and not pretend
# Make sure we have a file to write to before doing any write.
file_to_write_to = {}
problems = []
if write_to_file:
for root in roots:
settings = self._frozen_config.roots[root].settings
abs_user_config = os.path.join(
settings["PORTAGE_CONFIGROOT"], USER_CONFIG_PATH
)
if root in unstable_keyword_msg:
if not os.path.exists(
os.path.join(abs_user_config, "package.keywords")
):
filename = "package.accept_keywords"
else:
filename = "package.keywords"
file_to_write_to[(abs_user_config, "package.keywords")] = (
find_config_file(abs_user_config, filename)
)
if root in p_mask_change_msg:
file_to_write_to[(abs_user_config, "package.unmask")] = (
find_config_file(abs_user_config, "package.unmask")
)
if root in use_changes_msg:
file_to_write_to[(abs_user_config, "package.use")] = (
find_config_file(abs_user_config, "package.use")
)
if root in license_msg:
file_to_write_to[(abs_user_config, "package.license")] = (
find_config_file(abs_user_config, "package.license")
)
for (abs_user_config, f), path in file_to_write_to.items():
if path is None:
problems.append(
f"!!! No file to write for '{os.path.join(abs_user_config, f)}'\n"
)
write_to_file = not problems
def format_msg(lines):
lines = lines[:]
for i, line in enumerate(lines):
if line.startswith("#"):
continue
lines[i] = colorize("INFORM", line.rstrip()) + "\n"
return "".join(lines)
for root in roots:
settings = self._frozen_config.roots[root].settings
abs_user_config = os.path.join(
settings["PORTAGE_CONFIGROOT"], USER_CONFIG_PATH
)
if len(roots) > 1:
writemsg(f"\nFor {abs_user_config}:\n", noiselevel=-1)
def _writemsg(reason, file):
writemsg(
f"\nThe following {colorize('BAD', reason)} are necessary to proceed:\n"
f' (see "{file}" in the portage(5) man page for more details)\n',
noiselevel=-1,
)
if root in unstable_keyword_msg:
_writemsg("keyword changes", "package.accept_keywords")
writemsg(format_msg(unstable_keyword_msg[root]), noiselevel=-1)
if root in p_mask_change_msg:
_writemsg("mask changes", "package.unmask")
writemsg(format_msg(p_mask_change_msg[root]), noiselevel=-1)
if root in use_changes_msg:
_writemsg("USE changes", "package.use")
writemsg(format_msg(use_changes_msg[root]), noiselevel=-1)
if root in license_msg:
_writemsg("license changes", "package.license")
writemsg(format_msg(license_msg[root]), noiselevel=-1)
protect_obj = {}
if write_to_file and not autounmask_continue:
for root in roots:
settings = self._frozen_config.roots[root].settings
protect_obj[root] = ConfigProtect(
settings["PORTAGE_CONFIGROOT"],
settings.get("CONFIG_PROTECT", "").split(),
settings.get("CONFIG_PROTECT_MASK", "").split(),
case_insensitive=("case-insensitive-fs" in settings.features),
)
def write_changes(root, changes, file_to_write_to):
file_contents = None
try:
with open(
_unicode_encode(
file_to_write_to, encoding=_encodings["fs"], errors="strict"
),
encoding=_encodings["content"],
errors="replace",
) as f:
file_contents = f.readlines()
except OSError as e:
if e.errno == errno.ENOENT:
file_contents = []
else:
problems.append(f"!!! Failed to read '{file_to_write_to}': {e}\n")
if file_contents is not None:
file_contents.extend(changes)
if not autounmask_continue and protect_obj[root].isprotected(
file_to_write_to
):
# We want to force new_protect_filename to ensure
# that the user will see all our changes via
# dispatch-conf, even if file_to_write_to doesn't
# exist yet, so we specify force=True.
file_to_write_to = new_protect_filename(
file_to_write_to, force=True
)
try:
write_atomic(file_to_write_to, "".join(file_contents))
except PortageException:
problems.append(f"!!! Failed to write '{file_to_write_to}'\n")
if not quiet and (p_mask_change_msg or masked_by_missing_keywords):
msg = [
"",
"NOTE: The --autounmask-keep-masks option will prevent emerge",
" from creating package.unmask or ** keyword changes.",
]
for line in msg:
if line:
line = colorize("INFORM", line)
writemsg(line + "\n", noiselevel=-1)
if ask and write_to_file and file_to_write_to:
prompt = "\nWould you like to add these " + "changes to your config files?"
if self.query(prompt, enter_invalid) == "No":
write_to_file = False
if write_to_file and file_to_write_to:
for root in roots:
settings = self._frozen_config.roots[root].settings
abs_user_config = os.path.join(
settings["PORTAGE_CONFIGROOT"], USER_CONFIG_PATH
)
ensure_dirs(abs_user_config)
if root in unstable_keyword_msg:
write_changes(
root,
unstable_keyword_msg[root],
file_to_write_to.get((abs_user_config, "package.keywords")),
)
if root in p_mask_change_msg:
write_changes(
root,
p_mask_change_msg[root],
file_to_write_to.get((abs_user_config, "package.unmask")),
)
if root in use_changes_msg:
write_changes(
root,
use_changes_msg[root],
file_to_write_to.get((abs_user_config, "package.use")),
)
if root in license_msg:
write_changes(
root,
license_msg[root],
file_to_write_to.get((abs_user_config, "package.license")),
)
if problems:
writemsg(
"\nThe following problems occurred while writing autounmask changes:\n",
noiselevel=-1,
)
writemsg("".join(problems), noiselevel=-1)
elif write_to_file and roots:
writemsg("\nAutounmask changes successfully written.\n", noiselevel=-1)
if autounmask_continue:
return True
for root in roots:
chk_updated_cfg_files(root, [os.path.join(os.sep, USER_CONFIG_PATH)])
elif not pretend and not autounmask_write and roots:
writemsg(
"\nUse --autounmask-write to write changes to config files (honoring\n"
"CONFIG_PROTECT). Carefully examine the list of proposed changes,\n"
"paying special attention to mask or keyword changes that may expose\n"
"experimental or unstable packages.\n",
noiselevel=-1,
)
if self._dynamic_config._autounmask_backtrack_disabled:
msg = [
"In order to avoid wasting time, backtracking has terminated early",
"due to the above autounmask change(s). The --autounmask-backtrack=y",
"option can be used to force further backtracking, but there is no",
"guarantee that it will produce a solution.",
]
writemsg("\n", noiselevel=-1)
for line in msg:
writemsg(f" {colorize('WARN', '*')} {line}\n", noiselevel=-1)
def display_problems(self):
"""
Display problems with the dependency graph such as slot collisions.
This is called internally by display() to show the problems _after_
the merge list where it is most likely to be seen, but if display()
is not going to be called then this method should be called explicitly
to ensure that the user is notified of problems with the graph.
"""
if self._dynamic_config._circular_deps_for_display is not None:
self._show_circular_deps(self._dynamic_config._circular_deps_for_display)
unresolved_conflicts = False
have_slot_conflict = any(self._dynamic_config._package_tracker.slot_conflicts())
if have_slot_conflict:
unresolved_conflicts = True
self._show_slot_collision_notice()
if self._dynamic_config._unsatisfied_blockers_for_display is not None:
unresolved_conflicts = True
self._show_unsatisfied_blockers(
self._dynamic_config._unsatisfied_blockers_for_display
)
# Only show missed updates if there are no unresolved conflicts,
# since they may be irrelevant after the conflicts are solved.
if not unresolved_conflicts:
self._show_missed_update()
if self._frozen_config.myopts.get("--verbose-slot-rebuilds", "y") != "n":
self._compute_abi_rebuild_info()
self._show_abi_rebuild_info()
self._show_ignored_binaries()
self._changed_deps_report()
self._display_autounmask()
for depgraph_sets in self._dynamic_config.sets.values():
for pset in depgraph_sets.sets.values():
for error_msg in pset.errors:
writemsg_level(f"{error_msg}\n", level=logging.ERROR, noiselevel=-1)
# TODO: Add generic support for "set problem" handlers so that
# the below warnings aren't special cases for world only.
if self._dynamic_config._missing_args:
world_problems = False
if (
"world"
in self._dynamic_config.sets[self._frozen_config.target_root].sets
):
# Filter out indirect members of world (from nested sets)
# since only direct members of world are desired here.
world_set = self._frozen_config.roots[
self._frozen_config.target_root
].sets["selected"]
for arg, atom in self._dynamic_config._missing_args:
if arg.name in ("selected", "world") and atom in world_set:
world_problems = True
break
if world_problems:
writemsg(
"\n!!! Problems have been " + "detected with your world file\n",
noiselevel=-1,
)
writemsg(
"!!! Please run " + green("emaint --check world") + "\n\n",
noiselevel=-1,
)
if self._dynamic_config._missing_args:
writemsg(
"\n"
+ colorize("BAD", "!!!")
+ " Ebuilds for the following packages are either all\n",
noiselevel=-1,
)
writemsg(
colorize("BAD", "!!!") + " masked or don't exist:\n", noiselevel=-1
)
writemsg(
" ".join(str(atom) for arg, atom in self._dynamic_config._missing_args)
+ "\n",
noiselevel=-1,
)
if self._dynamic_config._pprovided_args:
arg_refs = {}
for arg, atom in self._dynamic_config._pprovided_args:
if isinstance(arg, SetArg):
parent = arg.name
arg_atom = (atom, atom)
else:
parent = "args"
arg_atom = (arg.arg, atom)
refs = arg_refs.setdefault(arg_atom, [])
if parent not in refs:
refs.append(parent)
msg = [bad("\nWARNING: ")]
if len(self._dynamic_config._pprovided_args) > 1:
msg.append(
"Requested packages will not be "
+ "merged because they are listed in\n"
)
else:
msg.append(
"A requested package will not be "
+ "merged because it is listed in\n"
)
msg.append("package.provided:\n\n")
problems_sets = set()
for (arg, atom), refs in arg_refs.items():
ref_string = ""
if refs:
problems_sets.update(refs)
refs.sort()
ref_string = ", ".join([f"'{name}'" for name in refs])
ref_string = " pulled in by " + ref_string
msg.append(f" {colorize('INFORM', str(arg))}{ref_string}\n")
msg.append("\n")
if "selected" in problems_sets or "world" in problems_sets:
msg.append(
"This problem can be solved in one of the following ways:\n\n"
" A) Use emaint to clean offending packages from world (if not installed).\n"
" B) Uninstall offending packages (cleans them from world).\n"
" C) Remove offending entries from package.provided.\n\n"
"The best course of action depends on the reason that an offending\n"
"package.provided entry exists.\n\n"
)
writemsg("".join(msg), noiselevel=-1)
masked_packages = []
for pkg in self._dynamic_config._masked_license_updates:
root_config = pkg.root_config
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
mreasons = get_masking_status(
pkg, pkgsettings, root_config, use=self._pkg_use_enabled(pkg)
)
masked_packages.append(
(root_config, pkgsettings, pkg.cpv, pkg.repo, pkg._metadata, mreasons)
)
if masked_packages:
writemsg(
"\n"
+ colorize("BAD", "!!!")
+ " The following updates are masked by LICENSE changes:\n",
noiselevel=-1,
)
show_masked_packages(masked_packages)
show_mask_docs()
writemsg("\n", noiselevel=-1)
masked_packages = []
for pkg in self._dynamic_config._masked_installed:
root_config = pkg.root_config
pkgsettings = self._frozen_config.pkgsettings[pkg.root]
mreasons = get_masking_status(
pkg, pkgsettings, root_config, use=self._pkg_use_enabled
)
masked_packages.append(
(root_config, pkgsettings, pkg.cpv, pkg.repo, pkg._metadata, mreasons)
)
if masked_packages:
writemsg(
"\n"
+ colorize("BAD", "!!!")
+ " The following installed packages are masked:\n",
noiselevel=-1,
)
show_masked_packages(masked_packages)
show_mask_docs()
writemsg("\n", noiselevel=-1)
for pargs, kwargs in self._dynamic_config._unsatisfied_deps_for_display:
self._show_unsatisfied_dep(*pargs, **kwargs)
if self._dynamic_config._buildpkgonly_deps_unsatisfied:
self._show_merge_list()
writemsg(
"\n!!! --buildpkgonly requires all " "dependencies to be merged.\n",
noiselevel=-1,
)
writemsg(
"!!! Cannot merge requested packages. " "Merge deps and try again.\n\n",
noiselevel=-1,
)
if self._dynamic_config._quickpkg_direct_deps_unsatisfied:
self._show_merge_list()
writemsg(
"\n!!! --quickpkg-direct requires all "
"dependencies to be merged for root '{}'.\n".format(
self._frozen_config._running_root.root
),
noiselevel=-1,
)
writemsg(
"!!! Cannot merge requested packages. " "Merge deps and try again.\n\n",
noiselevel=-1,
)
def saveNomergeFavorites(self):
"""Find atoms in favorites that are not in the mergelist and add them
to the world file if necessary."""
for x in (
"--buildpkgonly",
"--fetchonly",
"--fetch-all-uri",
"--oneshot",
"--onlydeps",
"--pretend",
):
if x in self._frozen_config.myopts:
return
root_config = self._frozen_config.roots[self._frozen_config.target_root]
world_set = root_config.sets["selected"]
world_locked = False
if hasattr(world_set, "lock"):
world_set.lock()
world_locked = True
if hasattr(world_set, "load"):
world_set.load() # maybe it's changed on disk
args_set = self._dynamic_config.sets[self._frozen_config.target_root].sets[
"__non_set_args__"
]
added_favorites = set()
for x in self._dynamic_config._set_nodes:
if x.operation != "nomerge":
continue
if x.root != root_config.root:
continue
try:
myfavkey = create_world_atom(x, args_set, root_config)
if myfavkey:
if myfavkey in added_favorites:
continue
added_favorites.add(myfavkey)
except portage.exception.InvalidDependString as e:
writemsg(
f"\n\n!!! '{x.cpv}' has invalid PROVIDE: {e}\n",
noiselevel=-1,
)
writemsg(
f"!!! see '{os.path.join(x.root, portage.VDB_PATH, x.cpv, 'PROVIDE')}'\n\n",
noiselevel=-1,
)
del e
all_added = []
for arg in self._dynamic_config._initial_arg_list:
if not isinstance(arg, SetArg):
continue
if arg.root_config.root != root_config.root:
continue
if arg.internal:
# __auto_* sets
continue
k = arg.name
if k in ("selected", "world") or not root_config.sets[k].world_candidate:
continue
s = SETPREFIX + k
if s in world_set:
continue
all_added.append(s)
all_added.extend(added_favorites)
if all_added:
all_added.sort()
skip = False
if "--ask" in self._frozen_config.myopts:
writemsg_stdout("\n", noiselevel=-1)
for a in all_added:
writemsg_stdout(f" {colorize('GOOD', '*')} {a}\n", noiselevel=-1)
writemsg_stdout("\n", noiselevel=-1)
prompt = (
"Would you like to add these packages to your world " "favorites?"
)
enter_invalid = "--ask-enter-invalid" in self._frozen_config.myopts
if self.query(prompt, enter_invalid) == "No":
skip = True
if not skip:
for a in all_added:
if a.startswith(SETPREFIX):
filename = "world_sets"
else:
filename = "world"
writemsg_stdout(
f">>> Recording {colorize('INFORM', str(a))} "
f'in "{filename}" favorites file...\n',
noiselevel=-1,
)
world_set.update(all_added)
if world_locked:
world_set.unlock()
def _loadResumeCommand(self, resume_data, skip_masked=True, skip_missing=True):
"""
Add a resume command to the graph and validate it in the process. This
will raise a PackageNotFound exception if a package is not available.
"""
self._load_vdb()
if not isinstance(resume_data, dict):
return False
mergelist = resume_data.get("mergelist")
if not isinstance(mergelist, list):
mergelist = []
favorites = resume_data.get("favorites")
if isinstance(favorites, list):
args = self._load_favorites(favorites)
else:
args = []
serialized_tasks = []
masked_tasks = []
for x in mergelist:
if not (isinstance(x, list) and len(x) == 4):
continue
pkg_type, myroot, pkg_key, action = x
if pkg_type not in self.pkg_tree_map:
continue
if action != "merge":
continue
root_config = self._frozen_config.roots[myroot]
# Use the resume "favorites" list to see if a repo was specified
# for this package.
depgraph_sets = self._dynamic_config.sets[root_config.root]
repo = None
for atom in depgraph_sets.atoms.getAtoms():
if atom.repo and portage.dep.match_from_list(atom, [pkg_key]):
repo = atom.repo
break
atom = "=" + pkg_key
if repo:
atom = atom + _repo_separator + repo
try:
atom = Atom(atom, allow_repo=True)
except InvalidAtom:
continue
pkg = None
for pkg in self._iter_match_pkgs(root_config, pkg_type, atom):
if not self._pkg_visibility_check(
pkg
) or self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
):
continue
break
if pkg is None:
# It does no exist or it is corrupt.
if skip_missing:
# TODO: log these somewhere
continue
raise portage.exception.PackageNotFound(pkg_key)
if (
"merge" == pkg.operation
and self._frozen_config.excluded_pkgs.findAtomForPackage(
pkg, modified_use=self._pkg_use_enabled(pkg)
)
):
continue
if "merge" == pkg.operation and not self._pkg_visibility_check(pkg):
if skip_masked:
masked_tasks.append(Dependency(root=pkg.root, parent=pkg))
else:
self._dynamic_config._unsatisfied_deps_for_display.append(
((pkg.root, "=" + pkg.cpv), {"myparent": None})
)
self._dynamic_config._package_tracker.add_pkg(pkg)
serialized_tasks.append(pkg)
self._spinner_update()
if self._dynamic_config._unsatisfied_deps_for_display:
return False
if not serialized_tasks or "--nodeps" in self._frozen_config.myopts:
self._dynamic_config._serialized_tasks_cache = serialized_tasks
self._dynamic_config._scheduler_graph = self._dynamic_config.digraph
else:
self._select_package = self._select_pkg_from_graph
self._dynamic_config.myparams["selective"] = True
# Always traverse deep dependencies in order to account for
# potentially unsatisfied dependencies of installed packages.
# This is necessary for correct --keep-going or --resume operation
# in case a package from a group of circularly dependent packages
# fails. In this case, a package which has recently been installed
# may have an unsatisfied circular dependency (pulled in by
# PDEPEND, for example). So, even though a package is already
# installed, it may not have all of it's dependencies satisfied, so
# it may not be usable. If such a package is in the subgraph of
# deep depenedencies of a scheduled build, that build needs to
# be cancelled. In order for this type of situation to be
# recognized, deep traversal of dependencies is required.
self._dynamic_config.myparams["deep"] = True
for task in serialized_tasks:
if isinstance(task, Package) and task.operation == "merge":
if not self._add_pkg(task, None):
return False
# Packages for argument atoms need to be explicitly
# added via _add_pkg() so that they are included in the
# digraph (needed at least for --tree display).
for arg in self._expand_set_args(args, add_to_digraph=True):
for atom in sorted(arg.pset.getAtoms()):
pkg, existing_node = self._select_package(
arg.root_config.root, atom
)
if existing_node is None and pkg is not None:
if not self._add_pkg(
pkg, Dependency(atom=atom, root=pkg.root, parent=arg)
):
return False
# Allow unsatisfied deps here to avoid showing a masking
# message for an unsatisfied dep that isn't necessarily
# masked.
if not self._create_graph(allow_unsatisfied=True):
return False
unsatisfied_deps = []
for dep in self._dynamic_config._unsatisfied_deps:
if not isinstance(dep.parent, Package):
continue
if dep.parent.operation == "merge":
unsatisfied_deps.append(dep)
continue
# For unsatisfied deps of installed packages, only account for
# them if they are in the subgraph of dependencies of a package
# which is scheduled to be installed.
unsatisfied_install = False
traversed = set()
dep_stack = self._dynamic_config.digraph.parent_nodes(dep.parent)
while dep_stack:
node = dep_stack.pop()
if not isinstance(node, Package):
continue
if node.operation == "merge":
unsatisfied_install = True
break
if node in traversed:
continue
traversed.add(node)
dep_stack.extend(self._dynamic_config.digraph.parent_nodes(node))
if unsatisfied_install:
unsatisfied_deps.append(dep)
if masked_tasks or unsatisfied_deps:
# This probably means that a required package
# was dropped via --skipfirst. It makes the
# resume list invalid, so convert it to a
# UnsatisfiedResumeDep exception.
raise self.UnsatisfiedResumeDep(self, masked_tasks + unsatisfied_deps)
self._dynamic_config._serialized_tasks_cache = None
try:
self.altlist()
except self._unknown_internal_error:
return False
return True
def _load_favorites(self, favorites):
"""
Use a list of favorites to resume state from a
previous select_files() call. This creates similar
DependencyArg instances to those that would have
been created by the original select_files() call.
This allows Package instances to be matched with
DependencyArg instances during graph creation.
"""
root_config = self._frozen_config.roots[self._frozen_config.target_root]
sets = root_config.sets
depgraph_sets = self._dynamic_config.sets[root_config.root]
args = []
for x in favorites:
if not isinstance(x, str):
continue
if x in ("system", "world"):
x = SETPREFIX + x
if x.startswith(SETPREFIX):
s = x[len(SETPREFIX) :]
if s not in sets:
continue
if s in depgraph_sets.sets:
continue
pset = sets[s]
depgraph_sets.sets[s] = pset
args.append(SetArg(arg=x, pset=pset, root_config=root_config))
else:
try:
x = Atom(x, allow_repo=True)
except portage.exception.InvalidAtom:
continue
args.append(AtomArg(arg=x, atom=x, root_config=root_config))
self._set_args(args)
return args
class UnsatisfiedResumeDep(portage.exception.PortageException):
"""
A dependency of a resume list is not installed. This
can occur when a required package is dropped from the
merge list via --skipfirst.
"""
def __init__(self, depgraph, value):
portage.exception.PortageException.__init__(self, value)
self.depgraph = depgraph
class _internal_exception(portage.exception.PortageException):
def __init__(self, value=""):
portage.exception.PortageException.__init__(self, value)
class _unknown_internal_error(_internal_exception):
"""
Used by the depgraph internally to terminate graph creation.
The specific reason for the failure should have been dumped
to stderr, unfortunately, the exact reason for the failure
may not be known.
"""
class _serialize_tasks_retry(_internal_exception):
"""
This is raised by the _serialize_tasks() method when it needs to
be called again for some reason. The only case that it's currently
used for is when neglected dependencies need to be added to the
graph in order to avoid making a potentially unsafe decision.
"""
class _backtrack_mask(_internal_exception):
"""
This is raised by _show_unsatisfied_dep() when it's called with
check_backtrack=True and a matching package has been masked by
backtracking.
"""
class _autounmask_breakage(_internal_exception):
"""
This is raised by _show_unsatisfied_dep() when it's called with
check_autounmask_breakage=True and a matching package has been
been disqualified due to autounmask changes.
"""
def need_restart(self):
return (
self._dynamic_config._need_restart
and not self._dynamic_config._skip_restart
)
def need_display_problems(self):
"""
Returns true if this depgraph has problems which need to be
displayed to the user.
"""
if self.need_config_change():
return True
if self._dynamic_config._circular_deps_for_display:
return True
return False
def need_config_change(self):
"""
Returns true if backtracking should terminate due to a needed
configuration change.
"""
if (
self._dynamic_config._success_without_autounmask
or self._dynamic_config._required_use_unsatisfied
):
return True
if (
self._dynamic_config._slot_conflict_handler is None
and not self._accept_blocker_conflicts()
and any(self._dynamic_config._package_tracker.slot_conflicts())
):
self._dynamic_config._slot_conflict_handler = slot_conflict_handler(self)
if self._dynamic_config._slot_conflict_handler.changes:
# Terminate backtracking early if the slot conflict
# handler finds some changes to suggest. The case involving
# sci-libs/L and sci-libs/M in SlotCollisionTestCase will
# otherwise fail with --autounmask-backtrack=n, since
# backtracking will eventually lead to some autounmask
# changes. Changes suggested by the slot conflict handler
# are more likely to be useful.
return True
if (
self._dynamic_config._allow_backtracking
and self._frozen_config.myopts.get("--autounmask-backtrack") != "y"
and self._have_autounmask_changes()
):
if (
self._frozen_config.myopts.get("--autounmask-continue") is True
and self._frozen_config.myopts.get("--autounmask-backtrack") != "n"
):
# --autounmask-continue implies --autounmask-backtrack=y behavior,
# for backward compatibility.
return False
# This disables backtracking when there are autounmask
# config changes. The display_problems method will notify
# the user that --autounmask-backtrack=y can be used to
# force backtracking in this case.
self._dynamic_config._autounmask_backtrack_disabled = True
return True
return False
def _have_autounmask_changes(self):
digraph_nodes = self._dynamic_config.digraph.nodes
return (
any(
x in digraph_nodes
for x in self._dynamic_config._needed_unstable_keywords
)
or any(
x in digraph_nodes for x in self._dynamic_config._needed_p_mask_changes
)
or any(
x in digraph_nodes
for x in self._dynamic_config._needed_use_config_changes
)
or any(
x in digraph_nodes for x in self._dynamic_config._needed_license_changes
)
)
def need_config_reload(self):
return self._dynamic_config._need_config_reload
def autounmask_breakage_detected(self):
try:
for pargs, kwargs in self._dynamic_config._unsatisfied_deps_for_display:
self._show_unsatisfied_dep(
*pargs, check_autounmask_breakage=True, **kwargs
)
except self._autounmask_breakage:
return True
return False
def get_backtrack_infos(self):
return self._dynamic_config._backtrack_infos
class _dep_check_composite_db(dbapi):
"""
A dbapi-like interface that is optimized for use in dep_check() calls.
This is built on top of the existing depgraph package selection logic.
Some packages that have been added to the graph may be masked from this
view in order to influence the atom preference selection that occurs
via dep_check().
"""
def __init__(self, depgraph, root):
dbapi.__init__(self)
self._depgraph = depgraph
self._root = root
self._match_cache = {}
self._cpv_pkg_map = {}
def _clear_cache(self):
self._match_cache.clear()
self._cpv_pkg_map.clear()
def cp_list(self, cp):
"""
Emulate cp_list just so it can be used to check for existence
of new-style virtuals. Since it's a waste of time to return
more than one cpv for this use case, a maximum of one cpv will
be returned.
"""
if isinstance(cp, Atom):
atom = cp
else:
atom = Atom(cp)
ret = []
for pkg in self._depgraph._iter_match_pkgs_any(
self._depgraph._frozen_config.roots[self._root], atom
):
if pkg.cp == cp:
ret.append(pkg.cpv)
break
return ret
def match_pkgs(self, atom):
cache_key = (atom, atom.unevaluated_atom)
ret = self._match_cache.get(cache_key)
if ret is not None:
for pkg in ret:
self._cpv_pkg_map[pkg.cpv] = pkg
return ret[:]
atom_set = InternalPackageSet(initial_atoms=(atom,))
ret = []
pkg, existing = self._depgraph._select_package(self._root, atom)
if pkg is not None and self._visible(pkg, atom_set):
ret.append(pkg)
if (
pkg is not None
and atom.sub_slot is None
and pkg.cp.startswith("virtual/")
and (
(
"remove" not in self._depgraph._dynamic_config.myparams
and "--update" not in self._depgraph._frozen_config.myopts
)
or not ret
)
):
# For new-style virtual lookahead that occurs inside dep_check()
# for bug #141118, examine all slots. This is needed so that newer
# slots will not unnecessarily be pulled in when a satisfying lower
# slot is already installed. For example, if virtual/jdk-1.5 is
# satisfied via gcj-jdk then there's no need to pull in a newer
# slot to satisfy a virtual/jdk dependency, unless --update is
# enabled.
sub_slots = set()
resolved_sub_slots = set()
for virt_pkg in self._depgraph._iter_match_pkgs_any(
self._depgraph._frozen_config.roots[self._root], atom
):
if virt_pkg.cp != pkg.cp:
continue
sub_slots.add((virt_pkg.slot, virt_pkg.sub_slot))
sub_slot_key = (pkg.slot, pkg.sub_slot)
if ret:
# We've added pkg to ret already, and only one package
# per slot/sub_slot is desired here.
sub_slots.discard(sub_slot_key)
resolved_sub_slots.add(sub_slot_key)
else:
sub_slots.add(sub_slot_key)
while sub_slots:
slot, sub_slot = sub_slots.pop()
slot_atom = atom.with_slot(f"{slot}/{sub_slot}")
pkg, existing = self._depgraph._select_package(self._root, slot_atom)
if not pkg:
continue
if not self._visible(pkg, atom_set, avoid_slot_conflict=False):
# Try to force a virtual update to be pulled in
# when appropriate for bug #526160.
selected = pkg
for candidate in self._iter_virt_update(pkg, atom_set):
if candidate.slot != slot:
continue
if (candidate.slot, candidate.sub_slot) in resolved_sub_slots:
continue
if selected is None or selected < candidate:
selected = candidate
if selected is pkg:
continue
pkg = selected
resolved_sub_slots.add((pkg.slot, pkg.sub_slot))
ret.append(pkg)
if len(ret) > 1:
ret = sorted(set(ret))
self._match_cache[cache_key] = ret
for pkg in ret:
self._cpv_pkg_map[pkg.cpv] = pkg
return ret[:]
def _visible(self, pkg, atom_set, avoid_slot_conflict=True, probe_virt_update=True):
if pkg.installed and not self._depgraph._want_installed_pkg(pkg):
return False
if pkg.installed and (
pkg.masks or not self._depgraph._pkg_visibility_check(pkg)
):
# Account for packages with masks (like KEYWORDS masks)
# that are usually ignored in visibility checks for
# installed packages, in order to handle cases like
# bug #350285.
myopts = self._depgraph._frozen_config.myopts
use_ebuild_visibility = myopts.get("--use-ebuild-visibility", "n") != "n"
avoid_update = (
"--update" not in myopts
and "remove" not in self._depgraph._dynamic_config.myparams
)
usepkgonly = "--usepkgonly" in myopts
if not avoid_update:
if not use_ebuild_visibility and usepkgonly:
return False
if not self._depgraph._equiv_ebuild_visible(pkg):
return False
if pkg.cp.startswith("virtual/"):
if not self._depgraph._virt_deps_visible(pkg, ignore_use=True):
return False
if probe_virt_update and self._have_virt_update(pkg, atom_set):
# Force virtual updates to be pulled in when appropriate
# for bug #526160.
return False
if not avoid_slot_conflict:
# This is useful when trying to pull in virtual updates,
# since we don't want another instance that was previously
# pulled in to mask an update that we're trying to pull
# into the same slot.
return True
# Use reversed iteration in order to get descending order here,
# so that the highest version involved in a slot conflict is
# selected (see bug 554070).
in_graph = next(
reversed(
list(
self._depgraph._dynamic_config._package_tracker.match(
self._root, pkg.slot_atom, installed=False
)
)
),
None,
)
if in_graph is None:
# Mask choices for packages which are not the highest visible
# version within their slot (since they usually trigger slot
# conflicts).
highest_visible, in_graph = self._depgraph._select_package(
self._root, pkg.slot_atom
)
# Note: highest_visible is not necessarily the real highest
# visible, especially when --update is not enabled, so use
# < operator instead of !=.
if (
highest_visible is not None
and pkg < highest_visible
and atom_set.findAtomForPackage(
highest_visible,
modified_use=self._depgraph._pkg_use_enabled(highest_visible),
)
):
return False
elif in_graph != pkg:
# Mask choices for packages that would trigger a slot
# conflict with a previously selected package.
if not atom_set.findAtomForPackage(
in_graph, modified_use=self._depgraph._pkg_use_enabled(in_graph)
):
# Only mask if the graph package matches the given
# atom (fixes bug #515230).
return True
return False
return True
def _iter_virt_update(self, pkg, atom_set):
if (
self._depgraph._select_atoms_parent is not None
and self._depgraph._want_update_pkg(
self._depgraph._select_atoms_parent, pkg
)
):
for new_child in self._depgraph._iter_similar_available(
pkg, next(iter(atom_set))
):
if not self._depgraph._virt_deps_visible(new_child, ignore_use=True):
continue
if not self._visible(
new_child,
atom_set,
avoid_slot_conflict=False,
probe_virt_update=False,
):
continue
yield new_child
def _have_virt_update(self, pkg, atom_set):
for new_child in self._iter_virt_update(pkg, atom_set):
if pkg < new_child:
return True
return False
def aux_get(self, cpv, wants):
metadata = self._cpv_pkg_map[cpv]._metadata
return [metadata.get(x, "") for x in wants]
def match(self, atom):
return [pkg.cpv for pkg in self.match_pkgs(atom)]
def ambiguous_package_name(arg, atoms, root_config, spinner, myopts):
if "--quiet" in myopts:
writemsg(
f'!!! The short ebuild name "{arg}" is ambiguous. Please specify\n',
noiselevel=-1,
)
writemsg(
"!!! one of the following fully-qualified ebuild names instead:\n\n",
noiselevel=-1,
)
for cp in sorted({portage.dep_getkey(atom) for atom in atoms}):
writemsg(" " + colorize("INFORM", cp) + "\n", noiselevel=-1)
return
s = search(
root_config,
spinner,
"--searchdesc" in myopts,
"--quiet" not in myopts,
"--usepkg" in myopts,
"--usepkgonly" in myopts,
search_index=False,
)
null_cp = portage.dep_getkey(insert_category_into_atom(arg, "null"))
cat, atom_pn = portage.catsplit(null_cp)
s.searchkey = atom_pn
for cp in sorted({portage.dep_getkey(atom) for atom in atoms}):
s.addCP(cp)
s.output()
writemsg(
f'!!! The short ebuild name "{arg}" is ambiguous. Please specify\n',
noiselevel=-1,
)
writemsg(
"!!! one of the above fully-qualified ebuild names instead.\n\n", noiselevel=-1
)
def _spinner_start(spinner, myopts):
if spinner is None:
return
if "--quiet" not in myopts and (
"--pretend" in myopts
or "--ask" in myopts
or "--tree" in myopts
or "--verbose" in myopts
):
action = ""
if "--fetchonly" in myopts or "--fetch-all-uri" in myopts:
action = "fetched"
elif "--buildpkgonly" in myopts:
action = "built"
else:
action = "merged"
if (
"--tree" in myopts and action != "fetched"
): # Tree doesn't work with fetching
if "--unordered-display" in myopts:
portage.writemsg_stdout(
"\n"
+ darkgreen("These are the packages that " + f"would be {action}:")
+ "\n\n"
)
else:
portage.writemsg_stdout(
"\n"
+ darkgreen(
"These are the packages that "
+ f"would be {action}, in reverse order:"
)
+ "\n\n"
)
else:
portage.writemsg_stdout(
"\n"
+ darkgreen(
"These are the packages that " + f"would be {action}, in order:"
)
+ "\n\n"
)
show_spinner = "--quiet" not in myopts and "--nodeps" not in myopts
if not show_spinner:
spinner.update = spinner.update_quiet
if show_spinner:
portage.writemsg_stdout("Calculating dependencies ")
spinner.start_time = time.time()
def _spinner_stop(spinner, backtracked: int = -1, max_retries: int = -1):
if spinner is None or spinner.update == spinner.update_quiet:
return
if spinner.update != spinner.update_basic:
# update_basic is used for non-tty output,
# so don't output backspaces in that case.
portage.writemsg_stdout("\b\b")
portage.writemsg_stdout("... done!\n")
stop_time = time.time()
time_fmt = f"{stop_time - spinner.start_time:.2f}"
backtrack_info = ""
if backtracked >= 0:
backtrack_info = f" (backtrack: {backtracked}/{max_retries})"
portage.writemsg_stdout(
f"Dependency resolution took {darkgreen(time_fmt)} s{backtrack_info}.\n\n"
)
def backtrack_depgraph(
settings: portage.package.ebuild.config.config,
trees: portage._trees_dict,
myopts: dict[str, Union[str, int, bool]],
myparams: dict[str, Union[int, str, bool]],
myaction: Optional[str],
myfiles: list[str],
spinner: "_emerge.stdout_spinner.stdout_spinner",
frozen_config: Optional[_frozen_depgraph_config] = None,
) -> tuple[Any, depgraph, list[str]]:
"""
Raises PackageSetNotFound if myfiles contains a missing package set.
"""
backtracked, max_retries = -1, -1
_spinner_start(spinner, myopts)
try:
success, mydepgraph, favorites, backtracked, max_retries = _backtrack_depgraph(
settings, trees, myopts, myparams, myaction, myfiles, spinner
)
return (success, mydepgraph, favorites)
finally:
_spinner_stop(spinner, backtracked, max_retries)
def _backtrack_depgraph(
settings: portage.package.ebuild.config.config,
trees: portage._trees_dict,
myopts: dict[str, Union[str, int, bool]],
myparams: dict[str, Union[int, str, bool]],
myaction: Optional[str],
myfiles: list[str],
spinner: "_emerge.stdout_spinner.stdout_spinner",
frozen_config: Optional[_frozen_depgraph_config] = None,
) -> tuple[Any, depgraph, list[str], int, int]:
debug = "--debug" in myopts
mydepgraph = None
nodeps = "--nodeps" in myopts
max_retries = 0 if nodeps else myopts.get("--backtrack", 20)
max_depth = max(1, (max_retries + 1) // 2)
allow_backtracking = max_retries > 0
backtracker = Backtracker(max_depth)
backtracked = 0
if frozen_config is None:
frozen_config = _frozen_depgraph_config(
settings, trees, myopts, myparams, spinner
)
while backtracker:
if debug and mydepgraph is not None:
writemsg_level(
f"\n\nbacktracking try {backtracked} \n\n",
noiselevel=-1,
level=logging.DEBUG,
)
mydepgraph.display_problems()
backtrack_parameters = backtracker.get()
if debug and backtrack_parameters.runtime_pkg_mask:
writemsg_level(
f"\n\nruntime_pkg_mask: {backtrack_parameters.runtime_pkg_mask} \n\n",
noiselevel=-1,
level=logging.DEBUG,
)
mydepgraph = depgraph(
settings,
trees,
myopts,
myparams,
spinner,
frozen_config=frozen_config,
allow_backtracking=allow_backtracking,
backtrack_parameters=backtrack_parameters,
)
success, favorites = mydepgraph.select_files(myfiles)
if success or mydepgraph.need_config_change():
break
elif not allow_backtracking:
break
elif backtracked >= max_retries:
break
elif mydepgraph.need_restart():
backtracked += 1
backtracker.feedback(mydepgraph.get_backtrack_infos())
elif backtracker:
backtracked += 1
if backtracked and not success and not mydepgraph.need_display_problems():
if debug:
writemsg_level(
f"\n\nbacktracking aborted after {backtracked} tries\n\n",
noiselevel=-1,
level=logging.DEBUG,
)
mydepgraph.display_problems()
mydepgraph = depgraph(
settings,
trees,
myopts,
myparams,
spinner,
frozen_config=frozen_config,
allow_backtracking=False,
backtrack_parameters=backtracker.get_best_run(),
)
success, favorites = mydepgraph.select_files(myfiles)
if not success and mydepgraph.autounmask_breakage_detected():
if debug:
writemsg_level(
"\n\nautounmask breakage detected\n\n",
noiselevel=-1,
level=logging.DEBUG,
)
mydepgraph.display_problems()
myparams["autounmask"] = False
mydepgraph = depgraph(
settings,
trees,
myopts,
myparams,
spinner,
frozen_config=frozen_config,
allow_backtracking=False,
)
success, favorites = mydepgraph.select_files(myfiles)
return (success, mydepgraph, favorites, backtracked, max_retries)
def resume_depgraph(
settings: portage.package.ebuild.config.config,
trees: portage._trees_dict,
mtimedb: Any,
myopts: dict[str, Union[str, int, bool]],
myparams: dict[str, Union[str, bool]],
spinner: "_emerge.stdout_spinner.stdout_spinner",
):
"""
Raises PackageSetNotFound if myfiles contains a missing package set.
"""
_spinner_start(spinner, myopts)
try:
return _resume_depgraph(settings, trees, mtimedb, myopts, myparams, spinner)
finally:
_spinner_stop(spinner)
def _resume_depgraph(
settings: portage.package.ebuild.config.config,
trees: portage._trees_dict,
mtimedb: Any,
myopts: dict[str, Union[str, int, bool]],
myparams: dict[str, Union[str, bool]],
spinner: "_emerge.stdout_spinner.stdout_spinner",
):
"""
Construct a depgraph for the given resume list. This will raise
PackageNotFound or depgraph.UnsatisfiedResumeDep when necessary.
TODO: Return reasons for dropped_tasks, for display/logging.
@rtype: tuple
@return: (success, depgraph, dropped_tasks)
"""
skip_masked = True
skip_unsatisfied = True
mergelist = mtimedb["resume"]["mergelist"]
dropped_tasks = {}
frozen_config = _frozen_depgraph_config(settings, trees, myopts, myparams, spinner)
while True:
mydepgraph = depgraph(
settings, trees, myopts, myparams, spinner, frozen_config=frozen_config
)
try:
success = mydepgraph._loadResumeCommand(
mtimedb["resume"], skip_masked=skip_masked
)
except depgraph.UnsatisfiedResumeDep as e:
if not skip_unsatisfied:
raise
graph = mydepgraph._dynamic_config.digraph
unsatisfied_parents = {}
traversed_nodes = set()
unsatisfied_stack = [(dep.parent, dep.atom) for dep in e.value]
while unsatisfied_stack:
pkg, atom = unsatisfied_stack.pop()
if (
atom is not None
and mydepgraph._select_pkg_from_installed(pkg.root, atom)[0]
is not None
):
continue
atoms = unsatisfied_parents.get(pkg)
if atoms is None:
atoms = []
unsatisfied_parents[pkg] = atoms
if atom is not None:
atoms.append(atom)
if pkg in traversed_nodes:
continue
traversed_nodes.add(pkg)
# If this package was pulled in by a parent
# package scheduled for merge, removing this
# package may cause the parent package's
# dependency to become unsatisfied.
for parent_node, atom in mydepgraph._dynamic_config._parent_atoms.get(
pkg, []
):
if not isinstance(
parent_node, Package
) or parent_node.operation not in ("merge", "nomerge"):
continue
# We need to traverse all priorities here, in order to
# ensure that a package with an unsatisfied dependency
# won't get pulled in, even indirectly via a soft
# dependency.
unsatisfied_stack.append((parent_node, atom))
unsatisfied_tuples = frozenset(
tuple(parent_node)
for parent_node in unsatisfied_parents
if isinstance(parent_node, Package)
)
pruned_mergelist = []
for x in mergelist:
if isinstance(x, list) and tuple(x) not in unsatisfied_tuples:
pruned_mergelist.append(x)
# If the mergelist doesn't shrink then this loop is infinite.
if len(pruned_mergelist) == len(mergelist):
# This happens if a package can't be dropped because
# it's already installed, but it has unsatisfied PDEPEND.
raise
mergelist[:] = pruned_mergelist
# Exclude installed packages that have been removed from the graph due
# to failure to build/install runtime dependencies after the dependent
# package has already been installed.
dropped_tasks.update(
(pkg, atoms)
for pkg, atoms in unsatisfied_parents.items()
if pkg.operation != "nomerge"
)
del e, graph, traversed_nodes, unsatisfied_parents, unsatisfied_stack
continue
else:
break
return (success, mydepgraph, dropped_tasks)
def get_mask_info(
root_config,
cpv,
pkgsettings,
db,
pkg_type,
built,
installed,
db_keys,
myrepo=None,
_pkg_use_enabled=None,
):
try:
metadata = dict(zip(db_keys, db.aux_get(cpv, db_keys, myrepo=myrepo)))
except KeyError:
metadata = None
if metadata is None:
mreasons = ["corruption"]
else:
eapi = metadata["EAPI"]
if not portage.eapi_is_supported(eapi):
mreasons = [f"EAPI {eapi}"]
else:
pkg = Package(
type_name=pkg_type,
root_config=root_config,
cpv=cpv,
built=built,
installed=installed,
metadata=metadata,
)
modified_use = None
if _pkg_use_enabled is not None:
modified_use = _pkg_use_enabled(pkg)
mreasons = get_masking_status(
pkg, pkgsettings, root_config, myrepo=myrepo, use=modified_use
)
return metadata, mreasons
def show_masked_packages(masked_packages):
shown_licenses = set()
shown_comments = set()
# Maybe there is both an ebuild and a binary. Only
# show one of them to avoid redundant appearance.
shown_cpvs = set()
have_eapi_mask = False
for root_config, pkgsettings, cpv, repo, metadata, mreasons in masked_packages:
output_cpv = cpv
if repo:
output_cpv += _repo_separator + repo
if output_cpv in shown_cpvs:
continue
shown_cpvs.add(output_cpv)
eapi_masked = metadata is not None and not portage.eapi_is_supported(
metadata["EAPI"]
)
if eapi_masked:
have_eapi_mask = True
# When masked by EAPI, metadata is mostly useless since
# it doesn't contain essential things like SLOT.
metadata = None
comment, filename = None, None
if not eapi_masked and "package.mask" in mreasons:
comment, filename = portage.getmaskingreason(
cpv,
metadata=metadata,
settings=pkgsettings,
portdb=root_config.trees["porttree"].dbapi,
return_location=True,
)
missing_licenses = []
if not eapi_masked and metadata is not None:
try:
missing_licenses = pkgsettings._getMissingLicenses(cpv, metadata)
except portage.exception.InvalidDependString:
# This will have already been reported
# above via mreasons.
pass
writemsg(
"- " + output_cpv + " (masked by: " + ", ".join(mreasons) + ")\n",
noiselevel=-1,
)
if comment and comment not in shown_comments:
writemsg(filename + ":\n" + comment + "\n", noiselevel=-1)
shown_comments.add(comment)
portdb = root_config.trees["porttree"].dbapi
for l in missing_licenses:
if l in shown_licenses:
continue
l_path = portdb.findLicensePath(l)
if l_path is None:
continue
msg = f"A copy of the '{l}' license is located at '{l_path}'.\n\n"
writemsg(msg, noiselevel=-1)
shown_licenses.add(l)
return have_eapi_mask
def show_mask_docs():
writemsg(
"For more information, see the MASKED PACKAGES " "section in the emerge\n",
noiselevel=-1,
)
writemsg("man page or refer to the Gentoo Handbook.\n", noiselevel=-1)
def show_blocker_docs_link():
writemsg(
"\nFor more information about "
+ bad("Blocked Packages")
+ ", please refer to the following\n",
noiselevel=-1,
)
writemsg(
"section of the Gentoo Linux x86 Handbook (architecture is irrelevant):\n\n",
noiselevel=-1,
)
writemsg(
"https://wiki.gentoo.org/wiki/Handbook:X86/Working/Portage#Blocked_packages\n\n",
noiselevel=-1,
)
def get_masking_status(pkg, pkgsettings, root_config, myrepo=None, use=None):
return [
mreason.message
for mreason in _get_masking_status(
pkg, pkgsettings, root_config, myrepo=myrepo, use=use
)
]
def _get_masking_status(pkg, pkgsettings, root_config, myrepo=None, use=None):
mreasons = _getmaskingstatus(
pkg,
settings=pkgsettings,
portdb=root_config.trees["porttree"].dbapi,
myrepo=myrepo,
)
if not pkg.installed:
if not pkgsettings._accept_chost(pkg.cpv, pkg._metadata):
mreasons.append(_MaskReason("CHOST", f"CHOST: {pkg._metadata['CHOST']}"))
if pkg.invalid:
for msgs in pkg.invalid.values():
for msg in msgs:
mreasons.append(_MaskReason("invalid", f"invalid: {msg}"))
if not pkg._metadata["SLOT"]:
mreasons.append(_MaskReason("invalid", "SLOT: undefined"))
return mreasons
|