sum_dumb          160 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int          dumb_id, min_nb_dumb = n, sum_dumb = 0, p;
sum_dumb          189 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c       sum_dumb += nb_dumb[i];
sum_dumb          216 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     dumb_id = n - sum_dumb; /* now dumb_id is the number of free vertices*/