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
use super::CodeGenerator;
use crate::compiler::ast::*;
use inkwell::values::*;
impl<'ctx> CodeGenerator<'ctx> {
// Helper to infer free and reduction indices from implicit tensor equation (RHS)
// Returns (Free Indices, Reduction Indices)
fn analyze_tensor_indices(&self, expr: &Expr) -> (Vec<String>, Vec<String>) {
let (free, reduction) = self.analyze_indices_recur(expr);
let mut free_vec: Vec<String> = free.into_iter().collect();
free_vec.sort();
let mut reduction_vec: Vec<String> = reduction.into_iter().collect();
reduction_vec.sort();
(free_vec, reduction_vec)
}
fn analyze_indices_recur(&self, expr: &Expr) -> (std::collections::HashSet<String>, std::collections::HashSet<String>) {
use std::collections::HashSet;
match &expr.inner {
ExprKind::BinOp(lhs, op, rhs) => {
let (lf, lr) = self.analyze_indices_recur(lhs);
let (rf, rr) = self.analyze_indices_recur(rhs);
let mut combined_reduction = lr;
combined_reduction.extend(rr);
match op {
BinOp::Mul => {
// Einstein Summation: Intersection of Free Indices becomes Reduction
let intersection: HashSet<_> = lf.intersection(&rf).cloned().collect();
combined_reduction.extend(intersection.clone());
let mut combined_free = HashSet::new();
for idx in lf.union(&rf) {
if !combined_reduction.contains(idx) {
combined_free.insert(idx.clone());
}
}
(combined_free, combined_reduction)
},
_ => {
// Add/Sub/etc: Union of Free, Union of Reduction
// (Assuming valid broadcast/shape compatibility)
let combined_free: HashSet<_> = lf.union(&rf).cloned().collect();
(combined_free, combined_reduction)
}
}
}
ExprKind::IndexAccess(_, idxs) => {
let mut free = HashSet::new();
for idx in idxs {
if let ExprKind::Variable(name) = &idx.inner {
if !self.variable_exists(name) {
free.insert(name.clone());
}
}
}
(free, HashSet::new())
}
ExprKind::UnOp(_, inner) => self.analyze_indices_recur(inner),
ExprKind::MethodCall(obj, _, args) => {
let (mut f, mut r) = self.analyze_indices_recur(obj);
for arg in args {
let (af, ar) = self.analyze_indices_recur(arg);
f.extend(af);
r.extend(ar);
}
(f, r)
}
ExprKind::StaticMethodCall(_, _, args) => {
let (mut f, mut r) = (HashSet::new(), HashSet::new());
for arg in args {
let (af, ar) = self.analyze_indices_recur(arg);
f.extend(af);
r.extend(ar);
}
(f, r)
}
ExprKind::FnCall(_, args) => {
let mut f = HashSet::new();
let mut r = HashSet::new();
for arg in args {
let (af, ar) = self.analyze_indices_recur(arg);
f.extend(af);
r.extend(ar);
}
(f, r)
}
ExprKind::IfExpr(cond, _, _) => {
self.analyze_indices_recur(cond)
}
ExprKind::TensorComprehension { .. } => {
// Nested implementation not fully supported in implicit analysis yet
(HashSet::new(), HashSet::new())
}
_ => (HashSet::new(), HashSet::new())
}
}
fn variable_exists(&self, name: &str) -> bool {
for scope in self.variables.iter().rev() {
if scope.contains_key(name) {
return true;
}
}
false
}
/// Copy struct contents from src to dst pointer (used for sret)
pub(crate) fn emit_struct_copy(
&mut self,
dst: inkwell::values::PointerValue<'ctx>,
src: inkwell::values::PointerValue<'ctx>,
ty: &Type,
) -> Result<(), String> {
match ty {
Type::Struct(name, generics) => {
// FIX: Check if name is already mangled (exists in struct_defs) before re-mangling
let mangled_name = if generics.is_empty() {
name.clone()
} else if self.struct_defs.contains_key(name) {
// Name is already mangled (e.g. HashMap_i64_i64), don't re-mangle
name.clone()
} else {
self.mangle_type_name(name, generics)
};
let effective_mangled_name = if self.struct_defs.contains_key(&mangled_name) {
mangled_name.clone()
} else if !generics.is_empty() {
// Recovery for double-mangled names
let mut found = None;
for def_name in self.struct_defs.keys() {
if name.starts_with(def_name) && name != def_name {
// Assuming checking existence of candidate mangled name isn't needed if we trust the prefix match + generics?
// Better to be safe: check if candidate exists in struct_types or defs?
// monomorphize_struct ensures it exists. Here we just read.
// Assuming it was created (by compile_struct_init or similar).
let candidate = self.mangle_type_name(def_name, generics);
if self.struct_defs.contains_key(&candidate) {
found = Some(candidate);
break;
}
}
}
found.unwrap_or(mangled_name)
} else {
mangled_name
};
// First check if it exists in struct_defs
if let Some(struct_def) = self.struct_defs.get(&effective_mangled_name) {
let struct_def = struct_def.clone();
// Try to get LLVM type, with fallback + on-demand monomorphization
let st_llvm_ty = if let Some(t) = self.struct_types.get(&effective_mangled_name) {
*t
} else {
// Fallback: try base type name (e.g., "Vec" for "Vec_Entry_i64_i64")
let base_name = mangle_base_name(&effective_mangled_name);
if let Some(t) = self.struct_types.get(base_name) {
*t
} else if !generics.is_empty() {
// On-demand monomorphization using original generics
self.monomorphize_struct(name, generics)
.map_err(|e| format!("On-demand monomorphization failed for {}<{:?}>: {}", name, generics, e))?
} else {
return Err(format!("LLVM struct type {} not found (also tried base {})", effective_mangled_name, base_name));
}
};
return self.copy_struct_fields(dst, src, &struct_def, st_llvm_ty);
}
// Fallback: Check if this is actually an Enum being passed as Struct
if let Some(enum_def) = self.enum_defs.get(&effective_mangled_name) {
// Entry_i64_i64-like enum: use memcpy for simplest approach
let _enum_def = enum_def.clone();
if let Some(enum_llvm_ty) = self.enum_types.get(&effective_mangled_name) {
let size = enum_llvm_ty.size_of().unwrap();
let void_ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let dst_cast = self.builder.build_pointer_cast(dst, void_ptr_ty, "dst_cast").unwrap();
let src_cast = self.builder.build_pointer_cast(src, void_ptr_ty, "src_cast").unwrap();
let memcpy = self.module.get_function("llvm.memcpy.p0.p0.i64")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let i64_ty = self.context.i64_type();
let i1_ty = self.context.bool_type();
let ft = void_ty.fn_type(&[ptr_ty.into(), ptr_ty.into(), i64_ty.into(), i1_ty.into()], false);
Some(self.module.add_function("llvm.memcpy.p0.p0.i64", ft, None))
}).unwrap();
self.builder.build_call(memcpy, &[
dst_cast.into(),
src_cast.into(),
size.into(),
self.context.bool_type().const_zero().into() // isVolatile = false
], "").unwrap();
return Ok(());
}
return Err(format!("LLVM enum type {} not found", effective_mangled_name));
}
Err(format!("Type {} not found in struct_defs or enum_defs ({})", name, effective_mangled_name))
}
Type::Enum(name, generics) => {
let mangled_name = if generics.is_empty() {
name.clone()
} else {
self.mangle_type_name(name, generics)
};
let enum_llvm_ty = if let Some(ty) = self.enum_types.get(&mangled_name) {
*ty
} else {
return Err(format!("LLVM enum type {} not found for copy", mangled_name));
};
let size = enum_llvm_ty.size_of().unwrap();
let void_ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let dst_cast = self.builder.build_pointer_cast(dst, void_ptr_ty, "dst_cast").unwrap();
let src_cast = self.builder.build_pointer_cast(src, void_ptr_ty, "src_cast").unwrap();
let memcpy = self.module.get_function("llvm.memcpy.p0.p0.i64")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let i64_ty = self.context.i64_type();
let i1_ty = self.context.bool_type();
let ft = void_ty.fn_type(&[ptr_ty.into(), ptr_ty.into(), i64_ty.into(), i1_ty.into()], false);
Some(self.module.add_function("llvm.memcpy.p0.p0.i64", ft, None))
}).unwrap();
self.builder.build_call(memcpy, &[
dst_cast.into(),
src_cast.into(),
size.into(),
self.context.bool_type().const_zero().into() // isVolatile = false
], "").unwrap();
Ok(())
}
Type::UnifiedType { base_name: _, type_args, mangled_name, is_enum } => {
// Flatten UnifiedType to Struct/Enum and re-dispatch
let flat_ty = if *is_enum {
Type::Enum(mangled_name.clone(), type_args.clone())
} else {
Type::Struct(mangled_name.clone(), type_args.clone())
};
self.emit_struct_copy(dst, src, &flat_ty)
}
_ => Err(format!(
"emit_struct_copy called on non-struct type: {:?}",
ty
)),
}
}
/// Helper function to copy struct fields from src to dst
fn copy_struct_fields(
&mut self,
dst: inkwell::values::PointerValue<'ctx>,
src: inkwell::values::PointerValue<'ctx>,
struct_def: &crate::compiler::ast::StructDef,
st_llvm_ty: inkwell::types::StructType<'ctx>,
) -> Result<(), String> {
for (i, (field_name, field_ty)) in struct_def.fields.iter().enumerate() {
let src_field_ptr = self
.builder
.build_struct_gep(st_llvm_ty, src, i as u32, &format!("src_{}", field_name))
.map_err(|e| e.to_string())?;
let dst_field_ptr = self
.builder
.build_struct_gep(st_llvm_ty, dst, i as u32, &format!("dst_{}", field_name))
.map_err(|e| e.to_string())?;
// Load field value from src
let llvm_field_ty: inkwell::types::BasicTypeEnum = match field_ty {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::I32 => self.context.i32_type().into(),
Type::Bool => self.context.bool_type().into(),
Type::Tensor(_, _) => self
.context
.ptr_type(inkwell::AddressSpace::default())
.into(),
Type::Struct(_name, _) | Type::Enum(_name, _) => {
self.context.ptr_type(inkwell::AddressSpace::default()).into()
}
_ => self.context.i64_type().into(),
};
let field_val = self
.builder
.build_load(llvm_field_ty, src_field_ptr, "field_val")
.map_err(|e| e.to_string())?;
// Deep Copy Logic:
let store_val = if matches!(
field_ty,
Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Struct(_, _)
| Type::Enum(_, _)
| Type::Tuple(_)
) {
self.emit_deep_clone(field_val, field_ty)?
} else {
field_val
};
// Store to dst
self.builder
.build_store(dst_field_ptr, store_val)
.map_err(|e| e.to_string())?;
}
Ok(())
}
pub(crate) fn emit_recursive_retain(
&mut self,
val: BasicValueEnum<'ctx>,
ty: &Type,
) -> Result<(), String> {
match ty {
Type::Tensor(_, _) | Type::TensorShaped(_, _) => {
let acquire_fn = self.module.get_function("tl_tensor_acquire")
.ok_or("tl_tensor_acquire not found")?;
let ptr = val.into_pointer_value();
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self.builder.build_pointer_cast(ptr, void_ptr_type, "cast_acq").map_err(|e| e.to_string())?;
self.builder.build_call(acquire_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
}
Type::String(_) | Type::Path(_, _) => {
let inc_fn = self.module.get_function("tl_ptr_inc_ref")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_ptr_inc_ref", ft, None))
})
.ok_or("tl_ptr_inc_ref decl failed")?;
let ptr = val.into_pointer_value();
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self.builder.build_pointer_cast(ptr, void_ptr_type, "cast_inc").map_err(|e| e.to_string())?;
self.builder.build_call(inc_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
}
Type::Enum(name, generics) => {
let mangled_name = if generics.is_empty() {
name.clone()
} else {
self.mangle_type_name(name, generics)
};
let enum_def = self
.enum_defs
.get(&mangled_name)
.or_else(|| self.enum_defs.get(name))
.or_else(|| self.enum_defs.get(mangle_base_name(name)))
.ok_or(format!("Enum def {} not found", mangled_name))?
.clone();
// On-demand monomorphize if enum_types doesn't have this specialization
if self.enum_types.get(&mangled_name).is_none() && !generics.is_empty() {
let base = mangle_base_name(name);
self.monomorphize_enum(base, generics).map_err(|e| e.to_string())?;
}
let enum_ty = self.enum_types.get(&mangled_name)
.or_else(|| self.enum_types.get(&enum_def.name))
.copied()
.ok_or(format!("Enum LLVM type {} not found", mangled_name))?;
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let ptr = if val.is_pointer_value() {
val.into_pointer_value()
} else {
let alloca = self.create_entry_block_alloca(func, "retain_spill", ty)?;
self.builder.build_store(alloca, val).map_err(|e| e.to_string())?;
alloca
};
// switch on tag
let tag_ptr = self.builder.build_struct_gep(enum_ty, ptr, 0, "tag_ptr").map_err(|e| e.to_string())?;
let tag_val = self.builder.build_load(self.context.i32_type(), tag_ptr, "tag").map_err(|e| e.to_string())?.into_int_value();
let after_switch = self.context.append_basic_block(func, "after_retain_enum_switch");
let mut cases = vec![];
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = self.context.append_basic_block(func, &format!("retain_variant_{}", variant.name));
cases.push((self.context.i32_type().const_int(i as u64, false), case_block));
}
let cases_refs: Vec<(inkwell::values::IntValue, inkwell::basic_block::BasicBlock)> =
cases.iter().map(|(i, b)| (*i, *b)).collect();
self.builder.build_switch(tag_val, after_switch, &cases_refs).map_err(|e| e.to_string())?;
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = cases[i].1;
self.builder.position_at_end(case_block);
let field_types_list = match &variant.kind {
crate::compiler::ast::VariantKind::Unit => vec![],
crate::compiler::ast::VariantKind::Tuple(types) => types.clone(),
crate::compiler::ast::VariantKind::Struct(fields) => fields.iter().map(|(_, t)| t.clone()).collect(),
crate::compiler::ast::VariantKind::Array(ty, size) => vec![ty.clone(); *size],
};
if !field_types_list.is_empty() {
let payload_ptr_raw = self.builder.build_struct_gep(enum_ty, ptr, 1, "payload_ptr_raw").map_err(|e| e.to_string())?;
let mut field_types: Vec<inkwell::types::BasicTypeEnum> = vec![];
for ty in &field_types_list {
let llvm_ty = self.get_llvm_type(ty).expect("Failed to get type for retain");
field_types.push(llvm_ty);
}
let variant_struct_ty = self.context.struct_type(&field_types, false);
let payload_ptr = self.builder.build_pointer_cast(
payload_ptr_raw,
self.context.ptr_type(inkwell::AddressSpace::default()),
"payload_cast",
).unwrap();
for (idx, f_ty) in field_types_list.iter().enumerate() {
if matches!(f_ty, Type::Tensor(_, _) | Type::TensorShaped(_, _) | Type::Struct(_, _) | Type::Enum(_, _) | Type::String(_) | Type::Tuple(_)) {
let f_ptr = self.builder.build_struct_gep(variant_struct_ty, payload_ptr, idx as u32, "field_ptr").map_err(|e| e.to_string())?;
let f_val = self.builder.build_load(self.context.ptr_type(inkwell::AddressSpace::default()), f_ptr, "field_val").map_err(|e| e.to_string())?;
self.emit_recursive_retain(f_val, f_ty)?;
}
}
}
self.builder.build_unconditional_branch(after_switch).unwrap();
}
self.builder.position_at_end(after_switch);
}
Type::Struct(name, generics) => {
let mangled_name = if generics.is_empty() { name.clone() } else { self.mangle_type_name(name, generics) };
if let Some(struct_def) = self.struct_defs.get(&mangled_name).cloned() {
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let ptr = if val.is_pointer_value() {
val.into_pointer_value()
} else {
let alloca = self.create_entry_block_alloca(func, "retain_spill_struct", ty)?;
self.builder.build_store(alloca, val).map_err(|e| e.to_string())?;
alloca
};
// FIX: 構造体ポインタ自体の参照カウントも増加する。
// emit_recursive_free の tl_ptr_dec_ref と対称にする。
// これがないと FieldAccess → let → CLEANUP_FULL のパスで
// RC が 0 になり Use-After-Free が発生する。
{
let inc_fn = self.module.get_function("tl_ptr_inc_ref")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_ptr_inc_ref", ft, None))
})
.ok_or("tl_ptr_inc_ref decl failed")?;
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self.builder.build_pointer_cast(ptr, void_ptr_type, "cast_inc_struct").map_err(|e| e.to_string())?;
self.builder.build_call(inc_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
}
let st_llvm_ty = *self.struct_types.get(&mangled_name).unwrap();
for (i, (_, f_ty)) in struct_def.fields.iter().enumerate() {
if matches!(f_ty, Type::Tensor(_, _) | Type::TensorShaped(_, _) | Type::Struct(_, _) | Type::Enum(_, _) | Type::String(_) | Type::Tuple(_)) {
let f_ptr = self.builder.build_struct_gep(st_llvm_ty, ptr, i as u32, "field_ptr").map_err(|e| e.to_string())?;
let f_val = self.builder.build_load(self.context.ptr_type(inkwell::AddressSpace::default()), f_ptr, "field_val").map_err(|e| e.to_string())?;
self.emit_recursive_retain(f_val, f_ty)?;
}
}
} else {
let inc_fn = self.module.get_function("tl_ptr_inc_ref")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_ptr_inc_ref", ft, None))
})
.ok_or("tl_ptr_inc_ref decl failed")?;
let ptr = val.into_pointer_value();
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self.builder.build_pointer_cast(ptr, void_ptr_type, "cast_inc").map_err(|e| e.to_string())?;
self.builder.build_call(inc_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
}
}
Type::Tuple(elem_types) => {
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let ptr = if val.is_pointer_value() {
val.into_pointer_value()
} else {
let alloca = self.create_entry_block_alloca(func, "retain_spill_tuple", ty)?;
self.builder.build_store(alloca, val).map_err(|e| e.to_string())?;
alloca
};
let mut field_types = vec![];
for ty in elem_types {
field_types.push(self.get_llvm_type(ty).unwrap());
}
let tuple_ty = self.context.struct_type(&field_types, false);
for (i, elem_ty) in elem_types.iter().enumerate() {
if matches!(elem_ty, Type::Tensor(_, _) | Type::TensorShaped(_, _) | Type::Struct(_, _) | Type::Enum(_, _) | Type::String(_) | Type::Tuple(_)) {
let f_ptr = self.builder.build_struct_gep(tuple_ty, ptr, i as u32, "tuple_elem_ptr").map_err(|e| e.to_string())?;
let f_val = self.builder.build_load(self.context.ptr_type(inkwell::AddressSpace::default()), f_ptr, "elem_val").map_err(|e| e.to_string())?;
self.emit_recursive_retain(f_val, elem_ty)?;
}
}
}
_ => {}
}
Ok(())
}
pub(crate) fn emit_recursive_free(
&mut self,
val: BasicValueEnum<'ctx>,
ty: &Type,
mode: u8,
) -> Result<(), String> {
if mode == super::CLEANUP_NONE {
return Ok(());
}
match ty {
Type::Enum(name, generics) => {
let mangled_name = if generics.is_empty() {
name.clone()
} else {
self.mangle_type_name(name, generics)
};
// Try to find enum_def, with fallback for generic enums
let mut enum_def = self
.enum_defs
.get(&mangled_name)
.or_else(|| self.enum_defs.get(name))
.or_else(|| self.enum_defs.get(mangle_base_name(name)))
.ok_or(format!("Enum def {} not found ({})", name, mangled_name))?
.clone();
// If still generic, monomorphize with default type
if !enum_def.generics.is_empty() {
let default_generics = vec![Type::I64; enum_def.generics.len()];
let default_mangled = self.mangle_type_name(name, &default_generics);
if let Some(specialized) = self.enum_defs.get(&default_mangled) {
enum_def = specialized.clone();
} else {
self.monomorphize_enum(name, &default_generics).map_err(|e| e.to_string())?;
enum_def = self.enum_defs.get(&default_mangled)
.ok_or(format!("Failed to monomorphize {} -> {}", name, default_mangled))?
.clone();
}
}
// Get enum type with fallback
let enum_ty = if let Some(ty) = self.enum_types.get(&enum_def.name) {
*ty
} else if let Some(ty) = self.enum_types.get(&mangled_name) {
*ty
} else {
// Try to compile on-demand
self.compile_enum_defs(&[enum_def.clone()])?;
*self.enum_types.get(&enum_def.name)
.ok_or(format!("Enum type {} not found (tried {} and {})", name, enum_def.name, mangled_name))?
};
let ptr = val.into_pointer_value();
// Runtime Null Check
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let free_block = self.context.append_basic_block(func, "free_enum");
let merge_block = self.context.append_basic_block(func, "after_free_enum");
let is_null = self
.builder
.build_is_null(ptr, "is_null")
.map_err(|e| e.to_string())?;
self.builder
.build_conditional_branch(is_null, merge_block, free_block)
.map_err(|e| e.to_string())?;
self.builder.position_at_end(free_block);
// Load Tag (Element 0)
let tag_ptr = self
.builder
.build_struct_gep(enum_ty, ptr, 0, "tag_ptr")
.map_err(|e| e.to_string())?;
let tag_val = self
.builder
.build_load(self.context.i32_type(), tag_ptr, "tag")
.map_err(|e| e.to_string())?
.into_int_value();
// Prepare Switch
let after_switch = self.context.append_basic_block(func, "after_enum_switch");
let mut cases = vec![];
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = self
.context
.append_basic_block(func, &format!("free_variant_{}", variant.name));
cases.push((
self.context.i32_type().const_int(i as u64, false),
case_block,
));
}
// Build Switch
let cases_refs: Vec<(inkwell::values::IntValue, inkwell::basic_block::BasicBlock)> =
cases.iter().map(|(i, b)| (*i, *b)).collect();
self.builder
.build_switch(tag_val, after_switch, &cases_refs)
.map_err(|e| e.to_string())?;
// Populate Cases
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = cases[i].1;
self.builder.position_at_end(case_block);
let field_types_list = match &variant.kind {
crate::compiler::ast::VariantKind::Unit => vec![],
crate::compiler::ast::VariantKind::Tuple(types) => types.clone(),
crate::compiler::ast::VariantKind::Struct(fields) => fields.iter().map(|(_, t)| t.clone()).collect(),
crate::compiler::ast::VariantKind::Array(ty, size) => vec![ty.clone(); *size],
};
if !field_types_list.is_empty() {
// Cast Payload (Element 1 is [i8 x N])
let payload_ptr_raw = self
.builder
.build_struct_gep(enum_ty, ptr, 1, "payload_ptr_raw")
.map_err(|e| e.to_string())?;
// Reconstruct Variant Struct Type for GEP
let mut field_types: Vec<inkwell::types::BasicTypeEnum> = vec![];
for ty in &field_types_list {
let llvm_ty = match ty {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::Bool => self.context.bool_type().into(),
Type::Tensor(_, _) => self
.context
.ptr_type(inkwell::AddressSpace::default())
.into(),
Type::Struct(_, _) | Type::Enum(_, _) => self
.context
.ptr_type(inkwell::AddressSpace::default())
.into(),
_ => self.context.i64_type().into(),
};
field_types.push(llvm_ty);
}
let variant_struct_ty = self.context.struct_type(&field_types, false);
// Cast payload ptr to variant struct ptr
let payload_ptr = self
.builder
.build_pointer_cast(
payload_ptr_raw,
self.context.ptr_type(inkwell::AddressSpace::default()), // Opaque ptr
"payload_cast",
)
.unwrap();
for (idx, f_ty) in field_types_list.iter().enumerate() {
if matches!(
f_ty,
Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Struct(_, _)
| Type::Enum(_, _)
| Type::Tuple(_)
) {
let f_ptr = self
.builder
.build_struct_gep(
variant_struct_ty,
payload_ptr,
idx as u32,
"field_ptr",
)
.map_err(|e| e.to_string())?;
let f_val = self
.builder
.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
f_ptr,
"field_val",
)
.map_err(|e| e.to_string())?;
// Recursive calls use DEFAULT (FULL) cleanup for contents
// Fix: Convert Struct to Enum if it's actually an Enum (e.g. Entry_i64_i64)
let effective_ty = if let Type::Struct(s_name, s_args) = f_ty {
if self.enum_defs.contains_key(s_name) {
Type::Enum(s_name.clone(), s_args.clone())
} else {
f_ty.clone()
}
} else {
f_ty.clone()
};
self.emit_recursive_free(f_val, &effective_ty, super::CLEANUP_FULL)?;
}
}
}
// After recursive calls, branch from current position to after_switch
if self.builder.get_insert_block().unwrap().get_terminator().is_none() {
self.builder.build_unconditional_branch(after_switch).unwrap();
}
}
self.builder.position_at_end(after_switch);
if self.builder.get_insert_block().unwrap().get_terminator().is_none() {
self.builder.build_unconditional_branch(merge_block).unwrap();
}
self.builder.position_at_end(merge_block);
}
Type::Tensor(_, _) | Type::TensorShaped(_, _) => {
if !val.is_pointer_value() {
return Err(format!("Tensor value is not pointer: {:?}", val));
}
let ptr = val.into_pointer_value();
// Runtime Null Check
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let free_block = self.context.append_basic_block(func, "free_tensor");
let merge_block = self.context.append_basic_block(func, "after_free");
let is_null = self
.builder
.build_is_null(ptr, "is_null")
.map_err(|e| e.to_string())?;
self.builder
.build_conditional_branch(is_null, merge_block, free_block)
.map_err(|e| e.to_string())?;
self.builder.position_at_end(free_block);
// テンソルは Arc で所有権管理されるため、構造体用の tl_ptr_dec_ref チェックは不要。
// Arc::from_raw → drop で参照カウントが -1 され、RC=0 で自然に Drop される。
let void_ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let _cast_void = self.builder
.build_pointer_cast(ptr, void_ptr_ty, "tensor_void_cast")
.unwrap();
if mode == super::CLEANUP_FINALIZE {
// Call tl_tensor_finalize (Drop content, Keep struct)
let finalize_fn = self
.module
.get_function("tl_tensor_finalize")
.or_else(|| {
// Declare if missing
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_tensor_finalize", ft, None))
})
.ok_or("tl_tensor_finalize not found")?;
self.builder.build_call(finalize_fn, &[val.into()], "").map_err(|e| e.to_string())?;
} else {
// Call tl_tensor_release_safe (safe data-clear method)
let free_fn = self
.module
.get_function("tl_tensor_release_safe")
.or_else(|| {
// Declare if missing
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_tensor_release_safe", ft, None))
})
.ok_or("tl_tensor_release_safe not found")?;
self.builder
.build_call(free_fn, &[val.into()], "")
.map_err(|e| e.to_string())?;
}
self.builder
.build_unconditional_branch(merge_block)
.map_err(|e| e.to_string())?;
self.builder.position_at_end(merge_block);
}
Type::Struct(name, generic_args) => {
// Check if it's a pointer before treating it as a heap-allocated struct
// Primitives like u8 might be represented as Struct("u8") but are IntValue
if !val.is_pointer_value() {
return Ok(());
}
// Generic Tensor wrapper (special case) must take precedence over Struct cleanup
if name == "Tensor" {
// Force Tensor handling regardless of Struct definition
return self.emit_recursive_free(val, &Type::Tensor(Box::new(Type::F32), 1), mode);
}
let ptr = val.into_pointer_value();
// 1. Resolve Name
let mangled_name = if generic_args.is_empty() {
let simple_name = name.as_str();
simple_name.to_string()
} else {
self.mangle_type_name(name, generic_args)
};
// 2. Check for existence of definition (Struct OR Enum)
let struct_def_opt = self.struct_defs.get(&mangled_name).cloned();
// Check enum defaults if struct missing (for RefCounted Enums passed as Structs)
let enum_def_opt = if struct_def_opt.is_none() {
self.enum_defs.get(&mangled_name).cloned()
} else {
None
};
// 3. Check for dedicated free method (custom destructor)
let simple_name = name.as_str();
// Monomorphize 'free' method name if generic
let runtime_name_res = if !generic_args.is_empty() {
self.monomorphize_method(simple_name, "free", generic_args)
} else {
self.monomorphize_method(simple_name, "free", generic_args)
};
let has_free_method = if let Ok(n) = &runtime_name_res {
self.module.get_function(n).is_some()
} else {
// Check legacy
let legacy_name = crate::compiler::codegen::builtin_types::resolver::resolve_static_method_name(
name, "free", generic_args
);
self.module.get_function(&legacy_name).is_some()
};
// If NO def and NO free method, we can't do anything. Return early.
if struct_def_opt.is_none() && enum_def_opt.is_none() && !has_free_method {
// Avoid creating empty blocks
return Ok(());
}
// --- Proceed with Generation ---
// Define Basic Blocks
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let merge_block = self.context.append_basic_block(func, "after_free");
// Unregister from Runtime Scope (Safety against double free)
if let Some(unreg_fn) = self.module.get_function("tl_mem_unregister") {
let void_ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let cast = self.builder.build_pointer_cast(ptr, void_ptr_ty, "unreg_cast").unwrap();
self.builder.build_call(unreg_fn, &[cast.into()], "").ok();
}
// RefCount Check (DecRef)
let dec_ref_fn = self
.module
.get_function("tl_ptr_dec_ref")
.ok_or("tl_ptr_dec_ref not found")?;
let cast_void = self.builder.build_pointer_cast(
ptr,
self.context.ptr_type(inkwell::AddressSpace::default()),
"cast_void"
).unwrap();
let call = self
.builder
.build_call(dec_ref_fn, &[cast_void.into()], "should_free")
.map_err(|e| e.to_string())?;
let should_free_val = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_int_value(),
_ => return Err("tl_ptr_dec_ref returned void/invalid".to_string()),
};
let should_free = self.builder.build_int_compare(
inkwell::IntPredicate::NE,
should_free_val,
self.context.i32_type().const_int(0, false),
"should_free_bool"
).map_err(|e| e.to_string())?;
let recurse_block = self.context.append_basic_block(func, "recurse_free");
self.builder.build_conditional_branch(should_free, recurse_block, merge_block)
.map_err(|e| e.to_string())?;
// --- Recurse Block (Destruction) ---
self.builder.position_at_end(recurse_block);
// A. Custom Destructor (Method "free")
if let Ok(runtime_name) = runtime_name_res {
if let Some(fn_val) = self.module.get_function(&runtime_name) {
self.builder.build_call(fn_val, &[val.into()], "").map_err(|e| e.to_string())?;
self.builder.build_unconditional_branch(merge_block).unwrap();
self.builder.position_at_end(merge_block);
return Ok(());
}
} else {
let legacy_name = crate::compiler::codegen::builtin_types::resolver::resolve_static_method_name(
name, "free", generic_args
);
if let Some(fn_val) = self.module.get_function(&legacy_name) {
self.builder.build_call(fn_val, &[val.into()], "").map_err(|e| e.to_string())?;
self.builder.build_unconditional_branch(merge_block).unwrap();
self.builder.position_at_end(merge_block);
return Ok(());
}
}
// If generic Tensor wrapper (special case, legacy)
if name == "Tensor" {
return self.emit_recursive_free(val, &Type::Tensor(Box::new(Type::F32), 1), mode);
}
// B. Enum Cleanup Fallback
if let Some(enum_def) = enum_def_opt {
// It's an Enum (e.g. Entry<K,V>) masquerading as Struct.
// Recurse using Type::Enum to trigger switch-based field cleanup.
// DEBUG: Inspect fields to see if they are generic
for variant in &enum_def.variants {
eprintln!(" Variant {}: {:?}", variant.name, variant.kind);
}
self.emit_recursive_free(val, &Type::Enum(name.clone(), generic_args.clone()), super::CLEANUP_FULL)?;
// Fallthrough to 'free_struct_memory' below...
} else if let Some(struct_def) = struct_def_opt {
// C. Structural Cleanup (Struct Fields)
// Stack Cleanup Loop?
if mode == super::CLEANUP_STACK {
// Stack mode logic (omitted/simplified for brevity? Original code had it.)
// Assuming heap managed struct for now if RefCounted.
}
for (i, (_, f_ty)) in struct_def.fields.iter().enumerate() {
// ZST Check logic
if let Type::Struct(s_name, _) = f_ty {
let simple_s_name = s_name.as_str();
if let Some(def) = self.struct_defs.get(simple_s_name) {
if def.fields.is_empty() { continue; }
}
}
match f_ty {
Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Struct(_, _)
| Type::Enum(_, _)
| Type::Tuple(_) => {
let f_ptr = self.builder.build_struct_gep(
*self.struct_types.get(&mangled_name).unwrap(), // Safe: checked existence
ptr, i as u32, "field_gep"
).map_err(|e| e.to_string())?;
let f_val = self.builder.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
f_ptr, "field_load"
).map_err(|e| e.to_string())?;
self.emit_recursive_free(f_val, f_ty, super::CLEANUP_FULL)?;
}
_ => {}
}
}
}
// D. Free Wrapper Memory
// Skip for Vec (stack value semantics)
if name != "Vec" {
let mem_free_fn = self.module.get_function("tl_mem_free")
.ok_or("tl_mem_free not found")?;
// self.emit_log_free(val)?;
self.builder.build_call(mem_free_fn, &[cast_void.into()], "").map_err(|e| e.to_string())?;
}
self.builder.build_unconditional_branch(merge_block)
.map_err(|e| e.to_string())?;
self.builder.position_at_end(merge_block);
}
Type::String(_) => {
let free_fn = self
.module
.get_function("tl_string_free")
.or_else(|| {
let void_ty = self.context.void_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = void_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_string_free", ft, None))
})
.ok_or("tl_string_free not found")?;
let ptr = val.into_pointer_value();
// Runtime null check
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let free_block = self.context.append_basic_block(func, "free_string");
let merge_block = self.context.append_basic_block(func, "after_string_free");
let is_null = self.builder.build_is_null(ptr, "is_null_str").map_err(|e| e.to_string())?;
self.builder.build_conditional_branch(is_null, merge_block, free_block).map_err(|e| e.to_string())?;
self.builder.position_at_end(free_block);
// Cast to opaque pointer if needed (though StringStruct* is ptr)
let cast_ptr = self.builder.build_pointer_cast(ptr, self.context.ptr_type(inkwell::AddressSpace::default()), "cast_str").unwrap();
self.builder.build_call(free_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
self.builder.build_unconditional_branch(merge_block).unwrap();
self.builder.position_at_end(merge_block);
return Ok(());
}
Type::Tuple(elem_types) => {
// Check if any element needs freeing
let needs_free = elem_types.iter().any(|t| matches!(t, Type::Tensor(_, _) | Type::Struct(_, _)));
if !needs_free {
return Ok(());
}
let ptr = val.into_pointer_value();
// Reconstruct LLVM struct type for GEP
let mut llvm_types = Vec::new();
for ty in elem_types {
// Need get_llvm_type accessible or inline mapping
// Using simpler match map since self.get_llvm_type might be restricted?
// Actually self.context...
llvm_types.push(match ty {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::I32 => self.context.i32_type().into(),
Type::Bool => self.context.bool_type().into(),
Type::Tensor(_, _) | Type::Struct(_, _) | Type::Enum(_, _) | Type::Tuple(_) => self.context.ptr_type(inkwell::AddressSpace::default()).into(),
Type::Void => self.context.i8_type().into(),
_ => self.context.i64_type().into(), // Placeholder, potentially unsafe if not matching
});
}
let struct_ty = self.context.struct_type(&llvm_types, false);
for (i, ty) in elem_types.iter().enumerate() {
if matches!(ty, Type::Tensor(_, _) | Type::String(_) | Type::Struct(_, _)) {
let f_ptr = self.builder.build_struct_gep(struct_ty, ptr, i as u32, "tup_elem").unwrap();
let load = self.builder.build_load(self.context.ptr_type(inkwell::AddressSpace::default()), f_ptr, "load").unwrap();
self.emit_recursive_free(load, ty, super::CLEANUP_FULL)?;
}
}
// Only free content. The tuple struct itself?
// Usually tuple struct is Alloc'd. We should free it if it's heap?
// But tuples in TL might be fully structural?
// Current impl allocates tuples on Heap (malloc).
// So we should free the tuple pointer too.
// Assuming CLEANUP_FULL.
if mode == super::CLEANUP_FULL {
let free = self.module.get_function("free").or_else(|| self.module.get_function("libc_free"));
if let Some(f) = free {
self.builder.build_call(f, &[ptr.into()], "").unwrap();
}
}
}
_ => {}
}
Ok(())
}
pub(crate) fn emit_recursive_unregister(
&self,
val: BasicValueEnum<'ctx>,
ty: &Type,
) -> Result<(), String> {
match ty {
Type::Tensor(_, _) | Type::TensorShaped(_, _) => {
// Check if pointer
if !val.is_pointer_value() {
return Ok(()); // Should not happen for tensor
}
let ptr = val.into_pointer_value();
let unreg_fn = self.module.get_function("tl_mem_unregister")
.ok_or("tl_mem_unregister not found")?;
// Check Null?
// Logic usually assumes non-null if registered. But let's build null check for safety?
// Runtime handles null check.
let cast_ptr = self.builder.build_pointer_cast(
ptr,
self.context.ptr_type(inkwell::AddressSpace::default()),
"cast_unreg_tens"
).unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
}
Type::Struct(name, _) => {
if name == "Tensor" {
return self.emit_recursive_unregister(val, &Type::Tensor(Box::new(Type::F32), 1));
}
let simple_name = name.as_str();
// Some structs might be opaque or non-existent (e.g. String wrapper)
if simple_name == "String" {
// String is a struct but generally treated as scalar resource.
// But if it is registered, we should unregister it.
let ptr = val.into_pointer_value();
let unreg_fn = self.module.get_function("tl_mem_unregister")
.ok_or("tl_mem_unregister not found")?;
let cast_ptr = self.builder.build_pointer_cast(ptr, self.context.ptr_type(inkwell::AddressSpace::default()), "cast_unreg_str").unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
return Ok(());
}
let struct_def = self.struct_defs.get(simple_name)
.ok_or(format!("Struct def {} not found", name))?
.clone();
let struct_ty = *self.struct_types.get(simple_name)
.ok_or(format!("Struct type {} not found", name))?;
let ptr = val.into_pointer_value();
// 1. Unregister the Struct itself
let unreg_fn = self.module.get_function("tl_mem_unregister")
.ok_or("tl_mem_unregister not found")?;
let cast_ptr = self.builder.build_pointer_cast(
ptr,
self.context.ptr_type(inkwell::AddressSpace::default()),
"cast_unreg_struct"
).unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
// 2. Recurse fields
for (i, (_, f_ty)) in struct_def.fields.iter().enumerate() {
match f_ty {
Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Struct(_, _)
| Type::Enum(_, _)
| Type::Tuple(_) => {
let f_ptr = self.builder.build_struct_gep(struct_ty, ptr, i as u32, "field_gep_unreg")
.map_err(|e| e.to_string())?;
let f_val = self.builder.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
f_ptr,
"field_val_unreg"
).map_err(|e| e.to_string())?;
self.emit_recursive_unregister(f_val, f_ty)?;
}
_ => {}
}
}
}
Type::Tuple(types) => {
let ptr = val.into_pointer_value();
let unreg_fn = self.module.get_function("tl_mem_unregister")
.ok_or("tl_mem_unregister not found")?;
let cast_ptr = self.builder.build_pointer_cast(ptr, self.context.ptr_type(inkwell::AddressSpace::default()), "cast_unreg_tup").unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
// Need LLVM type for GEP
let llvm_types: Vec<_> = types.iter().map(|t| {
match t {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::I32 => self.context.i32_type().into(),
Type::Bool => self.context.bool_type().into(),
Type::Tensor(_, _) | Type::Struct(_, _) | Type::Enum(_, _) | Type::Tuple(_) | Type::String(_) => self.context.ptr_type(inkwell::AddressSpace::default()).into(),
Type::Void => self.context.i8_type().into(),
_ => self.context.i64_type().into(),
}
}).collect();
let struct_ty = self.context.struct_type(&llvm_types, false);
for (i, elem_ty) in types.iter().enumerate() {
if matches!(elem_ty, Type::Tensor(_, _) | Type::Struct(_, _) | Type::Tuple(_)) {
let f_ptr = self.builder.build_struct_gep(struct_ty, ptr, i as u32, "tup_gep_unreg").unwrap();
let f_val = self.builder.build_load(self.context.ptr_type(inkwell::AddressSpace::default()), f_ptr, "tup_val_unreg").unwrap();
self.emit_recursive_unregister(f_val, elem_ty)?;
}
}
}
Type::Enum(_name, _) => {
let ptr = val.into_pointer_value();
let unreg_fn = self.module.get_function("tl_mem_unregister")
.ok_or("tl_mem_unregister not found")?;
let cast_ptr = self.builder.build_pointer_cast(ptr, self.context.ptr_type(inkwell::AddressSpace::default()), "cast_unreg_enum").unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").map_err(|e| e.to_string())?;
// TODO: Deep unregister for Enums
}
_ => {}
}
Ok(())
}
pub(crate) fn compile_stmt(&mut self, stmt: &Stmt) -> Result<(), String> {
self.current_time += 1;
let prev_span = self.current_span.clone();
self.current_span = Some(stmt.span.clone());
let result = self.compile_stmt_inner(stmt);
if result.is_ok() {
let terminated = self
.builder
.get_insert_block()
.and_then(|b| b.get_terminator())
.is_some();
if !terminated {
let tag = stmt_trace_tag(stmt);
let _ = self.emit_trace_mem(tag);
}
}
self.current_span = prev_span;
result
}
pub(crate) fn compile_stmt_inner(&mut self, stmt: &Stmt) -> Result<(), String> {
match &stmt.inner {
StmtKind::Use { .. } => Ok(()),
StmtKind::TensorDecl {
name,
type_annotation,
init,
} => {
let def_time = self.current_time;
if let Some(expr) = init {
let (val_ir, _inferred_ty) = self.ensure_tensor_v2(expr, 0)?;
let val_ty = if matches!(type_annotation, Type::Tensor(_, _)) {
type_annotation.clone()
} else {
// tensor name: f32 means Tensor<f32, 0>
Type::Tensor(Box::new(type_annotation.clone()), 0)
};
// NOTE: Removed clone to preserve gradients
if self.variables.last().unwrap().contains_key(name) {
// Start of double-free fix logic
let (_var_val, _, cleanup_mode) = &self.variables.last().unwrap()[name];
if *cleanup_mode != super::CLEANUP_NONE {
// Restore Free Logic for RefCounting
self.emit_recursive_free(*_var_val, &val_ty, *cleanup_mode)?;
}
let ptr = self.variables.last().unwrap()[name].0.into_pointer_value();
self.builder
.build_store(ptr, val_ir)
.map_err(|e| e.to_string())?;
// Update variable map to mark as owned (should_free = true)
self.variables
.last_mut()
.unwrap()
.insert(name.clone(), (ptr.into(), val_ty, super::CLEANUP_FULL));
} else {
let fn_val = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
let ptr = self.create_entry_block_alloca(fn_val, name, &val_ty)?;
self.builder
.build_store(ptr, val_ir)
.map_err(|e| e.to_string())?;
// Consumed by variable
self.consume_temp(val_ir);
self.variables
.last_mut()
.unwrap()
.insert(name.clone(), (ptr.into(), val_ty, super::CLEANUP_FULL));
}
} else {
// Alloc but no init? (Current code path seems to assume init is Some for now based on AST?)
// If init is None, we might just alloc.
}
// Register Liveness
let last_use = if let Some(analysis) = &self.function_analysis {
match analysis.last_use_times.get(&def_time) {
Some(&t) => t,
None => 0
}
} else {
0
};
if let Some(scope) = self.variable_liveness.last_mut() {
scope.insert(name.clone(), last_use);
}
Ok(())
}
StmtKind::Let {
name,
type_annotation,
value,
mutable: _,
} => {
let def_time = self.current_time;
// Special path: Array type annotation with TensorLiteral initializer
// Compile as LLVM array instead of tensor runtime call
if let Some(Type::Array(inner_ty, size)) = type_annotation {
if let ExprKind::TensorLiteral(elements) | ExprKind::TensorConstLiteral(elements) = &value.inner {
if elements.len() == *size {
let llvm_arr_ty = self.get_llvm_type(&Type::Array(inner_ty.clone(), *size))?;
let llvm_elem_ty = self.get_llvm_type(inner_ty)?;
let arr_ty = Type::Array(inner_ty.clone(), *size);
let current_function = self.builder.get_insert_block().unwrap().get_parent().unwrap();
let alloca = self.create_entry_block_alloca(current_function, name, &arr_ty)?;
let i64_type = self.context.i64_type();
for (i, elem_expr) in elements.iter().enumerate() {
let (elem_val, _) = self.compile_expr(elem_expr)?;
let elem_ptr = unsafe {
self.builder.build_gep(
llvm_arr_ty,
alloca,
&[i64_type.const_int(0, false), i64_type.const_int(i as u64, false)],
&format!("arr_init_{}", i)
).map_err(|e| e.to_string())?
};
// Cast if needed (e.g., int literal to correct size)
let store_val = if elem_val.get_type() != llvm_elem_ty {
if elem_val.is_int_value() && llvm_elem_ty.is_int_type() {
self.builder.build_int_cast(
elem_val.into_int_value(),
llvm_elem_ty.into_int_type(),
"arr_cast"
).map_err(|e| e.to_string())?.into()
} else {
elem_val
}
} else {
elem_val
};
self.builder.build_store(elem_ptr, store_val).map_err(|e| e.to_string())?;
}
// Register variable (stack-allocated, no cleanup needed)
let cleanup_mode = super::CLEANUP_NONE;
self.variables.last_mut().unwrap().insert(
name.clone(),
(alloca.into(), arr_ty, cleanup_mode),
);
return Ok(());
}
}
}
// 1. Analyze value for Free Indices (Implicit Tensor Equation)
// 1. Analyze value for Free and Reduction Indices (Implicit Tensor Equation)
let (free_indices, reduction_indices) = self.analyze_tensor_indices(value);
if !free_indices.is_empty() {
let clauses: Vec<ComprehensionClause> = Vec::new();
return self
.compile_tensor_equation(name, &free_indices, &reduction_indices, &clauses, Some(value))
.map_err(|e| e.to_string());
}
let is_slot_backed = false;
let dps_result = None;
if let ExprKind::FnCall(fn_name, _args) = &value.inner {
// Check if function returns Tensor
// We need to resolve name properly if it's imported (simplified check for now)
let simple_name = fn_name;
let lookup_name = if self.module.get_function(fn_name).is_some() {
fn_name
} else if self.module.get_function(simple_name).is_some() {
simple_name
} else {
fn_name
};
if let Some(func) = self.module.get_function(lookup_name) {
let ret_ty = self.get_return_type_from_signature(func);
if matches!(ret_ty, Type::Tensor(_, _)) {
// Check if we have a slot for this variable
// FIX: Disabled DPS for Tensors for now.
// Most runtime functions (tl_tensor_new, add, etc) return a NEW pointer (Box::into_raw).
// They do not support writing to a caller-provided OpaqueTensor* (Slot).
// Attempting DPS here causes the Return Value to be ignored (Leak)
// and the Slot Buffer (uninitialized) to be used (Crash/UB) and finalized (Double Free/Bad Free).
/*
if let Some(analysis) = &self.function_analysis {
if let Some(&slot_id) = analysis.slots.get(name) {
// DO DPS
// Get Buffer from Slot
let buf_fn_name = "tl_mem_get_buffer";
let buf_fn = if let Some(f) = self.module.get_function(buf_fn_name) {
f
} else {
let i64_ty = self.context.i64_type();
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let ft = ptr_ty.fn_type(&[i64_ty.into(), i64_ty.into()], false);
self.module.add_function(buf_fn_name, ft, None)
};
// Assuming 96 bytes for Tensor struct
let size = self.context.i64_type().const_int(96, false);
let slot = self.context.i64_type().const_int(slot_id as u64, false);
let call = self.builder.build_call(buf_fn, &[slot.into(), size.into()], "slot_buf").unwrap();
let raw_ptr = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_pointer_value(),
_ => panic!("tl_mem_get_buffer returned non-basic value"),
};
let cast_ptr = self.builder.build_pointer_cast(raw_ptr, self.context.ptr_type(inkwell::AddressSpace::default()), "cast_slot").unwrap();
// Call compile_fn_call_dps
let res = self.compile_fn_call_dps(fn_name, args, Some(cast_ptr.into()))?;
dps_result = Some(res);
is_slot_backed = true;
}
}
*/
}
}
}
let (mut val_ir, val_ty) = if let Some((r, t)) = dps_result {
(r, t)
} else {
// Standard expression compilation
self.compile_expr(value)?
};
// Ownership: Shared. The temporary (value) remains in scope and will be released at scope exit.
// The variable (name) acquires a NEW reference via deep_clone below.
// We do NOT unregister the temporary. Ref 1 (Temp) + Ref 1 (Var) = 2.
// Temp Scope Exit -> -1. Var Scope Exit -> -1. Total 0. Safe.
// Removed legacy hardcoded type fixups for HashMap/Vec/Option.
// Rely on correct type checking in semantics phase.
// Variable Assignment: Deep Clone (Struct Copy + Tensor Acquire)
// Optimization: R-value Move Semantics
// If the value is a temporary (FnCall, BinOp, etc), we take ownership (Move).
// If the value is an L-value (Variable, FieldAccess), we must Copy (Acquire/Clone).
let mut is_last_use_move = false;
if let ExprKind::Variable(vname) = &value.inner {
if self.is_last_use(vname) {
is_last_use_move = true;
// Mark source as moved (transfer ownership)
for scope in self.variables.iter_mut().rev() {
if let Some(entry) = scope.get_mut(vname) {
entry.2 = super::CLEANUP_NONE;
break;
}
}
}
}
let is_rvalue = matches!(
&value.inner,
ExprKind::FnCall(_, _)
| ExprKind::MethodCall(_, _, _)
| ExprKind::StaticMethodCall(_, _, _)
| ExprKind::BinOp(_, _, _)
| ExprKind::UnOp(_, _)
| ExprKind::TensorLiteral(_)
| ExprKind::IfExpr(_, _, _) // Treating IfExpr as R-value (Assumes IfExpr logic ensures failure-safety)
| ExprKind::Block(_)
) || is_last_use_move;
let should_deep_clone = match &val_ty {
Type::Tensor(_, _) | Type::TensorShaped(_, _) => !is_rvalue, // Clone only if L-value
Type::Struct(_, _) | Type::Enum(_, _) | Type::Tuple(_) => {
// Structs/UserDefined/Enum/Vec/Tuple: Pointer copy vs Deep Clone
// If R-value, we own the pointer. Move.
!is_rvalue
}
_ => false,
};
if should_deep_clone {
val_ir = self.emit_deep_clone(val_ir, &val_ty)?;
} else if is_rvalue {
// Move Semantics:
// If it's an R-value (temporary), we skip deep_clone (ownership transfer).
// BUT we must remove it from the temporary list so it's not freed
// when the temporary scope ends. The variable now owns it.
self.try_consume_temp(val_ir);
}
let current_function = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
// Check for shadowing in CURRENT scope
let shadow_info = if let Some(scope) = self.variables.last() {
if let Some((old_ptr, old_ty, cleanup_mode)) = scope.get(name) {
if *cleanup_mode != super::CLEANUP_NONE {
Some((*old_ptr, old_ty.clone(), *cleanup_mode))
} else {
None
}
} else {
None
}
} else {
None
};
if let Some((old_ptr_val, old_ty, old_mode)) = shadow_info {
// Load the actual pointer value from the alloca
let ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let old_value = self
.builder
.build_load(ptr_type, old_ptr_val.into_pointer_value(), "old_shadowed")
.map_err(|e| e.to_string())?;
self.emit_recursive_free(old_value, &old_ty, old_mode)?;
}
let alloca = self.create_entry_block_alloca(current_function, name, &val_ty)?;
self.builder
.build_store(alloca, val_ir)
.map_err(|e| e.to_string())?;
// Keep ownership in the variable (if val_ir was a temporary)
// FIX: Move Semantics. We take ownership from the temporary.
self.mark_temp_no_cleanup(val_ir);
// RefCount Logic: Clone on Copy
let mut cleanup_mode = super::CLEANUP_FULL;
if let Some(temps) = self.temporaries.last_mut() {
if let Some(idx) = temps.iter().position(|(v, _, _)| *v == val_ir) {
let (_, _, mode) = temps.remove(idx);
cleanup_mode = mode;
}
}
// FIX: Removed inc_ref logic here.
// compile_expr returns +1 ref (Owned).
// Let takes that +1 ref and binds it to the variable.
// We do NOT need to increment again.
// Previous logic "Double Ownership" (Temp + Var) caused leak.
self.variables
.last_mut()
.unwrap()
.insert(
name.clone(),
(
alloca.into(),
val_ty.clone(),
if is_slot_backed {
super::CLEANUP_FINALIZE
} else {
cleanup_mode
},
),
); // Store pointer and type
// Register Liveness
let last_use = if let Some(analysis) = &self.function_analysis {
match analysis.last_use_times.get(&def_time) {
Some(&t) => t,
None => 0
}
} else {
0
};
if let Some(scope) = self.variable_liveness.last_mut() {
scope.insert(name.clone(), last_use);
}
// DEBUG TRACE: Log assignment to variable
match &val_ty {
Type::Struct(sname, _) => {
if sname.contains("GPT") {
let size_val = self.context.i64_type().const_int(0, false);
self.emit_log_alloc(val_ir, size_val).ok();
}
}
_ => {}
}
Ok(())
}
StmtKind::Return(expr_opt) => {
if let Some(expr) = expr_opt {
let (val, ty) = self.compile_expr(expr)?;
// If returning a variable, mark it as moved (should_free = false)
if let ExprKind::Variable(name) = &expr.inner {
for scope in self.variables.iter_mut().rev() {
if let Some(entry) = scope.get_mut(name) {
entry.2 = super::CLEANUP_NONE;
}
}
}
// FIX: Ensure the returned value is NOT cleaned up by emit_all_scopes_cleanup.
// This is handled for Variables above, but temporaries (like StructInit result)
// might be in self.temporaries (via add_temp or implicit) and need to be marked.
// We consume it from the temporary list so cleanup logic skips it.
self.mark_temp_no_cleanup(val);
if val.is_pointer_value() {
let ptr = val.into_pointer_value();
for scope in self.variables.iter_mut().rev() {
// Find precise match for pointer value
for (_, (v, _, cleanup)) in scope.iter_mut() {
if v.is_pointer_value() && v.into_pointer_value() == ptr {
*cleanup = super::CLEANUP_NONE;
}
}
}
}
// Check if this is a struct return (uses sret)
let uses_sret = self.current_sret_dest.is_some();
// IMPORTANT: Do NOT unregister. Instead Acquire/Copy to preserve for caller.
// If we unregister, it releases (decrements refcount).
// If we exit scope, it releases (decrements refcount).
// Result: Double decrement -> Free.
// Fix:
// 1. For SRET: emit_struct_copy (above) now does Deep Copy + Acquire.
// 2. For Tensor Return: We must Acquire.
// 3. For Struct Return: We must Unregister to prevent exit_scope from freeing it.
if !uses_sret {
match &ty {
Type::Tensor(_, _) => {
if let Some(acquire_fn) =
self.module.get_function("tl_tensor_acquire")
{
let ptr = val.into_pointer_value();
let void_ptr_type =
self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self
.builder
.build_pointer_cast(ptr, void_ptr_type, "cast_aq_ret")
.unwrap();
self.builder
.build_call(acquire_fn, &[cast_ptr.into()], "")
.unwrap();
}
}
Type::Struct(_, _) => {
// Shallow Unregister: コンテナのみ unregister、フィールドは触らない
// (MEMORY_MANAGEMENT_STRATEGY.md §B 準拠)
// フィールドのテンソルは exit_scope の dec_ref で RC が正しく遷移し、
// 呼び出し元に所有権が移る。
if let Some(unreg_fn) = self.module.get_function("tl_mem_unregister") {
let ptr = val.into_pointer_value();
let ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self.builder.build_pointer_cast(ptr, ptr_type, "cast_unreg_ret").unwrap();
self.builder.build_call(unreg_fn, &[cast_ptr.into()], "").unwrap();
}
}
_ => {}
}
}
if uses_sret {
// CRITICAL: Copy to sret BEFORE cleanup to avoid stale pointer access
// Get the sret pointer (first parameter)
// CRITICAL: Copy to sret BEFORE cleanup to avoid stale pointer access
// Get the sret pointer
let sret_ptr = self.current_sret_dest.unwrap();
// Copy struct contents to sret pointer BEFORE cleanup
let src_ptr = val.into_pointer_value();
self.emit_struct_copy(sret_ptr, src_ptr, &ty)?;
self.emit_all_scopes_cleanup();
if let Some(exit_fn) = self.module.get_function("tl_mem_function_exit") {
self.builder.build_call(exit_fn, &[], "").unwrap();
}
self.builder.build_return(None).map_err(|e| e.to_string())?;
} else {
// Normal return: cleanup then return value
self.emit_all_scopes_cleanup();
if let Some(exit_fn) = self.module.get_function("tl_mem_function_exit") {
self.builder.build_call(exit_fn, &[], "").unwrap();
}
let ret_instr = self.builder
.build_return(Some(&val));
ret_instr.map_err(|e| e.to_string())?;
}
} else {
// return; (Void return)
self.emit_all_scopes_cleanup();
if let Some(exit_fn) = self.module.get_function("tl_mem_function_exit") {
self.builder.build_call(exit_fn, &[], "").unwrap();
}
self.builder.build_return(None).map_err(|e| e.to_string())?;
}
Ok(())
}
StmtKind::Assign { lhs, op, value } => {
// 1. Try to compile as Addressable L-Value
let lvalue_res = self.compile_lvalue_addr(lhs);
let (val_ir, val_ty) = self.compile_expr(value)?;
if let Ok((Some(lhs_ptr), lhs_type, _, lhs_scope_name)) = lvalue_res {
// STANDARD ASSIGNMENT (Var or Field)
match op {
AssignOp::Assign => {
let load_type = self.context.ptr_type(inkwell::AddressSpace::default());
// Free old if needed
if matches!(lhs_type, Type::Struct(_,_) | Type::Tensor(_,_)) {
let old_val = self.builder.build_load(load_type, lhs_ptr, "old").unwrap().into_pointer_value();
let null_ptr = load_type.const_null();
let is_not_null = self.builder.build_int_compare(inkwell::IntPredicate::NE, old_val, null_ptr, "").unwrap();
let are_diff = self.builder.build_int_compare(inkwell::IntPredicate::NE, old_val, val_ir.into_pointer_value(), "").unwrap();
let cond = self.builder.build_and(is_not_null, are_diff, "").unwrap();
let free_bb = self.append_bb("free_old");
let cont_bb = self.append_bb("cont");
self.builder.build_conditional_branch(cond, free_bb, cont_bb).unwrap();
self.builder.position_at_end(free_bb);
self.emit_recursive_free(old_val.into(), &lhs_type, super::CLEANUP_FULL)?;
if let Some(unreg) = self.module.get_function("tl_mem_unregister") {
let cast = self.builder.build_pointer_cast(old_val, load_type, "").unwrap();
self.builder.build_call(unreg, &[cast.into()], "").unwrap();
}
self.builder.build_unconditional_branch(cont_bb).unwrap();
self.builder.position_at_end(cont_bb);
}
self.builder.build_store(lhs_ptr, val_ir).unwrap();
// FIX: 代入された値をテンポラリリストから除外。
// ExprKind::BinOp 等で add_temp された一時テンソルが
// 代入先に所有権移転後もテンポラリに残り、exit_scope で
// 二重 release される問題を防止。
self.mark_temp_no_cleanup(val_ir);
// Unregister if leaking to outer scope
if let Some(vname) = lhs_scope_name {
if self.is_outer_scope(&vname) {
if let Some(f) = self.module.get_function("tl_mem_unregister") {
if matches!(lhs_type, Type::Struct(_,_) | Type::Tensor(_,_)) {
let _ = self.emit_recursive_unregister(val_ir, &lhs_type);
let _ = self.builder.build_call(f, &[val_ir.into()], "");
}
}
}
}
// FIX: Removed IncRef logic.
// Compile Expr returns +1 ref.
// Assignment takes that +1 ref.
// We do NOT need to increment again.
match val_ty {
Type::Tensor(_, _) | Type::Struct(_, _) | Type::Enum(_, _) => {
// Move semantics: RHS 変数の alloca を NULL にクリアして
// exit_scope での二重解放を防止。
// while ループ内で inner scope の変数を outer scope の
// mutable 変数に代入する場合に必須。
if let ExprKind::Variable(ref rhs_name) = value.inner {
let _ = self.null_out_variable(rhs_name);
}
}
_ => {}
}
}
_ => {
// Compound
let load_type: inkwell::types::BasicTypeEnum = match lhs_type {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
_ => self.context.ptr_type(inkwell::AddressSpace::default()).into(), // Fallback
};
let curr_val = self.builder.build_load(load_type, lhs_ptr, "curr").unwrap();
let bin_op = match op {
AssignOp::AddAssign => BinOp::Add,
AssignOp::SubAssign => BinOp::Sub,
AssignOp::MulAssign => BinOp::Mul,
AssignOp::DivAssign => BinOp::Div,
AssignOp::ModAssign => BinOp::Mod,
_ => unreachable!(),
};
if let Type::Tensor(_,_) = lhs_type {
// Tensor In-Place (Special)
let suffix = match bin_op { BinOp::Add => "add_assign", BinOp::Sub => "sub_assign", BinOp::Mul => "mul_assign", BinOp::Div => "div_assign", BinOp::Mod => "mod_assign", _ => unreachable!() };
let fn_name = if matches!(val_ty, Type::Tensor(_,_)) { format!("tl_tensor_{}", suffix) } else { format!("tl_tensor_{}_scalar_f32", suffix) };
let f = self.module.get_function(&fn_name).expect(&fn_name);
let arg = if matches!(val_ty, Type::Tensor(_,_)) { val_ir.into() } else { self.build_float_cast_val(val_ir, &val_ty, self.context.f32_type())?.into() };
self.builder.build_call(f, &[curr_val.into(), arg], "").unwrap();
} else {
// Primitive
let (res, _) = self.compile_bin_op(curr_val, lhs_type, val_ir, val_ty, bin_op)?;
self.builder.build_store(lhs_ptr, res).unwrap();
}
}
}
} else if let Ok((None, _, _, _)) = lvalue_res {
// Tensor/Struct Indexing (Not Addressable)
if let LValue::IndexAccess(val_inner, indices) = lhs {
let (inner_val, inner_ty) = self.compile_expr_from_lvalue(val_inner)?;
// Normalize Path to Struct/Enum
let inner_ty = self.normalize_type(&inner_ty);
if let Type::Tensor(_, _) = inner_ty {
return self.emit_tensor_set(inner_val, indices, val_ir, val_ty);
} else if let Type::Struct(name, generics) = &inner_ty {
// Assuming 'set' method
return self.emit_struct_set(inner_val, name, &generics, indices, val_ir);
} else if let Type::UnifiedType { base_name: _, type_args, mangled_name, .. } = &inner_ty {
// UnifiedType: use mangled_name for method lookup, base_name + type_args for monomorphize
return self.emit_struct_set(inner_val, &mangled_name, &type_args, indices, val_ir);
} else {
return Err(format!("Invalid assignment target inner type: {:?}", inner_ty));
}
}
return Err(format!("Invalid assignment target (not IndexAccess): {:?}", lhs));
} else {
return Err("Invalid assignment LValue".into());
}
Ok(())
}
StmtKind::For {
loop_var,
iterator,
body,
} => {
let def_time = self.current_time;
let parent = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
let i64_type = self.context.i64_type();
// Check if iterator is a range (BinOp with ".." conceptually - we detect 0..n pattern)
// Or if it's a tensor/variable
let (start_val, end_val, is_tensor_iter) = match &iterator.inner {
ExprKind::Range(start, end) => {
let (s, _) = self.compile_expr(start)?;
let (e, _) = self.compile_expr(end)?;
(s.into_int_value(), e.into_int_value(), false)
}
ExprKind::FnCall(name, args) if name == "range" => {
// range(start, end)
if args.len() != 2 {
return Err("range() requires 2 arguments".into());
}
let (s, _) = self.compile_expr(&args[0])?;
let (e, _) = self.compile_expr(&args[1])?;
(s.into_int_value(), e.into_int_value(), false)
}
ExprKind::Variable(_) | ExprKind::FieldAccess(_, _) => {
// Assume it's a tensor or array iteration
let (tensor_val, tensor_ty) = self.compile_expr(iterator)?;
let len = match &tensor_ty {
Type::Tensor(_, _) => {
// Get tensor length
let len_fn = self
.module
.get_function("tl_tensor_len")
.ok_or("tl_tensor_len not found")?;
let len_call = self
.builder
.build_call(len_fn, &[tensor_val.into()], "tensor_len")
.map_err(|e| e.to_string())?;
match len_call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_int_value(),
_ => return Err("Invalid tensor_len return".into()),
}
}
_ => {
return Err(
"For loop iterator must be a tensor, array, or range".into()
)
}
};
// Store tensor/array pointer for use in body
let tensor_ptr = tensor_val.into_pointer_value();
let tensor_alloca = self
.builder
.build_alloca(
self.context.ptr_type(inkwell::AddressSpace::default()),
"for_tensor",
)
.map_err(|e| e.to_string())?;
self.builder
.build_store(tensor_alloca, tensor_ptr)
.map_err(|e| e.to_string())?;
// Register tensor alloca for later use
self.variables.last_mut().unwrap().insert(
"__for_tensor__".to_string(),
(tensor_alloca.into(), tensor_ty.clone(), super::CLEANUP_NONE),
);
(i64_type.const_int(0, false), len, true)
}
_ => {
// Try to compile as expression and check type
let (iter_val, iter_ty) = self.compile_expr(iterator)?;
let len = match &iter_ty {
Type::Tensor(_, _) => {
let len_fn = self
.module
.get_function("tl_tensor_len")
.ok_or("tl_tensor_len not found")?;
let len_call = self
.builder
.build_call(len_fn, &[iter_val.into()], "tensor_len")
.map_err(|e| e.to_string())?;
match len_call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_int_value(),
_ => return Err("Invalid tensor_len return".into()),
}
}
_ => {
return Err(
"For loop iterator must be a tensor, array, or range".into()
)
}
};
let tensor_ptr = iter_val.into_pointer_value();
let tensor_alloca = self
.builder
.build_alloca(
self.context.ptr_type(inkwell::AddressSpace::default()),
"for_tensor",
)
.map_err(|e| e.to_string())?;
self.builder
.build_store(tensor_alloca, tensor_ptr)
.map_err(|e| e.to_string())?;
self.variables.last_mut().unwrap().insert(
"__for_tensor__".to_string(),
(tensor_alloca.into(), iter_ty.clone(), super::CLEANUP_NONE),
);
(i64_type.const_int(0, false), len, true)
}
};
// Capture preheader block (where we are jumping from)
let preheader_block = self.builder.get_insert_block().unwrap();
// Create basic blocks
let loop_header = self.context.append_basic_block(parent, "for_header");
let loop_body = self.context.append_basic_block(parent, "for_body");
let loop_latch = self.context.append_basic_block(parent, "for_latch");
let loop_end = self.context.append_basic_block(parent, "for_end");
// Branch to loop header
self.builder
.build_unconditional_branch(loop_header)
.map_err(|e| e.to_string())?;
// Loop header: PHI for index
self.builder.position_at_end(loop_header);
// let current_block = self.builder.get_insert_block().unwrap(); // No longer needed
let phi = self
.builder
.build_phi(i64_type, "for_idx")
.map_err(|e| e.to_string())?;
// Add incoming from entry
// Use preheader_block captured above
// Check condition: idx < end
let cond = self
.builder
.build_int_compare(
inkwell::IntPredicate::SLT,
phi.as_basic_value().into_int_value(),
end_val,
"for_cond",
)
.map_err(|e| e.to_string())?;
self.builder
.build_conditional_branch(cond, loop_body, loop_end)
.map_err(|e| e.to_string())?;
// Get tensor alloca BEFORE entering new scope (it's in current scope)
let saved_tensor_alloca = if is_tensor_iter {
// Search through all scopes to find __for_tensor__
let mut found = None;
for scope in self.variables.iter().rev() {
if let Some((val, _, _)) = scope.get("__for_tensor__") {
found = Some(val.into_pointer_value());
break;
}
}
found
} else {
None
};
// Loop body
self.builder.position_at_end(loop_body);
// Push loop context for break/continue
// continue -> latch (to increment index), break -> loop_end
let loop_depth = self.variables.len();
self.enter_scope();
self.loop_stack.push((loop_latch, loop_end, loop_depth));
// Bind loop variable
let loop_var_val = if is_tensor_iter {
// Search through scopes to find the type of __for_tensor__
let mut iter_ty = None;
for scope in self.variables.iter().rev() {
if let Some((_, ty, _)) = scope.get("__for_tensor__") {
iter_ty = Some(ty.clone());
break;
}
}
let iter_ty = iter_ty.ok_or("Iterator type not found")?;
// Get element from tensor/array - use saved alloca since we're in a new scope
let tensor_alloca =
saved_tensor_alloca.ok_or("Tensor alloca not found for for-loop")?;
let load_type = self.context.ptr_type(inkwell::AddressSpace::default());
let tensor_ptr = self
.builder
.build_load(load_type, tensor_alloca, "tensor_ptr")
.map_err(|e| e.to_string())?
.into_pointer_value();
match iter_ty {
Type::Tensor(inner_ty, _) => {
let get_fn = self
.module
.get_function("tl_tensor_get")
.ok_or("tl_tensor_get not found")?;
let get_call = self
.builder
.build_call(
get_fn,
&[tensor_ptr.into(), phi.as_basic_value().into()],
"elem_val",
)
.map_err(|e| e.to_string())?;
match get_call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => {
let f_val = v.into_float_value();
match inner_ty.as_ref() {
Type::I64 => {
let i_val = self
.builder
.build_float_to_signed_int(
f_val,
self.context.i64_type(),
"f2i",
)
.map_err(|e| e.to_string())?;
(i_val.into(), Type::I64)
}
Type::I32 => {
let i_val = self
.builder
.build_float_to_signed_int(
f_val,
self.context.i32_type(),
"f2i",
)
.map_err(|e| e.to_string())?;
(i_val.into(), Type::I32)
}
_ => (v, Type::F32), // Default/Keep as F32
}
}
_ => return Err("Invalid tensor_get return".into()),
}
}
_ => unreachable!(),
}
} else {
// Range iteration: loop var is the index
(phi.as_basic_value(), Type::I64)
};
// Create alloca for loop var and store
let var_alloca = self.create_entry_block_alloca(parent, loop_var, &loop_var_val.1)?;
self.builder
.build_store(var_alloca, loop_var_val.0)
.map_err(|e| e.to_string())?;
self.variables
.last_mut()
.unwrap()
.insert(loop_var.clone(), (var_alloca.into(), loop_var_val.1, super::CLEANUP_NONE));
// Register Liveness for loop variable
let last_use = if let Some(analysis) = &self.function_analysis {
match analysis.last_use_times.get(&def_time) {
Some(&t) => t,
None => 0
}
} else {
0
};
if let Some(scope) = self.variable_liveness.last_mut() {
scope.insert(loop_var.clone(), last_use);
}
// Compile body
for stmt in body {
self.compile_stmt(stmt)?;
}
self.exit_scope();
// Branch to latch if body didn't terminate (e.g. return/break)
let body_end_block = self.builder.get_insert_block().unwrap();
if body_end_block.get_terminator().is_none() {
self.builder
.build_unconditional_branch(loop_latch)
.map_err(|e| e.to_string())?;
}
// Latch block: clear grads + increment index and branch back to header
self.builder.position_at_end(loop_latch);
// V3.3: 各 for イテレーション終了時に勾配をクリア (autograd メモリリーク防止)
if let Some(clear_fn) = self.module.get_function("tl_clear_grads") {
self.builder.build_call(clear_fn, &[], "").unwrap();
}
let next_idx = self
.builder
.build_int_add(
phi.as_basic_value().into_int_value(),
i64_type.const_int(1, false),
"next_idx",
)
.map_err(|e| e.to_string())?;
self.builder
.build_unconditional_branch(loop_header)
.map_err(|e| e.to_string())?;
// Add PHI incoming edges
phi.add_incoming(&[(&next_idx, loop_latch)]);
phi.add_incoming(&[(&start_val, preheader_block)]);
// Continue at loop end
self.builder.position_at_end(loop_end);
// Clean up temporary tensor reference
if is_tensor_iter {
for scope in self.variables.iter_mut().rev() {
scope.remove("__for_tensor__");
}
}
// Pop loop context
self.loop_stack.pop();
Ok(())
}
StmtKind::While { cond, body } => {
let parent = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
let cond_block = self.context.append_basic_block(parent, "while_cond");
let body_block = self.context.append_basic_block(parent, "while_body");
let end_block = self.context.append_basic_block(parent, "while_end");
// Jump to condition from current
self.builder
.build_unconditional_branch(cond_block)
.map_err(|e| e.to_string())?;
// Compile condition
self.builder.position_at_end(cond_block);
self.enter_scope(); // Condition Scope
let (cond_val, _) = self.compile_expr(cond)?;
let cond_bool = self
.builder
.build_int_compare(
inkwell::IntPredicate::NE,
cond_val.into_int_value(),
self.context.bool_type().const_zero(),
"while_cond_check",
)
.map_err(|e| e.to_string())?;
self.exit_scope(); // Free condition temps
self.builder
.build_conditional_branch(cond_bool, body_block, end_block)
.map_err(|e| e.to_string())?;
// Compile body
self.builder.position_at_end(body_block);
// Push loop context for break/continue
let loop_depth = self.variables.len();
self.enter_scope();
self.loop_stack.push((cond_block, end_block, loop_depth));
for stmt in body {
self.compile_stmt(stmt)?;
}
self.exit_scope();
// Pop loop context
self.loop_stack.pop();
// Loop back to condition
if self
.builder
.get_insert_block()
.unwrap()
.get_terminator()
.is_none()
{
self.builder
.build_unconditional_branch(cond_block)
.map_err(|e| e.to_string())?;
}
// Continue at end
self.builder.position_at_end(end_block);
Ok(())
}
StmtKind::Loop { body } => {
let parent = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
let body_block = self.context.append_basic_block(parent, "loop_body");
let end_block = self.context.append_basic_block(parent, "loop_end");
// Jump to body from current
self.builder
.build_unconditional_branch(body_block)
.map_err(|e| e.to_string())?;
// Compile body
self.builder.position_at_end(body_block);
// Push loop context for break/continue
// In loop, continue jumps back to the START of the body.
let loop_depth = self.variables.len();
self.enter_scope();
self.loop_stack.push((body_block, end_block, loop_depth));
for stmt in body {
self.compile_stmt(stmt)?;
}
self.exit_scope();
// Pop loop context
self.loop_stack.pop();
// Loop back to start of body
if self
.builder
.get_insert_block()
.unwrap()
.get_terminator()
.is_none()
{
self.builder
.build_unconditional_branch(body_block)
.map_err(|e| e.to_string())?;
}
// Continue at end - but only if end_block has predecessors
// If loop body only returns (no break), end_block is orphan and must be removed
if end_block.get_first_use().is_some() {
self.builder.position_at_end(end_block);
} else {
// Remove orphan block to prevent LLVM verification failure
unsafe { end_block.delete().map_err(|e| format!("Failed to delete orphan loop_end block: {:?}", e))?; }
}
Ok(())
}
StmtKind::Expr(expr) => {
let (val, ty) = self.compile_expr(expr)?;
// FIX: Handle discarded return values properly to prevent use-after-free bugs.
// When calling `model.step(lr);` without using the result:
// - The step method may modify `self` and return a new struct
// - If we don't capture the return value, the original variable becomes invalid
// - We need to register the return value as a temporary so it gets freed at scope exit
match &ty {
Type::Struct(_, _)
| Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Enum(_, _)
| Type::Tuple(_) => {
// For struct/tensor return values: Register as a temporary variable
// This is equivalent to `let _ = expr;`
// The value will be properly freed at scope exit
static DISCARD_ID: std::sync::atomic::AtomicUsize =
std::sync::atomic::AtomicUsize::new(0);
let id = DISCARD_ID.fetch_add(1, std::sync::atomic::Ordering::Relaxed);
let temp_name = format!("_discard_{}", id);
let current_function = self
.builder
.get_insert_block()
.unwrap()
.get_parent()
.unwrap();
let alloca =
self.create_entry_block_alloca(current_function, &temp_name, &ty)?;
self.builder
.build_store(alloca, val)
.map_err(|e| e.to_string())?;
// Register in current scope with should_free=true
// This ensures the struct gets freed when the scope exits
self.variables
.last_mut()
.unwrap()
.insert(temp_name, (alloca.into(), ty.clone(), super::CLEANUP_FULL));
}
_ => {
// Primitive types: no action needed (no memory to manage)
}
}
Ok(())
}
StmtKind::Break => {
// Cleanup all scopes up to loop entry before jumping
let target = self.loop_stack.last().map(|(_, bb, depth)| (*bb, *depth));
if let Some((break_block, loop_depth)) = target {
self.emit_cleanup_to_depth(loop_depth);
self.builder
.build_unconditional_branch(break_block)
.map_err(|e| e.to_string())?;
}
Ok(())
}
StmtKind::Continue => {
// Cleanup all scopes up to loop entry before jumping
let target = self.loop_stack.last().map(|(bb, _, depth)| (*bb, *depth));
if let Some((continue_block, loop_depth)) = target {
self.emit_cleanup_to_depth(loop_depth);
self.builder
.build_unconditional_branch(continue_block)
.map_err(|e| e.to_string())?;
}
Ok(())
}
}
}
fn compile_tensor_scalar_op(
&self,
lhs: BasicValueEnum<'ctx>,
lhs_type: Type,
rhs: BasicValueEnum<'ctx>,
rhs_type: Type,
op: BinOp,
scalar_is_rhs: bool,
) -> Result<(BasicValueEnum<'ctx>, Type), String> {
let (scalar_val, tensor_val, tensor_ty) = if scalar_is_rhs {
(rhs, lhs, lhs_type)
} else {
(lhs, rhs, rhs_type)
};
// Prepare scalar value as F64 for arithmetic ops
let val_f64 = if scalar_val.is_int_value() {
let v = scalar_val.into_int_value();
self.builder
.build_signed_int_to_float(v, self.context.f64_type(), "cast_scalar_f64")
.map_err(|e| e.to_string())?
} else {
let v = scalar_val.into_float_value();
self.builder
.build_float_cast(v, self.context.f64_type(), "cast_scalar_f64")
.map_err(|e| e.to_string())?
};
let tensor_ptr = tensor_val.into_pointer_value();
match op {
BinOp::Add => {
// Commutative: t + s
let fn_val = self.module.get_function("tl_tensor_add_scalar").ok_or("tl_tensor_add_scalar not found")?;
let call = self.builder.build_call(fn_val, &[tensor_ptr.into(), val_f64.into()], "add_scalar_res");
let res = self.check_tensor_result(call.map_err(|e| e.to_string())?, "add_scalar_err")?;
Ok((res.into_pointer_value().into(), tensor_ty))
}
BinOp::Mul => {
// Commutative: t * s
let fn_val = self.module.get_function("tl_tensor_mul_scalar").ok_or("tl_tensor_mul_scalar not found")?;
let call = self.builder.build_call(fn_val, &[tensor_ptr.into(), val_f64.into()], "mul_scalar_res");
let res = self.check_tensor_result(call.map_err(|e| e.to_string())?, "mul_scalar_err")?;
Ok((res.into_pointer_value().into(), tensor_ty))
}
BinOp::Sub => {
if scalar_is_rhs {
// t - s
let fn_val = self.module.get_function("tl_tensor_sub_scalar").ok_or("tl_tensor_sub_scalar not found")?;
let call = self.builder.build_call(fn_val, &[tensor_ptr.into(), val_f64.into()], "sub_scalar_res");
let res = self.check_tensor_result(call.map_err(|e| e.to_string())?, "sub_scalar_err")?;
Ok((res.into_pointer_value().into(), tensor_ty))
} else {
// s - t => neg(t - s)
let sub_fn = self.module.get_function("tl_tensor_sub_scalar").ok_or("tl_tensor_sub_scalar not found")?;
let sub_call = self.builder.build_call(sub_fn, &[tensor_ptr.into(), val_f64.into()], "sub_tmp");
let sub_res = self.check_tensor_result(sub_call.map_err(|e| e.to_string())?, "sub_err")?.into_pointer_value();
let neg_fn = self.module.get_function("tl_tensor_neg").ok_or("tl_tensor_neg not found")?;
let neg_call = self.builder.build_call(neg_fn, &[sub_res.into()], "neg_res");
let res = self.check_tensor_result(neg_call.map_err(|e| e.to_string())?, "neg_err")?;
// Free intermediate sub result (Arc-managed tensor)
if let Some(release_fn) = self.module.get_function("tl_tensor_release_safe") {
self.builder.build_call(release_fn, &[sub_res.into()], "").ok();
}
Ok((res.into_pointer_value().into(), tensor_ty))
}
}
BinOp::Div => {
if scalar_is_rhs {
// t / s
let fn_val = self.module.get_function("tl_tensor_div_scalar").ok_or("tl_tensor_div_scalar not found")?;
let call = self.builder.build_call(fn_val, &[tensor_ptr.into(), val_f64.into()], "div_scalar_res");
let res = self.check_tensor_result(call.map_err(|e| e.to_string())?, "div_scalar_err")?;
Ok((res.into_pointer_value().into(), tensor_ty))
} else {
// s / t => pow(t, -1) * s
let pow_fn = self.module.get_function("tl_tensor_pow_scalar").ok_or("tl_tensor_pow_scalar not found")?;
let neg_one = self.context.f32_type().const_float(-1.0); // Pow uses f32
let pow_call = self.builder.build_call(pow_fn, &[tensor_ptr.into(), neg_one.into()], "inv_tmp");
let pow_res = self.check_tensor_result(pow_call.map_err(|e| e.to_string())?, "pow_err")?.into_pointer_value();
let mul_fn = self.module.get_function("tl_tensor_mul_scalar").ok_or("tl_tensor_mul_scalar not found")?;
let mul_call = self.builder.build_call(mul_fn, &[pow_res.into(), val_f64.into()], "div_res");
let res = self.check_tensor_result(mul_call.map_err(|e| e.to_string())?, "div_err")?;
// Free intermediate pow result
if let Some(free_fn) = self.module.get_function("tl_tensor_free") {
self.builder.build_call(free_fn, &[pow_res.into()], "").ok();
}
Ok((res.into_pointer_value().into(), tensor_ty))
}
}
_ => {
// Fallback for Mod, Eq, etc. (uses unsafe stack alloc for now, but rarely used with scalars)
// Use F32 because fallback logic used F32
let val_f32 = if scalar_val.is_int_value() {
self.builder.build_signed_int_to_float(scalar_val.into_int_value(), self.context.f32_type(), "cast_scalar").map_err(|e| e.to_string())?
} else {
scalar_val.into_float_value()
};
// Need to re-implement fallback logic briefly since I am replacing the whole function block.
let current_block = self.builder.get_insert_block().unwrap();
let parent_fn = current_block.get_parent().unwrap();
let data_alloca = self.create_entry_block_alloca(parent_fn, "scalar_data", &Type::F32)?;
self.builder.build_store(data_alloca, val_f32).map_err(|e| e.to_string())?;
let shape_alloca = self.create_entry_block_alloca(parent_fn, "scalar_shape", &Type::I64)?;
let new_fn = self.module.get_function("tl_tensor_new").unwrap();
let rank_val = self.context.i64_type().const_int(0, false);
let call = self.builder.build_call(new_fn, &[data_alloca.into(), rank_val.into(), shape_alloca.into()], "scalar_tensor").map_err(|e| e.to_string())?;
let scalar_tensor = self.check_tensor_result(call, "scalar_tensor_error")?.into_pointer_value();
let fn_name = match op {
BinOp::Mod => "tl_tensor_rem",
BinOp::Eq => "tl_tensor_eq",
BinOp::Neq => "tl_tensor_neq",
BinOp::Lt => "tl_tensor_lt",
BinOp::Gt => "tl_tensor_gt",
BinOp::Le => "tl_tensor_le",
BinOp::Ge => "tl_tensor_ge",
_ => return Err("Unsupported scalar op fallback".into()),
};
let fn_val = self.module.get_function(fn_name).ok_or(format!("Runtime function {} not found", fn_name))?;
let (arg1, arg2) = if scalar_is_rhs {
(tensor_ptr.into(), scalar_tensor.into())
} else {
(scalar_tensor.into(), tensor_ptr.into())
};
let call = self.builder.build_call(fn_val, &[arg1, arg2], "binop_res");
let res_val = self.check_tensor_result(call.map_err(|e| e.to_string())?, "binop_scalar_error")?;
let free_fn = self.module.get_function("tl_tensor_free").ok_or("tl_tensor_free not found")?;
self.builder.build_call(free_fn, &[scalar_tensor.into()], "").map_err(|e| e.to_string())?;
Ok((res_val.into_pointer_value().into(), tensor_ty))
}
}
}
fn compile_string_bin_op(
&self,
lhs: BasicValueEnum<'ctx>,
rhs: BasicValueEnum<'ctx>,
op: BinOp,
) -> Result<(BasicValueEnum<'ctx>, Type), String> {
match op {
BinOp::Add => {
let concat_fn = self
.module
.get_function("tl_string_concat")
.ok_or("tl_string_concat not found")?;
let res = self
.builder
.build_call(concat_fn, &[lhs.into(), rhs.into()], "strconcat")
.map_err(|e| e.to_string())?;
let res_val = match res.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("Invalid string concat return".into()),
};
Ok((res_val, Type::String("String".to_string())))
}
BinOp::Eq | BinOp::Neq => {
let streq_fn = self
.module
.get_function("tl_string_eq")
.ok_or("tl_string_eq not found")?;
let cmp = self
.builder
.build_call(streq_fn, &[lhs.into(), rhs.into()], "streq_res")
.map_err(|e| e.to_string())?;
let cmp_val = match cmp.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_int_value(),
_ => return Err("Invalid tl_string_eq return".into()),
};
let res = match op {
BinOp::Eq => cmp_val,
BinOp::Neq => self.builder
.build_not(cmp_val, "strneq")
.map_err(|e| e.to_string())?,
_ => unreachable!(),
};
Ok((res.into(), Type::Bool))
}
_ => Err("Only ==, !=, and + supported for Strings".into()),
}
}
// Helper for BinOp
pub(crate) fn compile_bin_op(
&self,
lhs: BasicValueEnum<'ctx>,
lhs_type: Type,
rhs: BasicValueEnum<'ctx>,
rhs_type: Type,
op: BinOp,
) -> Result<(BasicValueEnum<'ctx>, Type), String> {
match (&lhs_type, &rhs_type) {
// String Concatenation
(Type::String(_), Type::String(_)) if op == BinOp::Add => {
let concat_fn = self
.module
.get_function("tl_string_concat")
.ok_or("tl_string_concat not found")?;
let call = self
.builder
.build_call(concat_fn, &[lhs.into(), rhs.into()], "str_concat")
.map_err(|e| e.to_string())?;
let res = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("tl_string_concat returned void".into()),
};
Ok((res, Type::String("String".to_string())))
}
(Type::String(_), Type::Char(_)) if op == BinOp::Add => {
let char_to_str_fn = self.module.get_function("tl_string_from_char").ok_or("tl_string_from_char missing")?;
let call_c = self.builder.build_call(char_to_str_fn, &[rhs.into()], "char_str").map_err(|e| e.to_string())?;
let rhs_str = match call_c.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("tl_string_from_char returned void".into()),
};
let concat_fn = self
.module
.get_function("tl_string_concat")
.ok_or("tl_string_concat not found")?;
let call = self
.builder
.build_call(concat_fn, &[lhs.into(), rhs_str.into()], "str_concat")
.map_err(|e| e.to_string())?;
let res = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("tl_string_concat returned void".into()),
};
Ok((res, Type::String("String".to_string())))
}
(Type::Char(_), Type::String(_)) if op == BinOp::Add => {
let char_to_str_fn = self.module.get_function("tl_string_from_char").ok_or("tl_string_from_char missing")?;
let call_c = self.builder.build_call(char_to_str_fn, &[lhs.into()], "char_str").map_err(|e| e.to_string())?;
let lhs_str = match call_c.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("tl_string_from_char returned void".into()),
};
let concat_fn = self
.module
.get_function("tl_string_concat")
.ok_or("tl_string_concat not found")?;
let call = self
.builder
.build_call(concat_fn, &[lhs_str.into(), rhs.into()], "str_concat")
.map_err(|e| e.to_string())?;
let res = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v,
_ => return Err("tl_string_concat returned void".into()),
};
Ok((res, Type::String("String".to_string())))
}
(Type::I64, Type::I64) | (Type::I32, Type::I32) => {
let l = lhs.into_int_value();
let r = rhs.into_int_value();
let res = match op {
BinOp::Add => self.builder.build_int_add(l, r, "addtmp"),
BinOp::Sub => self.builder.build_int_sub(l, r, "subtmp"),
BinOp::Mul => self.builder.build_int_mul(l, r, "multmp"),
BinOp::Div => self.builder.build_int_signed_div(l, r, "divtmp"),
BinOp::Mod => self.builder.build_int_signed_rem(l, r, "modtmp"),
BinOp::Eq => {
self.builder
.build_int_compare(inkwell::IntPredicate::EQ, l, r, "eqtmp")
}
BinOp::Neq => {
self.builder
.build_int_compare(inkwell::IntPredicate::NE, l, r, "neqtmp")
}
BinOp::Lt => {
self.builder
.build_int_compare(inkwell::IntPredicate::SLT, l, r, "lttmp")
}
BinOp::Gt => {
self.builder
.build_int_compare(inkwell::IntPredicate::SGT, l, r, "gttmp")
}
BinOp::Le => {
self.builder
.build_int_compare(inkwell::IntPredicate::SLE, l, r, "letmp")
}
BinOp::Ge => {
self.builder
.build_int_compare(inkwell::IntPredicate::SGE, l, r, "getmp")
}
BinOp::And => self.builder.build_and(l, r, "andtmp"),
BinOp::Or => self.builder.build_or(l, r, "ortmp"),
}
.map_err(|e| e.to_string())?;
if res.get_type().get_bit_width() == 1 {
Ok((res.into(), Type::Bool))
} else {
// Return type matches input type (I64 or I32)
Ok((res.into(), lhs_type.clone()))
}
}
(Type::F32, Type::F32) => {
let l = lhs.into_float_value();
let r = rhs.into_float_value();
let res: BasicValueEnum = match op {
BinOp::Add => self
.builder
.build_float_add(l, r, "faddtmp")
.map(|v| v.into()),
BinOp::Sub => self
.builder
.build_float_sub(l, r, "fsubtmp")
.map(|v| v.into()),
BinOp::Mul => self
.builder
.build_float_mul(l, r, "fmultmp")
.map(|v| v.into()),
BinOp::Div => self
.builder
.build_float_div(l, r, "fdivtmp")
.map(|v| v.into()),
BinOp::Mod => self
.builder
.build_float_rem(l, r, "fmodtmp")
.map(|v| v.into()),
BinOp::Eq => self
.builder
.build_float_compare(inkwell::FloatPredicate::OEQ, l, r, "feqtmp")
.map(|v| v.into()),
BinOp::Neq => self
.builder
.build_float_compare(inkwell::FloatPredicate::ONE, l, r, "fneqtmp")
.map(|v| v.into()),
BinOp::Lt => self
.builder
.build_float_compare(inkwell::FloatPredicate::OLT, l, r, "flttmp")
.map(|v| v.into()),
BinOp::Gt => self
.builder
.build_float_compare(inkwell::FloatPredicate::OGT, l, r, "fgttmp")
.map(|v| v.into()),
BinOp::Le => self
.builder
.build_float_compare(inkwell::FloatPredicate::OLE, l, r, "fletmp")
.map(|v| v.into()),
BinOp::Ge => self
.builder
.build_float_compare(inkwell::FloatPredicate::OGE, l, r, "fgetmp")
.map(|v| v.into()),
_ => return Err("Unsupported float op".into()),
}
.map_err(|e| e.to_string())?;
if res.is_int_value() {
Ok((res, Type::Bool))
} else {
Ok((res, Type::F32))
}
}
(Type::String(_), Type::String(_)) => self.compile_string_bin_op(lhs, rhs, op),
(Type::Bool, Type::Bool) => {
let l = lhs.into_int_value();
let r = rhs.into_int_value();
let res = match op {
BinOp::And => self.builder.build_and(l, r, "andtmp"),
BinOp::Or => self.builder.build_or(l, r, "ortmp"),
BinOp::Eq => {
self.builder
.build_int_compare(inkwell::IntPredicate::EQ, l, r, "eqtmp")
}
BinOp::Neq => {
self.builder
.build_int_compare(inkwell::IntPredicate::NE, l, r, "neqtmp")
}
_ => return Err("Unsupported bool op".into()),
}
.map_err(|e| e.to_string())?;
Ok((res.into(), Type::Bool))
}
(Type::Char(_), Type::Char(_)) => {
let l = lhs.into_int_value();
let r = rhs.into_int_value();
let res = match op {
BinOp::Eq => {
self.builder
.build_int_compare(inkwell::IntPredicate::EQ, l, r, "eqtmp")
}
BinOp::Neq => {
self.builder
.build_int_compare(inkwell::IntPredicate::NE, l, r, "neqtmp")
}
_ => return Err("Unsupported char op".into()),
}
.map_err(|e| e.to_string())?;
Ok((res.into(), Type::Bool))
}
(
Type::Tensor(_, _)
| Type::Struct(..),
Type::Tensor(_, _)
| Type::Struct(..),
) if (matches!(lhs_type, Type::Tensor(_, _))
|| (matches!(&lhs_type, Type::Struct(n, _) if n == "Tensor"))
|| (matches!(&rhs_type, Type::Struct(n, _) if n == "Tensor"))) =>
{
let l = lhs.into_pointer_value();
let r = rhs.into_pointer_value();
let fn_name = match op {
BinOp::Add => "tl_tensor_add",
BinOp::Mul => "tl_tensor_mul",
BinOp::Div => "tl_tensor_div",
BinOp::Sub => "tl_tensor_sub",
BinOp::Mod => "tl_tensor_rem",
BinOp::Eq => "tl_tensor_eq",
BinOp::Neq => "tl_tensor_neq",
BinOp::Lt => "tl_tensor_lt",
BinOp::Gt => "tl_tensor_gt",
BinOp::Le => "tl_tensor_le",
BinOp::Ge => "tl_tensor_ge",
_ => return Err("Unsupported tensor op".into()),
};
let fn_val = self
.module
.get_function(fn_name)
.ok_or(format!("Runtime function {} not found", fn_name))?;
let call = self
.builder
.build_call(fn_val, &[l.into(), r.into()], "binop_res");
let res_val =
self.check_tensor_result(call.map_err(|e| e.to_string())?, "binop_error")?;
let res_ptr = res_val.into_pointer_value();
Ok((res_ptr.into(), lhs_type.clone()))
}
// Handling mixed types (F32 vs I64) for convenience
(Type::F32, Type::I64) => {
let l = lhs.into_float_value();
let r = rhs.into_int_value();
let r_f32 = self
.builder
.build_signed_int_to_float(r, self.context.f32_type(), "cast_r_f32")
.map_err(|e| e.to_string())?;
// Recurse with F32, F32
self.compile_bin_op(l.into(), Type::F32, r_f32.into(), Type::F32, op)
}
(Type::I64, Type::F32) => {
let l = lhs.into_int_value();
let r = rhs.into_float_value();
let l_f32 = self
.builder
.build_signed_int_to_float(l, self.context.f32_type(), "cast_l_f32")
.map_err(|e| e.to_string())?;
// Recurse with F32, F32
self.compile_bin_op(l_f32.into(), Type::F32, r.into(), Type::F32, op)
}
(Type::Tensor(inner, _), Type::F32) if **inner == Type::F32 => {
self.compile_tensor_scalar_op(lhs, lhs_type, rhs, rhs_type, op, true)
}
(Type::Struct(name, _), Type::F32) if name == "Tensor" => {
self.compile_tensor_scalar_op(lhs, lhs_type, rhs, rhs_type, op, true)
}
(Type::F32, Type::Tensor(inner, _)) if **inner == Type::F32 => {
self.compile_tensor_scalar_op(lhs, lhs_type, rhs, rhs_type, op, false)
}
(Type::F32, Type::Struct(name, _)) if name == "Tensor" => {
self.compile_tensor_scalar_op(lhs, lhs_type, rhs, rhs_type, op, false)
}
_ => Err(format!(
"Type mismatch in BinOp {:?}: {:?} vs {:?}",
op, lhs_type, rhs_type
)),
}
}
/// Deep clone a value (Tensor or Struct containing Tensors)
pub(crate) fn emit_deep_clone(
&mut self,
val: inkwell::values::BasicValueEnum<'ctx>,
ty: &Type,
) -> Result<inkwell::values::BasicValueEnum<'ctx>, String> {
match ty {
Type::Tensor(_, _) => {
// Shared Ownership: Acquire reference, return same pointer
let acquire_fn = self
.module
.get_function("tl_tensor_acquire")
.ok_or("tl_tensor_acquire not found")?;
// Cast to void ptr for acquire function
let ptr = val.into_pointer_value();
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self
.builder
.build_pointer_cast(ptr, void_ptr_type, "cast_tensor_ptr")
.unwrap();
let call = self.builder
.build_call(acquire_fn, &[cast_ptr.into()], "acquired_ptr")
.map_err(|e| e.to_string())?;
let new_ptr = match call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_pointer_value(),
_ => return Err("tl_tensor_acquire returned void/invalid".to_string()),
};
// Cast back to tensor pointer type (struct ptr)
let tensor_ptr_ty = val.get_type().into_pointer_type();
let cast_new_ptr = self.builder.build_pointer_cast(new_ptr, tensor_ptr_ty, "cast_tensor_back").unwrap();
Ok(cast_new_ptr.into())
}
Type::String(_) => {
// String Deep Clone using tl_string_clone
let ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
let string_clone_fn = self.module.get_function("tl_string_clone")
.or_else(|| {
// Declare if missing: ptr @tl_string_clone(ptr)
let fn_type = ptr_ty.fn_type(&[ptr_ty.into()], false);
Some(self.module.add_function("tl_string_clone", fn_type, None))
})
.ok_or("tl_string_clone not found")?;
let val_ptr = val.into_pointer_value();
let clone_call = self.builder.build_call(string_clone_fn, &[val_ptr.into()], "str_clone")
.map_err(|e| e.to_string())?;
match clone_call.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => Ok(v),
_ => Err("tl_string_clone returned void".into()),
}
}
Type::Enum(name, generics) => {
let mangled_name = if generics.is_empty() {
name.clone()
} else {
self.mangle_type_name(name, generics)
};
let mut enum_def = self
.enum_defs
.get(&mangled_name)
.ok_or(format!("Enum {} definition not found ({})", name, mangled_name))?
.clone();
// If still generic, monomorphize with default type
if !enum_def.generics.is_empty() {
let default_generics = vec![Type::I64; enum_def.generics.len()];
let default_mangled = self.mangle_type_name(name, &default_generics);
if let Some(specialized) = self.enum_defs.get(&default_mangled) {
enum_def = specialized.clone();
} else {
self.monomorphize_enum(name, &default_generics).map_err(|e| e.to_string())?;
enum_def = self.enum_defs.get(&default_mangled)
.ok_or(format!("Failed to monomorphize {} -> {}", name, default_mangled))?
.clone();
}
}
self.emit_enum_deep_clone(val, &enum_def)
}
Type::Struct(name, generics) => {
let mangled_name = if generics.is_empty() {
name.clone()
} else {
self.mangle_type_name(name, generics)
};
// Check if it is an Enum
if let Some(mut enum_def) = self.enum_defs.get(&mangled_name).cloned() {
// If still generic, monomorphize with default type (same as Type::Enum branch)
if !enum_def.generics.is_empty() {
let default_generics = vec![Type::I64; enum_def.generics.len()];
let default_mangled = self.mangle_type_name(name, &default_generics);
if let Some(specialized) = self.enum_defs.get(&default_mangled) {
enum_def = specialized.clone();
} else {
self.monomorphize_enum(name, &default_generics).map_err(|e| e.to_string())?;
enum_def = self.enum_defs.get(&default_mangled)
.ok_or(format!("Failed to monomorphize {} -> {}", name, default_mangled))?
.clone();
}
}
return self.emit_enum_deep_clone(val, &enum_def);
}
// Handle Tensor struct (opaque pointer, not a real struct)
if name == "Tensor" {
return self.emit_deep_clone(val, &Type::Tensor(Box::new(Type::F32), 0));
}
// Handle String struct
if name == "String" {
return self.emit_deep_clone(val, &Type::String(name.clone()));
}
// HACK: Built-in types (File) are opaque pointers
if name == "File" {
// File handle cannot be deeply cloned easily. Return shallow copy (pointer).
return Ok(val);
} else if name == "Path" {
// Shallow copy for Path
return Ok(val);
} else if name == "Env" || name == "Http" {
// Virtual static classes or opaque
return Ok(val);
}
// Reference Semantics for Structs (Shared Ownership)
// Instead of deep copying (malloc + loop), we treat structs like RefCounted objects (like Tensors).
// We acquire a reference and return the same pointer.
// Check if it is a ZST (Value Type)
if !val.is_pointer_value() {
return Ok(val);
}
// 1. Acquire reference
let acquire_fn = self
.module
.get_function("tl_ptr_acquire")
.ok_or("tl_ptr_acquire not found")?;
let ptr = val.into_pointer_value();
let void_ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let cast_ptr = self
.builder
.build_pointer_cast(ptr, void_ptr_type, "cast_struct_ptr")
.unwrap();
self.builder
.build_call(acquire_fn, &[cast_ptr.into()], "")
.map_err(|e| e.to_string())?;
// 2. Return SAME pointer
return Ok(val);
/*
* DEPRECATED: Deep Copy Logic (removed)
* This caused massive leaks & trace traps because copies were unregistered.
*/
#[allow(unreachable_code)]
let simple_name = name.as_str();
let struct_def = self
.struct_defs
.get(simple_name)
.ok_or(format!("Struct {} definition not found", name))?;
let st_llvm_ty = *self
.struct_types
.get(simple_name)
.ok_or("LLVM Struct type not found")?;
// Calculate size manually for correct alignment/type (i64)
let size_ptr = unsafe {
self.builder.build_gep(
st_llvm_ty,
self.context.ptr_type(inkwell::AddressSpace::default()).const_null(),
&[self.context.i64_type().const_int(1, false)],
"size_ptr",
).map_err(|e| e.to_string())?
};
let size = self.builder
.build_ptr_to_int(size_ptr, self.context.i64_type(), "size")
.map_err(|e| e.to_string())?;
let malloc_fn = self.module.get_function("malloc").ok_or("malloc not found")?;
let new_struct_ptr_val = match self.builder
.build_call(malloc_fn, &[size.into()], &format!("copy_{}", name))
.map_err(|e| e.to_string())?
.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_pointer_value(),
_ => return Err("malloc returned void".into()),
};
// Cast if necessary (malloc returns i8* usually/void* so cast to struct*)
let new_struct_ptr = new_struct_ptr_val; // Inkwell pointer is typed/untyped depending on version but GEP needs type
// Register with MemoryManager (important for nested structs which are not Variables)
// Actually, if it's a field, it's owned by the parent struct.
// The parent struct's free will recursively free this.
// But wait, standard malloc isn't tracked by MemoryManager unless registered.
// If we use recursive_free for the parent, it calls libc::free on fields.
// So checking registration is not strictly needed for fields if recursive_free handles it.
// However, for consistency/debug, we could register? No, let's stick to recursive_free logic.
let src_ptr = val.into_pointer_value();
for (i, (field_name, field_ty)) in struct_def.fields.iter().enumerate() {
let src_field_ptr = self
.builder
.build_struct_gep(
st_llvm_ty,
src_ptr,
i as u32,
&format!("src_{}", field_name),
)
.map_err(|e| e.to_string())?;
let dst_field_ptr = self
.builder
.build_struct_gep(
st_llvm_ty,
new_struct_ptr,
i as u32,
&format!("dst_{}", field_name),
)
.map_err(|e| e.to_string())?;
let val = match field_ty {
Type::Tensor(_, _)
| Type::TensorShaped(_, _)
| Type::Struct(_, _)
| Type::Enum(_, _)
| Type::Tuple(_) => {
let loaded = self
.builder
.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
src_field_ptr,
"f_val",
)
.map_err(|e| e.to_string())?;
self.emit_deep_clone(loaded, field_ty)?
}
_ => {
let llvm_ty: inkwell::types::BasicTypeEnum = match field_ty {
Type::F32 => self.context.f32_type().into(),
Type::F64 => self.context.f64_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::I32 => self.context.i32_type().into(),
Type::Bool => self.context.bool_type().into(),
_ => {
return Err(format!("Unsupported clone field: {:?}", field_ty))
}
};
self.builder
.build_load(llvm_ty, src_field_ptr, "prim_val")
.map_err(|e| e.to_string())?
}
};
self.builder
.build_store(dst_field_ptr, val)
.map_err(|e| e.to_string())?;
}
// Return new struct ptr
Ok(new_struct_ptr.into())
}
Type::Tuple(ts) => {
// 1. Allocate tuple struct
let mut llvm_types = Vec::new();
for t in ts {
llvm_types.push(self.get_llvm_type(t)?);
}
let tuple_struct_type = self.context.struct_type(&llvm_types, false);
let size = tuple_struct_type
.size_of()
.ok_or("Cannot get size of tuple")?;
// Ensure size is i64
let size = if size.get_type() == self.context.i32_type() {
self.builder.build_int_z_extend(size, self.context.i64_type(), "size_i64").unwrap()
} else {
size
};
let malloc_fn = self
.module
.get_function("malloc")
.ok_or("malloc not found")?;
let new_tuple_ptr_val = self
.builder
.build_call(malloc_fn, &[size.into()], "tuple_malloc")
.map_err(|e| e.to_string())?;
let raw_ptr = match new_tuple_ptr_val.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_pointer_value(),
_ => return Err("malloc returned invalid value".into()),
};
let ptr_type = self.context.ptr_type(inkwell::AddressSpace::default());
let tuple_ptr = self
.builder
.build_pointer_cast(raw_ptr, ptr_type, "tuple_ptr")
.unwrap();
// 2. Deep clone elements
let src_ptr = val.into_pointer_value(); // Source tuple pointer
let src_cast = self
.builder
.build_pointer_cast(src_ptr, ptr_type, "src_tuple_cast")
.unwrap();
for (i, ty) in ts.iter().enumerate() {
// Load field from src
let field_gep = self
.builder
.build_struct_gep(tuple_struct_type, src_cast, i as u32, "src_field_gep")
.map_err(|e| e.to_string())?;
let field_llvm_ty = self.get_llvm_type(ty)?;
let field_val = self
.builder
.build_load(field_llvm_ty, field_gep, "src_field_val")
.map_err(|e| e.to_string())?;
// RECURSIVE DEEP CLONE
let cloned_val = self.emit_deep_clone(field_val, ty)?;
// Store into dst
let dst_gep = self
.builder
.build_struct_gep(tuple_struct_type, tuple_ptr, i as u32, "dst_field_gep")
.map_err(|e| e.to_string())?;
self.builder
.build_store(dst_gep, cloned_val)
.map_err(|e| e.to_string())?;
}
Ok(tuple_ptr.into())
}
_ => Ok(val), // Primitives copy by value
}
}
fn emit_enum_deep_clone(
&mut self,
val: BasicValueEnum<'ctx>,
enum_def: &EnumDef,
) -> Result<BasicValueEnum<'ctx>, String> {
let name = &enum_def.name;
let enum_ty = *self
.enum_types
.get(name)
.ok_or(format!("Enum type {} not found", name))?;
let src_ptr = val.into_pointer_value();
// 1. Allocate new enum instance
// Manual malloc(i64)
let size_ptr = unsafe {
self.builder.build_gep(
enum_ty,
self.context.ptr_type(inkwell::AddressSpace::default()).const_null(),
&[self.context.i64_type().const_int(1, false)],
"size_ptr",
).map_err(|e| e.to_string())?
};
let size = self.builder
.build_ptr_to_int(size_ptr, self.context.i64_type(), "size")
.map_err(|e| e.to_string())?;
let malloc_fn = self.module.get_function("malloc").ok_or("malloc not found")?;
let new_ptr = match self.builder
.build_call(malloc_fn, &[size.into()], &format!("copy_{}", name))
.map_err(|e| e.to_string())?
.try_as_basic_value() {
inkwell::values::ValueKind::Basic(v) => v.into_pointer_value(),
_ => return Err("malloc returned void".into()),
};
// 2. Load Tag
let tag_ptr = self
.builder
.build_struct_gep(enum_ty, src_ptr, 0, "tag_ptr")
.map_err(|e| e.to_string())?;
let tag_val = self
.builder
.build_load(self.context.i32_type(), tag_ptr, "tag")
.map_err(|e| e.to_string())?
.into_int_value();
// 3. Store Tag to new instance
let dst_tag_ptr = self
.builder
.build_struct_gep(enum_ty, new_ptr, 0, "dst_tag_ptr")
.map_err(|e| e.to_string())?;
let _ = self.builder.build_store(dst_tag_ptr, tag_val);
// 4. Switch on tag to copy payload
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let after_switch = self.context.append_basic_block(func, "after_enum_clone");
let mut cases = vec![];
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = self
.context
.append_basic_block(func, &format!("clone_variant_{}", variant.name));
cases.push((
self.context.i32_type().const_int(i as u64, false),
case_block,
));
}
let cases_refs: Vec<(inkwell::values::IntValue, inkwell::basic_block::BasicBlock)> =
cases.iter().map(|(i, b)| (*i, *b)).collect();
self.builder
.build_switch(tag_val, after_switch, &cases_refs)
.map_err(|e| e.to_string())?;
// Populate cases
for (i, variant) in enum_def.variants.iter().enumerate() {
let case_block = cases[i].1;
self.builder.position_at_end(case_block);
let field_types_list = match &variant.kind {
crate::compiler::ast::VariantKind::Unit => vec![],
crate::compiler::ast::VariantKind::Tuple(types) => types.clone(),
crate::compiler::ast::VariantKind::Struct(fields) => fields.iter().map(|(_, t)| t.clone()).collect(),
crate::compiler::ast::VariantKind::Array(ty, size) => vec![ty.clone(); *size],
};
if !field_types_list.is_empty() {
// Reconstruct field types for GEP/Load/Store
let mut field_types: Vec<inkwell::types::BasicTypeEnum> = vec![];
for ty in &field_types_list {
let llvm_ty = match ty {
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
Type::Bool => self.context.bool_type().into(),
Type::Tensor(_, _) => self
.context
.ptr_type(inkwell::AddressSpace::default())
.into(),
Type::Struct(_, _) | Type::Enum(_, _) | Type::Tuple(_) | Type::String(_) => self
.context
.ptr_type(inkwell::AddressSpace::default())
.into(),
_ => self.context.i64_type().into(),
};
field_types.push(llvm_ty);
}
let variant_struct_ty = self.context.struct_type(&field_types, false);
let variant_ptr_ty = self.context.ptr_type(inkwell::AddressSpace::default());
// Src Payload
let src_payload_ptr_raw = self
.builder
.build_struct_gep(enum_ty, src_ptr, 1, "src_payload_raw")
.map_err(|e| e.to_string())?;
let src_variant_ptr = self
.builder
.build_pointer_cast(src_payload_ptr_raw, variant_ptr_ty, "src_variant_casted")
.unwrap();
// Dst Payload
let dst_payload_ptr_raw = self
.builder
.build_struct_gep(enum_ty, new_ptr, 1, "dst_payload_raw")
.map_err(|e| e.to_string())?;
let dst_variant_ptr = self
.builder
.build_pointer_cast(dst_payload_ptr_raw, variant_ptr_ty, "dst_variant_casted")
.unwrap();
// Copy Fields
for (idx, f_ty) in field_types_list.iter().enumerate() {
let src_field_ptr = self
.builder
.build_struct_gep(variant_struct_ty, src_variant_ptr, idx as u32, "src_f")
.map_err(|e| e.to_string())?;
let val = self
.builder
.build_load(field_types[idx], src_field_ptr, "val")
.map_err(|e| e.to_string())?;
// Recursive Deep Clone
let cloned_val = self.emit_deep_clone(val, f_ty)?;
let dst_field_ptr = self
.builder
.build_struct_gep(variant_struct_ty, dst_variant_ptr, idx as u32, "dst_f")
.map_err(|e| e.to_string())?;
let _ = self.builder.build_store(dst_field_ptr, cloned_val);
}
}
let _ = self.builder.build_unconditional_branch(after_switch);
}
self.builder.position_at_end(after_switch);
Ok(new_ptr.into())
}
// Helper to compile LValue address
fn compile_lvalue_addr(&mut self, lvalue: &LValue) -> Result<(Option<inkwell::values::PointerValue<'ctx>>, Type, u8, Option<String>), String> {
match lvalue {
LValue::Variable(name) => {
for scope in self.variables.iter().rev() {
if let Some((v, t, mode)) = scope.get(name) {
return Ok((Some(v.into_pointer_value()), t.clone(), *mode, Some(name.clone())));
}
}
Err(format!("Variable {} not found", name))
}
LValue::FieldAccess(inner, field) => {
let (base_ptr_opt, base_ty, _, base_name) = self.compile_lvalue_addr(inner)?;
let base_ptr = base_ptr_opt.ok_or("Cannot field access on non-addressable lvalue")?;
if let Type::Struct(name, generics) = &base_ty {
// Lookup struct def by name (which may be a mangled name e.g. Vec_i64)
let struct_def = self.struct_defs.get(name.as_str())
.ok_or_else(|| format!("Struct def not found: {}", name))?;
let idx = struct_def.fields.iter().position(|(n, _)| n == field).ok_or("Field not found")?;
let (_, field_ty) = &struct_def.fields[idx];
// Apply type substitution if struct has generics
let field_ty = if !generics.is_empty() && !struct_def.generics.is_empty() {
let mut subst = std::collections::HashMap::new();
for (i, param) in struct_def.generics.iter().enumerate() {
if i < generics.len() {
subst.insert(param.clone(), generics[i].clone());
}
}
self.substitute_type(field_ty, &subst)
} else {
field_ty.clone()
};
// For LLVM types: try base name first, then mangled name if not found
// (monomorphized types are registered with mangled names)
let llvm_ty_opt = self.struct_types.get(name).or_else(|| {
if generics.is_empty() {
None
} else {
let mangled = self.mangle_type_name(name, generics);
self.struct_types.get(&mangled)
}
});
match llvm_ty_opt {
Some(t) => {
let st_llvm_ty = *t;
// FIX: In TL, structs are Handles (pointers). base_ptr is an alloca containing the struct pointer.
// We must LOAD the struct pointer before using struct_gep.
let struct_ptr = self.builder.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
base_ptr,
"struct_ptr"
).map_err(|e| e.to_string())?.into_pointer_value();
let field_ptr = self.builder.build_struct_gep(st_llvm_ty, struct_ptr, idx as u32, "").map_err(|e|e.to_string())?;
Ok((Some(field_ptr), field_ty.clone(), super::CLEANUP_NONE, base_name))
}
None => Err(format!("LLVM type not found for {}", name))
}
} else {
Err("Field access only on Struct".into())
}
}
LValue::IndexAccess(inner, indices) => {
let (base_ptr_opt, base_ty, _, base_name) = self.compile_lvalue_addr(inner)?;
if let Type::Ptr(elem_ty) = base_ty {
// Ptr indexing
let base_ptr = base_ptr_opt.unwrap();
if indices.len() != 1 { return Err("Ptr index must be 1D".into()); }
let (idx_val, _) = self.compile_expr(&indices[0])?;
// Get LLVM type of element for correct GEP offset calculation
let elem_llvm_ty = self.get_llvm_type(&elem_ty)?;
// Load the actual pointer value from the alloca
let ptr_val = self.builder.build_load(
self.context.ptr_type(inkwell::AddressSpace::default()),
base_ptr,
"ptr_load"
).map_err(|e| e.to_string())?.into_pointer_value();
unsafe {
let elem_ptr = self.builder.build_gep(
elem_llvm_ty,
ptr_val,
&[idx_val.into_int_value()],
"ptr_idx"
).map_err(|e| e.to_string())?;
Ok((Some(elem_ptr), *elem_ty.clone(), super::CLEANUP_NONE, base_name))
}
} else if let Type::Array(ref elem_ty, size) = base_ty {
// Array indexing - addressable LValue
let base_ptr = base_ptr_opt.unwrap();
if indices.len() != 1 { return Err("Array index must be 1D".into()); }
let (idx_val, _) = self.compile_expr(&indices[0])?;
let llvm_arr_ty = self.get_llvm_type(&Type::Array(elem_ty.clone(), size))?;
let i64_type = self.context.i64_type();
let elem_ptr = unsafe {
self.builder.build_gep(
llvm_arr_ty,
base_ptr,
&[i64_type.const_int(0, false), idx_val.into_int_value()],
"arr_elem_ptr"
).map_err(|e| e.to_string())?
};
Ok((Some(elem_ptr), *elem_ty.clone(), super::CLEANUP_NONE, base_name))
} else {
// Tensor or Struct indexing -> Not an addressable LValue in the LLVM sense (requires set call)
// Return None to signal caller to handle emit_tensor_set/struct_set
Ok((None, Type::Void, super::CLEANUP_NONE, None))
}
}
}
}
fn compile_expr_from_lvalue(&mut self, lvalue: &LValue) -> Result<(inkwell::values::BasicValueEnum<'ctx>, Type), String> {
match lvalue {
LValue::Variable(_name) => {
let res = self.compile_lvalue_addr(lvalue)?;
let ptr = res.0.unwrap();
let load_ty: inkwell::types::BasicTypeEnum = match &res.1 {
Type::Struct(_,_) | Type::Tensor(_,_) => self.context.ptr_type(inkwell::AddressSpace::default()).into(),
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
_ => self.context.i64_type().into(), // fallback
};
Ok((self.builder.build_load(load_ty, ptr, "").unwrap(), res.1))
}
LValue::FieldAccess(_,_) | LValue::IndexAccess(_,_) => {
let res = self.compile_lvalue_addr(lvalue)?;
if let Some(ptr) = res.0 {
let load_ty: inkwell::types::BasicTypeEnum = match &res.1 {
Type::Struct(_,_) | Type::Tensor(_,_) => self.context.ptr_type(inkwell::AddressSpace::default()).into(),
Type::F32 => self.context.f32_type().into(),
Type::I64 => self.context.i64_type().into(),
_ => self.context.i64_type().into(),
};
Ok((self.builder.build_load(load_ty, ptr, "").unwrap(), res.1))
} else {
// Non-Addressable element.
Err("Complex non-addressable lvalue load not fully implemented".into())
}
}
}
}
fn emit_tensor_set(&mut self, tensor_val: inkwell::values::BasicValueEnum<'ctx>, indices: &[Expr], val: inkwell::values::BasicValueEnum<'ctx>, val_ty: Type) -> Result<(), String> {
let set_fn = self.module.get_function("tl_tensor_set_f32_md").ok_or("tl_tensor_set_f32_md not found")?;
let i64_ty = self.context.i64_type();
let idx_arr_ty = i64_ty.array_type(indices.len() as u32);
let current_block = self.builder.get_insert_block().unwrap();
let func = current_block.get_parent().unwrap();
let builder = self.context.create_builder();
builder.position_at_end(func.get_first_basic_block().unwrap());
if let Some(first_inst) = func.get_first_basic_block().unwrap().get_first_instruction() {
builder.position_before(&first_inst);
}
let idx_alloca = builder.build_alloca(idx_arr_ty, "idx_arr").unwrap();
for (i, idx_expr) in indices.iter().enumerate() {
let (v, t) = self.compile_expr(idx_expr)?;
let v_int = match t {
Type::I64 => v.into_int_value(),
Type::I32 => self.builder.build_int_z_extend(v.into_int_value(), i64_ty, "").unwrap(),
_ => return Err("Index not int".into()),
};
let ptr = unsafe { self.builder.build_in_bounds_gep(idx_arr_ty, idx_alloca, &[i64_ty.const_int(0,false), i64_ty.const_int(i as u64, false)], "").unwrap() };
self.builder.build_store(ptr, v_int).unwrap();
}
let idx_ptr = self.builder.build_pointer_cast(idx_alloca, self.context.ptr_type(inkwell::AddressSpace::default()), "").unwrap();
let f32_val = self.build_float_cast_val(val, &val_ty, self.context.f32_type())?;
self.builder.build_call(set_fn, &[tensor_val.into(), idx_ptr.into(), i64_ty.const_int(indices.len() as u64, false).into(), f32_val.into()], "set_res").unwrap();
Ok(())
}
fn emit_struct_set(&mut self, struct_val: inkwell::values::BasicValueEnum<'ctx>, struct_name: &str, generics: &[Type], indices: &[Expr], val: inkwell::values::BasicValueEnum<'ctx>) -> Result<(), String> {
// Struct index assignment: index_mut を優先し、なければ set にフォールバック
if indices.len() != 1 { return Err("Struct set supports 1 index".into()); }
let (idx_val, _) = self.compile_expr(&indices[0])?;
// Determine (base_name, type_args, mangled_name) for method lookup
let (base_name, type_args, mangled_name) = if generics.is_empty() {
(struct_name.to_string(), vec![], struct_name.to_string())
} else {
// Use mangle_type_name to derive the mangled name
let mangled = self.mangle_type_name(struct_name, generics);
(struct_name.to_string(), generics.to_vec(), mangled)
};
// resolve_index_mut_method で適切なメソッド名を決定
let struct_ty = if generics.is_empty() {
Type::Struct(struct_name.to_string(), vec![])
} else {
Type::Struct(struct_name.to_string(), generics.to_vec())
};
let method_name = self.resolve_index_mut_method(&struct_ty);
// On-demand monomorphize the resolved method if this is a generic type
if !type_args.is_empty() {
let _ = self.monomorphize_method(&base_name, &method_name, &type_args);
}
// Look for instance method on this type
// The runtime function name follows pattern: tl_{TypeName}_{method}
let fn_name = format!("tl_{}_{}", mangled_name, method_name);
if let Some(set_fn) = self.module.get_function(&fn_name) {
// Call method(self, index, item)
self.builder.build_call(set_fn, &[struct_val.into(), idx_val.into(), val.into()], "")
.map_err(|e| e.to_string())?;
return Ok(());
}
// Fallback: try 'set' method explicitly if we tried index_mut first
if method_name != "set" {
let set_fn_name = format!("tl_{}_set", mangled_name);
if !type_args.is_empty() {
let _ = self.monomorphize_method(&base_name, "set", &type_args);
}
if let Some(set_fn) = self.module.get_function(&set_fn_name) {
self.builder.build_call(set_fn, &[struct_val.into(), idx_val.into(), val.into()], "")
.map_err(|e| e.to_string())?;
return Ok(());
}
}
// Fallback: try to find method via TypeManager
if let Some(type_info) = self.type_manager.get_type(&mangled_name) {
if type_info.has_instance_method("set") {
return Err(format!("Struct set method found but instance method call not yet implemented for {}", mangled_name));
}
}
Err(format!("Struct set/index_mut method not found for type '{}' (looked for fn '{}', base='{}', type_args={:?})", mangled_name, fn_name, base_name, type_args))
}
fn build_float_cast_val(&self, val: inkwell::values::BasicValueEnum<'ctx>, from: &Type, to: inkwell::types::FloatType<'ctx>) -> Result<inkwell::values::FloatValue<'ctx>, String> {
match from {
Type::F32 => Ok(val.into_float_value()),
Type::I64 => Ok(self.builder.build_signed_int_to_float(val.into_int_value(), to, "").unwrap()),
Type::I32 => Ok(self.builder.build_signed_int_to_float(val.into_int_value(), to, "").unwrap()),
_ => Err("Invalid cast".into())
}
}
fn append_bb(&self, name: &str) -> inkwell::basic_block::BasicBlock<'ctx> {
self.context.append_basic_block(self.builder.get_insert_block().unwrap().get_parent().unwrap(), name)
}
}
fn stmt_trace_tag(stmt: &Stmt) -> &'static str {
match &stmt.inner {
StmtKind::Use { .. } => "Use",
StmtKind::Let { .. } => "Let",
StmtKind::Assign { .. } => "Assign",
StmtKind::For { .. } => "For",
StmtKind::While { .. } => "While",
StmtKind::Loop { .. } => "Loop",
StmtKind::Return(_) => "Return",
StmtKind::Break => "Break",
StmtKind::Continue => "Continue",
StmtKind::Expr(_) => "Expr",
StmtKind::TensorDecl { .. } => "TensorDecl",
}
}