Re: Proposal for adding splay_tree_find (to find elements without updating the nodes).

2015-03-15 Thread Trevor Saunders
On Mon, Mar 16, 2015 at 03:33:18AM +, Aditya K wrote: > > > > > Date: Sun, 15 Mar 2015 02:32:23 -0400 > > From: tbsau...@tbsaunde.org > > To: gcc@gcc.gnu.org > > Subject: Re: Proposal for adding splay_tree_find (to find elements without > > updating t

RE: Proposal for adding splay_tree_find (to find elements without updating the nodes).

2015-03-15 Thread Aditya K
> Date: Sun, 15 Mar 2015 02:32:23 -0400 > From: tbsau...@tbsaunde.org > To: gcc@gcc.gnu.org > Subject: Re: Proposal for adding splay_tree_find (to find elements without > updating the nodes). > > hi, > > I'm only commenting on algorithmic stuff at this po

Re: How to implement '@' GDB-like operator for libcc1

2015-03-15 Thread Manuel López-Ibáñez
> > But GDB features a useful custom expression operator '@': > https://sourceware.org/gdb/onlinedocs/gdb/Arrays.html > > I have problems implementing '@' into GCC, could you suggest at which place > should I call build_array_type_nelts()? Or is it the right way at all? > > Testing it on a sam

Proposal: implement API for registering custom built-in functions from dynamic plugins

2015-03-15 Thread Mikhail Maltsev
Hi, all. Currently GCC allows dynamic plugins to register custom attributes and pragmas. I would like to propose to add API for registering custom built-in functions. AFAIK, current plugin API can be used to emulate this feature, for example by creating a function declaration in PLUGIN_START_UNIT

gcc-5-20150315 is now available

2015-03-15 Thread gccadmin
Snapshot gcc-5-20150315 is now available on ftp://gcc.gnu.org/pub/gcc/snapshots/5-20150315/ and on various mirrors, see http://gcc.gnu.org/mirrors.html for details. This snapshot has been generated from the GCC 5 SVN branch with the following options: svn://gcc.gnu.org/svn/gcc/trunk revision

How to implement '@' GDB-like operator for libcc1

2015-03-15 Thread Jan Kratochvil
Hi, based on the GCC libcc1 plugin GDB will implement GDB command 'compile print' equivalent to default 'print' but evaluating the expression by GCC: https://github.com/tromey/gdb/tree/pmuldoon/compile/print It is currently done by compiling a .c->.o file and checking its DWARF for the ty

Re: Proposal for the coarse grain unrolling heuristics and renaming for the enablement of better fine grain Loop transformation.

2015-03-15 Thread Mikhail Maltsev
15.03.2015 17:44, Ajit Kumar Agarwal writes: > > Hello All: > > The below example is taken from the article by Albert Cohen et.al. > > "Deep Jam : Conversion of Coarse grain Parallelism to Fine grain vector > parallelism" It is not clear from this article, whether such optimization can be impl

RE: Short Circuit compiler transformations!!

2015-03-15 Thread Ajit Kumar Agarwal
-Original Message- From: Richard Biener [mailto:richard.guent...@gmail.com] Sent: Sunday, March 15, 2015 9:30 PM To: Ajit Kumar Agarwal; Jeff Law; gcc@gcc.gnu.org Cc: Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida; Nagaraju Mekala Subject: RE: Short Circuit compiler transformati

Re: Proposal for the coarse grain unrolling heuristics and renaming for the enablement of better fine grain Loop transformation.

2015-03-15 Thread Richard Biener
On March 15, 2015 3:44:39 PM GMT+01:00, Ajit Kumar Agarwal wrote: > >Hello All: > >Below examples are the transformation for the given loop in Fig(1). >Fig(2) unroll and jam and the Fig(3) does the >Code motion to bring two IF adjacent to each other and two while loops >adjacent to each other. >

RE: Short Circuit compiler transformations!!

2015-03-15 Thread Richard Biener
On March 15, 2015 11:14:59 AM GMT+01:00, Ajit Kumar Agarwal wrote: > > >-Original Message- >From: gcc-ow...@gcc.gnu.org [mailto:gcc-ow...@gcc.gnu.org] On Behalf Of >Ajit Kumar Agarwal >Sent: Sunday, March 15, 2015 3:35 PM >To: Richard Biener; Jeff Law; gcc@gcc.gnu.org >Cc: Vinod Kathail;

Proposal for the coarse grain unrolling heuristics and renaming for the enablement of better fine grain Loop transformation.

2015-03-15 Thread Ajit Kumar Agarwal
Hello All: Below examples are the transformation for the given loop in Fig(1). Fig(2) unroll and jam and the Fig(3) does the Code motion to bring two IF adjacent to each other and two while loops adjacent to each other. The Fig(4 ) does the IF-merging and the Loop fusion on the transformed Loo

RE: Function outlining and partial Inlining

2015-03-15 Thread Ajit Kumar Agarwal
-Original Message- From: Jan Hubicka [mailto:hubi...@ucw.cz] Sent: Thursday, February 12, 2015 10:34 PM To: Ajit Kumar Agarwal Cc: hubi...@ucw.cz; gcc@gcc.gnu.org; Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida; Nagaraju Mekala Subject: Re: Function outlining and partial Inlini

RE: Short Circuit compiler transformations!!

2015-03-15 Thread Ajit Kumar Agarwal
-Original Message- From: gcc-ow...@gcc.gnu.org [mailto:gcc-ow...@gcc.gnu.org] On Behalf Of Ajit Kumar Agarwal Sent: Sunday, March 15, 2015 3:35 PM To: Richard Biener; Jeff Law; gcc@gcc.gnu.org Cc: Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida; Nagaraju Mekala Subject: RE: Short

RE: Short Circuit compiler transformations!!

2015-03-15 Thread Ajit Kumar Agarwal
-Original Message- From: Richard Biener [mailto:richard.guent...@gmail.com] Sent: Sunday, March 15, 2015 3:05 PM To: Ajit Kumar Agarwal; Jeff Law; gcc@gcc.gnu.org Cc: Vinod Kathail; Shail Aditya Gupta; Vidhumouli Hunsigida; Nagaraju Mekala Subject: Re: Short Circuit compiler transformati

Re: Short Circuit compiler transformations!!

2015-03-15 Thread Richard Biener
On March 15, 2015 9:15:36 AM GMT+01:00, Ajit Kumar Agarwal wrote: >Hello All: > >Short circuit compiler transformation for conditional branches. The >conditional branches based on the conditional >Expressions one of the path is always executed thus short circuiting >the path. Certains values of t

Short Circuit compiler transformations!!

2015-03-15 Thread Ajit Kumar Agarwal
Hello All: Short circuit compiler transformation for conditional branches. The conditional branches based on the conditional Expressions one of the path is always executed thus short circuiting the path. Certains values of the conditional Expressions makes the conditional expressions always true