diff options
Diffstat (limited to 'source/blender/blenkernel/intern/constraint.c')
| -rw-r--r-- | source/blender/blenkernel/intern/constraint.c | 42 |
1 files changed, 21 insertions, 21 deletions
diff --git a/source/blender/blenkernel/intern/constraint.c b/source/blender/blenkernel/intern/constraint.c index dbc1335ebcd..449376a3960 100644 --- a/source/blender/blenkernel/intern/constraint.c +++ b/source/blender/blenkernel/intern/constraint.c @@ -490,7 +490,7 @@ static void contarget_get_mesh_mat (Object *ob, const char *substring, float mat copy_v3_v3(plane, tmat[1]); cross_v3_v3v3(mat[0], normal, plane); - if(len_v3(mat[0]) < 1e-3f) { + if (len_v3(mat[0]) < 1e-3f) { copy_v3_v3(plane, tmat[0]); cross_v3_v3v3(mat[0], normal, plane); } @@ -820,7 +820,7 @@ static void childof_evaluate (bConstraint *con, bConstraintOb *cob, ListBase *ta float parmat[4][4]; /* simple matrix parenting */ - if(data->flag == CHILDOF_ALL) { + if (data->flag == CHILDOF_ALL) { /* multiply target (parent matrix) by offset (parent inverse) to get * the effect of the parent that will be exherted on the owner @@ -3449,7 +3449,7 @@ static void shrinkwrap_get_tarmat (bConstraint *con, bConstraintOb *cob, bConstr { bShrinkwrapConstraint *scon = (bShrinkwrapConstraint *) con->data; - if( VALID_CONS_TARGET(ct) && (ct->tar->type == OB_MESH) ) + if ( VALID_CONS_TARGET(ct) && (ct->tar->type == OB_MESH) ) { int fail = FALSE; float co[3] = {0.0f, 0.0f, 0.0f}; @@ -3471,7 +3471,7 @@ static void shrinkwrap_get_tarmat (bConstraint *con, bConstraintOb *cob, bConstr unit_m4(ct->matrix); - if(target != NULL) + if (target != NULL) { space_transform_from_matrixs(&transform, cob->matrix, ct->tar->obmat); @@ -3480,12 +3480,12 @@ static void shrinkwrap_get_tarmat (bConstraint *con, bConstraintOb *cob, bConstr case MOD_SHRINKWRAP_NEAREST_SURFACE: case MOD_SHRINKWRAP_NEAREST_VERTEX: - if(scon->shrinkType == MOD_SHRINKWRAP_NEAREST_VERTEX) + if (scon->shrinkType == MOD_SHRINKWRAP_NEAREST_VERTEX) bvhtree_from_mesh_verts(&treeData, target, 0.0, 2, 6); else bvhtree_from_mesh_faces(&treeData, target, 0.0, 2, 6); - if(treeData.tree == NULL) + if (treeData.tree == NULL) { fail = TRUE; break; @@ -3496,16 +3496,16 @@ static void shrinkwrap_get_tarmat (bConstraint *con, bConstraintOb *cob, bConstr BLI_bvhtree_find_nearest(treeData.tree, co, &nearest, treeData.nearest_callback, &treeData); dist = len_v3v3(co, nearest.co); - if(dist != 0.0f) { + if (dist != 0.0f) { interp_v3_v3v3(co, co, nearest.co, (dist - scon->dist)/dist); /* linear interpolation */ } space_transform_invert(&transform, co); break; case MOD_SHRINKWRAP_PROJECT: - if(scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_X_AXIS) no[0] = 1.0f; - if(scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_Y_AXIS) no[1] = 1.0f; - if(scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_Z_AXIS) no[2] = 1.0f; + if (scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_X_AXIS) no[0] = 1.0f; + if (scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_Y_AXIS) no[1] = 1.0f; + if (scon->projAxis & MOD_SHRINKWRAP_PROJECT_OVER_Z_AXIS) no[2] = 1.0f; if (dot_v3v3(no, no) < FLT_EPSILON) { fail = TRUE; @@ -3516,13 +3516,13 @@ static void shrinkwrap_get_tarmat (bConstraint *con, bConstraintOb *cob, bConstr bvhtree_from_mesh_faces(&treeData, target, scon->dist, 4, 6); - if(treeData.tree == NULL) + if (treeData.tree == NULL) { fail = TRUE; break; } - if(normal_projection_project_vertex(0, co, no, &transform, treeData.tree, &hit, treeData.raycast_callback, &treeData) == FALSE) + if (normal_projection_project_vertex(0, co, no, &transform, treeData.tree, &hit, treeData.raycast_callback, &treeData) == FALSE) { fail = TRUE; break; @@ -3892,7 +3892,7 @@ static void pivotcon_evaluate (bConstraint *con, bConstraintOb *cob, ListBase *t /* correct the pivot by the rotation axis otherwise the pivot translates when it shouldnt */ mat3_to_axis_angle(axis, &angle, rotMat); - if(angle) { + if (angle) { float dvec[3]; sub_v3_v3v3(vec, pivot, cob->matrix[3]); project_v3_v3v3(dvec, vec, axis); @@ -3962,12 +3962,12 @@ static void followtrack_evaluate (bConstraint *con, bConstraintOb *cob, ListBase tracking= &clip->tracking; - if(data->object[0]) + if (data->object[0]) tracking_object= BKE_tracking_named_object(tracking, data->object); else tracking_object= BKE_tracking_get_camera_object(tracking); - if(!tracking_object) + if (!tracking_object) return; track= BKE_tracking_named_track(tracking, tracking_object, data->track); @@ -3981,7 +3981,7 @@ static void followtrack_evaluate (bConstraint *con, bConstraintOb *cob, ListBase copy_m4_m4(obmat, cob->matrix); - if((tracking_object->flag&TRACKING_OBJECT_CAMERA)==0) { + if ((tracking_object->flag&TRACKING_OBJECT_CAMERA)==0) { float imat[4][4]; copy_m4_m4(mat, camob->obmat); @@ -4068,7 +4068,7 @@ static void followtrack_evaluate (bConstraint *con, bConstraintOb *cob, ListBase copy_v3_v3(cob->matrix[3], disp); } - if(data->depth_ob && data->depth_ob->derivedFinal) { + if (data->depth_ob && data->depth_ob->derivedFinal) { Object *depth_ob= data->depth_ob; BVHTreeFromMesh treeData= NULL_BVHTreeFromMesh; BVHTreeRayHit hit; @@ -4089,7 +4089,7 @@ static void followtrack_evaluate (bConstraint *con, bConstraintOb *cob, ListBase result= BLI_bvhtree_ray_cast(treeData.tree, ray_start, ray_nor, 0.0f, &hit, treeData.raycast_callback, &treeData); - if(result != -1) { + if (result != -1) { mul_v3_m4v3(cob->matrix[3], depth_ob->obmat, hit.co); } @@ -4199,7 +4199,7 @@ static void objectsolver_evaluate (bConstraint *con, bConstraintOb *cob, ListBas if (data->flag & OBJECTSOLVER_ACTIVECLIP) clip= scene->clip; - if(!camob || !clip) + if (!camob || !clip) return; if (clip) { @@ -4208,7 +4208,7 @@ static void objectsolver_evaluate (bConstraint *con, bConstraintOb *cob, ListBas object= BKE_tracking_named_object(tracking, data->object); - if(object) { + if (object) { float mat[4][4], obmat[4][4], imat[4][4], cammat[4][4], camimat[4][4], parmat[4][4]; where_is_object_mat(scene, camob, cammat); @@ -4720,7 +4720,7 @@ void get_constraint_target_matrix (struct Scene *scene, bConstraint *con, int n, /* only calculate the target matrix on the first target */ ct= (bConstraintTarget *)targets.first; - while(ct && n-- > 0) + while (ct && n-- > 0) ct= ct->next; if (ct) { |