rilua 0.1.18

Lua 5.1.1 implemented in Rust, targeting the World of Warcraft addon variant.
Documentation
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
//! String library: pattern matching, formatting, string manipulation.
//!
//! Reference: `lstrlib.c` in PUC-Rio Lua 5.1.1.

use crate::error::{LuaError, LuaResult, RuntimeError};
use crate::vm::state::LuaState;
use crate::vm::value::Val;

// ---------------------------------------------------------------------------
// Argument helpers (same pattern as base.rs)
// ---------------------------------------------------------------------------

#[inline]
fn nargs(state: &LuaState) -> usize {
    state.top.saturating_sub(state.base)
}

#[inline]
fn arg(state: &LuaState, n: usize) -> Val {
    let idx = state.base + n;
    if idx < state.top {
        state.stack_get(idx)
    } else {
        Val::Nil
    }
}

fn bad_argument(name: &str, n: usize, msg: &str) -> LuaError {
    LuaError::Runtime(RuntimeError {
        message: format!("bad argument #{n} to '{name}' ({msg})"),
        level: 0,
        traceback: vec![],
    })
}

fn check_args(name: &str, state: &LuaState, min: usize) -> LuaResult<()> {
    if nargs(state) < min {
        Err(bad_argument(name, min, "value expected"))
    } else {
        Ok(())
    }
}

/// Extracts a string argument as bytes. Returns the byte slice data as a Vec.
fn check_string(state: &LuaState, name: &str, n: usize) -> LuaResult<Vec<u8>> {
    let val = arg(state, n);
    match val {
        Val::Str(r) => state
            .gc
            .string_arena
            .get(r)
            .map(|s| s.data().to_vec())
            .ok_or_else(|| bad_argument(name, n + 1, "string expected")),
        Val::Num(_) => {
            // Lua coerces numbers to strings for string functions.
            Ok(format!("{val}").into_bytes())
        }
        _ => Err(bad_argument(name, n + 1, "string expected")),
    }
}

/// Extracts a numeric argument, coercing strings to numbers.
/// Matches PUC-Rio's `luaL_checknumber` behavior.
fn check_number(state: &LuaState, name: &str, n: usize) -> LuaResult<f64> {
    let val = arg(state, n);
    match val {
        Val::Num(v) => Ok(v),
        Val::Str(r) => {
            let data = state
                .gc
                .string_arena
                .get(r)
                .map(|s| s.data().to_vec())
                .unwrap_or_default();
            let text = String::from_utf8_lossy(&data);
            crate::vm::execute::str_to_number(&data)
                .ok_or_else(|| bad_argument(name, n + 1, &format!("number expected, got '{text}'")))
        }
        _ => Err(bad_argument(name, n + 1, "number expected")),
    }
}

/// Extracts an integer argument (truncates float), coercing strings.
/// Matches PUC-Rio's `luaL_checkinteger`.
#[allow(clippy::cast_possible_truncation)]
fn check_int(state: &LuaState, name: &str, n: usize) -> LuaResult<i64> {
    Ok(check_number(state, name, n)? as i64)
}

/// Extracts an optional integer argument, defaulting to `default` if nil/absent.
#[allow(clippy::cast_possible_truncation)]
fn opt_int(state: &LuaState, name: &str, n: usize, default: i64) -> LuaResult<i64> {
    if nargs(state) <= n || matches!(arg(state, n), Val::Nil) {
        return Ok(default);
    }
    check_int(state, name, n)
}

/// Relative string position: negative means back from end.
/// PUC-Rio's `posrelat`.
fn posrelat(pos: i64, len: usize) -> i64 {
    if pos >= 0 { pos } else { pos + len as i64 + 1 }
}

// ---------------------------------------------------------------------------
// string.len
// ---------------------------------------------------------------------------

