ShuriZma
/
desmume
mirror of https://github.com/TASEmulators/desmume.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

gfx3d: fix bugs in poly sorting

This commit is contained in:
zeromus 2009-07-28 08:14:11 +00:00
parent 2c3cef961c
commit 74e0fabca9
1 changed files with 11 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
desmume/src/gfx3d.cpp
View File

@ -1559,10 +1559,15 @@ static bool gfx3d_ysort_compare(int num1, int num2)
const POLY &poly2 = polylist->list[num2];
//this may be verified by checking the game create menus in harvest moon island of happiness
if (poly1.maxy > poly2.maxy) return false;
//also the buttons in the knights in the nightmare frontend depend on this and the perspective division
if (poly1.maxy < poly2.maxy) return true;
if (poly1.miny < poly2.miny) return true;
if (poly1.miny > poly2.miny) return false;
if (poly1.maxy > poly2.maxy) return false;
if (poly1.miny > poly2.miny) return true;
if (poly1.miny < poly2.miny) return false;
//notably, the main shop interface in harvest moon will not have a correct RTN button
//i think this is due to a math error rounding its position to one pixel too high and it popping behind
//the bar that it sits on.
//everything else in all the other menus that I could find looks right..
//make sure we respect the game's ordering in cases of complete ties
//this makes it a stable sort.
@ -1606,13 +1611,14 @@ static void gfx3d_doFlush()
//TODO - this could be a small waste of time if we are manual sorting the translucent polys
//TODO - this _MUST_ be moved later in the pipeline, after clipping.
//the w-division here is just an approximation to fix the shop in harvest moon island of happiness
//also the buttons in the knights in the nightmare frontend depend on this
for(int i=0; i<polycount; i++)
{
POLY &poly = polylist->list[i];
float verty = vertlist->list[poly.vertIndexes[0]].y;
float vertw = vertlist->list[poly.vertIndexes[0]].w;
verty = (verty+vertw)/(2*vertw);
poly.miny = poly.maxy = (verty+vertw)/(2*vertw);
poly.miny = poly.maxy = verty;
for(int j=1; j<poly.type; j++)
{