num_procs_in_node   54 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                  int num_procs_in_node,
num_procs_in_node   63 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         if(num_objs_in_node < num_procs_in_node)
num_procs_in_node  140 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c     int numlevels = 0, num_nodes = 0, num_procs_in_node = 0;
num_procs_in_node  170 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             vpids[num_procs_in_node++] = i;
num_procs_in_node  182 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c     lindex_to_grank = (int *)malloc(num_procs_in_node * sizeof(int));
num_procs_in_node  183 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c     memcpy(lindex_to_grank, vpids, num_procs_in_node * sizeof(int));
num_procs_in_node  189 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                        "lindex_to_grank : ", "", lindex_to_grank, num_procs_in_node);
num_procs_in_node  257 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                  num_objs_in_node, num_procs_in_node,
num_procs_in_node  266 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                        num_pus_in_node, num_procs_in_node,
num_procs_in_node  279 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                        num_objs_in_node, num_procs_in_node,
num_procs_in_node  322 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c     reqs = (MPI_Request *)calloc(num_procs_in_node-1, sizeof(MPI_Request));
num_procs_in_node  354 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         localrank_to_objnum = (int *)calloc(num_procs_in_node, sizeof(int));
num_procs_in_node  357 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         for(i = 1;  i < num_procs_in_node; i++) {
num_procs_in_node  364 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         if (OMPI_SUCCESS != ( err = ompi_request_wait_all(num_procs_in_node-1,
num_procs_in_node  421 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 for( j = 0; j < num_procs_in_node ; j++ )
num_procs_in_node  720 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         lrank_to_grank = (int *)calloc(num_procs_in_node, sizeof(int));
num_procs_in_node  731 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c         for(i = 0 ; i < num_procs_in_node ; i++)
num_procs_in_node  738 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             local_pattern = (double *)calloc(num_procs_in_node * num_procs_in_node, sizeof(double));
num_procs_in_node  740 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             local_pattern = (double *)calloc(num_procs_in_node, sizeof(double));
num_procs_in_node  752 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                                   num_procs_in_node, MPI_DOUBLE,
num_procs_in_node  753 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                                                   local_pattern, num_procs_in_node, MPI_DOUBLE,
num_procs_in_node  770 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             comm_pattern = (double **)malloc(num_procs_in_node*sizeof(double *));
num_procs_in_node  771 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             for( i = 0; i < num_procs_in_node; i++ ) {
num_procs_in_node  772 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 comm_pattern[i] = local_pattern + i * num_procs_in_node;
num_procs_in_node  777 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             for( i = 0; i < num_procs_in_node ; i++ )
num_procs_in_node  778 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 for( j = i; j < num_procs_in_node ; j++ ) {
num_procs_in_node  786 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             for(i = 0 ; i < num_procs_in_node ; i++){
num_procs_in_node  789 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                   "", "", comm_pattern[i], num_procs_in_node);
num_procs_in_node  815 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 for( j = 0; j < num_procs_in_node ; j++ )
num_procs_in_node  857 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                                  tm_topology->nb_levels,num_procs_in_node));
num_procs_in_node  868 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             aff_mat = tm_build_affinity_mat(comm_pattern,num_procs_in_node);
num_procs_in_node  882 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                            "Rank permutation sigma/k : ", "", k, num_procs_in_node);
num_procs_in_node  883 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             assert(num_procs_in_node == (int)sol->sigma_length);