Blender Git Loki

Git Commits -> Revision be2186a

Revision be2186a by Sergey Sharybin (master)
April 4, 2016, 12:13 (GMT)
Cycles: Solve possible issues with running out of stack memory allocator

Policy here is a bit more complicated, if tree becomes too deep we're
forced to create a leaf node and size of that leaf wouldn't be so well
predicted, which means it's quite tricky to use single stack array for
that.

Made it more official feature that StackAllocator will fall-back to
heap when running out of stack memory.

It's still much better than always using heap allocator.

Commit Details:

Full Hash: be2186ad629a6dc7057627e56b404db212de2deb
Parent Commit: 5ab3a97
Lines Changed: +19, -12

2 Modified Paths:

/intern/cycles/bvh/bvh_build.cpp (+3, -3) (Diff)
/intern/cycles/util/util_stack_allocator.h (+16, -9) (Diff)
Tehnyt: Miika HämäläinenViimeksi päivitetty: 07.11.2014 14:18MiikaH:n Sivut a.k.a. MiikaHweb | 2003-2021