| ... | ... | @@ -136,7 +136,7 @@ pub const IO_Uring = struct { |
| 136 | 136 | // Remember that these head and tail offsets wrap around every four billion operations. |
| 137 | 137 | // We must therefore use wrapping addition and subtraction to avoid a runtime crash. |
| 138 | 138 | const next = self.sq.sqe_tail +% 1; |
| 139 | | if (next -% head > self.sq.sqes.len) return error.IO_UringSubmissionQueueFull; |
| 139 | if (next -% head > self.sq.sqes.len) return error.SubmissionQueueFull; |
| 140 | 140 | var sqe = &self.sq.sqes[self.sq.sqe_tail & self.sq.mask.*]; |
| 141 | 141 | self.sq.sqe_tail = next; |
| 142 | 142 | return sqe; |
| ... | ... | @@ -716,7 +716,7 @@ test "queue_readv" { |
| 716 | 716 | ring.use_registered_fd(sqe); |
| 717 | 717 | testing.expectEqual(@as(u8, linux.IOSQE_FIXED_FILE), sqe.flags); |
| 718 | 718 | |
| 719 | | testing.expectError(error.IO_UringSubmissionQueueFull, ring.queue_nop(0)); |
| 719 | testing.expectError(error.SubmissionQueueFull, ring.queue_nop(0)); |
| 720 | 720 | testing.expectEqual(@as(u32, 1), try ring.submit()); |
| 721 | 721 | testing.expectEqual(linux.io_uring_cqe { |
| 722 | 722 | .user_data = 0xcccccccc, |