tab_child         727 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tm_tree_t **tab_child = NULL;
tab_child         767 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_child = (tm_tree_t **) CALLOC (k,sizeof(tm_tree_t*));
tab_child         769 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     tab_child[i] = (tm_tree_t *) MALLOC(sizeof(tm_tree_t));
tab_child         774 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     tab_child[i]->id = i;
tab_child         775 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     kpartition_build_level_topology ( tab_child[i], tab_com_mat[i], N/k, depth + 1,
tab_child         779 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     tab_child[i]->parent = cur_node;
tab_child         783 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   set_node( cur_node, tab_child, k, NULL, cur_node->id, 0, NULL, depth);
tab_child         135 ompi/mca/topo/treematch/treematch/tm_tree.c     free_tab_child(tree->tab_child);
tab_child         136 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(tree->tab_child);
tab_child         178 ompi/mca/topo/treematch/treematch/tm_tree.c 	      int id, double val, tm_tree_t *tab_child, int depth)
tab_child         183 ompi/mca/topo/treematch/treematch/tm_tree.c   node->tab_child = tab_child;
tab_child         204 ompi/mca/topo/treematch/treematch/tm_tree.c   new->tab_child = old->tab_child;
tab_child        2059 ompi/mca/topo/treematch/treematch/tm_tree.c     set_deb_tab_child(tree->tab_child, child, depth-1);
tab_child        2061 ompi/mca/topo/treematch/treematch/tm_tree.c     tree->tab_child=child;
tab_child           9 ompi/mca/topo/treematch/treematch/tm_tree.h 	      int id,double val,tm_tree_t *tab_child,int depth);
tab_child          43 ompi/mca/topo/treematch/treematch/treematch.h   struct _tm_tree_t *tab_child; /* The pointer to be freed */