2 * Copyright © 2010 Intel Corporation
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:
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
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
24 * Eric Anholt <eric@anholt.net>
42 * This should be done once at backend initializaion, as
43 * ra_set_finalize is O(r^2*c^2). The registers may be virtual
44 * registers, such as aligned register pairs that conflict with the
45 * two real registers from which they are composed.
47 struct ra_regs *ra_alloc_reg_set(void *mem_ctx, unsigned int count);
48 void ra_set_allocate_round_robin(struct ra_regs *regs);
49 unsigned int ra_alloc_reg_class(struct ra_regs *regs);
50 void ra_add_reg_conflict(struct ra_regs *regs,
51 unsigned int r1, unsigned int r2);
52 void ra_add_transitive_reg_conflict(struct ra_regs *regs,
53 unsigned int base_reg, unsigned int reg);
54 void ra_make_reg_conflicts_transitive(struct ra_regs *regs, unsigned int reg);
55 void ra_class_add_reg(struct ra_regs *regs, unsigned int c, unsigned int reg);
56 void ra_set_num_conflicts(struct ra_regs *regs, unsigned int class_a,
57 unsigned int class_b, unsigned int num_conflicts);
58 void ra_set_finalize(struct ra_regs *regs, unsigned int **conflicts);
61 /** @{ Interference graph setup.
63 * Each interference graph node is a virtual variable in the IL. It
64 * is up to the user to ra_set_node_class() for the virtual variable,
65 * and compute live ranges and ra_node_interfere() between conflicting
66 * live ranges. Note that an interference *must not* be added between
67 * two nodes if their classes haven't been assigned yet. The user
68 * should set the class of each node before building the interference
71 struct ra_graph *ra_alloc_interference_graph(struct ra_regs *regs,
73 void ra_set_node_class(struct ra_graph *g, unsigned int n, unsigned int c);
74 void ra_add_node_interference(struct ra_graph *g,
75 unsigned int n1, unsigned int n2);
78 /** @{ Graph-coloring register allocation */
79 bool ra_allocate(struct ra_graph *g);
81 unsigned int ra_get_node_reg(struct ra_graph *g, unsigned int n);
82 void ra_set_node_reg(struct ra_graph * g, unsigned int n, unsigned int reg);
83 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost);
84 int ra_get_best_spill_node(struct ra_graph *g);