On Wed, Aug 19, 2015 at 2:14 AM, Jeff Law wrote:
> On 08/17/2015 04:01 AM, Bin.Cheng wrote:
>>>
>>>
>>> + c0 = fold_convert (type, c0);
>>> + c1 = fold_convert (type, c1);
>>> +
>>> + if (operand_equal_p (var, c0, 0))
>>>
>>> I believe if c0 is not already of type type operand-equal
On 08/17/2015 04:01 AM, Bin.Cheng wrote:
+ c0 = fold_convert (type, c0);
+ c1 = fold_convert (type, c1);
+
+ if (operand_equal_p (var, c0, 0))
I believe if c0 is not already of type type operand-equal_p will never succeed.
It's quite specific case targeting comparison between va
Shail Aditya
> Gupta; Vidhumouli Hunsigida; Nagaraju Mekala
> Subject: Re: [PATCH GCC]Improve bound information in loop niter analysis
>
> On Mon, Aug 17, 2015 at 6:49 PM, Ajit Kumar Agarwal
> wrote:
>> All:
>>
>> Does the Logic to calculate the Loop bound information
Shail Aditya
> Gupta; Vidhumouli Hunsigida; Nagaraju Mekala
> Subject: Re: [PATCH GCC]Improve bound information in loop niter analysis
>
> On Mon, Aug 17, 2015 at 6:49 PM, Ajit Kumar Agarwal
> wrote:
>> All:
>>
>> Does the Logic to calculate the Loop bound information
On Behalf Of Bin.Cheng
> Sent: Monday, August 17, 2015 3:32 PM
> To: Richard Biener
> Cc: Bin Cheng; GCC Patches
> Subject: Re: [PATCH GCC]Improve bound information in loop niter
> analysis
>
> Thanks for all your reviews.
>
> On Fri, Aug 14, 2015 at 4:17 PM, Richard B
de is collecting some comparison
basic block of loop?
Thanks,
bin
>
> Thanks & Regards
> Ajit
>
>
> -Original Message-
> From: gcc-patches-ow...@gcc.gnu.org [mailto:gcc-patches-ow...@gcc.gnu.org] On
> Behalf Of Bin.Cheng
> Sent: Monday, August 17, 2015 3:32 PM
> To: Richa
-Original Message-
From: gcc-patches-ow...@gcc.gnu.org [mailto:gcc-patches-ow...@gcc.gnu.org] On
Behalf Of Bin.Cheng
Sent: Monday, August 17, 2015 3:32 PM
To: Richard Biener
Cc: Bin Cheng; GCC Patches
Subject: Re: [PATCH GCC]Improve bound information in loop niter analysis
Thanks for
ches-ow...@gcc.gnu.org [mailto:gcc-patches-ow...@gcc.gnu.org] On
Behalf Of Bin.Cheng
Sent: Monday, August 17, 2015 3:32 PM
To: Richard Biener
Cc: Bin Cheng; GCC Patches
Subject: Re: [PATCH GCC]Improve bound information in loop niter analysis
Thanks for all your reviews.
On Fri, Aug 14, 2015 at 4
Thanks for all your reviews.
On Fri, Aug 14, 2015 at 4:17 PM, Richard Biener
wrote:
> On Tue, Jul 28, 2015 at 11:36 AM, Bin Cheng wrote:
>> Hi,
>> Loop niter computes inaccurate bound information for different loops. This
>> patch is to improve it by using loop initial condition in
>> determine
On 08/14/2015 02:17 AM, Richard Biener wrote:
On Tue, Jul 28, 2015 at 11:36 AM, Bin Cheng wrote:
Hi,
Loop niter computes inaccurate bound information for different loops. This
patch is to improve it by using loop initial condition in
determine_value_range. Generally, loop niter is computed by
On 08/13/2015 09:06 PM, Bin.Cheng wrote:
Thanks for the comment.
IIUC, the niter information in struct tree_niter_desc means the number
of executions of the latch of the loop, so it's 254, rather than 255.
And same the bound information. Of course, statements in the loop
body could execute boun
On Tue, Jul 28, 2015 at 11:36 AM, Bin Cheng wrote:
> Hi,
> Loop niter computes inaccurate bound information for different loops. This
> patch is to improve it by using loop initial condition in
> determine_value_range. Generally, loop niter is computed by subtracting
> start var from end var in
On Fri, Aug 14, 2015 at 6:08 AM, Jeff Law wrote:
> On 07/28/2015 03:36 AM, Bin Cheng wrote:
>>
>> Hi,
>> Loop niter computes inaccurate bound information for different loops.
>> This
>> patch is to improve it by using loop initial condition in
>> determine_value_range. Generally, loop niter is co
On 07/28/2015 03:36 AM, Bin Cheng wrote:
Hi,
Loop niter computes inaccurate bound information for different loops. This
patch is to improve it by using loop initial condition in
determine_value_range. Generally, loop niter is computed by subtracting
start var from end var in loop exit condition
Ping.
Thanks,
bin
On Tue, Jul 28, 2015 at 5:36 PM, Bin Cheng wrote:
> Hi,
> Loop niter computes inaccurate bound information for different loops. This
> patch is to improve it by using loop initial condition in
> determine_value_range. Generally, loop niter is computed by subtracting
> start v
15 matches
Mail list logo
