bfb6fce659
Adds support for building multiple BVH types in order to support using both CPU and OptiX devices for rendering simultaneously. Primitive packing for Embree and OptiX is now standalone, so it only needs to be run once and can be shared between the two. Additionally, BVH building was made a device call, so that each device backend can decide how to perform the building. The multi-device for instance creates a special multi-BVH that holds references to several sub-BVHs, one for each sub-device. Reviewed By: brecht, kevindietrich Differential Revision: https://developer.blender.org/D9718
111 lines
3.2 KiB
C++
111 lines
3.2 KiB
C++
/*
|
|
* Adapted from code copyright 2009-2010 NVIDIA Corporation
|
|
* Modifications Copyright 2011, Blender Foundation.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef __BVH2_H__
|
|
#define __BVH2_H__
|
|
|
|
#include "bvh/bvh.h"
|
|
#include "bvh/bvh_params.h"
|
|
|
|
#include "util/util_types.h"
|
|
#include "util/util_vector.h"
|
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
#define BVH_NODE_SIZE 4
|
|
#define BVH_NODE_LEAF_SIZE 1
|
|
#define BVH_UNALIGNED_NODE_SIZE 7
|
|
|
|
/* Pack Utility */
|
|
struct BVHStackEntry {
|
|
const BVHNode *node;
|
|
int idx;
|
|
|
|
BVHStackEntry(const BVHNode *n = 0, int i = 0);
|
|
int encodeIdx() const;
|
|
};
|
|
|
|
/* BVH2
|
|
*
|
|
* Typical BVH with each node having two children.
|
|
*/
|
|
class BVH2 : public BVH {
|
|
public:
|
|
void build(Progress &progress, Stats *stats);
|
|
void refit(Progress &progress);
|
|
|
|
PackedBVH pack;
|
|
|
|
protected:
|
|
/* constructor */
|
|
friend class BVH;
|
|
BVH2(const BVHParams ¶ms,
|
|
const vector<Geometry *> &geometry,
|
|
const vector<Object *> &objects);
|
|
|
|
/* Building process. */
|
|
virtual BVHNode *widen_children_nodes(const BVHNode *root);
|
|
|
|
/* pack */
|
|
void pack_nodes(const BVHNode *root);
|
|
|
|
void pack_leaf(const BVHStackEntry &e, const LeafNode *leaf);
|
|
void pack_inner(const BVHStackEntry &e, const BVHStackEntry &e0, const BVHStackEntry &e1);
|
|
|
|
void pack_aligned_inner(const BVHStackEntry &e,
|
|
const BVHStackEntry &e0,
|
|
const BVHStackEntry &e1);
|
|
void pack_aligned_node(int idx,
|
|
const BoundBox &b0,
|
|
const BoundBox &b1,
|
|
int c0,
|
|
int c1,
|
|
uint visibility0,
|
|
uint visibility1);
|
|
|
|
void pack_unaligned_inner(const BVHStackEntry &e,
|
|
const BVHStackEntry &e0,
|
|
const BVHStackEntry &e1);
|
|
void pack_unaligned_node(int idx,
|
|
const Transform &aligned_space0,
|
|
const Transform &aligned_space1,
|
|
const BoundBox &b0,
|
|
const BoundBox &b1,
|
|
int c0,
|
|
int c1,
|
|
uint visibility0,
|
|
uint visibility1);
|
|
|
|
/* refit */
|
|
void refit_nodes();
|
|
void refit_node(int idx, bool leaf, BoundBox &bbox, uint &visibility);
|
|
|
|
/* Refit range of primitives. */
|
|
void refit_primitives(int start, int end, BoundBox &bbox, uint &visibility);
|
|
|
|
/* triangles and strands */
|
|
void pack_primitives();
|
|
void pack_triangle(int idx, float4 storage[3]);
|
|
|
|
/* merge instance BVH's */
|
|
void pack_instances(size_t nodes_size, size_t leaf_nodes_size);
|
|
};
|
|
|
|
CCL_NAMESPACE_END
|
|
|
|
#endif /* __BVH2_H__ */
|