const_tab 498 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraint_t *const_tab = NULL; const_tab 503 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = (constraint_t *)CALLOC(k,sizeof(constraint_t)); const_tab 518 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c end = fill_tab(&(const_tab[i].constraints), constraints, nb_constraints,start, (i+1) * nb_leaves, i * nb_leaves); const_tab 519 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab[i].length = end-start; const_tab 523 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("\tSub constraint: "); print_1D_tab(const_tab[i].constraints, end-start); const_tab 530 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c FREE(const_tab); const_tab 533 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab[i].id = i; const_tab 537 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c return const_tab; const_tab 672 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_const_tab(constraint_t *const_tab, int k) const_tab 676 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if( !const_tab ) const_tab 680 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(const_tab[i].length) const_tab 681 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c FREE(const_tab[i].constraints); const_tab 684 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c FREE(const_tab); const_tab 730 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraint_t *const_tab = NULL; const_tab 764 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = split_constraints (constraints, nb_constraints, k, topology, depth, N); const_tab 777 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab[i].constraints, const_tab[i].length, const_tab 789 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c free_const_tab(const_tab,k);