bcast 0.0.29

Low latency broadcast (SPMC) buffer designed to work with shared memory.
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
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
//! Low latency, single producer & many consumer (SPMC) ring buffer that works with shared memory.
//! Natively supports variable message sizes.
//!
//! ## Examples
//! Create `Writer` and use `claim` to publish a message.
//! ```no_run
//! use bcast::RingBuffer;
//!
//! // create writer
//! let bytes = [0u8; 1024];
//! let mut writer = RingBuffer::new(&bytes).into_writer();
//!
//! // publish first message
//! let mut claim = writer.claim(5, true);
//! claim.get_buffer_mut().copy_from_slice(b"hello");
//! claim.commit();
//!
//! // publish second message
//! let mut claim = writer.claim(5, true);
//! claim.get_buffer_mut().copy_from_slice(b"world");
//! claim.commit();
//! ```
//! Create `Reader` and use `batch_iter` tp receive messages.
//! ```no_run
//! use bcast::RingBuffer;
//!
//! // create reader
//! let bytes = [0u8; 1024];
//! let mut reader = RingBuffer::new(&bytes).into_reader();
//! let mut iter = reader.read_batch().unwrap().into_iter();
//! let mut payload = [0u8; 1024];
//!
//! // read first message
//! let msg = iter.next().unwrap().unwrap();
//! let len = msg.read(&mut payload).unwrap();
//! assert_eq!(b"hello", &payload[..len]);
//!
//! // read second message
//! let msg = iter.next().unwrap().unwrap();
//! let len = msg.read(&mut payload).unwrap();
//! assert_eq!(b"world", &payload[..len]);
//!
//! // no more messages
//! assert!(iter.next().is_none())
//! ```

pub mod error;

#[cfg(feature = "mmap")]
mod mmap;
pub mod util;

use crossbeam_utils::CachePadded;
use std::cell::Cell;
use std::cmp::min;
use std::hint;
use std::marker::PhantomData;
use std::mem::ManuallyDrop;
use std::ptr::{NonNull, copy_nonoverlapping, read_unaligned};
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering};

use crate::error::Error;

// re-exports
pub use error::Result;
use std::mem::align_of;
use std::mem::size_of;

#[cfg(feature = "mmap")]
pub use mmap::{MappedReader, MappedWriter};

/// Ring buffer header size in bytes.
pub const HEADER_SIZE: usize = size_of::<Header>();
/// Metadata buffer size in bytes.
pub const METADATA_BUFFER_SIZE: usize = 1024;
/// Null value for `user_defined` field.
pub const USER_DEFINED_NULL_VALUE: u32 = 0;

// mask to obtain message length from frame header
const FRAME_HEADER_MSG_LEN_MASK: u32 = 0x0FFFFFFF;
// represents the max value we can encode on the frame header for the payload length
const MAX_PAYLOAD_LEN: usize = (1 << 28) - 1;

/// Ring buffer header that contains producer position. The position is expressed in bytes and
/// will always increment.
#[derive(Debug)]
#[repr(C)]
struct Header {
    producer_position: CachePadded<AtomicUsize>, // will always increase
    ready: CachePadded<AtomicBool>,              // indicates channel readiness
    metadata: CachePadded<[u8; 1024]>,           // metadata buffer
}

impl Header {
    /// Get pointer to the data section of the ring buffer.
    #[inline]
    const fn data_ptr(&self) -> *const u8 {
        let header_ptr: *const Header = self;
        unsafe { header_ptr.add(1) as *const u8 }
    }

    /// Check readiness status.
    #[inline]
    fn is_ready(&self) -> bool {
        self.ready.load(Ordering::SeqCst)
    }

    /// Get metadata buffer as slice.
    #[inline]
    fn metadata(&self) -> &[u8] {
        &*self.metadata
    }

    /// Get metadata buffer as mutable slice.
    #[inline]
    fn metadata_mut(&mut self) -> &mut [u8] {
        &mut *self.metadata
    }
}

/// Message frame header that contains packed `fields` (fin, continuation, padding, length)
/// as well as `user_defined` field.
#[repr(C, align(8))]
struct FrameHeader {
    fields: Cell<u32>,       // contains padding flag and payload length
    user_defined: Cell<u32>, // user defined field
}

impl FrameHeader {
    #[inline]
    #[cfg(test)]
    const fn new(
        payload_len: u32,
        user_defined: u32,
        fin: bool,
        continuation: bool,
        padding: bool,
        heartbeat: bool,
    ) -> Self {
        let fields = pack_fields(fin, continuation, padding, heartbeat, payload_len);
        FrameHeader {
            fields: Cell::new(fields),
            user_defined: Cell::new(user_defined),
        }
    }

    #[inline]
    #[cfg(test)]
    const fn new_padding() -> Self {
        Self::new(0, 0, true, false, true, false)
    }

    #[inline]
    #[cfg(test)]
    fn is_heartbeat(&self) -> bool {
        ((self.fields.get() >> 28) & 1) == 1
    }

    #[inline]
    #[cfg(test)]
    fn is_padding(&self) -> bool {
        ((self.fields.get() >> 29) & 1) == 1
    }

    #[inline]
    #[cfg(test)]
    fn is_continuation(&self) -> bool {
        ((self.fields.get() >> 30) & 1) == 1
    }

    #[inline]
    #[cfg(test)]
    fn is_fin(&self) -> bool {
        ((self.fields.get() >> 31) & 1) == 1
    }

    #[inline]
    #[cfg(test)]
    fn payload_len(&self) -> u32 {
        self.fields.get() & FRAME_HEADER_MSG_LEN_MASK
    }

    /// Extract `(fin, continuation, padding, heartbeat, length)` fields from the message header.
    #[inline]
    fn unpack_fields(&self) -> (bool, bool, bool, bool, u32) {
        unpack_fields(self.fields.get())
    }

    /// Get pointer to the message payload.
    #[inline]
    const fn get_payload_ptr(&self) -> *const FrameHeader {
        let message_header_ptr: *const FrameHeader = self;
        unsafe { message_header_ptr.add(1) }
    }

    /// Get mutable pointer to the message payload.
    #[inline]
    const fn get_payload_ptr_mut(&self) -> *mut FrameHeader {
        let message_header_ptr = self as *const FrameHeader as *mut FrameHeader;
        unsafe { message_header_ptr.add(1) }
    }
}

/// Packs the `FrameHeader` fields into a single u32 according to the following encoding:
/// - Bit 31: fin flag
/// - Bit 30: continuation flag
/// - Bit 29: padding flag
/// - Bit 28: heartbeat flag
/// - Bits 0-27: message length
#[inline]
const fn pack_fields(fin: bool, continuation: bool, padding: bool, heartbeat: bool, length: u32) -> u32 {
    unsafe { pack_fields_unchecked(fin, continuation, padding, heartbeat, length & FRAME_HEADER_MSG_LEN_MASK) }
}

#[inline]
const unsafe fn pack_fields_unchecked(
    fin: bool,
    continuation: bool,
    padding: bool,
    heartbeat: bool,
    length: u32,
) -> u32 {
    length
        | ((heartbeat as u32) << 28)
        | ((padding as u32) << 29)
        | ((continuation as u32) << 30)
        | ((fin as u32) << 31)
}

/// Unpacks `u32` field into a tuple: (fin, continuation, padding, heartbeat, length).
#[inline]
const fn unpack_fields(fields: u32) -> (bool, bool, bool, bool, u32) {
    let fin = (fields >> 31) & 1 == 1;
    let continuation = (fields >> 30) & 1 == 1;
    let padding = (fields >> 29) & 1 == 1;
    let heartbeat = (fields >> 28) & 1 == 1;
    let length = fields & FRAME_HEADER_MSG_LEN_MASK;
    (fin, continuation, padding, heartbeat, length)
}

/// Calculate the number of bytes needed to ensure frame header alignment of the payload.
#[inline]
const fn get_aligned_size(payload_length: usize) -> usize {
    const ALIGNMENT_MASK: usize = align_of::<FrameHeader>() - 1;
    (payload_length + ALIGNMENT_MASK) & !ALIGNMENT_MASK
}

/// Single producer, many consumer (SPMC) ring buffer backed by shared memory.
#[derive(Debug, Clone)]
pub struct RingBuffer {
    ptr: NonNull<Header>,
    capacity: usize,
    mtu: usize,
}

