Archived
1
0
Fork 0
forked from Mirror/Ryujinx
This repository has been archived on 2024-10-11. You can view files and clone it, but cannot push or open issues or pull requests.
jinx/Ryujinx.Graphics/QuadHelper.cs
Alex Barney 1f554c1093 Do naming refactoring on Ryujinx.Graphics (#611)
* Renaming part 1

* Renaming part 2

* Renaming part 3

* Renaming part 4

* Renaming part 5

* Renaming part 6

* Renaming part 7

* Renaming part 8

* Renaming part 9

* Renaming part 10

* General cleanup

* Thought I got all of these

* Apply #595

* Additional renaming

* Tweaks from feedback

* Rename files
2019-03-04 12:45:25 +11:00

81 lines
No EOL
2.3 KiB
C#

using System;
namespace Ryujinx.Graphics
{
static class QuadHelper
{
public static int ConvertSizeQuadsToTris(int size)
{
return size <= 0 ? 0 : (size / 4) * 6;
}
public static int ConvertSizeQuadStripToTris(int size)
{
return size <= 1 ? 0 : ((size - 2) / 2) * 6;
}
public static byte[] ConvertQuadsToTris(byte[] data, int entrySize, int count)
{
int primitivesCount = count / 4;
int quadPrimSize = 4 * entrySize;
int trisPrimSize = 6 * entrySize;
byte[] output = new byte[primitivesCount * 6 * entrySize];
for (int prim = 0; prim < primitivesCount; prim++)
{
void AssignIndex(int src, int dst, int copyCount = 1)
{
src = prim * quadPrimSize + src * entrySize;
dst = prim * trisPrimSize + dst * entrySize;
Buffer.BlockCopy(data, src, output, dst, copyCount * entrySize);
}
//0 1 2 -> 0 1 2.
AssignIndex(0, 0, 3);
//2 3 -> 3 4.
AssignIndex(2, 3, 2);
//0 -> 5.
AssignIndex(0, 5);
}
return output;
}
public static byte[] ConvertQuadStripToTris(byte[] data, int entrySize, int count)
{
int primitivesCount = (count - 2) / 2;
int quadPrimSize = 2 * entrySize;
int trisPrimSize = 6 * entrySize;
byte[] output = new byte[primitivesCount * 6 * entrySize];
for (int prim = 0; prim < primitivesCount; prim++)
{
void AssignIndex(int src, int dst, int copyCount = 1)
{
src = prim * quadPrimSize + src * entrySize + 2 * entrySize;
dst = prim * trisPrimSize + dst * entrySize;
Buffer.BlockCopy(data, src, output, dst, copyCount * entrySize);
}
//-2 -1 0 -> 0 1 2.
AssignIndex(-2, 0, 3);
//0 1 -> 3 4.
AssignIndex(0, 3, 2);
//-2 -> 5.
AssignIndex(-2, 5);
}
return output;
}
}
}