real_n             26 ompi/mca/topo/treematch/treematch/k-partitioning.c   int real_n = n-nb_constraints;
real_n             30 ompi/mca/topo/treematch/treematch/k-partitioning.c   memory_allocation(&Q, &Qinst, &D, real_n, k);
real_n             34 ompi/mca/topo/treematch/treematch/k-partitioning.c   initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus);
real_n             39 ompi/mca/topo/treematch/treematch/k-partitioning.c       algo(part, comm, &Qpart, Q, Qinst, D, real_n, &deficit, &surplus);
real_n             43 ompi/mca/topo/treematch/treematch/k-partitioning.c   balancing(real_n, deficit, surplus, D, part); /*if partition isn't balanced we have to make one last move*/
real_n             46 ompi/mca/topo/treematch/treematch/k-partitioning.c   destruction(&Qpart, Q, Qinst, D, real_n, k);