| ... | ... | @@ -1594,28 +1594,34 @@ pub const BufferGroup = struct { |
| 1594 | 1594 | buffers: []u8, |
| 1595 | 1595 | /// Size of each buffer in buffers. |
| 1596 | 1596 | buffer_size: u32, |
| 1597 | | // Number of buffers in `buffers`, number of `io_uring_buf structures` in br. |
| 1597 | /// Number of buffers in `buffers`, number of `io_uring_buf structures` in br. |
| 1598 | 1598 | buffers_count: u16, |
| 1599 | /// Head of unconsumed part of each buffer, if incremental consumption is enabled |
| 1600 | heads: []u32, |
| 1599 | 1601 | /// ID of this group, must be unique in ring. |
| 1600 | 1602 | group_id: u16, |
| 1601 | 1603 | |
| 1602 | 1604 | pub fn init( |
| 1603 | 1605 | ring: *IoUring, |
| 1606 | allocator: mem.Allocator, |
| 1604 | 1607 | group_id: u16, |
| 1605 | | buffers: []u8, |
| 1606 | 1608 | buffer_size: u32, |
| 1607 | 1609 | buffers_count: u16, |
| 1608 | 1610 | ) !BufferGroup { |
| 1609 | | assert(buffers.len == buffers_count * buffer_size); |
| 1611 | const buffers = try allocator.alloc(u8, buffer_size * buffers_count); |
| 1612 | errdefer allocator.free(buffers); |
| 1613 | const heads = try allocator.alloc(u32, buffers_count); |
| 1614 | errdefer allocator.free(heads); |
| 1610 | 1615 | |
| 1611 | | const br = try setup_buf_ring(ring.fd, buffers_count, group_id); |
| 1616 | const br = try setup_buf_ring(ring.fd, buffers_count, group_id, linux.io_uring_buf_reg.FLAG.INC); |
| 1612 | 1617 | buf_ring_init(br); |
| 1613 | 1618 | |
| 1614 | 1619 | const mask = buf_ring_mask(buffers_count); |
| 1615 | 1620 | var i: u16 = 0; |
| 1616 | 1621 | while (i < buffers_count) : (i += 1) { |
| 1617 | | const start = buffer_size * i; |
| 1618 | | const buf = buffers[start .. start + buffer_size]; |
| 1622 | const pos = buffer_size * i; |
| 1623 | const buf = buffers[pos .. pos + buffer_size]; |
| 1624 | heads[i] = 0; |
| 1619 | 1625 | buf_ring_add(br, buf, i, mask, i); |
| 1620 | 1626 | } |
| 1621 | 1627 | buf_ring_advance(br, buffers_count); |
| ... | ... | @@ -1625,11 +1631,18 @@ pub const BufferGroup = struct { |
| 1625 | 1631 | .group_id = group_id, |
| 1626 | 1632 | .br = br, |
| 1627 | 1633 | .buffers = buffers, |
| 1634 | .heads = heads, |
| 1628 | 1635 | .buffer_size = buffer_size, |
| 1629 | 1636 | .buffers_count = buffers_count, |
| 1630 | 1637 | }; |
| 1631 | 1638 | } |
| 1632 | 1639 | |
| 1640 | pub fn deinit(self: *BufferGroup, allocator: mem.Allocator) void { |
| 1641 | free_buf_ring(self.ring.fd, self.br, self.buffers_count, self.group_id); |
| 1642 | allocator.free(self.buffers); |
| 1643 | allocator.free(self.heads); |
| 1644 | } |
| 1645 | |
| 1633 | 1646 | // Prepare recv operation which will select buffer from this group. |
| 1634 | 1647 | pub fn recv(self: *BufferGroup, user_data: u64, fd: posix.fd_t, flags: u32) !*linux.io_uring_sqe { |
| 1635 | 1648 | var sqe = try self.ring.get_sqe(); |
| ... | ... | @@ -1649,33 +1662,34 @@ pub const BufferGroup = struct { |
| 1649 | 1662 | } |
| 1650 | 1663 | |
| 1651 | 1664 | // Get buffer by id. |
| 1652 | | pub fn get(self: *BufferGroup, buffer_id: u16) []u8 { |
| 1653 | | const head = self.buffer_size * buffer_id; |
| 1654 | | return self.buffers[head .. head + self.buffer_size]; |
| 1665 | fn get_by_id(self: *BufferGroup, buffer_id: u16) []u8 { |
| 1666 | const pos = self.buffer_size * buffer_id; |
| 1667 | return self.buffers[pos .. pos + self.buffer_size][self.heads[buffer_id]..]; |
| 1655 | 1668 | } |
| 1656 | 1669 | |
| 1657 | 1670 | // Get buffer by CQE. |
| 1658 | | pub fn get_cqe(self: *BufferGroup, cqe: linux.io_uring_cqe) ![]u8 { |
| 1671 | pub fn get(self: *BufferGroup, cqe: linux.io_uring_cqe) ![]u8 { |
| 1659 | 1672 | const buffer_id = try cqe.buffer_id(); |
| 1660 | 1673 | const used_len = @as(usize, @intCast(cqe.res)); |
| 1661 | | return self.get(buffer_id)[0..used_len]; |
| 1662 | | } |
| 1663 | | |
| 1664 | | // Release buffer to the kernel. |
| 1665 | | pub fn put(self: *BufferGroup, buffer_id: u16) void { |
| 1666 | | const mask = buf_ring_mask(self.buffers_count); |
| 1667 | | const buffer = self.get(buffer_id); |
| 1668 | | buf_ring_add(self.br, buffer, buffer_id, mask, 0); |
| 1669 | | buf_ring_advance(self.br, 1); |
| 1674 | return self.get_by_id(buffer_id)[0..used_len]; |
| 1670 | 1675 | } |
| 1671 | 1676 | |
| 1672 | 1677 | // Release buffer from CQE to the kernel. |
| 1673 | | pub fn put_cqe(self: *BufferGroup, cqe: linux.io_uring_cqe) !void { |
| 1674 | | self.put(try cqe.buffer_id()); |
| 1675 | | } |
| 1678 | pub fn put(self: *BufferGroup, cqe: linux.io_uring_cqe) !void { |
| 1679 | const buffer_id = try cqe.buffer_id(); |
| 1680 | if (cqe.flags & linux.IORING_CQE_F_BUF_MORE == linux.IORING_CQE_F_BUF_MORE) { |
| 1681 | // Incremental consumption active, kernel will write to the this buffer again |
| 1682 | const used_len = @as(u32, @intCast(cqe.res)); |
| 1683 | // Track what part of the buffer is used |
| 1684 | self.heads[buffer_id] += used_len; |
| 1685 | return; |
| 1686 | } |
| 1687 | self.heads[buffer_id] = 0; |
| 1676 | 1688 | |
| 1677 | | pub fn deinit(self: *BufferGroup) void { |
| 1678 | | free_buf_ring(self.ring.fd, self.br, self.buffers_count, self.group_id); |
| 1689 | // Release buffer to the kernel. const mask = buf_ring_mask(self.buffers_count); |
| 1690 | const mask = buf_ring_mask(self.buffers_count); |
| 1691 | buf_ring_add(self.br, self.get_by_id(buffer_id), buffer_id, mask, 0); |
| 1692 | buf_ring_advance(self.br, 1); |
| 1679 | 1693 | } |
| 1680 | 1694 | }; |
| 1681 | 1695 | |
| ... | ... | @@ -1684,7 +1698,7 @@ pub const BufferGroup = struct { |
| 1684 | 1698 | /// `fd` is IO_Uring.fd for which the provided buffer ring is being registered. |
| 1685 | 1699 | /// `entries` is the number of entries requested in the buffer ring, must be power of 2. |
| 1686 | 1700 | /// `group_id` is the chosen buffer group ID, unique in IO_Uring. |
| 1687 | | pub fn setup_buf_ring(fd: posix.fd_t, entries: u16, group_id: u16) !*align(page_size_min) linux.io_uring_buf_ring { |
| 1701 | pub fn setup_buf_ring(fd: posix.fd_t, entries: u16, group_id: u16, flags: u16) !*align(page_size_min) linux.io_uring_buf_ring { |
| 1688 | 1702 | if (entries == 0 or entries > 1 << 15) return error.EntriesNotInRange; |
| 1689 | 1703 | if (!std.math.isPowerOfTwo(entries)) return error.EntriesNotPowerOfTwo; |
| 1690 | 1704 | |
| ... | ... | @@ -1701,22 +1715,24 @@ pub fn setup_buf_ring(fd: posix.fd_t, entries: u16, group_id: u16) !*align(page_ |
| 1701 | 1715 | assert(mmap.len == mmap_size); |
| 1702 | 1716 | |
| 1703 | 1717 | const br: *align(page_size_min) linux.io_uring_buf_ring = @ptrCast(mmap.ptr); |
| 1704 | | try register_buf_ring(fd, @intFromPtr(br), entries, group_id); |
| 1718 | try register_buf_ring(fd, @intFromPtr(br), entries, group_id, flags); |
| 1705 | 1719 | return br; |
| 1706 | 1720 | } |
| 1707 | 1721 | |
| 1708 | | fn register_buf_ring(fd: posix.fd_t, addr: u64, entries: u32, group_id: u16) !void { |
| 1722 | fn register_buf_ring(fd: posix.fd_t, addr: u64, entries: u32, group_id: u16, flags: u16) !void { |
| 1709 | 1723 | var reg = mem.zeroInit(linux.io_uring_buf_reg, .{ |
| 1710 | 1724 | .ring_addr = addr, |
| 1711 | 1725 | .ring_entries = entries, |
| 1712 | 1726 | .bgid = group_id, |
| 1727 | .flags = flags, |
| 1713 | 1728 | }); |
| 1714 | | const res = linux.io_uring_register( |
| 1715 | | fd, |
| 1716 | | .REGISTER_PBUF_RING, |
| 1717 | | @as(*const anyopaque, @ptrCast(&reg)), |
| 1718 | | 1, |
| 1719 | | ); |
| 1729 | var res = linux.io_uring_register(fd, .REGISTER_PBUF_RING, @as(*const anyopaque, @ptrCast(&reg)), 1); |
| 1730 | if (linux.E.init(res) == .INVAL and reg.flags & linux.io_uring_buf_reg.FLAG.INC > 0) { |
| 1731 | // Retry without incremental buffer consumption. |
| 1732 | // It is available since kernel 6.12. returns INVAL on older. |
| 1733 | reg.flags &= ~linux.io_uring_buf_reg.FLAG.INC; |
| 1734 | res = linux.io_uring_register(fd, .REGISTER_PBUF_RING, @as(*const anyopaque, @ptrCast(&reg)), 1); |
| 1735 | } |
| 1720 | 1736 | try handle_register_buf_ring_result(res); |
| 1721 | 1737 | } |
| 1722 | 1738 | |
| ... | ... | @@ -4041,12 +4057,10 @@ test BufferGroup { |
| 4041 | 4057 | const group_id: u16 = 1; // buffers group id |
| 4042 | 4058 | const buffers_count: u16 = 1; // number of buffers in buffer group |
| 4043 | 4059 | const buffer_size: usize = 128; // size of each buffer in group |
| 4044 | | const buffers = try testing.allocator.alloc(u8, buffers_count * buffer_size); |
| 4045 | | defer testing.allocator.free(buffers); |
| 4046 | 4060 | var buf_grp = BufferGroup.init( |
| 4047 | 4061 | &ring, |
| 4062 | testing.allocator, |
| 4048 | 4063 | group_id, |
| 4049 | | buffers, |
| 4050 | 4064 | buffer_size, |
| 4051 | 4065 | buffers_count, |
| 4052 | 4066 | ) catch |err| switch (err) { |
| ... | ... | @@ -4054,7 +4068,7 @@ test BufferGroup { |
| 4054 | 4068 | error.ArgumentsInvalid => return error.SkipZigTest, |
| 4055 | 4069 | else => return err, |
| 4056 | 4070 | }; |
| 4057 | | defer buf_grp.deinit(); |
| 4071 | defer buf_grp.deinit(testing.allocator); |
| 4058 | 4072 | |
| 4059 | 4073 | // Create client/server fds |
| 4060 | 4074 | const fds = try createSocketTestHarness(&ring); |
| ... | ... | @@ -4085,14 +4099,11 @@ test BufferGroup { |
| 4085 | 4099 | try testing.expectEqual(posix.E.SUCCESS, cqe.err()); |
| 4086 | 4100 | try testing.expectEqual(data.len, @as(usize, @intCast(cqe.res))); // cqe.res holds received data len |
| 4087 | 4101 | |
| 4088 | | // Read buffer_id and used buffer len from cqe |
| 4089 | | const buffer_id = try cqe.buffer_id(); |
| 4090 | | const len: usize = @intCast(cqe.res); |
| 4091 | 4102 | // Get buffer from pool |
| 4092 | | const buf = buf_grp.get(buffer_id)[0..len]; |
| 4103 | const buf = try buf_grp.get(cqe); |
| 4093 | 4104 | try testing.expectEqualSlices(u8, &data, buf); |
| 4094 | 4105 | // Release buffer to the kernel when application is done with it |
| 4095 | | buf_grp.put(buffer_id); |
| 4106 | try buf_grp.put(cqe); |
| 4096 | 4107 | } |
| 4097 | 4108 | } |
| 4098 | 4109 | |
| ... | ... | @@ -4110,12 +4121,10 @@ test "ring mapped buffers recv" { |
| 4110 | 4121 | const group_id: u16 = 1; // buffers group id |
| 4111 | 4122 | const buffers_count: u16 = 2; // number of buffers in buffer group |
| 4112 | 4123 | const buffer_size: usize = 4; // size of each buffer in group |
| 4113 | | const buffers = try testing.allocator.alloc(u8, buffers_count * buffer_size); |
| 4114 | | defer testing.allocator.free(buffers); |
| 4115 | 4124 | var buf_grp = BufferGroup.init( |
| 4116 | 4125 | &ring, |
| 4126 | testing.allocator, |
| 4117 | 4127 | group_id, |
| 4118 | | buffers, |
| 4119 | 4128 | buffer_size, |
| 4120 | 4129 | buffers_count, |
| 4121 | 4130 | ) catch |err| switch (err) { |
| ... | ... | @@ -4123,7 +4132,7 @@ test "ring mapped buffers recv" { |
| 4123 | 4132 | error.ArgumentsInvalid => return error.SkipZigTest, |
| 4124 | 4133 | else => return err, |
| 4125 | 4134 | }; |
| 4126 | | defer buf_grp.deinit(); |
| 4135 | defer buf_grp.deinit(testing.allocator); |
| 4127 | 4136 | |
| 4128 | 4137 | // create client/server fds |
| 4129 | 4138 | const fds = try createSocketTestHarness(&ring); |
| ... | ... | @@ -4145,14 +4154,18 @@ test "ring mapped buffers recv" { |
| 4145 | 4154 | if (cqe_send.err() == .INVAL) return error.SkipZigTest; |
| 4146 | 4155 | try testing.expectEqual(linux.io_uring_cqe{ .user_data = user_data, .res = data.len, .flags = 0 }, cqe_send); |
| 4147 | 4156 | } |
| 4148 | | |
| 4149 | | // server reads data into provided buffers |
| 4150 | | // there are 2 buffers of size 4, so each read gets only chunk of data |
| 4151 | | // we read four chunks of 4, 4, 4, 3 bytes each |
| 4152 | | var chunk: []const u8 = data[0..buffer_size]; // first chunk |
| 4153 | | const id1 = try expect_buf_grp_recv(&ring, &buf_grp, fds.server, rnd.int(u64), chunk); |
| 4154 | | chunk = data[buffer_size .. buffer_size * 2]; // second chunk |
| 4155 | | const id2 = try expect_buf_grp_recv(&ring, &buf_grp, fds.server, rnd.int(u64), chunk); |
| 4157 | var pos: usize = 0; |
| 4158 | |
| 4159 | // read first chunk |
| 4160 | const cqe1 = try buf_grp_recv_submit_get_cqe(&ring, &buf_grp, fds.server, rnd.int(u64)); |
| 4161 | var buf = try buf_grp.get(cqe1); |
| 4162 | try testing.expectEqualSlices(u8, data[pos..][0..buf.len], buf); |
| 4163 | pos += buf.len; |
| 4164 | // second chunk |
| 4165 | const cqe2 = try buf_grp_recv_submit_get_cqe(&ring, &buf_grp, fds.server, rnd.int(u64)); |
| 4166 | buf = try buf_grp.get(cqe2); |
| 4167 | try testing.expectEqualSlices(u8, data[pos..][0..buf.len], buf); |
| 4168 | pos += buf.len; |
| 4156 | 4169 | |
| 4157 | 4170 | // both buffers provided to the kernel are used so we get error |
| 4158 | 4171 | // 'no more buffers', until we put buffers to the kernel |
| ... | ... | @@ -4169,16 +4182,17 @@ test "ring mapped buffers recv" { |
| 4169 | 4182 | } |
| 4170 | 4183 | |
| 4171 | 4184 | // put buffers back to the kernel |
| 4172 | | buf_grp.put(id1); |
| 4173 | | buf_grp.put(id2); |
| 4174 | | |
| 4175 | | chunk = data[buffer_size * 2 .. buffer_size * 3]; // third chunk |
| 4176 | | const id3 = try expect_buf_grp_recv(&ring, &buf_grp, fds.server, rnd.int(u64), chunk); |
| 4177 | | buf_grp.put(id3); |
| 4178 | | |
| 4179 | | chunk = data[buffer_size * 3 ..]; // last chunk |
| 4180 | | const id4 = try expect_buf_grp_recv(&ring, &buf_grp, fds.server, rnd.int(u64), chunk); |
| 4181 | | buf_grp.put(id4); |
| 4185 | try buf_grp.put(cqe1); |
| 4186 | try buf_grp.put(cqe2); |
| 4187 | |
| 4188 | // read remaining data |
| 4189 | while (pos < data.len) { |
| 4190 | const cqe = try buf_grp_recv_submit_get_cqe(&ring, &buf_grp, fds.server, rnd.int(u64)); |
| 4191 | buf = try buf_grp.get(cqe); |
| 4192 | try testing.expectEqualSlices(u8, data[pos..][0..buf.len], buf); |
| 4193 | pos += buf.len; |
| 4194 | try buf_grp.put(cqe); |
| 4195 | } |
| 4182 | 4196 | } |
| 4183 | 4197 | } |
| 4184 | 4198 | |
| ... | ... | @@ -4196,12 +4210,10 @@ test "ring mapped buffers multishot recv" { |
| 4196 | 4210 | const group_id: u16 = 1; // buffers group id |
| 4197 | 4211 | const buffers_count: u16 = 2; // number of buffers in buffer group |
| 4198 | 4212 | const buffer_size: usize = 4; // size of each buffer in group |
| 4199 | | const buffers = try testing.allocator.alloc(u8, buffers_count * buffer_size); |
| 4200 | | defer testing.allocator.free(buffers); |
| 4201 | 4213 | var buf_grp = BufferGroup.init( |
| 4202 | 4214 | &ring, |
| 4215 | testing.allocator, |
| 4203 | 4216 | group_id, |
| 4204 | | buffers, |
| 4205 | 4217 | buffer_size, |
| 4206 | 4218 | buffers_count, |
| 4207 | 4219 | ) catch |err| switch (err) { |
| ... | ... | @@ -4209,7 +4221,7 @@ test "ring mapped buffers multishot recv" { |
| 4209 | 4221 | error.ArgumentsInvalid => return error.SkipZigTest, |
| 4210 | 4222 | else => return err, |
| 4211 | 4223 | }; |
| 4212 | | defer buf_grp.deinit(); |
| 4224 | defer buf_grp.deinit(testing.allocator); |
| 4213 | 4225 | |
| 4214 | 4226 | // create client/server fds |
| 4215 | 4227 | const fds = try createSocketTestHarness(&ring); |
| ... | ... | @@ -4222,7 +4234,7 @@ test "ring mapped buffers multishot recv" { |
| 4222 | 4234 | var round: usize = 4; // repeat send/recv cycle round times |
| 4223 | 4235 | while (round > 0) : (round -= 1) { |
| 4224 | 4236 | // client sends data |
| 4225 | | const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0xa, 0xb, 0xc, 0xd, 0xe }; |
| 4237 | const data = [_]u8{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0xa, 0xb, 0xc, 0xd, 0xe, 0xf }; |
| 4226 | 4238 | { |
| 4227 | 4239 | const user_data = rnd.int(u64); |
| 4228 | 4240 | _ = try ring.send(user_data, fds.client, data[0..], 0); |
| ... | ... | @@ -4239,7 +4251,7 @@ test "ring mapped buffers multishot recv" { |
| 4239 | 4251 | |
| 4240 | 4252 | // server reads data into provided buffers |
| 4241 | 4253 | // there are 2 buffers of size 4, so each read gets only chunk of data |
| 4242 | | // we read four chunks of 4, 4, 4, 3 bytes each |
| 4254 | // we read four chunks of 4, 4, 4, 4 bytes each |
| 4243 | 4255 | var chunk: []const u8 = data[0..buffer_size]; // first chunk |
| 4244 | 4256 | const cqe1 = try expect_buf_grp_cqe(&ring, &buf_grp, recv_user_data, chunk); |
| 4245 | 4257 | try testing.expect(cqe1.flags & linux.IORING_CQE_F_MORE > 0); |
| ... | ... | @@ -4263,8 +4275,8 @@ test "ring mapped buffers multishot recv" { |
| 4263 | 4275 | } |
| 4264 | 4276 | |
| 4265 | 4277 | // put buffers back to the kernel |
| 4266 | | buf_grp.put(try cqe1.buffer_id()); |
| 4267 | | buf_grp.put(try cqe2.buffer_id()); |
| 4278 | try buf_grp.put(cqe1); |
| 4279 | try buf_grp.put(cqe2); |
| 4268 | 4280 | |
| 4269 | 4281 | // restart multishot |
| 4270 | 4282 | recv_user_data = rnd.int(u64); |
| ... | ... | @@ -4274,12 +4286,12 @@ test "ring mapped buffers multishot recv" { |
| 4274 | 4286 | chunk = data[buffer_size * 2 .. buffer_size * 3]; // third chunk |
| 4275 | 4287 | const cqe3 = try expect_buf_grp_cqe(&ring, &buf_grp, recv_user_data, chunk); |
| 4276 | 4288 | try testing.expect(cqe3.flags & linux.IORING_CQE_F_MORE > 0); |
| 4277 | | buf_grp.put(try cqe3.buffer_id()); |
| 4289 | try buf_grp.put(cqe3); |
| 4278 | 4290 | |
| 4279 | 4291 | chunk = data[buffer_size * 3 ..]; // last chunk |
| 4280 | 4292 | const cqe4 = try expect_buf_grp_cqe(&ring, &buf_grp, recv_user_data, chunk); |
| 4281 | 4293 | try testing.expect(cqe4.flags & linux.IORING_CQE_F_MORE > 0); |
| 4282 | | buf_grp.put(try cqe4.buffer_id()); |
| 4294 | try buf_grp.put(cqe4); |
| 4283 | 4295 | |
| 4284 | 4296 | // cancel pending multishot recv operation |
| 4285 | 4297 | { |
| ... | ... | @@ -4323,23 +4335,26 @@ test "ring mapped buffers multishot recv" { |
| 4323 | 4335 | } |
| 4324 | 4336 | } |
| 4325 | 4337 | |
| 4326 | | // Prepare and submit recv using buffer group. |
| 4327 | | // Test that buffer from group, pointed by cqe, matches expected. |
| 4328 | | fn expect_buf_grp_recv( |
| 4338 | // Prepare, submit recv and get cqe using buffer group. |
| 4339 | fn buf_grp_recv_submit_get_cqe( |
| 4329 | 4340 | ring: *IoUring, |
| 4330 | 4341 | buf_grp: *BufferGroup, |
| 4331 | 4342 | fd: posix.fd_t, |
| 4332 | 4343 | user_data: u64, |
| 4333 | | expected: []const u8, |
| 4334 | | ) !u16 { |
| 4335 | | // prepare and submit read |
| 4344 | ) !linux.io_uring_cqe { |
| 4345 | // prepare and submit recv |
| 4336 | 4346 | const sqe = try buf_grp.recv(user_data, fd, 0); |
| 4337 | 4347 | try testing.expect(sqe.flags & linux.IOSQE_BUFFER_SELECT == linux.IOSQE_BUFFER_SELECT); |
| 4338 | 4348 | try testing.expect(sqe.buf_index == buf_grp.group_id); |
| 4339 | 4349 | try testing.expectEqual(@as(u32, 1), try ring.submit()); // submit |
| 4350 | // get cqe, expect success |
| 4351 | const cqe = try ring.copy_cqe(); |
| 4352 | try testing.expectEqual(user_data, cqe.user_data); |
| 4353 | try testing.expect(cqe.res >= 0); // success |
| 4354 | try testing.expectEqual(posix.E.SUCCESS, cqe.err()); |
| 4355 | try testing.expect(cqe.flags & linux.IORING_CQE_F_BUFFER == linux.IORING_CQE_F_BUFFER); // IORING_CQE_F_BUFFER flag is set |
| 4340 | 4356 | |
| 4341 | | const cqe = try expect_buf_grp_cqe(ring, buf_grp, user_data, expected); |
| 4342 | | return try cqe.buffer_id(); |
| 4357 | return cqe; |
| 4343 | 4358 | } |
| 4344 | 4359 | |
| 4345 | 4360 | fn expect_buf_grp_cqe( |
| ... | ... | @@ -4359,7 +4374,7 @@ fn expect_buf_grp_cqe( |
| 4359 | 4374 | // get buffer from pool |
| 4360 | 4375 | const buffer_id = try cqe.buffer_id(); |
| 4361 | 4376 | const len = @as(usize, @intCast(cqe.res)); |
| 4362 | | const buf = buf_grp.get(buffer_id)[0..len]; |
| 4377 | const buf = buf_grp.get_by_id(buffer_id)[0..len]; |
| 4363 | 4378 | try testing.expectEqualSlices(u8, expected, buf); |
| 4364 | 4379 | |
| 4365 | 4380 | return cqe; |