gcc/ira-build.c

   1 /* Building internal representation for IRA.
   2    Copyright (C) 2006, 2007, 2008
   3    Free Software Foundation, Inc.
   4    Contributed by Vladimir Makarov <vmakarov@redhat.com>.
   5
   6 This file is part of GCC.
   7
   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
  11 version.
  12
  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
  16 for more details.
  17
  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/>.  */
  21
  22 #include "config.h"
  23 #include "system.h"
  24 #include "coretypes.h"
  25 #include "tm.h"
  26 #include "rtl.h"
  27 #include "tm_p.h"
  28 #include "target.h"
  29 #include "regs.h"
  30 #include "flags.h"
  31 #include "hard-reg-set.h"
  32 #include "basic-block.h"
  33 #include "insn-config.h"
  34 #include "recog.h"
  35 #include "toplev.h"
  36 #include "params.h"
  37 #include "df.h"
  38 #include "output.h"
  39 #include "reload.h"
  40 #include "sparseset.h"
  41 #include "ira-int.h"
  42
  43 static ira_copy_t find_allocno_copy (ira_allocno_t, ira_allocno_t, rtx,
  44                                      ira_loop_tree_node_t);
  45
  46 /* The root of the loop tree corresponding to the all function.  */
  47 ira_loop_tree_node_t ira_loop_tree_root;
  48
  49 /* Height of the loop tree.  */
  50 int ira_loop_tree_height;
  51
  52 /* All nodes representing basic blocks are referred through the
  53    following array.  We can not use basic block member `aux' for this
  54    because it is used for insertion of insns on edges.  */
  55 ira_loop_tree_node_t ira_bb_nodes;
  56
  57 /* All nodes representing loops are referred through the following
  58    array.  */
  59 ira_loop_tree_node_t ira_loop_nodes;
  60
  61 /* Map regno -> allocnos with given regno (see comments for
  62    allocno member `next_regno_allocno').  */
  63 ira_allocno_t *ira_regno_allocno_map;
  64
  65 /* Array of references to all allocnos.  The order number of the
  66    allocno corresponds to the index in the array.  Removed allocnos
  67    have NULL element value.  */
  68 ira_allocno_t *ira_allocnos;
  69
  70 /* Sizes of the previous array.  */
  71 int ira_allocnos_num;
  72
  73 /* Map conflict id -> allocno with given conflict id (see comments for
  74    allocno member `conflict_id').  */
  75 ira_allocno_t *ira_conflict_id_allocno_map;
  76
  77 /* Array of references to all copies.  The order number of the copy
  78    corresponds to the index in the array.  Removed copies have NULL
  79    element value.  */
  80 ira_copy_t *ira_copies;
  81
  82 /* Size of the previous array.  */
  83 int ira_copies_num;
  84
  85 \f
  86
  87 /* LAST_BASIC_BLOCK before generating additional insns because of live
  88    range splitting.  Emitting insns on a critical edge creates a new
  89    basic block.  */
  90 static int last_basic_block_before_change;
  91
  92 /* The following function allocates the loop tree nodes.  If LOOPS_P
  93    is FALSE, the nodes corresponding to the loops (except the root
  94    which corresponds the all function) will be not allocated but nodes
  95    will still be allocated for basic blocks.  */
  96 static void
  97 create_loop_tree_nodes (bool loops_p)
  98 {
  99   unsigned int i, j;
 100   int max_regno;
 101   bool skip_p;
 102   edge_iterator ei;
 103   edge e;
 104   VEC (edge, heap) *edges;
 105   loop_p loop;
 106
 107   ira_bb_nodes
 108     = ((struct ira_loop_tree_node *)
 109        ira_allocate (sizeof (struct ira_loop_tree_node) * last_basic_block));
 110   last_basic_block_before_change = last_basic_block;
 111   for (i = 0; i < (unsigned int) last_basic_block; i++)
 112     {
 113       ira_bb_nodes[i].regno_allocno_map = NULL;
 114       memset (ira_bb_nodes[i].reg_pressure, 0,
 115               sizeof (ira_bb_nodes[i].reg_pressure));
 116       ira_bb_nodes[i].all_allocnos = NULL;
 117       ira_bb_nodes[i].modified_regnos = NULL;
 118       ira_bb_nodes[i].border_allocnos = NULL;
 119       ira_bb_nodes[i].local_copies = NULL;
 120     }
 121   ira_loop_nodes = ((struct ira_loop_tree_node *)
 122                     ira_allocate (sizeof (struct ira_loop_tree_node)
 123                                   * VEC_length (loop_p, ira_loops.larray)));
 124   max_regno = max_reg_num ();
 125   for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++)
 126     {
 127       if (loop != ira_loops.tree_root)
 128         {
 129           ira_loop_nodes[i].regno_allocno_map = NULL;
 130           if (! loops_p)
 131             continue;
 132           skip_p = false;
 133           FOR_EACH_EDGE (e, ei, loop->header->preds)
 134             if (e->src != loop->latch
 135                 && (e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e))
 136               {
 137                 skip_p = true;
 138                 break;
 139               }
 140           if (skip_p)
 141             continue;
 142           edges = get_loop_exit_edges (loop);
 143           for (j = 0; VEC_iterate (edge, edges, j, e); j++)
 144             if ((e->flags & EDGE_ABNORMAL) && EDGE_CRITICAL_P (e))
 145               {
 146                 skip_p = true;
 147                 break;
 148               }
 149           VEC_free (edge, heap, edges);
 150           if (skip_p)
 151             continue;
 152         }
 153       ira_loop_nodes[i].regno_allocno_map
 154         = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t) * max_regno);
 155       memset (ira_loop_nodes[i].regno_allocno_map, 0,
 156               sizeof (ira_allocno_t) * max_regno);
 157       memset (ira_loop_nodes[i].reg_pressure, 0,
 158               sizeof (ira_loop_nodes[i].reg_pressure));
 159       ira_loop_nodes[i].all_allocnos = ira_allocate_bitmap ();
 160       ira_loop_nodes[i].modified_regnos = ira_allocate_bitmap ();
 161       ira_loop_nodes[i].border_allocnos = ira_allocate_bitmap ();
 162       ira_loop_nodes[i].local_copies = ira_allocate_bitmap ();
 163     }
 164 }
 165
 166 /* The function returns TRUE if there are more one allocation
 167    region.  */
 168 static bool
 169 more_one_region_p (void)
 170 {
 171   unsigned int i;
 172   loop_p loop;
 173
 174   for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++)
 175     if (ira_loop_nodes[i].regno_allocno_map != NULL
 176         && ira_loop_tree_root != &ira_loop_nodes[i])
 177       return true;
 178   return false;
 179 }
 180
 181 /* Free the loop tree node of a loop.  */
 182 static void
 183 finish_loop_tree_node (ira_loop_tree_node_t loop)
 184 {
 185   if (loop->regno_allocno_map != NULL)
 186     {
 187       ira_assert (loop->bb == NULL);
 188       ira_free_bitmap (loop->local_copies);
 189       ira_free_bitmap (loop->border_allocnos);
 190       ira_free_bitmap (loop->modified_regnos);
 191       ira_free_bitmap (loop->all_allocnos);
 192       ira_free (loop->regno_allocno_map);
 193       loop->regno_allocno_map = NULL;
 194     }
 195 }
 196
 197 /* Free the loop tree nodes.  */
 198 static void
 199 finish_loop_tree_nodes (void)
 200 {
 201   unsigned int i;
 202   loop_p loop;
 203
 204   for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++)
 205     finish_loop_tree_node (&ira_loop_nodes[i]);
 206   ira_free (ira_loop_nodes);
 207   for (i = 0; i < (unsigned int) last_basic_block_before_change; i++)
 208     {
 209       if (ira_bb_nodes[i].local_copies != NULL)
 210         ira_free_bitmap (ira_bb_nodes[i].local_copies);
 211       if (ira_bb_nodes[i].border_allocnos != NULL)
 212         ira_free_bitmap (ira_bb_nodes[i].border_allocnos);
 213       if (ira_bb_nodes[i].modified_regnos != NULL)
 214         ira_free_bitmap (ira_bb_nodes[i].modified_regnos);
 215       if (ira_bb_nodes[i].all_allocnos != NULL)
 216         ira_free_bitmap (ira_bb_nodes[i].all_allocnos);
 217       if (ira_bb_nodes[i].regno_allocno_map != NULL)
 218         ira_free (ira_bb_nodes[i].regno_allocno_map);
 219     }
 220   ira_free (ira_bb_nodes);
 221 }
 222
 223 \f
 224
 225 /* The following recursive function adds LOOP to the loop tree
 226    hierarchy.  LOOP is added only once.  */
 227 static void
 228 add_loop_to_tree (struct loop *loop)
 229 {
 230   struct loop *parent;
 231   ira_loop_tree_node_t loop_node, parent_node;
 232
 233   /* We can not use loop node access macros here because of potential
 234      checking and because the nodes are not initialized enough
 235      yet.  */
 236   if (loop_outer (loop) != NULL)
 237     add_loop_to_tree (loop_outer (loop));
 238   if (ira_loop_nodes[loop->num].regno_allocno_map != NULL
 239       && ira_loop_nodes[loop->num].children == NULL)
 240     {
 241       /* We have not added loop node to the tree yet.  */
 242       loop_node = &ira_loop_nodes[loop->num];
 243       loop_node->loop = loop;
 244       loop_node->bb = NULL;
 245       for (parent = loop_outer (loop);
 246            parent != NULL;
 247            parent = loop_outer (parent))
 248         if (ira_loop_nodes[parent->num].regno_allocno_map != NULL)
 249           break;
 250       if (parent == NULL)
 251         {
 252           loop_node->next = NULL;
 253           loop_node->subloop_next = NULL;
 254           loop_node->parent = NULL;
 255         }
 256       else
 257         {
 258           parent_node = &ira_loop_nodes[parent->num];
 259           loop_node->next = parent_node->children;
 260           parent_node->children = loop_node;
 261           loop_node->subloop_next = parent_node->subloops;
 262           parent_node->subloops = loop_node;
 263           loop_node->parent = parent_node;
 264         }
 265     }
 266 }
 267
 268 /* The following recursive function sets up levels of nodes of the
 269    tree given its root LOOP_NODE.  The enumeration starts with LEVEL.
 270    The function returns maximal value of level in the tree + 1.  */
 271 static int
 272 setup_loop_tree_level (ira_loop_tree_node_t loop_node, int level)
 273 {
 274   int height, max_height;
 275   ira_loop_tree_node_t subloop_node;
 276
 277   ira_assert (loop_node->bb == NULL);
 278   loop_node->level = level;
 279   max_height = level + 1;
 280   for (subloop_node = loop_node->subloops;
 281        subloop_node != NULL;
 282        subloop_node = subloop_node->subloop_next)
 283     {
 284       ira_assert (subloop_node->bb == NULL);
 285       height = setup_loop_tree_level (subloop_node, level + 1);
 286       if (height > max_height)
 287         max_height = height;
 288     }
 289   return max_height;
 290 }
 291
 292 /* Create the loop tree.  The algorithm is designed to provide correct
 293    order of loops (they are ordered by their last loop BB) and basic
 294    blocks in the chain formed by member next.  */
 295 static void
 296 form_loop_tree (void)
 297 {
 298   unsigned int i;
 299   basic_block bb;
 300   struct loop *parent;
 301   ira_loop_tree_node_t bb_node, loop_node;
 302   loop_p loop;
 303
 304   /* We can not use loop/bb node access macros because of potential
 305      checking and because the nodes are not initialized enough
 306      yet.  */
 307   for (i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++)
 308      if (ira_loop_nodes[i].regno_allocno_map != NULL)
 309        {
 310          ira_loop_nodes[i].children = NULL;
 311          ira_loop_nodes[i].subloops = NULL;
 312        }
 313   FOR_EACH_BB (bb)
 314     {
 315       bb_node = &ira_bb_nodes[bb->index];
 316       bb_node->bb = bb;
 317       bb_node->loop = NULL;
 318       bb_node->subloops = NULL;
 319       bb_node->children = NULL;
 320       bb_node->subloop_next = NULL;
 321       bb_node->next = NULL;
 322       for (parent = bb->loop_father;
 323            parent != NULL;
 324            parent = loop_outer (parent))
 325         if (ira_loop_nodes[parent->num].regno_allocno_map != NULL)
 326           break;
 327       add_loop_to_tree (parent);
 328       loop_node = &ira_loop_nodes[parent->num];
 329       bb_node->next = loop_node->children;
 330       bb_node->parent = loop_node;
 331       loop_node->children = bb_node;
 332     }
 333   ira_loop_tree_root = IRA_LOOP_NODE_BY_INDEX (ira_loops.tree_root->num);
 334   ira_loop_tree_height = setup_loop_tree_level (ira_loop_tree_root, 0);
 335   ira_assert (ira_loop_tree_root->regno_allocno_map != NULL);
 336 }
 337
 338 \f
 339
 340 /* Rebuild IRA_REGNO_ALLOCNO_MAP and REGNO_ALLOCNO_MAPs of the loop
 341    tree nodes.  */
 342 static void
 343 rebuild_regno_allocno_maps (void)
 344 {
 345   unsigned int l;
 346   int max_regno, regno;
 347   ira_allocno_t a;
 348   ira_loop_tree_node_t loop_tree_node;
 349   loop_p loop;
 350   ira_allocno_iterator ai;
 351
 352   max_regno = max_reg_num ();
 353   for (l = 0; VEC_iterate (loop_p, ira_loops.larray, l, loop); l++)
 354     if (ira_loop_nodes[l].regno_allocno_map != NULL)
 355       {
 356         ira_free (ira_loop_nodes[l].regno_allocno_map);
 357         ira_loop_nodes[l].regno_allocno_map
 358           = (ira_allocno_t *) ira_allocate (sizeof (ira_allocno_t)
 359                                             * max_regno);
 360         memset (ira_loop_nodes[l].regno_allocno_map, 0,
 361                 sizeof (ira_allocno_t) * max_regno);
 362       }
 363   ira_free (ira_regno_allocno_map);
 364   ira_regno_allocno_map
 365     = (ira_allocno_t *) ira_allocate (max_regno * sizeof (ira_allocno_t));
 366   memset (ira_regno_allocno_map, 0, max_regno * sizeof (ira_allocno_t));
 367   FOR_EACH_ALLOCNO (a, ai)
 368     {
 369       if (ALLOCNO_CAP_MEMBER (a) != NULL)
 370         /* Caps are not in the regno allocno maps.  */
 371         continue;
 372       regno = ALLOCNO_REGNO (a);
 373       loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a);
 374       ALLOCNO_NEXT_REGNO_ALLOCNO (a) = ira_regno_allocno_map[regno];
 375       ira_regno_allocno_map[regno] = a;
 376       if (loop_tree_node->regno_allocno_map[regno] == NULL)
 377         /* Remember that we can create temporary allocnos to break
 378            cycles in register shuffle.  */
 379         loop_tree_node->regno_allocno_map[regno] = a;
 380     }
 381 }
 382
 383 \f
 384
 385 /* Pools for allocnos and allocno live ranges.  */
 386 static alloc_pool allocno_pool, allocno_live_range_pool;
 387
 388 /* Vec containing references to all created allocnos.  It is a
 389    container of array allocnos.  */
 390 static VEC(ira_allocno_t,heap) *allocno_vec;
 391
 392 /* Vec containing references to all created allocnos.  It is a
 393    container of ira_conflict_id_allocno_map.  */
 394 static VEC(ira_allocno_t,heap) *ira_conflict_id_allocno_map_vec;
 395
 396 /* Initialize data concerning allocnos.  */
 397 static void
 398 initiate_allocnos (void)
 399 {
 400   allocno_live_range_pool
 401     = create_alloc_pool ("allocno live ranges",
 402                          sizeof (struct ira_allocno_live_range), 100);
 403   allocno_pool
 404     = create_alloc_pool ("allocnos", sizeof (struct ira_allocno), 100);
 405   allocno_vec = VEC_alloc (ira_allocno_t, heap, max_reg_num () * 2);
 406   ira_allocnos = NULL;
 407   ira_allocnos_num = 0;
 408   ira_conflict_id_allocno_map_vec
 409     = VEC_alloc (ira_allocno_t, heap, max_reg_num () * 2);
 410   ira_conflict_id_allocno_map = NULL;
 411   ira_regno_allocno_map
 412     = (ira_allocno_t *) ira_allocate (max_reg_num () * sizeof (ira_allocno_t));
 413   memset (ira_regno_allocno_map, 0, max_reg_num () * sizeof (ira_allocno_t));
 414 }
 415
 416 /* Create and return the allocno corresponding to REGNO in
 417    LOOP_TREE_NODE.  Add the allocno to the list of allocnos with the
 418    same regno if CAP_P is FALSE.  */
 419 ira_allocno_t
 420 ira_create_allocno (int regno, bool cap_p, ira_loop_tree_node_t loop_tree_node)
 421 {
 422   ira_allocno_t a;
 423
 424   a = (ira_allocno_t) pool_alloc (allocno_pool);
 425   ALLOCNO_REGNO (a) = regno;
 426   ALLOCNO_LOOP_TREE_NODE (a) = loop_tree_node;
 427   if (! cap_p)
 428     {
 429       ALLOCNO_NEXT_REGNO_ALLOCNO (a) = ira_regno_allocno_map[regno];
 430       ira_regno_allocno_map[regno] = a;
 431       if (loop_tree_node->regno_allocno_map[regno] == NULL)
 432         /* Remember that we can create temporary allocnos to break
 433            cycles in register shuffle on region borders (see
 434            ira-emit.c).  */
 435         loop_tree_node->regno_allocno_map[regno] = a;
 436     }
 437   ALLOCNO_CAP (a) = NULL;
 438   ALLOCNO_CAP_MEMBER (a) = NULL;
 439   ALLOCNO_NUM (a) = ira_allocnos_num;
 440   bitmap_set_bit (loop_tree_node->all_allocnos, ALLOCNO_NUM (a));
 441   ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = NULL;
 442   ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0;
 443   COPY_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a), ira_no_alloc_regs);
 444   COPY_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a), ira_no_alloc_regs);
 445   ALLOCNO_NREFS (a) = 0;
 446   ALLOCNO_FREQ (a) = 0;
 447   ALLOCNO_HARD_REGNO (a) = -1;
 448   ALLOCNO_CALL_FREQ (a) = 0;
 449   ALLOCNO_CALLS_CROSSED_NUM (a) = 0;
 450 #ifdef STACK_REGS
 451   ALLOCNO_NO_STACK_REG_P (a) = false;
 452   ALLOCNO_TOTAL_NO_STACK_REG_P (a) = false;
 453 #endif
 454   ALLOCNO_MEM_OPTIMIZED_DEST (a) = NULL;
 455   ALLOCNO_MEM_OPTIMIZED_DEST_P (a) = false;
 456   ALLOCNO_SOMEWHERE_RENAMED_P (a) = false;
 457   ALLOCNO_CHILD_RENAMED_P (a) = false;
 458   ALLOCNO_DONT_REASSIGN_P (a) = false;
 459   ALLOCNO_BAD_SPILL_P (a) = false;
 460   ALLOCNO_IN_GRAPH_P (a) = false;
 461   ALLOCNO_ASSIGNED_P (a) = false;
 462   ALLOCNO_MAY_BE_SPILLED_P (a) = false;
 463   ALLOCNO_SPLAY_REMOVED_P (a) = false;
 464   ALLOCNO_CONFLICT_VEC_P (a) = false;
 465   ALLOCNO_MODE (a) = (regno < 0 ? VOIDmode : PSEUDO_REGNO_MODE (regno));
 466   ALLOCNO_COPIES (a) = NULL;
 467   ALLOCNO_HARD_REG_COSTS (a) = NULL;
 468   ALLOCNO_CONFLICT_HARD_REG_COSTS (a) = NULL;
 469   ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL;
 470   ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL;
 471   ALLOCNO_LEFT_CONFLICTS_NUM (a) = -1;
 472   ALLOCNO_COVER_CLASS (a) = NO_REGS;
 473   ALLOCNO_UPDATED_COVER_CLASS_COST (a) = 0;
 474   ALLOCNO_COVER_CLASS_COST (a) = 0;
 475   ALLOCNO_MEMORY_COST (a) = 0;
 476   ALLOCNO_UPDATED_MEMORY_COST (a) = 0;
 477   ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a) = 0;
 478   ALLOCNO_NEXT_BUCKET_ALLOCNO (a) = NULL;
 479   ALLOCNO_PREV_BUCKET_ALLOCNO (a) = NULL;
 480   ALLOCNO_FIRST_COALESCED_ALLOCNO (a) = a;
 481   ALLOCNO_NEXT_COALESCED_ALLOCNO (a) = a;
 482   ALLOCNO_LIVE_RANGES (a) = NULL;
 483   ALLOCNO_MIN (a) = INT_MAX;
 484   ALLOCNO_MAX (a) = -1;
 485   ALLOCNO_CONFLICT_ID (a) = ira_allocnos_num;
 486   VEC_safe_push (ira_allocno_t, heap, allocno_vec, a);
 487   ira_allocnos = VEC_address (ira_allocno_t, allocno_vec);
 488   ira_allocnos_num = VEC_length (ira_allocno_t, allocno_vec);
 489   VEC_safe_push (ira_allocno_t, heap, ira_conflict_id_allocno_map_vec, a);
 490   ira_conflict_id_allocno_map
 491     = VEC_address (ira_allocno_t, ira_conflict_id_allocno_map_vec);
 492   return a;
 493 }
 494
 495 /* Set up cover class for A and update its conflict hard registers.  */
 496 void
 497 ira_set_allocno_cover_class (ira_allocno_t a, enum reg_class cover_class)
 498 {
 499   ALLOCNO_COVER_CLASS (a) = cover_class;
 500   IOR_COMPL_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (a),
 501                           reg_class_contents[cover_class]);
 502   IOR_COMPL_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a),
 503                           reg_class_contents[cover_class]);
 504 }
 505
 506 /* Return TRUE if the conflict vector with NUM elements is more
 507    profitable than conflict bit vector for A.  */
 508 bool
 509 ira_conflict_vector_profitable_p (ira_allocno_t a, int num)
 510 {
 511   int nw;
 512
 513   if (ALLOCNO_MAX (a) < ALLOCNO_MIN (a))
 514     /* We prefer bit vector in such case because it does not result in
 515        allocation.  */
 516     return false;
 517
 518   nw = (ALLOCNO_MAX (a) - ALLOCNO_MIN (a) + IRA_INT_BITS) / IRA_INT_BITS;
 519   return (2 * sizeof (ira_allocno_t) * (num + 1)
 520           < 3 * nw * sizeof (IRA_INT_TYPE));
 521 }
 522
 523 /* Allocates and initialize the conflict vector of A for NUM
 524    conflicting allocnos.  */
 525 void
 526 ira_allocate_allocno_conflict_vec (ira_allocno_t a, int num)
 527 {
 528   int size;
 529   ira_allocno_t *vec;
 530
 531   ira_assert (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) == NULL);
 532   num++; /* for NULL end marker  */
 533   size = sizeof (ira_allocno_t) * num;
 534   ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = ira_allocate (size);
 535   vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a);
 536   vec[0] = NULL;
 537   ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0;
 538   ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) = size;
 539   ALLOCNO_CONFLICT_VEC_P (a) = true;
 540 }
 541
 542 /* Allocate and initialize the conflict bit vector of A.  */
 543 static void
 544 allocate_allocno_conflict_bit_vec (ira_allocno_t a)
 545 {
 546   unsigned int size;
 547
 548   ira_assert (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) == NULL);
 549   size = ((ALLOCNO_MAX (a) - ALLOCNO_MIN (a) + IRA_INT_BITS)
 550           / IRA_INT_BITS * sizeof (IRA_INT_TYPE));
 551   ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) = ira_allocate (size);
 552   memset (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a), 0, size);
 553   ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) = size;
 554   ALLOCNO_CONFLICT_VEC_P (a) = false;
 555 }
 556
 557 /* Allocate and initialize the conflict vector or conflict bit vector
 558    of A for NUM conflicting allocnos whatever is more profitable.  */
 559 void
 560 ira_allocate_allocno_conflicts (ira_allocno_t a, int num)
 561 {
 562   if (ira_conflict_vector_profitable_p (a, num))
 563     ira_allocate_allocno_conflict_vec (a, num);
 564   else
 565     allocate_allocno_conflict_bit_vec (a);
 566 }
 567
 568 /* Add A2 to the conflicts of A1.  */
 569 static void
 570 add_to_allocno_conflicts (ira_allocno_t a1, ira_allocno_t a2)
 571 {
 572   int num;
 573   unsigned int size;
 574
 575   if (ALLOCNO_CONFLICT_VEC_P (a1))
 576     {
 577       ira_allocno_t *vec;
 578
 579       num = ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1) + 2;
 580       if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1)
 581           >=  num * sizeof (ira_allocno_t))
 582         vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1);
 583       else
 584         {
 585           size = (3 * num / 2 + 1) * sizeof (ira_allocno_t);
 586           vec = (ira_allocno_t *) ira_allocate (size);
 587           memcpy (vec, ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1),
 588                   sizeof (ira_allocno_t) * ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1));
 589           ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1));
 590           ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec;
 591           ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size;
 592         }
 593       vec[num - 2] = a2;
 594       vec[num - 1] = NULL;
 595       ALLOCNO_CONFLICT_ALLOCNOS_NUM (a1)++;
 596     }
 597   else
 598     {
 599       int nw, added_head_nw, id;
 600       IRA_INT_TYPE *vec;
 601
 602       id = ALLOCNO_CONFLICT_ID (a2);
 603       vec = (IRA_INT_TYPE *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1);
 604       if (ALLOCNO_MIN (a1) > id)
 605         {
 606           /* Expand head of the bit vector.  */
 607           added_head_nw = (ALLOCNO_MIN (a1) - id - 1) / IRA_INT_BITS + 1;
 608           nw = (ALLOCNO_MAX (a1) - ALLOCNO_MIN (a1)) / IRA_INT_BITS + 1;
 609           size = (nw + added_head_nw) * sizeof (IRA_INT_TYPE);
 610           if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) >= size)
 611             {
 612               memmove ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE),
 613                        vec, nw * sizeof (IRA_INT_TYPE));
 614               memset (vec, 0, added_head_nw * sizeof (IRA_INT_TYPE));
 615             }
 616           else
 617             {
 618               size
 619                 = (3 * (nw + added_head_nw) / 2 + 1) * sizeof (IRA_INT_TYPE);
 620               vec = (IRA_INT_TYPE *) ira_allocate (size);
 621               memcpy ((char *) vec + added_head_nw * sizeof (IRA_INT_TYPE),
 622                       ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1),
 623                       nw * sizeof (IRA_INT_TYPE));
 624               memset (vec, 0, added_head_nw * sizeof (IRA_INT_TYPE));
 625               memset ((char *) vec
 626                       + (nw + added_head_nw) * sizeof (IRA_INT_TYPE),
 627                       0, size - (nw + added_head_nw) * sizeof (IRA_INT_TYPE));
 628               ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1));
 629               ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec;
 630               ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size;
 631             }
 632           ALLOCNO_MIN (a1) -= added_head_nw * IRA_INT_BITS;
 633         }
 634       else if (ALLOCNO_MAX (a1) < id)
 635         {
 636           nw = (id - ALLOCNO_MIN (a1)) / IRA_INT_BITS + 1;
 637           size = nw * sizeof (IRA_INT_TYPE);
 638           if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) < size)
 639             {
 640               /* Expand tail of the bit vector.  */
 641               size = (3 * nw / 2 + 1) * sizeof (IRA_INT_TYPE);
 642               vec = (IRA_INT_TYPE *) ira_allocate (size);
 643               memcpy (vec, ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1),
 644                       ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1));
 645               memset ((char *) vec + ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1),
 646                       0, size - ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1));
 647               ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1));
 648               ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a1) = vec;
 649               ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a1) = size;
 650             }
 651           ALLOCNO_MAX (a1) = id;
 652         }
 653       SET_ALLOCNO_SET_BIT (vec, id, ALLOCNO_MIN (a1), ALLOCNO_MAX (a1));
 654     }
 655 }
 656
 657 /* Add A1 to the conflicts of A2 and vise versa.  */
 658 void
 659 ira_add_allocno_conflict (ira_allocno_t a1, ira_allocno_t a2)
 660 {
 661   add_to_allocno_conflicts (a1, a2);
 662   add_to_allocno_conflicts (a2, a1);
 663 }
 664
 665 /* Clear all conflicts of allocno A.  */
 666 static void
 667 clear_allocno_conflicts (ira_allocno_t a)
 668 {
 669   if (ALLOCNO_CONFLICT_VEC_P (a))
 670     {
 671       ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = 0;
 672       ((ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a))[0] = NULL;
 673     }
 674   else if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY_SIZE (a) != 0)
 675     {
 676       int nw;
 677
 678       nw = (ALLOCNO_MAX (a) - ALLOCNO_MIN (a)) / IRA_INT_BITS + 1;
 679       memset (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a), 0,
 680               nw * sizeof (IRA_INT_TYPE));
 681     }
 682 }
 683
 684 /* The array used to find duplications in conflict vectors of
 685    allocnos.  */
 686 static int *allocno_conflict_check;
 687
 688 /* The value used to mark allocation presence in conflict vector of
 689    the current allocno.  */
 690 static int curr_allocno_conflict_check_tick;
 691
 692 /* Remove duplications in conflict vector of A.  */
 693 static void
 694 compress_allocno_conflict_vec (ira_allocno_t a)
 695 {
 696   ira_allocno_t *vec, conflict_a;
 697   int i, j;
 698
 699   ira_assert (ALLOCNO_CONFLICT_VEC_P (a));
 700   vec = (ira_allocno_t *) ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a);
 701   curr_allocno_conflict_check_tick++;
 702   for (i = j = 0; (conflict_a = vec[i]) != NULL; i++)
 703     {
 704       if (allocno_conflict_check[ALLOCNO_NUM (conflict_a)]
 705           != curr_allocno_conflict_check_tick)
 706         {
 707           allocno_conflict_check[ALLOCNO_NUM (conflict_a)]
 708             = curr_allocno_conflict_check_tick;
 709           vec[j++] = conflict_a;
 710         }
 711     }
 712   ALLOCNO_CONFLICT_ALLOCNOS_NUM (a) = j;
 713   vec[j] = NULL;
 714 }
 715
 716 /* Remove duplications in conflict vectors of all allocnos.  */
 717 static void
 718 compress_conflict_vecs (void)
 719 {
 720   ira_allocno_t a;
 721   ira_allocno_iterator ai;
 722
 723   allocno_conflict_check
 724     = (int *) ira_allocate (sizeof (int) * ira_allocnos_num);
 725   memset (allocno_conflict_check, 0, sizeof (int) * ira_allocnos_num);
 726   curr_allocno_conflict_check_tick = 0;
 727   FOR_EACH_ALLOCNO (a, ai)
 728     if (ALLOCNO_CONFLICT_VEC_P (a))
 729       compress_allocno_conflict_vec (a);
 730   ira_free (allocno_conflict_check);
 731 }
 732
 733 /* This recursive function outputs allocno A and if it is a cap the
 734    function outputs its members.  */
 735 void
 736 ira_print_expanded_allocno (ira_allocno_t a)
 737 {
 738   basic_block bb;
 739
 740   fprintf (ira_dump_file, " a%d(r%d", ALLOCNO_NUM (a), ALLOCNO_REGNO (a));
 741   if ((bb = ALLOCNO_LOOP_TREE_NODE (a)->bb) != NULL)
 742     fprintf (ira_dump_file, ",b%d", bb->index);
 743   else
 744     fprintf (ira_dump_file, ",l%d", ALLOCNO_LOOP_TREE_NODE (a)->loop->num);
 745   if (ALLOCNO_CAP_MEMBER (a) != NULL)
 746     {
 747       fprintf (ira_dump_file, ":");
 748       ira_print_expanded_allocno (ALLOCNO_CAP_MEMBER (a));
 749     }
 750   fprintf (ira_dump_file, ")");
 751 }
 752
 753 /* Create and return the cap representing allocno A in the
 754    parent loop.  */
 755 static ira_allocno_t
 756 create_cap_allocno (ira_allocno_t a)
 757 {
 758   ira_allocno_t cap;
 759   ira_loop_tree_node_t parent;
 760   enum reg_class cover_class;
 761
 762   ira_assert (ALLOCNO_FIRST_COALESCED_ALLOCNO (a) == a
 763               && ALLOCNO_NEXT_COALESCED_ALLOCNO (a) == a);
 764   parent = ALLOCNO_LOOP_TREE_NODE (a)->parent;
 765   cap = ira_create_allocno (ALLOCNO_REGNO (a), true, parent);
 766   ALLOCNO_MODE (cap) = ALLOCNO_MODE (a);
 767   cover_class = ALLOCNO_COVER_CLASS (a);
 768   ira_set_allocno_cover_class (cap, cover_class);
 769   ALLOCNO_AVAILABLE_REGS_NUM (cap) = ALLOCNO_AVAILABLE_REGS_NUM (a);
 770   ALLOCNO_CAP_MEMBER (cap) = a;
 771   ALLOCNO_CAP (a) = cap;
 772   ALLOCNO_COVER_CLASS_COST (cap) = ALLOCNO_COVER_CLASS_COST (a);
 773   ALLOCNO_MEMORY_COST (cap) = ALLOCNO_MEMORY_COST (a);
 774   ira_allocate_and_copy_costs
 775     (&ALLOCNO_HARD_REG_COSTS (cap), cover_class, ALLOCNO_HARD_REG_COSTS (a));
 776   ira_allocate_and_copy_costs
 777     (&ALLOCNO_CONFLICT_HARD_REG_COSTS (cap), cover_class,
 778      ALLOCNO_CONFLICT_HARD_REG_COSTS (a));
 779   ALLOCNO_BAD_SPILL_P (cap) = ALLOCNO_BAD_SPILL_P (a);
 780   ALLOCNO_NREFS (cap) = ALLOCNO_NREFS (a);
 781   ALLOCNO_FREQ (cap) = ALLOCNO_FREQ (a);
 782   ALLOCNO_CALL_FREQ (cap) = ALLOCNO_CALL_FREQ (a);
 783   IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (cap),
 784                     ALLOCNO_CONFLICT_HARD_REGS (a));
 785   IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (cap),
 786                     ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
 787   ALLOCNO_CALLS_CROSSED_NUM (cap) = ALLOCNO_CALLS_CROSSED_NUM (a);
 788 #ifdef STACK_REGS
 789   ALLOCNO_NO_STACK_REG_P (cap) = ALLOCNO_NO_STACK_REG_P (a);
 790   ALLOCNO_TOTAL_NO_STACK_REG_P (cap) = ALLOCNO_TOTAL_NO_STACK_REG_P (a);
 791 #endif
 792   if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL)
 793     {
 794       fprintf (ira_dump_file, "    Creating cap ");
 795       ira_print_expanded_allocno (cap);
 796       fprintf (ira_dump_file, "\n");
 797     }
 798   return cap;
 799 }
 800
 801 /* Create and return allocno live range with given attributes.  */
 802 allocno_live_range_t
 803 ira_create_allocno_live_range (ira_allocno_t a, int start, int finish,
 804                                allocno_live_range_t next)
 805 {
 806   allocno_live_range_t p;
 807
 808   p = (allocno_live_range_t) pool_alloc (allocno_live_range_pool);
 809   p->allocno = a;
 810   p->start = start;
 811   p->finish = finish;
 812   p->next = next;
 813   return p;
 814 }
 815
 816 /* Copy allocno live range R and return the result.  */
 817 static allocno_live_range_t
 818 copy_allocno_live_range (allocno_live_range_t r)
 819 {
 820   allocno_live_range_t p;
 821
 822   p = (allocno_live_range_t) pool_alloc (allocno_live_range_pool);
 823   *p = *r;
 824   return p;
 825 }
 826
 827 /* Copy allocno live range list given by its head R and return the
 828    result.  */
 829 allocno_live_range_t
 830 ira_copy_allocno_live_range_list (allocno_live_range_t r)
 831 {
 832   allocno_live_range_t p, first, last;
 833
 834   if (r == NULL)
 835     return NULL;
 836   for (first = last = NULL; r != NULL; r = r->next)
 837     {
 838       p = copy_allocno_live_range (r);
 839       if (first == NULL)
 840         first = p;
 841       else
 842         last->next = p;
 843       last = p;
 844     }
 845   return first;
 846 }
 847
 848 /* Merge ranges R1 and R2 and returns the result.  The function
 849    maintains the order of ranges and tries to minimize number of the
 850    result ranges.  */
 851 allocno_live_range_t
 852 ira_merge_allocno_live_ranges (allocno_live_range_t r1,
 853                                allocno_live_range_t r2)
 854 {
 855   allocno_live_range_t first, last, temp;
 856
 857   if (r1 == NULL)
 858     return r2;
 859   if (r2 == NULL)
 860     return r1;
 861   for (first = last = NULL; r1 != NULL && r2 != NULL;)
 862     {
 863       if (r1->start < r2->start)
 864         {
 865           temp = r1;
 866           r1 = r2;
 867           r2 = temp;
 868         }
 869       if (r1->start <= r2->finish + 1)
 870         {
 871           /* Intersected ranges: merge r1 and r2 into r1.  */
 872           r1->start = r2->start;
 873           if (r1->finish < r2->finish)
 874             r1->finish = r2->finish;
 875           temp = r2;
 876           r2 = r2->next;
 877           ira_finish_allocno_live_range (temp);
 878           if (r2 == NULL)
 879             {
 880               /* To try to merge with subsequent ranges in r1.  */
 881               r2 = r1->next;
 882               r1->next = NULL;
 883             }
 884         }
 885       else
 886         {
 887           /* Add r1 to the result.  */
 888           if (first == NULL)
 889             first = last = r1;
 890           else
 891             {
 892               last->next = r1;
 893               last = r1;
 894             }
 895           r1 = r1->next;
 896           if (r1 == NULL)
 897             {
 898               /* To try to merge with subsequent ranges in r2.  */
 899               r1 = r2->next;
 900               r2->next = NULL;
 901             }
 902         }
 903     }
 904   if (r1 != NULL)
 905     {
 906       if (first == NULL)
 907         first = r1;
 908       else
 909         last->next = r1;
 910       ira_assert (r1->next == NULL);
 911     }
 912   else if (r2 != NULL)
 913     {
 914       if (first == NULL)
 915         first = r2;
 916       else
 917         last->next = r2;
 918       ira_assert (r2->next == NULL);
 919     }
 920   else
 921     {
 922       ira_assert (last->next == NULL);
 923     }
 924   return first;
 925 }
 926
 927 /* Return TRUE if live ranges R1 and R2 intersect.  */
 928 bool
 929 ira_allocno_live_ranges_intersect_p (allocno_live_range_t r1,
 930                                      allocno_live_range_t r2)
 931 {
 932   /* Remember the live ranges are always kept ordered.  */
 933   while (r1 != NULL && r2 != NULL)
 934     {
 935       if (r1->start > r2->finish)
 936         r1 = r1->next;
 937       else if (r2->start > r1->finish)
 938         r2 = r2->next;
 939       else
 940         return true;
 941     }
 942   return false;
 943 }
 944
 945 /* Free allocno live range R.  */
 946 void
 947 ira_finish_allocno_live_range (allocno_live_range_t r)
 948 {
 949   pool_free (allocno_live_range_pool, r);
 950 }
 951
 952 /* Free list of allocno live ranges starting with R.  */
 953 void
 954 ira_finish_allocno_live_range_list (allocno_live_range_t r)
 955 {
 956   allocno_live_range_t next_r;
 957
 958   for (; r != NULL; r = next_r)
 959     {
 960       next_r = r->next;
 961       ira_finish_allocno_live_range (r);
 962     }
 963 }
 964
 965 /* Free updated register costs of allocno A.  */
 966 void
 967 ira_free_allocno_updated_costs (ira_allocno_t a)
 968 {
 969   enum reg_class cover_class;
 970
 971   cover_class = ALLOCNO_COVER_CLASS (a);
 972   if (ALLOCNO_UPDATED_HARD_REG_COSTS (a) != NULL)
 973     ira_free_cost_vector (ALLOCNO_UPDATED_HARD_REG_COSTS (a), cover_class);
 974   ALLOCNO_UPDATED_HARD_REG_COSTS (a) = NULL;
 975   if (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) != NULL)
 976     ira_free_cost_vector (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a),
 977                           cover_class);
 978   ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) = NULL;
 979 }
 980
 981 /* Free the memory allocated for allocno A.  */
 982 static void
 983 finish_allocno (ira_allocno_t a)
 984 {
 985   enum reg_class cover_class = ALLOCNO_COVER_CLASS (a);
 986
 987   ira_allocnos[ALLOCNO_NUM (a)] = NULL;
 988   ira_conflict_id_allocno_map[ALLOCNO_CONFLICT_ID (a)] = NULL;
 989   if (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a) != NULL)
 990     ira_free (ALLOCNO_CONFLICT_ALLOCNO_ARRAY (a));
 991   if (ALLOCNO_HARD_REG_COSTS (a) != NULL)
 992     ira_free_cost_vector (ALLOCNO_HARD_REG_COSTS (a), cover_class);
 993   if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) != NULL)
 994     ira_free_cost_vector (ALLOCNO_CONFLICT_HARD_REG_COSTS (a), cover_class);
 995   if (ALLOCNO_UPDATED_HARD_REG_COSTS (a) != NULL)
 996     ira_free_cost_vector (ALLOCNO_UPDATED_HARD_REG_COSTS (a), cover_class);
 997   if (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) != NULL)
 998     ira_free_cost_vector (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a),
 999                           cover_class);
