| ... | ... | @@ -186,7 +186,9 @@ pub fn LinearFifo( |
| 186 | 186 | } else { |
| 187 | 187 | var head = self.head + count; |
| 188 | 188 | if (powers_of_two) { |
| 189 | | head &= self.buf.len - 1; |
| 189 | // Note it is safe to do a wrapping subtract as |
| 190 | // bitwise & with all 1s is a noop |
| 191 | head &= self.buf.len -% 1; |
| 190 | 192 | } else { |
| 191 | 193 | head %= self.buf.len; |
| 192 | 194 | } |
| ... | ... | @@ -376,6 +378,14 @@ pub fn LinearFifo( |
| 376 | 378 | }; |
| 377 | 379 | } |
| 378 | 380 | |
| 381 | test "LinearFifo(u8, .Dynamic) discard(0) from empty buffer should not error on overflow" { |
| 382 | var fifo = LinearFifo(u8, .Dynamic).init(testing.allocator); |
| 383 | defer fifo.deinit(); |
| 384 | |
| 385 | // If overflow is not explicitly allowed this will crash in debug / safe mode |
| 386 | fifo.discard(0); |
| 387 | } |
| 388 | |
| 379 | 389 | test "LinearFifo(u8, .Dynamic)" { |
| 380 | 390 | var fifo = LinearFifo(u8, .Dynamic).init(testing.allocator); |
| 381 | 391 | defer fifo.deinit(); |