summaryrefslogtreecommitdiff
path: root/indra/llmeshoptimizer/llmeshoptimizer.cpp
blob: d79be48cf846488653bc854c65f1062cda64614b (plain)
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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
 /**
* @file llmeshoptimizer.cpp
* @brief Wrapper around meshoptimizer
*
* $LicenseInfo:firstyear=2021&license=viewerlgpl$
* Second Life Viewer Source Code
* Copyright (C) 2021, Linden Research, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation;
* version 2.1 of the License only.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
*
* Linden Research, Inc., 945 Battery Street, San Francisco, CA  94111  USA
* $/LicenseInfo$
*/

#include "llmeshoptimizer.h"

#include "meshoptimizer.h"

#include "llmath.h"
#include "v2math.h"

LLMeshOptimizer::LLMeshOptimizer()
{
    // Todo: Looks like for memory management, we can add allocator and deallocator callbacks
    // Should be one time
    // meshopt_setAllocator(allocate, deallocate);
}

LLMeshOptimizer::~LLMeshOptimizer()
{
}

//static
void LLMeshOptimizer::generateShadowIndexBufferU32(U32 *destination,
    const U32 *indices,
    U64 index_count,
    const LLVector4a * vertex_positions,
    const LLVector4a * normals,
    const LLVector2 * text_coords,
    U64 vertex_count
)
{
    meshopt_Stream streams[3];

    S32 index = 0;
    if (vertex_positions)
    {
        streams[index].data = (const float*)vertex_positions;
        // Despite being LLVector4a, only x, y and z are in use
        streams[index].size = sizeof(F32) * 3;
        streams[index].stride = sizeof(F32) * 4;
        index++;
    }
    if (normals)
    {
        streams[index].data = (const float*)normals;
        streams[index].size = sizeof(F32) * 3;
        streams[index].stride = sizeof(F32) * 4;
        index++;
    }
    if (text_coords)
    {
        streams[index].data = (const float*)text_coords;
        streams[index].size = sizeof(F32) * 2;
        streams[index].stride = sizeof(F32) * 2;
        index++;
    }

    if (index == 0)
    {
        // invalid
        return;
    }

    meshopt_generateShadowIndexBufferMulti<unsigned int>(destination,
        indices,
        index_count,
        vertex_count,
        streams,
        index
        );
}

//static
void LLMeshOptimizer::generateShadowIndexBufferU16(U16 *destination,
    const U16 *indices,
    U64 index_count,
    const LLVector4a * vertex_positions,
    const LLVector4a * normals,
    const LLVector2 * text_coords,
    U64 vertex_count
)
{
    meshopt_Stream streams[3];

    S32 index = 0;
    if (vertex_positions)
    {
        streams[index].data = (const float*)vertex_positions;
        streams[index].size = sizeof(F32) * 3;
        streams[index].stride = sizeof(F32) * 4;
        index++;
    }
    if (normals)
    {
        streams[index].data = (const float*)normals;
        streams[index].size = sizeof(F32) * 3;
        streams[index].stride = sizeof(F32) * 4;
        index++;
    }
    if (text_coords)
    {
        streams[index].data = (const float*)text_coords;
        streams[index].size = sizeof(F32) * 2;
        streams[index].stride = sizeof(F32) * 2;
        index++;
    }

    if (index == 0)
    {
        // invalid
        return;
    }

    meshopt_generateShadowIndexBufferMulti<unsigned short>(destination,
        indices,
        index_count,
        vertex_count,
        streams,
        index);
}

void LLMeshOptimizer::optimizeVertexCacheU32(U32 * destination, const U32 * indices, U64 index_count, U64 vertex_count)
{
    meshopt_optimizeVertexCache<unsigned int>(destination, indices, index_count, vertex_count);
}

void LLMeshOptimizer::optimizeVertexCacheU16(U16 * destination, const U16 * indices, U64 index_count, U64 vertex_count)
{
    meshopt_optimizeVertexCache<unsigned short>(destination, indices, index_count, vertex_count);
}

size_t LLMeshOptimizer::generateRemapMultiU32(
    unsigned int* remap,
    const U32 * indices,
    U64 index_count,
    const LLVector4a * vertex_positions,
    const LLVector4a * normals,
    const LLVector2 * text_coords,
    U64 vertex_count)
{
    meshopt_Stream streams[] = {
       {(const float*)vertex_positions, sizeof(F32) * 3, sizeof(F32) * 4},
       {(const float*)normals, sizeof(F32) * 3, sizeof(F32) * 4},
       {(const float*)text_coords, sizeof(F32) * 2, sizeof(F32) * 2},
    };

    // Remap can function without indices,
    // but providing indices helps with removing unused vertices
    U64 indeces_cmp = indices ? index_count : vertex_count;

    // meshopt_generateVertexRemapMulti will throw an assert if (indices[i] >= vertex_count)
    return meshopt_generateVertexRemapMulti(&remap[0], indices, indeces_cmp, vertex_count, streams, sizeof(streams) / sizeof(streams[0]));
}

