2 gbajam22 entry for the Gameboy Advance
3 Copyright (C) 2022 John Tsiombikas <nuclear@mutantstargoat.com>
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <https://www.gnu.org/licenses/>.
24 #define MAT_STACK_SIZE 4
27 static int32_t mat[MAT_STACK_SIZE][16];
29 static unsigned int opt;
30 static int32_t ldir[3];
34 static void draw_ptlines(int prim, const struct xvertex *varr, int vcount);
39 xgl_viewport(0, 0, 240, 160);
42 ldir[0] = ldir[1] = 0;
46 void xgl_enable(unsigned int o)
51 void xgl_disable(unsigned int o)
56 void xgl_viewport(int x, int y, int w, int h)
64 void xgl_push_matrix(void)
68 if(mtop >= MAT_STACK_SIZE - 1) return;
71 memcpy(mat[mtop], mat[prev], sizeof mat[0]);
74 void xgl_pop_matrix(void)
79 static int32_t id[] = {
86 void xgl_load_identity(void)
88 memcpy(mat[mtop], id, sizeof mat[0]);
91 void xgl_load_matrix(const int32_t *m)
93 memcpy(mat[mtop], m, sizeof mat[0]);
96 void xgl_get_matrix(int32_t *m)
98 memcpy(m, mat[mtop], sizeof mat[0]);
101 #define M(i,j) (((i) << 2) + (j))
102 #define XMUL(a, b) (((a) >> 8) * ((b) >> 8))
103 void xgl_mult_matrix(const int32_t *m2)
107 int32_t *dest = mat[mtop];
109 memcpy(m1, dest, sizeof m1);
113 *dest++ = XMUL(m1[M(0, j)], m2[M(i, 0)]) +
114 XMUL(m1[M(1, j)], m2[M(i, 1)]) +
115 XMUL(m1[M(2, j)], m2[M(i, 2)]) +
116 XMUL(m1[M(3, j)], m2[M(i, 3)]);
122 #define XSIN(x) (int32_t)(sin(x / 65536.0f) * 65536.0f)
123 #define XCOS(x) (int32_t)(cos(x / 65536.0f) * 65536.0f)
125 void xgl_translate(int32_t x, int32_t y, int32_t z)
127 int32_t m[16] = {0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000};
134 void xgl_rotate_x(int32_t angle)
136 int32_t m[16] = {0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000};
137 int32_t sa = XSIN(angle);
138 int32_t ca = XCOS(angle);
146 void xgl_rotate_y(int32_t angle)
148 int32_t m[16] = {0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000};
149 int32_t sa = XSIN(angle);
150 int32_t ca = XCOS(angle);
158 void xgl_rotate_z(int32_t angle)
160 int32_t m[16] = {0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000, 0, 0, 0, 0, 0x10000};
161 int32_t sa = XSIN(angle);
162 int32_t ca = XCOS(angle);
170 void xgl_scale(int32_t x, int32_t y, int32_t z)
180 void xgl_index(int cidx)
185 static void xform(struct xvertex *out, const struct xvertex *in, const int32_t *m)
187 out->x = XMUL(m[0], in->x) + XMUL(m[4], in->y) + XMUL(m[8], in->z) + m[12];
188 out->y = XMUL(m[1], in->x) + XMUL(m[5], in->y) + XMUL(m[9], in->z) + m[13];
189 out->z = XMUL(m[2], in->x) + XMUL(m[6], in->y) + XMUL(m[10], in->z) + m[14];
192 static void xform_norm(struct xvertex *out, const struct xvertex *in, const int32_t *m)
194 out->nx = XMUL(m[0], in->nx) + XMUL(m[4], in->ny) + XMUL(m[8], in->nz);
195 out->ny = XMUL(m[1], in->nx) + XMUL(m[5], in->ny) + XMUL(m[9], in->nz);
196 out->nz = XMUL(m[2], in->nx) + XMUL(m[6], in->ny) + XMUL(m[10], in->nz);
199 /* d = 1.0 / tan(fov/2) */
200 #define PROJ_D 0x20000
202 #define NEAR_Z 0x18000
204 void xgl_draw(int prim, const struct xvertex *varr, int vcount)
206 int i, cidx, clipnum;
207 struct xvertex xv[4], xvclip[8];
208 struct pvertex pv[4];
212 draw_ptlines(prim, varr, vcount);
216 while(vcount >= prim) {
217 cidx = cur_cidx;//varr->cidx;
219 xform(xv, varr, mat[mtop]);
220 xform_norm(xv, varr, mat[mtop]);
223 if(opt & XGL_LIGHTING) {
224 ndotl = (xv->nx >> 8) * ldir[0] + (xv->ny >> 8) * ldir[1] + (xv->nz >> 8) * ldir[2];
225 if(ndotl < 0) ndotl = 0;
226 cidx = 128 + (ndotl >> 9);
227 if(cidx > 255) cidx = 255;
231 /* transform the rest of the vertices to view space */
232 for(i=1; i<prim; i++) {
233 xform(xv + i, varr + i, mat[mtop]);
236 /* clip against near plane */
237 xgl_clip_near(xvclip, &clipnum, xv, prim);
239 for(i=0; i<clipnum; i++) {
240 xvclip[i].x = (xvclip[i].x << 1) / (xvclip[i].z >> 8); /* assume aspect: ~2 */
241 xvclip[i].y = (xvclip[i].y << 2) / (xvclip[i].z >> 8); /* the shift is * PROJ_D */
242 /* transform result is 24.8 */
244 pv[i].x = (((xvclip[i].x + 0x100) >> 1) * vp[2]) + (vp[0] << 8);
245 pv[i].y = (((0x100 - xvclip[i].y) >> 1) * vp[3]) + (vp[1] << 8);
248 polyfill_flat(pv, clipnum, cidx);
255 void xgl_transform(const struct xvertex *vin, int *x, int *y)
258 xform(&v, vin, mat[mtop]);
260 v.x = (v.x << 1) / (v.z >> 8); /* assume aspect: ~2 */
261 v.y = (v.y << 2) / (v.z >> 8); /* the shift is * PROJ_D */
262 /* projection result is 24.8 */
264 *x = ((((v.x + 0x100) >> 1) * vp[2]) >> 8) + vp[0];
265 *y = ((((0x100 - v.y) >> 1) * vp[3]) >> 8) + vp[1];
268 static void draw_ptlines(int prim, const struct xvertex *varr, int vcount)
271 struct xvertex xv[2];
273 while(vcount >= prim) {
274 for(i=0; i<prim; i++) {
275 xform(xv + i, varr, mat[mtop]);
277 xv[i].x = (xv[i].x << 1) / (xv[i].z >> 8); /* assume aspect: ~2 */
278 xv[i].y = (xv[i].y << 2) / (xv[i].z >> 8); /* the shift is * PROJ_D */
279 /* projection result is 24.8 */
281 xv[i].x = ((((xv[i].x + 0x100) >> 1) * vp[2]) >> 8) + vp[0];
282 xv[i].y = ((((0x100 - xv[i].y) >> 1) * vp[3]) >> 8) + vp[1];
289 clip_line((int*)&xv[0].x, (int*)&xv[0].y, (int*)&xv[1].x, (int*)&xv[1].y, vp[0], vp[1], vp[2] - 1, vp[3] - 1);
291 draw_line(xv[0].x, xv[0].y, xv[1].x, xv[1].y, 0xff);
297 mat[mtop][12] = mat[mtop][13] = 0;
300 #define ISECT_NEAR(v0, v1) ((((v0)->z - NEAR_Z) << 8) / ((v0)->z - (v1)->z))
302 #define LERP_VATTR(res, v0, v1, t) \
304 (res)->x = (v0)->x + (((v1)->x - (v0)->x) >> 8) * (t); \
305 (res)->y = (v0)->y + (((v1)->y - (v0)->y) >> 8) * (t); \
306 (res)->z = (v0)->z + (((v1)->z - (v0)->z) >> 8) * (t); \
307 (res)->nx = (v0)->nx + (((v1)->nx - (v0)->nx) >> 8) * (t); \
308 (res)->ny = (v0)->ny + (((v1)->ny - (v0)->ny) >> 8) * (t); \
309 (res)->nz = (v0)->nz + (((v1)->nz - (v0)->nz) >> 8) * (t); \
310 (res)->tx = (v0)->tx + (((v1)->tx - (v0)->tx) >> 8) * (t); \
311 (res)->ty = (v0)->ty + (((v1)->ty - (v0)->ty) >> 8) * (t); \
312 (res)->lit = (v0)->lit + (((v1)->lit - (v0)->lit) >> 8) * (t); \
315 static int clip_edge_near(struct xvertex *poly, int *vnumptr, struct xvertex *v0, struct xvertex *v1)
320 struct xvertex *vptr;
322 in0 = v0->z >= NEAR_Z ? 1 : 0;
323 in1 = v1->z >= NEAR_Z ? 1 : 0;
329 poly[vnum++] = *v1; /* append v1 */
335 t = ISECT_NEAR(v0, v1); /* 24:8 */
336 LERP_VATTR(vptr, v0, v1, t);
337 ++vnum; /* append new vertex on the intersection point */
344 t = ISECT_NEAR(v0, v1);
345 LERP_VATTR(vptr, v0, v1, t);
346 ++vnum; /* append new vertex ... */
359 /* special case near-plane clipper */
360 int xgl_clip_near(struct xvertex *vout, int *voutnum, struct xvertex *vin, int vnum)
363 int edges_clipped = 0;
367 for(i=0; i<vnum; i++) {
369 if(nextidx >= vnum) nextidx = 0;
370 res = clip_edge_near(vout, voutnum, vin + i, vin + nextidx);
376 if(*voutnum <= 0) return -1;
377 return edges_clipped > 0 ? 0 : 1;