* system: the system we created above which will deal with the data
*
* call bh_create( bh_tree *bh, u32 item_count )
- * VG_STATIC int bh_ray( bh_tree *bh, u32 inode, v3f co, v3f dir, ray_hit *hit )
- * VG_STATIC int bh_select( bh_tree *bh, boxf box, u32 *buffer, int len )
+ * static int bh_ray( bh_tree *bh, u32 inode, v3f co, v3f dir, ray_hit *hit )
+ * static int bh_select( bh_tree *bh, boxf box, u32 *buffer, int len )
*/
typedef struct bh_node bh_node;
int (*cast_ray)( void *user, u32 index, v3f co, v3f dir, ray_hit *hit );
};
-VG_STATIC void bh_update_bounds( bh_tree *bh, u32 inode ){
+static void bh_update_bounds( bh_tree *bh, u32 inode ){
bh_node *node = &bh->nodes[ inode ];
box_init_inf( node->bbx );
}
}
-VG_STATIC void bh_subdivide( bh_tree *bh, u32 inode ){
+static void bh_subdivide( bh_tree *bh, u32 inode ){
bh_node *node = &bh->nodes[ inode ];
if( node->count <= bh->max_per_leaf )
bh_subdivide( bh, ir );
}
-VG_STATIC bh_tree *bh_create( void *lin_alloc, bh_system *system,
+static bh_tree *bh_create( void *lin_alloc, bh_system *system,
void *user, u32 item_count, u32 max_per_leaf ){
assert( max_per_leaf > 0 );
* Draw items in this leaf node.
* *item_debug() must be set!
*/
-VG_STATIC void bh_debug_leaf( bh_tree *bh, bh_node *node ){
+static void bh_debug_leaf( bh_tree *bh, bh_node *node ){
vg_line_boxf( node->bbx, 0xff00ff00 );
if( bh->system->item_debug ){
/*
* Trace the bh tree all the way down to the leaf nodes where pos is inside
*/
-VG_STATIC void bh_debug_trace( bh_tree *bh, u32 inode, v3f pos, u32 colour ){
+static void bh_debug_trace( bh_tree *bh, u32 inode, v3f pos, u32 colour ){
bh_node *node = &bh->nodes[ inode ];
if( (pos[0] >= node->bbx[0][0] && pos[0] <= node->bbx[1][0]) &&
i32 depth, i;
};
-VG_STATIC void bh_iter_init_generic( i32 root, bh_iter *it ){
+static void bh_iter_init_generic( i32 root, bh_iter *it ){
it->stack[0].id = root;
it->stack[0].depth = 0;
it->depth = 0;
it->i = 0;
}
-VG_STATIC void bh_iter_init_box( i32 root, bh_iter *it, boxf box ){
+static void bh_iter_init_box( i32 root, bh_iter *it, boxf box ){
bh_iter_init_generic( root, it );
it->query = k_bh_query_box;
box_copy( box, it->box.box );
}
-VG_STATIC void bh_iter_init_ray( i32 root, bh_iter *it, v3f co,
+static void bh_iter_init_ray( i32 root, bh_iter *it, v3f co,
v3f dir, f32 max_dist ){
bh_iter_init_generic( root, it );
it->query = k_bh_query_ray;
it->ray.max_dist = max_dist;
}
-VG_STATIC void bh_iter_init_range( i32 root, bh_iter *it, v3f co, f32 range ){
+static void bh_iter_init_range( i32 root, bh_iter *it, v3f co, f32 range ){
bh_iter_init_generic( root, it );
it->query = k_bh_query_range;
*
* this is like a 'broad phase only' deal.
*/
-VG_STATIC i32 bh_next( bh_tree *bh, bh_iter *it, i32 *em ){
+static i32 bh_next( bh_tree *bh, bh_iter *it, i32 *em ){
while( it->depth >= 0 ){
bh_node *inode = &bh->nodes[ it->stack[it->depth].id ];
return 0;
}
-VG_STATIC int bh_closest_point( bh_tree *bh, v3f pos,
+static int bh_closest_point( bh_tree *bh, v3f pos,
v3f closest, float max_dist )
{
if( bh->node_count < 2 )