size_t LLMeshOptimizer::generateRemapMultiU16(
    unsigned int* remap,
    const U16 * indices,
    U64 index_count,
    const LLVector4a * vertex_positions,
    const LLVector4a * normals,
    const LLVector2 * text_coords,
    U64 vertex_count)
{
    S32 out_of_range_count = 0;
    U32* indices_u32 = NULL;
    if (indices)
    {
        indices_u32 = (U32*)ll_aligned_malloc_32(index_count * sizeof(U32));
        for (U64 i = 0; i < index_count; i++)
        {
            if (indices[i] < vertex_count)
            {
                indices_u32[i] = (U32)indices[i];
            }
            else
            {
                out_of_range_count++;
                indices_u32[i] = 0;
            }
        }
    }

    if (out_of_range_count)
    {
        LL_WARNS() << out_of_range_count << " indices are out of range." << LL_ENDL;
    }

    size_t unique = generateRemapMultiU32(remap, indices_u32, index_count, vertex_positions, normals, text_coords, vertex_count);

    ll_aligned_free_32(indices_u32);

    return unique;
}

void LLMeshOptimizer::remapIndexBufferU32(U32 * destination_indices,
    const U32 * indices,
    U64 index_count,
    const unsigned int* remap)
{
    meshopt_remapIndexBuffer<unsigned int>(destination_indices, indices, index_count, remap);
}

void LLMeshOptimizer::remapIndexBufferU16(U16 * destination_indices,
    const U16 * indices,
    U64 index_count,
    const unsigned int* remap)
{
    meshopt_remapIndexBuffer<unsigned short>(destination_indices, indices, index_count, remap);
}

void LLMeshOptimizer::remapPositionsBuffer(LLVector4a * destination_vertices,
    const LLVector4a * vertex_positions,
    U64 vertex_count,
    const unsigned int* remap)
{
    meshopt_remapVertexBuffer((float*)destination_vertices, (const float*)vertex_positions, vertex_count, sizeof(LLVector4a), remap);
}

void LLMeshOptimizer::remapNormalsBuffer(LLVector4a * destination_normalss,
    const LLVector4a * normals,
    U64 mormals_count,
    const unsigned int* remap)
{
    meshopt_remapVertexBuffer((float*)destination_normalss, (const float*)normals, mormals_count, sizeof(LLVector4a), remap);
}

void LLMeshOptimizer::remapUVBuffer(LLVector2 * destination_uvs,
    const LLVector2 * uv_positions,
    U64 uv_count,
    const unsigned int* remap)
{
    meshopt_remapVertexBuffer((float*)destination_uvs, (const float*)uv_positions, uv_count, sizeof(LLVector2), remap);
}

//static
U64 LLMeshOptimizer::simplifyU32(U32 *destination,
    const U32 *indices,
    U64 index_count,
    const LLVector4a *vertex_positions,
    U64 vertex_count,
    U64 vertex_positions_stride,
    U64 target_index_count,
    F32 target_error,
    bool sloppy,
    F32* result_error
)
{
    if (sloppy)
    {
        return meshopt_simplifySloppy<unsigned int>(destination,
            indices,
            index_count,
            (const float*)vertex_positions,
            vertex_count,
            vertex_positions_stride,
            target_index_count,
            target_error,
            result_error
            );
    }
    else
    {
        return meshopt_simplify<unsigned int>(destination,
            indices,
            index_count,
            (const float*)vertex_positions,
            vertex_count,
            vertex_positions_stride,
            target_index_count,
            target_error,
#if MESHOPTIMIZER_VERSION >= 180
            0,
#endif
            result_error
            );
    }
}

//static
U64 LLMeshOptimizer::simplify(U16 *destination,
                              const U16 *indices,
                              U64 index_count,
                              const LLVector4a *vertex_positions,
                              U64 vertex_count,
                              U64 vertex_positions_stride,
                              U64 target_index_count,
                              F32 target_error,
                              bool sloppy,
                              F32* result_error
    )
{
    if (sloppy)
    {
        return meshopt_simplifySloppy<unsigned short>(destination,
            indices,
            index_count,
            (const float*)vertex_positions,
            vertex_count,
            vertex_positions_stride,
            target_index_count,
            target_error,
            result_error
            );
    }
    else
    {
        return meshopt_simplify<unsigned short>(destination,
            indices,
            index_count,
            (const float*)vertex_positions,
            vertex_count,
            vertex_positions_stride,
            target_index_count,
            target_error,
#if MESHOPTIMIZER_VERSION >= 180
            0,
#endif
            result_error
            );
    }
}