impl RingBuffer {
    /// Create new `RingBuffer` by wrapping provided `bytes`. It is necessary to call `into_writer()`
    /// or `into_reader()` following the buffer construction to start using it.
    pub fn new(bytes: &[u8]) -> Self {
        assert!(bytes.len() > size_of::<Header>(), "insufficient size for the header");
        assert!((bytes.len() - size_of::<Header>()).is_power_of_two(), "buffer len must be power of two");

        let header = bytes.as_ptr() as *mut Header;
        let capacity = bytes.len() - size_of::<Header>();
        Self {
            ptr: NonNull::new(header).unwrap(),
            capacity,
            mtu: min(capacity / 2 - size_of::<FrameHeader>(), MAX_PAYLOAD_LEN),
        }
    }

    /// Get mutable reference to ring buffer header.
    #[inline]
    const fn header(&self) -> &'static mut Header {
        unsafe { &mut *self.ptr.as_ptr() }
    }

    /// Will consume `self` and return instance of writer backed by this ring buffer. The writer
    /// will write from the beginning of the ring buffer. If you need to continue writing to the
    /// previous buffer use `RingBuffer::join_writer` instead.
    pub fn into_writer(self) -> Writer {
        // will write from the start of the buffer
        self.header().producer_position.store(0, Ordering::SeqCst);
        // mark as initialised
        self.header().ready.store(true, Ordering::SeqCst);
        Writer {
            ring: self,
            position: Cell::new(0),
        }
    }

    /// Will consume `self` and return instance of writer backed by this ring buffer. The writer
    /// will not reset current `producer_position` and will continue writing from that point.
    pub fn join_writer(self) -> Writer {
        assert!(self.header().ready.load(Ordering::SeqCst), "unable to join buffer not marked as ready");
        // read current position
        let position = self.header().producer_position.load(Ordering::SeqCst);
        Writer {
            ring: self,
            position: Cell::new(position),
        }
    }

    /// Will consume `self` and return instance of writer backed by this ring buffer, with the
    /// initial position set to the provided value.
    pub fn into_writer_at(self, position: usize) -> Writer {
        assert_eq!(get_aligned_size(position), position, "position must be aligned");
        self.header().producer_position.store(position, Ordering::SeqCst);
        // mark as initialised after setting the position
        self.header().ready.store(true, Ordering::SeqCst);
        Writer {
            ring: self,
            position: Cell::new(position),
        }
    }

    /// Will consume `self` and return instance of writer backed by this ring buffer. This
    /// method also accepts closure to populate `metadata` buffer.
    pub fn into_writer_with_metadata<F: FnOnce(&mut [u8])>(self, metadata: F) -> Writer {
        // populate metadata
        metadata(self.header().metadata_mut());
        self.into_writer()
    }

    /// Will consume `self` and return instance of reader backed by this ring buffer. The reader
    /// position will be set to producer most up-to-date position.
    pub fn into_reader(self) -> Reader {
        // wait until buffer has been initialised
        while !self.header().is_ready() {
            hint::spin_loop();
        }
        let producer_position = self.header().producer_position.load(Ordering::SeqCst);
        Reader {
            ring: self,
            position: Cell::new(producer_position),
        }
    }
}

/// Wraps `RingBuffer` and allows to publish messages. Only single writer should be present at any time.
#[derive(Debug)]
pub struct Writer {
    ring: RingBuffer,
    position: Cell<usize>, // local producer position
}

impl From<RingBuffer> for Writer {
    fn from(ring: RingBuffer) -> Self {
        ring.into_writer()
    }
}

impl Writer {
    /// Claim part of the underlying `RingBuffer` for publication. The `fin` flag is used to indicate
    /// final message fragment.
    ///
    /// ## Panics
    /// When aligned message length is greater than the `MTU`.
    #[inline]
    pub const fn claim(&self, len: usize, fin: bool) -> Claim<'_> {
        self.claim_with_user_defined(len, fin, USER_DEFINED_NULL_VALUE)
    }

    /// Claim part of the underlying `RingBuffer` for publication. The `fin` flag is used to indicate
    /// final message fragment. This method also accepts `user_defined` value
    /// that will be attached to the message frame header.
    ///
    /// ## Panics
    /// When aligned message length is greater than the `MTU`.
    #[inline]
    pub const fn claim_with_user_defined(&self, len: usize, fin: bool, user_defined: u32) -> Claim<'_> {
        let aligned_len = get_aligned_size(len);
        debug_assert!(aligned_len <= self.mtu(), "mtu exceeded");
        Claim::new(self, aligned_len, len, user_defined, fin, false, false)
    }

    /// Claim part of the underlying `RingBuffer` for continuation frame publication also passing
    /// `fin` value to indicate final message fragment.
    ///
    /// ## Panics
    /// When aligned message length is greater than the `MTU`.
    #[inline]
    pub const fn continuation(&self, len: usize, fin: bool) -> Claim<'_> {
        let aligned_len = get_aligned_size(len);
        debug_assert!(aligned_len <= self.mtu(), "mtu exceeded");
        Claim::new(self, aligned_len, len, USER_DEFINED_NULL_VALUE, fin, true, false)
    }

    /// Claim part of the underlying `RingBuffer` for heartbeat frame publication (zero payload,
    /// no user defined field and no fragmentation). This operation will always succeed.
    #[inline]
    pub const fn heartbeat(&self) -> Claim<'_> {
        Claim::new(self, 0, 0, USER_DEFINED_NULL_VALUE, true, false, true)
    }

    /// Claim part of the underlying `RingBuffer` for heartbeat frame publication with user defined
    /// field (zero payload and no fragmentation). This operation will always succeed.
    #[inline]
    pub const fn heartbeat_with_user_defined(&self, user_defined: u32) -> Claim<'_> {
        Claim::new(self, 0, 0, user_defined, true, false, true)
    }

    /// Claim part of the underlying `RingBuffer` for heartbeat frame publication with payload (no
    /// user defined field and no fragmentation). This operation will always succeed.
    #[inline]
    pub const fn heartbeat_with_payload(&self, len: usize) -> Claim<'_> {
        let aligned_len = get_aligned_size(len);
        debug_assert!(aligned_len <= self.mtu(), "mtu exceeded");
        Claim::new(self, aligned_len, len, USER_DEFINED_NULL_VALUE, true, false, true)
    }

    /// Claim part of the underlying `RingBuffer` for heartbeat frame publication with payload and
    /// user defined field (no fragmentation). This operation will always succeed.
    #[inline]
    pub const fn heartbeat_with_payload_and_user_defined(&self, len: usize, user_defined: u32) -> Claim<'_> {
        let aligned_len = get_aligned_size(len);
        debug_assert!(aligned_len <= self.mtu(), "mtu exceeded");
        Claim::new(self, aligned_len, len, user_defined, true, false, true)
    }

    /// Get maximum permissible unaligned payload length that can be accepted by the buffer.
    /// It is calculated as `min(capacity / 2 - size_of::<FrameHeader>(), MAX_PAYLOAD_LEN)` where
    /// `MAX_PAYLOAD_LEN` is `(1 << 31) - 1`.
    #[inline]
    pub const fn mtu(&self) -> usize {
        self.ring.mtu
    }

    /// Buffer index at which next write will happen.
    #[inline]
    const fn index(&self) -> usize {
        self.position.get() & (self.ring.capacity - 1)
    }

    /// Number of bytes remaining in the buffer before it will wrap around.
    #[inline]
    const fn remaining(&self) -> usize {
        self.ring.capacity - self.index()
    }

    /// Get reference to the next (unpublished) message frame header;
    #[inline]
    const fn frame_header(&self) -> &FrameHeader {
        unsafe {
            let ptr = self.ring.header().data_ptr();
            &*(ptr.add(self.index()) as *const FrameHeader)
        }
    }
}

/// Represents region of the `RingBuffer` we can publish message to.
#[derive(Debug)]
pub struct Claim<'a> {
    writer: &'a Writer,       // underlying writer
    position_snapshot: usize, // writer initial position
    len: usize,               // frame header aligned payload length
    limit: usize,             // actual payload length
    user_defined: u32,        // user defined field
    fin: bool,                // final message fragment
    continuation: bool,       // continuation frame
    heartbeat: bool,          // heartbeat frame
}

