-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathtest_sorting.cpp
More file actions
246 lines (201 loc) · 6.59 KB
/
Copy pathtest_sorting.cpp
File metadata and controls
246 lines (201 loc) · 6.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
#include "test_sorting.hpp"
#include <cstdint>
#include <cstdio>
#include <vector>
#include <random>
#include <ctime>
#include <algorithm>
std::size_t const COUNT(100000000);
struct DrawElementsIndirectCommand
{
std::uint32_t primitiveCount;
std::uint32_t instanceCount;
std::uint32_t firstIndex;
std::int32_t baseVertex;
std::uint32_t baseInstance;
};
bool less(DrawElementsIndirectCommand const & a, DrawElementsIndirectCommand const & b)
{
return a.firstIndex < b.firstIndex;
}
struct DrawElementsIndirectCommandCache
{
std::uint32_t primitiveCount;
std::uint32_t firstIndex;
};
bool less_cache(DrawElementsIndirectCommandCache const & a, DrawElementsIndirectCommandCache const & b)
{
return a.firstIndex < b.firstIndex;
}
void test_sorting_elements_SoA()
{
// Generating the test data
std::random_device Rd;
std::mt19937 Gen(Rd());
std::uniform_int_distribution<std::uint32_t> PrimRand(1, 6);
std::uniform_int_distribution<std::uint32_t> FirstRand(0, 1);
std::uniform_int_distribution<std::uint32_t> OffsetRand(1, 6);
std::vector<DrawElementsIndirectCommand> Data(COUNT);
Data[0].primitiveCount = PrimRand(Gen) * 3;
Data[0].instanceCount = 1;
Data[0].firstIndex = FirstRand(Gen) == 0 ? 0 : PrimRand(Gen);
Data[0].baseVertex = 0;
Data[0].baseInstance = 0;
for(std::size_t i = 1; i < Data.size(); ++i)
{
Data[i].primitiveCount = PrimRand(Gen) * 3;
Data[i].instanceCount = 1;
Data[i].firstIndex = Data[i - 1].firstIndex + Data[i - 1].primitiveCount + (std::rand() % 10 ? 0 : OffsetRand(Gen));
Data[i].baseVertex = 0;
Data[i].baseInstance = 0;
}
// Randomize the data
std::uniform_int_distribution<std::uint32_t> DataRand(0, Data.size() - 1);
for(std::size_t i = 0; i < Data.size(); ++i)
{
DrawElementsIndirectCommand Temp;
Temp.primitiveCount = Data[i].primitiveCount;
Temp.instanceCount = Data[i].instanceCount;
Temp.firstIndex = Data[i].firstIndex;
Temp.baseVertex = Data[i].baseVertex;
Temp.baseInstance = Data[i].baseInstance;
std::uint32_t SwapIndex = DataRand(Gen);
Data[i].primitiveCount = Data[SwapIndex].primitiveCount;
Data[i].instanceCount = Data[SwapIndex].instanceCount;
Data[i].firstIndex = Data[SwapIndex].firstIndex;
Data[i].baseVertex = Data[SwapIndex].baseVertex;
Data[i].baseInstance = Data[SwapIndex].baseInstance;
Data[SwapIndex].primitiveCount = Temp.primitiveCount;
Data[SwapIndex].instanceCount = Temp.instanceCount;
Data[SwapIndex].firstIndex = Temp.firstIndex;
Data[SwapIndex].baseVertex = Temp.baseVertex;
Data[SwapIndex].baseInstance = Temp.baseInstance;
}
{
// Actual testing
std::clock_t TimeStart = std::clock();
// Reording the draws
std::sort(Data.begin(), Data.end(), less);
std::clock_t TimeEnd = std::clock();
printf("Repack - sort: %lu ms\n", (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
// Packing the draws
std::clock_t TimeStart = std::clock();
std::size_t j = 0;
{
for(std::size_t i = 1; i < Data.size(); ++i)
{
if(Data[j].firstIndex + Data[j].primitiveCount == Data[i].firstIndex)
{
Data[j].primitiveCount += Data[i].primitiveCount;
}
else
{
++j;
Data[j].primitiveCount = Data[i].primitiveCount;
Data[j].instanceCount = Data[i].instanceCount;
Data[j].firstIndex = Data[i].firstIndex;
Data[j].baseVertex = Data[i].baseVertex;
Data[j].baseInstance = Data[i].baseInstance;
}
}
std::clock_t TimeEnd = std::clock();
printf("Repack - pack(%lu): %lu ms\n", j, (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
{
std::clock_t TimeStart = std::clock();
//std::vector<DrawElementsIndirectCommand> Result(j + 1);
//memcpy(&Result[0], &Data[0], Result.size() * sizeof(DrawElementsIndirectCommand));
Data.resize(j + 1);
Data.shrink_to_fit();
std::clock_t TimeEnd = std::clock();
printf("Repack - shrink: %lu ms\n", (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
}
void test_sorting_elements_SoA_cache()
{
// Generating the test data
std::random_device Rd;
std::mt19937 Gen(Rd());
std::uniform_int_distribution<std::uint32_t> PrimRand(1, 6);
std::uniform_int_distribution<std::uint32_t> FirstRand(0, 1);
std::uniform_int_distribution<std::uint32_t> OffsetRand(1, 6);
std::vector<DrawElementsIndirectCommandCache> Data(COUNT);
Data[0].primitiveCount = PrimRand(Gen) * 3;
Data[0].firstIndex = FirstRand(Gen) == 0 ? 0 : PrimRand(Gen);
for(std::size_t i = 1; i < Data.size(); ++i)
{
Data[i].primitiveCount = PrimRand(Gen) * 3;
Data[i].firstIndex = Data[i - 1].firstIndex + Data[i - 1].primitiveCount + (std::rand() % 10 ? 0 : OffsetRand(Gen));
}
// Randomize the data
std::uniform_int_distribution<std::uint32_t> DataRand(0, Data.size() - 1);
for(std::size_t i = 0; i < Data.size(); ++i)
{
DrawElementsIndirectCommandCache Temp;
Temp.primitiveCount = Data[i].primitiveCount;
Temp.firstIndex = Data[i].firstIndex;
std::uint32_t SwapIndex = DataRand(Gen);
Data[i].primitiveCount = Data[SwapIndex].primitiveCount;
Data[i].firstIndex = Data[SwapIndex].firstIndex;
Data[SwapIndex].primitiveCount = Temp.primitiveCount;
Data[SwapIndex].firstIndex = Temp.firstIndex;
}
{
// Actual testing
std::clock_t TimeStart = std::clock();
// Reording the draws
std::sort(Data.begin(), Data.end(), less_cache);
std::clock_t TimeEnd = std::clock();
printf("Cached - sort: %lu ms\n", (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
// Packing the draws
std::clock_t TimeStart = std::clock();
std::size_t j = 0;
{
for(std::size_t i = 1; i < Data.size(); ++i)
{
if(Data[j].firstIndex + Data[j].primitiveCount == Data[i].firstIndex)
{
Data[j].primitiveCount += Data[i].primitiveCount;
}
else
{
++j;
Data[j].primitiveCount = Data[i].primitiveCount;
Data[j].firstIndex = Data[i].firstIndex;
}
}
std::clock_t TimeEnd = std::clock();
printf("Cached - pack(%lu): %lu ms\n", j, (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
{
std::clock_t TimeStart = std::clock();
//std::vector<DrawElementsIndirectCommand> Result(j + 1);
//memcpy(&Result[0], &Data[0], Result.size() * sizeof(DrawElementsIndirectCommand));
Data.resize(j + 1);
Data.shrink_to_fit();
std::clock_t TimeEnd = std::clock();
printf("Cached - shrink: %lu ms\n", (TimeEnd - TimeStart) * 1000 / CLOCKS_PER_SEC);
}
}
struct DrawArraysIndirectCommand
{
std::uint32_t count;
std::uint32_t primCount;
std::uint32_t first;
std::uint32_t baseInstance;
};
void test_sorting_arrays_SoA()
{
std::vector<DrawArraysIndirectCommand> Input(COUNT);
}
void test_sorting()
{
test_sorting_elements_SoA();
test_sorting_elements_SoA_cache();
test_sorting_elements_SoA();
test_sorting_elements_SoA_cache();
//test_sorting_arrays_SoA();
return;
}