From 111d3523cebf14ffffedc380ea92d156c75e0880 Mon Sep 17 00:00:00 2001 From: Sebastian Buchwald Date: Tue, 2 Dec 2008 23:23:59 +0000 Subject: [PATCH] More refactoring. [r24241] --- heuristical.c | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/heuristical.c b/heuristical.c index e24d5f43d..1f3ce185c 100644 --- a/heuristical.c +++ b/heuristical.c @@ -428,15 +428,15 @@ static void initial_simplify_edges(pbqp *pbqp) } } -num determine_solution(pbqp *pbqp) +num determine_solution(FILE *file) { unsigned node_index; unsigned node_len; num solution; - if (pbqp->dump_file) { - dump_section(pbqp->dump_file, 1, "4. Determine Solution/Minimum"); - dump_section(pbqp->dump_file, 2, "4.1. Trivial Solution"); + if (file) { + dump_section(file, 1, "4. Determine Solution/Minimum"); + dump_section(file, 2, "4.1. Trivial Solution"); } /* Solve trivial nodes and calculate solution. */ @@ -448,9 +448,9 @@ num determine_solution(pbqp *pbqp) node->solution = vector_get_min_index(node->costs); solution = pbqp_add(solution, node->costs->entries[node->solution].data); - if (pbqp->dump_file) { - fprintf(pbqp->dump_file, "node n%d is set to %d
\n", node->index, node->solution); - dump_node(pbqp->dump_file, node); + if (file) { + fprintf(file, "node n%d is set to %d
\n", node->index, node->solution); + dump_node(file, node); } } @@ -482,7 +482,7 @@ void solve_pbqp_heuristical(pbqp *pbqp) } } - pbqp->solution = determine_solution(pbqp); + pbqp->solution = determine_solution(pbqp->dump_file); if (pbqp->dump_file) { dump_section(pbqp->dump_file, 2, "Minimum"); -- 2.20.1