tinybvh-rs 0.1.0-beta.3

Rust wrapper for tinybvh
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

#define TINYBVH_IMPLEMENTATION
#include "tinybvh-rs/ffi/include/tinybvh.h"

namespace tinybvh {

/** Utils */

Ray ray_new(const std::array<float, 3>& origin, const std::array<float, 3>& dir) {
    bvhvec3 o{origin[0], origin[1], origin[2]};
    bvhvec3 d{dir[0], dir[1], dir[2]};
    return tinybvh::Ray{o, d};
}

/** Wald BVH */

std::unique_ptr<BVH> BVH_new() {
    return std::make_unique<BVH>();
}
void BVH_setPrimitives(BVH& out, const bvhvec4slice& primitives) {
    out.verts = primitives;
}
rust::Slice<const BVHNode> BVH_nodes(const BVH& bvh) {
    return rust::Slice{const_cast<const BVHNode*>(bvh.bvhNode), bvh.usedNodes};
}
rust::Slice<const uint32_t> BVH_indices(const BVH& bvh) {
    return rust::Slice{const_cast<const uint32_t*>(bvh.primIdx), bvh.triCount};
}
bool BVH_refittable(const BVH& bvh) {
    return bvh.refittable;
}

/** MBVH8 */

std::unique_ptr<MBVH8> MBVH8_new() {
    return std::make_unique<MBVH8>();
}
void MBVH8_setBVH(MBVH8& out, const BVH& bvh) {
    out.bvh = bvh;
}
rust::Slice<const MBVH8Node> MBVH8_nodes(const MBVH8& bvh) {
    return rust::Slice{const_cast<const MBVH8Node*>(bvh.mbvhNode), bvh.usedNodes};
}

/** BVH8_CPU */

std::unique_ptr<BVH8_CPU> BVH8_CPU_new() {
    return std::make_unique<BVH8_CPU>();
}

/** CWBVH */

std::unique_ptr<BVH8_CWBVH> CWBVH_new() { return std::make_unique<BVH8_CWBVH>(); }
const uint8_t* CWBVH_nodes(const BVH8_CWBVH& bvh) { return reinterpret_cast<const uint8_t*>(bvh.bvh8Data); }
uint32_t CWBVH_nodes_count(const BVH8_CWBVH& bvh) {
    /* tinybvh `usedBlocks` is the number of `vec4`, **not** the number of nodes. */
    return bvh.usedBlocks / 5;
}
const uint8_t* CWBVH_primitives(const BVH8_CWBVH& bvh) { return reinterpret_cast<const uint8_t*>(bvh.bvh8Tris); }
uint32_t CWBVH_primitives_count(const BVH8_CWBVH& bvh) { return bvh.idxCount; }

}