num_nodes 52 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int num_nodes, num_nodes 140 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int numlevels = 0, num_nodes = 0, num_procs_in_node = 0; num_nodes 197 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c num_nodes++; /* compute number of nodes */ num_nodes 202 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if( 0 == num_nodes ) { num_nodes 212 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c nodes_roots = (int *)calloc(num_nodes, sizeof(int)); num_nodes 217 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "num nodes is %i\n", num_nodes)); num_nodes 220 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "Root nodes are :\n", "root ", nodes_roots, num_nodes); num_nodes 256 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c oversubscribing_objs = check_oversubscribing(rank, num_nodes, num_nodes 265 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c oversubscribed_pus = check_oversubscribing(rank, num_nodes, num_nodes 278 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c oversubscribed_pus = check_oversubscribing(rank, num_nodes, num_nodes 430 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if ( num_nodes > 1 ) { num_nodes 433 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c objs_per_node = (int *)calloc(num_nodes, sizeof(int)); num_nodes 434 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c reqs = (MPI_Request *)calloc(num_nodes-1, sizeof(MPI_Request)); num_nodes 436 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1; i < num_nodes ; i++) num_nodes 444 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != ( err = ompi_request_wait_all(num_nodes - 1, num_nodes 450 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < num_nodes; i++) num_nodes 458 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1; i < num_nodes ; i++) { num_nodes 468 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != ( err = ompi_request_wait_all(num_nodes - 1, num_nodes 487 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if ( num_nodes > 1 ) { num_nodes 504 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c hierarchies = (int *)malloc(num_nodes*(TM_MAX_LEVELS+1)*sizeof(int)); num_nodes 517 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if ( num_nodes > 1 ) { num_nodes 525 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1; i < num_nodes ; i++) num_nodes 532 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != ( err = ompi_request_wait_all(num_nodes - 1, num_nodes 550 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "hierarchies : ", "", hierarchies, num_nodes*(TM_MAX_LEVELS+1)); num_nodes 556 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 1 ; i < num_nodes ; i++) num_nodes 561 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(i = 0; i < num_nodes ; i++) { num_nodes 567 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if( num_nodes > 1) { num_nodes 571 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c tm_topology->arity[0] = num_nodes; num_nodes 574 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(j = 1; j < num_nodes ; j++) num_nodes 911 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c marked = (int *)malloc((num_nodes-1)*sizeof(int)); num_nodes 912 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c for(idx = 0 ; idx < num_nodes - 1 ; idx++) num_nodes 128 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes, num_nodes 131 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_narray_knomial_tree( int tree_order, int my_rank, int num_nodes, num_nodes 139 ompi/patterns/net/netpatterns.h OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, num_nodes 143 ompi/patterns/net/netpatterns.h int num_nodes, netpatterns_tree_node_t **tree_nodes); num_nodes 38 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, int *hier_ranks, num_nodes 57 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); num_nodes 59 ompi/patterns/net/netpatterns_knomial_tree.c assert(num_nodes > 1); num_nodes 61 ompi/patterns/net/netpatterns_knomial_tree.c if (tree_order > num_nodes) { num_nodes 62 ompi/patterns/net/netpatterns_knomial_tree.c tree_order = num_nodes; num_nodes 74 ompi/patterns/net/netpatterns_knomial_tree.c while ( num_nodes > cnt ) { num_nodes 86 ompi/patterns/net/netpatterns_knomial_tree.c if ( cnt > num_nodes) { num_nodes 99 ompi/patterns/net/netpatterns_knomial_tree.c group_info[0] = num_nodes/tree_order; num_nodes 132 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->reindex_map = (int *) malloc(num_nodes*sizeof(int)); num_nodes 134 ompi/patterns/net/netpatterns_knomial_tree.c exchange_node->inv_reindex_map = (int *) malloc(num_nodes*sizeof(int)); num_nodes 137 ompi/patterns/net/netpatterns_knomial_tree.c if( stray < num_nodes ) { num_nodes 146 ompi/patterns/net/netpatterns_knomial_tree.c for( i = (peer+1); i < (peer + (num_nodes - stray)+1); i++) { num_nodes 155 ompi/patterns/net/netpatterns_knomial_tree.c for( i = (stray+1); i < num_nodes; i++) { num_nodes 167 ompi/patterns/net/netpatterns_knomial_tree.c for( i = 0; i < num_nodes; i++){ num_nodes 174 ompi/patterns/net/netpatterns_knomial_tree.c for( i = 0; i < num_nodes; i++ ){ num_nodes 181 ompi/patterns/net/netpatterns_knomial_tree.c for( i = 0; i < num_nodes; i++){ num_nodes 193 ompi/patterns/net/netpatterns_knomial_tree.c prev_data = (int *) malloc( num_nodes*sizeof(int) ); num_nodes 198 ompi/patterns/net/netpatterns_knomial_tree.c current_data = (int *) malloc( num_nodes*sizeof(int) ); num_nodes 226 ompi/patterns/net/netpatterns_knomial_tree.c for(i = 0; i < num_nodes; i++){ num_nodes 234 ompi/patterns/net/netpatterns_knomial_tree.c for( myid = 0; myid < num_nodes; myid++) { num_nodes 236 ompi/patterns/net/netpatterns_knomial_tree.c for( j = 0; j < num_nodes; j++ ){ num_nodes 244 ompi/patterns/net/netpatterns_knomial_tree.c for( j = stray; j < num_nodes; j++) { num_nodes 263 ompi/patterns/net/netpatterns_knomial_tree.c for( myid = 0; myid < num_nodes; myid++){ num_nodes 266 ompi/patterns/net/netpatterns_knomial_tree.c for( j = 0; j < num_nodes; j++ ){ num_nodes 344 ompi/patterns/net/netpatterns_knomial_tree.c for( j = 0; j < num_nodes; j++){ num_nodes 370 ompi/patterns/net/netpatterns_knomial_tree.c for( i = stray; i < num_nodes; i++) { num_nodes 536 ompi/patterns/net/netpatterns_knomial_tree.c int num_nodes, int node_rank, int tree_order, num_nodes 546 ompi/patterns/net/netpatterns_knomial_tree.c num_nodes, node_rank, tree_order)); num_nodes 548 ompi/patterns/net/netpatterns_knomial_tree.c assert(num_nodes > 1); num_nodes 550 ompi/patterns/net/netpatterns_knomial_tree.c if (tree_order > num_nodes) { num_nodes 551 ompi/patterns/net/netpatterns_knomial_tree.c tree_order = num_nodes; num_nodes 560 ompi/patterns/net/netpatterns_knomial_tree.c while ( num_nodes > cnt ) { num_nodes 567 ompi/patterns/net/netpatterns_knomial_tree.c if ( cnt > num_nodes) { num_nodes 592 ompi/patterns/net/netpatterns_knomial_tree.c tmp < num_nodes && i < tree_order - 1; num_nodes 606 ompi/patterns/net/netpatterns_knomial_tree.c i < tree_order - 1 && tmp < num_nodes; ++i, ++tmp) { num_nodes 701 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, num_nodes 709 ompi/patterns/net/netpatterns_knomial_tree.c NETPATTERNS_VERBOSE(("Enter ompi_netpatterns_setup_recursive_doubling_n_tree_node(num_nodes=%d, node_rank=%d, tree_order=%d)", num_nodes, node_rank, tree_order)); num_nodes 711 ompi/patterns/net/netpatterns_knomial_tree.c assert(num_nodes > 1); num_nodes 712 ompi/patterns/net/netpatterns_knomial_tree.c while (tree_order > num_nodes) { num_nodes 724 ompi/patterns/net/netpatterns_knomial_tree.c while ( num_nodes > cnt ) { num_nodes 731 ompi/patterns/net/netpatterns_knomial_tree.c if ( cnt > num_nodes) { num_nodes 767 ompi/patterns/net/netpatterns_knomial_tree.c for (tmp = node_rank + cnt; tmp < num_nodes; tmp += cnt) { num_nodes 776 ompi/patterns/net/netpatterns_knomial_tree.c for (i = 0, tmp = node_rank + cnt; tmp < num_nodes; ++i, tmp += cnt) { num_nodes 856 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_tree_node(int num_nodes, int node_rank, num_nodes 859 ompi/patterns/net/netpatterns_knomial_tree.c return ompi_netpatterns_setup_recursive_doubling_n_tree_node(num_nodes, node_rank, 2, exchange_node); num_nodes 864 ompi/patterns/net/netpatterns_knomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank,int tree_order, num_nodes 875 ompi/patterns/net/netpatterns_knomial_tree.c result=num_nodes; num_nodes 879 ompi/patterns/net/netpatterns_knomial_tree.c while( num_nodes > cnt ) { num_nodes 886 ompi/patterns/net/netpatterns_knomial_tree.c if( cnt > num_nodes) { num_nodes 911 ompi/patterns/net/netpatterns_knomial_tree.c n_extra_nodes=num_nodes-cnt; num_nodes 114 ompi/patterns/net/netpatterns_knomial_tree.h OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_n_tree_node(int num_nodes, int node_rank, int tree_order, num_nodes 120 ompi/patterns/net/netpatterns_knomial_tree.h OMPI_DECLSPEC int ompi_netpatterns_setup_recursive_doubling_tree_node(int num_nodes, int node_rank, num_nodes 124 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, num_nodes 131 ompi/patterns/net/netpatterns_knomial_tree.h int num_nodes, int node_rank, int tree_order, int *hier_ranks, num_nodes 30 ompi/patterns/net/netpatterns_multinomial_tree.c OMPI_DECLSPEC int ompi_netpatterns_setup_multinomial_tree(int tree_order, int num_nodes, num_nodes 49 ompi/patterns/net/netpatterns_multinomial_tree.c result=num_nodes; num_nodes 71 ompi/patterns/net/netpatterns_multinomial_tree.c if( node_index == num_nodes) { num_nodes 115 ompi/patterns/net/netpatterns_multinomial_tree.c n_nodes_in_last_level=num_nodes- num_nodes 168 ompi/patterns/net/netpatterns_multinomial_tree.c for(i=0 ; i < num_nodes ; i++ ) { num_nodes 183 ompi/patterns/net/netpatterns_multinomial_tree.c for( i=0 ; i < num_nodes ; i++ ) { num_nodes 36 ompi/patterns/net/netpatterns_nary_tree.c int ompi_netpatterns_setup_narray_tree(int tree_order, int my_rank, int num_nodes, num_nodes 51 ompi/patterns/net/netpatterns_nary_tree.c my_node->tree_size=num_nodes; num_nodes 55 ompi/patterns/net/netpatterns_nary_tree.c result=num_nodes-1; num_nodes 95 ompi/patterns/net/netpatterns_nary_tree.c result=num_nodes; num_nodes 122 ompi/patterns/net/netpatterns_nary_tree.c if( end_index >= num_nodes ) { num_nodes 123 ompi/patterns/net/netpatterns_nary_tree.c end_index = num_nodes-1; num_nodes 126 ompi/patterns/net/netpatterns_nary_tree.c if( start_index <= (num_nodes-1) ) { num_nodes 176 ompi/patterns/net/netpatterns_nary_tree.c int tree_order, int my_rank, int num_nodes, num_nodes 192 ompi/patterns/net/netpatterns_nary_tree.c my_node->tree_size=num_nodes; num_nodes 196 ompi/patterns/net/netpatterns_nary_tree.c result=num_nodes-1; num_nodes 248 ompi/patterns/net/netpatterns_nary_tree.c result=num_nodes; num_nodes 260 ompi/patterns/net/netpatterns_nary_tree.c num_nodes = cnt / tree_order; num_nodes 280 ompi/patterns/net/netpatterns_nary_tree.c if( end_index >= num_nodes ) { num_nodes 281 ompi/patterns/net/netpatterns_nary_tree.c end_index = num_nodes-1; num_nodes 284 ompi/patterns/net/netpatterns_nary_tree.c if( start_index <= (num_nodes-1) ) { num_nodes 343 ompi/patterns/net/netpatterns_nary_tree.c static int fill_in_node_data(int tree_order, int num_nodes, int my_node, num_nodes 351 ompi/patterns/net/netpatterns_nary_tree.c num_ranks_per_child=num_nodes/tree_order; num_nodes 354 ompi/patterns/net/netpatterns_nary_tree.c n_extra=num_nodes-num_ranks_per_child*tree_order; num_nodes 356 ompi/patterns/net/netpatterns_nary_tree.c num_children=num_nodes; num_nodes 435 ompi/patterns/net/netpatterns_nary_tree.c int tree_order, int num_nodes, num_nodes 439 ompi/patterns/net/netpatterns_nary_tree.c int num_descendent_ranks=num_nodes-1; num_nodes 444 ompi/patterns/net/netpatterns_nary_tree.c num_nodes); num_nodes 336 opal/mca/hwloc/hwloc201/hwloc/include/private/netloc.h int netloc_topology_read_hwloc(netloc_topology_t *topology, int num_nodes, num_nodes 97 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c static int pretty_print_nodes(pmix_node_t **nodes, pmix_std_cntr_t num_nodes); num_nodes 396 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c pretty_print_nodes(hnpinfo->nodes, hnpinfo->num_nodes); num_nodes 406 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c static int pretty_print_nodes(pmix_node_t **nodes, pmix_std_cntr_t num_nodes) { num_nodes 425 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c for(i=0; i < num_nodes; i++) { num_nodes 457 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c for(i=0; i < num_nodes; i++) { num_nodes 744 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c &hnpinfo->num_nodes, &hnpinfo->nodes))) { num_nodes 747 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c pmix_output(0, "RECEIVED %d NODES", hnpinfo->num_nodes); num_nodes 818 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c (unsigned long)hnpinfo->hnp->pid, hnpinfo->num_nodes, hnpinfo->num_jobs-1); num_nodes 822 opal/mca/pmix/pmix4x/pmix/src/tools/pps/pps.c for (i=0; i < hnpinfo->num_nodes; i++) { num_nodes 265 orte/mca/ess/pmi/ess_pmi_module.c orte_process_info.num_nodes = u32; num_nodes 351 orte/mca/grpcomm/base/grpcomm_base_stubs.c if (NULL == jdata->map || 0 == jdata->map->num_nodes) { num_nodes 368 orte/mca/grpcomm/base/grpcomm_base_stubs.c dns = (orte_vpid_t*)malloc(jdata->map->num_nodes * sizeof(vpid)); num_nodes 370 orte/mca/grpcomm/base/grpcomm_base_stubs.c for (i=0; i < jdata->map->nodes->size && (int)nds < jdata->map->num_nodes; i++) { num_nodes 716 orte/mca/odls/base/odls_base_default_fns.c jdata->map->num_nodes++; num_nodes 1772 orte/mca/plm/base/plm_base_launch_support.c int num_nodes; num_nodes 1804 orte/mca/plm/base/plm_base_launch_support.c if (0 == map->num_nodes) { num_nodes 1815 orte/mca/plm/base/plm_base_launch_support.c ++(map->num_nodes); num_nodes 1915 orte/mca/plm/base/plm_base_launch_support.c map->num_nodes = 1; num_nodes 1929 orte/mca/plm/base/plm_base_launch_support.c if (0 == map->num_nodes) { num_nodes 1940 orte/mca/plm/base/plm_base_launch_support.c ++(map->num_nodes); num_nodes 2220 orte/mca/plm/base/plm_base_launch_support.c num_nodes = 1; num_nodes 2222 orte/mca/plm/base/plm_base_launch_support.c num_nodes = 0; num_nodes 2226 orte/mca/plm/base/plm_base_launch_support.c if (0 < orte_max_vm_size && num_nodes == orte_max_vm_size) { num_nodes 2234 orte/mca/plm/base/plm_base_launch_support.c num_nodes++; num_nodes 2244 orte/mca/plm/base/plm_base_launch_support.c ++(map->num_nodes); num_nodes 2245 orte/mca/plm/base/plm_base_launch_support.c num_nodes++; num_nodes 158 orte/mca/plm/lsf/plm_lsf_module.c size_t num_nodes; num_nodes 215 orte/mca/plm/lsf/plm_lsf_module.c num_nodes = map->num_new_daemons; num_nodes 216 orte/mca/plm/lsf/plm_lsf_module.c if (0 == num_nodes) { num_nodes 46 orte/mca/ras/base/ras_base_node.c orte_std_cntr_t num_nodes; num_nodes 57 orte/mca/ras/base/ras_base_node.c num_nodes = (orte_std_cntr_t)opal_list_get_size(nodes); num_nodes 58 orte/mca/ras/base/ras_base_node.c if (0 == num_nodes) { num_nodes 65 orte/mca/ras/base/ras_base_node.c (long)num_nodes)); num_nodes 76 orte/mca/ras/base/ras_base_node.c if (ORTE_SUCCESS != (rc = opal_pointer_array_set_size(orte_node_pool, num_nodes * orte_ras_base.multiplier))) { num_nodes 69 orte/mca/ras/lsf/ras_lsf_module.c int i, num_nodes; num_nodes 75 orte/mca/ras/lsf/ras_lsf_module.c if ((num_nodes = lsb_getalloc(&nodelist)) < 0) { num_nodes 83 orte/mca/ras/lsf/ras_lsf_module.c for (i = 0; i < num_nodes; i++) { num_nodes 22 orte/mca/ras/simulator/ras_sim.h char *num_nodes; num_nodes 84 orte/mca/ras/simulator/ras_sim_component.c mca_ras_simulator_component.num_nodes = NULL; num_nodes 90 orte/mca/ras/simulator/ras_sim_component.c &mca_ras_simulator_component.num_nodes); num_nodes 125 orte/mca/ras/simulator/ras_sim_component.c if (NULL != mca_ras_simulator_component.num_nodes) { num_nodes 52 orte/mca/ras/simulator/ras_sim_module.c int i, n, val, dig, num_nodes; num_nodes 68 orte/mca/ras/simulator/ras_sim_module.c node_cnt = opal_argv_split(mca_ras_simulator_component.num_nodes, ','); num_nodes 108 orte/mca/ras/simulator/ras_sim_module.c num_nodes = strtol(node_cnt[n], NULL, 10); num_nodes 111 orte/mca/ras/simulator/ras_sim_module.c val = num_nodes; num_nodes 250 orte/mca/ras/simulator/ras_sim_module.c for (i=0; i < num_nodes; i++) { num_nodes 405 orte/mca/ras/slurm/ras_slurm_module.c int i, j, len, ret, count, reps, num_nodes; num_nodes 508 orte/mca/ras/slurm/ras_slurm_module.c num_nodes = opal_argv_count(names); num_nodes 512 orte/mca/ras/slurm/ras_slurm_module.c slots = malloc(sizeof(int) * num_nodes); num_nodes 517 orte/mca/ras/slurm/ras_slurm_module.c memset(slots, 0, sizeof(int) * num_nodes); num_nodes 550 orte/mca/ras/slurm/ras_slurm_module.c for (i = 0; i < reps && j < num_nodes; i++) { num_nodes 556 orte/mca/ras/slurm/ras_slurm_module.c } else if (*endptr == '\0' || j >= num_nodes) { num_nodes 392 orte/mca/rmaps/base/rmaps_base_map_job.c if (!did_map || 0 == jdata->num_procs || 0 == jdata->map->num_nodes) { num_nodes 395 orte/mca/rmaps/base/rmaps_base_map_job.c jdata->num_procs, jdata->map->num_nodes); num_nodes 347 orte/mca/rmaps/base/rmaps_base_ranking.c for (m=0, nn=0; nn < jdata->map->num_nodes && m < jdata->map->nodes->size; m++) { num_nodes 73 orte/mca/rmaps/mindist/rmaps_mindist_module.c orte_std_cntr_t num_nodes, num_slots; num_nodes 187 orte/mca/rmaps/mindist/rmaps_mindist_module.c num_nodes = (orte_std_cntr_t)opal_list_get_size(&node_list); num_nodes 200 orte/mca/rmaps/mindist/rmaps_mindist_module.c if (!num_nodes) { num_nodes 209 orte/mca/rmaps/mindist/rmaps_mindist_module.c navg = ((int)app->num_procs - nprocs_mapped) / num_nodes; num_nodes 210 orte/mca/rmaps/mindist/rmaps_mindist_module.c nextra = app->num_procs - navg * num_nodes; num_nodes 216 orte/mca/rmaps/mindist/rmaps_mindist_module.c balance = (float)(((int)app->num_procs - nprocs_mapped) - (navg * num_nodes)) / (float)num_nodes; num_nodes 222 orte/mca/rmaps/mindist/rmaps_mindist_module.c nxtra_nodes = ((int)app->num_procs - nprocs_mapped) - ((navg + extra_procs_to_assign) * num_nodes); num_nodes 232 orte/mca/rmaps/mindist/rmaps_mindist_module.c num_nodes = 0; num_nodes 256 orte/mca/rmaps/mindist/rmaps_mindist_module.c num_nodes++; num_nodes 385 orte/mca/rmaps/mindist/rmaps_mindist_module.c jdata->map->num_nodes++; num_nodes 414 orte/mca/rmaps/mindist/rmaps_mindist_module.c } while(bynode && nprocs_mapped < app->num_procs && 0 < num_nodes); num_nodes 281 orte/mca/rmaps/ppr/rmaps_ppr.c jdata->map->num_nodes++; num_nodes 293 orte/mca/rmaps/rank_file/rmaps_rank_file.c ++(jdata->map->num_nodes); num_nodes 73 orte/mca/rmaps/rmaps_types.h orte_std_cntr_t num_nodes; num_nodes 113 orte/mca/rmaps/round_robin/rmaps_rr_mappers.c ++(jdata->map->num_nodes); num_nodes 165 orte/mca/rmaps/round_robin/rmaps_rr_mappers.c ++(jdata->map->num_nodes); num_nodes 313 orte/mca/rmaps/round_robin/rmaps_rr_mappers.c ++(jdata->map->num_nodes); num_nodes 581 orte/mca/rmaps/round_robin/rmaps_rr_mappers.c ++(jdata->map->num_nodes); num_nodes 729 orte/mca/rmaps/round_robin/rmaps_rr_mappers.c ++(jdata->map->num_nodes); num_nodes 102 orte/mca/rmaps/seq/rmaps_seq.c orte_std_cntr_t num_nodes; num_nodes 348 orte/mca/rmaps/seq/rmaps_seq.c if (NULL == seq_list || 0 == (num_nodes = (orte_std_cntr_t)opal_list_get_size(seq_list))) { num_nodes 357 orte/mca/rmaps/seq/rmaps_seq.c app->num_procs = num_nodes; num_nodes 361 orte/mca/rmaps/seq/rmaps_seq.c } else if (num_nodes < app->num_procs) { num_nodes 363 orte/mca/rmaps/seq/rmaps_seq.c app->num_procs, num_nodes); num_nodes 398 orte/mca/rmaps/seq/rmaps_seq.c jdata->map->num_nodes++; num_nodes 934 orte/mca/schizo/ompi/schizo_ompi.c opal_asprintf(¶m, "%ld", (long)(jdata->map->num_nodes)); num_nodes 874 orte/orted/orted_comm.c int32_t i, num_nodes; num_nodes 887 orte/orted/orted_comm.c num_nodes = 0; num_nodes 897 orte/orted/orted_comm.c num_nodes = 1; num_nodes 901 orte/orted/orted_comm.c if (ORTE_SUCCESS != (ret = opal_dss.pack(answer, &num_nodes, 1, OPAL_INT32))) { num_nodes 915 orte/orted/orted_comm.c num_nodes++; num_nodes 919 orte/orted/orted_comm.c if (ORTE_SUCCESS != (ret = opal_dss.pack(answer, &num_nodes, 1, OPAL_INT32))) { num_nodes 586 orte/orted/orted_main.c jdata->map->num_nodes++; num_nodes 998 orte/orted/pmix/pmix_server_gen.c jdata->map->num_nodes++; num_nodes 225 orte/orted/pmix/pmix_server_register_fns.c kv->data.uint32 = map->num_nodes; num_nodes 481 orte/orted/pmix/pmix_server_register_fns.c if (map->num_nodes < orte_hostname_cutoff) { num_nodes 221 orte/runtime/data_type_support/orte_dt_copy_fns.c (*dest)->num_nodes = src->num_nodes; num_nodes 644 orte/runtime/data_type_support/orte_dt_packing_fns.c if (ORTE_SUCCESS != (rc = opal_dss_pack_buffer(buffer, &(maps[i]->num_nodes), 1, OPAL_UINT32))) { num_nodes 687 orte/runtime/data_type_support/orte_dt_print_fns.c tmp, pfx, (long)src->num_new_daemons, pfx, (long)src->num_nodes); num_nodes 691 orte/runtime/data_type_support/orte_dt_print_fns.c pfx, (long)src->num_nodes); num_nodes 723 orte/runtime/data_type_support/orte_dt_unpacking_fns.c &(maps[i]->num_nodes), &n, OPAL_UINT32))) { num_nodes 837 orte/runtime/orte_globals.c map->num_nodes = 0; num_nodes 365 orte/util/comm/comm.c int *num_nodes, orte_node_t ***node_info_array) num_nodes 375 orte/util/comm/comm.c *num_nodes = 0; num_nodes 468 orte/util/comm/comm.c *num_nodes = cnt_nodes; num_nodes 52 orte/util/comm/comm.h int *num_nodes, orte_node_t ***node_info_array); num_nodes 67 orte/util/proc_info.c .num_nodes = 1, num_nodes 227 orte/util/proc_info.c orte_process_info.num_nodes = 1; num_nodes 234 orte/util/proc_info.c &orte_process_info.num_nodes); num_nodes 97 orte/util/proc_info.h int num_nodes; /**< number of nodes in the job */