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 struct ra_class; 29 struct ra_regs; 30 31 /* @{ 32 * Register set setup. 33 * 34 * This should be done once at backend initializaion, as 35 * ra_set_finalize is O(r^2*c^2). The registers may be virtual 36 * registers, such as aligned register pairs that conflict with the 37 * two real registers from which they are composed. 38 */ 39 struct ra_regs *ra_alloc_reg_set(void *mem_ctx, unsigned int count); 40 unsigned int ra_alloc_reg_class(struct ra_regs *regs); 41 void ra_add_reg_conflict(struct ra_regs *regs, 42 unsigned int r1, unsigned int r2); 43 void ra_add_transitive_reg_conflict(struct ra_regs *regs, 44 unsigned int base_reg, unsigned int reg); 45 void ra_class_add_reg(struct ra_regs *regs, unsigned int c, unsigned int reg); 46 void ra_set_finalize(struct ra_regs *regs); 47 /** @} */ 48 49 /** @{ Interference graph setup. 50 * 51 * Each interference graph node is a virtual variable in the IL. It 52 * is up to the user to ra_set_node_class() for the virtual variable, 53 * and compute live ranges and ra_node_interfere() between conflicting 54 * live ranges. 55 */ 56 struct ra_graph *ra_alloc_interference_graph(struct ra_regs *regs, 57 unsigned int count); 58 void ra_set_node_class(struct ra_graph *g, unsigned int n, unsigned int c); 59 void ra_add_node_interference(struct ra_graph *g, 60 unsigned int n1, unsigned int n2); 61 /** @} */ 62 63 /** @{ Graph-coloring register allocation */ 64 GLboolean ra_simplify(struct ra_graph *g); 65 void ra_optimistic_color(struct ra_graph *g); 66 GLboolean ra_select(struct ra_graph *g); 67 GLboolean ra_allocate_no_spills(struct ra_graph *g); 68 69 unsigned int ra_get_node_reg(struct ra_graph *g, unsigned int n); 70 void ra_set_node_reg(struct ra_graph * g, unsigned int n, unsigned int reg); 71 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost); 72 int ra_get_best_spill_node(struct ra_graph *g); 73 /** @} */ 74 75