1*e4b17023SJohn Marino /* Inlining decision heuristics.
2*e4b17023SJohn Marino Copyright (C) 2003, 2004, 2007, 2008, 2009, 2010, 2011
3*e4b17023SJohn Marino Free Software Foundation, Inc.
4*e4b17023SJohn Marino Contributed by Jan Hubicka
5*e4b17023SJohn Marino
6*e4b17023SJohn Marino This file is part of GCC.
7*e4b17023SJohn Marino
8*e4b17023SJohn Marino GCC is free software; you can redistribute it and/or modify it under
9*e4b17023SJohn Marino the terms of the GNU General Public License as published by the Free
10*e4b17023SJohn Marino Software Foundation; either version 3, or (at your option) any later
11*e4b17023SJohn Marino version.
12*e4b17023SJohn Marino
13*e4b17023SJohn Marino GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14*e4b17023SJohn Marino WARRANTY; without even the implied warranty of MERCHANTABILITY or
15*e4b17023SJohn Marino FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16*e4b17023SJohn Marino for more details.
17*e4b17023SJohn Marino
18*e4b17023SJohn Marino You should have received a copy of the GNU General Public License
19*e4b17023SJohn Marino along with GCC; see the file COPYING3. If not see
20*e4b17023SJohn Marino <http://www.gnu.org/licenses/>. */
21*e4b17023SJohn Marino
22*e4b17023SJohn Marino /* Analysis used by the inliner and other passes limiting code size growth.
23*e4b17023SJohn Marino
24*e4b17023SJohn Marino We estimate for each function
25*e4b17023SJohn Marino - function body size
26*e4b17023SJohn Marino - average function execution time
27*e4b17023SJohn Marino - inlining size benefit (that is how much of function body size
28*e4b17023SJohn Marino and its call sequence is expected to disappear by inlining)
29*e4b17023SJohn Marino - inlining time benefit
30*e4b17023SJohn Marino - function frame size
31*e4b17023SJohn Marino For each call
32*e4b17023SJohn Marino - call statement size and time
33*e4b17023SJohn Marino
34*e4b17023SJohn Marino inlinie_summary datastructures store above information locally (i.e.
35*e4b17023SJohn Marino parameters of the function itself) and globally (i.e. parameters of
36*e4b17023SJohn Marino the function created by applying all the inline decisions already
37*e4b17023SJohn Marino present in the callgraph).
38*e4b17023SJohn Marino
39*e4b17023SJohn Marino We provide accestor to the inline_summary datastructure and
40*e4b17023SJohn Marino basic logic updating the parameters when inlining is performed.
41*e4b17023SJohn Marino
42*e4b17023SJohn Marino The summaries are context sensitive. Context means
43*e4b17023SJohn Marino 1) partial assignment of known constant values of operands
44*e4b17023SJohn Marino 2) whether function is inlined into the call or not.
45*e4b17023SJohn Marino It is easy to add more variants. To represent function size and time
46*e4b17023SJohn Marino that depends on context (i.e. it is known to be optimized away when
47*e4b17023SJohn Marino context is known either by inlining or from IP-CP and clonning),
48*e4b17023SJohn Marino we use predicates. Predicates are logical formulas in
49*e4b17023SJohn Marino conjunctive-disjunctive form consisting of clauses. Clauses are bitmaps
50*e4b17023SJohn Marino specifying what conditions must be true. Conditions are simple test
51*e4b17023SJohn Marino of the form described above.
52*e4b17023SJohn Marino
53*e4b17023SJohn Marino In order to make predicate (possibly) true, all of its clauses must
54*e4b17023SJohn Marino be (possibly) true. To make clause (possibly) true, one of conditions
55*e4b17023SJohn Marino it mentions must be (possibly) true. There are fixed bounds on
56*e4b17023SJohn Marino number of clauses and conditions and all the manipulation functions
57*e4b17023SJohn Marino are conservative in positive direction. I.e. we may lose precision
58*e4b17023SJohn Marino by thinking that predicate may be true even when it is not.
59*e4b17023SJohn Marino
60*e4b17023SJohn Marino estimate_edge_size and estimate_edge_growth can be used to query
61*e4b17023SJohn Marino function size/time in the given context. inline_merge_summary merges
62*e4b17023SJohn Marino properties of caller and callee after inlining.
63*e4b17023SJohn Marino
64*e4b17023SJohn Marino Finally pass_inline_parameters is exported. This is used to drive
65*e4b17023SJohn Marino computation of function parameters used by the early inliner. IPA
66*e4b17023SJohn Marino inlined performs analysis via its analyze_function method. */
67*e4b17023SJohn Marino
68*e4b17023SJohn Marino #include "config.h"
69*e4b17023SJohn Marino #include "system.h"
70*e4b17023SJohn Marino #include "coretypes.h"
71*e4b17023SJohn Marino #include "tm.h"
72*e4b17023SJohn Marino #include "tree.h"
73*e4b17023SJohn Marino #include "tree-inline.h"
74*e4b17023SJohn Marino #include "langhooks.h"
75*e4b17023SJohn Marino #include "flags.h"
76*e4b17023SJohn Marino #include "cgraph.h"
77*e4b17023SJohn Marino #include "diagnostic.h"
78*e4b17023SJohn Marino #include "gimple-pretty-print.h"
79*e4b17023SJohn Marino #include "timevar.h"
80*e4b17023SJohn Marino #include "params.h"
81*e4b17023SJohn Marino #include "tree-pass.h"
82*e4b17023SJohn Marino #include "coverage.h"
83*e4b17023SJohn Marino #include "ggc.h"
84*e4b17023SJohn Marino #include "tree-flow.h"
85*e4b17023SJohn Marino #include "ipa-prop.h"
86*e4b17023SJohn Marino #include "lto-streamer.h"
87*e4b17023SJohn Marino #include "data-streamer.h"
88*e4b17023SJohn Marino #include "tree-streamer.h"
89*e4b17023SJohn Marino #include "ipa-inline.h"
90*e4b17023SJohn Marino #include "alloc-pool.h"
91*e4b17023SJohn Marino
92*e4b17023SJohn Marino /* Estimate runtime of function can easilly run into huge numbers with many
93*e4b17023SJohn Marino nested loops. Be sure we can compute time * INLINE_SIZE_SCALE * 2 in an
94*e4b17023SJohn Marino integer. For anything larger we use gcov_type. */
95*e4b17023SJohn Marino #define MAX_TIME 500000
96*e4b17023SJohn Marino
97*e4b17023SJohn Marino /* Number of bits in integer, but we really want to be stable across different
98*e4b17023SJohn Marino hosts. */
99*e4b17023SJohn Marino #define NUM_CONDITIONS 32
100*e4b17023SJohn Marino
101*e4b17023SJohn Marino enum predicate_conditions
102*e4b17023SJohn Marino {
103*e4b17023SJohn Marino predicate_false_condition = 0,
104*e4b17023SJohn Marino predicate_not_inlined_condition = 1,
105*e4b17023SJohn Marino predicate_first_dynamic_condition = 2
106*e4b17023SJohn Marino };
107*e4b17023SJohn Marino
108*e4b17023SJohn Marino /* Special condition code we use to represent test that operand is compile time
109*e4b17023SJohn Marino constant. */
110*e4b17023SJohn Marino #define IS_NOT_CONSTANT ERROR_MARK
111*e4b17023SJohn Marino /* Special condition code we use to represent test that operand is not changed
112*e4b17023SJohn Marino across invocation of the function. When operand IS_NOT_CONSTANT it is always
113*e4b17023SJohn Marino CHANGED, however i.e. loop invariants can be NOT_CHANGED given percentage
114*e4b17023SJohn Marino of executions even when they are not compile time constants. */
115*e4b17023SJohn Marino #define CHANGED IDENTIFIER_NODE
116*e4b17023SJohn Marino
117*e4b17023SJohn Marino /* Holders of ipa cgraph hooks: */
118*e4b17023SJohn Marino static struct cgraph_node_hook_list *function_insertion_hook_holder;
119*e4b17023SJohn Marino static struct cgraph_node_hook_list *node_removal_hook_holder;
120*e4b17023SJohn Marino static struct cgraph_2node_hook_list *node_duplication_hook_holder;
121*e4b17023SJohn Marino static struct cgraph_2edge_hook_list *edge_duplication_hook_holder;
122*e4b17023SJohn Marino static struct cgraph_edge_hook_list *edge_removal_hook_holder;
123*e4b17023SJohn Marino static void inline_node_removal_hook (struct cgraph_node *, void *);
124*e4b17023SJohn Marino static void inline_node_duplication_hook (struct cgraph_node *,
125*e4b17023SJohn Marino struct cgraph_node *, void *);
126*e4b17023SJohn Marino static void inline_edge_removal_hook (struct cgraph_edge *, void *);
127*e4b17023SJohn Marino static void inline_edge_duplication_hook (struct cgraph_edge *,
128*e4b17023SJohn Marino struct cgraph_edge *,
129*e4b17023SJohn Marino void *);
130*e4b17023SJohn Marino
131*e4b17023SJohn Marino /* VECtor holding inline summaries.
132*e4b17023SJohn Marino In GGC memory because conditions might point to constant trees. */
133*e4b17023SJohn Marino VEC(inline_summary_t,gc) *inline_summary_vec;
134*e4b17023SJohn Marino VEC(inline_edge_summary_t,heap) *inline_edge_summary_vec;
135*e4b17023SJohn Marino
136*e4b17023SJohn Marino /* Cached node/edge growths. */
137*e4b17023SJohn Marino VEC(int,heap) *node_growth_cache;
VEC(edge_growth_cache_entry,heap)138*e4b17023SJohn Marino VEC(edge_growth_cache_entry,heap) *edge_growth_cache;
139*e4b17023SJohn Marino
140*e4b17023SJohn Marino /* Edge predicates goes here. */
141*e4b17023SJohn Marino static alloc_pool edge_predicate_pool;
142*e4b17023SJohn Marino
143*e4b17023SJohn Marino /* Return true predicate (tautology).
144*e4b17023SJohn Marino We represent it by empty list of clauses. */
145*e4b17023SJohn Marino
146*e4b17023SJohn Marino static inline struct predicate
147*e4b17023SJohn Marino true_predicate (void)
148*e4b17023SJohn Marino {
149*e4b17023SJohn Marino struct predicate p;
150*e4b17023SJohn Marino p.clause[0]=0;
151*e4b17023SJohn Marino return p;
152*e4b17023SJohn Marino }
153*e4b17023SJohn Marino
154*e4b17023SJohn Marino
155*e4b17023SJohn Marino /* Return predicate testing single condition number COND. */
156*e4b17023SJohn Marino
157*e4b17023SJohn Marino static inline struct predicate
single_cond_predicate(int cond)158*e4b17023SJohn Marino single_cond_predicate (int cond)
159*e4b17023SJohn Marino {
160*e4b17023SJohn Marino struct predicate p;
161*e4b17023SJohn Marino p.clause[0]=1 << cond;
162*e4b17023SJohn Marino p.clause[1]=0;
163*e4b17023SJohn Marino return p;
164*e4b17023SJohn Marino }
165*e4b17023SJohn Marino
166*e4b17023SJohn Marino
167*e4b17023SJohn Marino /* Return false predicate. First clause require false condition. */
168*e4b17023SJohn Marino
169*e4b17023SJohn Marino static inline struct predicate
false_predicate(void)170*e4b17023SJohn Marino false_predicate (void)
171*e4b17023SJohn Marino {
172*e4b17023SJohn Marino return single_cond_predicate (predicate_false_condition);
173*e4b17023SJohn Marino }
174*e4b17023SJohn Marino
175*e4b17023SJohn Marino
176*e4b17023SJohn Marino /* Return true if P is (false). */
177*e4b17023SJohn Marino
178*e4b17023SJohn Marino static inline bool
true_predicate_p(struct predicate * p)179*e4b17023SJohn Marino true_predicate_p (struct predicate *p)
180*e4b17023SJohn Marino {
181*e4b17023SJohn Marino return !p->clause[0];
182*e4b17023SJohn Marino }
183*e4b17023SJohn Marino
184*e4b17023SJohn Marino
185*e4b17023SJohn Marino /* Return true if P is (false). */
186*e4b17023SJohn Marino
187*e4b17023SJohn Marino static inline bool
false_predicate_p(struct predicate * p)188*e4b17023SJohn Marino false_predicate_p (struct predicate *p)
189*e4b17023SJohn Marino {
190*e4b17023SJohn Marino if (p->clause[0] == (1 << predicate_false_condition))
191*e4b17023SJohn Marino {
192*e4b17023SJohn Marino gcc_checking_assert (!p->clause[1]
193*e4b17023SJohn Marino && p->clause[0] == 1 << predicate_false_condition);
194*e4b17023SJohn Marino return true;
195*e4b17023SJohn Marino }
196*e4b17023SJohn Marino return false;
197*e4b17023SJohn Marino }
198*e4b17023SJohn Marino
199*e4b17023SJohn Marino
200*e4b17023SJohn Marino /* Return predicate that is set true when function is not inlined. */
201*e4b17023SJohn Marino static inline struct predicate
not_inlined_predicate(void)202*e4b17023SJohn Marino not_inlined_predicate (void)
203*e4b17023SJohn Marino {
204*e4b17023SJohn Marino return single_cond_predicate (predicate_not_inlined_condition);
205*e4b17023SJohn Marino }
206*e4b17023SJohn Marino
207*e4b17023SJohn Marino
208*e4b17023SJohn Marino /* Add condition to condition list CONDS. */
209*e4b17023SJohn Marino
210*e4b17023SJohn Marino static struct predicate
add_condition(struct inline_summary * summary,int operand_num,enum tree_code code,tree val)211*e4b17023SJohn Marino add_condition (struct inline_summary *summary, int operand_num,
212*e4b17023SJohn Marino enum tree_code code, tree val)
213*e4b17023SJohn Marino {
214*e4b17023SJohn Marino int i;
215*e4b17023SJohn Marino struct condition *c;
216*e4b17023SJohn Marino struct condition new_cond;
217*e4b17023SJohn Marino
218*e4b17023SJohn Marino for (i = 0; VEC_iterate (condition, summary->conds, i, c); i++)
219*e4b17023SJohn Marino {
220*e4b17023SJohn Marino if (c->operand_num == operand_num
221*e4b17023SJohn Marino && c->code == code
222*e4b17023SJohn Marino && c->val == val)
223*e4b17023SJohn Marino return single_cond_predicate (i + predicate_first_dynamic_condition);
224*e4b17023SJohn Marino }
225*e4b17023SJohn Marino /* Too many conditions. Give up and return constant true. */
226*e4b17023SJohn Marino if (i == NUM_CONDITIONS - predicate_first_dynamic_condition)
227*e4b17023SJohn Marino return true_predicate ();
228*e4b17023SJohn Marino
229*e4b17023SJohn Marino new_cond.operand_num = operand_num;
230*e4b17023SJohn Marino new_cond.code = code;
231*e4b17023SJohn Marino new_cond.val = val;
232*e4b17023SJohn Marino VEC_safe_push (condition, gc, summary->conds, &new_cond);
233*e4b17023SJohn Marino return single_cond_predicate (i + predicate_first_dynamic_condition);
234*e4b17023SJohn Marino }
235*e4b17023SJohn Marino
236*e4b17023SJohn Marino
237*e4b17023SJohn Marino /* Add clause CLAUSE into the predicate P. */
238*e4b17023SJohn Marino
239*e4b17023SJohn Marino static inline void
add_clause(conditions conditions,struct predicate * p,clause_t clause)240*e4b17023SJohn Marino add_clause (conditions conditions, struct predicate *p, clause_t clause)
241*e4b17023SJohn Marino {
242*e4b17023SJohn Marino int i;
243*e4b17023SJohn Marino int i2;
244*e4b17023SJohn Marino int insert_here = -1;
245*e4b17023SJohn Marino int c1, c2;
246*e4b17023SJohn Marino
247*e4b17023SJohn Marino /* True clause. */
248*e4b17023SJohn Marino if (!clause)
249*e4b17023SJohn Marino return;
250*e4b17023SJohn Marino
251*e4b17023SJohn Marino /* False clause makes the whole predicate false. Kill the other variants. */
252*e4b17023SJohn Marino if (clause == (1 << predicate_false_condition))
253*e4b17023SJohn Marino {
254*e4b17023SJohn Marino p->clause[0] = (1 << predicate_false_condition);
255*e4b17023SJohn Marino p->clause[1] = 0;
256*e4b17023SJohn Marino return;
257*e4b17023SJohn Marino }
258*e4b17023SJohn Marino if (false_predicate_p (p))
259*e4b17023SJohn Marino return;
260*e4b17023SJohn Marino
261*e4b17023SJohn Marino /* No one should be sily enough to add false into nontrivial clauses. */
262*e4b17023SJohn Marino gcc_checking_assert (!(clause & (1 << predicate_false_condition)));
263*e4b17023SJohn Marino
264*e4b17023SJohn Marino /* Look where to insert the clause. At the same time prune out
265*e4b17023SJohn Marino clauses of P that are implied by the new clause and thus
266*e4b17023SJohn Marino redundant. */
267*e4b17023SJohn Marino for (i = 0, i2 = 0; i <= MAX_CLAUSES; i++)
268*e4b17023SJohn Marino {
269*e4b17023SJohn Marino p->clause[i2] = p->clause[i];
270*e4b17023SJohn Marino
271*e4b17023SJohn Marino if (!p->clause[i])
272*e4b17023SJohn Marino break;
273*e4b17023SJohn Marino
274*e4b17023SJohn Marino /* If p->clause[i] implies clause, there is nothing to add. */
275*e4b17023SJohn Marino if ((p->clause[i] & clause) == p->clause[i])
276*e4b17023SJohn Marino {
277*e4b17023SJohn Marino /* We had nothing to add, none of clauses should've become
278*e4b17023SJohn Marino redundant. */
279*e4b17023SJohn Marino gcc_checking_assert (i == i2);
280*e4b17023SJohn Marino return;
281*e4b17023SJohn Marino }
282*e4b17023SJohn Marino
283*e4b17023SJohn Marino if (p->clause[i] < clause && insert_here < 0)
284*e4b17023SJohn Marino insert_here = i2;
285*e4b17023SJohn Marino
286*e4b17023SJohn Marino /* If clause implies p->clause[i], then p->clause[i] becomes redundant.
287*e4b17023SJohn Marino Otherwise the p->clause[i] has to stay. */
288*e4b17023SJohn Marino if ((p->clause[i] & clause) != clause)
289*e4b17023SJohn Marino i2++;
290*e4b17023SJohn Marino }
291*e4b17023SJohn Marino
292*e4b17023SJohn Marino /* Look for clauses that are obviously true. I.e.
293*e4b17023SJohn Marino op0 == 5 || op0 != 5. */
294*e4b17023SJohn Marino for (c1 = predicate_first_dynamic_condition; c1 < NUM_CONDITIONS; c1++)
295*e4b17023SJohn Marino {
296*e4b17023SJohn Marino condition *cc1;
297*e4b17023SJohn Marino if (!(clause & (1 << c1)))
298*e4b17023SJohn Marino continue;
299*e4b17023SJohn Marino cc1 = VEC_index (condition,
300*e4b17023SJohn Marino conditions,
301*e4b17023SJohn Marino c1 - predicate_first_dynamic_condition);
302*e4b17023SJohn Marino /* We have no way to represent !CHANGED and !IS_NOT_CONSTANT
303*e4b17023SJohn Marino and thus there is no point for looking for them. */
304*e4b17023SJohn Marino if (cc1->code == CHANGED
305*e4b17023SJohn Marino || cc1->code == IS_NOT_CONSTANT)
306*e4b17023SJohn Marino continue;
307*e4b17023SJohn Marino for (c2 = c1 + 1; c2 <= NUM_CONDITIONS; c2++)
308*e4b17023SJohn Marino if (clause & (1 << c2))
309*e4b17023SJohn Marino {
310*e4b17023SJohn Marino condition *cc1 = VEC_index (condition,
311*e4b17023SJohn Marino conditions,
312*e4b17023SJohn Marino c1 - predicate_first_dynamic_condition);
313*e4b17023SJohn Marino condition *cc2 = VEC_index (condition,
314*e4b17023SJohn Marino conditions,
315*e4b17023SJohn Marino c2 - predicate_first_dynamic_condition);
316*e4b17023SJohn Marino if (cc1->operand_num == cc2->operand_num
317*e4b17023SJohn Marino && cc1->val == cc2->val
318*e4b17023SJohn Marino && cc2->code != IS_NOT_CONSTANT
319*e4b17023SJohn Marino && cc2->code != CHANGED
320*e4b17023SJohn Marino && cc1->code == invert_tree_comparison
321*e4b17023SJohn Marino (cc2->code,
322*e4b17023SJohn Marino HONOR_NANS (TYPE_MODE (TREE_TYPE (cc1->val)))))
323*e4b17023SJohn Marino return;
324*e4b17023SJohn Marino }
325*e4b17023SJohn Marino }
326*e4b17023SJohn Marino
327*e4b17023SJohn Marino
328*e4b17023SJohn Marino /* We run out of variants. Be conservative in positive direction. */
329*e4b17023SJohn Marino if (i2 == MAX_CLAUSES)
330*e4b17023SJohn Marino return;
331*e4b17023SJohn Marino /* Keep clauses in decreasing order. This makes equivalence testing easy. */
332*e4b17023SJohn Marino p->clause[i2 + 1] = 0;
333*e4b17023SJohn Marino if (insert_here >= 0)
334*e4b17023SJohn Marino for (;i2 > insert_here; i2--)
335*e4b17023SJohn Marino p->clause[i2] = p->clause[i2 - 1];
336*e4b17023SJohn Marino else
337*e4b17023SJohn Marino insert_here = i2;
338*e4b17023SJohn Marino p->clause[insert_here] = clause;
339*e4b17023SJohn Marino }
340*e4b17023SJohn Marino
341*e4b17023SJohn Marino
342*e4b17023SJohn Marino /* Return P & P2. */
343*e4b17023SJohn Marino
344*e4b17023SJohn Marino static struct predicate
and_predicates(conditions conditions,struct predicate * p,struct predicate * p2)345*e4b17023SJohn Marino and_predicates (conditions conditions,
346*e4b17023SJohn Marino struct predicate *p, struct predicate *p2)
347*e4b17023SJohn Marino {
348*e4b17023SJohn Marino struct predicate out = *p;
349*e4b17023SJohn Marino int i;
350*e4b17023SJohn Marino
351*e4b17023SJohn Marino /* Avoid busy work. */
352*e4b17023SJohn Marino if (false_predicate_p (p2) || true_predicate_p (p))
353*e4b17023SJohn Marino return *p2;
354*e4b17023SJohn Marino if (false_predicate_p (p) || true_predicate_p (p2))
355*e4b17023SJohn Marino return *p;
356*e4b17023SJohn Marino
357*e4b17023SJohn Marino /* See how far predicates match. */
358*e4b17023SJohn Marino for (i = 0; p->clause[i] && p->clause[i] == p2->clause[i]; i++)
359*e4b17023SJohn Marino {
360*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES);
361*e4b17023SJohn Marino }
362*e4b17023SJohn Marino
363*e4b17023SJohn Marino /* Combine the predicates rest. */
364*e4b17023SJohn Marino for (; p2->clause[i]; i++)
365*e4b17023SJohn Marino {
366*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES);
367*e4b17023SJohn Marino add_clause (conditions, &out, p2->clause[i]);
368*e4b17023SJohn Marino }
369*e4b17023SJohn Marino return out;
370*e4b17023SJohn Marino }
371*e4b17023SJohn Marino
372*e4b17023SJohn Marino
373*e4b17023SJohn Marino /* Return true if predicates are obviously equal. */
374*e4b17023SJohn Marino
375*e4b17023SJohn Marino static inline bool
predicates_equal_p(struct predicate * p,struct predicate * p2)376*e4b17023SJohn Marino predicates_equal_p (struct predicate *p, struct predicate *p2)
377*e4b17023SJohn Marino {
378*e4b17023SJohn Marino int i;
379*e4b17023SJohn Marino for (i = 0; p->clause[i]; i++)
380*e4b17023SJohn Marino {
381*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES);
382*e4b17023SJohn Marino gcc_checking_assert (p->clause [i] > p->clause[i + 1]);
383*e4b17023SJohn Marino gcc_checking_assert (!p2->clause[i]
384*e4b17023SJohn Marino || p2->clause [i] > p2->clause[i + 1]);
385*e4b17023SJohn Marino if (p->clause[i] != p2->clause[i])
386*e4b17023SJohn Marino return false;
387*e4b17023SJohn Marino }
388*e4b17023SJohn Marino return !p2->clause[i];
389*e4b17023SJohn Marino }
390*e4b17023SJohn Marino
391*e4b17023SJohn Marino
392*e4b17023SJohn Marino /* Return P | P2. */
393*e4b17023SJohn Marino
394*e4b17023SJohn Marino static struct predicate
or_predicates(conditions conditions,struct predicate * p,struct predicate * p2)395*e4b17023SJohn Marino or_predicates (conditions conditions, struct predicate *p, struct predicate *p2)
396*e4b17023SJohn Marino {
397*e4b17023SJohn Marino struct predicate out = true_predicate ();
398*e4b17023SJohn Marino int i,j;
399*e4b17023SJohn Marino
400*e4b17023SJohn Marino /* Avoid busy work. */
401*e4b17023SJohn Marino if (false_predicate_p (p2) || true_predicate_p (p))
402*e4b17023SJohn Marino return *p;
403*e4b17023SJohn Marino if (false_predicate_p (p) || true_predicate_p (p2))
404*e4b17023SJohn Marino return *p2;
405*e4b17023SJohn Marino if (predicates_equal_p (p, p2))
406*e4b17023SJohn Marino return *p;
407*e4b17023SJohn Marino
408*e4b17023SJohn Marino /* OK, combine the predicates. */
409*e4b17023SJohn Marino for (i = 0; p->clause[i]; i++)
410*e4b17023SJohn Marino for (j = 0; p2->clause[j]; j++)
411*e4b17023SJohn Marino {
412*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES && j < MAX_CLAUSES);
413*e4b17023SJohn Marino add_clause (conditions, &out, p->clause[i] | p2->clause[j]);
414*e4b17023SJohn Marino }
415*e4b17023SJohn Marino return out;
416*e4b17023SJohn Marino }
417*e4b17023SJohn Marino
418*e4b17023SJohn Marino
419*e4b17023SJohn Marino /* Having partial truth assignment in POSSIBLE_TRUTHS, return false
420*e4b17023SJohn Marino if predicate P is known to be false. */
421*e4b17023SJohn Marino
422*e4b17023SJohn Marino static bool
evaluate_predicate(struct predicate * p,clause_t possible_truths)423*e4b17023SJohn Marino evaluate_predicate (struct predicate *p, clause_t possible_truths)
424*e4b17023SJohn Marino {
425*e4b17023SJohn Marino int i;
426*e4b17023SJohn Marino
427*e4b17023SJohn Marino /* True remains true. */
428*e4b17023SJohn Marino if (true_predicate_p (p))
429*e4b17023SJohn Marino return true;
430*e4b17023SJohn Marino
431*e4b17023SJohn Marino gcc_assert (!(possible_truths & (1 << predicate_false_condition)));
432*e4b17023SJohn Marino
433*e4b17023SJohn Marino /* See if we can find clause we can disprove. */
434*e4b17023SJohn Marino for (i = 0; p->clause[i]; i++)
435*e4b17023SJohn Marino {
436*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES);
437*e4b17023SJohn Marino if (!(p->clause[i] & possible_truths))
438*e4b17023SJohn Marino return false;
439*e4b17023SJohn Marino }
440*e4b17023SJohn Marino return true;
441*e4b17023SJohn Marino }
442*e4b17023SJohn Marino
443*e4b17023SJohn Marino /* Return the probability in range 0...REG_BR_PROB_BASE that the predicated
444*e4b17023SJohn Marino instruction will be recomputed per invocation of the inlined call. */
445*e4b17023SJohn Marino
446*e4b17023SJohn Marino static int
predicate_probability(conditions conds,struct predicate * p,clause_t possible_truths,VEC (inline_param_summary_t,heap)* inline_param_summary)447*e4b17023SJohn Marino predicate_probability (conditions conds,
448*e4b17023SJohn Marino struct predicate *p, clause_t possible_truths,
449*e4b17023SJohn Marino VEC (inline_param_summary_t, heap) *inline_param_summary)
450*e4b17023SJohn Marino {
451*e4b17023SJohn Marino int i;
452*e4b17023SJohn Marino int combined_prob = REG_BR_PROB_BASE;
453*e4b17023SJohn Marino
454*e4b17023SJohn Marino /* True remains true. */
455*e4b17023SJohn Marino if (true_predicate_p (p))
456*e4b17023SJohn Marino return REG_BR_PROB_BASE;
457*e4b17023SJohn Marino
458*e4b17023SJohn Marino if (false_predicate_p (p))
459*e4b17023SJohn Marino return 0;
460*e4b17023SJohn Marino
461*e4b17023SJohn Marino gcc_assert (!(possible_truths & (1 << predicate_false_condition)));
462*e4b17023SJohn Marino
463*e4b17023SJohn Marino /* See if we can find clause we can disprove. */
464*e4b17023SJohn Marino for (i = 0; p->clause[i]; i++)
465*e4b17023SJohn Marino {
466*e4b17023SJohn Marino gcc_checking_assert (i < MAX_CLAUSES);
467*e4b17023SJohn Marino if (!(p->clause[i] & possible_truths))
468*e4b17023SJohn Marino return 0;
469*e4b17023SJohn Marino else
470*e4b17023SJohn Marino {
471*e4b17023SJohn Marino int this_prob = 0;
472*e4b17023SJohn Marino int i2;
473*e4b17023SJohn Marino if (!inline_param_summary)
474*e4b17023SJohn Marino return REG_BR_PROB_BASE;
475*e4b17023SJohn Marino for (i2 = 0; i2 < NUM_CONDITIONS; i2++)
476*e4b17023SJohn Marino if ((p->clause[i] & possible_truths) & (1 << i2))
477*e4b17023SJohn Marino {
478*e4b17023SJohn Marino if (i2 >= predicate_first_dynamic_condition)
479*e4b17023SJohn Marino {
480*e4b17023SJohn Marino condition *c = VEC_index
481*e4b17023SJohn Marino (condition, conds,
482*e4b17023SJohn Marino i2 - predicate_first_dynamic_condition);
483*e4b17023SJohn Marino if (c->code == CHANGED
484*e4b17023SJohn Marino && (c->operand_num
485*e4b17023SJohn Marino < (int) VEC_length (inline_param_summary_t,
486*e4b17023SJohn Marino inline_param_summary)))
487*e4b17023SJohn Marino {
488*e4b17023SJohn Marino int iprob = VEC_index (inline_param_summary_t,
489*e4b17023SJohn Marino inline_param_summary,
490*e4b17023SJohn Marino c->operand_num)->change_prob;
491*e4b17023SJohn Marino this_prob = MAX (this_prob, iprob);
492*e4b17023SJohn Marino }
493*e4b17023SJohn Marino else
494*e4b17023SJohn Marino this_prob = REG_BR_PROB_BASE;
495*e4b17023SJohn Marino }
496*e4b17023SJohn Marino else
497*e4b17023SJohn Marino this_prob = REG_BR_PROB_BASE;
498*e4b17023SJohn Marino }
499*e4b17023SJohn Marino combined_prob = MIN (this_prob, combined_prob);
500*e4b17023SJohn Marino if (!combined_prob)
501*e4b17023SJohn Marino return 0;
502*e4b17023SJohn Marino }
503*e4b17023SJohn Marino }
504*e4b17023SJohn Marino return combined_prob;
505*e4b17023SJohn Marino }
506*e4b17023SJohn Marino
507*e4b17023SJohn Marino
508*e4b17023SJohn Marino /* Dump conditional COND. */
509*e4b17023SJohn Marino
510*e4b17023SJohn Marino static void
dump_condition(FILE * f,conditions conditions,int cond)511*e4b17023SJohn Marino dump_condition (FILE *f, conditions conditions, int cond)
512*e4b17023SJohn Marino {
513*e4b17023SJohn Marino condition *c;
514*e4b17023SJohn Marino if (cond == predicate_false_condition)
515*e4b17023SJohn Marino fprintf (f, "false");
516*e4b17023SJohn Marino else if (cond == predicate_not_inlined_condition)
517*e4b17023SJohn Marino fprintf (f, "not inlined");
518*e4b17023SJohn Marino else
519*e4b17023SJohn Marino {
520*e4b17023SJohn Marino c = VEC_index (condition, conditions,
521*e4b17023SJohn Marino cond - predicate_first_dynamic_condition);
522*e4b17023SJohn Marino fprintf (f, "op%i", c->operand_num);
523*e4b17023SJohn Marino if (c->code == IS_NOT_CONSTANT)
524*e4b17023SJohn Marino {
525*e4b17023SJohn Marino fprintf (f, " not constant");
526*e4b17023SJohn Marino return;
527*e4b17023SJohn Marino }
528*e4b17023SJohn Marino if (c->code == CHANGED)
529*e4b17023SJohn Marino {
530*e4b17023SJohn Marino fprintf (f, " changed");
531*e4b17023SJohn Marino return;
532*e4b17023SJohn Marino }
533*e4b17023SJohn Marino fprintf (f, " %s ", op_symbol_code (c->code));
534*e4b17023SJohn Marino print_generic_expr (f, c->val, 1);
535*e4b17023SJohn Marino }
536*e4b17023SJohn Marino }
537*e4b17023SJohn Marino
538*e4b17023SJohn Marino
539*e4b17023SJohn Marino /* Dump clause CLAUSE. */
540*e4b17023SJohn Marino
541*e4b17023SJohn Marino static void
dump_clause(FILE * f,conditions conds,clause_t clause)542*e4b17023SJohn Marino dump_clause (FILE *f, conditions conds, clause_t clause)
543*e4b17023SJohn Marino {
544*e4b17023SJohn Marino int i;
545*e4b17023SJohn Marino bool found = false;
546*e4b17023SJohn Marino fprintf (f, "(");
547*e4b17023SJohn Marino if (!clause)
548*e4b17023SJohn Marino fprintf (f, "true");
549*e4b17023SJohn Marino for (i = 0; i < NUM_CONDITIONS; i++)
550*e4b17023SJohn Marino if (clause & (1 << i))
551*e4b17023SJohn Marino {
552*e4b17023SJohn Marino if (found)
553*e4b17023SJohn Marino fprintf (f, " || ");
554*e4b17023SJohn Marino found = true;
555*e4b17023SJohn Marino dump_condition (f, conds, i);
556*e4b17023SJohn Marino }
557*e4b17023SJohn Marino fprintf (f, ")");
558*e4b17023SJohn Marino }
559*e4b17023SJohn Marino
560*e4b17023SJohn Marino
561*e4b17023SJohn Marino /* Dump predicate PREDICATE. */
562*e4b17023SJohn Marino
563*e4b17023SJohn Marino static void
dump_predicate(FILE * f,conditions conds,struct predicate * pred)564*e4b17023SJohn Marino dump_predicate (FILE *f, conditions conds, struct predicate *pred)
565*e4b17023SJohn Marino {
566*e4b17023SJohn Marino int i;
567*e4b17023SJohn Marino if (true_predicate_p (pred))
568*e4b17023SJohn Marino dump_clause (f, conds, 0);
569*e4b17023SJohn Marino else
570*e4b17023SJohn Marino for (i = 0; pred->clause[i]; i++)
571*e4b17023SJohn Marino {
572*e4b17023SJohn Marino if (i)
573*e4b17023SJohn Marino fprintf (f, " && ");
574*e4b17023SJohn Marino dump_clause (f, conds, pred->clause[i]);
575*e4b17023SJohn Marino }
576*e4b17023SJohn Marino fprintf (f, "\n");
577*e4b17023SJohn Marino }
578*e4b17023SJohn Marino
579*e4b17023SJohn Marino
580*e4b17023SJohn Marino /* Record SIZE and TIME under condition PRED into the inline summary. */
581*e4b17023SJohn Marino
582*e4b17023SJohn Marino static void
account_size_time(struct inline_summary * summary,int size,int time,struct predicate * pred)583*e4b17023SJohn Marino account_size_time (struct inline_summary *summary, int size, int time,
584*e4b17023SJohn Marino struct predicate *pred)
585*e4b17023SJohn Marino {
586*e4b17023SJohn Marino size_time_entry *e;
587*e4b17023SJohn Marino bool found = false;
588*e4b17023SJohn Marino int i;
589*e4b17023SJohn Marino
590*e4b17023SJohn Marino if (false_predicate_p (pred))
591*e4b17023SJohn Marino return;
592*e4b17023SJohn Marino
593*e4b17023SJohn Marino /* We need to create initial empty unconitional clause, but otherwie
594*e4b17023SJohn Marino we don't need to account empty times and sizes. */
595*e4b17023SJohn Marino if (!size && !time && summary->entry)
596*e4b17023SJohn Marino return;
597*e4b17023SJohn Marino
598*e4b17023SJohn Marino /* Watch overflow that might result from insane profiles. */
599*e4b17023SJohn Marino if (time > MAX_TIME * INLINE_TIME_SCALE)
600*e4b17023SJohn Marino time = MAX_TIME * INLINE_TIME_SCALE;
601*e4b17023SJohn Marino gcc_assert (time >= 0);
602*e4b17023SJohn Marino
603*e4b17023SJohn Marino for (i = 0; VEC_iterate (size_time_entry, summary->entry, i, e); i++)
604*e4b17023SJohn Marino if (predicates_equal_p (&e->predicate, pred))
605*e4b17023SJohn Marino {
606*e4b17023SJohn Marino found = true;
607*e4b17023SJohn Marino break;
608*e4b17023SJohn Marino }
609*e4b17023SJohn Marino if (i == 32)
610*e4b17023SJohn Marino {
611*e4b17023SJohn Marino i = 0;
612*e4b17023SJohn Marino found = true;
613*e4b17023SJohn Marino e = VEC_index (size_time_entry, summary->entry, 0);
614*e4b17023SJohn Marino gcc_assert (!e->predicate.clause[0]);
615*e4b17023SJohn Marino }
616*e4b17023SJohn Marino if (dump_file && (dump_flags & TDF_DETAILS) && (time || size))
617*e4b17023SJohn Marino {
618*e4b17023SJohn Marino fprintf (dump_file, "\t\tAccounting size:%3.2f, time:%3.2f on %spredicate:",
619*e4b17023SJohn Marino ((double)size) / INLINE_SIZE_SCALE,
620*e4b17023SJohn Marino ((double)time) / INLINE_TIME_SCALE,
621*e4b17023SJohn Marino found ? "" : "new ");
622*e4b17023SJohn Marino dump_predicate (dump_file, summary->conds, pred);
623*e4b17023SJohn Marino }
624*e4b17023SJohn Marino if (!found)
625*e4b17023SJohn Marino {
626*e4b17023SJohn Marino struct size_time_entry new_entry;
627*e4b17023SJohn Marino new_entry.size = size;
628*e4b17023SJohn Marino new_entry.time = time;
629*e4b17023SJohn Marino new_entry.predicate = *pred;
630*e4b17023SJohn Marino VEC_safe_push (size_time_entry, gc, summary->entry, &new_entry);
631*e4b17023SJohn Marino }
632*e4b17023SJohn Marino else
633*e4b17023SJohn Marino {
634*e4b17023SJohn Marino e->size += size;
635*e4b17023SJohn Marino e->time += time;
636*e4b17023SJohn Marino if (e->time > MAX_TIME * INLINE_TIME_SCALE)
637*e4b17023SJohn Marino e->time = MAX_TIME * INLINE_TIME_SCALE;
638*e4b17023SJohn Marino }
639*e4b17023SJohn Marino }
640*e4b17023SJohn Marino
641*e4b17023SJohn Marino /* Set predicate for edge E. */
642*e4b17023SJohn Marino
643*e4b17023SJohn Marino static void
edge_set_predicate(struct cgraph_edge * e,struct predicate * predicate)644*e4b17023SJohn Marino edge_set_predicate (struct cgraph_edge *e, struct predicate *predicate)
645*e4b17023SJohn Marino {
646*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
647*e4b17023SJohn Marino if (predicate && !true_predicate_p (predicate))
648*e4b17023SJohn Marino {
649*e4b17023SJohn Marino if (!es->predicate)
650*e4b17023SJohn Marino es->predicate = (struct predicate *)pool_alloc (edge_predicate_pool);
651*e4b17023SJohn Marino *es->predicate = *predicate;
652*e4b17023SJohn Marino }
653*e4b17023SJohn Marino else
654*e4b17023SJohn Marino {
655*e4b17023SJohn Marino if (es->predicate)
656*e4b17023SJohn Marino pool_free (edge_predicate_pool, es->predicate);
657*e4b17023SJohn Marino es->predicate = NULL;
658*e4b17023SJohn Marino }
659*e4b17023SJohn Marino }
660*e4b17023SJohn Marino
661*e4b17023SJohn Marino
662*e4b17023SJohn Marino /* KNOWN_VALS is partial mapping of parameters of NODE to constant values.
663*e4b17023SJohn Marino Return clause of possible truths. When INLINE_P is true, assume that
664*e4b17023SJohn Marino we are inlining.
665*e4b17023SJohn Marino
666*e4b17023SJohn Marino ERROR_MARK means compile time invariant. */
667*e4b17023SJohn Marino
668*e4b17023SJohn Marino static clause_t
evaluate_conditions_for_known_args(struct cgraph_node * node,bool inline_p,VEC (tree,heap)* known_vals)669*e4b17023SJohn Marino evaluate_conditions_for_known_args (struct cgraph_node *node,
670*e4b17023SJohn Marino bool inline_p,
671*e4b17023SJohn Marino VEC (tree, heap) *known_vals)
672*e4b17023SJohn Marino {
673*e4b17023SJohn Marino clause_t clause = inline_p ? 0 : 1 << predicate_not_inlined_condition;
674*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
675*e4b17023SJohn Marino int i;
676*e4b17023SJohn Marino struct condition *c;
677*e4b17023SJohn Marino
678*e4b17023SJohn Marino for (i = 0; VEC_iterate (condition, info->conds, i, c); i++)
679*e4b17023SJohn Marino {
680*e4b17023SJohn Marino tree val;
681*e4b17023SJohn Marino tree res;
682*e4b17023SJohn Marino
683*e4b17023SJohn Marino /* We allow call stmt to have fewer arguments than the callee
684*e4b17023SJohn Marino function (especially for K&R style programs). So bound
685*e4b17023SJohn Marino check here. */
686*e4b17023SJohn Marino if (c->operand_num < (int)VEC_length (tree, known_vals))
687*e4b17023SJohn Marino val = VEC_index (tree, known_vals, c->operand_num);
688*e4b17023SJohn Marino else
689*e4b17023SJohn Marino val = NULL;
690*e4b17023SJohn Marino
691*e4b17023SJohn Marino if (val == error_mark_node && c->code != CHANGED)
692*e4b17023SJohn Marino val = NULL;
693*e4b17023SJohn Marino
694*e4b17023SJohn Marino if (!val)
695*e4b17023SJohn Marino {
696*e4b17023SJohn Marino clause |= 1 << (i + predicate_first_dynamic_condition);
697*e4b17023SJohn Marino continue;
698*e4b17023SJohn Marino }
699*e4b17023SJohn Marino if (c->code == IS_NOT_CONSTANT || c->code == CHANGED)
700*e4b17023SJohn Marino continue;
701*e4b17023SJohn Marino res = fold_binary_to_constant (c->code, boolean_type_node, val, c->val);
702*e4b17023SJohn Marino if (res
703*e4b17023SJohn Marino && integer_zerop (res))
704*e4b17023SJohn Marino continue;
705*e4b17023SJohn Marino clause |= 1 << (i + predicate_first_dynamic_condition);
706*e4b17023SJohn Marino }
707*e4b17023SJohn Marino return clause;
708*e4b17023SJohn Marino }
709*e4b17023SJohn Marino
710*e4b17023SJohn Marino
711*e4b17023SJohn Marino /* Work out what conditions might be true at invocation of E. */
712*e4b17023SJohn Marino
713*e4b17023SJohn Marino static void
evaluate_properties_for_edge(struct cgraph_edge * e,bool inline_p,clause_t * clause_ptr,VEC (tree,heap)** known_vals_ptr,VEC (tree,heap)** known_binfos_ptr)714*e4b17023SJohn Marino evaluate_properties_for_edge (struct cgraph_edge *e, bool inline_p,
715*e4b17023SJohn Marino clause_t *clause_ptr,
716*e4b17023SJohn Marino VEC (tree, heap) **known_vals_ptr,
717*e4b17023SJohn Marino VEC (tree, heap) **known_binfos_ptr)
718*e4b17023SJohn Marino {
719*e4b17023SJohn Marino struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL);
720*e4b17023SJohn Marino struct inline_summary *info = inline_summary (callee);
721*e4b17023SJohn Marino VEC (tree, heap) *known_vals = NULL;
722*e4b17023SJohn Marino
723*e4b17023SJohn Marino if (clause_ptr)
724*e4b17023SJohn Marino *clause_ptr = inline_p ? 0 : 1 << predicate_not_inlined_condition;
725*e4b17023SJohn Marino if (known_vals_ptr)
726*e4b17023SJohn Marino *known_vals_ptr = NULL;
727*e4b17023SJohn Marino if (known_binfos_ptr)
728*e4b17023SJohn Marino *known_binfos_ptr = NULL;
729*e4b17023SJohn Marino
730*e4b17023SJohn Marino if (ipa_node_params_vector
731*e4b17023SJohn Marino && !e->call_stmt_cannot_inline_p
732*e4b17023SJohn Marino && ((clause_ptr && info->conds) || known_vals_ptr || known_binfos_ptr))
733*e4b17023SJohn Marino {
734*e4b17023SJohn Marino struct ipa_node_params *parms_info;
735*e4b17023SJohn Marino struct ipa_edge_args *args = IPA_EDGE_REF (e);
736*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
737*e4b17023SJohn Marino int i, count = ipa_get_cs_argument_count (args);
738*e4b17023SJohn Marino
739*e4b17023SJohn Marino if (e->caller->global.inlined_to)
740*e4b17023SJohn Marino parms_info = IPA_NODE_REF (e->caller->global.inlined_to);
741*e4b17023SJohn Marino else
742*e4b17023SJohn Marino parms_info = IPA_NODE_REF (e->caller);
743*e4b17023SJohn Marino
744*e4b17023SJohn Marino if (count && (info->conds || known_vals_ptr))
745*e4b17023SJohn Marino VEC_safe_grow_cleared (tree, heap, known_vals, count);
746*e4b17023SJohn Marino if (count && known_binfos_ptr)
747*e4b17023SJohn Marino VEC_safe_grow_cleared (tree, heap, *known_binfos_ptr, count);
748*e4b17023SJohn Marino
749*e4b17023SJohn Marino for (i = 0; i < count; i++)
750*e4b17023SJohn Marino {
751*e4b17023SJohn Marino tree cst = ipa_value_from_jfunc (parms_info,
752*e4b17023SJohn Marino ipa_get_ith_jump_func (args, i));
753*e4b17023SJohn Marino if (cst)
754*e4b17023SJohn Marino {
755*e4b17023SJohn Marino if (known_vals && TREE_CODE (cst) != TREE_BINFO)
756*e4b17023SJohn Marino VEC_replace (tree, known_vals, i, cst);
757*e4b17023SJohn Marino else if (known_binfos_ptr != NULL && TREE_CODE (cst) == TREE_BINFO)
758*e4b17023SJohn Marino VEC_replace (tree, *known_binfos_ptr, i, cst);
759*e4b17023SJohn Marino }
760*e4b17023SJohn Marino else if (inline_p
761*e4b17023SJohn Marino && !VEC_index (inline_param_summary_t,
762*e4b17023SJohn Marino es->param,
763*e4b17023SJohn Marino i)->change_prob)
764*e4b17023SJohn Marino VEC_replace (tree, known_vals, i, error_mark_node);
765*e4b17023SJohn Marino }
766*e4b17023SJohn Marino }
767*e4b17023SJohn Marino
768*e4b17023SJohn Marino if (clause_ptr)
769*e4b17023SJohn Marino *clause_ptr = evaluate_conditions_for_known_args (callee, inline_p,
770*e4b17023SJohn Marino known_vals);
771*e4b17023SJohn Marino
772*e4b17023SJohn Marino if (known_vals_ptr)
773*e4b17023SJohn Marino *known_vals_ptr = known_vals;
774*e4b17023SJohn Marino else
775*e4b17023SJohn Marino VEC_free (tree, heap, known_vals);
776*e4b17023SJohn Marino }
777*e4b17023SJohn Marino
778*e4b17023SJohn Marino
779*e4b17023SJohn Marino /* Allocate the inline summary vector or resize it to cover all cgraph nodes. */
780*e4b17023SJohn Marino
781*e4b17023SJohn Marino static void
inline_summary_alloc(void)782*e4b17023SJohn Marino inline_summary_alloc (void)
783*e4b17023SJohn Marino {
784*e4b17023SJohn Marino if (!node_removal_hook_holder)
785*e4b17023SJohn Marino node_removal_hook_holder =
786*e4b17023SJohn Marino cgraph_add_node_removal_hook (&inline_node_removal_hook, NULL);
787*e4b17023SJohn Marino if (!edge_removal_hook_holder)
788*e4b17023SJohn Marino edge_removal_hook_holder =
789*e4b17023SJohn Marino cgraph_add_edge_removal_hook (&inline_edge_removal_hook, NULL);
790*e4b17023SJohn Marino if (!node_duplication_hook_holder)
791*e4b17023SJohn Marino node_duplication_hook_holder =
792*e4b17023SJohn Marino cgraph_add_node_duplication_hook (&inline_node_duplication_hook, NULL);
793*e4b17023SJohn Marino if (!edge_duplication_hook_holder)
794*e4b17023SJohn Marino edge_duplication_hook_holder =
795*e4b17023SJohn Marino cgraph_add_edge_duplication_hook (&inline_edge_duplication_hook, NULL);
796*e4b17023SJohn Marino
797*e4b17023SJohn Marino if (VEC_length (inline_summary_t, inline_summary_vec)
798*e4b17023SJohn Marino <= (unsigned) cgraph_max_uid)
799*e4b17023SJohn Marino VEC_safe_grow_cleared (inline_summary_t, gc,
800*e4b17023SJohn Marino inline_summary_vec, cgraph_max_uid + 1);
801*e4b17023SJohn Marino if (VEC_length (inline_edge_summary_t, inline_edge_summary_vec)
802*e4b17023SJohn Marino <= (unsigned) cgraph_edge_max_uid)
803*e4b17023SJohn Marino VEC_safe_grow_cleared (inline_edge_summary_t, heap,
804*e4b17023SJohn Marino inline_edge_summary_vec, cgraph_edge_max_uid + 1);
805*e4b17023SJohn Marino if (!edge_predicate_pool)
806*e4b17023SJohn Marino edge_predicate_pool = create_alloc_pool ("edge predicates",
807*e4b17023SJohn Marino sizeof (struct predicate),
808*e4b17023SJohn Marino 10);
809*e4b17023SJohn Marino }
810*e4b17023SJohn Marino
811*e4b17023SJohn Marino /* We are called multiple time for given function; clear
812*e4b17023SJohn Marino data from previous run so they are not cumulated. */
813*e4b17023SJohn Marino
814*e4b17023SJohn Marino static void
reset_inline_edge_summary(struct cgraph_edge * e)815*e4b17023SJohn Marino reset_inline_edge_summary (struct cgraph_edge *e)
816*e4b17023SJohn Marino {
817*e4b17023SJohn Marino if (e->uid
818*e4b17023SJohn Marino < (int)VEC_length (inline_edge_summary_t, inline_edge_summary_vec))
819*e4b17023SJohn Marino {
820*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
821*e4b17023SJohn Marino
822*e4b17023SJohn Marino es->call_stmt_size = es->call_stmt_time =0;
823*e4b17023SJohn Marino if (es->predicate)
824*e4b17023SJohn Marino pool_free (edge_predicate_pool, es->predicate);
825*e4b17023SJohn Marino es->predicate = NULL;
826*e4b17023SJohn Marino VEC_free (inline_param_summary_t, heap, es->param);
827*e4b17023SJohn Marino }
828*e4b17023SJohn Marino }
829*e4b17023SJohn Marino
830*e4b17023SJohn Marino /* We are called multiple time for given function; clear
831*e4b17023SJohn Marino data from previous run so they are not cumulated. */
832*e4b17023SJohn Marino
833*e4b17023SJohn Marino static void
reset_inline_summary(struct cgraph_node * node)834*e4b17023SJohn Marino reset_inline_summary (struct cgraph_node *node)
835*e4b17023SJohn Marino {
836*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
837*e4b17023SJohn Marino struct cgraph_edge *e;
838*e4b17023SJohn Marino
839*e4b17023SJohn Marino info->self_size = info->self_time = 0;
840*e4b17023SJohn Marino info->estimated_stack_size = 0;
841*e4b17023SJohn Marino info->estimated_self_stack_size = 0;
842*e4b17023SJohn Marino info->stack_frame_offset = 0;
843*e4b17023SJohn Marino info->size = 0;
844*e4b17023SJohn Marino info->time = 0;
845*e4b17023SJohn Marino VEC_free (condition, gc, info->conds);
846*e4b17023SJohn Marino VEC_free (size_time_entry,gc, info->entry);
847*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
848*e4b17023SJohn Marino reset_inline_edge_summary (e);
849*e4b17023SJohn Marino for (e = node->indirect_calls; e; e = e->next_callee)
850*e4b17023SJohn Marino reset_inline_edge_summary (e);
851*e4b17023SJohn Marino }
852*e4b17023SJohn Marino
853*e4b17023SJohn Marino /* Hook that is called by cgraph.c when a node is removed. */
854*e4b17023SJohn Marino
855*e4b17023SJohn Marino static void
inline_node_removal_hook(struct cgraph_node * node,void * data ATTRIBUTE_UNUSED)856*e4b17023SJohn Marino inline_node_removal_hook (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
857*e4b17023SJohn Marino {
858*e4b17023SJohn Marino struct inline_summary *info;
859*e4b17023SJohn Marino if (VEC_length (inline_summary_t, inline_summary_vec)
860*e4b17023SJohn Marino <= (unsigned)node->uid)
861*e4b17023SJohn Marino return;
862*e4b17023SJohn Marino info = inline_summary (node);
863*e4b17023SJohn Marino reset_inline_summary (node);
864*e4b17023SJohn Marino memset (info, 0, sizeof (inline_summary_t));
865*e4b17023SJohn Marino }
866*e4b17023SJohn Marino
867*e4b17023SJohn Marino
868*e4b17023SJohn Marino /* Hook that is called by cgraph.c when a node is duplicated. */
869*e4b17023SJohn Marino
870*e4b17023SJohn Marino static void
inline_node_duplication_hook(struct cgraph_node * src,struct cgraph_node * dst,ATTRIBUTE_UNUSED void * data)871*e4b17023SJohn Marino inline_node_duplication_hook (struct cgraph_node *src, struct cgraph_node *dst,
872*e4b17023SJohn Marino ATTRIBUTE_UNUSED void *data)
873*e4b17023SJohn Marino {
874*e4b17023SJohn Marino struct inline_summary *info;
875*e4b17023SJohn Marino inline_summary_alloc ();
876*e4b17023SJohn Marino info = inline_summary (dst);
877*e4b17023SJohn Marino memcpy (info, inline_summary (src),
878*e4b17023SJohn Marino sizeof (struct inline_summary));
879*e4b17023SJohn Marino /* TODO: as an optimization, we may avoid copying conditions
880*e4b17023SJohn Marino that are known to be false or true. */
881*e4b17023SJohn Marino info->conds = VEC_copy (condition, gc, info->conds);
882*e4b17023SJohn Marino
883*e4b17023SJohn Marino /* When there are any replacements in the function body, see if we can figure
884*e4b17023SJohn Marino out that something was optimized out. */
885*e4b17023SJohn Marino if (ipa_node_params_vector && dst->clone.tree_map)
886*e4b17023SJohn Marino {
887*e4b17023SJohn Marino VEC(size_time_entry,gc) *entry = info->entry;
888*e4b17023SJohn Marino /* Use SRC parm info since it may not be copied yet. */
889*e4b17023SJohn Marino struct ipa_node_params *parms_info = IPA_NODE_REF (src);
890*e4b17023SJohn Marino VEC (tree, heap) *known_vals = NULL;
891*e4b17023SJohn Marino int count = ipa_get_param_count (parms_info);
892*e4b17023SJohn Marino int i,j;
893*e4b17023SJohn Marino clause_t possible_truths;
894*e4b17023SJohn Marino struct predicate true_pred = true_predicate ();
895*e4b17023SJohn Marino size_time_entry *e;
896*e4b17023SJohn Marino int optimized_out_size = 0;
897*e4b17023SJohn Marino gcov_type optimized_out_time = 0;
898*e4b17023SJohn Marino bool inlined_to_p = false;
899*e4b17023SJohn Marino struct cgraph_edge *edge;
900*e4b17023SJohn Marino
901*e4b17023SJohn Marino info->entry = 0;
902*e4b17023SJohn Marino VEC_safe_grow_cleared (tree, heap, known_vals, count);
903*e4b17023SJohn Marino for (i = 0; i < count; i++)
904*e4b17023SJohn Marino {
905*e4b17023SJohn Marino tree t = ipa_get_param (parms_info, i);
906*e4b17023SJohn Marino struct ipa_replace_map *r;
907*e4b17023SJohn Marino
908*e4b17023SJohn Marino for (j = 0;
909*e4b17023SJohn Marino VEC_iterate (ipa_replace_map_p, dst->clone.tree_map, j, r);
910*e4b17023SJohn Marino j++)
911*e4b17023SJohn Marino {
912*e4b17023SJohn Marino if (r->old_tree == t
913*e4b17023SJohn Marino && r->replace_p
914*e4b17023SJohn Marino && !r->ref_p)
915*e4b17023SJohn Marino {
916*e4b17023SJohn Marino VEC_replace (tree, known_vals, i, r->new_tree);
917*e4b17023SJohn Marino break;
918*e4b17023SJohn Marino }
919*e4b17023SJohn Marino }
920*e4b17023SJohn Marino }
921*e4b17023SJohn Marino possible_truths = evaluate_conditions_for_known_args (dst,
922*e4b17023SJohn Marino false, known_vals);
923*e4b17023SJohn Marino VEC_free (tree, heap, known_vals);
924*e4b17023SJohn Marino
925*e4b17023SJohn Marino account_size_time (info, 0, 0, &true_pred);
926*e4b17023SJohn Marino
927*e4b17023SJohn Marino /* Remap size_time vectors.
928*e4b17023SJohn Marino Simplify the predicate by prunning out alternatives that are known
929*e4b17023SJohn Marino to be false.
930*e4b17023SJohn Marino TODO: as on optimization, we can also eliminate conditions known
931*e4b17023SJohn Marino to be true. */
932*e4b17023SJohn Marino for (i = 0; VEC_iterate (size_time_entry, entry, i, e); i++)
933*e4b17023SJohn Marino {
934*e4b17023SJohn Marino struct predicate new_predicate = true_predicate ();
935*e4b17023SJohn Marino for (j = 0; e->predicate.clause[j]; j++)
936*e4b17023SJohn Marino if (!(possible_truths & e->predicate.clause[j]))
937*e4b17023SJohn Marino {
938*e4b17023SJohn Marino new_predicate = false_predicate ();
939*e4b17023SJohn Marino break;
940*e4b17023SJohn Marino }
941*e4b17023SJohn Marino else
942*e4b17023SJohn Marino add_clause (info->conds, &new_predicate,
943*e4b17023SJohn Marino possible_truths & e->predicate.clause[j]);
944*e4b17023SJohn Marino if (false_predicate_p (&new_predicate))
945*e4b17023SJohn Marino {
946*e4b17023SJohn Marino optimized_out_size += e->size;
947*e4b17023SJohn Marino optimized_out_time += e->time;
948*e4b17023SJohn Marino }
949*e4b17023SJohn Marino else
950*e4b17023SJohn Marino account_size_time (info, e->size, e->time, &new_predicate);
951*e4b17023SJohn Marino }
952*e4b17023SJohn Marino
953*e4b17023SJohn Marino /* Remap edge predicates with the same simplification as above.
954*e4b17023SJohn Marino Also copy constantness arrays. */
955*e4b17023SJohn Marino for (edge = dst->callees; edge; edge = edge->next_callee)
956*e4b17023SJohn Marino {
957*e4b17023SJohn Marino struct predicate new_predicate = true_predicate ();
958*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
959*e4b17023SJohn Marino
960*e4b17023SJohn Marino if (!edge->inline_failed)
961*e4b17023SJohn Marino inlined_to_p = true;
962*e4b17023SJohn Marino if (!es->predicate)
963*e4b17023SJohn Marino continue;
964*e4b17023SJohn Marino for (j = 0; es->predicate->clause[j]; j++)
965*e4b17023SJohn Marino if (!(possible_truths & es->predicate->clause[j]))
966*e4b17023SJohn Marino {
967*e4b17023SJohn Marino new_predicate = false_predicate ();
968*e4b17023SJohn Marino break;
969*e4b17023SJohn Marino }
970*e4b17023SJohn Marino else
971*e4b17023SJohn Marino add_clause (info->conds, &new_predicate,
972*e4b17023SJohn Marino possible_truths & es->predicate->clause[j]);
973*e4b17023SJohn Marino if (false_predicate_p (&new_predicate)
974*e4b17023SJohn Marino && !false_predicate_p (es->predicate))
975*e4b17023SJohn Marino {
976*e4b17023SJohn Marino optimized_out_size += es->call_stmt_size * INLINE_SIZE_SCALE;
977*e4b17023SJohn Marino optimized_out_time += (es->call_stmt_time
978*e4b17023SJohn Marino * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE)
979*e4b17023SJohn Marino * edge->frequency);
980*e4b17023SJohn Marino edge->frequency = 0;
981*e4b17023SJohn Marino }
982*e4b17023SJohn Marino *es->predicate = new_predicate;
983*e4b17023SJohn Marino }
984*e4b17023SJohn Marino
985*e4b17023SJohn Marino /* Remap indirect edge predicates with the same simplificaiton as above.
986*e4b17023SJohn Marino Also copy constantness arrays. */
987*e4b17023SJohn Marino for (edge = dst->indirect_calls; edge; edge = edge->next_callee)
988*e4b17023SJohn Marino {
989*e4b17023SJohn Marino struct predicate new_predicate = true_predicate ();
990*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
991*e4b17023SJohn Marino
992*e4b17023SJohn Marino if (!edge->inline_failed)
993*e4b17023SJohn Marino inlined_to_p = true;
994*e4b17023SJohn Marino if (!es->predicate)
995*e4b17023SJohn Marino continue;
996*e4b17023SJohn Marino for (j = 0; es->predicate->clause[j]; j++)
997*e4b17023SJohn Marino if (!(possible_truths & es->predicate->clause[j]))
998*e4b17023SJohn Marino {
999*e4b17023SJohn Marino new_predicate = false_predicate ();
1000*e4b17023SJohn Marino break;
1001*e4b17023SJohn Marino }
1002*e4b17023SJohn Marino else
1003*e4b17023SJohn Marino add_clause (info->conds, &new_predicate,
1004*e4b17023SJohn Marino possible_truths & es->predicate->clause[j]);
1005*e4b17023SJohn Marino if (false_predicate_p (&new_predicate)
1006*e4b17023SJohn Marino && !false_predicate_p (es->predicate))
1007*e4b17023SJohn Marino {
1008*e4b17023SJohn Marino optimized_out_size += es->call_stmt_size * INLINE_SIZE_SCALE;
1009*e4b17023SJohn Marino optimized_out_time += (es->call_stmt_time
1010*e4b17023SJohn Marino * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE)
1011*e4b17023SJohn Marino * edge->frequency);
1012*e4b17023SJohn Marino edge->frequency = 0;
1013*e4b17023SJohn Marino }
1014*e4b17023SJohn Marino *es->predicate = new_predicate;
1015*e4b17023SJohn Marino }
1016*e4b17023SJohn Marino
1017*e4b17023SJohn Marino /* If inliner or someone after inliner will ever start producing
1018*e4b17023SJohn Marino non-trivial clones, we will get trouble with lack of information
1019*e4b17023SJohn Marino about updating self sizes, because size vectors already contains
1020*e4b17023SJohn Marino sizes of the calees. */
1021*e4b17023SJohn Marino gcc_assert (!inlined_to_p
1022*e4b17023SJohn Marino || (!optimized_out_size && !optimized_out_time));
1023*e4b17023SJohn Marino
1024*e4b17023SJohn Marino info->size -= optimized_out_size / INLINE_SIZE_SCALE;
1025*e4b17023SJohn Marino info->self_size -= optimized_out_size / INLINE_SIZE_SCALE;
1026*e4b17023SJohn Marino gcc_assert (info->size > 0);
1027*e4b17023SJohn Marino gcc_assert (info->self_size > 0);
1028*e4b17023SJohn Marino
1029*e4b17023SJohn Marino optimized_out_time /= INLINE_TIME_SCALE;
1030*e4b17023SJohn Marino if (optimized_out_time > MAX_TIME)
1031*e4b17023SJohn Marino optimized_out_time = MAX_TIME;
1032*e4b17023SJohn Marino info->time -= optimized_out_time;
1033*e4b17023SJohn Marino info->self_time -= optimized_out_time;
1034*e4b17023SJohn Marino if (info->time < 0)
1035*e4b17023SJohn Marino info->time = 0;
1036*e4b17023SJohn Marino if (info->self_time < 0)
1037*e4b17023SJohn Marino info->self_time = 0;
1038*e4b17023SJohn Marino }
1039*e4b17023SJohn Marino else
1040*e4b17023SJohn Marino info->entry = VEC_copy (size_time_entry, gc, info->entry);
1041*e4b17023SJohn Marino }
1042*e4b17023SJohn Marino
1043*e4b17023SJohn Marino
1044*e4b17023SJohn Marino /* Hook that is called by cgraph.c when a node is duplicated. */
1045*e4b17023SJohn Marino
1046*e4b17023SJohn Marino static void
inline_edge_duplication_hook(struct cgraph_edge * src,struct cgraph_edge * dst,ATTRIBUTE_UNUSED void * data)1047*e4b17023SJohn Marino inline_edge_duplication_hook (struct cgraph_edge *src, struct cgraph_edge *dst,
1048*e4b17023SJohn Marino ATTRIBUTE_UNUSED void *data)
1049*e4b17023SJohn Marino {
1050*e4b17023SJohn Marino struct inline_edge_summary *info;
1051*e4b17023SJohn Marino struct inline_edge_summary *srcinfo;
1052*e4b17023SJohn Marino inline_summary_alloc ();
1053*e4b17023SJohn Marino info = inline_edge_summary (dst);
1054*e4b17023SJohn Marino srcinfo = inline_edge_summary (src);
1055*e4b17023SJohn Marino memcpy (info, srcinfo,
1056*e4b17023SJohn Marino sizeof (struct inline_edge_summary));
1057*e4b17023SJohn Marino info->predicate = NULL;
1058*e4b17023SJohn Marino edge_set_predicate (dst, srcinfo->predicate);
1059*e4b17023SJohn Marino info->param = VEC_copy (inline_param_summary_t, heap, srcinfo->param);
1060*e4b17023SJohn Marino }
1061*e4b17023SJohn Marino
1062*e4b17023SJohn Marino
1063*e4b17023SJohn Marino /* Keep edge cache consistent across edge removal. */
1064*e4b17023SJohn Marino
1065*e4b17023SJohn Marino static void
inline_edge_removal_hook(struct cgraph_edge * edge,void * data ATTRIBUTE_UNUSED)1066*e4b17023SJohn Marino inline_edge_removal_hook (struct cgraph_edge *edge, void *data ATTRIBUTE_UNUSED)
1067*e4b17023SJohn Marino {
1068*e4b17023SJohn Marino if (edge_growth_cache)
1069*e4b17023SJohn Marino reset_edge_growth_cache (edge);
1070*e4b17023SJohn Marino reset_inline_edge_summary (edge);
1071*e4b17023SJohn Marino }
1072*e4b17023SJohn Marino
1073*e4b17023SJohn Marino
1074*e4b17023SJohn Marino /* Initialize growth caches. */
1075*e4b17023SJohn Marino
1076*e4b17023SJohn Marino void
initialize_growth_caches(void)1077*e4b17023SJohn Marino initialize_growth_caches (void)
1078*e4b17023SJohn Marino {
1079*e4b17023SJohn Marino if (cgraph_edge_max_uid)
1080*e4b17023SJohn Marino VEC_safe_grow_cleared (edge_growth_cache_entry, heap, edge_growth_cache,
1081*e4b17023SJohn Marino cgraph_edge_max_uid);
1082*e4b17023SJohn Marino if (cgraph_max_uid)
1083*e4b17023SJohn Marino VEC_safe_grow_cleared (int, heap, node_growth_cache, cgraph_max_uid);
1084*e4b17023SJohn Marino }
1085*e4b17023SJohn Marino
1086*e4b17023SJohn Marino
1087*e4b17023SJohn Marino /* Free growth caches. */
1088*e4b17023SJohn Marino
1089*e4b17023SJohn Marino void
free_growth_caches(void)1090*e4b17023SJohn Marino free_growth_caches (void)
1091*e4b17023SJohn Marino {
1092*e4b17023SJohn Marino VEC_free (edge_growth_cache_entry, heap, edge_growth_cache);
1093*e4b17023SJohn Marino edge_growth_cache = 0;
1094*e4b17023SJohn Marino VEC_free (int, heap, node_growth_cache);
1095*e4b17023SJohn Marino node_growth_cache = 0;
1096*e4b17023SJohn Marino }
1097*e4b17023SJohn Marino
1098*e4b17023SJohn Marino
1099*e4b17023SJohn Marino /* Dump edge summaries associated to NODE and recursively to all clones.
1100*e4b17023SJohn Marino Indent by INDENT. */
1101*e4b17023SJohn Marino
1102*e4b17023SJohn Marino static void
dump_inline_edge_summary(FILE * f,int indent,struct cgraph_node * node,struct inline_summary * info)1103*e4b17023SJohn Marino dump_inline_edge_summary (FILE * f, int indent, struct cgraph_node *node,
1104*e4b17023SJohn Marino struct inline_summary *info)
1105*e4b17023SJohn Marino {
1106*e4b17023SJohn Marino struct cgraph_edge *edge;
1107*e4b17023SJohn Marino for (edge = node->callees; edge; edge = edge->next_callee)
1108*e4b17023SJohn Marino {
1109*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
1110*e4b17023SJohn Marino struct cgraph_node *callee = cgraph_function_or_thunk_node (edge->callee, NULL);
1111*e4b17023SJohn Marino int i;
1112*e4b17023SJohn Marino
1113*e4b17023SJohn Marino fprintf (f, "%*s%s/%i %s\n%*s loop depth:%2i freq:%4i size:%2i time: %2i callee size:%2i stack:%2i",
1114*e4b17023SJohn Marino indent, "", cgraph_node_name (callee),
1115*e4b17023SJohn Marino callee->uid,
1116*e4b17023SJohn Marino !edge->inline_failed ? "inlined"
1117*e4b17023SJohn Marino : cgraph_inline_failed_string (edge->inline_failed),
1118*e4b17023SJohn Marino indent, "",
1119*e4b17023SJohn Marino es->loop_depth,
1120*e4b17023SJohn Marino edge->frequency,
1121*e4b17023SJohn Marino es->call_stmt_size,
1122*e4b17023SJohn Marino es->call_stmt_time,
1123*e4b17023SJohn Marino (int)inline_summary (callee)->size / INLINE_SIZE_SCALE,
1124*e4b17023SJohn Marino (int)inline_summary (callee)->estimated_stack_size);
1125*e4b17023SJohn Marino
1126*e4b17023SJohn Marino if (es->predicate)
1127*e4b17023SJohn Marino {
1128*e4b17023SJohn Marino fprintf (f, " predicate: ");
1129*e4b17023SJohn Marino dump_predicate (f, info->conds, es->predicate);
1130*e4b17023SJohn Marino }
1131*e4b17023SJohn Marino else
1132*e4b17023SJohn Marino fprintf (f, "\n");
1133*e4b17023SJohn Marino if (es->param)
1134*e4b17023SJohn Marino for (i = 0; i < (int)VEC_length (inline_param_summary_t, es->param);
1135*e4b17023SJohn Marino i++)
1136*e4b17023SJohn Marino {
1137*e4b17023SJohn Marino int prob = VEC_index (inline_param_summary_t,
1138*e4b17023SJohn Marino es->param, i)->change_prob;
1139*e4b17023SJohn Marino
1140*e4b17023SJohn Marino if (!prob)
1141*e4b17023SJohn Marino fprintf (f, "%*s op%i is compile time invariant\n",
1142*e4b17023SJohn Marino indent + 2, "", i);
1143*e4b17023SJohn Marino else if (prob != REG_BR_PROB_BASE)
1144*e4b17023SJohn Marino fprintf (f, "%*s op%i change %f%% of time\n", indent + 2, "", i,
1145*e4b17023SJohn Marino prob * 100.0 / REG_BR_PROB_BASE);
1146*e4b17023SJohn Marino }
1147*e4b17023SJohn Marino if (!edge->inline_failed)
1148*e4b17023SJohn Marino {
1149*e4b17023SJohn Marino fprintf (f, "%*sStack frame offset %i, callee self size %i,"
1150*e4b17023SJohn Marino " callee size %i\n",
1151*e4b17023SJohn Marino indent+2, "",
1152*e4b17023SJohn Marino (int)inline_summary (callee)->stack_frame_offset,
1153*e4b17023SJohn Marino (int)inline_summary (callee)->estimated_self_stack_size,
1154*e4b17023SJohn Marino (int)inline_summary (callee)->estimated_stack_size);
1155*e4b17023SJohn Marino dump_inline_edge_summary (f, indent+2, callee, info);
1156*e4b17023SJohn Marino }
1157*e4b17023SJohn Marino }
1158*e4b17023SJohn Marino for (edge = node->indirect_calls; edge; edge = edge->next_callee)
1159*e4b17023SJohn Marino {
1160*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
1161*e4b17023SJohn Marino fprintf (f, "%*sindirect call loop depth:%2i freq:%4i size:%2i"
1162*e4b17023SJohn Marino " time: %2i",
1163*e4b17023SJohn Marino indent, "",
1164*e4b17023SJohn Marino es->loop_depth,
1165*e4b17023SJohn Marino edge->frequency,
1166*e4b17023SJohn Marino es->call_stmt_size,
1167*e4b17023SJohn Marino es->call_stmt_time);
1168*e4b17023SJohn Marino if (es->predicate)
1169*e4b17023SJohn Marino {
1170*e4b17023SJohn Marino fprintf (f, "predicate: ");
1171*e4b17023SJohn Marino dump_predicate (f, info->conds, es->predicate);
1172*e4b17023SJohn Marino }
1173*e4b17023SJohn Marino else
1174*e4b17023SJohn Marino fprintf (f, "\n");
1175*e4b17023SJohn Marino }
1176*e4b17023SJohn Marino }
1177*e4b17023SJohn Marino
1178*e4b17023SJohn Marino
1179*e4b17023SJohn Marino void
dump_inline_summary(FILE * f,struct cgraph_node * node)1180*e4b17023SJohn Marino dump_inline_summary (FILE * f, struct cgraph_node *node)
1181*e4b17023SJohn Marino {
1182*e4b17023SJohn Marino if (node->analyzed)
1183*e4b17023SJohn Marino {
1184*e4b17023SJohn Marino struct inline_summary *s = inline_summary (node);
1185*e4b17023SJohn Marino size_time_entry *e;
1186*e4b17023SJohn Marino int i;
1187*e4b17023SJohn Marino fprintf (f, "Inline summary for %s/%i", cgraph_node_name (node),
1188*e4b17023SJohn Marino node->uid);
1189*e4b17023SJohn Marino if (DECL_DISREGARD_INLINE_LIMITS (node->decl))
1190*e4b17023SJohn Marino fprintf (f, " always_inline");
1191*e4b17023SJohn Marino if (s->inlinable)
1192*e4b17023SJohn Marino fprintf (f, " inlinable");
1193*e4b17023SJohn Marino fprintf (f, "\n self time: %i\n",
1194*e4b17023SJohn Marino s->self_time);
1195*e4b17023SJohn Marino fprintf (f, " global time: %i\n", s->time);
1196*e4b17023SJohn Marino fprintf (f, " self size: %i\n",
1197*e4b17023SJohn Marino s->self_size);
1198*e4b17023SJohn Marino fprintf (f, " global size: %i\n", s->size);
1199*e4b17023SJohn Marino fprintf (f, " self stack: %i\n",
1200*e4b17023SJohn Marino (int) s->estimated_self_stack_size);
1201*e4b17023SJohn Marino fprintf (f, " global stack: %i\n",
1202*e4b17023SJohn Marino (int) s->estimated_stack_size);
1203*e4b17023SJohn Marino for (i = 0;
1204*e4b17023SJohn Marino VEC_iterate (size_time_entry, s->entry, i, e);
1205*e4b17023SJohn Marino i++)
1206*e4b17023SJohn Marino {
1207*e4b17023SJohn Marino fprintf (f, " size:%f, time:%f, predicate:",
1208*e4b17023SJohn Marino (double) e->size / INLINE_SIZE_SCALE,
1209*e4b17023SJohn Marino (double) e->time / INLINE_TIME_SCALE);
1210*e4b17023SJohn Marino dump_predicate (f, s->conds, &e->predicate);
1211*e4b17023SJohn Marino }
1212*e4b17023SJohn Marino fprintf (f, " calls:\n");
1213*e4b17023SJohn Marino dump_inline_edge_summary (f, 4, node, s);
1214*e4b17023SJohn Marino fprintf (f, "\n");
1215*e4b17023SJohn Marino }
1216*e4b17023SJohn Marino }
1217*e4b17023SJohn Marino
1218*e4b17023SJohn Marino DEBUG_FUNCTION void
debug_inline_summary(struct cgraph_node * node)1219*e4b17023SJohn Marino debug_inline_summary (struct cgraph_node *node)
1220*e4b17023SJohn Marino {
1221*e4b17023SJohn Marino dump_inline_summary (stderr, node);
1222*e4b17023SJohn Marino }
1223*e4b17023SJohn Marino
1224*e4b17023SJohn Marino void
dump_inline_summaries(FILE * f)1225*e4b17023SJohn Marino dump_inline_summaries (FILE *f)
1226*e4b17023SJohn Marino {
1227*e4b17023SJohn Marino struct cgraph_node *node;
1228*e4b17023SJohn Marino
1229*e4b17023SJohn Marino for (node = cgraph_nodes; node; node = node->next)
1230*e4b17023SJohn Marino if (node->analyzed && !node->global.inlined_to)
1231*e4b17023SJohn Marino dump_inline_summary (f, node);
1232*e4b17023SJohn Marino }
1233*e4b17023SJohn Marino
1234*e4b17023SJohn Marino /* Give initial reasons why inlining would fail on EDGE. This gets either
1235*e4b17023SJohn Marino nullified or usually overwritten by more precise reasons later. */
1236*e4b17023SJohn Marino
1237*e4b17023SJohn Marino void
initialize_inline_failed(struct cgraph_edge * e)1238*e4b17023SJohn Marino initialize_inline_failed (struct cgraph_edge *e)
1239*e4b17023SJohn Marino {
1240*e4b17023SJohn Marino struct cgraph_node *callee = e->callee;
1241*e4b17023SJohn Marino
1242*e4b17023SJohn Marino if (e->indirect_unknown_callee)
1243*e4b17023SJohn Marino e->inline_failed = CIF_INDIRECT_UNKNOWN_CALL;
1244*e4b17023SJohn Marino else if (!callee->analyzed)
1245*e4b17023SJohn Marino e->inline_failed = CIF_BODY_NOT_AVAILABLE;
1246*e4b17023SJohn Marino else if (callee->local.redefined_extern_inline)
1247*e4b17023SJohn Marino e->inline_failed = CIF_REDEFINED_EXTERN_INLINE;
1248*e4b17023SJohn Marino else if (e->call_stmt_cannot_inline_p)
1249*e4b17023SJohn Marino e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
1250*e4b17023SJohn Marino else
1251*e4b17023SJohn Marino e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
1252*e4b17023SJohn Marino }
1253*e4b17023SJohn Marino
1254*e4b17023SJohn Marino /* Callback of walk_aliased_vdefs. Flags that it has been invoked to the
1255*e4b17023SJohn Marino boolean variable pointed to by DATA. */
1256*e4b17023SJohn Marino
1257*e4b17023SJohn Marino static bool
mark_modified(ao_ref * ao ATTRIBUTE_UNUSED,tree vdef ATTRIBUTE_UNUSED,void * data)1258*e4b17023SJohn Marino mark_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef ATTRIBUTE_UNUSED,
1259*e4b17023SJohn Marino void *data)
1260*e4b17023SJohn Marino {
1261*e4b17023SJohn Marino bool *b = (bool *) data;
1262*e4b17023SJohn Marino *b = true;
1263*e4b17023SJohn Marino return true;
1264*e4b17023SJohn Marino }
1265*e4b17023SJohn Marino
1266*e4b17023SJohn Marino /* If OP reffers to value of function parameter, return
1267*e4b17023SJohn Marino the corresponding parameter. */
1268*e4b17023SJohn Marino
1269*e4b17023SJohn Marino static tree
unmodified_parm(gimple stmt,tree op)1270*e4b17023SJohn Marino unmodified_parm (gimple stmt, tree op)
1271*e4b17023SJohn Marino {
1272*e4b17023SJohn Marino /* SSA_NAME referring to parm default def? */
1273*e4b17023SJohn Marino if (TREE_CODE (op) == SSA_NAME
1274*e4b17023SJohn Marino && SSA_NAME_IS_DEFAULT_DEF (op)
1275*e4b17023SJohn Marino && TREE_CODE (SSA_NAME_VAR (op)) == PARM_DECL)
1276*e4b17023SJohn Marino return SSA_NAME_VAR (op);
1277*e4b17023SJohn Marino /* Non-SSA parm reference? */
1278*e4b17023SJohn Marino if (TREE_CODE (op) == PARM_DECL)
1279*e4b17023SJohn Marino {
1280*e4b17023SJohn Marino bool modified = false;
1281*e4b17023SJohn Marino
1282*e4b17023SJohn Marino ao_ref refd;
1283*e4b17023SJohn Marino ao_ref_init (&refd, op);
1284*e4b17023SJohn Marino walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,
1285*e4b17023SJohn Marino NULL);
1286*e4b17023SJohn Marino if (!modified)
1287*e4b17023SJohn Marino return op;
1288*e4b17023SJohn Marino }
1289*e4b17023SJohn Marino /* Assignment from a parameter? */
1290*e4b17023SJohn Marino if (TREE_CODE (op) == SSA_NAME
1291*e4b17023SJohn Marino && !SSA_NAME_IS_DEFAULT_DEF (op)
1292*e4b17023SJohn Marino && gimple_assign_single_p (SSA_NAME_DEF_STMT (op)))
1293*e4b17023SJohn Marino return unmodified_parm (SSA_NAME_DEF_STMT (op),
1294*e4b17023SJohn Marino gimple_assign_rhs1 (SSA_NAME_DEF_STMT (op)));
1295*e4b17023SJohn Marino return NULL;
1296*e4b17023SJohn Marino }
1297*e4b17023SJohn Marino
1298*e4b17023SJohn Marino /* See if statement might disappear after inlining.
1299*e4b17023SJohn Marino 0 - means not eliminated
1300*e4b17023SJohn Marino 1 - half of statements goes away
1301*e4b17023SJohn Marino 2 - for sure it is eliminated.
1302*e4b17023SJohn Marino We are not terribly sophisticated, basically looking for simple abstraction
1303*e4b17023SJohn Marino penalty wrappers. */
1304*e4b17023SJohn Marino
1305*e4b17023SJohn Marino static int
eliminated_by_inlining_prob(gimple stmt)1306*e4b17023SJohn Marino eliminated_by_inlining_prob (gimple stmt)
1307*e4b17023SJohn Marino {
1308*e4b17023SJohn Marino enum gimple_code code = gimple_code (stmt);
1309*e4b17023SJohn Marino
1310*e4b17023SJohn Marino if (!optimize)
1311*e4b17023SJohn Marino return 0;
1312*e4b17023SJohn Marino
1313*e4b17023SJohn Marino switch (code)
1314*e4b17023SJohn Marino {
1315*e4b17023SJohn Marino case GIMPLE_RETURN:
1316*e4b17023SJohn Marino return 2;
1317*e4b17023SJohn Marino case GIMPLE_ASSIGN:
1318*e4b17023SJohn Marino if (gimple_num_ops (stmt) != 2)
1319*e4b17023SJohn Marino return 0;
1320*e4b17023SJohn Marino
1321*e4b17023SJohn Marino /* Casts of parameters, loads from parameters passed by reference
1322*e4b17023SJohn Marino and stores to return value or parameters are often free after
1323*e4b17023SJohn Marino inlining dua to SRA and further combining.
1324*e4b17023SJohn Marino Assume that half of statements goes away. */
1325*e4b17023SJohn Marino if (gimple_assign_rhs_code (stmt) == CONVERT_EXPR
1326*e4b17023SJohn Marino || gimple_assign_rhs_code (stmt) == NOP_EXPR
1327*e4b17023SJohn Marino || gimple_assign_rhs_code (stmt) == VIEW_CONVERT_EXPR
1328*e4b17023SJohn Marino || gimple_assign_rhs_class (stmt) == GIMPLE_SINGLE_RHS)
1329*e4b17023SJohn Marino {
1330*e4b17023SJohn Marino tree rhs = gimple_assign_rhs1 (stmt);
1331*e4b17023SJohn Marino tree lhs = gimple_assign_lhs (stmt);
1332*e4b17023SJohn Marino tree inner_rhs = get_base_address (rhs);
1333*e4b17023SJohn Marino tree inner_lhs = get_base_address (lhs);
1334*e4b17023SJohn Marino bool rhs_free = false;
1335*e4b17023SJohn Marino bool lhs_free = false;
1336*e4b17023SJohn Marino
1337*e4b17023SJohn Marino if (!inner_rhs)
1338*e4b17023SJohn Marino inner_rhs = rhs;
1339*e4b17023SJohn Marino if (!inner_lhs)
1340*e4b17023SJohn Marino inner_lhs = lhs;
1341*e4b17023SJohn Marino
1342*e4b17023SJohn Marino /* Reads of parameter are expected to be free. */
1343*e4b17023SJohn Marino if (unmodified_parm (stmt, inner_rhs))
1344*e4b17023SJohn Marino rhs_free = true;
1345*e4b17023SJohn Marino
1346*e4b17023SJohn Marino /* When parameter is not SSA register because its address is taken
1347*e4b17023SJohn Marino and it is just copied into one, the statement will be completely
1348*e4b17023SJohn Marino free after inlining (we will copy propagate backward). */
1349*e4b17023SJohn Marino if (rhs_free && is_gimple_reg (lhs))
1350*e4b17023SJohn Marino return 2;
1351*e4b17023SJohn Marino
1352*e4b17023SJohn Marino /* Reads of parameters passed by reference
1353*e4b17023SJohn Marino expected to be free (i.e. optimized out after inlining). */
1354*e4b17023SJohn Marino if (TREE_CODE(inner_rhs) == MEM_REF
1355*e4b17023SJohn Marino && unmodified_parm (stmt, TREE_OPERAND (inner_rhs, 0)))
1356*e4b17023SJohn Marino rhs_free = true;
1357*e4b17023SJohn Marino
1358*e4b17023SJohn Marino /* Copying parameter passed by reference into gimple register is
1359*e4b17023SJohn Marino probably also going to copy propagate, but we can't be quite
1360*e4b17023SJohn Marino sure. */
1361*e4b17023SJohn Marino if (rhs_free && is_gimple_reg (lhs))
1362*e4b17023SJohn Marino lhs_free = true;
1363*e4b17023SJohn Marino
1364*e4b17023SJohn Marino /* Writes to parameters, parameters passed by value and return value
1365*e4b17023SJohn Marino (either dirrectly or passed via invisible reference) are free.
1366*e4b17023SJohn Marino
1367*e4b17023SJohn Marino TODO: We ought to handle testcase like
1368*e4b17023SJohn Marino struct a {int a,b;};
1369*e4b17023SJohn Marino struct a
1370*e4b17023SJohn Marino retrurnsturct (void)
1371*e4b17023SJohn Marino {
1372*e4b17023SJohn Marino struct a a ={1,2};
1373*e4b17023SJohn Marino return a;
1374*e4b17023SJohn Marino }
1375*e4b17023SJohn Marino
1376*e4b17023SJohn Marino This translate into:
1377*e4b17023SJohn Marino
1378*e4b17023SJohn Marino retrurnsturct ()
1379*e4b17023SJohn Marino {
1380*e4b17023SJohn Marino int a$b;
1381*e4b17023SJohn Marino int a$a;
1382*e4b17023SJohn Marino struct a a;
1383*e4b17023SJohn Marino struct a D.2739;
1384*e4b17023SJohn Marino
1385*e4b17023SJohn Marino <bb 2>:
1386*e4b17023SJohn Marino D.2739.a = 1;
1387*e4b17023SJohn Marino D.2739.b = 2;
1388*e4b17023SJohn Marino return D.2739;
1389*e4b17023SJohn Marino
1390*e4b17023SJohn Marino }
1391*e4b17023SJohn Marino For that we either need to copy ipa-split logic detecting writes
1392*e4b17023SJohn Marino to return value. */
1393*e4b17023SJohn Marino if (TREE_CODE (inner_lhs) == PARM_DECL
1394*e4b17023SJohn Marino || TREE_CODE (inner_lhs) == RESULT_DECL
1395*e4b17023SJohn Marino || (TREE_CODE(inner_lhs) == MEM_REF
1396*e4b17023SJohn Marino && (unmodified_parm (stmt, TREE_OPERAND (inner_lhs, 0))
1397*e4b17023SJohn Marino || (TREE_CODE (TREE_OPERAND (inner_lhs, 0)) == SSA_NAME
1398*e4b17023SJohn Marino && TREE_CODE (SSA_NAME_VAR
1399*e4b17023SJohn Marino (TREE_OPERAND (inner_lhs, 0)))
1400*e4b17023SJohn Marino == RESULT_DECL))))
1401*e4b17023SJohn Marino lhs_free = true;
1402*e4b17023SJohn Marino if (lhs_free
1403*e4b17023SJohn Marino && (is_gimple_reg (rhs) || is_gimple_min_invariant (rhs)))
1404*e4b17023SJohn Marino rhs_free = true;
1405*e4b17023SJohn Marino if (lhs_free && rhs_free)
1406*e4b17023SJohn Marino return 1;
1407*e4b17023SJohn Marino }
1408*e4b17023SJohn Marino return 0;
1409*e4b17023SJohn Marino default:
1410*e4b17023SJohn Marino return 0;
1411*e4b17023SJohn Marino }
1412*e4b17023SJohn Marino }
1413*e4b17023SJohn Marino
1414*e4b17023SJohn Marino
1415*e4b17023SJohn Marino /* If BB ends by a conditional we can turn into predicates, attach corresponding
1416*e4b17023SJohn Marino predicates to the CFG edges. */
1417*e4b17023SJohn Marino
1418*e4b17023SJohn Marino static void
set_cond_stmt_execution_predicate(struct ipa_node_params * info,struct inline_summary * summary,basic_block bb)1419*e4b17023SJohn Marino set_cond_stmt_execution_predicate (struct ipa_node_params *info,
1420*e4b17023SJohn Marino struct inline_summary *summary,
1421*e4b17023SJohn Marino basic_block bb)
1422*e4b17023SJohn Marino {
1423*e4b17023SJohn Marino gimple last;
1424*e4b17023SJohn Marino tree op;
1425*e4b17023SJohn Marino int index;
1426*e4b17023SJohn Marino enum tree_code code, inverted_code;
1427*e4b17023SJohn Marino edge e;
1428*e4b17023SJohn Marino edge_iterator ei;
1429*e4b17023SJohn Marino gimple set_stmt;
1430*e4b17023SJohn Marino tree op2;
1431*e4b17023SJohn Marino tree parm;
1432*e4b17023SJohn Marino tree base;
1433*e4b17023SJohn Marino
1434*e4b17023SJohn Marino last = last_stmt (bb);
1435*e4b17023SJohn Marino if (!last
1436*e4b17023SJohn Marino || gimple_code (last) != GIMPLE_COND)
1437*e4b17023SJohn Marino return;
1438*e4b17023SJohn Marino if (!is_gimple_ip_invariant (gimple_cond_rhs (last)))
1439*e4b17023SJohn Marino return;
1440*e4b17023SJohn Marino op = gimple_cond_lhs (last);
1441*e4b17023SJohn Marino /* TODO: handle conditionals like
1442*e4b17023SJohn Marino var = op0 < 4;
1443*e4b17023SJohn Marino if (var != 0). */
1444*e4b17023SJohn Marino parm = unmodified_parm (last, op);
1445*e4b17023SJohn Marino if (parm)
1446*e4b17023SJohn Marino {
1447*e4b17023SJohn Marino index = ipa_get_param_decl_index (info, parm);
1448*e4b17023SJohn Marino if (index == -1)
1449*e4b17023SJohn Marino return;
1450*e4b17023SJohn Marino code = gimple_cond_code (last);
1451*e4b17023SJohn Marino inverted_code
1452*e4b17023SJohn Marino = invert_tree_comparison (code,
1453*e4b17023SJohn Marino HONOR_NANS (TYPE_MODE (TREE_TYPE (op))));
1454*e4b17023SJohn Marino
1455*e4b17023SJohn Marino FOR_EACH_EDGE (e, ei, bb->succs)
1456*e4b17023SJohn Marino {
1457*e4b17023SJohn Marino struct predicate p = add_condition (summary,
1458*e4b17023SJohn Marino index,
1459*e4b17023SJohn Marino e->flags & EDGE_TRUE_VALUE
1460*e4b17023SJohn Marino ? code : inverted_code,
1461*e4b17023SJohn Marino gimple_cond_rhs (last));
1462*e4b17023SJohn Marino e->aux = pool_alloc (edge_predicate_pool);
1463*e4b17023SJohn Marino *(struct predicate *)e->aux = p;
1464*e4b17023SJohn Marino }
1465*e4b17023SJohn Marino }
1466*e4b17023SJohn Marino
1467*e4b17023SJohn Marino if (TREE_CODE (op) != SSA_NAME)
1468*e4b17023SJohn Marino return;
1469*e4b17023SJohn Marino /* Special case
1470*e4b17023SJohn Marino if (builtin_constant_p (op))
1471*e4b17023SJohn Marino constant_code
1472*e4b17023SJohn Marino else
1473*e4b17023SJohn Marino nonconstant_code.
1474*e4b17023SJohn Marino Here we can predicate nonconstant_code. We can't
1475*e4b17023SJohn Marino really handle constant_code since we have no predicate
1476*e4b17023SJohn Marino for this and also the constant code is not known to be
1477*e4b17023SJohn Marino optimized away when inliner doen't see operand is constant.
1478*e4b17023SJohn Marino Other optimizers might think otherwise. */
1479*e4b17023SJohn Marino set_stmt = SSA_NAME_DEF_STMT (op);
1480*e4b17023SJohn Marino if (!gimple_call_builtin_p (set_stmt, BUILT_IN_CONSTANT_P)
1481*e4b17023SJohn Marino || gimple_call_num_args (set_stmt) != 1)
1482*e4b17023SJohn Marino return;
1483*e4b17023SJohn Marino op2 = gimple_call_arg (set_stmt, 0);
1484*e4b17023SJohn Marino base = get_base_address (op2);
1485*e4b17023SJohn Marino parm = unmodified_parm (set_stmt, base ? base : op2);
1486*e4b17023SJohn Marino if (!parm)
1487*e4b17023SJohn Marino return;
1488*e4b17023SJohn Marino index = ipa_get_param_decl_index (info, parm);
1489*e4b17023SJohn Marino if (index == -1)
1490*e4b17023SJohn Marino return;
1491*e4b17023SJohn Marino if (gimple_cond_code (last) != NE_EXPR
1492*e4b17023SJohn Marino || !integer_zerop (gimple_cond_rhs (last)))
1493*e4b17023SJohn Marino return;
1494*e4b17023SJohn Marino FOR_EACH_EDGE (e, ei, bb->succs)
1495*e4b17023SJohn Marino if (e->flags & EDGE_FALSE_VALUE)
1496*e4b17023SJohn Marino {
1497*e4b17023SJohn Marino struct predicate p = add_condition (summary,
1498*e4b17023SJohn Marino index,
1499*e4b17023SJohn Marino IS_NOT_CONSTANT,
1500*e4b17023SJohn Marino NULL);
1501*e4b17023SJohn Marino e->aux = pool_alloc (edge_predicate_pool);
1502*e4b17023SJohn Marino *(struct predicate *)e->aux = p;
1503*e4b17023SJohn Marino }
1504*e4b17023SJohn Marino }
1505*e4b17023SJohn Marino
1506*e4b17023SJohn Marino
1507*e4b17023SJohn Marino /* If BB ends by a switch we can turn into predicates, attach corresponding
1508*e4b17023SJohn Marino predicates to the CFG edges. */
1509*e4b17023SJohn Marino
1510*e4b17023SJohn Marino static void
set_switch_stmt_execution_predicate(struct ipa_node_params * info,struct inline_summary * summary,basic_block bb)1511*e4b17023SJohn Marino set_switch_stmt_execution_predicate (struct ipa_node_params *info,
1512*e4b17023SJohn Marino struct inline_summary *summary,
1513*e4b17023SJohn Marino basic_block bb)
1514*e4b17023SJohn Marino {
1515*e4b17023SJohn Marino gimple last;
1516*e4b17023SJohn Marino tree op;
1517*e4b17023SJohn Marino int index;
1518*e4b17023SJohn Marino edge e;
1519*e4b17023SJohn Marino edge_iterator ei;
1520*e4b17023SJohn Marino size_t n;
1521*e4b17023SJohn Marino size_t case_idx;
1522*e4b17023SJohn Marino tree parm;
1523*e4b17023SJohn Marino
1524*e4b17023SJohn Marino last = last_stmt (bb);
1525*e4b17023SJohn Marino if (!last
1526*e4b17023SJohn Marino || gimple_code (last) != GIMPLE_SWITCH)
1527*e4b17023SJohn Marino return;
1528*e4b17023SJohn Marino op = gimple_switch_index (last);
1529*e4b17023SJohn Marino parm = unmodified_parm (last, op);
1530*e4b17023SJohn Marino if (!parm)
1531*e4b17023SJohn Marino return;
1532*e4b17023SJohn Marino index = ipa_get_param_decl_index (info, parm);
1533*e4b17023SJohn Marino if (index == -1)
1534*e4b17023SJohn Marino return;
1535*e4b17023SJohn Marino
1536*e4b17023SJohn Marino FOR_EACH_EDGE (e, ei, bb->succs)
1537*e4b17023SJohn Marino {
1538*e4b17023SJohn Marino e->aux = pool_alloc (edge_predicate_pool);
1539*e4b17023SJohn Marino *(struct predicate *)e->aux = false_predicate ();
1540*e4b17023SJohn Marino }
1541*e4b17023SJohn Marino n = gimple_switch_num_labels(last);
1542*e4b17023SJohn Marino for (case_idx = 0; case_idx < n; ++case_idx)
1543*e4b17023SJohn Marino {
1544*e4b17023SJohn Marino tree cl = gimple_switch_label (last, case_idx);
1545*e4b17023SJohn Marino tree min, max;
1546*e4b17023SJohn Marino struct predicate p;
1547*e4b17023SJohn Marino
1548*e4b17023SJohn Marino e = find_edge (bb, label_to_block (CASE_LABEL (cl)));
1549*e4b17023SJohn Marino min = CASE_LOW (cl);
1550*e4b17023SJohn Marino max = CASE_HIGH (cl);
1551*e4b17023SJohn Marino
1552*e4b17023SJohn Marino /* For default we might want to construct predicate that none
1553*e4b17023SJohn Marino of cases is met, but it is bit hard to do not having negations
1554*e4b17023SJohn Marino of conditionals handy. */
1555*e4b17023SJohn Marino if (!min && !max)
1556*e4b17023SJohn Marino p = true_predicate ();
1557*e4b17023SJohn Marino else if (!max)
1558*e4b17023SJohn Marino p = add_condition (summary, index,
1559*e4b17023SJohn Marino EQ_EXPR,
1560*e4b17023SJohn Marino min);
1561*e4b17023SJohn Marino else
1562*e4b17023SJohn Marino {
1563*e4b17023SJohn Marino struct predicate p1, p2;
1564*e4b17023SJohn Marino p1 = add_condition (summary, index,
1565*e4b17023SJohn Marino GE_EXPR,
1566*e4b17023SJohn Marino min);
1567*e4b17023SJohn Marino p2 = add_condition (summary, index,
1568*e4b17023SJohn Marino LE_EXPR,
1569*e4b17023SJohn Marino max);
1570*e4b17023SJohn Marino p = and_predicates (summary->conds, &p1, &p2);
1571*e4b17023SJohn Marino }
1572*e4b17023SJohn Marino *(struct predicate *)e->aux
1573*e4b17023SJohn Marino = or_predicates (summary->conds, &p, (struct predicate *)e->aux);
1574*e4b17023SJohn Marino }
1575*e4b17023SJohn Marino }
1576*e4b17023SJohn Marino
1577*e4b17023SJohn Marino
1578*e4b17023SJohn Marino /* For each BB in NODE attach to its AUX pointer predicate under
1579*e4b17023SJohn Marino which it is executable. */
1580*e4b17023SJohn Marino
1581*e4b17023SJohn Marino static void
compute_bb_predicates(struct cgraph_node * node,struct ipa_node_params * parms_info,struct inline_summary * summary)1582*e4b17023SJohn Marino compute_bb_predicates (struct cgraph_node *node,
1583*e4b17023SJohn Marino struct ipa_node_params *parms_info,
1584*e4b17023SJohn Marino struct inline_summary *summary)
1585*e4b17023SJohn Marino {
1586*e4b17023SJohn Marino struct function *my_function = DECL_STRUCT_FUNCTION (node->decl);
1587*e4b17023SJohn Marino bool done = false;
1588*e4b17023SJohn Marino basic_block bb;
1589*e4b17023SJohn Marino
1590*e4b17023SJohn Marino FOR_EACH_BB_FN (bb, my_function)
1591*e4b17023SJohn Marino {
1592*e4b17023SJohn Marino set_cond_stmt_execution_predicate (parms_info, summary, bb);
1593*e4b17023SJohn Marino set_switch_stmt_execution_predicate (parms_info, summary, bb);
1594*e4b17023SJohn Marino }
1595*e4b17023SJohn Marino
1596*e4b17023SJohn Marino /* Entry block is always executable. */
1597*e4b17023SJohn Marino ENTRY_BLOCK_PTR_FOR_FUNCTION (my_function)->aux
1598*e4b17023SJohn Marino = pool_alloc (edge_predicate_pool);
1599*e4b17023SJohn Marino *(struct predicate *)ENTRY_BLOCK_PTR_FOR_FUNCTION (my_function)->aux
1600*e4b17023SJohn Marino = true_predicate ();
1601*e4b17023SJohn Marino
1602*e4b17023SJohn Marino /* A simple dataflow propagation of predicates forward in the CFG.
1603*e4b17023SJohn Marino TODO: work in reverse postorder. */
1604*e4b17023SJohn Marino while (!done)
1605*e4b17023SJohn Marino {
1606*e4b17023SJohn Marino done = true;
1607*e4b17023SJohn Marino FOR_EACH_BB_FN (bb, my_function)
1608*e4b17023SJohn Marino {
1609*e4b17023SJohn Marino struct predicate p = false_predicate ();
1610*e4b17023SJohn Marino edge e;
1611*e4b17023SJohn Marino edge_iterator ei;
1612*e4b17023SJohn Marino FOR_EACH_EDGE (e, ei, bb->preds)
1613*e4b17023SJohn Marino {
1614*e4b17023SJohn Marino if (e->src->aux)
1615*e4b17023SJohn Marino {
1616*e4b17023SJohn Marino struct predicate this_bb_predicate
1617*e4b17023SJohn Marino = *(struct predicate *)e->src->aux;
1618*e4b17023SJohn Marino if (e->aux)
1619*e4b17023SJohn Marino this_bb_predicate
1620*e4b17023SJohn Marino = and_predicates (summary->conds, &this_bb_predicate,
1621*e4b17023SJohn Marino (struct predicate *)e->aux);
1622*e4b17023SJohn Marino p = or_predicates (summary->conds, &p, &this_bb_predicate);
1623*e4b17023SJohn Marino if (true_predicate_p (&p))
1624*e4b17023SJohn Marino break;
1625*e4b17023SJohn Marino }
1626*e4b17023SJohn Marino }
1627*e4b17023SJohn Marino if (false_predicate_p (&p))
1628*e4b17023SJohn Marino gcc_assert (!bb->aux);
1629*e4b17023SJohn Marino else
1630*e4b17023SJohn Marino {
1631*e4b17023SJohn Marino if (!bb->aux)
1632*e4b17023SJohn Marino {
1633*e4b17023SJohn Marino done = false;
1634*e4b17023SJohn Marino bb->aux = pool_alloc (edge_predicate_pool);
1635*e4b17023SJohn Marino *((struct predicate *)bb->aux) = p;
1636*e4b17023SJohn Marino }
1637*e4b17023SJohn Marino else if (!predicates_equal_p (&p, (struct predicate *)bb->aux))
1638*e4b17023SJohn Marino {
1639*e4b17023SJohn Marino done = false;
1640*e4b17023SJohn Marino *((struct predicate *)bb->aux) = p;
1641*e4b17023SJohn Marino }
1642*e4b17023SJohn Marino }
1643*e4b17023SJohn Marino }
1644*e4b17023SJohn Marino }
1645*e4b17023SJohn Marino }
1646*e4b17023SJohn Marino
1647*e4b17023SJohn Marino
1648*e4b17023SJohn Marino /* We keep info about constantness of SSA names. */
1649*e4b17023SJohn Marino
1650*e4b17023SJohn Marino typedef struct predicate predicate_t;
1651*e4b17023SJohn Marino DEF_VEC_O (predicate_t);
1652*e4b17023SJohn Marino DEF_VEC_ALLOC_O (predicate_t, heap);
1653*e4b17023SJohn Marino
1654*e4b17023SJohn Marino
1655*e4b17023SJohn Marino /* Return predicate specifying when the STMT might have result that is not
1656*e4b17023SJohn Marino a compile time constant. */
1657*e4b17023SJohn Marino
1658*e4b17023SJohn Marino static struct predicate
will_be_nonconstant_predicate(struct ipa_node_params * info,struct inline_summary * summary,gimple stmt,VEC (predicate_t,heap)* nonconstant_names)1659*e4b17023SJohn Marino will_be_nonconstant_predicate (struct ipa_node_params *info,
1660*e4b17023SJohn Marino struct inline_summary *summary,
1661*e4b17023SJohn Marino gimple stmt,
1662*e4b17023SJohn Marino VEC (predicate_t, heap) *nonconstant_names)
1663*e4b17023SJohn Marino
1664*e4b17023SJohn Marino {
1665*e4b17023SJohn Marino struct predicate p = true_predicate ();
1666*e4b17023SJohn Marino ssa_op_iter iter;
1667*e4b17023SJohn Marino tree use;
1668*e4b17023SJohn Marino struct predicate op_non_const;
1669*e4b17023SJohn Marino bool is_load;
1670*e4b17023SJohn Marino
1671*e4b17023SJohn Marino /* What statments might be optimized away
1672*e4b17023SJohn Marino when their arguments are constant
1673*e4b17023SJohn Marino TODO: also trivial builtins.
1674*e4b17023SJohn Marino builtin_constant_p is already handled later. */
1675*e4b17023SJohn Marino if (gimple_code (stmt) != GIMPLE_ASSIGN
1676*e4b17023SJohn Marino && gimple_code (stmt) != GIMPLE_COND
1677*e4b17023SJohn Marino && gimple_code (stmt) != GIMPLE_SWITCH)
1678*e4b17023SJohn Marino return p;
1679*e4b17023SJohn Marino
1680*e4b17023SJohn Marino /* Stores will stay anyway. */
1681*e4b17023SJohn Marino if (gimple_vdef (stmt))
1682*e4b17023SJohn Marino return p;
1683*e4b17023SJohn Marino
1684*e4b17023SJohn Marino is_load = gimple_vuse (stmt) != NULL;
1685*e4b17023SJohn Marino
1686*e4b17023SJohn Marino /* Loads can be optimized when the value is known. */
1687*e4b17023SJohn Marino if (is_load)
1688*e4b17023SJohn Marino {
1689*e4b17023SJohn Marino tree op = gimple_assign_rhs1 (stmt);
1690*e4b17023SJohn Marino tree base = get_base_address (op);
1691*e4b17023SJohn Marino tree parm;
1692*e4b17023SJohn Marino
1693*e4b17023SJohn Marino gcc_assert (gimple_assign_single_p (stmt));
1694*e4b17023SJohn Marino if (!base)
1695*e4b17023SJohn Marino return p;
1696*e4b17023SJohn Marino parm = unmodified_parm (stmt, base);
1697*e4b17023SJohn Marino if (!parm )
1698*e4b17023SJohn Marino return p;
1699*e4b17023SJohn Marino if (ipa_get_param_decl_index (info, parm) < 0)
1700*e4b17023SJohn Marino return p;
1701*e4b17023SJohn Marino }
1702*e4b17023SJohn Marino
1703*e4b17023SJohn Marino /* See if we understand all operands before we start
1704*e4b17023SJohn Marino adding conditionals. */
1705*e4b17023SJohn Marino FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
1706*e4b17023SJohn Marino {
1707*e4b17023SJohn Marino tree parm = unmodified_parm (stmt, use);
1708*e4b17023SJohn Marino /* For arguments we can build a condition. */
1709*e4b17023SJohn Marino if (parm && ipa_get_param_decl_index (info, parm) >= 0)
1710*e4b17023SJohn Marino continue;
1711*e4b17023SJohn Marino if (TREE_CODE (use) != SSA_NAME)
1712*e4b17023SJohn Marino return p;
1713*e4b17023SJohn Marino /* If we know when operand is constant,
1714*e4b17023SJohn Marino we still can say something useful. */
1715*e4b17023SJohn Marino if (!true_predicate_p (VEC_index (predicate_t, nonconstant_names,
1716*e4b17023SJohn Marino SSA_NAME_VERSION (use))))
1717*e4b17023SJohn Marino continue;
1718*e4b17023SJohn Marino return p;
1719*e4b17023SJohn Marino }
1720*e4b17023SJohn Marino op_non_const = false_predicate ();
1721*e4b17023SJohn Marino if (is_load)
1722*e4b17023SJohn Marino {
1723*e4b17023SJohn Marino tree parm = unmodified_parm
1724*e4b17023SJohn Marino (stmt, get_base_address (gimple_assign_rhs1 (stmt)));
1725*e4b17023SJohn Marino p = add_condition (summary,
1726*e4b17023SJohn Marino ipa_get_param_decl_index (info, parm),
1727*e4b17023SJohn Marino CHANGED, NULL);
1728*e4b17023SJohn Marino op_non_const = or_predicates (summary->conds, &p, &op_non_const);
1729*e4b17023SJohn Marino }
1730*e4b17023SJohn Marino FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
1731*e4b17023SJohn Marino {
1732*e4b17023SJohn Marino tree parm = unmodified_parm (stmt, use);
1733*e4b17023SJohn Marino if (parm && ipa_get_param_decl_index (info, parm) >= 0)
1734*e4b17023SJohn Marino p = add_condition (summary,
1735*e4b17023SJohn Marino ipa_get_param_decl_index (info, parm),
1736*e4b17023SJohn Marino CHANGED, NULL);
1737*e4b17023SJohn Marino else
1738*e4b17023SJohn Marino p = *VEC_index (predicate_t, nonconstant_names,
1739*e4b17023SJohn Marino SSA_NAME_VERSION (use));
1740*e4b17023SJohn Marino op_non_const = or_predicates (summary->conds, &p, &op_non_const);
1741*e4b17023SJohn Marino }
1742*e4b17023SJohn Marino if (gimple_code (stmt) == GIMPLE_ASSIGN
1743*e4b17023SJohn Marino && TREE_CODE (gimple_assign_lhs (stmt)) == SSA_NAME)
1744*e4b17023SJohn Marino VEC_replace (predicate_t, nonconstant_names,
1745*e4b17023SJohn Marino SSA_NAME_VERSION (gimple_assign_lhs (stmt)), &op_non_const);
1746*e4b17023SJohn Marino return op_non_const;
1747*e4b17023SJohn Marino }
1748*e4b17023SJohn Marino
1749*e4b17023SJohn Marino struct record_modified_bb_info
1750*e4b17023SJohn Marino {
1751*e4b17023SJohn Marino bitmap bb_set;
1752*e4b17023SJohn Marino gimple stmt;
1753*e4b17023SJohn Marino };
1754*e4b17023SJohn Marino
1755*e4b17023SJohn Marino /* Callback of walk_aliased_vdefs. Records basic blocks where the value may be
1756*e4b17023SJohn Marino set except for info->stmt. */
1757*e4b17023SJohn Marino
1758*e4b17023SJohn Marino static bool
record_modified(ao_ref * ao ATTRIBUTE_UNUSED,tree vdef,void * data)1759*e4b17023SJohn Marino record_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef,
1760*e4b17023SJohn Marino void *data)
1761*e4b17023SJohn Marino {
1762*e4b17023SJohn Marino struct record_modified_bb_info *info = (struct record_modified_bb_info *) data;
1763*e4b17023SJohn Marino if (SSA_NAME_DEF_STMT (vdef) == info->stmt)
1764*e4b17023SJohn Marino return false;
1765*e4b17023SJohn Marino bitmap_set_bit (info->bb_set,
1766*e4b17023SJohn Marino SSA_NAME_IS_DEFAULT_DEF (vdef)
1767*e4b17023SJohn Marino ? ENTRY_BLOCK_PTR->index : gimple_bb (SSA_NAME_DEF_STMT (vdef))->index);
1768*e4b17023SJohn Marino return false;
1769*e4b17023SJohn Marino }
1770*e4b17023SJohn Marino
1771*e4b17023SJohn Marino /* Return probability (based on REG_BR_PROB_BASE) that I-th parameter of STMT
1772*e4b17023SJohn Marino will change since last invocation of STMT.
1773*e4b17023SJohn Marino
1774*e4b17023SJohn Marino Value 0 is reserved for compile time invariants.
1775*e4b17023SJohn Marino For common parameters it is REG_BR_PROB_BASE. For loop invariants it
1776*e4b17023SJohn Marino ought to be REG_BR_PROB_BASE / estimated_iters. */
1777*e4b17023SJohn Marino
1778*e4b17023SJohn Marino static int
param_change_prob(gimple stmt,int i)1779*e4b17023SJohn Marino param_change_prob (gimple stmt, int i)
1780*e4b17023SJohn Marino {
1781*e4b17023SJohn Marino tree op = gimple_call_arg (stmt, i);
1782*e4b17023SJohn Marino basic_block bb = gimple_bb (stmt);
1783*e4b17023SJohn Marino tree base;
1784*e4b17023SJohn Marino
1785*e4b17023SJohn Marino if (is_gimple_min_invariant (op))
1786*e4b17023SJohn Marino return 0;
1787*e4b17023SJohn Marino /* We would have to do non-trivial analysis to really work out what
1788*e4b17023SJohn Marino is the probability of value to change (i.e. when init statement
1789*e4b17023SJohn Marino is in a sibling loop of the call).
1790*e4b17023SJohn Marino
1791*e4b17023SJohn Marino We do an conservative estimate: when call is executed N times more often
1792*e4b17023SJohn Marino than the statement defining value, we take the frequency 1/N. */
1793*e4b17023SJohn Marino if (TREE_CODE (op) == SSA_NAME)
1794*e4b17023SJohn Marino {
1795*e4b17023SJohn Marino int init_freq;
1796*e4b17023SJohn Marino
1797*e4b17023SJohn Marino if (!bb->frequency)
1798*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1799*e4b17023SJohn Marino
1800*e4b17023SJohn Marino if (SSA_NAME_IS_DEFAULT_DEF (op))
1801*e4b17023SJohn Marino init_freq = ENTRY_BLOCK_PTR->frequency;
1802*e4b17023SJohn Marino else
1803*e4b17023SJohn Marino init_freq = gimple_bb (SSA_NAME_DEF_STMT (op))->frequency;
1804*e4b17023SJohn Marino
1805*e4b17023SJohn Marino if (!init_freq)
1806*e4b17023SJohn Marino init_freq = 1;
1807*e4b17023SJohn Marino if (init_freq < bb->frequency)
1808*e4b17023SJohn Marino return MAX ((init_freq * REG_BR_PROB_BASE +
1809*e4b17023SJohn Marino bb->frequency / 2) / bb->frequency, 1);
1810*e4b17023SJohn Marino else
1811*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1812*e4b17023SJohn Marino }
1813*e4b17023SJohn Marino
1814*e4b17023SJohn Marino base = get_base_address (op);
1815*e4b17023SJohn Marino if (base)
1816*e4b17023SJohn Marino {
1817*e4b17023SJohn Marino ao_ref refd;
1818*e4b17023SJohn Marino int max;
1819*e4b17023SJohn Marino struct record_modified_bb_info info;
1820*e4b17023SJohn Marino bitmap_iterator bi;
1821*e4b17023SJohn Marino unsigned index;
1822*e4b17023SJohn Marino
1823*e4b17023SJohn Marino if (const_value_known_p (base))
1824*e4b17023SJohn Marino return 0;
1825*e4b17023SJohn Marino if (!bb->frequency)
1826*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1827*e4b17023SJohn Marino ao_ref_init (&refd, op);
1828*e4b17023SJohn Marino info.stmt = stmt;
1829*e4b17023SJohn Marino info.bb_set = BITMAP_ALLOC (NULL);
1830*e4b17023SJohn Marino walk_aliased_vdefs (&refd, gimple_vuse (stmt), record_modified, &info,
1831*e4b17023SJohn Marino NULL);
1832*e4b17023SJohn Marino if (bitmap_bit_p (info.bb_set, bb->index))
1833*e4b17023SJohn Marino {
1834*e4b17023SJohn Marino BITMAP_FREE (info.bb_set);
1835*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1836*e4b17023SJohn Marino }
1837*e4b17023SJohn Marino
1838*e4b17023SJohn Marino /* Assume that every memory is initialized at entry.
1839*e4b17023SJohn Marino TODO: Can we easilly determine if value is always defined
1840*e4b17023SJohn Marino and thus we may skip entry block? */
1841*e4b17023SJohn Marino if (ENTRY_BLOCK_PTR->frequency)
1842*e4b17023SJohn Marino max = ENTRY_BLOCK_PTR->frequency;
1843*e4b17023SJohn Marino else
1844*e4b17023SJohn Marino max = 1;
1845*e4b17023SJohn Marino
1846*e4b17023SJohn Marino EXECUTE_IF_SET_IN_BITMAP (info.bb_set, 0, index, bi)
1847*e4b17023SJohn Marino max = MIN (max, BASIC_BLOCK (index)->frequency);
1848*e4b17023SJohn Marino
1849*e4b17023SJohn Marino BITMAP_FREE (info.bb_set);
1850*e4b17023SJohn Marino if (max < bb->frequency)
1851*e4b17023SJohn Marino return MAX ((max * REG_BR_PROB_BASE +
1852*e4b17023SJohn Marino bb->frequency / 2) / bb->frequency, 1);
1853*e4b17023SJohn Marino else
1854*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1855*e4b17023SJohn Marino }
1856*e4b17023SJohn Marino return REG_BR_PROB_BASE;
1857*e4b17023SJohn Marino }
1858*e4b17023SJohn Marino
1859*e4b17023SJohn Marino
1860*e4b17023SJohn Marino /* Compute function body size parameters for NODE.
1861*e4b17023SJohn Marino When EARLY is true, we compute only simple summaries without
1862*e4b17023SJohn Marino non-trivial predicates to drive the early inliner. */
1863*e4b17023SJohn Marino
1864*e4b17023SJohn Marino static void
estimate_function_body_sizes(struct cgraph_node * node,bool early)1865*e4b17023SJohn Marino estimate_function_body_sizes (struct cgraph_node *node, bool early)
1866*e4b17023SJohn Marino {
1867*e4b17023SJohn Marino gcov_type time = 0;
1868*e4b17023SJohn Marino /* Estimate static overhead for function prologue/epilogue and alignment. */
1869*e4b17023SJohn Marino int size = 2;
1870*e4b17023SJohn Marino /* Benefits are scaled by probability of elimination that is in range
1871*e4b17023SJohn Marino <0,2>. */
1872*e4b17023SJohn Marino basic_block bb;
1873*e4b17023SJohn Marino gimple_stmt_iterator bsi;
1874*e4b17023SJohn Marino struct function *my_function = DECL_STRUCT_FUNCTION (node->decl);
1875*e4b17023SJohn Marino int freq;
1876*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
1877*e4b17023SJohn Marino struct predicate bb_predicate;
1878*e4b17023SJohn Marino struct ipa_node_params *parms_info = NULL;
1879*e4b17023SJohn Marino VEC (predicate_t, heap) *nonconstant_names = NULL;
1880*e4b17023SJohn Marino
1881*e4b17023SJohn Marino if (ipa_node_params_vector && !early && optimize)
1882*e4b17023SJohn Marino {
1883*e4b17023SJohn Marino parms_info = IPA_NODE_REF (node);
1884*e4b17023SJohn Marino VEC_safe_grow_cleared (predicate_t, heap, nonconstant_names,
1885*e4b17023SJohn Marino VEC_length (tree, SSANAMES (my_function)));
1886*e4b17023SJohn Marino }
1887*e4b17023SJohn Marino
1888*e4b17023SJohn Marino info->conds = 0;
1889*e4b17023SJohn Marino info->entry = 0;
1890*e4b17023SJohn Marino
1891*e4b17023SJohn Marino
1892*e4b17023SJohn Marino if (dump_file)
1893*e4b17023SJohn Marino fprintf (dump_file, "\nAnalyzing function body size: %s\n",
1894*e4b17023SJohn Marino cgraph_node_name (node));
1895*e4b17023SJohn Marino
1896*e4b17023SJohn Marino /* When we run into maximal number of entries, we assign everything to the
1897*e4b17023SJohn Marino constant truth case. Be sure to have it in list. */
1898*e4b17023SJohn Marino bb_predicate = true_predicate ();
1899*e4b17023SJohn Marino account_size_time (info, 0, 0, &bb_predicate);
1900*e4b17023SJohn Marino
1901*e4b17023SJohn Marino bb_predicate = not_inlined_predicate ();
1902*e4b17023SJohn Marino account_size_time (info, 2 * INLINE_SIZE_SCALE, 0, &bb_predicate);
1903*e4b17023SJohn Marino
1904*e4b17023SJohn Marino gcc_assert (my_function && my_function->cfg);
1905*e4b17023SJohn Marino if (parms_info)
1906*e4b17023SJohn Marino compute_bb_predicates (node, parms_info, info);
1907*e4b17023SJohn Marino FOR_EACH_BB_FN (bb, my_function)
1908*e4b17023SJohn Marino {
1909*e4b17023SJohn Marino freq = compute_call_stmt_bb_frequency (node->decl, bb);
1910*e4b17023SJohn Marino
1911*e4b17023SJohn Marino /* TODO: Obviously predicates can be propagated down across CFG. */
1912*e4b17023SJohn Marino if (parms_info)
1913*e4b17023SJohn Marino {
1914*e4b17023SJohn Marino if (bb->aux)
1915*e4b17023SJohn Marino bb_predicate = *(struct predicate *)bb->aux;
1916*e4b17023SJohn Marino else
1917*e4b17023SJohn Marino bb_predicate = false_predicate ();
1918*e4b17023SJohn Marino }
1919*e4b17023SJohn Marino else
1920*e4b17023SJohn Marino bb_predicate = true_predicate ();
1921*e4b17023SJohn Marino
1922*e4b17023SJohn Marino if (dump_file && (dump_flags & TDF_DETAILS))
1923*e4b17023SJohn Marino {
1924*e4b17023SJohn Marino fprintf (dump_file, "\n BB %i predicate:", bb->index);
1925*e4b17023SJohn Marino dump_predicate (dump_file, info->conds, &bb_predicate);
1926*e4b17023SJohn Marino }
1927*e4b17023SJohn Marino
1928*e4b17023SJohn Marino for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1929*e4b17023SJohn Marino {
1930*e4b17023SJohn Marino gimple stmt = gsi_stmt (bsi);
1931*e4b17023SJohn Marino int this_size = estimate_num_insns (stmt, &eni_size_weights);
1932*e4b17023SJohn Marino int this_time = estimate_num_insns (stmt, &eni_time_weights);
1933*e4b17023SJohn Marino int prob;
1934*e4b17023SJohn Marino struct predicate will_be_nonconstant;
1935*e4b17023SJohn Marino
1936*e4b17023SJohn Marino if (dump_file && (dump_flags & TDF_DETAILS))
1937*e4b17023SJohn Marino {
1938*e4b17023SJohn Marino fprintf (dump_file, " ");
1939*e4b17023SJohn Marino print_gimple_stmt (dump_file, stmt, 0, 0);
1940*e4b17023SJohn Marino fprintf (dump_file, "\t\tfreq:%3.2f size:%3i time:%3i\n",
1941*e4b17023SJohn Marino ((double)freq)/CGRAPH_FREQ_BASE, this_size, this_time);
1942*e4b17023SJohn Marino }
1943*e4b17023SJohn Marino
1944*e4b17023SJohn Marino if (is_gimple_call (stmt))
1945*e4b17023SJohn Marino {
1946*e4b17023SJohn Marino struct cgraph_edge *edge = cgraph_edge (node, stmt);
1947*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
1948*e4b17023SJohn Marino
1949*e4b17023SJohn Marino /* Special case: results of BUILT_IN_CONSTANT_P will be always
1950*e4b17023SJohn Marino resolved as constant. We however don't want to optimize
1951*e4b17023SJohn Marino out the cgraph edges. */
1952*e4b17023SJohn Marino if (nonconstant_names
1953*e4b17023SJohn Marino && gimple_call_builtin_p (stmt, BUILT_IN_CONSTANT_P)
1954*e4b17023SJohn Marino && gimple_call_lhs (stmt)
1955*e4b17023SJohn Marino && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
1956*e4b17023SJohn Marino {
1957*e4b17023SJohn Marino struct predicate false_p = false_predicate ();
1958*e4b17023SJohn Marino VEC_replace (predicate_t, nonconstant_names,
1959*e4b17023SJohn Marino SSA_NAME_VERSION (gimple_call_lhs (stmt)),
1960*e4b17023SJohn Marino &false_p);
1961*e4b17023SJohn Marino }
1962*e4b17023SJohn Marino if (ipa_node_params_vector)
1963*e4b17023SJohn Marino {
1964*e4b17023SJohn Marino int count = gimple_call_num_args (stmt);
1965*e4b17023SJohn Marino int i;
1966*e4b17023SJohn Marino
1967*e4b17023SJohn Marino if (count)
1968*e4b17023SJohn Marino VEC_safe_grow_cleared (inline_param_summary_t, heap,
1969*e4b17023SJohn Marino es->param, count);
1970*e4b17023SJohn Marino for (i = 0; i < count; i++)
1971*e4b17023SJohn Marino {
1972*e4b17023SJohn Marino int prob = param_change_prob (stmt, i);
1973*e4b17023SJohn Marino gcc_assert (prob >= 0 && prob <= REG_BR_PROB_BASE);
1974*e4b17023SJohn Marino VEC_index (inline_param_summary_t,
1975*e4b17023SJohn Marino es->param, i)->change_prob = prob;
1976*e4b17023SJohn Marino }
1977*e4b17023SJohn Marino }
1978*e4b17023SJohn Marino
1979*e4b17023SJohn Marino es->call_stmt_size = this_size;
1980*e4b17023SJohn Marino es->call_stmt_time = this_time;
1981*e4b17023SJohn Marino es->loop_depth = bb->loop_depth;
1982*e4b17023SJohn Marino edge_set_predicate (edge, &bb_predicate);
1983*e4b17023SJohn Marino }
1984*e4b17023SJohn Marino
1985*e4b17023SJohn Marino /* TODO: When conditional jump or swithc is known to be constant, but
1986*e4b17023SJohn Marino we did not translate it into the predicates, we really can account
1987*e4b17023SJohn Marino just maximum of the possible paths. */
1988*e4b17023SJohn Marino if (parms_info)
1989*e4b17023SJohn Marino will_be_nonconstant
1990*e4b17023SJohn Marino = will_be_nonconstant_predicate (parms_info, info,
1991*e4b17023SJohn Marino stmt, nonconstant_names);
1992*e4b17023SJohn Marino if (this_time || this_size)
1993*e4b17023SJohn Marino {
1994*e4b17023SJohn Marino struct predicate p;
1995*e4b17023SJohn Marino
1996*e4b17023SJohn Marino this_time *= freq;
1997*e4b17023SJohn Marino time += this_time;
1998*e4b17023SJohn Marino size += this_size;
1999*e4b17023SJohn Marino
2000*e4b17023SJohn Marino prob = eliminated_by_inlining_prob (stmt);
2001*e4b17023SJohn Marino if (prob == 1 && dump_file && (dump_flags & TDF_DETAILS))
2002*e4b17023SJohn Marino fprintf (dump_file, "\t\t50%% will be eliminated by inlining\n");
2003*e4b17023SJohn Marino if (prob == 2 && dump_file && (dump_flags & TDF_DETAILS))
2004*e4b17023SJohn Marino fprintf (dump_file, "\t\tWill be eliminated by inlining\n");
2005*e4b17023SJohn Marino
2006*e4b17023SJohn Marino if (parms_info)
2007*e4b17023SJohn Marino p = and_predicates (info->conds, &bb_predicate,
2008*e4b17023SJohn Marino &will_be_nonconstant);
2009*e4b17023SJohn Marino else
2010*e4b17023SJohn Marino p = true_predicate ();
2011*e4b17023SJohn Marino
2012*e4b17023SJohn Marino /* We account everything but the calls. Calls have their own
2013*e4b17023SJohn Marino size/time info attached to cgraph edges. This is neccesary
2014*e4b17023SJohn Marino in order to make the cost disappear after inlining. */
2015*e4b17023SJohn Marino if (!is_gimple_call (stmt))
2016*e4b17023SJohn Marino {
2017*e4b17023SJohn Marino if (prob)
2018*e4b17023SJohn Marino {
2019*e4b17023SJohn Marino struct predicate ip = not_inlined_predicate ();
2020*e4b17023SJohn Marino ip = and_predicates (info->conds, &ip, &p);
2021*e4b17023SJohn Marino account_size_time (info, this_size * prob,
2022*e4b17023SJohn Marino this_time * prob, &ip);
2023*e4b17023SJohn Marino }
2024*e4b17023SJohn Marino if (prob != 2)
2025*e4b17023SJohn Marino account_size_time (info, this_size * (2 - prob),
2026*e4b17023SJohn Marino this_time * (2 - prob), &p);
2027*e4b17023SJohn Marino }
2028*e4b17023SJohn Marino
2029*e4b17023SJohn Marino gcc_assert (time >= 0);
2030*e4b17023SJohn Marino gcc_assert (size >= 0);
2031*e4b17023SJohn Marino }
2032*e4b17023SJohn Marino }
2033*e4b17023SJohn Marino }
2034*e4b17023SJohn Marino FOR_ALL_BB_FN (bb, my_function)
2035*e4b17023SJohn Marino {
2036*e4b17023SJohn Marino edge e;
2037*e4b17023SJohn Marino edge_iterator ei;
2038*e4b17023SJohn Marino
2039*e4b17023SJohn Marino if (bb->aux)
2040*e4b17023SJohn Marino pool_free (edge_predicate_pool, bb->aux);
2041*e4b17023SJohn Marino bb->aux = NULL;
2042*e4b17023SJohn Marino FOR_EACH_EDGE (e, ei, bb->succs)
2043*e4b17023SJohn Marino {
2044*e4b17023SJohn Marino if (e->aux)
2045*e4b17023SJohn Marino pool_free (edge_predicate_pool, e->aux);
2046*e4b17023SJohn Marino e->aux = NULL;
2047*e4b17023SJohn Marino }
2048*e4b17023SJohn Marino }
2049*e4b17023SJohn Marino time = (time + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2050*e4b17023SJohn Marino if (time > MAX_TIME)
2051*e4b17023SJohn Marino time = MAX_TIME;
2052*e4b17023SJohn Marino inline_summary (node)->self_time = time;
2053*e4b17023SJohn Marino inline_summary (node)->self_size = size;
2054*e4b17023SJohn Marino VEC_free (predicate_t, heap, nonconstant_names);
2055*e4b17023SJohn Marino if (dump_file)
2056*e4b17023SJohn Marino {
2057*e4b17023SJohn Marino fprintf (dump_file, "\n");
2058*e4b17023SJohn Marino dump_inline_summary (dump_file, node);
2059*e4b17023SJohn Marino }
2060*e4b17023SJohn Marino }
2061*e4b17023SJohn Marino
2062*e4b17023SJohn Marino
2063*e4b17023SJohn Marino /* Compute parameters of functions used by inliner.
2064*e4b17023SJohn Marino EARLY is true when we compute parameters for the early inliner */
2065*e4b17023SJohn Marino
2066*e4b17023SJohn Marino void
compute_inline_parameters(struct cgraph_node * node,bool early)2067*e4b17023SJohn Marino compute_inline_parameters (struct cgraph_node *node, bool early)
2068*e4b17023SJohn Marino {
2069*e4b17023SJohn Marino HOST_WIDE_INT self_stack_size;
2070*e4b17023SJohn Marino struct cgraph_edge *e;
2071*e4b17023SJohn Marino struct inline_summary *info;
2072*e4b17023SJohn Marino tree old_decl = current_function_decl;
2073*e4b17023SJohn Marino
2074*e4b17023SJohn Marino gcc_assert (!node->global.inlined_to);
2075*e4b17023SJohn Marino
2076*e4b17023SJohn Marino inline_summary_alloc ();
2077*e4b17023SJohn Marino
2078*e4b17023SJohn Marino info = inline_summary (node);
2079*e4b17023SJohn Marino reset_inline_summary (node);
2080*e4b17023SJohn Marino
2081*e4b17023SJohn Marino /* FIXME: Thunks are inlinable, but tree-inline don't know how to do that.
2082*e4b17023SJohn Marino Once this happen, we will need to more curefully predict call
2083*e4b17023SJohn Marino statement size. */
2084*e4b17023SJohn Marino if (node->thunk.thunk_p)
2085*e4b17023SJohn Marino {
2086*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (node->callees);
2087*e4b17023SJohn Marino struct predicate t = true_predicate ();
2088*e4b17023SJohn Marino
2089*e4b17023SJohn Marino info->inlinable = 0;
2090*e4b17023SJohn Marino node->callees->call_stmt_cannot_inline_p = true;
2091*e4b17023SJohn Marino node->local.can_change_signature = false;
2092*e4b17023SJohn Marino es->call_stmt_time = 1;
2093*e4b17023SJohn Marino es->call_stmt_size = 1;
2094*e4b17023SJohn Marino account_size_time (info, 0, 0, &t);
2095*e4b17023SJohn Marino return;
2096*e4b17023SJohn Marino }
2097*e4b17023SJohn Marino
2098*e4b17023SJohn Marino /* Even is_gimple_min_invariant rely on current_function_decl. */
2099*e4b17023SJohn Marino current_function_decl = node->decl;
2100*e4b17023SJohn Marino push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2101*e4b17023SJohn Marino
2102*e4b17023SJohn Marino /* Estimate the stack size for the function if we're optimizing. */
2103*e4b17023SJohn Marino self_stack_size = optimize ? estimated_stack_frame_size (node) : 0;
2104*e4b17023SJohn Marino info->estimated_self_stack_size = self_stack_size;
2105*e4b17023SJohn Marino info->estimated_stack_size = self_stack_size;
2106*e4b17023SJohn Marino info->stack_frame_offset = 0;
2107*e4b17023SJohn Marino
2108*e4b17023SJohn Marino /* Can this function be inlined at all? */
2109*e4b17023SJohn Marino info->inlinable = tree_inlinable_function_p (node->decl);
2110*e4b17023SJohn Marino
2111*e4b17023SJohn Marino /* Type attributes can use parameter indices to describe them. */
2112*e4b17023SJohn Marino if (TYPE_ATTRIBUTES (TREE_TYPE (node->decl)))
2113*e4b17023SJohn Marino node->local.can_change_signature = false;
2114*e4b17023SJohn Marino else
2115*e4b17023SJohn Marino {
2116*e4b17023SJohn Marino /* Otherwise, inlinable functions always can change signature. */
2117*e4b17023SJohn Marino if (info->inlinable)
2118*e4b17023SJohn Marino node->local.can_change_signature = true;
2119*e4b17023SJohn Marino else
2120*e4b17023SJohn Marino {
2121*e4b17023SJohn Marino /* Functions calling builtin_apply can not change signature. */
2122*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
2123*e4b17023SJohn Marino {
2124*e4b17023SJohn Marino tree cdecl = e->callee->decl;
2125*e4b17023SJohn Marino if (DECL_BUILT_IN (cdecl)
2126*e4b17023SJohn Marino && DECL_BUILT_IN_CLASS (cdecl) == BUILT_IN_NORMAL
2127*e4b17023SJohn Marino && (DECL_FUNCTION_CODE (cdecl) == BUILT_IN_APPLY_ARGS
2128*e4b17023SJohn Marino || DECL_FUNCTION_CODE (cdecl) == BUILT_IN_VA_START))
2129*e4b17023SJohn Marino break;
2130*e4b17023SJohn Marino }
2131*e4b17023SJohn Marino node->local.can_change_signature = !e;
2132*e4b17023SJohn Marino }
2133*e4b17023SJohn Marino }
2134*e4b17023SJohn Marino estimate_function_body_sizes (node, early);
2135*e4b17023SJohn Marino
2136*e4b17023SJohn Marino /* Inlining characteristics are maintained by the cgraph_mark_inline. */
2137*e4b17023SJohn Marino info->time = info->self_time;
2138*e4b17023SJohn Marino info->size = info->self_size;
2139*e4b17023SJohn Marino info->stack_frame_offset = 0;
2140*e4b17023SJohn Marino info->estimated_stack_size = info->estimated_self_stack_size;
2141*e4b17023SJohn Marino current_function_decl = old_decl;
2142*e4b17023SJohn Marino pop_cfun ();
2143*e4b17023SJohn Marino }
2144*e4b17023SJohn Marino
2145*e4b17023SJohn Marino
2146*e4b17023SJohn Marino /* Compute parameters of functions used by inliner using
2147*e4b17023SJohn Marino current_function_decl. */
2148*e4b17023SJohn Marino
2149*e4b17023SJohn Marino static unsigned int
compute_inline_parameters_for_current(void)2150*e4b17023SJohn Marino compute_inline_parameters_for_current (void)
2151*e4b17023SJohn Marino {
2152*e4b17023SJohn Marino compute_inline_parameters (cgraph_get_node (current_function_decl), true);
2153*e4b17023SJohn Marino return 0;
2154*e4b17023SJohn Marino }
2155*e4b17023SJohn Marino
2156*e4b17023SJohn Marino struct gimple_opt_pass pass_inline_parameters =
2157*e4b17023SJohn Marino {
2158*e4b17023SJohn Marino {
2159*e4b17023SJohn Marino GIMPLE_PASS,
2160*e4b17023SJohn Marino "inline_param", /* name */
2161*e4b17023SJohn Marino NULL, /* gate */
2162*e4b17023SJohn Marino compute_inline_parameters_for_current,/* execute */
2163*e4b17023SJohn Marino NULL, /* sub */
2164*e4b17023SJohn Marino NULL, /* next */
2165*e4b17023SJohn Marino 0, /* static_pass_number */
2166*e4b17023SJohn Marino TV_INLINE_HEURISTICS, /* tv_id */
2167*e4b17023SJohn Marino 0, /* properties_required */
2168*e4b17023SJohn Marino 0, /* properties_provided */
2169*e4b17023SJohn Marino 0, /* properties_destroyed */
2170*e4b17023SJohn Marino 0, /* todo_flags_start */
2171*e4b17023SJohn Marino 0 /* todo_flags_finish */
2172*e4b17023SJohn Marino }
2173*e4b17023SJohn Marino };
2174*e4b17023SJohn Marino
2175*e4b17023SJohn Marino
2176*e4b17023SJohn Marino /* Increase SIZE and TIME for size and time needed to handle edge E. */
2177*e4b17023SJohn Marino
2178*e4b17023SJohn Marino static void
estimate_edge_size_and_time(struct cgraph_edge * e,int * size,int * time,int prob)2179*e4b17023SJohn Marino estimate_edge_size_and_time (struct cgraph_edge *e, int *size, int *time,
2180*e4b17023SJohn Marino int prob)
2181*e4b17023SJohn Marino {
2182*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
2183*e4b17023SJohn Marino *size += es->call_stmt_size * INLINE_SIZE_SCALE;
2184*e4b17023SJohn Marino *time += (es->call_stmt_time * prob / REG_BR_PROB_BASE
2185*e4b17023SJohn Marino * e->frequency * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE));
2186*e4b17023SJohn Marino if (*time > MAX_TIME * INLINE_TIME_SCALE)
2187*e4b17023SJohn Marino *time = MAX_TIME * INLINE_TIME_SCALE;
2188*e4b17023SJohn Marino }
2189*e4b17023SJohn Marino
2190*e4b17023SJohn Marino
2191*e4b17023SJohn Marino /* Estimate benefit devirtualizing indirect edge IE, provided KNOWN_VALS and
2192*e4b17023SJohn Marino KNOWN_BINFOS. */
2193*e4b17023SJohn Marino
2194*e4b17023SJohn Marino static void
estimate_edge_devirt_benefit(struct cgraph_edge * ie,int * size,int * time,int prob,VEC (tree,heap)* known_vals,VEC (tree,heap)* known_binfos)2195*e4b17023SJohn Marino estimate_edge_devirt_benefit (struct cgraph_edge *ie,
2196*e4b17023SJohn Marino int *size, int *time, int prob,
2197*e4b17023SJohn Marino VEC (tree, heap) *known_vals,
2198*e4b17023SJohn Marino VEC (tree, heap) *known_binfos)
2199*e4b17023SJohn Marino {
2200*e4b17023SJohn Marino tree target;
2201*e4b17023SJohn Marino int time_diff, size_diff;
2202*e4b17023SJohn Marino
2203*e4b17023SJohn Marino if (!known_vals && !known_binfos)
2204*e4b17023SJohn Marino return;
2205*e4b17023SJohn Marino
2206*e4b17023SJohn Marino target = ipa_get_indirect_edge_target (ie, known_vals, known_binfos);
2207*e4b17023SJohn Marino if (!target)
2208*e4b17023SJohn Marino return;
2209*e4b17023SJohn Marino
2210*e4b17023SJohn Marino /* Account for difference in cost between indirect and direct calls. */
2211*e4b17023SJohn Marino size_diff = ((eni_size_weights.indirect_call_cost - eni_size_weights.call_cost)
2212*e4b17023SJohn Marino * INLINE_SIZE_SCALE);
2213*e4b17023SJohn Marino *size -= size_diff;
2214*e4b17023SJohn Marino time_diff = ((eni_time_weights.indirect_call_cost - eni_time_weights.call_cost)
2215*e4b17023SJohn Marino * INLINE_TIME_SCALE * prob / REG_BR_PROB_BASE);
2216*e4b17023SJohn Marino *time -= time_diff;
2217*e4b17023SJohn Marino
2218*e4b17023SJohn Marino /* TODO: This code is trying to benefit indirect calls that will be inlined later.
2219*e4b17023SJohn Marino The logic however do not belong into local size/time estimates and can not be
2220*e4b17023SJohn Marino done here, or the accounting of changes will get wrong and we result with
2221*e4b17023SJohn Marino negative function body sizes. We need to introduce infrastructure for independent
2222*e4b17023SJohn Marino benefits to the inliner. */
2223*e4b17023SJohn Marino #if 0
2224*e4b17023SJohn Marino struct cgraph_node *callee;
2225*e4b17023SJohn Marino struct inline_summary *isummary;
2226*e4b17023SJohn Marino int edge_size, edge_time, time_diff, size_diff;
2227*e4b17023SJohn Marino
2228*e4b17023SJohn Marino callee = cgraph_get_node (target);
2229*e4b17023SJohn Marino if (!callee || !callee->analyzed)
2230*e4b17023SJohn Marino return;
2231*e4b17023SJohn Marino isummary = inline_summary (callee);
2232*e4b17023SJohn Marino if (!isummary->inlinable)
2233*e4b17023SJohn Marino return;
2234*e4b17023SJohn Marino
2235*e4b17023SJohn Marino estimate_edge_size_and_time (ie, &edge_size, &edge_time, prob);
2236*e4b17023SJohn Marino
2237*e4b17023SJohn Marino /* Count benefit only from functions that definitely will be inlined
2238*e4b17023SJohn Marino if additional context from NODE's caller were available.
2239*e4b17023SJohn Marino
2240*e4b17023SJohn Marino We just account overall size change by inlining. TODO:
2241*e4b17023SJohn Marino we really need to add sort of benefit metrics for these kind of
2242*e4b17023SJohn Marino cases. */
2243*e4b17023SJohn Marino if (edge_size - size_diff >= isummary->size * INLINE_SIZE_SCALE)
2244*e4b17023SJohn Marino {
2245*e4b17023SJohn Marino /* Subtract size and time that we added for edge IE. */
2246*e4b17023SJohn Marino *size -= edge_size - size_diff;
2247*e4b17023SJohn Marino
2248*e4b17023SJohn Marino /* Account inlined call. */
2249*e4b17023SJohn Marino *size += isummary->size * INLINE_SIZE_SCALE;
2250*e4b17023SJohn Marino }
2251*e4b17023SJohn Marino #endif
2252*e4b17023SJohn Marino }
2253*e4b17023SJohn Marino
2254*e4b17023SJohn Marino
2255*e4b17023SJohn Marino /* Increase SIZE and TIME for size and time needed to handle all calls in NODE.
2256*e4b17023SJohn Marino POSSIBLE_TRUTHS, KNOWN_VALS and KNOWN_BINFOS describe context of the call
2257*e4b17023SJohn Marino site. */
2258*e4b17023SJohn Marino
2259*e4b17023SJohn Marino static void
estimate_calls_size_and_time(struct cgraph_node * node,int * size,int * time,clause_t possible_truths,VEC (tree,heap)* known_vals,VEC (tree,heap)* known_binfos)2260*e4b17023SJohn Marino estimate_calls_size_and_time (struct cgraph_node *node, int *size, int *time,
2261*e4b17023SJohn Marino clause_t possible_truths,
2262*e4b17023SJohn Marino VEC (tree, heap) *known_vals,
2263*e4b17023SJohn Marino VEC (tree, heap) *known_binfos)
2264*e4b17023SJohn Marino {
2265*e4b17023SJohn Marino struct cgraph_edge *e;
2266*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
2267*e4b17023SJohn Marino {
2268*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
2269*e4b17023SJohn Marino if (!es->predicate || evaluate_predicate (es->predicate, possible_truths))
2270*e4b17023SJohn Marino {
2271*e4b17023SJohn Marino if (e->inline_failed)
2272*e4b17023SJohn Marino {
2273*e4b17023SJohn Marino /* Predicates of calls shall not use NOT_CHANGED codes,
2274*e4b17023SJohn Marino sowe do not need to compute probabilities. */
2275*e4b17023SJohn Marino estimate_edge_size_and_time (e, size, time, REG_BR_PROB_BASE);
2276*e4b17023SJohn Marino }
2277*e4b17023SJohn Marino else
2278*e4b17023SJohn Marino estimate_calls_size_and_time (e->callee, size, time,
2279*e4b17023SJohn Marino possible_truths,
2280*e4b17023SJohn Marino known_vals, known_binfos);
2281*e4b17023SJohn Marino }
2282*e4b17023SJohn Marino }
2283*e4b17023SJohn Marino for (e = node->indirect_calls; e; e = e->next_callee)
2284*e4b17023SJohn Marino {
2285*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
2286*e4b17023SJohn Marino if (!es->predicate || evaluate_predicate (es->predicate, possible_truths))
2287*e4b17023SJohn Marino {
2288*e4b17023SJohn Marino estimate_edge_size_and_time (e, size, time, REG_BR_PROB_BASE);
2289*e4b17023SJohn Marino estimate_edge_devirt_benefit (e, size, time, REG_BR_PROB_BASE,
2290*e4b17023SJohn Marino known_vals, known_binfos);
2291*e4b17023SJohn Marino }
2292*e4b17023SJohn Marino }
2293*e4b17023SJohn Marino }
2294*e4b17023SJohn Marino
2295*e4b17023SJohn Marino
2296*e4b17023SJohn Marino /* Estimate size and time needed to execute NODE assuming
2297*e4b17023SJohn Marino POSSIBLE_TRUTHS clause, and KNOWN_VALS and KNOWN_BINFOS information
2298*e4b17023SJohn Marino about NODE's arguments. */
2299*e4b17023SJohn Marino
2300*e4b17023SJohn Marino static void
estimate_node_size_and_time(struct cgraph_node * node,clause_t possible_truths,VEC (tree,heap)* known_vals,VEC (tree,heap)* known_binfos,int * ret_size,int * ret_time,VEC (inline_param_summary_t,heap)* inline_param_summary)2301*e4b17023SJohn Marino estimate_node_size_and_time (struct cgraph_node *node,
2302*e4b17023SJohn Marino clause_t possible_truths,
2303*e4b17023SJohn Marino VEC (tree, heap) *known_vals,
2304*e4b17023SJohn Marino VEC (tree, heap) *known_binfos,
2305*e4b17023SJohn Marino int *ret_size, int *ret_time,
2306*e4b17023SJohn Marino VEC (inline_param_summary_t, heap)
2307*e4b17023SJohn Marino *inline_param_summary)
2308*e4b17023SJohn Marino {
2309*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
2310*e4b17023SJohn Marino size_time_entry *e;
2311*e4b17023SJohn Marino int size = 0, time = 0;
2312*e4b17023SJohn Marino int i;
2313*e4b17023SJohn Marino
2314*e4b17023SJohn Marino if (dump_file
2315*e4b17023SJohn Marino && (dump_flags & TDF_DETAILS))
2316*e4b17023SJohn Marino {
2317*e4b17023SJohn Marino bool found = false;
2318*e4b17023SJohn Marino fprintf (dump_file, " Estimating body: %s/%i\n"
2319*e4b17023SJohn Marino " Known to be false: ",
2320*e4b17023SJohn Marino cgraph_node_name (node),
2321*e4b17023SJohn Marino node->uid);
2322*e4b17023SJohn Marino
2323*e4b17023SJohn Marino for (i = predicate_not_inlined_condition;
2324*e4b17023SJohn Marino i < (predicate_first_dynamic_condition
2325*e4b17023SJohn Marino + (int)VEC_length (condition, info->conds)); i++)
2326*e4b17023SJohn Marino if (!(possible_truths & (1 << i)))
2327*e4b17023SJohn Marino {
2328*e4b17023SJohn Marino if (found)
2329*e4b17023SJohn Marino fprintf (dump_file, ", ");
2330*e4b17023SJohn Marino found = true;
2331*e4b17023SJohn Marino dump_condition (dump_file, info->conds, i);
2332*e4b17023SJohn Marino }
2333*e4b17023SJohn Marino }
2334*e4b17023SJohn Marino
2335*e4b17023SJohn Marino for (i = 0; VEC_iterate (size_time_entry, info->entry, i, e); i++)
2336*e4b17023SJohn Marino if (evaluate_predicate (&e->predicate, possible_truths))
2337*e4b17023SJohn Marino {
2338*e4b17023SJohn Marino size += e->size;
2339*e4b17023SJohn Marino if (!inline_param_summary)
2340*e4b17023SJohn Marino time += e->time;
2341*e4b17023SJohn Marino else
2342*e4b17023SJohn Marino {
2343*e4b17023SJohn Marino int prob = predicate_probability (info->conds,
2344*e4b17023SJohn Marino &e->predicate,
2345*e4b17023SJohn Marino possible_truths,
2346*e4b17023SJohn Marino inline_param_summary);
2347*e4b17023SJohn Marino time += e->time * prob / REG_BR_PROB_BASE;
2348*e4b17023SJohn Marino }
2349*e4b17023SJohn Marino
2350*e4b17023SJohn Marino }
2351*e4b17023SJohn Marino
2352*e4b17023SJohn Marino if (time > MAX_TIME * INLINE_TIME_SCALE)
2353*e4b17023SJohn Marino time = MAX_TIME * INLINE_TIME_SCALE;
2354*e4b17023SJohn Marino
2355*e4b17023SJohn Marino estimate_calls_size_and_time (node, &size, &time, possible_truths,
2356*e4b17023SJohn Marino known_vals, known_binfos);
2357*e4b17023SJohn Marino time = (time + INLINE_TIME_SCALE / 2) / INLINE_TIME_SCALE;
2358*e4b17023SJohn Marino size = (size + INLINE_SIZE_SCALE / 2) / INLINE_SIZE_SCALE;
2359*e4b17023SJohn Marino
2360*e4b17023SJohn Marino
2361*e4b17023SJohn Marino if (dump_file
2362*e4b17023SJohn Marino && (dump_flags & TDF_DETAILS))
2363*e4b17023SJohn Marino fprintf (dump_file, "\n size:%i time:%i\n", size, time);
2364*e4b17023SJohn Marino if (ret_time)
2365*e4b17023SJohn Marino *ret_time = time;
2366*e4b17023SJohn Marino if (ret_size)
2367*e4b17023SJohn Marino *ret_size = size;
2368*e4b17023SJohn Marino return;
2369*e4b17023SJohn Marino }
2370*e4b17023SJohn Marino
2371*e4b17023SJohn Marino
2372*e4b17023SJohn Marino /* Estimate size and time needed to execute callee of EDGE assuming that
2373*e4b17023SJohn Marino parameters known to be constant at caller of EDGE are propagated.
2374*e4b17023SJohn Marino KNOWN_VALS and KNOWN_BINFOS are vectors of assumed known constant values
2375*e4b17023SJohn Marino and types for parameters. */
2376*e4b17023SJohn Marino
2377*e4b17023SJohn Marino void
estimate_ipcp_clone_size_and_time(struct cgraph_node * node,VEC (tree,heap)* known_vals,VEC (tree,heap)* known_binfos,int * ret_size,int * ret_time)2378*e4b17023SJohn Marino estimate_ipcp_clone_size_and_time (struct cgraph_node *node,
2379*e4b17023SJohn Marino VEC (tree, heap) *known_vals,
2380*e4b17023SJohn Marino VEC (tree, heap) *known_binfos,
2381*e4b17023SJohn Marino int *ret_size, int *ret_time)
2382*e4b17023SJohn Marino {
2383*e4b17023SJohn Marino clause_t clause;
2384*e4b17023SJohn Marino
2385*e4b17023SJohn Marino clause = evaluate_conditions_for_known_args (node, false, known_vals);
2386*e4b17023SJohn Marino estimate_node_size_and_time (node, clause, known_vals, known_binfos,
2387*e4b17023SJohn Marino ret_size, ret_time,
2388*e4b17023SJohn Marino NULL);
2389*e4b17023SJohn Marino }
2390*e4b17023SJohn Marino
2391*e4b17023SJohn Marino
2392*e4b17023SJohn Marino /* Translate all conditions from callee representation into caller
2393*e4b17023SJohn Marino representation and symbolically evaluate predicate P into new predicate.
2394*e4b17023SJohn Marino
2395*e4b17023SJohn Marino INFO is inline_summary of function we are adding predicate into,
2396*e4b17023SJohn Marino CALLEE_INFO is summary of function predicate P is from. OPERAND_MAP is
2397*e4b17023SJohn Marino array giving callee formal IDs the caller formal IDs. POSSSIBLE_TRUTHS is
2398*e4b17023SJohn Marino clausule of all callee conditions that may be true in caller context.
2399*e4b17023SJohn Marino TOPLEV_PREDICATE is predicate under which callee is executed. */
2400*e4b17023SJohn Marino
2401*e4b17023SJohn Marino static struct predicate
remap_predicate(struct inline_summary * info,struct inline_summary * callee_info,struct predicate * p,VEC (int,heap)* operand_map,clause_t possible_truths,struct predicate * toplev_predicate)2402*e4b17023SJohn Marino remap_predicate (struct inline_summary *info,
2403*e4b17023SJohn Marino struct inline_summary *callee_info,
2404*e4b17023SJohn Marino struct predicate *p,
2405*e4b17023SJohn Marino VEC (int, heap) *operand_map,
2406*e4b17023SJohn Marino clause_t possible_truths,
2407*e4b17023SJohn Marino struct predicate *toplev_predicate)
2408*e4b17023SJohn Marino {
2409*e4b17023SJohn Marino int i;
2410*e4b17023SJohn Marino struct predicate out = true_predicate ();
2411*e4b17023SJohn Marino
2412*e4b17023SJohn Marino /* True predicate is easy. */
2413*e4b17023SJohn Marino if (true_predicate_p (p))
2414*e4b17023SJohn Marino return *toplev_predicate;
2415*e4b17023SJohn Marino for (i = 0; p->clause[i]; i++)
2416*e4b17023SJohn Marino {
2417*e4b17023SJohn Marino clause_t clause = p->clause[i];
2418*e4b17023SJohn Marino int cond;
2419*e4b17023SJohn Marino struct predicate clause_predicate = false_predicate ();
2420*e4b17023SJohn Marino
2421*e4b17023SJohn Marino gcc_assert (i < MAX_CLAUSES);
2422*e4b17023SJohn Marino
2423*e4b17023SJohn Marino for (cond = 0; cond < NUM_CONDITIONS; cond ++)
2424*e4b17023SJohn Marino /* Do we have condition we can't disprove? */
2425*e4b17023SJohn Marino if (clause & possible_truths & (1 << cond))
2426*e4b17023SJohn Marino {
2427*e4b17023SJohn Marino struct predicate cond_predicate;
2428*e4b17023SJohn Marino /* Work out if the condition can translate to predicate in the
2429*e4b17023SJohn Marino inlined function. */
2430*e4b17023SJohn Marino if (cond >= predicate_first_dynamic_condition)
2431*e4b17023SJohn Marino {
2432*e4b17023SJohn Marino struct condition *c;
2433*e4b17023SJohn Marino
2434*e4b17023SJohn Marino c = VEC_index (condition, callee_info->conds,
2435*e4b17023SJohn Marino cond - predicate_first_dynamic_condition);
2436*e4b17023SJohn Marino /* See if we can remap condition operand to caller's operand.
2437*e4b17023SJohn Marino Otherwise give up. */
2438*e4b17023SJohn Marino if (!operand_map
2439*e4b17023SJohn Marino || (int)VEC_length (int, operand_map) <= c->operand_num
2440*e4b17023SJohn Marino || VEC_index (int, operand_map, c->operand_num) == -1)
2441*e4b17023SJohn Marino cond_predicate = true_predicate ();
2442*e4b17023SJohn Marino else
2443*e4b17023SJohn Marino cond_predicate = add_condition (info,
2444*e4b17023SJohn Marino VEC_index (int, operand_map,
2445*e4b17023SJohn Marino c->operand_num),
2446*e4b17023SJohn Marino c->code, c->val);
2447*e4b17023SJohn Marino }
2448*e4b17023SJohn Marino /* Fixed conditions remains same, construct single
2449*e4b17023SJohn Marino condition predicate. */
2450*e4b17023SJohn Marino else
2451*e4b17023SJohn Marino {
2452*e4b17023SJohn Marino cond_predicate.clause[0] = 1 << cond;
2453*e4b17023SJohn Marino cond_predicate.clause[1] = 0;
2454*e4b17023SJohn Marino }
2455*e4b17023SJohn Marino clause_predicate = or_predicates (info->conds, &clause_predicate,
2456*e4b17023SJohn Marino &cond_predicate);
2457*e4b17023SJohn Marino }
2458*e4b17023SJohn Marino out = and_predicates (info->conds, &out, &clause_predicate);
2459*e4b17023SJohn Marino }
2460*e4b17023SJohn Marino return and_predicates (info->conds, &out, toplev_predicate);
2461*e4b17023SJohn Marino }
2462*e4b17023SJohn Marino
2463*e4b17023SJohn Marino
2464*e4b17023SJohn Marino /* Update summary information of inline clones after inlining.
2465*e4b17023SJohn Marino Compute peak stack usage. */
2466*e4b17023SJohn Marino
2467*e4b17023SJohn Marino static void
inline_update_callee_summaries(struct cgraph_node * node,int depth)2468*e4b17023SJohn Marino inline_update_callee_summaries (struct cgraph_node *node,
2469*e4b17023SJohn Marino int depth)
2470*e4b17023SJohn Marino {
2471*e4b17023SJohn Marino struct cgraph_edge *e;
2472*e4b17023SJohn Marino struct inline_summary *callee_info = inline_summary (node);
2473*e4b17023SJohn Marino struct inline_summary *caller_info = inline_summary (node->callers->caller);
2474*e4b17023SJohn Marino HOST_WIDE_INT peak;
2475*e4b17023SJohn Marino
2476*e4b17023SJohn Marino callee_info->stack_frame_offset
2477*e4b17023SJohn Marino = caller_info->stack_frame_offset
2478*e4b17023SJohn Marino + caller_info->estimated_self_stack_size;
2479*e4b17023SJohn Marino peak = callee_info->stack_frame_offset
2480*e4b17023SJohn Marino + callee_info->estimated_self_stack_size;
2481*e4b17023SJohn Marino if (inline_summary (node->global.inlined_to)->estimated_stack_size
2482*e4b17023SJohn Marino < peak)
2483*e4b17023SJohn Marino inline_summary (node->global.inlined_to)->estimated_stack_size = peak;
2484*e4b17023SJohn Marino cgraph_propagate_frequency (node);
2485*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
2486*e4b17023SJohn Marino {
2487*e4b17023SJohn Marino if (!e->inline_failed)
2488*e4b17023SJohn Marino inline_update_callee_summaries (e->callee, depth);
2489*e4b17023SJohn Marino inline_edge_summary (e)->loop_depth += depth;
2490*e4b17023SJohn Marino }
2491*e4b17023SJohn Marino for (e = node->indirect_calls; e; e = e->next_callee)
2492*e4b17023SJohn Marino inline_edge_summary (e)->loop_depth += depth;
2493*e4b17023SJohn Marino }
2494*e4b17023SJohn Marino
2495*e4b17023SJohn Marino /* Update change_prob of EDGE after INLINED_EDGE has been inlined.
2496*e4b17023SJohn Marino When functoin A is inlined in B and A calls C with parameter that
2497*e4b17023SJohn Marino changes with probability PROB1 and C is known to be passthroug
2498*e4b17023SJohn Marino of argument if B that change with probability PROB2, the probability
2499*e4b17023SJohn Marino of change is now PROB1*PROB2. */
2500*e4b17023SJohn Marino
2501*e4b17023SJohn Marino static void
remap_edge_change_prob(struct cgraph_edge * inlined_edge,struct cgraph_edge * edge)2502*e4b17023SJohn Marino remap_edge_change_prob (struct cgraph_edge *inlined_edge,
2503*e4b17023SJohn Marino struct cgraph_edge *edge)
2504*e4b17023SJohn Marino {
2505*e4b17023SJohn Marino if (ipa_node_params_vector)
2506*e4b17023SJohn Marino {
2507*e4b17023SJohn Marino int i;
2508*e4b17023SJohn Marino struct ipa_edge_args *args = IPA_EDGE_REF (edge);
2509*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
2510*e4b17023SJohn Marino struct inline_edge_summary *inlined_es
2511*e4b17023SJohn Marino = inline_edge_summary (inlined_edge);
2512*e4b17023SJohn Marino
2513*e4b17023SJohn Marino for (i = 0; i < ipa_get_cs_argument_count (args); i++)
2514*e4b17023SJohn Marino {
2515*e4b17023SJohn Marino struct ipa_jump_func *jfunc = ipa_get_ith_jump_func (args, i);
2516*e4b17023SJohn Marino if (jfunc->type == IPA_JF_PASS_THROUGH
2517*e4b17023SJohn Marino && (jfunc->value.pass_through.formal_id
2518*e4b17023SJohn Marino < (int) VEC_length (inline_param_summary_t,
2519*e4b17023SJohn Marino inlined_es->param)))
2520*e4b17023SJohn Marino {
2521*e4b17023SJohn Marino int prob1 = VEC_index (inline_param_summary_t,
2522*e4b17023SJohn Marino es->param, i)->change_prob;
2523*e4b17023SJohn Marino int prob2 = VEC_index
2524*e4b17023SJohn Marino (inline_param_summary_t,
2525*e4b17023SJohn Marino inlined_es->param,
2526*e4b17023SJohn Marino jfunc->value.pass_through.formal_id)->change_prob;
2527*e4b17023SJohn Marino int prob = ((prob1 * prob2 + REG_BR_PROB_BASE / 2)
2528*e4b17023SJohn Marino / REG_BR_PROB_BASE);
2529*e4b17023SJohn Marino
2530*e4b17023SJohn Marino if (prob1 && prob2 && !prob)
2531*e4b17023SJohn Marino prob = 1;
2532*e4b17023SJohn Marino
2533*e4b17023SJohn Marino VEC_index (inline_param_summary_t,
2534*e4b17023SJohn Marino es->param, i)->change_prob = prob;
2535*e4b17023SJohn Marino }
2536*e4b17023SJohn Marino }
2537*e4b17023SJohn Marino }
2538*e4b17023SJohn Marino }
2539*e4b17023SJohn Marino
2540*e4b17023SJohn Marino /* Update edge summaries of NODE after INLINED_EDGE has been inlined.
2541*e4b17023SJohn Marino
2542*e4b17023SJohn Marino Remap predicates of callees of NODE. Rest of arguments match
2543*e4b17023SJohn Marino remap_predicate.
2544*e4b17023SJohn Marino
2545*e4b17023SJohn Marino Also update change probabilities. */
2546*e4b17023SJohn Marino
2547*e4b17023SJohn Marino static void
remap_edge_summaries(struct cgraph_edge * inlined_edge,struct cgraph_node * node,struct inline_summary * info,struct inline_summary * callee_info,VEC (int,heap)* operand_map,clause_t possible_truths,struct predicate * toplev_predicate)2548*e4b17023SJohn Marino remap_edge_summaries (struct cgraph_edge *inlined_edge,
2549*e4b17023SJohn Marino struct cgraph_node *node,
2550*e4b17023SJohn Marino struct inline_summary *info,
2551*e4b17023SJohn Marino struct inline_summary *callee_info,
2552*e4b17023SJohn Marino VEC (int, heap) *operand_map,
2553*e4b17023SJohn Marino clause_t possible_truths,
2554*e4b17023SJohn Marino struct predicate *toplev_predicate)
2555*e4b17023SJohn Marino {
2556*e4b17023SJohn Marino struct cgraph_edge *e;
2557*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
2558*e4b17023SJohn Marino {
2559*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
2560*e4b17023SJohn Marino struct predicate p;
2561*e4b17023SJohn Marino
2562*e4b17023SJohn Marino if (e->inline_failed)
2563*e4b17023SJohn Marino {
2564*e4b17023SJohn Marino remap_edge_change_prob (inlined_edge, e);
2565*e4b17023SJohn Marino
2566*e4b17023SJohn Marino if (es->predicate)
2567*e4b17023SJohn Marino {
2568*e4b17023SJohn Marino p = remap_predicate (info, callee_info,
2569*e4b17023SJohn Marino es->predicate, operand_map, possible_truths,
2570*e4b17023SJohn Marino toplev_predicate);
2571*e4b17023SJohn Marino edge_set_predicate (e, &p);
2572*e4b17023SJohn Marino /* TODO: We should remove the edge for code that will be
2573*e4b17023SJohn Marino optimized out, but we need to keep verifiers and tree-inline
2574*e4b17023SJohn Marino happy. Make it cold for now. */
2575*e4b17023SJohn Marino if (false_predicate_p (&p))
2576*e4b17023SJohn Marino {
2577*e4b17023SJohn Marino e->count = 0;
2578*e4b17023SJohn Marino e->frequency = 0;
2579*e4b17023SJohn Marino }
2580*e4b17023SJohn Marino }
2581*e4b17023SJohn Marino else
2582*e4b17023SJohn Marino edge_set_predicate (e, toplev_predicate);
2583*e4b17023SJohn Marino }
2584*e4b17023SJohn Marino else
2585*e4b17023SJohn Marino remap_edge_summaries (inlined_edge, e->callee, info, callee_info,
2586*e4b17023SJohn Marino operand_map, possible_truths, toplev_predicate);
2587*e4b17023SJohn Marino }
2588*e4b17023SJohn Marino for (e = node->indirect_calls; e; e = e->next_callee)
2589*e4b17023SJohn Marino {
2590*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
2591*e4b17023SJohn Marino struct predicate p;
2592*e4b17023SJohn Marino
2593*e4b17023SJohn Marino remap_edge_change_prob (inlined_edge, e);
2594*e4b17023SJohn Marino if (es->predicate)
2595*e4b17023SJohn Marino {
2596*e4b17023SJohn Marino p = remap_predicate (info, callee_info,
2597*e4b17023SJohn Marino es->predicate, operand_map, possible_truths,
2598*e4b17023SJohn Marino toplev_predicate);
2599*e4b17023SJohn Marino edge_set_predicate (e, &p);
2600*e4b17023SJohn Marino /* TODO: We should remove the edge for code that will be optimized
2601*e4b17023SJohn Marino out, but we need to keep verifiers and tree-inline happy.
2602*e4b17023SJohn Marino Make it cold for now. */
2603*e4b17023SJohn Marino if (false_predicate_p (&p))
2604*e4b17023SJohn Marino {
2605*e4b17023SJohn Marino e->count = 0;
2606*e4b17023SJohn Marino e->frequency = 0;
2607*e4b17023SJohn Marino }
2608*e4b17023SJohn Marino }
2609*e4b17023SJohn Marino else
2610*e4b17023SJohn Marino edge_set_predicate (e, toplev_predicate);
2611*e4b17023SJohn Marino }
2612*e4b17023SJohn Marino }
2613*e4b17023SJohn Marino
2614*e4b17023SJohn Marino
2615*e4b17023SJohn Marino /* We inlined EDGE. Update summary of the function we inlined into. */
2616*e4b17023SJohn Marino
2617*e4b17023SJohn Marino void
inline_merge_summary(struct cgraph_edge * edge)2618*e4b17023SJohn Marino inline_merge_summary (struct cgraph_edge *edge)
2619*e4b17023SJohn Marino {
2620*e4b17023SJohn Marino struct inline_summary *callee_info = inline_summary (edge->callee);
2621*e4b17023SJohn Marino struct cgraph_node *to = (edge->caller->global.inlined_to
2622*e4b17023SJohn Marino ? edge->caller->global.inlined_to : edge->caller);
2623*e4b17023SJohn Marino struct inline_summary *info = inline_summary (to);
2624*e4b17023SJohn Marino clause_t clause = 0; /* not_inline is known to be false. */
2625*e4b17023SJohn Marino size_time_entry *e;
2626*e4b17023SJohn Marino VEC (int, heap) *operand_map = NULL;
2627*e4b17023SJohn Marino int i;
2628*e4b17023SJohn Marino struct predicate toplev_predicate;
2629*e4b17023SJohn Marino struct predicate true_p = true_predicate ();
2630*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
2631*e4b17023SJohn Marino
2632*e4b17023SJohn Marino if (es->predicate)
2633*e4b17023SJohn Marino toplev_predicate = *es->predicate;
2634*e4b17023SJohn Marino else
2635*e4b17023SJohn Marino toplev_predicate = true_predicate ();
2636*e4b17023SJohn Marino
2637*e4b17023SJohn Marino if (ipa_node_params_vector && callee_info->conds)
2638*e4b17023SJohn Marino {
2639*e4b17023SJohn Marino struct ipa_edge_args *args = IPA_EDGE_REF (edge);
2640*e4b17023SJohn Marino int count = ipa_get_cs_argument_count (args);
2641*e4b17023SJohn Marino int i;
2642*e4b17023SJohn Marino
2643*e4b17023SJohn Marino evaluate_properties_for_edge (edge, true, &clause, NULL, NULL);
2644*e4b17023SJohn Marino if (count)
2645*e4b17023SJohn Marino VEC_safe_grow_cleared (int, heap, operand_map, count);
2646*e4b17023SJohn Marino for (i = 0; i < count; i++)
2647*e4b17023SJohn Marino {
2648*e4b17023SJohn Marino struct ipa_jump_func *jfunc = ipa_get_ith_jump_func (args, i);
2649*e4b17023SJohn Marino int map = -1;
2650*e4b17023SJohn Marino /* TODO: handle non-NOPs when merging. */
2651*e4b17023SJohn Marino if (jfunc->type == IPA_JF_PASS_THROUGH
2652*e4b17023SJohn Marino && jfunc->value.pass_through.operation == NOP_EXPR)
2653*e4b17023SJohn Marino map = jfunc->value.pass_through.formal_id;
2654*e4b17023SJohn Marino VEC_replace (int, operand_map, i, map);
2655*e4b17023SJohn Marino gcc_assert (map < ipa_get_param_count (IPA_NODE_REF (to)));
2656*e4b17023SJohn Marino }
2657*e4b17023SJohn Marino }
2658*e4b17023SJohn Marino for (i = 0; VEC_iterate (size_time_entry, callee_info->entry, i, e); i++)
2659*e4b17023SJohn Marino {
2660*e4b17023SJohn Marino struct predicate p = remap_predicate (info, callee_info,
2661*e4b17023SJohn Marino &e->predicate, operand_map, clause,
2662*e4b17023SJohn Marino &toplev_predicate);
2663*e4b17023SJohn Marino if (!false_predicate_p (&p))
2664*e4b17023SJohn Marino {
2665*e4b17023SJohn Marino gcov_type add_time = ((gcov_type)e->time * edge->frequency
2666*e4b17023SJohn Marino + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2667*e4b17023SJohn Marino int prob = predicate_probability (callee_info->conds,
2668*e4b17023SJohn Marino &e->predicate,
2669*e4b17023SJohn Marino clause, es->param);
2670*e4b17023SJohn Marino add_time = add_time * prob / REG_BR_PROB_BASE;
2671*e4b17023SJohn Marino if (add_time > MAX_TIME * INLINE_TIME_SCALE)
2672*e4b17023SJohn Marino add_time = MAX_TIME * INLINE_TIME_SCALE;
2673*e4b17023SJohn Marino if (prob != REG_BR_PROB_BASE
2674*e4b17023SJohn Marino && dump_file && (dump_flags & TDF_DETAILS))
2675*e4b17023SJohn Marino {
2676*e4b17023SJohn Marino fprintf (dump_file, "\t\tScaling time by probability:%f\n",
2677*e4b17023SJohn Marino (double)prob / REG_BR_PROB_BASE);
2678*e4b17023SJohn Marino }
2679*e4b17023SJohn Marino account_size_time (info, e->size, add_time, &p);
2680*e4b17023SJohn Marino }
2681*e4b17023SJohn Marino }
2682*e4b17023SJohn Marino remap_edge_summaries (edge, edge->callee, info, callee_info, operand_map,
2683*e4b17023SJohn Marino clause, &toplev_predicate);
2684*e4b17023SJohn Marino info->size = 0;
2685*e4b17023SJohn Marino info->time = 0;
2686*e4b17023SJohn Marino for (i = 0; VEC_iterate (size_time_entry, info->entry, i, e); i++)
2687*e4b17023SJohn Marino info->size += e->size, info->time += e->time;
2688*e4b17023SJohn Marino estimate_calls_size_and_time (to, &info->size, &info->time,
2689*e4b17023SJohn Marino ~(clause_t)(1 << predicate_false_condition),
2690*e4b17023SJohn Marino NULL, NULL);
2691*e4b17023SJohn Marino
2692*e4b17023SJohn Marino inline_update_callee_summaries (edge->callee,
2693*e4b17023SJohn Marino inline_edge_summary (edge)->loop_depth);
2694*e4b17023SJohn Marino
2695*e4b17023SJohn Marino /* We do not maintain predicates of inlined edges, free it. */
2696*e4b17023SJohn Marino edge_set_predicate (edge, &true_p);
2697*e4b17023SJohn Marino /* Similarly remove param summaries. */
2698*e4b17023SJohn Marino VEC_free (inline_param_summary_t, heap, es->param);
2699*e4b17023SJohn Marino VEC_free (int, heap, operand_map);
2700*e4b17023SJohn Marino
2701*e4b17023SJohn Marino info->time = (info->time + INLINE_TIME_SCALE / 2) / INLINE_TIME_SCALE;
2702*e4b17023SJohn Marino info->size = (info->size + INLINE_SIZE_SCALE / 2) / INLINE_SIZE_SCALE;
2703*e4b17023SJohn Marino }
2704*e4b17023SJohn Marino
2705*e4b17023SJohn Marino
2706*e4b17023SJohn Marino /* Estimate the time cost for the caller when inlining EDGE.
2707*e4b17023SJohn Marino Only to be called via estimate_edge_time, that handles the
2708*e4b17023SJohn Marino caching mechanism.
2709*e4b17023SJohn Marino
2710*e4b17023SJohn Marino When caching, also update the cache entry. Compute both time and
2711*e4b17023SJohn Marino size, since we always need both metrics eventually. */
2712*e4b17023SJohn Marino
2713*e4b17023SJohn Marino int
do_estimate_edge_time(struct cgraph_edge * edge)2714*e4b17023SJohn Marino do_estimate_edge_time (struct cgraph_edge *edge)
2715*e4b17023SJohn Marino {
2716*e4b17023SJohn Marino int time;
2717*e4b17023SJohn Marino int size;
2718*e4b17023SJohn Marino gcov_type ret;
2719*e4b17023SJohn Marino struct cgraph_node *callee;
2720*e4b17023SJohn Marino clause_t clause;
2721*e4b17023SJohn Marino VEC (tree, heap) *known_vals;
2722*e4b17023SJohn Marino VEC (tree, heap) *known_binfos;
2723*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
2724*e4b17023SJohn Marino
2725*e4b17023SJohn Marino callee = cgraph_function_or_thunk_node (edge->callee, NULL);
2726*e4b17023SJohn Marino
2727*e4b17023SJohn Marino gcc_checking_assert (edge->inline_failed);
2728*e4b17023SJohn Marino evaluate_properties_for_edge (edge, true,
2729*e4b17023SJohn Marino &clause, &known_vals, &known_binfos);
2730*e4b17023SJohn Marino estimate_node_size_and_time (callee, clause, known_vals, known_binfos,
2731*e4b17023SJohn Marino &size, &time, es->param);
2732*e4b17023SJohn Marino VEC_free (tree, heap, known_vals);
2733*e4b17023SJohn Marino VEC_free (tree, heap, known_binfos);
2734*e4b17023SJohn Marino
2735*e4b17023SJohn Marino ret = (((gcov_type)time
2736*e4b17023SJohn Marino - es->call_stmt_time) * edge->frequency
2737*e4b17023SJohn Marino + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2738*e4b17023SJohn Marino
2739*e4b17023SJohn Marino /* When caching, update the cache entry. */
2740*e4b17023SJohn Marino if (edge_growth_cache)
2741*e4b17023SJohn Marino {
2742*e4b17023SJohn Marino int ret_size;
2743*e4b17023SJohn Marino if ((int)VEC_length (edge_growth_cache_entry, edge_growth_cache)
2744*e4b17023SJohn Marino <= edge->uid)
2745*e4b17023SJohn Marino VEC_safe_grow_cleared (edge_growth_cache_entry, heap, edge_growth_cache,
2746*e4b17023SJohn Marino cgraph_edge_max_uid);
2747*e4b17023SJohn Marino VEC_index (edge_growth_cache_entry, edge_growth_cache, edge->uid)->time
2748*e4b17023SJohn Marino = ret + (ret >= 0);
2749*e4b17023SJohn Marino
2750*e4b17023SJohn Marino ret_size = size - es->call_stmt_size;
2751*e4b17023SJohn Marino gcc_checking_assert (es->call_stmt_size);
2752*e4b17023SJohn Marino VEC_index (edge_growth_cache_entry, edge_growth_cache, edge->uid)->size
2753*e4b17023SJohn Marino = ret_size + (ret_size >= 0);
2754*e4b17023SJohn Marino }
2755*e4b17023SJohn Marino return ret;
2756*e4b17023SJohn Marino }
2757*e4b17023SJohn Marino
2758*e4b17023SJohn Marino
2759*e4b17023SJohn Marino /* Estimate the growth of the caller when inlining EDGE.
2760*e4b17023SJohn Marino Only to be called via estimate_edge_size. */
2761*e4b17023SJohn Marino
2762*e4b17023SJohn Marino int
do_estimate_edge_growth(struct cgraph_edge * edge)2763*e4b17023SJohn Marino do_estimate_edge_growth (struct cgraph_edge *edge)
2764*e4b17023SJohn Marino {
2765*e4b17023SJohn Marino int size;
2766*e4b17023SJohn Marino struct cgraph_node *callee;
2767*e4b17023SJohn Marino clause_t clause;
2768*e4b17023SJohn Marino VEC (tree, heap) *known_vals;
2769*e4b17023SJohn Marino VEC (tree, heap) *known_binfos;
2770*e4b17023SJohn Marino
2771*e4b17023SJohn Marino /* When we do caching, use do_estimate_edge_time to populate the entry. */
2772*e4b17023SJohn Marino
2773*e4b17023SJohn Marino if (edge_growth_cache)
2774*e4b17023SJohn Marino {
2775*e4b17023SJohn Marino do_estimate_edge_time (edge);
2776*e4b17023SJohn Marino size = VEC_index (edge_growth_cache_entry,
2777*e4b17023SJohn Marino edge_growth_cache,
2778*e4b17023SJohn Marino edge->uid)->size;
2779*e4b17023SJohn Marino gcc_checking_assert (size);
2780*e4b17023SJohn Marino return size - (size > 0);
2781*e4b17023SJohn Marino }
2782*e4b17023SJohn Marino
2783*e4b17023SJohn Marino callee = cgraph_function_or_thunk_node (edge->callee, NULL);
2784*e4b17023SJohn Marino
2785*e4b17023SJohn Marino /* Early inliner runs without caching, go ahead and do the dirty work. */
2786*e4b17023SJohn Marino gcc_checking_assert (edge->inline_failed);
2787*e4b17023SJohn Marino evaluate_properties_for_edge (edge, true,
2788*e4b17023SJohn Marino &clause, &known_vals, &known_binfos);
2789*e4b17023SJohn Marino estimate_node_size_and_time (callee, clause, known_vals, known_binfos,
2790*e4b17023SJohn Marino &size, NULL, NULL);
2791*e4b17023SJohn Marino VEC_free (tree, heap, known_vals);
2792*e4b17023SJohn Marino VEC_free (tree, heap, known_binfos);
2793*e4b17023SJohn Marino gcc_checking_assert (inline_edge_summary (edge)->call_stmt_size);
2794*e4b17023SJohn Marino return size - inline_edge_summary (edge)->call_stmt_size;
2795*e4b17023SJohn Marino }
2796*e4b17023SJohn Marino
2797*e4b17023SJohn Marino
2798*e4b17023SJohn Marino /* Estimate self time of the function NODE after inlining EDGE. */
2799*e4b17023SJohn Marino
2800*e4b17023SJohn Marino int
estimate_time_after_inlining(struct cgraph_node * node,struct cgraph_edge * edge)2801*e4b17023SJohn Marino estimate_time_after_inlining (struct cgraph_node *node,
2802*e4b17023SJohn Marino struct cgraph_edge *edge)
2803*e4b17023SJohn Marino {
2804*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
2805*e4b17023SJohn Marino if (!es->predicate || !false_predicate_p (es->predicate))
2806*e4b17023SJohn Marino {
2807*e4b17023SJohn Marino gcov_type time = inline_summary (node)->time + estimate_edge_time (edge);
2808*e4b17023SJohn Marino if (time < 0)
2809*e4b17023SJohn Marino time = 0;
2810*e4b17023SJohn Marino if (time > MAX_TIME)
2811*e4b17023SJohn Marino time = MAX_TIME;
2812*e4b17023SJohn Marino return time;
2813*e4b17023SJohn Marino }
2814*e4b17023SJohn Marino return inline_summary (node)->time;
2815*e4b17023SJohn Marino }
2816*e4b17023SJohn Marino
2817*e4b17023SJohn Marino
2818*e4b17023SJohn Marino /* Estimate the size of NODE after inlining EDGE which should be an
2819*e4b17023SJohn Marino edge to either NODE or a call inlined into NODE. */
2820*e4b17023SJohn Marino
2821*e4b17023SJohn Marino int
estimate_size_after_inlining(struct cgraph_node * node,struct cgraph_edge * edge)2822*e4b17023SJohn Marino estimate_size_after_inlining (struct cgraph_node *node,
2823*e4b17023SJohn Marino struct cgraph_edge *edge)
2824*e4b17023SJohn Marino {
2825*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (edge);
2826*e4b17023SJohn Marino if (!es->predicate || !false_predicate_p (es->predicate))
2827*e4b17023SJohn Marino {
2828*e4b17023SJohn Marino int size = inline_summary (node)->size + estimate_edge_growth (edge);
2829*e4b17023SJohn Marino gcc_assert (size >= 0);
2830*e4b17023SJohn Marino return size;
2831*e4b17023SJohn Marino }
2832*e4b17023SJohn Marino return inline_summary (node)->size;
2833*e4b17023SJohn Marino }
2834*e4b17023SJohn Marino
2835*e4b17023SJohn Marino
2836*e4b17023SJohn Marino struct growth_data
2837*e4b17023SJohn Marino {
2838*e4b17023SJohn Marino bool self_recursive;
2839*e4b17023SJohn Marino int growth;
2840*e4b17023SJohn Marino };
2841*e4b17023SJohn Marino
2842*e4b17023SJohn Marino
2843*e4b17023SJohn Marino /* Worker for do_estimate_growth. Collect growth for all callers. */
2844*e4b17023SJohn Marino
2845*e4b17023SJohn Marino static bool
do_estimate_growth_1(struct cgraph_node * node,void * data)2846*e4b17023SJohn Marino do_estimate_growth_1 (struct cgraph_node *node, void *data)
2847*e4b17023SJohn Marino {
2848*e4b17023SJohn Marino struct cgraph_edge *e;
2849*e4b17023SJohn Marino struct growth_data *d = (struct growth_data *) data;
2850*e4b17023SJohn Marino
2851*e4b17023SJohn Marino for (e = node->callers; e; e = e->next_caller)
2852*e4b17023SJohn Marino {
2853*e4b17023SJohn Marino gcc_checking_assert (e->inline_failed);
2854*e4b17023SJohn Marino
2855*e4b17023SJohn Marino if (e->caller == node
2856*e4b17023SJohn Marino || (e->caller->global.inlined_to
2857*e4b17023SJohn Marino && e->caller->global.inlined_to == node))
2858*e4b17023SJohn Marino d->self_recursive = true;
2859*e4b17023SJohn Marino d->growth += estimate_edge_growth (e);
2860*e4b17023SJohn Marino }
2861*e4b17023SJohn Marino return false;
2862*e4b17023SJohn Marino }
2863*e4b17023SJohn Marino
2864*e4b17023SJohn Marino
2865*e4b17023SJohn Marino /* Estimate the growth caused by inlining NODE into all callees. */
2866*e4b17023SJohn Marino
2867*e4b17023SJohn Marino int
do_estimate_growth(struct cgraph_node * node)2868*e4b17023SJohn Marino do_estimate_growth (struct cgraph_node *node)
2869*e4b17023SJohn Marino {
2870*e4b17023SJohn Marino struct growth_data d = {0, false};
2871*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
2872*e4b17023SJohn Marino
2873*e4b17023SJohn Marino cgraph_for_node_and_aliases (node, do_estimate_growth_1, &d, true);
2874*e4b17023SJohn Marino
2875*e4b17023SJohn Marino /* For self recursive functions the growth estimation really should be
2876*e4b17023SJohn Marino infinity. We don't want to return very large values because the growth
2877*e4b17023SJohn Marino plays various roles in badness computation fractions. Be sure to not
2878*e4b17023SJohn Marino return zero or negative growths. */
2879*e4b17023SJohn Marino if (d.self_recursive)
2880*e4b17023SJohn Marino d.growth = d.growth < info->size ? info->size : d.growth;
2881*e4b17023SJohn Marino else
2882*e4b17023SJohn Marino {
2883*e4b17023SJohn Marino if (!DECL_EXTERNAL (node->decl)
2884*e4b17023SJohn Marino && cgraph_will_be_removed_from_program_if_no_direct_calls (node))
2885*e4b17023SJohn Marino d.growth -= info->size;
2886*e4b17023SJohn Marino /* COMDAT functions are very often not shared across multiple units
2887*e4b17023SJohn Marino since they come from various template instantiations.
2888*e4b17023SJohn Marino Take this into account. */
2889*e4b17023SJohn Marino else if (DECL_COMDAT (node->decl)
2890*e4b17023SJohn Marino && cgraph_can_remove_if_no_direct_calls_p (node))
2891*e4b17023SJohn Marino d.growth -= (info->size
2892*e4b17023SJohn Marino * (100 - PARAM_VALUE (PARAM_COMDAT_SHARING_PROBABILITY))
2893*e4b17023SJohn Marino + 50) / 100;
2894*e4b17023SJohn Marino }
2895*e4b17023SJohn Marino
2896*e4b17023SJohn Marino if (node_growth_cache)
2897*e4b17023SJohn Marino {
2898*e4b17023SJohn Marino if ((int)VEC_length (int, node_growth_cache) <= node->uid)
2899*e4b17023SJohn Marino VEC_safe_grow_cleared (int, heap, node_growth_cache, cgraph_max_uid);
2900*e4b17023SJohn Marino VEC_replace (int, node_growth_cache, node->uid,
2901*e4b17023SJohn Marino d.growth + (d.growth >= 0));
2902*e4b17023SJohn Marino }
2903*e4b17023SJohn Marino return d.growth;
2904*e4b17023SJohn Marino }
2905*e4b17023SJohn Marino
2906*e4b17023SJohn Marino
2907*e4b17023SJohn Marino /* This function performs intraprocedural analysis in NODE that is required to
2908*e4b17023SJohn Marino inline indirect calls. */
2909*e4b17023SJohn Marino
2910*e4b17023SJohn Marino static void
inline_indirect_intraprocedural_analysis(struct cgraph_node * node)2911*e4b17023SJohn Marino inline_indirect_intraprocedural_analysis (struct cgraph_node *node)
2912*e4b17023SJohn Marino {
2913*e4b17023SJohn Marino ipa_analyze_node (node);
2914*e4b17023SJohn Marino if (dump_file && (dump_flags & TDF_DETAILS))
2915*e4b17023SJohn Marino {
2916*e4b17023SJohn Marino ipa_print_node_params (dump_file, node);
2917*e4b17023SJohn Marino ipa_print_node_jump_functions (dump_file, node);
2918*e4b17023SJohn Marino }
2919*e4b17023SJohn Marino }
2920*e4b17023SJohn Marino
2921*e4b17023SJohn Marino
2922*e4b17023SJohn Marino /* Note function body size. */
2923*e4b17023SJohn Marino
2924*e4b17023SJohn Marino static void
inline_analyze_function(struct cgraph_node * node)2925*e4b17023SJohn Marino inline_analyze_function (struct cgraph_node *node)
2926*e4b17023SJohn Marino {
2927*e4b17023SJohn Marino push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2928*e4b17023SJohn Marino current_function_decl = node->decl;
2929*e4b17023SJohn Marino
2930*e4b17023SJohn Marino if (dump_file)
2931*e4b17023SJohn Marino fprintf (dump_file, "\nAnalyzing function: %s/%u\n",
2932*e4b17023SJohn Marino cgraph_node_name (node), node->uid);
2933*e4b17023SJohn Marino if (optimize && !node->thunk.thunk_p)
2934*e4b17023SJohn Marino inline_indirect_intraprocedural_analysis (node);
2935*e4b17023SJohn Marino compute_inline_parameters (node, false);
2936*e4b17023SJohn Marino
2937*e4b17023SJohn Marino current_function_decl = NULL;
2938*e4b17023SJohn Marino pop_cfun ();
2939*e4b17023SJohn Marino }
2940*e4b17023SJohn Marino
2941*e4b17023SJohn Marino
2942*e4b17023SJohn Marino /* Called when new function is inserted to callgraph late. */
2943*e4b17023SJohn Marino
2944*e4b17023SJohn Marino static void
add_new_function(struct cgraph_node * node,void * data ATTRIBUTE_UNUSED)2945*e4b17023SJohn Marino add_new_function (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
2946*e4b17023SJohn Marino {
2947*e4b17023SJohn Marino inline_analyze_function (node);
2948*e4b17023SJohn Marino }
2949*e4b17023SJohn Marino
2950*e4b17023SJohn Marino
2951*e4b17023SJohn Marino /* Note function body size. */
2952*e4b17023SJohn Marino
2953*e4b17023SJohn Marino void
inline_generate_summary(void)2954*e4b17023SJohn Marino inline_generate_summary (void)
2955*e4b17023SJohn Marino {
2956*e4b17023SJohn Marino struct cgraph_node *node;
2957*e4b17023SJohn Marino
2958*e4b17023SJohn Marino function_insertion_hook_holder =
2959*e4b17023SJohn Marino cgraph_add_function_insertion_hook (&add_new_function, NULL);
2960*e4b17023SJohn Marino
2961*e4b17023SJohn Marino ipa_register_cgraph_hooks ();
2962*e4b17023SJohn Marino inline_free_summary ();
2963*e4b17023SJohn Marino
2964*e4b17023SJohn Marino FOR_EACH_DEFINED_FUNCTION (node)
2965*e4b17023SJohn Marino if (!node->alias)
2966*e4b17023SJohn Marino inline_analyze_function (node);
2967*e4b17023SJohn Marino }
2968*e4b17023SJohn Marino
2969*e4b17023SJohn Marino
2970*e4b17023SJohn Marino /* Read predicate from IB. */
2971*e4b17023SJohn Marino
2972*e4b17023SJohn Marino static struct predicate
read_predicate(struct lto_input_block * ib)2973*e4b17023SJohn Marino read_predicate (struct lto_input_block *ib)
2974*e4b17023SJohn Marino {
2975*e4b17023SJohn Marino struct predicate out;
2976*e4b17023SJohn Marino clause_t clause;
2977*e4b17023SJohn Marino int k = 0;
2978*e4b17023SJohn Marino
2979*e4b17023SJohn Marino do
2980*e4b17023SJohn Marino {
2981*e4b17023SJohn Marino gcc_assert (k <= MAX_CLAUSES);
2982*e4b17023SJohn Marino clause = out.clause[k++] = streamer_read_uhwi (ib);
2983*e4b17023SJohn Marino }
2984*e4b17023SJohn Marino while (clause);
2985*e4b17023SJohn Marino
2986*e4b17023SJohn Marino /* Zero-initialize the remaining clauses in OUT. */
2987*e4b17023SJohn Marino while (k <= MAX_CLAUSES)
2988*e4b17023SJohn Marino out.clause[k++] = 0;
2989*e4b17023SJohn Marino
2990*e4b17023SJohn Marino return out;
2991*e4b17023SJohn Marino }
2992*e4b17023SJohn Marino
2993*e4b17023SJohn Marino
2994*e4b17023SJohn Marino /* Write inline summary for edge E to OB. */
2995*e4b17023SJohn Marino
2996*e4b17023SJohn Marino static void
read_inline_edge_summary(struct lto_input_block * ib,struct cgraph_edge * e)2997*e4b17023SJohn Marino read_inline_edge_summary (struct lto_input_block *ib, struct cgraph_edge *e)
2998*e4b17023SJohn Marino {
2999*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
3000*e4b17023SJohn Marino struct predicate p;
3001*e4b17023SJohn Marino int length, i;
3002*e4b17023SJohn Marino
3003*e4b17023SJohn Marino es->call_stmt_size = streamer_read_uhwi (ib);
3004*e4b17023SJohn Marino es->call_stmt_time = streamer_read_uhwi (ib);
3005*e4b17023SJohn Marino es->loop_depth = streamer_read_uhwi (ib);
3006*e4b17023SJohn Marino p = read_predicate (ib);
3007*e4b17023SJohn Marino edge_set_predicate (e, &p);
3008*e4b17023SJohn Marino length = streamer_read_uhwi (ib);
3009*e4b17023SJohn Marino if (length)
3010*e4b17023SJohn Marino {
3011*e4b17023SJohn Marino VEC_safe_grow_cleared (inline_param_summary_t, heap, es->param, length);
3012*e4b17023SJohn Marino for (i = 0; i < length; i++)
3013*e4b17023SJohn Marino VEC_index (inline_param_summary_t, es->param, i)->change_prob
3014*e4b17023SJohn Marino = streamer_read_uhwi (ib);
3015*e4b17023SJohn Marino }
3016*e4b17023SJohn Marino }
3017*e4b17023SJohn Marino
3018*e4b17023SJohn Marino
3019*e4b17023SJohn Marino /* Stream in inline summaries from the section. */
3020*e4b17023SJohn Marino
3021*e4b17023SJohn Marino static void
inline_read_section(struct lto_file_decl_data * file_data,const char * data,size_t len)3022*e4b17023SJohn Marino inline_read_section (struct lto_file_decl_data *file_data, const char *data,
3023*e4b17023SJohn Marino size_t len)
3024*e4b17023SJohn Marino {
3025*e4b17023SJohn Marino const struct lto_function_header *header =
3026*e4b17023SJohn Marino (const struct lto_function_header *) data;
3027*e4b17023SJohn Marino const int cfg_offset = sizeof (struct lto_function_header);
3028*e4b17023SJohn Marino const int main_offset = cfg_offset + header->cfg_size;
3029*e4b17023SJohn Marino const int string_offset = main_offset + header->main_size;
3030*e4b17023SJohn Marino struct data_in *data_in;
3031*e4b17023SJohn Marino struct lto_input_block ib;
3032*e4b17023SJohn Marino unsigned int i, count2, j;
3033*e4b17023SJohn Marino unsigned int f_count;
3034*e4b17023SJohn Marino
3035*e4b17023SJohn Marino LTO_INIT_INPUT_BLOCK (ib, (const char *) data + main_offset, 0,
3036*e4b17023SJohn Marino header->main_size);
3037*e4b17023SJohn Marino
3038*e4b17023SJohn Marino data_in =
3039*e4b17023SJohn Marino lto_data_in_create (file_data, (const char *) data + string_offset,
3040*e4b17023SJohn Marino header->string_size, NULL);
3041*e4b17023SJohn Marino f_count = streamer_read_uhwi (&ib);
3042*e4b17023SJohn Marino for (i = 0; i < f_count; i++)
3043*e4b17023SJohn Marino {
3044*e4b17023SJohn Marino unsigned int index;
3045*e4b17023SJohn Marino struct cgraph_node *node;
3046*e4b17023SJohn Marino struct inline_summary *info;
3047*e4b17023SJohn Marino lto_cgraph_encoder_t encoder;
3048*e4b17023SJohn Marino struct bitpack_d bp;
3049*e4b17023SJohn Marino struct cgraph_edge *e;
3050*e4b17023SJohn Marino
3051*e4b17023SJohn Marino index = streamer_read_uhwi (&ib);
3052*e4b17023SJohn Marino encoder = file_data->cgraph_node_encoder;
3053*e4b17023SJohn Marino node = lto_cgraph_encoder_deref (encoder, index);
3054*e4b17023SJohn Marino info = inline_summary (node);
3055*e4b17023SJohn Marino
3056*e4b17023SJohn Marino info->estimated_stack_size
3057*e4b17023SJohn Marino = info->estimated_self_stack_size = streamer_read_uhwi (&ib);
3058*e4b17023SJohn Marino info->size = info->self_size = streamer_read_uhwi (&ib);
3059*e4b17023SJohn Marino info->time = info->self_time = streamer_read_uhwi (&ib);
3060*e4b17023SJohn Marino
3061*e4b17023SJohn Marino bp = streamer_read_bitpack (&ib);
3062*e4b17023SJohn Marino info->inlinable = bp_unpack_value (&bp, 1);
3063*e4b17023SJohn Marino
3064*e4b17023SJohn Marino count2 = streamer_read_uhwi (&ib);
3065*e4b17023SJohn Marino gcc_assert (!info->conds);
3066*e4b17023SJohn Marino for (j = 0; j < count2; j++)
3067*e4b17023SJohn Marino {
3068*e4b17023SJohn Marino struct condition c;
3069*e4b17023SJohn Marino c.operand_num = streamer_read_uhwi (&ib);
3070*e4b17023SJohn Marino c.code = (enum tree_code) streamer_read_uhwi (&ib);
3071*e4b17023SJohn Marino c.val = stream_read_tree (&ib, data_in);
3072*e4b17023SJohn Marino VEC_safe_push (condition, gc, info->conds, &c);
3073*e4b17023SJohn Marino }
3074*e4b17023SJohn Marino count2 = streamer_read_uhwi (&ib);
3075*e4b17023SJohn Marino gcc_assert (!info->entry);
3076*e4b17023SJohn Marino for (j = 0; j < count2; j++)
3077*e4b17023SJohn Marino {
3078*e4b17023SJohn Marino struct size_time_entry e;
3079*e4b17023SJohn Marino
3080*e4b17023SJohn Marino e.size = streamer_read_uhwi (&ib);
3081*e4b17023SJohn Marino e.time = streamer_read_uhwi (&ib);
3082*e4b17023SJohn Marino e.predicate = read_predicate (&ib);
3083*e4b17023SJohn Marino
3084*e4b17023SJohn Marino VEC_safe_push (size_time_entry, gc, info->entry, &e);
3085*e4b17023SJohn Marino }
3086*e4b17023SJohn Marino for (e = node->callees; e; e = e->next_callee)
3087*e4b17023SJohn Marino read_inline_edge_summary (&ib, e);
3088*e4b17023SJohn Marino for (e = node->indirect_calls; e; e = e->next_callee)
3089*e4b17023SJohn Marino read_inline_edge_summary (&ib, e);
3090*e4b17023SJohn Marino }
3091*e4b17023SJohn Marino
3092*e4b17023SJohn Marino lto_free_section_data (file_data, LTO_section_inline_summary, NULL, data,
3093*e4b17023SJohn Marino len);
3094*e4b17023SJohn Marino lto_data_in_delete (data_in);
3095*e4b17023SJohn Marino }
3096*e4b17023SJohn Marino
3097*e4b17023SJohn Marino
3098*e4b17023SJohn Marino /* Read inline summary. Jump functions are shared among ipa-cp
3099*e4b17023SJohn Marino and inliner, so when ipa-cp is active, we don't need to write them
3100*e4b17023SJohn Marino twice. */
3101*e4b17023SJohn Marino
3102*e4b17023SJohn Marino void
inline_read_summary(void)3103*e4b17023SJohn Marino inline_read_summary (void)
3104*e4b17023SJohn Marino {
3105*e4b17023SJohn Marino struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
3106*e4b17023SJohn Marino struct lto_file_decl_data *file_data;
3107*e4b17023SJohn Marino unsigned int j = 0;
3108*e4b17023SJohn Marino
3109*e4b17023SJohn Marino inline_summary_alloc ();
3110*e4b17023SJohn Marino
3111*e4b17023SJohn Marino while ((file_data = file_data_vec[j++]))
3112*e4b17023SJohn Marino {
3113*e4b17023SJohn Marino size_t len;
3114*e4b17023SJohn Marino const char *data = lto_get_section_data (file_data,
3115*e4b17023SJohn Marino LTO_section_inline_summary,
3116*e4b17023SJohn Marino NULL, &len);
3117*e4b17023SJohn Marino if (data)
3118*e4b17023SJohn Marino inline_read_section (file_data, data, len);
3119*e4b17023SJohn Marino else
3120*e4b17023SJohn Marino /* Fatal error here. We do not want to support compiling ltrans units
3121*e4b17023SJohn Marino with different version of compiler or different flags than the WPA
3122*e4b17023SJohn Marino unit, so this should never happen. */
3123*e4b17023SJohn Marino fatal_error ("ipa inline summary is missing in input file");
3124*e4b17023SJohn Marino }
3125*e4b17023SJohn Marino if (optimize)
3126*e4b17023SJohn Marino {
3127*e4b17023SJohn Marino ipa_register_cgraph_hooks ();
3128*e4b17023SJohn Marino if (!flag_ipa_cp)
3129*e4b17023SJohn Marino ipa_prop_read_jump_functions ();
3130*e4b17023SJohn Marino }
3131*e4b17023SJohn Marino function_insertion_hook_holder =
3132*e4b17023SJohn Marino cgraph_add_function_insertion_hook (&add_new_function, NULL);
3133*e4b17023SJohn Marino }
3134*e4b17023SJohn Marino
3135*e4b17023SJohn Marino
3136*e4b17023SJohn Marino /* Write predicate P to OB. */
3137*e4b17023SJohn Marino
3138*e4b17023SJohn Marino static void
write_predicate(struct output_block * ob,struct predicate * p)3139*e4b17023SJohn Marino write_predicate (struct output_block *ob, struct predicate *p)
3140*e4b17023SJohn Marino {
3141*e4b17023SJohn Marino int j;
3142*e4b17023SJohn Marino if (p)
3143*e4b17023SJohn Marino for (j = 0; p->clause[j]; j++)
3144*e4b17023SJohn Marino {
3145*e4b17023SJohn Marino gcc_assert (j < MAX_CLAUSES);
3146*e4b17023SJohn Marino streamer_write_uhwi (ob, p->clause[j]);
3147*e4b17023SJohn Marino }
3148*e4b17023SJohn Marino streamer_write_uhwi (ob, 0);
3149*e4b17023SJohn Marino }
3150*e4b17023SJohn Marino
3151*e4b17023SJohn Marino
3152*e4b17023SJohn Marino /* Write inline summary for edge E to OB. */
3153*e4b17023SJohn Marino
3154*e4b17023SJohn Marino static void
write_inline_edge_summary(struct output_block * ob,struct cgraph_edge * e)3155*e4b17023SJohn Marino write_inline_edge_summary (struct output_block *ob, struct cgraph_edge *e)
3156*e4b17023SJohn Marino {
3157*e4b17023SJohn Marino struct inline_edge_summary *es = inline_edge_summary (e);
3158*e4b17023SJohn Marino int i;
3159*e4b17023SJohn Marino
3160*e4b17023SJohn Marino streamer_write_uhwi (ob, es->call_stmt_size);
3161*e4b17023SJohn Marino streamer_write_uhwi (ob, es->call_stmt_time);
3162*e4b17023SJohn Marino streamer_write_uhwi (ob, es->loop_depth);
3163*e4b17023SJohn Marino write_predicate (ob, es->predicate);
3164*e4b17023SJohn Marino streamer_write_uhwi (ob, VEC_length (inline_param_summary_t, es->param));
3165*e4b17023SJohn Marino for (i = 0; i < (int)VEC_length (inline_param_summary_t, es->param); i++)
3166*e4b17023SJohn Marino streamer_write_uhwi (ob, VEC_index (inline_param_summary_t,
3167*e4b17023SJohn Marino es->param, i)->change_prob);
3168*e4b17023SJohn Marino }
3169*e4b17023SJohn Marino
3170*e4b17023SJohn Marino
3171*e4b17023SJohn Marino /* Write inline summary for node in SET.
3172*e4b17023SJohn Marino Jump functions are shared among ipa-cp and inliner, so when ipa-cp is
3173*e4b17023SJohn Marino active, we don't need to write them twice. */
3174*e4b17023SJohn Marino
3175*e4b17023SJohn Marino void
inline_write_summary(cgraph_node_set set,varpool_node_set vset ATTRIBUTE_UNUSED)3176*e4b17023SJohn Marino inline_write_summary (cgraph_node_set set,
3177*e4b17023SJohn Marino varpool_node_set vset ATTRIBUTE_UNUSED)
3178*e4b17023SJohn Marino {
3179*e4b17023SJohn Marino struct cgraph_node *node;
3180*e4b17023SJohn Marino struct output_block *ob = create_output_block (LTO_section_inline_summary);
3181*e4b17023SJohn Marino lto_cgraph_encoder_t encoder = ob->decl_state->cgraph_node_encoder;
3182*e4b17023SJohn Marino unsigned int count = 0;
3183*e4b17023SJohn Marino int i;
3184*e4b17023SJohn Marino
3185*e4b17023SJohn Marino for (i = 0; i < lto_cgraph_encoder_size (encoder); i++)
3186*e4b17023SJohn Marino if (lto_cgraph_encoder_deref (encoder, i)->analyzed)
3187*e4b17023SJohn Marino count++;
3188*e4b17023SJohn Marino streamer_write_uhwi (ob, count);
3189*e4b17023SJohn Marino
3190*e4b17023SJohn Marino for (i = 0; i < lto_cgraph_encoder_size (encoder); i++)
3191*e4b17023SJohn Marino {
3192*e4b17023SJohn Marino node = lto_cgraph_encoder_deref (encoder, i);
3193*e4b17023SJohn Marino if (node->analyzed)
3194*e4b17023SJohn Marino {
3195*e4b17023SJohn Marino struct inline_summary *info = inline_summary (node);
3196*e4b17023SJohn Marino struct bitpack_d bp;
3197*e4b17023SJohn Marino struct cgraph_edge *edge;
3198*e4b17023SJohn Marino int i;
3199*e4b17023SJohn Marino size_time_entry *e;
3200*e4b17023SJohn Marino struct condition *c;
3201*e4b17023SJohn Marino
3202*e4b17023SJohn Marino streamer_write_uhwi (ob, lto_cgraph_encoder_encode (encoder, node));
3203*e4b17023SJohn Marino streamer_write_hwi (ob, info->estimated_self_stack_size);
3204*e4b17023SJohn Marino streamer_write_hwi (ob, info->self_size);
3205*e4b17023SJohn Marino streamer_write_hwi (ob, info->self_time);
3206*e4b17023SJohn Marino bp = bitpack_create (ob->main_stream);
3207*e4b17023SJohn Marino bp_pack_value (&bp, info->inlinable, 1);
3208*e4b17023SJohn Marino streamer_write_bitpack (&bp);
3209*e4b17023SJohn Marino streamer_write_uhwi (ob, VEC_length (condition, info->conds));
3210*e4b17023SJohn Marino for (i = 0; VEC_iterate (condition, info->conds, i, c); i++)
3211*e4b17023SJohn Marino {
3212*e4b17023SJohn Marino streamer_write_uhwi (ob, c->operand_num);
3213*e4b17023SJohn Marino streamer_write_uhwi (ob, c->code);
3214*e4b17023SJohn Marino stream_write_tree (ob, c->val, true);
3215*e4b17023SJohn Marino }
3216*e4b17023SJohn Marino streamer_write_uhwi (ob, VEC_length (size_time_entry, info->entry));
3217*e4b17023SJohn Marino for (i = 0;
3218*e4b17023SJohn Marino VEC_iterate (size_time_entry, info->entry, i, e);
3219*e4b17023SJohn Marino i++)
3220*e4b17023SJohn Marino {
3221*e4b17023SJohn Marino streamer_write_uhwi (ob, e->size);
3222*e4b17023SJohn Marino streamer_write_uhwi (ob, e->time);
3223*e4b17023SJohn Marino write_predicate (ob, &e->predicate);
3224*e4b17023SJohn Marino }
3225*e4b17023SJohn Marino for (edge = node->callees; edge; edge = edge->next_callee)
3226*e4b17023SJohn Marino write_inline_edge_summary (ob, edge);
3227*e4b17023SJohn Marino for (edge = node->indirect_calls; edge; edge = edge->next_callee)
3228*e4b17023SJohn Marino write_inline_edge_summary (ob, edge);
3229*e4b17023SJohn Marino }
3230*e4b17023SJohn Marino }
3231*e4b17023SJohn Marino streamer_write_char_stream (ob->main_stream, 0);
3232*e4b17023SJohn Marino produce_asm (ob, NULL);
3233*e4b17023SJohn Marino destroy_output_block (ob);
3234*e4b17023SJohn Marino
3235*e4b17023SJohn Marino if (optimize && !flag_ipa_cp)
3236*e4b17023SJohn Marino ipa_prop_write_jump_functions (set);
3237*e4b17023SJohn Marino }
3238*e4b17023SJohn Marino
3239*e4b17023SJohn Marino
3240*e4b17023SJohn Marino /* Release inline summary. */
3241*e4b17023SJohn Marino
3242*e4b17023SJohn Marino void
inline_free_summary(void)3243*e4b17023SJohn Marino inline_free_summary (void)
3244*e4b17023SJohn Marino {
3245*e4b17023SJohn Marino struct cgraph_node *node;
3246*e4b17023SJohn Marino FOR_EACH_DEFINED_FUNCTION (node)
3247*e4b17023SJohn Marino reset_inline_summary (node);
3248*e4b17023SJohn Marino if (function_insertion_hook_holder)
3249*e4b17023SJohn Marino cgraph_remove_function_insertion_hook (function_insertion_hook_holder);
3250*e4b17023SJohn Marino function_insertion_hook_holder = NULL;
3251*e4b17023SJohn Marino if (node_removal_hook_holder)
3252*e4b17023SJohn Marino cgraph_remove_node_removal_hook (node_removal_hook_holder);
3253*e4b17023SJohn Marino node_removal_hook_holder = NULL;
3254*e4b17023SJohn Marino if (edge_removal_hook_holder)
3255*e4b17023SJohn Marino cgraph_remove_edge_removal_hook (edge_removal_hook_holder);
3256*e4b17023SJohn Marino edge_removal_hook_holder = NULL;
3257*e4b17023SJohn Marino if (node_duplication_hook_holder)
3258*e4b17023SJohn Marino cgraph_remove_node_duplication_hook (node_duplication_hook_holder);
3259*e4b17023SJohn Marino node_duplication_hook_holder = NULL;
3260*e4b17023SJohn Marino if (edge_duplication_hook_holder)
3261*e4b17023SJohn Marino cgraph_remove_edge_duplication_hook (edge_duplication_hook_holder);
3262*e4b17023SJohn Marino edge_duplication_hook_holder = NULL;
3263*e4b17023SJohn Marino VEC_free (inline_summary_t, gc, inline_summary_vec);
3264*e4b17023SJohn Marino inline_summary_vec = NULL;
3265*e4b17023SJohn Marino VEC_free (inline_edge_summary_t, heap, inline_edge_summary_vec);
3266*e4b17023SJohn Marino inline_edge_summary_vec = NULL;
3267*e4b17023SJohn Marino if (edge_predicate_pool)
3268*e4b17023SJohn Marino free_alloc_pool (edge_predicate_pool);
3269*e4b17023SJohn Marino edge_predicate_pool = 0;
3270*e4b17023SJohn Marino }
3271