1 files changed, 69 insertions, 69 deletions

diff --git a/source/blender/blenlib/intern/pbvh.c b/source/blender/blenlib/intern/pbvh.c
index a2fa69bfcd9..95a43a998d3 100644
--- a/source/blender/blenlib/intern/pbvh.c
+++ b/source/blender/blenlib/intern/pbvh.c
@@ -672,7 +672,7 @@ static PBVHNode *pbvh_iter_next(PBVHIter *iter)
 	   parents, this order is necessary for e.g. computing bounding boxes */
 
 	while(iter->stacksize) {
-                /* pop node */
+		/* pop node */
 		iter->stacksize--;
 		node= iter->stack[iter->stacksize].node;
 
@@ -709,30 +709,30 @@ static PBVHNode *pbvh_iter_next(PBVHIter *iter)
 
 static PBVHNode *pbvh_iter_next_occluded(PBVHIter *iter)
 {
-    PBVHNode *node;
-
-    while(iter->stacksize) {
-        /* pop node */
-        iter->stacksize--;
-        node= iter->stack[iter->stacksize].node;
-
-        /* on a mesh with no faces this can happen
-        * can remove this check if we know meshes have at least 1 face */
-        if(node==NULL) return NULL;
-
-        if(iter->scb && !iter->scb(node, iter->search_data)) continue; /* don't traverse, outside of search zone */
-
-        if(node->flag & PBVH_Leaf) {
-            /* immediately hit leaf node */
-            return node;
-        }
-        else {
-            pbvh_stack_push(iter, iter->bvh->nodes+node->children_offset+1, 0);
-            pbvh_stack_push(iter, iter->bvh->nodes+node->children_offset, 0);
-        }
-    }
-
-    return NULL;
+	PBVHNode *node;
+
+	while(iter->stacksize) {
+		/* pop node */
+		iter->stacksize--;
+		node= iter->stack[iter->stacksize].node;
+
+		/* on a mesh with no faces this can happen
+		 * can remove this check if we know meshes have at least 1 face */
+		if(node==NULL) return NULL;
+
+		if(iter->scb && !iter->scb(node, iter->search_data)) continue; /* don't traverse, outside of search zone */
+
+		if(node->flag & PBVH_Leaf) {
+			/* immediately hit leaf node */
+			return node;
+		}
+		else {
+			pbvh_stack_push(iter, iter->bvh->nodes+node->children_offset+1, 0);
+			pbvh_stack_push(iter, iter->bvh->nodes+node->children_offset, 0);
+		}
+	}
+
+	return NULL;
 }
 
 void BLI_pbvh_search_gather(PBVH *bvh,
@@ -793,59 +793,59 @@ void BLI_pbvh_search_callback(PBVH *bvh,
 }
 
 typedef struct node_tree {
-    PBVHNode* data;
+	PBVHNode* data;
 
-    struct node_tree* left;
-    struct node_tree* right;
+	struct node_tree* left;
+	struct node_tree* right;
 } node_tree;
 
 static void node_tree_insert(node_tree* tree, node_tree* new_node)
 {
-    if (new_node->data->tmin < tree->data->tmin) {
-        if (tree->left) {
-            node_tree_insert(tree->left, new_node);
-        }
-        else {
-            tree->left = new_node;
-        }
-    }
-    else {
-        if (tree->right) {
-            node_tree_insert(tree->right, new_node);
-        }
-        else {
-            tree->right = new_node;
-        }
-    }
+	if (new_node->data->tmin < tree->data->tmin) {
+		if (tree->left) {
+			node_tree_insert(tree->left, new_node);
+		}
+		else {
+			tree->left = new_node;
+		}
+	}
+	else {
+		if (tree->right) {
+			node_tree_insert(tree->right, new_node);
+		}
+		else {
+			tree->right = new_node;
+		}
+	}
 }
 
 static void traverse_tree(node_tree* tree, BLI_pbvh_HitOccludedCallback hcb, void* hit_data, float* tmin)
 {
-    if (tree->left) traverse_tree(tree->left, hcb, hit_data, tmin);
+	if (tree->left) traverse_tree(tree->left, hcb, hit_data, tmin);
 
-    hcb(tree->data, hit_data, tmin);
+	hcb(tree->data, hit_data, tmin);
 
-    if (tree->right) traverse_tree(tree->right, hcb, hit_data, tmin);
+	if (tree->right) traverse_tree(tree->right, hcb, hit_data, tmin);
 }
 
 static void free_tree(node_tree* tree)
 {
-    if (tree->left) {
-        free_tree(tree->left);
-        tree->left = 0;
-    }
+	if (tree->left) {
+		free_tree(tree->left);
+		tree->left = 0;
+	}
 
-    if (tree->right) {
-        free_tree(tree->right);
-        tree->right = 0;
-    }
+	if (tree->right) {
+		free_tree(tree->right);
+		tree->right = 0;
+	}
 
-    free(tree);
+	free(tree);
 }
 
 float BLI_pbvh_node_get_tmin(PBVHNode* node)
 {
-    return node->tmin;
+	return node->tmin;
 }
 
 static void BLI_pbvh_search_callback_occluded(PBVH *bvh,
@@ -1129,7 +1129,7 @@ void BLI_pbvh_get_grid_updates(PBVH *bvh, int clear, void ***gridfaces, int *tot
 	GHash *map;
 	void *face, **faces;
 	unsigned i;
-        int tot;
+	int tot;
 
 	map = BLI_ghash_new(BLI_ghashutil_ptrhash, BLI_ghashutil_ptrcmp, "pbvh_get_grid_updates gh");
 
@@ -1318,17 +1318,17 @@ static int ray_face_intersection(float ray_start[3], float ray_normal[3],
 				 float *t0, float *t1, float *t2, float *t3,
 				 float *fdist)
 {
-    float dist;
-
-    if ((isect_ray_tri_epsilon_v3(ray_start, ray_normal, t0, t1, t2, &dist, NULL, 0.1f) && dist < *fdist) ||
-        (t3 && isect_ray_tri_epsilon_v3(ray_start, ray_normal, t0, t2, t3, &dist, NULL, 0.1f) && dist < *fdist))
-    {
-        *fdist = dist;
-        return 1;
-    }
-    else {
-        return 0;
-    }
+	float dist;
+
+	if ((isect_ray_tri_epsilon_v3(ray_start, ray_normal, t0, t1, t2, &dist, NULL, 0.1f) && dist < *fdist) ||
+	   (t3 && isect_ray_tri_epsilon_v3(ray_start, ray_normal, t0, t2, t3, &dist, NULL, 0.1f) && dist < *fdist))
+	{
+		*fdist = dist;
+		return 1;
+	}
+	else {
+		return 0;
+	}
 }
 
 int BLI_pbvh_node_raycast(PBVH *bvh, PBVHNode *node, float (*origco)[3],