|
86
|
1 #include <iostream>
|
|
|
2 #include <string.h>
|
|
|
3 #include "polygon_pack.h"
|
|
|
4 #include "spu_span.h"
|
|
|
5 #include "error.h"
|
|
|
6 using namespace std;
|
|
|
7
|
|
|
8
|
|
|
9 static float calc(float f1, float f2,int i, float base){
|
|
|
10 float ans;
|
|
|
11 ans = f1/f2*i + base;
|
|
|
12 return ans;
|
|
|
13 }
|
|
|
14
|
|
|
15
|
|
|
16 static VertexPack
|
|
|
17 *vMid1(VertexPack *vMid1, VertexPack *vMin, VertexPack *vMid, VertexPack *vMax)
|
|
|
18 {
|
|
|
19 float d,d1;
|
|
|
20
|
|
|
21 d = (int)vMax->y-(int)vMin->y;
|
|
|
22 d1 = (int)vMid->y - (int)vMin->y;
|
|
|
23 vMid1->tex_x = calc(vMax->tex_x - vMin->tex_x, d, (int)d1 , vMin->tex_x);
|
|
|
24 vMid1->tex_y = calc(vMax->tex_y - vMin->tex_y, d, (int)d1 , vMin->tex_y);
|
|
|
25 vMid1->x = calc(vMax->x - vMin->x, d, (int)d1 , vMin->x);
|
|
|
26 vMid1->y = vMid->y;
|
|
|
27 vMid1->z = calc(vMax->z - vMin->z, d, (int)d1 , vMin->z);
|
|
|
28 //printf("x:%f y:%f z:%f tex_x:%f tex_y:%f\n",vMid1->x,vMid1->y,vMid1->z,vMid1->tex_x, vMid1->tex_y);
|
|
|
29
|
|
|
30 return vMid1;
|
|
|
31 }
|
|
|
32
|
|
|
33 void
|
|
|
34 half_triangle(SPUSPANLIST *ssl, long *tex_addr, long tex_width,long tex_height,
|
|
|
35 VertexPack *vMin, VertexPack *vMid, VertexPack *vMid1)
|
|
|
36 {
|
|
|
37 float tmp_z,tmp_tex1, tmp_tex2 ,tmp_tey1,tmp_tey2;
|
|
|
38 float tmp_xpos,tmp_end,tmp_zpos;
|
|
|
39 int i;
|
|
|
40 float div_y;
|
|
|
41 float start_z,end_z;
|
|
|
42 float start_tex_x,end_tex_x,start_tex_y,end_tex_y;
|
|
|
43 int x,y,length;
|
|
|
44 int k =0;
|
|
|
45 int l = 1;
|
|
|
46 int start_y = (int)vMid->y;
|
|
|
47 int end_y = (int)vMin->y;
|
|
|
48
|
|
|
49 if (start_y<end_y) {
|
|
|
50 int i; i=end_y; end_y=start_y; start_y = i;
|
|
|
51 k = 1;
|
|
|
52 l = -1;
|
|
|
53 }
|
|
|
54
|
|
|
55 div_y = start_y - end_y; // > 0
|
|
|
56
|
|
|
57 for (i = k; i < div_y+1; i++) {
|
|
|
58 tmp_xpos = calc(vMid1->x - vMin->x ,div_y, i, vMin->x);
|
|
|
59 tmp_end = calc(vMid->x - vMin->x ,div_y, i, vMin->x);
|
|
|
60 tmp_z = calc(vMid1->z - vMin->z ,div_y, i, vMin->z);
|
|
|
61 tmp_zpos = calc(vMid->z - vMin->z ,div_y, i, vMin->z);
|
|
|
62
|
|
|
63 tmp_tex1 =((i/(div_y)) * vMid1->tex_x) + \
|
|
|
64 ( ((div_y - i)/(div_y)) * vMin->tex_x);
|
|
|
65 tmp_tex2 =( (i/(div_y)) * vMid->tex_x) + \
|
|
|
66 ( ((div_y - i)/(div_y)) * vMin->tex_x);
|
|
|
67
|
|
|
68 tmp_tey1 =( (i/(div_y)) * vMid1->tex_y) + \
|
|
|
69 ( ((div_y - i)/(div_y)) * vMin->tex_y);
|
|
|
70 tmp_tey2 =( (i/(div_y)) * vMid->tex_y) + \
|
|
|
71 ( ((div_y - i)/(div_y)) * vMin->tex_y);
|
|
|
72 if(tmp_xpos > tmp_end) {
|
|
|
73 x = (int)tmp_end;
|
|
|
74 y = (int)vMin->y + i*l;
|
|
|
75 length = (int)(tmp_xpos)-(int)(tmp_end)+1;
|
|
|
76 start_z = tmp_zpos;
|
|
|
77 end_z = tmp_z;
|
|
|
78 start_tex_x = tmp_tex2;
|
|
|
79 end_tex_x = tmp_tex1;
|
|
|
80 start_tex_y = tmp_tey2;
|
|
|
81 end_tex_y = tmp_tey1;
|
|
|
82 } else {
|
|
|
83 x = (int)tmp_xpos;
|
|
|
84 y = (int)vMin->y + i*l;
|
|
|
85 length = (int)(tmp_end)-(int)(tmp_xpos)+1;
|
|
|
86 start_z = tmp_z;
|
|
|
87 end_z = tmp_zpos;
|
|
|
88 start_tex_x = tmp_tex1;
|
|
|
89 end_tex_x = tmp_tex2;
|
|
|
90 start_tex_y = tmp_tey1;
|
|
|
91 end_tex_y = tmp_tey2;
|
|
|
92 }
|
|
|
93 //printf("x:%d y:%d end:%d z:%f zpos:%f\n",x,y,length,start_z , end_z);
|
|
|
94 //printf("start_tex_x:%f end_tex_x:%f start_tex_y:%f end_tex_y:%fn",start_tex_x,end_tex_x,start_tex_y,end_tex_y);
|
|
|
95
|
|
|
96 //add(tex_addr,tex_width,tex_height,x,y,length,start_z,end_z,start_tex_x,end_tex_x,start_tex_y,end_tex_y);
|
|
|
97
|
|
|
98 //y += 540; // window_height = 1080 (1080/2 = 540)
|
|
|
99 y += 240; // window_height = 480 (480/2 = 240)
|
|
|
100
|
|
|
101 int line_set = y/8;
|
|
|
102
|
|
|
103 //y -= 540; // window_height = 1080 (1080/2 = 540)
|
|
|
104 y -= 240; // window_height = 480 (480/2 = 240)
|
|
|
105
|
|
|
106 int spu_no = line_set%6;
|
|
|
107 int spp_no = line_set/6;
|
|
|
108 int span_no = ssl->ss[spu_no].spp[spp_no].info.size;
|
|
|
109
|
|
|
110 #if 0
|
|
|
111 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_addr = tex_addr;
|
|
|
112 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_width = tex_width;
|
|
|
113 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_height = tex_height;
|
|
|
114 ssl->ss[spu_no].spp[spp_no].span[span_no].x = x;
|
|
|
115 ssl->ss[spu_no].spp[spp_no].span[span_no].y = y;
|
|
|
116 ssl->ss[spu_no].spp[spp_no].span[span_no].length_x = length;
|
|
|
117 ssl->ss[spu_no].spp[spp_no].span[span_no].start_z = start_z;
|
|
|
118 ssl->ss[spu_no].spp[spp_no].span[span_no].end_z = end_z;
|
|
|
119 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_x1 = start_tex_x;
|
|
|
120 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_x2 = end_tex_x;
|
|
|
121 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_y1 = start_tex_y;
|
|
|
122 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_y2 = end_tex_y;
|
|
|
123 #else
|
|
|
124 SPNA_PTR span = &ssl->ss[spu_no].spp[spp_no].span[span_no];
|
|
|
125
|
|
|
126 span->tex_addr = tex_addr;
|
|
|
127 span->tex_width = tex_width;
|
|
|
128 span->tex_height = tex_height;
|
|
|
129 span->x = x;
|
|
|
130 span->y = y;
|
|
|
131 span->length_x = length;
|
|
|
132 span->start_z = start_z;
|
|
|
133 span->end_z = end_z;
|
|
|
134 span->tex_x1 = start_tex_x;
|
|
|
135 span->tex_x2 = end_tex_x;
|
|
|
136 span->tex_y1 = start_tex_y;
|
|
|
137 span->tex_y2 = end_tex_y;
|
|
|
138
|
|
|
139 #endif
|
|
|
140
|
|
|
141 ssl->ss[spu_no].spp[spp_no].info.size++;
|
|
|
142 }
|
|
|
143 }
|
|
|
144
|
|
|
145
|
|
|
146 int
|
|
|
147 create_span(void *rbuf, void *wbuf)
|
|
|
148 {
|
|
|
149 PolygonPack *polygon = (PolygonPack*)rbuf;
|
|
|
150 //SPUSPANLIST *ssl = polygon->ssl;
|
|
|
151 SPUSPANLIST *ssl = (SPUSPANLIST*)wbuf;
|
|
|
152 VertexPack *vMin, *vMid, *vMax, *vMid10;
|
|
|
153 VertexPack ver;
|
|
|
154 vMid10 = &ver;
|
|
|
155
|
|
|
156 __debug("[%s]\n", __FUNCTION__);
|
|
|
157
|
|
|
158 for(int i = 0; i < 6; i++) // 6 = number of SPU
|
|
|
159 {
|
|
|
160 ssl->ss[i].length = 0;
|
|
|
161 for(int t = 0; t < 10; t++) // window_height = 480 (480/8/6 = 10)
|
|
|
162 {
|
|
|
163 // wbuf は 16KB 、ssl(SPUSPANLIST) は 200KB 超えてるので
|
|
|
164 // 16KB以上の場所にアクセスすると、ここでエラーがでます
|
|
|
165 ssl->ss[i].spp[t].info.size = 0;
|
|
|
166 }
|
|
|
167 }
|
|
|
168
|
|
|
169 for (int a = 0; a < polygon->info.size; a++) {
|
|
|
170 if (polygon->tri[a].ver1.y <= polygon->tri[a].ver2.y) {
|
|
|
171 if (polygon->tri[a].ver2.y <= polygon->tri[a].ver3.y) {
|
|
|
172 vMin = &polygon->tri[a].ver1;
|
|
|
173 vMid = &polygon->tri[a].ver2;
|
|
|
174 vMax = &polygon->tri[a].ver3;
|
|
|
175 } else if (polygon->tri[a].ver3.y <= polygon->tri[a].ver1.y) {
|
|
|
176 vMin = &polygon->tri[a].ver3;
|
|
|
177 vMid = &polygon->tri[a].ver1;
|
|
|
178 vMax = &polygon->tri[a].ver2;
|
|
|
179 } else {
|
|
|
180 vMin = &polygon->tri[a].ver1;
|
|
|
181 vMid = &polygon->tri[a].ver3;
|
|
|
182 vMax = &polygon->tri[a].ver2;
|
|
|
183 }
|
|
|
184 } else {
|
|
|
185 if (polygon->tri[a].ver1.y <= polygon->tri[a].ver3.y) {
|
|
|
186 vMin = &polygon->tri[a].ver2;
|
|
|
187 vMid = &polygon->tri[a].ver1;
|
|
|
188 vMax = &polygon->tri[a].ver3;
|
|
|
189 } else if (polygon->tri[a].ver3.y <= polygon->tri[a].ver2.y) {
|
|
|
190 vMin = &polygon->tri[a].ver3;
|
|
|
191 vMid = &polygon->tri[a].ver2;
|
|
|
192 vMax = &polygon->tri[a].ver1;
|
|
|
193 } else {
|
|
|
194 vMin = &polygon->tri[a].ver2;
|
|
|
195 vMid = &polygon->tri[a].ver3;
|
|
|
196 vMax = &polygon->tri[a].ver1;
|
|
|
197 }
|
|
|
198 }
|
|
|
199
|
|
|
200 vMid1(vMid10,vMin,vMid,vMax);
|
|
|
201
|
|
|
202 half_triangle(ssl, polygon->tri[a].tex_addr, polygon->tri[a].tex_width,
|
|
|
203 polygon->tri[a].tex_height, vMin, vMid, vMid10);
|
|
|
204 half_triangle(ssl, polygon->tri[0].tex_addr, polygon->tri[0].tex_width,
|
|
|
205 polygon->tri[0].tex_height, vMax, vMid, vMid10);
|
|
|
206
|
|
|
207 return 0;
|
|
|
208
|
|
|
209 //return sizeof(SPUSPANLIST);
|
|
|
210 }
|
|
|
211 }
|