/// `string.len(s)` -- Returns the length of a string.
pub fn str_len(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.len", state, 1)?;
    let s = check_string(state, "string.len", 0)?;
    #[allow(clippy::cast_precision_loss)]
    let len = s.len() as f64;
    state.push(Val::Num(len));
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.byte
// ---------------------------------------------------------------------------

/// `string.byte(s [, i [, j]])` -- Returns byte values of characters.
pub fn str_byte(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.byte", state, 1)?;
    let s = check_string(state, "string.byte", 0)?;
    let len = s.len();

    let posi = opt_int(state, "string.byte", 1, 1).map(|i| posrelat(i, len))?;
    let pose = opt_int(state, "string.byte", 2, posi).map(|j| posrelat(j, len))?;

    let posi = posi.max(1) as usize;
    let pose = pose.min(len as i64).max(0) as usize;

    if posi > pose {
        return Ok(0);
    }

    let n = pose - posi + 1;
    state.ensure_stack(state.top + n);

    for i in posi..=pose {
        state.push(Val::Num(f64::from(s[i - 1])));
    }

    Ok(n as u32)
}

// ---------------------------------------------------------------------------
// string.char
// ---------------------------------------------------------------------------

/// `string.char(...)` -- Returns a string of characters from byte values.
pub fn str_char(state: &mut LuaState) -> LuaResult<u32> {
    let n = nargs(state);
    let mut buf = Vec::with_capacity(n);

    for i in 0..n {
        let c = check_number(state, "string.char", i)?;
        #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
        let byte = c as u32;
        if byte > 255 {
            return Err(bad_argument("string.char", i + 1, "invalid value"));
        }
        #[allow(clippy::cast_possible_truncation)]
        buf.push(byte as u8);
    }

    let r = state.gc.intern_string(&buf);
    state.push(Val::Str(r));
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.sub
// ---------------------------------------------------------------------------

/// `string.sub(s, i [, j])` -- Returns a substring.
pub fn str_sub(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.sub", state, 2)?;
    let s = check_string(state, "string.sub", 0)?;
    let len = s.len();

    let start = posrelat(check_int(state, "string.sub", 1)?, len);
    #[allow(clippy::cast_possible_truncation)]
    let end = opt_int(state, "string.sub", 2, len as i64).map(|j| posrelat(j, len))?;

    let start = start.max(1) as usize;
    let end = end.min(len as i64).max(0) as usize;

    if start <= end {
        let r = state.gc.intern_string(&s[start - 1..end]);
        state.push(Val::Str(r));
    } else {
        let r = state.gc.intern_string(b"");
        state.push(Val::Str(r));
    }
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.rep
// ---------------------------------------------------------------------------

/// PUC-Rio 32-bit limit: ~4GB. Use same limit for cross-platform consistency.
const MAX_STRING_SIZE: usize = (u32::MAX - 2) as usize;

/// `string.rep(s, n)` -- Returns a string repeated n times.
pub fn str_rep(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.rep", state, 2)?;
    let s = check_string(state, "string.rep", 0)?;
    let n = check_int(state, "string.rep", 1)?;

    if n <= 0 {
        let r = state.gc.intern_string(b"");
        state.push(Val::Str(r));
    } else {
        let total = s.len().saturating_mul(n as usize);
        if total > MAX_STRING_SIZE {
            return Err(LuaError::Runtime(crate::RuntimeError {
                message: "string length overflow".to_string(),
                level: 0,
                traceback: vec![],
            }));
        }
        let mut buf = Vec::with_capacity(total);
        for _ in 0..n {
            buf.extend_from_slice(&s);
        }
        let r = state.gc.intern_string(&buf);
        state.push(Val::Str(r));
    }
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.reverse
// ---------------------------------------------------------------------------

/// `string.reverse(s)` -- Returns the string reversed.
pub fn str_reverse(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.reverse", state, 1)?;
    let s = check_string(state, "string.reverse", 0)?;
    let mut reversed = s;
    reversed.reverse();
    let r = state.gc.intern_string(&reversed);
    state.push(Val::Str(r));
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.lower
// ---------------------------------------------------------------------------

/// `string.lower(s)` -- Returns the string with all uppercase letters lowered.
/// Uses libc `tolower` for locale-aware conversion (matching PUC-Rio).
#[allow(unsafe_code)]
pub fn str_lower(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.lower", state, 1)?;
    let s = check_string(state, "string.lower", 0)?;
    let lowered: Vec<u8> = s
        .iter()
        .map(|&c| unsafe { tolower(i32::from(c)) as u8 })
        .collect();
    let r = state.gc.intern_string(&lowered);
    state.push(Val::Str(r));
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.upper
// ---------------------------------------------------------------------------

/// `string.upper(s)` -- Returns the string with all lowercase letters raised.
/// Uses libc `toupper` for locale-aware conversion (matching PUC-Rio).
#[allow(unsafe_code)]
pub fn str_upper(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.upper", state, 1)?;
    let s = check_string(state, "string.upper", 0)?;
    let uppered: Vec<u8> = s
        .iter()
        .map(|&c| unsafe { toupper(i32::from(c)) as u8 })
        .collect();
    let r = state.gc.intern_string(&uppered);
    state.push(Val::Str(r));
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.format
// ---------------------------------------------------------------------------

/// Maximum number of captures for pattern matching.
const LUA_MAXCAPTURES: usize = 32;

/// `string.format(formatstring, ...)` -- Formats values into a string.
///
/// Supports: %d, %i, %u, %f, %e, %E, %g, %G, %o, %x, %X, %c, %s, %q, %%.
/// Width, precision, and flags (-, +, space, 0, #) are supported.
///
/// Reference: `str_format` in `lstrlib.c`.
pub fn str_format(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.format", state, 1)?;
    let fmt = check_string(state, "string.format", 0)?;
    let mut result = Vec::new();
    let mut arg_idx = 1usize; // Next argument index (0 = format string itself).
    let mut i = 0;

    while i < fmt.len() {
        if fmt[i] != b'%' {
            result.push(fmt[i]);
            i += 1;
            continue;
        }
        i += 1; // Skip '%'.
        if i >= fmt.len() {
            return Err(bad_argument(
                "string.format",
                1,
                "invalid format string (ends with '%')",
            ));
        }

        // %% escape.
        if fmt[i] == b'%' {
            result.push(b'%');
            i += 1;
            continue;
        }

        // Parse flags.
        let spec_start = i - 1;
        while i < fmt.len() && b"-+ #0".contains(&fmt[i]) {
            i += 1;
        }

        // Parse width.
        while i < fmt.len() && fmt[i].is_ascii_digit() {
            i += 1;
        }

        // Parse precision.
        if i < fmt.len() && fmt[i] == b'.' {
            i += 1;
            while i < fmt.len() && fmt[i].is_ascii_digit() {
                i += 1;
            }
        }

        if i >= fmt.len() {
            return Err(bad_argument("string.format", 1, "invalid format string"));
        }

        let spec_char = fmt[i];
        let spec = &fmt[spec_start..=i];
        i += 1;

        match spec_char {
            b'd' | b'i' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                #[allow(clippy::cast_possible_truncation)]
                let int_val = n as i64;
                let formatted = format_with_spec(spec, &FormatArg::Int(int_val));
                result.extend_from_slice(formatted.as_bytes());
            }
            b'u' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
                let uint_val = n as u64;
                let formatted = format_with_spec(spec, &FormatArg::Uint(uint_val));
                result.extend_from_slice(formatted.as_bytes());
            }
            b'o' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
                let uint_val = n as u64;
                let formatted = format_with_spec(spec, &FormatArg::Oct(uint_val));
                result.extend_from_slice(formatted.as_bytes());
            }
            b'x' | b'X' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
                let uint_val = n as u64;
                let formatted = if spec_char == b'x' {
                    format_with_spec(spec, &FormatArg::Hex(uint_val))
                } else {
                    format_with_spec(spec, &FormatArg::HexUpper(uint_val))
                };
                result.extend_from_slice(formatted.as_bytes());
            }
            b'f' | b'e' | b'E' | b'g' | b'G' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                let formatted = format_with_spec(spec, &FormatArg::Float(n));
                result.extend_from_slice(formatted.as_bytes());
            }
            b'c' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let n = coerce_to_number_err(state, val, "string.format", arg_idx)?;
                #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
                let ch = (n as u32 & 0xFF) as u8;
                result.push(ch);
            }
            b's' => {
                let val = arg(state, arg_idx);
                arg_idx += 1;
                // Lua strings are byte arrays, not UTF-8. We must work
                // with raw bytes to avoid replacing high bytes with the
                // UTF-8 replacement character (U+FFFD).
                let s_bytes: Vec<u8> = match val {
                    Val::Str(r) => state
                        .gc
                        .string_arena
                        .get(r)
                        .map(|s| s.data().to_vec())
                        .unwrap_or_default(),
                    Val::Nil => b"nil".to_vec(),
                    Val::Bool(b) => {
                        if b {
                            b"true".to_vec()
                        } else {
                            b"false".to_vec()
                        }
                    }
                    _ => format!("{val}").into_bytes(),
                };
                let formatted = format_string_with_spec_bytes(spec, &s_bytes);
                result.extend_from_slice(&formatted);
            }
            b'q' => {
                // %q: quoted string (adds quotes and escapes special chars).
                let val = arg(state, arg_idx);
                arg_idx += 1;
                let Val::Str(r) = val else {
                    return Err(bad_argument("string.format", arg_idx, "string expected"));
                };
                let s = state
                    .gc
                    .string_arena
                    .get(r)
                    .map(|s| s.data().to_vec())
                    .unwrap_or_default();
                result.push(b'"');
                for &byte in &s {
                    match byte {
                        b'\\' => result.extend_from_slice(b"\\\\"),
                        b'"' => result.extend_from_slice(b"\\\""),
                        // PUC-Rio: newline is escaped as backslash + actual newline.
                        b'\n' => {
                            result.push(b'\\');
                            result.push(b'\n');
                        }
                        b'\r' => result.extend_from_slice(b"\\r"),
                        // PUC-Rio: null byte is escaped as \000 (3-digit octal).
                        b'\0' => result.extend_from_slice(b"\\000"),
                        _ => result.push(byte),
                    }
                }
                result.push(b'"');
            }
            _ => {
                return Err(bad_argument(
                    "string.format",
                    1,
                    &format!("invalid option '%{}'", char::from(spec_char)),
                ));
            }
        }
    }

    let r = state.gc.intern_string(&result);
    state.push(Val::Str(r));
    Ok(1)
}

/// Coerce a value to f64 or return an error.
fn coerce_to_number_err(state: &LuaState, val: Val, name: &str, arg_n: usize) -> LuaResult<f64> {
    match val {
        Val::Num(n) => Ok(n),
        Val::Str(r) => {
            let s = state
                .gc
                .string_arena
                .get(r)
                .map(|s| String::from_utf8_lossy(s.data()).to_string())
                .unwrap_or_default();
            s.trim()
                .parse::<f64>()
                .map_err(|_| bad_argument(name, arg_n, "number expected"))
        }
        _ => Err(bad_argument(name, arg_n, "number expected")),
    }
}

/// Format argument types for the spec formatter.
enum FormatArg {
    Int(i64),
    Uint(u64),
    Oct(u64),
    Hex(u64),
    HexUpper(u64),
    Float(f64),
}

/// Formats a value using a C-style format specifier.
///
/// We parse the spec manually to extract flags, width, precision, then
/// use Rust's formatting to approximate C printf behavior.
fn format_with_spec(spec: &[u8], arg: &FormatArg) -> String {
    let spec_str = String::from_utf8_lossy(spec);

    // Parse flags, width, precision from spec like "%-10.3f"
    let mut flags = String::new();
    let mut width: Option<usize> = None;
    let mut precision: Option<usize> = None;

    let chars: Vec<char> = spec_str.chars().collect();
    let mut idx = 1; // Skip '%'

    // Parse flags.
    while idx < chars.len() && "-+ #0".contains(chars[idx]) {
        flags.push(chars[idx]);
        idx += 1;
    }

    // Parse width.
    let width_start = idx;
    while idx < chars.len() && chars[idx].is_ascii_digit() {
        idx += 1;
    }
    if idx > width_start {
        width = chars[width_start..idx]
            .iter()
            .collect::<String>()
            .parse()
            .ok();
    }

    // Parse precision.
    if idx < chars.len() && chars[idx] == '.' {
        idx += 1;
        let prec_start = idx;
        while idx < chars.len() && chars[idx].is_ascii_digit() {
            idx += 1;
        }
        precision = if idx > prec_start {
            chars[prec_start..idx]
                .iter()
                .collect::<String>()
                .parse()
                .ok()
        } else {
            Some(0)
        };
    }

    let left_align = flags.contains('-');
    let pad_zero = flags.contains('0') && !left_align;
    let plus_sign = flags.contains('+');
    let space_sign = flags.contains(' ');
    let alt = flags.contains('#');
    let w = width.unwrap_or(0);

    match *arg {
        FormatArg::Int(n) => {
            let sign = if n < 0 {
                "-"
            } else if plus_sign {
                "+"
            } else if space_sign {
                " "
            } else {
                ""
            };
            let abs = n.unsigned_abs();
            let digits = format!("{abs}");
            pad_number(sign, &digits, w, left_align, pad_zero)
        }
        FormatArg::Uint(n) => {
            let digits = format!("{n}");
            pad_number("", &digits, w, left_align, pad_zero)
        }
        FormatArg::Oct(n) => {
            let digits = format!("{n:o}");
            let prefix = if alt && n != 0 { "0" } else { "" };
            pad_number(prefix, &digits, w, left_align, pad_zero)
        }
        FormatArg::Hex(n) => {
            let digits = format!("{n:x}");
            let prefix = if alt { "0x" } else { "" };
            pad_number(prefix, &digits, w, left_align, pad_zero)
        }
        FormatArg::HexUpper(n) => {
            let digits = format!("{n:X}");
            let prefix = if alt { "0X" } else { "" };
            pad_number(prefix, &digits, w, left_align, pad_zero)
        }
        FormatArg::Float(n) => format_float(
            n, &chars, w, precision, left_align, pad_zero, plus_sign, space_sign,
        ),
    }
}

/// Pads a number with sign/prefix, digits, and appropriate padding.
fn pad_number(sign: &str, digits: &str, width: usize, left_align: bool, pad_zero: bool) -> String {
    let total = sign.len() + digits.len();
    if total >= width {
        return format!("{sign}{digits}");
    }
    let padding = width - total;
    if left_align {
        format!("{sign}{digits}{:padding$}", "")
    } else if pad_zero {
        format!("{sign}{:0>padding$}{digits}", "")
    } else {
        format!("{:>padding$}{sign}{digits}", "")
    }
}

/// Normalizes the exponent in scientific notation strings to match C printf:
/// - Always includes a sign (`e+10` not `e10`)
/// - Pads to at least 2 digits (`e+05` not `e+5`)
fn normalize_exponent_sign(s: &str) -> String {
    if let Some(e_pos) = s.find(['e', 'E']) {
        let (before, exp_part) = s.split_at(e_pos);
        let e_char = &exp_part[..1];
        let exp_digits = &exp_part[1..];
        // Separate sign and digits.
        let (sign, digits) = if let Some(rest) = exp_digits.strip_prefix('-') {
            ("-", rest)
        } else if let Some(rest) = exp_digits.strip_prefix('+') {
            ("+", rest)
        } else {
            ("+", exp_digits)
        };
        // C printf pads exponent to at least 2 digits.
        if digits.len() < 2 {
            format!("{before}{e_char}{sign}0{digits}")
        } else {
            format!("{before}{e_char}{sign}{digits}")
        }
    } else {
        s.to_string()
    }
}

/// Formats a float value with the given spec.
///
/// The parameter count mirrors PUC-Rio's format spec fields: value, spec chars,
/// width, precision, and four boolean flags. Grouping into a struct would add
/// indirection without reducing complexity since this is the only call site.
#[allow(clippy::too_many_arguments, clippy::fn_params_excessive_bools)]
fn format_float(
    n: f64,
    chars: &[char],
    width: usize,
    precision: Option<usize>,
    left_align: bool,
    pad_zero: bool,
    plus_sign: bool,
    space_sign: bool,
) -> String {
    let spec_char = chars[chars.len() - 1];
    let prec = precision.unwrap_or(6);

    // Handle NaN and infinity specially to match C printf behavior.
    if n.is_nan() || n.is_infinite() {
        let upper = matches!(spec_char, 'E' | 'G');
        let mut formatted = if n.is_nan() {
            if upper {
                "nan".to_uppercase()
            } else {
                "nan".to_string()
            }
        } else if upper {
            "inf".to_uppercase()
        } else {
            "inf".to_string()
        };
        // Sign handling.
        if n.is_sign_negative() {
            formatted.insert(0, '-');
        } else if plus_sign {
            formatted.insert(0, '+');
        } else if space_sign {
            formatted.insert(0, ' ');
        }
        // Pad to width.
        if formatted.len() >= width {
            return formatted;
        }
        let padding = width - formatted.len();
        return if left_align {
            format!("{formatted}{:padding$}", "")
        } else {
            format!("{:>padding$}{formatted}", "")
        };
    }

    let mut formatted = match spec_char {
        'f' => format!("{n:.prec$}"),
        'e' => normalize_exponent_sign(&format!("{n:.prec$e}")),
        'E' => normalize_exponent_sign(&format!("{n:.prec$E}")),
        'g' | 'G' => {
            // %g: use %e if exponent < -4 or >= precision, else %f.
            // Remove trailing zeros from fractional part.
            let effective_prec = if prec == 0 { 1 } else { prec };
            format_g(n, effective_prec, spec_char == 'G')
        }
        _ => format!("{n}"),
    };

    // Add sign if needed.
    if n >= 0.0 && !n.is_nan() {
        if plus_sign {
            formatted.insert(0, '+');
        } else if space_sign {
            formatted.insert(0, ' ');
        }
    }

    // Pad to width.
    if formatted.len() >= width {
        formatted
    } else {
        let padding = width - formatted.len();
        if left_align {
            format!("{formatted}{:padding$}", "")
        } else if pad_zero {
            // Insert zeros after sign.
            if formatted.starts_with('-')
                || formatted.starts_with('+')
                || formatted.starts_with(' ')
            {
                let (sign, rest) = formatted.split_at(1);
                format!("{sign}{:0>padding$}{rest}", "")
            } else {
                format!("{:0>padding$}{formatted}", "")
            }
        } else {
            format!("{:>padding$}{formatted}", "")
        }
    }
}

/// Format a float using %g/%G rules.
fn format_g(n: f64, prec: usize, upper: bool) -> String {
    // Special cases: NaN and infinity are handled by format_float's sign logic,
    // but we need to handle them here for standalone %g calls.
    if n.is_nan() {
        // Match C printf: lowercase, with sign.
        return if upper {
            if n.is_sign_negative() {
                "-NAN".to_string()
            } else {
                "NAN".to_string()
            }
        } else if n.is_sign_negative() {
            "-nan".to_string()
        } else {
            "nan".to_string()
        };
    }
    if n.is_infinite() {
        return if upper {
            if n < 0.0 {
                "-INF".to_string()
            } else {
                "INF".to_string()
            }
        } else if n < 0.0 {
            "-inf".to_string()
        } else {
            "inf".to_string()
        };
    }
    if n == 0.0 {
        // Preserve negative zero.
        return if n.is_sign_negative() {
            "-0".to_string()
        } else {
            "0".to_string()
        };
    }

    // Use scientific notation to determine which format to use.
    let exp = if n == 0.0 {
        0
    } else {
        n.abs().log10().floor() as i32
    };

    if exp < -4 || exp >= prec as i32 {
        // Use %e format, then strip trailing zeros.
        let e_prec = prec.saturating_sub(1);
        let formatted = if upper {
            format!("{n:.e_prec$E}")
        } else {
            format!("{n:.e_prec$e}")
        };
        strip_trailing_zeros_scientific(&formatted)
    } else {
        // Use %f format with adjusted precision, then strip trailing zeros.
        // prec = total significant digits, exp+1 = digits before decimal point.
        // When exp is negative, we need MORE fractional digits, not fewer.
        #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
        let f_prec = (prec as i32 - (exp + 1)).max(0) as usize;
        let formatted = format!("{n:.f_prec$}");
        strip_trailing_zeros_fixed(&formatted)
    }
}

/// Strip trailing zeros from a fixed-point formatted number.
fn strip_trailing_zeros_fixed(s: &str) -> String {
    if s.contains('.') {
        let trimmed = s.trim_end_matches('0');
        let trimmed = trimmed.trim_end_matches('.');
        trimmed.to_string()
    } else {
        s.to_string()
    }
}

/// Strip trailing zeros from a scientific notation number.
/// Also normalizes the exponent to always include a sign (C printf compat).
fn strip_trailing_zeros_scientific(s: &str) -> String {
    // Split at 'e' or 'E'.
    if let Some(e_pos) = s.find(['e', 'E']) {
        let (mantissa, exp_part) = s.split_at(e_pos);
        let trimmed = strip_trailing_zeros_fixed(mantissa);
        // Recombine with normalized exponent sign.
        normalize_exponent_sign(&format!("{trimmed}{exp_part}"))
    } else {
        s.to_string()
    }
}

/// Format a string with width/precision from a `%s` specifier.
/// Lua strings are byte arrays; we must avoid any UTF-8 conversion so that
/// raw bytes (like 0xed) pass through unchanged.
fn format_string_with_spec_bytes(spec: &[u8], s: &[u8]) -> Vec<u8> {
    let mut idx = 1; // Skip '%'.

    let mut left_align = false;
    while idx < spec.len() && b"-+ #0".contains(&spec[idx]) {
        if spec[idx] == b'-' {
            left_align = true;
        }
        idx += 1;
    }

    let mut width: Option<usize> = None;
    let width_start = idx;
    while idx < spec.len() && spec[idx].is_ascii_digit() {
        idx += 1;
    }
    if idx > width_start {
        width = std::str::from_utf8(&spec[width_start..idx])
            .ok()
            .and_then(|s| s.parse().ok());
    }

    let precision = if idx < spec.len() && spec[idx] == b'.' {
        idx += 1;
        let prec_start = idx;
        while idx < spec.len() && spec[idx].is_ascii_digit() {
            idx += 1;
        }
        if idx > prec_start {
            std::str::from_utf8(&spec[prec_start..idx])
                .ok()
                .and_then(|s| s.parse().ok())
        } else {
            Some(0)
        }
    } else {
        None
    };

    // Apply precision (truncate string at byte level).
    let truncated = if let Some(prec) = precision {
        if prec < s.len() { &s[..prec] } else { s }
    } else {
        s
    };

    // Apply width.
    let w = width.unwrap_or(0);
    if truncated.len() >= w {
        truncated.to_vec()
    } else {
        let padding = w - truncated.len();
        let mut out = Vec::with_capacity(w);
        if left_align {
            out.extend_from_slice(truncated);
            out.resize(out.len() + padding, b' ');
        } else {
            out.resize(padding, b' ');
            out.extend_from_slice(truncated);
        }
        out
    }
}

// ---------------------------------------------------------------------------
// Pattern matching engine
// ---------------------------------------------------------------------------

/// Match state for pattern matching operations.
struct MatchState<'a> {
    /// Source string being searched.
    src: &'a [u8],
    /// Pattern string.
    pat: &'a [u8],
    /// Captures.
    captures: Vec<Capture>,
    /// Number of open (incomplete) captures.
    level: usize,
    /// Recursion depth counter for match_ function.
    depth: u32,
}

