Thread (29 messages) flat view 29 messages, 10 authors, 2016-11-09

Re: Coding Style: Reverse XMAS tree declarations ?

From: Joe Perches <joe@perches.com>
Date: 2016-11-04 17:44:23
Also in: lkml, netdev

On Fri, 2016-11-04 at 11:07 -0400, David Miller wrote:
From: Lino Sanfilippo <redacted>
quoted
On 04.11.2016 07:53, Joe Perches wrote:
quoted
CHECK:REVERSE_XMAS_TREE: Prefer ordering declarations longest to
shortest
#446: FILE: drivers/net/ethernet/ethoc.c:446:
+                    int size = bd.stat >> 16;
+                    struct sk_buff *skb;
should not this case be valid? Optically the longer line is already
before the shorter.
I think that the whole point in using this reverse xmas tree ordering
is to have
the code optically tidied up and not to enforce ordering between
variable name lengths.
That's correct.
And also another reason the whole reverse xmas tree
automatic declaration layout concept is IMO dubious.

Basically, you're looking not at the initial ordering
of automatics as important, but helping find a specific
automatic when reversing from reading code is not always
correct.

Something like:

static void function{args,...)
{
	[longish list of reverse xmas tree identifiers...]
	struct foo *bar = longish_function(args, ...);
	struct foobarbaz *qux;
	[more identifers]

	[multiple screenfuls of code later...)

	new_function(..., bar, ...);

	[more code...]
}

and the reverse xmas tree helpfulness of looking up the
type of bar is neither obvious nor easy.

My preference would be for a bar that serves coffee and alcohol.
Keyboard shortcuts
hback out one level
jnext message in thread
kprevious message in thread
ldrill in
Escclose help / fold thread tree
?toggle this help