/* * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software Foundation, * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include "BLI_array.hh" #include "BLI_index_range.hh" #include "BLI_listbase.h" #include "BLI_map.hh" #include "BLI_span.hh" #include "BLI_string_ref.hh" #include "BLI_task.hh" #include "BLI_vector.hh" #include "DNA_curve_types.h" #include "BKE_anonymous_attribute.hh" #include "BKE_curve.h" #include "BKE_spline.hh" using blender::Array; using blender::float3; using blender::float4x4; using blender::IndexRange; using blender::Map; using blender::MutableSpan; using blender::Span; using blender::StringRefNull; using blender::Vector; using blender::bke::AttributeIDRef; blender::Span CurveEval::splines() const { return splines_; } blender::MutableSpan CurveEval::splines() { return splines_; } bool CurveEval::has_spline_with_type(const Spline::Type type) const { for (const SplinePtr &spline : this->splines()) { if (spline->type() == type) { return true; } } return false; } void CurveEval::resize(const int size) { splines_.resize(size); attributes.reallocate(size); } void CurveEval::add_spline(SplinePtr spline) { splines_.append(std::move(spline)); } void CurveEval::add_splines(MutableSpan splines) { for (SplinePtr &spline : splines) { this->add_spline(std::move(spline)); } } void CurveEval::remove_splines(blender::IndexMask mask) { for (int i = mask.size() - 1; i >= 0; i--) { splines_.remove_and_reorder(mask.indices()[i]); } } void CurveEval::translate(const float3 &translation) { for (SplinePtr &spline : this->splines()) { spline->translate(translation); spline->mark_cache_invalid(); } } void CurveEval::transform(const float4x4 &matrix) { for (SplinePtr &spline : this->splines()) { spline->transform(matrix); } } bool CurveEval::bounds_min_max(float3 &min, float3 &max, const bool use_evaluated) const { bool have_minmax = false; for (const SplinePtr &spline : this->splines()) { if (spline->size()) { spline->bounds_min_max(min, max, use_evaluated); have_minmax = true; } } return have_minmax; } float CurveEval::total_length() const { float length = 0.0f; for (const SplinePtr &spline : this->splines()) { length += spline->length(); } return length; } int CurveEval::total_control_point_size() const { int count = 0; for (const SplinePtr &spline : this->splines()) { count += spline->size(); } return count; } blender::Array CurveEval::control_point_offsets() const { Array offsets(splines_.size() + 1); int offset = 0; for (const int i : splines_.index_range()) { offsets[i] = offset; offset += splines_[i]->size(); } offsets.last() = offset; return offsets; } blender::Array CurveEval::evaluated_point_offsets() const { Array offsets(splines_.size() + 1); int offset = 0; for (const int i : splines_.index_range()) { offsets[i] = offset; offset += splines_[i]->evaluated_points_size(); } offsets.last() = offset; return offsets; } blender::Array CurveEval::accumulated_spline_lengths() const { Array spline_lengths(splines_.size() + 1); float spline_length = 0.0f; for (const int i : splines_.index_range()) { spline_lengths[i] = spline_length; spline_length += splines_[i]->length(); } spline_lengths.last() = spline_length; return spline_lengths; } void CurveEval::mark_cache_invalid() { for (SplinePtr &spline : splines_) { spline->mark_cache_invalid(); } } static BezierSpline::HandleType handle_type_from_dna_bezt(const eBezTriple_Handle dna_handle_type) { switch (dna_handle_type) { case HD_FREE: return BezierSpline::HandleType::Free; case HD_AUTO: return BezierSpline::HandleType::Auto; case HD_VECT: return BezierSpline::HandleType::Vector; case HD_ALIGN: return BezierSpline::HandleType::Align; case HD_AUTO_ANIM: return BezierSpline::HandleType::Auto; case HD_ALIGN_DOUBLESIDE: return BezierSpline::HandleType::Align; } BLI_assert_unreachable(); return BezierSpline::HandleType::Auto; } static Spline::NormalCalculationMode normal_mode_from_dna_curve(const int twist_mode) { switch (twist_mode) { case CU_TWIST_Z_UP: return Spline::NormalCalculationMode::ZUp; case CU_TWIST_MINIMUM: return Spline::NormalCalculationMode::Minimum; case CU_TWIST_TANGENT: return Spline::NormalCalculationMode::Tangent; } BLI_assert_unreachable(); return Spline::NormalCalculationMode::Minimum; } static NURBSpline::KnotsMode knots_mode_from_dna_nurb(const short flag) { switch (flag & (CU_NURB_ENDPOINT | CU_NURB_BEZIER)) { case CU_NURB_ENDPOINT: return NURBSpline::KnotsMode::EndPoint; case CU_NURB_BEZIER: return NURBSpline::KnotsMode::Bezier; default: return NURBSpline::KnotsMode::Normal; } BLI_assert_unreachable(); return NURBSpline::KnotsMode::Normal; } static SplinePtr spline_from_dna_bezier(const Nurb &nurb) { std::unique_ptr spline = std::make_unique(); spline->set_resolution(nurb.resolu); spline->set_cyclic(nurb.flagu & CU_NURB_CYCLIC); Span src_points{nurb.bezt, nurb.pntsu}; spline->resize(src_points.size()); MutableSpan positions = spline->positions(); MutableSpan handle_positions_left = spline->handle_positions_left(true); MutableSpan handle_positions_right = spline->handle_positions_right(true); MutableSpan handle_types_left = spline->handle_types_left(); MutableSpan handle_types_right = spline->handle_types_right(); MutableSpan radii = spline->radii(); MutableSpan tilts = spline->tilts(); blender::threading::parallel_for(src_points.index_range(), 2048, [&](IndexRange range) { for (const int i : range) { const BezTriple &bezt = src_points[i]; positions[i] = bezt.vec[1]; handle_positions_left[i] = bezt.vec[0]; handle_types_left[i] = handle_type_from_dna_bezt((eBezTriple_Handle)bezt.h1); handle_positions_right[i] = bezt.vec[2]; handle_types_right[i] = handle_type_from_dna_bezt((eBezTriple_Handle)bezt.h2); radii[i] = bezt.radius; tilts[i] = bezt.tilt; } }); return spline; } static SplinePtr spline_from_dna_nurbs(const Nurb &nurb) { std::unique_ptr spline = std::make_unique(); spline->set_resolution(nurb.resolu); spline->set_cyclic(nurb.flagu & CU_NURB_CYCLIC); spline->set_order(nurb.orderu); spline->knots_mode = knots_mode_from_dna_nurb(nurb.flagu); Span src_points{nurb.bp, nurb.pntsu}; spline->resize(src_points.size()); MutableSpan positions = spline->positions(); MutableSpan weights = spline->weights(); MutableSpan radii = spline->radii(); MutableSpan tilts = spline->tilts(); blender::threading::parallel_for(src_points.index_range(), 2048, [&](IndexRange range) { for (const int i : range) { const BPoint &bp = src_points[i]; positions[i] = bp.vec; weights[i] = bp.vec[3]; radii[i] = bp.radius; tilts[i] = bp.tilt; } }); return spline; } static SplinePtr spline_from_dna_poly(const Nurb &nurb) { std::unique_ptr spline = std::make_unique(); spline->set_cyclic(nurb.flagu & CU_NURB_CYCLIC); Span src_points{nurb.bp, nurb.pntsu}; spline->resize(src_points.size()); MutableSpan positions = spline->positions(); MutableSpan radii = spline->radii(); MutableSpan tilts = spline->tilts(); blender::threading::parallel_for(src_points.index_range(), 2048, [&](IndexRange range) { for (const int i : range) { const BPoint &bp = src_points[i]; positions[i] = bp.vec; radii[i] = bp.radius; tilts[i] = bp.tilt; } }); return spline; } std::unique_ptr curve_eval_from_dna_curve(const Curve &dna_curve, const ListBase &nurbs_list) { Vector nurbs(nurbs_list); std::unique_ptr curve = std::make_unique(); curve->resize(nurbs.size()); MutableSpan splines = curve->splines(); blender::threading::parallel_for(nurbs.index_range(), 256, [&](IndexRange range) { for (const int i : range) { switch (nurbs[i]->type) { case CU_BEZIER: splines[i] = spline_from_dna_bezier(*nurbs[i]); break; case CU_NURBS: splines[i] = spline_from_dna_nurbs(*nurbs[i]); break; case CU_POLY: splines[i] = spline_from_dna_poly(*nurbs[i]); break; default: BLI_assert_unreachable(); break; } } }); /* Normal mode is stored separately in each spline to facilitate combining * splines from multiple curve objects, where the value may be different. */ const Spline::NormalCalculationMode normal_mode = normal_mode_from_dna_curve( dna_curve.twist_mode); for (SplinePtr &spline : curve->splines()) { spline->normal_mode = normal_mode; } return curve; } std::unique_ptr curve_eval_from_dna_curve(const Curve &dna_curve) { return curve_eval_from_dna_curve(dna_curve, *BKE_curve_nurbs_get_for_read(&dna_curve)); } void CurveEval::assert_valid_point_attributes() const { #ifdef DEBUG if (splines_.size() == 0) { return; } const int layer_len = splines_.first()->attributes.data.totlayer; Array ids_in_order(layer_len); Array meta_data_in_order(layer_len); { int i = 0; splines_.first()->attributes.foreach_attribute( [&](const AttributeIDRef &attribute_id, const AttributeMetaData &meta_data) { ids_in_order[i] = attribute_id; meta_data_in_order[i] = meta_data; i++; return true; }, ATTR_DOMAIN_POINT); } for (const SplinePtr &spline : splines_) { /* All splines should have the same number of attributes. */ BLI_assert(spline->attributes.data.totlayer == layer_len); int i = 0; spline->attributes.foreach_attribute( [&](const AttributeIDRef &attribute_id, const AttributeMetaData &meta_data) { /* Attribute names and IDs should have the same order and exist on all splines. */ BLI_assert(attribute_id == ids_in_order[i]); /* Attributes with the same ID different splines should all have the same type. */ BLI_assert(meta_data == meta_data_in_order[i]); i++; return true; }, ATTR_DOMAIN_POINT); } #endif }