nb_processes 56 ompi/mca/topo/treematch/treematch/tm_mapping.c int *sigma, int nb_processes, int **k, int nb_compute_units); nb_processes 458 ompi/mca/topo/treematch/treematch/tm_mapping.c int *sigma, int nb_processes, int **k, int nb_compute_units) nb_processes 497 ompi/mca/topo/treematch/treematch/tm_mapping.c if( proc_list[i] < nb_processes ){ nb_processes 509 ompi/mca/topo/treematch/treematch/tm_mapping.c if( proc_list[i] < nb_processes ) nb_processes 535 ompi/mca/topo/treematch/treematch/tm_mapping.c size_t sigma_length = comm_tree->nb_processes; nb_processes 16 ompi/mca/topo/treematch/treematch/tm_mapping.h int *sigma, int nb_processes, int **k, int nb_compute_units); nb_processes 2277 ompi/mca/topo/treematch/treematch/tm_tree.c int npu, nb_processes, oversub_fact, nb_slots; nb_processes 2284 ompi/mca/topo/treematch/treematch/tm_tree.c nb_processes = aff_mat->order; nb_processes 2289 ompi/mca/topo/treematch/treematch/tm_tree.c printf("Com matrix size : %d\n", nb_processes); nb_processes 2298 ompi/mca/topo/treematch/treematch/tm_tree.c if(nb_processes > nb_constraints){ nb_processes 2301 ompi/mca/topo/treematch/treematch/tm_tree.c nb_constraints, nb_processes); nb_processes 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_processes 2322 ompi/mca/topo/treematch/treematch/tm_tree.c result->nb_processes = aff_mat->order; nb_processes 2332 ompi/mca/topo/treematch/treematch/tm_tree.c result->nb_processes = aff_mat->order; nb_processes 51 ompi/mca/topo/treematch/treematch/treematch.h int nb_processes; /* number of grouped processes (i.e. the order of the affinity matrix). Set at the root only */