Blender Git Commit Log
Git Commits -> Revision d79fa8d
Revision d79fa8d by Sergey Sharybin (master) August 25, 2017, 12:54 (GMT) |
Another optimization of tangent space calculation Don't use quick sort for small arrays, bubble sort works way faster for small arrays due to cache coherency. This is what qsort() from libc is doing actually. We can also experiment unrolling some extra small arrays, for example 3 and 4 element arrays. This reduces tangent space calculation for dragon from 3.1sec to 2.9sec. |
Commit Details:
Full Hash: d79fa8dc4dc28fc49dbdbecbd481bc21657f24c6
Parent Commit: 49717d4
Lines Changed: +13, -0
1 Modified Path:
/intern/mikktspace/mikktspace.c (+13, -0) (Diff)