db_tree.c File Reference

#include "common.h"
#include <stdio.h>
#include <math.h>
#include <strings.h>
#include "machine.h"
#include "bu.h"
#include "vmath.h"
#include "bn.h"
#include "nmg.h"
#include "raytrace.h"
#include "./debug.h"

Include dependency graph for db_tree.c:

Go to the source code of this file.

Data Structures
struct	db_walk_parallel_state
Defines
#define	DB_WALK_PARALLEL_STATE_MAGIC   0x64777073
#define	DB_CK_WPS(_p)   BU_CKMAG(_p, DB_WALK_PARALLEL_STATE_MAGIC, "db_walk_parallel_state")
Functions
void	db_ck_tree (const union tree *tp)
void	db_dup_db_tree_state (struct db_tree_state *otsp, const struct db_tree_state *itsp)
void	db_free_db_tree_state (struct db_tree_state *tsp)
void	db_init_db_tree_state (struct db_tree_state *tsp, struct db_i *dbip, struct resource *resp)
combined_tree_state *	db_new_combined_tree_state (register const struct db_tree_state *tsp, register const struct db_full_path *pathp)
combined_tree_state *	db_dup_combined_tree_state (const struct combined_tree_state *old)
void	db_free_combined_tree_state (register struct combined_tree_state *ctsp)
void	db_pr_tree_state (register const struct db_tree_state *tsp)
void	db_pr_combined_tree_state (register const struct combined_tree_state *ctsp)
int	db_apply_state_from_comb (struct db_tree_state *tsp, const struct db_full_path *pathp, register const struct rt_comb_internal *comb)
int	db_apply_state_from_memb (struct db_tree_state *tsp, struct db_full_path *pathp, const union tree *tp)
int	db_apply_state_from_one_member (struct db_tree_state *tsp, struct db_full_path *pathp, const char *cp, int sofar, const union tree *tp)
tree *	db_find_named_leaf (union tree *tp, const char *cp)
tree *	db_find_named_leafs_parent (int *side, union tree *tp, const char *cp)
void	db_tree_del_lhs (union tree *tp, struct resource *resp)
void	db_tree_del_rhs (union tree *tp, struct resource *resp)
int	db_tree_del_dbleaf (union tree **tp, const char *cp, struct resource *resp)
void	db_tree_mul_dbleaf (union tree *tp, const mat_t mat)
void	db_tree_funcleaf (struct db_i *dbip, struct rt_comb_internal *comb, union tree *comb_tree, void(*leaf_func)(), genptr_t user_ptr1, genptr_t user_ptr2, genptr_t user_ptr3)
int	db_follow_path (struct db_tree_state *tsp, struct db_full_path *total_path, const struct db_full_path *new_path, int noisy, int depth)
int	db_follow_path_for_state (struct db_tree_state *tsp, struct db_full_path *total_path, const char *orig_str, int noisy)
HIDDEN int	db_detect_cycle (struct db_full_path *pathp, union tree *tp)
HIDDEN void	db_recurse_subtree (union tree *tp, struct db_tree_state *msp, struct db_full_path *pathp, struct combined_tree_state **region_start_statepp, genptr_t client_data)
tree *	db_recurse (struct db_tree_state *tsp, struct db_full_path *pathp, struct combined_tree_state **region_start_statepp, genptr_t client_data)
tree *	db_dup_subtree (const union tree *tp, struct resource *resp)
void	db_free_tree (register union tree *tp, struct resource *resp)
void	db_left_hvy_node (union tree *tp)
void	db_non_union_push (register union tree *tp, struct resource *resp)
int	db_count_tree_nodes (const union tree *tp, int count)
int	db_is_tree_all_unions (const union tree *tp)
int	db_count_subtree_regions (const union tree *tp)
int	db_tally_subtree_regions (union tree *tp, union tree **reg_trees, int cur, int lim, struct resource *resp)
HIDDEN union tree *	db_gettree_region_end (register struct db_tree_state *tsp, struct db_full_path *pathp, union tree *curtree, genptr_t client_data)
HIDDEN union tree *	db_gettree_leaf (struct db_tree_state *tsp, struct db_full_path *pathp, struct rt_db_internal *ip, genptr_t client_data)
HIDDEN void	db_walk_subtree (register union tree *tp, struct combined_tree_state **region_start_statepp, union tree *(*leaf_func) BU_ARGS((struct db_tree_state *, struct db_full_path *, struct rt_db_internal *, void *)), genptr_t client_data, struct resource *resp)
HIDDEN void	db_walk_dispatcher (int cpu, genptr_t arg)
int	db_walk_tree (struct db_i *dbip, int argc, const char **argv, int ncpu, const struct db_tree_state *init_state, int(*reg_start_func)(struct db_tree_state *, struct db_full_path *, const struct rt_comb_internal *, genptr_t), union tree *(*reg_end_func)(struct db_tree_state *, struct db_full_path *, union tree *, genptr_t), union tree *(*leaf_func)(struct db_tree_state *, struct db_full_path *, struct rt_db_internal *, genptr_t), genptr_t client_data)
int	db_path_to_mat (struct db_i *dbip, struct db_full_path *pathp, mat_t mat, int depth, struct resource *resp)
void	db_apply_anims (struct db_full_path *pathp, struct directory *dp, mat_t stack, mat_t arc, struct mater_info *materp)
int	db_region_mat (mat_t m, struct db_i *dbip, const char *name, struct resource *resp)
int	db_shader_mat (mat_t model_to_shader, const struct rt_i *rtip, const struct region *rp, point_t p_min, point_t p_max, struct resource *resp)

---

Detailed Description

Functions - db_walk_tree Parallel tree walker db_path_to_mat Given a path, return a matrix. db_region_mat Given a name, return a matrix

Author - Michael John Muuss

Source - SECAD/VLD Computing Consortium, Bldg 394 The U. S. Army Ballistic Research Laboratory Aberdeen Proving Ground, Maryland 21005-5066

Definition in file db_tree.c.

---