This repository has been archived on 2023-10-09. You can view files and clone it. You cannot open issues or pull requests or push a commit.
Files
blender-archive/intern/cycles/integrator/adaptive_sampling.cpp
Brecht Van Lommel 9cfc7967dd Cycles: use SPDX license headers
* Replace license text in headers with SPDX identifiers.
* Remove specific license info from outdated readme.txt, instead leave details
  to the source files.
* Add list of SPDX license identifiers used, and corresponding license texts.
* Update copyright dates while we're at it.

Ref D14069, T95597
2022-02-11 17:47:34 +01:00

59 lines
1.3 KiB
C++

/* SPDX-License-Identifier: Apache-2.0
* Copyright 2011-2022 Blender Foundation */
#include "integrator/adaptive_sampling.h"
#include "util/math.h"
CCL_NAMESPACE_BEGIN
AdaptiveSampling::AdaptiveSampling()
{
}
int AdaptiveSampling::align_samples(int start_sample, int num_samples) const
{
if (!use) {
return num_samples;
}
/*
* The naive implementation goes as following:
*
* int count = 1;
* while (!need_filter(start_sample + count - 1) && count < num_samples) {
* ++count;
* }
* return count;
*/
/* 0-based sample index at which first filtering will happen. */
const int first_filter_sample = (min_samples + 1) | (adaptive_step - 1);
/* Allow as many samples as possible until the first filter sample. */
if (start_sample + num_samples <= first_filter_sample) {
return num_samples;
}
const int next_filter_sample = max(first_filter_sample, start_sample | (adaptive_step - 1));
const int num_samples_until_filter = next_filter_sample - start_sample + 1;
return min(num_samples_until_filter, num_samples);
}
bool AdaptiveSampling::need_filter(int sample) const
{
if (!use) {
return false;
}
if (sample <= min_samples) {
return false;
}
return (sample & (adaptive_step - 1)) == (adaptive_step - 1);
}
CCL_NAMESPACE_END