/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/treematch/treematch/ |
H A D | tm_kpartitioning.c | 99 if(nb_constraints > n){ in kpartition_greedy() 110 printf("nb_constraints = %d\n",nb_constraints); in kpartition_greedy() 113 printf("Constraints: ");print_1D_tab(constraints,nb_constraints); in kpartition_greedy() 131 if (nb_constraints){ in kpartition_greedy() 137 while( end < nb_constraints){ in kpartition_greedy() 443 int *constraints, int nb_constraints, in kpartition_build_level_topology() argument 527 if((constraints == NULL) && (nb_constraints != 0)){ in kpartition_build_tree_from_topology() 533 if((constraints != NULL) && (nb_constraints > nb_cores)){ in kpartition_build_tree_from_topology() 567 for( i = 0 ; i < MIN(N,nb_constraints) ; i++) in kpartition_build_tree_from_topology() 569 for( i = MIN(N,nb_constraints) ;i < N + K ; i++) in kpartition_build_tree_from_topology() [all …]
|
H A D | tm_topology.c | 73 topology->nb_constraints = 0; in tgt_to_tm() 221 res->nb_constraints = 0; in hwloc_to_tm() 316 res->nb_constraints = 0; in get_local_topo_with_hwloc() 439 int n = topology->nb_constraints; in topo_check_constraints() 460 topology -> nb_constraints = nb_constraints; in tm_topology_set_binding_constraints_cpy() 556 *nb_constraints = topology->nb_constraints; in topology_constraints_cpy() 678 new_topo->nb_constraints = nb_constraints; in tm_optimize_topology() 687 for(i=0;i<nb_constraints;i++) in tm_optimize_topology() 729 topology->nb_constraints = 0; in tm_build_synthetic_topology() 766 topology->nb_constraints = n; in tm_build_synthetic_topology() [all …]
|
H A D | k-partitioning.c | 16 …rtition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints); 19 int* kPartitioning(double ** comm, int n, int k, int * constraints, int nb_constraints, int greedy_… in kPartitioning() argument 26 int real_n = n-nb_constraints; in kPartitioning() 28 part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); in kPartitioning() 214 if (nb_constraints){ /*if there are at least one constraint*/ in kpartition_greedy2() 216 for(i=0; i<nb_constraints; ++i) /*for each constraint*/ in kpartition_greedy2() 243 allocate_vertex2(i, res, comm, n-nb_constraints, size, max_size); in kpartition_greedy2() 245 cost = eval_cost2(res,n-nb_constraints,comm); in kpartition_greedy2() 306 part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); in build_p_vector() 313 int nb_real_nodes = n-nb_constraints; in build_p_vector() [all …]
|
H A D | treematch.h | 63 int nb_constraints; /* Size of the above array */ member 145 int tm_topology_set_binding_constraints(int *constraints, int nb_constraints, tm_topology_t *topolo…
|
H A D | tm_tree.c | 2217 int nb_constraints = topology->nb_constraints*topology->oversub_fact; in check_constraints() local 2218 if(nb_constraints && topology->constraints){ in check_constraints() 2221 for(i = 0 ; i < nb_constraints ; i++){ in check_constraints() 2243 return nb_constraints; in check_constraints() 2252 int *constraints = NULL, nb_constraints; in tm_build_tree_from_topology() local 2269 print_1D_tab(constraints, nb_constraints); in tm_build_tree_from_topology() 2275 if(nb_processes > nb_constraints){ in tm_build_tree_from_topology() 2278 nb_constraints, nb_processes); in tm_build_tree_from_topology() 2283 if(nb_constraints == nb_slots) in tm_build_tree_from_topology() 2289 nb_constraints = 0; in tm_build_tree_from_topology() [all …]
|
H A D | k-partitioning.h | 18 int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int g…
|
H A D | tm_kpartitioning.h | 9 …m_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_w…
|
H A D | tm_topology.h | 18 void topology_constraints(tm_topology_t *topology,int **constraints,int *nb_constraints);
|
H A D | tm_solution.c | 273 …if((!topology->constraints) || (in_tab(topology->constraints, topology->nb_constraints, topology->… in map_Packed() 290 sigma[i]=topology->constraints[i%topology->nb_constraints]; in map_RR()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/treematch/treematch/ |
H A D | tm_kpartitioning.c | 99 if(nb_constraints > n){ in kpartition_greedy() 110 printf("nb_constraints = %d\n",nb_constraints); in kpartition_greedy() 113 printf("Constraints: ");print_1D_tab(constraints,nb_constraints); in kpartition_greedy() 131 if (nb_constraints){ in kpartition_greedy() 137 while( end < nb_constraints){ in kpartition_greedy() 443 int *constraints, int nb_constraints, in kpartition_build_level_topology() argument 527 if((constraints == NULL) && (nb_constraints != 0)){ in kpartition_build_tree_from_topology() 533 if((constraints != NULL) && (nb_constraints > nb_cores)){ in kpartition_build_tree_from_topology() 567 for( i = 0 ; i < MIN(N,nb_constraints) ; i++) in kpartition_build_tree_from_topology() 569 for( i = MIN(N,nb_constraints) ;i < N + K ; i++) in kpartition_build_tree_from_topology() [all …]
|
H A D | tm_topology.c | 73 topology->nb_constraints = 0; in tgt_to_tm() 228 res->nb_constraints = 0; in hwloc_to_tm() 323 res->nb_constraints = 0; in get_local_topo_with_hwloc() 446 int n = topology->nb_constraints; in topo_check_constraints() 467 topology -> nb_constraints = nb_constraints; in tm_topology_set_binding_constraints_cpy() 563 *nb_constraints = topology->nb_constraints; in topology_constraints_cpy() 685 new_topo->nb_constraints = nb_constraints; in tm_optimize_topology() 694 for(i=0;i<nb_constraints;i++) in tm_optimize_topology() 736 topology->nb_constraints = 0; in tm_build_synthetic_topology() 773 topology->nb_constraints = n; in tm_build_synthetic_topology() [all …]
|
H A D | k-partitioning.c | 16 …rtition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints); 19 int* kPartitioning(double ** comm, int n, int k, int * constraints, int nb_constraints, int greedy_… in kPartitioning() argument 26 int real_n = n-nb_constraints; in kPartitioning() 28 part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); in kPartitioning() 214 if (nb_constraints){ /*if there are at least one constraint*/ in kpartition_greedy2() 216 for(i=0; i<nb_constraints; ++i) /*for each constraint*/ in kpartition_greedy2() 243 allocate_vertex2(i, res, comm, n-nb_constraints, size, max_size); in kpartition_greedy2() 245 cost = eval_cost2(res,n-nb_constraints,comm); in kpartition_greedy2() 306 part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); in build_p_vector() 313 int nb_real_nodes = n-nb_constraints; in build_p_vector() [all …]
|
H A D | treematch.h | 63 int nb_constraints; /* Size of the above array */ member 145 int tm_topology_set_binding_constraints(int *constraints, int nb_constraints, tm_topology_t *topolo…
|
H A D | tm_tree.c | 2215 int nb_constraints = topology->nb_constraints*topology->oversub_fact; in check_constraints() local 2216 if(nb_constraints && topology->constraints){ in check_constraints() 2219 for(i = 0 ; i < nb_constraints ; i++){ in check_constraints() 2241 return nb_constraints; in check_constraints() 2250 int *constraints = NULL, nb_constraints; in tm_build_tree_from_topology() local 2267 print_1D_tab(constraints, nb_constraints); in tm_build_tree_from_topology() 2273 if(nb_processes > nb_constraints){ in tm_build_tree_from_topology() 2276 nb_constraints, nb_processes); in tm_build_tree_from_topology() 2281 if(nb_constraints == nb_slots) in tm_build_tree_from_topology() 2287 nb_constraints = 0; in tm_build_tree_from_topology() [all …]
|
H A D | k-partitioning.h | 18 int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int g…
|
H A D | tm_kpartitioning.h | 9 …m_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_w…
|
H A D | tm_topology.h | 18 void topology_constraints(tm_topology_t *topology,int **constraints,int *nb_constraints);
|
H A D | tm_solution.c | 273 …if((!topology->constraints) || (in_tab(topology->constraints, topology->nb_constraints, topology->… in map_Packed() 290 sigma[i]=topology->constraints[i%topology->nb_constraints]; in map_RR()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/snowpac/include/ |
H A D | NOWPAC.hpp | 61 int nb_constraints; member in NOWPAC 350 nb_constraints = -1; in NOWPAC() 399 if ( nb_constraints == -1 ) { in set_option() 463 if ( nb_constraints == -1 ) { in set_option() 645 nb_constraints = m; in set_blackbox() 1246 if ( nb_constraints == -1 ) { in check_parameter_consistency() 1341 if ( nb_constraints > 0 ) { in check_parameter_consistency() 2130 switch(nb_constraints){ in optimize() 2159 val.resize(1 + nb_constraints); in optimize() 2179 if ( nb_constraints > 0) { in optimize() [all …]
|
/dports/science/siconos/siconos-4.4.0/numerics/src/FrictionContact/ |
H A D | fc3d_admm.c | 68 size_t nb_constraints =m; in fc3d_admm_init() local 74 nb_constraints =2*m; in fc3d_admm_init() 82 data->xi_hat = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 83 data->xi = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 84 data->xi_k = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 86 data->z_hat = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 87 data->z = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 88 data->z_k = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init() 95 data->b = (double*)calloc(nb_constraints,sizeof(double)); in fc3d_admm_init()
|
H A D | rolling_fc3d_admm.c | 68 size_t nb_constraints =m; in rolling_fc3d_admm_init() local 74 nb_constraints =2*m; in rolling_fc3d_admm_init() 82 data->xi_hat = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 83 data->xi = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 84 data->xi_k = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 86 data->z_hat = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 87 data->z = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 88 data->z_k = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init() 95 data->b = (double*)calloc(nb_constraints,sizeof(double)); in rolling_fc3d_admm_init()
|
/dports/net/openmpi3/openmpi-3.1.6/ompi/mca/topo/treematch/ |
H A D | topo_treematch_dist_graph_create.c | 623 tm_topology->nb_constraints = 0; in mca_topo_treematch_dist_graph_create() 626 tm_topology->nb_constraints++; in mca_topo_treematch_dist_graph_create() 627 tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); in mca_topo_treematch_dist_graph_create() 823 tm_topology->nb_constraints = 0; in mca_topo_treematch_dist_graph_create() 826 tm_topology->nb_constraints++; in mca_topo_treematch_dist_graph_create() 828 tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); in mca_topo_treematch_dist_graph_create()
|
/dports/net/openmpi/openmpi-4.1.1/ompi/mca/topo/treematch/ |
H A D | topo_treematch_dist_graph_create.c | 623 tm_topology->nb_constraints = 0; in mca_topo_treematch_dist_graph_create() 626 tm_topology->nb_constraints++; in mca_topo_treematch_dist_graph_create() 627 tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); in mca_topo_treematch_dist_graph_create() 823 tm_topology->nb_constraints = 0; in mca_topo_treematch_dist_graph_create() 826 tm_topology->nb_constraints++; in mca_topo_treematch_dist_graph_create() 828 tm_topology->constraints = (int *)calloc(tm_topology->nb_constraints,sizeof(int)); in mca_topo_treematch_dist_graph_create()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/boost/graph/ |
H A D | convert_nef_polyhedron_to_polygon_mesh.h | 244 std::size_t nb_constraints = polygon.size(); in visit() local 246 for(std::size_t i=0; i<nb_constraints; ++i) in visit()
|