impl<'a> Claim<'a> {
    /// Create new claim.
    #[inline]
    const fn new(
        writer: &'a Writer,
        len: usize,
        limit: usize,
        user_defined: u32,
        fin: bool,
        continuation: bool,
        heartbeat: bool,
    ) -> Self {
        #[cold]
        const fn insert_padding_frame(writer: &Writer, remaining: usize) {
            let padding_len = remaining - size_of::<FrameHeader>();
            let fields = pack_fields(true, false, true, false, padding_len as u32);
            let header = writer.frame_header();
            let _ = header.fields.replace(fields);
            let _ = header.user_defined.replace(USER_DEFINED_NULL_VALUE);
            let _ = writer.position.replace(
                writer
                    .position
                    .get()
                    .wrapping_add(padding_len + size_of::<FrameHeader>()),
            );
        }

        let position_snapshot = writer.position.get();

        // insert padding frame if required
        let remaining = writer.remaining();
        if len + size_of::<FrameHeader>() > remaining {
            insert_padding_frame(writer, remaining);
        };

        Self {
            writer,
            position_snapshot,
            len,
            limit,
            user_defined,
            fin,
            continuation,
            heartbeat,
        }
    }

    /// Get next message payload as byte slice.
    #[inline]
    pub const fn get_buffer(&self) -> &[u8] {
        let ptr = self.writer.frame_header().get_payload_ptr();
        unsafe { std::slice::from_raw_parts(ptr as *const u8, self.limit) }
    }

    /// Get next message payload as mutable byte slice.
    #[inline]
    pub const fn get_buffer_mut(&mut self) -> &mut [u8] {
        let ptr = self.writer.frame_header().get_payload_ptr_mut();
        unsafe { std::slice::from_raw_parts_mut(ptr as *mut u8, self.limit) }
    }

    /// Abort the publication.
    #[inline]
    pub const fn abort(self) {
        // rollback to the initial position (in case padding frame was inserted)
        let _ = self.writer.position.replace(self.position_snapshot);
        let _ = ManuallyDrop::new(self);
    }

    /// Commit the message thus making it visible to other consumers. If this operation is not
    /// invoked, the commit will happen automatically when `Claim` is dropped.
    #[inline]
    pub fn commit(self) {
        // we need to ensure the destructor will not be called in this case
        ManuallyDrop::new(self).commit_impl();
    }

    #[inline]
    fn commit_impl(&self) {
        // update frame header
        let header = self.writer.frame_header();
        let fields = pack_fields(self.fin, self.continuation, false, self.heartbeat, self.limit as u32);
        let _ = header.fields.replace(fields);
        let _ = header.user_defined.replace(self.user_defined);

        // advance writer position
        let _ = self.writer.position.replace(
            self.writer
                .position
                .get()
                .wrapping_add(self.len + size_of::<FrameHeader>()),
        );

        // signal updated producer position
        self.writer
            .ring
            .header()
            .producer_position
            .store(self.writer.position.get(), Ordering::Release);
    }
}

impl Drop for Claim<'_> {
    fn drop(&mut self) {
        self.commit_impl();
    }
}

/// Wraps `RingBuffer` and allows to receive messages. Multiple readers can be present at any time,
/// they operate independently and are not part of any congestion control flow. As a result, each reader
/// can be overrun by the producer if it's unable to keep up.
pub struct Reader {
    ring: RingBuffer,
    position: Cell<usize>, // local position that will always increase
}

impl Reader {
    /// Get metadata buffer associated with the underlying ring buffer.
    pub fn metadata(&self) -> &'static [u8] {
        self.ring.header().metadata()
    }

    /// Set reader initial position (the default is producer current position).
    pub fn with_initial_position(self, position: usize) -> Self {
        assert_eq!(get_aligned_size(position), position, "position must be aligned");
        Self {
            ring: self.ring,
            position: Cell::new(position),
        }
    }

    /// Obtain reference to the (unpublished) message frame header.
    #[inline]
    const fn as_frame_header(&self) -> &FrameHeader {
        unsafe { &*(self.ring.header().data_ptr().add(self.index()) as *const FrameHeader) }
    }

    /// Buffer index at which read will happen.
    #[inline]
    const fn index(&self) -> usize {
        self.position.get() & (self.ring.capacity - 1)
    }

    /// Reset reader position to current producer position, for recovering from overrun.
    #[cold]
    #[inline(never)]
    pub fn reset(&self) {
        let _ = self
            .position
            .replace(self.ring.header().producer_position.load(Ordering::Acquire));
    }

    /// Construct `Batch` object that can efficiently read multiple messages in a batch between
    /// `Reader` current position and prevailing producer position. Returns `None` if there is
    /// no new data to read.
    #[inline]
    pub fn read_batch(&self) -> Option<Batch<'_>> {
        let producer_position = self.ring.header().producer_position.load(Ordering::Acquire);
        let limit = producer_position.wrapping_sub(self.position.get());
        if limit == 0 {
            return None;
        }
        Some(Batch {
            reader: self,
            remaining: limit,
        })
    }

    /// Construct `Bulk` object representing raw bytes between `Reader` current position and the
    /// prevailing producer position. Returned bulk includes message frame headers and payload bytes
    /// exactly as they appear in the ring buffer data section.
    #[inline]
    pub fn read_bulk(&self) -> Option<Result<Bulk<'_>>> {
        let start_position = self.position.get();
        let end_position = self.ring.header().producer_position.load(Ordering::Acquire);
        let len = end_position.wrapping_sub(start_position);
        if len == 0 {
            return None;
        }
        if len > self.ring.capacity {
            return Some(Err(Error::overrun(start_position)));
        }
        Some(Ok(Bulk {
            reader: self,
            start_position,
            end_position,
            len,
        }))
    }

    /// Receive next pending message from the ring buffer.
    #[inline]
    pub fn receive_next(&self) -> Option<Result<Message>> {
        let producer_position_before = self.ring.header().producer_position.load(Ordering::Acquire);
        // no new messages
        if producer_position_before.wrapping_sub(self.position.get()) == 0 {
            return None;
        }
        // attempt to receive next frame
        // if the frame is padding will skip it and attempt to return next frame
        match self.receive_next_impl(self.position.get()) {
            Some(msg) => match msg {
                Ok(msg) if !msg.is_padding => Some(Ok(msg)),
                Ok(_) => self.receive_next_impl(self.position.get()),
                Err(err) => Some(Err(err)),
            },
            None => None,
        }
    }

    #[inline]
    fn receive_next_impl(&self, reader_position: usize) -> Option<Result<Message>> {
        // extract frame header fields
        let frame_header = self.as_frame_header();
        let (is_fin, is_continuation, is_padding, is_heartbeat, length) = frame_header.unpack_fields();
        let user_defined = frame_header.user_defined.get();
        let producer_position_after = self.ring.header().producer_position.load(Ordering::Acquire);

        // construct the massage
        let message = Message {
            header: self.ring.header(),
            stream_position: self.position.get(),
            position: self.position.get().wrapping_add(size_of::<FrameHeader>()),
            payload_len: length as usize,
            capacity: self.ring.capacity,
            is_fin,
            is_continuation,
            is_padding,
            is_heartbeat,
            user_defined,
        };

        // ensure we have not been overrun by the writer
        // so the frame header is not overwritten and can be trusted
        if producer_position_after.wrapping_sub(reader_position) > self.ring.capacity {
            return Some(Err(Error::overrun(reader_position)));
        }

        // update reader position
        let aligned_payload_len = get_aligned_size(message.payload_len);
        let position = self.position.get();
        self.position
            .set(position.wrapping_add(aligned_payload_len + size_of::<FrameHeader>()));
        Some(Ok(message))
    }
}

/// Contains coordinates to some payload at particular point in time. Messages are consumer in a
/// 'lazily' way that's why it's safe to `clone()` and pass them around. When message is read
/// (consumed) it can result in overrun error if the producer has lapped around.
#[derive(Debug, Clone)]
pub struct Message {
    header: &'static Header, // ring buffer header
    capacity: usize,         // ring buffer capacity
    position: usize,         // marks beginning of message payload
    /// Absolute position within stream. Marks beginning of message header.
    pub stream_position: usize,
    /// Message length.
    pub payload_len: usize,
    /// User defined field.
    pub user_defined: u32,
    /// Indicates final message fragment.
    pub is_fin: bool,
    /// Indicates continuation frame
    pub is_continuation: bool,
    /// Indicates padding frame.
    pub is_padding: bool,
    /// Indicates heartbeat frame.
    pub is_heartbeat: bool,
}

