Jacques Lucke
2ffd08e952
Previously, the lifetimes of anonymous attributes were determined by reference counts which were non-deterministic when multiple threads are used. Now the lifetimes of anonymous attributes are handled more explicitly and deterministically. This is a prerequisite for any kind of caching, because caching the output of nodes that do things non-deterministically and have "invisible inputs" (reference counts) doesn't really work. For more details for how deterministic lifetimes are achieved, see D16858. No functional changes are expected. Small performance changes are expected as well (within few percent, anything larger regressions should be reported as bugs). Differential Revision: https://developer.blender.org/D16858
27 lines
744 B
C++
27 lines
744 B
C++
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
#include "BLI_function_ref.hh"
|
|
#include "BLI_index_mask.hh"
|
|
#include "BLI_virtual_array.hh"
|
|
|
|
#include "BKE_curves.hh"
|
|
|
|
namespace blender::geometry {
|
|
|
|
/**
|
|
* Add more points along each segment, with the amount of points to add in each segment described
|
|
* by the #cuts input. The new points are equidistant in parameter space, but not in the actual
|
|
* distances.
|
|
*
|
|
* \param selection: A selection of curves to consider when subdividing.
|
|
*/
|
|
bke::CurvesGeometry subdivide_curves(
|
|
const bke::CurvesGeometry &src_curves,
|
|
IndexMask selection,
|
|
const VArray<int> &cuts,
|
|
const bke::AnonymousAttributePropagationInfo &propagation_info);
|
|
|
|
} // namespace blender::geometry
|