cost 614 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->cost = (double*)calloc(tm_topology->nb_levels,sizeof(double)); cost 837 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->cost = (double*)calloc(tm_topology->nb_levels,sizeof(double)); cost 203 ompi/mca/topo/treematch/treematch/k-partitioning.c double cost, best_cost = -1; cost 245 ompi/mca/topo/treematch/treematch/k-partitioning.c cost = eval_cost2(res,n-nb_constraints,comm); cost 248 ompi/mca/topo/treematch/treematch/k-partitioning.c if((cost<best_cost) || (best_cost == -1)){ cost 249 ompi/mca/topo/treematch/treematch/k-partitioning.c best_cost=cost; cost 267 ompi/mca/topo/treematch/treematch/k-partitioning.c double cost, best_cost = -1; cost 273 ompi/mca/topo/treematch/treematch/k-partitioning.c cost = comm[u][i]; cost 274 ompi/mca/topo/treematch/treematch/k-partitioning.c if (( cost > best_cost)){ cost 275 ompi/mca/topo/treematch/treematch/k-partitioning.c best_cost = cost; cost 290 ompi/mca/topo/treematch/treematch/k-partitioning.c double cost = 0; cost 296 ompi/mca/topo/treematch/treematch/k-partitioning.c cost += comm[i][j]; cost 298 ompi/mca/topo/treematch/treematch/k-partitioning.c return cost; cost 293 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double cost, best_cost = -1; cost 307 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c cost = (((i)<com_mat->n)) ?com_mat->comm[u][i]:0; cost 311 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if (( cost > best_cost)){ cost 312 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c best_cost = cost; cost 329 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double cost = 0; cost 335 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c cost += com_mat->comm[i][j]; cost 337 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c return cost; cost 345 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c double cost, best_cost = -1; cost 442 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c cost = eval_cost(partition,com_mat); cost 447 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((cost<best_cost) || (best_cost == -1)){ cost 448 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c best_cost=cost; cost 91 ompi/mca/topo/treematch/treematch/tm_solution.c double *cost = topology->cost; cost 106 ompi/mca/topo/treematch/treematch/tm_solution.c a = cost[depth-distance(topology,sigma[i],sigma[j])]; cost 127 ompi/mca/topo/treematch/treematch/tm_solution.c double *cost = topology->cost; cost 142 ompi/mca/topo/treematch/treematch/tm_solution.c a = cost[depth-distance(topology,sigma[i],sigma[j])]; cost 13 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n); cost 25 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_cost_cpy(tm_topology_t *topology,double **cost); cost 29 ompi/mca/topo/treematch/treematch/tm_topology.c tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes); cost 55 ompi/mca/topo/treematch/treematch/tm_topology.c double *cost = NULL; cost 92 ompi/mca/topo/treematch/treematch/tm_topology.c cost = (double*)CALLOC(topology->nb_levels,sizeof(double)); cost 96 ompi/mca/topo/treematch/treematch/tm_topology.c cost[i] = atoi(strtok(NULL," ")); cost 104 ompi/mca/topo/treematch/treematch/tm_topology.c cost[i] += cost[i+1]; cost 111 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost=cost; cost 245 ompi/mca/topo/treematch/treematch/tm_topology.c double *cost; cost 321 ompi/mca/topo/treematch/treematch/tm_topology.c cost = (double*)CALLOC(res->nb_levels,sizeof(double)); cost 323 ompi/mca/topo/treematch/treematch/tm_topology.c cost[l] = link_cost(l); cost 325 ompi/mca/topo/treematch/treematch/tm_topology.c res->cost = cost; cost 374 ompi/mca/topo/treematch/treematch/tm_topology.c res->cost = NULL; cost 417 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->cost); cost 468 ompi/mca/topo/treematch/treematch/tm_topology.c if(topology->cost) cost 469 ompi/mca/topo/treematch/treematch/tm_topology.c printf("(%lf)",topology->cost[depth]); cost 609 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_cost_cpy(tm_topology_t *topology,double **cost) cost 611 ompi/mca/topo/treematch/treematch/tm_topology.c *cost = (double*)MALLOC(sizeof(double)*(topology->nb_levels)); cost 612 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*cost,topology->cost,sizeof(double)*(topology->nb_levels)); cost 615 ompi/mca/topo/treematch/treematch/tm_topology.c void optimize_arity(int **arity, double **cost, int *nb_levels,int n) cost 643 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[i] = (*cost)[i]; cost 648 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[n] = (*cost)[n];; cost 653 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[n+1] = (*cost)[n]; cost 657 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[i] = (*cost)[i-1]; cost 660 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(*cost); cost 667 ompi/mca/topo/treematch/treematch/tm_topology.c *cost=new_cost; cost 674 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[i] = (*cost)[i]; cost 677 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[n] = (*cost)[n];; cost 680 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[n+1] = (*cost)[n]; cost 683 ompi/mca/topo/treematch/treematch/tm_topology.c new_cost[i] = (*cost)[i-1]; cost 686 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(*cost); cost 692 ompi/mca/topo/treematch/treematch/tm_topology.c *cost= new_cost; cost 694 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(arity, cost, nb_levels,n-1); cost 704 ompi/mca/topo/treematch/treematch/tm_topology.c double *cost; cost 715 ompi/mca/topo/treematch/treematch/tm_topology.c topology_cost_cpy(*topology,&cost); cost 718 ompi/mca/topo/treematch/treematch/tm_topology.c optimize_arity(&arity,&cost,&nb_levels,nb_levels-2); cost 720 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo->cost = cost; cost 766 ompi/mca/topo/treematch/treematch/tm_topology.c tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes) cost 779 ompi/mca/topo/treematch/treematch/tm_topology.c if(cost) cost 780 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost = (double*)CALLOC(topology->nb_levels,sizeof(double)); cost 782 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost = NULL; cost 785 ompi/mca/topo/treematch/treematch/tm_topology.c if(cost) cost 786 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology->cost, cost, sizeof(double)*nb_levels); cost 804 ompi/mca/topo/treematch/treematch/tm_topology.c if(cost){ cost 807 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost[i] += topology->cost[i+1]; cost 860 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> cost = (double*) REALLOC(topology->cost, sizeof(double)*topology->nb_levels); cost 867 ompi/mca/topo/treematch/treematch/tm_topology.c topology->cost[i-1] = 0; cost 7 ompi/mca/topo/treematch/treematch/tm_topology.h void optimize_arity(int **arity, double **cost, int *nb_levels,int n); cost 19 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_cost(tm_topology_t *topology,double **cost); cost 67 ompi/mca/topo/treematch/treematch/treematch.h double *cost; /* Cost of the communication depending on the distance: cost 139 ompi/mca/topo/treematch/treematch/treematch.h tm_topology_t *tm_build_synthetic_topology(int *arity, double *cost, int nb_levels, int *core_numbering, int nb_core_per_nodes); cost 479 opal/mca/btl/usnic/btl_usnic_proc.c int64_t weight, cost; cost 498 opal/mca/btl/usnic/btl_usnic_proc.c cost = -weight; cost 500 opal/mca/btl/usnic/btl_usnic_proc.c assert(INT64_MAX != cost); cost 501 opal/mca/btl/usnic/btl_usnic_proc.c assert(INT64_MIN != cost); cost 512 opal/mca/btl/usnic/btl_usnic_proc.c __func__, u, v, cost, i, j); cost 513 opal/mca/btl/usnic/btl_usnic_proc.c err = opal_bp_graph_add_edge(g, u, v, cost, cost 271 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h NETLOC_int *cost; cost 290 opal/util/bipartite_graph.c e->cost, e->capacity, NULL); cost 328 opal/util/bipartite_graph.c int64_t cost, cost 341 opal/util/bipartite_graph.c if (cost == MAX_COST) { cost 365 opal/util/bipartite_graph.c e->cost = cost; cost 544 opal/util/bipartite_graph.c check_add64_overflow(dist[u], e_ptr->cost); cost 545 opal/util/bipartite_graph.c if ((dist[u] + e_ptr->cost) < dist[v]) { cost 546 opal/util/bipartite_graph.c dist[v] = dist[u] + e_ptr->cost; cost 569 opal/util/bipartite_graph.c (dist[u] + e_ptr->cost) < dist[v]) { cost 695 opal/util/bipartite_graph.c -e_ptr->cost, cost 112 opal/util/bipartite_graph.h int64_t cost, cost 34 opal/util/bipartite_graph_internal.h int64_t cost;