From 6aa3afbfd6b737350351e9ea22ba9de1accda52d Mon Sep 17 00:00:00 2001 From: Eric Anholt Date: Tue, 19 Feb 2013 16:46:41 -0800 Subject: [PATCH] mesa: Reduce the memory usage for reg alloc with many graph nodes (part 1) We were allocating an adjacency_list entry for every possible interference that could get created, but that usually doesn't happen. We can save a lot of memory by resizing the array on demand. Reviewed-by: Kenneth Graunke --- src/mesa/program/register_allocate.c | 14 +++++++++++++- 1 file changed, 13 insertions(+), 1 deletion(-) diff --git a/src/mesa/program/register_allocate.c b/src/mesa/program/register_allocate.c index 88793db..5862c78 100644 --- a/src/mesa/program/register_allocate.c +++ b/src/mesa/program/register_allocate.c @@ -120,6 +120,7 @@ struct ra_node { */ GLboolean *adjacency; unsigned int *adjacency_list; + unsigned int adjacency_list_size; unsigned int adjacency_count; /** @} */ @@ -307,6 +308,15 @@ static void ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) { g->nodes[n1].adjacency[n2] = GL_TRUE; + + if (g->nodes[n1].adjacency_count >= + g->nodes[n1].adjacency_list_size) { + g->nodes[n1].adjacency_list_size *= 2; + g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list, + unsigned int, + g->nodes[n1].adjacency_list_size); + } + g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2; g->nodes[n1].adjacency_count++; } @@ -326,7 +336,9 @@ ra_alloc_interference_graph(struct ra_regs *regs, unsigned int count) for (i = 0; i < count; i++) { g->nodes[i].adjacency = rzalloc_array(g, GLboolean, count); - g->nodes[i].adjacency_list = ralloc_array(g, unsigned int, count); + g->nodes[i].adjacency_list_size = 4; + g->nodes[i].adjacency_list = + ralloc_array(g, unsigned int, g->nodes[i].adjacency_list_size); g->nodes[i].adjacency_count = 0; ra_add_node_adjacency(g, i, i); g->nodes[i].reg = NO_REG; -- 2.7.4