1 /* IRA conflict builder.
2 Copyright (C) 2006, 2007, 2008
3 Free Software Foundation, Inc.
4 Contributed by Vladimir Makarov <vmakarov@redhat.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
31 #include "hard-reg-set.h"
32 #include "basic-block.h"
33 #include "insn-config.h"
38 #include "sparseset.h"
41 /* This file contains code responsible for allocno conflict creation,
42 allocno copy creation and allocno info accumulation on upper level
45 /* ira_allocnos_num array of arrays of bits, recording whether two
46 allocno's conflict (can't go in the same hardware register).
48 Some arrays will be used as conflict bit vector of the
49 corresponding allocnos see function build_allocno_conflicts. */
50 static IRA_INT_TYPE **conflicts;
52 /* Macro to test a conflict of A1 and A2 in `conflicts'. */
53 #define CONFLICT_ALLOCNO_P(A1, A2) \
54 (ALLOCNO_MIN (A1) <= ALLOCNO_CONFLICT_ID (A2) \
55 && ALLOCNO_CONFLICT_ID (A2) <= ALLOCNO_MAX (A1) \
56 && TEST_ALLOCNO_SET_BIT (conflicts[ALLOCNO_NUM (A1)], \
57 ALLOCNO_CONFLICT_ID (A2), \
63 /* Build allocno conflict table by processing allocno live ranges. */
65 build_conflict_bit_table (void)
67 int i, num, id, allocated_words_num, conflict_bit_vec_words_num;
69 enum reg_class cover_class;
70 ira_allocno_t allocno, live_a;
71 allocno_live_range_t r;
72 ira_allocno_iterator ai;
73 sparseset allocnos_live;
74 int allocno_set_words;
76 allocno_set_words = (ira_allocnos_num + IRA_INT_BITS - 1) / IRA_INT_BITS;
77 allocnos_live = sparseset_alloc (ira_allocnos_num);
78 conflicts = (IRA_INT_TYPE **) ira_allocate (sizeof (IRA_INT_TYPE *)
80 allocated_words_num = 0;
81 FOR_EACH_ALLOCNO (allocno, ai)
83 num = ALLOCNO_NUM (allocno);
84 if (ALLOCNO_MAX (allocno) < ALLOCNO_MIN (allocno))
86 conflicts[num] = NULL;
89 conflict_bit_vec_words_num
90 = ((ALLOCNO_MAX (allocno) - ALLOCNO_MIN (allocno) + IRA_INT_BITS)
92 allocated_words_num += conflict_bit_vec_words_num;
94 = (IRA_INT_TYPE *) ira_allocate (sizeof (IRA_INT_TYPE)
95 * conflict_bit_vec_words_num);
96 memset (conflicts[num], 0,
97 sizeof (IRA_INT_TYPE) * conflict_bit_vec_words_num);
99 if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL)
102 "+++Allocating %ld bytes for conflict table (uncompressed size %ld)\n",
103 (long) allocated_words_num * sizeof (IRA_INT_TYPE),
104 (long) allocno_set_words * ira_allocnos_num * sizeof (IRA_INT_TYPE));
105 for (i = 0; i < ira_max_point; i++)
107 for (r = ira_start_point_ranges[i]; r != NULL; r = r->start_next)
109 allocno = r->allocno;
110 num = ALLOCNO_NUM (allocno);
111 id = ALLOCNO_CONFLICT_ID (allocno);
112 cover_class = ALLOCNO_COVER_CLASS (allocno);
113 sparseset_set_bit (allocnos_live, num);
114 EXECUTE_IF_SET_IN_SPARSESET (allocnos_live, j)
116 live_a = ira_allocnos[j];
117 if (cover_class == ALLOCNO_COVER_CLASS (live_a)
118 /* Don't set up conflict for the allocno with itself. */
121 SET_ALLOCNO_SET_BIT (conflicts[num],
122 ALLOCNO_CONFLICT_ID (live_a),
123 ALLOCNO_MIN (allocno),
124 ALLOCNO_MAX (allocno));
125 SET_ALLOCNO_SET_BIT (conflicts[j], id,
126 ALLOCNO_MIN (live_a),
127 ALLOCNO_MAX (live_a));
132 for (r = ira_finish_point_ranges[i]; r != NULL; r = r->finish_next)
133 sparseset_clear_bit (allocnos_live, ALLOCNO_NUM (r->allocno));
135 sparseset_free (allocnos_live);
140 /* Return TRUE if the operand constraint STR is commutative. */
142 commutative_constraint_p (const char *str)
147 for (ignore_p = false;;)
152 str += CONSTRAINT_LEN (c, str);
159 /* Usually `%' is the first constraint character but the
160 documentation does not require this. */
168 /* Return the number of the operand which should be the same in any
169 case as operand with number OP_NUM (or negative value if there is
170 no such operand). If USE_COMMUT_OP_P is TRUE, the function makes
171 temporarily commutative operand exchange before this. The function
172 takes only really possible alternatives into consideration. */
174 get_dup_num (int op_num, bool use_commut_op_p)
176 int curr_alt, c, original, dup;
177 bool ignore_p, commut_op_used_p;
181 if (op_num < 0 || recog_data.n_alternatives == 0)
183 op = recog_data.operand[op_num];
184 commut_op_used_p = true;
187 if (commutative_constraint_p (recog_data.constraints[op_num]))
189 else if (op_num > 0 && commutative_constraint_p (recog_data.constraints
193 commut_op_used_p = false;
195 str = recog_data.constraints[op_num];
196 for (ignore_p = false, original = -1, curr_alt = 0;;)
216 /* Accept a register which might be placed in memory. */
226 GO_IF_LEGITIMATE_ADDRESS (VOIDmode, op, win_p);
236 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
237 case 'h': case 'j': case 'k': case 'l':
238 case 'q': case 't': case 'u':
239 case 'v': case 'w': case 'x': case 'y': case 'z':
240 case 'A': case 'B': case 'C': case 'D':
241 case 'Q': case 'R': case 'S': case 'T': case 'U':
242 case 'W': case 'Y': case 'Z':
247 ? GENERAL_REGS : REG_CLASS_FROM_CONSTRAINT (c, str));
250 #ifdef EXTRA_CONSTRAINT_STR
251 else if (EXTRA_CONSTRAINT_STR (op, c, str))
257 case '0': case '1': case '2': case '3': case '4':
258 case '5': case '6': case '7': case '8': case '9':
259 if (original != -1 && original != c)
264 str += CONSTRAINT_LEN (c, str);
268 dup = original - '0';
271 if (commutative_constraint_p (recog_data.constraints[dup]))
274 && commutative_constraint_p (recog_data.constraints[dup -1]))
276 else if (! commut_op_used_p)
282 /* Return the operand which should be, in any case, the same as
283 operand with number OP_NUM. If USE_COMMUT_OP_P is TRUE, the
284 function makes temporarily commutative operand exchange before
287 get_dup (int op_num, bool use_commut_op_p)
289 int n = get_dup_num (op_num, use_commut_op_p);
294 return recog_data.operand[n];
297 /* Check that X is REG or SUBREG of REG. */
298 #define REG_SUBREG_P(x) \
299 (REG_P (x) || (GET_CODE (x) == SUBREG && REG_P (SUBREG_REG (x))))
301 /* Return X if X is a REG, otherwise it should be SUBREG of REG and
302 the function returns the reg in this case. *OFFSET will be set to
303 0 in the first case or the regno offset in the first case. */
305 go_through_subreg (rtx x, int *offset)
312 ira_assert (GET_CODE (x) == SUBREG);
313 reg = SUBREG_REG (x);
314 ira_assert (REG_P (reg));
315 if (REGNO (reg) < FIRST_PSEUDO_REGISTER)
316 *offset = subreg_regno_offset (REGNO (reg), GET_MODE (reg),
317 SUBREG_BYTE (x), GET_MODE (x));
319 *offset = (SUBREG_BYTE (x) / REGMODE_NATURAL_SIZE (GET_MODE (x)));
323 /* Process registers REG1 and REG2 in move INSN with execution
324 frequency FREQ. The function also processes the registers in a
325 potential move insn (INSN == NULL in this case) with frequency
326 FREQ. The function can modify hard register costs of the
327 corresponding allocnos or create a copy involving the corresponding
328 allocnos. The function does nothing if the both registers are hard
329 registers. When nothing is changed, the function returns
332 process_regs_for_copy (rtx reg1, rtx reg2, rtx insn, int freq)
334 int allocno_preferenced_hard_regno, cost, index, offset1, offset2;
337 enum reg_class rclass, cover_class;
338 enum machine_mode mode;
341 gcc_assert (REG_SUBREG_P (reg1) && REG_SUBREG_P (reg2));
342 only_regs_p = REG_P (reg1) && REG_P (reg2);
343 reg1 = go_through_subreg (reg1, &offset1);
344 reg2 = go_through_subreg (reg2, &offset2);
345 /* Set up hard regno preferenced by allocno. If allocno gets the
346 hard regno the copy (or potential move) insn will be removed. */
347 if (HARD_REGISTER_P (reg1))
349 if (HARD_REGISTER_P (reg2))
351 allocno_preferenced_hard_regno = REGNO (reg1) + offset1 - offset2;
352 a = ira_curr_regno_allocno_map[REGNO (reg2)];
354 else if (HARD_REGISTER_P (reg2))
356 allocno_preferenced_hard_regno = REGNO (reg2) + offset2 - offset1;
357 a = ira_curr_regno_allocno_map[REGNO (reg1)];
359 else if (!CONFLICT_ALLOCNO_P (ira_curr_regno_allocno_map[REGNO (reg1)],
360 ira_curr_regno_allocno_map[REGNO (reg2)])
361 && offset1 == offset2)
363 cp = ira_add_allocno_copy (ira_curr_regno_allocno_map[REGNO (reg1)],
364 ira_curr_regno_allocno_map[REGNO (reg2)],
365 freq, insn, ira_curr_loop_tree_node);
366 bitmap_set_bit (ira_curr_loop_tree_node->local_copies, cp->num);
371 if (! IN_RANGE (allocno_preferenced_hard_regno, 0, FIRST_PSEUDO_REGISTER - 1))
372 /* Can not be tied. */
374 rclass = REGNO_REG_CLASS (allocno_preferenced_hard_regno);
375 mode = ALLOCNO_MODE (a);
376 cover_class = ALLOCNO_COVER_CLASS (a);
377 if (only_regs_p && insn != NULL_RTX
378 && reg_class_size[rclass] <= (unsigned) CLASS_MAX_NREGS (rclass, mode))
379 /* It is already taken into account in ira-costs.c. */
381 index = ira_class_hard_reg_index[cover_class][allocno_preferenced_hard_regno];
383 /* Can not be tied. It is not in the cover class. */
385 if (HARD_REGISTER_P (reg1))
386 cost = ira_register_move_cost[mode][cover_class][rclass] * freq;
388 cost = ira_register_move_cost[mode][rclass][cover_class] * freq;
389 ira_allocate_and_set_costs
390 (&ALLOCNO_HARD_REG_COSTS (a), cover_class,
391 ALLOCNO_COVER_CLASS_COST (a));
392 ira_allocate_and_set_costs
393 (&ALLOCNO_CONFLICT_HARD_REG_COSTS (a), cover_class, 0);
394 ALLOCNO_HARD_REG_COSTS (a)[index] -= cost;
395 ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[index] -= cost;
399 /* Process all of the output registers of the current insn and
400 the input register REG (its operand number OP_NUM) which dies in the
401 insn as if there were a move insn between them with frequency
404 process_reg_shuffles (rtx reg, int op_num, int freq)
409 gcc_assert (REG_SUBREG_P (reg));
410 for (i = 0; i < recog_data.n_operands; i++)
412 another_reg = recog_data.operand[i];
414 if (!REG_SUBREG_P (another_reg) || op_num == i
415 || recog_data.operand_type[i] != OP_OUT)
418 process_regs_for_copy (reg, another_reg, NULL_RTX, freq);
422 /* Process INSN and create allocno copies if necessary. For example,
423 it might be because INSN is a pseudo-register move or INSN is two
426 add_insn_allocno_copies (rtx insn)
428 rtx set, operand, dup;
430 bool commut_p, bound_p;
433 freq = REG_FREQ_FROM_BB (BLOCK_FOR_INSN (insn));
436 if ((set = single_set (insn)) != NULL_RTX
437 && REG_SUBREG_P (SET_DEST (set)) && REG_SUBREG_P (SET_SRC (set))
438 && ! side_effects_p (set)
439 && find_reg_note (insn, REG_DEAD,
440 REG_P (SET_SRC (set))
442 : SUBREG_REG (SET_SRC (set))) != NULL_RTX)
443 process_regs_for_copy (SET_DEST (set), SET_SRC (set), insn, freq);
447 for (i = 0; i < recog_data.n_operands; i++)
449 operand = recog_data.operand[i];
450 if (REG_SUBREG_P (operand)
451 && find_reg_note (insn, REG_DEAD,
453 ? operand : SUBREG_REG (operand)) != NULL_RTX)
455 str = recog_data.constraints[i];
456 while (*str == ' ' && *str == '\t')
459 for (j = 0, commut_p = false; j < 2; j++, commut_p = true)
460 if ((dup = get_dup (i, commut_p)) != NULL_RTX
461 && REG_SUBREG_P (dup)
462 && process_regs_for_copy (operand, dup, NULL_RTX, freq))
466 /* If an operand dies, prefer its hard register for the
467 output operands by decreasing the hard register cost
468 or creating the corresponding allocno copies. The
469 cost will not correspond to a real move insn cost, so
470 make the frequency smaller. */
471 process_reg_shuffles (operand, i, freq < 8 ? 1 : freq / 8);
477 /* Add copies originated from BB given by LOOP_TREE_NODE. */
479 add_copies (ira_loop_tree_node_t loop_tree_node)
484 bb = loop_tree_node->bb;
487 FOR_BB_INSNS (bb, insn)
489 add_insn_allocno_copies (insn);
492 /* Propagate copies the corresponding allocnos on upper loop tree
495 propagate_copies (void)
498 ira_copy_iterator ci;
499 ira_allocno_t a1, a2, parent_a1, parent_a2;
500 ira_loop_tree_node_t parent;
502 FOR_EACH_COPY (cp, ci)
506 if (ALLOCNO_LOOP_TREE_NODE (a1) == ira_loop_tree_root)
508 ira_assert ((ALLOCNO_LOOP_TREE_NODE (a2) != ira_loop_tree_root));
509 parent = ALLOCNO_LOOP_TREE_NODE (a1)->parent;
510 if ((parent_a1 = ALLOCNO_CAP (a1)) == NULL)
511 parent_a1 = parent->regno_allocno_map[ALLOCNO_REGNO (a1)];
512 if ((parent_a2 = ALLOCNO_CAP (a2)) == NULL)
513 parent_a2 = parent->regno_allocno_map[ALLOCNO_REGNO (a2)];
514 ira_assert (parent_a1 != NULL && parent_a2 != NULL);
515 if (! CONFLICT_ALLOCNO_P (parent_a1, parent_a2))
516 ira_add_allocno_copy (parent_a1, parent_a1, cp->freq,
517 cp->insn, cp->loop_tree_node);
521 /* Return TRUE if live ranges of allocnos A1 and A2 intersect. It is
522 used to find a conflict for new allocnos or allocnos with the
523 different cover classes. */
525 ira_allocno_live_ranges_intersect_p (ira_allocno_t a1, ira_allocno_t a2)
527 allocno_live_range_t r1, r2;
531 if (ALLOCNO_REG (a1) != NULL && ALLOCNO_REG (a2) != NULL
532 && (ORIGINAL_REGNO (ALLOCNO_REG (a1))
533 == ORIGINAL_REGNO (ALLOCNO_REG (a2))))
535 /* Remember the ranges are always kept ordered. */
536 for (r1 = ALLOCNO_LIVE_RANGES (a1), r2 = ALLOCNO_LIVE_RANGES (a2);
537 r1 != NULL && r2 != NULL;)
539 if (r1->start > r2->finish)
541 else if (r2->start > r1->finish)
549 /* Return TRUE if live ranges of pseudo-registers REGNO1 and REGNO2
550 intersect. This should be used when there is only one region.
551 Currently this is used during reload. */
553 ira_pseudo_live_ranges_intersect_p (int regno1, int regno2)
555 ira_allocno_t a1, a2;
557 ira_assert (regno1 >= FIRST_PSEUDO_REGISTER
558 && regno2 >= FIRST_PSEUDO_REGISTER);
559 /* Reg info caclulated by dataflow infrastructure can be different
560 from one calculated by regclass. */
561 if ((a1 = ira_loop_tree_root->regno_allocno_map[regno1]) == NULL
562 || (a2 = ira_loop_tree_root->regno_allocno_map[regno2]) == NULL)
564 return ira_allocno_live_ranges_intersect_p (a1, a2);
567 /* Array used to collect all conflict allocnos for given allocno. */
568 static ira_allocno_t *collected_conflict_allocnos;
570 /* Build conflict vectors or bit conflict vectors (whatever is more
571 profitable) for allocno A from the conflict table and propagate the
572 conflicts to upper level allocno. */
574 build_allocno_conflicts (ira_allocno_t a)
576 int i, px, parent_num;
577 int conflict_bit_vec_words_num;
578 ira_loop_tree_node_t parent;
579 ira_allocno_t parent_a, another_a, another_parent_a;
581 IRA_INT_TYPE *allocno_conflicts;
582 ira_allocno_set_iterator asi;
584 allocno_conflicts = conflicts[ALLOCNO_NUM (a)];
586 FOR_EACH_ALLOCNO_IN_SET (allocno_conflicts,
587 ALLOCNO_MIN (a), ALLOCNO_MAX (a), i, asi)
589 another_a = ira_conflict_id_allocno_map[i];
590 ira_assert (ALLOCNO_COVER_CLASS (a)
591 == ALLOCNO_COVER_CLASS (another_a));
592 collected_conflict_allocnos[px++] = another_a;
594 if (ira_conflict_vector_profitable_p (a, px))
596 ira_allocate_allocno_conflict_vec (a, px);
597 vec = (ira_allocno_t*) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a);
598 memcpy (vec, collected_conflict_allocnos, sizeof (ira_allocno_t) * px);
600 ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = px;
604 ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = conflicts[ALLOCNO_NUM (a)];
605 if (ALLOCNO_MAX (a) < ALLOCNO_MIN (a))
606 conflict_bit_vec_words_num = 0;
608 conflict_bit_vec_words_num
609 = ((ALLOCNO_MAX (a) - ALLOCNO_MIN (a) + IRA_INT_BITS)
611 ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a)
612 = conflict_bit_vec_words_num * sizeof (IRA_INT_TYPE);
614 parent = ALLOCNO_LOOP_TREE_NODE (a)->parent;
615 if ((parent_a = ALLOCNO_CAP (a)) == NULL
617 || (parent_a = parent->regno_allocno_map[ALLOCNO_REGNO (a)])
620 ira_assert (parent != NULL);
621 ira_assert (ALLOCNO_COVER_CLASS (a) == ALLOCNO_COVER_CLASS (parent_a));
622 parent_num = ALLOCNO_NUM (parent_a);
623 FOR_EACH_ALLOCNO_IN_SET (allocno_conflicts,
624 ALLOCNO_MIN (a), ALLOCNO_MAX (a), i, asi)
626 another_a = ira_conflict_id_allocno_map[i];
627 ira_assert (ALLOCNO_COVER_CLASS (a)
628 == ALLOCNO_COVER_CLASS (another_a));
629 if ((another_parent_a = ALLOCNO_CAP (another_a)) == NULL
630 && (another_parent_a = (parent->regno_allocno_map
631 [ALLOCNO_REGNO (another_a)])) == NULL)
633 ira_assert (ALLOCNO_NUM (another_parent_a) >= 0);
634 ira_assert (ALLOCNO_COVER_CLASS (another_a)
635 == ALLOCNO_COVER_CLASS (another_parent_a));
636 SET_ALLOCNO_SET_BIT (conflicts[parent_num],
637 ALLOCNO_CONFLICT_ID (another_parent_a),
638 ALLOCNO_MIN (parent_a),
639 ALLOCNO_MAX (parent_a));
643 /* Build conflict vectors or bit conflict vectors (whatever is more
644 profitable) of all allocnos from the conflict table. */
646 build_conflicts (void)
649 ira_allocno_t a, cap;
651 collected_conflict_allocnos
652 = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t)
654 for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--)
655 for (a = ira_regno_allocno_map[i];
657 a = ALLOCNO_NEXT_REGNO_ALLOCNO (a))
659 build_allocno_conflicts (a);
660 for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap))
661 build_allocno_conflicts (cap);
663 ira_free (collected_conflict_allocnos);
668 /* Print hard reg set SET with TITLE to FILE. */
670 print_hard_reg_set (FILE *file, const char *title, HARD_REG_SET set)
674 fprintf (file, title);
675 for (start = -1, i = 0; i < FIRST_PSEUDO_REGISTER; i++)
677 if (TEST_HARD_REG_BIT (set, i))
679 if (i == 0 || ! TEST_HARD_REG_BIT (set, i - 1))
683 && (i == FIRST_PSEUDO_REGISTER - 1 || ! TEST_HARD_REG_BIT (set, i)))
686 fprintf (file, " %d", start);
687 else if (start == i - 2)
688 fprintf (file, " %d %d", start, start + 1);
690 fprintf (file, " %d-%d", start, i - 1);
694 fprintf (file, "\n");
697 /* Print information about allocno or only regno (if REG_P) conflicts
700 print_conflicts (FILE *file, bool reg_p)
703 ira_allocno_iterator ai;
704 HARD_REG_SET conflicting_hard_regs;
706 FOR_EACH_ALLOCNO (a, ai)
708 ira_allocno_t conflict_a;
709 ira_allocno_conflict_iterator aci;
713 fprintf (file, ";; r%d", ALLOCNO_REGNO (a));
716 fprintf (file, ";; a%d(r%d,", ALLOCNO_NUM (a), ALLOCNO_REGNO (a));
717 if ((bb = ALLOCNO_LOOP_TREE_NODE (a)->bb) != NULL)
718 fprintf (file, "b%d", bb->index);
720 fprintf (file, "l%d", ALLOCNO_LOOP_TREE_NODE (a)->loop->num);
723 fprintf (file, " conflicts:");
724 if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) != NULL)
725 FOR_EACH_ALLOCNO_CONFLICT (a, conflict_a, aci)
728 fprintf (file, " r%d,", ALLOCNO_REGNO (conflict_a));
731 fprintf (file, " a%d(r%d,", ALLOCNO_NUM (conflict_a),
732 ALLOCNO_REGNO (conflict_a));
733 if ((bb = ALLOCNO_LOOP_TREE_NODE (conflict_a)->bb) != NULL)
734 fprintf (file, "b%d)", bb->index);
736 fprintf (file, "l%d)",
737 ALLOCNO_LOOP_TREE_NODE (conflict_a)->loop->num);
740 COPY_HARD_REG_SET (conflicting_hard_regs,
741 ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
742 AND_COMPL_HARD_REG_SET (conflicting_hard_regs, ira_no_alloc_regs);
743 AND_HARD_REG_SET (conflicting_hard_regs,
744 reg_class_contents[ALLOCNO_COVER_CLASS (a)]);
745 print_hard_reg_set (file, "\n;; total conflict hard regs:",
746 conflicting_hard_regs);
747 COPY_HARD_REG_SET (conflicting_hard_regs,
748 ALLOCNO_CONFLICT_HARD_REGS (a));
749 AND_COMPL_HARD_REG_SET (conflicting_hard_regs, ira_no_alloc_regs);
750 AND_HARD_REG_SET (conflicting_hard_regs,
751 reg_class_contents[ALLOCNO_COVER_CLASS (a)]);
752 print_hard_reg_set (file, ";; conflict hard regs:",
753 conflicting_hard_regs);
755 fprintf (file, "\n");
758 /* Print information about allocno or only regno (if REG_P) conflicts
761 ira_debug_conflicts (bool reg_p)
763 print_conflicts (stderr, reg_p);
768 /* Entry function which builds allocno conflicts and allocno copies
769 and accumulate some allocno info on upper level regions. */
771 ira_build_conflicts (void)
774 ira_allocno_iterator ai;
778 build_conflict_bit_table ();
780 ira_traverse_loop_tree (true, ira_loop_tree_root, NULL, add_copies);
781 /* We need finished conflict table for the subsequent call. */
782 if (flag_ira_algorithm == IRA_ALGORITHM_REGIONAL
783 || flag_ira_algorithm == IRA_ALGORITHM_MIXED)
785 /* Now we can free memory for the conflict table (see function
786 build_allocno_conflicts for details). */
787 FOR_EACH_ALLOCNO (a, ai)
789 if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) != conflicts[ALLOCNO_NUM (a)])
790 ira_free (conflicts[ALLOCNO_NUM (a)]);
792 ira_free (conflicts);
794 FOR_EACH_ALLOCNO (a, ai)
796 if (ALLOCNO_CALLS_CROSSED_NUM (a) == 0)
798 if (! flag_caller_saves)
800 IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a),
802 if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0)
803 IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a),
808 IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a),
809 no_caller_save_reg_set);
810 if (ALLOCNO_CALLS_CROSSED_NUM (a) != 0)
811 IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a),
812 no_caller_save_reg_set);
815 if (optimize && internal_flag_ira_verbose > 2 && ira_dump_file != NULL)
816 print_conflicts (ira_dump_file, false);