Cleanup: Remove more #if 0 blocks

Continuation of https://developer.blender.org/D3802

Reviewers: brecht

Differential Revision: https://developer.blender.org/D3808

1 files changed, 0 insertions, 39 deletions

diff --git a/source/blender/blenkernel/intern/mesh_evaluate.c b/source/blender/blenkernel/intern/mesh_evaluate.c
index f9ced904536..e40336cd4bd 100644
--- a/source/blender/blenkernel/intern/mesh_evaluate.c
+++ b/source/blender/blenkernel/intern/mesh_evaluate.c
@@ -982,10 +982,6 @@ static void split_loop_nor_single_do(LoopSplitTaskDataCommon *common_data, LoopS
 	const MLoop *ml_curr = data->ml_curr;
 	const MLoop *ml_prev = data->ml_prev;
 	const int ml_curr_index = data->ml_curr_index;
-#if 0  /* Not needed for 'single' loop. */
-	const int ml_prev_index = data->ml_prev_index;
-	const int *e2l_prev = data->e2l_prev;
-#endif
 	const int mp_index = data->mp_index;
 
 	/* Simple case (both edges around that vertex are sharp in current polygon),
@@ -1036,9 +1032,6 @@ static void split_loop_nor_fan_do(LoopSplitTaskDataCommon *common_data, LoopSpli
 	const float (*polynors)[3] = common_data->polynors;
 
 	MLoopNorSpace *lnor_space = data->lnor_space;
-#if 0  /* Not needed for 'fan' loops. */
-	float (*lnor)[3] = data->lnor;
-#endif
 	const MLoop *ml_curr = data->ml_curr;
 	const MLoop *ml_prev = data->ml_prev;
 	const int ml_curr_index = data->ml_curr_index;
@@ -1423,10 +1416,6 @@ static void loop_split_generator(TaskPool *pool, LoopSplitTaskDataCommon *common
 					data->ml_curr = ml_curr;
 					data->ml_prev = ml_prev;
 					data->ml_curr_index = ml_curr_index;
-#if 0  /* Not needed for 'single' loop. */
-					data->ml_prev_index = ml_prev_index;
-					data->e2l_prev = NULL;  /* Tag as 'single' task. */
-#endif
 					data->mp_index = mp_index;
 					if (lnors_spacearr) {
 						data->lnor_space = BKE_lnor_space_create(lnors_spacearr);
@@ -1441,9 +1430,6 @@ static void loop_split_generator(TaskPool *pool, LoopSplitTaskDataCommon *common
 				 * All this due/thanks to link between normals and loop ordering (i.e. winding).
 				 */
 				else {
-#if 0  /* Not needed for 'fan' loops. */
-					data->lnor = lnors;
-#endif
 					data->ml_curr = ml_curr;
 					data->ml_prev = ml_prev;
 					data->ml_curr_index = ml_curr_index;
@@ -2165,30 +2151,6 @@ static float mesh_calc_poly_area_centroid(
 	return total_area;
 }
 
-#if 0 /* slow version of the function below */
-void BKE_mesh_calc_poly_angles(
-        MPoly *mpoly, MLoop *loopstart,
-        MVert *mvarray, float angles[])
-{
-	MLoop *ml;
-	MLoop *mloop = &loopstart[-mpoly->loopstart];
-
-	int j;
-	for (j = 0, ml = loopstart; j < mpoly->totloop; j++, ml++) {
-		MLoop *ml_prev = ME_POLY_LOOP_PREV(mloop, mpoly, j);
-		MLoop *ml_next = ME_POLY_LOOP_NEXT(mloop, mpoly, j);
-
-		float e1[3], e2[3];
-
-		sub_v3_v3v3(e1, mvarray[ml_next->v].co, mvarray[ml->v].co);
-		sub_v3_v3v3(e2, mvarray[ml_prev->v].co, mvarray[ml->v].co);
-
-		angles[j] = (float)M_PI - angle_v3v3(e1, e2);
-	}
-}
-
-#else /* equivalent the function above but avoid multiple subtractions + normalize */
-
 void BKE_mesh_calc_poly_angles(
         const MPoly *mpoly, const MLoop *loopstart,
         const MVert *mvarray, float angles[])
@@ -2213,7 +2175,6 @@ void BKE_mesh_calc_poly_angles(
 		i_next++;
 	}
 }
-#endif
 
 void BKE_mesh_poly_edgehash_insert(EdgeHash *ehash, const MPoly *mp, const MLoop *mloop)
 {