tm_tree_t         543 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c                 tm_tree_t *comm_tree = NULL;
tm_tree_t         764 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c             tm_tree_t *comm_tree = NULL;
tm_tree_t          50 ompi/mca/topo/treematch/treematch/tm_bucket.c int add_edge_3(tm_tree_t *,tm_tree_t *,int,int,int *);
tm_tree_t          55 ompi/mca/topo/treematch/treematch/tm_bucket.c double bucket_grouping(tm_affinity_mat_t *,tm_tree_t *, tm_tree_t *, int ,int);
tm_tree_t         418 ompi/mca/topo/treematch/treematch/tm_bucket.c int add_edge_3(tm_tree_t *tab_node, tm_tree_t *parent,int i,int j,int *nb_groups)
tm_tree_t         467 ompi/mca/topo/treematch/treematch/tm_bucket.c int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups)
tm_tree_t         522 ompi/mca/topo/treematch/treematch/tm_bucket.c   tm_tree_t *new_tab_node = (tm_tree_t*)args[3];
tm_tree_t         538 ompi/mca/topo/treematch/treematch/tm_bucket.c double bucket_grouping(tm_affinity_mat_t *aff_mat,tm_tree_t *tab_node, tm_tree_t *new_tab_node,
tm_tree_t          31 ompi/mca/topo/treematch/treematch/tm_bucket.h double bucket_grouping(tm_affinity_mat_t *aff_mat,tm_tree_t *tab_node, tm_tree_t *new_tab_node, 
tm_tree_t          33 ompi/mca/topo/treematch/treematch/tm_bucket.h int try_add_edge(tm_tree_t *tab_node, tm_tree_t *parent,int arity,int i,int j,int *nb_groups);
tm_tree_t          38 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void kpartition_build_level_topology(tm_tree_t *,com_mat_t *,int,int,tm_topology_t *,
tm_tree_t         720 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void kpartition_build_level_topology(tm_tree_t *cur_node, com_mat_t *com_mat, int N, int depth,
tm_tree_t         727 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tm_tree_t **tab_child = NULL;
tm_tree_t         767 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tab_child = (tm_tree_t **) CALLOC (k,sizeof(tm_tree_t*));
tm_tree_t         769 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     tab_child[i] = (tm_tree_t *) MALLOC(sizeof(tm_tree_t));
tm_tree_t         793 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tm_tree_t *kpartition_build_tree_from_topology(tm_topology_t *topology,double **comm,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed)
tm_tree_t         796 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   tm_tree_t *root = NULL;
tm_tree_t         857 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   root = (tm_tree_t*) MALLOC (sizeof(tm_tree_t));
tm_tree_t           9 ompi/mca/topo/treematch/treematch/tm_kpartitioning.h tm_tree_t * kpartition_build_tree_from_topology(tm_topology_t *topology,double **com_mat,int N, int *constraints, int nb_constraints, double *obj_weight, double *com_speed);
tm_tree_t          52 ompi/mca/topo/treematch/treematch/tm_mapping.c void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i);
tm_tree_t          55 ompi/mca/topo/treematch/treematch/tm_mapping.c void map_topology(tm_topology_t *topology,tm_tree_t *comm_tree, int level,
tm_tree_t          57 ompi/mca/topo/treematch/treematch/tm_mapping.c int nb_leaves(tm_tree_t *comm_tree);
tm_tree_t          60 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_solution_t * tm_compute_mapping(tm_topology_t *topology,tm_tree_t *comm_tree);
tm_tree_t         401 ompi/mca/topo/treematch/treematch/tm_mapping.c void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i)
tm_tree_t         413 ompi/mca/topo/treematch/treematch/tm_mapping.c int nb_leaves(tm_tree_t *comm_tree)
tm_tree_t         457 ompi/mca/topo/treematch/treematch/tm_mapping.c void map_topology(tm_topology_t *topology,tm_tree_t *comm_tree, int level,
tm_tree_t         530 ompi/mca/topo/treematch/treematch/tm_mapping.c tm_solution_t * tm_compute_mapping(tm_topology_t *topology,tm_tree_t *comm_tree)
tm_tree_t          12 ompi/mca/topo/treematch/treematch/tm_mapping.h void depth_first(tm_tree_t *comm_tree, int *proc_list,int *i);
tm_tree_t          15 ompi/mca/topo/treematch/treematch/tm_mapping.h void map_topology(tm_topology_t *topology,tm_tree_t *comm_tree, int level,
tm_tree_t          17 ompi/mca/topo/treematch/treematch/tm_mapping.h int nb_leaves(tm_tree_t *comm_tree);
tm_tree_t          21 ompi/mca/topo/treematch/treematch/tm_mapping.h tm_solution_t * tm_compute_mapping(tm_topology_t *topology,tm_tree_t *comm_tree);
tm_tree_t          35 ompi/mca/topo/treematch/treematch/tm_tree.c void free_list_child(tm_tree_t *);void free_tab_child(tm_tree_t *);
tm_tree_t          36 ompi/mca/topo/treematch/treematch/tm_tree.c double choose (long, long);void display_node(tm_tree_t *);
tm_tree_t          37 ompi/mca/topo/treematch/treematch/tm_tree.c void clone_tree(tm_tree_t *, tm_tree_t *);
tm_tree_t          38 ompi/mca/topo/treematch/treematch/tm_tree.c double *aggregate_obj_weight(tm_tree_t *, double *, int);
tm_tree_t          39 ompi/mca/topo/treematch/treematch/tm_tree.c tm_affinity_mat_t *aggregate_com_mat(tm_tree_t *, tm_affinity_mat_t *, int);
tm_tree_t          40 ompi/mca/topo/treematch/treematch/tm_tree.c double eval_grouping(tm_affinity_mat_t *, tm_tree_t **, int);
tm_tree_t          41 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **, double, group_list_t *);
tm_tree_t          42 ompi/mca/topo/treematch/treematch/tm_tree.c void add_to_list(group_list_t *, tm_tree_t **, int, double);
tm_tree_t          43 ompi/mca/topo/treematch/treematch/tm_tree.c void  list_all_possible_groups(tm_affinity_mat_t *, tm_tree_t *, int, int, int, tm_tree_t **, group_list_t *);
tm_tree_t          46 ompi/mca/topo/treematch/treematch/tm_tree.c void display_grouping (tm_tree_t *, int, int, double);
tm_tree_t          62 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_tab(tm_tree_t **, tm_tree_t **, int);
tm_tree_t          64 ompi/mca/topo/treematch/treematch/tm_tree.c void  group(tm_affinity_mat_t *, tm_tree_t *, tm_tree_t *, int, int, int, double *, tm_tree_t **);
tm_tree_t          65 ompi/mca/topo/treematch/treematch/tm_tree.c void  fast_group(tm_affinity_mat_t *, tm_tree_t *, tm_tree_t *, int, int, int, double *, tm_tree_t **, int *, int);
tm_tree_t          68 ompi/mca/topo/treematch/treematch/tm_tree.c 		 void super_fast_grouping(tm_affinity_mat_t *, tm_tree_t *, tm_tree_t *, int, int);
tm_tree_t          70 ompi/mca/topo/treematch/treematch/tm_tree.c void group_nodes(tm_affinity_mat_t *, tm_tree_t *, tm_tree_t *, int , int, double*, double);
tm_tree_t          71 ompi/mca/topo/treematch/treematch/tm_tree.c double fast_grouping(tm_affinity_mat_t *, tm_tree_t *, tm_tree_t *, int, int, double);
tm_tree_t          74 ompi/mca/topo/treematch/treematch/tm_tree.c void create_dumb_tree(tm_tree_t *, int, tm_topology_t *);
tm_tree_t          75 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_tab_node(tm_tree_t **, int, int, int, tm_topology_t *);
tm_tree_t          76 ompi/mca/topo/treematch/treematch/tm_tree.c void set_deb_tab_child(tm_tree_t *, tm_tree_t *, int);
tm_tree_t          77 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *build_level_topology(tm_tree_t *, tm_affinity_mat_t *, int, int, tm_topology_t *, double *, double *);
tm_tree_t          79 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *bottom_up_build_tree_from_topology(tm_topology_t *, tm_affinity_mat_t *, double *, double *);
tm_tree_t          80 ompi/mca/topo/treematch/treematch/tm_tree.c void free_non_constraint_tree(tm_tree_t *);
tm_tree_t          81 ompi/mca/topo/treematch/treematch/tm_tree.c void free_constraint_tree(tm_tree_t *);
tm_tree_t         118 ompi/mca/topo/treematch/treematch/tm_tree.c void free_list_child(tm_tree_t *tree)
tm_tree_t         131 ompi/mca/topo/treematch/treematch/tm_tree.c void free_tab_child(tm_tree_t *tree)
tm_tree_t         140 ompi/mca/topo/treematch/treematch/tm_tree.c void free_non_constraint_tree(tm_tree_t *tree)
tm_tree_t         154 ompi/mca/topo/treematch/treematch/tm_tree.c void free_constraint_tree(tm_tree_t *tree)
tm_tree_t         168 ompi/mca/topo/treematch/treematch/tm_tree.c void tm_free_tree(tm_tree_t *tree)
tm_tree_t         177 ompi/mca/topo/treematch/treematch/tm_tree.c void set_node(tm_tree_t *node, tm_tree_t ** child, int arity, tm_tree_t *parent,
tm_tree_t         178 ompi/mca/topo/treematch/treematch/tm_tree.c 	      int id, double val, tm_tree_t *tab_child, int depth)
tm_tree_t         192 ompi/mca/topo/treematch/treematch/tm_tree.c void display_node(tm_tree_t *node)
tm_tree_t         199 ompi/mca/topo/treematch/treematch/tm_tree.c void clone_tree(tm_tree_t *new, tm_tree_t *old)
tm_tree_t         216 ompi/mca/topo/treematch/treematch/tm_tree.c double *aggregate_obj_weight(tm_tree_t *new_tab_node, double *tab, int M)
tm_tree_t         242 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t *tab_node = (tm_tree_t*)args[3];
tm_tree_t         280 ompi/mca/topo/treematch/treematch/tm_tree.c static tm_affinity_mat_t *aggregate_aff_mat(tm_tree_t *tab_node, tm_affinity_mat_t *aff_mat, int M)
tm_tree_t         406 ompi/mca/topo/treematch/treematch/tm_tree.c double eval_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t **cur_group, int arity)
tm_tree_t         433 ompi/mca/topo/treematch/treematch/tm_tree.c group_list_t *new_group_list(tm_tree_t **tab, double val, group_list_t *next)
tm_tree_t         446 ompi/mca/topo/treematch/treematch/tm_tree.c void add_to_list(group_list_t *list, tm_tree_t **cur_group, int arity, double val)
tm_tree_t         449 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t **tab = NULL;
tm_tree_t         452 ompi/mca/topo/treematch/treematch/tm_tree.c   tab=(tm_tree_t **)MALLOC(sizeof(tm_tree_t *)*arity);
tm_tree_t         469 ompi/mca/topo/treematch/treematch/tm_tree.c void  list_all_possible_groups(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, int id, int arity, int depth,
tm_tree_t         470 ompi/mca/topo/treematch/treematch/tm_tree.c 			       tm_tree_t **cur_group, group_list_t *list)
tm_tree_t         493 ompi/mca/topo/treematch/treematch/tm_tree.c void update_val(tm_affinity_mat_t *aff_mat, tm_tree_t *parent)
tm_tree_t         547 ompi/mca/topo/treematch/treematch/tm_tree.c void display_grouping (tm_tree_t *father, int M, int arity, double val)
tm_tree_t        1460 ompi/mca/topo/treematch/treematch/tm_tree.c int independent_tab(tm_tree_t **tab1, tm_tree_t **tab2, int arity)
tm_tree_t        1504 ompi/mca/topo/treematch/treematch/tm_tree.c void  fast_group(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *parent, int id, int arity, int n,
tm_tree_t        1505 ompi/mca/topo/treematch/treematch/tm_tree.c 		 double *best_val, tm_tree_t **cur_group, int *nb_groups, int max_groups)
tm_tree_t        1556 ompi/mca/topo/treematch/treematch/tm_tree.c double fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size, double nb_groups)
tm_tree_t        1558 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t **cur_group = NULL;
tm_tree_t        1562 ompi/mca/topo/treematch/treematch/tm_tree.c   cur_group = (tm_tree_t**)MALLOC(sizeof(tm_tree_t*)*arity);
tm_tree_t        1586 ompi/mca/topo/treematch/treematch/tm_tree.c static double k_partition_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size) {
tm_tree_t        1647 ompi/mca/topo/treematch/treematch/tm_tree.c void super_fast_grouping(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node, int arity, int solution_size)
tm_tree_t        1762 ompi/mca/topo/treematch/treematch/tm_tree.c void group_nodes(tm_affinity_mat_t *aff_mat, tm_tree_t *tab_node, tm_tree_t *new_tab_node,
tm_tree_t        1770 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t **cur_group = NULL;
tm_tree_t        1828 ompi/mca/topo/treematch/treematch/tm_tree.c     cur_group = (tm_tree_t**)MALLOC(sizeof(tm_tree_t*)*arity);
tm_tree_t        2005 ompi/mca/topo/treematch/treematch/tm_tree.c void create_dumb_tree(tm_tree_t *node, int depth, tm_topology_t *topology)
tm_tree_t        2007 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t **list_child = NULL;
tm_tree_t        2017 ompi/mca/topo/treematch/treematch/tm_tree.c   list_child = (tm_tree_t**)CALLOC(arity, sizeof(tm_tree_t*));
tm_tree_t        2019 ompi/mca/topo/treematch/treematch/tm_tree.c     list_child[i] = (tm_tree_t*)MALLOC(sizeof(tm_tree_t));
tm_tree_t        2029 ompi/mca/topo/treematch/treematch/tm_tree.c void complete_tab_node(tm_tree_t **tab, int mat_order, int K, int depth, tm_topology_t *topology)
tm_tree_t        2031 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t *old_tab = NULL, *new_tab = NULL;
tm_tree_t        2040 ompi/mca/topo/treematch/treematch/tm_tree.c   new_tab = (tm_tree_t*)MALLOC(M*sizeof(tm_tree_t));
tm_tree_t        2055 ompi/mca/topo/treematch/treematch/tm_tree.c void set_deb_tab_child(tm_tree_t *tree, tm_tree_t *child, int depth)
tm_tree_t        2076 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *build_level_topology(tm_tree_t *tab_node, tm_affinity_mat_t *aff_mat, int arity, int depth, tm_topology_t *topology,
tm_tree_t        2083 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t *new_tab_node = NULL; /*array of node for this level (of size M): there will be linked to the nodes of tab_nodes*/
tm_tree_t        2085 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t *res = NULL; /*resulting tree*/
tm_tree_t        2129 ompi/mca/topo/treematch/treematch/tm_tree.c   new_tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*M);
tm_tree_t        2132 ompi/mca/topo/treematch/treematch/tm_tree.c     tm_tree_t **list_child = NULL;
tm_tree_t        2133 ompi/mca/topo/treematch/treematch/tm_tree.c     list_child = (tm_tree_t**)CALLOC(arity, sizeof(tm_tree_t*));
tm_tree_t        2197 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t *bottom_up_build_tree_from_topology(tm_topology_t *topology, tm_affinity_mat_t *aff_mat,
tm_tree_t        2200 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t *res = NULL, *tab_node = NULL;
tm_tree_t        2203 ompi/mca/topo/treematch/treematch/tm_tree.c   tab_node = (tm_tree_t*)MALLOC(sizeof(tm_tree_t)*mat_order);
tm_tree_t        2273 ompi/mca/topo/treematch/treematch/tm_tree.c tm_tree_t * tm_build_tree_from_topology(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, double *obj_weight, double *com_speed)
tm_tree_t        2276 ompi/mca/topo/treematch/treematch/tm_tree.c   tm_tree_t * result;
tm_tree_t           6 ompi/mca/topo/treematch/treematch/tm_tree.h void update_val(tm_affinity_mat_t *aff_mat,tm_tree_t *parent);
tm_tree_t           8 ompi/mca/topo/treematch/treematch/tm_tree.h void set_node(tm_tree_t *node,tm_tree_t ** child, int arity,tm_tree_t *parent,
tm_tree_t           9 ompi/mca/topo/treematch/treematch/tm_tree.h 	      int id,double val,tm_tree_t *tab_child,int depth);
tm_tree_t          14 ompi/mca/topo/treematch/treematch/tm_tree.h   tm_tree_t **tab;
tm_tree_t         166 ompi/mca/topo/treematch/treematch/treematch.h tm_tree_t *tm_build_tree_from_topology(tm_topology_t *topology, tm_affinity_mat_t *aff_mat, double *obj_weight, double *com_speed);
tm_tree_t         168 ompi/mca/topo/treematch/treematch/treematch.h tm_solution_t *tm_compute_mapping(tm_topology_t *topology, tm_tree_t *comm_tree);
tm_tree_t         175 ompi/mca/topo/treematch/treematch/treematch.h void tm_free_tree(tm_tree_t *comm_tree);