blomios/SoundTool
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Shader optimizations

Browse Source
This commit is contained in:
blomios
2025-10-23 07:55:29 +02:00
parent 4ef1b04156
commit 40a6d832bc
3 changed files with 133 additions and 121 deletions
Download Patch File Download Diff File Expand all files Collapse all files

226
Assets/Assets/Shader/VoxelRaycast.compute
View File

@ -52,6 +52,8 @@ struct StackEntry
int nodeIndex;
float3 center;
float halfSize;
float entry;
float exit;
};
// Buffers
@ -167,125 +169,133 @@ void CSMain(uint3 id : SV_DispatchThreadID)
root.nodeIndex = rootIndex;
root.center = rootCenter;
root.halfSize = rootHalfSize;
stack[sp++] = root;
bool hasHit = false;
StackEntry bestEntry;
// traversal
while (sp > 0)
if (IntersectAABB_fast(rootCenter, rootHalfSize, b.origin, r.direction, invDir, root.entry, root.exit))
{
StackEntry e = stack[--sp];
if (e.nodeIndex < 0 || e.nodeIndex >= nodeCount) continue;
stack[sp++] = root;
LinearNode n = nodes[e.nodeIndex];
float tEntry, tExit;
if (!IntersectAABB_fast(e.center, e.halfSize, b.origin, r.direction, invDir, tEntry, tExit)) continue;
// prune with current best
if (tEntry >= outHit.maxDistance) continue;
if (n.isLeaf == 1u)
bool hasHit = false;
StackEntry bestEntry;
// traversal
while (sp > 0)
{
if (n.isOccupied == 1u)
StackEntry e = stack[--sp];
if (e.nodeIndex < 0 || e.nodeIndex >= nodeCount) continue;
LinearNode n = nodes[e.nodeIndex];
// prune with current best
if (e.entry >= outHit.maxDistance) continue;
if (n.isLeaf == 1u)
{
float tHit = max(tEntry, 0.0);
if (tHit < outHit.maxDistance)
if (n.isOccupied == 1u)
{
// found a closer hit — commit minimal info, defer heavy ops
hasHit = true;
outHit.maxDistance = tHit;
bestEntry = e;
float tHit = max(e.entry, 0.0);
if (tHit < outHit.maxDistance)
{
// found a closer hit — commit minimal info, defer heavy ops
hasHit = true;
outHit.maxDistance = tHit;
bestEntry = e;
}
}
continue;
}
continue;
}
// Non-leaf: gather children that intersect and their tEntry (small array)
uint childMask = n.childMask;
// small local arrays
float childT[8];
int childIdx[8];
float3 childCenter[8];
int childCount = 0;
float childHalf = e.halfSize * 0.5;
for (uint i = 0; i < 8; ++i)
{
if (((childMask >> i) & 1u) == 0u) continue;
uint offset = countbits(childMask & ((1u << i) - 1u));
int cIndex = int(n.childBase + offset);
// compute child center
float3 offsetVec = childHalf * float3(
(i & 4u) ? 1.0 : -1.0,
(i & 2u) ? 1.0 : -1.0,
(i & 1u) ? 1.0 : -1.0
);
float3 cCenter = e.center + offsetVec;
// pretest intersection with child AABB to get tEntry
float ctEntry, ctExit;
if (!IntersectAABB_fast(cCenter, childHalf, b.origin, r.direction, invDir, ctEntry, ctExit)) continue;
if (ctEntry >= outHit.maxDistance) continue; // prune child if already farther than best hit
// store for near-first push
childT[childCount] = ctEntry;
childIdx[childCount] = cIndex;
childCenter[childCount] = cCenter;
// temporarily store center and half? we recompute on push
childCount++;
}
// sort children by childT ascending (insertion sort on at most 8 elements)
for (int a = 1; a < childCount; ++a)
{
float keyT = childT[a];
int keyIdx = childIdx[a];
float3 keyCenter = childCenter[a];
int j = a - 1;
while (j >= 0 && childT[j] > keyT) {
childT[j+1] = childT[j];
childIdx[j+1] = childIdx[j];
childCenter[j+1] = childCenter[j];
j--;
// Non-leaf: gather children that intersect and their entry (small array)
uint childMask = n.childMask;
// small local arrays
int childIdx[8];
float3 childCenter[8];
float childEntry[8];
float childExit[8];
int childCount = 0;
float childHalf = e.halfSize * 0.5;
for (uint i = 0; i < 8; ++i)
{
if (((childMask >> i) & 1u) == 0u) continue;
uint offset = countbits(childMask & ((1u << i) - 1u));
int cIndex = int(n.childBase + offset);
// compute child center
float3 offsetVec = childHalf * float3(
(i & 4u) ? 1.0 : -1.0,
(i & 2u) ? 1.0 : -1.0,
(i & 1u) ? 1.0 : -1.0
);
float3 cCenter = e.center + offsetVec;
// pretest intersection with child AABB to get tEntry
if (!IntersectAABB_fast(cCenter, childHalf, b.origin, r.direction, invDir, e.entry, e.exit)) continue;
if (e.entry >= outHit.maxDistance) continue; // prune child if already farther than best hit
// store for near-first push
childIdx[childCount] = cIndex;
childCenter[childCount] = cCenter;
childEntry[childCount] = e.entry;
childExit[childCount] = e.exit;
// temporarily store center and half? we recompute on push
childCount++;
}
childT[j+1] = keyT;
childIdx[j+1] = keyIdx;
childCenter[j+1] = keyCenter;
}
StackEntry childEntry;
// push children in reverse order (so the nearest is popped first) if stack has room
for (int c = childCount - 1; c >= 0; --c)
{
// push
childEntry.nodeIndex = childIdx[c];
childEntry.center = childCenter[c];
childEntry.halfSize = childHalf;
stack[sp++] = childEntry;
}
}
if (hasHit)
{
// commit heavy ops only now
float tHit = outHit.maxDistance;
if( tHit > 0 )
{
float3 hitPos = b.origin + r.direction * tHit;
// closest point
outHit.origin = ClosestPointOnAABB(hitPos, bestEntry.center, bestEntry.halfSize);
outHit.origin += outHit.origin - bestEntry.center;
// sort children by childT ascending (insertion sort on at most 8 elements)
for (int a = 1; a < childCount; ++a)
{
int keyIdx = childIdx[a];
float3 keyCenter = childCenter[a];
float keyEntry = childEntry[a];
float keyExit = childExit[a];
int j = a - 1;
while (j >= 0 && childEntry[j] > keyEntry) {
childIdx[j+1] = childIdx[j];
childCenter[j+1] = childCenter[j];
childEntry[j+1] = childEntry[j];
childExit[j+1] = childExit[j];
j--;
}
childIdx[j+1] = keyIdx;
childCenter[j+1] = keyCenter;
childEntry[j+1] = keyEntry;
childExit[j+1] = keyExit;
}
// append final
hits.Append(outHit);
StackEntry nextChildEntry;
// push children in reverse order (so the nearest is popped first) if stack has room
for (int c = childCount - 1; c >= 0; --c)
{
// push
nextChildEntry.nodeIndex = childIdx[c];
nextChildEntry.center = childCenter[c];
nextChildEntry.halfSize = childHalf;
nextChildEntry.entry = childEntry[c];
nextChildEntry.exit = childExit[c];
stack[sp++] = nextChildEntry;
}
}
if (hasHit)
{
// commit heavy ops only now
float tHit = outHit.maxDistance;
if( tHit > 0 )
{
float3 hitPos = b.origin + r.direction * tHit;
// closest point
outHit.origin = ClosestPointOnAABB(hitPos, bestEntry.center, bestEntry.halfSize);
outHit.origin += outHit.origin - bestEntry.center;
// append final
hits.Append(outHit);
}
}
}
}

