1 /* Inlining decision heuristics.
2 Copyright (C) 2003, 2004, 2007, 2008, 2009, 2010, 2011
3 Free Software Foundation, Inc.
4 Contributed by Jan Hubicka
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Analysis used by the inliner and other passes limiting code size growth.
24 We estimate for each function
26 - average function execution time
27 - inlining size benefit (that is how much of function body size
28 and its call sequence is expected to disappear by inlining)
29 - inlining time benefit
32 - call statement size and time
34 inlinie_summary datastructures store above information locally (i.e.
35 parameters of the function itself) and globally (i.e. parameters of
36 the function created by applying all the inline decisions already
37 present in the callgraph).
39 We provide accestor to the inline_summary datastructure and
40 basic logic updating the parameters when inlining is performed.
42 The summaries are context sensitive. Context means
43 1) partial assignment of known constant values of operands
44 2) whether function is inlined into the call or not.
45 It is easy to add more variants. To represent function size and time
46 that depends on context (i.e. it is known to be optimized away when
47 context is known either by inlining or from IP-CP and clonning),
48 we use predicates. Predicates are logical formulas in
49 conjunctive-disjunctive form consisting of clauses. Clauses are bitmaps
50 specifying what conditions must be true. Conditions are simple test
51 of the form described above.
53 In order to make predicate (possibly) true, all of its clauses must
54 be (possibly) true. To make clause (possibly) true, one of conditions
55 it mentions must be (possibly) true. There are fixed bounds on
56 number of clauses and conditions and all the manipulation functions
57 are conservative in positive direction. I.e. we may lose precision
58 by thinking that predicate may be true even when it is not.
60 estimate_edge_size and estimate_edge_growth can be used to query
61 function size/time in the given context. inline_merge_summary merges
62 properties of caller and callee after inlining.
64 Finally pass_inline_parameters is exported. This is used to drive
65 computation of function parameters used by the early inliner. IPA
66 inlined performs analysis via its analyze_function method. */
70 #include "coretypes.h"
73 #include "tree-inline.h"
74 #include "langhooks.h"
77 #include "diagnostic.h"
78 #include "gimple-pretty-print.h"
81 #include "tree-pass.h"
84 #include "tree-flow.h"
86 #include "lto-streamer.h"
87 #include "data-streamer.h"
88 #include "tree-streamer.h"
89 #include "ipa-inline.h"
90 #include "alloc-pool.h"
92 /* Estimate runtime of function can easilly run into huge numbers with many
93 nested loops. Be sure we can compute time * INLINE_SIZE_SCALE * 2 in an
94 integer. For anything larger we use gcov_type. */
95 #define MAX_TIME 500000
97 /* Number of bits in integer, but we really want to be stable across different
99 #define NUM_CONDITIONS 32
101 enum predicate_conditions
103 predicate_false_condition = 0,
104 predicate_not_inlined_condition = 1,
105 predicate_first_dynamic_condition = 2
108 /* Special condition code we use to represent test that operand is compile time
110 #define IS_NOT_CONSTANT ERROR_MARK
111 /* Special condition code we use to represent test that operand is not changed
112 across invocation of the function. When operand IS_NOT_CONSTANT it is always
113 CHANGED, however i.e. loop invariants can be NOT_CHANGED given percentage
114 of executions even when they are not compile time constants. */
115 #define CHANGED IDENTIFIER_NODE
117 /* Holders of ipa cgraph hooks: */
118 static struct cgraph_node_hook_list *function_insertion_hook_holder;
119 static struct cgraph_node_hook_list *node_removal_hook_holder;
120 static struct cgraph_2node_hook_list *node_duplication_hook_holder;
121 static struct cgraph_2edge_hook_list *edge_duplication_hook_holder;
122 static struct cgraph_edge_hook_list *edge_removal_hook_holder;
123 static void inline_node_removal_hook (struct cgraph_node *, void *);
124 static void inline_node_duplication_hook (struct cgraph_node *,
125 struct cgraph_node *, void *);
126 static void inline_edge_removal_hook (struct cgraph_edge *, void *);
127 static void inline_edge_duplication_hook (struct cgraph_edge *,
128 struct cgraph_edge *,
131 /* VECtor holding inline summaries.
132 In GGC memory because conditions might point to constant trees. */
133 VEC(inline_summary_t,gc) *inline_summary_vec;
134 VEC(inline_edge_summary_t,heap) *inline_edge_summary_vec;
136 /* Cached node/edge growths. */
137 VEC(int,heap) *node_growth_cache;
138 VEC(edge_growth_cache_entry,heap) *edge_growth_cache;
140 /* Edge predicates goes here. */
141 static alloc_pool edge_predicate_pool;
143 /* Return true predicate (tautology).
144 We represent it by empty list of clauses. */
146 static inline struct predicate
147 true_predicate (void)
155 /* Return predicate testing single condition number COND. */
157 static inline struct predicate
158 single_cond_predicate (int cond)
161 p.clause[0]=1 << cond;
167 /* Return false predicate. First clause require false condition. */
169 static inline struct predicate
170 false_predicate (void)
172 return single_cond_predicate (predicate_false_condition);
176 /* Return true if P is (false). */
179 true_predicate_p (struct predicate *p)
181 return !p->clause[0];
185 /* Return true if P is (false). */
188 false_predicate_p (struct predicate *p)
190 if (p->clause[0] == (1 << predicate_false_condition))
192 gcc_checking_assert (!p->clause[1]
193 && p->clause[0] == 1 << predicate_false_condition);
200 /* Return predicate that is set true when function is not inlined. */
201 static inline struct predicate
202 not_inlined_predicate (void)
204 return single_cond_predicate (predicate_not_inlined_condition);
208 /* Add condition to condition list CONDS. */
210 static struct predicate
211 add_condition (struct inline_summary *summary, int operand_num,
212 enum tree_code code, tree val)
216 struct condition new_cond;
218 for (i = 0; VEC_iterate (condition, summary->conds, i, c); i++)
220 if (c->operand_num == operand_num
223 return single_cond_predicate (i + predicate_first_dynamic_condition);
225 /* Too many conditions. Give up and return constant true. */
226 if (i == NUM_CONDITIONS - predicate_first_dynamic_condition)
227 return true_predicate ();
229 new_cond.operand_num = operand_num;
230 new_cond.code = code;
232 VEC_safe_push (condition, gc, summary->conds, &new_cond);
233 return single_cond_predicate (i + predicate_first_dynamic_condition);
237 /* Add clause CLAUSE into the predicate P. */
240 add_clause (conditions conditions, struct predicate *p, clause_t clause)
244 int insert_here = -1;
251 /* False clause makes the whole predicate false. Kill the other variants. */
252 if (clause == (1 << predicate_false_condition))
254 p->clause[0] = (1 << predicate_false_condition);
258 if (false_predicate_p (p))
261 /* No one should be sily enough to add false into nontrivial clauses. */
262 gcc_checking_assert (!(clause & (1 << predicate_false_condition)));
264 /* Look where to insert the clause. At the same time prune out
265 clauses of P that are implied by the new clause and thus
267 for (i = 0, i2 = 0; i <= MAX_CLAUSES; i++)
269 p->clause[i2] = p->clause[i];
274 /* If p->clause[i] implies clause, there is nothing to add. */
275 if ((p->clause[i] & clause) == p->clause[i])
277 /* We had nothing to add, none of clauses should've become
279 gcc_checking_assert (i == i2);
283 if (p->clause[i] < clause && insert_here < 0)
286 /* If clause implies p->clause[i], then p->clause[i] becomes redundant.
287 Otherwise the p->clause[i] has to stay. */
288 if ((p->clause[i] & clause) != clause)
292 /* Look for clauses that are obviously true. I.e.
293 op0 == 5 || op0 != 5. */
294 for (c1 = predicate_first_dynamic_condition; c1 < NUM_CONDITIONS; c1++)
297 if (!(clause & (1 << c1)))
299 cc1 = VEC_index (condition,
301 c1 - predicate_first_dynamic_condition);
302 /* We have no way to represent !CHANGED and !IS_NOT_CONSTANT
303 and thus there is no point for looking for them. */
304 if (cc1->code == CHANGED
305 || cc1->code == IS_NOT_CONSTANT)
307 for (c2 = c1 + 1; c2 <= NUM_CONDITIONS; c2++)
308 if (clause & (1 << c2))
310 condition *cc1 = VEC_index (condition,
312 c1 - predicate_first_dynamic_condition);
313 condition *cc2 = VEC_index (condition,
315 c2 - predicate_first_dynamic_condition);
316 if (cc1->operand_num == cc2->operand_num
317 && cc1->val == cc2->val
318 && cc2->code != IS_NOT_CONSTANT
319 && cc2->code != CHANGED
320 && cc1->code == invert_tree_comparison
322 HONOR_NANS (TYPE_MODE (TREE_TYPE (cc1->val)))))
328 /* We run out of variants. Be conservative in positive direction. */
329 if (i2 == MAX_CLAUSES)
331 /* Keep clauses in decreasing order. This makes equivalence testing easy. */
332 p->clause[i2 + 1] = 0;
333 if (insert_here >= 0)
334 for (;i2 > insert_here; i2--)
335 p->clause[i2] = p->clause[i2 - 1];
338 p->clause[insert_here] = clause;
344 static struct predicate
345 and_predicates (conditions conditions,
346 struct predicate *p, struct predicate *p2)
348 struct predicate out = *p;
351 /* Avoid busy work. */
352 if (false_predicate_p (p2) || true_predicate_p (p))
354 if (false_predicate_p (p) || true_predicate_p (p2))
357 /* See how far predicates match. */
358 for (i = 0; p->clause[i] && p->clause[i] == p2->clause[i]; i++)
360 gcc_checking_assert (i < MAX_CLAUSES);
363 /* Combine the predicates rest. */
364 for (; p2->clause[i]; i++)
366 gcc_checking_assert (i < MAX_CLAUSES);
367 add_clause (conditions, &out, p2->clause[i]);
373 /* Return true if predicates are obviously equal. */
376 predicates_equal_p (struct predicate *p, struct predicate *p2)
379 for (i = 0; p->clause[i]; i++)
381 gcc_checking_assert (i < MAX_CLAUSES);
382 gcc_checking_assert (p->clause [i] > p->clause[i + 1]);
383 gcc_checking_assert (!p2->clause[i]
384 || p2->clause [i] > p2->clause[i + 1]);
385 if (p->clause[i] != p2->clause[i])
388 return !p2->clause[i];
394 static struct predicate
395 or_predicates (conditions conditions, struct predicate *p, struct predicate *p2)
397 struct predicate out = true_predicate ();
400 /* Avoid busy work. */
401 if (false_predicate_p (p2) || true_predicate_p (p))
403 if (false_predicate_p (p) || true_predicate_p (p2))
405 if (predicates_equal_p (p, p2))
408 /* OK, combine the predicates. */
409 for (i = 0; p->clause[i]; i++)
410 for (j = 0; p2->clause[j]; j++)
412 gcc_checking_assert (i < MAX_CLAUSES && j < MAX_CLAUSES);
413 add_clause (conditions, &out, p->clause[i] | p2->clause[j]);
419 /* Having partial truth assignment in POSSIBLE_TRUTHS, return false
420 if predicate P is known to be false. */
423 evaluate_predicate (struct predicate *p, clause_t possible_truths)
427 /* True remains true. */
428 if (true_predicate_p (p))
431 gcc_assert (!(possible_truths & (1 << predicate_false_condition)));
433 /* See if we can find clause we can disprove. */
434 for (i = 0; p->clause[i]; i++)
436 gcc_checking_assert (i < MAX_CLAUSES);
437 if (!(p->clause[i] & possible_truths))
443 /* Return the probability in range 0...REG_BR_PROB_BASE that the predicated
444 instruction will be recomputed per invocation of the inlined call. */
447 predicate_probability (conditions conds,
448 struct predicate *p, clause_t possible_truths,
449 VEC (inline_param_summary_t, heap) *inline_param_summary)
452 int combined_prob = REG_BR_PROB_BASE;
454 /* True remains true. */
455 if (true_predicate_p (p))
456 return REG_BR_PROB_BASE;
458 if (false_predicate_p (p))
461 gcc_assert (!(possible_truths & (1 << predicate_false_condition)));
463 /* See if we can find clause we can disprove. */
464 for (i = 0; p->clause[i]; i++)
466 gcc_checking_assert (i < MAX_CLAUSES);
467 if (!(p->clause[i] & possible_truths))
473 if (!inline_param_summary)
474 return REG_BR_PROB_BASE;
475 for (i2 = 0; i2 < NUM_CONDITIONS; i2++)
476 if ((p->clause[i] & possible_truths) & (1 << i2))
478 if (i2 >= predicate_first_dynamic_condition)
480 condition *c = VEC_index
482 i2 - predicate_first_dynamic_condition);
483 if (c->code == CHANGED
485 < (int) VEC_length (inline_param_summary_t,
486 inline_param_summary)))
488 int iprob = VEC_index (inline_param_summary_t,
489 inline_param_summary,
490 c->operand_num)->change_prob;
491 this_prob = MAX (this_prob, iprob);
494 this_prob = REG_BR_PROB_BASE;
497 this_prob = REG_BR_PROB_BASE;
499 combined_prob = MIN (this_prob, combined_prob);
504 return combined_prob;
508 /* Dump conditional COND. */
511 dump_condition (FILE *f, conditions conditions, int cond)
514 if (cond == predicate_false_condition)
515 fprintf (f, "false");
516 else if (cond == predicate_not_inlined_condition)
517 fprintf (f, "not inlined");
520 c = VEC_index (condition, conditions,
521 cond - predicate_first_dynamic_condition);
522 fprintf (f, "op%i", c->operand_num);
523 if (c->code == IS_NOT_CONSTANT)
525 fprintf (f, " not constant");
528 if (c->code == CHANGED)
530 fprintf (f, " changed");
533 fprintf (f, " %s ", op_symbol_code (c->code));
534 print_generic_expr (f, c->val, 1);
539 /* Dump clause CLAUSE. */
542 dump_clause (FILE *f, conditions conds, clause_t clause)
549 for (i = 0; i < NUM_CONDITIONS; i++)
550 if (clause & (1 << i))
555 dump_condition (f, conds, i);
561 /* Dump predicate PREDICATE. */
564 dump_predicate (FILE *f, conditions conds, struct predicate *pred)
567 if (true_predicate_p (pred))
568 dump_clause (f, conds, 0);
570 for (i = 0; pred->clause[i]; i++)
574 dump_clause (f, conds, pred->clause[i]);
580 /* Record SIZE and TIME under condition PRED into the inline summary. */
583 account_size_time (struct inline_summary *summary, int size, int time,
584 struct predicate *pred)
590 if (false_predicate_p (pred))
593 /* We need to create initial empty unconitional clause, but otherwie
594 we don't need to account empty times and sizes. */
595 if (!size && !time && summary->entry)
598 /* Watch overflow that might result from insane profiles. */
599 if (time > MAX_TIME * INLINE_TIME_SCALE)
600 time = MAX_TIME * INLINE_TIME_SCALE;
601 gcc_assert (time >= 0);
603 for (i = 0; VEC_iterate (size_time_entry, summary->entry, i, e); i++)
604 if (predicates_equal_p (&e->predicate, pred))
613 e = VEC_index (size_time_entry, summary->entry, 0);
614 gcc_assert (!e->predicate.clause[0]);
616 if (dump_file && (dump_flags & TDF_DETAILS) && (time || size))
618 fprintf (dump_file, "\t\tAccounting size:%3.2f, time:%3.2f on %spredicate:",
619 ((double)size) / INLINE_SIZE_SCALE,
620 ((double)time) / INLINE_TIME_SCALE,
621 found ? "" : "new ");
622 dump_predicate (dump_file, summary->conds, pred);
626 struct size_time_entry new_entry;
627 new_entry.size = size;
628 new_entry.time = time;
629 new_entry.predicate = *pred;
630 VEC_safe_push (size_time_entry, gc, summary->entry, &new_entry);
636 if (e->time > MAX_TIME * INLINE_TIME_SCALE)
637 e->time = MAX_TIME * INLINE_TIME_SCALE;
641 /* Set predicate for edge E. */
644 edge_set_predicate (struct cgraph_edge *e, struct predicate *predicate)
646 struct inline_edge_summary *es = inline_edge_summary (e);
647 if (predicate && !true_predicate_p (predicate))
650 es->predicate = (struct predicate *)pool_alloc (edge_predicate_pool);
651 *es->predicate = *predicate;
656 pool_free (edge_predicate_pool, es->predicate);
657 es->predicate = NULL;
662 /* KNOWN_VALS is partial mapping of parameters of NODE to constant values.
663 Return clause of possible truths. When INLINE_P is true, assume that
666 ERROR_MARK means compile time invariant. */
669 evaluate_conditions_for_known_args (struct cgraph_node *node,
671 VEC (tree, heap) *known_vals)
673 clause_t clause = inline_p ? 0 : 1 << predicate_not_inlined_condition;
674 struct inline_summary *info = inline_summary (node);
678 for (i = 0; VEC_iterate (condition, info->conds, i, c); i++)
683 /* We allow call stmt to have fewer arguments than the callee
684 function (especially for K&R style programs). So bound
686 if (c->operand_num < (int)VEC_length (tree, known_vals))
687 val = VEC_index (tree, known_vals, c->operand_num);
691 if (val == error_mark_node && c->code != CHANGED)
696 clause |= 1 << (i + predicate_first_dynamic_condition);
699 if (c->code == IS_NOT_CONSTANT || c->code == CHANGED)
701 res = fold_binary_to_constant (c->code, boolean_type_node, val, c->val);
703 && integer_zerop (res))
705 clause |= 1 << (i + predicate_first_dynamic_condition);
711 /* Work out what conditions might be true at invocation of E. */
714 evaluate_conditions_for_edge (struct cgraph_edge *e, bool inline_p)
716 clause_t clause = inline_p ? 0 : 1 << predicate_not_inlined_condition;
717 struct cgraph_node *callee = cgraph_function_or_thunk_node (e->callee, NULL);
718 struct inline_summary *info = inline_summary (callee);
721 if (ipa_node_params_vector && info->conds)
723 struct ipa_node_params *parms_info;
724 struct ipa_edge_args *args = IPA_EDGE_REF (e);
725 struct inline_edge_summary *es = inline_edge_summary (e);
726 int i, count = ipa_get_cs_argument_count (args);
727 VEC (tree, heap) *known_vals = NULL;
729 if (e->caller->global.inlined_to)
730 parms_info = IPA_NODE_REF (e->caller->global.inlined_to);
732 parms_info = IPA_NODE_REF (e->caller);
735 VEC_safe_grow_cleared (tree, heap, known_vals, count);
736 for (i = 0; i < count; i++)
738 tree cst = ipa_cst_from_jfunc (parms_info,
739 ipa_get_ith_jump_func (args, i));
741 VEC_replace (tree, known_vals, i, cst);
743 && !VEC_index (inline_param_summary_t,
746 VEC_replace (tree, known_vals, i, error_mark_node);
748 clause = evaluate_conditions_for_known_args (callee,
749 inline_p, known_vals);
750 VEC_free (tree, heap, known_vals);
753 for (i = 0; i < (int)VEC_length (condition, info->conds); i++)
754 clause |= 1 << (i + predicate_first_dynamic_condition);
760 /* Allocate the inline summary vector or resize it to cover all cgraph nodes. */
763 inline_summary_alloc (void)
765 if (!node_removal_hook_holder)
766 node_removal_hook_holder =
767 cgraph_add_node_removal_hook (&inline_node_removal_hook, NULL);
768 if (!edge_removal_hook_holder)
769 edge_removal_hook_holder =
770 cgraph_add_edge_removal_hook (&inline_edge_removal_hook, NULL);
771 if (!node_duplication_hook_holder)
772 node_duplication_hook_holder =
773 cgraph_add_node_duplication_hook (&inline_node_duplication_hook, NULL);
774 if (!edge_duplication_hook_holder)
775 edge_duplication_hook_holder =
776 cgraph_add_edge_duplication_hook (&inline_edge_duplication_hook, NULL);
778 if (VEC_length (inline_summary_t, inline_summary_vec)
779 <= (unsigned) cgraph_max_uid)
780 VEC_safe_grow_cleared (inline_summary_t, gc,
781 inline_summary_vec, cgraph_max_uid + 1);
782 if (VEC_length (inline_edge_summary_t, inline_edge_summary_vec)
783 <= (unsigned) cgraph_edge_max_uid)
784 VEC_safe_grow_cleared (inline_edge_summary_t, heap,
785 inline_edge_summary_vec, cgraph_edge_max_uid + 1);
786 if (!edge_predicate_pool)
787 edge_predicate_pool = create_alloc_pool ("edge predicates",
788 sizeof (struct predicate),
792 /* We are called multiple time for given function; clear
793 data from previous run so they are not cumulated. */
796 reset_inline_edge_summary (struct cgraph_edge *e)
799 < (int)VEC_length (inline_edge_summary_t, inline_edge_summary_vec))
801 struct inline_edge_summary *es = inline_edge_summary (e);
803 es->call_stmt_size = es->call_stmt_time =0;
805 pool_free (edge_predicate_pool, es->predicate);
806 es->predicate = NULL;
807 VEC_free (inline_param_summary_t, heap, es->param);
811 /* We are called multiple time for given function; clear
812 data from previous run so they are not cumulated. */
815 reset_inline_summary (struct cgraph_node *node)
817 struct inline_summary *info = inline_summary (node);
818 struct cgraph_edge *e;
820 info->self_size = info->self_time = 0;
821 info->estimated_stack_size = 0;
822 info->estimated_self_stack_size = 0;
823 info->stack_frame_offset = 0;
826 VEC_free (condition, gc, info->conds);
827 VEC_free (size_time_entry,gc, info->entry);
828 for (e = node->callees; e; e = e->next_callee)
829 reset_inline_edge_summary (e);
830 for (e = node->indirect_calls; e; e = e->next_callee)
831 reset_inline_edge_summary (e);
834 /* Hook that is called by cgraph.c when a node is removed. */
837 inline_node_removal_hook (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
839 struct inline_summary *info;
840 if (VEC_length (inline_summary_t, inline_summary_vec)
841 <= (unsigned)node->uid)
843 info = inline_summary (node);
844 reset_inline_summary (node);
845 memset (info, 0, sizeof (inline_summary_t));
849 /* Hook that is called by cgraph.c when a node is duplicated. */
852 inline_node_duplication_hook (struct cgraph_node *src, struct cgraph_node *dst,
853 ATTRIBUTE_UNUSED void *data)
855 struct inline_summary *info;
856 inline_summary_alloc ();
857 info = inline_summary (dst);
858 memcpy (info, inline_summary (src),
859 sizeof (struct inline_summary));
860 /* TODO: as an optimization, we may avoid copying conditions
861 that are known to be false or true. */
862 info->conds = VEC_copy (condition, gc, info->conds);
864 /* When there are any replacements in the function body, see if we can figure
865 out that something was optimized out. */
866 if (ipa_node_params_vector && dst->clone.tree_map)
868 VEC(size_time_entry,gc) *entry = info->entry;
869 /* Use SRC parm info since it may not be copied yet. */
870 struct ipa_node_params *parms_info = IPA_NODE_REF (src);
871 VEC (tree, heap) *known_vals = NULL;
872 int count = ipa_get_param_count (parms_info);
874 clause_t possible_truths;
875 struct predicate true_pred = true_predicate ();
877 int optimized_out_size = 0;
878 gcov_type optimized_out_time = 0;
879 bool inlined_to_p = false;
880 struct cgraph_edge *edge;
883 VEC_safe_grow_cleared (tree, heap, known_vals, count);
884 for (i = 0; i < count; i++)
886 tree t = ipa_get_param (parms_info, i);
887 struct ipa_replace_map *r;
890 VEC_iterate (ipa_replace_map_p, dst->clone.tree_map, j, r);
897 VEC_replace (tree, known_vals, i, r->new_tree);
902 possible_truths = evaluate_conditions_for_known_args (dst,
904 VEC_free (tree, heap, known_vals);
906 account_size_time (info, 0, 0, &true_pred);
908 /* Remap size_time vectors.
909 Simplify the predicate by prunning out alternatives that are known
911 TODO: as on optimization, we can also eliminate conditions known
913 for (i = 0; VEC_iterate (size_time_entry, entry, i, e); i++)
915 struct predicate new_predicate = true_predicate ();
916 for (j = 0; e->predicate.clause[j]; j++)
917 if (!(possible_truths & e->predicate.clause[j]))
919 new_predicate = false_predicate ();
923 add_clause (info->conds, &new_predicate,
924 possible_truths & e->predicate.clause[j]);
925 if (false_predicate_p (&new_predicate))
927 optimized_out_size += e->size;
928 optimized_out_time += e->time;
931 account_size_time (info, e->size, e->time, &new_predicate);
934 /* Remap edge predicates with the same simplification as above.
935 Also copy constantness arrays. */
936 for (edge = dst->callees; edge; edge = edge->next_callee)
938 struct predicate new_predicate = true_predicate ();
939 struct inline_edge_summary *es = inline_edge_summary (edge);
941 if (!edge->inline_failed)
945 for (j = 0; es->predicate->clause[j]; j++)
946 if (!(possible_truths & es->predicate->clause[j]))
948 new_predicate = false_predicate ();
952 add_clause (info->conds, &new_predicate,
953 possible_truths & es->predicate->clause[j]);
954 if (false_predicate_p (&new_predicate)
955 && !false_predicate_p (es->predicate))
957 optimized_out_size += es->call_stmt_size * INLINE_SIZE_SCALE;
958 optimized_out_time += (es->call_stmt_time
959 * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE)
963 *es->predicate = new_predicate;
966 /* Remap indirect edge predicates with the same simplificaiton as above.
967 Also copy constantness arrays. */
968 for (edge = dst->indirect_calls; edge; edge = edge->next_callee)
970 struct predicate new_predicate = true_predicate ();
971 struct inline_edge_summary *es = inline_edge_summary (edge);
973 if (!edge->inline_failed)
977 for (j = 0; es->predicate->clause[j]; j++)
978 if (!(possible_truths & es->predicate->clause[j]))
980 new_predicate = false_predicate ();
984 add_clause (info->conds, &new_predicate,
985 possible_truths & es->predicate->clause[j]);
986 if (false_predicate_p (&new_predicate)
987 && !false_predicate_p (es->predicate))
989 optimized_out_size += es->call_stmt_size * INLINE_SIZE_SCALE;
990 optimized_out_time += (es->call_stmt_time
991 * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE)
995 *es->predicate = new_predicate;
998 /* If inliner or someone after inliner will ever start producing
999 non-trivial clones, we will get trouble with lack of information
1000 about updating self sizes, because size vectors already contains
1001 sizes of the calees. */
1002 gcc_assert (!inlined_to_p
1003 || (!optimized_out_size && !optimized_out_time));
1005 info->size -= optimized_out_size / INLINE_SIZE_SCALE;
1006 info->self_size -= optimized_out_size / INLINE_SIZE_SCALE;
1007 gcc_assert (info->size > 0);
1008 gcc_assert (info->self_size > 0);
1010 optimized_out_time /= INLINE_TIME_SCALE;
1011 if (optimized_out_time > MAX_TIME)
1012 optimized_out_time = MAX_TIME;
1013 info->time -= optimized_out_time;
1014 info->self_time -= optimized_out_time;
1017 if (info->self_time < 0)
1018 info->self_time = 0;
1021 info->entry = VEC_copy (size_time_entry, gc, info->entry);
1025 /* Hook that is called by cgraph.c when a node is duplicated. */
1028 inline_edge_duplication_hook (struct cgraph_edge *src, struct cgraph_edge *dst,
1029 ATTRIBUTE_UNUSED void *data)
1031 struct inline_edge_summary *info;
1032 struct inline_edge_summary *srcinfo;
1033 inline_summary_alloc ();
1034 info = inline_edge_summary (dst);
1035 srcinfo = inline_edge_summary (src);
1036 memcpy (info, srcinfo,
1037 sizeof (struct inline_edge_summary));
1038 info->predicate = NULL;
1039 edge_set_predicate (dst, srcinfo->predicate);
1040 info->param = VEC_copy (inline_param_summary_t, heap, srcinfo->param);
1044 /* Keep edge cache consistent across edge removal. */
1047 inline_edge_removal_hook (struct cgraph_edge *edge, void *data ATTRIBUTE_UNUSED)
1049 if (edge_growth_cache)
1050 reset_edge_growth_cache (edge);
1051 reset_inline_edge_summary (edge);
1055 /* Initialize growth caches. */
1058 initialize_growth_caches (void)
1060 if (cgraph_edge_max_uid)
1061 VEC_safe_grow_cleared (edge_growth_cache_entry, heap, edge_growth_cache,
1062 cgraph_edge_max_uid);
1064 VEC_safe_grow_cleared (int, heap, node_growth_cache, cgraph_max_uid);
1068 /* Free growth caches. */
1071 free_growth_caches (void)
1073 VEC_free (edge_growth_cache_entry, heap, edge_growth_cache);
1074 edge_growth_cache = 0;
1075 VEC_free (int, heap, node_growth_cache);
1076 node_growth_cache = 0;
1080 /* Dump edge summaries associated to NODE and recursively to all clones.
1081 Indent by INDENT. */
1084 dump_inline_edge_summary (FILE * f, int indent, struct cgraph_node *node,
1085 struct inline_summary *info)
1087 struct cgraph_edge *edge;
1088 for (edge = node->callees; edge; edge = edge->next_callee)
1090 struct inline_edge_summary *es = inline_edge_summary (edge);
1091 struct cgraph_node *callee = cgraph_function_or_thunk_node (edge->callee, NULL);
1094 fprintf (f, "%*s%s/%i %s\n%*s loop depth:%2i freq:%4i size:%2i time: %2i callee size:%2i stack:%2i",
1095 indent, "", cgraph_node_name (callee),
1097 !edge->inline_failed ? "inlined"
1098 : cgraph_inline_failed_string (edge->inline_failed),
1104 (int)inline_summary (callee)->size / INLINE_SIZE_SCALE,
1105 (int)inline_summary (callee)->estimated_stack_size);
1109 fprintf (f, " predicate: ");
1110 dump_predicate (f, info->conds, es->predicate);
1115 for (i = 0; i < (int)VEC_length (inline_param_summary_t, es->param);
1118 int prob = VEC_index (inline_param_summary_t,
1119 es->param, i)->change_prob;
1122 fprintf (f, "%*s op%i is compile time invariant\n",
1124 else if (prob != REG_BR_PROB_BASE)
1125 fprintf (f, "%*s op%i change %f%% of time\n", indent + 2, "", i,
1126 prob * 100.0 / REG_BR_PROB_BASE);
1128 if (!edge->inline_failed)
1130 fprintf (f, "%*sStack frame offset %i, callee self size %i,"
1131 " callee size %i\n",
1133 (int)inline_summary (callee)->stack_frame_offset,
1134 (int)inline_summary (callee)->estimated_self_stack_size,
1135 (int)inline_summary (callee)->estimated_stack_size);
1136 dump_inline_edge_summary (f, indent+2, callee, info);
1139 for (edge = node->indirect_calls; edge; edge = edge->next_callee)
1141 struct inline_edge_summary *es = inline_edge_summary (edge);
1142 fprintf (f, "%*sindirect call loop depth:%2i freq:%4i size:%2i"
1148 es->call_stmt_time);
1151 fprintf (f, "predicate: ");
1152 dump_predicate (f, info->conds, es->predicate);
1161 dump_inline_summary (FILE * f, struct cgraph_node *node)
1165 struct inline_summary *s = inline_summary (node);
1168 fprintf (f, "Inline summary for %s/%i", cgraph_node_name (node),
1170 if (DECL_DISREGARD_INLINE_LIMITS (node->decl))
1171 fprintf (f, " always_inline");
1173 fprintf (f, " inlinable");
1174 fprintf (f, "\n self time: %i\n",
1176 fprintf (f, " global time: %i\n", s->time);
1177 fprintf (f, " self size: %i\n",
1179 fprintf (f, " global size: %i\n", s->size);
1180 fprintf (f, " self stack: %i\n",
1181 (int) s->estimated_self_stack_size);
1182 fprintf (f, " global stack: %i\n",
1183 (int) s->estimated_stack_size);
1185 VEC_iterate (size_time_entry, s->entry, i, e);
1188 fprintf (f, " size:%f, time:%f, predicate:",
1189 (double) e->size / INLINE_SIZE_SCALE,
1190 (double) e->time / INLINE_TIME_SCALE);
1191 dump_predicate (f, s->conds, &e->predicate);
1193 fprintf (f, " calls:\n");
1194 dump_inline_edge_summary (f, 4, node, s);
1200 debug_inline_summary (struct cgraph_node *node)
1202 dump_inline_summary (stderr, node);
1206 dump_inline_summaries (FILE *f)
1208 struct cgraph_node *node;
1210 for (node = cgraph_nodes; node; node = node->next)
1211 if (node->analyzed && !node->global.inlined_to)
1212 dump_inline_summary (f, node);
1215 /* Give initial reasons why inlining would fail on EDGE. This gets either
1216 nullified or usually overwritten by more precise reasons later. */
1219 initialize_inline_failed (struct cgraph_edge *e)
1221 struct cgraph_node *callee = e->callee;
1223 if (e->indirect_unknown_callee)
1224 e->inline_failed = CIF_INDIRECT_UNKNOWN_CALL;
1225 else if (!callee->analyzed)
1226 e->inline_failed = CIF_BODY_NOT_AVAILABLE;
1227 else if (callee->local.redefined_extern_inline)
1228 e->inline_failed = CIF_REDEFINED_EXTERN_INLINE;
1229 else if (e->call_stmt && gimple_call_cannot_inline_p (e->call_stmt))
1230 e->inline_failed = CIF_MISMATCHED_ARGUMENTS;
1232 e->inline_failed = CIF_FUNCTION_NOT_CONSIDERED;
1235 /* Callback of walk_aliased_vdefs. Flags that it has been invoked to the
1236 boolean variable pointed to by DATA. */
1239 mark_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef ATTRIBUTE_UNUSED,
1242 bool *b = (bool *) data;
1247 /* If OP reffers to value of function parameter, return
1248 the corresponding parameter. */
1251 unmodified_parm (gimple stmt, tree op)
1253 /* SSA_NAME referring to parm default def? */
1254 if (TREE_CODE (op) == SSA_NAME
1255 && SSA_NAME_IS_DEFAULT_DEF (op)
1256 && TREE_CODE (SSA_NAME_VAR (op)) == PARM_DECL)
1257 return SSA_NAME_VAR (op);
1258 /* Non-SSA parm reference? */
1259 if (TREE_CODE (op) == PARM_DECL)
1261 bool modified = false;
1264 ao_ref_init (&refd, op);
1265 walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,
1270 /* Assignment from a parameter? */
1271 if (TREE_CODE (op) == SSA_NAME
1272 && !SSA_NAME_IS_DEFAULT_DEF (op)
1273 && gimple_assign_single_p (SSA_NAME_DEF_STMT (op)))
1274 return unmodified_parm (SSA_NAME_DEF_STMT (op),
1275 gimple_assign_rhs1 (SSA_NAME_DEF_STMT (op)));
1279 /* See if statement might disappear after inlining.
1280 0 - means not eliminated
1281 1 - half of statements goes away
1282 2 - for sure it is eliminated.
1283 We are not terribly sophisticated, basically looking for simple abstraction
1284 penalty wrappers. */
1287 eliminated_by_inlining_prob (gimple stmt)
1289 enum gimple_code code = gimple_code (stmt);
1299 if (gimple_num_ops (stmt) != 2)
1302 /* Casts of parameters, loads from parameters passed by reference
1303 and stores to return value or parameters are often free after
1304 inlining dua to SRA and further combining.
1305 Assume that half of statements goes away. */
1306 if (gimple_assign_rhs_code (stmt) == CONVERT_EXPR
1307 || gimple_assign_rhs_code (stmt) == NOP_EXPR
1308 || gimple_assign_rhs_code (stmt) == VIEW_CONVERT_EXPR
1309 || gimple_assign_rhs_class (stmt) == GIMPLE_SINGLE_RHS)
1311 tree rhs = gimple_assign_rhs1 (stmt);
1312 tree lhs = gimple_assign_lhs (stmt);
1313 tree inner_rhs = get_base_address (rhs);
1314 tree inner_lhs = get_base_address (lhs);
1315 bool rhs_free = false;
1316 bool lhs_free = false;
1323 /* Reads of parameter are expected to be free. */
1324 if (unmodified_parm (stmt, inner_rhs))
1327 /* When parameter is not SSA register because its address is taken
1328 and it is just copied into one, the statement will be completely
1329 free after inlining (we will copy propagate backward). */
1330 if (rhs_free && is_gimple_reg (lhs))
1333 /* Reads of parameters passed by reference
1334 expected to be free (i.e. optimized out after inlining). */
1335 if (TREE_CODE(inner_rhs) == MEM_REF
1336 && unmodified_parm (stmt, TREE_OPERAND (inner_rhs, 0)))
1339 /* Copying parameter passed by reference into gimple register is
1340 probably also going to copy propagate, but we can't be quite
1342 if (rhs_free && is_gimple_reg (lhs))
1345 /* Writes to parameters, parameters passed by value and return value
1346 (either dirrectly or passed via invisible reference) are free.
1348 TODO: We ought to handle testcase like
1349 struct a {int a,b;};
1351 retrurnsturct (void)
1357 This translate into:
1372 For that we either need to copy ipa-split logic detecting writes
1374 if (TREE_CODE (inner_lhs) == PARM_DECL
1375 || TREE_CODE (inner_lhs) == RESULT_DECL
1376 || (TREE_CODE(inner_lhs) == MEM_REF
1377 && (unmodified_parm (stmt, TREE_OPERAND (inner_lhs, 0))
1378 || (TREE_CODE (TREE_OPERAND (inner_lhs, 0)) == SSA_NAME
1379 && TREE_CODE (SSA_NAME_VAR
1380 (TREE_OPERAND (inner_lhs, 0)))
1384 && (is_gimple_reg (rhs) || is_gimple_min_invariant (rhs)))
1386 if (lhs_free && rhs_free)
1396 /* If BB ends by a conditional we can turn into predicates, attach corresponding
1397 predicates to the CFG edges. */
1400 set_cond_stmt_execution_predicate (struct ipa_node_params *info,
1401 struct inline_summary *summary,
1407 enum tree_code code, inverted_code;
1415 last = last_stmt (bb);
1417 || gimple_code (last) != GIMPLE_COND)
1419 if (!is_gimple_ip_invariant (gimple_cond_rhs (last)))
1421 op = gimple_cond_lhs (last);
1422 /* TODO: handle conditionals like
1425 parm = unmodified_parm (last, op);
1428 index = ipa_get_param_decl_index (info, parm);
1431 code = gimple_cond_code (last);
1433 = invert_tree_comparison (code,
1434 HONOR_NANS (TYPE_MODE (TREE_TYPE (op))));
1436 FOR_EACH_EDGE (e, ei, bb->succs)
1438 struct predicate p = add_condition (summary,
1440 e->flags & EDGE_TRUE_VALUE
1441 ? code : inverted_code,
1442 gimple_cond_rhs (last));
1443 e->aux = pool_alloc (edge_predicate_pool);
1444 *(struct predicate *)e->aux = p;
1448 if (TREE_CODE (op) != SSA_NAME)
1451 if (builtin_constant_p (op))
1455 Here we can predicate nonconstant_code. We can't
1456 really handle constant_code since we have no predicate
1457 for this and also the constant code is not known to be
1458 optimized away when inliner doen't see operand is constant.
1459 Other optimizers might think otherwise. */
1460 set_stmt = SSA_NAME_DEF_STMT (op);
1461 if (!gimple_call_builtin_p (set_stmt, BUILT_IN_CONSTANT_P)
1462 || gimple_call_num_args (set_stmt) != 1)
1464 op2 = gimple_call_arg (set_stmt, 0);
1465 base = get_base_address (op2);
1466 parm = unmodified_parm (set_stmt, base ? base : op2);
1469 index = ipa_get_param_decl_index (info, parm);
1472 if (gimple_cond_code (last) != NE_EXPR
1473 || !integer_zerop (gimple_cond_rhs (last)))
1475 FOR_EACH_EDGE (e, ei, bb->succs)
1476 if (e->flags & EDGE_FALSE_VALUE)
1478 struct predicate p = add_condition (summary,
1482 e->aux = pool_alloc (edge_predicate_pool);
1483 *(struct predicate *)e->aux = p;
1488 /* If BB ends by a switch we can turn into predicates, attach corresponding
1489 predicates to the CFG edges. */
1492 set_switch_stmt_execution_predicate (struct ipa_node_params *info,
1493 struct inline_summary *summary,
1505 last = last_stmt (bb);
1507 || gimple_code (last) != GIMPLE_SWITCH)
1509 op = gimple_switch_index (last);
1510 parm = unmodified_parm (last, op);
1513 index = ipa_get_param_decl_index (info, parm);
1517 FOR_EACH_EDGE (e, ei, bb->succs)
1519 e->aux = pool_alloc (edge_predicate_pool);
1520 *(struct predicate *)e->aux = false_predicate ();
1522 n = gimple_switch_num_labels(last);
1523 for (case_idx = 0; case_idx < n; ++case_idx)
1525 tree cl = gimple_switch_label (last, case_idx);
1529 e = find_edge (bb, label_to_block (CASE_LABEL (cl)));
1530 min = CASE_LOW (cl);
1531 max = CASE_HIGH (cl);
1533 /* For default we might want to construct predicate that none
1534 of cases is met, but it is bit hard to do not having negations
1535 of conditionals handy. */
1537 p = true_predicate ();
1539 p = add_condition (summary, index,
1544 struct predicate p1, p2;
1545 p1 = add_condition (summary, index,
1548 p2 = add_condition (summary, index,
1551 p = and_predicates (summary->conds, &p1, &p2);
1553 *(struct predicate *)e->aux
1554 = or_predicates (summary->conds, &p, (struct predicate *)e->aux);
1559 /* For each BB in NODE attach to its AUX pointer predicate under
1560 which it is executable. */
1563 compute_bb_predicates (struct cgraph_node *node,
1564 struct ipa_node_params *parms_info,
1565 struct inline_summary *summary)
1567 struct function *my_function = DECL_STRUCT_FUNCTION (node->decl);
1571 FOR_EACH_BB_FN (bb, my_function)
1573 set_cond_stmt_execution_predicate (parms_info, summary, bb);
1574 set_switch_stmt_execution_predicate (parms_info, summary, bb);
1577 /* Entry block is always executable. */
1578 ENTRY_BLOCK_PTR_FOR_FUNCTION (my_function)->aux
1579 = pool_alloc (edge_predicate_pool);
1580 *(struct predicate *)ENTRY_BLOCK_PTR_FOR_FUNCTION (my_function)->aux
1581 = true_predicate ();
1583 /* A simple dataflow propagation of predicates forward in the CFG.
1584 TODO: work in reverse postorder. */
1588 FOR_EACH_BB_FN (bb, my_function)
1590 struct predicate p = false_predicate ();
1593 FOR_EACH_EDGE (e, ei, bb->preds)
1597 struct predicate this_bb_predicate
1598 = *(struct predicate *)e->src->aux;
1601 = and_predicates (summary->conds, &this_bb_predicate,
1602 (struct predicate *)e->aux);
1603 p = or_predicates (summary->conds, &p, &this_bb_predicate);
1604 if (true_predicate_p (&p))
1608 if (false_predicate_p (&p))
1609 gcc_assert (!bb->aux);
1615 bb->aux = pool_alloc (edge_predicate_pool);
1616 *((struct predicate *)bb->aux) = p;
1618 else if (!predicates_equal_p (&p, (struct predicate *)bb->aux))
1621 *((struct predicate *)bb->aux) = p;
1629 /* We keep info about constantness of SSA names. */
1631 typedef struct predicate predicate_t;
1632 DEF_VEC_O (predicate_t);
1633 DEF_VEC_ALLOC_O (predicate_t, heap);
1636 /* Return predicate specifying when the STMT might have result that is not
1637 a compile time constant. */
1639 static struct predicate
1640 will_be_nonconstant_predicate (struct ipa_node_params *info,
1641 struct inline_summary *summary,
1643 VEC (predicate_t, heap) *nonconstant_names)
1646 struct predicate p = true_predicate ();
1649 struct predicate op_non_const;
1652 /* What statments might be optimized away
1653 when their arguments are constant
1654 TODO: also trivial builtins.
1655 builtin_constant_p is already handled later. */
1656 if (gimple_code (stmt) != GIMPLE_ASSIGN
1657 && gimple_code (stmt) != GIMPLE_COND
1658 && gimple_code (stmt) != GIMPLE_SWITCH)
1661 /* Stores will stay anyway. */
1662 if (gimple_vdef (stmt))
1665 is_load = gimple_vuse (stmt) != NULL;
1667 /* Loads can be optimized when the value is known. */
1670 tree op = gimple_assign_rhs1 (stmt);
1671 tree base = get_base_address (op);
1674 gcc_assert (gimple_assign_single_p (stmt));
1677 parm = unmodified_parm (stmt, base);
1680 if (ipa_get_param_decl_index (info, parm) < 0)
1684 /* See if we understand all operands before we start
1685 adding conditionals. */
1686 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
1688 tree parm = unmodified_parm (stmt, use);
1689 /* For arguments we can build a condition. */
1690 if (parm && ipa_get_param_decl_index (info, parm) >= 0)
1692 if (TREE_CODE (use) != SSA_NAME)
1694 /* If we know when operand is constant,
1695 we still can say something useful. */
1696 if (!true_predicate_p (VEC_index (predicate_t, nonconstant_names,
1697 SSA_NAME_VERSION (use))))
1701 op_non_const = false_predicate ();
1704 tree parm = unmodified_parm
1705 (stmt, get_base_address (gimple_assign_rhs1 (stmt)));
1706 p = add_condition (summary,
1707 ipa_get_param_decl_index (info, parm),
1709 op_non_const = or_predicates (summary->conds, &p, &op_non_const);
1711 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
1713 tree parm = unmodified_parm (stmt, use);
1714 if (parm && ipa_get_param_decl_index (info, parm) >= 0)
1715 p = add_condition (summary,
1716 ipa_get_param_decl_index (info, parm),
1719 p = *VEC_index (predicate_t, nonconstant_names,
1720 SSA_NAME_VERSION (use));
1721 op_non_const = or_predicates (summary->conds, &p, &op_non_const);
1723 if (gimple_code (stmt) == GIMPLE_ASSIGN
1724 && TREE_CODE (gimple_assign_lhs (stmt)) == SSA_NAME)
1725 VEC_replace (predicate_t, nonconstant_names,
1726 SSA_NAME_VERSION (gimple_assign_lhs (stmt)), &op_non_const);
1727 return op_non_const;
1730 struct record_modified_bb_info
1736 /* Callback of walk_aliased_vdefs. Records basic blocks where the value may be
1737 set except for info->stmt. */
1740 record_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef,
1743 struct record_modified_bb_info *info = (struct record_modified_bb_info *) data;
1744 if (SSA_NAME_DEF_STMT (vdef) == info->stmt)
1746 bitmap_set_bit (info->bb_set,
1747 SSA_NAME_IS_DEFAULT_DEF (vdef)
1748 ? ENTRY_BLOCK_PTR->index : gimple_bb (SSA_NAME_DEF_STMT (vdef))->index);
1752 /* Return probability (based on REG_BR_PROB_BASE) that I-th parameter of STMT
1753 will change since last invocation of STMT.
1755 Value 0 is reserved for compile time invariants.
1756 For common parameters it is REG_BR_PROB_BASE. For loop invariants it
1757 ought to be REG_BR_PROB_BASE / estimated_iters. */
1760 param_change_prob (gimple stmt, int i)
1762 tree op = gimple_call_arg (stmt, i);
1763 basic_block bb = gimple_bb (stmt);
1766 if (is_gimple_min_invariant (op))
1768 /* We would have to do non-trivial analysis to really work out what
1769 is the probability of value to change (i.e. when init statement
1770 is in a sibling loop of the call).
1772 We do an conservative estimate: when call is executed N times more often
1773 than the statement defining value, we take the frequency 1/N. */
1774 if (TREE_CODE (op) == SSA_NAME)
1779 return REG_BR_PROB_BASE;
1781 if (SSA_NAME_IS_DEFAULT_DEF (op))
1782 init_freq = ENTRY_BLOCK_PTR->frequency;
1784 init_freq = gimple_bb (SSA_NAME_DEF_STMT (op))->frequency;
1788 if (init_freq < bb->frequency)
1789 return MAX ((init_freq * REG_BR_PROB_BASE +
1790 bb->frequency / 2) / bb->frequency, 1);
1792 return REG_BR_PROB_BASE;
1795 base = get_base_address (op);
1800 struct record_modified_bb_info info;
1804 if (const_value_known_p (base))
1807 return REG_BR_PROB_BASE;
1808 ao_ref_init (&refd, op);
1810 info.bb_set = BITMAP_ALLOC (NULL);
1811 walk_aliased_vdefs (&refd, gimple_vuse (stmt), record_modified, &info,
1813 if (bitmap_bit_p (info.bb_set, bb->index))
1815 BITMAP_FREE (info.bb_set);
1816 return REG_BR_PROB_BASE;
1819 /* Assume that every memory is initialized at entry.
1820 TODO: Can we easilly determine if value is always defined
1821 and thus we may skip entry block? */
1822 if (ENTRY_BLOCK_PTR->frequency)
1823 max = ENTRY_BLOCK_PTR->frequency;
1827 EXECUTE_IF_SET_IN_BITMAP (info.bb_set, 0, index, bi)
1828 max = MIN (max, BASIC_BLOCK (index)->frequency);
1830 BITMAP_FREE (info.bb_set);
1831 if (max < bb->frequency)
1832 return MAX ((max * REG_BR_PROB_BASE +
1833 bb->frequency / 2) / bb->frequency, 1);
1835 return REG_BR_PROB_BASE;
1837 return REG_BR_PROB_BASE;
1841 /* Compute function body size parameters for NODE.
1842 When EARLY is true, we compute only simple summaries without
1843 non-trivial predicates to drive the early inliner. */
1846 estimate_function_body_sizes (struct cgraph_node *node, bool early)
1849 /* Estimate static overhead for function prologue/epilogue and alignment. */
1851 /* Benefits are scaled by probability of elimination that is in range
1854 gimple_stmt_iterator bsi;
1855 struct function *my_function = DECL_STRUCT_FUNCTION (node->decl);
1857 struct inline_summary *info = inline_summary (node);
1858 struct predicate bb_predicate;
1859 struct ipa_node_params *parms_info = NULL;
1860 VEC (predicate_t, heap) *nonconstant_names = NULL;
1862 if (ipa_node_params_vector && !early && optimize)
1864 parms_info = IPA_NODE_REF (node);
1865 VEC_safe_grow_cleared (predicate_t, heap, nonconstant_names,
1866 VEC_length (tree, SSANAMES (my_function)));
1874 fprintf (dump_file, "\nAnalyzing function body size: %s\n",
1875 cgraph_node_name (node));
1877 /* When we run into maximal number of entries, we assign everything to the
1878 constant truth case. Be sure to have it in list. */
1879 bb_predicate = true_predicate ();
1880 account_size_time (info, 0, 0, &bb_predicate);
1882 bb_predicate = not_inlined_predicate ();
1883 account_size_time (info, 2 * INLINE_SIZE_SCALE, 0, &bb_predicate);
1885 gcc_assert (my_function && my_function->cfg);
1887 compute_bb_predicates (node, parms_info, info);
1888 FOR_EACH_BB_FN (bb, my_function)
1890 freq = compute_call_stmt_bb_frequency (node->decl, bb);
1892 /* TODO: Obviously predicates can be propagated down across CFG. */
1896 bb_predicate = *(struct predicate *)bb->aux;
1898 bb_predicate = false_predicate ();
1901 bb_predicate = true_predicate ();
1903 if (dump_file && (dump_flags & TDF_DETAILS))
1905 fprintf (dump_file, "\n BB %i predicate:", bb->index);
1906 dump_predicate (dump_file, info->conds, &bb_predicate);
1909 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
1911 gimple stmt = gsi_stmt (bsi);
1912 int this_size = estimate_num_insns (stmt, &eni_size_weights);
1913 int this_time = estimate_num_insns (stmt, &eni_time_weights);
1915 struct predicate will_be_nonconstant;
1917 if (dump_file && (dump_flags & TDF_DETAILS))
1919 fprintf (dump_file, " ");
1920 print_gimple_stmt (dump_file, stmt, 0, 0);
1921 fprintf (dump_file, "\t\tfreq:%3.2f size:%3i time:%3i\n",
1922 ((double)freq)/CGRAPH_FREQ_BASE, this_size, this_time);
1925 if (is_gimple_call (stmt))
1927 struct cgraph_edge *edge = cgraph_edge (node, stmt);
1928 struct inline_edge_summary *es = inline_edge_summary (edge);
1930 /* Special case: results of BUILT_IN_CONSTANT_P will be always
1931 resolved as constant. We however don't want to optimize
1932 out the cgraph edges. */
1933 if (nonconstant_names
1934 && gimple_call_builtin_p (stmt, BUILT_IN_CONSTANT_P)
1935 && gimple_call_lhs (stmt)
1936 && TREE_CODE (gimple_call_lhs (stmt)) == SSA_NAME)
1938 struct predicate false_p = false_predicate ();
1939 VEC_replace (predicate_t, nonconstant_names,
1940 SSA_NAME_VERSION (gimple_call_lhs (stmt)),
1943 if (ipa_node_params_vector)
1945 int count = gimple_call_num_args (stmt);
1949 VEC_safe_grow_cleared (inline_param_summary_t, heap,
1951 for (i = 0; i < count; i++)
1953 int prob = param_change_prob (stmt, i);
1954 gcc_assert (prob >= 0 && prob <= REG_BR_PROB_BASE);
1955 VEC_index (inline_param_summary_t,
1956 es->param, i)->change_prob = prob;
1960 es->call_stmt_size = this_size;
1961 es->call_stmt_time = this_time;
1962 es->loop_depth = bb->loop_depth;
1963 edge_set_predicate (edge, &bb_predicate);
1965 /* Do not inline calls where we cannot triviall work around
1966 mismatches in argument or return types. */
1968 && cgraph_function_or_thunk_node (edge->callee, NULL)
1969 && !gimple_check_call_matching_types
1970 (stmt, cgraph_function_or_thunk_node (edge->callee,
1973 edge->call_stmt_cannot_inline_p = true;
1974 gimple_call_set_cannot_inline (stmt, true);
1977 gcc_assert (!gimple_call_cannot_inline_p (stmt));
1980 /* TODO: When conditional jump or swithc is known to be constant, but
1981 we did not translate it into the predicates, we really can account
1982 just maximum of the possible paths. */
1985 = will_be_nonconstant_predicate (parms_info, info,
1986 stmt, nonconstant_names);
1987 if (this_time || this_size)
1995 prob = eliminated_by_inlining_prob (stmt);
1996 if (prob == 1 && dump_file && (dump_flags & TDF_DETAILS))
1997 fprintf (dump_file, "\t\t50%% will be eliminated by inlining\n");
1998 if (prob == 2 && dump_file && (dump_flags & TDF_DETAILS))
1999 fprintf (dump_file, "\t\tWill be eliminated by inlining\n");
2002 p = and_predicates (info->conds, &bb_predicate,
2003 &will_be_nonconstant);
2005 p = true_predicate ();
2007 /* We account everything but the calls. Calls have their own
2008 size/time info attached to cgraph edges. This is neccesary
2009 in order to make the cost disappear after inlining. */
2010 if (!is_gimple_call (stmt))
2014 struct predicate ip = not_inlined_predicate ();
2015 ip = and_predicates (info->conds, &ip, &p);
2016 account_size_time (info, this_size * prob,
2017 this_time * prob, &ip);
2020 account_size_time (info, this_size * (2 - prob),
2021 this_time * (2 - prob), &p);
2024 gcc_assert (time >= 0);
2025 gcc_assert (size >= 0);
2029 FOR_ALL_BB_FN (bb, my_function)
2035 pool_free (edge_predicate_pool, bb->aux);
2037 FOR_EACH_EDGE (e, ei, bb->succs)
2040 pool_free (edge_predicate_pool, e->aux);
2044 time = (time + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2045 if (time > MAX_TIME)
2047 inline_summary (node)->self_time = time;
2048 inline_summary (node)->self_size = size;
2049 VEC_free (predicate_t, heap, nonconstant_names);
2052 fprintf (dump_file, "\n");
2053 dump_inline_summary (dump_file, node);
2058 /* Compute parameters of functions used by inliner.
2059 EARLY is true when we compute parameters for the early inliner */
2062 compute_inline_parameters (struct cgraph_node *node, bool early)
2064 HOST_WIDE_INT self_stack_size;
2065 struct cgraph_edge *e;
2066 struct inline_summary *info;
2067 tree old_decl = current_function_decl;
2069 gcc_assert (!node->global.inlined_to);
2071 inline_summary_alloc ();
2073 info = inline_summary (node);
2074 reset_inline_summary (node);
2076 /* FIXME: Thunks are inlinable, but tree-inline don't know how to do that.
2077 Once this happen, we will need to more curefully predict call
2079 if (node->thunk.thunk_p)
2081 struct inline_edge_summary *es = inline_edge_summary (node->callees);
2082 struct predicate t = true_predicate ();
2084 info->inlinable = 0;
2085 node->callees->call_stmt_cannot_inline_p = true;
2086 node->local.can_change_signature = false;
2087 es->call_stmt_time = 1;
2088 es->call_stmt_size = 1;
2089 account_size_time (info, 0, 0, &t);
2093 /* Even is_gimple_min_invariant rely on current_function_decl. */
2094 current_function_decl = node->decl;
2095 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2097 /* Estimate the stack size for the function if we're optimizing. */
2098 self_stack_size = optimize ? estimated_stack_frame_size (node) : 0;
2099 info->estimated_self_stack_size = self_stack_size;
2100 info->estimated_stack_size = self_stack_size;
2101 info->stack_frame_offset = 0;
2103 /* Can this function be inlined at all? */
2104 info->inlinable = tree_inlinable_function_p (node->decl);
2106 /* Type attributes can use parameter indices to describe them. */
2107 if (TYPE_ATTRIBUTES (TREE_TYPE (node->decl)))
2108 node->local.can_change_signature = false;
2111 /* Otherwise, inlinable functions always can change signature. */
2112 if (info->inlinable)
2113 node->local.can_change_signature = true;
2116 /* Functions calling builtin_apply can not change signature. */
2117 for (e = node->callees; e; e = e->next_callee)
2119 tree cdecl = e->callee->decl;
2120 if (DECL_BUILT_IN (cdecl)
2121 && DECL_BUILT_IN_CLASS (cdecl) == BUILT_IN_NORMAL
2122 && (DECL_FUNCTION_CODE (cdecl) == BUILT_IN_APPLY_ARGS
2123 || DECL_FUNCTION_CODE (cdecl) == BUILT_IN_VA_START))
2126 node->local.can_change_signature = !e;
2129 estimate_function_body_sizes (node, early);
2131 /* Inlining characteristics are maintained by the cgraph_mark_inline. */
2132 info->time = info->self_time;
2133 info->size = info->self_size;
2134 info->stack_frame_offset = 0;
2135 info->estimated_stack_size = info->estimated_self_stack_size;
2136 current_function_decl = old_decl;
2141 /* Compute parameters of functions used by inliner using
2142 current_function_decl. */
2145 compute_inline_parameters_for_current (void)
2147 compute_inline_parameters (cgraph_get_node (current_function_decl), true);
2151 struct gimple_opt_pass pass_inline_parameters =
2155 "inline_param", /* name */
2157 compute_inline_parameters_for_current,/* execute */
2160 0, /* static_pass_number */
2161 TV_INLINE_HEURISTICS, /* tv_id */
2162 0, /* properties_required */
2163 0, /* properties_provided */
2164 0, /* properties_destroyed */
2165 0, /* todo_flags_start */
2166 0 /* todo_flags_finish */
2171 /* Increase SIZE and TIME for size and time needed to handle edge E. */
2174 estimate_edge_size_and_time (struct cgraph_edge *e, int *size, int *time,
2177 struct inline_edge_summary *es = inline_edge_summary (e);
2178 *size += es->call_stmt_size * INLINE_SIZE_SCALE;
2179 *time += (es->call_stmt_time * prob / REG_BR_PROB_BASE
2180 * e->frequency * (INLINE_TIME_SCALE / CGRAPH_FREQ_BASE));
2181 if (*time > MAX_TIME * INLINE_TIME_SCALE)
2182 *time = MAX_TIME * INLINE_TIME_SCALE;
2186 /* Increase SIZE and TIME for size and time needed to handle all calls in NODE. */
2189 estimate_calls_size_and_time (struct cgraph_node *node, int *size, int *time,
2190 clause_t possible_truths)
2192 struct cgraph_edge *e;
2193 for (e = node->callees; e; e = e->next_callee)
2195 struct inline_edge_summary *es = inline_edge_summary (e);
2196 if (!es->predicate || evaluate_predicate (es->predicate, possible_truths))
2198 if (e->inline_failed)
2200 /* Predicates of calls shall not use NOT_CHANGED codes,
2201 sowe do not need to compute probabilities. */
2202 estimate_edge_size_and_time (e, size, time, REG_BR_PROB_BASE);
2205 estimate_calls_size_and_time (e->callee, size, time,
2209 /* TODO: look for devirtualizing oppurtunities. */
2210 for (e = node->indirect_calls; e; e = e->next_callee)
2212 struct inline_edge_summary *es = inline_edge_summary (e);
2213 if (!es->predicate || evaluate_predicate (es->predicate, possible_truths))
2214 estimate_edge_size_and_time (e, size, time, REG_BR_PROB_BASE);
2219 /* Estimate size and time needed to execute NODE assuming
2220 POSSIBLE_TRUTHS clause. */
2223 estimate_node_size_and_time (struct cgraph_node *node,
2224 clause_t possible_truths,
2225 int *ret_size, int *ret_time,
2226 VEC (inline_param_summary_t, heap)
2227 *inline_param_summary)
2229 struct inline_summary *info = inline_summary (node);
2231 int size = 0, time = 0;
2235 && (dump_flags & TDF_DETAILS))
2238 fprintf (dump_file, " Estimating body: %s/%i\n"
2239 " Known to be false: ",
2240 cgraph_node_name (node),
2243 for (i = predicate_not_inlined_condition;
2244 i < (predicate_first_dynamic_condition
2245 + (int)VEC_length (condition, info->conds)); i++)
2246 if (!(possible_truths & (1 << i)))
2249 fprintf (dump_file, ", ");
2251 dump_condition (dump_file, info->conds, i);
2255 for (i = 0; VEC_iterate (size_time_entry, info->entry, i, e); i++)
2256 if (evaluate_predicate (&e->predicate, possible_truths))
2259 if (!inline_param_summary)
2263 int prob = predicate_probability (info->conds,
2266 inline_param_summary);
2267 time += e->time * prob / REG_BR_PROB_BASE;
2272 if (time > MAX_TIME * INLINE_TIME_SCALE)
2273 time = MAX_TIME * INLINE_TIME_SCALE;
2275 estimate_calls_size_and_time (node, &size, &time, possible_truths);
2276 time = (time + INLINE_TIME_SCALE / 2) / INLINE_TIME_SCALE;
2277 size = (size + INLINE_SIZE_SCALE / 2) / INLINE_SIZE_SCALE;
2281 && (dump_flags & TDF_DETAILS))
2282 fprintf (dump_file, "\n size:%i time:%i\n", size, time);
2291 /* Estimate size and time needed to execute callee of EDGE assuming that
2292 parameters known to be constant at caller of EDGE are propagated.
2293 KNOWN_VALs is a vector of assumed known constant values for parameters. */
2296 estimate_ipcp_clone_size_and_time (struct cgraph_node *node,
2297 VEC (tree, heap) *known_vals,
2298 int *ret_size, int *ret_time)
2302 clause = evaluate_conditions_for_known_args (node, false, known_vals);
2303 estimate_node_size_and_time (node, clause, ret_size, ret_time,
2308 /* Translate all conditions from callee representation into caller
2309 representation and symbolically evaluate predicate P into new predicate.
2311 INFO is inline_summary of function we are adding predicate into,
2312 CALLEE_INFO is summary of function predicate P is from. OPERAND_MAP is
2313 array giving callee formal IDs the caller formal IDs. POSSSIBLE_TRUTHS is
2314 clausule of all callee conditions that may be true in caller context.
2315 TOPLEV_PREDICATE is predicate under which callee is executed. */
2317 static struct predicate
2318 remap_predicate (struct inline_summary *info,
2319 struct inline_summary *callee_info,
2320 struct predicate *p,
2321 VEC (int, heap) *operand_map,
2322 clause_t possible_truths,
2323 struct predicate *toplev_predicate)
2326 struct predicate out = true_predicate ();
2328 /* True predicate is easy. */
2329 if (true_predicate_p (p))
2330 return *toplev_predicate;
2331 for (i = 0; p->clause[i]; i++)
2333 clause_t clause = p->clause[i];
2335 struct predicate clause_predicate = false_predicate ();
2337 gcc_assert (i < MAX_CLAUSES);
2339 for (cond = 0; cond < NUM_CONDITIONS; cond ++)
2340 /* Do we have condition we can't disprove? */
2341 if (clause & possible_truths & (1 << cond))
2343 struct predicate cond_predicate;
2344 /* Work out if the condition can translate to predicate in the
2345 inlined function. */
2346 if (cond >= predicate_first_dynamic_condition)
2348 struct condition *c;
2350 c = VEC_index (condition, callee_info->conds,
2351 cond - predicate_first_dynamic_condition);
2352 /* See if we can remap condition operand to caller's operand.
2353 Otherwise give up. */
2355 || (int)VEC_length (int, operand_map) <= c->operand_num
2356 || VEC_index (int, operand_map, c->operand_num) == -1)
2357 cond_predicate = true_predicate ();
2359 cond_predicate = add_condition (info,
2360 VEC_index (int, operand_map,
2364 /* Fixed conditions remains same, construct single
2365 condition predicate. */
2368 cond_predicate.clause[0] = 1 << cond;
2369 cond_predicate.clause[1] = 0;
2371 clause_predicate = or_predicates (info->conds, &clause_predicate,
2374 out = and_predicates (info->conds, &out, &clause_predicate);
2376 return and_predicates (info->conds, &out, toplev_predicate);
2380 /* Update summary information of inline clones after inlining.
2381 Compute peak stack usage. */
2384 inline_update_callee_summaries (struct cgraph_node *node,
2387 struct cgraph_edge *e;
2388 struct inline_summary *callee_info = inline_summary (node);
2389 struct inline_summary *caller_info = inline_summary (node->callers->caller);
2392 callee_info->stack_frame_offset
2393 = caller_info->stack_frame_offset
2394 + caller_info->estimated_self_stack_size;
2395 peak = callee_info->stack_frame_offset
2396 + callee_info->estimated_self_stack_size;
2397 if (inline_summary (node->global.inlined_to)->estimated_stack_size
2399 inline_summary (node->global.inlined_to)->estimated_stack_size = peak;
2400 cgraph_propagate_frequency (node);
2401 for (e = node->callees; e; e = e->next_callee)
2403 if (!e->inline_failed)
2404 inline_update_callee_summaries (e->callee, depth);
2405 inline_edge_summary (e)->loop_depth += depth;
2407 for (e = node->indirect_calls; e; e = e->next_callee)
2408 inline_edge_summary (e)->loop_depth += depth;
2411 /* Update change_prob of EDGE after INLINED_EDGE has been inlined.
2412 When functoin A is inlined in B and A calls C with parameter that
2413 changes with probability PROB1 and C is known to be passthroug
2414 of argument if B that change with probability PROB2, the probability
2415 of change is now PROB1*PROB2. */
2418 remap_edge_change_prob (struct cgraph_edge *inlined_edge,
2419 struct cgraph_edge *edge)
2421 if (ipa_node_params_vector)
2424 struct ipa_edge_args *args = IPA_EDGE_REF (edge);
2425 struct inline_edge_summary *es = inline_edge_summary (edge);
2426 struct inline_edge_summary *inlined_es
2427 = inline_edge_summary (inlined_edge);
2429 for (i = 0; i < ipa_get_cs_argument_count (args); i++)
2431 struct ipa_jump_func *jfunc = ipa_get_ith_jump_func (args, i);
2432 if (jfunc->type == IPA_JF_PASS_THROUGH
2433 && (jfunc->value.pass_through.formal_id
2434 < (int) VEC_length (inline_param_summary_t,
2435 inlined_es->param)))
2437 int prob1 = VEC_index (inline_param_summary_t,
2438 es->param, i)->change_prob;
2439 int prob2 = VEC_index
2440 (inline_param_summary_t,
2442 jfunc->value.pass_through.formal_id)->change_prob;
2443 int prob = ((prob1 * prob2 + REG_BR_PROB_BASE / 2)
2444 / REG_BR_PROB_BASE);
2446 if (prob1 && prob2 && !prob)
2449 VEC_index (inline_param_summary_t,
2450 es->param, i)->change_prob = prob;
2456 /* Update edge summaries of NODE after INLINED_EDGE has been inlined.
2458 Remap predicates of callees of NODE. Rest of arguments match
2461 Also update change probabilities. */
2464 remap_edge_summaries (struct cgraph_edge *inlined_edge,
2465 struct cgraph_node *node,
2466 struct inline_summary *info,
2467 struct inline_summary *callee_info,
2468 VEC (int, heap) *operand_map,
2469 clause_t possible_truths,
2470 struct predicate *toplev_predicate)
2472 struct cgraph_edge *e;
2473 for (e = node->callees; e; e = e->next_callee)
2475 struct inline_edge_summary *es = inline_edge_summary (e);
2478 if (e->inline_failed)
2480 remap_edge_change_prob (inlined_edge, e);
2484 p = remap_predicate (info, callee_info,
2485 es->predicate, operand_map, possible_truths,
2487 edge_set_predicate (e, &p);
2488 /* TODO: We should remove the edge for code that will be
2489 optimized out, but we need to keep verifiers and tree-inline
2490 happy. Make it cold for now. */
2491 if (false_predicate_p (&p))
2498 edge_set_predicate (e, toplev_predicate);
2501 remap_edge_summaries (inlined_edge, e->callee, info, callee_info,
2502 operand_map, possible_truths, toplev_predicate);
2504 for (e = node->indirect_calls; e; e = e->next_callee)
2506 struct inline_edge_summary *es = inline_edge_summary (e);
2509 remap_edge_change_prob (inlined_edge, e);
2512 p = remap_predicate (info, callee_info,
2513 es->predicate, operand_map, possible_truths,
2515 edge_set_predicate (e, &p);
2516 /* TODO: We should remove the edge for code that will be optimized
2517 out, but we need to keep verifiers and tree-inline happy.
2518 Make it cold for now. */
2519 if (false_predicate_p (&p))
2526 edge_set_predicate (e, toplev_predicate);
2531 /* We inlined EDGE. Update summary of the function we inlined into. */
2534 inline_merge_summary (struct cgraph_edge *edge)
2536 struct inline_summary *callee_info = inline_summary (edge->callee);
2537 struct cgraph_node *to = (edge->caller->global.inlined_to
2538 ? edge->caller->global.inlined_to : edge->caller);
2539 struct inline_summary *info = inline_summary (to);
2540 clause_t clause = 0; /* not_inline is known to be false. */
2542 VEC (int, heap) *operand_map = NULL;
2544 struct predicate toplev_predicate;
2545 struct predicate true_p = true_predicate ();
2546 struct inline_edge_summary *es = inline_edge_summary (edge);
2549 toplev_predicate = *es->predicate;
2551 toplev_predicate = true_predicate ();
2553 if (ipa_node_params_vector && callee_info->conds)
2555 struct ipa_edge_args *args = IPA_EDGE_REF (edge);
2556 int count = ipa_get_cs_argument_count (args);
2559 clause = evaluate_conditions_for_edge (edge, true);
2561 VEC_safe_grow_cleared (int, heap, operand_map, count);
2562 for (i = 0; i < count; i++)
2564 struct ipa_jump_func *jfunc = ipa_get_ith_jump_func (args, i);
2566 /* TODO: handle non-NOPs when merging. */
2567 if (jfunc->type == IPA_JF_PASS_THROUGH
2568 && jfunc->value.pass_through.operation == NOP_EXPR)
2569 map = jfunc->value.pass_through.formal_id;
2570 VEC_replace (int, operand_map, i, map);
2571 gcc_assert (map < ipa_get_param_count (IPA_NODE_REF (to)));
2574 for (i = 0; VEC_iterate (size_time_entry, callee_info->entry, i, e); i++)
2576 struct predicate p = remap_predicate (info, callee_info,
2577 &e->predicate, operand_map, clause,
2579 if (!false_predicate_p (&p))
2581 gcov_type add_time = ((gcov_type)e->time * edge->frequency
2582 + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2583 int prob = predicate_probability (callee_info->conds,
2586 add_time = add_time * prob / REG_BR_PROB_BASE;
2587 if (add_time > MAX_TIME * INLINE_TIME_SCALE)
2588 add_time = MAX_TIME * INLINE_TIME_SCALE;
2589 if (prob != REG_BR_PROB_BASE
2590 && dump_file && (dump_flags & TDF_DETAILS))
2592 fprintf (dump_file, "\t\tScaling time by probability:%f\n",
2593 (double)prob / REG_BR_PROB_BASE);
2595 account_size_time (info, e->size, add_time, &p);
2598 remap_edge_summaries (edge, edge->callee, info, callee_info, operand_map,
2599 clause, &toplev_predicate);
2602 for (i = 0; VEC_iterate (size_time_entry, info->entry, i, e); i++)
2603 info->size += e->size, info->time += e->time;
2604 estimate_calls_size_and_time (to, &info->size, &info->time,
2605 ~(clause_t)(1 << predicate_false_condition));
2607 inline_update_callee_summaries (edge->callee,
2608 inline_edge_summary (edge)->loop_depth);
2610 /* We do not maintain predicates of inlined edges, free it. */
2611 edge_set_predicate (edge, &true_p);
2612 /* Similarly remove param summaries. */
2613 VEC_free (inline_param_summary_t, heap, es->param);
2615 info->time = (info->time + INLINE_TIME_SCALE / 2) / INLINE_TIME_SCALE;
2616 info->size = (info->size + INLINE_SIZE_SCALE / 2) / INLINE_SIZE_SCALE;
2620 /* Estimate the time cost for the caller when inlining EDGE.
2621 Only to be called via estimate_edge_time, that handles the
2624 When caching, also update the cache entry. Compute both time and
2625 size, since we always need both metrics eventually. */
2628 do_estimate_edge_time (struct cgraph_edge *edge)
2633 struct inline_edge_summary *es = inline_edge_summary (edge);
2635 gcc_checking_assert (edge->inline_failed);
2636 estimate_node_size_and_time (cgraph_function_or_thunk_node (edge->callee,
2638 evaluate_conditions_for_edge (edge, true),
2639 &size, &time, es->param);
2641 ret = (((gcov_type)time
2642 - es->call_stmt_time) * edge->frequency
2643 + CGRAPH_FREQ_BASE / 2) / CGRAPH_FREQ_BASE;
2645 /* When caching, update the cache entry. */
2646 if (edge_growth_cache)
2649 if ((int)VEC_length (edge_growth_cache_entry, edge_growth_cache)
2651 VEC_safe_grow_cleared (edge_growth_cache_entry, heap, edge_growth_cache,
2652 cgraph_edge_max_uid);
2653 VEC_index (edge_growth_cache_entry, edge_growth_cache, edge->uid)->time
2656 ret_size = size - es->call_stmt_size;
2657 gcc_checking_assert (es->call_stmt_size);
2658 VEC_index (edge_growth_cache_entry, edge_growth_cache, edge->uid)->size
2659 = ret_size + (ret_size >= 0);
2665 /* Estimate the growth of the caller when inlining EDGE.
2666 Only to be called via estimate_edge_size. */
2669 do_estimate_edge_growth (struct cgraph_edge *edge)
2672 struct cgraph_node *callee;
2674 /* When we do caching, use do_estimate_edge_time to populate the entry. */
2676 if (edge_growth_cache)
2678 do_estimate_edge_time (edge);
2679 size = VEC_index (edge_growth_cache_entry,
2682 gcc_checking_assert (size);
2683 return size - (size > 0);
2685 callee = cgraph_function_or_thunk_node (edge->callee, NULL);
2687 /* Early inliner runs without caching, go ahead and do the dirty work. */
2688 gcc_checking_assert (edge->inline_failed);
2689 estimate_node_size_and_time (callee,
2690 evaluate_conditions_for_edge (edge, true),
2692 gcc_checking_assert (inline_edge_summary (edge)->call_stmt_size);
2693 return size - inline_edge_summary (edge)->call_stmt_size;
2697 /* Estimate self time of the function NODE after inlining EDGE. */
2700 estimate_time_after_inlining (struct cgraph_node *node,
2701 struct cgraph_edge *edge)
2703 struct inline_edge_summary *es = inline_edge_summary (edge);
2704 if (!es->predicate || !false_predicate_p (es->predicate))
2706 gcov_type time = inline_summary (node)->time + estimate_edge_time (edge);
2709 if (time > MAX_TIME)
2713 return inline_summary (node)->time;
2717 /* Estimate the size of NODE after inlining EDGE which should be an
2718 edge to either NODE or a call inlined into NODE. */
2721 estimate_size_after_inlining (struct cgraph_node *node,
2722 struct cgraph_edge *edge)
2724 struct inline_edge_summary *es = inline_edge_summary (edge);
2725 if (!es->predicate || !false_predicate_p (es->predicate))
2727 int size = inline_summary (node)->size + estimate_edge_growth (edge);
2728 gcc_assert (size >= 0);
2731 return inline_summary (node)->size;
2737 bool self_recursive;
2742 /* Worker for do_estimate_growth. Collect growth for all callers. */
2745 do_estimate_growth_1 (struct cgraph_node *node, void *data)
2747 struct cgraph_edge *e;
2748 struct growth_data *d = (struct growth_data *) data;
2750 for (e = node->callers; e; e = e->next_caller)
2752 gcc_checking_assert (e->inline_failed);
2754 if (e->caller == node
2755 || (e->caller->global.inlined_to
2756 && e->caller->global.inlined_to == node))
2757 d->self_recursive = true;
2758 d->growth += estimate_edge_growth (e);
2764 /* Estimate the growth caused by inlining NODE into all callees. */
2767 do_estimate_growth (struct cgraph_node *node)
2769 struct growth_data d = {0, false};
2770 struct inline_summary *info = inline_summary (node);
2772 cgraph_for_node_and_aliases (node, do_estimate_growth_1, &d, true);
2774 /* For self recursive functions the growth estimation really should be
2775 infinity. We don't want to return very large values because the growth
2776 plays various roles in badness computation fractions. Be sure to not
2777 return zero or negative growths. */
2778 if (d.self_recursive)
2779 d.growth = d.growth < info->size ? info->size : d.growth;
2782 if (!DECL_EXTERNAL (node->decl)
2783 && cgraph_will_be_removed_from_program_if_no_direct_calls (node))
2784 d.growth -= info->size;
2785 /* COMDAT functions are very often not shared across multiple units
2786 since they come from various template instantiations.
2787 Take this into account. */
2788 else if (DECL_COMDAT (node->decl)
2789 && cgraph_can_remove_if_no_direct_calls_p (node))
2790 d.growth -= (info->size
2791 * (100 - PARAM_VALUE (PARAM_COMDAT_SHARING_PROBABILITY))
2795 if (node_growth_cache)
2797 if ((int)VEC_length (int, node_growth_cache) <= node->uid)
2798 VEC_safe_grow_cleared (int, heap, node_growth_cache, cgraph_max_uid);
2799 VEC_replace (int, node_growth_cache, node->uid,
2800 d.growth + (d.growth >= 0));
2806 /* This function performs intraprocedural analysis in NODE that is required to
2807 inline indirect calls. */
2810 inline_indirect_intraprocedural_analysis (struct cgraph_node *node)
2812 ipa_analyze_node (node);
2813 if (dump_file && (dump_flags & TDF_DETAILS))
2815 ipa_print_node_params (dump_file, node);
2816 ipa_print_node_jump_functions (dump_file, node);
2821 /* Note function body size. */
2824 inline_analyze_function (struct cgraph_node *node)
2826 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
2827 current_function_decl = node->decl;
2830 fprintf (dump_file, "\nAnalyzing function: %s/%u\n",
2831 cgraph_node_name (node), node->uid);
2832 if (optimize && !node->thunk.thunk_p)
2833 inline_indirect_intraprocedural_analysis (node);
2834 compute_inline_parameters (node, false);
2836 current_function_decl = NULL;
2841 /* Called when new function is inserted to callgraph late. */
2844 add_new_function (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
2846 inline_analyze_function (node);
2850 /* Note function body size. */
2853 inline_generate_summary (void)
2855 struct cgraph_node *node;
2857 function_insertion_hook_holder =
2858 cgraph_add_function_insertion_hook (&add_new_function, NULL);
2860 ipa_register_cgraph_hooks ();
2861 inline_free_summary ();
2863 FOR_EACH_DEFINED_FUNCTION (node)
2865 inline_analyze_function (node);
2869 /* Read predicate from IB. */
2871 static struct predicate
2872 read_predicate (struct lto_input_block *ib)
2874 struct predicate out;
2880 gcc_assert (k <= MAX_CLAUSES);
2881 clause = out.clause[k++] = streamer_read_uhwi (ib);
2885 /* Zero-initialize the remaining clauses in OUT. */
2886 while (k <= MAX_CLAUSES)
2887 out.clause[k++] = 0;
2893 /* Write inline summary for edge E to OB. */
2896 read_inline_edge_summary (struct lto_input_block *ib, struct cgraph_edge *e)
2898 struct inline_edge_summary *es = inline_edge_summary (e);
2902 es->call_stmt_size = streamer_read_uhwi (ib);
2903 es->call_stmt_time = streamer_read_uhwi (ib);
2904 es->loop_depth = streamer_read_uhwi (ib);
2905 p = read_predicate (ib);
2906 edge_set_predicate (e, &p);
2907 length = streamer_read_uhwi (ib);
2910 VEC_safe_grow_cleared (inline_param_summary_t, heap, es->param, length);
2911 for (i = 0; i < length; i++)
2912 VEC_index (inline_param_summary_t, es->param, i)->change_prob
2913 = streamer_read_uhwi (ib);
2918 /* Stream in inline summaries from the section. */
2921 inline_read_section (struct lto_file_decl_data *file_data, const char *data,
2924 const struct lto_function_header *header =
2925 (const struct lto_function_header *) data;
2926 const int32_t cfg_offset = sizeof (struct lto_function_header);
2927 const int32_t main_offset = cfg_offset + header->cfg_size;
2928 const int32_t string_offset = main_offset + header->main_size;
2929 struct data_in *data_in;
2930 struct lto_input_block ib;
2931 unsigned int i, count2, j;
2932 unsigned int f_count;
2934 LTO_INIT_INPUT_BLOCK (ib, (const char *) data + main_offset, 0,
2938 lto_data_in_create (file_data, (const char *) data + string_offset,
2939 header->string_size, NULL);
2940 f_count = streamer_read_uhwi (&ib);
2941 for (i = 0; i < f_count; i++)
2944 struct cgraph_node *node;
2945 struct inline_summary *info;
2946 lto_cgraph_encoder_t encoder;
2947 struct bitpack_d bp;
2948 struct cgraph_edge *e;
2950 index = streamer_read_uhwi (&ib);
2951 encoder = file_data->cgraph_node_encoder;
2952 node = lto_cgraph_encoder_deref (encoder, index);
2953 info = inline_summary (node);
2955 info->estimated_stack_size
2956 = info->estimated_self_stack_size = streamer_read_uhwi (&ib);
2957 info->size = info->self_size = streamer_read_uhwi (&ib);
2958 info->time = info->self_time = streamer_read_uhwi (&ib);
2960 bp = streamer_read_bitpack (&ib);
2961 info->inlinable = bp_unpack_value (&bp, 1);
2963 count2 = streamer_read_uhwi (&ib);
2964 gcc_assert (!info->conds);
2965 for (j = 0; j < count2; j++)
2968 c.operand_num = streamer_read_uhwi (&ib);
2969 c.code = (enum tree_code) streamer_read_uhwi (&ib);
2970 c.val = stream_read_tree (&ib, data_in);
2971 VEC_safe_push (condition, gc, info->conds, &c);
2973 count2 = streamer_read_uhwi (&ib);
2974 gcc_assert (!info->entry);
2975 for (j = 0; j < count2; j++)
2977 struct size_time_entry e;
2979 e.size = streamer_read_uhwi (&ib);
2980 e.time = streamer_read_uhwi (&ib);
2981 e.predicate = read_predicate (&ib);
2983 VEC_safe_push (size_time_entry, gc, info->entry, &e);
2985 for (e = node->callees; e; e = e->next_callee)
2986 read_inline_edge_summary (&ib, e);
2987 for (e = node->indirect_calls; e; e = e->next_callee)
2988 read_inline_edge_summary (&ib, e);
2991 lto_free_section_data (file_data, LTO_section_inline_summary, NULL, data,
2993 lto_data_in_delete (data_in);
2997 /* Read inline summary. Jump functions are shared among ipa-cp
2998 and inliner, so when ipa-cp is active, we don't need to write them
3002 inline_read_summary (void)
3004 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
3005 struct lto_file_decl_data *file_data;
3008 inline_summary_alloc ();
3010 while ((file_data = file_data_vec[j++]))
3013 const char *data = lto_get_section_data (file_data,
3014 LTO_section_inline_summary,
3017 inline_read_section (file_data, data, len);
3019 /* Fatal error here. We do not want to support compiling ltrans units
3020 with different version of compiler or different flags than the WPA
3021 unit, so this should never happen. */
3022 fatal_error ("ipa inline summary is missing in input file");
3026 ipa_register_cgraph_hooks ();
3028 ipa_prop_read_jump_functions ();
3030 function_insertion_hook_holder =
3031 cgraph_add_function_insertion_hook (&add_new_function, NULL);
3035 /* Write predicate P to OB. */
3038 write_predicate (struct output_block *ob, struct predicate *p)
3042 for (j = 0; p->clause[j]; j++)
3044 gcc_assert (j < MAX_CLAUSES);
3045 streamer_write_uhwi (ob, p->clause[j]);
3047 streamer_write_uhwi (ob, 0);
3051 /* Write inline summary for edge E to OB. */
3054 write_inline_edge_summary (struct output_block *ob, struct cgraph_edge *e)
3056 struct inline_edge_summary *es = inline_edge_summary (e);
3059 streamer_write_uhwi (ob, es->call_stmt_size);
3060 streamer_write_uhwi (ob, es->call_stmt_time);
3061 streamer_write_uhwi (ob, es->loop_depth);
3062 write_predicate (ob, es->predicate);
3063 streamer_write_uhwi (ob, VEC_length (inline_param_summary_t, es->param));
3064 for (i = 0; i < (int)VEC_length (inline_param_summary_t, es->param); i++)
3065 streamer_write_uhwi (ob, VEC_index (inline_param_summary_t,
3066 es->param, i)->change_prob);
3070 /* Write inline summary for node in SET.
3071 Jump functions are shared among ipa-cp and inliner, so when ipa-cp is
3072 active, we don't need to write them twice. */
3075 inline_write_summary (cgraph_node_set set,
3076 varpool_node_set vset ATTRIBUTE_UNUSED)
3078 struct cgraph_node *node;
3079 struct output_block *ob = create_output_block (LTO_section_inline_summary);
3080 lto_cgraph_encoder_t encoder = ob->decl_state->cgraph_node_encoder;
3081 unsigned int count = 0;
3084 for (i = 0; i < lto_cgraph_encoder_size (encoder); i++)
3085 if (lto_cgraph_encoder_deref (encoder, i)->analyzed)
3087 streamer_write_uhwi (ob, count);
3089 for (i = 0; i < lto_cgraph_encoder_size (encoder); i++)
3091 node = lto_cgraph_encoder_deref (encoder, i);
3094 struct inline_summary *info = inline_summary (node);
3095 struct bitpack_d bp;
3096 struct cgraph_edge *edge;
3099 struct condition *c;
3101 streamer_write_uhwi (ob, lto_cgraph_encoder_encode (encoder, node));
3102 streamer_write_hwi (ob, info->estimated_self_stack_size);
3103 streamer_write_hwi (ob, info->self_size);
3104 streamer_write_hwi (ob, info->self_time);
3105 bp = bitpack_create (ob->main_stream);
3106 bp_pack_value (&bp, info->inlinable, 1);
3107 streamer_write_bitpack (&bp);
3108 streamer_write_uhwi (ob, VEC_length (condition, info->conds));
3109 for (i = 0; VEC_iterate (condition, info->conds, i, c); i++)
3111 streamer_write_uhwi (ob, c->operand_num);
3112 streamer_write_uhwi (ob, c->code);
3113 stream_write_tree (ob, c->val, true);
3115 streamer_write_uhwi (ob, VEC_length (size_time_entry, info->entry));
3117 VEC_iterate (size_time_entry, info->entry, i, e);
3120 streamer_write_uhwi (ob, e->size);
3121 streamer_write_uhwi (ob, e->time);
3122 write_predicate (ob, &e->predicate);
3124 for (edge = node->callees; edge; edge = edge->next_callee)
3125 write_inline_edge_summary (ob, edge);
3126 for (edge = node->indirect_calls; edge; edge = edge->next_callee)
3127 write_inline_edge_summary (ob, edge);
3130 streamer_write_char_stream (ob->main_stream, 0);
3131 produce_asm (ob, NULL);
3132 destroy_output_block (ob);
3134 if (optimize && !flag_ipa_cp)
3135 ipa_prop_write_jump_functions (set);
3139 /* Release inline summary. */
3142 inline_free_summary (void)
3144 struct cgraph_node *node;
3145 FOR_EACH_DEFINED_FUNCTION (node)
3146 reset_inline_summary (node);
3147 if (function_insertion_hook_holder)
3148 cgraph_remove_function_insertion_hook (function_insertion_hook_holder);
3149 function_insertion_hook_holder = NULL;
3150 if (node_removal_hook_holder)
3151 cgraph_remove_node_removal_hook (node_removal_hook_holder);
3152 node_removal_hook_holder = NULL;
3153 if (edge_removal_hook_holder)
3154 cgraph_remove_edge_removal_hook (edge_removal_hook_holder);
3155 edge_removal_hook_holder = NULL;
3156 if (node_duplication_hook_holder)
3157 cgraph_remove_node_duplication_hook (node_duplication_hook_holder);
3158 node_duplication_hook_holder = NULL;
3159 if (edge_duplication_hook_holder)
3160 cgraph_remove_edge_duplication_hook (edge_duplication_hook_holder);
3161 edge_duplication_hook_holder = NULL;
3162 VEC_free (inline_summary_t, gc, inline_summary_vec);
3163 inline_summary_vec = NULL;
3164 VEC_free (inline_edge_summary_t, heap, inline_edge_summary_vec);
3165 inline_edge_summary_vec = NULL;
3166 if (edge_predicate_pool)
3167 free_alloc_pool (edge_predicate_pool);
3168 edge_predicate_pool = 0;