Space Sim
Loading...
Searching...
No Matches
treecount.comp
Go to the documentation of this file.
1
2#version 440
3#define WORKGROUP_SIZE 128
4#define RADIX_SORT_BINS 128
5#define SUBGROUP_SIZE 32
6#define BODY_COUNT 15000
7#define MAX_NODES 45000
8layout (local_size_x = WORKGROUP_SIZE) in;
9
10struct Particle
11{
12 vec4 p_m;
13 vec4 mat;
14 vec4 vel;
15 vec4 acc;
16};
17layout(std430, binding=1) buffer ParticleData {
18
19 Particle p_spawn[BODY_COUNT];
20 vec4 p_colors[BODY_COUNT];
21 uint p_dead[BODY_COUNT];
22 uint claimed[BODY_COUNT];
23 int nodes_visited[BODY_COUNT];
24 uint star_particles[BODY_COUNT];
25 Particle p[];
26};
27struct MortonEntry
28{
29 uint pid;
30 uint morton;
31};
32layout(std430, binding=2) buffer MortonData {
33
34 MortonEntry entry[];
35};
36layout(std430, binding=3) buffer MortonPingData {
37
38 MortonEntry exit[];
39};
40struct Node {
41 vec4 com_m;
42 // min and size
43 vec4 min;
44 // max and next
45 vec3 max;
46 int next;
47 // left child, right child, parent, depth
48 ivec4 lrpd;
49};
50#define MAX_DEPTH 64
51layout(std430, binding=4) buffer NodeData {
52 uint ready_queue[MAX_NODES];
53 uint children_remaining[MAX_NODES];
54 uint depth_offsets[MAX_DEPTH+1];
55 uint pad0;
56 uint pad1;
57 uint pad2;
58 vec4 com_m[MAX_NODES];
59 vec4 lrsn[MAX_NODES];
60 // min and parent
61 vec4 nmin[MAX_NODES];
62 // max and depth
63 vec4 nmax[MAX_NODES];
64};
65layout(std430, binding=6) buffer NodeCounter {
66 uint queue_out;
67 int p_dead_cnt;
68 int p_spawn_cnt;
69 uint star_pcnt;
70};
71void main()
72{
73 uint id = gl_GlobalInvocationID.x;
74 if (id >= MAX_NODES) return;
75 children_remaining[id] = id < BODY_COUNT ? 0 : 2;
76 ready_queue[id] = 0;
77 com_m[id] = vec4(0, 0, 0, 0);
78 lrsn[id] = vec4(intBitsToFloat(-1), intBitsToFloat(-1), 0.0, intBitsToFloat(-1));
79 nmin[id] = vec4(0, 0, 0, intBitsToFloat(-1));
80 nmax[id] = vec4(0, 0, 0, intBitsToFloat(999));
81 if (id < MAX_DEPTH) depth_offsets[id] = 0;
82 if (id == 0)
83 {
84 nodes_visited[0] = 0;
85 queue_out = 0;
86 star_pcnt = 0;
87 depth_offsets[0] = BODY_COUNT;
88
89 }
90 if (id >= BODY_COUNT) return;
91 uint pid = entry[id].pid;
92 Particle e = p[pid];
93 nmax[id].w = intBitsToFloat(0);
94 com_m[id] = e.p_m;
95 lrsn[id].z = e.p_m.w;
96 nmin[id].xyz = e.p_m.xyz;
97 nmax[id].xyz = e.p_m.xyz;
98 if (e.p_m.w <= 0)
99 {
100 int idx = atomicAdd(p_dead_cnt, 1);
101 p_dead[idx] = pid;
102 }
103 claimed[id] = 0;
104}
layout(local_size_x=16, local_size_y=16, local_size_z=1) in
int main(int argc, char *argv[])
Definition main.c:1726
vec4 mat
Definition main.c:261
uint morton
Definition bounds.comp:32
vec3 max
Definition com22.comp:49
vec4 com_m
Definition com22.comp:45
int next
Definition com22.comp:50
ivec4 lrpd
Definition com22.comp:52
vec4 min
Definition com22.comp:47
Definition bounds.comp:30
Definition types.h:109
vec4 acc
Definition types.h:97
vec4 p_m
Definition types.h:94
vec3 vel
Definition main.h:10
Definition main.h:8
float w
Definition types.h:47
float z
Definition types.h:47
#define WORKGROUP_SIZE
Definition types.h:171
#define MAX_DEPTH
Definition types.h:154
#define BODY_COUNT
Definition types.h:39
#define MAX_NODES
Definition types.h:40
Definition types.h:47