Lines Matching refs:ra_graph
491 ra_test_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
498 ra_set_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
505 ra_clear_adjacency_bit(struct ra_graph *g, unsigned n1, unsigned n2)
512 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
524 ra_node_remove_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
538 ra_realloc_interference_graph(struct ra_graph *g, unsigned int alloc)
580 struct ra_graph *
583 struct ra_graph *g;
585 g = rzalloc(NULL, struct ra_graph);
594 ra_resize_interference_graph(struct ra_graph *g, unsigned int count)
601 void ra_set_select_reg_callback(struct ra_graph *g,
610 ra_set_node_class(struct ra_graph *g,
617 ra_get_node_class(struct ra_graph *g,
624 ra_add_node(struct ra_graph *g, struct ra_class *class)
635 ra_add_node_interference(struct ra_graph *g,
647 ra_reset_node_interference(struct ra_graph *g, unsigned int n)
657 update_pq_info(struct ra_graph *g, unsigned int n)
680 add_node_to_stack(struct ra_graph *g, unsigned int n)
717 ra_simplify(struct ra_graph *g)
833 ra_find_conflicting_neighbor(struct ra_graph *g, unsigned int n, unsigned int r)
856 ra_compute_available_regs(struct ra_graph *g, unsigned int n, BITSET_WORD *regs)
899 ra_select(struct ra_graph *g)
979 ra_allocate(struct ra_graph *g)
986 ra_get_node_reg(struct ra_graph *g, unsigned int n)
1008 ra_set_node_reg(struct ra_graph *g, unsigned int n, unsigned int reg)
1014 ra_get_spill_benefit(struct ra_graph *g, unsigned int n)
1039 ra_get_best_spill_node(struct ra_graph *g)
1076 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)