Re: xor as a lazy comparison
From: Philippe Troin (phil_at_fifi.org)
Date: 07/25/05
- Previous message: Stephen Clark: "2.6.12 sound problem"
- In reply to: Lee Revell: "Re: xor as a lazy comparison"
- Next in thread: Lee Revell: "Re: xor as a lazy comparison"
- Reply: Lee Revell: "Re: xor as a lazy comparison"
- Reply: Steven Rostedt: "Re: xor as a lazy comparison"
- Reply: Lee Revell: "Re: xor as a lazy comparison"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
To: Lee Revell <rlrevell@joe-job.com> Date: 25 Jul 2005 12:16:56 -0700
Lee Revell <rlrevell@joe-job.com> writes:
> On Mon, 2005-07-25 at 13:55 -0400, Steven Rostedt wrote:
> > Doesn't matter. The cycles saved for old compilers is not rational to
> > have obfuscated code.
>
> Where do we draw the line with this? Is x *= 2 preferable to x <<= 2 as
> well?
Depends if you want to multiply by 2 or 4 :-)
Phil.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
- Previous message: Stephen Clark: "2.6.12 sound problem"
- In reply to: Lee Revell: "Re: xor as a lazy comparison"
- Next in thread: Lee Revell: "Re: xor as a lazy comparison"
- Reply: Lee Revell: "Re: xor as a lazy comparison"
- Reply: Steven Rostedt: "Re: xor as a lazy comparison"
- Reply: Lee Revell: "Re: xor as a lazy comparison"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|