sol 544 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_solution_t *sol = NULL; sol 661 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c sol = tm_compute_mapping(tm_topology, comm_tree); sol 663 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k = (int *)calloc(sol->k_length, sizeof(int)); sol 664 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(idx = 0 ; idx < (int)sol->k_length ; idx++) sol 665 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k[idx] = sol->k[idx][0]; sol 671 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(size == (int)sol->sigma_length); sol 673 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "Matching : ", "",sol->sigma, sol->sigma_length); sol 679 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_free_solution(sol); sol 765 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_solution_t *sol = NULL; sol 870 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c sol = tm_compute_mapping(tm_topology, comm_tree); sol 872 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert((int)sol->k_length == num_objs_in_node); sol 874 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k = (int *)calloc(sol->k_length, sizeof(int)); sol 875 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(idx = 0 ; idx < (int)sol->k_length ; idx++) sol 876 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k[idx] = sol->k[idx][0]; sol 883 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(num_procs_in_node == (int)sol->sigma_length); sol 885 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "Matching : ", "", sol->sigma, sol->sigma_length); sol 891 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_free_solution(sol); sol 14 ompi/mca/topo/treematch/treematch/tm_solution.c void tm_free_solution(tm_solution_t *sol); sol 18 ompi/mca/topo/treematch/treematch/tm_solution.c double tm_display_solution(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, tm_solution_t *sol, sol 26 ompi/mca/topo/treematch/treematch/tm_solution.c double eval_sol(int *sol,int N,double **comm, double **arch); sol 27 ompi/mca/topo/treematch/treematch/tm_solution.c void exchange(int *sol,int i,int j); sol 28 ompi/mca/topo/treematch/treematch/tm_solution.c double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch); sol 30 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch); sol 34 ompi/mca/topo/treematch/treematch/tm_solution.c void tm_free_solution(tm_solution_t *sol){ sol 37 ompi/mca/topo/treematch/treematch/tm_solution.c n = sol->k_length; sol 39 ompi/mca/topo/treematch/treematch/tm_solution.c if(sol->k) sol 41 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol->k[i]); sol 43 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol->k); sol 44 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol->sigma); sol 45 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol); sol 89 ompi/mca/topo/treematch/treematch/tm_solution.c double a,c,sol; sol 97 ompi/mca/topo/treematch/treematch/tm_solution.c sol = 0; sol 109 ompi/mca/topo/treematch/treematch/tm_solution.c sol += c*a; sol 117 ompi/mca/topo/treematch/treematch/tm_solution.c printf(" : %g\n",sol); sol 119 ompi/mca/topo/treematch/treematch/tm_solution.c return sol; sol 125 ompi/mca/topo/treematch/treematch/tm_solution.c double a,c,sol; sol 133 ompi/mca/topo/treematch/treematch/tm_solution.c sol = 0; sol 145 ompi/mca/topo/treematch/treematch/tm_solution.c if(c*a > sol) sol 146 ompi/mca/topo/treematch/treematch/tm_solution.c sol = c*a; sol 154 ompi/mca/topo/treematch/treematch/tm_solution.c printf(" : %g\n",sol); sol 156 ompi/mca/topo/treematch/treematch/tm_solution.c return sol; sol 161 ompi/mca/topo/treematch/treematch/tm_solution.c double c,sol; sol 167 ompi/mca/topo/treematch/treematch/tm_solution.c sol = 0; sol 174 ompi/mca/topo/treematch/treematch/tm_solution.c sol += c*nb_hops; sol 182 ompi/mca/topo/treematch/treematch/tm_solution.c printf(" : %g\n",sol); sol 184 ompi/mca/topo/treematch/treematch/tm_solution.c return sol; sol 206 ompi/mca/topo/treematch/treematch/tm_solution.c double tm_display_solution(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, tm_solution_t *sol, sol 210 ompi/mca/topo/treematch/treematch/tm_solution.c int **k = sol->k; sol 229 ompi/mca/topo/treematch/treematch/tm_solution.c return display_sol(topology, aff_mat, sol->sigma, metric); sol 333 ompi/mca/topo/treematch/treematch/tm_solution.c int *sol = NULL; sol 340 ompi/mca/topo/treematch/treematch/tm_solution.c sol = (int*)MALLOC(sizeof(int)*N); sol 351 ompi/mca/topo/treematch/treematch/tm_solution.c sol[i] = hash_tab[i].val; sol 354 ompi/mca/topo/treematch/treematch/tm_solution.c return sol; sol 358 ompi/mca/topo/treematch/treematch/tm_solution.c double eval_sol(int *sol,int N,double **comm, double **arch) sol 367 ompi/mca/topo/treematch/treematch/tm_solution.c a = arch[sol[i]][sol[j]]; sol 374 ompi/mca/topo/treematch/treematch/tm_solution.c void exchange(int *sol,int i,int j) sol 377 ompi/mca/topo/treematch/treematch/tm_solution.c tmp = sol[i]; sol 378 ompi/mca/topo/treematch/treematch/tm_solution.c sol[i] = sol[j]; sol 379 ompi/mca/topo/treematch/treematch/tm_solution.c sol[j] = tmp; sol 382 ompi/mca/topo/treematch/treematch/tm_solution.c double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch) sol 387 ompi/mca/topo/treematch/treematch/tm_solution.c exchange(sol,l,m); sol 388 ompi/mca/topo/treematch/treematch/tm_solution.c eval2 = eval_sol(sol,N,comm,arch); sol 389 ompi/mca/topo/treematch/treematch/tm_solution.c exchange(sol,l,m); sol 414 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch) sol 419 ompi/mca/topo/treematch/treematch/tm_solution.c eval1 = eval_sol(sol,N,comm,arch); sol 422 ompi/mca/topo/treematch/treematch/tm_solution.c gain[i][j] = gain[j][i] = gain_exchange(sol,i,j,eval1,N,comm,arch); sol 434 ompi/mca/topo/treematch/treematch/tm_solution.c int *sol = NULL; sol 452 ompi/mca/topo/treematch/treematch/tm_solution.c sol = generate_random_sol(topology, N, seed++); sol 454 ompi/mca/topo/treematch/treematch/tm_solution.c sigma[i] = sol[i]; sol 464 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); sol 474 ompi/mca/topo/treematch/treematch/tm_solution.c exchange(sol,l,m); sol 478 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); sol 494 ompi/mca/topo/treematch/treematch/tm_solution.c exchange(sol,history[j][1],history[j][2]); sol 503 ompi/mca/topo/treematch/treematch/tm_solution.c eval = eval_sol(sol,N,comm,arch); sol 507 ompi/mca/topo/treematch/treematch/tm_solution.c sigma[i] = sol[i]; sol 511 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol); sol 512 ompi/mca/topo/treematch/treematch/tm_solution.c sol=generate_random_sol(topology, N, seed++); sol 516 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol); sol 6 ompi/mca/topo/treematch/treematch/tm_solution.h void tm_free_solution(tm_solution_t *sol); sol 10 ompi/mca/topo/treematch/treematch/tm_solution.h double tm_display_solution(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, tm_solution_t *sol, sol 18 ompi/mca/topo/treematch/treematch/tm_solution.h double eval_sol(int *sol,int N,double **comm, double **arch); sol 19 ompi/mca/topo/treematch/treematch/tm_solution.h void exchange(int *sol,int i,int j); sol 20 ompi/mca/topo/treematch/treematch/tm_solution.h double gain_exchange(int *sol,int l,int m,double eval1,int N,double **comm, double **arch); sol 22 ompi/mca/topo/treematch/treematch/tm_solution.h void compute_gain(int *sol,int N,double **gain,double **comm, double **arch); sol 170 ompi/mca/topo/treematch/treematch/treematch.h double tm_display_solution(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, tm_solution_t *sol, tm_metric_t metric); sol 176 ompi/mca/topo/treematch/treematch/treematch.h void tm_free_solution(tm_solution_t *sol);