- Generated on Sun Jul 27 2025 01:49:30 for BRL-CAD by
1.9.8
|
BRL-CAD
|
#include "common.h"#include "vmath.h"#include "bu/avs.h"#include "bu/magic.h"#include "bu/malloc.h"#include "bn/tol.h"#include "rt/geom.h"#include "rt/defines.h"#include "rt/db_instance.h"#include "rt/directory.h"#include "rt/mater.h"#include "rt/op.h"#include "rt/region.h"#include "rt/soltab.h"#include "rt/tol.h"#include "nmg.h"Go to the source code of this file.
Data Structures | |
| struct | db_tree_state |
| struct | db_traverse |
| struct | combined_tree_state |
| union | tree |
| struct | tree::tree_node |
| struct | tree::tree_leaf |
| struct | tree::tree_cts |
| struct | tree::tree_tessellation |
| struct | tree::tree_db_leaf |
| struct | rt_tree_array |
| #define RT_DBTS_INIT_ZERO { RT_DBTS_MAGIC, NULL, 0, 0, 0, 0, 0, RT_MATER_INFO_INIT_ZERO, MAT_INIT_ZERO, 0, BU_AVS_INIT_ZERO, 0, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL } |
| #define RT_DBTS_INIT_IDN { RT_DBTS_MAGIC, NULL, 0, 0, 0, 0, 100, RT_MATER_INFO_INIT_IDN, MAT_INIT_IDN, 0, BU_AVS_INIT_ZERO, 0, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL } |
| #define RT_CK_DBTS | ( | _p | ) | BU_CKMAG(_p, RT_DBTS_MAGIC, "db_tree_state") |
| #define RT_CK_DB_TRAVERSE | ( | _p | ) | BU_CKMAG(_p, RT_DB_TRAVERSE_MAGIC, "db_traverse") |
| #define RT_CK_CTS | ( | _p | ) | BU_CKMAG(_p, RT_CTS_MAGIC, "combined_tree_state") |
initialize a union tree to zero without a node operation set. Use the largest union so all values are effectively zero except for the magic number.
|
extern |
|
extern |
Duplicate the contents of a db_tree_state structure, including a private copy of the ts_mater field(s) and the attribute/value set.
|
extern |
Release dynamic fields inside the structure, but not the structure itself.
|
extern |
In most cases, you don't want to use this routine, you want to struct copy mged_initial_tree_state or use RT_DBTS_INIT, and then set ts_dbip in your copy.
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
|
extern |
Handle inheritance of material property found in combination record. Color and the material property have separate inheritance interlocks.
Returns - -1 failure 0 success 1 success, this is the top of a new region.
The search stops on the first match.
Returns - tp if found TREE_NULL if not found in this tree
The search stops on the first match.
Returns - TREE_NULL if not found in this tree tp if found *side == 1 if leaf is on lhs. *side == 2 if leaf is on rhs.
|
extern |
Given a name presumably referenced in a OP_DB_LEAF node, delete that node, and the operation node that references it. Not that this may not produce an equivalent tree, for example when rewriting (A - subtree) as (subtree), but that will be up to the caller/user to adjust. This routine gets rid of exactly two nodes in the tree: leaf, and op. Use some other routine if you wish to kill the entire rhs below "-" and "intersect" nodes.
The two nodes deleted will have their memory freed.
If the tree is a single OP_DB_LEAF node, the leaf is freed and *tp is set to NULL.
Returns - -3 Internal error -2 Tree is empty -1 Unable to find OP_DB_LEAF node specified by 'cp'. 0 OK
Multiply on the left every matrix found in a DB_LEAF node in a tree.
|
extern |
This routine traverses a combination (union tree) in LNR order and calls the provided function for each OP_DB_LEAF node. Note that this routine does not go outside this one combination!!!!
was previously named comb_functree()
|
extern |
Starting with possible prior partial path and corresponding accumulated state, follow the path given by "new_path", updating *tsp and *total_path with full state information along the way. In a better world, there would have been a "combined_tree_state" arg.
Parameter 'depth' controls how much of 'new_path' is used:
0 use all of new_path >0 use only this many of the first elements of the path <0 use all but this many path elements.
A much more complete version of rt_plookup() and pathHmat(). There is also a TCL interface.
Returns - 0 success (plus *tsp is updated) -1 error (*tsp values are not useful)
|
extern |
Follow the slash-separated path given by "cp", and update *tsp and *total_path with full state information along the way.
A much more complete version of rt_plookup().
Returns - 0 success (plus *tsp is updated) -1 error (*tsp values are not useful)
Release all storage associated with node 'tp', including children nodes.
Re-balance this node to make it left heavy. Union operators will be moved to left side. when finished "tp" MUST still point to top node of this subtree.
If there are non-union operations in the tree, above the region nodes, then rewrite the tree so that the entire tree top is nothing but union operations, and any non-union operations are clustered down near the region nodes.
Return a count of the number of "union tree" nodes below "tp", including tp.
Returns - 1 if this tree contains nothing but union operations. 0 if at least one subtraction or intersection op exists.
|
extern |
|
extern |
This is the top interface to the "tree walker."
Parameters: rtip rt_i structure to database (open with rt_dirbuild()) argc # of tree-tops named argv names of tree-tops to process init_state Input parameter: initial state of the tree. For example: rt_initial_tree_state, and mged_initial_tree_state.
These parameters are pointers to callback routines. If NULL, they won't be called.
reg_start_func Called at beginning of each region, before
visiting any nodes within the region. Return
0 if region should be skipped without
recursing, otherwise non-zero. DO NOT USE FOR
OTHER PURPOSES! For example, can be used to
quickly skip air regions.
reg_end_func Called after all nodes within a region have been
recursively processed by leaf_func. If it
wants to retain 'curtree' then it may steal
that pointer and return TREE_NULL. If it
wants us to clean up some or all of that tree,
then it returns a non-null (union tree *)
pointer, and that tree is safely freed in a
non-parallel section before we return.
leaf_func Function to process a leaf node. It is actually
invoked from db_recurse() from
_db_walk_subtree(). Returns (union tree *)
representing the leaf, or TREE_NULL if leaf
does not exist or has an error.
This routine will employ multiple CPUs if asked, but is not multiply-parallel-recursive. Call this routine with ncpu > 1 from serial code only. When called from within an existing thread, ncpu must be 1.
If ncpu > 1, the caller is responsible for making sure that RTG.rtg_parallel is non-zero.
Plucks per-cpu resources out of rtip->rti_resources[]. They need to have been initialized first.
Returns - -1 Failure to prepare even a single sub-tree 0 OK
Fills a bu_vls with a representation of the given tree appropriate for processing by Tcl scripts.
A tree 't' is represented in the following manner:
t := { l dbobjname { mat } } | { l dbobjname } | { u t1 t2 } | { n t1 t2 } | { - t1 t2 } | { ^ t1 t2 } | { ! t1 } | { G t1 } | { X t1 } | { N } | {}
where 'dbobjname' is a string containing the name of a database object, 'mat' is the matrix preceding a leaf, 't1', 't2' are trees (recursively defined).
Notice that in most cases, this tree will be grossly unbalanced.
Take a TCL-style string description of a binary tree, as produced by db_tree_list(), and reconstruct the in-memory form of that tree.
|
extern |
This subroutine is called for a no-frills tree-walk, with the provided subroutines being called at every combination and leaf (solid) node, respectively.
This routine is recursive, so no variables may be declared static.
Ray Tracing library database tree walker.
Collect and prepare regions and solids for subsequent ray-tracing. Calculate the bounding RPP of the region whose boolean tree is 'tp'. The bounding RPP is returned in tree_min and tree_max, which need not have been initialized first.
Returns - 0 success -1 failure (tree_min and tree_max may have been altered)
Eliminate any references to NOP nodes from the tree. It is safe to use db_free_tree() here, because there will not be any dead solids. They will all have been converted to OP_NOP nodes by _rt_tree_kill_dead_solid_refs(), previously, so there is no need to worry about multiple db_free_tree()'s repeatedly trying to free one solid that has been instanced multiple times.
Returns - 0 this node is OK. -1 request caller to kill this node
Return count of number of leaf nodes in this tree.
|
extern |
Take a binary tree in "V4-ready" layout (non-unions pushed below unions, left-heavy), and flatten it into an array layout, ready for conversion back to the GIFT-inspired V4 database format.
This is done using the db_non_union_push() routine.
If argument 'free' is non-zero, then the non-leaf nodes are freed along the way, to prevent memory leaks. In this case, the caller's copy of 'tp' will be invalid upon return.
When invoked at the very top of the tree, the op argument must be OP_UNION.
|
extern |
Produce a GIFT-compatible listing, one "member" per line, regardless of the structure of the tree we've been given.
|
extern |
Support routine for db_ck_v4gift_tree(). Ensure that the tree below 'tp' is left-heavy, i.e. that there are nothing but solids on the right side of any binary operations.
Returns - -1 ERROR 0 OK
Look a gift-tree in the mouth.
Ensure that this boolean tree conforms to the GIFT convention that union operations must bind the loosest.
There are two stages to this check: 1) Ensure that if unions are present they are all at the root of tree, 2) Ensure non-union children of union nodes are all left-heavy (nothing but solid nodes permitted on rhs of binary operators).
Returns - -1 ERROR 0 OK
|
extern |
Given a rt_tree_array array, build a tree of "union tree" nodes appropriately connected together. Every element of the rt_tree_array array used is replaced with a TREE_NULL. Elements which are already TREE_NULL are ignored. Returns a pointer to the top of the tree.
|
extern |
|
extern |
Updates state via *tsp, pushes member's directory entry on *pathp. (Caller is responsible for popping it).
Returns - -1 failure 0 success, member pushed on path
DEPRECATED, internal implementation function
|
extern |
Returns - -1 found member, failed to apply state 0 unable to find member 'cp' 1 state applied OK
DEPRECATED, internal implementation function
|
extern |
Recurse down the tree, finding all the leaves (or finding just all the regions).
ts_region_start_func() is called to permit regions to be skipped. It is not intended to be used for collecting state.
DEPRECATED, internal implementation function
1.9.8