When using clangd or running clang-tidy on headers there are currently many errors. These are noisy in IDEs, make auto fixes impossible, and break features like code completion, refactoring and navigation. This makes source/blender headers work by themselves, which is generally the goal anyway. But #includes and forward declarations were often incomplete. * Add #includes and forward declarations * Add IWYU pragma: export in a few places * Remove some unused #includes (but there are many more) * Tweak ShaderCreateInfo macros to work better with clangd Some types of headers still have errors, these could be fixed or worked around with more investigation. Mostly preprocessor template headers like NOD_static_types.h. Note that that disabling WITH_UNITY_BUILD is required for clangd to work properly, otherwise compile_commands.json does not contain the information for the relevant source files. For more details see the developer docs: https://developer.blender.org/docs/handbook/tooling/clangd/ Pull Request: https://projects.blender.org/blender/blender/pulls/132608
272 lines
6.5 KiB
C
272 lines
6.5 KiB
C
/* SPDX-FileCopyrightText: 2023 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \file
|
|
* \ingroup bke
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "BLI_assert.h"
|
|
#include "BLI_compiler_compat.h"
|
|
|
|
#include "CCGSubSurf_intern.h"
|
|
|
|
#include <math.h>
|
|
#include <string.h>
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
BLI_INLINE int ccg_gridsize(int level)
|
|
{
|
|
BLI_assert(level > 0);
|
|
BLI_assert(level <= CCGSUBSURF_LEVEL_MAX + 1);
|
|
return (1 << (level - 1)) + 1;
|
|
}
|
|
|
|
BLI_INLINE int ccg_edgesize(int level)
|
|
{
|
|
BLI_assert(level > 0);
|
|
BLI_assert(level <= CCGSUBSURF_LEVEL_MAX + 1);
|
|
return 1 + (1 << level);
|
|
}
|
|
|
|
BLI_INLINE int ccg_spacing(int high_level, int low_level)
|
|
{
|
|
BLI_assert(high_level > 0 && low_level > 0);
|
|
BLI_assert(high_level >= low_level);
|
|
BLI_assert((high_level - low_level) <= CCGSUBSURF_LEVEL_MAX);
|
|
return 1 << (high_level - low_level);
|
|
}
|
|
|
|
BLI_INLINE int ccg_edgebase(int level)
|
|
{
|
|
BLI_assert(level > 0);
|
|
BLI_assert(level <= CCGSUBSURF_LEVEL_MAX + 1);
|
|
return level + (1 << level) - 1;
|
|
}
|
|
|
|
/* **** */
|
|
|
|
BLI_INLINE byte *VERT_getLevelData(CCGVert *v)
|
|
{
|
|
return (byte *)(&(v)[1]);
|
|
}
|
|
|
|
BLI_INLINE byte *EDGE_getLevelData(CCGEdge *e)
|
|
{
|
|
return (byte *)(&(e)[1]);
|
|
}
|
|
|
|
BLI_INLINE CCGVert **FACE_getVerts(CCGFace *f)
|
|
{
|
|
return (CCGVert **)(&f[1]);
|
|
}
|
|
|
|
BLI_INLINE CCGEdge **FACE_getEdges(CCGFace *f)
|
|
{
|
|
return (CCGEdge **)(&(FACE_getVerts(f)[f->numVerts]));
|
|
}
|
|
|
|
BLI_INLINE byte *FACE_getCenterData(CCGFace *f)
|
|
{
|
|
return (byte *)(&(FACE_getEdges(f)[(f)->numVerts]));
|
|
}
|
|
|
|
/* **** */
|
|
|
|
BLI_INLINE void *ccg_vert_getCo(CCGVert *v, int lvl, int dataSize)
|
|
{
|
|
return &VERT_getLevelData(v)[lvl * dataSize];
|
|
}
|
|
|
|
BLI_INLINE float *ccg_vert_getNo(CCGVert *v, int lvl, int dataSize, int normalDataOffset)
|
|
{
|
|
return (float *)&VERT_getLevelData(v)[lvl * dataSize + normalDataOffset];
|
|
}
|
|
|
|
BLI_INLINE void *ccg_edge_getCo(CCGEdge *e, int lvl, int x, int dataSize)
|
|
{
|
|
int levelBase = ccg_edgebase(lvl);
|
|
return &EDGE_getLevelData(e)[dataSize * (levelBase + x)];
|
|
}
|
|
|
|
BLI_INLINE float *ccg_edge_getNo(CCGEdge *e, int lvl, int x, int dataSize, int normalDataOffset)
|
|
{
|
|
int levelBase = ccg_edgebase(lvl);
|
|
return (float *)&EDGE_getLevelData(e)[dataSize * (levelBase + x) + normalDataOffset];
|
|
}
|
|
|
|
BLI_INLINE void *ccg_face_getIECo(CCGFace *f, int lvl, int S, int x, int levels, int dataSize)
|
|
{
|
|
int maxGridSize = ccg_gridsize(levels);
|
|
int spacing = ccg_spacing(levels, lvl);
|
|
byte *gridBase = FACE_getCenterData(f) +
|
|
dataSize * (1 + S * (maxGridSize + maxGridSize * maxGridSize));
|
|
return &gridBase[dataSize * x * spacing];
|
|
}
|
|
|
|
BLI_INLINE void *ccg_face_getIENo(
|
|
CCGFace *f, int lvl, int S, int x, int levels, int dataSize, int normalDataOffset)
|
|
{
|
|
int maxGridSize = ccg_gridsize(levels);
|
|
int spacing = ccg_spacing(levels, lvl);
|
|
byte *gridBase = FACE_getCenterData(f) +
|
|
dataSize * (1 + S * (maxGridSize + maxGridSize * maxGridSize));
|
|
return &gridBase[dataSize * x * spacing + normalDataOffset];
|
|
}
|
|
|
|
BLI_INLINE void *ccg_face_getIFCo(
|
|
CCGFace *f, int lvl, int S, int x, int y, int levels, int dataSize)
|
|
{
|
|
int maxGridSize = ccg_gridsize(levels);
|
|
int spacing = ccg_spacing(levels, lvl);
|
|
byte *gridBase = FACE_getCenterData(f) +
|
|
dataSize * (1 + S * (maxGridSize + maxGridSize * maxGridSize));
|
|
return &gridBase[dataSize * (maxGridSize + (y * maxGridSize + x) * spacing)];
|
|
}
|
|
|
|
BLI_INLINE float *ccg_face_getIFNo(
|
|
CCGFace *f, int lvl, int S, int x, int y, int levels, int dataSize, int normalDataOffset)
|
|
{
|
|
int maxGridSize = ccg_gridsize(levels);
|
|
int spacing = ccg_spacing(levels, lvl);
|
|
byte *gridBase = FACE_getCenterData(f) +
|
|
dataSize * (1 + S * (maxGridSize + maxGridSize * maxGridSize));
|
|
return (float *)&gridBase[dataSize * (maxGridSize + (y * maxGridSize + x) * spacing) +
|
|
normalDataOffset];
|
|
}
|
|
|
|
BLI_INLINE int ccg_face_getVertIndex(CCGFace *f, CCGVert *v)
|
|
{
|
|
for (int i = 0; i < f->numVerts; i++) {
|
|
if (FACE_getVerts(f)[i] == v) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
BLI_INLINE int ccg_face_getEdgeIndex(CCGFace *f, CCGEdge *e)
|
|
{
|
|
for (int i = 0; i < f->numVerts; i++) {
|
|
if (FACE_getEdges(f)[i] == e) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
BLI_INLINE void *ccg_face_getIFCoEdge(
|
|
CCGFace *f, CCGEdge *e, int f_ed_idx, int lvl, int eX, int eY, int levels, int dataSize)
|
|
{
|
|
int maxGridSize = ccg_gridsize(levels);
|
|
int spacing = ccg_spacing(levels, lvl);
|
|
int x, y, cx, cy;
|
|
|
|
BLI_assert(f_ed_idx == ccg_face_getEdgeIndex(f, e));
|
|
|
|
eX = eX * spacing;
|
|
eY = eY * spacing;
|
|
if (e->v0 != FACE_getVerts(f)[f_ed_idx]) {
|
|
eX = (maxGridSize * 2 - 1) - 1 - eX;
|
|
}
|
|
y = maxGridSize - 1 - eX;
|
|
x = maxGridSize - 1 - eY;
|
|
if (x < 0) {
|
|
f_ed_idx = (f_ed_idx + f->numVerts - 1) % f->numVerts;
|
|
cx = y;
|
|
cy = -x;
|
|
}
|
|
else if (y < 0) {
|
|
f_ed_idx = (f_ed_idx + 1) % f->numVerts;
|
|
cx = -y;
|
|
cy = x;
|
|
}
|
|
else {
|
|
cx = x;
|
|
cy = y;
|
|
}
|
|
return ccg_face_getIFCo(f, levels, f_ed_idx, cx, cy, levels, dataSize);
|
|
}
|
|
|
|
BLI_INLINE void Normalize(float no[3])
|
|
{
|
|
const float length = sqrtf(no[0] * no[0] + no[1] * no[1] + no[2] * no[2]);
|
|
|
|
if (length > EPSILON) {
|
|
const float length_inv = 1.0f / length;
|
|
|
|
no[0] *= length_inv;
|
|
no[1] *= length_inv;
|
|
no[2] *= length_inv;
|
|
}
|
|
else {
|
|
NormZero(no);
|
|
}
|
|
}
|
|
|
|
/* Data layers mathematics. */
|
|
|
|
BLI_INLINE bool VertDataEqual(const float a[], const float b[], const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
if (a[i] != b[i]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
BLI_INLINE void VertDataZero(float v[], const CCGSubSurf *ss)
|
|
{
|
|
memset(v, 0, sizeof(float) * ss->meshIFC.numLayers);
|
|
}
|
|
|
|
BLI_INLINE void VertDataCopy(float dst[], const float src[], const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
dst[i] = src[i];
|
|
}
|
|
}
|
|
|
|
BLI_INLINE void VertDataAdd(float a[], const float b[], const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
a[i] += b[i];
|
|
}
|
|
}
|
|
|
|
BLI_INLINE void VertDataSub(float a[], const float b[], const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
a[i] -= b[i];
|
|
}
|
|
}
|
|
|
|
BLI_INLINE void VertDataMulN(float v[], float f, const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
v[i] *= f;
|
|
}
|
|
}
|
|
|
|
BLI_INLINE void VertDataAvg4(float v[],
|
|
const float a[],
|
|
const float b[],
|
|
const float c[],
|
|
const float d[],
|
|
const CCGSubSurf *ss)
|
|
{
|
|
for (int i = 0; i < ss->meshIFC.numLayers; i++) {
|
|
v[i] = (a[i] + b[i] + c[i] + d[i]) * 0.25f;
|
|
}
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|