1234567891011121314151617181920212223242526272829303132333435363738394041424344454647 |
- /*
- * This file is part of the StarPU Handbook.
- * Copyright (C) 2014 CNRS
- * See the file version.doxy for copying conditions.
- */
- /*! \defgroup API_Tree Tree
- \brief This section describes the tree facilities provided by StarPU.
- \struct starpu_tree
- \ingroup API_Tree
- \var struct starpu_tree **starpu_tree::nodes
- todo
- \var struct starpu_tree *starpu_tree::father
- todo
- \var int starpu_tree::arity
- todo
- \var int starpu_tree::id
- todo
- \var int starpu_tree::level
- todo
- \var int starpu_tree::is_pu
- todo
- \fn void starpu_tree_reset_visited(struct starpu_tree *tree, int *visited)
- \ingroup API_Tree
- todo
- \fn void starpu_tree_insert(struct starpu_tree *tree, int id, int level, int is_pu, int arity, struct starpu_tree *father)
- \ingroup API_Tree
- todo
- \fn struct starpu_tree *starpu_tree_get(struct starpu_tree *tree, int id)
- \ingroup API_Tree
- todo
- \fn struct starpu_tree *starpu_tree_get_neighbour(struct starpu_tree *tree, struct starpu_tree *node, int *visited, int *present)
- \ingroup API_Tree
- todo
- \fn void starpu_tree_free(struct starpu_tree *tree)
- \ingroup API_Tree
- todo
- */
|