impl Message {
    /// Buffer index at which read will happen.
    #[inline]
    const fn index(&self) -> usize {
        self.position & (self.capacity - 1)
    }

    /// Read the message into specified buffer. It will return error if the provided buffer
    /// is too small. Will also return error if at any point the producer has overrun this consumer.
    /// On success, it will return the number of bytes written to the buffer.
    /// ## Examples
    /// ```no_run
    /// use bcast::Message;
    ///
    /// fn consume_message(msg: &Message) {
    ///     let mut payload = [0u8; 1024];
    ///     // read into provided buffer (error means overrun)
    ///     let len = msg.read(&mut payload).unwrap();
    ///     // process payload
    ///     // ...
    /// }
    /// ```
    #[inline]
    pub fn read(&self, buf: &mut [u8]) -> Result<usize> {
        debug_assert!(
            self.payload_len <= min(self.capacity / 2 - size_of::<FrameHeader>(), MAX_PAYLOAD_LEN),
            "payload size is greater than mtu"
        );
        debug_assert!(self.index() + self.payload_len <= self.capacity, "payload over shots ring buffer");
        // ensure destination buffer is of sufficient size
        if self.payload_len > buf.len() {
            return Err(Error::insufficient_buffer_size(buf.len(), self.payload_len));
        }

        // attempt to copy message data into provided buffer
        let producer_position_before = self.position;
        unsafe {
            copy_nonoverlapping(self.header.data_ptr().add(self.index()), buf.as_mut_ptr(), self.payload_len);
        }
        let producer_position_after = self.header.producer_position.load(Ordering::Acquire);

        // ensure we have not been overrun by the producer
        if producer_position_after.wrapping_sub(producer_position_before) > self.capacity {
            return Err(Error::overrun(self.position));
        }

        Ok(self.payload_len)
    }
}

/// Represents pending batch of messages between last observed producer position and the reader current position.
/// Should be used in conjunction with `BatchIter` to allow iteration.
pub struct Batch<'a> {
    reader: &'a Reader,
    remaining: usize, // remaining bytes to consume
}

impl<'a> IntoIterator for Batch<'a> {
    type Item = <BatchIter<'a> as Iterator>::Item;
    type IntoIter = BatchIter<'a>;

    fn into_iter(self) -> Self::IntoIter {
        BatchIter { batch: self }
    }
}

impl Batch<'_> {
    /// Return the number of remaining bytes to be consumed by this instance of batch.
    #[inline]
    pub const fn remaining(&self) -> usize {
        self.remaining
    }

    /// Receive next message from the current batch or `None` if end of batch. This is a low level
    /// method that will also return padding frames. Use `into_iter()` to work with more user-friendly
    /// `BatchIter`.
    #[inline]
    pub fn receive_next(&mut self) -> Option<Result<Message>> {
        // we reached end of batch
        if self.remaining == 0 {
            return None;
        }
        // update iterator with the number of bytes consumed
        match self.reader.receive_next_impl(self.reader.position.get()) {
            None => None,
            Some(Ok(msg)) => {
                self.remaining -= get_aligned_size(msg.payload_len) + size_of::<FrameHeader>();
                Some(Ok(msg))
            }
            Some(Err(err)) => Some(Err(err)),
        }
    }
}

/// Iterator that allows to process pending messages in a batch. This is more efficient than iterating
/// over the messages using `receive_next()` on the `Reader` directly.
pub struct BatchIter<'a> {
    batch: Batch<'a>,
}

impl Iterator for BatchIter<'_> {
    type Item = Result<Message>;

    fn next(&mut self) -> Option<Self::Item> {
        // attempt to receive next frame
        // if the frame is padding will skip it and attempt to return next frame
        match self.batch.receive_next() {
            None => None,
            Some(msg) => match msg {
                Ok(msg) if !msg.is_padding => Some(Ok(msg)),
                Ok(_) => self.batch.receive_next(),
                Err(err) => Some(Err(err)),
            },
        }
    }
}

/// Represents a bounded contiguous stream window copied out of the ring as raw bytes. Unlike
/// `Batch`, this API does not parse individual messages and instead operates on the underlying
/// frame bytes directly.
pub struct Bulk<'a> {
    reader: &'a Reader,
    start_position: usize,
    end_position: usize,
    len: usize,
}

#[allow(clippy::len_without_is_empty)]
impl Bulk<'_> {
    /// Return the number of raw bytes available in this bulk window.
    #[inline]
    pub const fn len(&self) -> usize {
        self.len
    }

    /// Absolute stream position at which this bulk window starts.
    #[inline]
    pub const fn start_position(&self) -> usize {
        self.start_position
    }

    /// Absolute stream position immediately after this bulk window.
    #[inline]
    pub const fn end_position(&self) -> usize {
        self.end_position
    }

    /// Copy this bulk window into caller-provided destination buffer. This operation will perform
    /// at most two raw copies if the window wraps around the ring buffer.
    ///
    /// On success reader position advances to `end_position`. On error reader position is left
    /// unchanged so the caller can decide how to recover.
    #[inline]
    pub fn copy_into(self, dst: &mut [u8]) -> Result<usize> {
        if dst.len() < self.len {
            return Err(Error::insufficient_buffer_size(dst.len(), self.len));
        }

        let start_index = self.start_position & (self.reader.ring.capacity - 1);
        let first_len = min(self.len, self.reader.ring.capacity - start_index);
        let data_ptr = self.reader.ring.header().data_ptr();

        unsafe {
            copy_nonoverlapping(data_ptr.add(start_index), dst.as_mut_ptr(), first_len);
            if self.len > first_len {
                copy_nonoverlapping(data_ptr, dst.as_mut_ptr().add(first_len), self.len - first_len);
            }
        }

        let producer_position_after = self.reader.ring.header().producer_position.load(Ordering::Acquire);
        if producer_position_after.wrapping_sub(self.start_position) > self.reader.ring.capacity {
            return Err(Error::overrun(self.start_position));
        }

        self.reader.position.set(self.end_position);
        Ok(self.len)
    }

    /// Copy this bulk window into caller-provided destination buffer and return an iterator over
    /// the copied data using the default unaligned parsing policy.
    #[inline]
    pub fn into_iter(self, dst: &mut [u8]) -> Result<BulkIter<'_, Unaligned>> {
        let start_position = self.start_position;
        let len = self.copy_into(dst)?;
        Ok(BulkIter::<Unaligned>::new(&dst[..len], start_position))
    }

    /// Copy this bulk window into caller-provided destination buffer and return an iterator over
    /// the copied data using the aligned parsing policy.
    #[inline]
    pub fn into_iter_aligned(self, dst: &mut [u8]) -> Result<BulkIter<'_, Aligned>> {
        debug_assert_eq!(
            dst.as_ptr().align_offset(align_of::<FrameHeader>()),
            0,
            "bulk buffer is not aligned to FrameHeader",
        );
        let start_position = self.start_position;
        let len = self.copy_into(dst)?;
        Ok(BulkIter::<Aligned>::new(&dst[..len], start_position))
    }
}

/// Parsed message view produced from a raw bulk buffer.
pub struct BulkMessage<'a> {
    /// Absolute stream position within the original stream. Marks beginning of message header.
    pub stream_position: usize,
    /// Message length.
    pub payload_len: usize,
    /// User defined field.
    pub user_defined: u32,
    /// Indicates final message fragment.
    pub is_fin: bool,
    /// Indicates continuation frame.
    pub is_continuation: bool,
    /// Indicates heartbeat frame.
    pub is_heartbeat: bool,
    /// Message payload copied out of the ring buffer.
    pub payload: &'a [u8],
}

/// Marker indicating raw bulk bytes may be unaligned and must be parsed with unaligned loads.
pub struct Unaligned;

/// Marker indicating raw bulk bytes are aligned to `FrameHeader` alignment.
pub struct Aligned;

/// Iterator over messages contained in a raw bulk buffer produced by `Bulk::copy_into()`.
/// Padding frames are skipped automatically.
pub struct BulkIter<'a, Policy = Unaligned> {
    bytes: &'a [u8],
    start_position: usize,
    index: usize,
    policy: PhantomData<Policy>,
}

impl<'a, Policy> BulkIter<'a, Policy> {
    /// Construct iterator over raw bulk bytes. `start_position` must match the bulk window start.
    #[inline]
    pub const fn new(bytes: &'a [u8], start_position: usize) -> Self {
        Self {
            bytes,
            start_position,
            index: 0,
            policy: PhantomData,
        }
    }
}

impl<'a, Policy> BulkIter<'a, Policy> {
    fn next_impl(&mut self, read_header: unsafe fn(*const u8) -> (u32, u32)) -> Option<BulkMessage<'a>> {
        while self.index < self.bytes.len() {
            let header_end = self.index + size_of::<FrameHeader>();
            if header_end > self.bytes.len() {
                return None;
            }

            let header_ptr = unsafe { self.bytes.as_ptr().add(self.index) };
            let (fields, user_defined) = unsafe { read_header(header_ptr) };
            let (is_fin, is_continuation, is_padding, is_heartbeat, payload_len) = unpack_fields(fields);
            let payload_len = payload_len as usize;
            let aligned_payload_len = get_aligned_size(payload_len);
            let frame_len = size_of::<FrameHeader>() + aligned_payload_len;
            let payload_start = self.index + size_of::<FrameHeader>();
            let payload_end = payload_start + payload_len;
            let stream_position = self.start_position + self.index;

            if payload_end > self.bytes.len() || self.index + frame_len > self.bytes.len() {
                return None;
            }

            self.index += frame_len;

            if is_padding {
                continue;
            }

            return Some(BulkMessage {
                stream_position,
                payload_len,
                user_defined,
                is_fin,
                is_continuation,
                is_heartbeat,
                payload: &self.bytes[payload_start..payload_end],
            });
        }

        None
    }
}

#[inline]
const unsafe fn read_bulk_header_unaligned(ptr: *const u8) -> (u32, u32) {
    let fields = unsafe { read_unaligned(ptr as *const u32) };
    let user_defined = unsafe { read_unaligned(ptr.add(size_of::<u32>()) as *const u32) };
    (fields, user_defined)
}

#[inline]
const unsafe fn read_bulk_header_aligned(ptr: *const u8) -> (u32, u32) {
    let header = unsafe { &*(ptr as *const FrameHeader) };
    (header.fields.get(), header.user_defined.get())
}

impl<'a> Iterator for BulkIter<'a, Unaligned> {
    type Item = BulkMessage<'a>;

    fn next(&mut self) -> Option<Self::Item> {
        self.next_impl(read_bulk_header_unaligned)
    }
}

impl<'a> Iterator for BulkIter<'a, Aligned> {
    type Item = BulkMessage<'a>;

    fn next(&mut self) -> Option<Self::Item> {
        self.next_impl(read_bulk_header_aligned)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::error::Error;
    use crate::util::AlignedBytes;
    use aligned_vec::avec;
    use rand::{Rng, thread_rng};
    use std::ptr::addr_of;
    use std::sync::atomic::Ordering::SeqCst;

    #[test]
    fn should_read_messages_in_batch() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let mut claim = writer.claim(5, true);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.claim(5, true);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let mut iter = reader.read_batch().unwrap().into_iter();

        let msg = iter.next().unwrap().unwrap();
        let mut payload = [0u8; 1024];
        msg.read(&mut payload).unwrap();
        let payload = &payload[..msg.payload_len];
        assert_eq!(payload, b"hello");

        let msg = iter.next().unwrap().unwrap();
        let mut payload = [0u8; 1024];
        msg.read(&mut payload).unwrap();
        let payload = &payload[..msg.payload_len];
        assert_eq!(payload, b"world");

        assert_eq!(32, writer.index());
        assert_eq!(32, writer.remaining());
        assert_eq!(32, iter.batch.reader.index());

        assert!(iter.next().is_none());

        assert_eq!(32, iter.batch.reader.index());
        assert_eq!(32, iter.batch.reader.position.get());
        assert_eq!(32, writer.position.get());
        assert_eq!(32, writer.remaining());

        let claim = writer.claim(15, true);
        claim.commit();

        assert_eq!(56, writer.index());
        assert_eq!(56, writer.position.get());

        let mut claim = writer.claim(4, true);
        claim.get_buffer_mut().copy_from_slice(b"test");
        claim.commit();

        let mut iter = reader.read_batch().unwrap().into_iter();

        // skip big message
        let _ = iter.next().unwrap().unwrap();
        let msg = iter.next().unwrap().unwrap();

        let mut payload = [0u8; 1024];
        msg.read(&mut payload).unwrap();
        let payload = &payload[..msg.payload_len];
        assert_eq!(payload, b"test");

        assert!(iter.next().is_none());

        assert_eq!(reader.index(), writer.index());
        assert_eq!(reader.position.get(), writer.position.get());
    }

    #[test]
    fn should_read_bulk() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        let mut claim = writer.claim(5, true);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.claim(5, true);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        assert_eq!(32, bulk.len());
        assert_eq!(0, bulk.start_position());
        assert_eq!(32, bulk.end_position());

