Cr8-xyz/blender
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

ClangFormat: manually format sobol.cpp

Browse Source 
Disabled because it uses a lot of memory and is mostly data.
This commit is contained in:
Campbell Barton
2019-04-17 06:34:20 +02:00
parent e12c08e8d1
commit 91a9cd0a94
1 changed files with 28 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

56
intern/cycles/render/sobol.cpp
View File

@@ -54,8 +54,8 @@ CCL_NAMESPACE_BEGIN
#define SOBOL_MAX_NUMBER 32 #define SOBOL_MAX_NUMBER 32
typedef struct SobolDirectionNumbers { typedef struct SobolDirectionNumbers {
uint d, s, a; uint d, s, a;
uint m[SOBOL_MAX_NUMBER]; uint m[SOBOL_MAX_NUMBER];
} SobolDirectionNumbers; } SobolDirectionNumbers;
/* Note: this file is skipped by clang-format. */ /* Note: this file is skipped by clang-format. */
@@ -21268,40 +21268,40 @@ static SobolDirectionNumbers SOBOL_NUMBERS[SOBOL_MAX_DIMENSIONS - 1] = {
void sobol_generate_direction_vectors(uint vectors[][SOBOL_BITS], int dimensions) void sobol_generate_direction_vectors(uint vectors[][SOBOL_BITS], int dimensions)
{ {
assert(dimensions <= SOBOL_MAX_DIMENSIONS); assert(dimensions <= SOBOL_MAX_DIMENSIONS);
const uint L = SOBOL_BITS; const uint L = SOBOL_BITS;
/* first dimension is exception */ /* first dimension is exception */
uint *v = vectors[0]; uint *v = vectors[0];
for(uint i = 0; i < L; i++) for (uint i = 0; i < L; i++)
v[i] = 1 << (31-i); // all m's = 1 v[i] = 1 << (31 - i); // all m's = 1
for(int dim = 1; dim < dimensions; dim++) { for (int dim = 1; dim < dimensions; dim++) {
SobolDirectionNumbers *numbers = &SOBOL_NUMBERS[dim-1]; SobolDirectionNumbers *numbers = &SOBOL_NUMBERS[dim - 1];
uint s = numbers->s; uint s = numbers->s;
uint a = numbers->a; uint a = numbers->a;
uint *m = numbers->m; uint *m = numbers->m;
v = vectors[dim]; v = vectors[dim];
if(L <= s) { if (L <= s) {
for(uint i = 0; i < L; i++) for (uint i = 0; i < L; i++)
v[i] = m[i] << (31-i); v[i] = m[i] << (31 - i);
} }
else { else {
for(uint i = 0; i < s; i++) for (uint i = 0; i < s; i++)
v[i] = m[i] << (31-i); v[i] = m[i] << (31 - i);
for(uint i = s; i < L; i++) { for (uint i = s; i < L; i++) {
v[i] = v[i-s] ^ (v[i-s] >> s); v[i] = v[i - s] ^ (v[i - s] >> s);
for(uint k = 1; k < s; k++) for (uint k = 1; k < s; k++)
v[i] ^= (((a >> (s-1-k)) & 1) * v[i-k]); v[i] ^= (((a >> (s - 1 - k)) & 1) * v[i - k]);
} }
} }
} }
} }
CCL_NAMESPACE_END CCL_NAMESPACE_END