@@ -918,7 +918,7 @@ static void partial_exhaustive_search(int nb_args, void **args, int thread_id){
918918 work_unit_t * work = (work_unit_t * ) args [7 ];
919919 pthread_mutex_t * lock = (pthread_mutex_t * ) args [8 ];
920920 int * tab_i ;
921- int id , id1 , id2 ;
921+ int id = 0 , id1 , id2 ;
922922 int total_work = work -> nb_work ;
923923 int cur_work = 0 ;
924924
@@ -1750,7 +1750,6 @@ void group_nodes(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new
17501750 int mat_order = aff_mat -> order ;
17511751 tm_tree_t * * cur_group = NULL ;
17521752 int j , l ;
1753- unsigned long int list_size ;
17541753 unsigned long int i ;
17551754 group_list_t list , * * best_selection = NULL , * * tab_group = NULL ;
17561755 double best_val , last_best ;
@@ -1810,8 +1809,7 @@ void group_nodes(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new
18101809 best_selection = (group_list_t * * )MALLOC (sizeof (group_list_t * )* solution_size );
18111810
18121811 list_all_possible_groups (cost_mat , tab_node , 0 , arity , 0 , cur_group , & list );
1813- list_size = (int )list .val ;
1814- assert ( list_size == nb_groups );
1812+ assert ( nb_groups == (unsigned long int )list .val );
18151813 tab_group = (group_list_t * * )MALLOC (sizeof (group_list_t * )* nb_groups );
18161814 list_to_tab (list .next , tab_group , nb_groups );
18171815 if (verbose_level >=INFO )
0 commit comments