[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <45E036AB.9050303@student.ltu.se>
Date: Sat, 24 Feb 2007 13:59:23 +0100
From: Richard Knutsson <ricknu-0@...dent.ltu.se>
To: Vojtech Pavlik <vojtech@...e.cz>
CC: Dmitry Torokhov <dmitry.torokhov@...il.com>,
Milind Choudhary <milindchoudhary@...il.com>,
kernel-janitors@...ts.osdl.org, linux-kernel@...r.kernel.org,
linux-input@...ey.karlin.mff.cuni.cz,
linux-joystick@...ey.karlin.mff.cuni.cz
Subject: Re: [KJ][RFC][PATCH] BIT macro cleanup
Vojtech Pavlik wrote:
> On Fri, Feb 23, 2007 at 11:43:44PM +0100, Richard Knutsson wrote:
>
>
>> Is the reason for the modulo to put a bitmask larger then the variable
>> into an array?
>>
>
> The complementary LONG() macro will tell you the index of an array of
> longs where the bit should be set.
>
This may be a little OT, but how come it is not done as an function?
Maybe something like "(set/get)_long_mask(...)".
>
>> The reason I don't like it with modulo is simply because it hides
>> potential bugs (when x is to big).
>>
>
> That would be my only concern - losing compiler warnings.
>
And what bugs me is that this will effect the whole tree for a feature
used in only input, right?
>
>> And what about the "1%"?
>>
>
> The 1% will need either LLBIT or an extra % 8.
>
Oh, that's true
Richard Knutsson
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists