nb_constraints 617 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_constraints = 0; nb_constraints 620 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_constraints++; nb_constraints 621 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); nb_constraints 626 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c assert(idx == tm_topology->nb_constraints); nb_constraints 840 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_constraints = 0; nb_constraints 844 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->nb_constraints++; nb_constraints 846 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); nb_constraints 16 ompi/mca/topo/treematch/treematch/k-partitioning.c int *kpartition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints); nb_constraints 17 ompi/mca/topo/treematch/treematch/k-partitioning.c int* build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints); nb_constraints 19 ompi/mca/topo/treematch/treematch/k-partitioning.c int* kPartitioning(double ** comm, int n, int k, int * constraints, int nb_constraints, int greedy_trials) nb_constraints 26 ompi/mca/topo/treematch/treematch/k-partitioning.c int real_n = n-nb_constraints; nb_constraints 28 ompi/mca/topo/treematch/treematch/k-partitioning.c part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); nb_constraints 198 ompi/mca/topo/treematch/treematch/k-partitioning.c int *kpartition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints) nb_constraints 214 ompi/mca/topo/treematch/treematch/k-partitioning.c if (nb_constraints){ /*if there are at least one constraint*/ nb_constraints 215 ompi/mca/topo/treematch/treematch/k-partitioning.c int nb_real_nodes = n-nb_constraints; /*this is the number of "real" nodes by opposition to the dumb ones*/ nb_constraints 216 ompi/mca/topo/treematch/treematch/k-partitioning.c for(i=0; i<nb_constraints; ++i) /*for each constraint*/ nb_constraints 243 ompi/mca/topo/treematch/treematch/k-partitioning.c allocate_vertex2(i, res, comm, n-nb_constraints, size, max_size); nb_constraints 245 ompi/mca/topo/treematch/treematch/k-partitioning.c cost = eval_cost2(res,n-nb_constraints,comm); nb_constraints 301 ompi/mca/topo/treematch/treematch/k-partitioning.c int* build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints) nb_constraints 306 ompi/mca/topo/treematch/treematch/k-partitioning.c part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); nb_constraints 313 ompi/mca/topo/treematch/treematch/k-partitioning.c int nb_real_nodes = n-nb_constraints; nb_constraints 315 ompi/mca/topo/treematch/treematch/k-partitioning.c for(i=0; i<nb_constraints; i++) /*for each constraints*/ nb_constraints 18 ompi/mca/topo/treematch/treematch/k-partitioning.h int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int greedy_trials); nb_constraints 151 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition_scotch(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints){ nb_constraints 174 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if (nb_constraints){ nb_constraints 179 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c while( end < nb_constraints){ nb_constraints 272 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); nb_constraints 340 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition_greedy(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints) nb_constraints 351 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(nb_constraints > n){ nb_constraints 353 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr,"Error more constraints (%d) than the problem size (%d)!\n",nb_constraints, n); nb_constraints 362 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("nb_constraints = %d\n",nb_constraints); nb_constraints 365 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Constraints: ");print_1D_tab(constraints,nb_constraints); nb_constraints 384 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if (nb_constraints){ nb_constraints 390 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c while( end < nb_constraints){ nb_constraints 463 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints) nb_constraints 482 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_scotch(k, com_mat, n, constraints, nb_constraints); nb_constraints 486 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); nb_constraints 491 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); nb_constraints 496 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraint_t *split_constraints (int *constraints, int nb_constraints, int k, tm_topology_t *topology, int depth, int N) nb_constraints 518 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c end = fill_tab(&(const_tab[i].constraints), constraints, nb_constraints,start, (i+1) * nb_leaves, i * nb_leaves); nb_constraints 522 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("\tConstraint: "); print_1D_tab(constraints, nb_constraints); nb_constraints 722 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *constraints, int nb_constraints, nb_constraints 751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition(k, com_mat, N, constraints, nb_constraints); nb_constraints 764 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = split_constraints (constraints, nb_constraints, k, topology, depth, N); nb_constraints 793 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tm_tree_t *kpartition_build_tree_from_topology(tm_topology_t *topology,double **comm,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed) nb_constraints 808 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Number of constraints: %d, N=%d, nb_cores = %d, K=%d\n", nb_constraints, N, nb_cores, nb_cores-N); nb_constraints 810 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((constraints == NULL) && (nb_constraints != 0)){ nb_constraints 816 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((constraints != NULL) && (nb_constraints > nb_cores)){ nb_constraints 818 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr,"size of constraint table (%d) is greater than the number of cores (%d)\n", nb_constraints, nb_cores); nb_constraints 850 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < MIN(N,nb_constraints) ; i++) nb_constraints 852 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = MIN(N,nb_constraints) ;i < N + K ; i++) nb_constraints 863 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraints, nb_constraints, obj_weight, com_speed); nb_constraints 9 ompi/mca/topo/treematch/treematch/tm_kpartitioning.h tm_tree_t * kpartition_build_tree_from_topology(tm_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed); nb_constraints 294 ompi/mca/topo/treematch/treematch/tm_solution.c if((!topology->constraints) || (in_tab(topology->constraints, topology->nb_constraints, topology->node_id[i]))){ nb_constraints 311 ompi/mca/topo/treematch/treematch/tm_solution.c sigma[i]=topology->constraints[i%topology->nb_constraints]; nb_constraints 24 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_constraints_cpy(tm_topology_t *topology,int **constraints,int *nb_constraints); nb_constraints 86 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_constraints = 0; nb_constraints 284 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = 0; nb_constraints 308 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = nb_nodes; nb_constraints 368 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = 0; nb_constraints 387 ompi/mca/topo/treematch/treematch/tm_topology.c res->nb_constraints = nb_nodes; nb_constraints 453 ompi/mca/topo/treematch/treematch/tm_topology.c for(i = 0; i < topology->nb_constraints; i++) nb_constraints 459 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_levels, topology->nb_constraints, topology->oversub_fact, topology->nb_proc_units); nb_constraints 483 ompi/mca/topo/treematch/treematch/tm_topology.c int n = topology->nb_constraints; nb_constraints 502 ompi/mca/topo/treematch/treematch/tm_topology.c static int tm_topology_set_binding_constraints_cpy(int *constraints, int nb_constraints, tm_topology_t *topology, int cpy_flag){ nb_constraints 504 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> nb_constraints = nb_constraints; nb_constraints 506 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> constraints = (int*)MALLOC(nb_constraints*sizeof(int)); nb_constraints 507 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology -> constraints, constraints, nb_constraints*sizeof(int)); nb_constraints 515 ompi/mca/topo/treematch/treematch/tm_topology.c int tm_topology_set_binding_constraints(int *constraints, int nb_constraints, tm_topology_t *topology){ nb_constraints 516 ompi/mca/topo/treematch/treematch/tm_topology.c return tm_topology_set_binding_constraints_cpy(constraints, nb_constraints, topology, 1); nb_constraints 598 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_constraints_cpy(tm_topology_t *topology,int **constraints,int *nb_constraints) nb_constraints 600 ompi/mca/topo/treematch/treematch/tm_topology.c *nb_constraints = topology->nb_constraints; nb_constraints 602 ompi/mca/topo/treematch/treematch/tm_topology.c *constraints = (int*)MALLOC(sizeof(int)*(*nb_constraints)); nb_constraints 603 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*constraints,topology->constraints,sizeof(int)*(*nb_constraints)); nb_constraints 706 ompi/mca/topo/treematch/treematch/tm_topology.c int *constraints = NULL, nb_constraints; nb_constraints 714 ompi/mca/topo/treematch/treematch/tm_topology.c topology_constraints_cpy(*topology,&constraints,&nb_constraints); nb_constraints 722 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo->nb_constraints = nb_constraints; nb_constraints 731 ompi/mca/topo/treematch/treematch/tm_topology.c for(i=0;i<nb_constraints;i++) nb_constraints 773 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_constraints = 0; nb_constraints 794 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_constraints = n; nb_constraints 834 ompi/mca/topo/treematch/treematch/tm_topology.c topology->nb_constraints = n; nb_constraints 18 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_constraints(tm_topology_t *topology,int **constraints,int *nb_constraints); nb_constraints 2240 ompi/mca/topo/treematch/treematch/tm_tree.c int nb_constraints = topology->nb_constraints*topology->oversub_fact; nb_constraints 2241 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_constraints && topology->constraints){ nb_constraints 2242 ompi/mca/topo/treematch/treematch/tm_tree.c *constraints = (int*)MALLOC(sizeof(int)*(nb_constraints)); nb_constraints 2244 ompi/mca/topo/treematch/treematch/tm_tree.c for(i = 0 ; i < nb_constraints ; i++){ nb_constraints 2259 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(*constraints, nb_constraints , sizeof(int), int_cmp_inc); nb_constraints 2266 ompi/mca/topo/treematch/treematch/tm_tree.c return nb_constraints; nb_constraints 2275 ompi/mca/topo/treematch/treematch/tm_tree.c int *constraints = NULL, nb_constraints; nb_constraints 2283 ompi/mca/topo/treematch/treematch/tm_tree.c nb_constraints = check_constraints (topology, &constraints); nb_constraints 2290 ompi/mca/topo/treematch/treematch/tm_tree.c printf("nb_constraints : %d\n", nb_constraints); nb_constraints 2292 ompi/mca/topo/treematch/treematch/tm_tree.c print_1D_tab(constraints, nb_constraints); nb_constraints 2298 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_processes > nb_constraints){ nb_constraints 2301 ompi/mca/topo/treematch/treematch/tm_tree.c nb_constraints, nb_processes); nb_constraints 2306 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_constraints == nb_slots) nb_constraints 2309 ompi/mca/topo/treematch/treematch/tm_tree.c printf("No need to use %d constraints for %d slots!\n", nb_constraints, nb_slots); nb_constraints 2312 ompi/mca/topo/treematch/treematch/tm_tree.c nb_constraints = 0; nb_constraints 2316 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_constraints){ nb_constraints 2320 ompi/mca/topo/treematch/treematch/tm_tree.c result = kpartition_build_tree_from_topology(topology, aff_mat->mat, nb_processes, constraints, nb_constraints, nb_constraints 71 ompi/mca/topo/treematch/treematch/treematch.h int nb_constraints; /* Size of the above array */ nb_constraints 156 ompi/mca/topo/treematch/treematch/treematch.h int tm_topology_set_binding_constraints(int *constraints, int nb_constraints, tm_topology_t *topology);