Re: [PATCH v1] printk_ringbuffer: don't needlessly wrap data blocks around

[John Ogness <john.ogness@linutronix.de>]

On 2025-09-03, Daniil Tatianin <d-tatianin@yandex-team.ru> wrote:
> Previously, data blocks that perfectly fit the data ring buffer would
> get wrapped around to the beginning for no reason since the calculated
> offset of the next data block would belong to the next wrap. Since this
> offset is not actually part of the data block, but rather the offset of
> where the next data block is going to start, there is no reason to
> include it when deciding whether the current block fits the buffer.

FYI, I am taking a look at this. We need to be really careful not to
introduce any subtle bugs.

As an example, data_check_size() makes sure there is always room for the
trailing "next ID". But with your patch, that check is
overconservative. For that particular case it really isn't an issue, it
just means you would not be able to have a record the fills the full
ringbuffer. But my point is that there may be parts of the code that
assume there is always a trailing "next ID" (since so far that has
always been true).

I just want to be careful in my review of it. So please be patient.

John