src/util/register_allocate.h

   1 /*
   2  * Copyright © 2010 Intel Corporation
   3  *
   4  * Permission is hereby granted, free of charge, to any person obtaining a
   5  * copy of this software and associated documentation files (the "Software"),
   6  * to deal in the Software without restriction, including without limitation
   7  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   8  * and/or sell copies of the Software, and to permit persons to whom the
   9  * Software is furnished to do so, subject to the following conditions:
  10  *
  11  * The above copyright notice and this permission notice (including the next
  12  * paragraph) shall be included in all copies or substantial portions of the
  13  * Software.
  14  *
  15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
  18  * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20  * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  21  * IN THE SOFTWARE.
  22  *
  23  * Authors:
  24  *    Eric Anholt <eric@anholt.net>
  25  *
  26  */
  27
  28 #ifndef REGISTER_ALLOCATE_H
  29 #define REGISTER_ALLOCATE_H
  30
  31 #include <stdbool.h>
  32 #include "util/bitset.h"
  33
  34 #ifdef __cplusplus
  35 extern "C" {
  36 #endif
  37
  38
  39 struct ra_class;
  40 struct ra_regs;
  41
  42 /* @{
  43  * Register set setup.
  44  *
  45  * This should be done once at backend initializaion, as
  46  * ra_set_finalize is O(r^2*c^2).  The registers may be virtual
  47  * registers, such as aligned register pairs that conflict with the
  48  * two real registers from which they are composed.
  49  */
  50 struct ra_regs *ra_alloc_reg_set(void *mem_ctx, unsigned int count,
  51                                  bool need_conflict_lists);
  52 void ra_set_allocate_round_robin(struct ra_regs *regs);
  53 unsigned int ra_alloc_reg_class(struct ra_regs *regs);
  54 void ra_add_reg_conflict(struct ra_regs *regs,
  55                          unsigned int r1, unsigned int r2);
  56 void ra_add_transitive_reg_conflict(struct ra_regs *regs,
  57                                     unsigned int base_reg, unsigned int reg);
  58
  59 void
  60 ra_add_transitive_reg_pair_conflict(struct ra_regs *regs,
  61                                     unsigned int base_reg, unsigned int reg0, unsigned int reg1);
  62
  63 void ra_make_reg_conflicts_transitive(struct ra_regs *regs, unsigned int reg);
  64 void ra_class_add_reg(struct ra_regs *regs, unsigned int c, unsigned int reg);
  65 void ra_set_num_conflicts(struct ra_regs *regs, unsigned int class_a,
  66                           unsigned int class_b, unsigned int num_conflicts);
  67 void ra_set_finalize(struct ra_regs *regs, unsigned int **conflicts);
  68 /** @} */
  69
  70 /** @{ Interference graph setup.
  71  *
  72  * Each interference graph node is a virtual variable in the IL.  It
  73  * is up to the user to ra_set_node_class() for the virtual variable,
  74  * and compute live ranges and ra_node_interfere() between conflicting
  75  * live ranges. Note that an interference *must not* be added between
  76  * two nodes if their classes haven't been assigned yet. The user
  77  * should set the class of each node before building the interference
  78  * graph.
  79  */
  80 struct ra_graph *ra_alloc_interference_graph(struct ra_regs *regs,
  81                                              unsigned int count);
  82 void ra_resize_interference_graph(struct ra_graph *g, unsigned int count);
  83 void ra_set_node_class(struct ra_graph *g, unsigned int n, unsigned int c);
  84 unsigned int ra_get_node_class(struct ra_graph *g, unsigned int n);
  85 unsigned int ra_add_node(struct ra_graph *g, unsigned int c);
  86
  87 /** @{ Register selection callback.
  88  *
  89  * The register allocator can use either one of two built-in register
  90  * selection behaviors (ie. lowest-available or round-robin), or the
  91  * user can implement it's own selection policy by setting an register
  92  * selection callback.  The parameters to the callback are:
  93  *
  94  *  - n       the graph node, ie. the virtual variable to select a
  95  *            register for
  96  *  - regs    bitset of available registers to choose; this bitset
  97  *            contains *all* registers, but registers of different
  98  *            classes will not have their corresponding bit set.
  99  *  - data    callback data specified in ra_set_select_reg_callback()
 100  */
 101 typedef unsigned int (*ra_select_reg_callback)(
 102       unsigned int n,        /* virtual variable to choose a physical reg for */
 103       BITSET_WORD *regs,     /* available physical regs to choose from */
 104       void *data);
 105
 106 void ra_set_select_reg_callback(struct ra_graph *g,
 107                                 ra_select_reg_callback callback,
 108                                 void *data);
 109 void ra_add_node_interference(struct ra_graph *g,
 110                               unsigned int n1, unsigned int n2);
 111 void ra_reset_node_interference(struct ra_graph *g, unsigned int n);
 112 /** @} */
 113
 114 /** @{ Graph-coloring register allocation */
 115 bool ra_allocate(struct ra_graph *g);
 116
 117 unsigned int ra_get_node_reg(struct ra_graph *g, unsigned int n);
 118 void ra_set_node_reg(struct ra_graph * g, unsigned int n, unsigned int reg);
 119 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost);
 120 int ra_get_best_spill_node(struct ra_graph *g);
 121 /** @} */
 122
 123
 124 #ifdef __cplusplus
 125 }  // extern "C"
 126 #endif
 127
 128 #endif /* REGISTER_ALLOCATE_H */