145 struct ra_graph {  struct
296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)  in ra_add_node_adjacency()
303 struct ra_graph *
306    struct ra_graph *g;  in ra_alloc_interference_graph()
309    g = rzalloc(regs, struct ra_graph);  in ra_alloc_interference_graph()
328 ra_set_node_class(struct ra_graph *g,  in ra_set_node_class()
335 ra_add_node_interference(struct ra_graph *g,  in ra_add_node_interference()
344 static GLboolean pq_test(struct ra_graph *g, unsigned int n)  in pq_test()
372 ra_simplify(struct ra_graph *g)  in ra_simplify()
409 ra_select(struct ra_graph *g)  in ra_select()
456 ra_optimistic_color(struct ra_graph *g)  in ra_optimistic_color()
471 ra_allocate_no_spills(struct ra_graph *g)  in ra_allocate_no_spills()
480 ra_get_node_reg(struct ra_graph *g, unsigned int n)  in ra_get_node_reg()
497 ra_set_node_reg(struct ra_graph *g, unsigned int n, unsigned int reg)  in ra_set_node_reg()
504 ra_get_spill_benefit(struct ra_graph *g, unsigned int n)  in ra_get_spill_benefit()
532 ra_get_best_spill_node(struct ra_graph *g)  in ra_get_best_spill_node()
561 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)  in ra_set_node_spill_cost()