ppsspp/GPU/Common/IndexGenerator.h

96 lines
3.3 KiB
C
Raw Permalink Normal View History

2013-08-17 09:23:51 +00:00
// Copyright (c) 2012- PPSSPP Project.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, version 2.0 or later versions.
// This program 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 General Public License 2.0 for more details.
// A copy of the GPL 2.0 should have been included with the program.
// If not, see http://www.gnu.org/licenses/
// Official git repository and contact information can be found at
// https://github.com/hrydgard/ppsspp and http://www.ppsspp.org/.
#pragma once
2016-04-10 08:52:51 +00:00
#include "Common/CommonTypes.h"
#include "Common/Swap.h"
#include "GPU/ge_constants.h"
2013-08-17 09:23:51 +00:00
class IndexGenerator {
2013-08-17 09:23:51 +00:00
public:
2024-10-28 16:39:49 +00:00
void Setup(u16 *indexptr) {
indsBase_ = indexptr;
inds_ = indexptr;
}
2017-01-28 11:03:45 +00:00
void Reset() {
2024-10-28 16:39:49 +00:00
inds_ = indsBase_;
2017-01-28 11:03:45 +00:00
}
static bool PrimCompatible(int prim1, int prim2) {
2017-01-28 11:03:45 +00:00
if (prim1 == GE_PRIM_INVALID || prim2 == GE_PRIM_KEEP_PREVIOUS)
return true;
return indexedPrimitiveType[prim1] == indexedPrimitiveType[prim2];
}
static GEPrimitiveType GeneralPrim(GEPrimitiveType prim) {
switch (prim) {
case GE_PRIM_LINE_STRIP: return GE_PRIM_LINES; break;
case GE_PRIM_TRIANGLE_STRIP:
case GE_PRIM_TRIANGLE_FAN: return GE_PRIM_TRIANGLES; break;
default:
return prim;
}
}
2013-08-17 09:23:51 +00:00
void AddPrim(int prim, int vertexCount, int indexOffset, bool clockwise);
2018-04-27 13:49:43 +00:00
void TranslatePrim(int prim, int numInds, const u8 *inds, int indexOffset, bool clockwise);
void TranslatePrim(int prim, int numInds, const u16_le *inds, int indexOffset, bool clockwise);
void TranslatePrim(int prim, int numInds, const u32_le *inds, int indexOffset, bool clockwise);
2013-08-17 09:23:51 +00:00
// This is really the number of generated indices, or 3x the number of triangles.
2023-10-06 14:32:59 +00:00
int VertexCount() const { return inds_ - indsBase_; }
2013-08-17 09:23:51 +00:00
private:
// Points (why index these? code simplicity)
void AddPoints(int numVerts, int indexOffset);
2013-08-17 09:23:51 +00:00
// Triangles
void AddList(int numVerts, int indexOffset, bool clockwise);
void AddStrip(int numVerts, int indexOffset, bool clockwise);
void AddFan(int numVerts, int indexOffset, bool clockwise);
2013-08-17 09:23:51 +00:00
// Lines
void AddLineList(int numVerts, int indexOffset);
void AddLineStrip(int numVerts, int indexOffset);
2013-08-17 09:23:51 +00:00
// Rectangles
void AddRectangles(int numVerts, int indexOffset);
2013-08-17 09:23:51 +00:00
// These translate already indexed lists
template <class ITypeLE>
void TranslatePoints(int numVerts, const ITypeLE *inds, int indexOffset);
template <class ITypeLE>
2018-06-05 02:39:40 +00:00
void TranslateList(int numVerts, const ITypeLE *inds, int indexOffset, bool clockwise);
template <class ITypeLE>
inline void TranslateLineList(int numVerts, const ITypeLE *inds, int indexOffset);
template <class ITypeLE>
inline void TranslateLineStrip(int numVerts, const ITypeLE *inds, int indexOffset);
template <class ITypeLE>
2018-04-27 13:49:43 +00:00
void TranslateStrip(int numVerts, const ITypeLE *inds, int indexOffset, bool clockwise);
template <class ITypeLE>
2018-06-03 14:29:50 +00:00
void TranslateFan(int numVerts, const ITypeLE *inds, int indexOffset, bool clockwise);
template <class ITypeLE>
inline void TranslateRectangles(int numVerts, const ITypeLE *inds, int indexOffset);
2013-08-17 09:23:51 +00:00
u16 *indsBase_;
u16 *inds_;
2017-01-28 11:03:45 +00:00
static const u8 indexedPrimitiveType[7];
2013-08-17 09:23:51 +00:00
};