On Thu, Aug 2, 2012 at 12:28 PM, Martin Jambor wrote:
> Hi,
>
> this patch uses the aggregate jump functions created by the previous
> patch in the series to determine benefits of inlining a particular
> call graph edge. It has not changed much since the last time I posted
> it, except for the pr
Hi,
On Fri, Aug 10, 2012 at 05:12:31AM +0200, Jan Hubicka wrote:
>
> Do you have any data on memory usage? I was originally concerned
> about memory use of the whole predicate thingy on WPA level.
> Eventually we could add simple inheritance on conditions and sort
> them into mutiple vectors if
> This is the patch I have committed after resolving a conflict (and
> another round of bootstrapping and testing). The ChangeLog is still
> the same.
>
> The previous version of the patch (but with tree code already
> converted to an enum), the aggregate jump functions together with
> enlarged i
Hi,
On Fri, Aug 10, 2012 at 04:39:44PM +0200, Martin Jambor wrote:
> On Fri, Aug 10, 2012 at 05:12:31AM +0200, Jan Hubicka wrote:
> > > Hi,
> > >
>
> ...
>
> > >
> > > 2012-07-31 Martin Jambor
> > >
> > > PR fortran/48636
> > > * ipa-inline.h (condition): New fields offset, agg_content
> *** inline_merge_summary (struct cgraph_edge
> *** 2639,2655
> int count = ipa_get_cs_argument_count (args);
> int i;
>
> ! evaluate_properties_for_edge (edge, true, &clause, NULL, NULL);
> if (count)
> ! VEC_safe_grow_cleared (int, heap, oper
> Hi,
>
> this patch uses the aggregate jump functions created by the previous
> patch in the series to determine benefits of inlining a particular
> call graph edge. It has not changed much since the last time I posted
> it, except for the presence of by_ref flags and removal of checks
> require
On Thu, Aug 02, 2012 at 09:28:11PM +0200, Martin Jambor wrote:
> Hi,
>
> this patch uses the aggregate jump functions created by the previous
> patch in the series to determine benefits of inlining a particular
> call graph edge. It has not changed much since the last time I posted
> it, except f
