On Tue, Oct 17, 2017 at 4:28 PM, Bin.Cheng wrote:
> On Mon, Oct 16, 2017 at 5:27 PM, Bin.Cheng wrote:
>> On Mon, Oct 16, 2017 at 5:00 PM, Bin.Cheng wrote:
>>> On Mon, Oct 16, 2017 at 2:56 PM, Bin.Cheng wrote:
On Thu, Oct 12, 2017 at 2:43 PM, Richard Biener
wrote:
> On Thu, Oct 5,
On Mon, Oct 16, 2017 at 5:27 PM, Bin.Cheng wrote:
> On Mon, Oct 16, 2017 at 5:00 PM, Bin.Cheng wrote:
>> On Mon, Oct 16, 2017 at 2:56 PM, Bin.Cheng wrote:
>>> On Thu, Oct 12, 2017 at 2:43 PM, Richard Biener
>>> wrote:
On Thu, Oct 5, 2017 at 3:17 PM, Bin Cheng wrote:
> Hi,
> This p
On Mon, Oct 16, 2017 at 5:00 PM, Bin.Cheng wrote:
> On Mon, Oct 16, 2017 at 2:56 PM, Bin.Cheng wrote:
>> On Thu, Oct 12, 2017 at 2:43 PM, Richard Biener
>> wrote:
>>> On Thu, Oct 5, 2017 at 3:17 PM, Bin Cheng wrote:
Hi,
This patch merges adjacent memset builtin partitions if possible.
On Mon, Oct 16, 2017 at 2:56 PM, Bin.Cheng wrote:
> On Thu, Oct 12, 2017 at 2:43 PM, Richard Biener
> wrote:
>> On Thu, Oct 5, 2017 at 3:17 PM, Bin Cheng wrote:
>>> Hi,
>>> This patch merges adjacent memset builtin partitions if possible. It is
>>> a useful special case optimization transformin
On Thu, Oct 12, 2017 at 2:43 PM, Richard Biener
wrote:
> On Thu, Oct 5, 2017 at 3:17 PM, Bin Cheng wrote:
>> Hi,
>> This patch merges adjacent memset builtin partitions if possible. It is
>> a useful special case optimization transforming below code:
>>
>> #define M (256)
>> #define N (512)
>>
>
On Thu, Oct 5, 2017 at 3:17 PM, Bin Cheng wrote:
> Hi,
> This patch merges adjacent memset builtin partitions if possible. It is
> a useful special case optimization transforming below code:
>
> #define M (256)
> #define N (512)
>
> struct st
> {
> int a[M][N];
> int c[M];
> int b[M][N];
>
Hi,
This patch merges adjacent memset builtin partitions if possible. It is
a useful special case optimization transforming below code:
#define M (256)
#define N (512)
struct st
{
int a[M][N];
int c[M];
int b[M][N];
};
void
foo (struct st *p)
{
for (unsigned i = 0; i < M; ++i)
{