Line data Source code
1 : // Implementation of instruction-related RTL SSA functions -*- C++ -*-
2 : // Copyright (C) 2020-2026 Free Software Foundation, Inc.
3 : //
4 : // This file is part of GCC.
5 : //
6 : // GCC is free software; you can redistribute it and/or modify it under
7 : // the terms of the GNU General Public License as published by the Free
8 : // Software Foundation; either version 3, or (at your option) any later
9 : // version.
10 : //
11 : // GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 : // WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 : // FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 : // for more details.
15 : //
16 : // You should have received a copy of the GNU General Public License
17 : // along with GCC; see the file COPYING3. If not see
18 : // <http://www.gnu.org/licenses/>.
19 :
20 : #define INCLUDE_ALGORITHM
21 : #define INCLUDE_FUNCTIONAL
22 : #define INCLUDE_ARRAY
23 : #include "config.h"
24 : #include "system.h"
25 : #include "coretypes.h"
26 : #include "backend.h"
27 : #include "rtl.h"
28 : #include "df.h"
29 : #include "rtl-ssa.h"
30 : #include "rtl-ssa/internals.h"
31 : #include "rtl-ssa/internals.inl"
32 : #include "predict.h"
33 : #include "print-rtl.h"
34 : #include "rtl-iter.h"
35 :
36 : using namespace rtl_ssa;
37 :
38 : // The gap to leave between program points when building up the list
39 : // of instructions for the first time. Using 2 allows an instruction
40 : // to be inserted between two others without resorting to splay tree
41 : // ordering. Using 0 is useful as a debugging aid to stress the
42 : // splay tree code.
43 : static const unsigned int POINT_INCREASE = 2;
44 :
45 : // Calculate and record the cost of the instruction, based on the
46 : // form it had before any in-progress changes were made.
47 : void
48 14347543 : insn_info::calculate_cost () const
49 : {
50 14347543 : basic_block cfg_bb = BLOCK_FOR_INSN (m_rtl);
51 14347543 : undo_recog_changes (0);
52 14347543 : if (INSN_CODE (m_rtl) == NOOP_MOVE_INSN_CODE)
53 : // insn_cost also uses 0 to mean "don't know". Callers that
54 : // want to distinguish the cases will need to check INSN_CODE.
55 299 : m_cost_or_uid = 0;
56 : else
57 14347244 : m_cost_or_uid = insn_cost (m_rtl, optimize_bb_for_speed_p (cfg_bb));
58 14347543 : }
59 :
60 : // Add NOTE to the instruction's notes.
61 : void
62 25200489 : insn_info::add_note (insn_note *note)
63 : {
64 25200489 : insn_note **ptr = &m_first_note;
65 : // Always put the order node first, since it's the one that's likely
66 : // to be used most often.
67 25200489 : if (*ptr && (*ptr)->kind () == insn_note_kind::ORDER_NODE)
68 0 : ptr = &(*ptr)->m_next_note;
69 25200489 : note->m_next_note = *ptr;
70 25200489 : *ptr = note;
71 25200489 : }
72 :
73 : // Remove NOTE from the instruction's notes.
74 : void
75 1235 : insn_info::remove_note (insn_note *note)
76 : {
77 1235 : insn_note **ptr = &m_first_note;
78 1235 : while (*ptr != note)
79 0 : ptr = &(*ptr)->m_next_note;
80 1235 : *ptr = note->m_next_note;
81 1235 : }
82 :
83 : // Implement compare_with for the case in which this insn and OTHER
84 : // have the same program point.
85 : int
86 855 : insn_info::slow_compare_with (const insn_info &other) const
87 : {
88 855 : return order_splay_tree::compare_nodes (get_known_order_node (),
89 855 : other.get_known_order_node ());
90 : }
91 :
92 : // Print insn uid UID to PP, where UID has the same form as insn_info::uid.
93 : void
94 0 : insn_info::print_uid (pretty_printer *pp, int uid)
95 : {
96 0 : char tmp[3 * sizeof (uid) + 2];
97 0 : if (uid < 0)
98 : // An artificial instruction.
99 0 : snprintf (tmp, sizeof (tmp), "a%d", -uid);
100 : else
101 : // A real RTL instruction.
102 0 : snprintf (tmp, sizeof (tmp), "i%d", uid);
103 0 : pp_string (pp, tmp);
104 0 : }
105 :
106 : // See comment above declaration.
107 : void
108 0 : insn_info::print_identifier (pretty_printer *pp) const
109 : {
110 0 : print_uid (pp, uid ());
111 0 : }
112 :
113 : // See comment above declaration.
114 : void
115 0 : insn_info::print_location (pretty_printer *pp) const
116 : {
117 0 : if (bb_info *bb = this->bb ())
118 : {
119 0 : ebb_info *ebb = bb->ebb ();
120 0 : if (ebb && is_phi ())
121 0 : ebb->print_identifier (pp);
122 : else
123 0 : bb->print_identifier (pp);
124 0 : pp_string (pp, " at point ");
125 0 : pp_decimal_int (pp, m_point);
126 : }
127 : else
128 0 : pp_string (pp, "<unknown location>");
129 0 : }
130 :
131 : // See comment above declaration.
132 : void
133 0 : insn_info::print_identifier_and_location (pretty_printer *pp) const
134 : {
135 0 : if (m_is_asm)
136 0 : pp_string (pp, "asm ");
137 0 : if (m_is_debug_insn)
138 0 : pp_string (pp, "debug ");
139 0 : pp_string (pp, "insn ");
140 0 : print_identifier (pp);
141 0 : pp_string (pp, " in ");
142 0 : print_location (pp);
143 0 : }
144 :
145 : // See comment above declaration.
146 : void
147 0 : insn_info::print_full (pretty_printer *pp) const
148 : {
149 0 : print_identifier_and_location (pp);
150 0 : pp_colon (pp);
151 0 : if (is_real ())
152 : {
153 0 : pp_newline_and_indent (pp, 2);
154 0 : if (has_been_deleted ())
155 0 : pp_string (pp, "deleted");
156 : else
157 : {
158 : // Print the insn pattern to a temporary printer.
159 0 : pretty_printer sub_pp;
160 0 : print_insn_with_notes (&sub_pp, rtl ());
161 0 : const char *text = pp_formatted_text (&sub_pp);
162 :
163 : // Calculate the length of the maximum line in the pattern.
164 0 : unsigned int max_len = 0;
165 0 : const char *start = text;
166 0 : while (const char *end = strchr (start, '\n'))
167 : {
168 0 : max_len = MAX (max_len, (unsigned int) (end - start));
169 0 : start = end + 1;
170 0 : }
171 :
172 : // Print a separator before or after the pattern.
173 0 : auto print_top_bottom = [&]()
174 : {
175 0 : pp_character (pp, '+');
176 0 : for (unsigned int i = 0; i < max_len + 2; ++i)
177 0 : pp_character (pp, '-');
178 0 : };
179 :
180 0 : print_top_bottom ();
181 0 : start = text;
182 0 : while (const char *end = strchr (start, '\n'))
183 : {
184 0 : pp_newline_and_indent (pp, 0);
185 0 : pp_character (pp, '|');
186 : // Each line of the pattern already starts with a space.
187 : // so we don't need to add another one here.
188 0 : pp_append_text (pp, start, end);
189 0 : start = end + 1;
190 0 : }
191 0 : pp_newline_and_indent (pp, 0);
192 0 : print_top_bottom ();
193 :
194 0 : if (m_cost_or_uid != UNKNOWN_COST)
195 : {
196 0 : pp_newline_and_indent (pp, 0);
197 0 : pp_string (pp, "cost: ");
198 0 : pp_decimal_int (pp, m_cost_or_uid);
199 : }
200 0 : if (m_has_pre_post_modify)
201 : {
202 0 : pp_newline_and_indent (pp, 0);
203 0 : pp_string (pp, "has pre/post-modify operations");
204 : }
205 0 : if (m_has_volatile_refs)
206 : {
207 0 : pp_newline_and_indent (pp, 0);
208 0 : pp_string (pp, "has volatile refs");
209 : }
210 0 : if (m_is_temp)
211 : {
212 0 : pp_newline_and_indent (pp, 0);
213 0 : pp_string (pp, "temporary");
214 : }
215 0 : }
216 0 : pp_indentation (pp) -= 2;
217 : }
218 :
219 0 : auto print_accesses = [&](const char *heading, access_array accesses,
220 : unsigned int flags)
221 : {
222 0 : if (!accesses.empty ())
223 : {
224 0 : pp_newline_and_indent (pp, 2);
225 0 : pp_string (pp, heading);
226 0 : pp_newline_and_indent (pp, 2);
227 0 : pp_accesses (pp, accesses, flags);
228 0 : pp_indentation (pp) -= 4;
229 : }
230 0 : };
231 :
232 0 : print_accesses ("uses:", uses (), PP_ACCESS_USER);
233 0 : auto *call_clobbers_note = find_note<insn_call_clobbers_note> ();
234 0 : if (call_clobbers_note)
235 : {
236 0 : pp_newline_and_indent (pp, 2);
237 0 : pp_string (pp, "has call clobbers for ABI ");
238 0 : pp_decimal_int (pp, call_clobbers_note->abi_id ());
239 0 : pp_indentation (pp) -= 2;
240 : }
241 0 : print_accesses ("defines:", defs (), PP_ACCESS_SETTER);
242 0 : if (num_uses () == 0 && !call_clobbers_note && num_defs () == 0)
243 : {
244 0 : pp_newline_and_indent (pp, 2);
245 0 : pp_string (pp, "has no uses or defs");
246 0 : pp_indentation (pp) -= 2;
247 : }
248 :
249 0 : if (order_node *node = get_order_node ())
250 : {
251 0 : while (node->m_parent)
252 : node = node->m_parent;
253 :
254 0 : pp_newline_and_indent (pp, 2);
255 0 : pp_string (pp, "insn order: ");
256 0 : pp_newline_and_indent (pp, 2);
257 0 : auto print_order = [](pretty_printer *pp, order_node *node)
258 : {
259 0 : print_uid (pp, node->uid ());
260 : };
261 0 : order_splay_tree::print (pp, node, print_order);
262 0 : pp_indentation (pp) -= 4;
263 : }
264 0 : }
265 :
266 : // Return an insn_info::order_node for INSN, creating one if necessary.
267 : insn_info::order_node *
268 1846 : function_info::need_order_node (insn_info *insn)
269 : {
270 1846 : insn_info::order_node *order = insn->get_order_node ();
271 1769 : if (!order)
272 : {
273 1769 : order = allocate<insn_info::order_node> (insn->uid ());
274 1769 : insn->add_note (order);
275 : }
276 1846 : return order;
277 : }
278 :
279 : // Add instruction INSN immediately after AFTER in the reverse postorder list.
280 : // INSN is not currently in the list.
281 : void
282 824492999 : function_info::add_insn_after (insn_info *insn, insn_info *after)
283 : {
284 824492999 : gcc_checking_assert (!insn->has_insn_links ());
285 :
286 824492999 : insn->copy_next_from (after);
287 824492999 : after->set_next_any_insn (insn);
288 :
289 : // The prev link is easy if AFTER and INSN are the same type.
290 : // Handle the other cases below.
291 824492999 : if (after->is_debug_insn () == insn->is_debug_insn ())
292 741530141 : insn->set_prev_sametype_insn (after);
293 :
294 824492999 : if (insn_info *next = insn->next_any_insn ())
295 : {
296 25541 : if (insn->is_debug_insn () == next->is_debug_insn ())
297 : {
298 : // INSN might now be the start of the subsequence of debug insns,
299 : // and so its prev pointer might point to the end of the subsequence
300 : // instead of AFTER.
301 22544 : insn->copy_prev_from (next);
302 22544 : next->set_prev_sametype_insn (insn);
303 : }
304 2997 : else if (insn->is_debug_insn ()) // && !next->is_debug_insn ()
305 : {
306 : // INSN ends a subsequence of debug instructions. Find the
307 : // first debug instruction in the subsequence, which might
308 : // be INSN itself. (If it isn't, then AFTER is also a debug
309 : // instruction and we updated INSN's prev link above.)
310 0 : insn_info *first = next->prev_nondebug_insn ()->next_any_insn ();
311 0 : first->set_last_debug_insn (insn);
312 : }
313 : else // !insn->is_debug_insn () && next->is_debug_insn ()
314 : {
315 : // At present we don't (need to) support inserting a nondebug
316 : // instruction between two existing debug instructions.
317 2997 : gcc_assert (!after->is_debug_insn ());
318 :
319 : // Find the next nondebug insn and update its previous pointer
320 : // to point to INSN.
321 2997 : auto next_nondebug = next->last_debug_insn ()->next_any_insn ();
322 2997 : gcc_checking_assert (!next_nondebug->is_debug_insn ());
323 2997 : next_nondebug->set_prev_sametype_insn (insn);
324 : }
325 :
326 : // If AFTER and NEXT are separated by at least two points, we can
327 : // use a unique point number for INSN. Otherwise INSN will have
328 : // the same point number as AFTER.
329 25541 : insn->set_point ((next->point () + after->point ()) / 2);
330 : }
331 : else
332 : {
333 824467458 : if (!insn->is_debug_insn ())
334 : {
335 535579552 : insn->set_prev_sametype_insn (m_last_nondebug_insn);
336 535579552 : m_last_nondebug_insn = insn;
337 : }
338 : else
339 : // There is now at least one debug instruction after
340 : // m_last_nondebug_insn: either INSN itself, or the start of
341 : // a longer subsequence of debug insns that now ends with AFTER
342 : // followed by INSN.
343 577775812 : m_last_nondebug_insn->next_any_insn ()->set_last_debug_insn (insn);
344 824467458 : m_last_insn = insn;
345 :
346 824467458 : insn->set_point (after->point () + POINT_INCREASE);
347 : }
348 :
349 : // If INSN's program point is the same as AFTER's, we need to use the
350 : // splay tree to record their relative order.
351 824492999 : if (insn->point () == after->point ())
352 : {
353 923 : insn_info::order_node *after_node = need_order_node (after);
354 923 : insn_info::order_node *insn_node = need_order_node (insn);
355 923 : insn_info::order_splay_tree::insert_child (after_node, 1, insn_node);
356 : }
357 824492999 : }
358 :
359 : // Replace non-debug instruction OLD_INSN with non-debug instruction NEW_INSN.
360 : // NEW_INSN is not currently linked.
361 : void
362 25541 : function_info::replace_nondebug_insn (insn_info *old_insn, insn_info *new_insn)
363 : {
364 25541 : gcc_assert (!old_insn->is_debug_insn ()
365 : && !new_insn->is_debug_insn ()
366 : && !new_insn->has_insn_links ());
367 :
368 25541 : insn_info *prev = old_insn->prev_any_insn ();
369 25541 : insn_info *next_nondebug = old_insn->next_nondebug_insn ();
370 :
371 : // We should never remove the entry or exit block's instructions.
372 25541 : gcc_checking_assert (prev && next_nondebug);
373 :
374 25541 : new_insn->copy_prev_from (old_insn);
375 25541 : new_insn->copy_next_from (old_insn);
376 :
377 25541 : prev->set_next_any_insn (new_insn);
378 25541 : next_nondebug->set_prev_sametype_insn (new_insn);
379 :
380 25541 : new_insn->set_point (old_insn->point ());
381 25541 : if (insn_info::order_node *order = old_insn->get_order_node ())
382 : {
383 923 : order->set_uid (new_insn->uid ());
384 923 : old_insn->remove_note (order);
385 923 : new_insn->add_note (order);
386 : }
387 :
388 25541 : old_insn->clear_insn_links ();
389 25541 : }
390 :
391 : // Remove INSN from the function's list of instructions.
392 : void
393 2186816 : function_info::remove_insn (insn_info *insn)
394 : {
395 2186816 : if (insn_info::order_node *order = insn->get_order_node ())
396 : {
397 312 : insn_info::order_splay_tree::remove_node (order);
398 312 : insn->remove_note (order);
399 : }
400 :
401 4373632 : if (auto *note = insn->find_note<insn_call_clobbers_note> ())
402 : {
403 0 : ebb_call_clobbers_info *ecc = insn->ebb ()->first_call_clobbers ();
404 0 : while (ecc->abi ()->id () != note->abi_id ())
405 0 : ecc = ecc->next ();
406 0 : int comparison = lookup_call_clobbers (*ecc, insn);
407 0 : gcc_assert (comparison == 0);
408 0 : ecc->remove_root ();
409 : }
410 :
411 2186816 : insn_info *prev = insn->prev_any_insn ();
412 2186816 : insn_info *next = insn->next_any_insn ();
413 2186816 : insn_info *prev_nondebug = insn->prev_nondebug_insn ();
414 2186816 : insn_info *next_nondebug = insn->next_nondebug_insn ();
415 :
416 : // We should never remove the entry or exit block's instructions.
417 : // At present we also don't remove entire blocks, so should never
418 : // remove debug instructions.
419 2186816 : gcc_checking_assert (prev_nondebug
420 : && next_nondebug
421 : && !insn->is_debug_insn ());
422 :
423 2186816 : if (prev->is_debug_insn () && next->is_debug_insn ())
424 : {
425 : // We need to stitch together two subsequences of debug insns.
426 15540 : insn_info *last = next->last_debug_insn ();
427 15540 : next->set_prev_sametype_insn (prev);
428 31080 : prev_nondebug->next_any_insn ()->set_last_debug_insn (last);
429 : }
430 2186816 : prev->set_next_any_insn (next);
431 2186816 : next_nondebug->set_prev_sametype_insn (prev_nondebug);
432 :
433 2186816 : insn->clear_insn_links ();
434 2186816 : }
435 :
436 : // Create an artificial instruction for BB, associating it with RTL (which can
437 : // be null). Add the new instruction to the end of the function's list and
438 : // return the new instruction.
439 : insn_info *
440 194881422 : function_info::append_artificial_insn (bb_info *bb, rtx_insn *rtl)
441 : {
442 194881422 : insn_info *insn = allocate<insn_info> (bb, rtl, m_next_artificial_uid);
443 194881422 : m_next_artificial_uid -= 1;
444 194881422 : append_insn (insn);
445 194881422 : return insn;
446 : }
447 :
448 : // Finish building a new list of uses and definitions for instruction INSN.
449 : void
450 778288254 : function_info::finish_insn_accesses (insn_info *insn)
451 : {
452 778288254 : unsigned int num_defs = m_temp_defs.length ();
453 778288254 : unsigned int num_uses = m_temp_uses.length ();
454 778288254 : obstack_make_room (&m_obstack, num_defs + num_uses);
455 778288254 : if (num_defs)
456 : {
457 312712451 : sort_accesses (m_temp_defs);
458 312712451 : obstack_grow (&m_obstack, m_temp_defs.address (),
459 : num_defs * sizeof (access_info *));
460 312712451 : m_temp_defs.truncate (0);
461 : }
462 778288254 : if (num_uses)
463 : {
464 426711727 : sort_accesses (m_temp_uses);
465 426711727 : obstack_grow (&m_obstack, m_temp_uses.address (),
466 : num_uses * sizeof (access_info *));
467 426711727 : m_temp_uses.truncate (0);
468 : }
469 778288254 : void *addr = obstack_finish (&m_obstack);
470 778288254 : insn->set_accesses (static_cast<access_info **> (addr), num_defs, num_uses);
471 778288254 : }
472 :
473 : // Called while building SSA form using BI. Create and return a use of
474 : // register RESOURCE in INSN. Create a degenerate phi where necessary.
475 : use_info *
476 768926511 : function_info::create_reg_use (build_info &bi, insn_info *insn,
477 : resource_info resource)
478 : {
479 768926511 : set_info *value = bi.current_reg_value (resource.regno);
480 768926511 : if (value && value->ebb () != bi.current_ebb)
481 : {
482 309044132 : if (insn->is_debug_insn ())
483 25724391 : value = look_through_degenerate_phi (value);
484 283319741 : else if (bitmap_bit_p (bi.potential_phi_regs, resource.regno))
485 : // VALUE is defined by a previous EBB and RESOURCE has multiple
486 : // definitions. Create a degenerate phi in the current EBB
487 : // so that all definitions and uses follow a linear RPO view;
488 : // see rtl.texi for details.
489 36148793 : value = create_degenerate_phi (bi, value);
490 : }
491 768926511 : auto *use = allocate<use_info> (insn, resource, value);
492 768926511 : add_use (use);
493 768926511 : return use;
494 : }
495 :
496 : // Called while building SSA form using BI. Record that INSN contains
497 : // read reference REF. If this requires new entries to be added to
498 : // INSN->uses (), add those entries to the list we're building in
499 : // m_temp_uses.
500 : void
501 622368543 : function_info::record_use (build_info &bi, insn_info *insn,
502 : rtx_obj_reference ref)
503 : {
504 622368543 : unsigned int regno = ref.regno;
505 622368543 : machine_mode mode = ref.is_reg () ? ref.mode : BLKmode;
506 622368543 : access_info *access = bi.last_access[ref.regno + 1];
507 622368543 : use_info *use = safe_dyn_cast<use_info *> (access);
508 622368543 : if (!use)
509 : {
510 560411591 : set_info *value = safe_dyn_cast<set_info *> (access);
511 : // In order to ensure that -g doesn't affect codegen, uses in debug
512 : // instructions do not affect liveness, either in DF or here.
513 : // This means that there might be no correct definition of the resource
514 : // available (e.g. if it would require a phi node that the nondebug
515 : // code doesn't need). Perhaps we could have "debug phi nodes" as
516 : // well as "debug instructions", but that would require a method
517 : // of building phi nodes that didn't depend on DF liveness information,
518 : // and so might be significantly more expensive.
519 : //
520 : // Therefore, the only value we try to attach to a use by a debug
521 : // instruction is VALUE itself (as we would for nondebug instructions).
522 : // We then need to make a conservative check for whether VALUE is
523 : // actually correct.
524 628280596 : auto value_is_valid = [&]()
525 : {
526 : // Memmory always has a valid definition.
527 67869005 : if (ref.is_mem ())
528 : return true;
529 :
530 : // If VALUE would lead to an uninitialized use anyway, there's
531 : // nothing to check.
532 61040025 : if (!value)
533 : return false;
534 :
535 : // If the previous definition occurs in the same EBB then it
536 : // is certainly correct.
537 61033070 : if (value->ebb () == bi.current_ebb)
538 : return true;
539 :
540 : // Check if VALUE is the function's only definition of REGNO.
541 : // (We already know that it dominates the use.)
542 25724391 : if (!bitmap_bit_p (bi.potential_phi_regs, regno))
543 : return true;
544 :
545 : // If the register is live on entry to the EBB but not used
546 : // within it, VALUE is the correct live-in value.
547 4221285 : if (!bi.ebb_live_in_for_debug)
548 1846105 : calculate_ebb_live_in_for_debug (bi);
549 4221285 : if (bitmap_bit_p (bi.ebb_live_in_for_debug, regno))
550 : return true;
551 :
552 : // Punt for other cases.
553 : return false;
554 560411591 : };
555 560411591 : if (insn->is_debug_insn () && !value_is_valid ())
556 7883 : value = nullptr;
557 :
558 560411591 : use = create_reg_use (bi, insn, { mode, regno });
559 560411591 : m_temp_uses.safe_push (use);
560 560411591 : bi.last_access[ref.regno + 1] = use;
561 560411591 : use->record_reference (ref, true);
562 : }
563 : else
564 : {
565 : // Record the mode of the largest use. The choice is arbitrary if
566 : // the instruction (unusually) references the same register in two
567 : // different but equal-sized modes.
568 61956952 : gcc_checking_assert (use->insn () == insn);
569 61956952 : if (HARD_REGISTER_NUM_P (regno))
570 : {
571 18527463 : if (!ordered_p (GET_MODE_PRECISION (use->mode ()),
572 18527463 : GET_MODE_PRECISION (mode)))
573 : use->set_mode (reg_raw_mode[regno]);
574 18527463 : else if (partial_subreg_p (use->mode (), mode))
575 36062 : use->set_mode (mode);
576 : }
577 61956952 : use->record_reference (ref, false);
578 : }
579 622368543 : }
580 :
581 : // Called while building SSA form for INSN using BI. Record the effect
582 : // of call clobbers in RTL. We have already added the explicit sets and
583 : // clobbers for RTL, which have priority over any call clobbers.
584 : void
585 26696894 : function_info::record_call_clobbers (build_info &bi, insn_info *insn,
586 : rtx_call_insn *rtl)
587 : {
588 : // See whether we should record this call in the EBB's list of
589 : // call clobbers. Three things affect this choice:
590 : //
591 : // (1) The list is the only way we have of recording partial clobbers.
592 : // All calls that only partially clobber registers must therefore
593 : // be in the list.
594 : //
595 : // (2) Adding calls to the list is much more memory-efficient than
596 : // creating a long list of clobber_infos.
597 : //
598 : // (3) Adding calls to the list limits the ability to move definitions
599 : // of registers that are normally fully or partially clobbered
600 : // by the associated predefined ABI. So adding calls to the list
601 : // can hamper optimization if (thanks to -fipa-ra) the number of
602 : // clobbers is much smaller than the usual set.
603 : //
604 : // The trade-off that we currently take is to use the list if there
605 : // are some registers that the call only partially clobbers or if
606 : // the set of clobbers is the standard set.
607 26696894 : function_abi abi = insn_callee_abi (rtl);
608 26696894 : if (abi.base_abi ().full_reg_clobbers () == abi.full_reg_clobbers ()
609 28195991 : || abi.full_and_partial_reg_clobbers () != abi.full_reg_clobbers ())
610 : {
611 : // Find an entry for this predefined ABI, creating one if necessary.
612 25197797 : ebb_call_clobbers_info *ecc = bi.current_ebb->first_call_clobbers ();
613 25207753 : while (ecc && ecc->abi () != &abi.base_abi ())
614 9956 : ecc = ecc->next ();
615 25197797 : if (!ecc)
616 : {
617 14710785 : ecc = allocate<ebb_call_clobbers_info> (&abi.base_abi ());
618 14710785 : ecc->m_next = bi.current_ebb->first_call_clobbers ();
619 14710785 : bi.current_ebb->set_first_call_clobbers (ecc);
620 : }
621 :
622 25197797 : auto abi_id = abi.base_abi ().id ();
623 25197797 : auto *insn_clobbers = allocate<insn_call_clobbers_note> (abi_id, insn);
624 25197797 : insn->add_note (insn_clobbers);
625 :
626 25197797 : ecc->insert_max_node (insn_clobbers);
627 :
628 50395594 : m_clobbered_by_calls |= abi.full_and_partial_reg_clobbers ();
629 : }
630 : else
631 139416021 : for (unsigned int regno = 0; regno < FIRST_PSEUDO_REGISTER; ++regno)
632 137916924 : if (TEST_HARD_REG_BIT (abi.full_reg_clobbers (), regno))
633 : {
634 79198430 : def_info *def = m_defs[regno + 1];
635 79198430 : if (!def || def->last_def ()->insn () != insn)
636 : {
637 78733642 : def = allocate<clobber_info> (insn, regno);
638 78733642 : def->m_is_call_clobber = true;
639 78733642 : append_def (def);
640 78733642 : m_temp_defs.safe_push (def);
641 78733642 : bi.record_reg_def (def);
642 : }
643 : }
644 26696894 : }
645 :
646 : // Called while building SSA form using BI. Record that INSN contains
647 : // write reference REF. Add associated def_infos to the list of accesses
648 : // that we're building in m_temp_defs. Record the register's new live
649 : // value in BI.
650 : void
651 403278112 : function_info::record_def (build_info &bi, insn_info *insn,
652 : rtx_obj_reference ref)
653 : {
654 : // Punt if we see multiple definitions of the same resource.
655 : // This can happen for several reasons:
656 : //
657 : // - An instruction might store two values to memory at once, giving two
658 : // distinct memory references.
659 : //
660 : // - An instruction might assign to multiple pieces of a wide pseudo
661 : // register. For example, on 32-bit targets, an instruction might
662 : // assign to both the upper and lower halves of a 64-bit pseudo register.
663 : //
664 : // - It's possible for the same register to be clobbered by the
665 : // CALL_INSN_FUNCTION_USAGE and to be set by the main instruction
666 : // pattern as well. In that case, the clobber conceptually happens
667 : // before the set and can essentially be ignored.
668 : //
669 : // - Similarly, global registers are implicitly set by a call but can
670 : // be explicitly set or clobbered as well. In that situation, the sets
671 : // are listed first and should win over a clobber.
672 403278112 : unsigned int regno = ref.regno;
673 403278112 : machine_mode mode = ref.is_reg () ? ref.mode : BLKmode;
674 403278112 : def_info *def = safe_dyn_cast<def_info *> (bi.last_access[ref.regno + 1]);
675 292225262 : if (def && def->insn () == insn)
676 : {
677 13077021 : if (!ref.is_clobber ())
678 : {
679 12012158 : gcc_checking_assert (!is_a<clobber_info *> (def));
680 12012158 : def->record_reference (ref, false);
681 : }
682 13077021 : return;
683 : }
684 :
685 : // Memory is always well-defined, so only use clobber_infos for registers.
686 390201091 : if (ref.is_reg () && ref.is_clobber ())
687 48142716 : def = allocate<clobber_info> (insn, regno);
688 : else
689 342058375 : def = allocate<set_info> (insn, resource_info { mode, regno });
690 390201091 : def->record_reference (ref, true);
691 390201091 : append_def (def);
692 390201091 : m_temp_defs.safe_push (def);
693 390201091 : bi.record_reg_def (def);
694 : }
695 :
696 : // Called while building SSA form using BI. Add an insn_info for RTL
697 : // to the block that we're current building.
698 : void
699 635507562 : function_info::add_insn_to_block (build_info &bi, rtx_insn *rtl)
700 : {
701 635507562 : insn_info *insn = allocate<insn_info> (bi.current_bb, rtl, UNKNOWN_COST);
702 635507562 : append_insn (insn);
703 :
704 635507562 : vec_rtx_properties properties;
705 635507562 : properties.add_insn (rtl, true);
706 635507562 : insn->set_properties (properties);
707 :
708 635507562 : start_insn_accesses ();
709 :
710 : // Record the uses.
711 1600665679 : for (rtx_obj_reference ref : properties.refs ())
712 965158117 : if (ref.is_read ())
713 622368543 : record_use (bi, insn, ref);
714 :
715 : // Restore the contents of bi.last_access, which we used as a cache
716 : // when assembling the uses.
717 2454820109 : for (access_info *access : m_temp_uses)
718 : {
719 560411591 : unsigned int regno = access->regno ();
720 560411591 : gcc_checking_assert (bi.last_access[regno + 1] == access);
721 560411591 : bi.last_access[regno + 1] = as_a<use_info *> (access)->def ();
722 : }
723 :
724 : // Record the definitions.
725 1600665679 : for (rtx_obj_reference ref : properties.refs ())
726 965158117 : if (ref.is_write ())
727 403278112 : record_def (bi, insn, ref);
728 :
729 : // Logically these happen before the explicit definitions, but if the
730 : // explicit definitions and call clobbers reference the same register,
731 : // the explicit definition should win.
732 635507562 : if (auto *call_rtl = dyn_cast<rtx_call_insn *> (rtl))
733 26696894 : record_call_clobbers (bi, insn, call_rtl);
734 :
735 635507562 : finish_insn_accesses (insn);
736 635507562 : }
737 :
738 : // Check whether INSN sets any registers that are never subsequently used.
739 : // If so, add REG_UNUSED notes for them. The caller has already removed
740 : // any previous REG_UNUSED notes.
741 : void
742 18420040 : function_info::add_reg_unused_notes (insn_info *insn)
743 : {
744 18420040 : rtx_insn *rtl = insn->rtl ();
745 :
746 37899385 : auto handle_potential_set = [&](rtx pattern)
747 : {
748 19479345 : if (GET_CODE (pattern) != SET)
749 19335394 : return;
750 :
751 16484631 : rtx dest = SET_DEST (pattern);
752 16484631 : if (!REG_P (dest))
753 : return;
754 :
755 6514638 : def_array defs = insn->defs ();
756 6514638 : unsigned int index = find_access_index (defs, REGNO (dest));
757 6658699 : for (unsigned int i = 0; i < REG_NREGS (dest); ++i)
758 : {
759 6514748 : def_info *def = defs[index + i];
760 6514748 : gcc_checking_assert (def->regno () == REGNO (dest) + i);
761 6658809 : set_info *set = dyn_cast<set_info *> (def);
762 19479455 : if (set && set->has_nondebug_uses ())
763 : return;
764 : }
765 143951 : add_reg_note (rtl, REG_UNUSED, dest);
766 18420040 : };
767 :
768 18420040 : rtx pattern = PATTERN (rtl);
769 18420040 : if (GET_CODE (pattern) == PARALLEL)
770 2992761 : for (int i = 0; i < XVECLEN (pattern, 0); ++i)
771 2026033 : handle_potential_set (XVECEXP (pattern, 0, i));
772 : else
773 17453312 : handle_potential_set (pattern);
774 18420040 : }
775 :
776 : // Search TREE for call clobbers at INSN. Return:
777 : //
778 : // - less than zero if INSN occurs before the root of TREE
779 : // - 0 if INSN is the root of TREE
780 : // - greater than zero if INSN occurs after the root of TREE
781 : int
782 49834184 : rtl_ssa::lookup_call_clobbers (insn_call_clobbers_tree &tree, insn_info *insn)
783 : {
784 123957599 : auto compare = [&](insn_call_clobbers_note *clobbers)
785 : {
786 74123415 : return insn->compare_with (clobbers->insn ());
787 49834184 : };
788 49834184 : return tree.lookup (compare);
789 : }
790 :
791 : // Print a description of INSN to PP.
792 : void
793 0 : rtl_ssa::pp_insn (pretty_printer *pp, const insn_info *insn)
794 : {
795 0 : if (!insn)
796 0 : pp_string (pp, "<null>");
797 : else
798 0 : insn->print_full (pp);
799 0 : }
800 :
801 : // Print a description of INSN to FILE.
802 : void
803 0 : dump (FILE *file, const insn_info *insn)
804 : {
805 0 : dump_using (file, pp_insn, insn);
806 0 : }
807 :
808 : // Debug interface to the dump routine above.
809 0 : void debug (const insn_info *x) { dump (stderr, x); }
|
