constraints 621 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); constraints 624 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints[idx++] = obj_mapping[i]; /* use process ranks instead of core numbers */ constraints 846 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); constraints 849 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->constraints[idx++] = obj_to_rank_in_lcomm[i]; 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); 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); 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) constraints 28 ompi/mca/topo/treematch/treematch/k-partitioning.c part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); 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) constraints 218 ompi/mca/topo/treematch/treematch/k-partitioning.c int i_part = constraints[i]/max_size; /*we compute its partition*/ 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) constraints 306 ompi/mca/topo/treematch/treematch/k-partitioning.c part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); constraints 317 ompi/mca/topo/treematch/treematch/k-partitioning.c int i_part = constraints[i]/nodes_per_part; /*we compute the partition where we have to put this constraint*/ 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); 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){ constraints 180 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(constraints[end] >= max_val) constraints 272 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); 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) constraints 365 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Constraints: ");print_1D_tab(constraints,nb_constraints); constraints 391 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(constraints[end] >= max_val) 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) constraints 482 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_scotch(k, com_mat, n, constraints, nb_constraints); constraints 486 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); constraints 491 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); 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) 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); constraints 522 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("\tConstraint: "); print_1D_tab(constraints, nb_constraints); constraints 523 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("\tSub constraint: "); print_1D_tab(const_tab[i].constraints, end-start); constraints 681 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c FREE(const_tab[i].constraints); constraints 722 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *constraints, int nb_constraints, constraints 751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition(k, com_mat, N, constraints, nb_constraints); constraints 764 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = split_constraints (constraints, nb_constraints, k, topology, depth, N); constraints 777 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab[i].constraints, const_tab[i].length, 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) constraints 810 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((constraints == NULL) && (nb_constraints != 0)){ constraints 816 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if((constraints != NULL) && (nb_constraints > nb_cores)){ constraints 863 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraints, nb_constraints, obj_weight, com_speed); 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); constraints 28 ompi/mca/topo/treematch/treematch/tm_mapping.h int *constraints; /* the subconstraints*/ constraints 294 ompi/mca/topo/treematch/treematch/tm_solution.c if((!topology->constraints) || (in_tab(topology->constraints, topology->nb_constraints, topology->node_id[i]))){ constraints 310 ompi/mca/topo/treematch/treematch/tm_solution.c if(topology->constraints) constraints 311 ompi/mca/topo/treematch/treematch/tm_solution.c sigma[i]=topology->constraints[i%topology->nb_constraints]; constraints 24 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_constraints_cpy(tm_topology_t *topology,int **constraints,int *nb_constraints); constraints 88 ompi/mca/topo/treematch/treematch/tm_topology.c topology->constraints = NULL; constraints 285 ompi/mca/topo/treematch/treematch/tm_topology.c res->constraints = NULL; constraints 369 ompi/mca/topo/treematch/treematch/tm_topology.c res->constraints = NULL; constraints 414 ompi/mca/topo/treematch/treematch/tm_topology.c FREE(topology->constraints); constraints 451 ompi/mca/topo/treematch/treematch/tm_topology.c if(topology->constraints){ constraints 454 ompi/mca/topo/treematch/treematch/tm_topology.c printf("%d ",topology->constraints[i]); constraints 487 ompi/mca/topo/treematch/treematch/tm_topology.c if(!in_tab(topology->node_id, topology->nb_nodes[depth], topology->constraints[i])){ constraints 489 ompi/mca/topo/treematch/treematch/tm_topology.c fprintf(stderr,"Error! Incompatible constraint with the topology: rank %d in the constraints is not a valid id of any nodes of the topology.\n",topology->constraints[i]); 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){ constraints 506 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> constraints = (int*)MALLOC(nb_constraints*sizeof(int)); constraints 507 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(topology -> constraints, constraints, nb_constraints*sizeof(int)); constraints 509 ompi/mca/topo/treematch/treematch/tm_topology.c topology -> constraints = constraints; 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){ constraints 516 ompi/mca/topo/treematch/treematch/tm_topology.c return tm_topology_set_binding_constraints_cpy(constraints, nb_constraints, topology, 1); constraints 598 ompi/mca/topo/treematch/treematch/tm_topology.c void topology_constraints_cpy(tm_topology_t *topology,int **constraints,int *nb_constraints) constraints 601 ompi/mca/topo/treematch/treematch/tm_topology.c if(topology->constraints){ constraints 602 ompi/mca/topo/treematch/treematch/tm_topology.c *constraints = (int*)MALLOC(sizeof(int)*(*nb_constraints)); constraints 603 ompi/mca/topo/treematch/treematch/tm_topology.c memcpy(*constraints,topology->constraints,sizeof(int)*(*nb_constraints)); constraints 605 ompi/mca/topo/treematch/treematch/tm_topology.c *constraints = NULL; constraints 706 ompi/mca/topo/treematch/treematch/tm_topology.c int *constraints = NULL, nb_constraints; constraints 714 ompi/mca/topo/treematch/treematch/tm_topology.c topology_constraints_cpy(*topology,&constraints,&nb_constraints); constraints 721 ompi/mca/topo/treematch/treematch/tm_topology.c new_topo->constraints = constraints; constraints 729 ompi/mca/topo/treematch/treematch/tm_topology.c if(constraints){ constraints 732 ompi/mca/topo/treematch/treematch/tm_topology.c printf("%d - ",constraints[i]); constraints 775 ompi/mca/topo/treematch/treematch/tm_topology.c topology->constraints = NULL; constraints 18 ompi/mca/topo/treematch/treematch/tm_topology.h void topology_constraints(tm_topology_t *topology,int **constraints,int *nb_constraints); constraints 2234 ompi/mca/topo/treematch/treematch/tm_tree.c int check_constraints(tm_topology_t *topology, int **constraints) constraints 2241 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_constraints && topology->constraints){ constraints 2242 ompi/mca/topo/treematch/treematch/tm_tree.c *constraints = (int*)MALLOC(sizeof(int)*(nb_constraints)); constraints 2252 ompi/mca/topo/treematch/treematch/tm_tree.c (*constraints)[i] = topology->node_rank[topology->constraints[i/topology->oversub_fact]] +shift; constraints 2253 ompi/mca/topo/treematch/treematch/tm_tree.c if((*constraints)[i] < last) constraints 2255 ompi/mca/topo/treematch/treematch/tm_tree.c last = (*constraints)[i]; constraints 2259 ompi/mca/topo/treematch/treematch/tm_tree.c qsort(*constraints, nb_constraints , sizeof(int), int_cmp_inc); constraints 2263 ompi/mca/topo/treematch/treematch/tm_tree.c *constraints = NULL; constraints 2275 ompi/mca/topo/treematch/treematch/tm_tree.c int *constraints = NULL, nb_constraints; constraints 2283 ompi/mca/topo/treematch/treematch/tm_tree.c nb_constraints = check_constraints (topology, &constraints); constraints 2291 ompi/mca/topo/treematch/treematch/tm_tree.c if(constraints) constraints 2292 ompi/mca/topo/treematch/treematch/tm_tree.c print_1D_tab(constraints, nb_constraints); constraints 2313 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(constraints); 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, constraints 2323 ompi/mca/topo/treematch/treematch/tm_tree.c FREE(constraints); constraints 70 ompi/mca/topo/treematch/treematch/treematch.h int *constraints; /* Array of constraints: id of the nodes where it is possible to map processes */ constraints 156 ompi/mca/topo/treematch/treematch/treematch.h int tm_topology_set_binding_constraints(int *constraints, int nb_constraints, tm_topology_t *topology);