/// A pattern capture result.
#[derive(Clone, Copy)]
struct Capture {
    /// Start position in source string.
    start: usize,
    /// Length of capture. `CAP_UNFINISHED` = not yet closed,
    /// `CAP_POSITION` = position capture.
    len: CaptureLen,
}

#[derive(Clone, Copy)]
enum CaptureLen {
    Finished(usize),
    Unfinished,
    Position,
}

/// Maximum recursion depth for pattern matching.
const MAXCCALLS: u32 = 200;

enum Quantifier {
    Greedy,   // *
    Plus,     // +
    Lazy,     // -
    Optional, // ?
    None,
}

// Locale-aware character classification and case conversion.
// On native targets, these are libc functions that respect the current
// C locale (set via os.setlocale). On WASM, ASCII-only stubs are used.
// All declarations live in platform.rs.
use crate::platform::{
    isalnum, isalpha, iscntrl, isdigit, islower, ispunct, isspace, isupper, isxdigit, tolower,
    toupper,
};

/// Match a character against a character class letter.
/// Uses libc functions for locale-aware classification (matching PUC-Rio).
#[allow(unsafe_code)]
fn matchclass(ch: u8, class: u8) -> bool {
    let c = i32::from(ch);
    let lower_class = class.to_ascii_lowercase();
    // SAFETY: isalpha et al. are standard C functions that accept any int
    // value; unsigned char values (0-255) are always valid arguments.
    let result = match lower_class {
        b'a' => unsafe { isalpha(c) != 0 },
        b'c' => unsafe { iscntrl(c) != 0 },
        b'd' => unsafe { isdigit(c) != 0 },
        b'l' => unsafe { islower(c) != 0 },
        b'p' => unsafe { ispunct(c) != 0 },
        b's' => unsafe { isspace(c) != 0 },
        b'u' => unsafe { isupper(c) != 0 },
        b'w' => unsafe { isalnum(c) != 0 },
        b'x' => unsafe { isxdigit(c) != 0 },
        b'z' => ch == 0,         // PUC-Rio: case 'z': res = (c == 0)
        _ => return ch == class, // Literal match for non-class escapes.
    };
    // Uppercase class means complement.
    if class.is_ascii_uppercase() {
        !result
    } else {
        result
    }
}

