Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDaniel Genrich <daniel.genrich@gmx.net>2008-08-08 02:05:45 +0400
committerDaniel Genrich <daniel.genrich@gmx.net>2008-08-08 02:05:45 +0400
commitc58e27d07065d90f944b3645f2c505e81992b5fe (patch)
tree4ae855a6de00a31208545d2665358b9179f9819b /source/blender/blenlib
parent2edb87d90e8457924bcb6112e7e1d27a5d3c94c9 (diff)
Fixing compile error with msvc (introducing max tree to 32)
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r--source/blender/blenlib/intern/BLI_kdopbvh.c11
1 files changed, 9 insertions, 2 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c
index 594a234deda..9671551a7f1 100644
--- a/source/blender/blenlib/intern/BLI_kdopbvh.c
+++ b/source/blender/blenlib/intern/BLI_kdopbvh.c
@@ -43,6 +43,10 @@
#include <omp.h>
#endif
+
+
+#define MAX_TREETYPE 32
+
typedef struct BVHNode
{
struct BVHNode **children;
@@ -490,7 +494,7 @@ static void verify_tree(BVHTree *tree)
#endif
//Helper data and structures to build a min-leaf generalized implicit tree
-//This code can be easily reduced (basicly this is only method to calculate pow(k, n) in O(1).. and sutff like that)
+//This code can be easily reduced (basicly this is only method to calculate pow(k, n) in O(1).. and stuff like that)
typedef struct BVHBuildHelper
{
int tree_type; //
@@ -648,7 +652,7 @@ static void non_recursive_bvh_div_nodes(BVHTree *tree, BVHNode *branches_array,
int k;
const int parent_level_index= j-i;
BVHNode* parent = branches_array + j;
- int nth_positions[ tree_type + 1 ];
+ int nth_positions[ MAX_TREETYPE + 1];
char split_axis;
int parent_leafs_begin = implicit_leafs_index(&data, depth, parent_level_index);
@@ -713,6 +717,9 @@ BVHTree *BLI_bvhtree_new(int maxsize, float epsilon, char tree_type, char axis)
// theres not support for trees below binary-trees :P
if(tree_type < 2)
return NULL;
+
+ if(tree_type > MAX_TREETYPE)
+ return NULL;
tree = (BVHTree *)MEM_callocN(sizeof(BVHTree), "BVHTree");