2
Assets/Scripts/Debug/Player.cs
View File

@ -24,7 +24,7 @@ public class Player : MonoBehaviour
VoxelRaycastGPU.Ray[] rays = new VoxelRaycastGPU.Ray[rayCount];
FillRaysArray(rays);
voxelManager.gpuRayCaster.Init(rayCount, rays, 3);
voxelManager.gpuRayCaster.Init(rayCount, rays, 5);
}
void Cast( ref VoxelRaycastGPU.BatchData[] batchData, int batchCount, int iIteration )

26
Assets/Scripts/VoxelOctree/GPU/VoxelRaycastGpuManager.cs
View File

@ -95,18 +95,20 @@ public class VoxelRaycastGpuManager
countBuffer.GetData(countArr);
currentCount = countArr[0];
sw.Stop();
VoxelRaycastGPU.BatchData[] hits = new VoxelRaycastGPU.BatchData[currentCount];
hitBuffer.GetData(hits, 0, 0, currentCount);
for( int i = 0; i < hits.Length; i++ )
{
GameObject sphere = GameObject.CreatePrimitive(PrimitiveType.Sphere);
sphere.transform.position = hits[i].origin;
sphere.transform.localScale = Vector3.one * 0.5f;
}
sw.Start();
/**
sw.Stop();
VoxelRaycastGPU.BatchData[] hits = new VoxelRaycastGPU.BatchData[currentCount];
hitBuffer.GetData(hits, 0, 0, currentCount);
for( int i = 0; i < hits.Length; i++ )
{
GameObject sphere = GameObject.CreatePrimitive(PrimitiveType.Sphere);
sphere.transform.position = hits[i].origin;
sphere.transform.localScale = Vector3.one * 0.5f;
}
sw.Start();
*/
iteration++;