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