File: halton.ih

package info (click to toggle)
ospray 3.2.0-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 10,040 kB
  • sloc: cpp: 80,569; ansic: 951; sh: 805; makefile: 171; python: 69
file content (88 lines) | stat: -rw-r--r-- 3,299 bytes parent folder | download | duplicates (2)
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// Copyright 2020 Intel Corporation
// SPDX-License-Identifier: Apache-2.0

// Copyright (c) 2012 Leonhard Gruenschloss (leonhard@gruenschloss.org)
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

#pragma once

#include "rkcommon/math/math.ih"

OSPRAY_BEGIN_ISPC_NAMESPACE

#ifdef OSPRAY_TARGET_SYCL
#include "halton.inl"
#else
extern const uniform unsigned int halton_perm3[243];
extern const uniform unsigned int halton_perm5[125];
extern const uniform unsigned int halton_perm7[343];
#endif

inline uint32 reverseBits(uint32 index)
{
  index = (index << 16) | (index >> 16);
  index = ((index & 0x00ff00ff) << 8) | ((index & 0xff00ff00) >> 8);
  index = ((index & 0x0f0f0f0f) << 4) | ((index & 0xf0f0f0f0) >> 4);
  index = ((index & 0x33333333) << 2) | ((index & 0xcccccccc) >> 2);
  index = ((index & 0x55555555) << 1) | ((index & 0xaaaaaaaa) >> 1);

  return index;
}

inline float Halton_sample2(uint32 index)
{
  return to_float_unorm(reverseBits(index));
}

inline float Halton_sample3(const unsigned int index)
{
  // Mirek note:
  // with normalization using 1.f instead of original 0x1.fffffcp-1
  // it generates results closer to the plain iterative implementation,
  // (before results were usually smaller by 1-2 ULPs)
  // but on the other hand results may be equal to 1.f, so the range
  // [0-1) is not guaranteed
  return (halton_perm3[index % 243u] * 14348907u
             + halton_perm3[(index / 243u) % 243u] * 59049u
             + halton_perm3[(index / 59049u) % 243u] * 243u
             + halton_perm3[(index / 14348907u) % 243u])
      * (float)(1.0 / 3486784401u);
}

// Permuted Halton sequence base-5
inline float PermHalton_sample5(const unsigned int index)
{
  return (halton_perm5[index % 125u] * 1953125u
             + halton_perm5[(index / 125u) % 125u] * 15625u
             + halton_perm5[(index / 15625u) % 125u] * 125u
             + halton_perm5[(index / 1953125u) % 125u])
      * (float)(1.0 / 244140625u);
}

// Permuted Halton sequence base-7
inline float PermHalton_sample7(const unsigned int index)
{
  return (halton_perm7[index % 343u] * 117649u
             + halton_perm7[(index / 343u) % 343u] * 343u
             + halton_perm7[(index / 117649u) % 343u])
      * (float)(1.0 / 40353607u);
}

OSPRAY_END_ISPC_NAMESPACE