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
|
/***************************************************************************
* Copyright (C) 2016 by iCatButler *
* *
* 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; either version 2 of the License, or *
* (at your option) any later version. *
* *
* 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 for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *
***************************************************************************/
/**************************************************************************
* pgxp_gpu.c
* PGXP - Parallel/Precision Geometry Xform Pipeline
*
* Created on: 25 Mar 2016
* Author: iCatButler
***************************************************************************/
#include "pgxp_gpu.h"
#include "stdafx.h"
#include "externals.h"
#include <math.h>
typedef struct
{
float x;
float y;
float z;
unsigned int valid;
unsigned int count;
unsigned int value;
} PGXP_vertex;
const unsigned int primStrideTable[] = { 1, 2, 1, 2, 2, 3, 2, 3, 0 };
const unsigned int primCountTable[] = { 3, 3, 4, 4, 3, 3, 4, 4, 0 };
PGXP_vertex* PGXP_Mem = NULL; // pointer to parallel memory
unsigned int currentAddr = 0; // address of current DMA
unsigned int numVertices = 0; // iCB: Used for glVertex3fv fix
unsigned int vertexIdx = 0;
// Set current DMA address and pointer to parallel memory
void CALLBACK GPUpgxpMemory(unsigned int addr, unsigned char* pVRAM)
{
if (pVRAM)
PGXP_Mem = (PGXP_vertex*)(pVRAM);
currentAddr = addr;
}
// Set current DMA address
void PGXP_SetAddress(unsigned int addr)
{
currentAddr = addr;
}
void PGXP_SetMatrix(float left, float right, float bottom, float top, float zNear, float zFar)
{
GLfloat m[16];
for (unsigned int i = 0; i < 16; ++i)
m[i] = 0.f;
//if ((right-left) != 0)
//{
// m[0] = 2 / (right - left);
// m[12] = -((right + left) / (right - left));
//}
//if ((top-bottom) != 0)
//{
// m[5] = 2 / (top - bottom);
// m[13] = -((top + bottom) / (top - bottom));
//}
//m[10] = -2 / (zFar - zNear);
//m[14] = -((zFar + zNear) / (zFar - zNear));
//m[15] = 1;
if ((right-left) != 0)
{
m[0] = 2 / (right - left);
m[8] = -((right + left) / (right - left));
}
if ((top-bottom) != 0)
{
m[5] = 2 / (top - bottom);
m[9] = -((top + bottom) / (top - bottom));
}
m[10] = -2 / (zFar - zNear);
m[14] = -((zFar + zNear) / (zFar - zNear));
m[11] = 1;
glLoadMatrixf(m);
//glOrtho(left, right, bottom, top, zNear, zFar);
}
// Wrap glVertex3fv/glVertex4fv
void PGXP_glVertexfv(GLfloat* pV)
{
// If there are PGXP vertices expected
//if (vertexIdx < numVertices)
//{
float temp[4];
memcpy(temp, pV, sizeof(float) * 4);
// pre-multiply each element by w (to negate perspective divide)
for (unsigned int i = 0; i < 3; i++)
temp[i] *= temp[3];
// pass complete vertex to OpenGL
glVertex4fv(temp);
vertexIdx++;
// pV[3] = 1.f;
//}
//else
//{
// glVertex3fv(pV);
//}
}
// Get parallel vertex values
int PGXP_GetVertices(unsigned int* addr, void* pOutput, int xOffs, int yOffs)
{
unsigned int primCmd = ((*addr >> 24) & 0xff); // primitive command
unsigned int primIdx = min((primCmd - 0x20) >> 2, 8); // index to primitive lookup
OGLVertex* pVertex = (OGLVertex*)pOutput; // pointer to output vertices
unsigned int stride = primStrideTable[primIdx]; // stride between vertices
unsigned int count = primCountTable[primIdx]; // number of vertices
PGXP_vertex* primStart = NULL; // pointer to first vertex
char invalidVert = 0; // Number of vertices without valid PGXP values
float w = 0; // W coordinate of transformed vertex
if (PGXP_Mem == NULL)
return 0;
// Reset vertex count
numVertices = count;
vertexIdx = 0;
// Offset to start of primitive
primStart = &PGXP_Mem[currentAddr + 1];
// Find any invalid vertices
for (unsigned i = 0; i < count; ++i)
{
if(!primStart[stride * i].valid)
invalidVert++;
}
for (unsigned i = 0; i < count; ++i)
{
w = primStart[stride * i].z;
// If there are any invalid vertices set all w values to 1
// iCB: Could use plane equation to find w for single invalid vertex in a quad
if (invalidVert > 0)
w = 1;
if (primStart[stride * i].valid)
{
pVertex[i].x = (primStart[stride * i].x + xOffs);
pVertex[i].y = (primStart[stride * i].y + yOffs);
pVertex[i].z = 0.95f;
pVertex[i].w = w;
}
}
return 1;
}
|
