Mercurial > hg > Members > kono > Cerium

comparison old/simple_pack/task/create_span.cpp @ 507:735f76483bb2

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Reorganization..
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Mon, 12 Oct 2009 09:39:35 +0900
parents TaskManager/Test/simple_pack/task/create_span.cpp@c2e178b3415f
children
comparison
equal deleted inserted replaced
506:1d4a8a86f26b 507:735f76483bb2
1 #include <iostream>
2 #include "polygon_pack.h"
3 #include "spu_span.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(SPUSPANLIST *ssl, 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 //y += 540; // window_height = 1080 (1080/2 = 540)
97 y += 240; // window_height = 480 (480/2 = 240)
98
99 int line_set = y/8;
100
101 //y -= 540; // window_height = 1080 (1080/2 = 540)
102 y -= 240; // window_height = 480 (480/2 = 240)
103
104 int spu_no = line_set%6;
105
106 int spp_no = line_set/6;
107 int span_no = ssl->ss[spu_no].spp[spp_no].info.size;
108
109 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_addr = tex_addr;
110 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_width = tex_width;
111 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_height = tex_height;
112 ssl->ss[spu_no].spp[spp_no].span[span_no].x = x;
113 ssl->ss[spu_no].spp[spp_no].span[span_no].y = y;
114 ssl->ss[spu_no].spp[spp_no].span[span_no].length_x = length;
115 ssl->ss[spu_no].spp[spp_no].span[span_no].start_z = start_z;
116 ssl->ss[spu_no].spp[spp_no].span[span_no].end_z = end_z;
117 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_x1 = start_tex_x;
118 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_x2 = end_tex_x;
119 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_y1 = start_tex_y;
120 ssl->ss[spu_no].spp[spp_no].span[span_no].tex_y2 = end_tex_y;
121
122 ssl->ss[spu_no].spp[spp_no].info.size++;
123 }
124 }
125
126
127 int create_span(void *rbuf,void *wbuf) {
128 //POLYGONPACK *polygon = (POLYGONPACK*)rbuf;
129 PolygonPack *polygon = (PolygonPack*)rbuf;
130 //SPANPACK *sp = (SPANPACK*)wbuf;
131 //SPANPACKLIST *spl = (SPANPACKLIST*)wbuf;
132 //SPANPACKLIST *spl = polygon->spl;
133 SPUSPANLIST *ssl = polygon->ssl;
134 VertexPack *vMin, *vMid, *vMax, *vMid10;
135 VertexPack ver;
136 vMid10 = &ver;
137
138 //cout << "create_span:spl->size = " << spl->size << endl;
139 //cout << "create_span:spl->dline[0].span = " << spl->dline[0].span << endl;
140
141 //for(int i=0; i<spl->size; i++)
142 for(int i=0; i<6; i++) // 6 = number of SPU
143 {
144 ssl->ss[i].length = 0;
145 //for(int t=0; t<10; t++) // window_height = 1080 ( 1080/8/6 = 22.5 )
146 for(int t=0; t<10; t++) // window_height = 480 (480/8/6 = 10)
147 {
148 ssl->ss[i].spp[t].info.size = 0;
149 }
150 }
151
152 //sp->info.size = 0;
153
154 //cout << sizeof(SPANPACK) << endl;
155 //cout << "polygon size : " << polygon->info.size << endl;
156
157 for(int a=0; a<polygon->info.size; a++) {
158 //cout << "a = " << a << endl;
159 //cout << "polygon size : " << polygon->info.size << endl;
160 if(polygon->tri[a].ver1.y <= polygon->tri[a].ver2.y) {
161 if(polygon->tri[a].ver2.y <= polygon->tri[a].ver3.y) {
162 vMin = &polygon->tri[a].ver1;
163 vMid = &polygon->tri[a].ver2;
164 vMax = &polygon->tri[a].ver3;
165 } else if(polygon->tri[a].ver3.y <= polygon->tri[a].ver1.y) {
166 vMin = &polygon->tri[a].ver3;
167 vMid = &polygon->tri[a].ver1;
168 vMax = &polygon->tri[a].ver2;
169 } else {
170 vMin = &polygon->tri[a].ver1;
171 vMid = &polygon->tri[a].ver3;
172 vMax = &polygon->tri[a].ver2;
173 }
174 } else {
175 if(polygon->tri[a].ver1.y <= polygon->tri[a].ver3.y) {
176 vMin = &polygon->tri[a].ver2;
177 vMid = &polygon->tri[a].ver1;
178 vMax = &polygon->tri[a].ver3;
179 } else if(polygon->tri[a].ver3.y <= polygon->tri[a].ver2.y) {
180 vMin = &polygon->tri[a].ver3;
181 vMid = &polygon->tri[a].ver2;
182 vMax = &polygon->tri[a].ver1;
183 } else {
184 vMin = &polygon->tri[a].ver2;
185 vMid = &polygon->tri[a].ver3;
186 vMax = &polygon->tri[a].ver1;
187 }
188 }
189
190 //cout << vMid->y << endl;
191 //cout << vMin->y << endl;
192
193 vMid1(vMid10,vMin,vMid,vMax);
194
195 half_triangle(ssl,polygon->tri[a].tex_addr,polygon->tri[a].tex_width,polygon->tri[a].tex_height,vMin,vMid,vMid10);
196 half_triangle(ssl,polygon->tri[0].tex_addr,polygon->tri[0].tex_width,polygon->tri[0].tex_height,vMax,vMid,vMid10);
197 //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);
198 }
199 //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);
200 return 0;
201
202 //return sizeof(SPANPACKLIST);
203 }