Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
115 lines
2.2 KiB
C
115 lines
2.2 KiB
C
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*/
|
|
|
|
#include "BLI_utildefines.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/**
|
|
* Jenkins Lookup3 Hash Functions.
|
|
* Source: http://burtleburtle.net/bob/c/lookup3.c
|
|
*/
|
|
|
|
#define rot(x, k) (((x) << (k)) | ((x) >> (32 - (k))))
|
|
#define final(a, b, c) \
|
|
{ \
|
|
c ^= b; \
|
|
c -= rot(b, 14); \
|
|
a ^= c; \
|
|
a -= rot(c, 11); \
|
|
b ^= a; \
|
|
b -= rot(a, 25); \
|
|
c ^= b; \
|
|
c -= rot(b, 16); \
|
|
a ^= c; \
|
|
a -= rot(c, 4); \
|
|
b ^= a; \
|
|
b -= rot(a, 14); \
|
|
c ^= b; \
|
|
c -= rot(b, 24); \
|
|
} \
|
|
((void)0)
|
|
|
|
BLI_INLINE unsigned int BLI_hash_int_3d(unsigned int kx, unsigned int ky, unsigned int kz)
|
|
{
|
|
unsigned int a, b, c;
|
|
a = b = c = 0xdeadbeef + (3 << 2) + 13;
|
|
|
|
c += kz;
|
|
b += ky;
|
|
a += kx;
|
|
final(a, b, c);
|
|
|
|
return c;
|
|
}
|
|
|
|
BLI_INLINE unsigned int BLI_hash_int_2d(unsigned int kx, unsigned int ky)
|
|
{
|
|
unsigned int a, b, c;
|
|
|
|
a = b = c = 0xdeadbeef + (2 << 2) + 13;
|
|
a += kx;
|
|
b += ky;
|
|
|
|
final(a, b, c);
|
|
|
|
return c;
|
|
}
|
|
|
|
#undef final
|
|
#undef rot
|
|
|
|
BLI_INLINE unsigned int BLI_hash_string(const char *str)
|
|
{
|
|
unsigned int i = 0, c;
|
|
|
|
while ((c = *str++)) {
|
|
i = i * 37 + c;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
BLI_INLINE float BLI_hash_int_2d_to_float(uint32_t kx, uint32_t ky)
|
|
{
|
|
return (float)BLI_hash_int_2d(kx, ky) / (float)0xFFFFFFFFu;
|
|
}
|
|
|
|
BLI_INLINE float BLI_hash_int_3d_to_float(uint32_t kx, uint32_t ky, uint32_t kz)
|
|
{
|
|
return (float)BLI_hash_int_3d(kx, ky, kz) / (float)0xFFFFFFFFu;
|
|
}
|
|
|
|
BLI_INLINE unsigned int BLI_hash_int(unsigned int k)
|
|
{
|
|
return BLI_hash_int_2d(k, 0);
|
|
}
|
|
|
|
BLI_INLINE float BLI_hash_int_01(unsigned int k)
|
|
{
|
|
return (float)BLI_hash_int(k) * (1.0f / (float)0xFFFFFFFF);
|
|
}
|
|
|
|
BLI_INLINE void BLI_hash_pointer_to_color(const void *ptr, int *r, int *g, int *b)
|
|
{
|
|
size_t val = (size_t)ptr;
|
|
const size_t hash_a = BLI_hash_int(val & 0x0000ffff);
|
|
const size_t hash_b = BLI_hash_int((uint)((val & 0xffff0000) >> 16));
|
|
const size_t hash = hash_a ^ (hash_b + 0x9e3779b9 + (hash_a << 6) + (hash_a >> 2));
|
|
*r = (hash & 0xff0000) >> 16;
|
|
*g = (hash & 0x00ff00) >> 8;
|
|
*b = hash & 0x0000ff;
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|