intern/cycles/integrator/adaptive_sampling.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

/* 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