On Tue, Jul 25, 2017 at 12:48 PM, Richard Biener
wrote:
> On Mon, Jul 10, 2017 at 10:24 AM, Bin.Cheng wrote:
>> On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
>>> Hi,
>>> This is a followup patch better handling below case:
>>> for (i = 0; i < n; i++)
>>>{
>>> a[i] = 1;
On Tue, Jul 25, 2017 at 1:57 PM, Richard Biener
wrote:
> On Tue, Jul 25, 2017 at 2:38 PM, Bin.Cheng wrote:
>> On Tue, Jul 25, 2017 at 12:48 PM, Richard Biener
>> wrote:
>>> On Mon, Jul 10, 2017 at 10:24 AM, Bin.Cheng wrote:
On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
> Hi,
On Tue, Jul 25, 2017 at 2:38 PM, Bin.Cheng wrote:
> On Tue, Jul 25, 2017 at 12:48 PM, Richard Biener
> wrote:
>> On Mon, Jul 10, 2017 at 10:24 AM, Bin.Cheng wrote:
>>> On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
Hi,
This is a followup patch better handling below case:
On Tue, Jul 25, 2017 at 12:48 PM, Richard Biener
wrote:
> On Mon, Jul 10, 2017 at 10:24 AM, Bin.Cheng wrote:
>> On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
>>> Hi,
>>> This is a followup patch better handling below case:
>>> for (i = 0; i < n; i++)
>>>{
>>> a[i] = 1;
On Mon, Jul 10, 2017 at 10:24 AM, Bin.Cheng wrote:
> On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
>> Hi,
>> This is a followup patch better handling below case:
>> for (i = 0; i < n; i++)
>>{
>> a[i] = 1;
>> a[i+2] = 2;
>>}
>> Instead of generating roo
On Tue, Jun 27, 2017 at 11:49 AM, Bin Cheng wrote:
> Hi,
> This is a followup patch better handling below case:
> for (i = 0; i < n; i++)
>{
> a[i] = 1;
> a[i+2] = 2;
>}
> Instead of generating root variables by loading from memory and propagating
> with PHI
Hi,
This is a followup patch better handling below case:
for (i = 0; i < n; i++)
{
a[i] = 1;
a[i+2] = 2;
}
Instead of generating root variables by loading from memory and propagating
with PHI
nodes, like:
t0 = a[0];
t1 = a[1];
for (i = 0; i < n;