impl<'a> MatchState<'a> {
    fn new(src: &'a [u8], pat: &'a [u8]) -> Self {
        Self {
            src,
            pat,
            captures: Vec::new(),
            level: 0,
            depth: 0,
        }
    }

    /// Main pattern matching function. Tries to match pattern starting at
    /// `pat_pos` against source starting at `src_pos`.
    ///
    /// Returns `Some(end_pos)` where end_pos is the position past the match
    /// in the source, or `None` if no match.
    fn match_(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        self.depth += 1;
        if self.depth > MAXCCALLS {
            return Err(LuaError::Runtime(RuntimeError {
                message: "pattern too complex".into(),
                level: 0,
                traceback: vec![],
            }));
        }
        let result = self.match_inner(src_pos, pat_pos);
        self.depth -= 1;
        result
    }

    fn match_inner(&mut self, mut src_pos: usize, mut pat_pos: usize) -> LuaResult<Option<usize>> {
        loop {
            if pat_pos >= self.pat.len() {
                return Ok(Some(src_pos));
            }

            match self.pat[pat_pos] {
                b'(' => {
                    if pat_pos + 1 < self.pat.len() && self.pat[pat_pos + 1] == b')' {
                        // Position capture.
                        return self.match_position_capture(src_pos, pat_pos);
                    }
                    return self.match_open_capture(src_pos, pat_pos);
                }
                b')' => {
                    return self.match_close_capture(src_pos, pat_pos);
                }
                b'$' if pat_pos + 1 >= self.pat.len() => {
                    // End anchor.
                    return Ok(if src_pos == self.src.len() {
                        Some(src_pos)
                    } else {
                        None
                    });
                }
                _ => {}
            }

            // Check for class followed by quantifier.
            let (class_end, quantifier) = self.get_quantifier(pat_pos);

            match quantifier {
                Quantifier::Greedy => {
                    // '*' - match 0 or more, greedy.
                    return self.match_greedy(src_pos, pat_pos, class_end + 1);
                }
                Quantifier::Lazy => {
                    // '-' - match 0 or more, lazy.
                    return self.match_lazy(src_pos, pat_pos, class_end + 1);
                }
                Quantifier::Plus => {
                    // '+' - match 1 or more, greedy.
                    if src_pos < self.src.len() && self.singlematch(src_pos, pat_pos) {
                        return self.match_greedy(src_pos + 1, pat_pos, class_end + 1);
                    }
                    return Ok(None);
                }
                Quantifier::Optional => {
                    // '?' - match 0 or 1.
                    if src_pos < self.src.len()
                        && self.singlematch(src_pos, pat_pos)
                        && let Some(end) = self.match_(src_pos + 1, class_end + 1)?
                    {
                        return Ok(Some(end));
                    }
                    pat_pos = class_end + 1;
                }
                Quantifier::None => {
                    // No quantifier. Single match.
                    if pat_pos < self.pat.len()
                        && self.pat[pat_pos] == b'%'
                        && pat_pos + 1 < self.pat.len()
                    {
                        match self.pat[pat_pos + 1] {
                            b'b' => {
                                return self.match_balance(src_pos, pat_pos);
                            }
                            b'f' => {
                                return self.match_frontier(src_pos, pat_pos);
                            }
                            c if c.is_ascii_digit() => {
                                return self.match_backref(src_pos, pat_pos);
                            }
                            _ => {}
                        }
                    }

                    if src_pos < self.src.len() && self.singlematch(src_pos, pat_pos) {
                        src_pos += 1;
                        pat_pos = class_end;
                        continue;
                    }
                    return Ok(None);
                }
            }
        }
    }

