1 /* Interprocedural analyses.
2 Copyright (C) 2005, 2007, 2008, 2009, 2010, 2011
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
25 #include "langhooks.h"
30 #include "tree-flow.h"
31 #include "tree-pass.h"
32 #include "tree-inline.h"
37 #include "diagnostic.h"
38 #include "tree-pretty-print.h"
39 #include "gimple-pretty-print.h"
40 #include "lto-streamer.h"
41 #include "data-streamer.h"
42 #include "tree-streamer.h"
45 /* Intermediate information about a parameter that is only useful during the
46 run of ipa_analyze_node and is not kept afterwards. */
48 struct param_analysis_info
51 bitmap visited_statements;
54 /* Vector where the parameter infos are actually stored. */
55 VEC (ipa_node_params_t, heap) *ipa_node_params_vector;
56 /* Vector where the parameter infos are actually stored. */
57 VEC (ipa_edge_args_t, gc) *ipa_edge_args_vector;
59 /* Bitmap with all UIDs of call graph edges that have been already processed
60 by indirect inlining. */
61 static bitmap iinlining_processed_edges;
63 /* Holders of ipa cgraph hooks: */
64 static struct cgraph_edge_hook_list *edge_removal_hook_holder;
65 static struct cgraph_node_hook_list *node_removal_hook_holder;
66 static struct cgraph_2edge_hook_list *edge_duplication_hook_holder;
67 static struct cgraph_2node_hook_list *node_duplication_hook_holder;
68 static struct cgraph_node_hook_list *function_insertion_hook_holder;
70 /* Return index of the formal whose tree is PTREE in function which corresponds
74 ipa_get_param_decl_index (struct ipa_node_params *info, tree ptree)
78 count = ipa_get_param_count (info);
79 for (i = 0; i < count; i++)
80 if (ipa_get_param (info, i) == ptree)
86 /* Populate the param_decl field in parameter descriptors of INFO that
87 corresponds to NODE. */
90 ipa_populate_param_decls (struct cgraph_node *node,
91 struct ipa_node_params *info)
99 fnargs = DECL_ARGUMENTS (fndecl);
101 for (parm = fnargs; parm; parm = DECL_CHAIN (parm))
103 VEC_index (ipa_param_descriptor_t,
104 info->descriptors, param_num)->decl = parm;
109 /* Return how many formal parameters FNDECL has. */
112 count_formal_params (tree fndecl)
117 for (parm = DECL_ARGUMENTS (fndecl); parm; parm = DECL_CHAIN (parm))
123 /* Initialize the ipa_node_params structure associated with NODE by counting
124 the function parameters, creating the descriptors and populating their
128 ipa_initialize_node_params (struct cgraph_node *node)
130 struct ipa_node_params *info = IPA_NODE_REF (node);
132 if (!info->descriptors)
136 param_count = count_formal_params (node->decl);
139 VEC_safe_grow_cleared (ipa_param_descriptor_t, heap,
140 info->descriptors, param_count);
141 ipa_populate_param_decls (node, info);
146 /* Count number of arguments callsite CS has and store it in
147 ipa_edge_args structure corresponding to this callsite. */
150 ipa_count_arguments (struct cgraph_edge *cs)
155 stmt = cs->call_stmt;
156 gcc_assert (is_gimple_call (stmt));
157 arg_num = gimple_call_num_args (stmt);
158 if (VEC_length (ipa_edge_args_t, ipa_edge_args_vector)
159 <= (unsigned) cgraph_edge_max_uid)
160 VEC_safe_grow_cleared (ipa_edge_args_t, gc,
161 ipa_edge_args_vector, cgraph_edge_max_uid + 1);
162 ipa_set_cs_argument_count (IPA_EDGE_REF (cs), arg_num);
165 /* Print the jump functions associated with call graph edge CS to file F. */
168 ipa_print_node_jump_functions_for_edge (FILE *f, struct cgraph_edge *cs)
172 count = ipa_get_cs_argument_count (IPA_EDGE_REF (cs));
173 for (i = 0; i < count; i++)
175 struct ipa_jump_func *jump_func;
176 enum jump_func_type type;
178 jump_func = ipa_get_ith_jump_func (IPA_EDGE_REF (cs), i);
179 type = jump_func->type;
181 fprintf (f, " param %d: ", i);
182 if (type == IPA_JF_UNKNOWN)
183 fprintf (f, "UNKNOWN\n");
184 else if (type == IPA_JF_KNOWN_TYPE)
186 tree binfo_type = TREE_TYPE (jump_func->value.base_binfo);
187 fprintf (f, "KNOWN TYPE, type in binfo is: ");
188 print_generic_expr (f, binfo_type, 0);
189 fprintf (f, " (%u)\n", TYPE_UID (binfo_type));
191 else if (type == IPA_JF_CONST)
193 tree val = jump_func->value.constant;
194 fprintf (f, "CONST: ");
195 print_generic_expr (f, val, 0);
196 if (TREE_CODE (val) == ADDR_EXPR
197 && TREE_CODE (TREE_OPERAND (val, 0)) == CONST_DECL)
200 print_generic_expr (f, DECL_INITIAL (TREE_OPERAND (val, 0)),
205 else if (type == IPA_JF_CONST_MEMBER_PTR)
207 fprintf (f, "CONST MEMBER PTR: ");
208 print_generic_expr (f, jump_func->value.member_cst.pfn, 0);
210 print_generic_expr (f, jump_func->value.member_cst.delta, 0);
213 else if (type == IPA_JF_PASS_THROUGH)
215 fprintf (f, "PASS THROUGH: ");
216 fprintf (f, "%d, op %s ",
217 jump_func->value.pass_through.formal_id,
219 jump_func->value.pass_through.operation]);
220 if (jump_func->value.pass_through.operation != NOP_EXPR)
221 print_generic_expr (dump_file,
222 jump_func->value.pass_through.operand, 0);
223 fprintf (dump_file, "\n");
225 else if (type == IPA_JF_ANCESTOR)
227 fprintf (f, "ANCESTOR: ");
228 fprintf (f, "%d, offset "HOST_WIDE_INT_PRINT_DEC", ",
229 jump_func->value.ancestor.formal_id,
230 jump_func->value.ancestor.offset);
231 print_generic_expr (f, jump_func->value.ancestor.type, 0);
232 fprintf (dump_file, "\n");
238 /* Print the jump functions of all arguments on all call graph edges going from
242 ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node)
244 struct cgraph_edge *cs;
247 fprintf (f, " Jump functions of caller %s:\n", cgraph_node_name (node));
248 for (cs = node->callees; cs; cs = cs->next_callee)
250 if (!ipa_edge_args_info_available_for_edge_p (cs))
253 fprintf (f, " callsite %s/%i -> %s/%i : \n",
254 cgraph_node_name (node), node->uid,
255 cgraph_node_name (cs->callee), cs->callee->uid);
256 ipa_print_node_jump_functions_for_edge (f, cs);
259 for (cs = node->indirect_calls, i = 0; cs; cs = cs->next_callee, i++)
261 if (!ipa_edge_args_info_available_for_edge_p (cs))
266 fprintf (f, " indirect callsite %d for stmt ", i);
267 print_gimple_stmt (f, cs->call_stmt, 0, TDF_SLIM);
270 fprintf (f, " indirect callsite %d :\n", i);
271 ipa_print_node_jump_functions_for_edge (f, cs);
276 /* Print ipa_jump_func data structures of all nodes in the call graph to F. */
279 ipa_print_all_jump_functions (FILE *f)
281 struct cgraph_node *node;
283 fprintf (f, "\nJump functions:\n");
284 for (node = cgraph_nodes; node; node = node->next)
286 ipa_print_node_jump_functions (f, node);
290 /* Structure to be passed in between detect_type_change and
291 check_stmt_for_type_change. */
293 struct type_change_info
295 /* Set to true if dynamic type change has been detected. */
296 bool type_maybe_changed;
299 /* Return true if STMT can modify a virtual method table pointer.
301 This function makes special assumptions about both constructors and
302 destructors which are all the functions that are allowed to alter the VMT
303 pointers. It assumes that destructors begin with assignment into all VMT
304 pointers and that constructors essentially look in the following way:
306 1) The very first thing they do is that they call constructors of ancestor
307 sub-objects that have them.
309 2) Then VMT pointers of this and all its ancestors is set to new values
310 corresponding to the type corresponding to the constructor.
312 3) Only afterwards, other stuff such as constructor of member sub-objects
313 and the code written by the user is run. Only this may include calling
314 virtual functions, directly or indirectly.
316 There is no way to call a constructor of an ancestor sub-object in any
319 This means that we do not have to care whether constructors get the correct
320 type information because they will always change it (in fact, if we define
321 the type to be given by the VMT pointer, it is undefined).
323 The most important fact to derive from the above is that if, for some
324 statement in the section 3, we try to detect whether the dynamic type has
325 changed, we can safely ignore all calls as we examine the function body
326 backwards until we reach statements in section 2 because these calls cannot
327 be ancestor constructors or destructors (if the input is not bogus) and so
328 do not change the dynamic type (this holds true only for automatically
329 allocated objects but at the moment we devirtualize only these). We then
330 must detect that statements in section 2 change the dynamic type and can try
331 to derive the new type. That is enough and we can stop, we will never see
332 the calls into constructors of sub-objects in this code. Therefore we can
333 safely ignore all call statements that we traverse.
337 stmt_may_be_vtbl_ptr_store (gimple stmt)
339 if (is_gimple_call (stmt))
341 else if (is_gimple_assign (stmt))
343 tree lhs = gimple_assign_lhs (stmt);
345 if (!AGGREGATE_TYPE_P (TREE_TYPE (lhs)))
347 if (flag_strict_aliasing
348 && !POINTER_TYPE_P (TREE_TYPE (lhs)))
351 if (TREE_CODE (lhs) == COMPONENT_REF
352 && !DECL_VIRTUAL_P (TREE_OPERAND (lhs, 1)))
354 /* In the future we might want to use get_base_ref_and_offset to find
355 if there is a field corresponding to the offset and if so, proceed
356 almost like if it was a component ref. */
362 /* Callback of walk_aliased_vdefs and a helper function for
363 detect_type_change to check whether a particular statement may modify
364 the virtual table pointer, and if possible also determine the new type of
365 the (sub-)object. It stores its result into DATA, which points to a
366 type_change_info structure. */
369 check_stmt_for_type_change (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef, void *data)
371 gimple stmt = SSA_NAME_DEF_STMT (vdef);
372 struct type_change_info *tci = (struct type_change_info *) data;
374 if (stmt_may_be_vtbl_ptr_store (stmt))
376 tci->type_maybe_changed = true;
383 /* Detect whether the dynamic type of ARG has changed (before callsite CALL) by
384 looking for assignments to its virtual table pointer. If it is, return true
385 and fill in the jump function JFUNC with relevant type information or set it
386 to unknown. ARG is the object itself (not a pointer to it, unless
387 dereferenced). BASE is the base of the memory access as returned by
388 get_ref_base_and_extent, as is the offset. */
391 detect_type_change (tree arg, tree base, gimple call,
392 struct ipa_jump_func *jfunc, HOST_WIDE_INT offset)
394 struct type_change_info tci;
397 gcc_checking_assert (DECL_P (arg)
398 || TREE_CODE (arg) == MEM_REF
399 || handled_component_p (arg));
400 /* Const calls cannot call virtual methods through VMT and so type changes do
402 if (!flag_devirtualize || !gimple_vuse (call))
405 tci.type_maybe_changed = false;
410 ao.size = POINTER_SIZE;
411 ao.max_size = ao.size;
412 ao.ref_alias_set = -1;
413 ao.base_alias_set = -1;
415 walk_aliased_vdefs (&ao, gimple_vuse (call), check_stmt_for_type_change,
417 if (!tci.type_maybe_changed)
420 jfunc->type = IPA_JF_UNKNOWN;
424 /* Like detect_type_change but ARG is supposed to be a non-dereferenced pointer
425 SSA name (its dereference will become the base and the offset is assumed to
429 detect_type_change_ssa (tree arg, gimple call, struct ipa_jump_func *jfunc)
431 gcc_checking_assert (TREE_CODE (arg) == SSA_NAME);
432 if (!flag_devirtualize
433 || !POINTER_TYPE_P (TREE_TYPE (arg))
434 || TREE_CODE (TREE_TYPE (TREE_TYPE (arg))) != RECORD_TYPE)
437 arg = build2 (MEM_REF, ptr_type_node, arg,
438 build_int_cst (ptr_type_node, 0));
440 return detect_type_change (arg, arg, call, jfunc, 0);
444 /* Given that an actual argument is an SSA_NAME (given in NAME) and is a result
445 of an assignment statement STMT, try to find out whether NAME can be
446 described by a (possibly polynomial) pass-through jump-function or an
447 ancestor jump function and if so, write the appropriate function into
451 compute_complex_assign_jump_func (struct ipa_node_params *info,
452 struct ipa_jump_func *jfunc,
453 gimple call, gimple stmt, tree name)
455 HOST_WIDE_INT offset, size, max_size;
456 tree op1, op2, base, ssa;
459 op1 = gimple_assign_rhs1 (stmt);
460 op2 = gimple_assign_rhs2 (stmt);
462 if (TREE_CODE (op1) == SSA_NAME
463 && SSA_NAME_IS_DEFAULT_DEF (op1))
465 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (op1));
471 if (!is_gimple_ip_invariant (op2)
472 || (TREE_CODE_CLASS (gimple_expr_code (stmt)) != tcc_comparison
473 && !useless_type_conversion_p (TREE_TYPE (name),
477 jfunc->type = IPA_JF_PASS_THROUGH;
478 jfunc->value.pass_through.formal_id = index;
479 jfunc->value.pass_through.operation = gimple_assign_rhs_code (stmt);
480 jfunc->value.pass_through.operand = op2;
482 else if (gimple_assign_unary_nop_p (stmt)
483 && !detect_type_change_ssa (op1, call, jfunc))
485 jfunc->type = IPA_JF_PASS_THROUGH;
486 jfunc->value.pass_through.formal_id = index;
487 jfunc->value.pass_through.operation = NOP_EXPR;
492 if (TREE_CODE (op1) != ADDR_EXPR)
494 op1 = TREE_OPERAND (op1, 0);
495 if (TREE_CODE (TREE_TYPE (op1)) != RECORD_TYPE)
497 base = get_ref_base_and_extent (op1, &offset, &size, &max_size);
498 if (TREE_CODE (base) != MEM_REF
499 /* If this is a varying address, punt. */
503 offset += mem_ref_offset (base).low * BITS_PER_UNIT;
504 ssa = TREE_OPERAND (base, 0);
505 if (TREE_CODE (ssa) != SSA_NAME
506 || !SSA_NAME_IS_DEFAULT_DEF (ssa)
510 /* Dynamic types are changed only in constructors and destructors and */
511 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (ssa));
513 && !detect_type_change (op1, base, call, jfunc, offset))
515 jfunc->type = IPA_JF_ANCESTOR;
516 jfunc->value.ancestor.formal_id = index;
517 jfunc->value.ancestor.offset = offset;
518 jfunc->value.ancestor.type = TREE_TYPE (op1);
522 /* Extract the base, offset and MEM_REF expression from a statement ASSIGN if
525 iftmp.1_3 = &obj_2(D)->D.1762;
527 The base of the MEM_REF must be a default definition SSA NAME of a
528 parameter. Return NULL_TREE if it looks otherwise. If case of success, the
529 whole MEM_REF expression is returned and the offset calculated from any
530 handled components and the MEM_REF itself is stored into *OFFSET. The whole
531 RHS stripped off the ADDR_EXPR is stored into *OBJ_P. */
534 get_ancestor_addr_info (gimple assign, tree *obj_p, HOST_WIDE_INT *offset)
536 HOST_WIDE_INT size, max_size;
537 tree expr, parm, obj;
539 if (!gimple_assign_single_p (assign))
541 expr = gimple_assign_rhs1 (assign);
543 if (TREE_CODE (expr) != ADDR_EXPR)
545 expr = TREE_OPERAND (expr, 0);
547 expr = get_ref_base_and_extent (expr, offset, &size, &max_size);
549 if (TREE_CODE (expr) != MEM_REF
550 /* If this is a varying address, punt. */
555 parm = TREE_OPERAND (expr, 0);
556 if (TREE_CODE (parm) != SSA_NAME
557 || !SSA_NAME_IS_DEFAULT_DEF (parm)
558 || TREE_CODE (SSA_NAME_VAR (parm)) != PARM_DECL)
561 *offset += mem_ref_offset (expr).low * BITS_PER_UNIT;
567 /* Given that an actual argument is an SSA_NAME that is a result of a phi
568 statement PHI, try to find out whether NAME is in fact a
569 multiple-inheritance typecast from a descendant into an ancestor of a formal
570 parameter and thus can be described by an ancestor jump function and if so,
571 write the appropriate function into JFUNC.
573 Essentially we want to match the following pattern:
581 iftmp.1_3 = &obj_2(D)->D.1762;
584 # iftmp.1_1 = PHI <iftmp.1_3(3), 0B(2)>
585 D.1879_6 = middleman_1 (iftmp.1_1, i_5(D));
589 compute_complex_ancestor_jump_func (struct ipa_node_params *info,
590 struct ipa_jump_func *jfunc,
591 gimple call, gimple phi)
593 HOST_WIDE_INT offset;
595 basic_block phi_bb, assign_bb, cond_bb;
596 tree tmp, parm, expr, obj;
599 if (gimple_phi_num_args (phi) != 2)
602 if (integer_zerop (PHI_ARG_DEF (phi, 1)))
603 tmp = PHI_ARG_DEF (phi, 0);
604 else if (integer_zerop (PHI_ARG_DEF (phi, 0)))
605 tmp = PHI_ARG_DEF (phi, 1);
608 if (TREE_CODE (tmp) != SSA_NAME
609 || SSA_NAME_IS_DEFAULT_DEF (tmp)
610 || !POINTER_TYPE_P (TREE_TYPE (tmp))
611 || TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) != RECORD_TYPE)
614 assign = SSA_NAME_DEF_STMT (tmp);
615 assign_bb = gimple_bb (assign);
616 if (!single_pred_p (assign_bb))
618 expr = get_ancestor_addr_info (assign, &obj, &offset);
621 parm = TREE_OPERAND (expr, 0);
622 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (parm));
623 gcc_assert (index >= 0);
625 cond_bb = single_pred (assign_bb);
626 cond = last_stmt (cond_bb);
628 || gimple_code (cond) != GIMPLE_COND
629 || gimple_cond_code (cond) != NE_EXPR
630 || gimple_cond_lhs (cond) != parm
631 || !integer_zerop (gimple_cond_rhs (cond)))
634 phi_bb = gimple_bb (phi);
635 for (i = 0; i < 2; i++)
637 basic_block pred = EDGE_PRED (phi_bb, i)->src;
638 if (pred != assign_bb && pred != cond_bb)
642 if (!detect_type_change (obj, expr, call, jfunc, offset))
644 jfunc->type = IPA_JF_ANCESTOR;
645 jfunc->value.ancestor.formal_id = index;
646 jfunc->value.ancestor.offset = offset;
647 jfunc->value.ancestor.type = TREE_TYPE (obj);
651 /* Given OP which is passed as an actual argument to a called function,
652 determine if it is possible to construct a KNOWN_TYPE jump function for it
653 and if so, create one and store it to JFUNC. */
656 compute_known_type_jump_func (tree op, struct ipa_jump_func *jfunc,
659 HOST_WIDE_INT offset, size, max_size;
662 if (!flag_devirtualize
663 || TREE_CODE (op) != ADDR_EXPR
664 || TREE_CODE (TREE_TYPE (TREE_TYPE (op))) != RECORD_TYPE)
667 op = TREE_OPERAND (op, 0);
668 base = get_ref_base_and_extent (op, &offset, &size, &max_size);
672 || TREE_CODE (TREE_TYPE (base)) != RECORD_TYPE
673 || is_global_var (base))
676 if (detect_type_change (op, base, call, jfunc, offset))
679 binfo = TYPE_BINFO (TREE_TYPE (base));
682 binfo = get_binfo_at_offset (binfo, offset, TREE_TYPE (op));
685 jfunc->type = IPA_JF_KNOWN_TYPE;
686 jfunc->value.base_binfo = binfo;
691 /* Determine the jump functions of scalar arguments. Scalar means SSA names
692 and constants of a number of selected types. INFO is the ipa_node_params
693 structure associated with the caller, FUNCTIONS is a pointer to an array of
694 jump function structures associated with CALL which is the call statement
698 compute_scalar_jump_functions (struct ipa_node_params *info,
699 struct ipa_jump_func *functions,
705 for (num = 0; num < gimple_call_num_args (call); num++)
707 arg = gimple_call_arg (call, num);
709 if (is_gimple_ip_invariant (arg))
711 functions[num].type = IPA_JF_CONST;
712 functions[num].value.constant = arg;
714 else if (TREE_CODE (arg) == SSA_NAME)
716 if (SSA_NAME_IS_DEFAULT_DEF (arg))
718 int index = ipa_get_param_decl_index (info, SSA_NAME_VAR (arg));
721 && !detect_type_change_ssa (arg, call, &functions[num]))
723 functions[num].type = IPA_JF_PASS_THROUGH;
724 functions[num].value.pass_through.formal_id = index;
725 functions[num].value.pass_through.operation = NOP_EXPR;
730 gimple stmt = SSA_NAME_DEF_STMT (arg);
731 if (is_gimple_assign (stmt))
732 compute_complex_assign_jump_func (info, &functions[num],
734 else if (gimple_code (stmt) == GIMPLE_PHI)
735 compute_complex_ancestor_jump_func (info, &functions[num],
740 compute_known_type_jump_func (arg, &functions[num], call);
744 /* Inspect the given TYPE and return true iff it has the same structure (the
745 same number of fields of the same types) as a C++ member pointer. If
746 METHOD_PTR and DELTA are non-NULL, store the trees representing the
747 corresponding fields there. */
750 type_like_member_ptr_p (tree type, tree *method_ptr, tree *delta)
754 if (TREE_CODE (type) != RECORD_TYPE)
757 fld = TYPE_FIELDS (type);
758 if (!fld || !POINTER_TYPE_P (TREE_TYPE (fld))
759 || TREE_CODE (TREE_TYPE (TREE_TYPE (fld))) != METHOD_TYPE)
765 fld = DECL_CHAIN (fld);
766 if (!fld || INTEGRAL_TYPE_P (fld))
771 if (DECL_CHAIN (fld))
777 /* Callback of walk_aliased_vdefs. Flags that it has been invoked to the
778 boolean variable pointed to by DATA. */
781 mark_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef ATTRIBUTE_UNUSED,
784 bool *b = (bool *) data;
789 /* Return true if the formal parameter PARM might have been modified in this
790 function before reaching the statement CALL. PARM_INFO is a pointer to a
791 structure containing intermediate information about PARM. */
794 is_parm_modified_before_call (struct param_analysis_info *parm_info,
795 gimple call, tree parm)
797 bool modified = false;
800 if (parm_info->modified)
803 ao_ref_init (&refd, parm);
804 walk_aliased_vdefs (&refd, gimple_vuse (call), mark_modified,
805 &modified, &parm_info->visited_statements);
808 parm_info->modified = true;
814 /* Go through arguments of the CALL and for every one that looks like a member
815 pointer, check whether it can be safely declared pass-through and if so,
816 mark that to the corresponding item of jump FUNCTIONS. Return true iff
817 there are non-pass-through member pointers within the arguments. INFO
818 describes formal parameters of the caller. PARMS_INFO is a pointer to a
819 vector containing intermediate information about each formal parameter. */
822 compute_pass_through_member_ptrs (struct ipa_node_params *info,
823 struct param_analysis_info *parms_info,
824 struct ipa_jump_func *functions,
827 bool undecided_members = false;
831 for (num = 0; num < gimple_call_num_args (call); num++)
833 arg = gimple_call_arg (call, num);
835 if (type_like_member_ptr_p (TREE_TYPE (arg), NULL, NULL))
837 if (TREE_CODE (arg) == PARM_DECL)
839 int index = ipa_get_param_decl_index (info, arg);
841 gcc_assert (index >=0);
842 if (!is_parm_modified_before_call (&parms_info[index], call, arg))
844 functions[num].type = IPA_JF_PASS_THROUGH;
845 functions[num].value.pass_through.formal_id = index;
846 functions[num].value.pass_through.operation = NOP_EXPR;
849 undecided_members = true;
852 undecided_members = true;
856 return undecided_members;
859 /* Simple function filling in a member pointer constant jump function (with PFN
860 and DELTA as the constant value) into JFUNC. */
863 fill_member_ptr_cst_jump_function (struct ipa_jump_func *jfunc,
864 tree pfn, tree delta)
866 jfunc->type = IPA_JF_CONST_MEMBER_PTR;
867 jfunc->value.member_cst.pfn = pfn;
868 jfunc->value.member_cst.delta = delta;
871 /* If RHS is an SSA_NAME and it is defined by a simple copy assign statement,
872 return the rhs of its defining statement. */
875 get_ssa_def_if_simple_copy (tree rhs)
877 while (TREE_CODE (rhs) == SSA_NAME && !SSA_NAME_IS_DEFAULT_DEF (rhs))
879 gimple def_stmt = SSA_NAME_DEF_STMT (rhs);
881 if (gimple_assign_single_p (def_stmt))
882 rhs = gimple_assign_rhs1 (def_stmt);
889 /* Traverse statements from CALL backwards, scanning whether the argument ARG
890 which is a member pointer is filled in with constant values. If it is, fill
891 the jump function JFUNC in appropriately. METHOD_FIELD and DELTA_FIELD are
892 fields of the record type of the member pointer. To give an example, we
893 look for a pattern looking like the following:
895 D.2515.__pfn ={v} printStuff;
896 D.2515.__delta ={v} 0;
897 i_1 = doprinting (D.2515); */
900 determine_cst_member_ptr (gimple call, tree arg, tree method_field,
901 tree delta_field, struct ipa_jump_func *jfunc)
903 gimple_stmt_iterator gsi;
904 tree method = NULL_TREE;
905 tree delta = NULL_TREE;
907 gsi = gsi_for_stmt (call);
910 for (; !gsi_end_p (gsi); gsi_prev (&gsi))
912 gimple stmt = gsi_stmt (gsi);
915 if (!stmt_may_clobber_ref_p (stmt, arg))
917 if (!gimple_assign_single_p (stmt))
920 lhs = gimple_assign_lhs (stmt);
921 rhs = gimple_assign_rhs1 (stmt);
923 if (TREE_CODE (lhs) != COMPONENT_REF
924 || TREE_OPERAND (lhs, 0) != arg)
927 fld = TREE_OPERAND (lhs, 1);
928 if (!method && fld == method_field)
930 rhs = get_ssa_def_if_simple_copy (rhs);
931 if (TREE_CODE (rhs) == ADDR_EXPR
932 && TREE_CODE (TREE_OPERAND (rhs, 0)) == FUNCTION_DECL
933 && TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) == METHOD_TYPE)
935 method = TREE_OPERAND (rhs, 0);
938 fill_member_ptr_cst_jump_function (jfunc, rhs, delta);
946 if (!delta && fld == delta_field)
948 rhs = get_ssa_def_if_simple_copy (rhs);
949 if (TREE_CODE (rhs) == INTEGER_CST)
954 fill_member_ptr_cst_jump_function (jfunc, rhs, delta);
966 /* Go through the arguments of the CALL and for every member pointer within
967 tries determine whether it is a constant. If it is, create a corresponding
968 constant jump function in FUNCTIONS which is an array of jump functions
969 associated with the call. */
972 compute_cst_member_ptr_arguments (struct ipa_jump_func *functions,
976 tree arg, method_field, delta_field;
978 for (num = 0; num < gimple_call_num_args (call); num++)
980 arg = gimple_call_arg (call, num);
982 if (functions[num].type == IPA_JF_UNKNOWN
983 && type_like_member_ptr_p (TREE_TYPE (arg), &method_field,
985 determine_cst_member_ptr (call, arg, method_field, delta_field,
990 /* Compute jump function for all arguments of callsite CS and insert the
991 information in the jump_functions array in the ipa_edge_args corresponding
995 ipa_compute_jump_functions_for_edge (struct param_analysis_info *parms_info,
996 struct cgraph_edge *cs)
998 struct ipa_node_params *info = IPA_NODE_REF (cs->caller);
999 struct ipa_edge_args *arguments = IPA_EDGE_REF (cs);
1002 if (ipa_get_cs_argument_count (arguments) == 0 || arguments->jump_functions)
1004 arguments->jump_functions = ggc_alloc_cleared_vec_ipa_jump_func
1005 (ipa_get_cs_argument_count (arguments));
1007 call = cs->call_stmt;
1008 gcc_assert (is_gimple_call (call));
1010 /* We will deal with constants and SSA scalars first: */
1011 compute_scalar_jump_functions (info, arguments->jump_functions, call);
1013 /* Let's check whether there are any potential member pointers and if so,
1014 whether we can determine their functions as pass_through. */
1015 if (!compute_pass_through_member_ptrs (info, parms_info,
1016 arguments->jump_functions, call))
1019 /* Finally, let's check whether we actually pass a new constant member
1021 compute_cst_member_ptr_arguments (arguments->jump_functions, call);
1024 /* Compute jump functions for all edges - both direct and indirect - outgoing
1025 from NODE. Also count the actual arguments in the process. */
1028 ipa_compute_jump_functions (struct cgraph_node *node,
1029 struct param_analysis_info *parms_info)
1031 struct cgraph_edge *cs;
1033 for (cs = node->callees; cs; cs = cs->next_callee)
1035 struct cgraph_node *callee = cgraph_function_or_thunk_node (cs->callee, NULL);
1036 /* We do not need to bother analyzing calls to unknown
1037 functions unless they may become known during lto/whopr. */
1038 if (!cs->callee->analyzed && !flag_lto)
1040 ipa_count_arguments (cs);
1041 /* If the descriptor of the callee is not initialized yet, we have to do
1043 if (callee->analyzed)
1044 ipa_initialize_node_params (callee);
1045 if (ipa_get_cs_argument_count (IPA_EDGE_REF (cs))
1046 != ipa_get_param_count (IPA_NODE_REF (callee)))
1047 ipa_set_called_with_variable_arg (IPA_NODE_REF (callee));
1048 ipa_compute_jump_functions_for_edge (parms_info, cs);
1051 for (cs = node->indirect_calls; cs; cs = cs->next_callee)
1053 ipa_count_arguments (cs);
1054 ipa_compute_jump_functions_for_edge (parms_info, cs);
1058 /* If RHS looks like a rhs of a statement loading pfn from a member
1059 pointer formal parameter, return the parameter, otherwise return
1060 NULL. If USE_DELTA, then we look for a use of the delta field
1061 rather than the pfn. */
1064 ipa_get_member_ptr_load_param (tree rhs, bool use_delta)
1066 tree rec, ref_field, ref_offset, fld, fld_offset, ptr_field, delta_field;
1068 if (TREE_CODE (rhs) == COMPONENT_REF)
1070 ref_field = TREE_OPERAND (rhs, 1);
1071 rhs = TREE_OPERAND (rhs, 0);
1074 ref_field = NULL_TREE;
1075 if (TREE_CODE (rhs) != MEM_REF)
1077 rec = TREE_OPERAND (rhs, 0);
1078 if (TREE_CODE (rec) != ADDR_EXPR)
1080 rec = TREE_OPERAND (rec, 0);
1081 if (TREE_CODE (rec) != PARM_DECL
1082 || !type_like_member_ptr_p (TREE_TYPE (rec), &ptr_field, &delta_field))
1085 ref_offset = TREE_OPERAND (rhs, 1);
1089 if (integer_nonzerop (ref_offset))
1097 return ref_field == fld ? rec : NULL_TREE;
1101 fld_offset = byte_position (delta_field);
1103 fld_offset = byte_position (ptr_field);
1105 return tree_int_cst_equal (ref_offset, fld_offset) ? rec : NULL_TREE;
1108 /* If STMT looks like a statement loading a value from a member pointer formal
1109 parameter, this function returns that parameter. */
1112 ipa_get_stmt_member_ptr_load_param (gimple stmt, bool use_delta)
1116 if (!gimple_assign_single_p (stmt))
1119 rhs = gimple_assign_rhs1 (stmt);
1120 return ipa_get_member_ptr_load_param (rhs, use_delta);
1123 /* Returns true iff T is an SSA_NAME defined by a statement. */
1126 ipa_is_ssa_with_stmt_def (tree t)
1128 if (TREE_CODE (t) == SSA_NAME
1129 && !SSA_NAME_IS_DEFAULT_DEF (t))
1135 /* Find the indirect call graph edge corresponding to STMT and mark it as a
1136 call to a parameter number PARAM_INDEX. NODE is the caller. Return the
1137 indirect call graph edge. */
1139 static struct cgraph_edge *
1140 ipa_note_param_call (struct cgraph_node *node, int param_index, gimple stmt)
1142 struct cgraph_edge *cs;
1144 cs = cgraph_edge (node, stmt);
1145 cs->indirect_info->param_index = param_index;
1146 cs->indirect_info->anc_offset = 0;
1147 cs->indirect_info->polymorphic = 0;
1151 /* Analyze the CALL and examine uses of formal parameters of the caller NODE
1152 (described by INFO). PARMS_INFO is a pointer to a vector containing
1153 intermediate information about each formal parameter. Currently it checks
1154 whether the call calls a pointer that is a formal parameter and if so, the
1155 parameter is marked with the called flag and an indirect call graph edge
1156 describing the call is created. This is very simple for ordinary pointers
1157 represented in SSA but not-so-nice when it comes to member pointers. The
1158 ugly part of this function does nothing more than trying to match the
1159 pattern of such a call. An example of such a pattern is the gimple dump
1160 below, the call is on the last line:
1163 f$__delta_5 = f.__delta;
1164 f$__pfn_24 = f.__pfn;
1168 f$__delta_5 = MEM[(struct *)&f];
1169 f$__pfn_24 = MEM[(struct *)&f + 4B];
1171 and a few lines below:
1174 D.2496_3 = (int) f$__pfn_24;
1175 D.2497_4 = D.2496_3 & 1;
1182 D.2500_7 = (unsigned int) f$__delta_5;
1183 D.2501_8 = &S + D.2500_7;
1184 D.2502_9 = (int (*__vtbl_ptr_type) (void) * *) D.2501_8;
1185 D.2503_10 = *D.2502_9;
1186 D.2504_12 = f$__pfn_24 + -1;
1187 D.2505_13 = (unsigned int) D.2504_12;
1188 D.2506_14 = D.2503_10 + D.2505_13;
1189 D.2507_15 = *D.2506_14;
1190 iftmp.11_16 = (String:: *) D.2507_15;
1193 # iftmp.11_1 = PHI <iftmp.11_16(3), f$__pfn_24(2)>
1194 D.2500_19 = (unsigned int) f$__delta_5;
1195 D.2508_20 = &S + D.2500_19;
1196 D.2493_21 = iftmp.11_1 (D.2508_20, 4);
1198 Such patterns are results of simple calls to a member pointer:
1200 int doprinting (int (MyString::* f)(int) const)
1202 MyString S ("somestring");
1209 ipa_analyze_indirect_call_uses (struct cgraph_node *node,
1210 struct ipa_node_params *info,
1211 struct param_analysis_info *parms_info,
1212 gimple call, tree target)
1217 tree rec, rec2, cond;
1220 basic_block bb, virt_bb, join;
1222 if (SSA_NAME_IS_DEFAULT_DEF (target))
1224 tree var = SSA_NAME_VAR (target);
1225 index = ipa_get_param_decl_index (info, var);
1227 ipa_note_param_call (node, index, call);
1231 /* Now we need to try to match the complex pattern of calling a member
1234 if (!POINTER_TYPE_P (TREE_TYPE (target))
1235 || TREE_CODE (TREE_TYPE (TREE_TYPE (target))) != METHOD_TYPE)
1238 def = SSA_NAME_DEF_STMT (target);
1239 if (gimple_code (def) != GIMPLE_PHI)
1242 if (gimple_phi_num_args (def) != 2)
1245 /* First, we need to check whether one of these is a load from a member
1246 pointer that is a parameter to this function. */
1247 n1 = PHI_ARG_DEF (def, 0);
1248 n2 = PHI_ARG_DEF (def, 1);
1249 if (!ipa_is_ssa_with_stmt_def (n1) || !ipa_is_ssa_with_stmt_def (n2))
1251 d1 = SSA_NAME_DEF_STMT (n1);
1252 d2 = SSA_NAME_DEF_STMT (n2);
1254 join = gimple_bb (def);
1255 if ((rec = ipa_get_stmt_member_ptr_load_param (d1, false)))
1257 if (ipa_get_stmt_member_ptr_load_param (d2, false))
1260 bb = EDGE_PRED (join, 0)->src;
1261 virt_bb = gimple_bb (d2);
1263 else if ((rec = ipa_get_stmt_member_ptr_load_param (d2, false)))
1265 bb = EDGE_PRED (join, 1)->src;
1266 virt_bb = gimple_bb (d1);
1271 /* Second, we need to check that the basic blocks are laid out in the way
1272 corresponding to the pattern. */
1274 if (!single_pred_p (virt_bb) || !single_succ_p (virt_bb)
1275 || single_pred (virt_bb) != bb
1276 || single_succ (virt_bb) != join)
1279 /* Third, let's see that the branching is done depending on the least
1280 significant bit of the pfn. */
1282 branch = last_stmt (bb);
1283 if (!branch || gimple_code (branch) != GIMPLE_COND)
1286 if ((gimple_cond_code (branch) != NE_EXPR
1287 && gimple_cond_code (branch) != EQ_EXPR)
1288 || !integer_zerop (gimple_cond_rhs (branch)))
1291 cond = gimple_cond_lhs (branch);
1292 if (!ipa_is_ssa_with_stmt_def (cond))
1295 def = SSA_NAME_DEF_STMT (cond);
1296 if (!is_gimple_assign (def)
1297 || gimple_assign_rhs_code (def) != BIT_AND_EXPR
1298 || !integer_onep (gimple_assign_rhs2 (def)))
1301 cond = gimple_assign_rhs1 (def);
1302 if (!ipa_is_ssa_with_stmt_def (cond))
1305 def = SSA_NAME_DEF_STMT (cond);
1307 if (is_gimple_assign (def)
1308 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (def)))
1310 cond = gimple_assign_rhs1 (def);
1311 if (!ipa_is_ssa_with_stmt_def (cond))
1313 def = SSA_NAME_DEF_STMT (cond);
1316 rec2 = ipa_get_stmt_member_ptr_load_param (def,
1317 (TARGET_PTRMEMFUNC_VBIT_LOCATION
1318 == ptrmemfunc_vbit_in_delta));
1323 index = ipa_get_param_decl_index (info, rec);
1324 if (index >= 0 && !is_parm_modified_before_call (&parms_info[index],
1326 ipa_note_param_call (node, index, call);
1331 /* Analyze a CALL to an OBJ_TYPE_REF which is passed in TARGET and if the
1332 object referenced in the expression is a formal parameter of the caller
1333 (described by INFO), create a call note for the statement. */
1336 ipa_analyze_virtual_call_uses (struct cgraph_node *node,
1337 struct ipa_node_params *info, gimple call,
1340 struct cgraph_edge *cs;
1341 struct cgraph_indirect_call_info *ii;
1342 struct ipa_jump_func jfunc;
1343 tree obj = OBJ_TYPE_REF_OBJECT (target);
1345 HOST_WIDE_INT anc_offset;
1347 if (!flag_devirtualize)
1350 if (TREE_CODE (obj) != SSA_NAME)
1353 if (SSA_NAME_IS_DEFAULT_DEF (obj))
1355 if (TREE_CODE (SSA_NAME_VAR (obj)) != PARM_DECL)
1359 index = ipa_get_param_decl_index (info, SSA_NAME_VAR (obj));
1360 gcc_assert (index >= 0);
1361 if (detect_type_change_ssa (obj, call, &jfunc))
1366 gimple stmt = SSA_NAME_DEF_STMT (obj);
1369 expr = get_ancestor_addr_info (stmt, &obj, &anc_offset);
1372 index = ipa_get_param_decl_index (info,
1373 SSA_NAME_VAR (TREE_OPERAND (expr, 0)));
1374 gcc_assert (index >= 0);
1375 if (detect_type_change (obj, expr, call, &jfunc, anc_offset))
1379 cs = ipa_note_param_call (node, index, call);
1380 ii = cs->indirect_info;
1381 ii->anc_offset = anc_offset;
1382 ii->otr_token = tree_low_cst (OBJ_TYPE_REF_TOKEN (target), 1);
1383 ii->otr_type = TREE_TYPE (TREE_TYPE (OBJ_TYPE_REF_OBJECT (target)));
1384 ii->polymorphic = 1;
1387 /* Analyze a call statement CALL whether and how it utilizes formal parameters
1388 of the caller (described by INFO). PARMS_INFO is a pointer to a vector
1389 containing intermediate information about each formal parameter. */
1392 ipa_analyze_call_uses (struct cgraph_node *node,
1393 struct ipa_node_params *info,
1394 struct param_analysis_info *parms_info, gimple call)
1396 tree target = gimple_call_fn (call);
1400 if (TREE_CODE (target) == SSA_NAME)
1401 ipa_analyze_indirect_call_uses (node, info, parms_info, call, target);
1402 else if (TREE_CODE (target) == OBJ_TYPE_REF)
1403 ipa_analyze_virtual_call_uses (node, info, call, target);
1407 /* Analyze the call statement STMT with respect to formal parameters (described
1408 in INFO) of caller given by NODE. Currently it only checks whether formal
1409 parameters are called. PARMS_INFO is a pointer to a vector containing
1410 intermediate information about each formal parameter. */
1413 ipa_analyze_stmt_uses (struct cgraph_node *node, struct ipa_node_params *info,
1414 struct param_analysis_info *parms_info, gimple stmt)
1416 if (is_gimple_call (stmt))
1417 ipa_analyze_call_uses (node, info, parms_info, stmt);
1420 /* Callback of walk_stmt_load_store_addr_ops for the visit_load.
1421 If OP is a parameter declaration, mark it as used in the info structure
1425 visit_ref_for_mod_analysis (gimple stmt ATTRIBUTE_UNUSED,
1426 tree op, void *data)
1428 struct ipa_node_params *info = (struct ipa_node_params *) data;
1430 op = get_base_address (op);
1432 && TREE_CODE (op) == PARM_DECL)
1434 int index = ipa_get_param_decl_index (info, op);
1435 gcc_assert (index >= 0);
1436 ipa_set_param_used (info, index, true);
1442 /* Scan the function body of NODE and inspect the uses of formal parameters.
1443 Store the findings in various structures of the associated ipa_node_params
1444 structure, such as parameter flags, notes etc. PARMS_INFO is a pointer to a
1445 vector containing intermediate information about each formal parameter. */
1448 ipa_analyze_params_uses (struct cgraph_node *node,
1449 struct param_analysis_info *parms_info)
1451 tree decl = node->decl;
1453 struct function *func;
1454 gimple_stmt_iterator gsi;
1455 struct ipa_node_params *info = IPA_NODE_REF (node);
1458 if (ipa_get_param_count (info) == 0 || info->uses_analysis_done)
1461 for (i = 0; i < ipa_get_param_count (info); i++)
1463 tree parm = ipa_get_param (info, i);
1464 /* For SSA regs see if parameter is used. For non-SSA we compute
1465 the flag during modification analysis. */
1466 if (is_gimple_reg (parm)
1467 && gimple_default_def (DECL_STRUCT_FUNCTION (node->decl), parm))
1468 ipa_set_param_used (info, i, true);
1471 func = DECL_STRUCT_FUNCTION (decl);
1472 FOR_EACH_BB_FN (bb, func)
1474 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1476 gimple stmt = gsi_stmt (gsi);
1478 if (is_gimple_debug (stmt))
1481 ipa_analyze_stmt_uses (node, info, parms_info, stmt);
1482 walk_stmt_load_store_addr_ops (stmt, info,
1483 visit_ref_for_mod_analysis,
1484 visit_ref_for_mod_analysis,
1485 visit_ref_for_mod_analysis);
1487 for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi))
1488 walk_stmt_load_store_addr_ops (gsi_stmt (gsi), info,
1489 visit_ref_for_mod_analysis,
1490 visit_ref_for_mod_analysis,
1491 visit_ref_for_mod_analysis);
1494 info->uses_analysis_done = 1;
1497 /* Initialize the array describing properties of of formal parameters
1498 of NODE, analyze their uses and compute jump functions associated
1499 with actual arguments of calls from within NODE. */
1502 ipa_analyze_node (struct cgraph_node *node)
1504 struct ipa_node_params *info;
1505 struct param_analysis_info *parms_info;
1508 ipa_check_create_node_params ();
1509 ipa_check_create_edge_args ();
1510 info = IPA_NODE_REF (node);
1511 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
1512 current_function_decl = node->decl;
1513 ipa_initialize_node_params (node);
1515 param_count = ipa_get_param_count (info);
1516 parms_info = XALLOCAVEC (struct param_analysis_info, param_count);
1517 memset (parms_info, 0, sizeof (struct param_analysis_info) * param_count);
1519 ipa_analyze_params_uses (node, parms_info);
1520 ipa_compute_jump_functions (node, parms_info);
1522 for (i = 0; i < param_count; i++)
1523 if (parms_info[i].visited_statements)
1524 BITMAP_FREE (parms_info[i].visited_statements);
1526 current_function_decl = NULL;
1531 /* Update the jump function DST when the call graph edge corresponding to SRC is
1532 is being inlined, knowing that DST is of type ancestor and src of known
1536 combine_known_type_and_ancestor_jfs (struct ipa_jump_func *src,
1537 struct ipa_jump_func *dst)
1541 new_binfo = get_binfo_at_offset (src->value.base_binfo,
1542 dst->value.ancestor.offset,
1543 dst->value.ancestor.type);
1546 dst->type = IPA_JF_KNOWN_TYPE;
1547 dst->value.base_binfo = new_binfo;
1550 dst->type = IPA_JF_UNKNOWN;
1553 /* Update the jump functions associated with call graph edge E when the call
1554 graph edge CS is being inlined, assuming that E->caller is already (possibly
1555 indirectly) inlined into CS->callee and that E has not been inlined. */
1558 update_jump_functions_after_inlining (struct cgraph_edge *cs,
1559 struct cgraph_edge *e)
1561 struct ipa_edge_args *top = IPA_EDGE_REF (cs);
1562 struct ipa_edge_args *args = IPA_EDGE_REF (e);
1563 int count = ipa_get_cs_argument_count (args);
1566 for (i = 0; i < count; i++)
1568 struct ipa_jump_func *dst = ipa_get_ith_jump_func (args, i);
1570 if (dst->type == IPA_JF_ANCESTOR)
1572 struct ipa_jump_func *src;
1574 /* Variable number of arguments can cause havoc if we try to access
1575 one that does not exist in the inlined edge. So make sure we
1577 if (dst->value.ancestor.formal_id >= ipa_get_cs_argument_count (top))
1579 dst->type = IPA_JF_UNKNOWN;
1583 src = ipa_get_ith_jump_func (top, dst->value.ancestor.formal_id);
1584 if (src->type == IPA_JF_KNOWN_TYPE)
1585 combine_known_type_and_ancestor_jfs (src, dst);
1586 else if (src->type == IPA_JF_PASS_THROUGH
1587 && src->value.pass_through.operation == NOP_EXPR)
1588 dst->value.ancestor.formal_id = src->value.pass_through.formal_id;
1589 else if (src->type == IPA_JF_ANCESTOR)
1591 dst->value.ancestor.formal_id = src->value.ancestor.formal_id;
1592 dst->value.ancestor.offset += src->value.ancestor.offset;
1595 dst->type = IPA_JF_UNKNOWN;
1597 else if (dst->type == IPA_JF_PASS_THROUGH)
1599 struct ipa_jump_func *src;
1600 /* We must check range due to calls with variable number of arguments
1601 and we cannot combine jump functions with operations. */
1602 if (dst->value.pass_through.operation == NOP_EXPR
1603 && (dst->value.pass_through.formal_id
1604 < ipa_get_cs_argument_count (top)))
1606 src = ipa_get_ith_jump_func (top,
1607 dst->value.pass_through.formal_id);
1611 dst->type = IPA_JF_UNKNOWN;
1616 /* If TARGET is an addr_expr of a function declaration, make it the destination
1617 of an indirect edge IE and return the edge. Otherwise, return NULL. */
1619 struct cgraph_edge *
1620 ipa_make_edge_direct_to_target (struct cgraph_edge *ie, tree target)
1622 struct cgraph_node *callee;
1624 if (TREE_CODE (target) == ADDR_EXPR)
1625 target = TREE_OPERAND (target, 0);
1626 if (TREE_CODE (target) != FUNCTION_DECL)
1628 callee = cgraph_get_node (target);
1631 ipa_check_create_node_params ();
1633 /* We can not make edges to inline clones. It is bug that someone removed
1634 the cgraph node too early. */
1635 gcc_assert (!callee->global.inlined_to);
1637 cgraph_make_edge_direct (ie, callee);
1640 fprintf (dump_file, "ipa-prop: Discovered %s call to a known target "
1641 "(%s/%i -> %s/%i), for stmt ",
1642 ie->indirect_info->polymorphic ? "a virtual" : "an indirect",
1643 cgraph_node_name (ie->caller), ie->caller->uid,
1644 cgraph_node_name (ie->callee), ie->callee->uid);
1646 print_gimple_stmt (dump_file, ie->call_stmt, 2, TDF_SLIM);
1648 fprintf (dump_file, "with uid %i\n", ie->lto_stmt_uid);
1650 callee = cgraph_function_or_thunk_node (callee, NULL);
1652 if (ipa_get_cs_argument_count (IPA_EDGE_REF (ie))
1653 != ipa_get_param_count (IPA_NODE_REF (callee)))
1654 ipa_set_called_with_variable_arg (IPA_NODE_REF (callee));
1659 /* Try to find a destination for indirect edge IE that corresponds to a simple
1660 call or a call of a member function pointer and where the destination is a
1661 pointer formal parameter described by jump function JFUNC. If it can be
1662 determined, return the newly direct edge, otherwise return NULL. */
1664 static struct cgraph_edge *
1665 try_make_edge_direct_simple_call (struct cgraph_edge *ie,
1666 struct ipa_jump_func *jfunc)
1670 if (jfunc->type == IPA_JF_CONST)
1671 target = jfunc->value.constant;
1672 else if (jfunc->type == IPA_JF_CONST_MEMBER_PTR)
1673 target = jfunc->value.member_cst.pfn;
1677 return ipa_make_edge_direct_to_target (ie, target);
1680 /* Try to find a destination for indirect edge IE that corresponds to a
1681 virtual call based on a formal parameter which is described by jump
1682 function JFUNC and if it can be determined, make it direct and return the
1683 direct edge. Otherwise, return NULL. */
1685 static struct cgraph_edge *
1686 try_make_edge_direct_virtual_call (struct cgraph_edge *ie,
1687 struct ipa_jump_func *jfunc)
1689 tree binfo, type, target;
1690 HOST_WIDE_INT token;
1692 if (jfunc->type == IPA_JF_KNOWN_TYPE)
1693 binfo = jfunc->value.base_binfo;
1700 token = ie->indirect_info->otr_token;
1701 type = ie->indirect_info->otr_type;
1702 binfo = get_binfo_at_offset (binfo, ie->indirect_info->anc_offset, type);
1704 target = gimple_get_virt_method_for_binfo (token, binfo);
1709 return ipa_make_edge_direct_to_target (ie, target);
1714 /* Update the param called notes associated with NODE when CS is being inlined,
1715 assuming NODE is (potentially indirectly) inlined into CS->callee.
1716 Moreover, if the callee is discovered to be constant, create a new cgraph
1717 edge for it. Newly discovered indirect edges will be added to *NEW_EDGES,
1718 unless NEW_EDGES is NULL. Return true iff a new edge(s) were created. */
1721 update_indirect_edges_after_inlining (struct cgraph_edge *cs,
1722 struct cgraph_node *node,
1723 VEC (cgraph_edge_p, heap) **new_edges)
1725 struct ipa_edge_args *top;
1726 struct cgraph_edge *ie, *next_ie, *new_direct_edge;
1729 ipa_check_create_edge_args ();
1730 top = IPA_EDGE_REF (cs);
1732 for (ie = node->indirect_calls; ie; ie = next_ie)
1734 struct cgraph_indirect_call_info *ici = ie->indirect_info;
1735 struct ipa_jump_func *jfunc;
1737 next_ie = ie->next_callee;
1738 if (bitmap_bit_p (iinlining_processed_edges, ie->uid))
1741 /* If we ever use indirect edges for anything other than indirect
1742 inlining, we will need to skip those with negative param_indices. */
1743 if (ici->param_index == -1)
1746 /* We must check range due to calls with variable number of arguments: */
1747 if (ici->param_index >= ipa_get_cs_argument_count (top))
1749 bitmap_set_bit (iinlining_processed_edges, ie->uid);
1753 jfunc = ipa_get_ith_jump_func (top, ici->param_index);
1754 if (jfunc->type == IPA_JF_PASS_THROUGH
1755 && jfunc->value.pass_through.operation == NOP_EXPR)
1756 ici->param_index = jfunc->value.pass_through.formal_id;
1757 else if (jfunc->type == IPA_JF_ANCESTOR)
1759 ici->param_index = jfunc->value.ancestor.formal_id;
1760 ici->anc_offset += jfunc->value.ancestor.offset;
1763 /* Either we can find a destination for this edge now or never. */
1764 bitmap_set_bit (iinlining_processed_edges, ie->uid);
1766 if (ici->polymorphic)
1767 new_direct_edge = try_make_edge_direct_virtual_call (ie, jfunc);
1769 new_direct_edge = try_make_edge_direct_simple_call (ie, jfunc);
1771 if (new_direct_edge)
1773 new_direct_edge->indirect_inlining_edge = 1;
1776 VEC_safe_push (cgraph_edge_p, heap, *new_edges,
1778 top = IPA_EDGE_REF (cs);
1787 /* Recursively traverse subtree of NODE (including node) made of inlined
1788 cgraph_edges when CS has been inlined and invoke
1789 update_indirect_edges_after_inlining on all nodes and
1790 update_jump_functions_after_inlining on all non-inlined edges that lead out
1791 of this subtree. Newly discovered indirect edges will be added to
1792 *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were
1796 propagate_info_to_inlined_callees (struct cgraph_edge *cs,
1797 struct cgraph_node *node,
1798 VEC (cgraph_edge_p, heap) **new_edges)
1800 struct cgraph_edge *e;
1803 res = update_indirect_edges_after_inlining (cs, node, new_edges);
1805 for (e = node->callees; e; e = e->next_callee)
1806 if (!e->inline_failed)
1807 res |= propagate_info_to_inlined_callees (cs, e->callee, new_edges);
1809 update_jump_functions_after_inlining (cs, e);
1814 /* Update jump functions and call note functions on inlining the call site CS.
1815 CS is expected to lead to a node already cloned by
1816 cgraph_clone_inline_nodes. Newly discovered indirect edges will be added to
1817 *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were +
1821 ipa_propagate_indirect_call_infos (struct cgraph_edge *cs,
1822 VEC (cgraph_edge_p, heap) **new_edges)
1824 /* Do nothing if the preparation phase has not been carried out yet
1825 (i.e. during early inlining). */
1826 if (!ipa_node_params_vector)
1828 gcc_assert (ipa_edge_args_vector);
1830 return propagate_info_to_inlined_callees (cs, cs->callee, new_edges);
1833 /* Frees all dynamically allocated structures that the argument info points
1837 ipa_free_edge_args_substructures (struct ipa_edge_args *args)
1839 if (args->jump_functions)
1840 ggc_free (args->jump_functions);
1842 memset (args, 0, sizeof (*args));
1845 /* Free all ipa_edge structures. */
1848 ipa_free_all_edge_args (void)
1851 struct ipa_edge_args *args;
1853 FOR_EACH_VEC_ELT (ipa_edge_args_t, ipa_edge_args_vector, i, args)
1854 ipa_free_edge_args_substructures (args);
1856 VEC_free (ipa_edge_args_t, gc, ipa_edge_args_vector);
1857 ipa_edge_args_vector = NULL;
1860 /* Frees all dynamically allocated structures that the param info points
1864 ipa_free_node_params_substructures (struct ipa_node_params *info)
1866 VEC_free (ipa_param_descriptor_t, heap, info->descriptors);
1867 free (info->lattices);
1868 /* Lattice values and their sources are deallocated with their alocation
1870 VEC_free (tree, heap, info->known_vals);
1871 memset (info, 0, sizeof (*info));
1874 /* Free all ipa_node_params structures. */
1877 ipa_free_all_node_params (void)
1880 struct ipa_node_params *info;
1882 FOR_EACH_VEC_ELT (ipa_node_params_t, ipa_node_params_vector, i, info)
1883 ipa_free_node_params_substructures (info);
1885 VEC_free (ipa_node_params_t, heap, ipa_node_params_vector);
1886 ipa_node_params_vector = NULL;
1889 /* Hook that is called by cgraph.c when an edge is removed. */
1892 ipa_edge_removal_hook (struct cgraph_edge *cs, void *data ATTRIBUTE_UNUSED)
1894 /* During IPA-CP updating we can be called on not-yet analyze clones. */
1895 if (VEC_length (ipa_edge_args_t, ipa_edge_args_vector)
1896 <= (unsigned)cs->uid)
1898 ipa_free_edge_args_substructures (IPA_EDGE_REF (cs));
1901 /* Hook that is called by cgraph.c when a node is removed. */
1904 ipa_node_removal_hook (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
1906 /* During IPA-CP updating we can be called on not-yet analyze clones. */
1907 if (VEC_length (ipa_node_params_t, ipa_node_params_vector)
1908 <= (unsigned)node->uid)
1910 ipa_free_node_params_substructures (IPA_NODE_REF (node));
1913 static struct ipa_jump_func *
1914 duplicate_ipa_jump_func_array (const struct ipa_jump_func * src, size_t n)
1916 struct ipa_jump_func *p;
1921 p = ggc_alloc_vec_ipa_jump_func (n);
1922 memcpy (p, src, n * sizeof (struct ipa_jump_func));
1926 /* Hook that is called by cgraph.c when a node is duplicated. */
1929 ipa_edge_duplication_hook (struct cgraph_edge *src, struct cgraph_edge *dst,
1930 __attribute__((unused)) void *data)
1932 struct ipa_edge_args *old_args, *new_args;
1935 ipa_check_create_edge_args ();
1937 old_args = IPA_EDGE_REF (src);
1938 new_args = IPA_EDGE_REF (dst);
1940 arg_count = ipa_get_cs_argument_count (old_args);
1941 ipa_set_cs_argument_count (new_args, arg_count);
1942 new_args->jump_functions =
1943 duplicate_ipa_jump_func_array (old_args->jump_functions, arg_count);
1945 if (iinlining_processed_edges
1946 && bitmap_bit_p (iinlining_processed_edges, src->uid))
1947 bitmap_set_bit (iinlining_processed_edges, dst->uid);
1950 /* Hook that is called by cgraph.c when a node is duplicated. */
1953 ipa_node_duplication_hook (struct cgraph_node *src, struct cgraph_node *dst,
1954 ATTRIBUTE_UNUSED void *data)
1956 struct ipa_node_params *old_info, *new_info;
1958 ipa_check_create_node_params ();
1959 old_info = IPA_NODE_REF (src);
1960 new_info = IPA_NODE_REF (dst);
1962 new_info->descriptors = VEC_copy (ipa_param_descriptor_t, heap,
1963 old_info->descriptors);
1964 new_info->lattices = NULL;
1965 new_info->ipcp_orig_node = old_info->ipcp_orig_node;
1967 new_info->called_with_var_arguments = old_info->called_with_var_arguments;
1968 new_info->uses_analysis_done = old_info->uses_analysis_done;
1969 new_info->node_enqueued = old_info->node_enqueued;
1973 /* Analyze newly added function into callgraph. */
1976 ipa_add_new_function (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED)
1978 ipa_analyze_node (node);
1981 /* Register our cgraph hooks if they are not already there. */
1984 ipa_register_cgraph_hooks (void)
1986 if (!edge_removal_hook_holder)
1987 edge_removal_hook_holder =
1988 cgraph_add_edge_removal_hook (&ipa_edge_removal_hook, NULL);
1989 if (!node_removal_hook_holder)
1990 node_removal_hook_holder =
1991 cgraph_add_node_removal_hook (&ipa_node_removal_hook, NULL);
1992 if (!edge_duplication_hook_holder)
1993 edge_duplication_hook_holder =
1994 cgraph_add_edge_duplication_hook (&ipa_edge_duplication_hook, NULL);
1995 if (!node_duplication_hook_holder)
1996 node_duplication_hook_holder =
1997 cgraph_add_node_duplication_hook (&ipa_node_duplication_hook, NULL);
1998 function_insertion_hook_holder =
1999 cgraph_add_function_insertion_hook (&ipa_add_new_function, NULL);
2002 /* Unregister our cgraph hooks if they are not already there. */
2005 ipa_unregister_cgraph_hooks (void)
2007 cgraph_remove_edge_removal_hook (edge_removal_hook_holder);
2008 edge_removal_hook_holder = NULL;
2009 cgraph_remove_node_removal_hook (node_removal_hook_holder);
2010 node_removal_hook_holder = NULL;
2011 cgraph_remove_edge_duplication_hook (edge_duplication_hook_holder);
2012 edge_duplication_hook_holder = NULL;
2013 cgraph_remove_node_duplication_hook (node_duplication_hook_holder);
2014 node_duplication_hook_holder = NULL;
2015 cgraph_remove_function_insertion_hook (function_insertion_hook_holder);
2016 function_insertion_hook_holder = NULL;
2019 /* Allocate all necessary data structures necessary for indirect inlining. */
2022 ipa_create_all_structures_for_iinln (void)
2024 iinlining_processed_edges = BITMAP_ALLOC (NULL);
2027 /* Free all ipa_node_params and all ipa_edge_args structures if they are no
2028 longer needed after ipa-cp. */
2031 ipa_free_all_structures_after_ipa_cp (void)
2033 if (!flag_indirect_inlining)
2035 ipa_free_all_edge_args ();
2036 ipa_free_all_node_params ();
2037 free_alloc_pool (ipcp_sources_pool);
2038 free_alloc_pool (ipcp_values_pool);
2039 ipa_unregister_cgraph_hooks ();
2043 /* Free all ipa_node_params and all ipa_edge_args structures if they are no
2044 longer needed after indirect inlining. */
2047 ipa_free_all_structures_after_iinln (void)
2049 BITMAP_FREE (iinlining_processed_edges);
2051 ipa_free_all_edge_args ();
2052 ipa_free_all_node_params ();
2053 ipa_unregister_cgraph_hooks ();
2054 if (ipcp_sources_pool)
2055 free_alloc_pool (ipcp_sources_pool);
2056 if (ipcp_values_pool)
2057 free_alloc_pool (ipcp_values_pool);
2060 /* Print ipa_tree_map data structures of all functions in the
2064 ipa_print_node_params (FILE * f, struct cgraph_node *node)
2068 struct ipa_node_params *info;
2070 if (!node->analyzed)
2072 info = IPA_NODE_REF (node);
2073 fprintf (f, " function %s parameter descriptors:\n",
2074 cgraph_node_name (node));
2075 count = ipa_get_param_count (info);
2076 for (i = 0; i < count; i++)
2078 temp = ipa_get_param (info, i);
2079 if (TREE_CODE (temp) == PARM_DECL)
2080 fprintf (f, " param %d : %s", i,
2082 ? (*lang_hooks.decl_printable_name) (temp, 2)
2084 if (ipa_is_param_used (info, i))
2085 fprintf (f, " used");
2090 /* Print ipa_tree_map data structures of all functions in the
2094 ipa_print_all_params (FILE * f)
2096 struct cgraph_node *node;
2098 fprintf (f, "\nFunction parameters:\n");
2099 for (node = cgraph_nodes; node; node = node->next)
2100 ipa_print_node_params (f, node);
2103 /* Return a heap allocated vector containing formal parameters of FNDECL. */
2106 ipa_get_vector_of_formal_parms (tree fndecl)
2108 VEC(tree, heap) *args;
2112 count = count_formal_params (fndecl);
2113 args = VEC_alloc (tree, heap, count);
2114 for (parm = DECL_ARGUMENTS (fndecl); parm; parm = DECL_CHAIN (parm))
2115 VEC_quick_push (tree, args, parm);
2120 /* Return a heap allocated vector containing types of formal parameters of
2121 function type FNTYPE. */
2123 static inline VEC(tree, heap) *
2124 get_vector_of_formal_parm_types (tree fntype)
2126 VEC(tree, heap) *types;
2130 for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t))
2133 types = VEC_alloc (tree, heap, count);
2134 for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t))
2135 VEC_quick_push (tree, types, TREE_VALUE (t));
2140 /* Modify the function declaration FNDECL and its type according to the plan in
2141 ADJUSTMENTS. It also sets base fields of individual adjustments structures
2142 to reflect the actual parameters being modified which are determined by the
2143 base_index field. */
2146 ipa_modify_formal_parameters (tree fndecl, ipa_parm_adjustment_vec adjustments,
2147 const char *synth_parm_prefix)
2149 VEC(tree, heap) *oparms, *otypes;
2150 tree orig_type, new_type = NULL;
2151 tree old_arg_types, t, new_arg_types = NULL;
2152 tree parm, *link = &DECL_ARGUMENTS (fndecl);
2153 int i, len = VEC_length (ipa_parm_adjustment_t, adjustments);
2154 tree new_reversed = NULL;
2155 bool care_for_types, last_parm_void;
2157 if (!synth_parm_prefix)
2158 synth_parm_prefix = "SYNTH";
2160 oparms = ipa_get_vector_of_formal_parms (fndecl);
2161 orig_type = TREE_TYPE (fndecl);
2162 old_arg_types = TYPE_ARG_TYPES (orig_type);
2164 /* The following test is an ugly hack, some functions simply don't have any
2165 arguments in their type. This is probably a bug but well... */
2166 care_for_types = (old_arg_types != NULL_TREE);
2169 last_parm_void = (TREE_VALUE (tree_last (old_arg_types))
2171 otypes = get_vector_of_formal_parm_types (orig_type);
2173 gcc_assert (VEC_length (tree, oparms) + 1 == VEC_length (tree, otypes));
2175 gcc_assert (VEC_length (tree, oparms) == VEC_length (tree, otypes));
2179 last_parm_void = false;
2183 for (i = 0; i < len; i++)
2185 struct ipa_parm_adjustment *adj;
2188 adj = VEC_index (ipa_parm_adjustment_t, adjustments, i);
2189 parm = VEC_index (tree, oparms, adj->base_index);
2192 if (adj->copy_param)
2195 new_arg_types = tree_cons (NULL_TREE, VEC_index (tree, otypes,
2199 link = &DECL_CHAIN (parm);
2201 else if (!adj->remove_param)
2207 ptype = build_pointer_type (adj->type);
2212 new_arg_types = tree_cons (NULL_TREE, ptype, new_arg_types);
2214 new_parm = build_decl (UNKNOWN_LOCATION, PARM_DECL, NULL_TREE,
2216 DECL_NAME (new_parm) = create_tmp_var_name (synth_parm_prefix);
2218 DECL_ARTIFICIAL (new_parm) = 1;
2219 DECL_ARG_TYPE (new_parm) = ptype;
2220 DECL_CONTEXT (new_parm) = fndecl;
2221 TREE_USED (new_parm) = 1;
2222 DECL_IGNORED_P (new_parm) = 1;
2223 layout_decl (new_parm, 0);
2225 add_referenced_var (new_parm);
2226 mark_sym_for_renaming (new_parm);
2228 adj->reduction = new_parm;
2232 link = &DECL_CHAIN (new_parm);
2240 new_reversed = nreverse (new_arg_types);
2244 TREE_CHAIN (new_arg_types) = void_list_node;
2246 new_reversed = void_list_node;
2250 /* Use copy_node to preserve as much as possible from original type
2251 (debug info, attribute lists etc.)
2252 Exception is METHOD_TYPEs must have THIS argument.
2253 When we are asked to remove it, we need to build new FUNCTION_TYPE
2255 if (TREE_CODE (orig_type) != METHOD_TYPE
2256 || (VEC_index (ipa_parm_adjustment_t, adjustments, 0)->copy_param
2257 && VEC_index (ipa_parm_adjustment_t, adjustments, 0)->base_index == 0))
2259 new_type = build_distinct_type_copy (orig_type);
2260 TYPE_ARG_TYPES (new_type) = new_reversed;
2265 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type),
2267 TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type);
2268 DECL_VINDEX (fndecl) = NULL_TREE;
2271 /* When signature changes, we need to clear builtin info. */
2272 if (DECL_BUILT_IN (fndecl))
2274 DECL_BUILT_IN_CLASS (fndecl) = NOT_BUILT_IN;
2275 DECL_FUNCTION_CODE (fndecl) = (enum built_in_function) 0;
2278 /* This is a new type, not a copy of an old type. Need to reassociate
2279 variants. We can handle everything except the main variant lazily. */
2280 t = TYPE_MAIN_VARIANT (orig_type);
2283 TYPE_MAIN_VARIANT (new_type) = t;
2284 TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t);
2285 TYPE_NEXT_VARIANT (t) = new_type;
2289 TYPE_MAIN_VARIANT (new_type) = new_type;
2290 TYPE_NEXT_VARIANT (new_type) = NULL;
2293 TREE_TYPE (fndecl) = new_type;
2294 DECL_VIRTUAL_P (fndecl) = 0;
2296 VEC_free (tree, heap, otypes);
2297 VEC_free (tree, heap, oparms);
2300 /* Modify actual arguments of a function call CS as indicated in ADJUSTMENTS.
2301 If this is a directly recursive call, CS must be NULL. Otherwise it must
2302 contain the corresponding call graph edge. */
2305 ipa_modify_call_arguments (struct cgraph_edge *cs, gimple stmt,
2306 ipa_parm_adjustment_vec adjustments)
2308 VEC(tree, heap) *vargs;
2309 VEC(tree, gc) **debug_args = NULL;
2311 gimple_stmt_iterator gsi;
2315 len = VEC_length (ipa_parm_adjustment_t, adjustments);
2316 vargs = VEC_alloc (tree, heap, len);
2317 callee_decl = !cs ? gimple_call_fndecl (stmt) : cs->callee->decl;
2319 gsi = gsi_for_stmt (stmt);
2320 for (i = 0; i < len; i++)
2322 struct ipa_parm_adjustment *adj;
2324 adj = VEC_index (ipa_parm_adjustment_t, adjustments, i);
2326 if (adj->copy_param)
2328 tree arg = gimple_call_arg (stmt, adj->base_index);
2330 VEC_quick_push (tree, vargs, arg);
2332 else if (!adj->remove_param)
2334 tree expr, base, off;
2337 /* We create a new parameter out of the value of the old one, we can
2338 do the following kind of transformations:
2340 - A scalar passed by reference is converted to a scalar passed by
2341 value. (adj->by_ref is false and the type of the original
2342 actual argument is a pointer to a scalar).
2344 - A part of an aggregate is passed instead of the whole aggregate.
2345 The part can be passed either by value or by reference, this is
2346 determined by value of adj->by_ref. Moreover, the code below
2347 handles both situations when the original aggregate is passed by
2348 value (its type is not a pointer) and when it is passed by
2349 reference (it is a pointer to an aggregate).
2351 When the new argument is passed by reference (adj->by_ref is true)
2352 it must be a part of an aggregate and therefore we form it by
2353 simply taking the address of a reference inside the original
2356 gcc_checking_assert (adj->offset % BITS_PER_UNIT == 0);
2357 base = gimple_call_arg (stmt, adj->base_index);
2358 loc = EXPR_LOCATION (base);
2360 if (TREE_CODE (base) != ADDR_EXPR
2361 && POINTER_TYPE_P (TREE_TYPE (base)))
2362 off = build_int_cst (adj->alias_ptr_type,
2363 adj->offset / BITS_PER_UNIT);
2366 HOST_WIDE_INT base_offset;
2369 if (TREE_CODE (base) == ADDR_EXPR)
2370 base = TREE_OPERAND (base, 0);
2372 base = get_addr_base_and_unit_offset (base, &base_offset);
2373 /* Aggregate arguments can have non-invariant addresses. */
2376 base = build_fold_addr_expr (prev_base);
2377 off = build_int_cst (adj->alias_ptr_type,
2378 adj->offset / BITS_PER_UNIT);
2380 else if (TREE_CODE (base) == MEM_REF)
2382 off = build_int_cst (adj->alias_ptr_type,
2384 + adj->offset / BITS_PER_UNIT);
2385 off = int_const_binop (PLUS_EXPR, TREE_OPERAND (base, 1),
2387 base = TREE_OPERAND (base, 0);
2391 off = build_int_cst (adj->alias_ptr_type,
2393 + adj->offset / BITS_PER_UNIT);
2394 base = build_fold_addr_expr (base);
2398 expr = fold_build2_loc (loc, MEM_REF, adj->type, base, off);
2400 expr = build_fold_addr_expr (expr);
2402 expr = force_gimple_operand_gsi (&gsi, expr,
2404 || is_gimple_reg_type (adj->type),
2405 NULL, true, GSI_SAME_STMT);
2406 VEC_quick_push (tree, vargs, expr);
2408 if (!adj->copy_param && MAY_HAVE_DEBUG_STMTS)
2411 tree ddecl = NULL_TREE, origin = DECL_ORIGIN (adj->base), arg;
2414 arg = gimple_call_arg (stmt, adj->base_index);
2415 if (!useless_type_conversion_p (TREE_TYPE (origin), TREE_TYPE (arg)))
2417 if (!fold_convertible_p (TREE_TYPE (origin), arg))
2419 arg = fold_convert_loc (gimple_location (stmt),
2420 TREE_TYPE (origin), arg);
2422 if (debug_args == NULL)
2423 debug_args = decl_debug_args_insert (callee_decl);
2424 for (ix = 0; VEC_iterate (tree, *debug_args, ix, ddecl); ix += 2)
2425 if (ddecl == origin)
2427 ddecl = VEC_index (tree, *debug_args, ix + 1);
2432 ddecl = make_node (DEBUG_EXPR_DECL);
2433 DECL_ARTIFICIAL (ddecl) = 1;
2434 TREE_TYPE (ddecl) = TREE_TYPE (origin);
2435 DECL_MODE (ddecl) = DECL_MODE (origin);
2437 VEC_safe_push (tree, gc, *debug_args, origin);
2438 VEC_safe_push (tree, gc, *debug_args, ddecl);
2440 def_temp = gimple_build_debug_bind (ddecl, unshare_expr (arg),
2442 gsi_insert_before (&gsi, def_temp, GSI_SAME_STMT);
2446 if (dump_file && (dump_flags & TDF_DETAILS))
2448 fprintf (dump_file, "replacing stmt:");
2449 print_gimple_stmt (dump_file, gsi_stmt (gsi), 0, 0);
2452 new_stmt = gimple_build_call_vec (callee_decl, vargs);
2453 VEC_free (tree, heap, vargs);
2454 if (gimple_call_lhs (stmt))
2455 gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt));
2457 gimple_set_block (new_stmt, gimple_block (stmt));
2458 if (gimple_has_location (stmt))
2459 gimple_set_location (new_stmt, gimple_location (stmt));
2460 gimple_call_copy_flags (new_stmt, stmt);
2461 gimple_call_set_chain (new_stmt, gimple_call_chain (stmt));
2463 if (dump_file && (dump_flags & TDF_DETAILS))
2465 fprintf (dump_file, "with stmt:");
2466 print_gimple_stmt (dump_file, new_stmt, 0, 0);
2467 fprintf (dump_file, "\n");
2469 gsi_replace (&gsi, new_stmt, true);
2471 cgraph_set_call_stmt (cs, new_stmt);
2472 update_ssa (TODO_update_ssa);
2473 free_dominance_info (CDI_DOMINATORS);
2476 /* Return true iff BASE_INDEX is in ADJUSTMENTS more than once. */
2479 index_in_adjustments_multiple_times_p (int base_index,
2480 ipa_parm_adjustment_vec adjustments)
2482 int i, len = VEC_length (ipa_parm_adjustment_t, adjustments);
2485 for (i = 0; i < len; i++)
2487 struct ipa_parm_adjustment *adj;
2488 adj = VEC_index (ipa_parm_adjustment_t, adjustments, i);
2490 if (adj->base_index == base_index)
2502 /* Return adjustments that should have the same effect on function parameters
2503 and call arguments as if they were first changed according to adjustments in
2504 INNER and then by adjustments in OUTER. */
2506 ipa_parm_adjustment_vec
2507 ipa_combine_adjustments (ipa_parm_adjustment_vec inner,
2508 ipa_parm_adjustment_vec outer)
2510 int i, outlen = VEC_length (ipa_parm_adjustment_t, outer);
2511 int inlen = VEC_length (ipa_parm_adjustment_t, inner);
2513 ipa_parm_adjustment_vec adjustments, tmp;
2515 tmp = VEC_alloc (ipa_parm_adjustment_t, heap, inlen);
2516 for (i = 0; i < inlen; i++)
2518 struct ipa_parm_adjustment *n;
2519 n = VEC_index (ipa_parm_adjustment_t, inner, i);
2521 if (n->remove_param)
2524 VEC_quick_push (ipa_parm_adjustment_t, tmp, n);
2527 adjustments = VEC_alloc (ipa_parm_adjustment_t, heap, outlen + removals);
2528 for (i = 0; i < outlen; i++)
2530 struct ipa_parm_adjustment *r;
2531 struct ipa_parm_adjustment *out = VEC_index (ipa_parm_adjustment_t,
2533 struct ipa_parm_adjustment *in = VEC_index (ipa_parm_adjustment_t, tmp,
2536 gcc_assert (!in->remove_param);
2537 if (out->remove_param)
2539 if (!index_in_adjustments_multiple_times_p (in->base_index, tmp))
2541 r = VEC_quick_push (ipa_parm_adjustment_t, adjustments, NULL);
2542 memset (r, 0, sizeof (*r));
2543 r->remove_param = true;
2548 r = VEC_quick_push (ipa_parm_adjustment_t, adjustments, NULL);
2549 memset (r, 0, sizeof (*r));
2550 r->base_index = in->base_index;
2551 r->type = out->type;
2553 /* FIXME: Create nonlocal value too. */
2555 if (in->copy_param && out->copy_param)
2556 r->copy_param = true;
2557 else if (in->copy_param)
2558 r->offset = out->offset;
2559 else if (out->copy_param)
2560 r->offset = in->offset;
2562 r->offset = in->offset + out->offset;
2565 for (i = 0; i < inlen; i++)
2567 struct ipa_parm_adjustment *n = VEC_index (ipa_parm_adjustment_t,
2570 if (n->remove_param)
2571 VEC_quick_push (ipa_parm_adjustment_t, adjustments, n);
2574 VEC_free (ipa_parm_adjustment_t, heap, tmp);
2578 /* Dump the adjustments in the vector ADJUSTMENTS to dump_file in a human
2579 friendly way, assuming they are meant to be applied to FNDECL. */
2582 ipa_dump_param_adjustments (FILE *file, ipa_parm_adjustment_vec adjustments,
2585 int i, len = VEC_length (ipa_parm_adjustment_t, adjustments);
2587 VEC(tree, heap) *parms = ipa_get_vector_of_formal_parms (fndecl);
2589 fprintf (file, "IPA param adjustments: ");
2590 for (i = 0; i < len; i++)
2592 struct ipa_parm_adjustment *adj;
2593 adj = VEC_index (ipa_parm_adjustment_t, adjustments, i);
2596 fprintf (file, " ");
2600 fprintf (file, "%i. base_index: %i - ", i, adj->base_index);
2601 print_generic_expr (file, VEC_index (tree, parms, adj->base_index), 0);
2604 fprintf (file, ", base: ");
2605 print_generic_expr (file, adj->base, 0);
2609 fprintf (file, ", reduction: ");
2610 print_generic_expr (file, adj->reduction, 0);
2612 if (adj->new_ssa_base)
2614 fprintf (file, ", new_ssa_base: ");
2615 print_generic_expr (file, adj->new_ssa_base, 0);
2618 if (adj->copy_param)
2619 fprintf (file, ", copy_param");
2620 else if (adj->remove_param)
2621 fprintf (file, ", remove_param");
2623 fprintf (file, ", offset %li", (long) adj->offset);
2625 fprintf (file, ", by_ref");
2626 print_node_brief (file, ", type: ", adj->type, 0);
2627 fprintf (file, "\n");
2629 VEC_free (tree, heap, parms);
2632 /* Stream out jump function JUMP_FUNC to OB. */
2635 ipa_write_jump_function (struct output_block *ob,
2636 struct ipa_jump_func *jump_func)
2638 streamer_write_uhwi (ob, jump_func->type);
2640 switch (jump_func->type)
2642 case IPA_JF_UNKNOWN:
2644 case IPA_JF_KNOWN_TYPE:
2645 stream_write_tree (ob, jump_func->value.base_binfo, true);
2648 stream_write_tree (ob, jump_func->value.constant, true);
2650 case IPA_JF_PASS_THROUGH:
2651 stream_write_tree (ob, jump_func->value.pass_through.operand, true);
2652 streamer_write_uhwi (ob, jump_func->value.pass_through.formal_id);
2653 streamer_write_uhwi (ob, jump_func->value.pass_through.operation);
2655 case IPA_JF_ANCESTOR:
2656 streamer_write_uhwi (ob, jump_func->value.ancestor.offset);
2657 stream_write_tree (ob, jump_func->value.ancestor.type, true);
2658 streamer_write_uhwi (ob, jump_func->value.ancestor.formal_id);
2660 case IPA_JF_CONST_MEMBER_PTR:
2661 stream_write_tree (ob, jump_func->value.member_cst.pfn, true);
2662 stream_write_tree (ob, jump_func->value.member_cst.delta, false);
2667 /* Read in jump function JUMP_FUNC from IB. */
2670 ipa_read_jump_function (struct lto_input_block *ib,
2671 struct ipa_jump_func *jump_func,
2672 struct data_in *data_in)
2674 jump_func->type = (enum jump_func_type) streamer_read_uhwi (ib);
2676 switch (jump_func->type)
2678 case IPA_JF_UNKNOWN:
2680 case IPA_JF_KNOWN_TYPE:
2681 jump_func->value.base_binfo = stream_read_tree (ib, data_in);
2684 jump_func->value.constant = stream_read_tree (ib, data_in);
2686 case IPA_JF_PASS_THROUGH:
2687 jump_func->value.pass_through.operand = stream_read_tree (ib, data_in);
2688 jump_func->value.pass_through.formal_id = streamer_read_uhwi (ib);
2689 jump_func->value.pass_through.operation
2690 = (enum tree_code) streamer_read_uhwi (ib);
2692 case IPA_JF_ANCESTOR:
2693 jump_func->value.ancestor.offset = streamer_read_uhwi (ib);
2694 jump_func->value.ancestor.type = stream_read_tree (ib, data_in);
2695 jump_func->value.ancestor.formal_id = streamer_read_uhwi (ib);
2697 case IPA_JF_CONST_MEMBER_PTR:
2698 jump_func->value.member_cst.pfn = stream_read_tree (ib, data_in);
2699 jump_func->value.member_cst.delta = stream_read_tree (ib, data_in);
2704 /* Stream out parts of cgraph_indirect_call_info corresponding to CS that are
2705 relevant to indirect inlining to OB. */
2708 ipa_write_indirect_edge_info (struct output_block *ob,
2709 struct cgraph_edge *cs)
2711 struct cgraph_indirect_call_info *ii = cs->indirect_info;
2712 struct bitpack_d bp;
2714 streamer_write_hwi (ob, ii->param_index);
2715 streamer_write_hwi (ob, ii->anc_offset);
2716 bp = bitpack_create (ob->main_stream);
2717 bp_pack_value (&bp, ii->polymorphic, 1);
2718 streamer_write_bitpack (&bp);
2720 if (ii->polymorphic)
2722 streamer_write_hwi (ob, ii->otr_token);
2723 stream_write_tree (ob, ii->otr_type, true);
2727 /* Read in parts of cgraph_indirect_call_info corresponding to CS that are
2728 relevant to indirect inlining from IB. */
2731 ipa_read_indirect_edge_info (struct lto_input_block *ib,
2732 struct data_in *data_in ATTRIBUTE_UNUSED,
2733 struct cgraph_edge *cs)
2735 struct cgraph_indirect_call_info *ii = cs->indirect_info;
2736 struct bitpack_d bp;
2738 ii->param_index = (int) streamer_read_hwi (ib);
2739 ii->anc_offset = (HOST_WIDE_INT) streamer_read_hwi (ib);
2740 bp = streamer_read_bitpack (ib);
2741 ii->polymorphic = bp_unpack_value (&bp, 1);
2742 if (ii->polymorphic)
2744 ii->otr_token = (HOST_WIDE_INT) streamer_read_hwi (ib);
2745 ii->otr_type = stream_read_tree (ib, data_in);
2749 /* Stream out NODE info to OB. */
2752 ipa_write_node_info (struct output_block *ob, struct cgraph_node *node)
2755 lto_cgraph_encoder_t encoder;
2756 struct ipa_node_params *info = IPA_NODE_REF (node);
2758 struct cgraph_edge *e;
2759 struct bitpack_d bp;
2761 encoder = ob->decl_state->cgraph_node_encoder;
2762 node_ref = lto_cgraph_encoder_encode (encoder, node);
2763 streamer_write_uhwi (ob, node_ref);
2765 bp = bitpack_create (ob->main_stream);
2766 gcc_assert (info->uses_analysis_done
2767 || ipa_get_param_count (info) == 0);
2768 gcc_assert (!info->node_enqueued);
2769 gcc_assert (!info->ipcp_orig_node);
2770 for (j = 0; j < ipa_get_param_count (info); j++)
2771 bp_pack_value (&bp, ipa_is_param_used (info, j), 1);
2772 streamer_write_bitpack (&bp);
2773 for (e = node->callees; e; e = e->next_callee)
2775 struct ipa_edge_args *args = IPA_EDGE_REF (e);
2777 streamer_write_uhwi (ob, ipa_get_cs_argument_count (args));
2778 for (j = 0; j < ipa_get_cs_argument_count (args); j++)
2779 ipa_write_jump_function (ob, ipa_get_ith_jump_func (args, j));
2781 for (e = node->indirect_calls; e; e = e->next_callee)
2783 struct ipa_edge_args *args = IPA_EDGE_REF (e);
2785 streamer_write_uhwi (ob, ipa_get_cs_argument_count (args));
2786 for (j = 0; j < ipa_get_cs_argument_count (args); j++)
2787 ipa_write_jump_function (ob, ipa_get_ith_jump_func (args, j));
2788 ipa_write_indirect_edge_info (ob, e);
2792 /* Stream in NODE info from IB. */
2795 ipa_read_node_info (struct lto_input_block *ib, struct cgraph_node *node,
2796 struct data_in *data_in)
2798 struct ipa_node_params *info = IPA_NODE_REF (node);
2800 struct cgraph_edge *e;
2801 struct bitpack_d bp;
2803 ipa_initialize_node_params (node);
2805 bp = streamer_read_bitpack (ib);
2806 if (ipa_get_param_count (info) != 0)
2807 info->uses_analysis_done = true;
2808 info->node_enqueued = false;
2809 for (k = 0; k < ipa_get_param_count (info); k++)
2810 ipa_set_param_used (info, k, bp_unpack_value (&bp, 1));
2811 for (e = node->callees; e; e = e->next_callee)
2813 struct ipa_edge_args *args = IPA_EDGE_REF (e);
2814 int count = streamer_read_uhwi (ib);
2816 ipa_set_cs_argument_count (args, count);
2820 args->jump_functions = ggc_alloc_cleared_vec_ipa_jump_func
2821 (ipa_get_cs_argument_count (args));
2822 for (k = 0; k < ipa_get_cs_argument_count (args); k++)
2823 ipa_read_jump_function (ib, ipa_get_ith_jump_func (args, k), data_in);
2825 for (e = node->indirect_calls; e; e = e->next_callee)
2827 struct ipa_edge_args *args = IPA_EDGE_REF (e);
2828 int count = streamer_read_uhwi (ib);
2830 ipa_set_cs_argument_count (args, count);
2833 args->jump_functions = ggc_alloc_cleared_vec_ipa_jump_func
2834 (ipa_get_cs_argument_count (args));
2835 for (k = 0; k < ipa_get_cs_argument_count (args); k++)
2836 ipa_read_jump_function (ib, ipa_get_ith_jump_func (args, k), data_in);
2838 ipa_read_indirect_edge_info (ib, data_in, e);
2842 /* Write jump functions for nodes in SET. */
2845 ipa_prop_write_jump_functions (cgraph_node_set set)
2847 struct cgraph_node *node;
2848 struct output_block *ob;
2849 unsigned int count = 0;
2850 cgraph_node_set_iterator csi;
2852 if (!ipa_node_params_vector)
2855 ob = create_output_block (LTO_section_jump_functions);
2856 ob->cgraph_node = NULL;
2857 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2859 node = csi_node (csi);
2860 if (cgraph_function_with_gimple_body_p (node)
2861 && IPA_NODE_REF (node) != NULL)
2865 streamer_write_uhwi (ob, count);
2867 /* Process all of the functions. */
2868 for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi))
2870 node = csi_node (csi);
2871 if (cgraph_function_with_gimple_body_p (node)
2872 && IPA_NODE_REF (node) != NULL)
2873 ipa_write_node_info (ob, node);
2875 streamer_write_char_stream (ob->main_stream, 0);
2876 produce_asm (ob, NULL);
2877 destroy_output_block (ob);
2880 /* Read section in file FILE_DATA of length LEN with data DATA. */
2883 ipa_prop_read_section (struct lto_file_decl_data *file_data, const char *data,
2886 const struct lto_function_header *header =
2887 (const struct lto_function_header *) data;
2888 const int32_t cfg_offset = sizeof (struct lto_function_header);
2889 const int32_t main_offset = cfg_offset + header->cfg_size;
2890 const int32_t string_offset = main_offset + header->main_size;
2891 struct data_in *data_in;
2892 struct lto_input_block ib_main;
2896 LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0,
2900 lto_data_in_create (file_data, (const char *) data + string_offset,
2901 header->string_size, NULL);
2902 count = streamer_read_uhwi (&ib_main);
2904 for (i = 0; i < count; i++)
2907 struct cgraph_node *node;
2908 lto_cgraph_encoder_t encoder;
2910 index = streamer_read_uhwi (&ib_main);
2911 encoder = file_data->cgraph_node_encoder;
2912 node = lto_cgraph_encoder_deref (encoder, index);
2913 gcc_assert (node->analyzed);
2914 ipa_read_node_info (&ib_main, node, data_in);
2916 lto_free_section_data (file_data, LTO_section_jump_functions, NULL, data,
2918 lto_data_in_delete (data_in);
2921 /* Read ipcp jump functions. */
2924 ipa_prop_read_jump_functions (void)
2926 struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data ();
2927 struct lto_file_decl_data *file_data;
2930 ipa_check_create_node_params ();
2931 ipa_check_create_edge_args ();
2932 ipa_register_cgraph_hooks ();
2934 while ((file_data = file_data_vec[j++]))
2937 const char *data = lto_get_section_data (file_data, LTO_section_jump_functions, NULL, &len);
2940 ipa_prop_read_section (file_data, data, len);
2944 /* After merging units, we can get mismatch in argument counts.
2945 Also decl merging might've rendered parameter lists obsolete.
2946 Also compute called_with_variable_arg info. */
2949 ipa_update_after_lto_read (void)
2951 struct cgraph_node *node;
2952 struct cgraph_edge *cs;
2954 ipa_check_create_node_params ();
2955 ipa_check_create_edge_args ();
2957 for (node = cgraph_nodes; node; node = node->next)
2959 ipa_initialize_node_params (node);
2961 for (node = cgraph_nodes; node; node = node->next)
2963 for (cs = node->callees; cs; cs = cs->next_callee)
2965 struct cgraph_node *callee;
2967 callee = cgraph_function_or_thunk_node (cs->callee, NULL);
2968 if (ipa_get_cs_argument_count (IPA_EDGE_REF (cs))
2969 != ipa_get_param_count (IPA_NODE_REF (callee)))
2970 ipa_set_called_with_variable_arg (IPA_NODE_REF (callee));