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