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
28 lines
728 B
C++
28 lines
728 B
C++
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
#include "BLI_function_ref.hh"
|
|
#include "BLI_index_mask.hh"
|
|
|
|
#include "BKE_curves.hh"
|
|
|
|
namespace blender::geometry {
|
|
|
|
bke::CurvesGeometry fillet_curves_poly(
|
|
const bke::CurvesGeometry &src_curves,
|
|
IndexMask curve_selection,
|
|
const VArray<float> &radius,
|
|
const VArray<int> &counts,
|
|
bool limit_radius,
|
|
const bke::AnonymousAttributePropagationInfo &propagation_info);
|
|
|
|
bke::CurvesGeometry fillet_curves_bezier(
|
|
const bke::CurvesGeometry &src_curves,
|
|
IndexMask curve_selection,
|
|
const VArray<float> &radius,
|
|
bool limit_radius,
|
|
const bke::AnonymousAttributePropagationInfo &propagation_info);
|
|
|
|
} // namespace blender::geometry
|