]>
Commit | Line | Data |
---|---|---|
518dc859 | 1 | /* Interprocedural analyses. |
5624e564 | 2 | Copyright (C) 2005-2015 Free Software Foundation, Inc. |
518dc859 RL |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
518dc859 RL |
9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
518dc859 RL |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
60393bbc AM |
23 | #include "hash-set.h" |
24 | #include "machmode.h" | |
40e23961 MC |
25 | #include "vec.h" |
26 | #include "double-int.h" | |
27 | #include "input.h" | |
28 | #include "alias.h" | |
29 | #include "symtab.h" | |
30 | #include "options.h" | |
31 | #include "wide-int.h" | |
32 | #include "inchash.h" | |
33 | #include "tree.h" | |
34 | #include "fold-const.h" | |
35 | #include "predict.h" | |
60393bbc AM |
36 | #include "tm.h" |
37 | #include "hard-reg-set.h" | |
60393bbc AM |
38 | #include "function.h" |
39 | #include "dominance.h" | |
40 | #include "cfg.h" | |
2fb9a547 AM |
41 | #include "basic-block.h" |
42 | #include "tree-ssa-alias.h" | |
43 | #include "internal-fn.h" | |
44 | #include "gimple-fold.h" | |
45 | #include "tree-eh.h" | |
46 | #include "gimple-expr.h" | |
47 | #include "is-a.h" | |
18f429e2 | 48 | #include "gimple.h" |
36566b39 PK |
49 | #include "hashtab.h" |
50 | #include "rtl.h" | |
51 | #include "flags.h" | |
52 | #include "statistics.h" | |
53 | #include "real.h" | |
54 | #include "fixed-value.h" | |
55 | #include "insn-config.h" | |
56 | #include "expmed.h" | |
57 | #include "dojump.h" | |
58 | #include "explow.h" | |
59 | #include "calls.h" | |
60 | #include "emit-rtl.h" | |
61 | #include "varasm.h" | |
62 | #include "stmt.h" | |
d8a2d370 DN |
63 | #include "expr.h" |
64 | #include "stor-layout.h" | |
65 | #include "print-tree.h" | |
45b0be94 | 66 | #include "gimplify.h" |
5be5c238 | 67 | #include "gimple-iterator.h" |
18f429e2 | 68 | #include "gimplify-me.h" |
5be5c238 | 69 | #include "gimple-walk.h" |
518dc859 | 70 | #include "langhooks.h" |
518dc859 | 71 | #include "target.h" |
c582198b AM |
72 | #include "hash-map.h" |
73 | #include "plugin-api.h" | |
74 | #include "ipa-ref.h" | |
75 | #include "cgraph.h" | |
76 | #include "alloc-pool.h" | |
dd912cb8 | 77 | #include "symbol-summary.h" |
518dc859 | 78 | #include "ipa-prop.h" |
442b4905 AM |
79 | #include "bitmap.h" |
80 | #include "gimple-ssa.h" | |
81 | #include "tree-cfg.h" | |
82 | #include "tree-phinodes.h" | |
83 | #include "ssa-iterators.h" | |
84 | #include "tree-into-ssa.h" | |
85 | #include "tree-dfa.h" | |
518dc859 | 86 | #include "tree-pass.h" |
771578a0 | 87 | #include "tree-inline.h" |
0f378cb5 | 88 | #include "ipa-inline.h" |
3e293154 | 89 | #include "diagnostic.h" |
cf835838 | 90 | #include "gimple-pretty-print.h" |
fb3f88cc | 91 | #include "lto-streamer.h" |
f0efc7aa DN |
92 | #include "data-streamer.h" |
93 | #include "tree-streamer.h" | |
dfea20f1 | 94 | #include "params.h" |
450ad0cd | 95 | #include "ipa-utils.h" |
4df65a85 RB |
96 | #include "stringpool.h" |
97 | #include "tree-ssanames.h" | |
2b5f0895 | 98 | #include "dbgcnt.h" |
8aab5218 | 99 | #include "domwalk.h" |
9b2b7279 | 100 | #include "builtins.h" |
771578a0 | 101 | |
8aab5218 MJ |
102 | /* Intermediate information that we get from alias analysis about a particular |
103 | parameter in a particular basic_block. When a parameter or the memory it | |
104 | references is marked modified, we use that information in all dominatd | |
105 | blocks without cosulting alias analysis oracle. */ | |
062c604f | 106 | |
8aab5218 | 107 | struct param_aa_status |
062c604f | 108 | { |
8aab5218 MJ |
109 | /* Set when this structure contains meaningful information. If not, the |
110 | structure describing a dominating BB should be used instead. */ | |
111 | bool valid; | |
112 | ||
113 | /* Whether we have seen something which might have modified the data in | |
114 | question. PARM is for the parameter itself, REF is for data it points to | |
115 | but using the alias type of individual accesses and PT is the same thing | |
116 | but for computing aggregate pass-through functions using a very inclusive | |
117 | ao_ref. */ | |
8b7773a4 | 118 | bool parm_modified, ref_modified, pt_modified; |
8aab5218 MJ |
119 | }; |
120 | ||
121 | /* Information related to a given BB that used only when looking at function | |
122 | body. */ | |
123 | ||
124 | struct ipa_bb_info | |
125 | { | |
126 | /* Call graph edges going out of this BB. */ | |
d52f5295 | 127 | vec<cgraph_edge *> cg_edges; |
8aab5218 MJ |
128 | /* Alias analysis statuses of each formal parameter at this bb. */ |
129 | vec<param_aa_status> param_aa_statuses; | |
130 | }; | |
131 | ||
132 | /* Structure with global information that is only used when looking at function | |
133 | body. */ | |
134 | ||
135 | struct func_body_info | |
136 | { | |
137 | /* The node that is being analyzed. */ | |
138 | cgraph_node *node; | |
139 | ||
140 | /* Its info. */ | |
141 | struct ipa_node_params *info; | |
142 | ||
143 | /* Information about individual BBs. */ | |
144 | vec<ipa_bb_info> bb_infos; | |
145 | ||
146 | /* Number of parameters. */ | |
147 | int param_count; | |
148 | ||
149 | /* Number of statements already walked by when analyzing this function. */ | |
150 | unsigned int aa_walked; | |
062c604f MJ |
151 | }; |
152 | ||
dd912cb8 ML |
153 | /* Function summary where the parameter infos are actually stored. */ |
154 | ipa_node_params_t *ipa_node_params_sum = NULL; | |
04be694e MJ |
155 | /* Vector of IPA-CP transformation data for each clone. */ |
156 | vec<ipcp_transformation_summary, va_gc> *ipcp_transformations; | |
771578a0 | 157 | /* Vector where the parameter infos are actually stored. */ |
84562394 | 158 | vec<ipa_edge_args, va_gc> *ipa_edge_args_vector; |
771578a0 MJ |
159 | |
160 | /* Holders of ipa cgraph hooks: */ | |
e2c9111c | 161 | static struct cgraph_edge_hook_list *edge_removal_hook_holder; |
e2c9111c | 162 | static struct cgraph_2edge_hook_list *edge_duplication_hook_holder; |
40982661 | 163 | static struct cgraph_node_hook_list *function_insertion_hook_holder; |
518dc859 | 164 | |
4502fe8d MJ |
165 | /* Description of a reference to an IPA constant. */ |
166 | struct ipa_cst_ref_desc | |
167 | { | |
168 | /* Edge that corresponds to the statement which took the reference. */ | |
169 | struct cgraph_edge *cs; | |
170 | /* Linked list of duplicates created when call graph edges are cloned. */ | |
171 | struct ipa_cst_ref_desc *next_duplicate; | |
172 | /* Number of references in IPA structures, IPA_UNDESCRIBED_USE if the value | |
173 | if out of control. */ | |
174 | int refcount; | |
175 | }; | |
176 | ||
177 | /* Allocation pool for reference descriptions. */ | |
178 | ||
179 | static alloc_pool ipa_refdesc_pool; | |
180 | ||
5fe8e757 MJ |
181 | /* Return true if DECL_FUNCTION_SPECIFIC_OPTIMIZATION of the decl associated |
182 | with NODE should prevent us from analyzing it for the purposes of IPA-CP. */ | |
183 | ||
184 | static bool | |
185 | ipa_func_spec_opts_forbid_analysis_p (struct cgraph_node *node) | |
186 | { | |
67348ccc | 187 | tree fs_opts = DECL_FUNCTION_SPECIFIC_OPTIMIZATION (node->decl); |
5fe8e757 MJ |
188 | |
189 | if (!fs_opts) | |
190 | return false; | |
2bf86c84 | 191 | return !opt_for_fn (node->decl, optimize) || !opt_for_fn (node->decl, flag_ipa_cp); |
5fe8e757 MJ |
192 | } |
193 | ||
be95e2b9 MJ |
194 | /* Return index of the formal whose tree is PTREE in function which corresponds |
195 | to INFO. */ | |
196 | ||
d044dd17 | 197 | static int |
84562394 | 198 | ipa_get_param_decl_index_1 (vec<ipa_param_descriptor> descriptors, tree ptree) |
518dc859 RL |
199 | { |
200 | int i, count; | |
201 | ||
9771b263 | 202 | count = descriptors.length (); |
518dc859 | 203 | for (i = 0; i < count; i++) |
9771b263 | 204 | if (descriptors[i].decl == ptree) |
518dc859 RL |
205 | return i; |
206 | ||
207 | return -1; | |
208 | } | |
209 | ||
d044dd17 MJ |
210 | /* Return index of the formal whose tree is PTREE in function which corresponds |
211 | to INFO. */ | |
212 | ||
213 | int | |
214 | ipa_get_param_decl_index (struct ipa_node_params *info, tree ptree) | |
215 | { | |
216 | return ipa_get_param_decl_index_1 (info->descriptors, ptree); | |
217 | } | |
218 | ||
219 | /* Populate the param_decl field in parameter DESCRIPTORS that correspond to | |
220 | NODE. */ | |
be95e2b9 | 221 | |
f8e2a1ed MJ |
222 | static void |
223 | ipa_populate_param_decls (struct cgraph_node *node, | |
84562394 | 224 | vec<ipa_param_descriptor> &descriptors) |
518dc859 RL |
225 | { |
226 | tree fndecl; | |
227 | tree fnargs; | |
228 | tree parm; | |
229 | int param_num; | |
3e293154 | 230 | |
67348ccc | 231 | fndecl = node->decl; |
0e8853ee | 232 | gcc_assert (gimple_has_body_p (fndecl)); |
518dc859 RL |
233 | fnargs = DECL_ARGUMENTS (fndecl); |
234 | param_num = 0; | |
910ad8de | 235 | for (parm = fnargs; parm; parm = DECL_CHAIN (parm)) |
518dc859 | 236 | { |
9771b263 | 237 | descriptors[param_num].decl = parm; |
b4c9af96 RB |
238 | descriptors[param_num].move_cost = estimate_move_cost (TREE_TYPE (parm), |
239 | true); | |
518dc859 RL |
240 | param_num++; |
241 | } | |
242 | } | |
243 | ||
3f84bf08 MJ |
244 | /* Return how many formal parameters FNDECL has. */ |
245 | ||
fd29c024 | 246 | int |
310bc633 | 247 | count_formal_params (tree fndecl) |
3f84bf08 MJ |
248 | { |
249 | tree parm; | |
250 | int count = 0; | |
0e8853ee | 251 | gcc_assert (gimple_has_body_p (fndecl)); |
3f84bf08 | 252 | |
910ad8de | 253 | for (parm = DECL_ARGUMENTS (fndecl); parm; parm = DECL_CHAIN (parm)) |
3f84bf08 MJ |
254 | count++; |
255 | ||
256 | return count; | |
257 | } | |
258 | ||
0e8853ee JH |
259 | /* Return the declaration of Ith formal parameter of the function corresponding |
260 | to INFO. Note there is no setter function as this array is built just once | |
261 | using ipa_initialize_node_params. */ | |
262 | ||
263 | void | |
264 | ipa_dump_param (FILE *file, struct ipa_node_params *info, int i) | |
265 | { | |
266 | fprintf (file, "param #%i", i); | |
267 | if (info->descriptors[i].decl) | |
268 | { | |
269 | fprintf (file, " "); | |
270 | print_generic_expr (file, info->descriptors[i].decl, 0); | |
271 | } | |
272 | } | |
273 | ||
274 | /* Initialize the ipa_node_params structure associated with NODE | |
275 | to hold PARAM_COUNT parameters. */ | |
276 | ||
277 | void | |
278 | ipa_alloc_node_params (struct cgraph_node *node, int param_count) | |
279 | { | |
280 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
281 | ||
282 | if (!info->descriptors.exists () && param_count) | |
283 | info->descriptors.safe_grow_cleared (param_count); | |
284 | } | |
285 | ||
f8e2a1ed MJ |
286 | /* Initialize the ipa_node_params structure associated with NODE by counting |
287 | the function parameters, creating the descriptors and populating their | |
288 | param_decls. */ | |
be95e2b9 | 289 | |
f8e2a1ed MJ |
290 | void |
291 | ipa_initialize_node_params (struct cgraph_node *node) | |
292 | { | |
293 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
294 | ||
9771b263 | 295 | if (!info->descriptors.exists ()) |
f8e2a1ed | 296 | { |
67348ccc | 297 | ipa_alloc_node_params (node, count_formal_params (node->decl)); |
0e8853ee | 298 | ipa_populate_param_decls (node, info->descriptors); |
f8e2a1ed | 299 | } |
518dc859 RL |
300 | } |
301 | ||
749aa96d MJ |
302 | /* Print the jump functions associated with call graph edge CS to file F. */ |
303 | ||
304 | static void | |
305 | ipa_print_node_jump_functions_for_edge (FILE *f, struct cgraph_edge *cs) | |
306 | { | |
307 | int i, count; | |
308 | ||
309 | count = ipa_get_cs_argument_count (IPA_EDGE_REF (cs)); | |
310 | for (i = 0; i < count; i++) | |
311 | { | |
312 | struct ipa_jump_func *jump_func; | |
313 | enum jump_func_type type; | |
314 | ||
315 | jump_func = ipa_get_ith_jump_func (IPA_EDGE_REF (cs), i); | |
316 | type = jump_func->type; | |
317 | ||
318 | fprintf (f, " param %d: ", i); | |
319 | if (type == IPA_JF_UNKNOWN) | |
320 | fprintf (f, "UNKNOWN\n"); | |
749aa96d MJ |
321 | else if (type == IPA_JF_CONST) |
322 | { | |
4502fe8d | 323 | tree val = jump_func->value.constant.value; |
749aa96d MJ |
324 | fprintf (f, "CONST: "); |
325 | print_generic_expr (f, val, 0); | |
326 | if (TREE_CODE (val) == ADDR_EXPR | |
327 | && TREE_CODE (TREE_OPERAND (val, 0)) == CONST_DECL) | |
328 | { | |
329 | fprintf (f, " -> "); | |
330 | print_generic_expr (f, DECL_INITIAL (TREE_OPERAND (val, 0)), | |
331 | 0); | |
332 | } | |
333 | fprintf (f, "\n"); | |
334 | } | |
749aa96d MJ |
335 | else if (type == IPA_JF_PASS_THROUGH) |
336 | { | |
337 | fprintf (f, "PASS THROUGH: "); | |
8b7773a4 | 338 | fprintf (f, "%d, op %s", |
749aa96d | 339 | jump_func->value.pass_through.formal_id, |
5806f481 | 340 | get_tree_code_name(jump_func->value.pass_through.operation)); |
749aa96d | 341 | if (jump_func->value.pass_through.operation != NOP_EXPR) |
8b7773a4 MJ |
342 | { |
343 | fprintf (f, " "); | |
344 | print_generic_expr (f, | |
345 | jump_func->value.pass_through.operand, 0); | |
346 | } | |
347 | if (jump_func->value.pass_through.agg_preserved) | |
348 | fprintf (f, ", agg_preserved"); | |
3ea6239f | 349 | fprintf (f, "\n"); |
749aa96d MJ |
350 | } |
351 | else if (type == IPA_JF_ANCESTOR) | |
352 | { | |
353 | fprintf (f, "ANCESTOR: "); | |
3b97a5c7 | 354 | fprintf (f, "%d, offset "HOST_WIDE_INT_PRINT_DEC, |
749aa96d MJ |
355 | jump_func->value.ancestor.formal_id, |
356 | jump_func->value.ancestor.offset); | |
8b7773a4 MJ |
357 | if (jump_func->value.ancestor.agg_preserved) |
358 | fprintf (f, ", agg_preserved"); | |
3ea6239f | 359 | fprintf (f, "\n"); |
749aa96d | 360 | } |
8b7773a4 MJ |
361 | |
362 | if (jump_func->agg.items) | |
363 | { | |
364 | struct ipa_agg_jf_item *item; | |
365 | int j; | |
366 | ||
367 | fprintf (f, " Aggregate passed by %s:\n", | |
368 | jump_func->agg.by_ref ? "reference" : "value"); | |
9771b263 | 369 | FOR_EACH_VEC_SAFE_ELT (jump_func->agg.items, j, item) |
8b7773a4 MJ |
370 | { |
371 | fprintf (f, " offset: " HOST_WIDE_INT_PRINT_DEC ", ", | |
372 | item->offset); | |
373 | if (TYPE_P (item->value)) | |
374 | fprintf (f, "clobber of " HOST_WIDE_INT_PRINT_DEC " bits", | |
ae7e9ddd | 375 | tree_to_uhwi (TYPE_SIZE (item->value))); |
8b7773a4 MJ |
376 | else |
377 | { | |
378 | fprintf (f, "cst: "); | |
379 | print_generic_expr (f, item->value, 0); | |
380 | } | |
381 | fprintf (f, "\n"); | |
382 | } | |
383 | } | |
44210a96 MJ |
384 | |
385 | struct ipa_polymorphic_call_context *ctx | |
386 | = ipa_get_ith_polymorhic_call_context (IPA_EDGE_REF (cs), i); | |
387 | if (ctx && !ctx->useless_p ()) | |
388 | { | |
389 | fprintf (f, " Context: "); | |
390 | ctx->dump (dump_file); | |
391 | } | |
04be694e MJ |
392 | |
393 | if (jump_func->alignment.known) | |
394 | { | |
395 | fprintf (f, " Alignment: %u, misalignment: %u\n", | |
396 | jump_func->alignment.align, | |
397 | jump_func->alignment.misalign); | |
398 | } | |
399 | else | |
400 | fprintf (f, " Unknown alignment\n"); | |
749aa96d MJ |
401 | } |
402 | } | |
403 | ||
404 | ||
be95e2b9 MJ |
405 | /* Print the jump functions of all arguments on all call graph edges going from |
406 | NODE to file F. */ | |
407 | ||
518dc859 | 408 | void |
3e293154 | 409 | ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node) |
518dc859 | 410 | { |
3e293154 | 411 | struct cgraph_edge *cs; |
518dc859 | 412 | |
fec39fa6 | 413 | fprintf (f, " Jump functions of caller %s/%i:\n", node->name (), |
67348ccc | 414 | node->order); |
3e293154 MJ |
415 | for (cs = node->callees; cs; cs = cs->next_callee) |
416 | { | |
417 | if (!ipa_edge_args_info_available_for_edge_p (cs)) | |
418 | continue; | |
419 | ||
749aa96d | 420 | fprintf (f, " callsite %s/%i -> %s/%i : \n", |
2a72a953 DM |
421 | xstrdup_for_dump (node->name ()), node->order, |
422 | xstrdup_for_dump (cs->callee->name ()), | |
67348ccc | 423 | cs->callee->order); |
749aa96d MJ |
424 | ipa_print_node_jump_functions_for_edge (f, cs); |
425 | } | |
518dc859 | 426 | |
9de04252 | 427 | for (cs = node->indirect_calls; cs; cs = cs->next_callee) |
749aa96d | 428 | { |
9de04252 | 429 | struct cgraph_indirect_call_info *ii; |
749aa96d MJ |
430 | if (!ipa_edge_args_info_available_for_edge_p (cs)) |
431 | continue; | |
3e293154 | 432 | |
9de04252 MJ |
433 | ii = cs->indirect_info; |
434 | if (ii->agg_contents) | |
c13bc3d9 | 435 | fprintf (f, " indirect %s callsite, calling param %i, " |
9de04252 | 436 | "offset " HOST_WIDE_INT_PRINT_DEC ", %s", |
c13bc3d9 | 437 | ii->member_ptr ? "member ptr" : "aggregate", |
9de04252 MJ |
438 | ii->param_index, ii->offset, |
439 | ii->by_ref ? "by reference" : "by_value"); | |
440 | else | |
85942f45 JH |
441 | fprintf (f, " indirect %s callsite, calling param %i, " |
442 | "offset " HOST_WIDE_INT_PRINT_DEC, | |
443 | ii->polymorphic ? "polymorphic" : "simple", ii->param_index, | |
444 | ii->offset); | |
9de04252 | 445 | |
749aa96d MJ |
446 | if (cs->call_stmt) |
447 | { | |
9de04252 | 448 | fprintf (f, ", for stmt "); |
749aa96d | 449 | print_gimple_stmt (f, cs->call_stmt, 0, TDF_SLIM); |
3e293154 | 450 | } |
749aa96d | 451 | else |
9de04252 | 452 | fprintf (f, "\n"); |
ba392339 JH |
453 | if (ii->polymorphic) |
454 | ii->context.dump (f); | |
749aa96d | 455 | ipa_print_node_jump_functions_for_edge (f, cs); |
3e293154 MJ |
456 | } |
457 | } | |
458 | ||
459 | /* Print ipa_jump_func data structures of all nodes in the call graph to F. */ | |
be95e2b9 | 460 | |
3e293154 MJ |
461 | void |
462 | ipa_print_all_jump_functions (FILE *f) | |
463 | { | |
464 | struct cgraph_node *node; | |
465 | ||
ca30a539 | 466 | fprintf (f, "\nJump functions:\n"); |
65c70e6b | 467 | FOR_EACH_FUNCTION (node) |
3e293154 MJ |
468 | { |
469 | ipa_print_node_jump_functions (f, node); | |
470 | } | |
471 | } | |
472 | ||
04be694e MJ |
473 | /* Set jfunc to be a know-really nothing jump function. */ |
474 | ||
475 | static void | |
476 | ipa_set_jf_unknown (struct ipa_jump_func *jfunc) | |
477 | { | |
478 | jfunc->type = IPA_JF_UNKNOWN; | |
479 | jfunc->alignment.known = false; | |
480 | } | |
481 | ||
b8f6e610 MJ |
482 | /* Set JFUNC to be a copy of another jmp (to be used by jump function |
483 | combination code). The two functions will share their rdesc. */ | |
484 | ||
485 | static void | |
486 | ipa_set_jf_cst_copy (struct ipa_jump_func *dst, | |
487 | struct ipa_jump_func *src) | |
488 | ||
489 | { | |
490 | gcc_checking_assert (src->type == IPA_JF_CONST); | |
491 | dst->type = IPA_JF_CONST; | |
492 | dst->value.constant = src->value.constant; | |
493 | } | |
494 | ||
7b872d9e MJ |
495 | /* Set JFUNC to be a constant jmp function. */ |
496 | ||
497 | static void | |
4502fe8d MJ |
498 | ipa_set_jf_constant (struct ipa_jump_func *jfunc, tree constant, |
499 | struct cgraph_edge *cs) | |
7b872d9e | 500 | { |
5368224f DC |
501 | constant = unshare_expr (constant); |
502 | if (constant && EXPR_P (constant)) | |
503 | SET_EXPR_LOCATION (constant, UNKNOWN_LOCATION); | |
7b872d9e | 504 | jfunc->type = IPA_JF_CONST; |
4502fe8d MJ |
505 | jfunc->value.constant.value = unshare_expr_without_location (constant); |
506 | ||
507 | if (TREE_CODE (constant) == ADDR_EXPR | |
508 | && TREE_CODE (TREE_OPERAND (constant, 0)) == FUNCTION_DECL) | |
509 | { | |
510 | struct ipa_cst_ref_desc *rdesc; | |
511 | if (!ipa_refdesc_pool) | |
512 | ipa_refdesc_pool = create_alloc_pool ("IPA-PROP ref descriptions", | |
513 | sizeof (struct ipa_cst_ref_desc), 32); | |
514 | ||
515 | rdesc = (struct ipa_cst_ref_desc *) pool_alloc (ipa_refdesc_pool); | |
516 | rdesc->cs = cs; | |
517 | rdesc->next_duplicate = NULL; | |
518 | rdesc->refcount = 1; | |
519 | jfunc->value.constant.rdesc = rdesc; | |
520 | } | |
521 | else | |
522 | jfunc->value.constant.rdesc = NULL; | |
7b872d9e MJ |
523 | } |
524 | ||
525 | /* Set JFUNC to be a simple pass-through jump function. */ | |
526 | static void | |
8b7773a4 | 527 | ipa_set_jf_simple_pass_through (struct ipa_jump_func *jfunc, int formal_id, |
3b97a5c7 | 528 | bool agg_preserved) |
7b872d9e MJ |
529 | { |
530 | jfunc->type = IPA_JF_PASS_THROUGH; | |
531 | jfunc->value.pass_through.operand = NULL_TREE; | |
532 | jfunc->value.pass_through.formal_id = formal_id; | |
533 | jfunc->value.pass_through.operation = NOP_EXPR; | |
8b7773a4 | 534 | jfunc->value.pass_through.agg_preserved = agg_preserved; |
7b872d9e MJ |
535 | } |
536 | ||
537 | /* Set JFUNC to be an arithmetic pass through jump function. */ | |
538 | ||
539 | static void | |
540 | ipa_set_jf_arith_pass_through (struct ipa_jump_func *jfunc, int formal_id, | |
541 | tree operand, enum tree_code operation) | |
542 | { | |
543 | jfunc->type = IPA_JF_PASS_THROUGH; | |
d1f98542 | 544 | jfunc->value.pass_through.operand = unshare_expr_without_location (operand); |
7b872d9e MJ |
545 | jfunc->value.pass_through.formal_id = formal_id; |
546 | jfunc->value.pass_through.operation = operation; | |
8b7773a4 | 547 | jfunc->value.pass_through.agg_preserved = false; |
7b872d9e MJ |
548 | } |
549 | ||
550 | /* Set JFUNC to be an ancestor jump function. */ | |
551 | ||
552 | static void | |
553 | ipa_set_ancestor_jf (struct ipa_jump_func *jfunc, HOST_WIDE_INT offset, | |
3b97a5c7 | 554 | int formal_id, bool agg_preserved) |
7b872d9e MJ |
555 | { |
556 | jfunc->type = IPA_JF_ANCESTOR; | |
557 | jfunc->value.ancestor.formal_id = formal_id; | |
558 | jfunc->value.ancestor.offset = offset; | |
8b7773a4 | 559 | jfunc->value.ancestor.agg_preserved = agg_preserved; |
e248d83f MJ |
560 | } |
561 | ||
8aab5218 MJ |
562 | /* Get IPA BB information about the given BB. FBI is the context of analyzis |
563 | of this function body. */ | |
564 | ||
565 | static struct ipa_bb_info * | |
566 | ipa_get_bb_info (struct func_body_info *fbi, basic_block bb) | |
567 | { | |
568 | gcc_checking_assert (fbi); | |
569 | return &fbi->bb_infos[bb->index]; | |
570 | } | |
571 | ||
f65cf2b7 MJ |
572 | /* Structure to be passed in between detect_type_change and |
573 | check_stmt_for_type_change. */ | |
574 | ||
11478306 | 575 | struct prop_type_change_info |
f65cf2b7 | 576 | { |
290ebcb7 MJ |
577 | /* Offset into the object where there is the virtual method pointer we are |
578 | looking for. */ | |
579 | HOST_WIDE_INT offset; | |
580 | /* The declaration or SSA_NAME pointer of the base that we are checking for | |
581 | type change. */ | |
582 | tree object; | |
f65cf2b7 MJ |
583 | /* Set to true if dynamic type change has been detected. */ |
584 | bool type_maybe_changed; | |
585 | }; | |
586 | ||
587 | /* Return true if STMT can modify a virtual method table pointer. | |
588 | ||
589 | This function makes special assumptions about both constructors and | |
590 | destructors which are all the functions that are allowed to alter the VMT | |
591 | pointers. It assumes that destructors begin with assignment into all VMT | |
592 | pointers and that constructors essentially look in the following way: | |
593 | ||
594 | 1) The very first thing they do is that they call constructors of ancestor | |
595 | sub-objects that have them. | |
596 | ||
597 | 2) Then VMT pointers of this and all its ancestors is set to new values | |
598 | corresponding to the type corresponding to the constructor. | |
599 | ||
600 | 3) Only afterwards, other stuff such as constructor of member sub-objects | |
601 | and the code written by the user is run. Only this may include calling | |
602 | virtual functions, directly or indirectly. | |
603 | ||
604 | There is no way to call a constructor of an ancestor sub-object in any | |
605 | other way. | |
606 | ||
607 | This means that we do not have to care whether constructors get the correct | |
608 | type information because they will always change it (in fact, if we define | |
609 | the type to be given by the VMT pointer, it is undefined). | |
610 | ||
611 | The most important fact to derive from the above is that if, for some | |
612 | statement in the section 3, we try to detect whether the dynamic type has | |
613 | changed, we can safely ignore all calls as we examine the function body | |
614 | backwards until we reach statements in section 2 because these calls cannot | |
615 | be ancestor constructors or destructors (if the input is not bogus) and so | |
616 | do not change the dynamic type (this holds true only for automatically | |
617 | allocated objects but at the moment we devirtualize only these). We then | |
618 | must detect that statements in section 2 change the dynamic type and can try | |
619 | to derive the new type. That is enough and we can stop, we will never see | |
620 | the calls into constructors of sub-objects in this code. Therefore we can | |
621 | safely ignore all call statements that we traverse. | |
622 | */ | |
623 | ||
624 | static bool | |
625 | stmt_may_be_vtbl_ptr_store (gimple stmt) | |
626 | { | |
627 | if (is_gimple_call (stmt)) | |
628 | return false; | |
70f633c5 JH |
629 | if (gimple_clobber_p (stmt)) |
630 | return false; | |
f65cf2b7 MJ |
631 | else if (is_gimple_assign (stmt)) |
632 | { | |
633 | tree lhs = gimple_assign_lhs (stmt); | |
634 | ||
0004f992 MJ |
635 | if (!AGGREGATE_TYPE_P (TREE_TYPE (lhs))) |
636 | { | |
637 | if (flag_strict_aliasing | |
638 | && !POINTER_TYPE_P (TREE_TYPE (lhs))) | |
639 | return false; | |
640 | ||
641 | if (TREE_CODE (lhs) == COMPONENT_REF | |
642 | && !DECL_VIRTUAL_P (TREE_OPERAND (lhs, 1))) | |
f65cf2b7 | 643 | return false; |
0004f992 MJ |
644 | /* In the future we might want to use get_base_ref_and_offset to find |
645 | if there is a field corresponding to the offset and if so, proceed | |
646 | almost like if it was a component ref. */ | |
647 | } | |
f65cf2b7 MJ |
648 | } |
649 | return true; | |
650 | } | |
651 | ||
3b97a5c7 MJ |
652 | /* Callback of walk_aliased_vdefs and a helper function for detect_type_change |
653 | to check whether a particular statement may modify the virtual table | |
654 | pointerIt stores its result into DATA, which points to a | |
11478306 | 655 | prop_type_change_info structure. */ |
f65cf2b7 MJ |
656 | |
657 | static bool | |
658 | check_stmt_for_type_change (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef, void *data) | |
659 | { | |
660 | gimple stmt = SSA_NAME_DEF_STMT (vdef); | |
11478306 | 661 | struct prop_type_change_info *tci = (struct prop_type_change_info *) data; |
f65cf2b7 MJ |
662 | |
663 | if (stmt_may_be_vtbl_ptr_store (stmt)) | |
664 | { | |
665 | tci->type_maybe_changed = true; | |
666 | return true; | |
667 | } | |
668 | else | |
669 | return false; | |
670 | } | |
671 | ||
058d0a90 JH |
672 | /* See if ARG is PARAM_DECl describing instance passed by pointer |
673 | or reference in FUNCTION. Return false if the dynamic type may change | |
674 | in between beggining of the function until CALL is invoked. | |
290ebcb7 | 675 | |
058d0a90 JH |
676 | Generally functions are not allowed to change type of such instances, |
677 | but they call destructors. We assume that methods can not destroy the THIS | |
678 | pointer. Also as a special cases, constructor and destructors may change | |
679 | type of the THIS pointer. */ | |
680 | ||
681 | static bool | |
682 | param_type_may_change_p (tree function, tree arg, gimple call) | |
683 | { | |
684 | /* Pure functions can not do any changes on the dynamic type; | |
685 | that require writting to memory. */ | |
686 | if (flags_from_decl_or_type (function) & (ECF_PURE | ECF_CONST)) | |
687 | return false; | |
688 | /* We need to check if we are within inlined consturctor | |
689 | or destructor (ideally we would have way to check that the | |
690 | inline cdtor is actually working on ARG, but we don't have | |
691 | easy tie on this, so punt on all non-pure cdtors. | |
692 | We may also record the types of cdtors and once we know type | |
693 | of the instance match them. | |
694 | ||
695 | Also code unification optimizations may merge calls from | |
696 | different blocks making return values unreliable. So | |
697 | do nothing during late optimization. */ | |
698 | if (DECL_STRUCT_FUNCTION (function)->after_inlining) | |
699 | return true; | |
700 | if (TREE_CODE (arg) == SSA_NAME | |
701 | && SSA_NAME_IS_DEFAULT_DEF (arg) | |
702 | && TREE_CODE (SSA_NAME_VAR (arg)) == PARM_DECL) | |
703 | { | |
704 | /* Normal (non-THIS) argument. */ | |
705 | if ((SSA_NAME_VAR (arg) != DECL_ARGUMENTS (function) | |
706 | || TREE_CODE (TREE_TYPE (function)) != METHOD_TYPE) | |
707 | /* THIS pointer of an method - here we we want to watch constructors | |
708 | and destructors as those definitely may change the dynamic | |
709 | type. */ | |
710 | || (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE | |
711 | && !DECL_CXX_CONSTRUCTOR_P (function) | |
712 | && !DECL_CXX_DESTRUCTOR_P (function) | |
713 | && (SSA_NAME_VAR (arg) == DECL_ARGUMENTS (function)))) | |
714 | { | |
715 | /* Walk the inline stack and watch out for ctors/dtors. */ | |
716 | for (tree block = gimple_block (call); block && TREE_CODE (block) == BLOCK; | |
717 | block = BLOCK_SUPERCONTEXT (block)) | |
718 | if (BLOCK_ABSTRACT_ORIGIN (block) | |
719 | && TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block)) == FUNCTION_DECL) | |
720 | { | |
721 | tree fn = BLOCK_ABSTRACT_ORIGIN (block); | |
722 | ||
723 | if (flags_from_decl_or_type (fn) & (ECF_PURE | ECF_CONST)) | |
724 | continue; | |
725 | if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE | |
726 | && (DECL_CXX_CONSTRUCTOR_P (fn) | |
727 | || DECL_CXX_DESTRUCTOR_P (fn))) | |
728 | return true; | |
729 | } | |
730 | return false; | |
731 | } | |
732 | } | |
733 | return true; | |
734 | } | |
290ebcb7 | 735 | |
06d65050 JH |
736 | /* Detect whether the dynamic type of ARG of COMP_TYPE has changed (before |
737 | callsite CALL) by looking for assignments to its virtual table pointer. If | |
738 | it is, return true and fill in the jump function JFUNC with relevant type | |
739 | information or set it to unknown. ARG is the object itself (not a pointer | |
740 | to it, unless dereferenced). BASE is the base of the memory access as | |
058d0a90 JH |
741 | returned by get_ref_base_and_extent, as is the offset. |
742 | ||
743 | This is helper function for detect_type_change and detect_type_change_ssa | |
744 | that does the heavy work which is usually unnecesary. */ | |
f65cf2b7 MJ |
745 | |
746 | static bool | |
058d0a90 | 747 | detect_type_change_from_memory_writes (tree arg, tree base, tree comp_type, |
538dd0b7 | 748 | gcall *call, struct ipa_jump_func *jfunc, |
058d0a90 | 749 | HOST_WIDE_INT offset) |
f65cf2b7 | 750 | { |
11478306 | 751 | struct prop_type_change_info tci; |
f65cf2b7 | 752 | ao_ref ao; |
70f633c5 | 753 | bool entry_reached = false; |
f65cf2b7 MJ |
754 | |
755 | gcc_checking_assert (DECL_P (arg) | |
756 | || TREE_CODE (arg) == MEM_REF | |
757 | || handled_component_p (arg)); | |
f65cf2b7 | 758 | |
b49407f8 JH |
759 | comp_type = TYPE_MAIN_VARIANT (comp_type); |
760 | ||
d570d364 JH |
761 | /* Const calls cannot call virtual methods through VMT and so type changes do |
762 | not matter. */ | |
763 | if (!flag_devirtualize || !gimple_vuse (call) | |
764 | /* Be sure expected_type is polymorphic. */ | |
765 | || !comp_type | |
766 | || TREE_CODE (comp_type) != RECORD_TYPE | |
767 | || !TYPE_BINFO (TYPE_MAIN_VARIANT (comp_type)) | |
768 | || !BINFO_VTABLE (TYPE_BINFO (TYPE_MAIN_VARIANT (comp_type)))) | |
769 | return true; | |
4bf2a588 | 770 | |
dd887943 | 771 | ao_ref_init (&ao, arg); |
f65cf2b7 MJ |
772 | ao.base = base; |
773 | ao.offset = offset; | |
774 | ao.size = POINTER_SIZE; | |
775 | ao.max_size = ao.size; | |
f65cf2b7 | 776 | |
290ebcb7 MJ |
777 | tci.offset = offset; |
778 | tci.object = get_base_address (arg); | |
290ebcb7 | 779 | tci.type_maybe_changed = false; |
290ebcb7 | 780 | |
f65cf2b7 | 781 | walk_aliased_vdefs (&ao, gimple_vuse (call), check_stmt_for_type_change, |
70f633c5 | 782 | &tci, NULL, &entry_reached); |
f65cf2b7 MJ |
783 | if (!tci.type_maybe_changed) |
784 | return false; | |
785 | ||
04be694e | 786 | ipa_set_jf_unknown (jfunc); |
f65cf2b7 MJ |
787 | return true; |
788 | } | |
789 | ||
058d0a90 JH |
790 | /* Detect whether the dynamic type of ARG of COMP_TYPE may have changed. |
791 | If it is, return true and fill in the jump function JFUNC with relevant type | |
792 | information or set it to unknown. ARG is the object itself (not a pointer | |
793 | to it, unless dereferenced). BASE is the base of the memory access as | |
794 | returned by get_ref_base_and_extent, as is the offset. */ | |
795 | ||
796 | static bool | |
538dd0b7 | 797 | detect_type_change (tree arg, tree base, tree comp_type, gcall *call, |
058d0a90 JH |
798 | struct ipa_jump_func *jfunc, HOST_WIDE_INT offset) |
799 | { | |
800 | if (!flag_devirtualize) | |
801 | return false; | |
802 | ||
803 | if (TREE_CODE (base) == MEM_REF | |
804 | && !param_type_may_change_p (current_function_decl, | |
805 | TREE_OPERAND (base, 0), | |
806 | call)) | |
807 | return false; | |
808 | return detect_type_change_from_memory_writes (arg, base, comp_type, | |
809 | call, jfunc, offset); | |
810 | } | |
811 | ||
f65cf2b7 MJ |
812 | /* Like detect_type_change but ARG is supposed to be a non-dereferenced pointer |
813 | SSA name (its dereference will become the base and the offset is assumed to | |
814 | be zero). */ | |
815 | ||
816 | static bool | |
06d65050 | 817 | detect_type_change_ssa (tree arg, tree comp_type, |
538dd0b7 | 818 | gcall *call, struct ipa_jump_func *jfunc) |
f65cf2b7 MJ |
819 | { |
820 | gcc_checking_assert (TREE_CODE (arg) == SSA_NAME); | |
05842ff5 | 821 | if (!flag_devirtualize |
06d65050 | 822 | || !POINTER_TYPE_P (TREE_TYPE (arg))) |
f65cf2b7 MJ |
823 | return false; |
824 | ||
058d0a90 JH |
825 | if (!param_type_may_change_p (current_function_decl, arg, call)) |
826 | return false; | |
827 | ||
f65cf2b7 | 828 | arg = build2 (MEM_REF, ptr_type_node, arg, |
290ebcb7 | 829 | build_int_cst (ptr_type_node, 0)); |
f65cf2b7 | 830 | |
058d0a90 JH |
831 | return detect_type_change_from_memory_writes (arg, arg, comp_type, |
832 | call, jfunc, 0); | |
f65cf2b7 MJ |
833 | } |
834 | ||
fdb0e1b4 MJ |
835 | /* Callback of walk_aliased_vdefs. Flags that it has been invoked to the |
836 | boolean variable pointed to by DATA. */ | |
837 | ||
838 | static bool | |
839 | mark_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef ATTRIBUTE_UNUSED, | |
840 | void *data) | |
841 | { | |
842 | bool *b = (bool *) data; | |
843 | *b = true; | |
844 | return true; | |
845 | } | |
846 | ||
8aab5218 MJ |
847 | /* Return true if we have already walked so many statements in AA that we |
848 | should really just start giving up. */ | |
849 | ||
850 | static bool | |
851 | aa_overwalked (struct func_body_info *fbi) | |
852 | { | |
853 | gcc_checking_assert (fbi); | |
854 | return fbi->aa_walked > (unsigned) PARAM_VALUE (PARAM_IPA_MAX_AA_STEPS); | |
855 | } | |
856 | ||
857 | /* Find the nearest valid aa status for parameter specified by INDEX that | |
858 | dominates BB. */ | |
859 | ||
860 | static struct param_aa_status * | |
861 | find_dominating_aa_status (struct func_body_info *fbi, basic_block bb, | |
862 | int index) | |
863 | { | |
864 | while (true) | |
865 | { | |
866 | bb = get_immediate_dominator (CDI_DOMINATORS, bb); | |
867 | if (!bb) | |
868 | return NULL; | |
869 | struct ipa_bb_info *bi = ipa_get_bb_info (fbi, bb); | |
870 | if (!bi->param_aa_statuses.is_empty () | |
871 | && bi->param_aa_statuses[index].valid) | |
872 | return &bi->param_aa_statuses[index]; | |
873 | } | |
874 | } | |
875 | ||
876 | /* Get AA status structure for the given BB and parameter with INDEX. Allocate | |
877 | structures and/or intialize the result with a dominating description as | |
878 | necessary. */ | |
879 | ||
880 | static struct param_aa_status * | |
881 | parm_bb_aa_status_for_bb (struct func_body_info *fbi, basic_block bb, | |
882 | int index) | |
883 | { | |
884 | gcc_checking_assert (fbi); | |
885 | struct ipa_bb_info *bi = ipa_get_bb_info (fbi, bb); | |
886 | if (bi->param_aa_statuses.is_empty ()) | |
887 | bi->param_aa_statuses.safe_grow_cleared (fbi->param_count); | |
888 | struct param_aa_status *paa = &bi->param_aa_statuses[index]; | |
889 | if (!paa->valid) | |
890 | { | |
891 | gcc_checking_assert (!paa->parm_modified | |
892 | && !paa->ref_modified | |
893 | && !paa->pt_modified); | |
894 | struct param_aa_status *dom_paa; | |
895 | dom_paa = find_dominating_aa_status (fbi, bb, index); | |
896 | if (dom_paa) | |
897 | *paa = *dom_paa; | |
898 | else | |
899 | paa->valid = true; | |
900 | } | |
901 | ||
902 | return paa; | |
903 | } | |
904 | ||
688010ba | 905 | /* Return true if a load from a formal parameter PARM_LOAD is known to retrieve |
8b7773a4 | 906 | a value known not to be modified in this function before reaching the |
8aab5218 MJ |
907 | statement STMT. FBI holds information about the function we have so far |
908 | gathered but do not survive the summary building stage. */ | |
fdb0e1b4 MJ |
909 | |
910 | static bool | |
8aab5218 MJ |
911 | parm_preserved_before_stmt_p (struct func_body_info *fbi, int index, |
912 | gimple stmt, tree parm_load) | |
fdb0e1b4 | 913 | { |
8aab5218 | 914 | struct param_aa_status *paa; |
fdb0e1b4 MJ |
915 | bool modified = false; |
916 | ao_ref refd; | |
917 | ||
8aab5218 MJ |
918 | /* FIXME: FBI can be NULL if we are being called from outside |
919 | ipa_node_analysis or ipcp_transform_function, which currently happens | |
920 | during inlining analysis. It would be great to extend fbi's lifetime and | |
921 | always have it. Currently, we are just not afraid of too much walking in | |
922 | that case. */ | |
923 | if (fbi) | |
924 | { | |
925 | if (aa_overwalked (fbi)) | |
926 | return false; | |
927 | paa = parm_bb_aa_status_for_bb (fbi, gimple_bb (stmt), index); | |
928 | if (paa->parm_modified) | |
929 | return false; | |
930 | } | |
931 | else | |
932 | paa = NULL; | |
fdb0e1b4 MJ |
933 | |
934 | gcc_checking_assert (gimple_vuse (stmt) != NULL_TREE); | |
8b7773a4 | 935 | ao_ref_init (&refd, parm_load); |
8aab5218 MJ |
936 | int walked = walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, |
937 | &modified, NULL); | |
938 | if (fbi) | |
939 | fbi->aa_walked += walked; | |
940 | if (paa && modified) | |
941 | paa->parm_modified = true; | |
8b7773a4 | 942 | return !modified; |
fdb0e1b4 MJ |
943 | } |
944 | ||
945 | /* If STMT is an assignment that loads a value from an parameter declaration, | |
946 | return the index of the parameter in ipa_node_params which has not been | |
947 | modified. Otherwise return -1. */ | |
948 | ||
949 | static int | |
8aab5218 MJ |
950 | load_from_unmodified_param (struct func_body_info *fbi, |
951 | vec<ipa_param_descriptor> descriptors, | |
fdb0e1b4 MJ |
952 | gimple stmt) |
953 | { | |
954 | int index; | |
955 | tree op1; | |
956 | ||
957 | if (!gimple_assign_single_p (stmt)) | |
958 | return -1; | |
959 | ||
960 | op1 = gimple_assign_rhs1 (stmt); | |
961 | if (TREE_CODE (op1) != PARM_DECL) | |
962 | return -1; | |
963 | ||
d044dd17 | 964 | index = ipa_get_param_decl_index_1 (descriptors, op1); |
fdb0e1b4 | 965 | if (index < 0 |
8aab5218 | 966 | || !parm_preserved_before_stmt_p (fbi, index, stmt, op1)) |
fdb0e1b4 MJ |
967 | return -1; |
968 | ||
969 | return index; | |
970 | } | |
f65cf2b7 | 971 | |
8aab5218 MJ |
972 | /* Return true if memory reference REF (which must be a load through parameter |
973 | with INDEX) loads data that are known to be unmodified in this function | |
974 | before reaching statement STMT. */ | |
8b7773a4 MJ |
975 | |
976 | static bool | |
8aab5218 MJ |
977 | parm_ref_data_preserved_p (struct func_body_info *fbi, |
978 | int index, gimple stmt, tree ref) | |
8b7773a4 | 979 | { |
8aab5218 | 980 | struct param_aa_status *paa; |
8b7773a4 MJ |
981 | bool modified = false; |
982 | ao_ref refd; | |
983 | ||
8aab5218 MJ |
984 | /* FIXME: FBI can be NULL if we are being called from outside |
985 | ipa_node_analysis or ipcp_transform_function, which currently happens | |
986 | during inlining analysis. It would be great to extend fbi's lifetime and | |
987 | always have it. Currently, we are just not afraid of too much walking in | |
988 | that case. */ | |
989 | if (fbi) | |
990 | { | |
991 | if (aa_overwalked (fbi)) | |
992 | return false; | |
993 | paa = parm_bb_aa_status_for_bb (fbi, gimple_bb (stmt), index); | |
994 | if (paa->ref_modified) | |
995 | return false; | |
996 | } | |
997 | else | |
998 | paa = NULL; | |
8b7773a4 | 999 | |
8aab5218 | 1000 | gcc_checking_assert (gimple_vuse (stmt)); |
8b7773a4 | 1001 | ao_ref_init (&refd, ref); |
8aab5218 MJ |
1002 | int walked = walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, |
1003 | &modified, NULL); | |
1004 | if (fbi) | |
1005 | fbi->aa_walked += walked; | |
1006 | if (paa && modified) | |
1007 | paa->ref_modified = true; | |
8b7773a4 MJ |
1008 | return !modified; |
1009 | } | |
1010 | ||
8aab5218 MJ |
1011 | /* Return true if the data pointed to by PARM (which is a parameter with INDEX) |
1012 | is known to be unmodified in this function before reaching call statement | |
1013 | CALL into which it is passed. FBI describes the function body. */ | |
8b7773a4 MJ |
1014 | |
1015 | static bool | |
8aab5218 MJ |
1016 | parm_ref_data_pass_through_p (struct func_body_info *fbi, int index, |
1017 | gimple call, tree parm) | |
8b7773a4 MJ |
1018 | { |
1019 | bool modified = false; | |
1020 | ao_ref refd; | |
1021 | ||
1022 | /* It's unnecessary to calculate anything about memory contnets for a const | |
1023 | function because it is not goin to use it. But do not cache the result | |
1024 | either. Also, no such calculations for non-pointers. */ | |
1025 | if (!gimple_vuse (call) | |
8aab5218 MJ |
1026 | || !POINTER_TYPE_P (TREE_TYPE (parm)) |
1027 | || aa_overwalked (fbi)) | |
8b7773a4 MJ |
1028 | return false; |
1029 | ||
8aab5218 MJ |
1030 | struct param_aa_status *paa = parm_bb_aa_status_for_bb (fbi, gimple_bb (call), |
1031 | index); | |
1032 | if (paa->pt_modified) | |
8b7773a4 MJ |
1033 | return false; |
1034 | ||
1035 | ao_ref_init_from_ptr_and_size (&refd, parm, NULL_TREE); | |
8aab5218 MJ |
1036 | int walked = walk_aliased_vdefs (&refd, gimple_vuse (call), mark_modified, |
1037 | &modified, NULL); | |
1038 | fbi->aa_walked += walked; | |
8b7773a4 | 1039 | if (modified) |
8aab5218 | 1040 | paa->pt_modified = true; |
8b7773a4 MJ |
1041 | return !modified; |
1042 | } | |
1043 | ||
1044 | /* Return true if we can prove that OP is a memory reference loading unmodified | |
1045 | data from an aggregate passed as a parameter and if the aggregate is passed | |
1046 | by reference, that the alias type of the load corresponds to the type of the | |
1047 | formal parameter (so that we can rely on this type for TBAA in callers). | |
1048 | INFO and PARMS_AINFO describe parameters of the current function (but the | |
1049 | latter can be NULL), STMT is the load statement. If function returns true, | |
1050 | *INDEX_P, *OFFSET_P and *BY_REF is filled with the parameter index, offset | |
1051 | within the aggregate and whether it is a load from a value passed by | |
1052 | reference respectively. */ | |
1053 | ||
1054 | static bool | |
8aab5218 MJ |
1055 | ipa_load_from_parm_agg_1 (struct func_body_info *fbi, |
1056 | vec<ipa_param_descriptor> descriptors, | |
1057 | gimple stmt, tree op, int *index_p, | |
1058 | HOST_WIDE_INT *offset_p, HOST_WIDE_INT *size_p, | |
1059 | bool *by_ref_p) | |
8b7773a4 MJ |
1060 | { |
1061 | int index; | |
1062 | HOST_WIDE_INT size, max_size; | |
1063 | tree base = get_ref_base_and_extent (op, offset_p, &size, &max_size); | |
1064 | ||
1065 | if (max_size == -1 || max_size != size || *offset_p < 0) | |
1066 | return false; | |
1067 | ||
1068 | if (DECL_P (base)) | |
1069 | { | |
d044dd17 | 1070 | int index = ipa_get_param_decl_index_1 (descriptors, base); |
8b7773a4 | 1071 | if (index >= 0 |
8aab5218 | 1072 | && parm_preserved_before_stmt_p (fbi, index, stmt, op)) |
8b7773a4 MJ |
1073 | { |
1074 | *index_p = index; | |
1075 | *by_ref_p = false; | |
3ff2ca23 JJ |
1076 | if (size_p) |
1077 | *size_p = size; | |
8b7773a4 MJ |
1078 | return true; |
1079 | } | |
1080 | return false; | |
1081 | } | |
1082 | ||
1083 | if (TREE_CODE (base) != MEM_REF | |
1084 | || TREE_CODE (TREE_OPERAND (base, 0)) != SSA_NAME | |
1085 | || !integer_zerop (TREE_OPERAND (base, 1))) | |
1086 | return false; | |
1087 | ||
1088 | if (SSA_NAME_IS_DEFAULT_DEF (TREE_OPERAND (base, 0))) | |
1089 | { | |
1090 | tree parm = SSA_NAME_VAR (TREE_OPERAND (base, 0)); | |
d044dd17 | 1091 | index = ipa_get_param_decl_index_1 (descriptors, parm); |
8b7773a4 MJ |
1092 | } |
1093 | else | |
1094 | { | |
1095 | /* This branch catches situations where a pointer parameter is not a | |
1096 | gimple register, for example: | |
1097 | ||
1098 | void hip7(S*) (struct S * p) | |
1099 | { | |
1100 | void (*<T2e4>) (struct S *) D.1867; | |
1101 | struct S * p.1; | |
1102 | ||
1103 | <bb 2>: | |
1104 | p.1_1 = p; | |
1105 | D.1867_2 = p.1_1->f; | |
1106 | D.1867_2 (); | |
1107 | gdp = &p; | |
1108 | */ | |
1109 | ||
1110 | gimple def = SSA_NAME_DEF_STMT (TREE_OPERAND (base, 0)); | |
8aab5218 | 1111 | index = load_from_unmodified_param (fbi, descriptors, def); |
8b7773a4 MJ |
1112 | } |
1113 | ||
1114 | if (index >= 0 | |
8aab5218 | 1115 | && parm_ref_data_preserved_p (fbi, index, stmt, op)) |
8b7773a4 MJ |
1116 | { |
1117 | *index_p = index; | |
1118 | *by_ref_p = true; | |
3ff2ca23 JJ |
1119 | if (size_p) |
1120 | *size_p = size; | |
8b7773a4 MJ |
1121 | return true; |
1122 | } | |
1123 | return false; | |
1124 | } | |
1125 | ||
1126 | /* Just like the previous function, just without the param_analysis_info | |
1127 | pointer, for users outside of this file. */ | |
1128 | ||
1129 | bool | |
1130 | ipa_load_from_parm_agg (struct ipa_node_params *info, gimple stmt, | |
1131 | tree op, int *index_p, HOST_WIDE_INT *offset_p, | |
1132 | bool *by_ref_p) | |
1133 | { | |
8aab5218 | 1134 | return ipa_load_from_parm_agg_1 (NULL, info->descriptors, stmt, op, index_p, |
3ff2ca23 | 1135 | offset_p, NULL, by_ref_p); |
8b7773a4 MJ |
1136 | } |
1137 | ||
b258210c | 1138 | /* Given that an actual argument is an SSA_NAME (given in NAME) and is a result |
fdb0e1b4 MJ |
1139 | of an assignment statement STMT, try to determine whether we are actually |
1140 | handling any of the following cases and construct an appropriate jump | |
1141 | function into JFUNC if so: | |
1142 | ||
1143 | 1) The passed value is loaded from a formal parameter which is not a gimple | |
1144 | register (most probably because it is addressable, the value has to be | |
1145 | scalar) and we can guarantee the value has not changed. This case can | |
1146 | therefore be described by a simple pass-through jump function. For example: | |
1147 | ||
1148 | foo (int a) | |
1149 | { | |
1150 | int a.0; | |
1151 | ||
1152 | a.0_2 = a; | |
1153 | bar (a.0_2); | |
1154 | ||
1155 | 2) The passed value can be described by a simple arithmetic pass-through | |
1156 | jump function. E.g. | |
1157 | ||
1158 | foo (int a) | |
1159 | { | |
1160 | int D.2064; | |
1161 | ||
1162 | D.2064_4 = a.1(D) + 4; | |
1163 | bar (D.2064_4); | |
1164 | ||
1165 | This case can also occur in combination of the previous one, e.g.: | |
1166 | ||
1167 | foo (int a, int z) | |
1168 | { | |
1169 | int a.0; | |
1170 | int D.2064; | |
1171 | ||
1172 | a.0_3 = a; | |
1173 | D.2064_4 = a.0_3 + 4; | |
1174 | foo (D.2064_4); | |
1175 | ||
1176 | 3) The passed value is an address of an object within another one (which | |
1177 | also passed by reference). Such situations are described by an ancestor | |
1178 | jump function and describe situations such as: | |
1179 | ||
1180 | B::foo() (struct B * const this) | |
1181 | { | |
1182 | struct A * D.1845; | |
1183 | ||
1184 | D.1845_2 = &this_1(D)->D.1748; | |
1185 | A::bar (D.1845_2); | |
1186 | ||
1187 | INFO is the structure describing individual parameters access different | |
1188 | stages of IPA optimizations. PARMS_AINFO contains the information that is | |
1189 | only needed for intraprocedural analysis. */ | |
685b0d13 MJ |
1190 | |
1191 | static void | |
8aab5218 MJ |
1192 | compute_complex_assign_jump_func (struct func_body_info *fbi, |
1193 | struct ipa_node_params *info, | |
b258210c | 1194 | struct ipa_jump_func *jfunc, |
538dd0b7 | 1195 | gcall *call, gimple stmt, tree name, |
06d65050 | 1196 | tree param_type) |
685b0d13 MJ |
1197 | { |
1198 | HOST_WIDE_INT offset, size, max_size; | |
fdb0e1b4 | 1199 | tree op1, tc_ssa, base, ssa; |
685b0d13 | 1200 | int index; |
685b0d13 | 1201 | |
685b0d13 | 1202 | op1 = gimple_assign_rhs1 (stmt); |
685b0d13 | 1203 | |
fdb0e1b4 | 1204 | if (TREE_CODE (op1) == SSA_NAME) |
685b0d13 | 1205 | { |
fdb0e1b4 MJ |
1206 | if (SSA_NAME_IS_DEFAULT_DEF (op1)) |
1207 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (op1)); | |
1208 | else | |
8aab5218 | 1209 | index = load_from_unmodified_param (fbi, info->descriptors, |
fdb0e1b4 MJ |
1210 | SSA_NAME_DEF_STMT (op1)); |
1211 | tc_ssa = op1; | |
1212 | } | |
1213 | else | |
1214 | { | |
8aab5218 | 1215 | index = load_from_unmodified_param (fbi, info->descriptors, stmt); |
fdb0e1b4 MJ |
1216 | tc_ssa = gimple_assign_lhs (stmt); |
1217 | } | |
1218 | ||
1219 | if (index >= 0) | |
1220 | { | |
1221 | tree op2 = gimple_assign_rhs2 (stmt); | |
685b0d13 | 1222 | |
b258210c | 1223 | if (op2) |
685b0d13 | 1224 | { |
b258210c MJ |
1225 | if (!is_gimple_ip_invariant (op2) |
1226 | || (TREE_CODE_CLASS (gimple_expr_code (stmt)) != tcc_comparison | |
1227 | && !useless_type_conversion_p (TREE_TYPE (name), | |
1228 | TREE_TYPE (op1)))) | |
1229 | return; | |
1230 | ||
7b872d9e MJ |
1231 | ipa_set_jf_arith_pass_through (jfunc, index, op2, |
1232 | gimple_assign_rhs_code (stmt)); | |
685b0d13 | 1233 | } |
b8f6e610 | 1234 | else if (gimple_assign_single_p (stmt)) |
8b7773a4 | 1235 | { |
8aab5218 | 1236 | bool agg_p = parm_ref_data_pass_through_p (fbi, index, call, tc_ssa); |
3b97a5c7 | 1237 | ipa_set_jf_simple_pass_through (jfunc, index, agg_p); |
8b7773a4 | 1238 | } |
685b0d13 MJ |
1239 | return; |
1240 | } | |
1241 | ||
1242 | if (TREE_CODE (op1) != ADDR_EXPR) | |
1243 | return; | |
1244 | op1 = TREE_OPERAND (op1, 0); | |
f65cf2b7 | 1245 | if (TREE_CODE (TREE_TYPE (op1)) != RECORD_TYPE) |
b258210c | 1246 | return; |
32aa622c MJ |
1247 | base = get_ref_base_and_extent (op1, &offset, &size, &max_size); |
1248 | if (TREE_CODE (base) != MEM_REF | |
1a15bfdc RG |
1249 | /* If this is a varying address, punt. */ |
1250 | || max_size == -1 | |
1251 | || max_size != size) | |
685b0d13 | 1252 | return; |
807e902e | 1253 | offset += mem_ref_offset (base).to_short_addr () * BITS_PER_UNIT; |
f65cf2b7 MJ |
1254 | ssa = TREE_OPERAND (base, 0); |
1255 | if (TREE_CODE (ssa) != SSA_NAME | |
1256 | || !SSA_NAME_IS_DEFAULT_DEF (ssa) | |
280fedf0 | 1257 | || offset < 0) |
685b0d13 MJ |
1258 | return; |
1259 | ||
b8f6e610 | 1260 | /* Dynamic types are changed in constructors and destructors. */ |
f65cf2b7 | 1261 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (ssa)); |
06d65050 | 1262 | if (index >= 0 && param_type && POINTER_TYPE_P (param_type)) |
3b97a5c7 MJ |
1263 | ipa_set_ancestor_jf (jfunc, offset, index, |
1264 | parm_ref_data_pass_through_p (fbi, index, call, ssa)); | |
685b0d13 MJ |
1265 | } |
1266 | ||
40591473 MJ |
1267 | /* Extract the base, offset and MEM_REF expression from a statement ASSIGN if |
1268 | it looks like: | |
1269 | ||
1270 | iftmp.1_3 = &obj_2(D)->D.1762; | |
1271 | ||
1272 | The base of the MEM_REF must be a default definition SSA NAME of a | |
1273 | parameter. Return NULL_TREE if it looks otherwise. If case of success, the | |
1274 | whole MEM_REF expression is returned and the offset calculated from any | |
1275 | handled components and the MEM_REF itself is stored into *OFFSET. The whole | |
1276 | RHS stripped off the ADDR_EXPR is stored into *OBJ_P. */ | |
1277 | ||
1278 | static tree | |
1279 | get_ancestor_addr_info (gimple assign, tree *obj_p, HOST_WIDE_INT *offset) | |
1280 | { | |
1281 | HOST_WIDE_INT size, max_size; | |
1282 | tree expr, parm, obj; | |
1283 | ||
1284 | if (!gimple_assign_single_p (assign)) | |
1285 | return NULL_TREE; | |
1286 | expr = gimple_assign_rhs1 (assign); | |
1287 | ||
1288 | if (TREE_CODE (expr) != ADDR_EXPR) | |
1289 | return NULL_TREE; | |
1290 | expr = TREE_OPERAND (expr, 0); | |
1291 | obj = expr; | |
1292 | expr = get_ref_base_and_extent (expr, offset, &size, &max_size); | |
1293 | ||
1294 | if (TREE_CODE (expr) != MEM_REF | |
1295 | /* If this is a varying address, punt. */ | |
1296 | || max_size == -1 | |
1297 | || max_size != size | |
1298 | || *offset < 0) | |
1299 | return NULL_TREE; | |
1300 | parm = TREE_OPERAND (expr, 0); | |
1301 | if (TREE_CODE (parm) != SSA_NAME | |
1302 | || !SSA_NAME_IS_DEFAULT_DEF (parm) | |
1303 | || TREE_CODE (SSA_NAME_VAR (parm)) != PARM_DECL) | |
1304 | return NULL_TREE; | |
1305 | ||
807e902e | 1306 | *offset += mem_ref_offset (expr).to_short_addr () * BITS_PER_UNIT; |
40591473 MJ |
1307 | *obj_p = obj; |
1308 | return expr; | |
1309 | } | |
1310 | ||
685b0d13 | 1311 | |
b258210c MJ |
1312 | /* Given that an actual argument is an SSA_NAME that is a result of a phi |
1313 | statement PHI, try to find out whether NAME is in fact a | |
1314 | multiple-inheritance typecast from a descendant into an ancestor of a formal | |
1315 | parameter and thus can be described by an ancestor jump function and if so, | |
1316 | write the appropriate function into JFUNC. | |
1317 | ||
1318 | Essentially we want to match the following pattern: | |
1319 | ||
1320 | if (obj_2(D) != 0B) | |
1321 | goto <bb 3>; | |
1322 | else | |
1323 | goto <bb 4>; | |
1324 | ||
1325 | <bb 3>: | |
1326 | iftmp.1_3 = &obj_2(D)->D.1762; | |
1327 | ||
1328 | <bb 4>: | |
1329 | # iftmp.1_1 = PHI <iftmp.1_3(3), 0B(2)> | |
1330 | D.1879_6 = middleman_1 (iftmp.1_1, i_5(D)); | |
1331 | return D.1879_6; */ | |
1332 | ||
1333 | static void | |
8aab5218 MJ |
1334 | compute_complex_ancestor_jump_func (struct func_body_info *fbi, |
1335 | struct ipa_node_params *info, | |
b258210c | 1336 | struct ipa_jump_func *jfunc, |
538dd0b7 | 1337 | gcall *call, gphi *phi) |
b258210c | 1338 | { |
40591473 | 1339 | HOST_WIDE_INT offset; |
b258210c MJ |
1340 | gimple assign, cond; |
1341 | basic_block phi_bb, assign_bb, cond_bb; | |
f65cf2b7 | 1342 | tree tmp, parm, expr, obj; |
b258210c MJ |
1343 | int index, i; |
1344 | ||
54e348cb | 1345 | if (gimple_phi_num_args (phi) != 2) |
b258210c MJ |
1346 | return; |
1347 | ||
54e348cb MJ |
1348 | if (integer_zerop (PHI_ARG_DEF (phi, 1))) |
1349 | tmp = PHI_ARG_DEF (phi, 0); | |
1350 | else if (integer_zerop (PHI_ARG_DEF (phi, 0))) | |
1351 | tmp = PHI_ARG_DEF (phi, 1); | |
1352 | else | |
1353 | return; | |
b258210c MJ |
1354 | if (TREE_CODE (tmp) != SSA_NAME |
1355 | || SSA_NAME_IS_DEFAULT_DEF (tmp) | |
1356 | || !POINTER_TYPE_P (TREE_TYPE (tmp)) | |
1357 | || TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) != RECORD_TYPE) | |
1358 | return; | |
1359 | ||
1360 | assign = SSA_NAME_DEF_STMT (tmp); | |
1361 | assign_bb = gimple_bb (assign); | |
40591473 | 1362 | if (!single_pred_p (assign_bb)) |
b258210c | 1363 | return; |
40591473 MJ |
1364 | expr = get_ancestor_addr_info (assign, &obj, &offset); |
1365 | if (!expr) | |
b258210c MJ |
1366 | return; |
1367 | parm = TREE_OPERAND (expr, 0); | |
b258210c | 1368 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (parm)); |
20afe640 EB |
1369 | if (index < 0) |
1370 | return; | |
b258210c MJ |
1371 | |
1372 | cond_bb = single_pred (assign_bb); | |
1373 | cond = last_stmt (cond_bb); | |
69610617 SB |
1374 | if (!cond |
1375 | || gimple_code (cond) != GIMPLE_COND | |
b258210c MJ |
1376 | || gimple_cond_code (cond) != NE_EXPR |
1377 | || gimple_cond_lhs (cond) != parm | |
1378 | || !integer_zerop (gimple_cond_rhs (cond))) | |
1379 | return; | |
1380 | ||
b258210c MJ |
1381 | phi_bb = gimple_bb (phi); |
1382 | for (i = 0; i < 2; i++) | |
1383 | { | |
1384 | basic_block pred = EDGE_PRED (phi_bb, i)->src; | |
1385 | if (pred != assign_bb && pred != cond_bb) | |
1386 | return; | |
1387 | } | |
1388 | ||
3b97a5c7 MJ |
1389 | ipa_set_ancestor_jf (jfunc, offset, index, |
1390 | parm_ref_data_pass_through_p (fbi, index, call, parm)); | |
b258210c MJ |
1391 | } |
1392 | ||
be95e2b9 MJ |
1393 | /* Inspect the given TYPE and return true iff it has the same structure (the |
1394 | same number of fields of the same types) as a C++ member pointer. If | |
1395 | METHOD_PTR and DELTA are non-NULL, store the trees representing the | |
1396 | corresponding fields there. */ | |
1397 | ||
3e293154 MJ |
1398 | static bool |
1399 | type_like_member_ptr_p (tree type, tree *method_ptr, tree *delta) | |
1400 | { | |
1401 | tree fld; | |
1402 | ||
1403 | if (TREE_CODE (type) != RECORD_TYPE) | |
1404 | return false; | |
1405 | ||
1406 | fld = TYPE_FIELDS (type); | |
1407 | if (!fld || !POINTER_TYPE_P (TREE_TYPE (fld)) | |
8b7773a4 | 1408 | || TREE_CODE (TREE_TYPE (TREE_TYPE (fld))) != METHOD_TYPE |
cc269bb6 | 1409 | || !tree_fits_uhwi_p (DECL_FIELD_OFFSET (fld))) |
3e293154 MJ |
1410 | return false; |
1411 | ||
1412 | if (method_ptr) | |
1413 | *method_ptr = fld; | |
1414 | ||
910ad8de | 1415 | fld = DECL_CHAIN (fld); |
8b7773a4 | 1416 | if (!fld || INTEGRAL_TYPE_P (fld) |
cc269bb6 | 1417 | || !tree_fits_uhwi_p (DECL_FIELD_OFFSET (fld))) |
3e293154 MJ |
1418 | return false; |
1419 | if (delta) | |
1420 | *delta = fld; | |
1421 | ||
910ad8de | 1422 | if (DECL_CHAIN (fld)) |
3e293154 MJ |
1423 | return false; |
1424 | ||
1425 | return true; | |
1426 | } | |
1427 | ||
61502ca8 | 1428 | /* If RHS is an SSA_NAME and it is defined by a simple copy assign statement, |
8b7773a4 MJ |
1429 | return the rhs of its defining statement. Otherwise return RHS as it |
1430 | is. */ | |
7ec49257 MJ |
1431 | |
1432 | static inline tree | |
1433 | get_ssa_def_if_simple_copy (tree rhs) | |
1434 | { | |
1435 | while (TREE_CODE (rhs) == SSA_NAME && !SSA_NAME_IS_DEFAULT_DEF (rhs)) | |
1436 | { | |
1437 | gimple def_stmt = SSA_NAME_DEF_STMT (rhs); | |
1438 | ||
1439 | if (gimple_assign_single_p (def_stmt)) | |
1440 | rhs = gimple_assign_rhs1 (def_stmt); | |
9961eb45 MJ |
1441 | else |
1442 | break; | |
7ec49257 MJ |
1443 | } |
1444 | return rhs; | |
1445 | } | |
1446 | ||
8b7773a4 MJ |
1447 | /* Simple linked list, describing known contents of an aggregate beforere |
1448 | call. */ | |
1449 | ||
1450 | struct ipa_known_agg_contents_list | |
1451 | { | |
1452 | /* Offset and size of the described part of the aggregate. */ | |
1453 | HOST_WIDE_INT offset, size; | |
1454 | /* Known constant value or NULL if the contents is known to be unknown. */ | |
1455 | tree constant; | |
1456 | /* Pointer to the next structure in the list. */ | |
1457 | struct ipa_known_agg_contents_list *next; | |
1458 | }; | |
3e293154 | 1459 | |
0d48ee34 MJ |
1460 | /* Find the proper place in linked list of ipa_known_agg_contents_list |
1461 | structures where to put a new one with the given LHS_OFFSET and LHS_SIZE, | |
1462 | unless there is a partial overlap, in which case return NULL, or such | |
1463 | element is already there, in which case set *ALREADY_THERE to true. */ | |
1464 | ||
1465 | static struct ipa_known_agg_contents_list ** | |
1466 | get_place_in_agg_contents_list (struct ipa_known_agg_contents_list **list, | |
1467 | HOST_WIDE_INT lhs_offset, | |
1468 | HOST_WIDE_INT lhs_size, | |
1469 | bool *already_there) | |
1470 | { | |
1471 | struct ipa_known_agg_contents_list **p = list; | |
1472 | while (*p && (*p)->offset < lhs_offset) | |
1473 | { | |
1474 | if ((*p)->offset + (*p)->size > lhs_offset) | |
1475 | return NULL; | |
1476 | p = &(*p)->next; | |
1477 | } | |
1478 | ||
1479 | if (*p && (*p)->offset < lhs_offset + lhs_size) | |
1480 | { | |
1481 | if ((*p)->offset == lhs_offset && (*p)->size == lhs_size) | |
1482 | /* We already know this value is subsequently overwritten with | |
1483 | something else. */ | |
1484 | *already_there = true; | |
1485 | else | |
1486 | /* Otherwise this is a partial overlap which we cannot | |
1487 | represent. */ | |
1488 | return NULL; | |
1489 | } | |
1490 | return p; | |
1491 | } | |
1492 | ||
1493 | /* Build aggregate jump function from LIST, assuming there are exactly | |
1494 | CONST_COUNT constant entries there and that th offset of the passed argument | |
1495 | is ARG_OFFSET and store it into JFUNC. */ | |
1496 | ||
1497 | static void | |
1498 | build_agg_jump_func_from_list (struct ipa_known_agg_contents_list *list, | |
1499 | int const_count, HOST_WIDE_INT arg_offset, | |
1500 | struct ipa_jump_func *jfunc) | |
1501 | { | |
1502 | vec_alloc (jfunc->agg.items, const_count); | |
1503 | while (list) | |
1504 | { | |
1505 | if (list->constant) | |
1506 | { | |
1507 | struct ipa_agg_jf_item item; | |
1508 | item.offset = list->offset - arg_offset; | |
1509 | gcc_assert ((item.offset % BITS_PER_UNIT) == 0); | |
1510 | item.value = unshare_expr_without_location (list->constant); | |
1511 | jfunc->agg.items->quick_push (item); | |
1512 | } | |
1513 | list = list->next; | |
1514 | } | |
1515 | } | |
1516 | ||
8b7773a4 MJ |
1517 | /* Traverse statements from CALL backwards, scanning whether an aggregate given |
1518 | in ARG is filled in with constant values. ARG can either be an aggregate | |
0d48ee34 MJ |
1519 | expression or a pointer to an aggregate. ARG_TYPE is the type of the |
1520 | aggregate. JFUNC is the jump function into which the constants are | |
1521 | subsequently stored. */ | |
be95e2b9 | 1522 | |
3e293154 | 1523 | static void |
538dd0b7 DM |
1524 | determine_locally_known_aggregate_parts (gcall *call, tree arg, |
1525 | tree arg_type, | |
0d48ee34 | 1526 | struct ipa_jump_func *jfunc) |
3e293154 | 1527 | { |
8b7773a4 MJ |
1528 | struct ipa_known_agg_contents_list *list = NULL; |
1529 | int item_count = 0, const_count = 0; | |
1530 | HOST_WIDE_INT arg_offset, arg_size; | |
726a989a | 1531 | gimple_stmt_iterator gsi; |
8b7773a4 MJ |
1532 | tree arg_base; |
1533 | bool check_ref, by_ref; | |
1534 | ao_ref r; | |
3e293154 | 1535 | |
8b7773a4 MJ |
1536 | /* The function operates in three stages. First, we prepare check_ref, r, |
1537 | arg_base and arg_offset based on what is actually passed as an actual | |
1538 | argument. */ | |
3e293154 | 1539 | |
85942f45 | 1540 | if (POINTER_TYPE_P (arg_type)) |
8b7773a4 MJ |
1541 | { |
1542 | by_ref = true; | |
1543 | if (TREE_CODE (arg) == SSA_NAME) | |
1544 | { | |
1545 | tree type_size; | |
85942f45 | 1546 | if (!tree_fits_uhwi_p (TYPE_SIZE (TREE_TYPE (arg_type)))) |
8b7773a4 MJ |
1547 | return; |
1548 | check_ref = true; | |
1549 | arg_base = arg; | |
1550 | arg_offset = 0; | |
85942f45 | 1551 | type_size = TYPE_SIZE (TREE_TYPE (arg_type)); |
ae7e9ddd | 1552 | arg_size = tree_to_uhwi (type_size); |
8b7773a4 MJ |
1553 | ao_ref_init_from_ptr_and_size (&r, arg_base, NULL_TREE); |
1554 | } | |
1555 | else if (TREE_CODE (arg) == ADDR_EXPR) | |
1556 | { | |
1557 | HOST_WIDE_INT arg_max_size; | |
1558 | ||
1559 | arg = TREE_OPERAND (arg, 0); | |
1560 | arg_base = get_ref_base_and_extent (arg, &arg_offset, &arg_size, | |
1561 | &arg_max_size); | |
1562 | if (arg_max_size == -1 | |
1563 | || arg_max_size != arg_size | |
1564 | || arg_offset < 0) | |
1565 | return; | |
1566 | if (DECL_P (arg_base)) | |
1567 | { | |
8b7773a4 | 1568 | check_ref = false; |
0d48ee34 | 1569 | ao_ref_init (&r, arg_base); |
8b7773a4 MJ |
1570 | } |
1571 | else | |
1572 | return; | |
1573 | } | |
1574 | else | |
1575 | return; | |
1576 | } | |
1577 | else | |
1578 | { | |
1579 | HOST_WIDE_INT arg_max_size; | |
1580 | ||
1581 | gcc_checking_assert (AGGREGATE_TYPE_P (TREE_TYPE (arg))); | |
1582 | ||
1583 | by_ref = false; | |
1584 | check_ref = false; | |
1585 | arg_base = get_ref_base_and_extent (arg, &arg_offset, &arg_size, | |
1586 | &arg_max_size); | |
1587 | if (arg_max_size == -1 | |
1588 | || arg_max_size != arg_size | |
1589 | || arg_offset < 0) | |
1590 | return; | |
1591 | ||
1592 | ao_ref_init (&r, arg); | |
1593 | } | |
1594 | ||
1595 | /* Second stage walks back the BB, looks at individual statements and as long | |
1596 | as it is confident of how the statements affect contents of the | |
1597 | aggregates, it builds a sorted linked list of ipa_agg_jf_list structures | |
1598 | describing it. */ | |
1599 | gsi = gsi_for_stmt (call); | |
726a989a RB |
1600 | gsi_prev (&gsi); |
1601 | for (; !gsi_end_p (gsi); gsi_prev (&gsi)) | |
3e293154 | 1602 | { |
8b7773a4 | 1603 | struct ipa_known_agg_contents_list *n, **p; |
726a989a | 1604 | gimple stmt = gsi_stmt (gsi); |
8b7773a4 MJ |
1605 | HOST_WIDE_INT lhs_offset, lhs_size, lhs_max_size; |
1606 | tree lhs, rhs, lhs_base; | |
3e293154 | 1607 | |
8b7773a4 | 1608 | if (!stmt_may_clobber_ref_p_1 (stmt, &r)) |
8aa29647 | 1609 | continue; |
8b75fc9b | 1610 | if (!gimple_assign_single_p (stmt)) |
8b7773a4 | 1611 | break; |
3e293154 | 1612 | |
726a989a RB |
1613 | lhs = gimple_assign_lhs (stmt); |
1614 | rhs = gimple_assign_rhs1 (stmt); | |
0c6b087c | 1615 | if (!is_gimple_reg_type (TREE_TYPE (rhs)) |
7d2fb524 MJ |
1616 | || TREE_CODE (lhs) == BIT_FIELD_REF |
1617 | || contains_bitfld_component_ref_p (lhs)) | |
8b7773a4 | 1618 | break; |
3e293154 | 1619 | |
8b7773a4 MJ |
1620 | lhs_base = get_ref_base_and_extent (lhs, &lhs_offset, &lhs_size, |
1621 | &lhs_max_size); | |
1622 | if (lhs_max_size == -1 | |
0d48ee34 | 1623 | || lhs_max_size != lhs_size) |
8b7773a4 | 1624 | break; |
3e293154 | 1625 | |
8b7773a4 | 1626 | if (check_ref) |
518dc859 | 1627 | { |
8b7773a4 MJ |
1628 | if (TREE_CODE (lhs_base) != MEM_REF |
1629 | || TREE_OPERAND (lhs_base, 0) != arg_base | |
1630 | || !integer_zerop (TREE_OPERAND (lhs_base, 1))) | |
1631 | break; | |
3e293154 | 1632 | } |
8b7773a4 | 1633 | else if (lhs_base != arg_base) |
774b8a55 MJ |
1634 | { |
1635 | if (DECL_P (lhs_base)) | |
1636 | continue; | |
1637 | else | |
1638 | break; | |
1639 | } | |
3e293154 | 1640 | |
0d48ee34 MJ |
1641 | bool already_there = false; |
1642 | p = get_place_in_agg_contents_list (&list, lhs_offset, lhs_size, | |
1643 | &already_there); | |
1644 | if (!p) | |
8b7773a4 | 1645 | break; |
0d48ee34 MJ |
1646 | if (already_there) |
1647 | continue; | |
3e293154 | 1648 | |
8b7773a4 MJ |
1649 | rhs = get_ssa_def_if_simple_copy (rhs); |
1650 | n = XALLOCA (struct ipa_known_agg_contents_list); | |
1651 | n->size = lhs_size; | |
1652 | n->offset = lhs_offset; | |
1653 | if (is_gimple_ip_invariant (rhs)) | |
1654 | { | |
1655 | n->constant = rhs; | |
1656 | const_count++; | |
1657 | } | |
1658 | else | |
1659 | n->constant = NULL_TREE; | |
1660 | n->next = *p; | |
1661 | *p = n; | |
3e293154 | 1662 | |
8b7773a4 | 1663 | item_count++; |
dfea20f1 MJ |
1664 | if (const_count == PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS) |
1665 | || item_count == 2 * PARAM_VALUE (PARAM_IPA_MAX_AGG_ITEMS)) | |
8b7773a4 MJ |
1666 | break; |
1667 | } | |
be95e2b9 | 1668 | |
8b7773a4 MJ |
1669 | /* Third stage just goes over the list and creates an appropriate vector of |
1670 | ipa_agg_jf_item structures out of it, of sourse only if there are | |
1671 | any known constants to begin with. */ | |
3e293154 | 1672 | |
8b7773a4 | 1673 | if (const_count) |
3e293154 | 1674 | { |
8b7773a4 | 1675 | jfunc->agg.by_ref = by_ref; |
0d48ee34 | 1676 | build_agg_jump_func_from_list (list, const_count, arg_offset, jfunc); |
3e293154 MJ |
1677 | } |
1678 | } | |
1679 | ||
06d65050 JH |
1680 | static tree |
1681 | ipa_get_callee_param_type (struct cgraph_edge *e, int i) | |
1682 | { | |
1683 | int n; | |
1684 | tree type = (e->callee | |
67348ccc | 1685 | ? TREE_TYPE (e->callee->decl) |
06d65050 JH |
1686 | : gimple_call_fntype (e->call_stmt)); |
1687 | tree t = TYPE_ARG_TYPES (type); | |
1688 | ||
1689 | for (n = 0; n < i; n++) | |
1690 | { | |
1691 | if (!t) | |
1692 | break; | |
1693 | t = TREE_CHAIN (t); | |
1694 | } | |
1695 | if (t) | |
1696 | return TREE_VALUE (t); | |
1697 | if (!e->callee) | |
1698 | return NULL; | |
67348ccc | 1699 | t = DECL_ARGUMENTS (e->callee->decl); |
06d65050 JH |
1700 | for (n = 0; n < i; n++) |
1701 | { | |
1702 | if (!t) | |
1703 | return NULL; | |
1704 | t = TREE_CHAIN (t); | |
1705 | } | |
1706 | if (t) | |
1707 | return TREE_TYPE (t); | |
1708 | return NULL; | |
1709 | } | |
1710 | ||
3e293154 MJ |
1711 | /* Compute jump function for all arguments of callsite CS and insert the |
1712 | information in the jump_functions array in the ipa_edge_args corresponding | |
1713 | to this callsite. */ | |
be95e2b9 | 1714 | |
749aa96d | 1715 | static void |
8aab5218 | 1716 | ipa_compute_jump_functions_for_edge (struct func_body_info *fbi, |
062c604f | 1717 | struct cgraph_edge *cs) |
3e293154 MJ |
1718 | { |
1719 | struct ipa_node_params *info = IPA_NODE_REF (cs->caller); | |
606d9a09 | 1720 | struct ipa_edge_args *args = IPA_EDGE_REF (cs); |
538dd0b7 | 1721 | gcall *call = cs->call_stmt; |
8b7773a4 | 1722 | int n, arg_num = gimple_call_num_args (call); |
5ce97055 | 1723 | bool useful_context = false; |
3e293154 | 1724 | |
606d9a09 | 1725 | if (arg_num == 0 || args->jump_functions) |
3e293154 | 1726 | return; |
9771b263 | 1727 | vec_safe_grow_cleared (args->jump_functions, arg_num); |
5ce97055 JH |
1728 | if (flag_devirtualize) |
1729 | vec_safe_grow_cleared (args->polymorphic_call_contexts, arg_num); | |
3e293154 | 1730 | |
96e24d49 JJ |
1731 | if (gimple_call_internal_p (call)) |
1732 | return; | |
5fe8e757 MJ |
1733 | if (ipa_func_spec_opts_forbid_analysis_p (cs->caller)) |
1734 | return; | |
1735 | ||
8b7773a4 MJ |
1736 | for (n = 0; n < arg_num; n++) |
1737 | { | |
1738 | struct ipa_jump_func *jfunc = ipa_get_ith_jump_func (args, n); | |
1739 | tree arg = gimple_call_arg (call, n); | |
06d65050 | 1740 | tree param_type = ipa_get_callee_param_type (cs, n); |
5ce97055 JH |
1741 | if (flag_devirtualize && POINTER_TYPE_P (TREE_TYPE (arg))) |
1742 | { | |
049e6d36 | 1743 | tree instance; |
5ce97055 JH |
1744 | struct ipa_polymorphic_call_context context (cs->caller->decl, |
1745 | arg, cs->call_stmt, | |
049e6d36 JH |
1746 | &instance); |
1747 | context.get_dynamic_type (instance, arg, NULL, cs->call_stmt); | |
5ce97055 JH |
1748 | *ipa_get_ith_polymorhic_call_context (args, n) = context; |
1749 | if (!context.useless_p ()) | |
1750 | useful_context = true; | |
1751 | } | |
3e293154 | 1752 | |
04be694e MJ |
1753 | if (POINTER_TYPE_P (TREE_TYPE(arg))) |
1754 | { | |
1755 | unsigned HOST_WIDE_INT hwi_bitpos; | |
1756 | unsigned align; | |
1757 | ||
1758 | if (get_pointer_alignment_1 (arg, &align, &hwi_bitpos) | |
fda3e285 MJ |
1759 | && align % BITS_PER_UNIT == 0 |
1760 | && hwi_bitpos % BITS_PER_UNIT == 0) | |
04be694e MJ |
1761 | { |
1762 | jfunc->alignment.known = true; | |
fda3e285 | 1763 | jfunc->alignment.align = align / BITS_PER_UNIT; |
04be694e MJ |
1764 | jfunc->alignment.misalign = hwi_bitpos / BITS_PER_UNIT; |
1765 | } | |
1766 | else | |
1767 | gcc_assert (!jfunc->alignment.known); | |
1768 | } | |
1769 | else | |
1770 | gcc_assert (!jfunc->alignment.known); | |
1771 | ||
8b7773a4 | 1772 | if (is_gimple_ip_invariant (arg)) |
4502fe8d | 1773 | ipa_set_jf_constant (jfunc, arg, cs); |
8b7773a4 MJ |
1774 | else if (!is_gimple_reg_type (TREE_TYPE (arg)) |
1775 | && TREE_CODE (arg) == PARM_DECL) | |
1776 | { | |
1777 | int index = ipa_get_param_decl_index (info, arg); | |
1778 | ||
1779 | gcc_assert (index >=0); | |
1780 | /* Aggregate passed by value, check for pass-through, otherwise we | |
1781 | will attempt to fill in aggregate contents later in this | |
1782 | for cycle. */ | |
8aab5218 | 1783 | if (parm_preserved_before_stmt_p (fbi, index, call, arg)) |
8b7773a4 | 1784 | { |
3b97a5c7 | 1785 | ipa_set_jf_simple_pass_through (jfunc, index, false); |
8b7773a4 MJ |
1786 | continue; |
1787 | } | |
1788 | } | |
1789 | else if (TREE_CODE (arg) == SSA_NAME) | |
1790 | { | |
1791 | if (SSA_NAME_IS_DEFAULT_DEF (arg)) | |
1792 | { | |
1793 | int index = ipa_get_param_decl_index (info, SSA_NAME_VAR (arg)); | |
b8f6e610 | 1794 | if (index >= 0) |
8b7773a4 | 1795 | { |
3b97a5c7 | 1796 | bool agg_p; |
8aab5218 | 1797 | agg_p = parm_ref_data_pass_through_p (fbi, index, call, arg); |
3b97a5c7 | 1798 | ipa_set_jf_simple_pass_through (jfunc, index, agg_p); |
8b7773a4 MJ |
1799 | } |
1800 | } | |
1801 | else | |
1802 | { | |
1803 | gimple stmt = SSA_NAME_DEF_STMT (arg); | |
1804 | if (is_gimple_assign (stmt)) | |
8aab5218 | 1805 | compute_complex_assign_jump_func (fbi, info, jfunc, |
06d65050 | 1806 | call, stmt, arg, param_type); |
8b7773a4 | 1807 | else if (gimple_code (stmt) == GIMPLE_PHI) |
8aab5218 | 1808 | compute_complex_ancestor_jump_func (fbi, info, jfunc, |
538dd0b7 DM |
1809 | call, |
1810 | as_a <gphi *> (stmt)); | |
8b7773a4 MJ |
1811 | } |
1812 | } | |
3e293154 | 1813 | |
85942f45 JH |
1814 | /* If ARG is pointer, we can not use its type to determine the type of aggregate |
1815 | passed (because type conversions are ignored in gimple). Usually we can | |
1816 | safely get type from function declaration, but in case of K&R prototypes or | |
1817 | variadic functions we can try our luck with type of the pointer passed. | |
1818 | TODO: Since we look for actual initialization of the memory object, we may better | |
1819 | work out the type based on the memory stores we find. */ | |
1820 | if (!param_type) | |
1821 | param_type = TREE_TYPE (arg); | |
1822 | ||
8b7773a4 MJ |
1823 | if ((jfunc->type != IPA_JF_PASS_THROUGH |
1824 | || !ipa_get_jf_pass_through_agg_preserved (jfunc)) | |
1825 | && (jfunc->type != IPA_JF_ANCESTOR | |
1826 | || !ipa_get_jf_ancestor_agg_preserved (jfunc)) | |
1827 | && (AGGREGATE_TYPE_P (TREE_TYPE (arg)) | |
85942f45 | 1828 | || POINTER_TYPE_P (param_type))) |
0d48ee34 | 1829 | determine_locally_known_aggregate_parts (call, arg, param_type, jfunc); |
8b7773a4 | 1830 | } |
5ce97055 JH |
1831 | if (!useful_context) |
1832 | vec_free (args->polymorphic_call_contexts); | |
3e293154 MJ |
1833 | } |
1834 | ||
749aa96d | 1835 | /* Compute jump functions for all edges - both direct and indirect - outgoing |
8aab5218 | 1836 | from BB. */ |
749aa96d | 1837 | |
062c604f | 1838 | static void |
8aab5218 | 1839 | ipa_compute_jump_functions_for_bb (struct func_body_info *fbi, basic_block bb) |
749aa96d | 1840 | { |
8aab5218 MJ |
1841 | struct ipa_bb_info *bi = ipa_get_bb_info (fbi, bb); |
1842 | int i; | |
749aa96d MJ |
1843 | struct cgraph_edge *cs; |
1844 | ||
8aab5218 | 1845 | FOR_EACH_VEC_ELT_REVERSE (bi->cg_edges, i, cs) |
749aa96d | 1846 | { |
8aab5218 | 1847 | struct cgraph_node *callee = cs->callee; |
749aa96d | 1848 | |
8aab5218 MJ |
1849 | if (callee) |
1850 | { | |
d52f5295 | 1851 | callee->ultimate_alias_target (); |
8aab5218 MJ |
1852 | /* We do not need to bother analyzing calls to unknown functions |
1853 | unless they may become known during lto/whopr. */ | |
1854 | if (!callee->definition && !flag_lto) | |
1855 | continue; | |
1856 | } | |
1857 | ipa_compute_jump_functions_for_edge (fbi, cs); | |
1858 | } | |
749aa96d MJ |
1859 | } |
1860 | ||
8b7773a4 MJ |
1861 | /* If STMT looks like a statement loading a value from a member pointer formal |
1862 | parameter, return that parameter and store the offset of the field to | |
1863 | *OFFSET_P, if it is non-NULL. Otherwise return NULL (but *OFFSET_P still | |
1864 | might be clobbered). If USE_DELTA, then we look for a use of the delta | |
1865 | field rather than the pfn. */ | |
be95e2b9 | 1866 | |
3e293154 | 1867 | static tree |
8b7773a4 MJ |
1868 | ipa_get_stmt_member_ptr_load_param (gimple stmt, bool use_delta, |
1869 | HOST_WIDE_INT *offset_p) | |
3e293154 | 1870 | { |
8b7773a4 MJ |
1871 | tree rhs, rec, ref_field, ref_offset, fld, ptr_field, delta_field; |
1872 | ||
1873 | if (!gimple_assign_single_p (stmt)) | |
1874 | return NULL_TREE; | |
3e293154 | 1875 | |
8b7773a4 | 1876 | rhs = gimple_assign_rhs1 (stmt); |
ae788515 EB |
1877 | if (TREE_CODE (rhs) == COMPONENT_REF) |
1878 | { | |
1879 | ref_field = TREE_OPERAND (rhs, 1); | |
1880 | rhs = TREE_OPERAND (rhs, 0); | |
1881 | } | |
1882 | else | |
1883 | ref_field = NULL_TREE; | |
d242d063 | 1884 | if (TREE_CODE (rhs) != MEM_REF) |
3e293154 | 1885 | return NULL_TREE; |
3e293154 | 1886 | rec = TREE_OPERAND (rhs, 0); |
d242d063 MJ |
1887 | if (TREE_CODE (rec) != ADDR_EXPR) |
1888 | return NULL_TREE; | |
1889 | rec = TREE_OPERAND (rec, 0); | |
3e293154 | 1890 | if (TREE_CODE (rec) != PARM_DECL |
6f7b8b70 | 1891 | || !type_like_member_ptr_p (TREE_TYPE (rec), &ptr_field, &delta_field)) |
3e293154 | 1892 | return NULL_TREE; |
d242d063 | 1893 | ref_offset = TREE_OPERAND (rhs, 1); |
ae788515 | 1894 | |
8b7773a4 MJ |
1895 | if (use_delta) |
1896 | fld = delta_field; | |
1897 | else | |
1898 | fld = ptr_field; | |
1899 | if (offset_p) | |
1900 | *offset_p = int_bit_position (fld); | |
1901 | ||
ae788515 EB |
1902 | if (ref_field) |
1903 | { | |
1904 | if (integer_nonzerop (ref_offset)) | |
1905 | return NULL_TREE; | |
ae788515 EB |
1906 | return ref_field == fld ? rec : NULL_TREE; |
1907 | } | |
3e293154 | 1908 | else |
8b7773a4 MJ |
1909 | return tree_int_cst_equal (byte_position (fld), ref_offset) ? rec |
1910 | : NULL_TREE; | |
3e293154 MJ |
1911 | } |
1912 | ||
1913 | /* Returns true iff T is an SSA_NAME defined by a statement. */ | |
be95e2b9 | 1914 | |
3e293154 MJ |
1915 | static bool |
1916 | ipa_is_ssa_with_stmt_def (tree t) | |
1917 | { | |
1918 | if (TREE_CODE (t) == SSA_NAME | |
1919 | && !SSA_NAME_IS_DEFAULT_DEF (t)) | |
1920 | return true; | |
1921 | else | |
1922 | return false; | |
1923 | } | |
1924 | ||
40591473 MJ |
1925 | /* Find the indirect call graph edge corresponding to STMT and mark it as a |
1926 | call to a parameter number PARAM_INDEX. NODE is the caller. Return the | |
1927 | indirect call graph edge. */ | |
be95e2b9 | 1928 | |
40591473 | 1929 | static struct cgraph_edge * |
538dd0b7 DM |
1930 | ipa_note_param_call (struct cgraph_node *node, int param_index, |
1931 | gcall *stmt) | |
3e293154 | 1932 | { |
e33c6cd6 | 1933 | struct cgraph_edge *cs; |
3e293154 | 1934 | |
d52f5295 | 1935 | cs = node->get_edge (stmt); |
b258210c | 1936 | cs->indirect_info->param_index = param_index; |
8b7773a4 | 1937 | cs->indirect_info->agg_contents = 0; |
c13bc3d9 | 1938 | cs->indirect_info->member_ptr = 0; |
40591473 | 1939 | return cs; |
3e293154 MJ |
1940 | } |
1941 | ||
e33c6cd6 | 1942 | /* Analyze the CALL and examine uses of formal parameters of the caller NODE |
c419671c | 1943 | (described by INFO). PARMS_AINFO is a pointer to a vector containing |
062c604f MJ |
1944 | intermediate information about each formal parameter. Currently it checks |
1945 | whether the call calls a pointer that is a formal parameter and if so, the | |
1946 | parameter is marked with the called flag and an indirect call graph edge | |
1947 | describing the call is created. This is very simple for ordinary pointers | |
1948 | represented in SSA but not-so-nice when it comes to member pointers. The | |
1949 | ugly part of this function does nothing more than trying to match the | |
1950 | pattern of such a call. An example of such a pattern is the gimple dump | |
1951 | below, the call is on the last line: | |
3e293154 | 1952 | |
ae788515 EB |
1953 | <bb 2>: |
1954 | f$__delta_5 = f.__delta; | |
1955 | f$__pfn_24 = f.__pfn; | |
1956 | ||
1957 | or | |
3e293154 | 1958 | <bb 2>: |
d242d063 MJ |
1959 | f$__delta_5 = MEM[(struct *)&f]; |
1960 | f$__pfn_24 = MEM[(struct *)&f + 4B]; | |
8aa29647 | 1961 | |
ae788515 | 1962 | and a few lines below: |
8aa29647 MJ |
1963 | |
1964 | <bb 5> | |
3e293154 MJ |
1965 | D.2496_3 = (int) f$__pfn_24; |
1966 | D.2497_4 = D.2496_3 & 1; | |
1967 | if (D.2497_4 != 0) | |
1968 | goto <bb 3>; | |
1969 | else | |
1970 | goto <bb 4>; | |
1971 | ||
8aa29647 | 1972 | <bb 6>: |
3e293154 MJ |
1973 | D.2500_7 = (unsigned int) f$__delta_5; |
1974 | D.2501_8 = &S + D.2500_7; | |
1975 | D.2502_9 = (int (*__vtbl_ptr_type) (void) * *) D.2501_8; | |
1976 | D.2503_10 = *D.2502_9; | |
1977 | D.2504_12 = f$__pfn_24 + -1; | |
1978 | D.2505_13 = (unsigned int) D.2504_12; | |
1979 | D.2506_14 = D.2503_10 + D.2505_13; | |
1980 | D.2507_15 = *D.2506_14; | |
1981 | iftmp.11_16 = (String:: *) D.2507_15; | |
1982 | ||
8aa29647 | 1983 | <bb 7>: |
3e293154 MJ |
1984 | # iftmp.11_1 = PHI <iftmp.11_16(3), f$__pfn_24(2)> |
1985 | D.2500_19 = (unsigned int) f$__delta_5; | |
1986 | D.2508_20 = &S + D.2500_19; | |
1987 | D.2493_21 = iftmp.11_1 (D.2508_20, 4); | |
1988 | ||
1989 | Such patterns are results of simple calls to a member pointer: | |
1990 | ||
1991 | int doprinting (int (MyString::* f)(int) const) | |
1992 | { | |
1993 | MyString S ("somestring"); | |
1994 | ||
1995 | return (S.*f)(4); | |
1996 | } | |
8b7773a4 MJ |
1997 | |
1998 | Moreover, the function also looks for called pointers loaded from aggregates | |
1999 | passed by value or reference. */ | |
3e293154 MJ |
2000 | |
2001 | static void | |
538dd0b7 | 2002 | ipa_analyze_indirect_call_uses (struct func_body_info *fbi, gcall *call, |
8aab5218 | 2003 | tree target) |
3e293154 | 2004 | { |
8aab5218 | 2005 | struct ipa_node_params *info = fbi->info; |
8b7773a4 MJ |
2006 | HOST_WIDE_INT offset; |
2007 | bool by_ref; | |
3e293154 | 2008 | |
3e293154 MJ |
2009 | if (SSA_NAME_IS_DEFAULT_DEF (target)) |
2010 | { | |
b258210c | 2011 | tree var = SSA_NAME_VAR (target); |
8aab5218 | 2012 | int index = ipa_get_param_decl_index (info, var); |
3e293154 | 2013 | if (index >= 0) |
8aab5218 | 2014 | ipa_note_param_call (fbi->node, index, call); |
3e293154 MJ |
2015 | return; |
2016 | } | |
2017 | ||
8aab5218 MJ |
2018 | int index; |
2019 | gimple def = SSA_NAME_DEF_STMT (target); | |
8b7773a4 | 2020 | if (gimple_assign_single_p (def) |
8aab5218 | 2021 | && ipa_load_from_parm_agg_1 (fbi, info->descriptors, def, |
8b7773a4 | 2022 | gimple_assign_rhs1 (def), &index, &offset, |
3ff2ca23 | 2023 | NULL, &by_ref)) |
8b7773a4 | 2024 | { |
8aab5218 | 2025 | struct cgraph_edge *cs = ipa_note_param_call (fbi->node, index, call); |
8b7773a4 MJ |
2026 | cs->indirect_info->offset = offset; |
2027 | cs->indirect_info->agg_contents = 1; | |
2028 | cs->indirect_info->by_ref = by_ref; | |
2029 | return; | |
2030 | } | |
2031 | ||
3e293154 MJ |
2032 | /* Now we need to try to match the complex pattern of calling a member |
2033 | pointer. */ | |
8b7773a4 MJ |
2034 | if (gimple_code (def) != GIMPLE_PHI |
2035 | || gimple_phi_num_args (def) != 2 | |
2036 | || !POINTER_TYPE_P (TREE_TYPE (target)) | |
3e293154 MJ |
2037 | || TREE_CODE (TREE_TYPE (TREE_TYPE (target))) != METHOD_TYPE) |
2038 | return; | |
2039 | ||
3e293154 MJ |
2040 | /* First, we need to check whether one of these is a load from a member |
2041 | pointer that is a parameter to this function. */ | |
8aab5218 MJ |
2042 | tree n1 = PHI_ARG_DEF (def, 0); |
2043 | tree n2 = PHI_ARG_DEF (def, 1); | |
1fc8feb5 | 2044 | if (!ipa_is_ssa_with_stmt_def (n1) || !ipa_is_ssa_with_stmt_def (n2)) |
3e293154 | 2045 | return; |
8aab5218 MJ |
2046 | gimple d1 = SSA_NAME_DEF_STMT (n1); |
2047 | gimple d2 = SSA_NAME_DEF_STMT (n2); | |
3e293154 | 2048 | |
8aab5218 MJ |
2049 | tree rec; |
2050 | basic_block bb, virt_bb; | |
2051 | basic_block join = gimple_bb (def); | |
8b7773a4 | 2052 | if ((rec = ipa_get_stmt_member_ptr_load_param (d1, false, &offset))) |
3e293154 | 2053 | { |
8b7773a4 | 2054 | if (ipa_get_stmt_member_ptr_load_param (d2, false, NULL)) |
3e293154 MJ |
2055 | return; |
2056 | ||
8aa29647 | 2057 | bb = EDGE_PRED (join, 0)->src; |
726a989a | 2058 | virt_bb = gimple_bb (d2); |
3e293154 | 2059 | } |
8b7773a4 | 2060 | else if ((rec = ipa_get_stmt_member_ptr_load_param (d2, false, &offset))) |
3e293154 | 2061 | { |
8aa29647 | 2062 | bb = EDGE_PRED (join, 1)->src; |
726a989a | 2063 | virt_bb = gimple_bb (d1); |
3e293154 MJ |
2064 | } |
2065 | else | |
2066 | return; | |
2067 | ||
2068 | /* Second, we need to check that the basic blocks are laid out in the way | |
2069 | corresponding to the pattern. */ | |
2070 | ||
3e293154 MJ |
2071 | if (!single_pred_p (virt_bb) || !single_succ_p (virt_bb) |
2072 | || single_pred (virt_bb) != bb | |
2073 | || single_succ (virt_bb) != join) | |
2074 | return; | |
2075 | ||
2076 | /* Third, let's see that the branching is done depending on the least | |
2077 | significant bit of the pfn. */ | |
2078 | ||
8aab5218 | 2079 | gimple branch = last_stmt (bb); |
8aa29647 | 2080 | if (!branch || gimple_code (branch) != GIMPLE_COND) |
3e293154 MJ |
2081 | return; |
2082 | ||
12430896 RG |
2083 | if ((gimple_cond_code (branch) != NE_EXPR |
2084 | && gimple_cond_code (branch) != EQ_EXPR) | |
726a989a | 2085 | || !integer_zerop (gimple_cond_rhs (branch))) |
3e293154 | 2086 | return; |
3e293154 | 2087 | |
8aab5218 | 2088 | tree cond = gimple_cond_lhs (branch); |
3e293154 MJ |
2089 | if (!ipa_is_ssa_with_stmt_def (cond)) |
2090 | return; | |
2091 | ||
726a989a | 2092 | def = SSA_NAME_DEF_STMT (cond); |
8b75fc9b | 2093 | if (!is_gimple_assign (def) |
726a989a RB |
2094 | || gimple_assign_rhs_code (def) != BIT_AND_EXPR |
2095 | || !integer_onep (gimple_assign_rhs2 (def))) | |
3e293154 | 2096 | return; |
726a989a RB |
2097 | |
2098 | cond = gimple_assign_rhs1 (def); | |
3e293154 MJ |
2099 | if (!ipa_is_ssa_with_stmt_def (cond)) |
2100 | return; | |
2101 | ||
726a989a | 2102 | def = SSA_NAME_DEF_STMT (cond); |
3e293154 | 2103 | |
8b75fc9b MJ |
2104 | if (is_gimple_assign (def) |
2105 | && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (def))) | |
3e293154 | 2106 | { |
726a989a | 2107 | cond = gimple_assign_rhs1 (def); |
3e293154 MJ |
2108 | if (!ipa_is_ssa_with_stmt_def (cond)) |
2109 | return; | |
726a989a | 2110 | def = SSA_NAME_DEF_STMT (cond); |
3e293154 MJ |
2111 | } |
2112 | ||
8aab5218 | 2113 | tree rec2; |
6f7b8b70 RE |
2114 | rec2 = ipa_get_stmt_member_ptr_load_param (def, |
2115 | (TARGET_PTRMEMFUNC_VBIT_LOCATION | |
8b7773a4 MJ |
2116 | == ptrmemfunc_vbit_in_delta), |
2117 | NULL); | |
3e293154 MJ |
2118 | if (rec != rec2) |
2119 | return; | |
2120 | ||
2121 | index = ipa_get_param_decl_index (info, rec); | |
8b7773a4 | 2122 | if (index >= 0 |
8aab5218 | 2123 | && parm_preserved_before_stmt_p (fbi, index, call, rec)) |
8b7773a4 | 2124 | { |
8aab5218 | 2125 | struct cgraph_edge *cs = ipa_note_param_call (fbi->node, index, call); |
8b7773a4 MJ |
2126 | cs->indirect_info->offset = offset; |
2127 | cs->indirect_info->agg_contents = 1; | |
c13bc3d9 | 2128 | cs->indirect_info->member_ptr = 1; |
8b7773a4 | 2129 | } |
3e293154 MJ |
2130 | |
2131 | return; | |
2132 | } | |
2133 | ||
b258210c MJ |
2134 | /* Analyze a CALL to an OBJ_TYPE_REF which is passed in TARGET and if the |
2135 | object referenced in the expression is a formal parameter of the caller | |
8aab5218 MJ |
2136 | FBI->node (described by FBI->info), create a call note for the |
2137 | statement. */ | |
b258210c MJ |
2138 | |
2139 | static void | |
8aab5218 | 2140 | ipa_analyze_virtual_call_uses (struct func_body_info *fbi, |
538dd0b7 | 2141 | gcall *call, tree target) |
b258210c MJ |
2142 | { |
2143 | tree obj = OBJ_TYPE_REF_OBJECT (target); | |
b258210c | 2144 | int index; |
40591473 | 2145 | HOST_WIDE_INT anc_offset; |
b258210c | 2146 | |
05842ff5 MJ |
2147 | if (!flag_devirtualize) |
2148 | return; | |
2149 | ||
40591473 | 2150 | if (TREE_CODE (obj) != SSA_NAME) |
b258210c MJ |
2151 | return; |
2152 | ||
8aab5218 | 2153 | struct ipa_node_params *info = fbi->info; |
40591473 MJ |
2154 | if (SSA_NAME_IS_DEFAULT_DEF (obj)) |
2155 | { | |
8aab5218 | 2156 | struct ipa_jump_func jfunc; |
40591473 MJ |
2157 | if (TREE_CODE (SSA_NAME_VAR (obj)) != PARM_DECL) |
2158 | return; | |
b258210c | 2159 | |
40591473 MJ |
2160 | anc_offset = 0; |
2161 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (obj)); | |
2162 | gcc_assert (index >= 0); | |
06d65050 JH |
2163 | if (detect_type_change_ssa (obj, obj_type_ref_class (target), |
2164 | call, &jfunc)) | |
40591473 MJ |
2165 | return; |
2166 | } | |
2167 | else | |
2168 | { | |
8aab5218 | 2169 | struct ipa_jump_func jfunc; |
40591473 MJ |
2170 | gimple stmt = SSA_NAME_DEF_STMT (obj); |
2171 | tree expr; | |
2172 | ||
2173 | expr = get_ancestor_addr_info (stmt, &obj, &anc_offset); | |
2174 | if (!expr) | |
2175 | return; | |
2176 | index = ipa_get_param_decl_index (info, | |
2177 | SSA_NAME_VAR (TREE_OPERAND (expr, 0))); | |
2178 | gcc_assert (index >= 0); | |
06d65050 JH |
2179 | if (detect_type_change (obj, expr, obj_type_ref_class (target), |
2180 | call, &jfunc, anc_offset)) | |
40591473 MJ |
2181 | return; |
2182 | } | |
2183 | ||
8aab5218 MJ |
2184 | struct cgraph_edge *cs = ipa_note_param_call (fbi->node, index, call); |
2185 | struct cgraph_indirect_call_info *ii = cs->indirect_info; | |
8b7773a4 | 2186 | ii->offset = anc_offset; |
ae7e9ddd | 2187 | ii->otr_token = tree_to_uhwi (OBJ_TYPE_REF_TOKEN (target)); |
c49bdb2e | 2188 | ii->otr_type = obj_type_ref_class (target); |
40591473 | 2189 | ii->polymorphic = 1; |
b258210c MJ |
2190 | } |
2191 | ||
2192 | /* Analyze a call statement CALL whether and how it utilizes formal parameters | |
c419671c | 2193 | of the caller (described by INFO). PARMS_AINFO is a pointer to a vector |
062c604f | 2194 | containing intermediate information about each formal parameter. */ |
b258210c MJ |
2195 | |
2196 | static void | |
538dd0b7 | 2197 | ipa_analyze_call_uses (struct func_body_info *fbi, gcall *call) |
b258210c MJ |
2198 | { |
2199 | tree target = gimple_call_fn (call); | |
b786d31f JH |
2200 | |
2201 | if (!target | |
2202 | || (TREE_CODE (target) != SSA_NAME | |
2203 | && !virtual_method_call_p (target))) | |
2204 | return; | |
b258210c | 2205 | |
7d0aa05b | 2206 | struct cgraph_edge *cs = fbi->node->get_edge (call); |
b786d31f JH |
2207 | /* If we previously turned the call into a direct call, there is |
2208 | no need to analyze. */ | |
b786d31f | 2209 | if (cs && !cs->indirect_unknown_callee) |
25583c4f | 2210 | return; |
7d0aa05b | 2211 | |
a5b58b28 | 2212 | if (cs->indirect_info->polymorphic && flag_devirtualize) |
7d0aa05b | 2213 | { |
7d0aa05b JH |
2214 | tree instance; |
2215 | tree target = gimple_call_fn (call); | |
6f8091fc JH |
2216 | ipa_polymorphic_call_context context (current_function_decl, |
2217 | target, call, &instance); | |
7d0aa05b | 2218 | |
ba392339 JH |
2219 | gcc_checking_assert (cs->indirect_info->otr_type |
2220 | == obj_type_ref_class (target)); | |
2221 | gcc_checking_assert (cs->indirect_info->otr_token | |
2222 | == tree_to_shwi (OBJ_TYPE_REF_TOKEN (target))); | |
7d0aa05b | 2223 | |
29c43c83 JH |
2224 | cs->indirect_info->vptr_changed |
2225 | = !context.get_dynamic_type (instance, | |
2226 | OBJ_TYPE_REF_OBJECT (target), | |
2227 | obj_type_ref_class (target), call); | |
0127c169 | 2228 | cs->indirect_info->context = context; |
7d0aa05b JH |
2229 | } |
2230 | ||
b258210c | 2231 | if (TREE_CODE (target) == SSA_NAME) |
8aab5218 | 2232 | ipa_analyze_indirect_call_uses (fbi, call, target); |
1d5755ef | 2233 | else if (virtual_method_call_p (target)) |
8aab5218 | 2234 | ipa_analyze_virtual_call_uses (fbi, call, target); |
b258210c MJ |
2235 | } |
2236 | ||
2237 | ||
e33c6cd6 | 2238 | /* Analyze the call statement STMT with respect to formal parameters (described |
8aab5218 MJ |
2239 | in INFO) of caller given by FBI->NODE. Currently it only checks whether |
2240 | formal parameters are called. */ | |
be95e2b9 | 2241 | |
3e293154 | 2242 | static void |
8aab5218 | 2243 | ipa_analyze_stmt_uses (struct func_body_info *fbi, gimple stmt) |
3e293154 | 2244 | { |
726a989a | 2245 | if (is_gimple_call (stmt)) |
538dd0b7 | 2246 | ipa_analyze_call_uses (fbi, as_a <gcall *> (stmt)); |
062c604f MJ |
2247 | } |
2248 | ||
2249 | /* Callback of walk_stmt_load_store_addr_ops for the visit_load. | |
2250 | If OP is a parameter declaration, mark it as used in the info structure | |
2251 | passed in DATA. */ | |
2252 | ||
2253 | static bool | |
9f1363cd | 2254 | visit_ref_for_mod_analysis (gimple, tree op, tree, void *data) |
062c604f MJ |
2255 | { |
2256 | struct ipa_node_params *info = (struct ipa_node_params *) data; | |
2257 | ||
2258 | op = get_base_address (op); | |
2259 | if (op | |
2260 | && TREE_CODE (op) == PARM_DECL) | |
2261 | { | |
2262 | int index = ipa_get_param_decl_index (info, op); | |
2263 | gcc_assert (index >= 0); | |
310bc633 | 2264 | ipa_set_param_used (info, index, true); |
062c604f MJ |
2265 | } |
2266 | ||
2267 | return false; | |
3e293154 MJ |
2268 | } |
2269 | ||
8aab5218 MJ |
2270 | /* Scan the statements in BB and inspect the uses of formal parameters. Store |
2271 | the findings in various structures of the associated ipa_node_params | |
2272 | structure, such as parameter flags, notes etc. FBI holds various data about | |
2273 | the function being analyzed. */ | |
be95e2b9 | 2274 | |
062c604f | 2275 | static void |
8aab5218 | 2276 | ipa_analyze_params_uses_in_bb (struct func_body_info *fbi, basic_block bb) |
3e293154 | 2277 | { |
726a989a | 2278 | gimple_stmt_iterator gsi; |
8aab5218 MJ |
2279 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
2280 | { | |
2281 | gimple stmt = gsi_stmt (gsi); | |
3e293154 | 2282 | |
8aab5218 MJ |
2283 | if (is_gimple_debug (stmt)) |
2284 | continue; | |
3e293154 | 2285 | |
8aab5218 MJ |
2286 | ipa_analyze_stmt_uses (fbi, stmt); |
2287 | walk_stmt_load_store_addr_ops (stmt, fbi->info, | |
2288 | visit_ref_for_mod_analysis, | |
2289 | visit_ref_for_mod_analysis, | |
2290 | visit_ref_for_mod_analysis); | |
5fe8e757 | 2291 | } |
8aab5218 MJ |
2292 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
2293 | walk_stmt_load_store_addr_ops (gsi_stmt (gsi), fbi->info, | |
2294 | visit_ref_for_mod_analysis, | |
2295 | visit_ref_for_mod_analysis, | |
2296 | visit_ref_for_mod_analysis); | |
2297 | } | |
2298 | ||
2299 | /* Calculate controlled uses of parameters of NODE. */ | |
2300 | ||
2301 | static void | |
2302 | ipa_analyze_controlled_uses (struct cgraph_node *node) | |
2303 | { | |
2304 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
5fe8e757 | 2305 | |
8aab5218 | 2306 | for (int i = 0; i < ipa_get_param_count (info); i++) |
062c604f MJ |
2307 | { |
2308 | tree parm = ipa_get_param (info, i); | |
4502fe8d MJ |
2309 | int controlled_uses = 0; |
2310 | ||
062c604f MJ |
2311 | /* For SSA regs see if parameter is used. For non-SSA we compute |
2312 | the flag during modification analysis. */ | |
4502fe8d MJ |
2313 | if (is_gimple_reg (parm)) |
2314 | { | |
67348ccc | 2315 | tree ddef = ssa_default_def (DECL_STRUCT_FUNCTION (node->decl), |
4502fe8d MJ |
2316 | parm); |
2317 | if (ddef && !has_zero_uses (ddef)) | |
2318 | { | |
2319 | imm_use_iterator imm_iter; | |
2320 | use_operand_p use_p; | |
2321 | ||
2322 | ipa_set_param_used (info, i, true); | |
2323 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, ddef) | |
2324 | if (!is_gimple_call (USE_STMT (use_p))) | |
2325 | { | |
c6de6665 JJ |
2326 | if (!is_gimple_debug (USE_STMT (use_p))) |
2327 | { | |
2328 | controlled_uses = IPA_UNDESCRIBED_USE; | |
2329 | break; | |
2330 | } | |
4502fe8d MJ |
2331 | } |
2332 | else | |
2333 | controlled_uses++; | |
2334 | } | |
2335 | else | |
2336 | controlled_uses = 0; | |
2337 | } | |
2338 | else | |
2339 | controlled_uses = IPA_UNDESCRIBED_USE; | |
2340 | ipa_set_controlled_uses (info, i, controlled_uses); | |
062c604f | 2341 | } |
8aab5218 | 2342 | } |
062c604f | 2343 | |
8aab5218 | 2344 | /* Free stuff in BI. */ |
062c604f | 2345 | |
8aab5218 MJ |
2346 | static void |
2347 | free_ipa_bb_info (struct ipa_bb_info *bi) | |
2348 | { | |
2349 | bi->cg_edges.release (); | |
2350 | bi->param_aa_statuses.release (); | |
3e293154 MJ |
2351 | } |
2352 | ||
8aab5218 | 2353 | /* Dominator walker driving the analysis. */ |
2c9561b5 | 2354 | |
8aab5218 | 2355 | class analysis_dom_walker : public dom_walker |
2c9561b5 | 2356 | { |
8aab5218 MJ |
2357 | public: |
2358 | analysis_dom_walker (struct func_body_info *fbi) | |
2359 | : dom_walker (CDI_DOMINATORS), m_fbi (fbi) {} | |
2c9561b5 | 2360 | |
8aab5218 MJ |
2361 | virtual void before_dom_children (basic_block); |
2362 | ||
2363 | private: | |
2364 | struct func_body_info *m_fbi; | |
2365 | }; | |
2366 | ||
2367 | void | |
2368 | analysis_dom_walker::before_dom_children (basic_block bb) | |
2369 | { | |
2370 | ipa_analyze_params_uses_in_bb (m_fbi, bb); | |
2371 | ipa_compute_jump_functions_for_bb (m_fbi, bb); | |
2c9561b5 MJ |
2372 | } |
2373 | ||
dd5a833e MS |
2374 | /* Initialize the array describing properties of of formal parameters |
2375 | of NODE, analyze their uses and compute jump functions associated | |
2376 | with actual arguments of calls from within NODE. */ | |
062c604f MJ |
2377 | |
2378 | void | |
2379 | ipa_analyze_node (struct cgraph_node *node) | |
2380 | { | |
8aab5218 | 2381 | struct func_body_info fbi; |
57dbdc5a | 2382 | struct ipa_node_params *info; |
062c604f | 2383 | |
57dbdc5a MJ |
2384 | ipa_check_create_node_params (); |
2385 | ipa_check_create_edge_args (); | |
2386 | info = IPA_NODE_REF (node); | |
8aab5218 MJ |
2387 | |
2388 | if (info->analysis_done) | |
2389 | return; | |
2390 | info->analysis_done = 1; | |
2391 | ||
2392 | if (ipa_func_spec_opts_forbid_analysis_p (node)) | |
2393 | { | |
2394 | for (int i = 0; i < ipa_get_param_count (info); i++) | |
2395 | { | |
2396 | ipa_set_param_used (info, i, true); | |
2397 | ipa_set_controlled_uses (info, i, IPA_UNDESCRIBED_USE); | |
2398 | } | |
2399 | return; | |
2400 | } | |
2401 | ||
2402 | struct function *func = DECL_STRUCT_FUNCTION (node->decl); | |
2403 | push_cfun (func); | |
2404 | calculate_dominance_info (CDI_DOMINATORS); | |
062c604f | 2405 | ipa_initialize_node_params (node); |
8aab5218 | 2406 | ipa_analyze_controlled_uses (node); |
062c604f | 2407 | |
8aab5218 MJ |
2408 | fbi.node = node; |
2409 | fbi.info = IPA_NODE_REF (node); | |
2410 | fbi.bb_infos = vNULL; | |
2411 | fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun)); | |
2412 | fbi.param_count = ipa_get_param_count (info); | |
2413 | fbi.aa_walked = 0; | |
062c604f | 2414 | |
8aab5218 MJ |
2415 | for (struct cgraph_edge *cs = node->callees; cs; cs = cs->next_callee) |
2416 | { | |
2417 | ipa_bb_info *bi = ipa_get_bb_info (&fbi, gimple_bb (cs->call_stmt)); | |
2418 | bi->cg_edges.safe_push (cs); | |
2419 | } | |
062c604f | 2420 | |
8aab5218 MJ |
2421 | for (struct cgraph_edge *cs = node->indirect_calls; cs; cs = cs->next_callee) |
2422 | { | |
2423 | ipa_bb_info *bi = ipa_get_bb_info (&fbi, gimple_bb (cs->call_stmt)); | |
2424 | bi->cg_edges.safe_push (cs); | |
2425 | } | |
2426 | ||
2427 | analysis_dom_walker (&fbi).walk (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
2428 | ||
2429 | int i; | |
2430 | struct ipa_bb_info *bi; | |
2431 | FOR_EACH_VEC_ELT (fbi.bb_infos, i, bi) | |
2432 | free_ipa_bb_info (bi); | |
2433 | fbi.bb_infos.release (); | |
2434 | free_dominance_info (CDI_DOMINATORS); | |
f65cf2b7 | 2435 | pop_cfun (); |
062c604f | 2436 | } |
062c604f | 2437 | |
be95e2b9 | 2438 | /* Update the jump functions associated with call graph edge E when the call |
3e293154 | 2439 | graph edge CS is being inlined, assuming that E->caller is already (possibly |
b258210c | 2440 | indirectly) inlined into CS->callee and that E has not been inlined. */ |
be95e2b9 | 2441 | |
3e293154 MJ |
2442 | static void |
2443 | update_jump_functions_after_inlining (struct cgraph_edge *cs, | |
2444 | struct cgraph_edge *e) | |
2445 | { | |
2446 | struct ipa_edge_args *top = IPA_EDGE_REF (cs); | |
2447 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
2448 | int count = ipa_get_cs_argument_count (args); | |
2449 | int i; | |
2450 | ||
2451 | for (i = 0; i < count; i++) | |
2452 | { | |
b258210c | 2453 | struct ipa_jump_func *dst = ipa_get_ith_jump_func (args, i); |
5ce97055 JH |
2454 | struct ipa_polymorphic_call_context *dst_ctx |
2455 | = ipa_get_ith_polymorhic_call_context (args, i); | |
3e293154 | 2456 | |
685b0d13 MJ |
2457 | if (dst->type == IPA_JF_ANCESTOR) |
2458 | { | |
b258210c | 2459 | struct ipa_jump_func *src; |
8b7773a4 | 2460 | int dst_fid = dst->value.ancestor.formal_id; |
5ce97055 JH |
2461 | struct ipa_polymorphic_call_context *src_ctx |
2462 | = ipa_get_ith_polymorhic_call_context (top, dst_fid); | |
685b0d13 | 2463 | |
b258210c MJ |
2464 | /* Variable number of arguments can cause havoc if we try to access |
2465 | one that does not exist in the inlined edge. So make sure we | |
2466 | don't. */ | |
8b7773a4 | 2467 | if (dst_fid >= ipa_get_cs_argument_count (top)) |
b258210c | 2468 | { |
04be694e | 2469 | ipa_set_jf_unknown (dst); |
b258210c MJ |
2470 | continue; |
2471 | } | |
2472 | ||
8b7773a4 MJ |
2473 | src = ipa_get_ith_jump_func (top, dst_fid); |
2474 | ||
5ce97055 JH |
2475 | if (src_ctx && !src_ctx->useless_p ()) |
2476 | { | |
2477 | struct ipa_polymorphic_call_context ctx = *src_ctx; | |
2478 | ||
2479 | /* TODO: Make type preserved safe WRT contexts. */ | |
44210a96 | 2480 | if (!ipa_get_jf_ancestor_type_preserved (dst)) |
f9bb202b | 2481 | ctx.possible_dynamic_type_change (e->in_polymorphic_cdtor); |
5ce97055 JH |
2482 | ctx.offset_by (dst->value.ancestor.offset); |
2483 | if (!ctx.useless_p ()) | |
2484 | { | |
2485 | vec_safe_grow_cleared (args->polymorphic_call_contexts, | |
2486 | count); | |
2487 | dst_ctx = ipa_get_ith_polymorhic_call_context (args, i); | |
2488 | } | |
44210a96 | 2489 | dst_ctx->combine_with (ctx); |
5ce97055 JH |
2490 | } |
2491 | ||
8b7773a4 MJ |
2492 | if (src->agg.items |
2493 | && (dst->value.ancestor.agg_preserved || !src->agg.by_ref)) | |
2494 | { | |
2495 | struct ipa_agg_jf_item *item; | |
2496 | int j; | |
2497 | ||
2498 | /* Currently we do not produce clobber aggregate jump functions, | |
2499 | replace with merging when we do. */ | |
2500 | gcc_assert (!dst->agg.items); | |
2501 | ||
9771b263 | 2502 | dst->agg.items = vec_safe_copy (src->agg.items); |
8b7773a4 | 2503 | dst->agg.by_ref = src->agg.by_ref; |
9771b263 | 2504 | FOR_EACH_VEC_SAFE_ELT (dst->agg.items, j, item) |
8b7773a4 MJ |
2505 | item->offset -= dst->value.ancestor.offset; |
2506 | } | |
2507 | ||
3b97a5c7 MJ |
2508 | if (src->type == IPA_JF_PASS_THROUGH |
2509 | && src->value.pass_through.operation == NOP_EXPR) | |
8b7773a4 MJ |
2510 | { |
2511 | dst->value.ancestor.formal_id = src->value.pass_through.formal_id; | |
2512 | dst->value.ancestor.agg_preserved &= | |
2513 | src->value.pass_through.agg_preserved; | |
2514 | } | |
b258210c MJ |
2515 | else if (src->type == IPA_JF_ANCESTOR) |
2516 | { | |
2517 | dst->value.ancestor.formal_id = src->value.ancestor.formal_id; | |
2518 | dst->value.ancestor.offset += src->value.ancestor.offset; | |
8b7773a4 MJ |
2519 | dst->value.ancestor.agg_preserved &= |
2520 | src->value.ancestor.agg_preserved; | |
b258210c MJ |
2521 | } |
2522 | else | |
04be694e | 2523 | ipa_set_jf_unknown (dst); |
b258210c MJ |
2524 | } |
2525 | else if (dst->type == IPA_JF_PASS_THROUGH) | |
3e293154 | 2526 | { |
b258210c MJ |
2527 | struct ipa_jump_func *src; |
2528 | /* We must check range due to calls with variable number of arguments | |
2529 | and we cannot combine jump functions with operations. */ | |
2530 | if (dst->value.pass_through.operation == NOP_EXPR | |
2531 | && (dst->value.pass_through.formal_id | |
2532 | < ipa_get_cs_argument_count (top))) | |
2533 | { | |
8b7773a4 MJ |
2534 | int dst_fid = dst->value.pass_through.formal_id; |
2535 | src = ipa_get_ith_jump_func (top, dst_fid); | |
b8f6e610 | 2536 | bool dst_agg_p = ipa_get_jf_pass_through_agg_preserved (dst); |
5ce97055 JH |
2537 | struct ipa_polymorphic_call_context *src_ctx |
2538 | = ipa_get_ith_polymorhic_call_context (top, dst_fid); | |
8b7773a4 | 2539 | |
5ce97055 JH |
2540 | if (src_ctx && !src_ctx->useless_p ()) |
2541 | { | |
2542 | struct ipa_polymorphic_call_context ctx = *src_ctx; | |
2543 | ||
2544 | /* TODO: Make type preserved safe WRT contexts. */ | |
44210a96 | 2545 | if (!ipa_get_jf_pass_through_type_preserved (dst)) |
f9bb202b | 2546 | ctx.possible_dynamic_type_change (e->in_polymorphic_cdtor); |
5ce97055 JH |
2547 | if (!ctx.useless_p ()) |
2548 | { | |
2549 | if (!dst_ctx) | |
2550 | { | |
2551 | vec_safe_grow_cleared (args->polymorphic_call_contexts, | |
2552 | count); | |
2553 | dst_ctx = ipa_get_ith_polymorhic_call_context (args, i); | |
2554 | } | |
2555 | dst_ctx->combine_with (ctx); | |
2556 | } | |
2557 | } | |
b8f6e610 MJ |
2558 | switch (src->type) |
2559 | { | |
2560 | case IPA_JF_UNKNOWN: | |
04be694e | 2561 | ipa_set_jf_unknown (dst); |
b8f6e610 | 2562 | break; |
b8f6e610 MJ |
2563 | case IPA_JF_CONST: |
2564 | ipa_set_jf_cst_copy (dst, src); | |
2565 | break; | |
2566 | ||
2567 | case IPA_JF_PASS_THROUGH: | |
2568 | { | |
2569 | int formal_id = ipa_get_jf_pass_through_formal_id (src); | |
2570 | enum tree_code operation; | |
2571 | operation = ipa_get_jf_pass_through_operation (src); | |
2572 | ||
2573 | if (operation == NOP_EXPR) | |
2574 | { | |
3b97a5c7 | 2575 | bool agg_p; |
b8f6e610 MJ |
2576 | agg_p = dst_agg_p |
2577 | && ipa_get_jf_pass_through_agg_preserved (src); | |
3b97a5c7 | 2578 | ipa_set_jf_simple_pass_through (dst, formal_id, agg_p); |
b8f6e610 MJ |
2579 | } |
2580 | else | |
2581 | { | |
2582 | tree operand = ipa_get_jf_pass_through_operand (src); | |
2583 | ipa_set_jf_arith_pass_through (dst, formal_id, operand, | |
2584 | operation); | |
2585 | } | |
2586 | break; | |
2587 | } | |
2588 | case IPA_JF_ANCESTOR: | |
2589 | { | |
3b97a5c7 | 2590 | bool agg_p; |
b8f6e610 MJ |
2591 | agg_p = dst_agg_p |
2592 | && ipa_get_jf_ancestor_agg_preserved (src); | |
b8f6e610 MJ |
2593 | ipa_set_ancestor_jf (dst, |
2594 | ipa_get_jf_ancestor_offset (src), | |
b8f6e610 | 2595 | ipa_get_jf_ancestor_formal_id (src), |
3b97a5c7 | 2596 | agg_p); |
b8f6e610 MJ |
2597 | break; |
2598 | } | |
2599 | default: | |
2600 | gcc_unreachable (); | |
2601 | } | |
8b7773a4 MJ |
2602 | |
2603 | if (src->agg.items | |
b8f6e610 | 2604 | && (dst_agg_p || !src->agg.by_ref)) |
8b7773a4 MJ |
2605 | { |
2606 | /* Currently we do not produce clobber aggregate jump | |
2607 | functions, replace with merging when we do. */ | |
2608 | gcc_assert (!dst->agg.items); | |
2609 | ||
2610 | dst->agg.by_ref = src->agg.by_ref; | |
9771b263 | 2611 | dst->agg.items = vec_safe_copy (src->agg.items); |
8b7773a4 | 2612 | } |
b258210c MJ |
2613 | } |
2614 | else | |
04be694e | 2615 | ipa_set_jf_unknown (dst); |
3e293154 | 2616 | } |
b258210c MJ |
2617 | } |
2618 | } | |
2619 | ||
5ce97055 JH |
2620 | /* If TARGET is an addr_expr of a function declaration, make it the |
2621 | (SPECULATIVE)destination of an indirect edge IE and return the edge. | |
2622 | Otherwise, return NULL. */ | |
b258210c | 2623 | |
3949c4a7 | 2624 | struct cgraph_edge * |
5ce97055 JH |
2625 | ipa_make_edge_direct_to_target (struct cgraph_edge *ie, tree target, |
2626 | bool speculative) | |
b258210c MJ |
2627 | { |
2628 | struct cgraph_node *callee; | |
0f378cb5 | 2629 | struct inline_edge_summary *es = inline_edge_summary (ie); |
48b1474e | 2630 | bool unreachable = false; |
b258210c | 2631 | |
ceeffab0 MJ |
2632 | if (TREE_CODE (target) == ADDR_EXPR) |
2633 | target = TREE_OPERAND (target, 0); | |
b258210c | 2634 | if (TREE_CODE (target) != FUNCTION_DECL) |
a0a7b611 JH |
2635 | { |
2636 | target = canonicalize_constructor_val (target, NULL); | |
2637 | if (!target || TREE_CODE (target) != FUNCTION_DECL) | |
2638 | { | |
c13bc3d9 MJ |
2639 | if (ie->indirect_info->member_ptr) |
2640 | /* Member pointer call that goes through a VMT lookup. */ | |
2641 | return NULL; | |
2642 | ||
2b5f0895 XDL |
2643 | if (dump_enabled_p ()) |
2644 | { | |
807b7d62 ML |
2645 | location_t loc = gimple_location_safe (ie->call_stmt); |
2646 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, loc, | |
2647 | "discovered direct call to non-function in %s/%i, " | |
2648 | "making it __builtin_unreachable\n", | |
2649 | ie->caller->name (), ie->caller->order); | |
2b5f0895 | 2650 | } |
3c9e6fca | 2651 | |
48b1474e | 2652 | target = builtin_decl_implicit (BUILT_IN_UNREACHABLE); |
d52f5295 | 2653 | callee = cgraph_node::get_create (target); |
48b1474e | 2654 | unreachable = true; |
a0a7b611 | 2655 | } |
48b1474e | 2656 | else |
d52f5295 | 2657 | callee = cgraph_node::get (target); |
a0a7b611 | 2658 | } |
48b1474e | 2659 | else |
d52f5295 | 2660 | callee = cgraph_node::get (target); |
a0a7b611 JH |
2661 | |
2662 | /* Because may-edges are not explicitely represented and vtable may be external, | |
2663 | we may create the first reference to the object in the unit. */ | |
2664 | if (!callee || callee->global.inlined_to) | |
2665 | { | |
a0a7b611 JH |
2666 | |
2667 | /* We are better to ensure we can refer to it. | |
2668 | In the case of static functions we are out of luck, since we already | |
2669 | removed its body. In the case of public functions we may or may | |
2670 | not introduce the reference. */ | |
2671 | if (!canonicalize_constructor_val (target, NULL) | |
2672 | || !TREE_PUBLIC (target)) | |
2673 | { | |
2674 | if (dump_file) | |
2675 | fprintf (dump_file, "ipa-prop: Discovered call to a known target " | |
2676 | "(%s/%i -> %s/%i) but can not refer to it. Giving up.\n", | |
2a72a953 | 2677 | xstrdup_for_dump (ie->caller->name ()), |
67348ccc | 2678 | ie->caller->order, |
2a72a953 | 2679 | xstrdup_for_dump (ie->callee->name ()), |
67348ccc | 2680 | ie->callee->order); |
a0a7b611 JH |
2681 | return NULL; |
2682 | } | |
d52f5295 | 2683 | callee = cgraph_node::get_create (target); |
a0a7b611 | 2684 | } |
2b5f0895 | 2685 | |
0127c169 JH |
2686 | /* If the edge is already speculated. */ |
2687 | if (speculative && ie->speculative) | |
2688 | { | |
2689 | struct cgraph_edge *e2; | |
2690 | struct ipa_ref *ref; | |
2691 | ie->speculative_call_info (e2, ie, ref); | |
2692 | if (e2->callee->ultimate_alias_target () | |
2693 | != callee->ultimate_alias_target ()) | |
2694 | { | |
2695 | if (dump_file) | |
2696 | fprintf (dump_file, "ipa-prop: Discovered call to a speculative target " | |
2697 | "(%s/%i -> %s/%i) but the call is already speculated to %s/%i. Giving up.\n", | |
2a72a953 | 2698 | xstrdup_for_dump (ie->caller->name ()), |
0127c169 | 2699 | ie->caller->order, |
2a72a953 | 2700 | xstrdup_for_dump (callee->name ()), |
0127c169 | 2701 | callee->order, |
2a72a953 | 2702 | xstrdup_for_dump (e2->callee->name ()), |
0127c169 JH |
2703 | e2->callee->order); |
2704 | } | |
2705 | else | |
2706 | { | |
2707 | if (dump_file) | |
2708 | fprintf (dump_file, "ipa-prop: Discovered call to a speculative target " | |
2709 | "(%s/%i -> %s/%i) this agree with previous speculation.\n", | |
2a72a953 | 2710 | xstrdup_for_dump (ie->caller->name ()), |
0127c169 | 2711 | ie->caller->order, |
2a72a953 | 2712 | xstrdup_for_dump (callee->name ()), |
0127c169 JH |
2713 | callee->order); |
2714 | } | |
2715 | return NULL; | |
2716 | } | |
2717 | ||
2b5f0895 XDL |
2718 | if (!dbg_cnt (devirt)) |
2719 | return NULL; | |
2720 | ||
1dbee8c9 | 2721 | ipa_check_create_node_params (); |
ceeffab0 | 2722 | |
81fa35bd MJ |
2723 | /* We can not make edges to inline clones. It is bug that someone removed |
2724 | the cgraph node too early. */ | |
17afc0fe JH |
2725 | gcc_assert (!callee->global.inlined_to); |
2726 | ||
48b1474e | 2727 | if (dump_file && !unreachable) |
b258210c | 2728 | { |
5ce97055 | 2729 | fprintf (dump_file, "ipa-prop: Discovered %s call to a %s target " |
ceeffab0 | 2730 | "(%s/%i -> %s/%i), for stmt ", |
b258210c | 2731 | ie->indirect_info->polymorphic ? "a virtual" : "an indirect", |
5ce97055 | 2732 | speculative ? "speculative" : "known", |
2a72a953 | 2733 | xstrdup_for_dump (ie->caller->name ()), |
67348ccc | 2734 | ie->caller->order, |
2a72a953 | 2735 | xstrdup_for_dump (callee->name ()), |
67348ccc | 2736 | callee->order); |
b258210c MJ |
2737 | if (ie->call_stmt) |
2738 | print_gimple_stmt (dump_file, ie->call_stmt, 2, TDF_SLIM); | |
2739 | else | |
2740 | fprintf (dump_file, "with uid %i\n", ie->lto_stmt_uid); | |
042ae7d2 | 2741 | } |
2b5f0895 XDL |
2742 | if (dump_enabled_p ()) |
2743 | { | |
807b7d62 | 2744 | location_t loc = gimple_location_safe (ie->call_stmt); |
3c9e6fca | 2745 | |
807b7d62 ML |
2746 | dump_printf_loc (MSG_OPTIMIZED_LOCATIONS, loc, |
2747 | "converting indirect call in %s to direct call to %s\n", | |
2748 | ie->caller->name (), callee->name ()); | |
2b5f0895 | 2749 | } |
5ce97055 | 2750 | if (!speculative) |
d8d5aef1 JH |
2751 | { |
2752 | struct cgraph_edge *orig = ie; | |
2753 | ie = ie->make_direct (callee); | |
2754 | /* If we resolved speculative edge the cost is already up to date | |
2755 | for direct call (adjusted by inline_edge_duplication_hook). */ | |
2756 | if (ie == orig) | |
2757 | { | |
2758 | es = inline_edge_summary (ie); | |
2759 | es->call_stmt_size -= (eni_size_weights.indirect_call_cost | |
2760 | - eni_size_weights.call_cost); | |
2761 | es->call_stmt_time -= (eni_time_weights.indirect_call_cost | |
2762 | - eni_time_weights.call_cost); | |
2763 | } | |
2764 | } | |
5ce97055 JH |
2765 | else |
2766 | { | |
2767 | if (!callee->can_be_discarded_p ()) | |
2768 | { | |
2769 | cgraph_node *alias; | |
2770 | alias = dyn_cast<cgraph_node *> (callee->noninterposable_alias ()); | |
2771 | if (alias) | |
2772 | callee = alias; | |
2773 | } | |
d8d5aef1 | 2774 | /* make_speculative will update ie's cost to direct call cost. */ |
5ce97055 JH |
2775 | ie = ie->make_speculative |
2776 | (callee, ie->count * 8 / 10, ie->frequency * 8 / 10); | |
2777 | } | |
749aa96d | 2778 | |
b258210c | 2779 | return ie; |
3e293154 MJ |
2780 | } |
2781 | ||
8b7773a4 MJ |
2782 | /* Retrieve value from aggregate jump function AGG for the given OFFSET or |
2783 | return NULL if there is not any. BY_REF specifies whether the value has to | |
2784 | be passed by reference or by value. */ | |
2785 | ||
2786 | tree | |
2787 | ipa_find_agg_cst_for_param (struct ipa_agg_jump_function *agg, | |
2788 | HOST_WIDE_INT offset, bool by_ref) | |
2789 | { | |
2790 | struct ipa_agg_jf_item *item; | |
2791 | int i; | |
2792 | ||
2793 | if (by_ref != agg->by_ref) | |
2794 | return NULL; | |
2795 | ||
9771b263 | 2796 | FOR_EACH_VEC_SAFE_ELT (agg->items, i, item) |
2c9561b5 MJ |
2797 | if (item->offset == offset) |
2798 | { | |
2799 | /* Currently we do not have clobber values, return NULL for them once | |
2800 | we do. */ | |
2801 | gcc_checking_assert (is_gimple_ip_invariant (item->value)); | |
2802 | return item->value; | |
2803 | } | |
8b7773a4 MJ |
2804 | return NULL; |
2805 | } | |
2806 | ||
4502fe8d | 2807 | /* Remove a reference to SYMBOL from the list of references of a node given by |
568cda29 MJ |
2808 | reference description RDESC. Return true if the reference has been |
2809 | successfully found and removed. */ | |
4502fe8d | 2810 | |
568cda29 | 2811 | static bool |
5e20cdc9 | 2812 | remove_described_reference (symtab_node *symbol, struct ipa_cst_ref_desc *rdesc) |
4502fe8d MJ |
2813 | { |
2814 | struct ipa_ref *to_del; | |
2815 | struct cgraph_edge *origin; | |
2816 | ||
2817 | origin = rdesc->cs; | |
a854f856 MJ |
2818 | if (!origin) |
2819 | return false; | |
d122681a ML |
2820 | to_del = origin->caller->find_reference (symbol, origin->call_stmt, |
2821 | origin->lto_stmt_uid); | |
568cda29 MJ |
2822 | if (!to_del) |
2823 | return false; | |
2824 | ||
d122681a | 2825 | to_del->remove_reference (); |
4502fe8d MJ |
2826 | if (dump_file) |
2827 | fprintf (dump_file, "ipa-prop: Removed a reference from %s/%i to %s.\n", | |
2a72a953 DM |
2828 | xstrdup_for_dump (origin->caller->name ()), |
2829 | origin->caller->order, xstrdup_for_dump (symbol->name ())); | |
568cda29 | 2830 | return true; |
4502fe8d MJ |
2831 | } |
2832 | ||
2833 | /* If JFUNC has a reference description with refcount different from | |
2834 | IPA_UNDESCRIBED_USE, return the reference description, otherwise return | |
2835 | NULL. JFUNC must be a constant jump function. */ | |
2836 | ||
2837 | static struct ipa_cst_ref_desc * | |
2838 | jfunc_rdesc_usable (struct ipa_jump_func *jfunc) | |
2839 | { | |
2840 | struct ipa_cst_ref_desc *rdesc = ipa_get_jf_constant_rdesc (jfunc); | |
2841 | if (rdesc && rdesc->refcount != IPA_UNDESCRIBED_USE) | |
2842 | return rdesc; | |
2843 | else | |
2844 | return NULL; | |
2845 | } | |
2846 | ||
568cda29 MJ |
2847 | /* If the value of constant jump function JFUNC is an address of a function |
2848 | declaration, return the associated call graph node. Otherwise return | |
2849 | NULL. */ | |
2850 | ||
2851 | static cgraph_node * | |
2852 | cgraph_node_for_jfunc (struct ipa_jump_func *jfunc) | |
2853 | { | |
2854 | gcc_checking_assert (jfunc->type == IPA_JF_CONST); | |
2855 | tree cst = ipa_get_jf_constant (jfunc); | |
2856 | if (TREE_CODE (cst) != ADDR_EXPR | |
2857 | || TREE_CODE (TREE_OPERAND (cst, 0)) != FUNCTION_DECL) | |
2858 | return NULL; | |
2859 | ||
d52f5295 | 2860 | return cgraph_node::get (TREE_OPERAND (cst, 0)); |
568cda29 MJ |
2861 | } |
2862 | ||
2863 | ||
2864 | /* If JFUNC is a constant jump function with a usable rdesc, decrement its | |
2865 | refcount and if it hits zero, remove reference to SYMBOL from the caller of | |
2866 | the edge specified in the rdesc. Return false if either the symbol or the | |
2867 | reference could not be found, otherwise return true. */ | |
2868 | ||
2869 | static bool | |
2870 | try_decrement_rdesc_refcount (struct ipa_jump_func *jfunc) | |
2871 | { | |
2872 | struct ipa_cst_ref_desc *rdesc; | |
2873 | if (jfunc->type == IPA_JF_CONST | |
2874 | && (rdesc = jfunc_rdesc_usable (jfunc)) | |
2875 | && --rdesc->refcount == 0) | |
2876 | { | |
5e20cdc9 | 2877 | symtab_node *symbol = cgraph_node_for_jfunc (jfunc); |
568cda29 MJ |
2878 | if (!symbol) |
2879 | return false; | |
2880 | ||
2881 | return remove_described_reference (symbol, rdesc); | |
2882 | } | |
2883 | return true; | |
2884 | } | |
2885 | ||
b258210c MJ |
2886 | /* Try to find a destination for indirect edge IE that corresponds to a simple |
2887 | call or a call of a member function pointer and where the destination is a | |
2888 | pointer formal parameter described by jump function JFUNC. If it can be | |
d250540a MJ |
2889 | determined, return the newly direct edge, otherwise return NULL. |
2890 | NEW_ROOT_INFO is the node info that JFUNC lattices are relative to. */ | |
be95e2b9 | 2891 | |
b258210c MJ |
2892 | static struct cgraph_edge * |
2893 | try_make_edge_direct_simple_call (struct cgraph_edge *ie, | |
d250540a MJ |
2894 | struct ipa_jump_func *jfunc, |
2895 | struct ipa_node_params *new_root_info) | |
b258210c | 2896 | { |
4502fe8d | 2897 | struct cgraph_edge *cs; |
b258210c | 2898 | tree target; |
042ae7d2 | 2899 | bool agg_contents = ie->indirect_info->agg_contents; |
b258210c | 2900 | |
8b7773a4 | 2901 | if (ie->indirect_info->agg_contents) |
d250540a MJ |
2902 | target = ipa_find_agg_cst_for_param (&jfunc->agg, |
2903 | ie->indirect_info->offset, | |
2904 | ie->indirect_info->by_ref); | |
b258210c | 2905 | else |
d250540a MJ |
2906 | target = ipa_value_from_jfunc (new_root_info, jfunc); |
2907 | if (!target) | |
2908 | return NULL; | |
4502fe8d MJ |
2909 | cs = ipa_make_edge_direct_to_target (ie, target); |
2910 | ||
a12cd2db | 2911 | if (cs && !agg_contents) |
568cda29 MJ |
2912 | { |
2913 | bool ok; | |
2914 | gcc_checking_assert (cs->callee | |
ae6d0907 MJ |
2915 | && (cs != ie |
2916 | || jfunc->type != IPA_JF_CONST | |
568cda29 MJ |
2917 | || !cgraph_node_for_jfunc (jfunc) |
2918 | || cs->callee == cgraph_node_for_jfunc (jfunc))); | |
2919 | ok = try_decrement_rdesc_refcount (jfunc); | |
2920 | gcc_checking_assert (ok); | |
2921 | } | |
4502fe8d MJ |
2922 | |
2923 | return cs; | |
b258210c MJ |
2924 | } |
2925 | ||
bec81025 MJ |
2926 | /* Return the target to be used in cases of impossible devirtualization. IE |
2927 | and target (the latter can be NULL) are dumped when dumping is enabled. */ | |
2928 | ||
72972c22 MJ |
2929 | tree |
2930 | ipa_impossible_devirt_target (struct cgraph_edge *ie, tree target) | |
bec81025 MJ |
2931 | { |
2932 | if (dump_file) | |
2933 | { | |
2934 | if (target) | |
2935 | fprintf (dump_file, | |
72972c22 | 2936 | "Type inconsistent devirtualization: %s/%i->%s\n", |
bec81025 MJ |
2937 | ie->caller->name (), ie->caller->order, |
2938 | IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (target))); | |
2939 | else | |
2940 | fprintf (dump_file, | |
2941 | "No devirtualization target in %s/%i\n", | |
2942 | ie->caller->name (), ie->caller->order); | |
2943 | } | |
2944 | tree new_target = builtin_decl_implicit (BUILT_IN_UNREACHABLE); | |
d52f5295 | 2945 | cgraph_node::get_create (new_target); |
bec81025 MJ |
2946 | return new_target; |
2947 | } | |
2948 | ||
d250540a MJ |
2949 | /* Try to find a destination for indirect edge IE that corresponds to a virtual |
2950 | call based on a formal parameter which is described by jump function JFUNC | |
2951 | and if it can be determined, make it direct and return the direct edge. | |
44210a96 MJ |
2952 | Otherwise, return NULL. CTX describes the polymorphic context that the |
2953 | parameter the call is based on brings along with it. */ | |
b258210c MJ |
2954 | |
2955 | static struct cgraph_edge * | |
2956 | try_make_edge_direct_virtual_call (struct cgraph_edge *ie, | |
d250540a | 2957 | struct ipa_jump_func *jfunc, |
44210a96 | 2958 | struct ipa_polymorphic_call_context ctx) |
3e293154 | 2959 | { |
44210a96 | 2960 | tree target = NULL; |
5ce97055 | 2961 | bool speculative = false; |
85942f45 | 2962 | |
2bf86c84 | 2963 | if (!opt_for_fn (ie->caller->decl, flag_devirtualize)) |
85942f45 | 2964 | return NULL; |
b258210c | 2965 | |
44210a96 | 2966 | gcc_assert (!ie->indirect_info->by_ref); |
5ce97055 JH |
2967 | |
2968 | /* Try to do lookup via known virtual table pointer value. */ | |
2bf86c84 JH |
2969 | if (!ie->indirect_info->vptr_changed |
2970 | || opt_for_fn (ie->caller->decl, flag_devirtualize_speculatively)) | |
85942f45 | 2971 | { |
9de2f554 JH |
2972 | tree vtable; |
2973 | unsigned HOST_WIDE_INT offset; | |
85942f45 JH |
2974 | tree t = ipa_find_agg_cst_for_param (&jfunc->agg, |
2975 | ie->indirect_info->offset, | |
2976 | true); | |
9de2f554 JH |
2977 | if (t && vtable_pointer_value_to_vtable (t, &vtable, &offset)) |
2978 | { | |
0127c169 | 2979 | t = gimple_get_virt_method_for_vtable (ie->indirect_info->otr_token, |
9de2f554 | 2980 | vtable, offset); |
0127c169 | 2981 | if (t) |
9de2f554 | 2982 | { |
0127c169 JH |
2983 | if ((TREE_CODE (TREE_TYPE (t)) == FUNCTION_TYPE |
2984 | && DECL_FUNCTION_CODE (t) == BUILT_IN_UNREACHABLE) | |
9de2f554 | 2985 | || !possible_polymorphic_call_target_p |
0127c169 JH |
2986 | (ie, cgraph_node::get (t))) |
2987 | { | |
2988 | /* Do not speculate builtin_unreachable, it is stpid! */ | |
2989 | if (!ie->indirect_info->vptr_changed) | |
2990 | target = ipa_impossible_devirt_target (ie, target); | |
2991 | } | |
2992 | else | |
2993 | { | |
2994 | target = t; | |
2995 | speculative = ie->indirect_info->vptr_changed; | |
2996 | } | |
9de2f554 JH |
2997 | } |
2998 | } | |
85942f45 JH |
2999 | } |
3000 | ||
44210a96 MJ |
3001 | ipa_polymorphic_call_context ie_context (ie); |
3002 | vec <cgraph_node *>targets; | |
3003 | bool final; | |
d250540a | 3004 | |
44210a96 MJ |
3005 | ctx.offset_by (ie->indirect_info->offset); |
3006 | if (ie->indirect_info->vptr_changed) | |
3007 | ctx.possible_dynamic_type_change (ie->in_polymorphic_cdtor, | |
3008 | ie->indirect_info->otr_type); | |
3009 | ctx.combine_with (ie_context, ie->indirect_info->otr_type); | |
3010 | targets = possible_polymorphic_call_targets | |
3011 | (ie->indirect_info->otr_type, | |
3012 | ie->indirect_info->otr_token, | |
3013 | ctx, &final); | |
3014 | if (final && targets.length () <= 1) | |
5ce97055 | 3015 | { |
44210a96 MJ |
3016 | if (targets.length () == 1) |
3017 | target = targets[0]->decl; | |
3018 | else | |
3019 | target = ipa_impossible_devirt_target (ie, NULL_TREE); | |
5ce97055 | 3020 | } |
2bf86c84 | 3021 | else if (!target && opt_for_fn (ie->caller->decl, flag_devirtualize_speculatively) |
44210a96 | 3022 | && !ie->speculative && ie->maybe_hot_p ()) |
5bccb77a | 3023 | { |
44210a96 MJ |
3024 | cgraph_node *n; |
3025 | n = try_speculative_devirtualization (ie->indirect_info->otr_type, | |
3026 | ie->indirect_info->otr_token, | |
3027 | ie->indirect_info->context); | |
3028 | if (n) | |
5ce97055 | 3029 | { |
44210a96 MJ |
3030 | target = n->decl; |
3031 | speculative = true; | |
5ce97055 | 3032 | } |
5bccb77a | 3033 | } |
b258210c MJ |
3034 | |
3035 | if (target) | |
450ad0cd | 3036 | { |
44210a96 MJ |
3037 | if (!possible_polymorphic_call_target_p |
3038 | (ie, cgraph_node::get_create (target))) | |
0127c169 | 3039 | { |
29c43c83 | 3040 | if (speculative) |
0127c169 JH |
3041 | return NULL; |
3042 | target = ipa_impossible_devirt_target (ie, target); | |
3043 | } | |
5ce97055 | 3044 | return ipa_make_edge_direct_to_target (ie, target, speculative); |
450ad0cd | 3045 | } |
b258210c MJ |
3046 | else |
3047 | return NULL; | |
3e293154 MJ |
3048 | } |
3049 | ||
3050 | /* Update the param called notes associated with NODE when CS is being inlined, | |
3051 | assuming NODE is (potentially indirectly) inlined into CS->callee. | |
3052 | Moreover, if the callee is discovered to be constant, create a new cgraph | |
e56f5f3e | 3053 | edge for it. Newly discovered indirect edges will be added to *NEW_EDGES, |
f8e2a1ed | 3054 | unless NEW_EDGES is NULL. Return true iff a new edge(s) were created. */ |
be95e2b9 | 3055 | |
f8e2a1ed | 3056 | static bool |
e33c6cd6 MJ |
3057 | update_indirect_edges_after_inlining (struct cgraph_edge *cs, |
3058 | struct cgraph_node *node, | |
d52f5295 | 3059 | vec<cgraph_edge *> *new_edges) |
3e293154 | 3060 | { |
9e97ff61 | 3061 | struct ipa_edge_args *top; |
b258210c | 3062 | struct cgraph_edge *ie, *next_ie, *new_direct_edge; |
d250540a | 3063 | struct ipa_node_params *new_root_info; |
f8e2a1ed | 3064 | bool res = false; |
3e293154 | 3065 | |
e33c6cd6 | 3066 | ipa_check_create_edge_args (); |
9e97ff61 | 3067 | top = IPA_EDGE_REF (cs); |
d250540a MJ |
3068 | new_root_info = IPA_NODE_REF (cs->caller->global.inlined_to |
3069 | ? cs->caller->global.inlined_to | |
3070 | : cs->caller); | |
e33c6cd6 MJ |
3071 | |
3072 | for (ie = node->indirect_calls; ie; ie = next_ie) | |
3e293154 | 3073 | { |
e33c6cd6 | 3074 | struct cgraph_indirect_call_info *ici = ie->indirect_info; |
3e293154 | 3075 | struct ipa_jump_func *jfunc; |
8b7773a4 | 3076 | int param_index; |
3e293154 | 3077 | |
e33c6cd6 | 3078 | next_ie = ie->next_callee; |
3e293154 | 3079 | |
5f902d76 JH |
3080 | if (ici->param_index == -1) |
3081 | continue; | |
e33c6cd6 | 3082 | |
3e293154 | 3083 | /* We must check range due to calls with variable number of arguments: */ |
e33c6cd6 | 3084 | if (ici->param_index >= ipa_get_cs_argument_count (top)) |
3e293154 | 3085 | { |
5ee53a06 | 3086 | ici->param_index = -1; |
3e293154 MJ |
3087 | continue; |
3088 | } | |
3089 | ||
8b7773a4 MJ |
3090 | param_index = ici->param_index; |
3091 | jfunc = ipa_get_ith_jump_func (top, param_index); | |
5ee53a06 | 3092 | |
2bf86c84 | 3093 | if (!opt_for_fn (node->decl, flag_indirect_inlining)) |
36b72910 JH |
3094 | new_direct_edge = NULL; |
3095 | else if (ici->polymorphic) | |
5ce97055 | 3096 | { |
44210a96 MJ |
3097 | ipa_polymorphic_call_context ctx; |
3098 | ctx = ipa_context_from_jfunc (new_root_info, cs, param_index, jfunc); | |
3099 | new_direct_edge = try_make_edge_direct_virtual_call (ie, jfunc, ctx); | |
5ce97055 | 3100 | } |
b258210c | 3101 | else |
d250540a MJ |
3102 | new_direct_edge = try_make_edge_direct_simple_call (ie, jfunc, |
3103 | new_root_info); | |
042ae7d2 JH |
3104 | /* If speculation was removed, then we need to do nothing. */ |
3105 | if (new_direct_edge && new_direct_edge != ie) | |
3106 | { | |
3107 | new_direct_edge->indirect_inlining_edge = 1; | |
3108 | top = IPA_EDGE_REF (cs); | |
3109 | res = true; | |
3110 | } | |
3111 | else if (new_direct_edge) | |
685b0d13 | 3112 | { |
b258210c | 3113 | new_direct_edge->indirect_inlining_edge = 1; |
89faf322 RG |
3114 | if (new_direct_edge->call_stmt) |
3115 | new_direct_edge->call_stmt_cannot_inline_p | |
4de09b85 DC |
3116 | = !gimple_check_call_matching_types ( |
3117 | new_direct_edge->call_stmt, | |
67348ccc | 3118 | new_direct_edge->callee->decl, false); |
b258210c MJ |
3119 | if (new_edges) |
3120 | { | |
9771b263 | 3121 | new_edges->safe_push (new_direct_edge); |
b258210c MJ |
3122 | res = true; |
3123 | } | |
042ae7d2 | 3124 | top = IPA_EDGE_REF (cs); |
685b0d13 | 3125 | } |
36b72910 JH |
3126 | else if (jfunc->type == IPA_JF_PASS_THROUGH |
3127 | && ipa_get_jf_pass_through_operation (jfunc) == NOP_EXPR) | |
3128 | { | |
8a2256dd MJ |
3129 | if ((ici->agg_contents |
3130 | && !ipa_get_jf_pass_through_agg_preserved (jfunc)) | |
3131 | || (ici->polymorphic | |
3132 | && !ipa_get_jf_pass_through_type_preserved (jfunc))) | |
36b72910 JH |
3133 | ici->param_index = -1; |
3134 | else | |
3135 | ici->param_index = ipa_get_jf_pass_through_formal_id (jfunc); | |
3136 | } | |
3137 | else if (jfunc->type == IPA_JF_ANCESTOR) | |
3138 | { | |
8a2256dd MJ |
3139 | if ((ici->agg_contents |
3140 | && !ipa_get_jf_ancestor_agg_preserved (jfunc)) | |
3141 | || (ici->polymorphic | |
3142 | && !ipa_get_jf_ancestor_type_preserved (jfunc))) | |
36b72910 JH |
3143 | ici->param_index = -1; |
3144 | else | |
3145 | { | |
3146 | ici->param_index = ipa_get_jf_ancestor_formal_id (jfunc); | |
3147 | ici->offset += ipa_get_jf_ancestor_offset (jfunc); | |
3148 | } | |
3149 | } | |
3150 | else | |
3151 | /* Either we can find a destination for this edge now or never. */ | |
3152 | ici->param_index = -1; | |
3e293154 | 3153 | } |
e33c6cd6 | 3154 | |
f8e2a1ed | 3155 | return res; |
3e293154 MJ |
3156 | } |
3157 | ||
3158 | /* Recursively traverse subtree of NODE (including node) made of inlined | |
3159 | cgraph_edges when CS has been inlined and invoke | |
e33c6cd6 | 3160 | update_indirect_edges_after_inlining on all nodes and |
3e293154 MJ |
3161 | update_jump_functions_after_inlining on all non-inlined edges that lead out |
3162 | of this subtree. Newly discovered indirect edges will be added to | |
f8e2a1ed MJ |
3163 | *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were |
3164 | created. */ | |
be95e2b9 | 3165 | |
f8e2a1ed | 3166 | static bool |
3e293154 MJ |
3167 | propagate_info_to_inlined_callees (struct cgraph_edge *cs, |
3168 | struct cgraph_node *node, | |
d52f5295 | 3169 | vec<cgraph_edge *> *new_edges) |
3e293154 MJ |
3170 | { |
3171 | struct cgraph_edge *e; | |
f8e2a1ed | 3172 | bool res; |
3e293154 | 3173 | |
e33c6cd6 | 3174 | res = update_indirect_edges_after_inlining (cs, node, new_edges); |
3e293154 MJ |
3175 | |
3176 | for (e = node->callees; e; e = e->next_callee) | |
3177 | if (!e->inline_failed) | |
f8e2a1ed | 3178 | res |= propagate_info_to_inlined_callees (cs, e->callee, new_edges); |
3e293154 MJ |
3179 | else |
3180 | update_jump_functions_after_inlining (cs, e); | |
5ee53a06 JH |
3181 | for (e = node->indirect_calls; e; e = e->next_callee) |
3182 | update_jump_functions_after_inlining (cs, e); | |
f8e2a1ed MJ |
3183 | |
3184 | return res; | |
3e293154 MJ |
3185 | } |
3186 | ||
4502fe8d MJ |
3187 | /* Combine two controlled uses counts as done during inlining. */ |
3188 | ||
3189 | static int | |
3190 | combine_controlled_uses_counters (int c, int d) | |
3191 | { | |
3192 | if (c == IPA_UNDESCRIBED_USE || d == IPA_UNDESCRIBED_USE) | |
3193 | return IPA_UNDESCRIBED_USE; | |
3194 | else | |
3195 | return c + d - 1; | |
3196 | } | |
3197 | ||
3198 | /* Propagate number of controlled users from CS->caleee to the new root of the | |
3199 | tree of inlined nodes. */ | |
3200 | ||
3201 | static void | |
3202 | propagate_controlled_uses (struct cgraph_edge *cs) | |
3203 | { | |
3204 | struct ipa_edge_args *args = IPA_EDGE_REF (cs); | |
3205 | struct cgraph_node *new_root = cs->caller->global.inlined_to | |
3206 | ? cs->caller->global.inlined_to : cs->caller; | |
3207 | struct ipa_node_params *new_root_info = IPA_NODE_REF (new_root); | |
3208 | struct ipa_node_params *old_root_info = IPA_NODE_REF (cs->callee); | |
3209 | int count, i; | |
3210 | ||
3211 | count = MIN (ipa_get_cs_argument_count (args), | |
3212 | ipa_get_param_count (old_root_info)); | |
3213 | for (i = 0; i < count; i++) | |
3214 | { | |
3215 | struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i); | |
3216 | struct ipa_cst_ref_desc *rdesc; | |
3217 | ||
3218 | if (jf->type == IPA_JF_PASS_THROUGH) | |
3219 | { | |
3220 | int src_idx, c, d; | |
3221 | src_idx = ipa_get_jf_pass_through_formal_id (jf); | |
3222 | c = ipa_get_controlled_uses (new_root_info, src_idx); | |
3223 | d = ipa_get_controlled_uses (old_root_info, i); | |
3224 | ||
3225 | gcc_checking_assert (ipa_get_jf_pass_through_operation (jf) | |
3226 | == NOP_EXPR || c == IPA_UNDESCRIBED_USE); | |
3227 | c = combine_controlled_uses_counters (c, d); | |
3228 | ipa_set_controlled_uses (new_root_info, src_idx, c); | |
3229 | if (c == 0 && new_root_info->ipcp_orig_node) | |
3230 | { | |
3231 | struct cgraph_node *n; | |
3232 | struct ipa_ref *ref; | |
44210a96 | 3233 | tree t = new_root_info->known_csts[src_idx]; |
4502fe8d MJ |
3234 | |
3235 | if (t && TREE_CODE (t) == ADDR_EXPR | |
3236 | && TREE_CODE (TREE_OPERAND (t, 0)) == FUNCTION_DECL | |
d52f5295 | 3237 | && (n = cgraph_node::get (TREE_OPERAND (t, 0))) |
d122681a | 3238 | && (ref = new_root->find_reference (n, NULL, 0))) |
4502fe8d MJ |
3239 | { |
3240 | if (dump_file) | |
3241 | fprintf (dump_file, "ipa-prop: Removing cloning-created " | |
3242 | "reference from %s/%i to %s/%i.\n", | |
2a72a953 | 3243 | xstrdup_for_dump (new_root->name ()), |
67348ccc | 3244 | new_root->order, |
2a72a953 | 3245 | xstrdup_for_dump (n->name ()), n->order); |
d122681a | 3246 | ref->remove_reference (); |
4502fe8d MJ |
3247 | } |
3248 | } | |
3249 | } | |
3250 | else if (jf->type == IPA_JF_CONST | |
3251 | && (rdesc = jfunc_rdesc_usable (jf))) | |
3252 | { | |
3253 | int d = ipa_get_controlled_uses (old_root_info, i); | |
3254 | int c = rdesc->refcount; | |
3255 | rdesc->refcount = combine_controlled_uses_counters (c, d); | |
3256 | if (rdesc->refcount == 0) | |
3257 | { | |
3258 | tree cst = ipa_get_jf_constant (jf); | |
3259 | struct cgraph_node *n; | |
3260 | gcc_checking_assert (TREE_CODE (cst) == ADDR_EXPR | |
3261 | && TREE_CODE (TREE_OPERAND (cst, 0)) | |
3262 | == FUNCTION_DECL); | |
d52f5295 | 3263 | n = cgraph_node::get (TREE_OPERAND (cst, 0)); |
4502fe8d MJ |
3264 | if (n) |
3265 | { | |
3266 | struct cgraph_node *clone; | |
568cda29 | 3267 | bool ok; |
67348ccc | 3268 | ok = remove_described_reference (n, rdesc); |
568cda29 | 3269 | gcc_checking_assert (ok); |
4502fe8d MJ |
3270 | |
3271 | clone = cs->caller; | |
3272 | while (clone->global.inlined_to | |
3273 | && clone != rdesc->cs->caller | |
3274 | && IPA_NODE_REF (clone)->ipcp_orig_node) | |
3275 | { | |
3276 | struct ipa_ref *ref; | |
d122681a | 3277 | ref = clone->find_reference (n, NULL, 0); |
4502fe8d MJ |
3278 | if (ref) |
3279 | { | |
3280 | if (dump_file) | |
3281 | fprintf (dump_file, "ipa-prop: Removing " | |
3282 | "cloning-created reference " | |
3283 | "from %s/%i to %s/%i.\n", | |
2a72a953 | 3284 | xstrdup_for_dump (clone->name ()), |
67348ccc | 3285 | clone->order, |
2a72a953 | 3286 | xstrdup_for_dump (n->name ()), |
67348ccc | 3287 | n->order); |
d122681a | 3288 | ref->remove_reference (); |
4502fe8d MJ |
3289 | } |
3290 | clone = clone->callers->caller; | |
3291 | } | |
3292 | } | |
3293 | } | |
3294 | } | |
3295 | } | |
3296 | ||
3297 | for (i = ipa_get_param_count (old_root_info); | |
3298 | i < ipa_get_cs_argument_count (args); | |
3299 | i++) | |
3300 | { | |
3301 | struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i); | |
3302 | ||
3303 | if (jf->type == IPA_JF_CONST) | |
3304 | { | |
3305 | struct ipa_cst_ref_desc *rdesc = jfunc_rdesc_usable (jf); | |
3306 | if (rdesc) | |
3307 | rdesc->refcount = IPA_UNDESCRIBED_USE; | |
3308 | } | |
3309 | else if (jf->type == IPA_JF_PASS_THROUGH) | |
3310 | ipa_set_controlled_uses (new_root_info, | |
3311 | jf->value.pass_through.formal_id, | |
3312 | IPA_UNDESCRIBED_USE); | |
3313 | } | |
3314 | } | |
3315 | ||
3e293154 MJ |
3316 | /* Update jump functions and call note functions on inlining the call site CS. |
3317 | CS is expected to lead to a node already cloned by | |
3318 | cgraph_clone_inline_nodes. Newly discovered indirect edges will be added to | |
f8e2a1ed MJ |
3319 | *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were + |
3320 | created. */ | |
be95e2b9 | 3321 | |
f8e2a1ed | 3322 | bool |
3e293154 | 3323 | ipa_propagate_indirect_call_infos (struct cgraph_edge *cs, |
d52f5295 | 3324 | vec<cgraph_edge *> *new_edges) |
3e293154 | 3325 | { |
5ee53a06 | 3326 | bool changed; |
f8e2a1ed MJ |
3327 | /* Do nothing if the preparation phase has not been carried out yet |
3328 | (i.e. during early inlining). */ | |
dd912cb8 | 3329 | if (!ipa_node_params_sum) |
f8e2a1ed MJ |
3330 | return false; |
3331 | gcc_assert (ipa_edge_args_vector); | |
3332 | ||
4502fe8d | 3333 | propagate_controlled_uses (cs); |
5ee53a06 JH |
3334 | changed = propagate_info_to_inlined_callees (cs, cs->callee, new_edges); |
3335 | ||
5ee53a06 | 3336 | return changed; |
518dc859 RL |
3337 | } |
3338 | ||
771578a0 MJ |
3339 | /* Frees all dynamically allocated structures that the argument info points |
3340 | to. */ | |
be95e2b9 | 3341 | |
518dc859 | 3342 | void |
771578a0 | 3343 | ipa_free_edge_args_substructures (struct ipa_edge_args *args) |
518dc859 | 3344 | { |
9771b263 | 3345 | vec_free (args->jump_functions); |
771578a0 | 3346 | memset (args, 0, sizeof (*args)); |
518dc859 RL |
3347 | } |
3348 | ||
771578a0 | 3349 | /* Free all ipa_edge structures. */ |
be95e2b9 | 3350 | |
518dc859 | 3351 | void |
771578a0 | 3352 | ipa_free_all_edge_args (void) |
518dc859 | 3353 | { |
771578a0 MJ |
3354 | int i; |
3355 | struct ipa_edge_args *args; | |
518dc859 | 3356 | |
9771b263 DN |
3357 | if (!ipa_edge_args_vector) |
3358 | return; | |
3359 | ||
3360 | FOR_EACH_VEC_ELT (*ipa_edge_args_vector, i, args) | |
771578a0 MJ |
3361 | ipa_free_edge_args_substructures (args); |
3362 | ||
9771b263 | 3363 | vec_free (ipa_edge_args_vector); |
518dc859 RL |
3364 | } |
3365 | ||
771578a0 MJ |
3366 | /* Frees all dynamically allocated structures that the param info points |
3367 | to. */ | |
be95e2b9 | 3368 | |
dd912cb8 | 3369 | ipa_node_params::~ipa_node_params () |
518dc859 | 3370 | { |
dd912cb8 ML |
3371 | descriptors.release (); |
3372 | free (lattices); | |
310bc633 MJ |
3373 | /* Lattice values and their sources are deallocated with their alocation |
3374 | pool. */ | |
dd912cb8 ML |
3375 | known_contexts.release (); |
3376 | ||
3377 | lattices = NULL; | |
3378 | ipcp_orig_node = NULL; | |
3379 | analysis_done = 0; | |
3380 | node_enqueued = 0; | |
3381 | do_clone_for_all_contexts = 0; | |
3382 | is_all_contexts_clone = 0; | |
3383 | node_dead = 0; | |
518dc859 RL |
3384 | } |
3385 | ||
771578a0 | 3386 | /* Free all ipa_node_params structures. */ |
be95e2b9 | 3387 | |
518dc859 | 3388 | void |
771578a0 | 3389 | ipa_free_all_node_params (void) |
518dc859 | 3390 | { |
dd912cb8 ML |
3391 | delete ipa_node_params_sum; |
3392 | ipa_node_params_sum = NULL; | |
771578a0 MJ |
3393 | } |
3394 | ||
04be694e MJ |
3395 | /* Grow ipcp_transformations if necessary. */ |
3396 | ||
3397 | void | |
3398 | ipcp_grow_transformations_if_necessary (void) | |
3399 | { | |
3400 | if (vec_safe_length (ipcp_transformations) | |
3401 | <= (unsigned) symtab->cgraph_max_uid) | |
3402 | vec_safe_grow_cleared (ipcp_transformations, symtab->cgraph_max_uid + 1); | |
3403 | } | |
3404 | ||
2c9561b5 MJ |
3405 | /* Set the aggregate replacements of NODE to be AGGVALS. */ |
3406 | ||
3407 | void | |
3408 | ipa_set_node_agg_value_chain (struct cgraph_node *node, | |
3409 | struct ipa_agg_replacement_value *aggvals) | |
3410 | { | |
04be694e MJ |
3411 | ipcp_grow_transformations_if_necessary (); |
3412 | (*ipcp_transformations)[node->uid].agg_values = aggvals; | |
2c9561b5 MJ |
3413 | } |
3414 | ||
771578a0 | 3415 | /* Hook that is called by cgraph.c when an edge is removed. */ |
be95e2b9 | 3416 | |
771578a0 | 3417 | static void |
5c0466b5 | 3418 | ipa_edge_removal_hook (struct cgraph_edge *cs, void *data ATTRIBUTE_UNUSED) |
771578a0 | 3419 | { |
568cda29 MJ |
3420 | struct ipa_edge_args *args; |
3421 | ||
3422 | /* During IPA-CP updating we can be called on not-yet analyzed clones. */ | |
9771b263 | 3423 | if (vec_safe_length (ipa_edge_args_vector) <= (unsigned)cs->uid) |
c6f7cfc1 | 3424 | return; |
568cda29 MJ |
3425 | |
3426 | args = IPA_EDGE_REF (cs); | |
3427 | if (args->jump_functions) | |
3428 | { | |
3429 | struct ipa_jump_func *jf; | |
3430 | int i; | |
3431 | FOR_EACH_VEC_ELT (*args->jump_functions, i, jf) | |
a854f856 MJ |
3432 | { |
3433 | struct ipa_cst_ref_desc *rdesc; | |
3434 | try_decrement_rdesc_refcount (jf); | |
3435 | if (jf->type == IPA_JF_CONST | |
3436 | && (rdesc = ipa_get_jf_constant_rdesc (jf)) | |
3437 | && rdesc->cs == cs) | |
3438 | rdesc->cs = NULL; | |
3439 | } | |
568cda29 MJ |
3440 | } |
3441 | ||
771578a0 | 3442 | ipa_free_edge_args_substructures (IPA_EDGE_REF (cs)); |
518dc859 RL |
3443 | } |
3444 | ||
8b7773a4 | 3445 | /* Hook that is called by cgraph.c when an edge is duplicated. */ |
be95e2b9 | 3446 | |
771578a0 MJ |
3447 | static void |
3448 | ipa_edge_duplication_hook (struct cgraph_edge *src, struct cgraph_edge *dst, | |
dd912cb8 | 3449 | void *) |
771578a0 MJ |
3450 | { |
3451 | struct ipa_edge_args *old_args, *new_args; | |
8b7773a4 | 3452 | unsigned int i; |
771578a0 MJ |
3453 | |
3454 | ipa_check_create_edge_args (); | |
3455 | ||
3456 | old_args = IPA_EDGE_REF (src); | |
3457 | new_args = IPA_EDGE_REF (dst); | |
3458 | ||
9771b263 | 3459 | new_args->jump_functions = vec_safe_copy (old_args->jump_functions); |
5ce97055 JH |
3460 | if (old_args->polymorphic_call_contexts) |
3461 | new_args->polymorphic_call_contexts | |
3462 | = vec_safe_copy (old_args->polymorphic_call_contexts); | |
8b7773a4 | 3463 | |
9771b263 | 3464 | for (i = 0; i < vec_safe_length (old_args->jump_functions); i++) |
4502fe8d MJ |
3465 | { |
3466 | struct ipa_jump_func *src_jf = ipa_get_ith_jump_func (old_args, i); | |
3467 | struct ipa_jump_func *dst_jf = ipa_get_ith_jump_func (new_args, i); | |
3468 | ||
3469 | dst_jf->agg.items = vec_safe_copy (dst_jf->agg.items); | |
3470 | ||
3471 | if (src_jf->type == IPA_JF_CONST) | |
3472 | { | |
3473 | struct ipa_cst_ref_desc *src_rdesc = jfunc_rdesc_usable (src_jf); | |
3474 | ||
3475 | if (!src_rdesc) | |
3476 | dst_jf->value.constant.rdesc = NULL; | |
568cda29 MJ |
3477 | else if (src->caller == dst->caller) |
3478 | { | |
3479 | struct ipa_ref *ref; | |
5e20cdc9 | 3480 | symtab_node *n = cgraph_node_for_jfunc (src_jf); |
568cda29 | 3481 | gcc_checking_assert (n); |
d122681a ML |
3482 | ref = src->caller->find_reference (n, src->call_stmt, |
3483 | src->lto_stmt_uid); | |
568cda29 | 3484 | gcc_checking_assert (ref); |
d122681a | 3485 | dst->caller->clone_reference (ref, ref->stmt); |
568cda29 MJ |
3486 | |
3487 | gcc_checking_assert (ipa_refdesc_pool); | |
3488 | struct ipa_cst_ref_desc *dst_rdesc | |
3489 | = (struct ipa_cst_ref_desc *) pool_alloc (ipa_refdesc_pool); | |
3490 | dst_rdesc->cs = dst; | |
3491 | dst_rdesc->refcount = src_rdesc->refcount; | |
3492 | dst_rdesc->next_duplicate = NULL; | |
3493 | dst_jf->value.constant.rdesc = dst_rdesc; | |
3494 | } | |
4502fe8d MJ |
3495 | else if (src_rdesc->cs == src) |
3496 | { | |
3497 | struct ipa_cst_ref_desc *dst_rdesc; | |
3498 | gcc_checking_assert (ipa_refdesc_pool); | |
3499 | dst_rdesc | |
3500 | = (struct ipa_cst_ref_desc *) pool_alloc (ipa_refdesc_pool); | |
3501 | dst_rdesc->cs = dst; | |
4502fe8d | 3502 | dst_rdesc->refcount = src_rdesc->refcount; |
2fd0985c MJ |
3503 | dst_rdesc->next_duplicate = src_rdesc->next_duplicate; |
3504 | src_rdesc->next_duplicate = dst_rdesc; | |
4502fe8d MJ |
3505 | dst_jf->value.constant.rdesc = dst_rdesc; |
3506 | } | |
3507 | else | |
3508 | { | |
3509 | struct ipa_cst_ref_desc *dst_rdesc; | |
3510 | /* This can happen during inlining, when a JFUNC can refer to a | |
3511 | reference taken in a function up in the tree of inline clones. | |
3512 | We need to find the duplicate that refers to our tree of | |
3513 | inline clones. */ | |
3514 | ||
3515 | gcc_assert (dst->caller->global.inlined_to); | |
3516 | for (dst_rdesc = src_rdesc->next_duplicate; | |
3517 | dst_rdesc; | |
3518 | dst_rdesc = dst_rdesc->next_duplicate) | |
2fd0985c MJ |
3519 | { |
3520 | struct cgraph_node *top; | |
3521 | top = dst_rdesc->cs->caller->global.inlined_to | |
3522 | ? dst_rdesc->cs->caller->global.inlined_to | |
3523 | : dst_rdesc->cs->caller; | |
3524 | if (dst->caller->global.inlined_to == top) | |
3525 | break; | |
3526 | } | |
44a60244 | 3527 | gcc_assert (dst_rdesc); |
4502fe8d MJ |
3528 | dst_jf->value.constant.rdesc = dst_rdesc; |
3529 | } | |
3530 | } | |
6fe45955 MJ |
3531 | else if (dst_jf->type == IPA_JF_PASS_THROUGH |
3532 | && src->caller == dst->caller) | |
3533 | { | |
3534 | struct cgraph_node *inline_root = dst->caller->global.inlined_to | |
3535 | ? dst->caller->global.inlined_to : dst->caller; | |
3536 | struct ipa_node_params *root_info = IPA_NODE_REF (inline_root); | |
3537 | int idx = ipa_get_jf_pass_through_formal_id (dst_jf); | |
3538 | ||
3539 | int c = ipa_get_controlled_uses (root_info, idx); | |
3540 | if (c != IPA_UNDESCRIBED_USE) | |
3541 | { | |
3542 | c++; | |
3543 | ipa_set_controlled_uses (root_info, idx, c); | |
3544 | } | |
3545 | } | |
4502fe8d | 3546 | } |
771578a0 MJ |
3547 | } |
3548 | ||
dd912cb8 | 3549 | /* Analyze newly added function into callgraph. */ |
be95e2b9 | 3550 | |
771578a0 | 3551 | static void |
dd912cb8 | 3552 | ipa_add_new_function (cgraph_node *node, void *data ATTRIBUTE_UNUSED) |
771578a0 | 3553 | { |
dd912cb8 ML |
3554 | if (node->has_gimple_body_p ()) |
3555 | ipa_analyze_node (node); | |
3556 | } | |
771578a0 | 3557 | |
dd912cb8 ML |
3558 | /* Hook that is called by summary when a node is duplicated. */ |
3559 | ||
3560 | void | |
3561 | ipa_node_params_t::duplicate(cgraph_node *src, cgraph_node *dst, | |
3562 | ipa_node_params *old_info, | |
3563 | ipa_node_params *new_info) | |
3564 | { | |
3565 | ipa_agg_replacement_value *old_av, *new_av; | |
771578a0 | 3566 | |
9771b263 | 3567 | new_info->descriptors = old_info->descriptors.copy (); |
310bc633 | 3568 | new_info->lattices = NULL; |
771578a0 | 3569 | new_info->ipcp_orig_node = old_info->ipcp_orig_node; |
3949c4a7 | 3570 | |
8aab5218 | 3571 | new_info->analysis_done = old_info->analysis_done; |
3949c4a7 | 3572 | new_info->node_enqueued = old_info->node_enqueued; |
2c9561b5 MJ |
3573 | |
3574 | old_av = ipa_get_agg_replacements_for_node (src); | |
04be694e | 3575 | if (old_av) |
2c9561b5 | 3576 | { |
04be694e MJ |
3577 | new_av = NULL; |
3578 | while (old_av) | |
3579 | { | |
3580 | struct ipa_agg_replacement_value *v; | |
2c9561b5 | 3581 | |
04be694e MJ |
3582 | v = ggc_alloc<ipa_agg_replacement_value> (); |
3583 | memcpy (v, old_av, sizeof (*v)); | |
3584 | v->next = new_av; | |
3585 | new_av = v; | |
3586 | old_av = old_av->next; | |
3587 | } | |
3588 | ipa_set_node_agg_value_chain (dst, new_av); | |
3589 | } | |
3590 | ||
3591 | ipcp_transformation_summary *src_trans = ipcp_get_transformation_summary (src); | |
3592 | ||
3593 | if (src_trans && vec_safe_length (src_trans->alignments) > 0) | |
3594 | { | |
3595 | ipcp_grow_transformations_if_necessary (); | |
3596 | src_trans = ipcp_get_transformation_summary (src); | |
3597 | const vec<ipa_alignment, va_gc> *src_alignments = src_trans->alignments; | |
3598 | vec<ipa_alignment, va_gc> *&dst_alignments | |
3599 | = ipcp_get_transformation_summary (dst)->alignments; | |
3600 | vec_safe_reserve_exact (dst_alignments, src_alignments->length ()); | |
3601 | for (unsigned i = 0; i < src_alignments->length (); ++i) | |
3602 | dst_alignments->quick_push ((*src_alignments)[i]); | |
2c9561b5 | 3603 | } |
771578a0 MJ |
3604 | } |
3605 | ||
3606 | /* Register our cgraph hooks if they are not already there. */ | |
be95e2b9 | 3607 | |
518dc859 | 3608 | void |
771578a0 | 3609 | ipa_register_cgraph_hooks (void) |
518dc859 | 3610 | { |
dd912cb8 ML |
3611 | ipa_check_create_node_params (); |
3612 | ||
771578a0 MJ |
3613 | if (!edge_removal_hook_holder) |
3614 | edge_removal_hook_holder = | |
3dafb85c | 3615 | symtab->add_edge_removal_hook (&ipa_edge_removal_hook, NULL); |
771578a0 MJ |
3616 | if (!edge_duplication_hook_holder) |
3617 | edge_duplication_hook_holder = | |
3dafb85c | 3618 | symtab->add_edge_duplication_hook (&ipa_edge_duplication_hook, NULL); |
dd912cb8 | 3619 | function_insertion_hook_holder = |
3dafb85c | 3620 | symtab->add_cgraph_insertion_hook (&ipa_add_new_function, NULL); |
771578a0 | 3621 | } |
518dc859 | 3622 | |
771578a0 | 3623 | /* Unregister our cgraph hooks if they are not already there. */ |
be95e2b9 | 3624 | |
771578a0 MJ |
3625 | static void |
3626 | ipa_unregister_cgraph_hooks (void) | |
3627 | { | |
3dafb85c | 3628 | symtab->remove_edge_removal_hook (edge_removal_hook_holder); |
771578a0 | 3629 | edge_removal_hook_holder = NULL; |
3dafb85c | 3630 | symtab->remove_edge_duplication_hook (edge_duplication_hook_holder); |
771578a0 | 3631 | edge_duplication_hook_holder = NULL; |
3dafb85c | 3632 | symtab->remove_cgraph_insertion_hook (function_insertion_hook_holder); |
40982661 | 3633 | function_insertion_hook_holder = NULL; |
771578a0 MJ |
3634 | } |
3635 | ||
3636 | /* Free all ipa_node_params and all ipa_edge_args structures if they are no | |
3637 | longer needed after ipa-cp. */ | |
be95e2b9 | 3638 | |
771578a0 | 3639 | void |
e33c6cd6 | 3640 | ipa_free_all_structures_after_ipa_cp (void) |
3e293154 | 3641 | { |
2bf86c84 | 3642 | if (!optimize && !in_lto_p) |
3e293154 MJ |
3643 | { |
3644 | ipa_free_all_edge_args (); | |
3645 | ipa_free_all_node_params (); | |
310bc633 | 3646 | free_alloc_pool (ipcp_sources_pool); |
44210a96 MJ |
3647 | free_alloc_pool (ipcp_cst_values_pool); |
3648 | free_alloc_pool (ipcp_poly_ctx_values_pool); | |
2c9561b5 | 3649 | free_alloc_pool (ipcp_agg_lattice_pool); |
3e293154 | 3650 | ipa_unregister_cgraph_hooks (); |
4502fe8d MJ |
3651 | if (ipa_refdesc_pool) |
3652 | free_alloc_pool (ipa_refdesc_pool); | |
3e293154 MJ |
3653 | } |
3654 | } | |
3655 | ||
3656 | /* Free all ipa_node_params and all ipa_edge_args structures if they are no | |
3657 | longer needed after indirect inlining. */ | |
be95e2b9 | 3658 | |
3e293154 | 3659 | void |
e33c6cd6 | 3660 | ipa_free_all_structures_after_iinln (void) |
771578a0 MJ |
3661 | { |
3662 | ipa_free_all_edge_args (); | |
3663 | ipa_free_all_node_params (); | |
3664 | ipa_unregister_cgraph_hooks (); | |
310bc633 MJ |
3665 | if (ipcp_sources_pool) |
3666 | free_alloc_pool (ipcp_sources_pool); | |
44210a96 MJ |
3667 | if (ipcp_cst_values_pool) |
3668 | free_alloc_pool (ipcp_cst_values_pool); | |
3669 | if (ipcp_poly_ctx_values_pool) | |
3670 | free_alloc_pool (ipcp_poly_ctx_values_pool); | |
2c9561b5 MJ |
3671 | if (ipcp_agg_lattice_pool) |
3672 | free_alloc_pool (ipcp_agg_lattice_pool); | |
4502fe8d MJ |
3673 | if (ipa_refdesc_pool) |
3674 | free_alloc_pool (ipa_refdesc_pool); | |
518dc859 RL |
3675 | } |
3676 | ||
dcd416e3 | 3677 | /* Print ipa_tree_map data structures of all functions in the |
518dc859 | 3678 | callgraph to F. */ |
be95e2b9 | 3679 | |
518dc859 | 3680 | void |
2c9561b5 | 3681 | ipa_print_node_params (FILE *f, struct cgraph_node *node) |
518dc859 RL |
3682 | { |
3683 | int i, count; | |
3e293154 | 3684 | struct ipa_node_params *info; |
518dc859 | 3685 | |
67348ccc | 3686 | if (!node->definition) |
3e293154 MJ |
3687 | return; |
3688 | info = IPA_NODE_REF (node); | |
9de04252 | 3689 | fprintf (f, " function %s/%i parameter descriptors:\n", |
fec39fa6 | 3690 | node->name (), node->order); |
3e293154 MJ |
3691 | count = ipa_get_param_count (info); |
3692 | for (i = 0; i < count; i++) | |
518dc859 | 3693 | { |
4502fe8d MJ |
3694 | int c; |
3695 | ||
a4e33812 | 3696 | fprintf (f, " "); |
e067bd43 | 3697 | ipa_dump_param (f, info, i); |
339f49ec JH |
3698 | if (ipa_is_param_used (info, i)) |
3699 | fprintf (f, " used"); | |
4502fe8d MJ |
3700 | c = ipa_get_controlled_uses (info, i); |
3701 | if (c == IPA_UNDESCRIBED_USE) | |
3702 | fprintf (f, " undescribed_use"); | |
3703 | else | |
3704 | fprintf (f, " controlled_uses=%i", c); | |
3e293154 | 3705 | fprintf (f, "\n"); |
518dc859 RL |
3706 | } |
3707 | } | |
dcd416e3 | 3708 | |
ca30a539 | 3709 | /* Print ipa_tree_map data structures of all functions in the |
3e293154 | 3710 | callgraph to F. */ |
be95e2b9 | 3711 | |
3e293154 | 3712 | void |
ca30a539 | 3713 | ipa_print_all_params (FILE * f) |
3e293154 MJ |
3714 | { |
3715 | struct cgraph_node *node; | |
3716 | ||
ca30a539 | 3717 | fprintf (f, "\nFunction parameters:\n"); |
65c70e6b | 3718 | FOR_EACH_FUNCTION (node) |
ca30a539 | 3719 | ipa_print_node_params (f, node); |
3e293154 | 3720 | } |
3f84bf08 MJ |
3721 | |
3722 | /* Return a heap allocated vector containing formal parameters of FNDECL. */ | |
3723 | ||
9771b263 | 3724 | vec<tree> |
3f84bf08 MJ |
3725 | ipa_get_vector_of_formal_parms (tree fndecl) |
3726 | { | |
9771b263 | 3727 | vec<tree> args; |
3f84bf08 MJ |
3728 | int count; |
3729 | tree parm; | |
3730 | ||
0e8853ee | 3731 | gcc_assert (!flag_wpa); |
310bc633 | 3732 | count = count_formal_params (fndecl); |
9771b263 | 3733 | args.create (count); |
910ad8de | 3734 | for (parm = DECL_ARGUMENTS (fndecl); parm; parm = DECL_CHAIN (parm)) |
9771b263 | 3735 | args.quick_push (parm); |
3f84bf08 MJ |
3736 | |
3737 | return args; | |
3738 | } | |
3739 | ||
3740 | /* Return a heap allocated vector containing types of formal parameters of | |
3741 | function type FNTYPE. */ | |
3742 | ||
31519c38 AH |
3743 | vec<tree> |
3744 | ipa_get_vector_of_formal_parm_types (tree fntype) | |
3f84bf08 | 3745 | { |
9771b263 | 3746 | vec<tree> types; |
3f84bf08 MJ |
3747 | int count = 0; |
3748 | tree t; | |
3749 | ||
3750 | for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t)) | |
3751 | count++; | |
3752 | ||
9771b263 | 3753 | types.create (count); |
3f84bf08 | 3754 | for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t)) |
9771b263 | 3755 | types.quick_push (TREE_VALUE (t)); |
3f84bf08 MJ |
3756 | |
3757 | return types; | |
3758 | } | |
3759 | ||
3760 | /* Modify the function declaration FNDECL and its type according to the plan in | |
3761 | ADJUSTMENTS. It also sets base fields of individual adjustments structures | |
3762 | to reflect the actual parameters being modified which are determined by the | |
3763 | base_index field. */ | |
3764 | ||
3765 | void | |
31519c38 | 3766 | ipa_modify_formal_parameters (tree fndecl, ipa_parm_adjustment_vec adjustments) |
3f84bf08 | 3767 | { |
31519c38 AH |
3768 | vec<tree> oparms = ipa_get_vector_of_formal_parms (fndecl); |
3769 | tree orig_type = TREE_TYPE (fndecl); | |
3770 | tree old_arg_types = TYPE_ARG_TYPES (orig_type); | |
3f84bf08 MJ |
3771 | |
3772 | /* The following test is an ugly hack, some functions simply don't have any | |
3773 | arguments in their type. This is probably a bug but well... */ | |
31519c38 AH |
3774 | bool care_for_types = (old_arg_types != NULL_TREE); |
3775 | bool last_parm_void; | |
3776 | vec<tree> otypes; | |
3f84bf08 MJ |
3777 | if (care_for_types) |
3778 | { | |
3779 | last_parm_void = (TREE_VALUE (tree_last (old_arg_types)) | |
3780 | == void_type_node); | |
31519c38 | 3781 | otypes = ipa_get_vector_of_formal_parm_types (orig_type); |
3f84bf08 | 3782 | if (last_parm_void) |
9771b263 | 3783 | gcc_assert (oparms.length () + 1 == otypes.length ()); |
3f84bf08 | 3784 | else |
9771b263 | 3785 | gcc_assert (oparms.length () == otypes.length ()); |
3f84bf08 MJ |
3786 | } |
3787 | else | |
3788 | { | |
3789 | last_parm_void = false; | |
9771b263 | 3790 | otypes.create (0); |
3f84bf08 MJ |
3791 | } |
3792 | ||
31519c38 AH |
3793 | int len = adjustments.length (); |
3794 | tree *link = &DECL_ARGUMENTS (fndecl); | |
3795 | tree new_arg_types = NULL; | |
3796 | for (int i = 0; i < len; i++) | |
3f84bf08 MJ |
3797 | { |
3798 | struct ipa_parm_adjustment *adj; | |
3799 | gcc_assert (link); | |
3800 | ||
9771b263 | 3801 | adj = &adjustments[i]; |
31519c38 AH |
3802 | tree parm; |
3803 | if (adj->op == IPA_PARM_OP_NEW) | |
3804 | parm = NULL; | |
3805 | else | |
3806 | parm = oparms[adj->base_index]; | |
3f84bf08 MJ |
3807 | adj->base = parm; |
3808 | ||
31519c38 | 3809 | if (adj->op == IPA_PARM_OP_COPY) |
3f84bf08 MJ |
3810 | { |
3811 | if (care_for_types) | |
9771b263 | 3812 | new_arg_types = tree_cons (NULL_TREE, otypes[adj->base_index], |
3f84bf08 MJ |
3813 | new_arg_types); |
3814 | *link = parm; | |
910ad8de | 3815 | link = &DECL_CHAIN (parm); |
3f84bf08 | 3816 | } |
31519c38 | 3817 | else if (adj->op != IPA_PARM_OP_REMOVE) |
3f84bf08 MJ |
3818 | { |
3819 | tree new_parm; | |
3820 | tree ptype; | |
3821 | ||
3822 | if (adj->by_ref) | |
3823 | ptype = build_pointer_type (adj->type); | |
3824 | else | |
e69dbe37 MJ |
3825 | { |
3826 | ptype = adj->type; | |
3827 | if (is_gimple_reg_type (ptype)) | |
3828 | { | |
3829 | unsigned malign = GET_MODE_ALIGNMENT (TYPE_MODE (ptype)); | |
3830 | if (TYPE_ALIGN (ptype) < malign) | |
3831 | ptype = build_aligned_type (ptype, malign); | |
3832 | } | |
3833 | } | |
3f84bf08 MJ |
3834 | |
3835 | if (care_for_types) | |
3836 | new_arg_types = tree_cons (NULL_TREE, ptype, new_arg_types); | |
3837 | ||
3838 | new_parm = build_decl (UNKNOWN_LOCATION, PARM_DECL, NULL_TREE, | |
3839 | ptype); | |
31519c38 AH |
3840 | const char *prefix = adj->arg_prefix ? adj->arg_prefix : "SYNTH"; |
3841 | DECL_NAME (new_parm) = create_tmp_var_name (prefix); | |
3f84bf08 MJ |
3842 | DECL_ARTIFICIAL (new_parm) = 1; |
3843 | DECL_ARG_TYPE (new_parm) = ptype; | |
3844 | DECL_CONTEXT (new_parm) = fndecl; | |
3845 | TREE_USED (new_parm) = 1; | |
3846 | DECL_IGNORED_P (new_parm) = 1; | |
3847 | layout_decl (new_parm, 0); | |
3848 | ||
31519c38 AH |
3849 | if (adj->op == IPA_PARM_OP_NEW) |
3850 | adj->base = NULL; | |
3851 | else | |
3852 | adj->base = parm; | |
3853 | adj->new_decl = new_parm; | |
3f84bf08 MJ |
3854 | |
3855 | *link = new_parm; | |
910ad8de | 3856 | link = &DECL_CHAIN (new_parm); |
3f84bf08 MJ |
3857 | } |
3858 | } | |
3859 | ||
3860 | *link = NULL_TREE; | |
3861 | ||
31519c38 | 3862 | tree new_reversed = NULL; |
3f84bf08 MJ |
3863 | if (care_for_types) |
3864 | { | |
3865 | new_reversed = nreverse (new_arg_types); | |
3866 | if (last_parm_void) | |
3867 | { | |
3868 | if (new_reversed) | |
3869 | TREE_CHAIN (new_arg_types) = void_list_node; | |
3870 | else | |
3871 | new_reversed = void_list_node; | |
3872 | } | |
3873 | } | |
3874 | ||
3875 | /* Use copy_node to preserve as much as possible from original type | |
3876 | (debug info, attribute lists etc.) | |
3877 | Exception is METHOD_TYPEs must have THIS argument. | |
3878 | When we are asked to remove it, we need to build new FUNCTION_TYPE | |
3879 | instead. */ | |
31519c38 | 3880 | tree new_type = NULL; |
3f84bf08 | 3881 | if (TREE_CODE (orig_type) != METHOD_TYPE |
31519c38 | 3882 | || (adjustments[0].op == IPA_PARM_OP_COPY |
9771b263 | 3883 | && adjustments[0].base_index == 0)) |
3f84bf08 | 3884 | { |
4eb3f32c | 3885 | new_type = build_distinct_type_copy (orig_type); |
3f84bf08 MJ |
3886 | TYPE_ARG_TYPES (new_type) = new_reversed; |
3887 | } | |
3888 | else | |
3889 | { | |
3890 | new_type | |
3891 | = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type), | |
3892 | new_reversed)); | |
3893 | TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type); | |
3894 | DECL_VINDEX (fndecl) = NULL_TREE; | |
3895 | } | |
3896 | ||
d402c33d JH |
3897 | /* When signature changes, we need to clear builtin info. */ |
3898 | if (DECL_BUILT_IN (fndecl)) | |
3899 | { | |
3900 | DECL_BUILT_IN_CLASS (fndecl) = NOT_BUILT_IN; | |
3901 | DECL_FUNCTION_CODE (fndecl) = (enum built_in_function) 0; | |
3902 | } | |
3903 | ||
3f84bf08 | 3904 | TREE_TYPE (fndecl) = new_type; |
9b389a5e | 3905 | DECL_VIRTUAL_P (fndecl) = 0; |
70d6d5c1 | 3906 | DECL_LANG_SPECIFIC (fndecl) = NULL; |
9771b263 DN |
3907 | otypes.release (); |
3908 | oparms.release (); | |
3f84bf08 MJ |
3909 | } |
3910 | ||
3911 | /* Modify actual arguments of a function call CS as indicated in ADJUSTMENTS. | |
3912 | If this is a directly recursive call, CS must be NULL. Otherwise it must | |
3913 | contain the corresponding call graph edge. */ | |
3914 | ||
3915 | void | |
538dd0b7 | 3916 | ipa_modify_call_arguments (struct cgraph_edge *cs, gcall *stmt, |
3f84bf08 MJ |
3917 | ipa_parm_adjustment_vec adjustments) |
3918 | { | |
d52f5295 | 3919 | struct cgraph_node *current_node = cgraph_node::get (current_function_decl); |
9771b263 DN |
3920 | vec<tree> vargs; |
3921 | vec<tree, va_gc> **debug_args = NULL; | |
538dd0b7 | 3922 | gcall *new_stmt; |
82338059 | 3923 | gimple_stmt_iterator gsi, prev_gsi; |
3f84bf08 MJ |
3924 | tree callee_decl; |
3925 | int i, len; | |
3926 | ||
9771b263 DN |
3927 | len = adjustments.length (); |
3928 | vargs.create (len); | |
67348ccc | 3929 | callee_decl = !cs ? gimple_call_fndecl (stmt) : cs->callee->decl; |
d122681a | 3930 | current_node->remove_stmt_references (stmt); |
3f84bf08 MJ |
3931 | |
3932 | gsi = gsi_for_stmt (stmt); | |
82338059 MJ |
3933 | prev_gsi = gsi; |
3934 | gsi_prev (&prev_gsi); | |
3f84bf08 MJ |
3935 | for (i = 0; i < len; i++) |
3936 | { | |
3937 | struct ipa_parm_adjustment *adj; | |
3938 | ||
9771b263 | 3939 | adj = &adjustments[i]; |
3f84bf08 | 3940 | |
31519c38 | 3941 | if (adj->op == IPA_PARM_OP_COPY) |
3f84bf08 MJ |
3942 | { |
3943 | tree arg = gimple_call_arg (stmt, adj->base_index); | |
3944 | ||
9771b263 | 3945 | vargs.quick_push (arg); |
3f84bf08 | 3946 | } |
31519c38 | 3947 | else if (adj->op != IPA_PARM_OP_REMOVE) |
3f84bf08 | 3948 | { |
fffe1e40 MJ |
3949 | tree expr, base, off; |
3950 | location_t loc; | |
f43245d1 | 3951 | unsigned int deref_align = 0; |
c1ed6a01 | 3952 | bool deref_base = false; |
fffe1e40 MJ |
3953 | |
3954 | /* We create a new parameter out of the value of the old one, we can | |
3955 | do the following kind of transformations: | |
3956 | ||
3957 | - A scalar passed by reference is converted to a scalar passed by | |
3958 | value. (adj->by_ref is false and the type of the original | |
3959 | actual argument is a pointer to a scalar). | |
3960 | ||
3961 | - A part of an aggregate is passed instead of the whole aggregate. | |
3962 | The part can be passed either by value or by reference, this is | |
3963 | determined by value of adj->by_ref. Moreover, the code below | |
3964 | handles both situations when the original aggregate is passed by | |
3965 | value (its type is not a pointer) and when it is passed by | |
3966 | reference (it is a pointer to an aggregate). | |
3967 | ||
3968 | When the new argument is passed by reference (adj->by_ref is true) | |
3969 | it must be a part of an aggregate and therefore we form it by | |
3970 | simply taking the address of a reference inside the original | |
3971 | aggregate. */ | |
3972 | ||
3973 | gcc_checking_assert (adj->offset % BITS_PER_UNIT == 0); | |
3974 | base = gimple_call_arg (stmt, adj->base_index); | |
3a50da34 DC |
3975 | loc = DECL_P (base) ? DECL_SOURCE_LOCATION (base) |
3976 | : EXPR_LOCATION (base); | |
fffe1e40 | 3977 | |
82d49829 MJ |
3978 | if (TREE_CODE (base) != ADDR_EXPR |
3979 | && POINTER_TYPE_P (TREE_TYPE (base))) | |
3980 | off = build_int_cst (adj->alias_ptr_type, | |
fffe1e40 | 3981 | adj->offset / BITS_PER_UNIT); |
3f84bf08 | 3982 | else |
3f84bf08 | 3983 | { |
fffe1e40 MJ |
3984 | HOST_WIDE_INT base_offset; |
3985 | tree prev_base; | |
c1ed6a01 | 3986 | bool addrof; |
fffe1e40 MJ |
3987 | |
3988 | if (TREE_CODE (base) == ADDR_EXPR) | |
c1ed6a01 MJ |
3989 | { |
3990 | base = TREE_OPERAND (base, 0); | |
3991 | addrof = true; | |
3992 | } | |
3993 | else | |
3994 | addrof = false; | |
fffe1e40 MJ |
3995 | prev_base = base; |
3996 | base = get_addr_base_and_unit_offset (base, &base_offset); | |
3997 | /* Aggregate arguments can have non-invariant addresses. */ | |
3998 | if (!base) | |
3999 | { | |
4000 | base = build_fold_addr_expr (prev_base); | |
82d49829 | 4001 | off = build_int_cst (adj->alias_ptr_type, |
fffe1e40 MJ |
4002 | adj->offset / BITS_PER_UNIT); |
4003 | } | |
4004 | else if (TREE_CODE (base) == MEM_REF) | |
4005 | { | |
c1ed6a01 MJ |
4006 | if (!addrof) |
4007 | { | |
4008 | deref_base = true; | |
4009 | deref_align = TYPE_ALIGN (TREE_TYPE (base)); | |
4010 | } | |
82d49829 | 4011 | off = build_int_cst (adj->alias_ptr_type, |
fffe1e40 MJ |
4012 | base_offset |
4013 | + adj->offset / BITS_PER_UNIT); | |
4014 | off = int_const_binop (PLUS_EXPR, TREE_OPERAND (base, 1), | |
d35936ab | 4015 | off); |
fffe1e40 MJ |
4016 | base = TREE_OPERAND (base, 0); |
4017 | } | |
4018 | else | |
4019 | { | |
82d49829 | 4020 | off = build_int_cst (adj->alias_ptr_type, |
fffe1e40 MJ |
4021 | base_offset |
4022 | + adj->offset / BITS_PER_UNIT); | |
4023 | base = build_fold_addr_expr (base); | |
4024 | } | |
3f84bf08 | 4025 | } |
fffe1e40 | 4026 | |
3a5a825a RG |
4027 | if (!adj->by_ref) |
4028 | { | |
4029 | tree type = adj->type; | |
4030 | unsigned int align; | |
4031 | unsigned HOST_WIDE_INT misalign; | |
644ffefd | 4032 | |
c1ed6a01 MJ |
4033 | if (deref_base) |
4034 | { | |
4035 | align = deref_align; | |
4036 | misalign = 0; | |
4037 | } | |
4038 | else | |
4039 | { | |
4040 | get_pointer_alignment_1 (base, &align, &misalign); | |
4041 | if (TYPE_ALIGN (type) > align) | |
4042 | align = TYPE_ALIGN (type); | |
4043 | } | |
807e902e | 4044 | misalign += (offset_int::from (off, SIGNED).to_short_addr () |
3a5a825a RG |
4045 | * BITS_PER_UNIT); |
4046 | misalign = misalign & (align - 1); | |
4047 | if (misalign != 0) | |
4048 | align = (misalign & -misalign); | |
4049 | if (align < TYPE_ALIGN (type)) | |
4050 | type = build_aligned_type (type, align); | |
4df65a85 RB |
4051 | base = force_gimple_operand_gsi (&gsi, base, |
4052 | true, NULL, true, GSI_SAME_STMT); | |
3a5a825a | 4053 | expr = fold_build2_loc (loc, MEM_REF, type, base, off); |
4df65a85 RB |
4054 | /* If expr is not a valid gimple call argument emit |
4055 | a load into a temporary. */ | |
4056 | if (is_gimple_reg_type (TREE_TYPE (expr))) | |
4057 | { | |
4058 | gimple tem = gimple_build_assign (NULL_TREE, expr); | |
4059 | if (gimple_in_ssa_p (cfun)) | |
4060 | { | |
4061 | gimple_set_vuse (tem, gimple_vuse (stmt)); | |
4062 | expr = make_ssa_name (TREE_TYPE (expr), tem); | |
4063 | } | |
4064 | else | |
b731b390 | 4065 | expr = create_tmp_reg (TREE_TYPE (expr)); |
4df65a85 RB |
4066 | gimple_assign_set_lhs (tem, expr); |
4067 | gsi_insert_before (&gsi, tem, GSI_SAME_STMT); | |
4068 | } | |
3a5a825a RG |
4069 | } |
4070 | else | |
4071 | { | |
4072 | expr = fold_build2_loc (loc, MEM_REF, adj->type, base, off); | |
4073 | expr = build_fold_addr_expr (expr); | |
4df65a85 RB |
4074 | expr = force_gimple_operand_gsi (&gsi, expr, |
4075 | true, NULL, true, GSI_SAME_STMT); | |
3a5a825a | 4076 | } |
9771b263 | 4077 | vargs.quick_push (expr); |
3f84bf08 | 4078 | } |
31519c38 | 4079 | if (adj->op != IPA_PARM_OP_COPY && MAY_HAVE_DEBUG_STMTS) |
ddb555ed JJ |
4080 | { |
4081 | unsigned int ix; | |
4082 | tree ddecl = NULL_TREE, origin = DECL_ORIGIN (adj->base), arg; | |
4083 | gimple def_temp; | |
4084 | ||
4085 | arg = gimple_call_arg (stmt, adj->base_index); | |
4086 | if (!useless_type_conversion_p (TREE_TYPE (origin), TREE_TYPE (arg))) | |
4087 | { | |
4088 | if (!fold_convertible_p (TREE_TYPE (origin), arg)) | |
4089 | continue; | |
4090 | arg = fold_convert_loc (gimple_location (stmt), | |
4091 | TREE_TYPE (origin), arg); | |
4092 | } | |
4093 | if (debug_args == NULL) | |
4094 | debug_args = decl_debug_args_insert (callee_decl); | |
9771b263 | 4095 | for (ix = 0; vec_safe_iterate (*debug_args, ix, &ddecl); ix += 2) |
ddb555ed JJ |
4096 | if (ddecl == origin) |
4097 | { | |
9771b263 | 4098 | ddecl = (**debug_args)[ix + 1]; |
ddb555ed JJ |
4099 | break; |
4100 | } | |
4101 | if (ddecl == NULL) | |
4102 | { | |
4103 | ddecl = make_node (DEBUG_EXPR_DECL); | |
4104 | DECL_ARTIFICIAL (ddecl) = 1; | |
4105 | TREE_TYPE (ddecl) = TREE_TYPE (origin); | |
4106 | DECL_MODE (ddecl) = DECL_MODE (origin); | |
4107 | ||
9771b263 DN |
4108 | vec_safe_push (*debug_args, origin); |
4109 | vec_safe_push (*debug_args, ddecl); | |
ddb555ed | 4110 | } |
9771b263 | 4111 | def_temp = gimple_build_debug_bind (ddecl, unshare_expr (arg), stmt); |
ddb555ed JJ |
4112 | gsi_insert_before (&gsi, def_temp, GSI_SAME_STMT); |
4113 | } | |
3f84bf08 MJ |
4114 | } |
4115 | ||
4116 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4117 | { | |
4118 | fprintf (dump_file, "replacing stmt:"); | |
4119 | print_gimple_stmt (dump_file, gsi_stmt (gsi), 0, 0); | |
4120 | } | |
4121 | ||
3f84bf08 | 4122 | new_stmt = gimple_build_call_vec (callee_decl, vargs); |
9771b263 | 4123 | vargs.release (); |
3f84bf08 MJ |
4124 | if (gimple_call_lhs (stmt)) |
4125 | gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt)); | |
4126 | ||
4127 | gimple_set_block (new_stmt, gimple_block (stmt)); | |
4128 | if (gimple_has_location (stmt)) | |
4129 | gimple_set_location (new_stmt, gimple_location (stmt)); | |
3f84bf08 | 4130 | gimple_call_set_chain (new_stmt, gimple_call_chain (stmt)); |
a7a296ab | 4131 | gimple_call_copy_flags (new_stmt, stmt); |
4df65a85 RB |
4132 | if (gimple_in_ssa_p (cfun)) |
4133 | { | |
4134 | gimple_set_vuse (new_stmt, gimple_vuse (stmt)); | |
4135 | if (gimple_vdef (stmt)) | |
4136 | { | |
4137 | gimple_set_vdef (new_stmt, gimple_vdef (stmt)); | |
4138 | SSA_NAME_DEF_STMT (gimple_vdef (new_stmt)) = new_stmt; | |
4139 | } | |
4140 | } | |
3f84bf08 MJ |
4141 | |
4142 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4143 | { | |
4144 | fprintf (dump_file, "with stmt:"); | |
4145 | print_gimple_stmt (dump_file, new_stmt, 0, 0); | |
4146 | fprintf (dump_file, "\n"); | |
4147 | } | |
4148 | gsi_replace (&gsi, new_stmt, true); | |
4149 | if (cs) | |
3dafb85c | 4150 | cs->set_call_stmt (new_stmt); |
82338059 MJ |
4151 | do |
4152 | { | |
d52f5295 | 4153 | current_node->record_stmt_references (gsi_stmt (gsi)); |
82338059 MJ |
4154 | gsi_prev (&gsi); |
4155 | } | |
3d354792 | 4156 | while (gsi_stmt (gsi) != gsi_stmt (prev_gsi)); |
3f84bf08 MJ |
4157 | } |
4158 | ||
31519c38 AH |
4159 | /* If the expression *EXPR should be replaced by a reduction of a parameter, do |
4160 | so. ADJUSTMENTS is a pointer to a vector of adjustments. CONVERT | |
4161 | specifies whether the function should care about type incompatibility the | |
4162 | current and new expressions. If it is false, the function will leave | |
4163 | incompatibility issues to the caller. Return true iff the expression | |
4164 | was modified. */ | |
4165 | ||
4166 | bool | |
4167 | ipa_modify_expr (tree *expr, bool convert, | |
4168 | ipa_parm_adjustment_vec adjustments) | |
4169 | { | |
4170 | struct ipa_parm_adjustment *cand | |
4171 | = ipa_get_adjustment_candidate (&expr, &convert, adjustments, false); | |
4172 | if (!cand) | |
4173 | return false; | |
4174 | ||
4175 | tree src; | |
4176 | if (cand->by_ref) | |
4177 | src = build_simple_mem_ref (cand->new_decl); | |
4178 | else | |
4179 | src = cand->new_decl; | |
4180 | ||
4181 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4182 | { | |
4183 | fprintf (dump_file, "About to replace expr "); | |
4184 | print_generic_expr (dump_file, *expr, 0); | |
4185 | fprintf (dump_file, " with "); | |
4186 | print_generic_expr (dump_file, src, 0); | |
4187 | fprintf (dump_file, "\n"); | |
4188 | } | |
4189 | ||
4190 | if (convert && !useless_type_conversion_p (TREE_TYPE (*expr), cand->type)) | |
4191 | { | |
4192 | tree vce = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (*expr), src); | |
4193 | *expr = vce; | |
4194 | } | |
4195 | else | |
4196 | *expr = src; | |
4197 | return true; | |
4198 | } | |
4199 | ||
4200 | /* If T is an SSA_NAME, return NULL if it is not a default def or | |
4201 | return its base variable if it is. If IGNORE_DEFAULT_DEF is true, | |
4202 | the base variable is always returned, regardless if it is a default | |
4203 | def. Return T if it is not an SSA_NAME. */ | |
4204 | ||
4205 | static tree | |
4206 | get_ssa_base_param (tree t, bool ignore_default_def) | |
4207 | { | |
4208 | if (TREE_CODE (t) == SSA_NAME) | |
4209 | { | |
4210 | if (ignore_default_def || SSA_NAME_IS_DEFAULT_DEF (t)) | |
4211 | return SSA_NAME_VAR (t); | |
4212 | else | |
4213 | return NULL_TREE; | |
4214 | } | |
4215 | return t; | |
4216 | } | |
4217 | ||
4218 | /* Given an expression, return an adjustment entry specifying the | |
4219 | transformation to be done on EXPR. If no suitable adjustment entry | |
4220 | was found, returns NULL. | |
4221 | ||
4222 | If IGNORE_DEFAULT_DEF is set, consider SSA_NAMEs which are not a | |
4223 | default def, otherwise bail on them. | |
4224 | ||
4225 | If CONVERT is non-NULL, this function will set *CONVERT if the | |
4226 | expression provided is a component reference. ADJUSTMENTS is the | |
4227 | adjustments vector. */ | |
4228 | ||
4229 | ipa_parm_adjustment * | |
4230 | ipa_get_adjustment_candidate (tree **expr, bool *convert, | |
4231 | ipa_parm_adjustment_vec adjustments, | |
4232 | bool ignore_default_def) | |
4233 | { | |
4234 | if (TREE_CODE (**expr) == BIT_FIELD_REF | |
4235 | || TREE_CODE (**expr) == IMAGPART_EXPR | |
4236 | || TREE_CODE (**expr) == REALPART_EXPR) | |
4237 | { | |
4238 | *expr = &TREE_OPERAND (**expr, 0); | |
4239 | if (convert) | |
4240 | *convert = true; | |
4241 | } | |
4242 | ||
4243 | HOST_WIDE_INT offset, size, max_size; | |
4244 | tree base = get_ref_base_and_extent (**expr, &offset, &size, &max_size); | |
4245 | if (!base || size == -1 || max_size == -1) | |
4246 | return NULL; | |
4247 | ||
4248 | if (TREE_CODE (base) == MEM_REF) | |
4249 | { | |
807e902e | 4250 | offset += mem_ref_offset (base).to_short_addr () * BITS_PER_UNIT; |
31519c38 AH |
4251 | base = TREE_OPERAND (base, 0); |
4252 | } | |
4253 | ||
4254 | base = get_ssa_base_param (base, ignore_default_def); | |
4255 | if (!base || TREE_CODE (base) != PARM_DECL) | |
4256 | return NULL; | |
4257 | ||
4258 | struct ipa_parm_adjustment *cand = NULL; | |
4259 | unsigned int len = adjustments.length (); | |
4260 | for (unsigned i = 0; i < len; i++) | |
4261 | { | |
4262 | struct ipa_parm_adjustment *adj = &adjustments[i]; | |
4263 | ||
4264 | if (adj->base == base | |
4265 | && (adj->offset == offset || adj->op == IPA_PARM_OP_REMOVE)) | |
4266 | { | |
4267 | cand = adj; | |
4268 | break; | |
4269 | } | |
4270 | } | |
4271 | ||
4272 | if (!cand || cand->op == IPA_PARM_OP_COPY || cand->op == IPA_PARM_OP_REMOVE) | |
4273 | return NULL; | |
4274 | return cand; | |
4275 | } | |
4276 | ||
3f84bf08 MJ |
4277 | /* Return true iff BASE_INDEX is in ADJUSTMENTS more than once. */ |
4278 | ||
4279 | static bool | |
4280 | index_in_adjustments_multiple_times_p (int base_index, | |
4281 | ipa_parm_adjustment_vec adjustments) | |
4282 | { | |
9771b263 | 4283 | int i, len = adjustments.length (); |
3f84bf08 MJ |
4284 | bool one = false; |
4285 | ||
4286 | for (i = 0; i < len; i++) | |
4287 | { | |
4288 | struct ipa_parm_adjustment *adj; | |
9771b263 | 4289 | adj = &adjustments[i]; |
3f84bf08 MJ |
4290 | |
4291 | if (adj->base_index == base_index) | |
4292 | { | |
4293 | if (one) | |
4294 | return true; | |
4295 | else | |
4296 | one = true; | |
4297 | } | |
4298 | } | |
4299 | return false; | |
4300 | } | |
4301 | ||
4302 | ||
4303 | /* Return adjustments that should have the same effect on function parameters | |
4304 | and call arguments as if they were first changed according to adjustments in | |
4305 | INNER and then by adjustments in OUTER. */ | |
4306 | ||
4307 | ipa_parm_adjustment_vec | |
4308 | ipa_combine_adjustments (ipa_parm_adjustment_vec inner, | |
4309 | ipa_parm_adjustment_vec outer) | |
4310 | { | |
9771b263 DN |
4311 | int i, outlen = outer.length (); |
4312 | int inlen = inner.length (); | |
3f84bf08 MJ |
4313 | int removals = 0; |
4314 | ipa_parm_adjustment_vec adjustments, tmp; | |
4315 | ||
9771b263 | 4316 | tmp.create (inlen); |
3f84bf08 MJ |
4317 | for (i = 0; i < inlen; i++) |
4318 | { | |
4319 | struct ipa_parm_adjustment *n; | |
9771b263 | 4320 | n = &inner[i]; |
3f84bf08 | 4321 | |
31519c38 | 4322 | if (n->op == IPA_PARM_OP_REMOVE) |
3f84bf08 MJ |
4323 | removals++; |
4324 | else | |
31519c38 AH |
4325 | { |
4326 | /* FIXME: Handling of new arguments are not implemented yet. */ | |
4327 | gcc_assert (n->op != IPA_PARM_OP_NEW); | |
4328 | tmp.quick_push (*n); | |
4329 | } | |
3f84bf08 MJ |
4330 | } |
4331 | ||
9771b263 | 4332 | adjustments.create (outlen + removals); |
3f84bf08 MJ |
4333 | for (i = 0; i < outlen; i++) |
4334 | { | |
f32682ca | 4335 | struct ipa_parm_adjustment r; |
9771b263 DN |
4336 | struct ipa_parm_adjustment *out = &outer[i]; |
4337 | struct ipa_parm_adjustment *in = &tmp[out->base_index]; | |
3f84bf08 | 4338 | |
f32682ca | 4339 | memset (&r, 0, sizeof (r)); |
31519c38 AH |
4340 | gcc_assert (in->op != IPA_PARM_OP_REMOVE); |
4341 | if (out->op == IPA_PARM_OP_REMOVE) | |
3f84bf08 MJ |
4342 | { |
4343 | if (!index_in_adjustments_multiple_times_p (in->base_index, tmp)) | |
4344 | { | |
31519c38 | 4345 | r.op = IPA_PARM_OP_REMOVE; |
9771b263 | 4346 | adjustments.quick_push (r); |
3f84bf08 MJ |
4347 | } |
4348 | continue; | |
4349 | } | |
31519c38 AH |
4350 | else |
4351 | { | |
4352 | /* FIXME: Handling of new arguments are not implemented yet. */ | |
4353 | gcc_assert (out->op != IPA_PARM_OP_NEW); | |
4354 | } | |
3f84bf08 | 4355 | |
f32682ca DN |
4356 | r.base_index = in->base_index; |
4357 | r.type = out->type; | |
3f84bf08 MJ |
4358 | |
4359 | /* FIXME: Create nonlocal value too. */ | |
4360 | ||
31519c38 AH |
4361 | if (in->op == IPA_PARM_OP_COPY && out->op == IPA_PARM_OP_COPY) |
4362 | r.op = IPA_PARM_OP_COPY; | |
4363 | else if (in->op == IPA_PARM_OP_COPY) | |
f32682ca | 4364 | r.offset = out->offset; |
31519c38 | 4365 | else if (out->op == IPA_PARM_OP_COPY) |
f32682ca | 4366 | r.offset = in->offset; |
3f84bf08 | 4367 | else |
f32682ca | 4368 | r.offset = in->offset + out->offset; |
9771b263 | 4369 | adjustments.quick_push (r); |
3f84bf08 MJ |
4370 | } |
4371 | ||
4372 | for (i = 0; i < inlen; i++) | |
4373 | { | |
9771b263 | 4374 | struct ipa_parm_adjustment *n = &inner[i]; |
3f84bf08 | 4375 | |
31519c38 | 4376 | if (n->op == IPA_PARM_OP_REMOVE) |
9771b263 | 4377 | adjustments.quick_push (*n); |
3f84bf08 MJ |
4378 | } |
4379 | ||
9771b263 | 4380 | tmp.release (); |
3f84bf08 MJ |
4381 | return adjustments; |
4382 | } | |
4383 | ||
4384 | /* Dump the adjustments in the vector ADJUSTMENTS to dump_file in a human | |
4385 | friendly way, assuming they are meant to be applied to FNDECL. */ | |
4386 | ||
4387 | void | |
4388 | ipa_dump_param_adjustments (FILE *file, ipa_parm_adjustment_vec adjustments, | |
4389 | tree fndecl) | |
4390 | { | |
9771b263 | 4391 | int i, len = adjustments.length (); |
3f84bf08 | 4392 | bool first = true; |
9771b263 | 4393 | vec<tree> parms = ipa_get_vector_of_formal_parms (fndecl); |
3f84bf08 MJ |
4394 | |
4395 | fprintf (file, "IPA param adjustments: "); | |
4396 | for (i = 0; i < len; i++) | |
4397 | { | |
4398 | struct ipa_parm_adjustment *adj; | |
9771b263 | 4399 | adj = &adjustments[i]; |
3f84bf08 MJ |
4400 | |
4401 | if (!first) | |
4402 | fprintf (file, " "); | |
4403 | else | |
4404 | first = false; | |
4405 | ||
4406 | fprintf (file, "%i. base_index: %i - ", i, adj->base_index); | |
9771b263 | 4407 | print_generic_expr (file, parms[adj->base_index], 0); |
3f84bf08 MJ |
4408 | if (adj->base) |
4409 | { | |
4410 | fprintf (file, ", base: "); | |
4411 | print_generic_expr (file, adj->base, 0); | |
4412 | } | |
31519c38 | 4413 | if (adj->new_decl) |
3f84bf08 | 4414 | { |
31519c38 AH |
4415 | fprintf (file, ", new_decl: "); |
4416 | print_generic_expr (file, adj->new_decl, 0); | |
3f84bf08 MJ |
4417 | } |
4418 | if (adj->new_ssa_base) | |
4419 | { | |
4420 | fprintf (file, ", new_ssa_base: "); | |
4421 | print_generic_expr (file, adj->new_ssa_base, 0); | |
4422 | } | |
4423 | ||
31519c38 | 4424 | if (adj->op == IPA_PARM_OP_COPY) |
3f84bf08 | 4425 | fprintf (file, ", copy_param"); |
31519c38 | 4426 | else if (adj->op == IPA_PARM_OP_REMOVE) |
3f84bf08 MJ |
4427 | fprintf (file, ", remove_param"); |
4428 | else | |
4429 | fprintf (file, ", offset %li", (long) adj->offset); | |
4430 | if (adj->by_ref) | |
4431 | fprintf (file, ", by_ref"); | |
4432 | print_node_brief (file, ", type: ", adj->type, 0); | |
4433 | fprintf (file, "\n"); | |
4434 | } | |
9771b263 | 4435 | parms.release (); |
3f84bf08 MJ |
4436 | } |
4437 | ||
2c9561b5 MJ |
4438 | /* Dump the AV linked list. */ |
4439 | ||
4440 | void | |
4441 | ipa_dump_agg_replacement_values (FILE *f, struct ipa_agg_replacement_value *av) | |
4442 | { | |
4443 | bool comma = false; | |
4444 | fprintf (f, " Aggregate replacements:"); | |
4445 | for (; av; av = av->next) | |
4446 | { | |
4447 | fprintf (f, "%s %i[" HOST_WIDE_INT_PRINT_DEC "]=", comma ? "," : "", | |
4448 | av->index, av->offset); | |
4449 | print_generic_expr (f, av->value, 0); | |
4450 | comma = true; | |
4451 | } | |
4452 | fprintf (f, "\n"); | |
4453 | } | |
4454 | ||
fb3f88cc JH |
4455 | /* Stream out jump function JUMP_FUNC to OB. */ |
4456 | ||
4457 | static void | |
4458 | ipa_write_jump_function (struct output_block *ob, | |
4459 | struct ipa_jump_func *jump_func) | |
4460 | { | |
8b7773a4 MJ |
4461 | struct ipa_agg_jf_item *item; |
4462 | struct bitpack_d bp; | |
4463 | int i, count; | |
fb3f88cc | 4464 | |
8b7773a4 | 4465 | streamer_write_uhwi (ob, jump_func->type); |
fb3f88cc JH |
4466 | switch (jump_func->type) |
4467 | { | |
4468 | case IPA_JF_UNKNOWN: | |
4469 | break; | |
4470 | case IPA_JF_CONST: | |
5368224f | 4471 | gcc_assert ( |
4502fe8d MJ |
4472 | EXPR_LOCATION (jump_func->value.constant.value) == UNKNOWN_LOCATION); |
4473 | stream_write_tree (ob, jump_func->value.constant.value, true); | |
fb3f88cc JH |
4474 | break; |
4475 | case IPA_JF_PASS_THROUGH: | |
412288f1 | 4476 | streamer_write_uhwi (ob, jump_func->value.pass_through.operation); |
4a53743e MJ |
4477 | if (jump_func->value.pass_through.operation == NOP_EXPR) |
4478 | { | |
4479 | streamer_write_uhwi (ob, jump_func->value.pass_through.formal_id); | |
4480 | bp = bitpack_create (ob->main_stream); | |
4481 | bp_pack_value (&bp, jump_func->value.pass_through.agg_preserved, 1); | |
4482 | streamer_write_bitpack (&bp); | |
4483 | } | |
4484 | else | |
4485 | { | |
4486 | stream_write_tree (ob, jump_func->value.pass_through.operand, true); | |
4487 | streamer_write_uhwi (ob, jump_func->value.pass_through.formal_id); | |
4488 | } | |
fb3f88cc JH |
4489 | break; |
4490 | case IPA_JF_ANCESTOR: | |
412288f1 | 4491 | streamer_write_uhwi (ob, jump_func->value.ancestor.offset); |
412288f1 | 4492 | streamer_write_uhwi (ob, jump_func->value.ancestor.formal_id); |
8b7773a4 MJ |
4493 | bp = bitpack_create (ob->main_stream); |
4494 | bp_pack_value (&bp, jump_func->value.ancestor.agg_preserved, 1); | |
4495 | streamer_write_bitpack (&bp); | |
fb3f88cc | 4496 | break; |
8b7773a4 MJ |
4497 | } |
4498 | ||
9771b263 | 4499 | count = vec_safe_length (jump_func->agg.items); |
8b7773a4 MJ |
4500 | streamer_write_uhwi (ob, count); |
4501 | if (count) | |
4502 | { | |
4503 | bp = bitpack_create (ob->main_stream); | |
4504 | bp_pack_value (&bp, jump_func->agg.by_ref, 1); | |
4505 | streamer_write_bitpack (&bp); | |
4506 | } | |
4507 | ||
9771b263 | 4508 | FOR_EACH_VEC_SAFE_ELT (jump_func->agg.items, i, item) |
8b7773a4 MJ |
4509 | { |
4510 | streamer_write_uhwi (ob, item->offset); | |
4511 | stream_write_tree (ob, item->value, true); | |
fb3f88cc | 4512 | } |
04be694e MJ |
4513 | |
4514 | bp = bitpack_create (ob->main_stream); | |
4515 | bp_pack_value (&bp, jump_func->alignment.known, 1); | |
4516 | streamer_write_bitpack (&bp); | |
4517 | if (jump_func->alignment.known) | |
4518 | { | |
4519 | streamer_write_uhwi (ob, jump_func->alignment.align); | |
4520 | streamer_write_uhwi (ob, jump_func->alignment.misalign); | |
4521 | } | |
fb3f88cc JH |
4522 | } |
4523 | ||
4524 | /* Read in jump function JUMP_FUNC from IB. */ | |
4525 | ||
4526 | static void | |
4527 | ipa_read_jump_function (struct lto_input_block *ib, | |
4528 | struct ipa_jump_func *jump_func, | |
4502fe8d | 4529 | struct cgraph_edge *cs, |
fb3f88cc JH |
4530 | struct data_in *data_in) |
4531 | { | |
4a53743e MJ |
4532 | enum jump_func_type jftype; |
4533 | enum tree_code operation; | |
8b7773a4 | 4534 | int i, count; |
fb3f88cc | 4535 | |
4a53743e MJ |
4536 | jftype = (enum jump_func_type) streamer_read_uhwi (ib); |
4537 | switch (jftype) | |
fb3f88cc JH |
4538 | { |
4539 | case IPA_JF_UNKNOWN: | |
04be694e | 4540 | ipa_set_jf_unknown (jump_func); |
fb3f88cc JH |
4541 | break; |
4542 | case IPA_JF_CONST: | |
4502fe8d | 4543 | ipa_set_jf_constant (jump_func, stream_read_tree (ib, data_in), cs); |
fb3f88cc JH |
4544 | break; |
4545 | case IPA_JF_PASS_THROUGH: | |
4a53743e MJ |
4546 | operation = (enum tree_code) streamer_read_uhwi (ib); |
4547 | if (operation == NOP_EXPR) | |
4548 | { | |
4549 | int formal_id = streamer_read_uhwi (ib); | |
4550 | struct bitpack_d bp = streamer_read_bitpack (ib); | |
4551 | bool agg_preserved = bp_unpack_value (&bp, 1); | |
3b97a5c7 | 4552 | ipa_set_jf_simple_pass_through (jump_func, formal_id, agg_preserved); |
4a53743e MJ |
4553 | } |
4554 | else | |
4555 | { | |
4556 | tree operand = stream_read_tree (ib, data_in); | |
4557 | int formal_id = streamer_read_uhwi (ib); | |
4558 | ipa_set_jf_arith_pass_through (jump_func, formal_id, operand, | |
4559 | operation); | |
4560 | } | |
fb3f88cc JH |
4561 | break; |
4562 | case IPA_JF_ANCESTOR: | |
4a53743e MJ |
4563 | { |
4564 | HOST_WIDE_INT offset = streamer_read_uhwi (ib); | |
4a53743e MJ |
4565 | int formal_id = streamer_read_uhwi (ib); |
4566 | struct bitpack_d bp = streamer_read_bitpack (ib); | |
4567 | bool agg_preserved = bp_unpack_value (&bp, 1); | |
3b97a5c7 | 4568 | ipa_set_ancestor_jf (jump_func, offset, formal_id, agg_preserved); |
4a53743e MJ |
4569 | break; |
4570 | } | |
8b7773a4 MJ |
4571 | } |
4572 | ||
4573 | count = streamer_read_uhwi (ib); | |
9771b263 | 4574 | vec_alloc (jump_func->agg.items, count); |
8b7773a4 MJ |
4575 | if (count) |
4576 | { | |
4a53743e | 4577 | struct bitpack_d bp = streamer_read_bitpack (ib); |
8b7773a4 MJ |
4578 | jump_func->agg.by_ref = bp_unpack_value (&bp, 1); |
4579 | } | |
4580 | for (i = 0; i < count; i++) | |
4581 | { | |
f32682ca DN |
4582 | struct ipa_agg_jf_item item; |
4583 | item.offset = streamer_read_uhwi (ib); | |
4584 | item.value = stream_read_tree (ib, data_in); | |
9771b263 | 4585 | jump_func->agg.items->quick_push (item); |
fb3f88cc | 4586 | } |
04be694e MJ |
4587 | |
4588 | struct bitpack_d bp = streamer_read_bitpack (ib); | |
4589 | bool alignment_known = bp_unpack_value (&bp, 1); | |
4590 | if (alignment_known) | |
4591 | { | |
4592 | jump_func->alignment.known = true; | |
4593 | jump_func->alignment.align = streamer_read_uhwi (ib); | |
4594 | jump_func->alignment.misalign = streamer_read_uhwi (ib); | |
4595 | } | |
4596 | else | |
4597 | jump_func->alignment.known = false; | |
fb3f88cc JH |
4598 | } |
4599 | ||
e33c6cd6 MJ |
4600 | /* Stream out parts of cgraph_indirect_call_info corresponding to CS that are |
4601 | relevant to indirect inlining to OB. */ | |
661e7330 MJ |
4602 | |
4603 | static void | |
e33c6cd6 MJ |
4604 | ipa_write_indirect_edge_info (struct output_block *ob, |
4605 | struct cgraph_edge *cs) | |
661e7330 | 4606 | { |
e33c6cd6 | 4607 | struct cgraph_indirect_call_info *ii = cs->indirect_info; |
2465dcc2 | 4608 | struct bitpack_d bp; |
e33c6cd6 | 4609 | |
412288f1 | 4610 | streamer_write_hwi (ob, ii->param_index); |
2465dcc2 RG |
4611 | bp = bitpack_create (ob->main_stream); |
4612 | bp_pack_value (&bp, ii->polymorphic, 1); | |
8b7773a4 | 4613 | bp_pack_value (&bp, ii->agg_contents, 1); |
c13bc3d9 | 4614 | bp_pack_value (&bp, ii->member_ptr, 1); |
8b7773a4 | 4615 | bp_pack_value (&bp, ii->by_ref, 1); |
0127c169 | 4616 | bp_pack_value (&bp, ii->vptr_changed, 1); |
412288f1 | 4617 | streamer_write_bitpack (&bp); |
ba392339 JH |
4618 | if (ii->agg_contents || ii->polymorphic) |
4619 | streamer_write_hwi (ob, ii->offset); | |
4620 | else | |
4621 | gcc_assert (ii->offset == 0); | |
b258210c MJ |
4622 | |
4623 | if (ii->polymorphic) | |
4624 | { | |
412288f1 | 4625 | streamer_write_hwi (ob, ii->otr_token); |
b9393656 | 4626 | stream_write_tree (ob, ii->otr_type, true); |
ba392339 | 4627 | ii->context.stream_out (ob); |
b258210c | 4628 | } |
661e7330 MJ |
4629 | } |
4630 | ||
e33c6cd6 MJ |
4631 | /* Read in parts of cgraph_indirect_call_info corresponding to CS that are |
4632 | relevant to indirect inlining from IB. */ | |
661e7330 MJ |
4633 | |
4634 | static void | |
e33c6cd6 | 4635 | ipa_read_indirect_edge_info (struct lto_input_block *ib, |
ba392339 | 4636 | struct data_in *data_in, |
e33c6cd6 | 4637 | struct cgraph_edge *cs) |
661e7330 | 4638 | { |
e33c6cd6 | 4639 | struct cgraph_indirect_call_info *ii = cs->indirect_info; |
2465dcc2 | 4640 | struct bitpack_d bp; |
661e7330 | 4641 | |
412288f1 | 4642 | ii->param_index = (int) streamer_read_hwi (ib); |
412288f1 | 4643 | bp = streamer_read_bitpack (ib); |
2465dcc2 | 4644 | ii->polymorphic = bp_unpack_value (&bp, 1); |
8b7773a4 | 4645 | ii->agg_contents = bp_unpack_value (&bp, 1); |
c13bc3d9 | 4646 | ii->member_ptr = bp_unpack_value (&bp, 1); |
8b7773a4 | 4647 | ii->by_ref = bp_unpack_value (&bp, 1); |
0127c169 | 4648 | ii->vptr_changed = bp_unpack_value (&bp, 1); |
ba392339 JH |
4649 | if (ii->agg_contents || ii->polymorphic) |
4650 | ii->offset = (HOST_WIDE_INT) streamer_read_hwi (ib); | |
4651 | else | |
4652 | ii->offset = 0; | |
b258210c MJ |
4653 | if (ii->polymorphic) |
4654 | { | |
412288f1 | 4655 | ii->otr_token = (HOST_WIDE_INT) streamer_read_hwi (ib); |
b9393656 | 4656 | ii->otr_type = stream_read_tree (ib, data_in); |
ba392339 | 4657 | ii->context.stream_in (ib, data_in); |
b258210c | 4658 | } |
661e7330 MJ |
4659 | } |
4660 | ||
fb3f88cc JH |
4661 | /* Stream out NODE info to OB. */ |
4662 | ||
4663 | static void | |
4664 | ipa_write_node_info (struct output_block *ob, struct cgraph_node *node) | |
4665 | { | |
4666 | int node_ref; | |
7380e6ef | 4667 | lto_symtab_encoder_t encoder; |
fb3f88cc JH |
4668 | struct ipa_node_params *info = IPA_NODE_REF (node); |
4669 | int j; | |
4670 | struct cgraph_edge *e; | |
2465dcc2 | 4671 | struct bitpack_d bp; |
fb3f88cc | 4672 | |
7380e6ef | 4673 | encoder = ob->decl_state->symtab_node_encoder; |
67348ccc | 4674 | node_ref = lto_symtab_encoder_encode (encoder, node); |
412288f1 | 4675 | streamer_write_uhwi (ob, node_ref); |
fb3f88cc | 4676 | |
0e8853ee JH |
4677 | streamer_write_uhwi (ob, ipa_get_param_count (info)); |
4678 | for (j = 0; j < ipa_get_param_count (info); j++) | |
4679 | streamer_write_uhwi (ob, ipa_get_param_move_cost (info, j)); | |
2465dcc2 | 4680 | bp = bitpack_create (ob->main_stream); |
8aab5218 | 4681 | gcc_assert (info->analysis_done |
661e7330 | 4682 | || ipa_get_param_count (info) == 0); |
fb3f88cc JH |
4683 | gcc_assert (!info->node_enqueued); |
4684 | gcc_assert (!info->ipcp_orig_node); | |
4685 | for (j = 0; j < ipa_get_param_count (info); j++) | |
310bc633 | 4686 | bp_pack_value (&bp, ipa_is_param_used (info, j), 1); |
412288f1 | 4687 | streamer_write_bitpack (&bp); |
4502fe8d MJ |
4688 | for (j = 0; j < ipa_get_param_count (info); j++) |
4689 | streamer_write_hwi (ob, ipa_get_controlled_uses (info, j)); | |
fb3f88cc JH |
4690 | for (e = node->callees; e; e = e->next_callee) |
4691 | { | |
4692 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
4693 | ||
5ce97055 JH |
4694 | streamer_write_uhwi (ob, |
4695 | ipa_get_cs_argument_count (args) * 2 | |
4696 | + (args->polymorphic_call_contexts != NULL)); | |
fb3f88cc | 4697 | for (j = 0; j < ipa_get_cs_argument_count (args); j++) |
5ce97055 JH |
4698 | { |
4699 | ipa_write_jump_function (ob, ipa_get_ith_jump_func (args, j)); | |
4700 | if (args->polymorphic_call_contexts != NULL) | |
4701 | ipa_get_ith_polymorhic_call_context (args, j)->stream_out (ob); | |
4702 | } | |
fb3f88cc | 4703 | } |
e33c6cd6 | 4704 | for (e = node->indirect_calls; e; e = e->next_callee) |
c8246dbe JH |
4705 | { |
4706 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
4707 | ||
5ce97055 JH |
4708 | streamer_write_uhwi (ob, |
4709 | ipa_get_cs_argument_count (args) * 2 | |
4710 | + (args->polymorphic_call_contexts != NULL)); | |
c8246dbe | 4711 | for (j = 0; j < ipa_get_cs_argument_count (args); j++) |
5ce97055 JH |
4712 | { |
4713 | ipa_write_jump_function (ob, ipa_get_ith_jump_func (args, j)); | |
4714 | if (args->polymorphic_call_contexts != NULL) | |
4715 | ipa_get_ith_polymorhic_call_context (args, j)->stream_out (ob); | |
4716 | } | |
c8246dbe JH |
4717 | ipa_write_indirect_edge_info (ob, e); |
4718 | } | |
fb3f88cc JH |
4719 | } |
4720 | ||
61502ca8 | 4721 | /* Stream in NODE info from IB. */ |
fb3f88cc JH |
4722 | |
4723 | static void | |
4724 | ipa_read_node_info (struct lto_input_block *ib, struct cgraph_node *node, | |
4725 | struct data_in *data_in) | |
4726 | { | |
4727 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
4728 | int k; | |
4729 | struct cgraph_edge *e; | |
2465dcc2 | 4730 | struct bitpack_d bp; |
fb3f88cc | 4731 | |
0e8853ee | 4732 | ipa_alloc_node_params (node, streamer_read_uhwi (ib)); |
fb3f88cc | 4733 | |
0e8853ee JH |
4734 | for (k = 0; k < ipa_get_param_count (info); k++) |
4735 | info->descriptors[k].move_cost = streamer_read_uhwi (ib); | |
4736 | ||
412288f1 | 4737 | bp = streamer_read_bitpack (ib); |
fb3f88cc | 4738 | if (ipa_get_param_count (info) != 0) |
8aab5218 | 4739 | info->analysis_done = true; |
fb3f88cc JH |
4740 | info->node_enqueued = false; |
4741 | for (k = 0; k < ipa_get_param_count (info); k++) | |
310bc633 | 4742 | ipa_set_param_used (info, k, bp_unpack_value (&bp, 1)); |
1b14621a MJ |
4743 | for (k = 0; k < ipa_get_param_count (info); k++) |
4744 | ipa_set_controlled_uses (info, k, streamer_read_hwi (ib)); | |
fb3f88cc JH |
4745 | for (e = node->callees; e; e = e->next_callee) |
4746 | { | |
4747 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
412288f1 | 4748 | int count = streamer_read_uhwi (ib); |
5ce97055 JH |
4749 | bool contexts_computed = count & 1; |
4750 | count /= 2; | |
fb3f88cc | 4751 | |
fb3f88cc JH |
4752 | if (!count) |
4753 | continue; | |
9771b263 | 4754 | vec_safe_grow_cleared (args->jump_functions, count); |
5ce97055 JH |
4755 | if (contexts_computed) |
4756 | vec_safe_grow_cleared (args->polymorphic_call_contexts, count); | |
fb3f88cc | 4757 | |
fb3f88cc | 4758 | for (k = 0; k < ipa_get_cs_argument_count (args); k++) |
5ce97055 JH |
4759 | { |
4760 | ipa_read_jump_function (ib, ipa_get_ith_jump_func (args, k), e, | |
4761 | data_in); | |
4762 | if (contexts_computed) | |
4763 | ipa_get_ith_polymorhic_call_context (args, k)->stream_in (ib, data_in); | |
4764 | } | |
fb3f88cc | 4765 | } |
e33c6cd6 | 4766 | for (e = node->indirect_calls; e; e = e->next_callee) |
c8246dbe JH |
4767 | { |
4768 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
412288f1 | 4769 | int count = streamer_read_uhwi (ib); |
5ce97055 JH |
4770 | bool contexts_computed = count & 1; |
4771 | count /= 2; | |
c8246dbe | 4772 | |
c8246dbe JH |
4773 | if (count) |
4774 | { | |
9771b263 | 4775 | vec_safe_grow_cleared (args->jump_functions, count); |
5ce97055 JH |
4776 | if (contexts_computed) |
4777 | vec_safe_grow_cleared (args->polymorphic_call_contexts, count); | |
c8246dbe | 4778 | for (k = 0; k < ipa_get_cs_argument_count (args); k++) |
5ce97055 JH |
4779 | { |
4780 | ipa_read_jump_function (ib, ipa_get_ith_jump_func (args, k), e, | |
4781 | data_in); | |
4782 | if (contexts_computed) | |
4783 | ipa_get_ith_polymorhic_call_context (args, k)->stream_in (ib, data_in); | |
4784 | } | |
c8246dbe JH |
4785 | } |
4786 | ipa_read_indirect_edge_info (ib, data_in, e); | |
4787 | } | |
fb3f88cc JH |
4788 | } |
4789 | ||
4790 | /* Write jump functions for nodes in SET. */ | |
4791 | ||
4792 | void | |
f27c1867 | 4793 | ipa_prop_write_jump_functions (void) |
fb3f88cc JH |
4794 | { |
4795 | struct cgraph_node *node; | |
93536c97 | 4796 | struct output_block *ob; |
fb3f88cc | 4797 | unsigned int count = 0; |
f27c1867 JH |
4798 | lto_symtab_encoder_iterator lsei; |
4799 | lto_symtab_encoder_t encoder; | |
4800 | ||
dd912cb8 | 4801 | if (!ipa_node_params_sum) |
93536c97 | 4802 | return; |
fb3f88cc | 4803 | |
93536c97 | 4804 | ob = create_output_block (LTO_section_jump_functions); |
f27c1867 | 4805 | encoder = ob->decl_state->symtab_node_encoder; |
0b83e688 | 4806 | ob->symbol = NULL; |
f27c1867 JH |
4807 | for (lsei = lsei_start_function_in_partition (encoder); !lsei_end_p (lsei); |
4808 | lsei_next_function_in_partition (&lsei)) | |
fb3f88cc | 4809 | { |
f27c1867 | 4810 | node = lsei_cgraph_node (lsei); |
d52f5295 | 4811 | if (node->has_gimple_body_p () |
c47d0034 | 4812 | && IPA_NODE_REF (node) != NULL) |
fb3f88cc JH |
4813 | count++; |
4814 | } | |
4815 | ||
412288f1 | 4816 | streamer_write_uhwi (ob, count); |
fb3f88cc JH |
4817 | |
4818 | /* Process all of the functions. */ | |
f27c1867 JH |
4819 | for (lsei = lsei_start_function_in_partition (encoder); !lsei_end_p (lsei); |
4820 | lsei_next_function_in_partition (&lsei)) | |
fb3f88cc | 4821 | { |
f27c1867 | 4822 | node = lsei_cgraph_node (lsei); |
d52f5295 | 4823 | if (node->has_gimple_body_p () |
c47d0034 | 4824 | && IPA_NODE_REF (node) != NULL) |
fb3f88cc JH |
4825 | ipa_write_node_info (ob, node); |
4826 | } | |
412288f1 | 4827 | streamer_write_char_stream (ob->main_stream, 0); |
fb3f88cc JH |
4828 | produce_asm (ob, NULL); |
4829 | destroy_output_block (ob); | |
4830 | } | |
4831 | ||
4832 | /* Read section in file FILE_DATA of length LEN with data DATA. */ | |
4833 | ||
4834 | static void | |
4835 | ipa_prop_read_section (struct lto_file_decl_data *file_data, const char *data, | |
4836 | size_t len) | |
4837 | { | |
4838 | const struct lto_function_header *header = | |
4839 | (const struct lto_function_header *) data; | |
4ad9a9de EB |
4840 | const int cfg_offset = sizeof (struct lto_function_header); |
4841 | const int main_offset = cfg_offset + header->cfg_size; | |
4842 | const int string_offset = main_offset + header->main_size; | |
fb3f88cc | 4843 | struct data_in *data_in; |
fb3f88cc JH |
4844 | unsigned int i; |
4845 | unsigned int count; | |
4846 | ||
207c68cd RB |
4847 | lto_input_block ib_main ((const char *) data + main_offset, |
4848 | header->main_size); | |
fb3f88cc JH |
4849 | |
4850 | data_in = | |
4851 | lto_data_in_create (file_data, (const char *) data + string_offset, | |
6e1aa848 | 4852 | header->string_size, vNULL); |
412288f1 | 4853 | count = streamer_read_uhwi (&ib_main); |
fb3f88cc JH |
4854 | |
4855 | for (i = 0; i < count; i++) | |
4856 | { | |
4857 | unsigned int index; | |
4858 | struct cgraph_node *node; | |
7380e6ef | 4859 | lto_symtab_encoder_t encoder; |
fb3f88cc | 4860 | |
412288f1 | 4861 | index = streamer_read_uhwi (&ib_main); |
7380e6ef | 4862 | encoder = file_data->symtab_node_encoder; |
d52f5295 ML |
4863 | node = dyn_cast<cgraph_node *> (lto_symtab_encoder_deref (encoder, |
4864 | index)); | |
67348ccc | 4865 | gcc_assert (node->definition); |
fb3f88cc JH |
4866 | ipa_read_node_info (&ib_main, node, data_in); |
4867 | } | |
4868 | lto_free_section_data (file_data, LTO_section_jump_functions, NULL, data, | |
4869 | len); | |
4870 | lto_data_in_delete (data_in); | |
4871 | } | |
4872 | ||
4873 | /* Read ipcp jump functions. */ | |
4874 | ||
4875 | void | |
4876 | ipa_prop_read_jump_functions (void) | |
4877 | { | |
4878 | struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data (); | |
4879 | struct lto_file_decl_data *file_data; | |
4880 | unsigned int j = 0; | |
4881 | ||
4882 | ipa_check_create_node_params (); | |
4883 | ipa_check_create_edge_args (); | |
4884 | ipa_register_cgraph_hooks (); | |
4885 | ||
4886 | while ((file_data = file_data_vec[j++])) | |
4887 | { | |
4888 | size_t len; | |
4889 | const char *data = lto_get_section_data (file_data, LTO_section_jump_functions, NULL, &len); | |
4890 | ||
4891 | if (data) | |
4892 | ipa_prop_read_section (file_data, data, len); | |
4893 | } | |
4894 | } | |
4895 | ||
b8698a0f | 4896 | /* After merging units, we can get mismatch in argument counts. |
61502ca8 | 4897 | Also decl merging might've rendered parameter lists obsolete. |
fb3f88cc JH |
4898 | Also compute called_with_variable_arg info. */ |
4899 | ||
4900 | void | |
4901 | ipa_update_after_lto_read (void) | |
4902 | { | |
05d3aa37 MJ |
4903 | ipa_check_create_node_params (); |
4904 | ipa_check_create_edge_args (); | |
fb3f88cc | 4905 | } |
2c9561b5 MJ |
4906 | |
4907 | void | |
04be694e | 4908 | write_ipcp_transformation_info (output_block *ob, cgraph_node *node) |
2c9561b5 MJ |
4909 | { |
4910 | int node_ref; | |
4911 | unsigned int count = 0; | |
4912 | lto_symtab_encoder_t encoder; | |
4913 | struct ipa_agg_replacement_value *aggvals, *av; | |
4914 | ||
4915 | aggvals = ipa_get_agg_replacements_for_node (node); | |
4916 | encoder = ob->decl_state->symtab_node_encoder; | |
67348ccc | 4917 | node_ref = lto_symtab_encoder_encode (encoder, node); |
2c9561b5 MJ |
4918 | streamer_write_uhwi (ob, node_ref); |
4919 | ||
4920 | for (av = aggvals; av; av = av->next) | |
4921 | count++; | |
4922 | streamer_write_uhwi (ob, count); | |
4923 | ||
4924 | for (av = aggvals; av; av = av->next) | |
4925 | { | |
7b920a9a MJ |
4926 | struct bitpack_d bp; |
4927 | ||
2c9561b5 MJ |
4928 | streamer_write_uhwi (ob, av->offset); |
4929 | streamer_write_uhwi (ob, av->index); | |
4930 | stream_write_tree (ob, av->value, true); | |
7b920a9a MJ |
4931 | |
4932 | bp = bitpack_create (ob->main_stream); | |
4933 | bp_pack_value (&bp, av->by_ref, 1); | |
4934 | streamer_write_bitpack (&bp); | |
2c9561b5 | 4935 | } |
04be694e MJ |
4936 | |
4937 | ipcp_transformation_summary *ts = ipcp_get_transformation_summary (node); | |
4938 | if (ts && vec_safe_length (ts->alignments) > 0) | |
4939 | { | |
4940 | count = ts->alignments->length (); | |
4941 | ||
4942 | streamer_write_uhwi (ob, count); | |
4943 | for (unsigned i = 0; i < count; ++i) | |
4944 | { | |
4945 | ipa_alignment *parm_al = &(*ts->alignments)[i]; | |
4946 | ||
4947 | struct bitpack_d bp; | |
4948 | bp = bitpack_create (ob->main_stream); | |
4949 | bp_pack_value (&bp, parm_al->known, 1); | |
4950 | streamer_write_bitpack (&bp); | |
4951 | if (parm_al->known) | |
4952 | { | |
4953 | streamer_write_uhwi (ob, parm_al->align); | |
4954 | streamer_write_hwi_in_range (ob->main_stream, 0, parm_al->align, | |
4955 | parm_al->misalign); | |
4956 | } | |
4957 | } | |
4958 | } | |
4959 | else | |
4960 | streamer_write_uhwi (ob, 0); | |
2c9561b5 MJ |
4961 | } |
4962 | ||
4963 | /* Stream in the aggregate value replacement chain for NODE from IB. */ | |
4964 | ||
4965 | static void | |
04be694e MJ |
4966 | read_ipcp_transformation_info (lto_input_block *ib, cgraph_node *node, |
4967 | data_in *data_in) | |
2c9561b5 MJ |
4968 | { |
4969 | struct ipa_agg_replacement_value *aggvals = NULL; | |
4970 | unsigned int count, i; | |
4971 | ||
4972 | count = streamer_read_uhwi (ib); | |
4973 | for (i = 0; i <count; i++) | |
4974 | { | |
4975 | struct ipa_agg_replacement_value *av; | |
7b920a9a | 4976 | struct bitpack_d bp; |
2c9561b5 | 4977 | |
766090c2 | 4978 | av = ggc_alloc<ipa_agg_replacement_value> (); |
2c9561b5 MJ |
4979 | av->offset = streamer_read_uhwi (ib); |
4980 | av->index = streamer_read_uhwi (ib); | |
4981 | av->value = stream_read_tree (ib, data_in); | |
7b920a9a MJ |
4982 | bp = streamer_read_bitpack (ib); |
4983 | av->by_ref = bp_unpack_value (&bp, 1); | |
2c9561b5 MJ |
4984 | av->next = aggvals; |
4985 | aggvals = av; | |
4986 | } | |
4987 | ipa_set_node_agg_value_chain (node, aggvals); | |
04be694e MJ |
4988 | |
4989 | count = streamer_read_uhwi (ib); | |
4990 | if (count > 0) | |
4991 | { | |
4992 | ipcp_grow_transformations_if_necessary (); | |
4993 | ||
4994 | ipcp_transformation_summary *ts = ipcp_get_transformation_summary (node); | |
4995 | vec_safe_grow_cleared (ts->alignments, count); | |
4996 | ||
4997 | for (i = 0; i < count; i++) | |
4998 | { | |
4999 | ipa_alignment *parm_al; | |
5000 | parm_al = &(*ts->alignments)[i]; | |
5001 | struct bitpack_d bp; | |
5002 | bp = streamer_read_bitpack (ib); | |
5003 | parm_al->known = bp_unpack_value (&bp, 1); | |
5004 | if (parm_al->known) | |
5005 | { | |
5006 | parm_al->align = streamer_read_uhwi (ib); | |
5007 | parm_al->misalign | |
5008 | = streamer_read_hwi_in_range (ib, "ipa-prop misalign", | |
5009 | 0, parm_al->align); | |
5010 | } | |
5011 | } | |
5012 | } | |
2c9561b5 MJ |
5013 | } |
5014 | ||
5015 | /* Write all aggregate replacement for nodes in set. */ | |
5016 | ||
5017 | void | |
04be694e | 5018 | ipcp_write_transformation_summaries (void) |
2c9561b5 MJ |
5019 | { |
5020 | struct cgraph_node *node; | |
5021 | struct output_block *ob; | |
5022 | unsigned int count = 0; | |
5023 | lto_symtab_encoder_iterator lsei; | |
5024 | lto_symtab_encoder_t encoder; | |
5025 | ||
2c9561b5 MJ |
5026 | ob = create_output_block (LTO_section_ipcp_transform); |
5027 | encoder = ob->decl_state->symtab_node_encoder; | |
0b83e688 | 5028 | ob->symbol = NULL; |
2c9561b5 MJ |
5029 | for (lsei = lsei_start_function_in_partition (encoder); !lsei_end_p (lsei); |
5030 | lsei_next_function_in_partition (&lsei)) | |
5031 | { | |
5032 | node = lsei_cgraph_node (lsei); | |
04be694e | 5033 | if (node->has_gimple_body_p ()) |
2c9561b5 MJ |
5034 | count++; |
5035 | } | |
5036 | ||
5037 | streamer_write_uhwi (ob, count); | |
5038 | ||
5039 | for (lsei = lsei_start_function_in_partition (encoder); !lsei_end_p (lsei); | |
5040 | lsei_next_function_in_partition (&lsei)) | |
5041 | { | |
5042 | node = lsei_cgraph_node (lsei); | |
04be694e MJ |
5043 | if (node->has_gimple_body_p ()) |
5044 | write_ipcp_transformation_info (ob, node); | |
2c9561b5 MJ |
5045 | } |
5046 | streamer_write_char_stream (ob->main_stream, 0); | |
5047 | produce_asm (ob, NULL); | |
5048 | destroy_output_block (ob); | |
5049 | } | |
5050 | ||
5051 | /* Read replacements section in file FILE_DATA of length LEN with data | |
5052 | DATA. */ | |
5053 | ||
5054 | static void | |
5055 | read_replacements_section (struct lto_file_decl_data *file_data, | |
5056 | const char *data, | |
5057 | size_t len) | |
5058 | { | |
5059 | const struct lto_function_header *header = | |
5060 | (const struct lto_function_header *) data; | |
5061 | const int cfg_offset = sizeof (struct lto_function_header); | |
5062 | const int main_offset = cfg_offset + header->cfg_size; | |
5063 | const int string_offset = main_offset + header->main_size; | |
5064 | struct data_in *data_in; | |
2c9561b5 MJ |
5065 | unsigned int i; |
5066 | unsigned int count; | |
5067 | ||
207c68cd RB |
5068 | lto_input_block ib_main ((const char *) data + main_offset, |
5069 | header->main_size); | |
2c9561b5 MJ |
5070 | |
5071 | data_in = lto_data_in_create (file_data, (const char *) data + string_offset, | |
6e1aa848 | 5072 | header->string_size, vNULL); |
2c9561b5 MJ |
5073 | count = streamer_read_uhwi (&ib_main); |
5074 | ||
5075 | for (i = 0; i < count; i++) | |
5076 | { | |
5077 | unsigned int index; | |
5078 | struct cgraph_node *node; | |
5079 | lto_symtab_encoder_t encoder; | |
5080 | ||
5081 | index = streamer_read_uhwi (&ib_main); | |
5082 | encoder = file_data->symtab_node_encoder; | |
d52f5295 ML |
5083 | node = dyn_cast<cgraph_node *> (lto_symtab_encoder_deref (encoder, |
5084 | index)); | |
67348ccc | 5085 | gcc_assert (node->definition); |
04be694e | 5086 | read_ipcp_transformation_info (&ib_main, node, data_in); |
2c9561b5 MJ |
5087 | } |
5088 | lto_free_section_data (file_data, LTO_section_jump_functions, NULL, data, | |
5089 | len); | |
5090 | lto_data_in_delete (data_in); | |
5091 | } | |
5092 | ||
5093 | /* Read IPA-CP aggregate replacements. */ | |
5094 | ||
5095 | void | |
04be694e | 5096 | ipcp_read_transformation_summaries (void) |
2c9561b5 MJ |
5097 | { |
5098 | struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data (); | |
5099 | struct lto_file_decl_data *file_data; | |
5100 | unsigned int j = 0; | |
5101 | ||
5102 | while ((file_data = file_data_vec[j++])) | |
5103 | { | |
5104 | size_t len; | |
5105 | const char *data = lto_get_section_data (file_data, | |
5106 | LTO_section_ipcp_transform, | |
5107 | NULL, &len); | |
5108 | if (data) | |
5109 | read_replacements_section (file_data, data, len); | |
5110 | } | |
5111 | } | |
5112 | ||
5113 | /* Adjust the aggregate replacements in AGGVAL to reflect parameters skipped in | |
5114 | NODE. */ | |
5115 | ||
5116 | static void | |
5117 | adjust_agg_replacement_values (struct cgraph_node *node, | |
5118 | struct ipa_agg_replacement_value *aggval) | |
5119 | { | |
5120 | struct ipa_agg_replacement_value *v; | |
5121 | int i, c = 0, d = 0, *adj; | |
5122 | ||
5123 | if (!node->clone.combined_args_to_skip) | |
5124 | return; | |
5125 | ||
5126 | for (v = aggval; v; v = v->next) | |
5127 | { | |
5128 | gcc_assert (v->index >= 0); | |
5129 | if (c < v->index) | |
5130 | c = v->index; | |
5131 | } | |
5132 | c++; | |
5133 | ||
5134 | adj = XALLOCAVEC (int, c); | |
5135 | for (i = 0; i < c; i++) | |
5136 | if (bitmap_bit_p (node->clone.combined_args_to_skip, i)) | |
5137 | { | |
5138 | adj[i] = -1; | |
5139 | d++; | |
5140 | } | |
5141 | else | |
5142 | adj[i] = i - d; | |
5143 | ||
5144 | for (v = aggval; v; v = v->next) | |
5145 | v->index = adj[v->index]; | |
5146 | } | |
5147 | ||
8aab5218 MJ |
5148 | /* Dominator walker driving the ipcp modification phase. */ |
5149 | ||
5150 | class ipcp_modif_dom_walker : public dom_walker | |
5151 | { | |
5152 | public: | |
5153 | ipcp_modif_dom_walker (struct func_body_info *fbi, | |
5154 | vec<ipa_param_descriptor> descs, | |
5155 | struct ipa_agg_replacement_value *av, | |
5156 | bool *sc, bool *cc) | |
5157 | : dom_walker (CDI_DOMINATORS), m_fbi (fbi), m_descriptors (descs), | |
5158 | m_aggval (av), m_something_changed (sc), m_cfg_changed (cc) {} | |
5159 | ||
5160 | virtual void before_dom_children (basic_block); | |
5161 | ||
5162 | private: | |
5163 | struct func_body_info *m_fbi; | |
5164 | vec<ipa_param_descriptor> m_descriptors; | |
5165 | struct ipa_agg_replacement_value *m_aggval; | |
5166 | bool *m_something_changed, *m_cfg_changed; | |
5167 | }; | |
5168 | ||
5169 | void | |
5170 | ipcp_modif_dom_walker::before_dom_children (basic_block bb) | |
5171 | { | |
5172 | gimple_stmt_iterator gsi; | |
5173 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
5174 | { | |
5175 | struct ipa_agg_replacement_value *v; | |
5176 | gimple stmt = gsi_stmt (gsi); | |
5177 | tree rhs, val, t; | |
5178 | HOST_WIDE_INT offset, size; | |
5179 | int index; | |
5180 | bool by_ref, vce; | |
5181 | ||
5182 | if (!gimple_assign_load_p (stmt)) | |
5183 | continue; | |
5184 | rhs = gimple_assign_rhs1 (stmt); | |
5185 | if (!is_gimple_reg_type (TREE_TYPE (rhs))) | |
5186 | continue; | |
2c9561b5 | 5187 | |
8aab5218 MJ |
5188 | vce = false; |
5189 | t = rhs; | |
5190 | while (handled_component_p (t)) | |
5191 | { | |
5192 | /* V_C_E can do things like convert an array of integers to one | |
5193 | bigger integer and similar things we do not handle below. */ | |
5194 | if (TREE_CODE (rhs) == VIEW_CONVERT_EXPR) | |
5195 | { | |
5196 | vce = true; | |
5197 | break; | |
5198 | } | |
5199 | t = TREE_OPERAND (t, 0); | |
5200 | } | |
5201 | if (vce) | |
5202 | continue; | |
5203 | ||
5204 | if (!ipa_load_from_parm_agg_1 (m_fbi, m_descriptors, stmt, rhs, &index, | |
5205 | &offset, &size, &by_ref)) | |
5206 | continue; | |
5207 | for (v = m_aggval; v; v = v->next) | |
5208 | if (v->index == index | |
5209 | && v->offset == offset) | |
5210 | break; | |
5211 | if (!v | |
5212 | || v->by_ref != by_ref | |
5213 | || tree_to_shwi (TYPE_SIZE (TREE_TYPE (v->value))) != size) | |
5214 | continue; | |
5215 | ||
5216 | gcc_checking_assert (is_gimple_ip_invariant (v->value)); | |
5217 | if (!useless_type_conversion_p (TREE_TYPE (rhs), TREE_TYPE (v->value))) | |
5218 | { | |
5219 | if (fold_convertible_p (TREE_TYPE (rhs), v->value)) | |
5220 | val = fold_build1 (NOP_EXPR, TREE_TYPE (rhs), v->value); | |
5221 | else if (TYPE_SIZE (TREE_TYPE (rhs)) | |
5222 | == TYPE_SIZE (TREE_TYPE (v->value))) | |
5223 | val = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (rhs), v->value); | |
5224 | else | |
5225 | { | |
5226 | if (dump_file) | |
5227 | { | |
5228 | fprintf (dump_file, " const "); | |
5229 | print_generic_expr (dump_file, v->value, 0); | |
5230 | fprintf (dump_file, " can't be converted to type of "); | |
5231 | print_generic_expr (dump_file, rhs, 0); | |
5232 | fprintf (dump_file, "\n"); | |
5233 | } | |
5234 | continue; | |
5235 | } | |
5236 | } | |
5237 | else | |
5238 | val = v->value; | |
5239 | ||
5240 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5241 | { | |
5242 | fprintf (dump_file, "Modifying stmt:\n "); | |
5243 | print_gimple_stmt (dump_file, stmt, 0, 0); | |
5244 | } | |
5245 | gimple_assign_set_rhs_from_tree (&gsi, val); | |
5246 | update_stmt (stmt); | |
5247 | ||
5248 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
5249 | { | |
5250 | fprintf (dump_file, "into:\n "); | |
5251 | print_gimple_stmt (dump_file, stmt, 0, 0); | |
5252 | fprintf (dump_file, "\n"); | |
5253 | } | |
5254 | ||
5255 | *m_something_changed = true; | |
5256 | if (maybe_clean_eh_stmt (stmt) | |
5257 | && gimple_purge_dead_eh_edges (gimple_bb (stmt))) | |
5258 | *m_cfg_changed = true; | |
5259 | } | |
5260 | ||
5261 | } | |
5262 | ||
04be694e MJ |
5263 | /* Update alignment of formal parameters as described in |
5264 | ipcp_transformation_summary. */ | |
5265 | ||
5266 | static void | |
5267 | ipcp_update_alignments (struct cgraph_node *node) | |
5268 | { | |
5269 | tree fndecl = node->decl; | |
5270 | tree parm = DECL_ARGUMENTS (fndecl); | |
5271 | tree next_parm = parm; | |
5272 | ipcp_transformation_summary *ts = ipcp_get_transformation_summary (node); | |
5273 | if (!ts || vec_safe_length (ts->alignments) == 0) | |
5274 | return; | |
5275 | const vec<ipa_alignment, va_gc> &alignments = *ts->alignments; | |
5276 | unsigned count = alignments.length (); | |
5277 | ||
5278 | for (unsigned i = 0; i < count; ++i, parm = next_parm) | |
5279 | { | |
5280 | if (node->clone.combined_args_to_skip | |
5281 | && bitmap_bit_p (node->clone.combined_args_to_skip, i)) | |
5282 | continue; | |
5283 | gcc_checking_assert (parm); | |
5284 | next_parm = DECL_CHAIN (parm); | |
5285 | ||
5286 | if (!alignments[i].known || !is_gimple_reg (parm)) | |
5287 | continue; | |
5288 | tree ddef = ssa_default_def (DECL_STRUCT_FUNCTION (node->decl), parm); | |
5289 | if (!ddef) | |
5290 | continue; | |
5291 | ||
5292 | if (dump_file) | |
5293 | fprintf (dump_file, " Adjusting alignment of param %u to %u, " | |
5294 | "misalignment to %u\n", i, alignments[i].align, | |
5295 | alignments[i].misalign); | |
5296 | ||
5297 | struct ptr_info_def *pi = get_ptr_info (ddef); | |
5298 | gcc_checking_assert (pi); | |
5299 | unsigned old_align; | |
5300 | unsigned old_misalign; | |
5301 | bool old_known = get_ptr_info_alignment (pi, &old_align, &old_misalign); | |
5302 | ||
5303 | if (old_known | |
5304 | && old_align >= alignments[i].align) | |
5305 | { | |
5306 | if (dump_file) | |
5307 | fprintf (dump_file, " But the alignment was already %u.\n", | |
5308 | old_align); | |
5309 | continue; | |
5310 | } | |
5311 | set_ptr_info_alignment (pi, alignments[i].align, alignments[i].misalign); | |
5312 | } | |
5313 | } | |
5314 | ||
8aab5218 | 5315 | /* IPCP transformation phase doing propagation of aggregate values. */ |
2c9561b5 MJ |
5316 | |
5317 | unsigned int | |
5318 | ipcp_transform_function (struct cgraph_node *node) | |
5319 | { | |
84562394 | 5320 | vec<ipa_param_descriptor> descriptors = vNULL; |
8aab5218 | 5321 | struct func_body_info fbi; |
2c9561b5 | 5322 | struct ipa_agg_replacement_value *aggval; |
2c9561b5 MJ |
5323 | int param_count; |
5324 | bool cfg_changed = false, something_changed = false; | |
5325 | ||
5326 | gcc_checking_assert (cfun); | |
5327 | gcc_checking_assert (current_function_decl); | |
5328 | ||
5329 | if (dump_file) | |
5330 | fprintf (dump_file, "Modification phase of node %s/%i\n", | |
fec39fa6 | 5331 | node->name (), node->order); |
2c9561b5 | 5332 | |
04be694e | 5333 | ipcp_update_alignments (node); |
2c9561b5 MJ |
5334 | aggval = ipa_get_agg_replacements_for_node (node); |
5335 | if (!aggval) | |
5336 | return 0; | |
67348ccc | 5337 | param_count = count_formal_params (node->decl); |
2c9561b5 MJ |
5338 | if (param_count == 0) |
5339 | return 0; | |
5340 | adjust_agg_replacement_values (node, aggval); | |
5341 | if (dump_file) | |
5342 | ipa_dump_agg_replacement_values (dump_file, aggval); | |
2c9561b5 | 5343 | |
8aab5218 MJ |
5344 | fbi.node = node; |
5345 | fbi.info = NULL; | |
5346 | fbi.bb_infos = vNULL; | |
5347 | fbi.bb_infos.safe_grow_cleared (last_basic_block_for_fn (cfun)); | |
5348 | fbi.param_count = param_count; | |
5349 | fbi.aa_walked = 0; | |
2c9561b5 | 5350 | |
8aab5218 MJ |
5351 | descriptors.safe_grow_cleared (param_count); |
5352 | ipa_populate_param_decls (node, descriptors); | |
5353 | calculate_dominance_info (CDI_DOMINATORS); | |
5354 | ipcp_modif_dom_walker (&fbi, descriptors, aggval, &something_changed, | |
5355 | &cfg_changed).walk (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
2c9561b5 | 5356 | |
8aab5218 MJ |
5357 | int i; |
5358 | struct ipa_bb_info *bi; | |
5359 | FOR_EACH_VEC_ELT (fbi.bb_infos, i, bi) | |
5360 | free_ipa_bb_info (bi); | |
5361 | fbi.bb_infos.release (); | |
5362 | free_dominance_info (CDI_DOMINATORS); | |
04be694e MJ |
5363 | (*ipcp_transformations)[node->uid].agg_values = NULL; |
5364 | (*ipcp_transformations)[node->uid].alignments = NULL; | |
9771b263 | 5365 | descriptors.release (); |
2c9561b5 MJ |
5366 | |
5367 | if (!something_changed) | |
5368 | return 0; | |
5369 | else if (cfg_changed) | |
5370 | return TODO_update_ssa_only_virtuals | TODO_cleanup_cfg; | |
5371 | else | |
5372 | return TODO_update_ssa_only_virtuals; | |
5373 | } |