Merge pull request #28197 from akien-mga/3.0-drop-thekla-rand48
thekla_atlas: Drop potentially GPL'ed nvmath/Rand48 code
This commit is contained in:
commit
adadff09b8
|
@ -346,7 +346,10 @@ License: Expat
|
|||
Files: ./thirdparty/thekla_atlas/
|
||||
Comment: Thekla Atlas
|
||||
Copyright: 2013, Thekla, Inc
|
||||
License: Expat
|
||||
2009-2017, Ignacio Castaño
|
||||
2007-2009, NVIDIA Corporation
|
||||
2004, Brian Hook
|
||||
License: Expat and BSD-3-clause
|
||||
|
||||
Files: ./thirdparty/tinyexr/
|
||||
Comment: TinyEXR
|
||||
|
|
|
@ -440,10 +440,11 @@ comments and a patch is provided in the squish/ folder.
|
|||
Files extracted from the upstream source:
|
||||
|
||||
- Relevant sources from src/
|
||||
- License.txt
|
||||
- `LICENSE`, `ATTRIBUTION`
|
||||
|
||||
Important: Some files have Godot-made changes, those
|
||||
changes are marked with `// -- GODOT --` comments.
|
||||
changes are marked with `// -- GODOT --` comments and patches
|
||||
are provided to reapply them.
|
||||
|
||||
|
||||
## tinyexr
|
||||
|
|
|
@ -0,0 +1,79 @@
|
|||
|
||||
Thekla-Atlas is based on a fork of the NVIDIA Mesh and Texture Tools:
|
||||
|
||||
https://github.com/castano/nvidia-mesh-tools
|
||||
https://github.com/castano/nvidia-texture-tools
|
||||
|
||||
which are both licensed under the MIT license:
|
||||
|
||||
Copyright (c) 2009-2017 Ignacio Castaño
|
||||
Copyright (c) 2007-2009 NVIDIA Corporation
|
||||
|
||||
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.
|
||||
|
||||
------------------------------------------------------------------------------------
|
||||
|
||||
poshlib version 1.3.001
|
||||
|
||||
Copyright (c) 2004, Brian Hook
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, are permitted provided that the following conditions are
|
||||
met:
|
||||
* Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above
|
||||
copyright notice, this list of conditions and the following
|
||||
disclaimer in the documentation and/or other materials provided
|
||||
with the distribution.
|
||||
* The names of this package'ss contributors contributors may not
|
||||
be used to endorse or promote products derived from this
|
||||
software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
------------------------------------------------------------------------------------
|
||||
|
||||
The example/test code also uses:
|
||||
|
||||
Copyright 2012-2015, Syoyo Fujita.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
------------------------------------------------------------------------------------
|
|
@ -5,12 +5,6 @@
|
|||
|
||||
using namespace nv;
|
||||
|
||||
// Statics
|
||||
const uint16 Rand48::a0 = 0xE66D;
|
||||
const uint16 Rand48::a1 = 0xDEEC;
|
||||
const uint16 Rand48::a2 = 0x0005;
|
||||
const uint16 Rand48::c0 = 0x000B;
|
||||
|
||||
|
||||
/// Get a random seed based on the current time.
|
||||
uint Rand::randomSeed()
|
||||
|
|
|
@ -283,94 +283,6 @@ namespace nv
|
|||
|
||||
};
|
||||
|
||||
|
||||
/** Random number implementation from the GNU Sci. Lib. (GSL).
|
||||
* Adapted from Nicholas Chapman version:
|
||||
*
|
||||
* Copyright (C) 1996, 1997, 1998, 1999, 2000 James Theiler, Brian Gough
|
||||
* This is the Unix rand48() generator. The generator returns the
|
||||
* upper 32 bits from each term of the sequence,
|
||||
*
|
||||
* x_{n+1} = (a x_n + c) mod m
|
||||
*
|
||||
* using 48-bit unsigned arithmetic, with a = 0x5DEECE66D , c = 0xB
|
||||
* and m = 2^48. The seed specifies the upper 32 bits of the initial
|
||||
* value, x_1, with the lower 16 bits set to 0x330E.
|
||||
*
|
||||
* The theoretical value of x_{10001} is 244131582646046.
|
||||
*
|
||||
* The period of this generator is ? FIXME (probably around 2^48).
|
||||
*/
|
||||
class Rand48 : public Rand
|
||||
{
|
||||
public:
|
||||
|
||||
Rand48( time_e )
|
||||
{
|
||||
seed(randomSeed());
|
||||
}
|
||||
|
||||
Rand48( uint s = 0x1234ABCD )
|
||||
{
|
||||
seed(s);
|
||||
}
|
||||
|
||||
|
||||
/** Set the given seed. */
|
||||
virtual void seed( uint s ) {
|
||||
vstate.x0 = 0x330E;
|
||||
vstate.x1 = uint16(s & 0xFFFF);
|
||||
vstate.x2 = uint16((s >> 16) & 0xFFFF);
|
||||
}
|
||||
|
||||
/** Get a random number. */
|
||||
virtual uint get() {
|
||||
|
||||
advance();
|
||||
|
||||
uint x1 = vstate.x1;
|
||||
uint x2 = vstate.x2;
|
||||
return (x2 << 16) + x1;
|
||||
}
|
||||
|
||||
|
||||
private:
|
||||
|
||||
void advance()
|
||||
{
|
||||
/* work with unsigned long ints throughout to get correct integer
|
||||
promotions of any unsigned short ints */
|
||||
const uint32 x0 = vstate.x0;
|
||||
const uint32 x1 = vstate.x1;
|
||||
const uint32 x2 = vstate.x2;
|
||||
|
||||
uint32 a;
|
||||
a = a0 * x0 + c0;
|
||||
|
||||
vstate.x0 = uint16(a & 0xFFFF);
|
||||
a >>= 16;
|
||||
|
||||
/* although the next line may overflow we only need the top 16 bits
|
||||
in the following stage, so it does not matter */
|
||||
|
||||
a += a0 * x1 + a1 * x0;
|
||||
vstate.x1 = uint16(a & 0xFFFF);
|
||||
|
||||
a >>= 16;
|
||||
a += a0 * x2 + a1 * x1 + a2 * x0;
|
||||
vstate.x2 = uint16(a & 0xFFFF);
|
||||
}
|
||||
|
||||
|
||||
private:
|
||||
NVMATH_API static const uint16 a0, a1, a2, c0;
|
||||
|
||||
struct rand48_state_t {
|
||||
uint16 x0, x1, x2;
|
||||
} vstate;
|
||||
|
||||
};
|
||||
|
||||
} // nv namespace
|
||||
|
||||
#endif // NV_MATH_RANDOM_H
|
||||
|
|
|
@ -0,0 +1,116 @@
|
|||
diff --git a/thirdparty/thekla_atlas/nvmath/Random.cpp b/thirdparty/thekla_atlas/nvmath/Random.cpp
|
||||
index 1a60e7f5e..bb7a1df6f 100644
|
||||
--- a/thirdparty/thekla_atlas/nvmath/Random.cpp
|
||||
+++ b/thirdparty/thekla_atlas/nvmath/Random.cpp
|
||||
@@ -5,12 +5,6 @@
|
||||
|
||||
using namespace nv;
|
||||
|
||||
-// Statics
|
||||
-const uint16 Rand48::a0 = 0xE66D;
|
||||
-const uint16 Rand48::a1 = 0xDEEC;
|
||||
-const uint16 Rand48::a2 = 0x0005;
|
||||
-const uint16 Rand48::c0 = 0x000B;
|
||||
-
|
||||
|
||||
/// Get a random seed based on the current time.
|
||||
uint Rand::randomSeed()
|
||||
diff --git a/thirdparty/thekla_atlas/nvmath/Random.h b/thirdparty/thekla_atlas/nvmath/Random.h
|
||||
index 223292706..37bffb70b 100644
|
||||
--- a/thirdparty/thekla_atlas/nvmath/Random.h
|
||||
+++ b/thirdparty/thekla_atlas/nvmath/Random.h
|
||||
@@ -283,94 +283,6 @@ namespace nv
|
||||
|
||||
};
|
||||
|
||||
-
|
||||
- /** Random number implementation from the GNU Sci. Lib. (GSL).
|
||||
- * Adapted from Nicholas Chapman version:
|
||||
- *
|
||||
- * Copyright (C) 1996, 1997, 1998, 1999, 2000 James Theiler, Brian Gough
|
||||
- * This is the Unix rand48() generator. The generator returns the
|
||||
- * upper 32 bits from each term of the sequence,
|
||||
- *
|
||||
- * x_{n+1} = (a x_n + c) mod m
|
||||
- *
|
||||
- * using 48-bit unsigned arithmetic, with a = 0x5DEECE66D , c = 0xB
|
||||
- * and m = 2^48. The seed specifies the upper 32 bits of the initial
|
||||
- * value, x_1, with the lower 16 bits set to 0x330E.
|
||||
- *
|
||||
- * The theoretical value of x_{10001} is 244131582646046.
|
||||
- *
|
||||
- * The period of this generator is ? FIXME (probably around 2^48).
|
||||
- */
|
||||
- class Rand48 : public Rand
|
||||
- {
|
||||
- public:
|
||||
-
|
||||
- Rand48( time_e )
|
||||
- {
|
||||
- seed(randomSeed());
|
||||
- }
|
||||
-
|
||||
- Rand48( uint s = 0x1234ABCD )
|
||||
- {
|
||||
- seed(s);
|
||||
- }
|
||||
-
|
||||
-
|
||||
- /** Set the given seed. */
|
||||
- virtual void seed( uint s ) {
|
||||
- vstate.x0 = 0x330E;
|
||||
- vstate.x1 = uint16(s & 0xFFFF);
|
||||
- vstate.x2 = uint16((s >> 16) & 0xFFFF);
|
||||
- }
|
||||
-
|
||||
- /** Get a random number. */
|
||||
- virtual uint get() {
|
||||
-
|
||||
- advance();
|
||||
-
|
||||
- uint x1 = vstate.x1;
|
||||
- uint x2 = vstate.x2;
|
||||
- return (x2 << 16) + x1;
|
||||
- }
|
||||
-
|
||||
-
|
||||
- private:
|
||||
-
|
||||
- void advance()
|
||||
- {
|
||||
- /* work with unsigned long ints throughout to get correct integer
|
||||
- promotions of any unsigned short ints */
|
||||
- const uint32 x0 = vstate.x0;
|
||||
- const uint32 x1 = vstate.x1;
|
||||
- const uint32 x2 = vstate.x2;
|
||||
-
|
||||
- uint32 a;
|
||||
- a = a0 * x0 + c0;
|
||||
-
|
||||
- vstate.x0 = uint16(a & 0xFFFF);
|
||||
- a >>= 16;
|
||||
-
|
||||
- /* although the next line may overflow we only need the top 16 bits
|
||||
- in the following stage, so it does not matter */
|
||||
-
|
||||
- a += a0 * x1 + a1 * x0;
|
||||
- vstate.x1 = uint16(a & 0xFFFF);
|
||||
-
|
||||
- a >>= 16;
|
||||
- a += a0 * x2 + a1 * x1 + a2 * x0;
|
||||
- vstate.x2 = uint16(a & 0xFFFF);
|
||||
- }
|
||||
-
|
||||
-
|
||||
- private:
|
||||
- NVMATH_API static const uint16 a0, a1, a2, c0;
|
||||
-
|
||||
- struct rand48_state_t {
|
||||
- uint16 x0, x1, x2;
|
||||
- } vstate;
|
||||
-
|
||||
- };
|
||||
-
|
||||
} // nv namespace
|
||||
|
||||
#endif // NV_MATH_RANDOM_H
|
Loading…
Reference in New Issue