nb_real_nodes     215 ompi/mca/topo/treematch/treematch/k-partitioning.c       int nb_real_nodes = n-nb_constraints; /*this is the number of "real" nodes by opposition to the dumb ones*/
nb_real_nodes     219 ompi/mca/topo/treematch/treematch/k-partitioning.c 	  res[nb_real_nodes+i] = i_part; /*and we set it in partition vector*/
nb_real_nodes     313 ompi/mca/topo/treematch/treematch/k-partitioning.c       int nb_real_nodes = n-nb_constraints;
nb_real_nodes     318 ompi/mca/topo/treematch/treematch/k-partitioning.c 	  part[nb_real_nodes+i] = i_part;
nb_real_nodes     323 ompi/mca/topo/treematch/treematch/k-partitioning.c       for(i=0; i<nb_real_nodes; i++) /*for each node*/