lkml.org 
[lkml]   [2019]   [Dec]   [2]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectRe: [RFC PATCH v5 1/3] printk-rb: new printk ringbuffer implementation (writer)
Date
On 2019-12-02, Petr Mladek <pmladek@suse.com> wrote:
>> > +/* Reserve a new descriptor, invalidating the oldest if necessary. */
>> > +static bool desc_reserve(struct printk_ringbuffer *rb, u32 *id_out)
>> > +{
>> > + struct prb_desc_ring *desc_ring = &rb->desc_ring;
>> > + struct prb_desc *desc;
>> > + u32 id_prev_wrap;
>> > + u32 head_id;
>> > + u32 id;
>> > +
>> > + head_id = atomic_read(&desc_ring->head_id);
>> > +
>> > + do {
>> > + desc = to_desc(desc_ring, head_id);
>> > +
>> > + id = DESC_ID(head_id + 1);
>> > + id_prev_wrap = DESC_ID_PREV_WRAP(desc_ring, id);
>> > +
>> > + if (id_prev_wrap == atomic_read(&desc_ring->tail_id)) {
>> > + if (!desc_push_tail(rb, id_prev_wrap))
>> > + return false;
>> > + }
>> > + } while (!atomic_try_cmpxchg(&desc_ring->head_id, &head_id, id));
>>
>> Hmm, in theory, ABA problem might cause that we successfully
>> move desc_ring->head_id when tail has not been pushed yet.
>>
>> As a result we would never call desc_push_tail() until
>> it overflows again.
>>
>> I am not sure if we need to take care of it. The code is called with
>> interrupts disabled. IMHO, only NMI could cause ABA problem
>> in reality. But the game (debugging) is lost anyway when NMI ovewrites
>> the buffer several times.
>
> BTW: If I am counting correctly. The ABA problem would happen when
> exactly 2^30 (1G) messages is written in the mean time.

All the ringbuffer code assumes that the use of index numbers handles
the ABA problem (i.e. there must not be 1 billion printk's within an
NMI). If we want to support 1 billion+ printk's within an NMI, then
perhaps the index number should be increased. For 64-bit systems it
would be no problem to go to 62 bits. For 32-bit systems, I don't know
how well the 64-bit atomic operations are supported.

>> Also it should not be a complete failure. We still could bail out when
>> the previous state was not reusable. We are on the safe side
>> when it was reusable.
>>
>> Also we could probably detect when desc_ring->tail_id is not
>> updated any longer and do something about it.
>>
>> > +
>> > + desc = to_desc(desc_ring, id);
>> > +
>> > + /* Set the descriptor's ID and also set its state to reserved. */
>> > + atomic_set(&desc->state_var, id | 0);
>>
>> We should check here that the original state id from the previous
>> wrap in reusable state (or 0 for bootstrap). On error, we know that
>> there was the ABA problem and would need to do something about it.
>
> I believe that it should be enough to add this check and
> bail out in case of error.

I need to go through the code again in detail and see how many locations
are affected by ABA. All the code was written with the assumption that
this type of ABA will not happen.

As you've stated, we could add minimal handling so that the ringbuffer
at least does not break or get stuck.

BTW: The same assumption is made for logical positions. There are 4
times as many of these (on 32-bit systems) but logical positions advance
much faster. I will review these as well.

John Ogness

\
 
 \ /
  Last update: 2019-12-02 17:38    [W:0.084 / U:1.272 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site