ck-ldb/tm_tree.h File Reference

Go to the source code of this file.

Data Structures
struct	_tree_t
struct	tm_topology_t
struct	_group_list_t
struct	adjacency_t
Typedefs
typedef struct _tree_t	tree_t
typedef struct _group_list_t	group_list_t
Functions
tree_t *	build_tree (double **tab, int N)
tree_t *	build_tree_from_topology (tm_topology_t *topology, double **tab, int N, double *obj_weight, double *comm_speed)
void	map_tree (tree_t *, tree_t *)
void	display_tab (double **tab, int N)
double	speed (int depth)
void	set_node (tree_t *node, tree_t **child, int arity, tree_t *parent, int id, double val, tree_t *deb_tab_child)
void	free_tree (tree_t *tree)
void	free_tab_double (double **tab, int N)
void	free_tab_int (int **tab, int N)
void	update_val (double **tab, tree_t *parent, int N)

---

Typedef Documentation

typedef struct _tree_t tree_t

typedef struct _group_list_t group_list_t

---

Function Documentation

tree_t* build_tree	(	double **	tab,
		int	N
	)

tree_t* build_tree_from_topology	(	tm_topology_t *	topology,
		double **	tab,
		int	N,
		double *	obj_weight,
		double *	comm_speed
	)

Definition at line 1213 of file tm_tree.C.

References tm_topology_t::arity, build_level_topology(), malloc(), tm_topology_t::nb_levels, and set_node().

Referenced by TreeMatchMapping(), and TreeMatchLB::work().

Here is the call graph for this function:

Here is the caller graph for this function:

void map_tree	(	tree_t *	,
		tree_t *
	)

Definition at line 416 of file tm_mapping.C.

void display_tab	(	double **	tab,
		int	N
	)

Definition at line 164 of file tm_tree.C.

double speed

(

int

depth

)

Definition at line 1200 of file tm_tree.C.

Referenced by arg_init(), build_level_topology(), build_synthetic_topology_old(), and GreedyRefineLB::fillData().

Here is the caller graph for this function:

void set_node	(	tree_t *	node,
		tree_t **	child,
		int	arity,
		tree_t *	parent,
		int	id,
		double	val,
		tree_t *	deb_tab_child
	)

Definition at line 62 of file tm_tree.C.

References _tree_t::arity, _tree_t::child, _tree_t::dumb, _tree_t::id, _tree_t::parent, _tree_t::tab_child, _tree_t::uniq, and _tree_t::val.

Referenced by build_level_topology(), build_synthetic_topology_old(), build_tree_from_topology(), and create_dumb_tree().

Here is the caller graph for this function:

void free_tree

(

tree_t *

tree

)

Definition at line 45 of file tm_tree.C.

References free(), free_list_child(), and free_tab_child().

Referenced by parse_dup_op(), and TreeMatchMapping().

Here is the call graph for this function:

Here is the caller graph for this function:

void free_tab_double	(	double **	tab,
		int	N
	)

Definition at line 148 of file tm_tree.C.

References free().

Referenced by build_level_topology(), and group_nodes().

Here is the call graph for this function:

Here is the caller graph for this function:

void free_tab_int	(	int **	tab,
		int	N
	)

Definition at line 156 of file tm_tree.C.

References free().

Here is the call graph for this function:

void update_val	(	double **	tab,
		tree_t *	parent,
		int	N
	)

Definition at line 267 of file tm_tree.C.

References _tree_t::arity, _tree_t::child, eval_grouping(), and _tree_t::val.

Referenced by bucket_grouping(), fast_grouping(), group_nodes(), and super_fast_grouping().

Here is the call graph for this function:

Here is the caller graph for this function: