gcc/cfgloop.h

   1 /* Natural loop functions
   2    Copyright (C) 1987, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
   3    2005, 2006, 2007, 2008, 2009, 2010  Free Software Foundation, Inc.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify it under
   8 the terms of the GNU General Public License as published by the Free
   9 Software Foundation; either version 3, or (at your option) any later
  10 version.
  11
  12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15 for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #ifndef GCC_CFGLOOP_H
  22 #define GCC_CFGLOOP_H
  23
  24 #include "basic-block.h"
  25 #include "double-int.h"
  26
  27 #include "bitmap.h"
  28 #include "sbitmap.h"
  29
  30 /* Structure to hold decision about unrolling/peeling.  */
  31 enum lpt_dec
  32 {
  33   LPT_NONE,
  34   LPT_PEEL_COMPLETELY,
  35   LPT_PEEL_SIMPLE,
  36   LPT_UNROLL_CONSTANT,
  37   LPT_UNROLL_RUNTIME,
  38   LPT_UNROLL_STUPID
  39 };
  40
  41 struct GTY (()) lpt_decision {
  42   enum lpt_dec decision;
  43   unsigned times;
  44 };
  45
  46 /* The type of extend applied to an IV.  */
  47 enum iv_extend_code
  48 {
  49   IV_SIGN_EXTEND,
  50   IV_ZERO_EXTEND,
  51   IV_UNKNOWN_EXTEND
  52 };
  53
  54 /* The structure describing a bound on number of iterations of a loop.  */
  55
  56 struct GTY ((chain_next ("%h.next"))) nb_iter_bound {
  57   /* The statement STMT is executed at most ...  */
  58   gimple stmt;
  59
  60   /* ... BOUND + 1 times (BOUND must be an unsigned constant).
  61      The + 1 is added for the following reasons:
  62
  63      a) 0 would otherwise be unused, while we would need to care more about
  64         overflows (as MAX + 1 is sometimes produced as the estimate on number
  65         of executions of STMT).
  66      b) it is consistent with the result of number_of_iterations_exit.  */
  67   double_int bound;
  68
  69   /* True if the statement will cause the loop to be leaved the (at most)
  70      BOUND + 1-st time it is executed, that is, all the statements after it
  71      are executed at most BOUND times.  */
  72   bool is_exit;
  73
  74   /* The next bound in the list.  */
  75   struct nb_iter_bound *next;
  76 };
  77
  78 /* Description of the loop exit.  */
  79
  80 struct GTY (()) loop_exit {
  81   /* The exit edge.  */
  82   edge e;
  83
  84   /* Previous and next exit in the list of the exits of the loop.  */
  85   struct loop_exit *prev;
  86   struct loop_exit *next;
  87
  88   /* Next element in the list of loops from that E exits.  */
  89   struct loop_exit *next_e;
  90 };
  91
  92 typedef struct loop *loop_p;
  93
  94 /* An integer estimation of the number of iterations.  Estimate_state
  95    describes what is the state of the estimation.  */
  96 enum loop_estimation
  97 {
  98   /* Estimate was not computed yet.  */
  99   EST_NOT_COMPUTED,
 100   /* Estimate is ready.  */
 101   EST_AVAILABLE
 102 };
 103
 104 /* Structure to hold information for each natural loop.  */
 105 struct GTY ((chain_next ("%h.next"))) loop {
 106   /* Index into loops array.  */
 107   int num;
 108
 109   /* Number of loop insns.  */
 110   unsigned ninsns;
 111
 112   /* Basic block of loop header.  */
 113   basic_block header;
 114
 115   /* Basic block of loop latch.  */
 116   basic_block latch;
 117
 118   /* For loop unrolling/peeling decision.  */
 119   struct lpt_decision lpt_decision;
 120
 121   /* Average number of executed insns per iteration.  */
 122   unsigned av_ninsns;
 123
 124   /* Number of blocks contained within the loop.  */
 125   unsigned num_nodes;
 126
 127   /* Superloops of the loop, starting with the outermost loop.  */
 128   vec<loop_p, va_gc> *superloops;
 129
 130   /* The first inner (child) loop or NULL if innermost loop.  */
 131   struct loop *inner;
 132
 133   /* Link to the next (sibling) loop.  */
 134   struct loop *next;
 135
 136   /* Auxiliary info specific to a pass.  */
 137   PTR GTY ((skip (""))) aux;
 138
 139   /* The number of times the latch of the loop is executed.  This can be an
 140      INTEGER_CST, or a symbolic expression representing the number of
 141      iterations like "N - 1", or a COND_EXPR containing the runtime
 142      conditions under which the number of iterations is non zero.
 143
 144      Don't access this field directly: number_of_latch_executions
 145      computes and caches the computed information in this field.  */
 146   tree nb_iterations;
 147
 148   /* An integer guaranteed to be greater or equal to nb_iterations.  Only
 149      valid if any_upper_bound is true.  */
 150   double_int nb_iterations_upper_bound;
 151
 152   /* An integer giving an estimate on nb_iterations.  Unlike
 153      nb_iterations_upper_bound, there is no guarantee that it is at least
 154      nb_iterations.  */
 155   double_int nb_iterations_estimate;
 156
 157   bool any_upper_bound;
 158   bool any_estimate;
 159
 160   /* True if the loop can be parallel.  */
 161   bool can_be_parallel;
 162
 163   /* An integer estimation of the number of iterations.  Estimate_state
 164      describes what is the state of the estimation.  */
 165   enum loop_estimation estimate_state;
 166
 167   /* Upper bound on number of iterations of a loop.  */
 168   struct nb_iter_bound *bounds;
 169
 170   /* Head of the cyclic list of the exits of the loop.  */
 171   struct loop_exit *exits;
 172 };
 173
 174 /* Flags for state of loop structure.  */
 175 enum
 176 {
 177   LOOPS_HAVE_PREHEADERS = 1,
 178   LOOPS_HAVE_SIMPLE_LATCHES = 2,
 179   LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS = 4,
 180   LOOPS_HAVE_RECORDED_EXITS = 8,
 181   LOOPS_MAY_HAVE_MULTIPLE_LATCHES = 16,
 182   LOOP_CLOSED_SSA = 32,
 183   LOOPS_NEED_FIXUP = 64,
 184   LOOPS_HAVE_FALLTHRU_PREHEADERS = 128
 185 };
 186
 187 #define LOOPS_NORMAL (LOOPS_HAVE_PREHEADERS | LOOPS_HAVE_SIMPLE_LATCHES \
 188                       | LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS)
 189 #define AVOID_CFG_MODIFICATIONS (LOOPS_MAY_HAVE_MULTIPLE_LATCHES)
 190
 191 /* Structure to hold CFG information about natural loops within a function.  */
 192 struct GTY (()) loops {
 193   /* State of loops.  */
 194   int state;
 195
 196   /* Array of the loops.  */
 197   vec<loop_p, va_gc> *larray;
 198
 199   /* Maps edges to the list of their descriptions as loop exits.  Edges
 200      whose sources or destinations have loop_father == NULL (which may
 201      happen during the cfg manipulations) should not appear in EXITS.  */
 202   htab_t GTY((param_is (struct loop_exit))) exits;
 203
 204   /* Pointer to root of loop hierarchy tree.  */
 205   struct loop *tree_root;
 206 };
 207
 208 /* Loop recognition.  */
 209 extern int flow_loops_find (struct loops *);
 210 extern void disambiguate_loops_with_multiple_latches (void);
 211 extern void flow_loops_free (struct loops *);
 212 extern void flow_loops_dump (FILE *,
 213                              void (*)(const struct loop *, FILE *, int), int);
 214 extern void flow_loop_dump (const struct loop *, FILE *,
 215                             void (*)(const struct loop *, FILE *, int), int);
 216 struct loop *alloc_loop (void);
 217 extern void flow_loop_free (struct loop *);
 218 int flow_loop_nodes_find (basic_block, struct loop *);
 219 void fix_loop_structure (bitmap changed_bbs);
 220 bool mark_irreducible_loops (void);
 221 void release_recorded_exits (void);
 222 void record_loop_exits (void);
 223 void rescan_loop_exit (edge, bool, bool);
 224
 225 /* Loop data structure manipulation/querying.  */
 226 extern void flow_loop_tree_node_add (struct loop *, struct loop *);
 227 extern void flow_loop_tree_node_remove (struct loop *);
 228 extern void add_loop (struct loop *, struct loop *);
 229 extern bool flow_loop_nested_p  (const struct loop *, const struct loop *);
 230 extern bool flow_bb_inside_loop_p (const struct loop *, const_basic_block);
 231 extern struct loop * find_common_loop (struct loop *, struct loop *);
 232 struct loop *superloop_at_depth (struct loop *, unsigned);
 233 struct eni_weights_d;
 234 extern unsigned tree_num_loop_insns (struct loop *, struct eni_weights_d *);
 235 extern int num_loop_insns (const struct loop *);
 236 extern int average_num_loop_insns (const struct loop *);
 237 extern unsigned get_loop_level (const struct loop *);
 238 extern bool loop_exit_edge_p (const struct loop *, const_edge);
 239 extern bool loop_exits_to_bb_p (struct loop *, basic_block);
 240 extern bool loop_exits_from_bb_p (struct loop *, basic_block);
 241 extern void mark_loop_exit_edges (void);
 242 extern location_t get_loop_location (struct loop *loop);
 243
 244 /* Loops & cfg manipulation.  */
 245 extern basic_block *get_loop_body (const struct loop *);
 246 extern unsigned get_loop_body_with_size (const struct loop *, basic_block *,
 247                                          unsigned);
 248 extern basic_block *get_loop_body_in_dom_order (const struct loop *);
 249 extern basic_block *get_loop_body_in_bfs_order (const struct loop *);
 250 extern basic_block *get_loop_body_in_custom_order (const struct loop *,
 251                                int (*) (const void *, const void *));
 252
 253 extern vec<edge> get_loop_exit_edges (const struct loop *);
 254 extern edge single_exit (const struct loop *);
 255 extern edge single_likely_exit (struct loop *loop);
 256 extern unsigned num_loop_branches (const struct loop *);
 257
 258 extern edge loop_preheader_edge (const struct loop *);
 259 extern edge loop_latch_edge (const struct loop *);
 260
 261 extern void add_bb_to_loop (basic_block, struct loop *);
 262 extern void remove_bb_from_loops (basic_block);
 263
 264 extern void cancel_loop_tree (struct loop *);
 265 extern void delete_loop (struct loop *);
 266
 267 enum
 268 {
 269   CP_SIMPLE_PREHEADERS = 1,
 270   CP_FALLTHRU_PREHEADERS = 2
 271 };
 272
 273 basic_block create_preheader (struct loop *, int);
 274 extern void create_preheaders (int);
 275 extern void force_single_succ_latches (void);
 276
 277 extern void verify_loop_structure (void);
 278
 279 /* Loop analysis.  */
 280 extern bool just_once_each_iteration_p (const struct loop *, const_basic_block);
 281 gcov_type expected_loop_iterations_unbounded (const struct loop *);
 282 extern unsigned expected_loop_iterations (const struct loop *);
 283 extern rtx doloop_condition_get (rtx);
 284
 285 void estimate_numbers_of_iterations_loop (struct loop *);
 286 void record_niter_bound (struct loop *, double_int, bool, bool);
 287 bool estimated_loop_iterations (struct loop *, double_int *);
 288 bool max_loop_iterations (struct loop *, double_int *);
 289 HOST_WIDE_INT estimated_loop_iterations_int (struct loop *);
 290 HOST_WIDE_INT max_loop_iterations_int (struct loop *);
 291 bool max_stmt_executions (struct loop *, double_int *);
 292 bool estimated_stmt_executions (struct loop *, double_int *);
 293 HOST_WIDE_INT max_stmt_executions_int (struct loop *);
 294 HOST_WIDE_INT estimated_stmt_executions_int (struct loop *);
 295
 296 /* Loop manipulation.  */
 297 extern bool can_duplicate_loop_p (const struct loop *loop);
 298
 299 #define DLTHE_FLAG_UPDATE_FREQ  1       /* Update frequencies in
 300                                            duplicate_loop_to_header_edge.  */
 301 #define DLTHE_RECORD_COPY_NUMBER 2      /* Record copy number in the aux
 302                                            field of newly create BB.  */
 303 #define DLTHE_FLAG_COMPLETTE_PEEL 4     /* Update frequencies expecting
 304                                            a complete peeling.  */
 305
 306 extern edge create_empty_if_region_on_edge (edge, tree);
 307 extern struct loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
 308                                                tree *, tree *, struct loop *);
 309 extern struct loop * duplicate_loop (struct loop *, struct loop *);
 310 extern void copy_loop_info (struct loop *loop, struct loop *target);
 311 extern void duplicate_subloops (struct loop *, struct loop *);
 312 extern bool duplicate_loop_to_header_edge (struct loop *, edge,
 313                                            unsigned, sbitmap, edge,
 314                                            vec<edge> *, int);
 315 extern struct loop *loopify (edge, edge,
 316                              basic_block, edge, edge, bool,
 317                              unsigned, unsigned);
 318 struct loop * loop_version (struct loop *, void *,
 319                             basic_block *, unsigned, unsigned, unsigned, bool);
 320 extern bool remove_path (edge);
 321 extern void unloop (struct loop *, bool *, bitmap);
 322 extern void scale_loop_frequencies (struct loop *, int, int);
 323
 324 /* Induction variable analysis.  */
 325
 326 /* The description of induction variable.  The things are a bit complicated
 327    due to need to handle subregs and extends.  The value of the object described
 328    by it can be obtained as follows (all computations are done in extend_mode):
 329
 330    Value in i-th iteration is
 331      delta + mult * extend_{extend_mode} (subreg_{mode} (base + i * step)).
 332
 333    If first_special is true, the value in the first iteration is
 334      delta + mult * base
 335
 336    If extend = UNKNOWN, first_special must be false, delta 0, mult 1 and value is
 337      subreg_{mode} (base + i * step)
 338
 339    The get_iv_value function can be used to obtain these expressions.
 340
 341    ??? Add a third mode field that would specify the mode in that inner
 342    computation is done, which would enable it to be different from the
 343    outer one?  */
 344
 345 struct rtx_iv
 346 {
 347   /* Its base and step (mode of base and step is supposed to be extend_mode,
 348      see the description above).  */
 349   rtx base, step;
 350
 351   /* The type of extend applied to it (IV_SIGN_EXTEND, IV_ZERO_EXTEND,
 352      or IV_UNKNOWN_EXTEND).  */
 353   enum iv_extend_code extend;
 354
 355   /* Operations applied in the extended mode.  */
 356   rtx delta, mult;
 357
 358   /* The mode it is extended to.  */
 359   enum machine_mode extend_mode;
 360
 361   /* The mode the variable iterates in.  */
 362   enum machine_mode mode;
 363
 364   /* Whether the first iteration needs to be handled specially.  */
 365   unsigned first_special : 1;
 366 };
 367
 368 /* The description of an exit from the loop and of the number of iterations
 369    till we take the exit.  */
 370
 371 struct niter_desc
 372 {
 373   /* The edge out of the loop.  */
 374   edge out_edge;
 375
 376   /* The other edge leading from the condition.  */
 377   edge in_edge;
 378
 379   /* True if we are able to say anything about number of iterations of the
 380      loop.  */
 381   bool simple_p;
 382
 383   /* True if the loop iterates the constant number of times.  */
 384   bool const_iter;
 385
 386   /* Number of iterations if constant.  */
 387   unsigned HOST_WIDEST_INT niter;
 388
 389   /* Assumptions under that the rest of the information is valid.  */
 390   rtx assumptions;
 391
 392   /* Assumptions under that the loop ends before reaching the latch,
 393      even if value of niter_expr says otherwise.  */
 394   rtx noloop_assumptions;
 395
 396   /* Condition under that the loop is infinite.  */
 397   rtx infinite;
 398
 399   /* Whether the comparison is signed.  */
 400   bool signed_p;
 401
 402   /* The mode in that niter_expr should be computed.  */
 403   enum machine_mode mode;
 404
 405   /* The number of iterations of the loop.  */
 406   rtx niter_expr;
 407 };
 408
 409 extern void iv_analysis_loop_init (struct loop *);
 410 extern bool iv_analyze (rtx, rtx, struct rtx_iv *);
 411 extern bool iv_analyze_result (rtx, rtx, struct rtx_iv *);
 412 extern bool iv_analyze_expr (rtx, rtx, enum machine_mode, struct rtx_iv *);
 413 extern rtx get_iv_value (struct rtx_iv *, rtx);
 414 extern bool biv_p (rtx, rtx);
 415 extern void find_simple_exit (struct loop *, struct niter_desc *);
 416 extern void iv_analysis_done (void);
 417
 418 extern struct niter_desc *get_simple_loop_desc (struct loop *loop);
 419 extern void free_simple_loop_desc (struct loop *loop);
 420
 421 static inline struct niter_desc *
 422 simple_loop_desc (struct loop *loop)
 423 {
 424   return (struct niter_desc *) loop->aux;
 425 }
 426
 427 /* Accessors for the loop structures.  */
 428
 429 /* Returns the loop with index NUM from current_loops.  */
 430
 431 static inline struct loop *
 432 get_loop (unsigned num)
 433 {
 434   return (*current_loops->larray)[num];
 435 }
 436
 437 /* Returns the number of superloops of LOOP.  */
 438
 439 static inline unsigned
 440 loop_depth (const struct loop *loop)
 441 {
 442   return vec_safe_length (loop->superloops);
 443 }
 444
 445 /* Returns the loop depth of the loop BB belongs to.  */
 446
 447 static inline int
 448 bb_loop_depth (const_basic_block bb)
 449 {
 450   return bb->loop_father ? loop_depth (bb->loop_father) : 0;
 451 }
 452
 453 /* Returns the immediate superloop of LOOP, or NULL if LOOP is the outermost
 454    loop.  */
 455
 456 static inline struct loop *
 457 loop_outer (const struct loop *loop)
 458 {
 459   unsigned n = vec_safe_length (loop->superloops);
 460
 461   if (n == 0)
 462     return NULL;
 463
 464   return (*loop->superloops)[n - 1];
 465 }
 466
 467 /* Returns true if LOOP has at least one exit edge.  */
 468
 469 static inline bool
 470 loop_has_exit_edges (const struct loop *loop)
 471 {
 472   return loop->exits->next->e != NULL;
 473 }
 474
 475 /* Returns the list of loops in current_loops.  */
 476
 477 static inline vec<loop_p, va_gc> *
 478 get_loops (void)
 479 {
 480   if (!current_loops)
 481     return NULL;
 482
 483   return current_loops->larray;
 484 }
 485
 486 /* Returns the number of loops in current_loops (including the removed
 487    ones and the fake loop that forms the root of the loop tree).  */
 488
 489 static inline unsigned
 490 number_of_loops (void)
 491 {
 492   if (!current_loops)
 493     return 0;
 494
 495   return vec_safe_length (current_loops->larray);
 496 }
 497
 498 /* Returns true if state of the loops satisfies all properties
 499    described by FLAGS.  */
 500
 501 static inline bool
 502 loops_state_satisfies_p (unsigned flags)
 503 {
 504   return (current_loops->state & flags) == flags;
 505 }
 506
 507 /* Sets FLAGS to the loops state.  */
 508
 509 static inline void
 510 loops_state_set (unsigned flags)
 511 {
 512   current_loops->state |= flags;
 513 }
 514
 515 /* Clears FLAGS from the loops state.  */
 516
 517 static inline void
 518 loops_state_clear (unsigned flags)
 519 {
 520   if (!current_loops)
 521     return;
 522   current_loops->state &= ~flags;
 523 }
 524
 525 /* Loop iterators.  */
 526
 527 /* Flags for loop iteration.  */
 528
 529 enum li_flags
 530 {
 531   LI_INCLUDE_ROOT = 1,          /* Include the fake root of the loop tree.  */
 532   LI_FROM_INNERMOST = 2,        /* Iterate over the loops in the reverse order,
 533                                    starting from innermost ones.  */
 534   LI_ONLY_INNERMOST = 4         /* Iterate only over innermost loops.  */
 535 };
 536
 537 /* The iterator for loops.  */
 538
 539 typedef struct
 540 {
 541   /* The list of loops to visit.  */
 542   vec<int> to_visit;
 543
 544   /* The index of the actual loop.  */
 545   unsigned idx;
 546 } loop_iterator;
 547
 548 static inline void
 549 fel_next (loop_iterator *li, loop_p *loop)
 550 {
 551   int anum;
 552
 553   while (li->to_visit.iterate (li->idx, &anum))
 554     {
 555       li->idx++;
 556       *loop = get_loop (anum);
 557       if (*loop)
 558         return;
 559     }
 560
 561   li->to_visit.release ();
 562   *loop = NULL;
 563 }
 564
 565 static inline void
 566 fel_init (loop_iterator *li, loop_p *loop, unsigned flags)
 567 {
 568   struct loop *aloop;
 569   unsigned i;
 570   int mn;
 571
 572   li->idx = 0;
 573   if (!current_loops)
 574     {
 575       li->to_visit.create (0);
 576       *loop = NULL;
 577       return;
 578     }
 579
 580   li->to_visit.create (number_of_loops ());
 581   mn = (flags & LI_INCLUDE_ROOT) ? 0 : 1;
 582
 583   if (flags & LI_ONLY_INNERMOST)
 584     {
 585       for (i = 0; vec_safe_iterate (current_loops->larray, i, &aloop); i++)
 586         if (aloop != NULL
 587             && aloop->inner == NULL
 588             && aloop->num >= mn)
 589           li->to_visit.quick_push (aloop->num);
 590     }
 591   else if (flags & LI_FROM_INNERMOST)
 592     {
 593       /* Push the loops to LI->TO_VISIT in postorder.  */
 594       for (aloop = current_loops->tree_root;
 595            aloop->inner != NULL;
 596            aloop = aloop->inner)
 597         continue;
 598
 599       while (1)
 600         {
 601           if (aloop->num >= mn)
 602             li->to_visit.quick_push (aloop->num);
 603
 604           if (aloop->next)
 605             {
 606               for (aloop = aloop->next;
 607                    aloop->inner != NULL;
 608                    aloop = aloop->inner)
 609                 continue;
 610             }
 611           else if (!loop_outer (aloop))
 612             break;
 613           else
 614             aloop = loop_outer (aloop);
 615         }
 616     }
 617   else
 618     {
 619       /* Push the loops to LI->TO_VISIT in preorder.  */
 620       aloop = current_loops->tree_root;
 621       while (1)
 622         {
 623           if (aloop->num >= mn)
 624             li->to_visit.quick_push (aloop->num);
 625
 626           if (aloop->inner != NULL)
 627             aloop = aloop->inner;
 628           else
 629             {
 630               while (aloop != NULL && aloop->next == NULL)
 631                 aloop = loop_outer (aloop);
 632               if (aloop == NULL)
 633                 break;
 634               aloop = aloop->next;
 635             }
 636         }
 637     }
 638
 639   fel_next (li, loop);
 640 }
 641
 642 #define FOR_EACH_LOOP(LI, LOOP, FLAGS) \
 643   for (fel_init (&(LI), &(LOOP), FLAGS); \
 644        (LOOP); \
 645        fel_next (&(LI), &(LOOP)))
 646
 647 #define FOR_EACH_LOOP_BREAK(LI) \
 648   { \
 649     (LI).to_visit.release (); \
 650     break; \
 651   }
 652
 653 /* The properties of the target.  */
 654 struct target_cfgloop {
 655   /* Number of available registers.  */
 656   unsigned x_target_avail_regs;
 657
 658   /* Number of available registers that are call-clobbered.  */
 659   unsigned x_target_clobbered_regs;
 660
 661   /* Number of registers reserved for temporary expressions.  */
 662   unsigned x_target_res_regs;
 663
 664   /* The cost for register when there still is some reserve, but we are
 665      approaching the number of available registers.  */
 666   unsigned x_target_reg_cost[2];
 667
 668   /* The cost for register when we need to spill.  */
 669   unsigned x_target_spill_cost[2];
 670 };
 671
 672 extern struct target_cfgloop default_target_cfgloop;
 673 #if SWITCHABLE_TARGET
 674 extern struct target_cfgloop *this_target_cfgloop;
 675 #else
 676 #define this_target_cfgloop (&default_target_cfgloop)
 677 #endif
 678
 679 #define target_avail_regs \
 680   (this_target_cfgloop->x_target_avail_regs)
 681 #define target_clobbered_regs \
 682   (this_target_cfgloop->x_target_clobbered_regs)
 683 #define target_res_regs \
 684   (this_target_cfgloop->x_target_res_regs)
 685 #define target_reg_cost \
 686   (this_target_cfgloop->x_target_reg_cost)
 687 #define target_spill_cost \
 688   (this_target_cfgloop->x_target_spill_cost)
 689
 690 /* Register pressure estimation for induction variable optimizations & loop
 691    invariant motion.  */
 692 extern unsigned estimate_reg_pressure_cost (unsigned, unsigned, bool, bool);
 693 extern void init_set_costs (void);
 694
 695 /* Loop optimizer initialization.  */
 696 extern void loop_optimizer_init (unsigned);
 697 extern void loop_optimizer_finalize (void);
 698
 699 /* Optimization passes.  */
 700 extern void unswitch_loops (void);
 701
 702 enum
 703 {
 704   UAP_PEEL = 1,         /* Enables loop peeling.  */
 705   UAP_UNROLL = 2,       /* Enables unrolling of loops if it seems profitable.  */
 706   UAP_UNROLL_ALL = 4    /* Enables unrolling of all loops.  */
 707 };
 708
 709 extern void unroll_and_peel_loops (int);
 710 extern void doloop_optimize_loops (void);
 711 extern void move_loop_invariants (void);
 712 extern bool finite_loop_p (struct loop *);
 713 extern void scale_loop_profile (struct loop *loop, int scale, int iteration_bound);
 714 extern vec<basic_block> get_loop_hot_path (const struct loop *loop);
 715
 716 /* Returns the outermost loop of the loop nest that contains LOOP.*/
 717 static inline struct loop *
 718 loop_outermost (struct loop *loop)
 719 {
 720   unsigned n = vec_safe_length (loop->superloops);
 721
 722   if (n <= 1)
 723     return loop;
 724
 725   return (*loop->superloops)[1];
 726 }
 727
 728
 729 #endif /* GCC_CFGLOOP_H */