[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <87r1rkctn5.fsf@jogness.linutronix.de>
Date: Wed, 02 Sep 2020 13:26:14 +0206
From: John Ogness <john.ogness@...utronix.de>
To: Petr Mladek <pmladek@...e.com>
Cc: Sergey Senozhatsky <sergey.senozhatsky.work@...il.com>,
Sergey Senozhatsky <sergey.senozhatsky@...il.com>,
Steven Rostedt <rostedt@...dmis.org>,
Linus Torvalds <torvalds@...ux-foundation.org>,
Greg Kroah-Hartman <gregkh@...uxfoundation.org>,
Thomas Gleixner <tglx@...utronix.de>,
Peter Zijlstra <peterz@...radead.org>,
Andrea Parri <parri.andrea@...il.com>,
Paul McKenney <paulmck@...nel.org>, kexec@...ts.infradead.org,
linux-kernel@...r.kernel.org
Subject: Re: state names: vas: Re: [PATCH next v3 6/8] printk: ringbuffer: add finalization/extension support
On 2020-09-02, Petr Mladek <pmladek@...e.com> wrote:
>> +static struct prb_desc *desc_reopen_last(struct prb_desc_ring *desc_ring,
>> + u32 caller_id, unsigned long *id_out)
>> +{
>> + unsigned long prev_state_val;
>> + enum desc_state d_state;
>> + struct prb_desc desc;
>> + struct prb_desc *d;
>> + unsigned long id;
>> +
>> + id = atomic_long_read(&desc_ring->head_id);
>> +
>> + /*
>> + * To minimize unnecessarily reopening a descriptor, first check the
>> + * descriptor is in the correct state and has a matching caller ID.
>> + */
>> + d_state = desc_read(desc_ring, id, &desc);
>> + if (d_state != desc_reserved ||
>> + !(atomic_long_read(&desc.state_var) & DESC_COMMIT_MASK) ||
>
> This looks like a hack. And similar extra check of the bit is needed
> also in desc_read(), see
> https://lore.kernel.org/r/878sdvq8kd.fsf@jogness.linutronix.de
Agreed.
> I has been actually getting less and less happy with the inconsistency
> between names of the bits and states.
>
> ...
>
> First, define 5 desc_states, something like:
>
> enum desc_state {
> desc_miss = -1, /* ID mismatch */
> desc_modified = 0x0, /* reserved, being modified by writer */
I prefer the "desc_reserved" name. It may or may not have be modified yet.
> desc_committed = 0x1, /* committed by writer, could get reopened */
> desc_finalized = 0x2, /* committed, could not longer get modified */
> desc_reusable = 0x3, /* free, not yet used by any writer */
> };
>
> Second, only 4 variants of the 3 state bits are currently used.
> It means that two bits are enough and they might use exactly
> the above names:
>
> I mean to do something like:
>
> #define DESC_SV_BITS (sizeof(unsigned long) * 8)
> #define DESC_SV(desc_state) ((unsigned long)desc_state << (DESC_SV_BITS - 2))
> #define DESC_ST(state_val) ((unsigned long)state_val >> (DESC_SV_BITS - 2))
This makes sense and will get us back the bit we lost because of
finalization.
> I am sorry that I did not came up with this earlier. I know how
> painful it is to rework bigger patchsets. But it affects format
> of the ring buffer, so we should do it early.
Agreed.
I am wondering if VMCOREINFO should include a DESC_FLAGS_MASK so that
crash tools could at least successfully iterate the ID's, even if they
didn't know what all the flag values mean (in the case that more bits
are added later).
> PS: I am still middle of review. It looks good so far. I wanted to
> send this early and separately because it is a bigger change.
Thanks for the heads up.
John Ogness
Powered by blists - more mailing lists