]>
Commit | Line | Data |
---|---|---|
518dc859 | 1 | /* Interprocedural analyses. |
c75c517d SB |
2 | Copyright (C) 2005, 2007, 2008, 2009, 2010 |
3 | Free Software Foundation, Inc. | |
518dc859 RL |
4 | |
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify it under | |
8 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 9 | Software Foundation; either version 3, or (at your option) any later |
518dc859 RL |
10 | version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
518dc859 RL |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
24 | #include "tree.h" | |
25 | #include "langhooks.h" | |
26 | #include "ggc.h" | |
27 | #include "target.h" | |
28 | #include "cgraph.h" | |
29 | #include "ipa-prop.h" | |
30 | #include "tree-flow.h" | |
31 | #include "tree-pass.h" | |
771578a0 | 32 | #include "tree-inline.h" |
b258210c | 33 | #include "gimple.h" |
518dc859 RL |
34 | #include "flags.h" |
35 | #include "timevar.h" | |
771578a0 | 36 | #include "flags.h" |
3e293154 | 37 | #include "diagnostic.h" |
cf835838 JM |
38 | #include "tree-pretty-print.h" |
39 | #include "gimple-pretty-print.h" | |
fb3f88cc | 40 | #include "lto-streamer.h" |
771578a0 | 41 | |
062c604f MJ |
42 | |
43 | /* Intermediate information about a parameter that is only useful during the | |
44 | run of ipa_analyze_node and is not kept afterwards. */ | |
45 | ||
46 | struct param_analysis_info | |
47 | { | |
48 | bool modified; | |
49 | bitmap visited_statements; | |
50 | }; | |
51 | ||
771578a0 MJ |
52 | /* Vector where the parameter infos are actually stored. */ |
53 | VEC (ipa_node_params_t, heap) *ipa_node_params_vector; | |
54 | /* Vector where the parameter infos are actually stored. */ | |
fb3f88cc | 55 | VEC (ipa_edge_args_t, gc) *ipa_edge_args_vector; |
771578a0 | 56 | |
e33c6cd6 MJ |
57 | /* Bitmap with all UIDs of call graph edges that have been already processed |
58 | by indirect inlining. */ | |
59 | static bitmap iinlining_processed_edges; | |
60 | ||
771578a0 | 61 | /* Holders of ipa cgraph hooks: */ |
e2c9111c JH |
62 | static struct cgraph_edge_hook_list *edge_removal_hook_holder; |
63 | static struct cgraph_node_hook_list *node_removal_hook_holder; | |
64 | static struct cgraph_2edge_hook_list *edge_duplication_hook_holder; | |
65 | static struct cgraph_2node_hook_list *node_duplication_hook_holder; | |
518dc859 | 66 | |
5b9633c8 MJ |
67 | /* Add cgraph NODE described by INFO to the worklist WL regardless of whether |
68 | it is in one or not. It should almost never be used directly, as opposed to | |
69 | ipa_push_func_to_list. */ | |
70 | ||
71 | void | |
72 | ipa_push_func_to_list_1 (struct ipa_func_list **wl, | |
73 | struct cgraph_node *node, | |
74 | struct ipa_node_params *info) | |
75 | { | |
76 | struct ipa_func_list *temp; | |
77 | ||
78 | info->node_enqueued = 1; | |
79 | temp = XCNEW (struct ipa_func_list); | |
80 | temp->node = node; | |
81 | temp->next = *wl; | |
82 | *wl = temp; | |
83 | } | |
84 | ||
dcd416e3 | 85 | /* Initialize worklist to contain all functions. */ |
be95e2b9 | 86 | |
dcd416e3 MJ |
87 | struct ipa_func_list * |
88 | ipa_init_func_list (void) | |
518dc859 RL |
89 | { |
90 | struct cgraph_node *node; | |
dcd416e3 | 91 | struct ipa_func_list * wl; |
518dc859 RL |
92 | |
93 | wl = NULL; | |
94 | for (node = cgraph_nodes; node; node = node->next) | |
0eae6bab MJ |
95 | if (node->analyzed) |
96 | { | |
5b9633c8 | 97 | struct ipa_node_params *info = IPA_NODE_REF (node); |
0eae6bab MJ |
98 | /* Unreachable nodes should have been eliminated before ipcp and |
99 | inlining. */ | |
100 | gcc_assert (node->needed || node->reachable); | |
5b9633c8 | 101 | ipa_push_func_to_list_1 (&wl, node, info); |
0eae6bab | 102 | } |
518dc859 RL |
103 | |
104 | return wl; | |
105 | } | |
106 | ||
5b9633c8 | 107 | /* Remove a function from the worklist WL and return it. */ |
be95e2b9 | 108 | |
518dc859 | 109 | struct cgraph_node * |
5b9633c8 | 110 | ipa_pop_func_from_list (struct ipa_func_list **wl) |
518dc859 | 111 | { |
5b9633c8 | 112 | struct ipa_node_params *info; |
dcd416e3 | 113 | struct ipa_func_list *first; |
5b9633c8 | 114 | struct cgraph_node *node; |
518dc859 RL |
115 | |
116 | first = *wl; | |
dcd416e3 | 117 | *wl = (*wl)->next; |
5b9633c8 | 118 | node = first->node; |
518dc859 | 119 | free (first); |
5b9633c8 MJ |
120 | |
121 | info = IPA_NODE_REF (node); | |
122 | info->node_enqueued = 0; | |
123 | return node; | |
518dc859 RL |
124 | } |
125 | ||
be95e2b9 MJ |
126 | /* Return index of the formal whose tree is PTREE in function which corresponds |
127 | to INFO. */ | |
128 | ||
518dc859 | 129 | static int |
dcd416e3 | 130 | ipa_get_param_decl_index (struct ipa_node_params *info, tree ptree) |
518dc859 RL |
131 | { |
132 | int i, count; | |
133 | ||
dcd416e3 | 134 | count = ipa_get_param_count (info); |
518dc859 | 135 | for (i = 0; i < count; i++) |
f8e2a1ed | 136 | if (ipa_get_param(info, i) == ptree) |
518dc859 RL |
137 | return i; |
138 | ||
139 | return -1; | |
140 | } | |
141 | ||
f8e2a1ed MJ |
142 | /* Populate the param_decl field in parameter descriptors of INFO that |
143 | corresponds to NODE. */ | |
be95e2b9 | 144 | |
f8e2a1ed MJ |
145 | static void |
146 | ipa_populate_param_decls (struct cgraph_node *node, | |
147 | struct ipa_node_params *info) | |
518dc859 RL |
148 | { |
149 | tree fndecl; | |
150 | tree fnargs; | |
151 | tree parm; | |
152 | int param_num; | |
3e293154 | 153 | |
f8e2a1ed | 154 | fndecl = node->decl; |
518dc859 RL |
155 | fnargs = DECL_ARGUMENTS (fndecl); |
156 | param_num = 0; | |
157 | for (parm = fnargs; parm; parm = TREE_CHAIN (parm)) | |
158 | { | |
f8e2a1ed | 159 | info->params[param_num].decl = parm; |
518dc859 RL |
160 | param_num++; |
161 | } | |
162 | } | |
163 | ||
3f84bf08 MJ |
164 | /* Return how many formal parameters FNDECL has. */ |
165 | ||
166 | static inline int | |
167 | count_formal_params_1 (tree fndecl) | |
168 | { | |
169 | tree parm; | |
170 | int count = 0; | |
171 | ||
172 | for (parm = DECL_ARGUMENTS (fndecl); parm; parm = TREE_CHAIN (parm)) | |
173 | count++; | |
174 | ||
175 | return count; | |
176 | } | |
177 | ||
f8e2a1ed MJ |
178 | /* Count number of formal parameters in NOTE. Store the result to the |
179 | appropriate field of INFO. */ | |
be95e2b9 | 180 | |
f8e2a1ed MJ |
181 | static void |
182 | ipa_count_formal_params (struct cgraph_node *node, | |
183 | struct ipa_node_params *info) | |
518dc859 | 184 | { |
518dc859 RL |
185 | int param_num; |
186 | ||
3f84bf08 | 187 | param_num = count_formal_params_1 (node->decl); |
f8e2a1ed MJ |
188 | ipa_set_param_count (info, param_num); |
189 | } | |
190 | ||
191 | /* Initialize the ipa_node_params structure associated with NODE by counting | |
192 | the function parameters, creating the descriptors and populating their | |
193 | param_decls. */ | |
be95e2b9 | 194 | |
f8e2a1ed MJ |
195 | void |
196 | ipa_initialize_node_params (struct cgraph_node *node) | |
197 | { | |
198 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
199 | ||
200 | if (!info->params) | |
201 | { | |
202 | ipa_count_formal_params (node, info); | |
203 | info->params = XCNEWVEC (struct ipa_param_descriptor, | |
204 | ipa_get_param_count (info)); | |
205 | ipa_populate_param_decls (node, info); | |
206 | } | |
518dc859 RL |
207 | } |
208 | ||
be95e2b9 | 209 | /* Count number of arguments callsite CS has and store it in |
dcd416e3 | 210 | ipa_edge_args structure corresponding to this callsite. */ |
be95e2b9 | 211 | |
062c604f | 212 | static void |
dcd416e3 | 213 | ipa_count_arguments (struct cgraph_edge *cs) |
518dc859 | 214 | { |
726a989a | 215 | gimple stmt; |
518dc859 RL |
216 | int arg_num; |
217 | ||
726a989a RB |
218 | stmt = cs->call_stmt; |
219 | gcc_assert (is_gimple_call (stmt)); | |
220 | arg_num = gimple_call_num_args (stmt); | |
129a37fc JH |
221 | if (VEC_length (ipa_edge_args_t, ipa_edge_args_vector) |
222 | <= (unsigned) cgraph_edge_max_uid) | |
fb3f88cc | 223 | VEC_safe_grow_cleared (ipa_edge_args_t, gc, |
129a37fc | 224 | ipa_edge_args_vector, cgraph_edge_max_uid + 1); |
dcd416e3 | 225 | ipa_set_cs_argument_count (IPA_EDGE_REF (cs), arg_num); |
518dc859 RL |
226 | } |
227 | ||
749aa96d MJ |
228 | /* Print the jump functions associated with call graph edge CS to file F. */ |
229 | ||
230 | static void | |
231 | ipa_print_node_jump_functions_for_edge (FILE *f, struct cgraph_edge *cs) | |
232 | { | |
233 | int i, count; | |
234 | ||
235 | count = ipa_get_cs_argument_count (IPA_EDGE_REF (cs)); | |
236 | for (i = 0; i < count; i++) | |
237 | { | |
238 | struct ipa_jump_func *jump_func; | |
239 | enum jump_func_type type; | |
240 | ||
241 | jump_func = ipa_get_ith_jump_func (IPA_EDGE_REF (cs), i); | |
242 | type = jump_func->type; | |
243 | ||
244 | fprintf (f, " param %d: ", i); | |
245 | if (type == IPA_JF_UNKNOWN) | |
246 | fprintf (f, "UNKNOWN\n"); | |
247 | else if (type == IPA_JF_KNOWN_TYPE) | |
248 | { | |
249 | tree binfo_type = TREE_TYPE (jump_func->value.base_binfo); | |
250 | fprintf (f, "KNOWN TYPE, type in binfo is: "); | |
251 | print_generic_expr (f, binfo_type, 0); | |
252 | fprintf (f, " (%u)\n", TYPE_UID (binfo_type)); | |
253 | } | |
254 | else if (type == IPA_JF_CONST) | |
255 | { | |
256 | tree val = jump_func->value.constant; | |
257 | fprintf (f, "CONST: "); | |
258 | print_generic_expr (f, val, 0); | |
259 | if (TREE_CODE (val) == ADDR_EXPR | |
260 | && TREE_CODE (TREE_OPERAND (val, 0)) == CONST_DECL) | |
261 | { | |
262 | fprintf (f, " -> "); | |
263 | print_generic_expr (f, DECL_INITIAL (TREE_OPERAND (val, 0)), | |
264 | 0); | |
265 | } | |
266 | fprintf (f, "\n"); | |
267 | } | |
268 | else if (type == IPA_JF_CONST_MEMBER_PTR) | |
269 | { | |
270 | fprintf (f, "CONST MEMBER PTR: "); | |
271 | print_generic_expr (f, jump_func->value.member_cst.pfn, 0); | |
272 | fprintf (f, ", "); | |
273 | print_generic_expr (f, jump_func->value.member_cst.delta, 0); | |
274 | fprintf (f, "\n"); | |
275 | } | |
276 | else if (type == IPA_JF_PASS_THROUGH) | |
277 | { | |
278 | fprintf (f, "PASS THROUGH: "); | |
279 | fprintf (f, "%d, op %s ", | |
280 | jump_func->value.pass_through.formal_id, | |
281 | tree_code_name[(int) | |
282 | jump_func->value.pass_through.operation]); | |
283 | if (jump_func->value.pass_through.operation != NOP_EXPR) | |
284 | print_generic_expr (dump_file, | |
285 | jump_func->value.pass_through.operand, 0); | |
286 | fprintf (dump_file, "\n"); | |
287 | } | |
288 | else if (type == IPA_JF_ANCESTOR) | |
289 | { | |
290 | fprintf (f, "ANCESTOR: "); | |
291 | fprintf (f, "%d, offset "HOST_WIDE_INT_PRINT_DEC", ", | |
292 | jump_func->value.ancestor.formal_id, | |
293 | jump_func->value.ancestor.offset); | |
294 | print_generic_expr (f, jump_func->value.ancestor.type, 0); | |
295 | fprintf (dump_file, "\n"); | |
296 | } | |
297 | } | |
298 | } | |
299 | ||
300 | ||
be95e2b9 MJ |
301 | /* Print the jump functions of all arguments on all call graph edges going from |
302 | NODE to file F. */ | |
303 | ||
518dc859 | 304 | void |
3e293154 | 305 | ipa_print_node_jump_functions (FILE *f, struct cgraph_node *node) |
518dc859 | 306 | { |
3e293154 | 307 | struct cgraph_edge *cs; |
749aa96d | 308 | int i; |
518dc859 | 309 | |
ca30a539 | 310 | fprintf (f, " Jump functions of caller %s:\n", cgraph_node_name (node)); |
3e293154 MJ |
311 | for (cs = node->callees; cs; cs = cs->next_callee) |
312 | { | |
313 | if (!ipa_edge_args_info_available_for_edge_p (cs)) | |
314 | continue; | |
315 | ||
749aa96d MJ |
316 | fprintf (f, " callsite %s/%i -> %s/%i : \n", |
317 | cgraph_node_name (node), node->uid, | |
318 | cgraph_node_name (cs->callee), cs->callee->uid); | |
319 | ipa_print_node_jump_functions_for_edge (f, cs); | |
320 | } | |
518dc859 | 321 | |
749aa96d MJ |
322 | for (cs = node->indirect_calls, i = 0; cs; cs = cs->next_callee, i++) |
323 | { | |
324 | if (!ipa_edge_args_info_available_for_edge_p (cs)) | |
325 | continue; | |
3e293154 | 326 | |
749aa96d MJ |
327 | if (cs->call_stmt) |
328 | { | |
329 | fprintf (f, " indirect callsite %d for stmt ", i); | |
330 | print_gimple_stmt (f, cs->call_stmt, 0, TDF_SLIM); | |
3e293154 | 331 | } |
749aa96d MJ |
332 | else |
333 | fprintf (f, " indirect callsite %d :\n", i); | |
334 | ipa_print_node_jump_functions_for_edge (f, cs); | |
335 | ||
3e293154 MJ |
336 | } |
337 | } | |
338 | ||
339 | /* Print ipa_jump_func data structures of all nodes in the call graph to F. */ | |
be95e2b9 | 340 | |
3e293154 MJ |
341 | void |
342 | ipa_print_all_jump_functions (FILE *f) | |
343 | { | |
344 | struct cgraph_node *node; | |
345 | ||
ca30a539 | 346 | fprintf (f, "\nJump functions:\n"); |
3e293154 MJ |
347 | for (node = cgraph_nodes; node; node = node->next) |
348 | { | |
349 | ipa_print_node_jump_functions (f, node); | |
350 | } | |
351 | } | |
352 | ||
b258210c MJ |
353 | /* Given that an actual argument is an SSA_NAME (given in NAME) and is a result |
354 | of an assignment statement STMT, try to find out whether NAME can be | |
355 | described by a (possibly polynomial) pass-through jump-function or an | |
356 | ancestor jump function and if so, write the appropriate function into | |
357 | JFUNC */ | |
685b0d13 MJ |
358 | |
359 | static void | |
b258210c MJ |
360 | compute_complex_assign_jump_func (struct ipa_node_params *info, |
361 | struct ipa_jump_func *jfunc, | |
362 | gimple stmt, tree name) | |
685b0d13 MJ |
363 | { |
364 | HOST_WIDE_INT offset, size, max_size; | |
365 | tree op1, op2, type; | |
366 | int index; | |
685b0d13 | 367 | |
685b0d13 MJ |
368 | op1 = gimple_assign_rhs1 (stmt); |
369 | op2 = gimple_assign_rhs2 (stmt); | |
370 | ||
b258210c MJ |
371 | if (TREE_CODE (op1) == SSA_NAME |
372 | && SSA_NAME_IS_DEFAULT_DEF (op1)) | |
685b0d13 | 373 | { |
b258210c MJ |
374 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (op1)); |
375 | if (index < 0) | |
685b0d13 MJ |
376 | return; |
377 | ||
b258210c | 378 | if (op2) |
685b0d13 | 379 | { |
b258210c MJ |
380 | if (!is_gimple_ip_invariant (op2) |
381 | || (TREE_CODE_CLASS (gimple_expr_code (stmt)) != tcc_comparison | |
382 | && !useless_type_conversion_p (TREE_TYPE (name), | |
383 | TREE_TYPE (op1)))) | |
384 | return; | |
385 | ||
685b0d13 MJ |
386 | jfunc->type = IPA_JF_PASS_THROUGH; |
387 | jfunc->value.pass_through.formal_id = index; | |
388 | jfunc->value.pass_through.operation = gimple_assign_rhs_code (stmt); | |
389 | jfunc->value.pass_through.operand = op2; | |
390 | } | |
b258210c MJ |
391 | else if (gimple_assign_unary_nop_p (stmt)) |
392 | { | |
393 | jfunc->type = IPA_JF_PASS_THROUGH; | |
394 | jfunc->value.pass_through.formal_id = index; | |
395 | jfunc->value.pass_through.operation = NOP_EXPR; | |
396 | } | |
685b0d13 MJ |
397 | return; |
398 | } | |
399 | ||
400 | if (TREE_CODE (op1) != ADDR_EXPR) | |
401 | return; | |
b258210c | 402 | |
685b0d13 MJ |
403 | op1 = TREE_OPERAND (op1, 0); |
404 | type = TREE_TYPE (op1); | |
b258210c MJ |
405 | if (TREE_CODE (type) != RECORD_TYPE) |
406 | return; | |
685b0d13 | 407 | op1 = get_ref_base_and_extent (op1, &offset, &size, &max_size); |
1a15bfdc RG |
408 | if (TREE_CODE (op1) != INDIRECT_REF |
409 | /* If this is a varying address, punt. */ | |
410 | || max_size == -1 | |
411 | || max_size != size) | |
685b0d13 MJ |
412 | return; |
413 | op1 = TREE_OPERAND (op1, 0); | |
414 | if (TREE_CODE (op1) != SSA_NAME | |
415 | || !SSA_NAME_IS_DEFAULT_DEF (op1)) | |
416 | return; | |
417 | ||
418 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (op1)); | |
419 | if (index >= 0) | |
420 | { | |
421 | jfunc->type = IPA_JF_ANCESTOR; | |
422 | jfunc->value.ancestor.formal_id = index; | |
423 | jfunc->value.ancestor.offset = offset; | |
424 | jfunc->value.ancestor.type = type; | |
425 | } | |
426 | } | |
427 | ||
428 | ||
b258210c MJ |
429 | /* Given that an actual argument is an SSA_NAME that is a result of a phi |
430 | statement PHI, try to find out whether NAME is in fact a | |
431 | multiple-inheritance typecast from a descendant into an ancestor of a formal | |
432 | parameter and thus can be described by an ancestor jump function and if so, | |
433 | write the appropriate function into JFUNC. | |
434 | ||
435 | Essentially we want to match the following pattern: | |
436 | ||
437 | if (obj_2(D) != 0B) | |
438 | goto <bb 3>; | |
439 | else | |
440 | goto <bb 4>; | |
441 | ||
442 | <bb 3>: | |
443 | iftmp.1_3 = &obj_2(D)->D.1762; | |
444 | ||
445 | <bb 4>: | |
446 | # iftmp.1_1 = PHI <iftmp.1_3(3), 0B(2)> | |
447 | D.1879_6 = middleman_1 (iftmp.1_1, i_5(D)); | |
448 | return D.1879_6; */ | |
449 | ||
450 | static void | |
451 | compute_complex_ancestor_jump_func (struct ipa_node_params *info, | |
452 | struct ipa_jump_func *jfunc, | |
453 | gimple phi) | |
454 | { | |
455 | HOST_WIDE_INT offset, size, max_size; | |
456 | gimple assign, cond; | |
457 | basic_block phi_bb, assign_bb, cond_bb; | |
458 | tree tmp, parm, expr; | |
459 | int index, i; | |
460 | ||
461 | if (gimple_phi_num_args (phi) != 2 | |
462 | || !integer_zerop (PHI_ARG_DEF (phi, 1))) | |
463 | return; | |
464 | ||
465 | tmp = PHI_ARG_DEF (phi, 0); | |
466 | if (TREE_CODE (tmp) != SSA_NAME | |
467 | || SSA_NAME_IS_DEFAULT_DEF (tmp) | |
468 | || !POINTER_TYPE_P (TREE_TYPE (tmp)) | |
469 | || TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) != RECORD_TYPE) | |
470 | return; | |
471 | ||
472 | assign = SSA_NAME_DEF_STMT (tmp); | |
473 | assign_bb = gimple_bb (assign); | |
474 | if (!single_pred_p (assign_bb) | |
475 | || !gimple_assign_single_p (assign)) | |
476 | return; | |
477 | expr = gimple_assign_rhs1 (assign); | |
478 | ||
479 | if (TREE_CODE (expr) != ADDR_EXPR) | |
480 | return; | |
481 | expr = TREE_OPERAND (expr, 0); | |
482 | expr = get_ref_base_and_extent (expr, &offset, &size, &max_size); | |
483 | ||
484 | if (TREE_CODE (expr) != INDIRECT_REF | |
485 | /* If this is a varying address, punt. */ | |
486 | || max_size == -1 | |
487 | || max_size != size) | |
488 | return; | |
489 | parm = TREE_OPERAND (expr, 0); | |
490 | if (TREE_CODE (parm) != SSA_NAME | |
491 | || !SSA_NAME_IS_DEFAULT_DEF (parm)) | |
492 | return; | |
493 | ||
494 | index = ipa_get_param_decl_index (info, SSA_NAME_VAR (parm)); | |
495 | if (index < 0) | |
496 | return; | |
497 | ||
498 | cond_bb = single_pred (assign_bb); | |
499 | cond = last_stmt (cond_bb); | |
69610617 SB |
500 | if (!cond |
501 | || gimple_code (cond) != GIMPLE_COND | |
b258210c MJ |
502 | || gimple_cond_code (cond) != NE_EXPR |
503 | || gimple_cond_lhs (cond) != parm | |
504 | || !integer_zerop (gimple_cond_rhs (cond))) | |
505 | return; | |
506 | ||
507 | ||
508 | phi_bb = gimple_bb (phi); | |
509 | for (i = 0; i < 2; i++) | |
510 | { | |
511 | basic_block pred = EDGE_PRED (phi_bb, i)->src; | |
512 | if (pred != assign_bb && pred != cond_bb) | |
513 | return; | |
514 | } | |
515 | ||
516 | jfunc->type = IPA_JF_ANCESTOR; | |
517 | jfunc->value.ancestor.formal_id = index; | |
518 | jfunc->value.ancestor.offset = offset; | |
519 | jfunc->value.ancestor.type = TREE_TYPE (TREE_TYPE (tmp)); | |
520 | } | |
521 | ||
522 | /* Given OP whch is passed as an actual argument to a called function, | |
523 | determine if it is possible to construct a KNOWN_TYPE jump function for it | |
524 | and if so, create one and store it to JFUNC. */ | |
525 | ||
526 | static void | |
527 | compute_known_type_jump_func (tree op, struct ipa_jump_func *jfunc) | |
528 | { | |
529 | tree binfo; | |
530 | ||
531 | if (TREE_CODE (op) != ADDR_EXPR) | |
532 | return; | |
533 | ||
534 | op = TREE_OPERAND (op, 0); | |
535 | binfo = gimple_get_relevant_ref_binfo (op, NULL_TREE); | |
536 | if (binfo) | |
537 | { | |
538 | jfunc->type = IPA_JF_KNOWN_TYPE; | |
539 | jfunc->value.base_binfo = binfo; | |
540 | } | |
541 | } | |
542 | ||
543 | ||
be95e2b9 MJ |
544 | /* Determine the jump functions of scalar arguments. Scalar means SSA names |
545 | and constants of a number of selected types. INFO is the ipa_node_params | |
546 | structure associated with the caller, FUNCTIONS is a pointer to an array of | |
547 | jump function structures associated with CALL which is the call statement | |
548 | being examined.*/ | |
549 | ||
3e293154 MJ |
550 | static void |
551 | compute_scalar_jump_functions (struct ipa_node_params *info, | |
552 | struct ipa_jump_func *functions, | |
726a989a | 553 | gimple call) |
3e293154 | 554 | { |
3e293154 | 555 | tree arg; |
726a989a | 556 | unsigned num = 0; |
3e293154 | 557 | |
726a989a | 558 | for (num = 0; num < gimple_call_num_args (call); num++) |
518dc859 | 559 | { |
726a989a RB |
560 | arg = gimple_call_arg (call, num); |
561 | ||
00fc2333 | 562 | if (is_gimple_ip_invariant (arg)) |
518dc859 | 563 | { |
133f9369 | 564 | functions[num].type = IPA_JF_CONST; |
3e293154 MJ |
565 | functions[num].value.constant = arg; |
566 | } | |
685b0d13 | 567 | else if (TREE_CODE (arg) == SSA_NAME) |
3e293154 | 568 | { |
685b0d13 | 569 | if (SSA_NAME_IS_DEFAULT_DEF (arg)) |
518dc859 | 570 | { |
685b0d13 MJ |
571 | int index = ipa_get_param_decl_index (info, SSA_NAME_VAR (arg)); |
572 | ||
573 | if (index >= 0) | |
574 | { | |
575 | functions[num].type = IPA_JF_PASS_THROUGH; | |
576 | functions[num].value.pass_through.formal_id = index; | |
577 | functions[num].value.pass_through.operation = NOP_EXPR; | |
578 | } | |
518dc859 | 579 | } |
685b0d13 | 580 | else |
b258210c MJ |
581 | { |
582 | gimple stmt = SSA_NAME_DEF_STMT (arg); | |
583 | if (is_gimple_assign (stmt)) | |
584 | compute_complex_assign_jump_func (info, &functions[num], | |
585 | stmt, arg); | |
586 | else if (gimple_code (stmt) == GIMPLE_PHI) | |
587 | compute_complex_ancestor_jump_func (info, &functions[num], | |
588 | stmt); | |
589 | } | |
518dc859 | 590 | } |
b258210c MJ |
591 | else |
592 | compute_known_type_jump_func (arg, &functions[num]); | |
3e293154 MJ |
593 | } |
594 | } | |
595 | ||
be95e2b9 MJ |
596 | /* Inspect the given TYPE and return true iff it has the same structure (the |
597 | same number of fields of the same types) as a C++ member pointer. If | |
598 | METHOD_PTR and DELTA are non-NULL, store the trees representing the | |
599 | corresponding fields there. */ | |
600 | ||
3e293154 MJ |
601 | static bool |
602 | type_like_member_ptr_p (tree type, tree *method_ptr, tree *delta) | |
603 | { | |
604 | tree fld; | |
605 | ||
606 | if (TREE_CODE (type) != RECORD_TYPE) | |
607 | return false; | |
608 | ||
609 | fld = TYPE_FIELDS (type); | |
610 | if (!fld || !POINTER_TYPE_P (TREE_TYPE (fld)) | |
611 | || TREE_CODE (TREE_TYPE (TREE_TYPE (fld))) != METHOD_TYPE) | |
612 | return false; | |
613 | ||
614 | if (method_ptr) | |
615 | *method_ptr = fld; | |
616 | ||
617 | fld = TREE_CHAIN (fld); | |
618 | if (!fld || INTEGRAL_TYPE_P (fld)) | |
619 | return false; | |
620 | if (delta) | |
621 | *delta = fld; | |
622 | ||
623 | if (TREE_CHAIN (fld)) | |
624 | return false; | |
625 | ||
626 | return true; | |
627 | } | |
628 | ||
062c604f MJ |
629 | /* Callback of walk_aliased_vdefs. Flags that it has been invoked to the |
630 | boolean variable pointed to by DATA. */ | |
631 | ||
632 | static bool | |
633 | mark_modified (ao_ref *ao ATTRIBUTE_UNUSED, tree vdef ATTRIBUTE_UNUSED, | |
634 | void *data) | |
635 | { | |
636 | bool *b = (bool *) data; | |
637 | *b = true; | |
638 | return true; | |
639 | } | |
640 | ||
641 | /* Return true if the formal parameter PARM might have been modified in this | |
642 | function before reaching the statement CALL. PARM_INFO is a pointer to a | |
643 | structure containing intermediate information about PARM. */ | |
644 | ||
645 | static bool | |
646 | is_parm_modified_before_call (struct param_analysis_info *parm_info, | |
647 | gimple call, tree parm) | |
648 | { | |
649 | bool modified = false; | |
650 | ao_ref refd; | |
651 | ||
652 | if (parm_info->modified) | |
653 | return true; | |
654 | ||
655 | ao_ref_init (&refd, parm); | |
656 | walk_aliased_vdefs (&refd, gimple_vuse (call), mark_modified, | |
657 | &modified, &parm_info->visited_statements); | |
658 | if (modified) | |
659 | { | |
660 | parm_info->modified = true; | |
661 | return true; | |
662 | } | |
663 | return false; | |
664 | } | |
665 | ||
be95e2b9 MJ |
666 | /* Go through arguments of the CALL and for every one that looks like a member |
667 | pointer, check whether it can be safely declared pass-through and if so, | |
668 | mark that to the corresponding item of jump FUNCTIONS. Return true iff | |
669 | there are non-pass-through member pointers within the arguments. INFO | |
062c604f MJ |
670 | describes formal parameters of the caller. PARMS_INFO is a pointer to a |
671 | vector containing intermediate information about each formal parameter. */ | |
be95e2b9 | 672 | |
3e293154 MJ |
673 | static bool |
674 | compute_pass_through_member_ptrs (struct ipa_node_params *info, | |
062c604f | 675 | struct param_analysis_info *parms_info, |
3e293154 | 676 | struct ipa_jump_func *functions, |
726a989a | 677 | gimple call) |
3e293154 | 678 | { |
3e293154 | 679 | bool undecided_members = false; |
726a989a | 680 | unsigned num; |
3e293154 MJ |
681 | tree arg; |
682 | ||
726a989a | 683 | for (num = 0; num < gimple_call_num_args (call); num++) |
3e293154 | 684 | { |
726a989a RB |
685 | arg = gimple_call_arg (call, num); |
686 | ||
3e293154 | 687 | if (type_like_member_ptr_p (TREE_TYPE (arg), NULL, NULL)) |
518dc859 | 688 | { |
3e293154 MJ |
689 | if (TREE_CODE (arg) == PARM_DECL) |
690 | { | |
691 | int index = ipa_get_param_decl_index (info, arg); | |
692 | ||
693 | gcc_assert (index >=0); | |
062c604f | 694 | if (!is_parm_modified_before_call (&parms_info[index], call, arg)) |
3e293154 | 695 | { |
133f9369 | 696 | functions[num].type = IPA_JF_PASS_THROUGH; |
685b0d13 MJ |
697 | functions[num].value.pass_through.formal_id = index; |
698 | functions[num].value.pass_through.operation = NOP_EXPR; | |
3e293154 MJ |
699 | } |
700 | else | |
701 | undecided_members = true; | |
702 | } | |
703 | else | |
704 | undecided_members = true; | |
518dc859 | 705 | } |
3e293154 MJ |
706 | } |
707 | ||
708 | return undecided_members; | |
709 | } | |
710 | ||
711 | /* Simple function filling in a member pointer constant jump function (with PFN | |
712 | and DELTA as the constant value) into JFUNC. */ | |
be95e2b9 | 713 | |
3e293154 MJ |
714 | static void |
715 | fill_member_ptr_cst_jump_function (struct ipa_jump_func *jfunc, | |
716 | tree pfn, tree delta) | |
717 | { | |
133f9369 | 718 | jfunc->type = IPA_JF_CONST_MEMBER_PTR; |
3e293154 MJ |
719 | jfunc->value.member_cst.pfn = pfn; |
720 | jfunc->value.member_cst.delta = delta; | |
721 | } | |
722 | ||
7ec49257 MJ |
723 | /* If RHS is an SSA_NAMe and it is defined by a simple copy assign statement, |
724 | return the rhs of its defining statement. */ | |
725 | ||
726 | static inline tree | |
727 | get_ssa_def_if_simple_copy (tree rhs) | |
728 | { | |
729 | while (TREE_CODE (rhs) == SSA_NAME && !SSA_NAME_IS_DEFAULT_DEF (rhs)) | |
730 | { | |
731 | gimple def_stmt = SSA_NAME_DEF_STMT (rhs); | |
732 | ||
733 | if (gimple_assign_single_p (def_stmt)) | |
734 | rhs = gimple_assign_rhs1 (def_stmt); | |
9961eb45 MJ |
735 | else |
736 | break; | |
7ec49257 MJ |
737 | } |
738 | return rhs; | |
739 | } | |
740 | ||
726a989a RB |
741 | /* Traverse statements from CALL backwards, scanning whether the argument ARG |
742 | which is a member pointer is filled in with constant values. If it is, fill | |
743 | the jump function JFUNC in appropriately. METHOD_FIELD and DELTA_FIELD are | |
744 | fields of the record type of the member pointer. To give an example, we | |
745 | look for a pattern looking like the following: | |
3e293154 MJ |
746 | |
747 | D.2515.__pfn ={v} printStuff; | |
748 | D.2515.__delta ={v} 0; | |
749 | i_1 = doprinting (D.2515); */ | |
be95e2b9 | 750 | |
3e293154 | 751 | static void |
726a989a | 752 | determine_cst_member_ptr (gimple call, tree arg, tree method_field, |
3e293154 MJ |
753 | tree delta_field, struct ipa_jump_func *jfunc) |
754 | { | |
726a989a | 755 | gimple_stmt_iterator gsi; |
3e293154 MJ |
756 | tree method = NULL_TREE; |
757 | tree delta = NULL_TREE; | |
758 | ||
726a989a | 759 | gsi = gsi_for_stmt (call); |
3e293154 | 760 | |
726a989a RB |
761 | gsi_prev (&gsi); |
762 | for (; !gsi_end_p (gsi); gsi_prev (&gsi)) | |
3e293154 | 763 | { |
726a989a | 764 | gimple stmt = gsi_stmt (gsi); |
3e293154 MJ |
765 | tree lhs, rhs, fld; |
766 | ||
8aa29647 MJ |
767 | if (!stmt_may_clobber_ref_p (stmt, arg)) |
768 | continue; | |
8b75fc9b | 769 | if (!gimple_assign_single_p (stmt)) |
3e293154 MJ |
770 | return; |
771 | ||
726a989a RB |
772 | lhs = gimple_assign_lhs (stmt); |
773 | rhs = gimple_assign_rhs1 (stmt); | |
3e293154 MJ |
774 | |
775 | if (TREE_CODE (lhs) != COMPONENT_REF | |
776 | || TREE_OPERAND (lhs, 0) != arg) | |
8aa29647 | 777 | return; |
3e293154 MJ |
778 | |
779 | fld = TREE_OPERAND (lhs, 1); | |
780 | if (!method && fld == method_field) | |
518dc859 | 781 | { |
7ec49257 | 782 | rhs = get_ssa_def_if_simple_copy (rhs); |
3e293154 MJ |
783 | if (TREE_CODE (rhs) == ADDR_EXPR |
784 | && TREE_CODE (TREE_OPERAND (rhs, 0)) == FUNCTION_DECL | |
785 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) == METHOD_TYPE) | |
518dc859 | 786 | { |
3e293154 MJ |
787 | method = TREE_OPERAND (rhs, 0); |
788 | if (delta) | |
789 | { | |
00fc2333 | 790 | fill_member_ptr_cst_jump_function (jfunc, rhs, delta); |
3e293154 MJ |
791 | return; |
792 | } | |
518dc859 | 793 | } |
3e293154 MJ |
794 | else |
795 | return; | |
796 | } | |
797 | ||
798 | if (!delta && fld == delta_field) | |
799 | { | |
7ec49257 | 800 | rhs = get_ssa_def_if_simple_copy (rhs); |
3e293154 MJ |
801 | if (TREE_CODE (rhs) == INTEGER_CST) |
802 | { | |
803 | delta = rhs; | |
804 | if (method) | |
805 | { | |
00fc2333 | 806 | fill_member_ptr_cst_jump_function (jfunc, rhs, delta); |
3e293154 MJ |
807 | return; |
808 | } | |
809 | } | |
810 | else | |
811 | return; | |
812 | } | |
813 | } | |
814 | ||
815 | return; | |
816 | } | |
817 | ||
726a989a RB |
818 | /* Go through the arguments of the CALL and for every member pointer within |
819 | tries determine whether it is a constant. If it is, create a corresponding | |
820 | constant jump function in FUNCTIONS which is an array of jump functions | |
821 | associated with the call. */ | |
be95e2b9 | 822 | |
3e293154 MJ |
823 | static void |
824 | compute_cst_member_ptr_arguments (struct ipa_jump_func *functions, | |
726a989a | 825 | gimple call) |
3e293154 | 826 | { |
726a989a | 827 | unsigned num; |
3e293154 MJ |
828 | tree arg, method_field, delta_field; |
829 | ||
726a989a | 830 | for (num = 0; num < gimple_call_num_args (call); num++) |
3e293154 | 831 | { |
726a989a RB |
832 | arg = gimple_call_arg (call, num); |
833 | ||
133f9369 | 834 | if (functions[num].type == IPA_JF_UNKNOWN |
3e293154 MJ |
835 | && type_like_member_ptr_p (TREE_TYPE (arg), &method_field, |
836 | &delta_field)) | |
726a989a RB |
837 | determine_cst_member_ptr (call, arg, method_field, delta_field, |
838 | &functions[num]); | |
3e293154 MJ |
839 | } |
840 | } | |
841 | ||
842 | /* Compute jump function for all arguments of callsite CS and insert the | |
843 | information in the jump_functions array in the ipa_edge_args corresponding | |
844 | to this callsite. */ | |
be95e2b9 | 845 | |
749aa96d | 846 | static void |
062c604f MJ |
847 | ipa_compute_jump_functions_for_edge (struct param_analysis_info *parms_info, |
848 | struct cgraph_edge *cs) | |
3e293154 MJ |
849 | { |
850 | struct ipa_node_params *info = IPA_NODE_REF (cs->caller); | |
851 | struct ipa_edge_args *arguments = IPA_EDGE_REF (cs); | |
726a989a | 852 | gimple call; |
3e293154 MJ |
853 | |
854 | if (ipa_get_cs_argument_count (arguments) == 0 || arguments->jump_functions) | |
855 | return; | |
a9429e29 LB |
856 | arguments->jump_functions = ggc_alloc_cleared_vec_ipa_jump_func |
857 | (ipa_get_cs_argument_count (arguments)); | |
726a989a RB |
858 | |
859 | call = cs->call_stmt; | |
860 | gcc_assert (is_gimple_call (call)); | |
3e293154 MJ |
861 | |
862 | /* We will deal with constants and SSA scalars first: */ | |
863 | compute_scalar_jump_functions (info, arguments->jump_functions, call); | |
864 | ||
865 | /* Let's check whether there are any potential member pointers and if so, | |
866 | whether we can determine their functions as pass_through. */ | |
062c604f MJ |
867 | if (!compute_pass_through_member_ptrs (info, parms_info, |
868 | arguments->jump_functions, call)) | |
3e293154 MJ |
869 | return; |
870 | ||
be95e2b9 | 871 | /* Finally, let's check whether we actually pass a new constant member |
3e293154 | 872 | pointer here... */ |
726a989a | 873 | compute_cst_member_ptr_arguments (arguments->jump_functions, call); |
3e293154 MJ |
874 | } |
875 | ||
749aa96d MJ |
876 | /* Compute jump functions for all edges - both direct and indirect - outgoing |
877 | from NODE. Also count the actual arguments in the process. */ | |
878 | ||
062c604f MJ |
879 | static void |
880 | ipa_compute_jump_functions (struct cgraph_node *node, | |
881 | struct param_analysis_info *parms_info) | |
749aa96d MJ |
882 | { |
883 | struct cgraph_edge *cs; | |
884 | ||
885 | for (cs = node->callees; cs; cs = cs->next_callee) | |
886 | { | |
887 | /* We do not need to bother analyzing calls to unknown | |
888 | functions unless they may become known during lto/whopr. */ | |
889 | if (!cs->callee->analyzed && !flag_lto && !flag_whopr) | |
890 | continue; | |
891 | ipa_count_arguments (cs); | |
062c604f MJ |
892 | /* If the descriptor of the callee is not initialized yet, we have to do |
893 | it now. */ | |
894 | if (cs->callee->analyzed) | |
895 | ipa_initialize_node_params (cs->callee); | |
749aa96d MJ |
896 | if (ipa_get_cs_argument_count (IPA_EDGE_REF (cs)) |
897 | != ipa_get_param_count (IPA_NODE_REF (cs->callee))) | |
898 | ipa_set_called_with_variable_arg (IPA_NODE_REF (cs->callee)); | |
062c604f | 899 | ipa_compute_jump_functions_for_edge (parms_info, cs); |
749aa96d MJ |
900 | } |
901 | ||
902 | for (cs = node->indirect_calls; cs; cs = cs->next_callee) | |
903 | { | |
904 | ipa_count_arguments (cs); | |
062c604f | 905 | ipa_compute_jump_functions_for_edge (parms_info, cs); |
749aa96d MJ |
906 | } |
907 | } | |
908 | ||
6f7b8b70 RE |
909 | /* If RHS looks like a rhs of a statement loading pfn from a member |
910 | pointer formal parameter, return the parameter, otherwise return | |
911 | NULL. If USE_DELTA, then we look for a use of the delta field | |
912 | rather than the pfn. */ | |
be95e2b9 | 913 | |
3e293154 | 914 | static tree |
6f7b8b70 | 915 | ipa_get_member_ptr_load_param (tree rhs, bool use_delta) |
3e293154 MJ |
916 | { |
917 | tree rec, fld; | |
918 | tree ptr_field; | |
6f7b8b70 | 919 | tree delta_field; |
3e293154 MJ |
920 | |
921 | if (TREE_CODE (rhs) != COMPONENT_REF) | |
922 | return NULL_TREE; | |
923 | ||
924 | rec = TREE_OPERAND (rhs, 0); | |
925 | if (TREE_CODE (rec) != PARM_DECL | |
6f7b8b70 | 926 | || !type_like_member_ptr_p (TREE_TYPE (rec), &ptr_field, &delta_field)) |
3e293154 MJ |
927 | return NULL_TREE; |
928 | ||
929 | fld = TREE_OPERAND (rhs, 1); | |
6f7b8b70 | 930 | if (use_delta ? (fld == delta_field) : (fld == ptr_field)) |
3e293154 MJ |
931 | return rec; |
932 | else | |
933 | return NULL_TREE; | |
934 | } | |
935 | ||
936 | /* If STMT looks like a statement loading a value from a member pointer formal | |
be95e2b9 MJ |
937 | parameter, this function returns that parameter. */ |
938 | ||
3e293154 | 939 | static tree |
6f7b8b70 | 940 | ipa_get_stmt_member_ptr_load_param (gimple stmt, bool use_delta) |
3e293154 MJ |
941 | { |
942 | tree rhs; | |
943 | ||
8b75fc9b | 944 | if (!gimple_assign_single_p (stmt)) |
3e293154 MJ |
945 | return NULL_TREE; |
946 | ||
726a989a | 947 | rhs = gimple_assign_rhs1 (stmt); |
6f7b8b70 | 948 | return ipa_get_member_ptr_load_param (rhs, use_delta); |
3e293154 MJ |
949 | } |
950 | ||
951 | /* Returns true iff T is an SSA_NAME defined by a statement. */ | |
be95e2b9 | 952 | |
3e293154 MJ |
953 | static bool |
954 | ipa_is_ssa_with_stmt_def (tree t) | |
955 | { | |
956 | if (TREE_CODE (t) == SSA_NAME | |
957 | && !SSA_NAME_IS_DEFAULT_DEF (t)) | |
958 | return true; | |
959 | else | |
960 | return false; | |
961 | } | |
962 | ||
b258210c MJ |
963 | /* Find the indirect call graph edge corresponding to STMT and add to it all |
964 | information necessary to describe a call to a parameter number PARAM_INDEX. | |
965 | NODE is the caller. POLYMORPHIC should be set to true iff the call is a | |
966 | virtual one. */ | |
be95e2b9 | 967 | |
3e293154 | 968 | static void |
b258210c MJ |
969 | ipa_note_param_call (struct cgraph_node *node, int param_index, gimple stmt, |
970 | bool polymorphic) | |
3e293154 | 971 | { |
e33c6cd6 | 972 | struct cgraph_edge *cs; |
3e293154 | 973 | |
5f902d76 | 974 | cs = cgraph_edge (node, stmt); |
b258210c MJ |
975 | cs->indirect_info->param_index = param_index; |
976 | cs->indirect_info->anc_offset = 0; | |
977 | cs->indirect_info->polymorphic = polymorphic; | |
978 | if (polymorphic) | |
979 | { | |
980 | tree otr = gimple_call_fn (stmt); | |
981 | tree type, token = OBJ_TYPE_REF_TOKEN (otr); | |
982 | cs->indirect_info->otr_token = tree_low_cst (token, 1); | |
983 | type = TREE_TYPE (TREE_TYPE (OBJ_TYPE_REF_OBJECT (otr))); | |
984 | cs->indirect_info->otr_type = type; | |
985 | } | |
3e293154 MJ |
986 | } |
987 | ||
e33c6cd6 | 988 | /* Analyze the CALL and examine uses of formal parameters of the caller NODE |
062c604f MJ |
989 | (described by INFO). PARMS_INFO is a pointer to a vector containing |
990 | intermediate information about each formal parameter. Currently it checks | |
991 | whether the call calls a pointer that is a formal parameter and if so, the | |
992 | parameter is marked with the called flag and an indirect call graph edge | |
993 | describing the call is created. This is very simple for ordinary pointers | |
994 | represented in SSA but not-so-nice when it comes to member pointers. The | |
995 | ugly part of this function does nothing more than trying to match the | |
996 | pattern of such a call. An example of such a pattern is the gimple dump | |
997 | below, the call is on the last line: | |
3e293154 MJ |
998 | |
999 | <bb 2>: | |
1000 | f$__delta_5 = f.__delta; | |
1001 | f$__pfn_24 = f.__pfn; | |
8aa29647 MJ |
1002 | |
1003 | ... | |
1004 | ||
1005 | <bb 5> | |
3e293154 MJ |
1006 | D.2496_3 = (int) f$__pfn_24; |
1007 | D.2497_4 = D.2496_3 & 1; | |
1008 | if (D.2497_4 != 0) | |
1009 | goto <bb 3>; | |
1010 | else | |
1011 | goto <bb 4>; | |
1012 | ||
8aa29647 | 1013 | <bb 6>: |
3e293154 MJ |
1014 | D.2500_7 = (unsigned int) f$__delta_5; |
1015 | D.2501_8 = &S + D.2500_7; | |
1016 | D.2502_9 = (int (*__vtbl_ptr_type) (void) * *) D.2501_8; | |
1017 | D.2503_10 = *D.2502_9; | |
1018 | D.2504_12 = f$__pfn_24 + -1; | |
1019 | D.2505_13 = (unsigned int) D.2504_12; | |
1020 | D.2506_14 = D.2503_10 + D.2505_13; | |
1021 | D.2507_15 = *D.2506_14; | |
1022 | iftmp.11_16 = (String:: *) D.2507_15; | |
1023 | ||
8aa29647 | 1024 | <bb 7>: |
3e293154 MJ |
1025 | # iftmp.11_1 = PHI <iftmp.11_16(3), f$__pfn_24(2)> |
1026 | D.2500_19 = (unsigned int) f$__delta_5; | |
1027 | D.2508_20 = &S + D.2500_19; | |
1028 | D.2493_21 = iftmp.11_1 (D.2508_20, 4); | |
1029 | ||
1030 | Such patterns are results of simple calls to a member pointer: | |
1031 | ||
1032 | int doprinting (int (MyString::* f)(int) const) | |
1033 | { | |
1034 | MyString S ("somestring"); | |
1035 | ||
1036 | return (S.*f)(4); | |
1037 | } | |
1038 | */ | |
1039 | ||
1040 | static void | |
b258210c MJ |
1041 | ipa_analyze_indirect_call_uses (struct cgraph_node *node, |
1042 | struct ipa_node_params *info, | |
062c604f | 1043 | struct param_analysis_info *parms_info, |
b258210c | 1044 | gimple call, tree target) |
3e293154 | 1045 | { |
726a989a | 1046 | gimple def; |
3e293154 | 1047 | tree n1, n2; |
726a989a RB |
1048 | gimple d1, d2; |
1049 | tree rec, rec2, cond; | |
1050 | gimple branch; | |
3e293154 | 1051 | int index; |
3e293154 MJ |
1052 | basic_block bb, virt_bb, join; |
1053 | ||
3e293154 MJ |
1054 | if (SSA_NAME_IS_DEFAULT_DEF (target)) |
1055 | { | |
b258210c | 1056 | tree var = SSA_NAME_VAR (target); |
3e293154 MJ |
1057 | index = ipa_get_param_decl_index (info, var); |
1058 | if (index >= 0) | |
b258210c | 1059 | ipa_note_param_call (node, index, call, false); |
3e293154 MJ |
1060 | return; |
1061 | } | |
1062 | ||
1063 | /* Now we need to try to match the complex pattern of calling a member | |
1064 | pointer. */ | |
1065 | ||
1066 | if (!POINTER_TYPE_P (TREE_TYPE (target)) | |
1067 | || TREE_CODE (TREE_TYPE (TREE_TYPE (target))) != METHOD_TYPE) | |
1068 | return; | |
1069 | ||
1070 | def = SSA_NAME_DEF_STMT (target); | |
726a989a | 1071 | if (gimple_code (def) != GIMPLE_PHI) |
3e293154 MJ |
1072 | return; |
1073 | ||
726a989a | 1074 | if (gimple_phi_num_args (def) != 2) |
3e293154 MJ |
1075 | return; |
1076 | ||
1077 | /* First, we need to check whether one of these is a load from a member | |
1078 | pointer that is a parameter to this function. */ | |
1079 | n1 = PHI_ARG_DEF (def, 0); | |
1080 | n2 = PHI_ARG_DEF (def, 1); | |
1fc8feb5 | 1081 | if (!ipa_is_ssa_with_stmt_def (n1) || !ipa_is_ssa_with_stmt_def (n2)) |
3e293154 MJ |
1082 | return; |
1083 | d1 = SSA_NAME_DEF_STMT (n1); | |
1084 | d2 = SSA_NAME_DEF_STMT (n2); | |
1085 | ||
8aa29647 | 1086 | join = gimple_bb (def); |
6f7b8b70 | 1087 | if ((rec = ipa_get_stmt_member_ptr_load_param (d1, false))) |
3e293154 | 1088 | { |
6f7b8b70 | 1089 | if (ipa_get_stmt_member_ptr_load_param (d2, false)) |
3e293154 MJ |
1090 | return; |
1091 | ||
8aa29647 | 1092 | bb = EDGE_PRED (join, 0)->src; |
726a989a | 1093 | virt_bb = gimple_bb (d2); |
3e293154 | 1094 | } |
6f7b8b70 | 1095 | else if ((rec = ipa_get_stmt_member_ptr_load_param (d2, false))) |
3e293154 | 1096 | { |
8aa29647 | 1097 | bb = EDGE_PRED (join, 1)->src; |
726a989a | 1098 | virt_bb = gimple_bb (d1); |
3e293154 MJ |
1099 | } |
1100 | else | |
1101 | return; | |
1102 | ||
1103 | /* Second, we need to check that the basic blocks are laid out in the way | |
1104 | corresponding to the pattern. */ | |
1105 | ||
3e293154 MJ |
1106 | if (!single_pred_p (virt_bb) || !single_succ_p (virt_bb) |
1107 | || single_pred (virt_bb) != bb | |
1108 | || single_succ (virt_bb) != join) | |
1109 | return; | |
1110 | ||
1111 | /* Third, let's see that the branching is done depending on the least | |
1112 | significant bit of the pfn. */ | |
1113 | ||
1114 | branch = last_stmt (bb); | |
8aa29647 | 1115 | if (!branch || gimple_code (branch) != GIMPLE_COND) |
3e293154 MJ |
1116 | return; |
1117 | ||
726a989a RB |
1118 | if (gimple_cond_code (branch) != NE_EXPR |
1119 | || !integer_zerop (gimple_cond_rhs (branch))) | |
3e293154 | 1120 | return; |
3e293154 | 1121 | |
726a989a | 1122 | cond = gimple_cond_lhs (branch); |
3e293154 MJ |
1123 | if (!ipa_is_ssa_with_stmt_def (cond)) |
1124 | return; | |
1125 | ||
726a989a | 1126 | def = SSA_NAME_DEF_STMT (cond); |
8b75fc9b | 1127 | if (!is_gimple_assign (def) |
726a989a RB |
1128 | || gimple_assign_rhs_code (def) != BIT_AND_EXPR |
1129 | || !integer_onep (gimple_assign_rhs2 (def))) | |
3e293154 | 1130 | return; |
726a989a RB |
1131 | |
1132 | cond = gimple_assign_rhs1 (def); | |
3e293154 MJ |
1133 | if (!ipa_is_ssa_with_stmt_def (cond)) |
1134 | return; | |
1135 | ||
726a989a | 1136 | def = SSA_NAME_DEF_STMT (cond); |
3e293154 | 1137 | |
8b75fc9b MJ |
1138 | if (is_gimple_assign (def) |
1139 | && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (def))) | |
3e293154 | 1140 | { |
726a989a | 1141 | cond = gimple_assign_rhs1 (def); |
3e293154 MJ |
1142 | if (!ipa_is_ssa_with_stmt_def (cond)) |
1143 | return; | |
726a989a | 1144 | def = SSA_NAME_DEF_STMT (cond); |
3e293154 MJ |
1145 | } |
1146 | ||
6f7b8b70 RE |
1147 | rec2 = ipa_get_stmt_member_ptr_load_param (def, |
1148 | (TARGET_PTRMEMFUNC_VBIT_LOCATION | |
1149 | == ptrmemfunc_vbit_in_delta)); | |
1150 | ||
3e293154 MJ |
1151 | if (rec != rec2) |
1152 | return; | |
1153 | ||
1154 | index = ipa_get_param_decl_index (info, rec); | |
062c604f MJ |
1155 | if (index >= 0 && !is_parm_modified_before_call (&parms_info[index], |
1156 | call, rec)) | |
b258210c | 1157 | ipa_note_param_call (node, index, call, false); |
3e293154 MJ |
1158 | |
1159 | return; | |
1160 | } | |
1161 | ||
b258210c MJ |
1162 | /* Analyze a CALL to an OBJ_TYPE_REF which is passed in TARGET and if the |
1163 | object referenced in the expression is a formal parameter of the caller | |
1164 | (described by INFO), create a call note for the statement. */ | |
1165 | ||
1166 | static void | |
1167 | ipa_analyze_virtual_call_uses (struct cgraph_node *node, | |
1168 | struct ipa_node_params *info, gimple call, | |
1169 | tree target) | |
1170 | { | |
1171 | tree obj = OBJ_TYPE_REF_OBJECT (target); | |
1172 | tree var; | |
1173 | int index; | |
1174 | ||
1175 | if (TREE_CODE (obj) == ADDR_EXPR) | |
1176 | { | |
1177 | do | |
1178 | { | |
1179 | obj = TREE_OPERAND (obj, 0); | |
1180 | } | |
1181 | while (TREE_CODE (obj) == COMPONENT_REF); | |
1182 | if (TREE_CODE (obj) != INDIRECT_REF) | |
1183 | return; | |
1184 | obj = TREE_OPERAND (obj, 0); | |
1185 | } | |
1186 | ||
1187 | if (TREE_CODE (obj) != SSA_NAME | |
1188 | || !SSA_NAME_IS_DEFAULT_DEF (obj)) | |
1189 | return; | |
1190 | ||
1191 | var = SSA_NAME_VAR (obj); | |
1192 | index = ipa_get_param_decl_index (info, var); | |
1193 | ||
1194 | if (index >= 0) | |
1195 | ipa_note_param_call (node, index, call, true); | |
1196 | } | |
1197 | ||
1198 | /* Analyze a call statement CALL whether and how it utilizes formal parameters | |
062c604f MJ |
1199 | of the caller (described by INFO). PARMS_INFO is a pointer to a vector |
1200 | containing intermediate information about each formal parameter. */ | |
b258210c MJ |
1201 | |
1202 | static void | |
1203 | ipa_analyze_call_uses (struct cgraph_node *node, | |
062c604f MJ |
1204 | struct ipa_node_params *info, |
1205 | struct param_analysis_info *parms_info, gimple call) | |
b258210c MJ |
1206 | { |
1207 | tree target = gimple_call_fn (call); | |
1208 | ||
1209 | if (TREE_CODE (target) == SSA_NAME) | |
062c604f | 1210 | ipa_analyze_indirect_call_uses (node, info, parms_info, call, target); |
b258210c MJ |
1211 | else if (TREE_CODE (target) == OBJ_TYPE_REF) |
1212 | ipa_analyze_virtual_call_uses (node, info, call, target); | |
1213 | } | |
1214 | ||
1215 | ||
e33c6cd6 MJ |
1216 | /* Analyze the call statement STMT with respect to formal parameters (described |
1217 | in INFO) of caller given by NODE. Currently it only checks whether formal | |
062c604f MJ |
1218 | parameters are called. PARMS_INFO is a pointer to a vector containing |
1219 | intermediate information about each formal parameter. */ | |
be95e2b9 | 1220 | |
3e293154 | 1221 | static void |
e33c6cd6 | 1222 | ipa_analyze_stmt_uses (struct cgraph_node *node, struct ipa_node_params *info, |
062c604f | 1223 | struct param_analysis_info *parms_info, gimple stmt) |
3e293154 | 1224 | { |
726a989a | 1225 | if (is_gimple_call (stmt)) |
062c604f MJ |
1226 | ipa_analyze_call_uses (node, info, parms_info, stmt); |
1227 | } | |
1228 | ||
1229 | /* Callback of walk_stmt_load_store_addr_ops for the visit_load. | |
1230 | If OP is a parameter declaration, mark it as used in the info structure | |
1231 | passed in DATA. */ | |
1232 | ||
1233 | static bool | |
1234 | visit_ref_for_mod_analysis (gimple stmt ATTRIBUTE_UNUSED, | |
1235 | tree op, void *data) | |
1236 | { | |
1237 | struct ipa_node_params *info = (struct ipa_node_params *) data; | |
1238 | ||
1239 | op = get_base_address (op); | |
1240 | if (op | |
1241 | && TREE_CODE (op) == PARM_DECL) | |
1242 | { | |
1243 | int index = ipa_get_param_decl_index (info, op); | |
1244 | gcc_assert (index >= 0); | |
1245 | info->params[index].used = true; | |
1246 | } | |
1247 | ||
1248 | return false; | |
3e293154 MJ |
1249 | } |
1250 | ||
1251 | /* Scan the function body of NODE and inspect the uses of formal parameters. | |
1252 | Store the findings in various structures of the associated ipa_node_params | |
062c604f MJ |
1253 | structure, such as parameter flags, notes etc. PARMS_INFO is a pointer to a |
1254 | vector containing intermediate information about each formal parameter. */ | |
be95e2b9 | 1255 | |
062c604f MJ |
1256 | static void |
1257 | ipa_analyze_params_uses (struct cgraph_node *node, | |
1258 | struct param_analysis_info *parms_info) | |
3e293154 MJ |
1259 | { |
1260 | tree decl = node->decl; | |
1261 | basic_block bb; | |
1262 | struct function *func; | |
726a989a | 1263 | gimple_stmt_iterator gsi; |
3e293154 | 1264 | struct ipa_node_params *info = IPA_NODE_REF (node); |
062c604f | 1265 | int i; |
3e293154 | 1266 | |
726a989a | 1267 | if (ipa_get_param_count (info) == 0 || info->uses_analysis_done) |
3e293154 | 1268 | return; |
3e293154 | 1269 | |
062c604f MJ |
1270 | for (i = 0; i < ipa_get_param_count (info); i++) |
1271 | { | |
1272 | tree parm = ipa_get_param (info, i); | |
1273 | /* For SSA regs see if parameter is used. For non-SSA we compute | |
1274 | the flag during modification analysis. */ | |
1275 | if (is_gimple_reg (parm) | |
1276 | && gimple_default_def (DECL_STRUCT_FUNCTION (node->decl), parm)) | |
1277 | info->params[i].used = true; | |
1278 | } | |
1279 | ||
3e293154 MJ |
1280 | func = DECL_STRUCT_FUNCTION (decl); |
1281 | FOR_EACH_BB_FN (bb, func) | |
1282 | { | |
726a989a | 1283 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
3e293154 | 1284 | { |
726a989a | 1285 | gimple stmt = gsi_stmt (gsi); |
062c604f MJ |
1286 | |
1287 | if (is_gimple_debug (stmt)) | |
1288 | continue; | |
1289 | ||
1290 | ipa_analyze_stmt_uses (node, info, parms_info, stmt); | |
1291 | walk_stmt_load_store_addr_ops (stmt, info, | |
1292 | visit_ref_for_mod_analysis, | |
1293 | visit_ref_for_mod_analysis, | |
1294 | visit_ref_for_mod_analysis); | |
518dc859 | 1295 | } |
062c604f MJ |
1296 | for (gsi = gsi_start (phi_nodes (bb)); !gsi_end_p (gsi); gsi_next (&gsi)) |
1297 | walk_stmt_load_store_addr_ops (gsi_stmt (gsi), info, | |
1298 | visit_ref_for_mod_analysis, | |
1299 | visit_ref_for_mod_analysis, | |
1300 | visit_ref_for_mod_analysis); | |
518dc859 | 1301 | } |
3e293154 MJ |
1302 | |
1303 | info->uses_analysis_done = 1; | |
1304 | } | |
1305 | ||
062c604f MJ |
1306 | /* Initialize the array describing properties of of formal parameters of NODE, |
1307 | analyze their uses and and compute jump functions associated witu actual | |
1308 | arguments of calls from within NODE. */ | |
1309 | ||
1310 | void | |
1311 | ipa_analyze_node (struct cgraph_node *node) | |
1312 | { | |
1313 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
1314 | struct param_analysis_info *parms_info; | |
1315 | int i, param_count; | |
1316 | ||
1317 | ipa_initialize_node_params (node); | |
1318 | ||
1319 | param_count = ipa_get_param_count (info); | |
1320 | parms_info = XALLOCAVEC (struct param_analysis_info, param_count); | |
1321 | memset (parms_info, 0, sizeof (struct param_analysis_info) * param_count); | |
1322 | ||
1323 | ipa_analyze_params_uses (node, parms_info); | |
1324 | ipa_compute_jump_functions (node, parms_info); | |
1325 | ||
1326 | for (i = 0; i < param_count; i++) | |
1327 | if (parms_info[i].visited_statements) | |
1328 | BITMAP_FREE (parms_info[i].visited_statements); | |
1329 | } | |
1330 | ||
1331 | ||
b258210c MJ |
1332 | /* Update the jump function DST when the call graph edge correspondng to SRC is |
1333 | is being inlined, knowing that DST is of type ancestor and src of known | |
1334 | type. */ | |
1335 | ||
1336 | static void | |
1337 | combine_known_type_and_ancestor_jfs (struct ipa_jump_func *src, | |
1338 | struct ipa_jump_func *dst) | |
1339 | { | |
1340 | tree new_binfo; | |
1341 | ||
1342 | new_binfo = get_binfo_at_offset (src->value.base_binfo, | |
1343 | dst->value.ancestor.offset, | |
1344 | dst->value.ancestor.type); | |
1345 | if (new_binfo) | |
1346 | { | |
1347 | dst->type = IPA_JF_KNOWN_TYPE; | |
1348 | dst->value.base_binfo = new_binfo; | |
1349 | } | |
1350 | else | |
1351 | dst->type = IPA_JF_UNKNOWN; | |
1352 | } | |
1353 | ||
be95e2b9 | 1354 | /* Update the jump functions associated with call graph edge E when the call |
3e293154 | 1355 | graph edge CS is being inlined, assuming that E->caller is already (possibly |
b258210c | 1356 | indirectly) inlined into CS->callee and that E has not been inlined. */ |
be95e2b9 | 1357 | |
3e293154 MJ |
1358 | static void |
1359 | update_jump_functions_after_inlining (struct cgraph_edge *cs, | |
1360 | struct cgraph_edge *e) | |
1361 | { | |
1362 | struct ipa_edge_args *top = IPA_EDGE_REF (cs); | |
1363 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
1364 | int count = ipa_get_cs_argument_count (args); | |
1365 | int i; | |
1366 | ||
1367 | for (i = 0; i < count; i++) | |
1368 | { | |
b258210c | 1369 | struct ipa_jump_func *dst = ipa_get_ith_jump_func (args, i); |
3e293154 | 1370 | |
685b0d13 MJ |
1371 | if (dst->type == IPA_JF_ANCESTOR) |
1372 | { | |
b258210c | 1373 | struct ipa_jump_func *src; |
685b0d13 | 1374 | |
b258210c MJ |
1375 | /* Variable number of arguments can cause havoc if we try to access |
1376 | one that does not exist in the inlined edge. So make sure we | |
1377 | don't. */ | |
1378 | if (dst->value.ancestor.formal_id >= ipa_get_cs_argument_count (top)) | |
1379 | { | |
1380 | dst->type = IPA_JF_UNKNOWN; | |
1381 | continue; | |
1382 | } | |
1383 | ||
1384 | src = ipa_get_ith_jump_func (top, dst->value.ancestor.formal_id); | |
1385 | if (src->type == IPA_JF_KNOWN_TYPE) | |
1386 | combine_known_type_and_ancestor_jfs (src, dst); | |
1387 | else if (src->type == IPA_JF_CONST) | |
1388 | { | |
1389 | struct ipa_jump_func kt_func; | |
3e293154 | 1390 | |
b258210c MJ |
1391 | kt_func.type = IPA_JF_UNKNOWN; |
1392 | compute_known_type_jump_func (src->value.constant, &kt_func); | |
1393 | if (kt_func.type == IPA_JF_KNOWN_TYPE) | |
1394 | combine_known_type_and_ancestor_jfs (&kt_func, dst); | |
1395 | else | |
1396 | dst->type = IPA_JF_UNKNOWN; | |
1397 | } | |
1398 | else if (src->type == IPA_JF_PASS_THROUGH | |
1399 | && src->value.pass_through.operation == NOP_EXPR) | |
1400 | dst->value.ancestor.formal_id = src->value.pass_through.formal_id; | |
1401 | else if (src->type == IPA_JF_ANCESTOR) | |
1402 | { | |
1403 | dst->value.ancestor.formal_id = src->value.ancestor.formal_id; | |
1404 | dst->value.ancestor.offset += src->value.ancestor.offset; | |
1405 | } | |
1406 | else | |
1407 | dst->type = IPA_JF_UNKNOWN; | |
1408 | } | |
1409 | else if (dst->type == IPA_JF_PASS_THROUGH) | |
3e293154 | 1410 | { |
b258210c MJ |
1411 | struct ipa_jump_func *src; |
1412 | /* We must check range due to calls with variable number of arguments | |
1413 | and we cannot combine jump functions with operations. */ | |
1414 | if (dst->value.pass_through.operation == NOP_EXPR | |
1415 | && (dst->value.pass_through.formal_id | |
1416 | < ipa_get_cs_argument_count (top))) | |
1417 | { | |
1418 | src = ipa_get_ith_jump_func (top, | |
1419 | dst->value.pass_through.formal_id); | |
1420 | *dst = *src; | |
1421 | } | |
1422 | else | |
1423 | dst->type = IPA_JF_UNKNOWN; | |
3e293154 | 1424 | } |
b258210c MJ |
1425 | } |
1426 | } | |
1427 | ||
1428 | /* If TARGET is an addr_expr of a function declaration, make it the destination | |
1429 | of an indirect edge IE and return the edge. Otherwise, return NULL. */ | |
1430 | ||
1431 | static struct cgraph_edge * | |
1432 | make_edge_direct_to_target (struct cgraph_edge *ie, tree target) | |
1433 | { | |
1434 | struct cgraph_node *callee; | |
1435 | ||
1436 | if (TREE_CODE (target) != ADDR_EXPR) | |
1437 | return NULL; | |
1438 | target = TREE_OPERAND (target, 0); | |
1439 | if (TREE_CODE (target) != FUNCTION_DECL) | |
1440 | return NULL; | |
1441 | callee = cgraph_node (target); | |
1442 | if (!callee) | |
1443 | return NULL; | |
3e293154 | 1444 | |
b258210c MJ |
1445 | cgraph_make_edge_direct (ie, callee); |
1446 | if (dump_file) | |
1447 | { | |
1448 | fprintf (dump_file, "ipa-prop: Discovered %s call to a known target " | |
1449 | "(%s/%i -> %s/%i) for stmt ", | |
1450 | ie->indirect_info->polymorphic ? "a virtual" : "an indirect", | |
1451 | cgraph_node_name (ie->caller), ie->caller->uid, | |
1452 | cgraph_node_name (ie->callee), ie->callee->uid); | |
1453 | ||
1454 | if (ie->call_stmt) | |
1455 | print_gimple_stmt (dump_file, ie->call_stmt, 2, TDF_SLIM); | |
1456 | else | |
1457 | fprintf (dump_file, "with uid %i\n", ie->lto_stmt_uid); | |
3e293154 | 1458 | } |
749aa96d MJ |
1459 | |
1460 | if (ipa_get_cs_argument_count (IPA_EDGE_REF (ie)) | |
1461 | != ipa_get_param_count (IPA_NODE_REF (callee))) | |
1462 | ipa_set_called_with_variable_arg (IPA_NODE_REF (callee)); | |
1463 | ||
b258210c | 1464 | return ie; |
3e293154 MJ |
1465 | } |
1466 | ||
b258210c MJ |
1467 | /* Try to find a destination for indirect edge IE that corresponds to a simple |
1468 | call or a call of a member function pointer and where the destination is a | |
1469 | pointer formal parameter described by jump function JFUNC. If it can be | |
1470 | determined, return the newly direct edge, otherwise return NULL. */ | |
be95e2b9 | 1471 | |
b258210c MJ |
1472 | static struct cgraph_edge * |
1473 | try_make_edge_direct_simple_call (struct cgraph_edge *ie, | |
1474 | struct ipa_jump_func *jfunc) | |
1475 | { | |
1476 | tree target; | |
1477 | ||
1478 | if (jfunc->type == IPA_JF_CONST) | |
1479 | target = jfunc->value.constant; | |
1480 | else if (jfunc->type == IPA_JF_CONST_MEMBER_PTR) | |
1481 | target = jfunc->value.member_cst.pfn; | |
1482 | else | |
1483 | return NULL; | |
1484 | ||
1485 | return make_edge_direct_to_target (ie, target); | |
1486 | } | |
1487 | ||
1488 | /* Try to find a destination for indirect edge IE that corresponds to a | |
1489 | virtuall call based on a formal parameter which is described by jump | |
1490 | function JFUNC and if it can be determined, make it direct and return the | |
1491 | direct edge. Otherwise, return NULL. */ | |
1492 | ||
1493 | static struct cgraph_edge * | |
1494 | try_make_edge_direct_virtual_call (struct cgraph_edge *ie, | |
1495 | struct ipa_jump_func *jfunc) | |
3e293154 | 1496 | { |
b258210c MJ |
1497 | tree binfo, type, target; |
1498 | HOST_WIDE_INT token; | |
1499 | ||
1500 | if (jfunc->type == IPA_JF_KNOWN_TYPE) | |
1501 | binfo = jfunc->value.base_binfo; | |
1502 | else if (jfunc->type == IPA_JF_CONST) | |
3e293154 | 1503 | { |
b258210c MJ |
1504 | tree cst = jfunc->value.constant; |
1505 | if (TREE_CODE (cst) == ADDR_EXPR) | |
1506 | binfo = gimple_get_relevant_ref_binfo (TREE_OPERAND (cst, 0), | |
1507 | NULL_TREE); | |
1508 | else | |
1509 | return NULL; | |
3e293154 MJ |
1510 | } |
1511 | else | |
b258210c MJ |
1512 | return NULL; |
1513 | ||
1514 | if (!binfo) | |
1515 | return NULL; | |
3e293154 | 1516 | |
b258210c MJ |
1517 | token = ie->indirect_info->otr_token; |
1518 | type = ie->indirect_info->otr_type; | |
1519 | binfo = get_binfo_at_offset (binfo, ie->indirect_info->anc_offset, type); | |
1520 | if (binfo) | |
1521 | target = gimple_fold_obj_type_ref_known_binfo (token, binfo); | |
1522 | else | |
1523 | return NULL; | |
1524 | ||
1525 | if (target) | |
1526 | return make_edge_direct_to_target (ie, target); | |
1527 | else | |
1528 | return NULL; | |
3e293154 MJ |
1529 | } |
1530 | ||
1531 | /* Update the param called notes associated with NODE when CS is being inlined, | |
1532 | assuming NODE is (potentially indirectly) inlined into CS->callee. | |
1533 | Moreover, if the callee is discovered to be constant, create a new cgraph | |
e56f5f3e | 1534 | edge for it. Newly discovered indirect edges will be added to *NEW_EDGES, |
f8e2a1ed | 1535 | unless NEW_EDGES is NULL. Return true iff a new edge(s) were created. */ |
be95e2b9 | 1536 | |
f8e2a1ed | 1537 | static bool |
e33c6cd6 MJ |
1538 | update_indirect_edges_after_inlining (struct cgraph_edge *cs, |
1539 | struct cgraph_node *node, | |
1540 | VEC (cgraph_edge_p, heap) **new_edges) | |
3e293154 | 1541 | { |
3e293154 | 1542 | struct ipa_edge_args *top = IPA_EDGE_REF (cs); |
b258210c | 1543 | struct cgraph_edge *ie, *next_ie, *new_direct_edge; |
f8e2a1ed | 1544 | bool res = false; |
3e293154 | 1545 | |
e33c6cd6 MJ |
1546 | ipa_check_create_edge_args (); |
1547 | ||
1548 | for (ie = node->indirect_calls; ie; ie = next_ie) | |
3e293154 | 1549 | { |
e33c6cd6 | 1550 | struct cgraph_indirect_call_info *ici = ie->indirect_info; |
3e293154 MJ |
1551 | struct ipa_jump_func *jfunc; |
1552 | ||
e33c6cd6 MJ |
1553 | next_ie = ie->next_callee; |
1554 | if (bitmap_bit_p (iinlining_processed_edges, ie->uid)) | |
3e293154 MJ |
1555 | continue; |
1556 | ||
e33c6cd6 MJ |
1557 | /* If we ever use indirect edges for anything other than indirect |
1558 | inlining, we will need to skip those with negative param_indices. */ | |
5f902d76 JH |
1559 | if (ici->param_index == -1) |
1560 | continue; | |
e33c6cd6 | 1561 | |
3e293154 | 1562 | /* We must check range due to calls with variable number of arguments: */ |
e33c6cd6 | 1563 | if (ici->param_index >= ipa_get_cs_argument_count (top)) |
3e293154 | 1564 | { |
e33c6cd6 | 1565 | bitmap_set_bit (iinlining_processed_edges, ie->uid); |
3e293154 MJ |
1566 | continue; |
1567 | } | |
1568 | ||
e33c6cd6 | 1569 | jfunc = ipa_get_ith_jump_func (top, ici->param_index); |
685b0d13 MJ |
1570 | if (jfunc->type == IPA_JF_PASS_THROUGH |
1571 | && jfunc->value.pass_through.operation == NOP_EXPR) | |
e33c6cd6 | 1572 | ici->param_index = jfunc->value.pass_through.formal_id; |
b258210c | 1573 | else if (jfunc->type == IPA_JF_ANCESTOR) |
3e293154 | 1574 | { |
b258210c MJ |
1575 | ici->param_index = jfunc->value.ancestor.formal_id; |
1576 | ici->anc_offset += jfunc->value.ancestor.offset; | |
3e293154 | 1577 | } |
685b0d13 | 1578 | else |
b258210c MJ |
1579 | /* Either we can find a destination for this edge now or never. */ |
1580 | bitmap_set_bit (iinlining_processed_edges, ie->uid); | |
1581 | ||
1582 | if (ici->polymorphic) | |
1583 | new_direct_edge = try_make_edge_direct_virtual_call (ie, jfunc); | |
1584 | else | |
1585 | new_direct_edge = try_make_edge_direct_simple_call (ie, jfunc); | |
1586 | ||
1587 | if (new_direct_edge) | |
685b0d13 | 1588 | { |
b258210c MJ |
1589 | new_direct_edge->indirect_inlining_edge = 1; |
1590 | if (new_edges) | |
1591 | { | |
1592 | VEC_safe_push (cgraph_edge_p, heap, *new_edges, | |
1593 | new_direct_edge); | |
1594 | top = IPA_EDGE_REF (cs); | |
1595 | res = true; | |
1596 | } | |
685b0d13 | 1597 | } |
3e293154 | 1598 | } |
e33c6cd6 | 1599 | |
f8e2a1ed | 1600 | return res; |
3e293154 MJ |
1601 | } |
1602 | ||
1603 | /* Recursively traverse subtree of NODE (including node) made of inlined | |
1604 | cgraph_edges when CS has been inlined and invoke | |
e33c6cd6 | 1605 | update_indirect_edges_after_inlining on all nodes and |
3e293154 MJ |
1606 | update_jump_functions_after_inlining on all non-inlined edges that lead out |
1607 | of this subtree. Newly discovered indirect edges will be added to | |
f8e2a1ed MJ |
1608 | *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were |
1609 | created. */ | |
be95e2b9 | 1610 | |
f8e2a1ed | 1611 | static bool |
3e293154 MJ |
1612 | propagate_info_to_inlined_callees (struct cgraph_edge *cs, |
1613 | struct cgraph_node *node, | |
e56f5f3e | 1614 | VEC (cgraph_edge_p, heap) **new_edges) |
3e293154 MJ |
1615 | { |
1616 | struct cgraph_edge *e; | |
f8e2a1ed | 1617 | bool res; |
3e293154 | 1618 | |
e33c6cd6 | 1619 | res = update_indirect_edges_after_inlining (cs, node, new_edges); |
3e293154 MJ |
1620 | |
1621 | for (e = node->callees; e; e = e->next_callee) | |
1622 | if (!e->inline_failed) | |
f8e2a1ed | 1623 | res |= propagate_info_to_inlined_callees (cs, e->callee, new_edges); |
3e293154 MJ |
1624 | else |
1625 | update_jump_functions_after_inlining (cs, e); | |
f8e2a1ed MJ |
1626 | |
1627 | return res; | |
3e293154 MJ |
1628 | } |
1629 | ||
1630 | /* Update jump functions and call note functions on inlining the call site CS. | |
1631 | CS is expected to lead to a node already cloned by | |
1632 | cgraph_clone_inline_nodes. Newly discovered indirect edges will be added to | |
f8e2a1ed MJ |
1633 | *NEW_EDGES, unless NEW_EDGES is NULL. Return true iff a new edge(s) were + |
1634 | created. */ | |
be95e2b9 | 1635 | |
f8e2a1ed | 1636 | bool |
3e293154 | 1637 | ipa_propagate_indirect_call_infos (struct cgraph_edge *cs, |
e56f5f3e | 1638 | VEC (cgraph_edge_p, heap) **new_edges) |
3e293154 | 1639 | { |
d7f09764 DN |
1640 | /* FIXME lto: We do not stream out indirect call information. */ |
1641 | if (flag_wpa) | |
1642 | return false; | |
1643 | ||
f8e2a1ed MJ |
1644 | /* Do nothing if the preparation phase has not been carried out yet |
1645 | (i.e. during early inlining). */ | |
1646 | if (!ipa_node_params_vector) | |
1647 | return false; | |
1648 | gcc_assert (ipa_edge_args_vector); | |
1649 | ||
1650 | return propagate_info_to_inlined_callees (cs, cs->callee, new_edges); | |
518dc859 RL |
1651 | } |
1652 | ||
771578a0 MJ |
1653 | /* Frees all dynamically allocated structures that the argument info points |
1654 | to. */ | |
be95e2b9 | 1655 | |
518dc859 | 1656 | void |
771578a0 | 1657 | ipa_free_edge_args_substructures (struct ipa_edge_args *args) |
518dc859 | 1658 | { |
771578a0 | 1659 | if (args->jump_functions) |
fb3f88cc | 1660 | ggc_free (args->jump_functions); |
771578a0 MJ |
1661 | |
1662 | memset (args, 0, sizeof (*args)); | |
518dc859 RL |
1663 | } |
1664 | ||
771578a0 | 1665 | /* Free all ipa_edge structures. */ |
be95e2b9 | 1666 | |
518dc859 | 1667 | void |
771578a0 | 1668 | ipa_free_all_edge_args (void) |
518dc859 | 1669 | { |
771578a0 MJ |
1670 | int i; |
1671 | struct ipa_edge_args *args; | |
518dc859 | 1672 | |
771578a0 MJ |
1673 | for (i = 0; |
1674 | VEC_iterate (ipa_edge_args_t, ipa_edge_args_vector, i, args); | |
1675 | i++) | |
1676 | ipa_free_edge_args_substructures (args); | |
1677 | ||
fb3f88cc | 1678 | VEC_free (ipa_edge_args_t, gc, ipa_edge_args_vector); |
771578a0 | 1679 | ipa_edge_args_vector = NULL; |
518dc859 RL |
1680 | } |
1681 | ||
771578a0 MJ |
1682 | /* Frees all dynamically allocated structures that the param info points |
1683 | to. */ | |
be95e2b9 | 1684 | |
518dc859 | 1685 | void |
771578a0 | 1686 | ipa_free_node_params_substructures (struct ipa_node_params *info) |
518dc859 | 1687 | { |
f8e2a1ed MJ |
1688 | if (info->params) |
1689 | free (info->params); | |
3e293154 | 1690 | |
771578a0 | 1691 | memset (info, 0, sizeof (*info)); |
518dc859 RL |
1692 | } |
1693 | ||
771578a0 | 1694 | /* Free all ipa_node_params structures. */ |
be95e2b9 | 1695 | |
518dc859 | 1696 | void |
771578a0 | 1697 | ipa_free_all_node_params (void) |
518dc859 | 1698 | { |
771578a0 MJ |
1699 | int i; |
1700 | struct ipa_node_params *info; | |
518dc859 | 1701 | |
771578a0 MJ |
1702 | for (i = 0; |
1703 | VEC_iterate (ipa_node_params_t, ipa_node_params_vector, i, info); | |
1704 | i++) | |
1705 | ipa_free_node_params_substructures (info); | |
1706 | ||
1707 | VEC_free (ipa_node_params_t, heap, ipa_node_params_vector); | |
1708 | ipa_node_params_vector = NULL; | |
1709 | } | |
1710 | ||
1711 | /* Hook that is called by cgraph.c when an edge is removed. */ | |
be95e2b9 | 1712 | |
771578a0 | 1713 | static void |
5c0466b5 | 1714 | ipa_edge_removal_hook (struct cgraph_edge *cs, void *data ATTRIBUTE_UNUSED) |
771578a0 | 1715 | { |
c6f7cfc1 JH |
1716 | /* During IPA-CP updating we can be called on not-yet analyze clones. */ |
1717 | if (VEC_length (ipa_edge_args_t, ipa_edge_args_vector) | |
1718 | <= (unsigned)cs->uid) | |
1719 | return; | |
771578a0 | 1720 | ipa_free_edge_args_substructures (IPA_EDGE_REF (cs)); |
518dc859 RL |
1721 | } |
1722 | ||
771578a0 | 1723 | /* Hook that is called by cgraph.c when a node is removed. */ |
be95e2b9 | 1724 | |
771578a0 | 1725 | static void |
5c0466b5 | 1726 | ipa_node_removal_hook (struct cgraph_node *node, void *data ATTRIBUTE_UNUSED) |
771578a0 | 1727 | { |
dd6d1ad7 JH |
1728 | /* During IPA-CP updating we can be called on not-yet analyze clones. */ |
1729 | if (VEC_length (ipa_node_params_t, ipa_node_params_vector) | |
1730 | <= (unsigned)node->uid) | |
1731 | return; | |
771578a0 MJ |
1732 | ipa_free_node_params_substructures (IPA_NODE_REF (node)); |
1733 | } | |
1734 | ||
1735 | /* Helper function to duplicate an array of size N that is at SRC and store a | |
1736 | pointer to it to DST. Nothing is done if SRC is NULL. */ | |
be95e2b9 | 1737 | |
771578a0 MJ |
1738 | static void * |
1739 | duplicate_array (void *src, size_t n) | |
1740 | { | |
1741 | void *p; | |
1742 | ||
1743 | if (!src) | |
1744 | return NULL; | |
1745 | ||
fb3f88cc JH |
1746 | p = xmalloc (n); |
1747 | memcpy (p, src, n); | |
1748 | return p; | |
1749 | } | |
1750 | ||
a9429e29 LB |
1751 | static struct ipa_jump_func * |
1752 | duplicate_ipa_jump_func_array (const struct ipa_jump_func * src, size_t n) | |
fb3f88cc | 1753 | { |
a9429e29 | 1754 | struct ipa_jump_func *p; |
fb3f88cc JH |
1755 | |
1756 | if (!src) | |
1757 | return NULL; | |
1758 | ||
a9429e29 LB |
1759 | p = ggc_alloc_vec_ipa_jump_func (n); |
1760 | memcpy (p, src, n * sizeof (struct ipa_jump_func)); | |
771578a0 MJ |
1761 | return p; |
1762 | } | |
1763 | ||
1764 | /* Hook that is called by cgraph.c when a node is duplicated. */ | |
be95e2b9 | 1765 | |
771578a0 MJ |
1766 | static void |
1767 | ipa_edge_duplication_hook (struct cgraph_edge *src, struct cgraph_edge *dst, | |
f8e2a1ed | 1768 | __attribute__((unused)) void *data) |
771578a0 MJ |
1769 | { |
1770 | struct ipa_edge_args *old_args, *new_args; | |
1771 | int arg_count; | |
1772 | ||
1773 | ipa_check_create_edge_args (); | |
1774 | ||
1775 | old_args = IPA_EDGE_REF (src); | |
1776 | new_args = IPA_EDGE_REF (dst); | |
1777 | ||
1778 | arg_count = ipa_get_cs_argument_count (old_args); | |
1779 | ipa_set_cs_argument_count (new_args, arg_count); | |
a9429e29 LB |
1780 | new_args->jump_functions = |
1781 | duplicate_ipa_jump_func_array (old_args->jump_functions, arg_count); | |
e33c6cd6 MJ |
1782 | |
1783 | if (iinlining_processed_edges | |
1784 | && bitmap_bit_p (iinlining_processed_edges, src->uid)) | |
1785 | bitmap_set_bit (iinlining_processed_edges, dst->uid); | |
771578a0 MJ |
1786 | } |
1787 | ||
1788 | /* Hook that is called by cgraph.c when a node is duplicated. */ | |
be95e2b9 | 1789 | |
771578a0 MJ |
1790 | static void |
1791 | ipa_node_duplication_hook (struct cgraph_node *src, struct cgraph_node *dst, | |
f8e2a1ed | 1792 | __attribute__((unused)) void *data) |
771578a0 MJ |
1793 | { |
1794 | struct ipa_node_params *old_info, *new_info; | |
1795 | int param_count; | |
1796 | ||
1797 | ipa_check_create_node_params (); | |
1798 | old_info = IPA_NODE_REF (src); | |
1799 | new_info = IPA_NODE_REF (dst); | |
1800 | param_count = ipa_get_param_count (old_info); | |
1801 | ||
1802 | ipa_set_param_count (new_info, param_count); | |
f8e2a1ed MJ |
1803 | new_info->params = (struct ipa_param_descriptor *) |
1804 | duplicate_array (old_info->params, | |
1805 | sizeof (struct ipa_param_descriptor) * param_count); | |
771578a0 MJ |
1806 | new_info->ipcp_orig_node = old_info->ipcp_orig_node; |
1807 | new_info->count_scale = old_info->count_scale; | |
771578a0 MJ |
1808 | } |
1809 | ||
1810 | /* Register our cgraph hooks if they are not already there. */ | |
be95e2b9 | 1811 | |
518dc859 | 1812 | void |
771578a0 | 1813 | ipa_register_cgraph_hooks (void) |
518dc859 | 1814 | { |
771578a0 MJ |
1815 | if (!edge_removal_hook_holder) |
1816 | edge_removal_hook_holder = | |
1817 | cgraph_add_edge_removal_hook (&ipa_edge_removal_hook, NULL); | |
1818 | if (!node_removal_hook_holder) | |
1819 | node_removal_hook_holder = | |
1820 | cgraph_add_node_removal_hook (&ipa_node_removal_hook, NULL); | |
1821 | if (!edge_duplication_hook_holder) | |
1822 | edge_duplication_hook_holder = | |
1823 | cgraph_add_edge_duplication_hook (&ipa_edge_duplication_hook, NULL); | |
1824 | if (!node_duplication_hook_holder) | |
1825 | node_duplication_hook_holder = | |
1826 | cgraph_add_node_duplication_hook (&ipa_node_duplication_hook, NULL); | |
1827 | } | |
518dc859 | 1828 | |
771578a0 | 1829 | /* Unregister our cgraph hooks if they are not already there. */ |
be95e2b9 | 1830 | |
771578a0 MJ |
1831 | static void |
1832 | ipa_unregister_cgraph_hooks (void) | |
1833 | { | |
1834 | cgraph_remove_edge_removal_hook (edge_removal_hook_holder); | |
1835 | edge_removal_hook_holder = NULL; | |
1836 | cgraph_remove_node_removal_hook (node_removal_hook_holder); | |
1837 | node_removal_hook_holder = NULL; | |
1838 | cgraph_remove_edge_duplication_hook (edge_duplication_hook_holder); | |
1839 | edge_duplication_hook_holder = NULL; | |
1840 | cgraph_remove_node_duplication_hook (node_duplication_hook_holder); | |
1841 | node_duplication_hook_holder = NULL; | |
1842 | } | |
1843 | ||
e33c6cd6 MJ |
1844 | /* Allocate all necessary data strucutures necessary for indirect inlining. */ |
1845 | ||
1846 | void | |
1847 | ipa_create_all_structures_for_iinln (void) | |
1848 | { | |
1849 | iinlining_processed_edges = BITMAP_ALLOC (NULL); | |
1850 | } | |
1851 | ||
771578a0 MJ |
1852 | /* Free all ipa_node_params and all ipa_edge_args structures if they are no |
1853 | longer needed after ipa-cp. */ | |
be95e2b9 | 1854 | |
771578a0 | 1855 | void |
e33c6cd6 | 1856 | ipa_free_all_structures_after_ipa_cp (void) |
3e293154 | 1857 | { |
7e8b322a | 1858 | if (!flag_indirect_inlining) |
3e293154 MJ |
1859 | { |
1860 | ipa_free_all_edge_args (); | |
1861 | ipa_free_all_node_params (); | |
1862 | ipa_unregister_cgraph_hooks (); | |
1863 | } | |
1864 | } | |
1865 | ||
1866 | /* Free all ipa_node_params and all ipa_edge_args structures if they are no | |
1867 | longer needed after indirect inlining. */ | |
be95e2b9 | 1868 | |
3e293154 | 1869 | void |
e33c6cd6 | 1870 | ipa_free_all_structures_after_iinln (void) |
771578a0 | 1871 | { |
e33c6cd6 MJ |
1872 | BITMAP_FREE (iinlining_processed_edges); |
1873 | ||
771578a0 MJ |
1874 | ipa_free_all_edge_args (); |
1875 | ipa_free_all_node_params (); | |
1876 | ipa_unregister_cgraph_hooks (); | |
518dc859 RL |
1877 | } |
1878 | ||
dcd416e3 | 1879 | /* Print ipa_tree_map data structures of all functions in the |
518dc859 | 1880 | callgraph to F. */ |
be95e2b9 | 1881 | |
518dc859 | 1882 | void |
ca30a539 | 1883 | ipa_print_node_params (FILE * f, struct cgraph_node *node) |
518dc859 RL |
1884 | { |
1885 | int i, count; | |
1886 | tree temp; | |
3e293154 | 1887 | struct ipa_node_params *info; |
518dc859 | 1888 | |
3e293154 MJ |
1889 | if (!node->analyzed) |
1890 | return; | |
1891 | info = IPA_NODE_REF (node); | |
b258210c MJ |
1892 | fprintf (f, " function %s parameter descriptors:\n", |
1893 | cgraph_node_name (node)); | |
3e293154 MJ |
1894 | count = ipa_get_param_count (info); |
1895 | for (i = 0; i < count; i++) | |
518dc859 | 1896 | { |
f8e2a1ed | 1897 | temp = ipa_get_param (info, i); |
ca30a539 JH |
1898 | if (TREE_CODE (temp) == PARM_DECL) |
1899 | fprintf (f, " param %d : %s", i, | |
90e1a349 MH |
1900 | (DECL_NAME (temp) |
1901 | ? (*lang_hooks.decl_printable_name) (temp, 2) | |
1902 | : "(unnamed)")); | |
339f49ec JH |
1903 | if (ipa_is_param_used (info, i)) |
1904 | fprintf (f, " used"); | |
3e293154 | 1905 | fprintf (f, "\n"); |
518dc859 RL |
1906 | } |
1907 | } | |
dcd416e3 | 1908 | |
ca30a539 | 1909 | /* Print ipa_tree_map data structures of all functions in the |
3e293154 | 1910 | callgraph to F. */ |
be95e2b9 | 1911 | |
3e293154 | 1912 | void |
ca30a539 | 1913 | ipa_print_all_params (FILE * f) |
3e293154 MJ |
1914 | { |
1915 | struct cgraph_node *node; | |
1916 | ||
ca30a539 | 1917 | fprintf (f, "\nFunction parameters:\n"); |
3e293154 | 1918 | for (node = cgraph_nodes; node; node = node->next) |
ca30a539 | 1919 | ipa_print_node_params (f, node); |
3e293154 | 1920 | } |
3f84bf08 MJ |
1921 | |
1922 | /* Return a heap allocated vector containing formal parameters of FNDECL. */ | |
1923 | ||
1924 | VEC(tree, heap) * | |
1925 | ipa_get_vector_of_formal_parms (tree fndecl) | |
1926 | { | |
1927 | VEC(tree, heap) *args; | |
1928 | int count; | |
1929 | tree parm; | |
1930 | ||
1931 | count = count_formal_params_1 (fndecl); | |
1932 | args = VEC_alloc (tree, heap, count); | |
1933 | for (parm = DECL_ARGUMENTS (fndecl); parm; parm = TREE_CHAIN (parm)) | |
1934 | VEC_quick_push (tree, args, parm); | |
1935 | ||
1936 | return args; | |
1937 | } | |
1938 | ||
1939 | /* Return a heap allocated vector containing types of formal parameters of | |
1940 | function type FNTYPE. */ | |
1941 | ||
1942 | static inline VEC(tree, heap) * | |
1943 | get_vector_of_formal_parm_types (tree fntype) | |
1944 | { | |
1945 | VEC(tree, heap) *types; | |
1946 | int count = 0; | |
1947 | tree t; | |
1948 | ||
1949 | for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t)) | |
1950 | count++; | |
1951 | ||
1952 | types = VEC_alloc (tree, heap, count); | |
1953 | for (t = TYPE_ARG_TYPES (fntype); t; t = TREE_CHAIN (t)) | |
1954 | VEC_quick_push (tree, types, TREE_VALUE (t)); | |
1955 | ||
1956 | return types; | |
1957 | } | |
1958 | ||
1959 | /* Modify the function declaration FNDECL and its type according to the plan in | |
1960 | ADJUSTMENTS. It also sets base fields of individual adjustments structures | |
1961 | to reflect the actual parameters being modified which are determined by the | |
1962 | base_index field. */ | |
1963 | ||
1964 | void | |
1965 | ipa_modify_formal_parameters (tree fndecl, ipa_parm_adjustment_vec adjustments, | |
1966 | const char *synth_parm_prefix) | |
1967 | { | |
1968 | VEC(tree, heap) *oparms, *otypes; | |
1969 | tree orig_type, new_type = NULL; | |
1970 | tree old_arg_types, t, new_arg_types = NULL; | |
1971 | tree parm, *link = &DECL_ARGUMENTS (fndecl); | |
1972 | int i, len = VEC_length (ipa_parm_adjustment_t, adjustments); | |
1973 | tree new_reversed = NULL; | |
1974 | bool care_for_types, last_parm_void; | |
1975 | ||
1976 | if (!synth_parm_prefix) | |
1977 | synth_parm_prefix = "SYNTH"; | |
1978 | ||
1979 | oparms = ipa_get_vector_of_formal_parms (fndecl); | |
1980 | orig_type = TREE_TYPE (fndecl); | |
1981 | old_arg_types = TYPE_ARG_TYPES (orig_type); | |
1982 | ||
1983 | /* The following test is an ugly hack, some functions simply don't have any | |
1984 | arguments in their type. This is probably a bug but well... */ | |
1985 | care_for_types = (old_arg_types != NULL_TREE); | |
1986 | if (care_for_types) | |
1987 | { | |
1988 | last_parm_void = (TREE_VALUE (tree_last (old_arg_types)) | |
1989 | == void_type_node); | |
1990 | otypes = get_vector_of_formal_parm_types (orig_type); | |
1991 | if (last_parm_void) | |
1992 | gcc_assert (VEC_length (tree, oparms) + 1 == VEC_length (tree, otypes)); | |
1993 | else | |
1994 | gcc_assert (VEC_length (tree, oparms) == VEC_length (tree, otypes)); | |
1995 | } | |
1996 | else | |
1997 | { | |
1998 | last_parm_void = false; | |
1999 | otypes = NULL; | |
2000 | } | |
2001 | ||
2002 | for (i = 0; i < len; i++) | |
2003 | { | |
2004 | struct ipa_parm_adjustment *adj; | |
2005 | gcc_assert (link); | |
2006 | ||
2007 | adj = VEC_index (ipa_parm_adjustment_t, adjustments, i); | |
2008 | parm = VEC_index (tree, oparms, adj->base_index); | |
2009 | adj->base = parm; | |
2010 | ||
2011 | if (adj->copy_param) | |
2012 | { | |
2013 | if (care_for_types) | |
2014 | new_arg_types = tree_cons (NULL_TREE, VEC_index (tree, otypes, | |
2015 | adj->base_index), | |
2016 | new_arg_types); | |
2017 | *link = parm; | |
2018 | link = &TREE_CHAIN (parm); | |
2019 | } | |
2020 | else if (!adj->remove_param) | |
2021 | { | |
2022 | tree new_parm; | |
2023 | tree ptype; | |
2024 | ||
2025 | if (adj->by_ref) | |
2026 | ptype = build_pointer_type (adj->type); | |
2027 | else | |
2028 | ptype = adj->type; | |
2029 | ||
2030 | if (care_for_types) | |
2031 | new_arg_types = tree_cons (NULL_TREE, ptype, new_arg_types); | |
2032 | ||
2033 | new_parm = build_decl (UNKNOWN_LOCATION, PARM_DECL, NULL_TREE, | |
2034 | ptype); | |
2035 | DECL_NAME (new_parm) = create_tmp_var_name (synth_parm_prefix); | |
2036 | ||
2037 | DECL_ARTIFICIAL (new_parm) = 1; | |
2038 | DECL_ARG_TYPE (new_parm) = ptype; | |
2039 | DECL_CONTEXT (new_parm) = fndecl; | |
2040 | TREE_USED (new_parm) = 1; | |
2041 | DECL_IGNORED_P (new_parm) = 1; | |
2042 | layout_decl (new_parm, 0); | |
2043 | ||
2044 | add_referenced_var (new_parm); | |
2045 | mark_sym_for_renaming (new_parm); | |
2046 | adj->base = parm; | |
2047 | adj->reduction = new_parm; | |
2048 | ||
2049 | *link = new_parm; | |
2050 | ||
2051 | link = &TREE_CHAIN (new_parm); | |
2052 | } | |
2053 | } | |
2054 | ||
2055 | *link = NULL_TREE; | |
2056 | ||
2057 | if (care_for_types) | |
2058 | { | |
2059 | new_reversed = nreverse (new_arg_types); | |
2060 | if (last_parm_void) | |
2061 | { | |
2062 | if (new_reversed) | |
2063 | TREE_CHAIN (new_arg_types) = void_list_node; | |
2064 | else | |
2065 | new_reversed = void_list_node; | |
2066 | } | |
2067 | } | |
2068 | ||
2069 | /* Use copy_node to preserve as much as possible from original type | |
2070 | (debug info, attribute lists etc.) | |
2071 | Exception is METHOD_TYPEs must have THIS argument. | |
2072 | When we are asked to remove it, we need to build new FUNCTION_TYPE | |
2073 | instead. */ | |
2074 | if (TREE_CODE (orig_type) != METHOD_TYPE | |
2075 | || (VEC_index (ipa_parm_adjustment_t, adjustments, 0)->copy_param | |
2076 | && VEC_index (ipa_parm_adjustment_t, adjustments, 0)->base_index == 0)) | |
2077 | { | |
2078 | new_type = copy_node (orig_type); | |
2079 | TYPE_ARG_TYPES (new_type) = new_reversed; | |
2080 | } | |
2081 | else | |
2082 | { | |
2083 | new_type | |
2084 | = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type), | |
2085 | new_reversed)); | |
2086 | TYPE_CONTEXT (new_type) = TYPE_CONTEXT (orig_type); | |
2087 | DECL_VINDEX (fndecl) = NULL_TREE; | |
2088 | } | |
2089 | ||
2090 | /* This is a new type, not a copy of an old type. Need to reassociate | |
2091 | variants. We can handle everything except the main variant lazily. */ | |
2092 | t = TYPE_MAIN_VARIANT (orig_type); | |
2093 | if (orig_type != t) | |
2094 | { | |
2095 | TYPE_MAIN_VARIANT (new_type) = t; | |
2096 | TYPE_NEXT_VARIANT (new_type) = TYPE_NEXT_VARIANT (t); | |
2097 | TYPE_NEXT_VARIANT (t) = new_type; | |
2098 | } | |
2099 | else | |
2100 | { | |
2101 | TYPE_MAIN_VARIANT (new_type) = new_type; | |
2102 | TYPE_NEXT_VARIANT (new_type) = NULL; | |
2103 | } | |
2104 | ||
2105 | TREE_TYPE (fndecl) = new_type; | |
2106 | if (otypes) | |
2107 | VEC_free (tree, heap, otypes); | |
2108 | VEC_free (tree, heap, oparms); | |
2109 | } | |
2110 | ||
2111 | /* Modify actual arguments of a function call CS as indicated in ADJUSTMENTS. | |
2112 | If this is a directly recursive call, CS must be NULL. Otherwise it must | |
2113 | contain the corresponding call graph edge. */ | |
2114 | ||
2115 | void | |
2116 | ipa_modify_call_arguments (struct cgraph_edge *cs, gimple stmt, | |
2117 | ipa_parm_adjustment_vec adjustments) | |
2118 | { | |
2119 | VEC(tree, heap) *vargs; | |
2120 | gimple new_stmt; | |
2121 | gimple_stmt_iterator gsi; | |
2122 | tree callee_decl; | |
2123 | int i, len; | |
2124 | ||
2125 | len = VEC_length (ipa_parm_adjustment_t, adjustments); | |
2126 | vargs = VEC_alloc (tree, heap, len); | |
2127 | ||
2128 | gsi = gsi_for_stmt (stmt); | |
2129 | for (i = 0; i < len; i++) | |
2130 | { | |
2131 | struct ipa_parm_adjustment *adj; | |
2132 | ||
2133 | adj = VEC_index (ipa_parm_adjustment_t, adjustments, i); | |
2134 | ||
2135 | if (adj->copy_param) | |
2136 | { | |
2137 | tree arg = gimple_call_arg (stmt, adj->base_index); | |
2138 | ||
2139 | VEC_quick_push (tree, vargs, arg); | |
2140 | } | |
2141 | else if (!adj->remove_param) | |
2142 | { | |
2143 | tree expr, orig_expr; | |
2144 | bool allow_ptr, repl_found; | |
2145 | ||
2146 | orig_expr = expr = gimple_call_arg (stmt, adj->base_index); | |
2147 | if (TREE_CODE (expr) == ADDR_EXPR) | |
2148 | { | |
2149 | allow_ptr = false; | |
2150 | expr = TREE_OPERAND (expr, 0); | |
2151 | } | |
2152 | else | |
2153 | allow_ptr = true; | |
2154 | ||
2155 | repl_found = build_ref_for_offset (&expr, TREE_TYPE (expr), | |
2156 | adj->offset, adj->type, | |
2157 | allow_ptr); | |
2158 | if (repl_found) | |
2159 | { | |
2160 | if (adj->by_ref) | |
2161 | expr = build_fold_addr_expr (expr); | |
2162 | } | |
2163 | else | |
2164 | { | |
2165 | tree ptrtype = build_pointer_type (adj->type); | |
2166 | expr = orig_expr; | |
2167 | if (!POINTER_TYPE_P (TREE_TYPE (expr))) | |
2168 | expr = build_fold_addr_expr (expr); | |
2169 | if (!useless_type_conversion_p (ptrtype, TREE_TYPE (expr))) | |
2170 | expr = fold_convert (ptrtype, expr); | |
2171 | expr = fold_build2 (POINTER_PLUS_EXPR, ptrtype, expr, | |
3b9e5d95 | 2172 | build_int_cst (sizetype, |
3f84bf08 MJ |
2173 | adj->offset / BITS_PER_UNIT)); |
2174 | if (!adj->by_ref) | |
2175 | expr = fold_build1 (INDIRECT_REF, adj->type, expr); | |
2176 | } | |
2177 | expr = force_gimple_operand_gsi (&gsi, expr, | |
2178 | adj->by_ref | |
2179 | || is_gimple_reg_type (adj->type), | |
2180 | NULL, true, GSI_SAME_STMT); | |
2181 | VEC_quick_push (tree, vargs, expr); | |
2182 | } | |
2183 | } | |
2184 | ||
2185 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2186 | { | |
2187 | fprintf (dump_file, "replacing stmt:"); | |
2188 | print_gimple_stmt (dump_file, gsi_stmt (gsi), 0, 0); | |
2189 | } | |
2190 | ||
2191 | callee_decl = !cs ? gimple_call_fndecl (stmt) : cs->callee->decl; | |
2192 | new_stmt = gimple_build_call_vec (callee_decl, vargs); | |
2193 | VEC_free (tree, heap, vargs); | |
2194 | if (gimple_call_lhs (stmt)) | |
2195 | gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt)); | |
2196 | ||
2197 | gimple_set_block (new_stmt, gimple_block (stmt)); | |
2198 | if (gimple_has_location (stmt)) | |
2199 | gimple_set_location (new_stmt, gimple_location (stmt)); | |
2200 | gimple_call_copy_flags (new_stmt, stmt); | |
2201 | gimple_call_set_chain (new_stmt, gimple_call_chain (stmt)); | |
2202 | ||
2203 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2204 | { | |
2205 | fprintf (dump_file, "with stmt:"); | |
2206 | print_gimple_stmt (dump_file, new_stmt, 0, 0); | |
2207 | fprintf (dump_file, "\n"); | |
2208 | } | |
2209 | gsi_replace (&gsi, new_stmt, true); | |
2210 | if (cs) | |
2211 | cgraph_set_call_stmt (cs, new_stmt); | |
2212 | update_ssa (TODO_update_ssa); | |
2213 | free_dominance_info (CDI_DOMINATORS); | |
2214 | } | |
2215 | ||
2216 | /* Return true iff BASE_INDEX is in ADJUSTMENTS more than once. */ | |
2217 | ||
2218 | static bool | |
2219 | index_in_adjustments_multiple_times_p (int base_index, | |
2220 | ipa_parm_adjustment_vec adjustments) | |
2221 | { | |
2222 | int i, len = VEC_length (ipa_parm_adjustment_t, adjustments); | |
2223 | bool one = false; | |
2224 | ||
2225 | for (i = 0; i < len; i++) | |
2226 | { | |
2227 | struct ipa_parm_adjustment *adj; | |
2228 | adj = VEC_index (ipa_parm_adjustment_t, adjustments, i); | |
2229 | ||
2230 | if (adj->base_index == base_index) | |
2231 | { | |
2232 | if (one) | |
2233 | return true; | |
2234 | else | |
2235 | one = true; | |
2236 | } | |
2237 | } | |
2238 | return false; | |
2239 | } | |
2240 | ||
2241 | ||
2242 | /* Return adjustments that should have the same effect on function parameters | |
2243 | and call arguments as if they were first changed according to adjustments in | |
2244 | INNER and then by adjustments in OUTER. */ | |
2245 | ||
2246 | ipa_parm_adjustment_vec | |
2247 | ipa_combine_adjustments (ipa_parm_adjustment_vec inner, | |
2248 | ipa_parm_adjustment_vec outer) | |
2249 | { | |
2250 | int i, outlen = VEC_length (ipa_parm_adjustment_t, outer); | |
2251 | int inlen = VEC_length (ipa_parm_adjustment_t, inner); | |
2252 | int removals = 0; | |
2253 | ipa_parm_adjustment_vec adjustments, tmp; | |
2254 | ||
2255 | tmp = VEC_alloc (ipa_parm_adjustment_t, heap, inlen); | |
2256 | for (i = 0; i < inlen; i++) | |
2257 | { | |
2258 | struct ipa_parm_adjustment *n; | |
2259 | n = VEC_index (ipa_parm_adjustment_t, inner, i); | |
2260 | ||
2261 | if (n->remove_param) | |
2262 | removals++; | |
2263 | else | |
2264 | VEC_quick_push (ipa_parm_adjustment_t, tmp, n); | |
2265 | } | |
2266 | ||
2267 | adjustments = VEC_alloc (ipa_parm_adjustment_t, heap, outlen + removals); | |
2268 | for (i = 0; i < outlen; i++) | |
2269 | { | |
2270 | struct ipa_parm_adjustment *r; | |
2271 | struct ipa_parm_adjustment *out = VEC_index (ipa_parm_adjustment_t, | |
2272 | outer, i); | |
2273 | struct ipa_parm_adjustment *in = VEC_index (ipa_parm_adjustment_t, tmp, | |
2274 | out->base_index); | |
2275 | ||
2276 | gcc_assert (!in->remove_param); | |
2277 | if (out->remove_param) | |
2278 | { | |
2279 | if (!index_in_adjustments_multiple_times_p (in->base_index, tmp)) | |
2280 | { | |
2281 | r = VEC_quick_push (ipa_parm_adjustment_t, adjustments, NULL); | |
2282 | memset (r, 0, sizeof (*r)); | |
2283 | r->remove_param = true; | |
2284 | } | |
2285 | continue; | |
2286 | } | |
2287 | ||
2288 | r = VEC_quick_push (ipa_parm_adjustment_t, adjustments, NULL); | |
2289 | memset (r, 0, sizeof (*r)); | |
2290 | r->base_index = in->base_index; | |
2291 | r->type = out->type; | |
2292 | ||
2293 | /* FIXME: Create nonlocal value too. */ | |
2294 | ||
2295 | if (in->copy_param && out->copy_param) | |
2296 | r->copy_param = true; | |
2297 | else if (in->copy_param) | |
2298 | r->offset = out->offset; | |
2299 | else if (out->copy_param) | |
2300 | r->offset = in->offset; | |
2301 | else | |
2302 | r->offset = in->offset + out->offset; | |
2303 | } | |
2304 | ||
2305 | for (i = 0; i < inlen; i++) | |
2306 | { | |
2307 | struct ipa_parm_adjustment *n = VEC_index (ipa_parm_adjustment_t, | |
2308 | inner, i); | |
2309 | ||
2310 | if (n->remove_param) | |
2311 | VEC_quick_push (ipa_parm_adjustment_t, adjustments, n); | |
2312 | } | |
2313 | ||
2314 | VEC_free (ipa_parm_adjustment_t, heap, tmp); | |
2315 | return adjustments; | |
2316 | } | |
2317 | ||
2318 | /* Dump the adjustments in the vector ADJUSTMENTS to dump_file in a human | |
2319 | friendly way, assuming they are meant to be applied to FNDECL. */ | |
2320 | ||
2321 | void | |
2322 | ipa_dump_param_adjustments (FILE *file, ipa_parm_adjustment_vec adjustments, | |
2323 | tree fndecl) | |
2324 | { | |
2325 | int i, len = VEC_length (ipa_parm_adjustment_t, adjustments); | |
2326 | bool first = true; | |
2327 | VEC(tree, heap) *parms = ipa_get_vector_of_formal_parms (fndecl); | |
2328 | ||
2329 | fprintf (file, "IPA param adjustments: "); | |
2330 | for (i = 0; i < len; i++) | |
2331 | { | |
2332 | struct ipa_parm_adjustment *adj; | |
2333 | adj = VEC_index (ipa_parm_adjustment_t, adjustments, i); | |
2334 | ||
2335 | if (!first) | |
2336 | fprintf (file, " "); | |
2337 | else | |
2338 | first = false; | |
2339 | ||
2340 | fprintf (file, "%i. base_index: %i - ", i, adj->base_index); | |
2341 | print_generic_expr (file, VEC_index (tree, parms, adj->base_index), 0); | |
2342 | if (adj->base) | |
2343 | { | |
2344 | fprintf (file, ", base: "); | |
2345 | print_generic_expr (file, adj->base, 0); | |
2346 | } | |
2347 | if (adj->reduction) | |
2348 | { | |
2349 | fprintf (file, ", reduction: "); | |
2350 | print_generic_expr (file, adj->reduction, 0); | |
2351 | } | |
2352 | if (adj->new_ssa_base) | |
2353 | { | |
2354 | fprintf (file, ", new_ssa_base: "); | |
2355 | print_generic_expr (file, adj->new_ssa_base, 0); | |
2356 | } | |
2357 | ||
2358 | if (adj->copy_param) | |
2359 | fprintf (file, ", copy_param"); | |
2360 | else if (adj->remove_param) | |
2361 | fprintf (file, ", remove_param"); | |
2362 | else | |
2363 | fprintf (file, ", offset %li", (long) adj->offset); | |
2364 | if (adj->by_ref) | |
2365 | fprintf (file, ", by_ref"); | |
2366 | print_node_brief (file, ", type: ", adj->type, 0); | |
2367 | fprintf (file, "\n"); | |
2368 | } | |
2369 | VEC_free (tree, heap, parms); | |
2370 | } | |
2371 | ||
fb3f88cc JH |
2372 | /* Stream out jump function JUMP_FUNC to OB. */ |
2373 | ||
2374 | static void | |
2375 | ipa_write_jump_function (struct output_block *ob, | |
2376 | struct ipa_jump_func *jump_func) | |
2377 | { | |
2378 | lto_output_uleb128_stream (ob->main_stream, | |
2379 | jump_func->type); | |
2380 | ||
2381 | switch (jump_func->type) | |
2382 | { | |
2383 | case IPA_JF_UNKNOWN: | |
2384 | break; | |
b258210c MJ |
2385 | case IPA_JF_KNOWN_TYPE: |
2386 | lto_output_tree (ob, jump_func->value.base_binfo, true); | |
2387 | break; | |
fb3f88cc JH |
2388 | case IPA_JF_CONST: |
2389 | lto_output_tree (ob, jump_func->value.constant, true); | |
2390 | break; | |
2391 | case IPA_JF_PASS_THROUGH: | |
2392 | lto_output_tree (ob, jump_func->value.pass_through.operand, true); | |
2393 | lto_output_uleb128_stream (ob->main_stream, | |
2394 | jump_func->value.pass_through.formal_id); | |
2395 | lto_output_uleb128_stream (ob->main_stream, | |
2396 | jump_func->value.pass_through.operation); | |
2397 | break; | |
2398 | case IPA_JF_ANCESTOR: | |
2399 | lto_output_uleb128_stream (ob->main_stream, | |
2400 | jump_func->value.ancestor.offset); | |
2401 | lto_output_tree (ob, jump_func->value.ancestor.type, true); | |
2402 | lto_output_uleb128_stream (ob->main_stream, | |
2403 | jump_func->value.ancestor.formal_id); | |
2404 | break; | |
2405 | case IPA_JF_CONST_MEMBER_PTR: | |
2406 | lto_output_tree (ob, jump_func->value.member_cst.pfn, true); | |
2407 | lto_output_tree (ob, jump_func->value.member_cst.delta, false); | |
2408 | break; | |
2409 | } | |
2410 | } | |
2411 | ||
2412 | /* Read in jump function JUMP_FUNC from IB. */ | |
2413 | ||
2414 | static void | |
2415 | ipa_read_jump_function (struct lto_input_block *ib, | |
2416 | struct ipa_jump_func *jump_func, | |
2417 | struct data_in *data_in) | |
2418 | { | |
2419 | jump_func->type = (enum jump_func_type) lto_input_uleb128 (ib); | |
2420 | ||
2421 | switch (jump_func->type) | |
2422 | { | |
2423 | case IPA_JF_UNKNOWN: | |
2424 | break; | |
b258210c MJ |
2425 | case IPA_JF_KNOWN_TYPE: |
2426 | jump_func->value.base_binfo = lto_input_tree (ib, data_in); | |
2427 | break; | |
fb3f88cc JH |
2428 | case IPA_JF_CONST: |
2429 | jump_func->value.constant = lto_input_tree (ib, data_in); | |
2430 | break; | |
2431 | case IPA_JF_PASS_THROUGH: | |
2432 | jump_func->value.pass_through.operand = lto_input_tree (ib, data_in); | |
2433 | jump_func->value.pass_through.formal_id = lto_input_uleb128 (ib); | |
2434 | jump_func->value.pass_through.operation = (enum tree_code) lto_input_uleb128 (ib); | |
2435 | break; | |
2436 | case IPA_JF_ANCESTOR: | |
2437 | jump_func->value.ancestor.offset = lto_input_uleb128 (ib); | |
2438 | jump_func->value.ancestor.type = lto_input_tree (ib, data_in); | |
2439 | jump_func->value.ancestor.formal_id = lto_input_uleb128 (ib); | |
2440 | break; | |
2441 | case IPA_JF_CONST_MEMBER_PTR: | |
2442 | jump_func->value.member_cst.pfn = lto_input_tree (ib, data_in); | |
2443 | jump_func->value.member_cst.delta = lto_input_tree (ib, data_in); | |
2444 | break; | |
2445 | } | |
2446 | } | |
2447 | ||
e33c6cd6 MJ |
2448 | /* Stream out parts of cgraph_indirect_call_info corresponding to CS that are |
2449 | relevant to indirect inlining to OB. */ | |
661e7330 MJ |
2450 | |
2451 | static void | |
e33c6cd6 MJ |
2452 | ipa_write_indirect_edge_info (struct output_block *ob, |
2453 | struct cgraph_edge *cs) | |
661e7330 | 2454 | { |
e33c6cd6 | 2455 | struct cgraph_indirect_call_info *ii = cs->indirect_info; |
2465dcc2 | 2456 | struct bitpack_d bp; |
e33c6cd6 MJ |
2457 | |
2458 | lto_output_sleb128_stream (ob->main_stream, ii->param_index); | |
b258210c | 2459 | lto_output_sleb128_stream (ob->main_stream, ii->anc_offset); |
2465dcc2 RG |
2460 | bp = bitpack_create (ob->main_stream); |
2461 | bp_pack_value (&bp, ii->polymorphic, 1); | |
2462 | lto_output_bitpack (&bp); | |
b258210c MJ |
2463 | |
2464 | if (ii->polymorphic) | |
2465 | { | |
2466 | lto_output_sleb128_stream (ob->main_stream, ii->otr_token); | |
2467 | lto_output_tree (ob, ii->otr_type, true); | |
2468 | } | |
661e7330 MJ |
2469 | } |
2470 | ||
e33c6cd6 MJ |
2471 | /* Read in parts of cgraph_indirect_call_info corresponding to CS that are |
2472 | relevant to indirect inlining from IB. */ | |
661e7330 MJ |
2473 | |
2474 | static void | |
e33c6cd6 MJ |
2475 | ipa_read_indirect_edge_info (struct lto_input_block *ib, |
2476 | struct data_in *data_in ATTRIBUTE_UNUSED, | |
2477 | struct cgraph_edge *cs) | |
661e7330 | 2478 | { |
e33c6cd6 | 2479 | struct cgraph_indirect_call_info *ii = cs->indirect_info; |
2465dcc2 | 2480 | struct bitpack_d bp; |
661e7330 | 2481 | |
e33c6cd6 | 2482 | ii->param_index = (int) lto_input_sleb128 (ib); |
b258210c MJ |
2483 | ii->anc_offset = (HOST_WIDE_INT) lto_input_sleb128 (ib); |
2484 | bp = lto_input_bitpack (ib); | |
2465dcc2 | 2485 | ii->polymorphic = bp_unpack_value (&bp, 1); |
b258210c MJ |
2486 | if (ii->polymorphic) |
2487 | { | |
2488 | ii->otr_token = (HOST_WIDE_INT) lto_input_sleb128 (ib); | |
2489 | ii->otr_type = lto_input_tree (ib, data_in); | |
2490 | } | |
661e7330 MJ |
2491 | } |
2492 | ||
fb3f88cc JH |
2493 | /* Stream out NODE info to OB. */ |
2494 | ||
2495 | static void | |
2496 | ipa_write_node_info (struct output_block *ob, struct cgraph_node *node) | |
2497 | { | |
2498 | int node_ref; | |
2499 | lto_cgraph_encoder_t encoder; | |
2500 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
2501 | int j; | |
2502 | struct cgraph_edge *e; | |
2465dcc2 | 2503 | struct bitpack_d bp; |
fb3f88cc JH |
2504 | |
2505 | encoder = ob->decl_state->cgraph_node_encoder; | |
2506 | node_ref = lto_cgraph_encoder_encode (encoder, node); | |
2507 | lto_output_uleb128_stream (ob->main_stream, node_ref); | |
2508 | ||
2465dcc2 RG |
2509 | bp = bitpack_create (ob->main_stream); |
2510 | bp_pack_value (&bp, info->called_with_var_arguments, 1); | |
062c604f | 2511 | gcc_assert (info->uses_analysis_done |
661e7330 | 2512 | || ipa_get_param_count (info) == 0); |
fb3f88cc JH |
2513 | gcc_assert (!info->node_enqueued); |
2514 | gcc_assert (!info->ipcp_orig_node); | |
2515 | for (j = 0; j < ipa_get_param_count (info); j++) | |
062c604f | 2516 | bp_pack_value (&bp, info->params[j].used, 1); |
2465dcc2 | 2517 | lto_output_bitpack (&bp); |
fb3f88cc JH |
2518 | for (e = node->callees; e; e = e->next_callee) |
2519 | { | |
2520 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
2521 | ||
661e7330 MJ |
2522 | lto_output_uleb128_stream (ob->main_stream, |
2523 | ipa_get_cs_argument_count (args)); | |
fb3f88cc JH |
2524 | for (j = 0; j < ipa_get_cs_argument_count (args); j++) |
2525 | ipa_write_jump_function (ob, ipa_get_ith_jump_func (args, j)); | |
2526 | } | |
e33c6cd6 MJ |
2527 | for (e = node->indirect_calls; e; e = e->next_callee) |
2528 | ipa_write_indirect_edge_info (ob, e); | |
fb3f88cc JH |
2529 | } |
2530 | ||
2531 | /* Srtream in NODE info from IB. */ | |
2532 | ||
2533 | static void | |
2534 | ipa_read_node_info (struct lto_input_block *ib, struct cgraph_node *node, | |
2535 | struct data_in *data_in) | |
2536 | { | |
2537 | struct ipa_node_params *info = IPA_NODE_REF (node); | |
2538 | int k; | |
2539 | struct cgraph_edge *e; | |
2465dcc2 | 2540 | struct bitpack_d bp; |
fb3f88cc JH |
2541 | |
2542 | ipa_initialize_node_params (node); | |
2543 | ||
fb3f88cc | 2544 | bp = lto_input_bitpack (ib); |
2465dcc2 | 2545 | info->called_with_var_arguments = bp_unpack_value (&bp, 1); |
fb3f88cc | 2546 | if (ipa_get_param_count (info) != 0) |
062c604f | 2547 | info->uses_analysis_done = true; |
fb3f88cc JH |
2548 | info->node_enqueued = false; |
2549 | for (k = 0; k < ipa_get_param_count (info); k++) | |
062c604f | 2550 | info->params[k].used = bp_unpack_value (&bp, 1); |
fb3f88cc JH |
2551 | for (e = node->callees; e; e = e->next_callee) |
2552 | { | |
2553 | struct ipa_edge_args *args = IPA_EDGE_REF (e); | |
2554 | int count = lto_input_uleb128 (ib); | |
2555 | ||
fb3f88cc JH |
2556 | ipa_set_cs_argument_count (args, count); |
2557 | if (!count) | |
2558 | continue; | |
2559 | ||
a9429e29 LB |
2560 | args->jump_functions = ggc_alloc_cleared_vec_ipa_jump_func |
2561 | (ipa_get_cs_argument_count (args)); | |
fb3f88cc JH |
2562 | for (k = 0; k < ipa_get_cs_argument_count (args); k++) |
2563 | ipa_read_jump_function (ib, ipa_get_ith_jump_func (args, k), data_in); | |
2564 | } | |
e33c6cd6 MJ |
2565 | for (e = node->indirect_calls; e; e = e->next_callee) |
2566 | ipa_read_indirect_edge_info (ib, data_in, e); | |
fb3f88cc JH |
2567 | } |
2568 | ||
2569 | /* Write jump functions for nodes in SET. */ | |
2570 | ||
2571 | void | |
2572 | ipa_prop_write_jump_functions (cgraph_node_set set) | |
2573 | { | |
2574 | struct cgraph_node *node; | |
2575 | struct output_block *ob = create_output_block (LTO_section_jump_functions); | |
2576 | unsigned int count = 0; | |
2577 | cgraph_node_set_iterator csi; | |
2578 | ||
2579 | ob->cgraph_node = NULL; | |
2580 | ||
2581 | for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi)) | |
2582 | { | |
2583 | node = csi_node (csi); | |
2584 | if (node->analyzed && IPA_NODE_REF (node) != NULL) | |
2585 | count++; | |
2586 | } | |
2587 | ||
2588 | lto_output_uleb128_stream (ob->main_stream, count); | |
2589 | ||
2590 | /* Process all of the functions. */ | |
2591 | for (csi = csi_start (set); !csi_end_p (csi); csi_next (&csi)) | |
2592 | { | |
2593 | node = csi_node (csi); | |
2594 | if (node->analyzed && IPA_NODE_REF (node) != NULL) | |
2595 | ipa_write_node_info (ob, node); | |
2596 | } | |
2597 | lto_output_1_stream (ob->main_stream, 0); | |
2598 | produce_asm (ob, NULL); | |
2599 | destroy_output_block (ob); | |
2600 | } | |
2601 | ||
2602 | /* Read section in file FILE_DATA of length LEN with data DATA. */ | |
2603 | ||
2604 | static void | |
2605 | ipa_prop_read_section (struct lto_file_decl_data *file_data, const char *data, | |
2606 | size_t len) | |
2607 | { | |
2608 | const struct lto_function_header *header = | |
2609 | (const struct lto_function_header *) data; | |
2610 | const int32_t cfg_offset = sizeof (struct lto_function_header); | |
2611 | const int32_t main_offset = cfg_offset + header->cfg_size; | |
2612 | const int32_t string_offset = main_offset + header->main_size; | |
2613 | struct data_in *data_in; | |
2614 | struct lto_input_block ib_main; | |
2615 | unsigned int i; | |
2616 | unsigned int count; | |
2617 | ||
2618 | LTO_INIT_INPUT_BLOCK (ib_main, (const char *) data + main_offset, 0, | |
2619 | header->main_size); | |
2620 | ||
2621 | data_in = | |
2622 | lto_data_in_create (file_data, (const char *) data + string_offset, | |
2623 | header->string_size, NULL); | |
2624 | count = lto_input_uleb128 (&ib_main); | |
2625 | ||
2626 | for (i = 0; i < count; i++) | |
2627 | { | |
2628 | unsigned int index; | |
2629 | struct cgraph_node *node; | |
2630 | lto_cgraph_encoder_t encoder; | |
2631 | ||
2632 | index = lto_input_uleb128 (&ib_main); | |
2633 | encoder = file_data->cgraph_node_encoder; | |
2634 | node = lto_cgraph_encoder_deref (encoder, index); | |
9b3cf76a | 2635 | gcc_assert (node->analyzed); |
fb3f88cc JH |
2636 | ipa_read_node_info (&ib_main, node, data_in); |
2637 | } | |
2638 | lto_free_section_data (file_data, LTO_section_jump_functions, NULL, data, | |
2639 | len); | |
2640 | lto_data_in_delete (data_in); | |
2641 | } | |
2642 | ||
2643 | /* Read ipcp jump functions. */ | |
2644 | ||
2645 | void | |
2646 | ipa_prop_read_jump_functions (void) | |
2647 | { | |
2648 | struct lto_file_decl_data **file_data_vec = lto_get_file_decl_data (); | |
2649 | struct lto_file_decl_data *file_data; | |
2650 | unsigned int j = 0; | |
2651 | ||
2652 | ipa_check_create_node_params (); | |
2653 | ipa_check_create_edge_args (); | |
2654 | ipa_register_cgraph_hooks (); | |
2655 | ||
2656 | while ((file_data = file_data_vec[j++])) | |
2657 | { | |
2658 | size_t len; | |
2659 | const char *data = lto_get_section_data (file_data, LTO_section_jump_functions, NULL, &len); | |
2660 | ||
2661 | if (data) | |
2662 | ipa_prop_read_section (file_data, data, len); | |
2663 | } | |
2664 | } | |
2665 | ||
b8698a0f | 2666 | /* After merging units, we can get mismatch in argument counts. |
fb3f88cc JH |
2667 | Also decl merging might've rendered parameter lists obsolette. |
2668 | Also compute called_with_variable_arg info. */ | |
2669 | ||
2670 | void | |
2671 | ipa_update_after_lto_read (void) | |
2672 | { | |
2673 | struct cgraph_node *node; | |
2674 | struct cgraph_edge *cs; | |
2675 | ||
05d3aa37 MJ |
2676 | ipa_check_create_node_params (); |
2677 | ipa_check_create_edge_args (); | |
2678 | ||
fb3f88cc | 2679 | for (node = cgraph_nodes; node; node = node->next) |
563cb662 | 2680 | if (node->analyzed) |
05d3aa37 | 2681 | ipa_initialize_node_params (node); |
563cb662 MJ |
2682 | |
2683 | for (node = cgraph_nodes; node; node = node->next) | |
2684 | if (node->analyzed) | |
fb3f88cc JH |
2685 | for (cs = node->callees; cs; cs = cs->next_callee) |
2686 | { | |
2687 | if (ipa_get_cs_argument_count (IPA_EDGE_REF (cs)) | |
2688 | != ipa_get_param_count (IPA_NODE_REF (cs->callee))) | |
2689 | ipa_set_called_with_variable_arg (IPA_NODE_REF (cs->callee)); | |
2690 | } | |
fb3f88cc | 2691 | } |