diff options
Diffstat (limited to 'intern/cycles/bvh/bvh_node.cpp')
| -rw-r--r-- | intern/cycles/bvh/bvh_node.cpp | 99 |
1 files changed, 0 insertions, 99 deletions
diff --git a/intern/cycles/bvh/bvh_node.cpp b/intern/cycles/bvh/bvh_node.cpp index fd8b4977699..dc0255c4039 100644 --- a/intern/cycles/bvh/bvh_node.cpp +++ b/intern/cycles/bvh/bvh_node.cpp @@ -47,69 +47,6 @@ int BVHNode::getSubtreeSize(BVH_STAT stat) const case BVH_STAT_CHILDNODE_COUNT: cnt = num_children(); break; - case BVH_STAT_QNODE_COUNT: - cnt = 1; - for(int i = 0; i < num_children(); i++) { - BVHNode *node = get_child(i); - if(node->is_leaf()) { - cnt += 1; - } - else { - for(int j = 0; j < node->num_children(); j++) { - cnt += node->get_child(j)->getSubtreeSize(stat); - } - } - } - return cnt; - case BVH_STAT_ONODE_COUNT: - cnt = 1; - for(int i = 0; i < num_children(); i++) { - BVHNode *node = get_child(i); - if(node->is_leaf()) { - cnt += 1; - } - else { - for(int j = 0; j < node->num_children(); j++) - { - BVHNode *node_next = node->get_child(j); - if(node_next->is_leaf()) { - cnt += 1; - } - else { - for(int k = 0; k < node_next->num_children(); k++) { - cnt += node_next->get_child(k)->getSubtreeSize(stat); - } - } - } - } - } - return cnt; - case BVH_STAT_UNALIGNED_INNER_ONODE_COUNT: - { - bool has_unaligned = false; - for(int i = 0; i < num_children(); i++) { - BVHNode *node = get_child(i); - if(node->is_leaf()) { - has_unaligned |= node->is_unaligned; - } - else { - for(int j = 0; j < node->num_children(); j++) { - BVHNode *node_next = node->get_child(j); - if(node_next->is_leaf()) { - has_unaligned |= node_next->is_unaligned; - } - else { - for(int k = 0; k < node_next->num_children(); k++) { - cnt += node_next->get_child(k)->getSubtreeSize(stat); - has_unaligned |= node_next->get_child(k)->is_unaligned; - } - } - } - } - } - cnt += has_unaligned? 1: 0; - } - return cnt; case BVH_STAT_ALIGNED_COUNT: if(!is_unaligned) { cnt = 1; @@ -138,42 +75,6 @@ int BVHNode::getSubtreeSize(BVH_STAT stat) const cnt += has_unaligned? 1: 0; } break; - case BVH_STAT_ALIGNED_INNER_QNODE_COUNT: - { - bool has_unaligned = false; - for(int i = 0; i < num_children(); i++) { - BVHNode *node = get_child(i); - if(node->is_leaf()) { - has_unaligned |= node->is_unaligned; - } - else { - for(int j = 0; j < node->num_children(); j++) { - cnt += node->get_child(j)->getSubtreeSize(stat); - has_unaligned |= node->get_child(j)->is_unaligned; - } - } - } - cnt += has_unaligned? 0: 1; - } - return cnt; - case BVH_STAT_UNALIGNED_INNER_QNODE_COUNT: - { - bool has_unaligned = false; - for(int i = 0; i < num_children(); i++) { - BVHNode *node = get_child(i); - if(node->is_leaf()) { - has_unaligned |= node->is_unaligned; - } - else { - for(int j = 0; j < node->num_children(); j++) { - cnt += node->get_child(j)->getSubtreeSize(stat); - has_unaligned |= node->get_child(j)->is_unaligned; - } - } - } - cnt += has_unaligned? 1: 0; - } - return cnt; case BVH_STAT_ALIGNED_LEAF_COUNT: cnt = (is_leaf() && !is_unaligned) ? 1 : 0; break; |