This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [patch gimplifier]: Boolify more strict conditional expressions and transform simple form to binary
- From: Kai Tietz <ktietz70 at googlemail dot com>
- To: Eric Botcazou <ebotcazou at adacore dot com>
- Cc: gcc-patches at gcc dot gnu dot org, Richard Guenther <richard dot guenther at gmail dot com>
- Date: Wed, 11 May 2011 12:03:41 +0200
- Subject: Re: [patch gimplifier]: Boolify more strict conditional expressions and transform simple form to binary
- References: <BANLkTi=RoeGa+SK84T+gjtaoJ7x3goqoUg@mail.gmail.com> <201105111153.28024.ebotcazou@adacore.com>
2011/5/11 Eric Botcazou <ebotcazou@adacore.com>:
>> this patch converts TRUTH_AND_EXPR, TRUTH_OR_EXPR, and TRUTH_XOR_EXPR
>> expressions on gimplification to their binary form.
>
> What is it for? ?This will redirect the compilation stream from proven paths to
> others so there must be a good reason to do it. ?What's the effect on the code?
>
> --
> Eric Botcazou
Well, it would have some effects. First we don't need to handle TRUTH
and BINARY variants of AND, OR, XOR any longer special. Second cause
is that on BINARY trees the reassociation pass can operate, which
leads to better optimized boolean logic.
Regards,
Kai