k_length          663 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 k = (int *)calloc(sol->k_length, sizeof(int));
k_length          664 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 for(idx = 0 ; idx < (int)sol->k_length ; idx++)
k_length          872 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             assert((int)sol->k_length == num_objs_in_node);
k_length          874 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             k = (int *)calloc(sol->k_length, sizeof(int));
k_length          875 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             for(idx = 0 ; idx < (int)sol->k_length ; idx++)
k_length          536 ompi/mca/topo/treematch/treematch/tm_mapping.c   size_t k_length      = nb_processing_units(topology);
k_length          540 ompi/mca/topo/treematch/treematch/tm_mapping.c   k        =  (int**) MALLOC(sizeof(int*) * k_length);
k_length          541 ompi/mca/topo/treematch/treematch/tm_mapping.c   for (i=0 ; i < k_length ; i++){
k_length          545 ompi/mca/topo/treematch/treematch/tm_mapping.c   map_topology(topology, comm_tree, topology->nb_levels-1, sigma, sigma_length ,k, k_length);
k_length          550 ompi/mca/topo/treematch/treematch/tm_mapping.c   solution->k_length      = k_length;
k_length           37 ompi/mca/topo/treematch/treematch/tm_solution.c   n = sol->k_length;
k_length          101 ompi/mca/topo/treematch/treematch/treematch.h   size_t k_length;