    /// Greedy match: match as many as possible, then backtrack.
    fn match_greedy(
        &mut self,
        src_pos: usize,
        pat_class_start: usize,
        pat_rest: usize,
    ) -> LuaResult<Option<usize>> {
        let mut count = 0;
        while src_pos + count < self.src.len() && self.singlematch(src_pos + count, pat_class_start)
        {
            count += 1;
        }
        // Try from longest match down.
        while count >= 0_i64 as usize {
            if let Some(end) = self.match_(src_pos + count, pat_rest)? {
                return Ok(Some(end));
            }
            if count == 0 {
                break;
            }
            count -= 1;
        }
        Ok(None)
    }

    /// Lazy match: match as few as possible, grow.
    fn match_lazy(
        &mut self,
        src_pos: usize,
        pat_class_start: usize,
        pat_rest: usize,
    ) -> LuaResult<Option<usize>> {
        let mut count = 0;
        loop {
            if let Some(end) = self.match_(src_pos + count, pat_rest)? {
                return Ok(Some(end));
            }
            if src_pos + count < self.src.len()
                && self.singlematch(src_pos + count, pat_class_start)
            {
                count += 1;
            } else {
                return Ok(None);
            }
        }
    }

    /// Match a single character against the pattern class at `pat_pos`.
    fn singlematch(&self, src_pos: usize, pat_pos: usize) -> bool {
        if src_pos >= self.src.len() {
            return false;
        }
        let ch = self.src[src_pos];
        let p = self.pat[pat_pos];
        match p {
            b'.' => true, // Match any character.
            b'%' => {
                if pat_pos + 1 < self.pat.len() {
                    matchclass(ch, self.pat[pat_pos + 1])
                } else {
                    false
                }
            }
            b'[' => {
                // Bracket class.
                let (matches, _end) = self.matchbracketclass(ch, pat_pos);
                matches
            }
            _ => ch == p,
        }
    }

    /// Match a character against a bracket class `[set]`.
    /// PUC-Rio: `matchbracketclass(c, p, ec)` where p points to `[` and ec to `]`.
    fn matchbracketclass(&self, ch: u8, pat_pos: usize) -> (bool, usize) {
        // Find the closing ']' first (class_end handles ] after [^ correctly).
        let class_end_pos = self.class_end(pat_pos);
        // ec is the position of ']', class_end returns one past it.
        let ec = class_end_pos - 1;

        let mut pos = pat_pos + 1; // Skip '['.
        let complement = pos < ec && self.pat[pos] == b'^';
        if complement {
            pos += 1;
        }

        // PUC-Rio: while (++p < ec) — pre-increment processes chars between
        // (the opening `[`/`^`) and `ec` (the closing `]`).
        let mut matched = false;
        while pos < ec {
            if self.pat[pos] == b'%' && pos + 1 < ec {
                pos += 1;
                if matchclass(ch, self.pat[pos]) {
                    matched = true;
                }
                pos += 1;
            } else if pos + 2 < ec && self.pat[pos + 1] == b'-' {
                // Range a-z.
                if ch >= self.pat[pos] && ch <= self.pat[pos + 2] {
                    matched = true;
                }
                pos += 3;
            } else {
                if ch == self.pat[pos] {
                    matched = true;
                }
                pos += 1;
            }
        }

        (if complement { !matched } else { matched }, class_end_pos)
    }

    /// Returns the end position of the pattern class and what quantifier follows.
    fn get_quantifier(&self, pat_pos: usize) -> (usize, Quantifier) {
        let class_end = self.class_end(pat_pos);
        if class_end < self.pat.len() {
            match self.pat[class_end] {
                b'*' => (class_end, Quantifier::Greedy),
                b'+' => (class_end, Quantifier::Plus),
                b'-' => (class_end, Quantifier::Lazy),
                b'?' => (class_end, Quantifier::Optional),
                _ => (class_end, Quantifier::None),
            }
        } else {
            (class_end, Quantifier::None)
        }
    }

