gain 29 ompi/mca/topo/treematch/treematch/tm_solution.c void select_max(int *l,int *m,double **gain,int N,int *state); gain 30 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch); gain 394 ompi/mca/topo/treematch/treematch/tm_solution.c void select_max(int *l,int *m,double **gain,int N,int *state) gain 405 ompi/mca/topo/treematch/treematch/tm_solution.c if(gain[i][j] > max){ gain 408 ompi/mca/topo/treematch/treematch/tm_solution.c max=gain[i][j]; gain 414 ompi/mca/topo/treematch/treematch/tm_solution.c void compute_gain(int *sol,int N,double **gain,double **comm, double **arch) gain 422 ompi/mca/topo/treematch/treematch/tm_solution.c gain[i][j] = gain[j][i] = gain_exchange(sol,i,j,eval1,N,comm,arch); gain 436 ompi/mca/topo/treematch/treematch/tm_solution.c double **gain = NULL; gain 442 ompi/mca/topo/treematch/treematch/tm_solution.c gain = (double**)MALLOC(sizeof(double*)*N); gain 445 ompi/mca/topo/treematch/treematch/tm_solution.c gain[i] = (double*)MALLOC(sizeof(double)*N); gain 464 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); gain 470 ompi/mca/topo/treematch/treematch/tm_solution.c select_max(&l,&m,gain,N,state); gain 477 ompi/mca/topo/treematch/treematch/tm_solution.c temp[i] = gain[l][m]; gain 478 ompi/mca/topo/treematch/treematch/tm_solution.c compute_gain(sol,N,gain,comm,arch); gain 520 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(gain[i]); gain 523 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(gain); gain 21 ompi/mca/topo/treematch/treematch/tm_solution.h void select_max(int *l,int *m,double **gain,int N,int *state); gain 22 ompi/mca/topo/treematch/treematch/tm_solution.h void compute_gain(int *sol,int N,double **gain,double **comm, double **arch);