diff options
Diffstat (limited to 'source/blender/blenkernel/intern/curve.c')
| -rw-r--r-- | source/blender/blenkernel/intern/curve.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/source/blender/blenkernel/intern/curve.c b/source/blender/blenkernel/intern/curve.c index 4ac6399c4e4..7fe8834c2ec 100644 --- a/source/blender/blenkernel/intern/curve.c +++ b/source/blender/blenkernel/intern/curve.c @@ -3848,15 +3848,15 @@ static bool is_free_auto_point(BezTriple *bezt) return BEZT_IS_AUTOH(bezt) && bezt->f5 == HD_AUTOTYPE_NORMAL; } -void BKE_nurb_handle_smooth_fcurve(BezTriple *bezt, int total, bool cycle) +void BKE_nurb_handle_smooth_fcurve(BezTriple *bezt, int total, bool cyclic) { /* ignore cyclic extrapolation if end points are locked */ - cycle = cycle && is_free_auto_point(&bezt[0]) && is_free_auto_point(&bezt[total - 1]); + cyclic = cyclic && is_free_auto_point(&bezt[0]) && is_free_auto_point(&bezt[total - 1]); /* if cyclic, try to find a sequence break point */ int search_base = 0; - if (cycle) { + if (cyclic) { for (int i = 1; i < total - 1; i++) { if (!is_free_auto_point(&bezt[i])) { search_base = i; @@ -3866,7 +3866,7 @@ void BKE_nurb_handle_smooth_fcurve(BezTriple *bezt, int total, bool cycle) /* all points of the curve are freely changeable auto handles - solve as full cycle */ if (search_base == 0) { - bezier_handle_calc_smooth_fcurve(bezt, total, 0, total, cycle); + bezier_handle_calc_smooth_fcurve(bezt, total, 0, total, cyclic); return; } } @@ -3877,13 +3877,13 @@ void BKE_nurb_handle_smooth_fcurve(BezTriple *bezt, int total, bool cycle) for (int i = 1, j = start + 1; i < total; i++, j++) { /* in cyclic mode: jump from last to first point when necessary */ - if (j == total - 1 && cycle) { + if (j == total - 1 && cyclic) { j = 0; } /* non auto handle closes the list (we come here at least for the last handle, see above) */ if (!is_free_auto_point(&bezt[j])) { - bezier_handle_calc_smooth_fcurve(bezt, total, start, count + 1, cycle); + bezier_handle_calc_smooth_fcurve(bezt, total, start, count + 1, cyclic); start = j; count = 1; } @@ -3893,7 +3893,7 @@ void BKE_nurb_handle_smooth_fcurve(BezTriple *bezt, int total, bool cycle) } if (count > 1) { - bezier_handle_calc_smooth_fcurve(bezt, total, start, count, cycle); + bezier_handle_calc_smooth_fcurve(bezt, total, start, count, cyclic); } } |