    /// Returns the position past the class pattern at `pat_pos`.
    fn class_end(&self, pat_pos: usize) -> usize {
        if pat_pos >= self.pat.len() {
            return pat_pos;
        }
        match self.pat[pat_pos] {
            b'%' => {
                if pat_pos + 1 < self.pat.len() {
                    pat_pos + 2
                } else {
                    pat_pos + 1
                }
            }
            b'[' => {
                let mut pos = pat_pos + 1;
                // Handle ^.
                if pos < self.pat.len() && self.pat[pos] == b'^' {
                    pos += 1;
                }
                // PUC-Rio uses do { ... } while (*p != ']') which processes
                // at least one character before checking for ']'. This handles
                // `]` immediately after `[` or `[^` as a literal.
                loop {
                    if pos >= self.pat.len() {
                        return pos;
                    }
                    if self.pat[pos] == b'%' && pos + 1 < self.pat.len() {
                        pos += 1; // Skip escaped char in bracket.
                    }
                    pos += 1;
                    // Check for closing ']' AFTER processing the character.
                    if pos < self.pat.len() && self.pat[pos] == b']' {
                        return pos + 1;
                    }
                }
            }
            _ => pat_pos + 1,
        }
    }

    /// Opens a new capture group.
    fn match_open_capture(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        if self.captures.len() >= LUA_MAXCAPTURES {
            return Err(LuaError::Runtime(RuntimeError {
                message: "too many captures".into(),
                level: 0,
                traceback: vec![],
            }));
        }
        let cap_idx = self.captures.len();
        self.captures.push(Capture {
            start: src_pos,
            len: CaptureLen::Unfinished,
        });
        self.level += 1;

        let result = self.match_(src_pos, pat_pos + 1)?;
        if result.is_none() {
            // Backtrack: remove the capture.
            self.captures.truncate(cap_idx);
            self.level -= 1;
        }
        Ok(result)
    }

    /// Handles a position capture `()`.
    fn match_position_capture(
        &mut self,
        src_pos: usize,
        pat_pos: usize,
    ) -> LuaResult<Option<usize>> {
        if self.captures.len() >= LUA_MAXCAPTURES {
            return Err(LuaError::Runtime(RuntimeError {
                message: "too many captures".into(),
                level: 0,
                traceback: vec![],
            }));
        }
        let cap_idx = self.captures.len();
        self.captures.push(Capture {
            start: src_pos,
            len: CaptureLen::Position,
        });
        self.level += 1;

        let result = self.match_(src_pos, pat_pos + 2)?;
        if result.is_none() {
            self.captures.truncate(cap_idx);
            self.level -= 1;
        }
        Ok(result)
    }

    /// Closes the most recent open capture.
    fn match_close_capture(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        // Find the most recent unfinished capture.
        let cap_idx = self.find_open_capture()?;
        let start = self.captures[cap_idx].start;
        self.captures[cap_idx].len = CaptureLen::Finished(src_pos - start);
        self.level -= 1;

        let result = self.match_(src_pos, pat_pos + 1)?;
        if result.is_none() {
            // Backtrack: reopen.
            self.captures[cap_idx].len = CaptureLen::Unfinished;
            self.level += 1;
        }
        Ok(result)
    }

    /// Finds the most recent unfinished capture index.
    fn find_open_capture(&self) -> LuaResult<usize> {
        for i in (0..self.captures.len()).rev() {
            if matches!(self.captures[i].len, CaptureLen::Unfinished) {
                return Ok(i);
            }
        }
        Err(LuaError::Runtime(RuntimeError {
            message: "invalid pattern capture".into(),
            level: 0,
            traceback: vec![],
        }))
    }

    /// Match `%bxy`: balanced match for delimiters x and y.
    fn match_balance(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        if pat_pos + 3 >= self.pat.len() {
            return Err(LuaError::Runtime(RuntimeError {
                message: "unbalanced pattern".into(),
                level: 0,
                traceback: vec![],
            }));
        }
        let open = self.pat[pat_pos + 2];
        let close = self.pat[pat_pos + 3];

        if src_pos >= self.src.len() || self.src[src_pos] != open {
            return Ok(None);
        }

        let mut count = 1i32;
        let mut pos = src_pos + 1;
        while pos < self.src.len() {
            // PUC-Rio checks close first, so when open==close,
            // each occurrence decrements (matching nearest pair).
            if self.src[pos] == close {
                count -= 1;
                if count == 0 {
                    return self.match_(pos + 1, pat_pos + 4);
                }
            } else if self.src[pos] == open {
                count += 1;
            }
            pos += 1;
        }
        Ok(None)
    }

    /// Match `%f[set]`: frontier pattern.
    fn match_frontier(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        if pat_pos + 2 >= self.pat.len() || self.pat[pat_pos + 2] != b'[' {
            return Err(LuaError::Runtime(RuntimeError {
                message: "missing '[' after '%f' in pattern".into(),
                level: 0,
                traceback: vec![],
            }));
        }

        let prev = if src_pos > 0 {
            self.src[src_pos - 1]
        } else {
            b'\0'
        };
        let curr = if src_pos < self.src.len() {
            self.src[src_pos]
        } else {
            b'\0'
        };

        let (prev_matches, bracket_end) = self.matchbracketclass(prev, pat_pos + 2);
        let (curr_matches, _) = self.matchbracketclass(curr, pat_pos + 2);

        if !prev_matches && curr_matches {
            self.match_(src_pos, bracket_end)
        } else {
            Ok(None)
        }
    }

    /// Match `%N` back-reference (1-9).
    fn match_backref(&mut self, src_pos: usize, pat_pos: usize) -> LuaResult<Option<usize>> {
        // PUC-Rio's check_capture: l = digit - '1'; error if l < 0 || l >= level || unfinished
        let n = (self.pat[pat_pos + 1] - b'0') as usize;
        if n == 0 || n > self.captures.len() {
            return Err(LuaError::Runtime(RuntimeError {
                message: "invalid capture index".into(),
                level: 0,
                traceback: vec![],
            }));
        }
        let cap = self.captures[n - 1];
        let CaptureLen::Finished(len) = cap.len else {
            return Err(LuaError::Runtime(RuntimeError {
                message: "invalid capture index".into(),
                level: 0,
                traceback: vec![],
            }));
        };

        if src_pos + len > self.src.len() {
            return Ok(None);
        }
        if self.src[src_pos..src_pos + len] == self.src[cap.start..cap.start + len] {
            self.match_(src_pos + len, pat_pos + 2)
        } else {
            Ok(None)
        }
    }
}

// ---------------------------------------------------------------------------
// string.find
// ---------------------------------------------------------------------------

/// `string.find(s, pattern [, init [, plain]])` -- Find first match.
///
/// Returns start and end indices (1-based) plus captures, or nil.
pub fn str_find(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.find", state, 2)?;
    let s = check_string(state, "string.find", 0)?;
    let pat = check_string(state, "string.find", 1)?;

    let plain_val = arg(state, 3);

    let init = opt_int(state, "string.find", 2, 1).map(|i| posrelat(i, s.len()))?;
    let init = (init.max(1) as usize).saturating_sub(1); // Convert to 0-based.
    let plain = plain_val.is_truthy();

    if plain {
        // Plain string search.
        if let Some(pos) = find_plain(&s[init..], &pat) {
            let start = init + pos + 1; // 1-based.
            let end = start + pat.len() - 1;
            #[allow(clippy::cast_precision_loss)]
            {
                state.push(Val::Num(start as f64));
                state.push(Val::Num(end as f64));
            }
            Ok(2)
        } else {
            state.push(Val::Nil);
            Ok(1)
        }
    } else {
        // Pattern search.
        let anchor = !pat.is_empty() && pat[0] == b'^';
        let pat_start = usize::from(anchor);
        let pattern = &pat[pat_start..];

        let mut pos = init;
        loop {
            let mut ms = MatchState::new(&s, pattern);
            if let Some(end_pos) = ms.match_(pos, 0)? {
                #[allow(clippy::cast_precision_loss)]
                {
                    state.push(Val::Num((pos + 1) as f64));
                    state.push(Val::Num(end_pos as f64));
                }
                // Push captures.
                let n_caps = push_captures(state, &ms, &s)?;
                return Ok(2 + n_caps);
            }
            pos += 1;
            if anchor || pos > s.len() {
                break;
            }
        }
        state.push(Val::Nil);
        Ok(1)
    }
}