1000   ira_finish_allocno_live_range_list (ALLOCNO_LIVE_RANGES (a));
1001   pool_free (allocno_pool, a);
1002 }
1003
1004 /* Free the memory allocated for all allocnos.  */
1005 static void
1006 finish_allocnos (void)
1007 {
1008   ira_allocno_t a;
1009   ira_allocno_iterator ai;
1010
1011   FOR_EACH_ALLOCNO (a, ai)
1012     finish_allocno (a);
1013   ira_free (ira_regno_allocno_map);
1014   VEC_free (ira_allocno_t, heap, ira_conflict_id_allocno_map_vec);
1015   VEC_free (ira_allocno_t, heap, allocno_vec);
1016   free_alloc_pool (allocno_pool);
1017   free_alloc_pool (allocno_live_range_pool);
1018 }
1019
1020 \f
1021
1022 /* Pools for copies.  */
1023 static alloc_pool copy_pool;
1024
1025 /* Vec containing references to all created copies.  It is a
1026    container of array ira_copies.  */
1027 static VEC(ira_copy_t,heap) *copy_vec;
1028
1029 /* The function initializes data concerning allocno copies.  */
1030 static void
1031 initiate_copies (void)
1032 {
1033   copy_pool
1034     = create_alloc_pool ("copies", sizeof (struct ira_allocno_copy), 100);
1035   copy_vec = VEC_alloc (ira_copy_t, heap, get_max_uid ());
1036   ira_copies = NULL;
1037   ira_copies_num = 0;
1038 }
1039
1040 /* Return copy connecting A1 and A2 and originated from INSN of
1041    LOOP_TREE_NODE if any.  */
1042 static ira_copy_t
1043 find_allocno_copy (ira_allocno_t a1, ira_allocno_t a2, rtx insn,
1044                    ira_loop_tree_node_t loop_tree_node)
1045 {
1046   ira_copy_t cp, next_cp;
1047   ira_allocno_t another_a;
1048
1049   for (cp = ALLOCNO_COPIES (a1); cp != NULL; cp = next_cp)
1050     {
1051       if (cp->first == a1)
1052         {
1053           next_cp = cp->next_first_allocno_copy;
1054           another_a = cp->second;
1055         }
1056       else if (cp->second == a1)
1057         {
1058           next_cp = cp->next_second_allocno_copy;
1059           another_a = cp->first;
1060         }
1061       else
1062         gcc_unreachable ();
1063       if (another_a == a2 && cp->insn == insn
1064           && cp->loop_tree_node == loop_tree_node)
1065         return cp;
1066     }
1067   return NULL;
1068 }
1069
1070 /* Create and return copy with given attributes LOOP_TREE_NODE, FIRST,
1071    SECOND, FREQ, CONSTRAINT_P, and INSN.  */
1072 ira_copy_t
1073 ira_create_copy (ira_allocno_t first, ira_allocno_t second, int freq,
1074                  bool constraint_p, rtx insn,
1075                  ira_loop_tree_node_t loop_tree_node)
1076 {
1077   ira_copy_t cp;
1078
1079   cp = (ira_copy_t) pool_alloc (copy_pool);
1080   cp->num = ira_copies_num;
1081   cp->first = first;
1082   cp->second = second;
1083   cp->freq = freq;
1084   cp->constraint_p = constraint_p;
1085   cp->insn = insn;
1086   cp->loop_tree_node = loop_tree_node;
1087   VEC_safe_push (ira_copy_t, heap, copy_vec, cp);
1088   ira_copies = VEC_address (ira_copy_t, copy_vec);
1089   ira_copies_num = VEC_length (ira_copy_t, copy_vec);
1090   return cp;
1091 }
1092
1093 /* Attach a copy CP to allocnos involved into the copy.  */
1094 void
1095 ira_add_allocno_copy_to_list (ira_copy_t cp)
1096 {
1097   ira_allocno_t first = cp->first, second = cp->second;
1098
1099   cp->prev_first_allocno_copy = NULL;
1100   cp->prev_second_allocno_copy = NULL;
1101   cp->next_first_allocno_copy = ALLOCNO_COPIES (first);
1102   if (cp->next_first_allocno_copy != NULL)
1103     {
1104       if (cp->next_first_allocno_copy->first == first)
1105         cp->next_first_allocno_copy->prev_first_allocno_copy = cp;
1106       else
1107         cp->next_first_allocno_copy->prev_second_allocno_copy = cp;
1108     }
1109   cp->next_second_allocno_copy = ALLOCNO_COPIES (second);
1110   if (cp->next_second_allocno_copy != NULL)
1111     {
1112       if (cp->next_second_allocno_copy->second == second)
1113         cp->next_second_allocno_copy->prev_second_allocno_copy = cp;
1114       else
1115         cp->next_second_allocno_copy->prev_first_allocno_copy = cp;
1116     }
1117   ALLOCNO_COPIES (first) = cp;
1118   ALLOCNO_COPIES (second) = cp;
1119 }
1120
1121 /* Detach a copy CP from allocnos involved into the copy.  */
1122 void
1123 ira_remove_allocno_copy_from_list (ira_copy_t cp)
1124 {
1125   ira_allocno_t first = cp->first, second = cp->second;
1126   ira_copy_t prev, next;
1127
1128   next = cp->next_first_allocno_copy;
1129   prev = cp->prev_first_allocno_copy;
1130   if (prev == NULL)
1131     ALLOCNO_COPIES (first) = next;
1132   else if (prev->first == first)
1133     prev->next_first_allocno_copy = next;
1134   else
1135     prev->next_second_allocno_copy = next;
1136   if (next != NULL)
1137     {
1138       if (next->first == first)
1139         next->prev_first_allocno_copy = prev;
1140       else
1141         next->prev_second_allocno_copy = prev;
1142     }
1143   cp->prev_first_allocno_copy = cp->next_first_allocno_copy = NULL;
1144
1145   next = cp->next_second_allocno_copy;
1146   prev = cp->prev_second_allocno_copy;
1147   if (prev == NULL)
1148     ALLOCNO_COPIES (second) = next;
1149   else if (prev->second == second)
1150     prev->next_second_allocno_copy = next;
1151   else
1152     prev->next_first_allocno_copy = next;
1153   if (next != NULL)
1154     {
1155       if (next->second == second)
1156         next->prev_second_allocno_copy = prev;
1157       else
1158         next->prev_first_allocno_copy = prev;
1159     }
1160   cp->prev_second_allocno_copy = cp->next_second_allocno_copy = NULL;
1161 }
1162
1163 /* Make a copy CP a canonical copy where number of the
1164    first allocno is less than the second one.  */
1165 void
1166 ira_swap_allocno_copy_ends_if_necessary (ira_copy_t cp)
1167 {
1168   ira_allocno_t temp;
1169   ira_copy_t temp_cp;
1170
1171   if (ALLOCNO_NUM (cp->first) <= ALLOCNO_NUM (cp->second))
1172     return;
1173
1174   temp = cp->first;
1175   cp->first = cp->second;
1176   cp->second = temp;
1177
1178   temp_cp = cp->prev_first_allocno_copy;
1179   cp->prev_first_allocno_copy = cp->prev_second_allocno_copy;
1180   cp->prev_second_allocno_copy = temp_cp;
1181
1182   temp_cp = cp->next_first_allocno_copy;
1183   cp->next_first_allocno_copy = cp->next_second_allocno_copy;
1184   cp->next_second_allocno_copy = temp_cp;
1185 }
1186
1187 /* Create (or update frequency if the copy already exists) and return
1188    the copy of allocnos FIRST and SECOND with frequency FREQ
1189    corresponding to move insn INSN (if any) and originated from
1190    LOOP_TREE_NODE.  */
1191 ira_copy_t
1192 ira_add_allocno_copy (ira_allocno_t first, ira_allocno_t second, int freq,
1193                       bool constraint_p, rtx insn,
1194                       ira_loop_tree_node_t loop_tree_node)
1195 {
1196   ira_copy_t cp;
1197
1198   if ((cp = find_allocno_copy (first, second, insn, loop_tree_node)) != NULL)
1199     {
1200       cp->freq += freq;
1201       return cp;
1202     }
1203   cp = ira_create_copy (first, second, freq, constraint_p, insn,
1204                         loop_tree_node);
1205   ira_assert (first != NULL && second != NULL);
1206   ira_add_allocno_copy_to_list (cp);
1207   ira_swap_allocno_copy_ends_if_necessary (cp);
1208   return cp;
1209 }
1210
1211 /* Print info about copy CP into file F.  */
1212 static void
1213 print_copy (FILE *f, ira_copy_t cp)
1214 {
1215   fprintf (f, "  cp%d:a%d(r%d)<->a%d(r%d)@%d:%s\n", cp->num,
1216            ALLOCNO_NUM (cp->first), ALLOCNO_REGNO (cp->first),
1217            ALLOCNO_NUM (cp->second), ALLOCNO_REGNO (cp->second), cp->freq,
1218            cp->insn != NULL
1219            ? "move" : cp->constraint_p ? "constraint" : "shuffle");
1220 }
1221
1222 /* Print info about copy CP into stderr.  */
1223 void
1224 ira_debug_copy (ira_copy_t cp)
1225 {
1226   print_copy (stderr, cp);
1227 }
1228
1229 /* Print info about all copies into file F.  */
1230 static void
1231 print_copies (FILE *f)
1232 {
1233   ira_copy_t cp;
1234   ira_copy_iterator ci;
1235
1236   FOR_EACH_COPY (cp, ci)
1237     print_copy (f, cp);
1238 }
1239
1240 /* Print info about all copies into stderr.  */
1241 void
1242 ira_debug_copies (void)
1243 {
1244   print_copies (stderr);
1245 }
1246
1247 /* Print info about copies involving allocno A into file F.  */
1248 static void
1249 print_allocno_copies (FILE *f, ira_allocno_t a)
1250 {
1251   ira_allocno_t another_a;
1252   ira_copy_t cp, next_cp;
1253
1254   fprintf (f, " a%d(r%d):", ALLOCNO_NUM (a), ALLOCNO_REGNO (a));
1255   for (cp = ALLOCNO_COPIES (a); cp != NULL; cp = next_cp)
1256     {
1257       if (cp->first == a)
1258         {
1259           next_cp = cp->next_first_allocno_copy;
1260           another_a = cp->second;
1261         }
1262       else if (cp->second == a)
1263         {
1264           next_cp = cp->next_second_allocno_copy;
1265           another_a = cp->first;
1266         }
1267       else
1268         gcc_unreachable ();
1269       fprintf (f, " cp%d:a%d(r%d)@%d", cp->num,
1270                ALLOCNO_NUM (another_a), ALLOCNO_REGNO (another_a), cp->freq);
1271     }
1272   fprintf (f, "\n");
1273 }
1274
1275 /* Print info about copies involving allocno A into stderr.  */
1276 void
1277 ira_debug_allocno_copies (ira_allocno_t a)
1278 {
1279   print_allocno_copies (stderr, a);
1280 }
1281
1282 /* The function frees memory allocated for copy CP.  */
1283 static void
1284 finish_copy (ira_copy_t cp)
1285 {
1286   pool_free (copy_pool, cp);
1287 }
1288
1289
1290 /* Free memory allocated for all copies.  */
1291 static void
1292 finish_copies (void)
1293 {
1294   ira_copy_t cp;
1295   ira_copy_iterator ci;
1296
1297   FOR_EACH_COPY (cp, ci)
1298     finish_copy (cp);
1299   VEC_free (ira_copy_t, heap, copy_vec);
1300   free_alloc_pool (copy_pool);
1301 }
1302
1303 \f
1304
1305 /* Pools for cost vectors.  It is defined only for cover classes.  */
1306 static alloc_pool cost_vector_pool[N_REG_CLASSES];
1307
1308 /* The function initiates work with hard register cost vectors.  It
1309    creates allocation pool for each cover class.  */
1310 static void
1311 initiate_cost_vectors (void)
1312 {
1313   int i;
1314   enum reg_class cover_class;
1315
1316   for (i = 0; i < ira_reg_class_cover_size; i++)
1317     {
1318       cover_class = ira_reg_class_cover[i];
1319       cost_vector_pool[cover_class]
1320         = create_alloc_pool ("cost vectors",
1321                              sizeof (int)
1322                              * ira_class_hard_regs_num[cover_class],
1323                              100);
1324     }
1325 }
1326
1327 /* Allocate and return a cost vector VEC for COVER_CLASS.  */
1328 int *
1329 ira_allocate_cost_vector (enum reg_class cover_class)
1330 {
1331   return (int *) pool_alloc (cost_vector_pool[cover_class]);
1332 }
1333
1334 /* Free a cost vector VEC for COVER_CLASS.  */
1335 void
1336 ira_free_cost_vector (int *vec, enum reg_class cover_class)
1337 {
1338   ira_assert (vec != NULL);
1339   pool_free (cost_vector_pool[cover_class], vec);
1340 }
1341
1342 /* Finish work with hard register cost vectors.  Release allocation
1343    pool for each cover class.  */
1344 static void
1345 finish_cost_vectors (void)
1346 {
1347   int i;
1348   enum reg_class cover_class;
1349
1350   for (i = 0; i < ira_reg_class_cover_size; i++)
1351     {
1352       cover_class = ira_reg_class_cover[i];
1353       free_alloc_pool (cost_vector_pool[cover_class]);
1354     }
1355 }
1356
1357 \f
1358
1359 /* The current loop tree node and its regno allocno map.  */
1360 ira_loop_tree_node_t ira_curr_loop_tree_node;
1361 ira_allocno_t *ira_curr_regno_allocno_map;
1362
1363 /* This recursive function traverses loop tree with root LOOP_NODE
1364    calling non-null functions PREORDER_FUNC and POSTORDER_FUNC
1365    correspondingly in preorder and postorder.  The function sets up
1366    IRA_CURR_LOOP_TREE_NODE and IRA_CURR_REGNO_ALLOCNO_MAP.  If BB_P,
1367    basic block nodes of LOOP_NODE is also processed (before its
1368    subloop nodes).  */
1369 void
1370 ira_traverse_loop_tree (bool bb_p, ira_loop_tree_node_t loop_node,
1371                         void (*preorder_func) (ira_loop_tree_node_t),
1372                         void (*postorder_func) (ira_loop_tree_node_t))
1373 {
1374   ira_loop_tree_node_t subloop_node;
1375
1376   ira_assert (loop_node->bb == NULL);
1377   ira_curr_loop_tree_node = loop_node;
1378   ira_curr_regno_allocno_map = ira_curr_loop_tree_node->regno_allocno_map;
1379
1380   if (preorder_func != NULL)
1381     (*preorder_func) (loop_node);
1382
1383   if (bb_p)
1384     for (subloop_node = loop_node->children;
1385          subloop_node != NULL;
1386          subloop_node = subloop_node->next)
1387       if (subloop_node->bb != NULL)
1388         {
1389           if (preorder_func != NULL)
1390             (*preorder_func) (subloop_node);
1391
1392           if (postorder_func != NULL)
1393             (*postorder_func) (subloop_node);
1394         }
1395
1396   for (subloop_node = loop_node->subloops;
1397        subloop_node != NULL;
1398        subloop_node = subloop_node->subloop_next)
1399     {
1400       ira_assert (subloop_node->bb == NULL);
1401       ira_traverse_loop_tree (bb_p, subloop_node,
1402                               preorder_func, postorder_func);
1403     }
1404
1405   ira_curr_loop_tree_node = loop_node;
1406   ira_curr_regno_allocno_map = ira_curr_loop_tree_node->regno_allocno_map;
1407
1408   if (postorder_func != NULL)
1409     (*postorder_func) (loop_node);
1410 }
1411
1412 \f
1413
1414 /* The basic block currently being processed.  */
1415 static basic_block curr_bb;
1416
1417 /* This recursive function creates allocnos corresponding to
1418    pseudo-registers containing in X.  True OUTPUT_P means that X is
1419    a lvalue.  */
1420 static void
1421 create_insn_allocnos (rtx x, bool output_p)
1422 {
1423   int i, j;
1424   const char *fmt;
1425   enum rtx_code code = GET_CODE (x);
1426
1427   if (code == REG)
1428     {
1429       int regno;
1430
1431       if ((regno = REGNO (x)) >= FIRST_PSEUDO_REGISTER)
1432         {
1433           ira_allocno_t a;
1434
1435           if ((a = ira_curr_regno_allocno_map[regno]) == NULL)
1436             a = ira_create_allocno (regno, false, ira_curr_loop_tree_node);
1437
1438           ALLOCNO_NREFS (a)++;
1439           ALLOCNO_FREQ (a) += REG_FREQ_FROM_BB (curr_bb);
1440           if (output_p)
1441             bitmap_set_bit (ira_curr_loop_tree_node->modified_regnos, regno);
1442         }
1443       return;
1444     }
1445   else if (code == SET)
1446     {
1447       create_insn_allocnos (SET_DEST (x), true);
1448       create_insn_allocnos (SET_SRC (x), false);
1449       return;
1450     }
1451   else if (code == CLOBBER)
1452     {
1453       create_insn_allocnos (XEXP (x, 0), true);
1454       return;
1455     }
1456   else if (code == MEM)
1457     {
1458       create_insn_allocnos (XEXP (x, 0), false);
1459       return;
1460     }
1461   else if (code == PRE_DEC || code == POST_DEC || code == PRE_INC ||
1462            code == POST_INC || code == POST_MODIFY || code == PRE_MODIFY)
1463     {
1464       create_insn_allocnos (XEXP (x, 0), true);
1465       create_insn_allocnos (XEXP (x, 0), false);
1466       return;
1467     }
1468
1469   fmt = GET_RTX_FORMAT (code);
1470   for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
1471     {
1472       if (fmt[i] == 'e')
1473         create_insn_allocnos (XEXP (x, i), output_p);
1474       else if (fmt[i] == 'E')
1475         for (j = 0; j < XVECLEN (x, i); j++)
1476           create_insn_allocnos (XVECEXP (x, i, j), output_p);
1477     }
1478 }
1479
1480 /* Create allocnos corresponding to pseudo-registers living in the
1481    basic block represented by the corresponding loop tree node
1482    BB_NODE.  */
1483 static void
1484 create_bb_allocnos (ira_loop_tree_node_t bb_node)
1485 {
1486   basic_block bb;
1487   rtx insn;
1488   unsigned int i;
1489   bitmap_iterator bi;
1490
1491   curr_bb = bb = bb_node->bb;
1492   ira_assert (bb != NULL);
1493   FOR_BB_INSNS_REVERSE (bb, insn)
1494     if (INSN_P (insn))
1495       create_insn_allocnos (PATTERN (insn), false);
1496   /* It might be a allocno living through from one subloop to
1497      another.  */
1498   EXECUTE_IF_SET_IN_REG_SET (DF_LR_IN (bb), FIRST_PSEUDO_REGISTER, i, bi)
1499     if (ira_curr_regno_allocno_map[i] == NULL)
1500       ira_create_allocno (i, false, ira_curr_loop_tree_node);
1501 }
1502
1503 /* Create allocnos corresponding to pseudo-registers living on edge E
1504    (a loop entry or exit).  Also mark the allocnos as living on the
1505    loop border. */
1506 static void
1507 create_loop_allocnos (edge e)
1508 {
1509   unsigned int i;
1510   bitmap live_in_regs, border_allocnos;
1511   bitmap_iterator bi;
1512   ira_loop_tree_node_t parent;
1513
1514   live_in_regs = DF_LR_IN (e->dest);
1515   border_allocnos = ira_curr_loop_tree_node->border_allocnos;
1516   EXECUTE_IF_SET_IN_REG_SET (DF_LR_OUT (e->src),
1517                              FIRST_PSEUDO_REGISTER, i, bi)
1518     if (bitmap_bit_p (live_in_regs, i))
1519       {
1520         if (ira_curr_regno_allocno_map[i] == NULL)
1521           {
1522             /* The order of creations is important for right
1523                ira_regno_allocno_map.  */
1524             if ((parent = ira_curr_loop_tree_node->parent) != NULL
1525                 && parent->regno_allocno_map[i] == NULL)
1526               ira_create_allocno (i, false, parent);
1527             ira_create_allocno (i, false, ira_curr_loop_tree_node);
1528           }
1529         bitmap_set_bit (border_allocnos,
1530                         ALLOCNO_NUM (ira_curr_regno_allocno_map[i]));
1531       }
1532 }
1533
1534 /* Create allocnos corresponding to pseudo-registers living in loop
1535    represented by the corresponding loop tree node LOOP_NODE.  This
1536    function is called by ira_traverse_loop_tree.  */
1537 static void
1538 create_loop_tree_node_allocnos (ira_loop_tree_node_t loop_node)
1539 {
1540   if (loop_node->bb != NULL)
1541     create_bb_allocnos (loop_node);
1542   else if (loop_node != ira_loop_tree_root)
1543     {
1544       int i;
1545       edge_iterator ei;
1546       edge e;
1547       VEC (edge, heap) *edges;
1548
1549       FOR_EACH_EDGE (e, ei, loop_node->loop->header->preds)
1550         if (e->src != loop_node->loop->latch)
1551           create_loop_allocnos (e);
1552
1553       edges = get_loop_exit_edges (loop_node->loop);
1554       for (i = 0; VEC_iterate (edge, edges, i, e); i++)
1555         create_loop_allocnos (e);
1556       VEC_free (edge, heap, edges);
1557     }
1558 }
1559
1560 /* Propagate information about allocnos modified inside the loop given
1561    by its LOOP_TREE_NODE to its parent.  */
1562 static void
1563 propagate_modified_regnos (ira_loop_tree_node_t loop_tree_node)
1564 {
1565   if (loop_tree_node == ira_loop_tree_root)
1566     return;
1567   ira_assert (loop_tree_node->bb == NULL);
1568   bitmap_ior_into (loop_tree_node->parent->modified_regnos,
1569                    loop_tree_node->modified_regnos);
1570 }
1571
1572 /* Propagate new info about allocno A (see comments about accumulated
1573    info in allocno definition) to the corresponding allocno on upper
1574    loop tree level.  So allocnos on upper levels accumulate
1575    information about the corresponding allocnos in nested regions.
1576    The new info means allocno info finally calculated in this
1577    file.  */
1578 static void
1579 propagate_allocno_info (void)
1580 {
1581   int i;
1582   ira_allocno_t a, parent_a;
1583   ira_loop_tree_node_t parent;
1584   enum reg_class cover_class;
1585
1586   if (flag_ira_algorithm != IRA_ALGORITHM_REGIONAL
1587       && flag_ira_algorithm != IRA_ALGORITHM_MIXED)
1588     return;
1589   for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--)
1590     for (a = ira_regno_allocno_map[i];
1591          a != NULL;
1592          a = ALLOCNO_NEXT_REGNO_ALLOCNO (a))
1593       if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) != NULL
1594           && (parent_a = parent->regno_allocno_map[i]) != NULL
1595           /* There are no caps yet at this point.  So use
1596              border_allocnos to find allocnos for the propagation.  */
1597           && bitmap_bit_p (ALLOCNO_LOOP_TREE_NODE (a)->border_allocnos,
1598                            ALLOCNO_NUM (a)))
1599         {
1600           if (! ALLOCNO_BAD_SPILL_P (a))
1601             ALLOCNO_BAD_SPILL_P (parent_a) = false;
1602           ALLOCNO_NREFS (parent_a) += ALLOCNO_NREFS (a);
1603           ALLOCNO_FREQ (parent_a) += ALLOCNO_FREQ (a);
1604           ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a);
1605 #ifdef STACK_REGS
1606           if (ALLOCNO_TOTAL_NO_STACK_REG_P (a))
1607             ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true;
1608 #endif
1609           IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a),
1610                             ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
1611           ALLOCNO_CALLS_CROSSED_NUM (parent_a)
1612             += ALLOCNO_CALLS_CROSSED_NUM (a);
1613           ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a)
1614             += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a);
1615           cover_class = ALLOCNO_COVER_CLASS (a);
1616           ira_assert (cover_class == ALLOCNO_COVER_CLASS (parent_a));
1617           ira_allocate_and_accumulate_costs
1618             (&ALLOCNO_HARD_REG_COSTS (parent_a), cover_class,
1619              ALLOCNO_HARD_REG_COSTS (a));
1620           ira_allocate_and_accumulate_costs
1621             (&ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a),
1622              cover_class,
1623              ALLOCNO_CONFLICT_HARD_REG_COSTS (a));
1624           ALLOCNO_COVER_CLASS_COST (parent_a)
1625             += ALLOCNO_COVER_CLASS_COST (a);
1626           ALLOCNO_MEMORY_COST (parent_a) += ALLOCNO_MEMORY_COST (a);
1627         }
1628 }
1629
1630 /* Create allocnos corresponding to pseudo-registers in the current
1631    function.  Traverse the loop tree for this.  */
1632 static void
1633 create_allocnos (void)
1634 {
1635   /* We need to process BB first to correctly link allocnos by member
1636      next_regno_allocno.  */
1637   ira_traverse_loop_tree (true, ira_loop_tree_root,
1638                           create_loop_tree_node_allocnos, NULL);
1639   if (optimize)
1640     ira_traverse_loop_tree (false, ira_loop_tree_root, NULL,
1641                             propagate_modified_regnos);
1642 }
1643
1644 \f
1645
1646 /* The page contains function to remove some regions from a separate
1647    register allocation.  We remove regions whose separate allocation
1648    will hardly improve the result.  As a result we speed up regional
1649    register allocation.  */
1650
1651 /* The function changes allocno in range list given by R onto A.  */
1652 static void
1653 change_allocno_in_range_list (allocno_live_range_t r, ira_allocno_t a)
1654 {
1655   for (; r != NULL; r = r->next)
1656     r->allocno = a;
1657 }
1658
1659 /* Return TRUE if NODE represents a loop with low register
1660    pressure.  */
1661 static bool
1662 low_pressure_loop_node_p (ira_loop_tree_node_t node)
1663 {
1664   int i;
1665   enum reg_class cover_class;
1666
1667   if (node->bb != NULL)
1668     return false;
1669
1670   for (i = 0; i < ira_reg_class_cover_size; i++)
1671     {
1672       cover_class = ira_reg_class_cover[i];
1673       if (node->reg_pressure[cover_class]
1674           > ira_available_class_regs[cover_class])
1675         return false;
1676     }
1677   return true;
1678 }
1679
1680 /* Sort loops for marking them for removal.  We put already marked
1681    loops first, then less frequent loops next, and then outer loops
1682    next.  */
1683 static int
1684 loop_compare_func (const void *v1p, const void *v2p)
1685 {
1686   int diff;
1687   ira_loop_tree_node_t l1 = *(const ira_loop_tree_node_t *) v1p;
1688   ira_loop_tree_node_t l2 = *(const ira_loop_tree_node_t *) v2p;
1689
1690   ira_assert (l1->parent != NULL && l2->parent != NULL);
1691   if (l1->to_remove_p && ! l2->to_remove_p)
1692     return -1;
1693   if (! l1->to_remove_p && l2->to_remove_p)
1694     return 1;
1695   if ((diff = l1->loop->header->frequency - l2->loop->header->frequency) != 0)
1696     return diff;
1697   if ((diff = (int) loop_depth (l1->loop) - (int) loop_depth (l2->loop)) != 0)
1698     return diff;
1699   /* Make sorting stable.  */
1700   return l1->loop->num - l2->loop->num;
1701 }
1702
1703
1704 /* Mark loops which should be removed from regional allocation.  We
1705    remove a loop with low register pressure inside another loop with
1706    register pressure.  In this case a separate allocation of the loop
1707    hardly helps (for irregular register file architecture it could
1708    help by choosing a better hard register in the loop but we prefer
1709    faster allocation even in this case).  We also remove cheap loops
1710    if there are more than IRA_MAX_LOOPS_NUM of them.  */
1711 static void
1712 mark_loops_for_removal (void)
1713 {
1714   int i, n;
1715   ira_loop_tree_node_t *sorted_loops;
1716   loop_p loop;
1717
1718   sorted_loops
1719     = (ira_loop_tree_node_t *) ira_allocate (sizeof (ira_loop_tree_node_t)
1720                                              * VEC_length (loop_p,
1721                                                            ira_loops.larray));
1722   for (n = i = 0; VEC_iterate (loop_p, ira_loops.larray, i, loop); i++)
1723     if (ira_loop_nodes[i].regno_allocno_map != NULL)
1724       {
1725         if (ira_loop_nodes[i].parent == NULL)
1726           {
1727             /* Don't remove the root.  */
1728             ira_loop_nodes[i].to_remove_p = false;
1729             continue;
1730           }
1731         sorted_loops[n++] = &ira_loop_nodes[i];
1732         ira_loop_nodes[i].to_remove_p
1733           = (low_pressure_loop_node_p (ira_loop_nodes[i].parent)
1734              && low_pressure_loop_node_p (&ira_loop_nodes[i]));
1735       }
1736   qsort (sorted_loops, n, sizeof (ira_loop_tree_node_t), loop_compare_func);
1737   for (i = 0; n - i + 1 > IRA_MAX_LOOPS_NUM; i++)
1738     {
1739       sorted_loops[i]->to_remove_p = true;
1740       if (internal_flag_ira_verbose > 1 && ira_dump_file != NULL)
1741         fprintf
1742           (ira_dump_file,
1743            "  Mark loop %d (header %d, freq %d, depth %d) for removal (%s)\n",
1744            sorted_loops[i]->loop->num, sorted_loops[i]->loop->header->index,
1745            sorted_loops[i]->loop->header->frequency,
1746            loop_depth (sorted_loops[i]->loop),
1747            low_pressure_loop_node_p (sorted_loops[i]->parent)
1748            && low_pressure_loop_node_p (sorted_loops[i])
1749            ? "low pressure" : "cheap loop");
1750     }
1751   ira_free (sorted_loops);
1752 }
1753
1754
1755 /* Definition of vector of loop tree nodes.  */
1756 DEF_VEC_P(ira_loop_tree_node_t);
1757 DEF_VEC_ALLOC_P(ira_loop_tree_node_t, heap);
1758
1759 /* Vec containing references to all removed loop tree nodes.  */
1760 static VEC(ira_loop_tree_node_t,heap) *removed_loop_vec;
1761
1762 /* Vec containing references to all children of loop tree nodes.  */
1763 static VEC(ira_loop_tree_node_t,heap) *children_vec;
1764
1765 /* Remove subregions of NODE if their separate allocation will not
1766    improve the result.  */
1767 static void
1768 remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_node_t node)
1769 {
1770   unsigned int start;
1771   bool remove_p;
1772   ira_loop_tree_node_t subnode;
1773
1774   remove_p = node->to_remove_p;
1775   if (! remove_p)
1776     VEC_safe_push (ira_loop_tree_node_t, heap, children_vec, node);
1777   start = VEC_length (ira_loop_tree_node_t, children_vec);
1778   for (subnode = node->children; subnode != NULL; subnode = subnode->next)
1779     if (subnode->bb == NULL)
1780       remove_uneccesary_loop_nodes_from_loop_tree (subnode);
1781     else
1782       VEC_safe_push (ira_loop_tree_node_t, heap, children_vec, subnode);
1783   node->children = node->subloops = NULL;
1784   if (remove_p)
1785     {
1786       VEC_safe_push (ira_loop_tree_node_t, heap, removed_loop_vec, node);
1787       return;
1788     }
1789   while (VEC_length (ira_loop_tree_node_t, children_vec) > start)
1790     {
1791       subnode = VEC_pop (ira_loop_tree_node_t, children_vec);
1792       subnode->parent = node;
1793       subnode->next = node->children;
1794       node->children = subnode;
1795       if (subnode->bb == NULL)
1796         {
1797           subnode->subloop_next = node->subloops;
1798           node->subloops = subnode;
1799         }
1800     }
1801 }
1802
1803 /* Remove allocnos from loops removed from the allocation
1804    consideration.  */
1805 static void
1806 remove_unnecessary_allocnos (void)
1807 {
1808   int regno;
1809   bool merged_p;
1810   enum reg_class cover_class;
1811   ira_allocno_t a, prev_a, next_a, parent_a;
1812   ira_loop_tree_node_t a_node, parent;
1813   allocno_live_range_t r;
1814
1815   merged_p = false;
1816   for (regno = max_reg_num () - 1; regno >= FIRST_PSEUDO_REGISTER; regno--)
1817     for (prev_a = NULL, a = ira_regno_allocno_map[regno];
1818          a != NULL;
1819          a = next_a)
1820       {
1821         next_a = ALLOCNO_NEXT_REGNO_ALLOCNO (a);
1822         a_node = ALLOCNO_LOOP_TREE_NODE (a);
1823         if (! a_node->to_remove_p)
1824           prev_a = a;
1825         else
1826           {
1827             for (parent = a_node->parent;
1828                  (parent_a = parent->regno_allocno_map[regno]) == NULL
1829                    && parent->to_remove_p;
1830                  parent = parent->parent)
1831               ;
1832             if (parent_a == NULL)
1833               {
1834                 /* There are no allocnos with the same regno in upper
1835                    region -- just move the allocno to the upper
1836                    region.  */
1837                 prev_a = a;
1838                 ALLOCNO_LOOP_TREE_NODE (a) = parent;
1839                 parent->regno_allocno_map[regno] = a;
1840                 bitmap_set_bit (parent->all_allocnos, ALLOCNO_NUM (a));
1841               }
1842             else
1843               {
1844                 /* Remove the allocno and update info of allocno in
1845                    the upper region.  */
1846                 if (prev_a == NULL)
1847                   ira_regno_allocno_map[regno] = next_a;
1848                 else
1849                   ALLOCNO_NEXT_REGNO_ALLOCNO (prev_a) = next_a;
1850                 r = ALLOCNO_LIVE_RANGES (a);
1851                 change_allocno_in_range_list (r, parent_a);
1852                 ALLOCNO_LIVE_RANGES (parent_a)
1853                   = ira_merge_allocno_live_ranges
1854                     (r, ALLOCNO_LIVE_RANGES (parent_a));
1855                 merged_p = true;
1856                 ALLOCNO_LIVE_RANGES (a) = NULL;
1857                 IOR_HARD_REG_SET (ALLOCNO_CONFLICT_HARD_REGS (parent_a),
1858                                   ALLOCNO_CONFLICT_HARD_REGS (a));
1859 #ifdef STACK_REGS
1860                 if (ALLOCNO_NO_STACK_REG_P (a))
1861                   ALLOCNO_NO_STACK_REG_P (parent_a) = true;
1862 #endif
1863                 ALLOCNO_NREFS (parent_a) += ALLOCNO_NREFS (a);
1864                 ALLOCNO_FREQ (parent_a) += ALLOCNO_FREQ (a);
1865                 ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a);
1866                 IOR_HARD_REG_SET
1867                   (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a),
1868                    ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
1869                 ALLOCNO_CALLS_CROSSED_NUM (parent_a)
1870                   += ALLOCNO_CALLS_CROSSED_NUM (a);
1871                 ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a)
1872                   += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a);
1873                 if (! ALLOCNO_BAD_SPILL_P (a))
1874                   ALLOCNO_BAD_SPILL_P (parent_a) = false;
1875 #ifdef STACK_REGS
1876                 if (ALLOCNO_TOTAL_NO_STACK_REG_P (a))
1877                   ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true;
1878 #endif
1879                 cover_class = ALLOCNO_COVER_CLASS (a);
1880                 ira_assert (cover_class == ALLOCNO_COVER_CLASS (parent_a));
1881                 ira_allocate_and_accumulate_costs
1882                   (&ALLOCNO_HARD_REG_COSTS (parent_a), cover_class,
1883                    ALLOCNO_HARD_REG_COSTS (a));
1884                 ira_allocate_and_accumulate_costs
1885                   (&ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a),
1886                    cover_class,
1887                    ALLOCNO_CONFLICT_HARD_REG_COSTS (a));
1888                 ALLOCNO_COVER_CLASS_COST (parent_a)
1889                   += ALLOCNO_COVER_CLASS_COST (a);
1890                 ALLOCNO_MEMORY_COST (parent_a) += ALLOCNO_MEMORY_COST (a);
1891                 finish_allocno (a);
1892               }
1893           }
1894       }
1895   if (merged_p)
1896     ira_rebuild_start_finish_chains ();
1897 }
1898
1899 /* Remove loops from consideration.  We remove loops for which a
1900    separate allocation will not improve the result.  We have to do
1901    this after allocno creation and their costs and cover class
1902    evaluation because only after that the register pressure can be
1903    known and is calculated.  */
1904 static void
1905 remove_unnecessary_regions (void)
1906 {
1907   mark_loops_for_removal ();
1908   children_vec
1909     = VEC_alloc (ira_loop_tree_node_t, heap,
1910                  last_basic_block + VEC_length (loop_p, ira_loops.larray));
1911   removed_loop_vec
1912     = VEC_alloc (ira_loop_tree_node_t, heap,
1913                  last_basic_block + VEC_length (loop_p, ira_loops.larray));
1914   remove_uneccesary_loop_nodes_from_loop_tree (ira_loop_tree_root) ;
1915   VEC_free (ira_loop_tree_node_t, heap, children_vec);
1916   remove_unnecessary_allocnos ();
1917   while (VEC_length (ira_loop_tree_node_t, removed_loop_vec) > 0)
1918     finish_loop_tree_node (VEC_pop (ira_loop_tree_node_t, removed_loop_vec));
1919   VEC_free (ira_loop_tree_node_t, heap, removed_loop_vec);
1920 }
1921
1922 \f
1923
1924 /* At this point true value of allocno attribute bad_spill_p means
1925    that there is an insn where allocno occurs and where the allocno
1926    can not be used as memory.  The function updates the attribute, now
1927    it can be true only for allocnos which can not be used as memory in
1928    an insn and in whose live ranges there is other allocno deaths.
1929    Spilling allocnos with true value will not improve the code because
1930    it will not make other allocnos colorable and additional reloads
1931    for the corresponding pseudo will be generated in reload pass for
1932    each insn it occurs.
1933
1934    This is a trick mentioned in one classic article of Chaitin etc
1935    which is frequently omitted in other implementations of RA based on
1936    graph coloring.  */
1937 static void
1938 update_bad_spill_attribute (void)
1939 {
1940   int i;
1941   ira_allocno_t a;
1942   ira_allocno_iterator ai;
1943   allocno_live_range_t r;
1944   enum reg_class cover_class;
1945   bitmap_head dead_points[N_REG_CLASSES];
1946
1947   for (i = 0; i < ira_reg_class_cover_size; i++)
1948     {
1949       cover_class = ira_reg_class_cover[i];
1950       bitmap_initialize (&dead_points[cover_class], &reg_obstack);
1951     }
1952   FOR_EACH_ALLOCNO (a, ai)
1953     {
1954       cover_class = ALLOCNO_COVER_CLASS (a);
1955       if (cover_class == NO_REGS)
1956         continue;
1957       for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next)
1958         bitmap_set_bit (&dead_points[cover_class], r->finish);
1959     }
1960   FOR_EACH_ALLOCNO (a, ai)
1961     {
1962       cover_class = ALLOCNO_COVER_CLASS (a);
1963       if (cover_class == NO_REGS)
1964         continue;
1965       if (! ALLOCNO_BAD_SPILL_P (a))
1966         continue;
1967       for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next)
1968         {
1969           for (i = r->start + 1; i < r->finish; i++)
1970             if (bitmap_bit_p (&dead_points[cover_class], i))
1971               break;
1972           if (i < r->finish)
1973             break;
1974         }
1975       if (r != NULL)
1976         ALLOCNO_BAD_SPILL_P (a) = false;
1977     }
1978   for (i = 0; i < ira_reg_class_cover_size; i++)
1979     {
1980       cover_class = ira_reg_class_cover[i];
1981       bitmap_clear (&dead_points[cover_class]);
1982     }
1983 }
1984
1985 \f
1986
1987 /* Set up minimal and maximal live range points for allocnos.  */
1988 static void
1989 setup_min_max_allocno_live_range_point (void)
1990 {
1991   int i;
1992   ira_allocno_t a, parent_a, cap;
1993   ira_allocno_iterator ai;
1994   allocno_live_range_t r;
1995   ira_loop_tree_node_t parent;
1996
1997   FOR_EACH_ALLOCNO (a, ai)
1998     {
1999       r = ALLOCNO_LIVE_RANGES (a);
2000       if (r == NULL)
2001         continue;
2002       ALLOCNO_MAX (a) = r->finish;
2003       for (; r->next != NULL; r = r->next)
2004         ;
2005       ALLOCNO_MIN (a) = r->start;
2006     }
2007   for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--)
2008     for (a = ira_regno_allocno_map[i];
2009          a != NULL;
2010          a = ALLOCNO_NEXT_REGNO_ALLOCNO (a))
2011       {
2012         if (ALLOCNO_MAX (a) < 0)
2013           continue;
2014         ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL);
2015         /* Accumulation of range info.  */
2016         if (ALLOCNO_CAP (a) != NULL)
2017           {
2018             for (cap = ALLOCNO_CAP (a); cap != NULL; cap = ALLOCNO_CAP (cap))
2019               {
2020                 if (ALLOCNO_MAX (cap) < ALLOCNO_MAX (a))
2021                   ALLOCNO_MAX (cap) = ALLOCNO_MAX (a);
2022                 if (ALLOCNO_MIN (cap) > ALLOCNO_MIN (a))
2023                   ALLOCNO_MIN (cap) = ALLOCNO_MIN (a);
2024               }
2025             continue;
2026           }
2027         if ((parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL)
2028           continue;
2029         parent_a = parent->regno_allocno_map[i];
2030         if (ALLOCNO_MAX (parent_a) < ALLOCNO_MAX (a))
2031           ALLOCNO_MAX (parent_a) = ALLOCNO_MAX (a);
2032         if (ALLOCNO_MIN (parent_a) > ALLOCNO_MIN (a))
2033           ALLOCNO_MIN (parent_a) = ALLOCNO_MIN (a);
2034       }
2035 #ifdef ENABLE_IRA_CHECKING
2036   FOR_EACH_ALLOCNO (a, ai)
2037     {
2038       if ((0 <= ALLOCNO_MIN (a) && ALLOCNO_MIN (a) <= ira_max_point)
2039           && (0 <= ALLOCNO_MAX (a) && ALLOCNO_MAX (a) <= ira_max_point))
2040         continue;
2041       gcc_unreachable ();
2042     }
2043 #endif
2044 }
2045
2046 /* Sort allocnos according to their live ranges.  Allocnos with
2047    smaller cover class are put first.  Allocnos with the same cove
2048    class are ordered according their start (min).  Allocnos with the
2049    same start are ordered according their finish (max).  */
2050 static int
2051 allocno_range_compare_func (const void *v1p, const void *v2p)
2052 {
2053   int diff;
2054   ira_allocno_t a1 = *(const ira_allocno_t *) v1p;
2055   ira_allocno_t a2 = *(const ira_allocno_t *) v2p;
2056
2057   if ((diff = ALLOCNO_COVER_CLASS (a1) - ALLOCNO_COVER_CLASS (a2)) != 0)
2058     return diff;
2059   if ((diff = ALLOCNO_MIN (a1) - ALLOCNO_MIN (a2)) != 0)
2060     return diff;
2061   if ((diff = ALLOCNO_MAX (a1) - ALLOCNO_MAX (a2)) != 0)
2062      return diff;
2063   return ALLOCNO_NUM (a1) - ALLOCNO_NUM (a2);
2064 }
2065
2066 /* Sort ira_conflict_id_allocno_map and set up conflict id of
2067    allocnos.  */
2068 static void
2069 sort_conflict_id_allocno_map (void)
2070 {
2071   int i, num;
2072   ira_allocno_t a;
2073   ira_allocno_iterator ai;
2074
2075   num = 0;
2076   FOR_EACH_ALLOCNO (a, ai)
2077     ira_conflict_id_allocno_map[num++] = a;
2078   qsort (ira_conflict_id_allocno_map, num, sizeof (ira_allocno_t),
2079          allocno_range_compare_func);
2080   for (i = 0; i < num; i++)
2081     if ((a = ira_conflict_id_allocno_map[i]) != NULL)
2082       ALLOCNO_CONFLICT_ID (a) = i;
2083   for (i = num; i < ira_allocnos_num; i++)
2084     ira_conflict_id_allocno_map[i] = NULL;
2085 }
2086
2087 /* Set up minimal and maximal conflict ids of allocnos with which
2088    given allocno can conflict.  */
2089 static void
2090 setup_min_max_conflict_allocno_ids (void)
2091 {
2092   enum reg_class cover_class;
2093   int i, j, min, max, start, finish, first_not_finished, filled_area_start;
2094   int *live_range_min, *last_lived;
2095   ira_allocno_t a;
2096
2097   live_range_min = (int *) ira_allocate (sizeof (int) * ira_allocnos_num);
2098   cover_class = -1;
2099   first_not_finished = -1;
2100   for (i = 0; i < ira_allocnos_num; i++)
2101     {
2102       a = ira_conflict_id_allocno_map[i];
2103       if (a == NULL)
2104         continue;
2105       if (cover_class != ALLOCNO_COVER_CLASS (a))
2106         {
2107           cover_class = ALLOCNO_COVER_CLASS (a);
2108           min = i;
2109           first_not_finished = i;
2110         }
2111       else
2112         {
2113           start = ALLOCNO_MIN (a);
2114           /* If we skip an allocno, the allocno with smaller ids will
2115              be also skipped because of the secondary sorting the
2116              range finishes (see function
2117              allocno_range_compare_func).  */
2118           while (first_not_finished < i
2119                  && start > ALLOCNO_MAX (ira_conflict_id_allocno_map
2120                                          [first_not_finished]))
2121             first_not_finished++;
2122           min = first_not_finished;
2123         }
2124       if (min == i)
2125         /* We could increase min further in this case but it is good
2126            enough.  */
2127         min++;
2128       live_range_min[i] = ALLOCNO_MIN (a);
2129       ALLOCNO_MIN (a) = min;
2130     }
2131   last_lived = (int *) ira_allocate (sizeof (int) * ira_max_point);
2132   cover_class = -1;
2133   filled_area_start = -1;
2134   for (i = ira_allocnos_num - 1; i >= 0; i--)
2135     {
2136       a = ira_conflict_id_allocno_map[i];
2137       if (a == NULL)
2138         continue;
2139       if (cover_class != ALLOCNO_COVER_CLASS (a))
2140         {
2141           cover_class = ALLOCNO_COVER_CLASS (a);
2142           for (j = 0; j < ira_max_point; j++)
2143             last_lived[j] = -1;
2144           filled_area_start = ira_max_point;
2145         }
2146       min = live_range_min[i];
2147       finish = ALLOCNO_MAX (a);
2148       max = last_lived[finish];
2149       if (max < 0)
2150         /* We could decrease max further in this case but it is good
2151            enough.  */
2152         max = ALLOCNO_CONFLICT_ID (a) - 1;
2153       ALLOCNO_MAX (a) = max;
2154       /* In filling, we can go further A range finish to recognize
2155          intersection quickly because if the finish of subsequently
2156          processed allocno (it has smaller conflict id) range is
2157          further A range finish than they are definitely intersected
2158          (the reason for this is the allocnos with bigger conflict id
2159          have their range starts not smaller than allocnos with
2160          smaller ids.  */
2161       for (j = min; j < filled_area_start; j++)
2162         last_lived[j] = i;
2163       filled_area_start = min;
2164     }
2165   ira_free (last_lived);
2166   ira_free (live_range_min);
2167 }
2168
2169 \f
2170
2171 static void
2172 create_caps (void)
2173 {
2174   ira_allocno_t a;
2175   ira_allocno_iterator ai;
2176   ira_loop_tree_node_t loop_tree_node;
2177
2178   FOR_EACH_ALLOCNO (a, ai)
2179     {
2180       if (ALLOCNO_LOOP_TREE_NODE (a) == ira_loop_tree_root)
2181         continue;
2182       if (ALLOCNO_CAP_MEMBER (a) != NULL)
2183         create_cap_allocno (a);
2184       else if (ALLOCNO_CAP (a) == NULL)
2185         {
2186           loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a);
2187           if (!bitmap_bit_p (loop_tree_node->border_allocnos, ALLOCNO_NUM (a)))
2188             create_cap_allocno (a);
2189         }
2190     }
2191 }
2192
2193 \f
2194
2195 /* The page contains code transforming more one region internal
2196    representation (IR) to one region IR which is necessary for reload.
2197    This transformation is called IR flattening.  We might just rebuild
2198    the IR for one region but we don't do it because it takes a lot of
2199    time.  */
2200
2201 /* Map: regno -> allocnos which will finally represent the regno for
2202    IR with one region.  */
2203 static ira_allocno_t *regno_top_level_allocno_map;
2204
2205 /* Process all allocnos originated from pseudo REGNO and copy live
2206    ranges, hard reg conflicts, and allocno stack reg attributes from
2207    low level allocnos to final allocnos which are destinations of
2208    removed stores at a loop exit.  Return true if we copied live
2209    ranges.  */
2210 static bool
2211 copy_info_to_removed_store_destinations (int regno)
2212 {
2213   ira_allocno_t a, parent_a;
2214   ira_loop_tree_node_t parent;
2215   allocno_live_range_t r;
2216   bool merged_p;
2217
2218   merged_p = false;
2219   for (a = ira_regno_allocno_map[regno];
2220        a != NULL;
2221        a = ALLOCNO_NEXT_REGNO_ALLOCNO (a))
2222     {
2223       if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))])
2224         /* This allocno will be removed.  */
2225         continue;
2226       /* Caps will be removed.  */
2227       ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL);
2228       for (parent = ALLOCNO_LOOP_TREE_NODE (a)->parent;
2229            parent != NULL;
2230            parent = parent->parent)
2231         if ((parent_a = parent->regno_allocno_map[regno]) == NULL
2232             || (parent_a == regno_top_level_allocno_map[REGNO (ALLOCNO_REG
2233                                                                (parent_a))]
2234                 && ALLOCNO_MEM_OPTIMIZED_DEST_P (parent_a)))
2235           break;
2236       if (parent == NULL || parent_a == NULL)
2237         continue;
2238       if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL)
2239         {
2240           fprintf
2241             (ira_dump_file,
2242              "      Coping ranges of a%dr%d to a%dr%d: ",
2243              ALLOCNO_NUM (a), REGNO (ALLOCNO_REG (a)),
2244              ALLOCNO_NUM (parent_a), REGNO (ALLOCNO_REG (parent_a)));
2245           ira_print_live_range_list (ira_dump_file,
2246                                      ALLOCNO_LIVE_RANGES (a));
2247         }
2248       r = ira_copy_allocno_live_range_list (ALLOCNO_LIVE_RANGES (a));
2249       change_allocno_in_range_list (r, parent_a);
2250       ALLOCNO_LIVE_RANGES (parent_a)
2251         = ira_merge_allocno_live_ranges (r, ALLOCNO_LIVE_RANGES (parent_a));
2252       IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a),
2253                         ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
2254 #ifdef STACK_REGS
2255       if (ALLOCNO_TOTAL_NO_STACK_REG_P (a))
2256         ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true;
2257 #endif
2258       ALLOCNO_CALL_FREQ (parent_a) += ALLOCNO_CALL_FREQ (a);
2259       ALLOCNO_CALLS_CROSSED_NUM (parent_a)
2260         += ALLOCNO_CALLS_CROSSED_NUM (a);
2261       ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a)
2262         += ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a);
2263       merged_p = true;
2264     }
2265   return merged_p;
2266 }
2267
2268 /* Flatten the IR.  In other words, this function transforms IR as if
2269    it were built with one region (without loops).  We could make it
2270    much simpler by rebuilding IR with one region, but unfortunately it
2271    takes a lot of time.  MAX_REGNO_BEFORE_EMIT and
2272    IRA_MAX_POINT_BEFORE_EMIT are correspondingly MAX_REG_NUM () and
2273    IRA_MAX_POINT before emitting insns on the loop borders.  */
2274 void
2275 ira_flattening (int max_regno_before_emit, int ira_max_point_before_emit)
2276 {
2277   int i, j, num;
2278   bool keep_p;
2279   int hard_regs_num;
2280   bool new_pseudos_p, merged_p, mem_dest_p;
2281   unsigned int n;
2282   enum reg_class cover_class;
2283   ira_allocno_t a, parent_a, first, second, node_first, node_second;
2284   ira_copy_t cp;
2285   ira_loop_tree_node_t parent, node;
2286   allocno_live_range_t r;
2287   ira_allocno_iterator ai;
2288   ira_copy_iterator ci;
2289   sparseset allocnos_live;
2290
2291   regno_top_level_allocno_map
2292     = (ira_allocno_t *) ira_allocate (max_reg_num () * sizeof (ira_allocno_t));
2293   memset (regno_top_level_allocno_map, 0,
2294           max_reg_num () * sizeof (ira_allocno_t));
2295   new_pseudos_p = merged_p = false;
2296   FOR_EACH_ALLOCNO (a, ai)
2297     {
2298       if (ALLOCNO_CAP_MEMBER (a) != NULL)
2299         /* Caps are not in the regno allocno maps and they are never
2300            will be transformed into allocnos existing after IR
2301            flattening.  */
2302         continue;
2303       COPY_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a),
2304                          ALLOCNO_CONFLICT_HARD_REGS (a));
2305 #ifdef STACK_REGS
2306       ALLOCNO_TOTAL_NO_STACK_REG_P (a) = ALLOCNO_NO_STACK_REG_P (a);
2307 #endif
2308     }
2309   /* Fix final allocno attributes.  */
2310   for (i = max_regno_before_emit - 1; i >= FIRST_PSEUDO_REGISTER; i--)
2311     {
2312       mem_dest_p = false;
2313       for (a = ira_regno_allocno_map[i];
2314            a != NULL;
2315            a = ALLOCNO_NEXT_REGNO_ALLOCNO (a))
2316         {
2317           ira_assert (ALLOCNO_CAP_MEMBER (a) == NULL);
2318           if (ALLOCNO_SOMEWHERE_RENAMED_P (a))
2319             new_pseudos_p = true;
2320           if (ALLOCNO_CAP (a) != NULL
2321               || (parent = ALLOCNO_LOOP_TREE_NODE (a)->parent) == NULL
2322               || ((parent_a = parent->regno_allocno_map[ALLOCNO_REGNO (a)])
2323                   == NULL))
2324             {
2325               ALLOCNO_COPIES (a) = NULL;
2326               regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] = a;
2327               continue;
2328             }
2329           ira_assert (ALLOCNO_CAP_MEMBER (parent_a) == NULL);
2330
2331           if (ALLOCNO_MEM_OPTIMIZED_DEST (a) != NULL)
2332             mem_dest_p = true;
2333           if (REGNO (ALLOCNO_REG (a)) == REGNO (ALLOCNO_REG (parent_a)))
2334             {
2335               IOR_HARD_REG_SET (ALLOCNO_TOTAL_CONFLICT_HARD_REGS (parent_a),
2336                                 ALLOCNO_TOTAL_CONFLICT_HARD_REGS (a));
2337 #ifdef STACK_REGS
2338               if (ALLOCNO_TOTAL_NO_STACK_REG_P (a))
2339                 ALLOCNO_TOTAL_NO_STACK_REG_P (parent_a) = true;
2340 #endif
2341               if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL)
2342                 {
2343                   fprintf (ira_dump_file,
2344                            "      Moving ranges of a%dr%d to a%dr%d: ",
2345                            ALLOCNO_NUM (a), REGNO (ALLOCNO_REG (a)),
2346                            ALLOCNO_NUM (parent_a),
2347                            REGNO (ALLOCNO_REG (parent_a)));
2348                   ira_print_live_range_list (ira_dump_file,
2349                                              ALLOCNO_LIVE_RANGES (a));
2350                 }
2351               change_allocno_in_range_list (ALLOCNO_LIVE_RANGES (a), parent_a);
2352               ALLOCNO_LIVE_RANGES (parent_a)
2353                 = ira_merge_allocno_live_ranges
2354                   (ALLOCNO_LIVE_RANGES (a), ALLOCNO_LIVE_RANGES (parent_a));
2355               merged_p = true;
2356               ALLOCNO_LIVE_RANGES (a) = NULL;
2357               ALLOCNO_MEM_OPTIMIZED_DEST_P (parent_a)
2358                 = (ALLOCNO_MEM_OPTIMIZED_DEST_P (parent_a)
2359                    || ALLOCNO_MEM_OPTIMIZED_DEST_P (a));
2360               continue;
2361             }
2362           new_pseudos_p = true;
2363           for (;;)
2364             {
2365               ALLOCNO_NREFS (parent_a) -= ALLOCNO_NREFS (a);
2366               ALLOCNO_FREQ (parent_a) -= ALLOCNO_FREQ (a);
2367               ALLOCNO_CALL_FREQ (parent_a) -= ALLOCNO_CALL_FREQ (a);
2368               ALLOCNO_CALLS_CROSSED_NUM (parent_a)
2369                 -= ALLOCNO_CALLS_CROSSED_NUM (a);
2370               ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (parent_a)
2371                 -= ALLOCNO_EXCESS_PRESSURE_POINTS_NUM (a);
2372               ira_assert (ALLOCNO_CALLS_CROSSED_NUM (parent_a) >= 0
2373                           && ALLOCNO_NREFS (parent_a) >= 0
2374                           && ALLOCNO_FREQ (parent_a) >= 0);
2375               cover_class = ALLOCNO_COVER_CLASS (parent_a);
2376               hard_regs_num = ira_class_hard_regs_num[cover_class];
2377               if (ALLOCNO_HARD_REG_COSTS (a) != NULL
2378                   && ALLOCNO_HARD_REG_COSTS (parent_a) != NULL)
2379                 for (j = 0; j < hard_regs_num; j++)
2380                   ALLOCNO_HARD_REG_COSTS (parent_a)[j]
2381                     -= ALLOCNO_HARD_REG_COSTS (a)[j];
2382               if (ALLOCNO_CONFLICT_HARD_REG_COSTS (a) != NULL
2383                   && ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a) != NULL)
2384                 for (j = 0; j < hard_regs_num; j++)
2385                   ALLOCNO_CONFLICT_HARD_REG_COSTS (parent_a)[j]
2386                     -= ALLOCNO_CONFLICT_HARD_REG_COSTS (a)[j];
2387               ALLOCNO_COVER_CLASS_COST (parent_a)
2388                 -= ALLOCNO_COVER_CLASS_COST (a);
2389               ALLOCNO_MEMORY_COST (parent_a) -= ALLOCNO_MEMORY_COST (a);
2390               if (ALLOCNO_CAP (parent_a) != NULL
2391                   || (parent
2392                       = ALLOCNO_LOOP_TREE_NODE (parent_a)->parent) == NULL
2393                   || (parent_a = (parent->regno_allocno_map
2394                                   [ALLOCNO_REGNO (parent_a)])) == NULL)
2395                 break;
2396             }
2397           ALLOCNO_COPIES (a) = NULL;
2398           regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))] = a;
2399         }
2400       if (mem_dest_p && copy_info_to_removed_store_destinations (i))
2401         merged_p = true;
2402     }
2403   ira_assert (new_pseudos_p || ira_max_point_before_emit == ira_max_point);
2404   if (merged_p || ira_max_point_before_emit != ira_max_point)
2405     ira_rebuild_start_finish_chains ();
2406   if (new_pseudos_p)
2407     {
2408       /* Rebuild conflicts.  */
2409       FOR_EACH_ALLOCNO (a, ai)
2410         {
2411           if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))]
2412               || ALLOCNO_CAP_MEMBER (a) != NULL)
2413             continue;
2414           for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next)
2415             ira_assert (r->allocno == a);
2416           clear_allocno_conflicts (a);
2417         }
2418       allocnos_live = sparseset_alloc (ira_allocnos_num);
2419       for (i = 0; i < ira_max_point; i++)
2420         {
2421           for (r = ira_start_point_ranges[i]; r != NULL; r = r->start_next)
2422             {
2423               a = r->allocno;
2424               if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))]
2425                   || ALLOCNO_CAP_MEMBER (a) != NULL)
2426                 continue;
2427               num = ALLOCNO_NUM (a);
2428               cover_class = ALLOCNO_COVER_CLASS (a);
2429               sparseset_set_bit (allocnos_live, num);
2430               EXECUTE_IF_SET_IN_SPARSESET (allocnos_live, n)
2431                 {
2432                   ira_allocno_t live_a = ira_allocnos[n];
2433
2434                   if (cover_class == ALLOCNO_COVER_CLASS (live_a)
2435                       /* Don't set up conflict for the allocno with itself.  */
2436                       && num != (int) n)
2437                     ira_add_allocno_conflict (a, live_a);
2438                 }
2439             }
2440
2441           for (r = ira_finish_point_ranges[i]; r != NULL; r = r->finish_next)
2442             sparseset_clear_bit (allocnos_live, ALLOCNO_NUM (r->allocno));
2443         }
2444       sparseset_free (allocnos_live);
2445       compress_conflict_vecs ();
2446     }
2447   /* Mark some copies for removing and change allocnos in the rest
2448      copies.  */
2449   FOR_EACH_COPY (cp, ci)
2450     {
2451       if (ALLOCNO_CAP_MEMBER (cp->first) != NULL
2452           || ALLOCNO_CAP_MEMBER (cp->second) != NULL)
2453         {
2454           if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL)
2455             fprintf
2456               (ira_dump_file, "      Remove cp%d:%c%dr%d-%c%dr%d\n",
2457                cp->num, ALLOCNO_CAP_MEMBER (cp->first) != NULL ? 'c' : 'a',
2458                ALLOCNO_NUM (cp->first), REGNO (ALLOCNO_REG (cp->first)),
2459                ALLOCNO_CAP_MEMBER (cp->second) != NULL ? 'c' : 'a',
2460                ALLOCNO_NUM (cp->second), REGNO (ALLOCNO_REG (cp->second)));
2461           cp->loop_tree_node = NULL;
2462           continue;
2463         }
2464       first = regno_top_level_allocno_map[REGNO (ALLOCNO_REG (cp->first))];
2465       second = regno_top_level_allocno_map[REGNO (ALLOCNO_REG (cp->second))];
2466       node = cp->loop_tree_node;
2467       if (node == NULL)
2468         keep_p = true; /* It copy generated in ira-emit.c.  */
2469       else
2470         {
2471           /* Check that the copy was not propagated from level on
2472              which we will have different pseudos.  */
2473           node_first = node->regno_allocno_map[ALLOCNO_REGNO (cp->first)];
2474           node_second = node->regno_allocno_map[ALLOCNO_REGNO (cp->second)];
2475           keep_p = ((REGNO (ALLOCNO_REG (first))
2476                      == REGNO (ALLOCNO_REG (node_first)))
2477                      && (REGNO (ALLOCNO_REG (second))
2478                          == REGNO (ALLOCNO_REG (node_second))));
2479         }
2480       if (keep_p)
2481         {
2482           cp->loop_tree_node = ira_loop_tree_root;
2483           cp->first = first;
2484           cp->second = second;
2485         }
2486       else
2487         {
2488           cp->loop_tree_node = NULL;
2489           if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL)
2490             fprintf (ira_dump_file, "      Remove cp%d:a%dr%d-a%dr%d\n",
2491                      cp->num, ALLOCNO_NUM (cp->first),
2492                      REGNO (ALLOCNO_REG (cp->first)), ALLOCNO_NUM (cp->second),
2493                      REGNO (ALLOCNO_REG (cp->second)));
2494         }
2495     }
2496   /* Remove unnecessary allocnos on lower levels of the loop tree.  */
2497   FOR_EACH_ALLOCNO (a, ai)
2498     {
2499       if (a != regno_top_level_allocno_map[REGNO (ALLOCNO_REG (a))]
2500           || ALLOCNO_CAP_MEMBER (a) != NULL)
2501         {
2502           if (internal_flag_ira_verbose > 4 && ira_dump_file != NULL)
2503             fprintf (ira_dump_file, "      Remove a%dr%d\n",
2504                      ALLOCNO_NUM (a), REGNO (ALLOCNO_REG (a)));
2505           finish_allocno (a);
2506           continue;
2507         }
2508       ALLOCNO_LOOP_TREE_NODE (a) = ira_loop_tree_root;
2509       ALLOCNO_REGNO (a) = REGNO (ALLOCNO_REG (a));
2510       ALLOCNO_CAP (a) = NULL;
2511       /* Restore updated costs for assignments from reload.  */
2512       ALLOCNO_UPDATED_MEMORY_COST (a) = ALLOCNO_MEMORY_COST (a);
2513       ALLOCNO_UPDATED_COVER_CLASS_COST (a) = ALLOCNO_COVER_CLASS_COST (a);
2514       if (! ALLOCNO_ASSIGNED_P (a))
2515         ira_free_allocno_updated_costs (a);
2516       ira_assert (ALLOCNO_UPDATED_HARD_REG_COSTS (a) == NULL);
2517       ira_assert (ALLOCNO_UPDATED_CONFLICT_HARD_REG_COSTS (a) == NULL);
2518     }
2519   /* Remove unnecessary copies.  */
2520   FOR_EACH_COPY (cp, ci)
2521     {
2522       if (cp->loop_tree_node == NULL)
2523         {
2524           ira_copies[cp->num] = NULL;
2525           finish_copy (cp);
2526           continue;
2527         }
2528       ira_assert
2529         (ALLOCNO_LOOP_TREE_NODE (cp->first) == ira_loop_tree_root
2530          && ALLOCNO_LOOP_TREE_NODE (cp->second) == ira_loop_tree_root);
2531       ira_add_allocno_copy_to_list (cp);
2532       ira_swap_allocno_copy_ends_if_necessary (cp);
2533     }
2534   rebuild_regno_allocno_maps ();
2535   if (ira_max_point != ira_max_point_before_emit)
2536     ira_compress_allocno_live_ranges ();
2537   ira_free (regno_top_level_allocno_map);
2538 }
2539
2540 \f
2541
2542 #ifdef ENABLE_IRA_CHECKING
2543 /* Check creation of all allocnos.  Allocnos on lower levels should
2544    have allocnos or caps on all upper levels.  */
2545 static void
2546 check_allocno_creation (void)
2547 {
2548   ira_allocno_t a;
2549   ira_allocno_iterator ai;
2550   ira_loop_tree_node_t loop_tree_node;
2551
2552   FOR_EACH_ALLOCNO (a, ai)
2553     {
2554       loop_tree_node = ALLOCNO_LOOP_TREE_NODE (a);
2555       ira_assert (bitmap_bit_p (loop_tree_node->all_allocnos,
2556                                 ALLOCNO_NUM (a)));
2557       if (loop_tree_node == ira_loop_tree_root)
2558         continue;
2559       if (ALLOCNO_CAP_MEMBER (a) != NULL)
2560         ira_assert (ALLOCNO_CAP (a) != NULL);
2561       else if (ALLOCNO_CAP (a) == NULL)
2562         ira_assert (loop_tree_node->parent
2563                     ->regno_allocno_map[ALLOCNO_REGNO (a)] != NULL
2564                     && bitmap_bit_p (loop_tree_node->border_allocnos,
2565                                      ALLOCNO_NUM (a)));
2566     }
2567 }
2568 #endif
2569
2570 /* Create a internal representation (IR) for IRA (allocnos, copies,
2571    loop tree nodes).  If LOOPS_P is FALSE the nodes corresponding to
2572    the loops (except the root which corresponds the all function) and
2573    correspondingly allocnos for the loops will be not created.  Such
2574    parameter value is used for Chaitin-Briggs coloring.  The function
2575    returns TRUE if we generate loop structure (besides nodes
2576    representing all function and the basic blocks) for regional
2577    allocation.  A true return means that we really need to flatten IR
2578    before the reload.  */
2579 bool
2580 ira_build (bool loops_p)
2581 {
2582   df_analyze ();
2583
2584   initiate_cost_vectors ();
2585   initiate_allocnos ();
2586   initiate_copies ();
2587   create_loop_tree_nodes (loops_p);
2588   form_loop_tree ();
2589   create_allocnos ();
2590   ira_costs ();
2591   ira_create_allocno_live_ranges ();
2592   remove_unnecessary_regions ();
2593   ira_compress_allocno_live_ranges ();
2594   update_bad_spill_attribute ();
2595   loops_p = more_one_region_p ();
2596   if (loops_p)
2597     {
2598       propagate_allocno_info ();
2599       create_caps ();
2600     }
2601   ira_tune_allocno_costs_and_cover_classes ();
2602 #ifdef ENABLE_IRA_CHECKING
2603   check_allocno_creation ();
2604 #endif
2605   setup_min_max_allocno_live_range_point ();
2606   sort_conflict_id_allocno_map ();
2607   setup_min_max_conflict_allocno_ids ();
2608   ira_build_conflicts ();
2609   if (internal_flag_ira_verbose > 2 && ira_dump_file != NULL)
2610     print_copies (ira_dump_file);
2611   if (internal_flag_ira_verbose > 0 && ira_dump_file != NULL)
2612     {
2613       int n, nr;
2614       ira_allocno_t a;
2615       allocno_live_range_t r;
2616       ira_allocno_iterator ai;
2617
2618       n = 0;
2619       FOR_EACH_ALLOCNO (a, ai)
2620         n += ALLOCNO_CONFLICT_ALLOCNOS_NUM (a);
2621       nr = 0;
2622       FOR_EACH_ALLOCNO (a, ai)
2623         for (r = ALLOCNO_LIVE_RANGES (a); r != NULL; r = r->next)
2624           nr++;
2625       fprintf (ira_dump_file, "  regions=%d, blocks=%d, points=%d\n",
2626                VEC_length (loop_p, ira_loops.larray), n_basic_blocks,
2627                ira_max_point);
2628       fprintf (ira_dump_file,
2629                "    allocnos=%d, copies=%d, conflicts=%d, ranges=%d\n",
2630                ira_allocnos_num, ira_copies_num, n, nr);
2631     }
2632   return loops_p;
2633 }
2634
2635 /* Release the data created by function ira_build.  */
2636 void
2637 ira_destroy (void)
2638 {
2639   finish_loop_tree_nodes ();
2640   finish_copies ();
2641   finish_allocnos ();
2642   finish_cost_vectors ();
2643   ira_finish_allocno_live_ranges ();
2644 }