util/ra: spiff out select_reg_callback

[mesa.git] / src / util / register_allocate.h

diff --git a/src/util/register_allocate.h b/src/util/register_allocate.h
index 628d2bbbceda921fb9bdc3152fddba0cd7a85807..7d8459b1eff09fb3913afd4951e02a94524f53de 100644 (file)
--- a/src/util/register_allocate.h
+++ b/src/util/register_allocate.h
@@ -25,8 +25,11 @@
  *
  */
 
-#include <stdbool.h>
+#ifndef REGISTER_ALLOCATE_H
+#define REGISTER_ALLOCATE_H
 
+#include <stdbool.h>
+#include "util/bitset.h"
 
 #ifdef __cplusplus
 extern "C" {
@@ -49,9 +52,14 @@ struct ra_regs *ra_alloc_reg_set(void *mem_ctx, unsigned int count,
 void ra_set_allocate_round_robin(struct ra_regs *regs);
 unsigned int ra_alloc_reg_class(struct ra_regs *regs);
 void ra_add_reg_conflict(struct ra_regs *regs,
-                        unsigned int r1, unsigned int r2);
+                         unsigned int r1, unsigned int r2);
 void ra_add_transitive_reg_conflict(struct ra_regs *regs,
-                                   unsigned int base_reg, unsigned int reg);
+                                    unsigned int base_reg, unsigned int reg);
+
+void
+ra_add_transitive_reg_pair_conflict(struct ra_regs *regs,
+                                    unsigned int base_reg, unsigned int reg0, unsigned int reg1);
+
 void ra_make_reg_conflicts_transitive(struct ra_regs *regs, unsigned int reg);
 void ra_class_add_reg(struct ra_regs *regs, unsigned int c, unsigned int reg);
 void ra_set_num_conflicts(struct ra_regs *regs, unsigned int class_a,
@@ -70,10 +78,37 @@ void ra_set_finalize(struct ra_regs *regs, unsigned int **conflicts);
  * graph.
  */
 struct ra_graph *ra_alloc_interference_graph(struct ra_regs *regs,
-                                            unsigned int count);
+                                             unsigned int count);
+void ra_resize_interference_graph(struct ra_graph *g, unsigned int count);
 void ra_set_node_class(struct ra_graph *g, unsigned int n, unsigned int c);
+unsigned int ra_get_node_class(struct ra_graph *g, unsigned int n);
+unsigned int ra_add_node(struct ra_graph *g, unsigned int c);
+
+/** @{ Register selection callback.
+ *
+ * The register allocator can use either one of two built-in register
+ * selection behaviors (ie. lowest-available or round-robin), or the
+ * user can implement it's own selection policy by setting an register
+ * selection callback.  The parameters to the callback are:
+ *
+ *  - n       the graph node, ie. the virtual variable to select a
+ *            register for
+ *  - regs    bitset of available registers to choose; this bitset
+ *            contains *all* registers, but registers of different
+ *            classes will not have their corresponding bit set.
+ *  - data    callback data specified in ra_set_select_reg_callback()
+ */
+typedef unsigned int (*ra_select_reg_callback)(
+      unsigned int n,        /* virtual variable to choose a physical reg for */
+      BITSET_WORD *regs,     /* available physical regs to choose from */
+      void *data);
+
+void ra_set_select_reg_callback(struct ra_graph *g,
+                                ra_select_reg_callback callback,
+                                void *data);
 void ra_add_node_interference(struct ra_graph *g,
-                             unsigned int n1, unsigned int n2);
+                              unsigned int n1, unsigned int n2);
+void ra_reset_node_interference(struct ra_graph *g, unsigned int n);
 /** @} */
 
 /** @{ Graph-coloring register allocation */
@@ -89,3 +124,5 @@ int ra_get_best_spill_node(struct ra_graph *g);
 #ifdef __cplusplus
 }  // extern "C"
 #endif
+
+#endif /* REGISTER_ALLOCATE_H */