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
// NB: We avoid using closures to map `Result` and `Option`s in various places because they result in less readable assembly output.
// When using closures, functions like `capacity_overflow` can get the name of some closure that invokes it instead, like `bump_scope::mut_bump_vec::MutBumpVec<T,_,_,A>::generic_grow_cold::{{closure}}`.
// This crate uses modified code from the rust standard library. <https://github.com/rust-lang/rust/tree/master/library>.
// Especially `MutBumpVec(Rev)`, `MutBumpString`, `polyfill` and `tests/from_std` are based on code from the standard library.
#![cfg_attr(not(any(test, feature = "std")), no_std)]
#![cfg_attr(feature = "nightly-allocator-api", feature(allocator_api, vec_into_raw_parts))]
#![cfg_attr(feature = "nightly-coerce-unsized", feature(coerce_unsized, unsize))]
#![cfg_attr(feature = "nightly-exact-size-is-empty", feature(exact_size_is_empty))]
#![cfg_attr(feature = "nightly-trusted-len", feature(trusted_len))]
#![cfg_attr(feature = "nightly-const-refs-to-static", feature(const_refs_to_static))]
#![cfg_attr(
test,
feature(
exclusive_wrapper,
pointer_is_aligned_to,
assert_matches,
inplace_iteration,
drain_keep_rest,
iter_next_chunk,
iter_advance_by,
extract_if,
slice_flatten,
slice_partition_dedup,
iter_partition_in_place,
strict_provenance,
)
)]
#![cfg_attr(test, allow(stable_features))]
#![cfg_attr(
docsrs,
feature(doc_auto_cfg, doc_cfg_hide),
doc(cfg_hide(no_global_oom_handling, feature = "nightly-const-refs-to-static"))
)]
#![warn(
clippy::pedantic,
clippy::cargo,
clippy::correctness,
clippy::perf,
clippy::style,
clippy::suspicious,
missing_docs,
rustdoc::missing_crate_level_docs
)]
#![allow(
clippy::inline_always,
clippy::module_name_repetitions,
clippy::copy_iterator,
clippy::comparison_chain,
clippy::partialeq_ne_impl,
clippy::collapsible_else_if,
clippy::items_after_statements,
unknown_lints,
rustdoc::redundant_explicit_links, // for cargo-rdme
)]
//! A fast bump allocator that supports allocation scopes / checkpoints. Aka an arena for values of arbitrary types.
//!
//! # What is bump allocation?
//! A bump allocator owns a big chunk of memory. It has a pointer that starts at one end of that chunk.
//! When an allocation is made that pointer gets aligned and bumped towards the other end of the chunk by the allocation's size.
//! When its chunk is full, it allocates another chunk with twice the size.
//!
//! This makes allocations very fast. The drawback is that you can't reclaim memory like you do with a more general allocator.
//! Memory for the most recent allocation *can* be reclaimed. You can also use [scopes, checkpoints](#scopes-and-checkpoints) and `reset` to reclaim memory.
//!
//! A bump allocator is great for *phase-oriented allocations* where you allocate objects in a loop and free them at the end of every iteration.
//! ```
//! use bump_scope::Bump;
//! let mut bump: Bump = Bump::new();
//! # let mut first = true;
//!
//! loop {
//! # if !first { break }; first = false;
//! // use bump ...
//! bump.reset();
//! }
//! ```
//! The fact that the bump allocator allocates ever larger chunks and `reset` only keeps around the largest one means that after a few iterations, every bump allocation
//! will be done on the same chunk and no more chunks need to be allocated.
//!
//! The introduction of scopes makes this bump allocator also great for temporary allocations and stack-like usage.
//!
//! # Comparison to [`bumpalo`](https://docs.rs/bumpalo)
//!
//! Bumpalo is a popular crate for bump allocation. This crate was inspired by bumpalo and [Always Bump Downwards](https://fitzgeraldnick.com/2019/11/01/always-bump-downwards.html).
//!
//! Unlike `bumpalo`, this crate...
//! - Supports [scopes and checkpoints](#scopes-and-checkpoints).
//! - Drop is always called for allocated values unless explicitly [leaked](crate::BumpBox::leak) or [forgotten](::core::mem::forget).
//! - `alloc*` methods return a [`BumpBox<T>`](crate::BumpBox) which owns and drops `T`. Types that don't need dropping can be turned into references with [`into_ref`](crate::BumpBox::into_ref) and [`into_mut`](crate::BumpBox::into_mut).
//! - You can allocate a slice from *any* `Iterator` with [`alloc_iter`](crate::Bump::alloc_iter).
//! - Every method that panics on allocation failure has a fallible `try_*` counterpart.
//! - `Bump`'s base allocator is generic.
//! - `Bump` and `BumpScope` have the same repr as `NonNull<u8>`. (vs 3x pointer sized)
//! - Won't try to allocate a smaller chunk if allocation failed.
//! - No built-in allocation limit. You can provide an allocator that enforces an allocation limit (see `tests/limit_memory_usage.rs`).
//! - Allocations are a bit more optimized. (see `crates/inspect-asm/out/x86-64` and [benchmarks](https://bluurryy.github.io/bump-scope/criterion/report/))
//! - [You can choose the bump direction.](#bumping-upwards-or-downwards) Bumps upwards by default.
//! - [You can choose the minimum alignment.](#minimum-alignment)
//!
//! # Scopes and Checkpoints
//! You can create scopes to make allocations that live only for a part of its parent scope.
//! Creating and exiting scopes is virtually free. Allocating within a scope has no overhead.
//!
//! You can create a new scope either with a [`scoped`](crate::Bump::scoped) closure or with a [`scope_guard`](crate::Bump::scope_guard):
//! ```
//! use bump_scope::Bump;
//!
//! let mut bump: Bump = Bump::new();
//!
//! // you can use a closure
//! bump.scoped(|mut bump| {
//! let hello = bump.alloc_str("hello");
//! assert_eq!(bump.stats().allocated(), 5);
//!
//! bump.scoped(|bump| {
//! let world = bump.alloc_str("world");
//!
//! println!("{hello} and {world} are both live");
//! assert_eq!(bump.stats().allocated(), 10);
//! });
//!
//! println!("{hello} is still live");
//! assert_eq!(bump.stats().allocated(), 5);
//! });
//!
//! assert_eq!(bump.stats().allocated(), 0);
//!
//! // or you can use scope guards
//! {
//! let mut guard = bump.scope_guard();
//! let mut bump = guard.scope();
//!
//! let hello = bump.alloc_str("hello");
//! assert_eq!(bump.stats().allocated(), 5);
//!
//! {
//! let mut guard = bump.scope_guard();
//! let bump = guard.scope();
//!
//! let world = bump.alloc_str("world");
//!
//! println!("{hello} and {world} are both live");
//! assert_eq!(bump.stats().allocated(), 10);
//! }
//!
//! println!("{hello} is still live");
//! assert_eq!(bump.stats().allocated(), 5);
//! }
//!
//! assert_eq!(bump.stats().allocated(), 0);
//! ```
//! You can also use the unsafe [`checkpoint`](crate::Bump::checkpoint) api to reset the bump pointer to a previous location.
//! ```
//! # use bump_scope::Bump;
//! # let mut bump: Bump = Bump::new();
//! let checkpoint = bump.checkpoint();
//!
//! {
//! let hello = bump.alloc_str("hello");
//! assert_eq!(bump.stats().allocated(), 5);
//! }
//!
//! unsafe { bump.reset_to(checkpoint); }
//! assert_eq!(bump.stats().allocated(), 0);
//! ```
//!
//! # Collections
//! `bump-scope` provides bump allocated variants of `Vec` and `String` called [`BumpVec`](crate::BumpVec) and [`BumpString`](crate::BumpString). They also come in a different variants:
//! - [`Fixed*`](crate::FixedBumpVec) for fixed capacity collections
//! - [`Mut*`](crate::MutBumpVec) for collections optimized for a mutable bump allocator
//!
//! # Parallel Allocation
//! [`Bump`](crate::Bump) is `!Sync` which means it can't be shared between threads.
//!
//! To bump allocate in parallel you can use a [`BumpPool`](crate::BumpPool).
//!
//! # Allocator API
//! `Bump` and `BumpScope` implement [`allocator_api2::alloc::Allocator`](https://docs.rs/allocator-api2/0.2.16/allocator_api2/alloc/trait.Allocator.html).
//! With this you can bump allocate [`allocator_api2::boxed::Box`](https://docs.rs/allocator-api2/0.2.16/allocator_api2/boxed/struct.Box.html), [`allocator_api2::vec::Vec`](https://docs.rs/allocator-api2/0.2.16/allocator_api2/vec/struct.Vec.html) and collections
//! from other crates that support it like [`hashbrown::HashMap`](https://docs.rs/hashbrown/latest/hashbrown/struct.HashMap.html).
//!
//! A bump allocator can grow, shrink and deallocate the most recent allocation.
//! When bumping upwards it can even do so in place.
//! Growing other allocations will require a new allocation and the old memory block becomes wasted space.
//! Shrinking or deallocating other allocations does nothing which means wasted space.
//!
//! A bump allocator does not *require* `deallocate` or `shrink` to free memory.
//! After all, memory will be reclaimed when exiting a scope or calling `reset`.
//! You can wrap a bump allocator in a type that makes `deallocate` and `shrink` a no-op using [`without_dealloc`](crate::Bump::without_dealloc) and [`without_shrink`](crate::Bump::without_shrink).
//! ```
//! # #![cfg_attr(feature = "nightly-allocator-api", feature(allocator_api))]
//! use bump_scope::Bump;
//! use allocator_api2::boxed::Box;
//! let bump: Bump = Bump::new();
//!
//! let boxed = Box::new_in(5, &bump);
//! assert_eq!(bump.stats().allocated(), 4);
//! drop(boxed);
//! assert_eq!(bump.stats().allocated(), 0);
//!
//! let boxed = Box::new_in(5, bump.without_dealloc());
//! assert_eq!(bump.stats().allocated(), 4);
//! drop(boxed);
//! assert_eq!(bump.stats().allocated(), 4);
//! ```
//!
//! # Feature Flags
//! * **`std`** *(enabled by default)* — Adds implementations of `std::io` traits for `BumpBox` and `{Fixed, Mut}BumpVec`. Activates `alloc` feature.
//! * **`alloc`** — Adds implementations interacting with `String` and `Cow<str>`.
//! * **`serde`** — Adds `Serialize` implementations for `BumpBox`, strings and vectors.
//! * **`zerocopy`** — Adds `alloc_zeroed` and `alloc_slice_zeroed` and `BumpBox::init_zeroed`.
//!
//! ### Nightly features
//! * **`nightly-allocator-api`** — Enables `allocator-api2`'s `nightly` feature which makes it reexport the nightly allocator api instead of its own implementation.
//! With this you can bump allocate collections from the standard library.
//! * **`nightly-coerce-unsized`** — Makes `BumpBox<T>` implement [`CoerceUnsized`](core::ops::CoerceUnsized).
//! With this `BumpBox<[i32;3]>` coerces to `BumpBox<[i32]>`, `BumpBox<dyn Debug>` and so on.
//! * **`nightly-const-refs-to-static`** — Makes `Bump::unallocated` a `const fn`.
//! * **`nightly-exact-size-is-empty`** — Implements `is_empty` manually for `Drain`.
//! * **`nightly-trusted-len`** — Implements `TrustedLen` for `Drain`.
//!
//! # Bumping upwards or downwards?
//! Bump direction is controlled by the generic parameter `const UP: bool`. By default, `UP` is `true`, so the allocator bumps upwards.
//!
//! - Bumping upwards...
//! - has the advantage that the most recent allocation can be grown and shrunk in place.
//! - makes [`alloc_iter(_mut)`](crate::Bump::alloc_iter) and [`alloc_fmt(_mut)`](crate::Bump::alloc_fmt) faster.
//! - Bumping downwards...
//! - uses slightly fewer instructions per allocation.
//! - makes [`alloc_iter_mut_rev`](crate::Bump::alloc_iter_mut_rev) faster.
//!
//! # Minimum alignment?
//! The minimum alignment is controlled by the generic parameter `const MIN_ALIGN: usize`. By default, `MIN_ALIGN` is `1`.
//!
//! Changing the minimum alignment to e.g. `4` makes it so allocations with the alignment of `4` don't need to align the bump pointer anymore.
//! This will penalize allocations of a smaller alignment as their size now needs to be rounded up the next multiple of `4`.
//!
//! This amounts to about 1 or 2 instructions per allocation.
//!
//! # `GUARANTEED_ALLOCATED` parameter?
//! When `GUARANTEED_ALLOCATED` is true, the bump allocator is in a guaranteed allocated state.
//! That means that it must have already allocated a chunk from its backing allocator.
//!
//! When `GUARANTEED_ALLOCATED` is false, the bump allocator may or may not have allocated chunks.
//! You can create a bump allocator with no allocated chunks with [`Bump::unallocated`](crate::Bump::unallocated).
//!
//! You need a guaranteed allocated `Bump(Scope)` to create scopes via `scoped` and `scope_guard`.
//! You can convert a maybe unallocated `Bump(Scope)` into a guaranteed allocated one with `into_guaranteed_allocated` or `as_guaranteed_allocated(_mut)`.
//!
//! The point of this is so `Bump`s can be created without allocating memory and even `const` constructed when the feature `nightly-const-refs-to-static` is enabled.
//! At the same time `Bump`'s that have already allocated a chunk don't suffer runtime checks for entering scopes and creating checkpoints.
#[doc(hidden)]
#[cfg(feature = "alloc")]
extern crate alloc;
use core::{
convert::Infallible,
fmt::{self, Debug},
marker::PhantomData,
mem::{self, MaybeUninit},
num::NonZeroUsize,
ptr::NonNull,
};
mod allocator;
#[cfg(test)]
pub(crate) mod any_bump;
mod bump;
mod bump_align_guard;
/// Contains [`BumpBox`] and associated types.
mod bump_box;
mod bump_scope;
mod bump_scope_guard;
mod mut_bump_string;
/// Contains [`BumpVec`] and associated types.
mod bump_vec;
/// Contains [`MutBumpVec`] and associated types.
mod mut_bump_vec;
/// Contains [`BumpString`] and associated types.
mod bump_string;
mod array_layout;
mod chunk_raw;
mod chunk_size;
mod drain;
mod extract_if;
mod features;
mod fixed_bump_string;
mod fixed_bump_vec;
mod from_utf8_error;
mod into_iter;
/// Contains [`MutBumpVecRev`] and associated types.
mod mut_bump_vec_rev;
mod polyfill;
mod set_len_on_drop;
mod set_len_on_drop_by_ptr;
mod stats;
#[cfg(test)]
mod with_drop;
mod without_dealloc;
#[cfg(feature = "std")]
mod bump_pool;
use allocator_api2::alloc::{AllocError, Allocator};
#[cfg(feature = "alloc")]
use allocator_api2::alloc::handle_alloc_error;
pub use allocator_api2;
#[cfg(test)]
pub use any_bump::AnyBump;
pub use bump::Bump;
pub use bump_box::BumpBox;
#[cfg(feature = "std")]
pub use bump_pool::{BumpPool, BumpPoolGuard};
pub use bump_scope::BumpScope;
pub use bump_scope_guard::{BumpScopeGuard, BumpScopeGuardRoot, Checkpoint};
pub use bump_string::BumpString;
pub use bump_vec::BumpVec;
pub use drain::Drain;
pub use extract_if::ExtractIf;
pub use fixed_bump_string::FixedBumpString;
pub use fixed_bump_vec::FixedBumpVec;
pub use from_utf8_error::FromUtf8Error;
pub use into_iter::IntoIter;
pub use mut_bump_string::MutBumpString;
pub use mut_bump_vec::MutBumpVec;
pub use mut_bump_vec_rev::MutBumpVecRev;
pub use stats::{Chunk, ChunkNextIter, ChunkPrevIter, GuaranteedAllocatedStats, Stats};
#[cfg(test)]
pub use with_drop::WithDrop;
pub use without_dealloc::{WithoutDealloc, WithoutShrink};
use array_layout::{ArrayLayout, LayoutTrait};
use chunk_header::{unallocated_chunk_header, ChunkHeader};
use chunk_raw::RawChunk;
use chunk_size::ChunkSize;
use core::alloc::Layout;
use polyfill::{nonnull, pointer};
use set_len_on_drop::SetLenOnDrop;
use set_len_on_drop_by_ptr::SetLenOnDropByPtr;
// This must be kept in sync with ChunkHeaders `repr(align(16))`.
const CHUNK_ALIGN_MIN: usize = 16;
const DEFAULT_START_CHUNK_SIZE: usize = 512;
/// This trait marks types that don't need dropping.
///
/// This trait is a best effort for modeling such a constraint. It is not implemented for all types that don't need dropping.
///
/// It is used as a bound for [`BumpBox`]'s [`into_ref`](BumpBox::into_ref) and [`into_mut`](BumpBox::into_mut) so you don't accidentally omit a drop that does matter.
pub trait NoDrop {}
impl NoDrop for str {}
impl<T: Copy> NoDrop for T {}
impl<T: Copy> NoDrop for [T] {}
/// Specifies the current minimum alignment of a bump allocator.
pub struct MinimumAlignment<const ALIGNMENT: usize>;
mod supported_minimum_alignment {
use crate::ArrayLayout;
pub trait Sealed {
/// We'd be fine with just an [`core::ptr::Alignment`], but that's not stable.
const LAYOUT: ArrayLayout;
}
}
/// Statically guarantees that a minimum alignment is marked as supported.
///
/// This trait is *sealed*: the list of implementors below is total. Users do not have the ability to mark additional
/// `MinimumAlignment<N>` values as supported. Only bump allocators with the supported minimum alignments are constructable.
#[allow(private_bounds)]
pub trait SupportedMinimumAlignment: supported_minimum_alignment::Sealed {}
macro_rules! supported_alignments {
($($i:literal)*) => {
$(
impl supported_minimum_alignment::Sealed for MinimumAlignment<$i> {
const LAYOUT: ArrayLayout = match ArrayLayout::from_size_align(0, $i) {
Ok(layout) => layout,
Err(_) => unreachable!(),
};
}
impl SupportedMinimumAlignment for MinimumAlignment<$i> {}
)*
};
}
supported_alignments!(1 2 4 8 16);
#[inline(always)]
fn up_align_usize(addr: usize, align: NonZeroUsize) -> Option<usize> {
debug_assert!(align.get().is_power_of_two());
let mask = align.get() - 1;
let aligned = addr.checked_add(mask)? & !mask;
Some(aligned)
}
/// Does not check for overflow.
#[inline(always)]
fn up_align_usize_unchecked(addr: usize, align: usize) -> usize {
debug_assert!(align.is_power_of_two());
let mask = align - 1;
(addr + mask) & !mask
}
#[inline(always)]
const fn up_align_nonzero(addr: NonZeroUsize, align: usize) -> Option<NonZeroUsize> {
debug_assert!(align.is_power_of_two());
let mask = align - 1;
let addr_plus_mask = match addr.checked_add(mask) {
Some(addr_plus_mask) => addr_plus_mask,
None => return None,
};
let aligned = addr_plus_mask.get() & !mask;
NonZeroUsize::new(aligned)
}
#[inline(always)]
unsafe fn up_align_nonzero_unchecked(addr: NonZeroUsize, align: usize) -> NonZeroUsize {
debug_assert!(align.is_power_of_two());
let mask = align - 1;
let aligned = (addr.get() + mask) & !mask;
NonZeroUsize::new_unchecked(aligned)
}
#[inline(always)]
fn down_align_usize(addr: usize, align: usize) -> usize {
debug_assert!(align.is_power_of_two());
let mask = align - 1;
addr & !mask
}
#[inline(always)]
fn bump_down(addr: NonZeroUsize, size: usize, align: usize) -> usize {
let subtracted = addr.get().saturating_sub(size);
down_align_usize(subtracted, align)
}
#[inline(always)]
const unsafe fn assume_unchecked(condition: bool) {
if !condition {
core::hint::unreachable_unchecked();
}
}
struct FmtFn<F>(F)
where
F: Fn(&mut fmt::Formatter<'_>) -> fmt::Result;
impl<F> Debug for FmtFn<F>
where
F: Fn(&mut fmt::Formatter<'_>) -> fmt::Result,
{
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
self.0(f)
}
}
mod chunk_header;
#[cfg(test)]
mod tests;
/// This is not part of the public api!
#[doc(hidden)]
pub mod private {
pub use core;
#[inline(never)]
#[cold]
pub const fn capacity_overflow() -> ! {
panic!("capacity overflow");
}
}
use private::capacity_overflow;
#[cold]
#[inline(never)]
fn exact_size_iterator_bad_len() -> ! {
panic!("ExactSizeIterator did not return as many items as promised")
}
macro_rules! doc_fn_stats {
($name:ident) => {
concat!(
"Returns `",
stringify!($name),
"`, which provides statistics about the memory usage of the bump allocator."
)
};
}
macro_rules! doc_fn_stats_greedy {
($name:ident) => {
concat!("\n\n`", stringify!($name), "` does not update the bump pointer until it has been turned into a slice, so it also doesn't contribute to the `remaining` and `allocated` stats.")
};
}
macro_rules! doc_fn_allocator {
() => {
"Returns a reference to the base allocator."
};
}
macro_rules! doc_fn_bump {
() => {
"Returns a reference to the bump allocator."
};
}
macro_rules! doc_fn_reset {
() => {
"This will only keep around the newest chunk, which is also the biggest."
};
}
macro_rules! doc_fn_scope {
() => {
"Returns a new `BumpScope`."
};
}
pub(crate) use doc_fn_allocator;
pub(crate) use doc_fn_bump;
pub(crate) use doc_fn_reset;
pub(crate) use doc_fn_scope;
pub(crate) use doc_fn_stats;
pub(crate) use doc_fn_stats_greedy;
/// An allocator that allows `grow(_zeroed)`, `shrink` and `deallocate` calls with pointers that were not allocated by this allocator.
/// This trait is used for [`BumpBox::into_box`](BumpBox::into_box) to allow safely converting a `BumpBox` into a `Box`.
///
/// # Safety
/// - `grow(_zeroed)`, `shrink` and `deallocate` must be ok to be called with a pointer that was not allocated by this Allocator
pub unsafe trait BumpAllocator: Allocator {}
unsafe impl<A: BumpAllocator> BumpAllocator for &A {}
unsafe impl<A, const MIN_ALIGN: usize, const UP: bool, const GUARANTEED_ALLOCATED: bool> BumpAllocator
for BumpScope<'_, A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>
where
MinimumAlignment<MIN_ALIGN>: SupportedMinimumAlignment,
A: BaseAllocator<GUARANTEED_ALLOCATED>,
{
}
unsafe impl<A, const MIN_ALIGN: usize, const UP: bool, const GUARANTEED_ALLOCATED: bool> BumpAllocator
for Bump<A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>
where
MinimumAlignment<MIN_ALIGN>: SupportedMinimumAlignment,
A: BaseAllocator<GUARANTEED_ALLOCATED>,
{
}
/// Associates a lifetime to a wrapped type.
///
/// This is used for [`BumpBox::into_box`] to attach a lifetime to the `Box`.
#[derive(Debug, Clone)]
pub struct WithLifetime<'a, A> {
inner: A,
marker: PhantomData<&'a mut ()>,
}
#[allow(missing_docs)]
impl<'a, A> WithLifetime<'a, A> {
#[inline(always)]
pub fn new(inner: A) -> Self {
Self {
inner,
marker: PhantomData,
}
}
#[inline(always)]
pub fn into_inner(self) -> A {
self.inner
}
}
unsafe impl<'a, A: Allocator> Allocator for WithLifetime<'a, A> {
#[inline(always)]
fn allocate(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
self.inner.allocate(layout)
}
#[inline(always)]
fn allocate_zeroed(&self, layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
self.inner.allocate_zeroed(layout)
}
#[inline(always)]
unsafe fn deallocate(&self, ptr: NonNull<u8>, layout: Layout) {
self.inner.deallocate(ptr, layout);
}
#[inline(always)]
unsafe fn grow(&self, ptr: NonNull<u8>, old_layout: Layout, new_layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
self.inner.grow(ptr, old_layout, new_layout)
}
#[inline(always)]
unsafe fn grow_zeroed(
&self,
ptr: NonNull<u8>,
old_layout: Layout,
new_layout: Layout,
) -> Result<NonNull<[u8]>, AllocError> {
self.inner.grow_zeroed(ptr, old_layout, new_layout)
}
#[inline(always)]
unsafe fn shrink(&self, ptr: NonNull<u8>, old_layout: Layout, new_layout: Layout) -> Result<NonNull<[u8]>, AllocError> {
self.inner.shrink(ptr, old_layout, new_layout)
}
}
trait ErrorBehavior: Sized {
const IS_FALLIBLE: bool;
fn allocation(layout: Layout) -> Self;
fn capacity_overflow() -> Self;
fn fixed_size_vector_is_full() -> Self;
fn fixed_size_vector_no_space(amount: usize) -> Self;
}
impl ErrorBehavior for Infallible {
const IS_FALLIBLE: bool = false;
#[inline(always)]
fn allocation(layout: Layout) -> Self {
handle_alloc_error(layout)
}
#[inline(always)]
fn capacity_overflow() -> Self {
capacity_overflow()
}
#[inline(always)]
fn fixed_size_vector_is_full() -> Self {
fixed_size_vector_is_full()
}
#[inline(always)]
fn fixed_size_vector_no_space(amount: usize) -> Self {
fixed_size_vector_no_space(amount)
}
}
#[cold]
#[inline(never)]
fn fixed_size_vector_is_full() -> ! {
panic!("fixed size vector is full");
}
#[cold]
#[inline(never)]
fn fixed_size_vector_no_space(amount: usize) -> ! {
panic!("fixed size vector does not have space for {amount} more elements");
}
#[cold]
#[inline(never)]
#[cfg(not(feature = "alloc"))]
fn handle_alloc_error(_layout: Layout) -> ! {
panic!("allocation failed")
}
impl ErrorBehavior for AllocError {
const IS_FALLIBLE: bool = true;
#[inline(always)]
fn allocation(_: Layout) -> Self {
Self
}
#[inline(always)]
fn capacity_overflow() -> Self {
Self
}
#[inline(always)]
fn fixed_size_vector_is_full() -> Self {
Self
}
#[inline(always)]
fn fixed_size_vector_no_space(amount: usize) -> Self {
let _ = amount;
Self
}
}
// this is just `Result::into_ok` but with a name to match our use case
#[inline(always)]
#[cfg(not(no_global_oom_handling))]
fn infallible<T>(result: Result<T, Infallible>) -> T {
match result {
Ok(value) => value,
Err(_) => unreachable!(),
}
}
trait SizedTypeProperties: Sized {
const SIZE: usize = mem::size_of::<Self>();
const ALIGN: usize = mem::align_of::<Self>();
const IS_ZST: bool = mem::size_of::<Self>() == 0;
const NEEDS_DROP: bool = mem::needs_drop::<Self>();
}
impl<T> SizedTypeProperties for T {}
macro_rules! const_param_assert {
(
($(const $param_ident:ident: $param_ty:ident),+) => $($assert_args:tt)*
) => {{
struct ConstParamAssert<$(const $param_ident: $param_ty),+> {}
impl<$(const $param_ident: $param_ty),+> ConstParamAssert<$($param_ident),+> {
#[allow(dead_code)]
const CONST_PARAM_ASSERT: () = assert!($($assert_args)*);
}
#[allow(unused_variables)]
let assertion = ConstParamAssert::<$($param_ident),+>::CONST_PARAM_ASSERT;
}};
}
pub(crate) use const_param_assert;
macro_rules! doc_align_cant_decrease {
() => {
"**This can not decrease the alignment.** Trying to decrease alignment will result in a compile error. \
You can use [`aligned`](Self::aligned) or [`scoped_aligned`](Self::scoped_aligned) to decrease the alignment."
// To decrease alignment we need to ensure that we return to our original alignment. We can only do this
// using a closure which uses "guard" type that resets to the original alignment on drop.
};
}
pub(crate) use doc_align_cant_decrease;
macro_rules! condition {
(if true { $($then:tt)* } else { $($else:tt)* }) => { $($then)* };
(if false { $($then:tt)* } else { $($else:tt)* }) => { $($else)* };
}
pub(crate) use condition;
macro_rules! bump_scope_methods {
($scope_guard:ident, $is_scope:ident) => {
/// Calls `f` with a new child scope.
///
/// # Examples
///
/// ```
/// # use bump_scope::Bump;
/// let mut bump: Bump = Bump::new();
///
/// bump.scoped(|bump| {
/// bump.alloc_str("Hello world!");
/// assert_eq!(bump.stats().allocated(), 12);
/// });
///
/// assert_eq!(bump.stats().allocated(), 0);
/// ```
#[inline(always)]
pub fn scoped(&mut self, f: impl FnOnce(BumpScope<A, MIN_ALIGN, UP>)) {
let mut guard = self.scope_guard();
f(guard.scope());
}
/// Calls `f` with a new child scope of a new minimum alignment.
#[inline(always)]
pub fn scoped_aligned<const NEW_MIN_ALIGN: usize>(&mut self, f: impl FnOnce(BumpScope<A, MIN_ALIGN, UP>))
where
MinimumAlignment<NEW_MIN_ALIGN>: SupportedMinimumAlignment,
{
$crate::condition! {
if $is_scope {
// This guard will reset the bump pointer to the current position, which is aligned to `MIN_ALIGN`.
let mut guard = self.scope_guard();
let scope = guard.scope();
scope.align::<NEW_MIN_ALIGN>();
f(unsafe { scope.cast_align() });
} else {
self.as_mut_scope().scoped_aligned::<NEW_MIN_ALIGN>(f)
}
}
}
#[doc = concat!("Creates a new [`", stringify!($scope_guard), "`].")]
/// This allows for creation of child scopes.
///
/// # Examples
///
/// ```
/// # use bump_scope::Bump;
/// let mut bump: Bump = Bump::new();
///
/// {
/// let mut guard = bump.scope_guard();
/// let bump = guard.scope();
/// bump.alloc_str("Hello world!");
/// assert_eq!(bump.stats().allocated(), 12);
/// }
///
/// assert_eq!(bump.stats().allocated(), 0);
/// ```
#[must_use]
#[inline(always)]
pub fn scope_guard(&mut self) -> $scope_guard<A, MIN_ALIGN, UP> {
$scope_guard::new(self)
}
/// Calls `f` with this scope but with a new minimum alignment.
#[inline(always)]
pub fn aligned<const NEW_MIN_ALIGN: usize>(&mut self, f: impl FnOnce(BumpScope<A, NEW_MIN_ALIGN, UP>))
where
MinimumAlignment<NEW_MIN_ALIGN>: SupportedMinimumAlignment,
{
$crate::condition! {
if $is_scope {
if NEW_MIN_ALIGN < MIN_ALIGN {
// This guard will align whatever the future bump position is to `MIN_ALIGN`.
let guard = BumpAlignGuard::new(self);
f(unsafe { guard.scope.clone_unchecked().cast_align() });
} else {
self.align::<NEW_MIN_ALIGN>();
f(unsafe { self.clone_unchecked().cast_align() });
}
} else {
self.as_mut_scope().aligned(f)
}
}
}
/// Creates a checkpoint of the current bump position.
///
/// # Examples
/// ```
/// # use bump_scope::Bump;
/// # let mut bump: Bump = Bump::new();
/// let checkpoint = bump.checkpoint();
///
/// {
/// let hello = bump.alloc_str("hello");
/// assert_eq!(bump.stats().allocated(), 5);
/// }
///
/// unsafe { bump.reset_to(checkpoint); }
/// assert_eq!(bump.stats().allocated(), 0);
/// ```
#[inline]
pub fn checkpoint(&self) -> Checkpoint {
Checkpoint::new(self.chunk.get())
}
/// Resets the bump position to a previously created checkpoint. The memory that has been allocated since then will be reused by future allocations.
///
/// # Safety
/// - the checkpoint must have been created by this bump allocator
/// - the bump allocator must not have been [`reset`](crate::Bump::reset) since creation of this checkpoint
/// - there must be no references to allocations made since creation of this checkpoint
#[inline]
pub unsafe fn reset_to(&mut self, checkpoint: Checkpoint) {
$crate::condition! {
if $is_scope {
debug_assert!(self.stats().big_to_small().any(|c| {
c.chunk.header_ptr() == checkpoint.chunk.cast() &&
c.chunk.contains_addr_or_end(checkpoint.address.get())
}));
checkpoint.reset_within_chunk();
let chunk = RawChunk::from_header(checkpoint.chunk.cast());
self.chunk.set(chunk);
} else {
self.as_mut_scope().reset_to(checkpoint)
}
}
}
#[doc = crate::doc_fn_stats!(GuaranteedAllocatedStats)]
#[must_use]
#[inline(always)]
pub fn guaranteed_allocated_stats(
&self,
) -> $crate::condition! { if $is_scope { GuaranteedAllocatedStats<'a, UP> } else { GuaranteedAllocatedStats<UP> } } {
GuaranteedAllocatedStats {
current: crate::Chunk::new_guaranteed_allocated(self.as_scope()),
}
}
};
}
pub(crate) use bump_scope_methods;
macro_rules! bump_common_methods {
($is_scope:ident) => {
#[inline(always)]
pub(crate) fn is_unallocated(&self) -> bool {
!GUARANTEED_ALLOCATED && self.chunk.get().is_unallocated()
}
$crate::condition! {
if $is_scope {
#[doc = crate::doc_fn_stats!(Stats)]
#[must_use]
#[inline(always)]
pub fn stats(&self) -> Stats<'a, UP> {
Stats {
current: crate::Chunk::new(self.as_scope()),
}
}
} else {
#[doc = crate::doc_fn_stats!(Stats)]
#[must_use]
#[inline(always)]
pub fn stats(&self) -> Stats<UP> {
self.as_scope().stats()
}
}
}
#[doc = crate::doc_fn_allocator!()]
#[must_use]
#[inline(always)]
pub fn allocator(&self) -> &A {
unsafe { self.chunk.get().allocator().as_ref() }
}
#[cfg(test)]
/// Wraps `self` in [`WithDrop`] so that allocations return `&mut T`.
pub fn with_drop(self) -> WithDrop<Self> {
WithDrop::new(self)
}
#[cfg(test)]
/// Wraps `&self` in [`WithDrop`] so that allocations return `&mut T`.
pub fn with_drop_ref(&self) -> WithDrop<&Self> {
WithDrop::new(self)
}
#[cfg(test)]
/// Wraps `&mut self` in [`WithDrop`] so that allocations return `&mut T`.
pub fn with_drop_mut(&mut self) -> WithDrop<&mut Self> {
WithDrop::new(self)
}
/// Wraps `&self` in [`WithoutDealloc`] so that [`deallocate`] becomes a no-op.
///
/// [`deallocate`]: allocator_api2::alloc::Allocator::deallocate
pub fn without_dealloc(&self) -> WithoutDealloc<&Self> {
WithoutDealloc(self)
}
/// Wraps `&self` in [`WithoutShrink`] so that [`shrink`] becomes a no-op.
///
/// [`shrink`]: allocator_api2::alloc::Allocator::shrink
pub fn without_shrink(&self) -> WithoutShrink<&Self> {
WithoutShrink(self)
}
};
}
pub(crate) use bump_common_methods;
macro_rules! wrap_result {
($ok:ty, $err:ty) => { Result<$ok, $err> };
(, $err:ty) => { Result<(), $err> };
}
pub(crate) use wrap_result;
macro_rules! error_behavior_generic_methods_if {
(
if $fail_if:literal
$(
$(#[$attr:meta])*
$(do panics $(#[doc = $panics:literal])*)?
$(do errors $(#[doc = $errors:literal])*)?
$(do examples $(#[doc = $examples:literal])*)?
impl
$(#[$attr_infallible:meta])*
$(do panics $(#[doc = $infallible_panics:literal])*)?
$(do errors $(#[doc = $infallible_errors:literal])*)?
$(do examples $(#[doc = $infallible_examples:literal])*)?
for $infallible_vis:vis fn $infallible:ident
$(#[$attr_fallible:meta])*
$(do panics $(#[doc = $fallible_panics:literal])*)?
$(do errors $(#[doc = $fallible_errors:literal])*)?
$(do examples $(#[doc = $fallible_examples:literal])*)?
for $fallible_vis:vis fn $fallible:ident
fn $generic:ident
$(<{$($generic_params:tt)*}>)?
(
$(&mut $self_mut:ident ,)?
$($arg_pat:ident: $arg_ty:ty),* $(,)?
)
$(-> $return_ty:ty)?
$(where { $($where:tt)* } in)?
{
$($body:tt)*
}
)*
) => {
$(
$(#[$attr])*
$(#[$attr_infallible])*
/// # Panics
#[doc = concat!("Panics if ", $fail_if, ".")]
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $infallible_panics])*)?
#[doc = $crate::map!({ $($($errors)*)? $($($infallible_errors)*)? } become { "# Errors" } else { "" })]
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $infallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($infallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $infallible_examples])*)?
#[inline(always)]
#[cfg(not(no_global_oom_handling))]
$infallible_vis fn $infallible
$(<$($generic_params)*>)?
($(&mut $self_mut,)? $($arg_pat: $arg_ty),*) $(-> $return_ty)?
$(where $($where)*)?
{
$crate::infallible(Self::$generic($($self_mut,)? $($arg_pat),*))
}
)*
$(
$(#[$attr])*
$(#[$attr_fallible])*
#[doc = $crate::map!({ $($($panics)*)? $($($fallible_panics)*)? } become { "# Panics" } else { "" })]
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $fallible_panics])*)?
/// # Errors
#[doc = concat!("Errors if ", $fail_if, ".")]
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $fallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($fallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $fallible_examples])*)?
#[inline(always)]
$fallible_vis fn $fallible
$(<$($generic_params)*>)?
($(&mut $self_mut,)? $($arg_pat: $arg_ty),*)
-> $crate::wrap_result!($($return_ty)?, allocator_api2::alloc::AllocError)
$(where $($where)*)?
{
Self::$generic($($self_mut,)? $($arg_pat),*)
}
)*
$(
$(#[$attr])*
#[inline]
pub(crate) fn $generic
<B: ErrorBehavior $(, $($generic_params)*)?>
($(&mut $self_mut,)? $($arg_pat: $arg_ty),*)
-> $crate::wrap_result!($($return_ty)?, B)
$(where $($where)*)?
{
$($body)*
}
)*
};
}
pub(crate) use error_behavior_generic_methods_if;
macro_rules! error_behavior_generic_methods_allocation_failure {
($($tt:tt)*) => {
$crate::error_behavior_generic_methods_if!(if "the allocation fails" $($tt)*);
};
}
pub(crate) use error_behavior_generic_methods_allocation_failure;
macro_rules! map {
({ } become { $($then:tt)* }) => { };
({ } become { $($then:tt)* } else { $($else:tt)* }) => { $($else)* };
({ $($from:tt)+ } become { $($then:tt)* }) => { $($then)* };
({ $($from:tt)+ } become { $($then:tt)* } else { $($else:tt)* }) => { $($then)* };
}
pub(crate) use map;
macro_rules! doc_alloc_methods {
() => {
"Functions to allocate. Available as fallible or infallible."
};
}
macro_rules! last {
($self:ident) => {
$self
};
($mut:ident $self:ident) => {
$self
};
}
pub(crate) use last;
macro_rules! as_scope {
($self:ident) => {
$self.as_scope()
};
($mut:ident $self:ident) => {
$self.as_mut_scope()
};
}
pub(crate) use as_scope;
macro_rules! define_alloc_methods {
(
macro $macro_name:ident
$(
$(#[$attr:meta])*
$(do panics $(#[doc = $panics:literal])*)?
$(do errors $(#[doc = $errors:literal])*)?
$(do examples $(#[doc = $examples:literal])*)?
impl
$(#[$attr_infallible:meta])*
$(do panics $(#[doc = $infallible_panics:literal])*)?
$(do errors $(#[doc = $infallible_errors:literal])*)?
$(do examples $(#[doc = $infallible_examples:literal])*)?
for pub fn $infallible:ident
$(#[$attr_fallible:meta])*
$(do panics $(#[doc = $fallible_panics:literal])*)?
$(do errors $(#[doc = $fallible_errors:literal])*)?
$(do examples $(#[doc = $fallible_examples:literal])*)?
for pub fn $fallible:ident
fn $generic:ident
$(<{$($generic_params:tt)*}>)?
(&$($self:ident)+ $(, $arg_pat:ident: $arg_ty:ty)* $(,)?)
$(-> $return_ty:ty | $return_ty_scope:ty)?
$(where { $($where:tt)* } in)?
{
$($body:tt)*
}
)*
) => {
macro_rules! $macro_name {
(BumpScope) => {
$(
$(#[$attr])*
$(#[$attr_infallible])*
/// # Panics
/// Panics if the allocation fails.
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $infallible_panics])*)?
#[doc = $crate::map!({ $($($errors)*)? $($($infallible_errors)*)? } become { "# Errors" } else { "" })]
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $infallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($infallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $infallible_examples])*)?
#[inline(always)]
#[cfg(not(no_global_oom_handling))]
pub fn $infallible
$(<$($generic_params)*>)?
(&$($self)+ $(, $arg_pat: $arg_ty)*)
$(-> $return_ty_scope)?
$(where $($where)*)?
{
$crate::infallible($crate::last!($($self)+).$generic($($arg_pat),*))
}
)*
$(
$(#[$attr])*
$(#[$attr_fallible])*
#[doc = $crate::map!({ $($($panics)*)? $($($fallible_panics)*)? } become { "# Panics" } else { "" })]
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $fallible_panics])*)?
/// # Errors
/// Errors if the allocation fails.
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $fallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($fallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $fallible_examples])*)?
#[inline(always)]
pub fn $fallible
$(<$($generic_params)*>)?
(&$($self)+ $(, $arg_pat: $arg_ty)*)
-> $crate::wrap_result!($($return_ty_scope)?, allocator_api2::alloc::AllocError)
$(where $($where)*)?
{
$crate::last!($($self)+).$generic($($arg_pat),*)
}
)*
$(
$(#[$attr])*
#[inline(always)]
fn $generic
<B: $crate::ErrorBehavior $(, $($generic_params)*)?>
(&$($self)+ $(, $arg_pat: $arg_ty)*)
-> $crate::wrap_result!($($return_ty_scope)?, B)
$(where $($where)*)?
{
$($body)*
}
)*
};
(Bump) => {
$(
$(#[$attr])*
$(#[$attr_infallible])*
/// # Panics
/// Panics if the allocation fails.
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $infallible_panics])*)?
#[doc = $crate::map!({ $($($errors)*)? $($($infallible_errors)*)? } become { "# Errors" } else { "" })]
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $infallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($infallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $infallible_examples])*)?
#[inline(always)]
#[cfg(not(no_global_oom_handling))]
pub fn $infallible
$(<$($generic_params)*>)?
(&$($self)+ $(, $arg_pat: $arg_ty)*)
$(-> $return_ty)?
$(where $($where)*)?
{
#[allow(deprecated)]
$crate::as_scope!($($self)+).$infallible($($arg_pat),*)
}
)*
$(
$(#[$attr])*
$(#[$attr_fallible])*
#[doc = $crate::map!({ $($($panics)*)? $($($fallible_panics)*)? } become { "# Panics" } else { "" })]
$(#[doc = "\n"] $(#[doc = $panics])*)?
$(#[doc = "\n"] $(#[doc = $fallible_panics])*)?
/// # Errors
/// Errors if the allocation fails.
$(#[doc = "\n"] $(#[doc = $errors])*)?
$(#[doc = "\n"] $(#[doc = $fallible_errors])*)?
#[doc = $crate::map!({ $($($examples)*)? $($($fallible_examples)*)? } become { "# Examples" } else { "" })]
$(#[doc = "\n"] $(#[doc = $examples])*)?
$(#[doc = "\n"] $(#[doc = $fallible_examples])*)?
#[inline(always)]
pub fn $fallible
$(<$($generic_params)*>)?
(&$($self)+ $(, $arg_pat: $arg_ty)*)
-> $crate::wrap_result!($($return_ty)?, allocator_api2::alloc::AllocError)
$(where $($where)*)?
{
#[allow(deprecated)]
$crate::as_scope!($($self)+).$fallible($($arg_pat),*)
}
)*
};
}
pub(crate) use $macro_name;
};
}
pub(crate) use define_alloc_methods;
define_alloc_methods! {
macro alloc_methods
/// Allocate an object.
impl
for pub fn alloc
for pub fn try_alloc
fn generic_alloc<{T}>(&self, value: T) -> BumpBox<T> | BumpBox<'a, T> {
if T::IS_ZST {
return Ok(BumpBox::zst(value));
}
self.generic_alloc_with(|| value)
}
/// Pre-allocate space for an object. Once space is allocated `f` will be called to create the value to be put at that place.
/// In some situations this can help the compiler realize that `T` can be constructed at the allocated space instead of having to copy it over.
impl
for pub fn alloc_with
for pub fn try_alloc_with
fn generic_alloc_with<{T}>(&self, f: impl FnOnce() -> T) -> BumpBox<T> | BumpBox<'a, T> {
if T::IS_ZST {
let value = f();
return Ok(BumpBox::zst(value));
}
let ptr = self.do_alloc_sized::<B, T>()?;
unsafe {
pointer::write_with(ptr.as_ptr(), f);
Ok(BumpBox::from_raw(ptr))
}
}
/// Allocate an object with its default value.
impl
/// This is equivalent to `alloc_with(T::default())`.
for pub fn alloc_default
/// This is equivalent to `try_alloc_with(T::default())`.
for pub fn try_alloc_default
fn generic_alloc_default<{T: Default}>(&self) -> BumpBox<T> | BumpBox<'a, T> {
self.generic_alloc_with(Default::default)
}
#[allow(clippy::missing_errors_doc)]
/// Allocates the result of `f` in the bump allocator, then moves `E` out of it and deallocates the space it took up.
///
/// This can be more performant than allocating `T` after the fact, as `Result<T, E>` may be constructed in the bump allocators memory instead of on the stack and then copied over.
impl
for pub fn alloc_try_with
for pub fn try_alloc_try_with
fn generic_alloc_try_with<{T, E}>(&self, f: impl FnOnce() -> Result<T, E>) -> Result<BumpBox<T>, E> | Result<BumpBox<'a, T>, E> {
if T::IS_ZST {
return match f() {
Ok(value) => Ok(Ok(BumpBox::zst(value))),
Err(error) => Ok(Err(error)),
}
}
let before_chunk = self.chunk.get();
let before_chunk_pos = nonnull::addr(before_chunk.pos()).get();
let ptr = self.do_alloc_no_bump_for::<B, Result<T, E>>()?;
Ok(unsafe {
pointer::write_with(ptr.as_ptr(), f);
match nonnull::result(ptr) {
Ok(value) => Ok({
let new_pos = if UP {
let pos = nonnull::addr(nonnull::add(value, 1)).get();
up_align_usize_unchecked(pos, MIN_ALIGN)
} else {
let pos = nonnull::addr(value).get();
down_align_usize(pos, MIN_ALIGN)
};
self.chunk.get().set_pos_addr(new_pos);
BumpBox::from_raw(value)
}),
Err(error) => Err({
let error = error.as_ptr().read();
before_chunk.reset_to(before_chunk_pos);
self.chunk.set(before_chunk);
error
}),
}
})
}
/// Allocate a slice and `Copy` elements from an existing slice.
impl
for pub fn alloc_slice_copy
for pub fn try_alloc_slice_copy
fn generic_alloc_slice_copy<{T: Copy}>(
&self,
slice: &[T],
) -> BumpBox<[T]> | BumpBox<'a, [T]> {
if T::IS_ZST {
return Ok(BumpBox::zst_slice_clone(slice));
}
let len = slice.len();
let src = slice.as_ptr();
let dst = self.do_alloc_slice_for(slice)?;
unsafe {
core::ptr::copy_nonoverlapping(src, dst.cast::<T>().as_ptr(), len);
Ok(BumpBox::from_raw(dst))
}
}
/// Allocate a slice and `Clone` elements from an existing slice.
impl
for pub fn alloc_slice_clone
for pub fn try_alloc_slice_clone
fn generic_alloc_slice_clone<{T: Clone}>(
&self,
slice: &[T],
) -> BumpBox<[T]> | BumpBox<'a, [T]> {
if T::IS_ZST {
return Ok(BumpBox::zst_slice_clone(slice));
}
Ok(self.generic_alloc_uninit_slice_for(slice)?.init_clone(slice))
}
/// Allocate a slice and fill it with elements by cloning `value`.
impl
for pub fn alloc_slice_fill
for pub fn try_alloc_slice_fill
fn generic_alloc_slice_fill<{T: Clone}>(&self, len: usize, value: T) -> BumpBox<[T]> | BumpBox<'a, [T]> {
if T::IS_ZST {
return Ok(BumpBox::zst_slice_fill(len, value));
}
Ok(self.generic_alloc_uninit_slice(len)?.init_fill(value))
}
/// Allocates a slice by fill it with elements returned by calling a closure repeatedly.
///
/// This method uses a closure to create new values. If you'd rather
/// [`Clone`] a given value, use [`(try_)alloc_slice_fill`](Self::alloc_slice_fill). If you want to use the [`Default`]
/// trait to generate values, you can pass [`Default::default`] as the
/// argument.
impl
for pub fn alloc_slice_fill_with
for pub fn try_alloc_slice_fill_with
fn generic_alloc_slice_fill_with<{T}>(&self, len: usize, f: impl FnMut() -> T) -> BumpBox<[T]> | BumpBox<'a, [T]> {
if T::IS_ZST {
return Ok(BumpBox::zst_slice_fill_with(len, f));
}
Ok(self.generic_alloc_uninit_slice(len)?.init_fill_with(f))
}
/// Allocate a `str`.
impl
for pub fn alloc_str
for pub fn try_alloc_str
fn generic_alloc_str(&self, src: &str) -> BumpBox<str> | BumpBox<'a, str> {
let slice = self.generic_alloc_slice_copy(src.as_bytes())?;
// SAFETY: input is `str` so this is too
Ok(unsafe { slice.into_boxed_str_unchecked() })
}
/// Allocate a `str` from format arguments.
impl
/// For better performance prefer [`alloc_fmt_mut`](Bump::alloc_fmt_mut).
do panics
/// Panics if a formatting trait implementation returned an error.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let bump: Bump = Bump::new();
/// #
/// let one = 1;
/// let two = 2;
/// let string = bump.alloc_fmt(format_args!("{one} + {two} = {}", one + two));
///
/// assert_eq!(string, "1 + 2 = 3");
/// ```
for pub fn alloc_fmt
/// For better performance prefer [`try_alloc_fmt_mut`](Bump::try_alloc_fmt_mut).
do errors
/// Errors if a formatting trait implementation returned an error.
for pub fn try_alloc_fmt
fn generic_alloc_fmt(&self, args: fmt::Arguments) -> BumpBox<str> | BumpBox<'a, str> {
if let Some(string) = args.as_str() {
return self.generic_alloc_str(string);
}
let mut string = BumpString::new_in(self);
if fmt::Write::write_fmt(&mut string, args).is_err() {
return Err(B::capacity_overflow());
}
Ok(string.into_boxed_str())
}
/// Allocate a `str` from format arguments.
impl
/// Unlike [`alloc_fmt`](Bump::alloc_fmt), this function requires a mutable `Bump(Scope)`.
do panics
/// Panics if a formatting trait implementation returned an error.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let mut bump: Bump = Bump::new();
/// #
/// let one = 1;
/// let two = 2;
/// let string = bump.alloc_fmt_mut(format_args!("{one} + {two} = {}", one + two));
///
/// assert_eq!(string, "1 + 2 = 3");
/// ```
for pub fn alloc_fmt_mut
/// Unlike [`try_alloc_fmt`](Bump::try_alloc_fmt), this function requires a mutable `Bump(Scope)`.
do errors
/// Errors if a formatting trait implementation returned an error.
for pub fn try_alloc_fmt_mut
fn generic_alloc_fmt_mut(&mut self, args: fmt::Arguments) -> BumpBox<str> | BumpBox<'a, str> {
if let Some(string) = args.as_str() {
return self.generic_alloc_str(string);
}
let mut string = MutBumpString::generic_with_capacity_in(0, self)?;
if fmt::Write::write_fmt(&mut string, args).is_err() {
return Err(B::capacity_overflow());
}
Ok(string.into_boxed_str())
}
/// Allocate elements of an iterator into a slice.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let bump: Bump = Bump::new();
/// #
/// let slice = bump.alloc_iter([1, 2, 3]);
/// assert_eq!(slice, [1, 2, 3]);
/// ```
impl
/// For better performance prefer [`alloc_iter_exact`](Bump::try_alloc_iter_exact) or [`alloc_iter_mut(_rev)`](Bump::alloc_iter_mut).
for pub fn alloc_iter
/// For better performance prefer [`try_alloc_iter_exact`](Bump::try_alloc_iter_exact) or [`try_alloc_iter_mut(_rev)`](Bump::try_alloc_iter_mut).
for pub fn try_alloc_iter
fn generic_alloc_iter<{T}>(&self, iter: impl IntoIterator<Item = T>) -> BumpBox<[T]> | BumpBox<'a, [T]> {
let iter = iter.into_iter();
let capacity = iter.size_hint().0;
let mut vec = BumpVec::<T, A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>::generic_with_capacity_in(capacity, self)?;
for value in iter {
vec.generic_push(value)?;
}
Ok(vec.into_boxed_slice())
}
/// Allocate elements of an `ExactSizeIterator` into a slice.
do panics
/// Panics if the supplied iterator returns fewer elements than it promised.
impl
do examples
/// ```
/// # use bump_scope::Bump;
/// # let bump: Bump = Bump::new();
/// #
/// let slice = bump.alloc_iter_exact([1, 2, 3]);
/// assert_eq!(slice, [1, 2, 3]);
/// ```
for pub fn alloc_iter_exact
for pub fn try_alloc_iter_exact
fn generic_alloc_iter_exact<{T, I}>(&self, iter: impl IntoIterator<Item = T, IntoIter = I>) -> BumpBox<[T]> | BumpBox<'a, [T]>
where {
I: ExactSizeIterator<Item = T>
} in {
let mut iter = iter.into_iter();
let len = iter.len();
let uninit = self.generic_alloc_uninit_slice(len)?;
let mut initializer = uninit.initializer();
while !initializer.is_full() {
let value = match iter.next() {
Some(value) => value,
None => exact_size_iterator_bad_len(),
};
initializer.push(value);
}
Ok(initializer.into_init())
}
/// Allocate elements of an iterator into a slice.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let mut bump: Bump = Bump::new();
/// #
/// let slice = bump.alloc_iter_mut([1, 2, 3]);
/// assert_eq!(slice, [1, 2, 3]);
/// ```
impl
/// Unlike [`alloc_iter`](Bump::alloc_iter), this function requires a mutable `Bump(Scope)`.
///
/// When bumping downwards, prefer [`alloc_iter_mut_rev`](Bump::alloc_iter_mut_rev) or [`alloc_iter_exact`](Bump::alloc_iter_exact) as in this case this function incurs an additional copy of the slice internally.
for pub fn alloc_iter_mut
/// Unlike [`try_alloc_iter`](Bump::try_alloc_iter), this function requires a mutable `Bump(Scope)`.
///
/// When bumping downwards, prefer [`try_alloc_iter_mut_rev`](Bump::try_alloc_iter_mut_rev) or [`try_alloc_iter_exact`](Bump::try_alloc_iter_exact) as in this case this function incurs an additional copy of the slice internally.
for pub fn try_alloc_iter_mut
fn generic_alloc_iter_mut<{T}>(&mut self, iter: impl IntoIterator<Item = T>) -> BumpBox<[T]> | BumpBox<'a, [T]> {
let iter = iter.into_iter();
let capacity = iter.size_hint().0;
let mut vec = MutBumpVec::<T, A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>::generic_with_capacity_in(capacity, self)?;
for value in iter {
vec.generic_push(value)?;
}
Ok(vec.into_boxed_slice())
}
/// Allocate elements of an iterator into a slice in reverse order.
impl
///
/// When bumping upwards, prefer [`alloc_iter_mut`](Bump::alloc_iter_mut) or [`alloc_iter_exact`](Bump::alloc_iter_exact) as in this case this function incurs an additional copy of the slice internally.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let mut bump: Bump = Bump::new();
/// #
/// let slice = bump.alloc_iter_mut_rev([1, 2, 3]);
/// assert_eq!(slice, [3, 2, 1]);
/// ```
for pub fn alloc_iter_mut_rev
///
/// When bumping upwards, prefer [`try_alloc_iter_mut`](Bump::try_alloc_iter) or [`try_alloc_iter_exact`](Bump::try_alloc_iter_exact) as in this case this function incurs an additional copy of the slice internally.
for pub fn try_alloc_iter_mut_rev
fn generic_alloc_iter_mut_rev<{T}>(&mut self, iter: impl IntoIterator<Item = T>) -> BumpBox<[T]> | BumpBox<'a, [T]> {
let iter = iter.into_iter();
let capacity = iter.size_hint().0;
let mut vec = MutBumpVecRev::<T, A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>::generic_with_capacity_in(capacity, self)?;
for value in iter {
vec.generic_push(value)?;
}
Ok(vec.into_boxed_slice())
}
/// Allocate an unitialized object.
///
/// You can safely initialize the object with [`init`](BumpBox::init) or unsafely with [`assume_init`](BumpBox::assume_init).
do examples
/// Safely:
/// ```
/// # use bump_scope::Bump;
/// let mut bump: Bump = Bump::new();
/// let mut five = bump.alloc_uninit();
///
/// let five = five.init(5);
///
/// assert_eq!(*five, 5)
/// ```
///
/// Unsafely:
/// ```
/// # use bump_scope::Bump;
/// let mut bump: Bump = Bump::new();
/// let mut five = bump.alloc_uninit();
///
/// let five = unsafe {
/// five.write(5);
/// five.assume_init()
/// };
///
/// assert_eq!(*five, 5)
/// ```
impl
for pub fn alloc_uninit
for pub fn try_alloc_uninit
fn generic_alloc_uninit<{T}>(&self) -> BumpBox<MaybeUninit<T>> | BumpBox<'a, MaybeUninit<T>> {
if T::IS_ZST {
return Ok(BumpBox::zst(MaybeUninit::uninit()));
}
let ptr = self.do_alloc_sized::<B, T>()?.cast::<MaybeUninit<T>>();
unsafe { Ok(BumpBox::from_raw(ptr)) }
}
/// Allocate an unitialized object slice.
///
/// You can safely initialize the object with [`init_fill`](BumpBox::init_fill), [`init_fill_with`](BumpBox::init_fill_with), [`init_copy`](BumpBox::init_copy), [`init_clone`](BumpBox::init_clone) or unsafely with [`assume_init`](BumpBox::assume_init).
do examples
/// Safely:
/// ```
/// # use bump_scope::Bump;
/// let bump: Bump = Bump::new();
/// let mut values = bump.alloc_uninit_slice(3);
///
/// let values = values.init_copy(&[1, 2, 3]);
///
/// assert_eq!(*values, [1, 2, 3])
/// ```
///
/// Unsafely:
/// ```
/// # use bump_scope::Bump;
/// let bump: Bump = Bump::new();
/// let mut values = bump.alloc_uninit_slice(3);
///
/// let values = unsafe {
/// values[0].write(1);
/// values[1].write(2);
/// values[2].write(3);
///
/// values.assume_init()
/// };
///
/// assert_eq!(*values, [1, 2, 3])
/// ```
impl
for pub fn alloc_uninit_slice
for pub fn try_alloc_uninit_slice
fn generic_alloc_uninit_slice<{T}>(&self, len: usize) -> BumpBox<[MaybeUninit<T>]> | BumpBox<'a, [MaybeUninit<T>]> {
if T::IS_ZST {
return Ok(BumpBox::uninit_zst_slice(len));
}
let ptr = self.do_alloc_slice::<B, T>(len)?.cast::<MaybeUninit<T>>();
unsafe {
let ptr = nonnull::slice_from_raw_parts(ptr, len);
Ok(BumpBox::from_raw(ptr))
}
}
/// Allocate an unitialized object slice.
///
/// You can safely initialize the object with [`init_fill`](BumpBox::init_fill), [`init_fill_with`](BumpBox::init_fill_with), [`init_copy`](BumpBox::init_copy), [`init_clone`](BumpBox::init_clone) or unsafely with [`assume_init`](BumpBox::assume_init).
///
/// This is just like `(try_)alloc_uninit_slice` but uses a `slice` to provide the `len`.
/// This avoids a check for a valid layout. The elements of `slice` are irrelevant.
impl
for pub fn alloc_uninit_slice_for
for pub fn try_alloc_uninit_slice_for
fn generic_alloc_uninit_slice_for<{T}>(&self, slice: &[T]) -> BumpBox<[MaybeUninit<T>]> | BumpBox<'a, [MaybeUninit<T>]> {
if T::IS_ZST {
return Ok(BumpBox::uninit_zst_slice(slice.len()));
}
let ptr = self.do_alloc_slice_for::<B, T>(slice)?.cast::<MaybeUninit<T>>();
unsafe {
let ptr = nonnull::slice_from_raw_parts(ptr, slice.len());
Ok(BumpBox::from_raw(ptr))
}
}
/// Allocate a [`FixedBumpVec`] with the given `capacity`.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let bump: Bump = Bump::new();
/// let mut values = bump.alloc_fixed_vec(3);
/// values.push(1);
/// values.push(2);
/// values.push(3);
/// assert_eq!(values, [1, 2, 3])
/// ```
impl
for pub fn alloc_fixed_vec
for pub fn try_alloc_fixed_vec
fn generic_alloc_fixed_vec<{T}>(&self, len: usize) -> FixedBumpVec<T> | FixedBumpVec<'a, T> {
Ok(FixedBumpVec::from_uninit(self.generic_alloc_uninit_slice(len)?))
}
/// Allocate a [`FixedBumpString`] with the given `capacity`.
do examples
/// ```
/// # use bump_scope::Bump;
/// # let bump: Bump = Bump::new();
/// let mut values = bump.alloc_fixed_vec(3);
/// values.push(1);
/// values.push(2);
/// values.push(3);
/// assert_eq!(values, [1, 2, 3])
/// ```
impl
for pub fn alloc_fixed_string
for pub fn try_alloc_fixed_string
fn generic_alloc_fixed_string(&self, len: usize) -> FixedBumpString | FixedBumpString<'a> {
Ok(FixedBumpString::from_uninit(self.generic_alloc_uninit_slice(len)?))
}
/// Allocates memory as described by the given `Layout`.
impl
for pub fn alloc_layout
for pub fn try_alloc_layout
fn generic_alloc_layout(&self, layout: Layout) -> NonNull<u8> | NonNull<u8> {
match self.chunk.get().alloc::<MIN_ALIGN, false, false, _>(layout) {
Some(ptr) => Ok(ptr),
None => self.alloc_in_another_chunk(layout),
}
}
/// Reserves capacity for at least `additional` more bytes to be bump allocated.
/// The bump allocator may reserve more space to avoid frequent reallocations.
/// After calling `reserve`, `chunks().remaining()` will be greater than or equal to
/// `additional`. Does nothing if capacity is already sufficient.
do examples
/// ```
/// # use bump_scope::{ Bump };
/// #
/// let bump: Bump = Bump::new();
/// assert!(bump.stats().capacity() < 4096);
///
/// bump.reserve_bytes(4096);
/// assert!(bump.stats().capacity() > 4096);
/// ```
impl
for pub fn reserve_bytes
for pub fn try_reserve_bytes
fn generic_reserve_bytes(&self, additional: usize) {
let layout = match Layout::from_size_align(additional, 1) {
Ok(ok) => ok,
Err(_) => return Err(B::capacity_overflow()),
};
if self.is_unallocated() {
let allocator = A::default_or_panic();
let new_chunk = RawChunk::new_in(ChunkSize::for_capacity(layout)?, None, allocator)?;
self.chunk.set(new_chunk);
return Ok(());
}
let mut additional = additional;
let mut chunk = self.chunk.get();
loop {
if let Some(rest) = additional.checked_sub(chunk.remaining()) {
additional = rest;
} else {
return Ok(());
}
if let Some(next) = chunk.next() {
chunk = next;
} else {
break;
}
}
chunk.append_for(layout).map(drop)
}
}
#[doc = doc_alloc_methods!()]
impl<'a, A, const MIN_ALIGN: usize, const UP: bool, const GUARANTEED_ALLOCATED: bool>
BumpScope<'a, A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>
where
MinimumAlignment<MIN_ALIGN>: SupportedMinimumAlignment,
A: BaseAllocator<GUARANTEED_ALLOCATED>,
{
alloc_methods!(BumpScope);
}
#[doc = doc_alloc_methods!()]
impl<A, const MIN_ALIGN: usize, const UP: bool, const GUARANTEED_ALLOCATED: bool>
Bump<A, MIN_ALIGN, UP, GUARANTEED_ALLOCATED>
where
MinimumAlignment<MIN_ALIGN>: SupportedMinimumAlignment,
A: BaseAllocator<GUARANTEED_ALLOCATED>,
{
alloc_methods!(Bump);
}
mod supported_base_allocator {
pub trait Sealed<const GUARANTEED_ALLOCATED: bool> {
fn default_or_panic() -> Self;
}
impl<A> Sealed<false> for A
where
A: Default,
{
fn default_or_panic() -> Self {
A::default()
}
}
impl<A> Sealed<true> for A {
fn default_or_panic() -> Self {
unreachable!("default should not be required for `GUARANTEED_ALLOCATED` bump allocators");
}
}
}
/// Trait that any allocator used as a base allocator of a bump allocator needs to implement.
///
/// This trait is *sealed*: the list of implementors below is total.
pub trait BaseAllocator<const GUARANTEED_ALLOCATED: bool = true>:
Allocator + Clone + supported_base_allocator::Sealed<GUARANTEED_ALLOCATED>
{
}
impl<A> BaseAllocator<false> for A where A: Allocator + Clone + Default {}
impl<A> BaseAllocator<true> for A where A: Allocator + Clone {}
/// We don't use `document-features` the usual way because then we can't have our features
/// be copied into the `README.md` via [`cargo-rdme`](https://github.com/orium/cargo-rdme).
#[test]
#[ignore = "this is not a real test, its just to insert documentation"]
fn insert_feature_docs() {
let lib_rs = std::fs::read_to_string("src/lib.rs").unwrap();
let start_marker = "//! # Feature Flags";
let end_marker = "//! # ";
let start_index = lib_rs.find(start_marker).unwrap();
let end_index = lib_rs[start_index + start_marker.len()..].find(end_marker).unwrap() + start_index + start_marker.len();
let before = &lib_rs[..start_index + start_marker.len()];
let after = &lib_rs[end_index..];
let features = document_features::document_features!();
let features = features
.lines()
.map(|line| format!("//! {line}"))
.collect::<Vec<_>>()
.join("\n");
let new_lib_rs = format!("{before}\n{features}\n//!\n{after}");
std::fs::write("src/lib.rs", new_lib_rs).unwrap();
}