/// Plain substring search.
fn find_plain(haystack: &[u8], needle: &[u8]) -> Option<usize> {
    if needle.is_empty() {
        return Some(0);
    }
    haystack.windows(needle.len()).position(|w| w == needle)
}

/// Push captures from a match state onto the Lua stack.
fn push_captures(state: &mut LuaState, ms: &MatchState<'_>, src: &[u8]) -> LuaResult<u32> {
    let n = ms.captures.len();
    if n == 0 {
        return Ok(0);
    }

    state.ensure_stack(state.top + n);
    for cap in &ms.captures {
        match cap.len {
            CaptureLen::Position => {
                #[allow(clippy::cast_precision_loss)]
                state.push(Val::Num((cap.start + 1) as f64));
            }
            CaptureLen::Finished(len) => {
                let r = state.gc.intern_string(&src[cap.start..cap.start + len]);
                state.push(Val::Str(r));
            }
            CaptureLen::Unfinished => {
                return Err(LuaError::Runtime(RuntimeError {
                    message: "unfinished capture".into(),
                    level: 0,
                    traceback: vec![],
                }));
            }
        }
    }
    Ok(n as u32)
}

// ---------------------------------------------------------------------------
// string.match
// ---------------------------------------------------------------------------

/// `string.match(s, pattern [, init])` -- Extract captures from first match.
pub fn str_match(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.match", state, 2)?;
    let s = check_string(state, "string.match", 0)?;
    let pat = check_string(state, "string.match", 1)?;

    let init_raw = opt_int(state, "string.match", 2, 1)?;
    let init = posrelat(init_raw, s.len());
    let init = (init.max(1) as usize).saturating_sub(1);

    let anchor = !pat.is_empty() && pat[0] == b'^';
    let pat_start = usize::from(anchor);
    let pattern = &pat[pat_start..];

    let mut pos = init;
    loop {
        let mut ms = MatchState::new(&s, pattern);
        if let Some(end_pos) = ms.match_(pos, 0)? {
            if ms.captures.is_empty() {
                // No captures: return the whole match.
                let r = state.gc.intern_string(&s[pos..end_pos]);
                state.push(Val::Str(r));
                return Ok(1);
            }
            return push_captures(state, &ms, &s).map(|n| if n == 0 { 1 } else { n });
        }
        pos += 1;
        if anchor || pos > s.len() {
            break;
        }
    }
    state.push(Val::Nil);
    Ok(1)
}

// ---------------------------------------------------------------------------
// string.gmatch
// ---------------------------------------------------------------------------

/// `string.gmatch(s, pattern)` -- Returns an iterator for all matches.
///
/// We implement this by creating a Rust closure that holds state.
pub fn str_gmatch(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.gmatch", state, 2)?;
    let s_val = arg(state, 0);
    let pat_val = arg(state, 1);

    // Store the source string and pattern as upvalues, plus the current position.
    let closure = crate::vm::closure::Closure::Rust(crate::vm::closure::RustClosure {
        func: gmatch_aux,
        upvalues: vec![s_val, pat_val, Val::Num(0.0)],
        name: "gmatch_aux".to_string(),
        env: None,
    });
    let closure_ref = state.gc.alloc_closure(closure);
    state.push(Val::Function(closure_ref));
    Ok(1)
}

/// Iterator function for gmatch. Upvalues: [source_string, pattern, position].
fn gmatch_aux(state: &mut LuaState) -> LuaResult<u32> {
    // Read upvalues from the closure.
    let func_idx = state.call_stack[state.ci].func;
    let func_val = state.stack_get(func_idx);
    let Val::Function(closure_ref) = func_val else {
        return Ok(0);
    };

    let (s_val, pat_val, pos_val) = {
        let cl = state.gc.closures.get(closure_ref).ok_or_else(|| {
            LuaError::Runtime(RuntimeError {
                message: "gmatch: invalid closure".into(),
                level: 0,
                traceback: vec![],
            })
        })?;
        let upvalues = match cl {
            crate::vm::closure::Closure::Rust(rc) => &rc.upvalues,
            crate::vm::closure::Closure::Lua(_) => {
                return Ok(0);
            }
        };
        if upvalues.len() < 3 {
            return Ok(0);
        }
        (upvalues[0], upvalues[1], upvalues[2])
    };

    let s = match s_val {
        Val::Str(r) => state
            .gc
            .string_arena
            .get(r)
            .map(|s| s.data().to_vec())
            .unwrap_or_default(),
        _ => return Ok(0),
    };
    let pat = match pat_val {
        Val::Str(r) => state
            .gc
            .string_arena
            .get(r)
            .map(|s| s.data().to_vec())
            .unwrap_or_default(),
        _ => return Ok(0),
    };
    let Val::Num(pos_f) = pos_val else {
        return Ok(0);
    };
    #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
    let mut pos = pos_f as usize;

    let anchor = !pat.is_empty() && pat[0] == b'^';
    let pat_start = usize::from(anchor);
    let pattern = &pat[pat_start..];

    while pos <= s.len() {
        let mut ms = MatchState::new(&s, pattern);
        if let Some(end_pos) = ms.match_(pos, 0)? {
            // Update position upvalue. Ensure we advance at least 1 char
            // for empty matches to avoid infinite loops.
            let new_pos = if end_pos == pos { end_pos + 1 } else { end_pos };

            // Update the upvalue in the closure.
            if let Some(cl) = state.gc.closures.get_mut(closure_ref)
                && let crate::vm::closure::Closure::Rust(rc) = cl
            {
                #[allow(clippy::cast_precision_loss)]
                {
                    rc.upvalues[2] = Val::Num(new_pos as f64);
                }
            }

            if ms.captures.is_empty() {
                let r = state.gc.intern_string(&s[pos..end_pos]);
                state.push(Val::Str(r));
                return Ok(1);
            }
            return push_captures(state, &ms, &s);
        }
        pos += 1;
        if anchor {
            break;
        }
    }
    Ok(0)
}

// ---------------------------------------------------------------------------
// string.gsub
// ---------------------------------------------------------------------------

/// `string.gsub(s, pattern, repl [, n])` -- Global substitution.
///
/// `repl` can be a string, table, or function.
pub fn str_gsub(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.gsub", state, 3)?;
    let s = check_string(state, "string.gsub", 0)?;
    let pat = check_string(state, "string.gsub", 1)?;
    let repl_val = arg(state, 2);
    #[allow(clippy::cast_possible_truncation, clippy::cast_sign_loss)]
    let max_replacements = opt_int(state, "string.gsub", 3, i64::MAX)?.max(0) as usize;

    let anchor = !pat.is_empty() && pat[0] == b'^';
    let pat_start = usize::from(anchor);
    let pattern = &pat[pat_start..];

    let mut result = Vec::new();
    let mut pos = 0usize;
    let mut count = 0usize;

    while count < max_replacements && pos <= s.len() {
        let mut ms = MatchState::new(&s, pattern);
        let match_result = ms.match_(pos, 0)?;

        if let Some(end_pos) = match_result {
            count += 1;

            // Get the replacement.
            let replacement = get_gsub_replacement(state, &ms, &s, pos, end_pos, repl_val)?;
            result.extend_from_slice(&replacement);

            // Advance past the match. For empty matches, advance by 1 char.
            if end_pos == pos {
                if pos < s.len() {
                    result.push(s[pos]);
                }
                pos += 1;
            } else {
                pos = end_pos;
            }
        } else {
            if pos < s.len() {
                result.push(s[pos]);
            }
            pos += 1;
        }

        if anchor {
            break;
        }
    }

    // Append remaining unmatched portion.
    if pos <= s.len() {
        result.extend_from_slice(&s[pos..]);
    }

    let r = state.gc.intern_string(&result);
    state.push(Val::Str(r));
    #[allow(clippy::cast_precision_loss)]
    state.push(Val::Num(count as f64));
    Ok(2)
}

