+/*
+ * Copyright (C) 2021-2022 Mt.ZERO Software, Harry Godden - All Rights Reserved
+ */
+
#ifndef BVH_H
#define BVH_H
#include "common.h"
* system: the system we created above which will deal with the data
*
* call bh_create( bh_tree *bh, u32 item_count )
- * 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 )
+ * 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 )
*/
typedef struct bh_node bh_node;
typedef struct bh_tree bh_tree;
typedef struct bh_system bh_system;
-struct bh_node
-{
- boxf bbx;
-
- /* if il is 0, this is a leaf */
- u32 il, count;
- union{ u32 ir, start; };
-};
-
struct bh_tree
{
- bh_node *nodes;
u32 node_count;
bh_system *system;
void *user;
+
+ struct bh_node
+ {
+ boxf bbx;
+
+ /* if il is 0, this is a leaf */
+ u32 il, count;
+ union{ u32 ir, start; };
+ }
+ nodes[];
};
struct bh_system
int (*cast_ray)( void *user, u32 index, v3f co, v3f dir, ray_hit *hit );
};
-static void bh_update_bounds( bh_tree *bh, u32 inode )
+VG_STATIC void bh_update_bounds( bh_tree *bh, u32 inode )
{
bh_node *node = &bh->nodes[ inode ];
}
}
-static void bh_subdivide( bh_tree *bh, u32 inode )
+VG_STATIC void bh_subdivide( bh_tree *bh, u32 inode )
{
bh_node *node = &bh->nodes[ inode ];
node->ir = ir;
node->count = 0;
- /* TODO: Implement max depth, or stack */
bh_update_bounds( bh, il );
bh_update_bounds( bh, ir );
bh_subdivide( bh, il );
bh_subdivide( bh, ir );
}
-static void bh_create( bh_tree *bh, bh_system *sys, void *user, u32 item_count )
+VG_STATIC bh_tree *bh_create( void *lin_alloc, bh_system *system,
+ void *user, u32 item_count )
{
- bh->system = sys;
+ u32 totsize = sizeof(bh_tree) + sizeof(bh_node)*(item_count*2-1);
+ bh_tree *bh = vg_linear_alloc( lin_alloc, totsize );
+ bh->system = system;
bh->user = user;
- bh->nodes = malloc( sizeof(bh_node) * (item_count*2-1) );
bh_node *root = &bh->nodes[0];
bh->node_count = 1;
bh_update_bounds( bh, 0 );
bh_subdivide( bh, 0 );
- bh->nodes = realloc( bh->nodes, sizeof(bh_node) * bh->node_count );
+ totsize = sizeof(bh_tree) + sizeof(bh_node) * bh->node_count;
+ bh = vg_linear_resize( lin_alloc, bh, totsize );
+
vg_success( "BVH done, size: %u/%u\n", bh->node_count, (item_count*2-1) );
+ return bh;
}
-static void bh_debug_node( bh_tree *bh, u32 inode, v3f pos, u32 colour )
+VG_STATIC void bh_debug_node( bh_tree *bh, u32 inode, v3f pos, u32 colour )
{
bh_node *node = &bh->nodes[ inode ];
}
}
-static int bh_ray( bh_tree *bh, u32 inode, v3f co, v3f dir, ray_hit *hit )
+VG_STATIC int bh_ray( bh_tree *bh, v3f co, v3f dir, ray_hit *hit )
{
int count = 0;
u32 stack[100];
return count;
}
-static int bh_select( bh_tree *bh, boxf box, u32 *buffer, int len )
+VG_STATIC int bh_select( bh_tree *bh, boxf box, u32 *buffer, int len )
{
int count = 0;
u32 stack[100];