-Original Message-
From: Richard Biener [mailto:richard.guent...@gmail.com]
Sent: Tuesday, February 17, 2015 5:49 PM
To: Ajit Kumar Agarwal
Cc: gcc@gcc.gnu.org; Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida;
Nagaraju Mekala
Subject: Re: Tree SSA If-combine optimization pass in
Hi,
the following program does not compile with g++4.9.2:
#include
template
auto tt(T x) -> decltype(~x) // <-- here
{ return ~x; }
int main()
{
std::cout << tt(10) << std::endl;
return EXIT_SUCCESS;
}
ptomulik@tea:$ g++ -std=c++11 -g -O0 -Wall -Wextra -Werror -pedantic -o
test-gcc test.
On 17 February 2015 at 15:10, Paweł Tomulik wrote:
> Is this a bug? The original program compiles with clang.
Yes, please report it as described at https://gcc.gnu.org/bugs/
In any case, "is this a bug?" questions are inappropriate on this
mailing list, they belong on the gcc-help list.
On Tue, Feb 17, 2015 at 11:26 AM, Ajit Kumar Agarwal
wrote:
>
>
> -Original Message-
> From: Richard Biener [mailto:richard.guent...@gmail.com]
> Sent: Tuesday, February 17, 2015 3:42 PM
> To: Ajit Kumar Agarwal
> Cc: gcc@gcc.gnu.org; Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida
On Tue, Feb 17, 2015 at 9:45 AM, Ajit Kumar Agarwal wrote:
> Hello All:
>
> I can see the Loop invariant pass in the GCC on RTL considering the register
> pressure and the cost manipulation
> With respect to SET destination node in RTL.
>
> The Loop invariant takes care of only address arithmetic
-Original Message-
From: Richard Biener [mailto:richard.guent...@gmail.com]
Sent: Tuesday, February 17, 2015 3:42 PM
To: Ajit Kumar Agarwal
Cc: gcc@gcc.gnu.org; Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida;
Nagaraju Mekala
Subject: Re: Tree SSA If-combine optimization pass in
On Tue, Feb 17, 2015 at 9:22 AM, Ajit Kumar Agarwal
wrote:
> Hello All:
>
> I can see the IF-combining (If-merging) pass of optimization on tree-ssa form
> of intermediate representation.
> The IF-combine or merging takes of merging the IF-THEN-ELSE if the condition
> Expr found be congruent or
Hello All:
I can see the Loop invariant pass in the GCC on RTL considering the register
pressure and the cost manipulation
With respect to SET destination node in RTL.
The Loop invariant takes care of only address arithmetic candidates of Loop
invariance.
In the function get_inv_cost, I can se
Hello All:
I can see the IF-combining (If-merging) pass of optimization on tree-ssa form
of intermediate representation.
The IF-combine or merging takes of merging the IF-THEN-ELSE if the condition
Expr found be congruent or
Similar.
The IF-combine happens if the two IF-THEN-ELSE are contiguo
