Changeset View
Changeset View
Standalone View
Standalone View
intern/cycles/bvh/node.cpp
| Show First 20 Lines • Show All 147 Lines • ▼ Show 20 Lines | if (!is_leaf()) { | ||||
| time_from = min(child0->time_from, child1->time_from); | time_from = min(child0->time_from, child1->time_from); | ||||
| time_to = max(child0->time_to, child1->time_to); | time_to = max(child0->time_to, child1->time_to); | ||||
| } | } | ||||
| } | } | ||||
| namespace { | namespace { | ||||
| struct DumpTraversalContext { | struct DumpTraversalContext { | ||||
| /* Descriptor of wile where writing is happening. */ | /* Descriptor of while where writing is happening. */ | ||||
| FILE *stream; | FILE *stream; | ||||
| /* Unique identifier of the node current. */ | /* Unique identifier of the node current. */ | ||||
| int id; | int id; | ||||
| }; | }; | ||||
| void dump_subtree(DumpTraversalContext *context, const BVHNode *node, const BVHNode *parent = NULL) | void dump_subtree(DumpTraversalContext *context, const BVHNode *node, const BVHNode *parent = NULL) | ||||
| { | { | ||||
| if (node->is_leaf()) { | if (node->is_leaf()) { | ||||
| ▲ Show 20 Lines • Show All 60 Lines • Show Last 20 Lines | |||||