/// Gets the replacement string for a gsub match.
fn get_gsub_replacement(
    state: &mut LuaState,
    ms: &MatchState<'_>,
    src: &[u8],
    match_start: usize,
    match_end: usize,
    repl: Val,
) -> LuaResult<Vec<u8>> {
    match repl {
        Val::Str(r) => {
            // String replacement with capture references (%0-%9).
            let repl_bytes = state
                .gc
                .string_arena
                .get(r)
                .map(|s| s.data().to_vec())
                .unwrap_or_default();

            let mut result = Vec::new();
            let mut i = 0;
            while i < repl_bytes.len() {
                if repl_bytes[i] == b'%' && i + 1 < repl_bytes.len() {
                    let next = repl_bytes[i + 1];
                    if next.is_ascii_digit() {
                        let n = (next - b'0') as usize;
                        if n == 0 {
                            // %0 = whole match.
                            result.extend_from_slice(&src[match_start..match_end]);
                        } else {
                            // PUC-Rio push_onecapture: index = n-1
                            let cap_idx = n - 1;
                            if cap_idx >= ms.captures.len() {
                                // i >= level: if i == 0 (cap_idx == 0 && no captures),
                                // return whole match; otherwise error.
                                if cap_idx == 0 && ms.captures.is_empty() {
                                    result.extend_from_slice(&src[match_start..match_end]);
                                } else {
                                    return Err(LuaError::Runtime(RuntimeError {
                                        message: format!("invalid capture index %{n}"),
                                        level: 0,
                                        traceback: vec![],
                                    }));
                                }
                            } else {
                                let cap = ms.captures[cap_idx];
                                match cap.len {
                                    CaptureLen::Finished(len) => {
                                        result.extend_from_slice(&src[cap.start..cap.start + len]);
                                    }
                                    CaptureLen::Position => {
                                        let pos_str = format!("{}", cap.start + 1);
                                        result.extend_from_slice(pos_str.as_bytes());
                                    }
                                    CaptureLen::Unfinished => {
                                        return Err(LuaError::Runtime(RuntimeError {
                                            message: "unfinished capture".into(),
                                            level: 0,
                                            traceback: vec![],
                                        }));
                                    }
                                }
                            }
                        }
                        i += 2;
                        continue;
                    } else if next == b'%' {
                        result.push(b'%');
                        i += 2;
                        continue;
                    }
                }
                result.push(repl_bytes[i]);
                i += 1;
            }
            Ok(result)
        }
        Val::Table(_) => {
            // Table replacement: look up first capture (or whole match) as key.
            // Uses gettable for __index metamethod support.
            let key = if ms.captures.is_empty() {
                let r = state.gc.intern_string(&src[match_start..match_end]);
                Val::Str(r)
            } else {
                get_capture_val(state, &ms.captures[0], src)?
            };
            let val = state.gettable(repl, key)?;
            Ok(val_to_replacement(state, val, src, match_start, match_end))
        }
        Val::Function(_) => {
            // Function replacement: call with captures (or whole match).
            let call_base = state.top;
            state.ensure_stack(call_base + LUA_MAXCAPTURES + 2);
            state.stack_set(call_base, repl);

            if ms.captures.is_empty() {
                let r = state.gc.intern_string(&src[match_start..match_end]);
                state.stack_set(call_base + 1, Val::Str(r));
                state.top = call_base + 2;
            } else {
                let mut n = 0;
                for cap in &ms.captures {
                    let val = get_capture_val(state, cap, src)?;
                    state.stack_set(call_base + 1 + n, val);
                    n += 1;
                }
                state.top = call_base + 1 + n;
            }

            state.call_function(call_base, 1)?;

            let result_val = state.stack_get(call_base);
            state.top = call_base;

            Ok(val_to_replacement(
                state,
                result_val,
                src,
                match_start,
                match_end,
            ))
        }
        _ => {
            // Non-string, non-table, non-function: use as-is.
            Ok(src[match_start..match_end].to_vec())
        }
    }
}

/// Convert a capture to a Val.
fn get_capture_val(state: &mut LuaState, cap: &Capture, src: &[u8]) -> LuaResult<Val> {
    match cap.len {
        CaptureLen::Position =>
        {
            #[allow(clippy::cast_precision_loss)]
            Ok(Val::Num((cap.start + 1) as f64))
        }
        CaptureLen::Finished(len) => {
            let r = state.gc.intern_string(&src[cap.start..cap.start + len]);
            Ok(Val::Str(r))
        }
        CaptureLen::Unfinished => Err(LuaError::Runtime(RuntimeError {
            message: "unfinished capture".into(),
            level: 0,
            traceback: vec![],
        })),
    }
}

/// Convert a replacement value to bytes. If nil/false, use the original match.
fn val_to_replacement(
    state: &LuaState,
    val: Val,
    src: &[u8],
    match_start: usize,
    match_end: usize,
) -> Vec<u8> {
    if val.is_nil() || val == Val::Bool(false) {
        return src[match_start..match_end].to_vec();
    }
    match val {
        Val::Str(r) => state
            .gc
            .string_arena
            .get(r)
            .map(|s| s.data().to_vec())
            .unwrap_or_default(),
        _ => format!("{val}").into_bytes(),
    }
}

// ---------------------------------------------------------------------------
// string.dump (stub)
// ---------------------------------------------------------------------------

/// `string.dump(function)` -- Serializes a function to a binary string.
///
/// Stub: not yet implemented (requires bytecode serialization).
pub fn str_dump(state: &mut LuaState) -> LuaResult<u32> {
    check_args("string.dump", state, 1)?;

    let func_val = arg(state, 0);
    let Val::Function(closure_ref) = func_val else {
        return Err(bad_argument("string.dump", 1, "function expected"));
    };

    // Get the Proto from the closure (must be a Lua closure).
    let proto = {
        let Some(closure) = state.gc.closures.get(closure_ref) else {
            return Err(LuaError::Runtime(RuntimeError {
                message: "unable to dump given function".into(),
                level: 0,
                traceback: vec![],
            }));
        };
        match closure {
            crate::vm::closure::Closure::Lua(lua_cl) => std::rc::Rc::clone(&lua_cl.proto),
            crate::vm::closure::Closure::Rust(_) => {
                return Err(LuaError::Runtime(RuntimeError {
                    message: "unable to dump given function".into(),
                    level: 0,
                    traceback: vec![],
                }));
            }
        }
    };

    // Dump with the string arena (patched Proto from a live closure).
    let bytes = crate::vm::dump::dump(&proto, Some(&state.gc.string_arena), false);

    // Intern the result bytes as a Lua string.
    let str_ref = state.gc.intern_string(&bytes);
    state.push(Val::Str(str_ref));
    Ok(1)
}