diff options
-rw-r--r-- | intern/cycles/bvh/bvh.cpp | 2 | ||||
-rw-r--r-- | intern/cycles/bvh/bvh_build.cpp | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/intern/cycles/bvh/bvh.cpp b/intern/cycles/bvh/bvh.cpp index 39b2a0cf436..9f2468e4d95 100644 --- a/intern/cycles/bvh/bvh.cpp +++ b/intern/cycles/bvh/bvh.cpp @@ -343,7 +343,7 @@ void BVH::pack_instances(size_t nodes_size, size_t leaf_nodes_size) size_t leaf_nodes_offset_size = bvh->pack.leaf_nodes.size(); for(size_t i = 0, j = 0; i < leaf_nodes_offset_size; - i+= BVH_NODE_LEAF_SIZE, j++) + i += BVH_NODE_LEAF_SIZE, j++) { int4 data = leaf_nodes_offset[i]; data.x += prim_offset; diff --git a/intern/cycles/bvh/bvh_build.cpp b/intern/cycles/bvh/bvh_build.cpp index f2a735d12e3..c8aeeb886c8 100644 --- a/intern/cycles/bvh/bvh_build.cpp +++ b/intern/cycles/bvh/bvh_build.cpp @@ -787,7 +787,7 @@ BVHNode* BVHBuild::create_leaf_node(const BVHRange& range, if(params.use_unaligned_nodes && !alignment_found) { alignment_found = unaligned_heuristic.compute_aligned_space(p_ref[i][j], - &aligned_space); + &aligned_space); } } LeafNode *leaf_node = new LeafNode(bounds[i], |