        let mut dst = vec![0_u8; bulk.len()];
        assert_eq!(32, bulk.copy_into(&mut dst).unwrap());
        assert_eq!(&bytes[HEADER_SIZE..HEADER_SIZE + 32], dst.as_slice());
        assert_eq!(32, reader.position.get());
    }

    #[test]
    fn should_iterate_bulk_messages() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        let mut claim = writer.claim_with_user_defined(5, true, 100);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.heartbeat_with_payload_and_user_defined(5, 200);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let start_position = bulk.start_position();
        let mut dst = vec![0_u8; bulk.len()];
        let len = bulk.copy_into(&mut dst).unwrap();

        let mut iter = BulkIter::<Unaligned>::new(&dst[..len], start_position);

        let first = iter.next().unwrap();
        assert_eq!(0, first.stream_position);
        assert_eq!(100, first.user_defined);
        assert!(first.is_fin);
        assert!(!first.is_continuation);
        assert!(!first.is_heartbeat);
        assert_eq!(b"hello", first.payload);

        let second = iter.next().unwrap();
        assert_eq!(16, second.stream_position);
        assert_eq!(200, second.user_defined);
        assert!(second.is_fin);
        assert!(!second.is_continuation);
        assert!(second.is_heartbeat);
        assert_eq!(b"world", second.payload);

        assert!(iter.next().is_none());
    }

    #[test]
    fn should_iterate_bulk_messages_with_aligned_policy() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        let mut claim = writer.claim_with_user_defined(5, true, 100);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.heartbeat_with_payload_and_user_defined(5, 200);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let start_position = bulk.start_position();
        let mut dst = AlignedBytes::<32>::new();
        let len = bulk.copy_into(&mut dst).unwrap();

        let mut iter = BulkIter::<Aligned>::new(&dst[..len], start_position);

        let first = iter.next().unwrap();
        assert_eq!(0, first.stream_position);
        assert_eq!(100, first.user_defined);
        assert_eq!(b"hello", first.payload);

        let second = iter.next().unwrap();
        assert_eq!(16, second.stream_position);
        assert_eq!(200, second.user_defined);
        assert_eq!(b"world", second.payload);

        assert!(iter.next().is_none());
    }

    #[test]
    fn should_iterate_bulk_messages_via_bulk() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        let mut claim = writer.claim_with_user_defined(5, true, 100);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.heartbeat_with_payload_and_user_defined(5, 200);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let mut dst = vec![0_u8; bulk.len()];
        let mut iter = bulk.into_iter(&mut dst).unwrap();

        let first = iter.next().unwrap();
        assert_eq!(0, first.stream_position);
        assert_eq!(100, first.user_defined);
        assert_eq!(b"hello", first.payload);

        let second = iter.next().unwrap();
        assert_eq!(16, second.stream_position);
        assert_eq!(200, second.user_defined);
        assert_eq!(b"world", second.payload);

        assert!(iter.next().is_none());
        assert_eq!(32, reader.position.get());
    }

    #[test]
    fn should_iterate_bulk_messages_via_bulk_with_aligned_policy() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        let mut claim = writer.claim_with_user_defined(5, true, 100);
        claim.get_buffer_mut().copy_from_slice(b"hello");
        claim.commit();

        let mut claim = writer.heartbeat_with_payload_and_user_defined(5, 200);
        claim.get_buffer_mut().copy_from_slice(b"world");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let mut dst = AlignedBytes::<32>::new();
        let mut iter = bulk.into_iter_aligned(&mut dst).unwrap();

        let first = iter.next().unwrap();
        assert_eq!(0, first.stream_position);
        assert_eq!(100, first.user_defined);
        assert_eq!(b"hello", first.payload);

        let second = iter.next().unwrap();
        assert_eq!(16, second.stream_position);
        assert_eq!(200, second.user_defined);
        assert_eq!(b"world", second.payload);

        assert!(iter.next().is_none());
        assert_eq!(32, reader.position.get());
    }

    #[test]
    fn should_skip_padding_frames_in_bulk_iter() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(56);
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(56);

        let mut claim = writer.claim_with_user_defined(4, true, 300);
        claim.get_buffer_mut().copy_from_slice(b"test");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let start_position = bulk.start_position();
        let mut dst = vec![0_u8; bulk.len()];
        let len = bulk.copy_into(&mut dst).unwrap();

        let mut iter = BulkIter::<Unaligned>::new(&dst[..len], start_position);
        let msg = iter.next().unwrap();
        assert_eq!(64, msg.stream_position);
        assert_eq!(300, msg.user_defined);
        assert_eq!(b"test", msg.payload);
        assert!(iter.next().is_none());
    }

    #[test]
    fn should_read_wrapped_bulk() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(56);
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(56);

        let claim = writer.claim(0, true);
        claim.commit();

        let mut claim = writer.claim(4, true);
        claim.get_buffer_mut().copy_from_slice(b"test");
        claim.commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        assert_eq!(24, bulk.len());

        let mut dst = vec![0_u8; bulk.len()];
        assert_eq!(24, bulk.copy_into(&mut dst).unwrap());

        let mut expected = Vec::with_capacity(24);
        expected.extend_from_slice(&bytes[HEADER_SIZE + 56..HEADER_SIZE + 64]);
        expected.extend_from_slice(&bytes[HEADER_SIZE..HEADER_SIZE + 16]);

        assert_eq!(expected, dst);
        assert_eq!(16, reader.index());
        assert_eq!(80, reader.position.get());
    }

    #[test]
    fn should_overrun_read_bulk() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();

        let bulk = reader.read_bulk().unwrap();
        assert!(matches!(bulk, Err(Error::Overrun(0))));
        assert_eq!(0, reader.position.get());
    }

    #[test]
    fn should_allow_bulk_reader_to_recover_from_initial_overrun_after_reset() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 2048 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(usize::MAX - 2047);
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim_with_user_defined(1000, true, 100).commit();
        assert_eq!(100, reader.receive_next().unwrap().unwrap().user_defined);

        writer.claim_with_user_defined(1000, true, 101).commit();
        writer.claim_with_user_defined(512, true, 102).commit();

        let mut claim = writer.claim_with_user_defined(1000, true, 103);
        thread_rng().fill(claim.get_buffer_mut());
        claim.commit();

        assert!(matches!(reader.read_bulk().unwrap(), Err(Error::Overrun(_))));

        reader.reset();
        assert!(reader.read_bulk().is_none());
        assert_eq!(reader.position.get(), writer.position.get());

        let start_position = writer.position.get();
        writer.claim_with_user_defined(1000, true, 104).commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        assert_eq!(start_position, bulk.start_position());
        assert_eq!(writer.position.get(), bulk.end_position());
        let mut dst = vec![0_u8; bulk.len()];
        assert_eq!(bulk.len(), bulk.copy_into(&mut dst).unwrap());
        assert_eq!(writer.position.get(), reader.position.get());
    }

    #[test]
    fn should_error_if_bulk_overruns_during_copy() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 128 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        writer.claim(16, true).commit();
        writer.claim(16, true).commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let mut dst = vec![0_u8; bulk.len()];

        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();

        assert!(matches!(bulk.copy_into(&mut dst), Err(Error::Overrun(0))));
        assert_eq!(0, reader.position.get());
    }

    #[test]
    fn should_allow_bulk_reader_to_recover_from_copy_overrun_after_reset() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 128 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        writer.claim_with_user_defined(16, true, 100).commit();
        writer.claim_with_user_defined(16, true, 101).commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        let mut dst = vec![0_u8; bulk.len()];

        writer.claim_with_user_defined(16, true, 102).commit();
        writer.claim_with_user_defined(16, true, 103).commit();
        writer.claim_with_user_defined(16, true, 104).commit();
        writer.claim_with_user_defined(16, true, 105).commit();

        assert!(matches!(bulk.copy_into(&mut dst), Err(Error::Overrun(0))));
        assert_eq!(0, reader.position.get());

        reader.reset();
        assert!(reader.read_bulk().is_none());
        assert_eq!(reader.position.get(), writer.position.get());

        let start_position = writer.position.get();
        writer.claim_with_user_defined(16, true, 106).commit();

        let bulk = reader.read_bulk().unwrap().unwrap();
        assert_eq!(24, bulk.len());
        assert_eq!(start_position, bulk.start_position());
        assert_eq!(writer.position.get(), bulk.end_position());
        let mut dst = vec![0_u8; bulk.len()];
        assert_eq!(24, bulk.copy_into(&mut dst).unwrap());
        assert_eq!(writer.position.get(), reader.position.get());
    }

    #[test]
    fn should_read_in_batch_with_limit() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"a");
        claim.commit();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"b");
        claim.commit();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"c");
        claim.commit();

        let mut iter = reader.read_batch().unwrap().into_iter().take(2);

        let msg = iter.next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"a", &payload);

        let msg = iter.next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"b", &payload);

        assert!(iter.next().is_none());

        let mut iter = reader.read_batch().unwrap().into_iter();

        let msg = iter.next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"c", &payload);

        assert!(iter.next().is_none());
    }

    #[test]
    fn should_resume_batch_if_previous_not_consumed() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim_with_user_defined(0, true, 100).commit();
        writer.claim_with_user_defined(0, true, 200).commit();
        writer.claim_with_user_defined(0, true, 300).commit();
        writer.claim_with_user_defined(0, true, 400).commit();

        let mut iter = reader.read_batch().unwrap().into_iter();

        assert_eq!(100, iter.next().unwrap().unwrap().user_defined);
        assert_eq!(200, iter.next().unwrap().unwrap().user_defined);
        assert_eq!(300, iter.next().unwrap().unwrap().user_defined);

        let mut iter = reader.read_batch().unwrap().into_iter();
        assert_eq!(400, iter.next().unwrap().unwrap().user_defined);
        assert!(iter.next().is_none());
    }

    #[test]
    fn should_read_next_message_if_batch_not_consumed() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim_with_user_defined(0, true, 100).commit();
        writer.claim_with_user_defined(0, true, 200).commit();
        writer.claim_with_user_defined(0, true, 300).commit();
        writer.claim_with_user_defined(0, true, 400).commit();

        let mut iter = reader.read_batch().unwrap().into_iter();

        assert_eq!(100, iter.next().unwrap().unwrap().user_defined);
        assert_eq!(200, iter.next().unwrap().unwrap().user_defined);
        assert_eq!(300, iter.next().unwrap().unwrap().user_defined);

        assert_eq!(400, reader.receive_next().unwrap().unwrap().user_defined);
        assert!(reader.receive_next().is_none());
    }

    #[test]
    fn should_not_extend_batch_when_new_messages_arrive() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim_with_user_defined(0, true, 100).commit();
        writer.claim_with_user_defined(0, true, 200).commit();

        let mut iter = reader.read_batch().unwrap().into_iter();
        assert_eq!(100, iter.next().unwrap().unwrap().user_defined);

        writer.claim_with_user_defined(0, true, 300).commit();
        writer.claim_with_user_defined(0, true, 400).commit();

        assert_eq!(200, iter.next().unwrap().unwrap().user_defined);
        assert!(iter.next().is_none());

        let mut iter = reader.read_batch().unwrap().into_iter();
        assert_eq!(300, iter.next().unwrap().unwrap().user_defined);
        assert_eq!(400, iter.next().unwrap().unwrap().user_defined);
        assert!(iter.next().is_none());
    }

    #[test]
    fn should_read_next_message() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"a");
        claim.commit();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"b");
        claim.commit();

        let mut claim = writer.claim(1, true);
        claim.get_buffer_mut().copy_from_slice(b"c");
        claim.commit();

        let msg = reader.receive_next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"a", &payload);

        let msg = reader.receive_next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"b", &payload);

        let msg = reader.receive_next().unwrap().unwrap();
        let mut payload = [0u8; 1];
        msg.read(&mut payload).unwrap();
        assert_eq!(b"c", &payload);

        assert!(reader.receive_next().is_none());
    }

    #[test]
    fn should_overrun_reader() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();

        let msg = reader.receive_next().unwrap();
        assert!(matches!(msg.unwrap_err(), Error::Overrun(_)));
    }

    #[test]
    fn should_overrun_read_batch() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();
        writer.claim(16, true).commit();

        let mut iter = reader.read_batch().unwrap().into_iter();
        let msg = iter.next().unwrap();
        assert!(matches!(msg.unwrap_err(), Error::Overrun(_)));
    }

    #[test]
    #[should_panic(expected = "mtu exceeded")]
    fn should_error_if_mtu_exceeded() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        assert_eq!(24, writer.mtu());
        let _ = writer.claim(32, true);
    }

    #[test]
    fn should_start_read_from_last_producer_position() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();

        writer.claim(16, true).commit();

        assert_eq!(24, writer.position.get());
        assert_eq!(24, writer.index());

        let reader = RingBuffer::new(&bytes).into_reader();

        assert_eq!(reader.position.get(), writer.position.get());
        assert_eq!(reader.index(), writer.index());
    }

    #[test]
    fn should_pack_and_unpack_fields() {
        assert_eq!((true, true, true, true, 123), unpack_fields(pack_fields(true, true, true, true, 123)));
        assert_eq!((true, true, true, false, 123), unpack_fields(pack_fields(true, true, true, false, 123)));
        assert_eq!((true, true, false, false, 123), unpack_fields(pack_fields(true, true, false, false, 123)));
        assert_eq!((true, false, false, false, 123), unpack_fields(pack_fields(true, false, false, false, 123)));
        assert_eq!((false, false, false, false, 123), unpack_fields(pack_fields(false, false, false, false, 123)));
        assert_eq!((false, false, true, false, 123), unpack_fields(pack_fields(false, false, true, false, 123)));
        assert_eq!((false, true, false, true, 123), unpack_fields(pack_fields(false, true, false, true, 123)));
    }

    #[test]
    fn should_encode_and_decode_max_payload_len() {
        let frame = FrameHeader::new(MAX_PAYLOAD_LEN as u32, 0, true, false, false, false);
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(!frame.is_padding());
        assert!(!frame.is_heartbeat());
        assert_eq!(MAX_PAYLOAD_LEN as u32, frame.payload_len());
        assert_eq!(268435455, MAX_PAYLOAD_LEN);
        assert_eq!(
            (true, true, true, true, MAX_PAYLOAD_LEN as u32),
            unpack_fields(pack_fields(true, true, true, true, MAX_PAYLOAD_LEN as u32))
        );
    }

    #[test]
    fn should_align_frame_header() {
        assert_eq!(8, align_of::<FrameHeader>());
        assert_eq!(8, size_of::<FrameHeader>());

        let frame = FrameHeader::new(10, 0, true, false, false, true);
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(!frame.is_padding());
        assert!(frame.is_heartbeat());
        assert_eq!(10, frame.payload_len());

        let frame = FrameHeader::new(10, 0, true, false, true, false);
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(frame.is_padding());
        assert!(!frame.is_heartbeat());
        assert_eq!(10, frame.payload_len());

        let frame = FrameHeader::new(0, 0, true, false, false, true);
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(!frame.is_padding());
        assert!(frame.is_heartbeat());
        assert_eq!(0, frame.payload_len());

        let frame = FrameHeader::new(0, 0, true, false, true, false);
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(frame.is_padding());
        assert!(!frame.is_heartbeat());
        assert_eq!(0, frame.payload_len());

        let frame = FrameHeader::new_padding();
        assert!(frame.is_fin());
        assert!(!frame.is_continuation());
        assert!(frame.is_padding());
        assert!(!frame.is_heartbeat());
        assert_eq!(0, frame.payload_len());
    }

    #[test]
    fn should_insert_padding() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();

        assert_eq!(0, writer.index());

        let claim = writer.claim(10, true);
        assert_eq!(10, claim.get_buffer().len());
        claim.commit();

        assert_eq!(24, writer.index());
        assert_eq!(40, writer.remaining());

        let claim = writer.claim(5, true);
        assert_eq!(5, claim.get_buffer().len());
        claim.commit();

        assert_eq!(40, writer.index());
        assert_eq!(24, writer.remaining());

        let claim = writer.claim(17, true);
        assert_eq!(17, claim.get_buffer().len());
        claim.commit();

        assert_eq!(32, writer.index());
        assert_eq!(32, writer.remaining());
    }

    #[test]
    fn should_ensure_frame_alignment() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 1024 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();

        let producer_position_addr = addr_of!(writer.ring.header().producer_position) as usize;
        let ready_addr = addr_of!(writer.ring.header().ready) as usize;
        let metadata_addr = addr_of!(writer.ring.header().metadata) as usize;
        let data_addr = writer.ring.header().data_ptr() as usize;

        assert_eq!(METADATA_BUFFER_SIZE, data_addr - metadata_addr);
        // 128 for x86_64, 64 for x86
        assert_eq!(align_of::<CachePadded<()>>(), metadata_addr - ready_addr);
        assert_eq!(align_of::<CachePadded<()>>(), ready_addr - producer_position_addr);

        let header_ptr = writer.ring.header() as *const Header;
        let data_ptr = writer.ring.header().data_ptr();

        let claim = writer.claim(16, true);
        let buf_ptr_0 = claim.get_buffer().as_ptr();
        let frame_ptr_0 = claim.writer.frame_header() as *const FrameHeader;

        assert_eq!(size_of::<Header>() + size_of::<FrameHeader>(), buf_ptr_0 as usize - header_ptr as usize);
        assert_eq!(size_of::<FrameHeader>(), buf_ptr_0 as usize - data_ptr as usize);
        assert_eq!(16, claim.get_buffer().len());
        #[cfg(target_arch = "x86_64")]
        assert_eq!(1280, size_of::<Header>());
        #[cfg(target_arch = "x86")]
        assert_eq!(1152, size_of::<Header>());
        assert_eq!(8, size_of::<FrameHeader>());
        assert_eq!(8, align_of::<FrameHeader>());
        assert_eq!(size_of::<Header>(), frame_ptr_0 as usize - bytes.as_ptr() as usize);

        claim.commit();

        let claim = writer.claim(13, true);
        let buf_ptr_1 = claim.get_buffer().as_ptr();
        let frame_ptr_1 = claim.writer.frame_header() as *const FrameHeader;

        assert_eq!(size_of::<Header>() + 24, frame_ptr_1 as usize - bytes.as_ptr() as usize);
        assert_eq!(16 + size_of::<FrameHeader>(), buf_ptr_1 as usize - buf_ptr_0 as usize);
        assert_eq!(16 + size_of::<FrameHeader>(), frame_ptr_1 as usize - frame_ptr_0 as usize);

        claim.commit();
    }

    #[test]
    fn should_construct_ring_buffer() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let rb = RingBuffer::new(&bytes);
        assert_eq!(0, rb.header().producer_position.load(SeqCst));
        assert_eq!(64, rb.capacity);
    }

    #[test]
    fn should_construct_ring_buffer_from_vec() {
        let bytes = avec![[128] | 0u8; HEADER_SIZE + (1024 * 1024 * 2)];
        let rb = RingBuffer::new(&bytes);
        assert_eq!(0, rb.header().producer_position.load(SeqCst));
        assert_eq!(2097152, rb.capacity);
        assert_eq!(1048568, rb.mtu);
    }

    #[test]
    fn should_read_message_into_vec() {
        let bytes = avec![[128] | 0u8; HEADER_SIZE + 1024];
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let mut claim = writer.claim(11, true);
        claim.get_buffer_mut().copy_from_slice(b"hello world");
        claim.commit();

        let mut iter = reader.read_batch().unwrap().into_iter();
        let msg = iter.next().unwrap().unwrap();

        let mut payload = vec![0u8; 1024];
        unsafe { payload.set_len(msg.payload_len) };
        msg.read(&mut payload).unwrap();

        assert_eq!(payload, b"hello world");
    }

    #[test]
    fn should_send_zero_size_message() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let claim = writer.claim(0, true);
        claim.commit();

        let msg = reader.receive_next().unwrap().unwrap();
        assert_eq!(0, msg.payload_len);
    }

    #[test]
    fn should_send_heartbeat() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let claim = writer.heartbeat();
        claim.commit();

        let msg = reader.receive_next().unwrap().unwrap();
        assert_eq!(0, msg.payload_len);
        assert!(msg.is_fin);
        assert!(!msg.is_continuation);
        assert!(!msg.is_padding);
    }

    #[test]
    fn should_abort_publication() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        assert_eq!(0, writer.position.get());

        let claim = writer.claim(16, true);
        claim.abort();
        assert_eq!(0, writer.position.get());

        let claim = writer.claim(24, true);
        claim.commit();
        assert_eq!(32, writer.position.get());

        let claim = writer.claim(8, true);
        claim.commit();
        assert_eq!(48, writer.position.get());

        let claim = writer.claim(16, true);
        claim.abort();
        assert_eq!(48, writer.position.get()); // wll rollback padding frame
    }

    #[test]
    fn should_attach_metadata() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let _ = RingBuffer::new(&bytes).into_writer_with_metadata(|metadata| {
            assert_eq!(METADATA_BUFFER_SIZE, metadata.len());
            metadata[0..11].copy_from_slice(b"hello world");
        });
        let reader = RingBuffer::new(&bytes).into_reader();
        assert_eq!(b"hello world", &reader.metadata()[..11]);
    }

    #[test]
    fn should_skip_padding_frame() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let mut buffer = [0u8; 1024];
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let claim = writer.claim_with_user_defined(24, true, 123);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        msg.read(&mut buffer).unwrap();
        assert!(!msg.is_padding);

        let claim = writer.claim(8, true);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        msg.read(&mut buffer).unwrap();
        assert!(!msg.is_padding);

        let claim = writer.claim(24, true);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        msg.read(&mut buffer).unwrap();
        assert!(!msg.is_padding);

        let msg = reader.receive_next();
        assert!(msg.is_none())
    }

    #[test]
    fn should_fragment_message() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 64 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader();

        let claim = writer.claim_with_user_defined(24, false, 123);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        assert!(!msg.is_fin);
        assert!(!msg.is_continuation);
        assert!(!msg.is_padding);
        assert_eq!(123, msg.user_defined); // only attached to the first frame

        let claim = writer.continuation(8, false);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        assert!(!msg.is_fin);
        assert!(msg.is_continuation);
        assert!(!msg.is_padding);
        assert_eq!(USER_DEFINED_NULL_VALUE, msg.user_defined);

        let claim = writer.continuation(24, true);
        claim.commit();
        let msg = reader.receive_next().unwrap().unwrap();
        assert!(msg.is_fin);
        assert!(msg.is_continuation);
        assert!(!msg.is_padding);
        assert_eq!(USER_DEFINED_NULL_VALUE, msg.user_defined);

        let msg = reader.receive_next();
        assert!(msg.is_none())
    }

    #[test]
    fn should_join_writer() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 1024 }>::new();

        // first writer will write from the beginning
        {
            let writer = RingBuffer::new(&bytes).into_writer();
            writer.claim_with_user_defined(16, true, 100).commit();
            writer.claim_with_user_defined(16, true, 101).commit();
            writer.claim_with_user_defined(16, true, 102).commit();
        }

        // second writer will pick up from the current position
        {
            let writer = RingBuffer::new(&bytes).join_writer();
            writer.claim_with_user_defined(16, true, 103).commit();
            writer.claim_with_user_defined(16, true, 104).commit();
            writer.claim_with_user_defined(16, true, 105).commit();
        }

        // verify we got all the messages
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);
        assert_eq!(100, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(101, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(102, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(103, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(104, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(105, reader.receive_next().unwrap().unwrap().user_defined);
    }

    #[test]
    fn should_handle_position_wrap_around_if_no_overrun() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 2048 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(usize::MAX - 1023);
        // last claim before wrap around
        writer.claim_with_user_defined(1000, true, 100).commit();
        assert_eq!(usize::MAX - 15, writer.position.get());
        // first claim after wrap around, will insert padding frame and
        // continue from position zero
        writer.claim_with_user_defined(128, true, 101).commit();
        assert_eq!(136, writer.position.get());
        // a normal claim after wrap around
        writer.claim_with_user_defined(16, true, 102).commit();
        assert_eq!(160, writer.position.get());
        // verify we got all the messages
        let reader = RingBuffer::new(&bytes)
            .into_reader()
            .with_initial_position(usize::MAX - 1023);
        assert_eq!(100, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(101, reader.receive_next().unwrap().unwrap().user_defined);
        assert_eq!(102, reader.receive_next().unwrap().unwrap().user_defined);
        // and are still in sync
        assert_eq!(160, reader.position.get());
    }

    #[test]
    fn should_allow_reader_to_recover_from_overrun_when_position_wrapped_around() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 2048 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(usize::MAX - 2047);
        let reader = RingBuffer::new(&bytes).into_reader();

        // First claim and read
        writer.claim_with_user_defined(1000, true, 100).commit();
        assert_eq!(100, reader.receive_next().unwrap().unwrap().user_defined);

        // Last claim before wrap around
        writer.claim_with_user_defined(1000, true, 101).commit();

        // First claim after wrap around
        writer.claim_with_user_defined(512, true, 102).commit();

        // Overrun the reader and overwrite the header frame the reader will read
        let mut claim = writer.claim_with_user_defined(1000, true, 103);
        thread_rng().fill(claim.get_buffer_mut());
        claim.commit();

        assert!(matches!(reader.receive_next().unwrap().unwrap_err(), Error::Overrun(_)));
        // Reset the reader and start over
        reader.reset();
        assert!(reader.receive_next().is_none());
        // Continue writing and reading
        assert_eq!(reader.position.get(), writer.position.get());

        writer.claim_with_user_defined(1000, true, 104).commit();

        assert_eq!(104, reader.receive_next().unwrap().unwrap().user_defined);
    }

    #[test]
    fn should_allow_batch_reader_to_recover_from_overrun_when_position_wrapped_around() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 2048 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer_at(usize::MAX - 2047);
        let reader = RingBuffer::new(&bytes).into_reader();

        // First claim and read
        writer.claim_with_user_defined(1000, true, 100).commit();
        let mut iter = reader.read_batch().unwrap().into_iter();
        assert_eq!(100, iter.next().unwrap().unwrap().user_defined);

        // Last claim before wrap around
        writer.claim_with_user_defined(1000, true, 101).commit();

        // First claim after wrap around
        writer.claim_with_user_defined(512, true, 102).commit();

        // Overrun the reader and overwrite the header frame the reader will read
        let mut claim = writer.claim_with_user_defined(1000, true, 103);
        thread_rng().fill(claim.get_buffer_mut());
        claim.commit();

        let mut iter = reader.read_batch().unwrap().into_iter();
        assert!(matches!(iter.next().unwrap().unwrap_err(), Error::Overrun(_)));

        // Reset the reader and start over
        reader.reset();
        assert!(reader.read_batch().is_none());
        assert_eq!(reader.position.get(), writer.position.get());

        // Continue writing and reading through the batch API
        writer.claim_with_user_defined(1000, true, 104).commit();

        let mut iter = reader.read_batch().unwrap().into_iter();
        assert_eq!(104, iter.next().unwrap().unwrap().user_defined);
        assert!(iter.next().is_none());
    }

    #[test]
    fn should_not_overrun_batch_when_reader_has_not_been_lapped() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 128 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        for i in 0..4_u32 {
            writer.claim_with_user_defined(16, true, i).commit();
        }

        let mut batch = reader.read_batch().unwrap();
        assert_eq!(0, batch.receive_next().unwrap().unwrap().user_defined);

        writer.claim_with_user_defined(16, true, 100).commit();
        writer.claim_with_user_defined(16, true, 101).commit();

        // Reader has advanced by one frame, so message 1 should still be readable.
        assert_eq!(1, batch.receive_next().unwrap().unwrap().user_defined);
    }

    #[test]
    fn should_allow_receive_next_when_reader_has_not_been_lapped() {
        let bytes = AlignedBytes::<{ HEADER_SIZE + 128 }>::new();
        let writer = RingBuffer::new(&bytes).into_writer();
        let reader = RingBuffer::new(&bytes).into_reader().with_initial_position(0);

        for i in 0..4_u32 {
            writer.claim_with_user_defined(16, true, i).commit();
        }

        assert_eq!(0, reader.receive_next().unwrap().unwrap().user_defined);

        writer.claim_with_user_defined(16, true, 100).commit();
        writer.claim_with_user_defined(16, true, 101).commit();

        // This is the control case for the batch repro above.
        assert_eq!(1, reader.receive_next().unwrap().unwrap().user_defined);
    }
}