Mercurial > hg > Members > kono > Cerium
annotate Renderer/Engine/task/CreateSpan.cc @ 1047:6a80ca9a65d9
broken texure ( h/w != 2^n ) protection
| author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
|---|---|
| date | Wed, 08 Dec 2010 05:38:45 +0900 |
| parents | 55159a5bf2c4 |
| children |
| rev | line source |
|---|---|
| 507 | 1 #include "CreateSpan.h" |
| 2 #include "viewer_types.h" | |
| 3 | |
| 4 static const int SPAN_PACK_LOAD = 5; | |
| 5 static const int SPAN_PACK_STORE = 6; | |
| 6 static const int POLYGON_PACK_LOAD = 7; | |
| 7 static const int TILE_ALLOCATE = 8; | |
| 8 static const int TILE_LOAD = 9; | |
| 9 static const int TILE_STORE = 10; | |
| 10 | |
| 11 static SpanPackPtr spack = NULL; | |
| 12 static SpanPackPtr send_spack = NULL; | |
| 13 static int prev_index = 0; | |
| 14 | |
| 15 SchedDefineTask(CreateSpan); | |
| 16 | |
| 17 static float | |
| 18 calc(float f1, float f2,int i, float base) | |
| 19 { | |
| 20 float ans; | |
| 21 ans = f1/f2*i + base; | |
| 22 return ans; | |
| 23 } | |
| 24 | |
| 25 | |
| 26 /** | |
| 27 * TrianglePack から、vMin, vMid, vMax を求める | |
| 28 * | |
| 29 * @param [triPack] TrianglePack | |
| 30 * @param [vMin] [vMid] [vMax] | |
| 31 */ | |
| 32 static void | |
| 33 make_vertex(TrianglePack *triPack, | |
| 34 VertexPackPtr *vMin, VertexPackPtr *vMid, VertexPackPtr *vMax, | |
| 35 NormalPackPtr *normal1, NormalPackPtr *normal2, NormalPackPtr *normal3) | |
| 36 { | |
| 37 if (triPack->ver1.y <= triPack->ver2.y) { | |
| 38 if (triPack->ver2.y <= triPack->ver3.y) { | |
| 39 *vMin = &triPack->ver1; | |
| 40 *vMid = &triPack->ver2; | |
| 41 *vMax = &triPack->ver3; | |
| 42 } else if (triPack->ver3.y <= triPack->ver1.y) { | |
| 43 *vMin = &triPack->ver3; | |
| 44 *vMid = &triPack->ver1; | |
| 45 *vMax = &triPack->ver2; | |
| 46 } else { | |
| 47 *vMin = &triPack->ver1; | |
| 48 *vMid = &triPack->ver3; | |
| 49 *vMax = &triPack->ver2; | |
| 50 } | |
| 51 } else { | |
| 52 if (triPack->ver1.y <= triPack->ver3.y) { | |
| 53 *vMin = &triPack->ver2; | |
| 54 *vMid = &triPack->ver1; | |
| 55 *vMax = &triPack->ver3; | |
| 56 } else if (triPack->ver3.y <= triPack->ver2.y) { | |
| 57 *vMin = &triPack->ver3; | |
| 58 *vMid = &triPack->ver2; | |
| 59 *vMax = &triPack->ver1; | |
| 60 } else { | |
| 61 *vMin = &triPack->ver2; | |
| 62 *vMid = &triPack->ver3; | |
| 63 *vMax = &triPack->ver1; | |
| 64 } | |
| 65 } | |
| 66 | |
| 67 *normal1 = &triPack->normal1; | |
| 68 *normal2 = &triPack->normal2; | |
| 69 *normal3 = &triPack->normal3; | |
| 70 | |
| 71 } | |
| 72 | |
| 73 static void | |
| 74 make_vMid10(VertexPack *v, VertexPack *vMin, | |
| 75 VertexPack *vMid, VertexPack *vMax) | |
| 76 { | |
| 77 //int d, d1; | |
| 78 float d; | |
| 79 int d1; | |
| 80 | |
| 81 d = vMax->y - vMin->y; | |
| 82 d1 = (int)(vMid->y - vMin->y); | |
| 83 | |
| 84 v->tex_x = calc(vMax->tex_x - vMin->tex_x, d, d1, vMin->tex_x); | |
| 85 v->tex_y = calc(vMax->tex_y - vMin->tex_y, d, d1, vMin->tex_y); | |
| 86 v->x = calc(vMax->x - vMin->x, d, d1, vMin->x); | |
| 87 v->y = vMid->y; | |
| 88 v->z = calc(vMax->z - vMin->z, d, d1, vMin->z); | |
| 89 } | |
| 90 | |
| 91 /** | |
| 92 * 与えられた scale から、実際に使うテクスチャの Tapestry を選択する | |
| 93 * | |
| 94 * テクスチャは、オリジナルのサイズから、可能なかぎり 1/2 で縮小していき、 | |
| 95 * 下の図の様に連続した領域に入れられる | |
| 96 * | |
| 97 * Tapestry (1) | |
| 98 * +---+---+---+---+ | |
| 99 * | 0 | 1 | 2 | 3 | | |
| 100 * +---+---+---+---+ | |
| 101 * | 4 | 5 | 6 | 7 | (2) | |
| 102 * +---+---+---+---+ +---+---+ | |
| 103 * | 8 | 9 | 10| 11| | 16| 17| (3) | |
| 104 * +---+---+---+---+ +---+---+ +---+ | |
| 105 * | 12| 13| 14| 15| | 18| 19| | 20| | |
| 106 * +---+---+---+---+ +---+---+ +---| | |
| 107 * | |
| 108 * (1) (2) (3) | |
| 109 * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ | |
| 110 * | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | * | * | * | 14| 15| 16| 17| 18| 19| 20| | |
| 111 * +---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+ | |
| 112 * | |
| 113 * scale の値から、各 Tapestry の先頭アドレスを返す | |
| 114 * | |
| 115 * @param[in] tw Width of texture | |
| 116 * @param[in] th Height of texture | |
| 117 * @param[in] scale テクスチャの縮小率 (= 2^n) | |
| 118 * @param[in] addr_top テクスチャの先頭アドレス (上の図での (1) | |
| 119 * @return scale に対応する Tapestry のアドレス (上の図での (1) or (2) or(3) | |
| 120 */ | |
| 121 static uint32* | |
| 122 getTapestry(int tw, int th, int scale, uint32 *addr_top) | |
| 123 { | |
| 124 int index = 0; | |
| 125 | |
| 126 for (int s = 1; s < scale; s <<= 1) { | |
| 127 index += tw*th; | |
| 128 tw >>= 1; /* tw /= 2 */ | |
| 129 th >>= 1; | |
| 130 } | |
| 131 | |
| 132 return addr_top + index; | |
| 133 } | |
| 134 | |
| 135 | |
| 136 /** | |
| 137 * span の width,height と texture の width,height を比べて | |
| 138 * span を描画する際に使う texture の比率を求める | |
| 139 * | |
| 140 * @param[in] width Width of span | |
| 141 * @param[in] height Height of span | |
| 142 * @param[in] tex_width Width of 1/1 texture that span use | |
| 143 * @param[in] tex_height Height of 1/1 texture that span use | |
| 144 * @param[in] scale_max この Span で使う texture の最大縮小率 | |
| 145 * 計算結果が scale_max 以上になるのを防ぐ | |
| 146 * @return 描画に使う texture の比率 | |
| 147 * width と height は 1/scale の画像を使う | |
| 148 * | |
| 149 */ | |
| 150 static int | |
| 151 getScale(int width, int height, int tex_width, int tex_height, int scale_max) | |
| 152 { | |
| 153 int base, tex_base; | |
| 154 int scale = 1; | |
| 155 | |
|
1047
6a80ca9a65d9
broken texure ( h/w != 2^n ) protection
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
705
diff
changeset
|
156 if (scale_max==0) return 1; // broken case |
| 507 | 157 /** |
| 158 * width と height で、長い方を基準に、 | |
| 159 * texture の scale を決める | |
| 160 */ | |
| 161 if (width > height) { | |
| 162 base = width; | |
| 163 tex_base = tex_width; | |
| 164 } else { | |
| 165 base = height; | |
| 166 tex_base = tex_height; | |
| 167 } | |
| 168 | |
| 169 if (tex_base > base) { | |
| 170 int t_scale = tex_base/base; | |
| 171 while (t_scale >>= 1) { | |
| 172 scale <<= 1; | |
| 173 } | |
| 174 } | |
| 175 | |
| 176 return (scale > scale_max) ? scale_max : scale; | |
| 177 //return scale_max; | |
| 178 } | |
| 179 | |
| 180 /** | |
| 181 * x軸に水平な辺を持つ三角形ポリゴンから、 | |
| 182 * Span を抜き出す | |
| 183 * | |
| 184 * @param[in] spackList triangle から生成された span を格納する List | |
| 185 * @param[in] charge_y_top 担当する y の範囲開始地点 | |
| 186 * @param[in] charge_y_end 担当する y の範囲終了地点 | |
| 187 * @param[in] tex_addr triangle が参照するテクスチャの先頭アドレス | |
| 188 * @param[in] tex_width テクスチャの width | |
| 189 * @param[in] tex_height テクスチャの height | |
| 190 * @param[in] tex_scale_max テクスチャの最大縮小率 (2^n) | |
| 191 * @param[in] vMin triangle の座標 | |
| 192 * @param[in] vMid triangle の座標。triangle を二つに分けて出来た新しい座標 | |
| 193 * @param[in] vMid10 triangle の座標 | |
| 194 * @param[in] length_y 分割する前の Triangle の y の長さ | |
| 195 * @param[in] tex_y_len 分割する前の Triangle に貼られている Texture の | |
| 196 * 長さの割合 (0 ... 1) | |
| 197 */ | |
| 198 static void | |
| 199 half_triangle(SchedTask *smanager, SpanPackPtr *spackList, | |
| 200 int charge_y_top, int charge_y_end, | |
| 201 TriangleTexInfoPtr tex_info, | |
| 202 VertexPack *vMin,VertexPack *vMid,VertexPack *vMid10, | |
| 203 NormalPack *normal1, NormalPack *normal2, NormalPack *normal3, | |
| 204 int length_y, float tex_y_len) | |
| 205 { | |
| 206 float tmp_z,tmp_tex1, tmp_tex2 ,tmp_tey1,tmp_tey2; | |
| 207 float tmp_xpos,tmp_end,tmp_zpos; | |
| 208 float start_z, end_z; | |
| 209 float start_tex_x, end_tex_x, start_tex_y, end_tex_y; | |
| 210 int x, y, length; | |
| 211 | |
| 212 #if 1 | |
| 213 // これじゃないと | |
| 214 // テクスチャの貼りに微妙に隙間が。謎だ | |
| 215 int start_y = (int)vMid->y; | |
| 216 int end_y = (int)vMin->y; | |
| 217 #else | |
| 218 float start_y = vMid->y; | |
| 219 float end_y = vMin->y; | |
| 220 #endif | |
| 221 float div_y = start_y - end_y; | |
| 222 int k = 0; | |
| 223 int l = 1; | |
| 224 | |
| 225 SpanPackPtr tmp_spack; | |
| 226 | |
| 227 /** | |
| 228 * 三角形ポリゴンをx軸に水平に二つに分けようとして | |
| 229 * ある一辺がすでに水平だった場合、つまり | |
| 230 * | |
| 231 * |\ | |
| 232 * | \ | |
| 233 * | \ | |
| 234 * ----- | |
| 235 * | |
| 236 * | |
| 237 * 上のようなポリゴンだった場合は、本来なら上の部分の三角形にだけ | |
| 238 * half_triangle の処理をするべきだが、現在の処理だと | |
| 239 * この half_triangle に「上の部分の三角形」と、 | |
| 240 * 「『下の部分の三角形と判断してしまった』直線」が来てしまう。 | |
| 241 * 直線の部分が来ると、calc() で 0 除算とかで、値不定で暴走するので | |
| 242 * 現在はこれで代用。 | |
| 243 * half_triangle 呼ぶ前にこれを判断できれば良いかもしれない。 | |
| 244 * てかこんなんでいいのかよ。。。 | |
| 245 */ | |
| 246 #if 1 | |
| 247 if ((int)div_y == 0) { | |
| 248 return; | |
| 249 } | |
| 250 #else | |
| 251 if (vMid10->x == vMin->x && vMid10->y == vMin->y) { | |
| 252 return; | |
| 253 } | |
| 254 #endif | |
| 255 | |
| 256 if (div_y < 0) { | |
| 257 div_y = -div_y; | |
| 258 k = 1; | |
| 259 l = -1; | |
| 260 } | |
| 261 | |
| 262 for (int i = k; i < (int)div_y+1; i++) { | |
| 263 y = (int)vMin->y + i*l; | |
| 264 #if 1 | |
| 265 | |
| 266 /** | |
| 267 * 担当 y 範囲内 | |
| 268 */ | |
| 269 if (charge_y_top <= y && y <= charge_y_end) { | |
| 270 // 1..8 を index0, 9..16 を index1 にするために y を -1 | |
| 271 int index = (y-1) / split_screen_h; | |
| 272 | |
| 273 /** | |
| 274 * 違う SpanPack を扱う場合、 | |
| 275 * 現在の SpanPack をメインメモリに送り、 | |
| 276 * 新しい SpanPack を取ってくる | |
| 277 */ | |
| 278 if (index != prev_index) { | |
| 279 tmp_spack = spack; | |
| 280 spack = send_spack; | |
| 281 send_spack = tmp_spack; | |
| 282 | |
| 283 smanager->dma_wait(SPAN_PACK_STORE); | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
284 smanager->dma_store(send_spack, (memaddr)spackList[prev_index], |
| 507 | 285 sizeof(SpanPack), SPAN_PACK_STORE); |
| 286 | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
287 smanager->dma_load(spack, (memaddr)spackList[index], |
| 507 | 288 sizeof(SpanPack), SPAN_PACK_LOAD); |
| 289 prev_index = index; | |
| 290 smanager->dma_wait(SPAN_PACK_LOAD); | |
| 291 } | |
| 292 | |
| 293 /** | |
| 294 * 書き込む SpanPack が満杯だったら | |
| 295 * メインメモリで allocate した領域 (next) を持ってきて | |
| 296 * 現在の spack->next につなぎ、next を次の spack とする。 | |
| 297 */ | |
| 298 if (spack->info.size >= MAX_SIZE_SPAN) { | |
| 299 SpanPackPtr next; | |
| 300 | |
| 301 smanager->mainMem_alloc(0, sizeof(SpanPack)); | |
| 302 smanager->mainMem_wait(); | |
| 303 next = (SpanPackPtr)smanager->mainMem_get(0); | |
| 304 | |
| 305 spack->next = next; | |
| 306 | |
| 307 tmp_spack = spack; | |
| 308 spack = send_spack; | |
| 309 send_spack = tmp_spack; | |
| 310 | |
| 311 smanager->dma_wait(SPAN_PACK_STORE); | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
312 smanager->dma_store(send_spack, (memaddr)spackList[index], |
| 507 | 313 sizeof(SpanPack), SPAN_PACK_STORE); |
| 314 | |
| 315 spackList[index] = next; | |
| 316 | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
317 smanager->dma_load(spack, (memaddr)spackList[index], |
| 507 | 318 sizeof(SpanPack), SPAN_PACK_LOAD); |
| 319 smanager->dma_wait(SPAN_PACK_LOAD); | |
| 320 spack->init((index+1)*split_screen_h); | |
| 321 } | |
| 322 } else { | |
| 323 /** | |
| 324 * 担当範囲外だったら無視 | |
| 325 */ | |
| 326 continue; | |
| 327 } | |
| 328 | |
| 329 tmp_xpos = calc(vMid10->x - vMin->x ,div_y, i, vMin->x); | |
| 330 tmp_end = calc(vMid->x - vMin->x ,div_y, i, vMin->x); | |
| 331 tmp_z = calc(vMid10->z - vMin->z ,div_y, i, vMin->z); | |
| 332 tmp_zpos = calc(vMid->z - vMin->z ,div_y, i, vMin->z); | |
| 333 | |
| 334 length = (tmp_xpos > tmp_end) | |
| 335 ? (int)tmp_xpos - (int)tmp_end : (int)tmp_end - (int)tmp_xpos; | |
| 336 if (length == 0) { | |
| 337 continue; | |
| 338 } | |
| 339 | |
| 340 tmp_tex1 =((i/(div_y)) * vMid10->tex_x) + | |
| 341 ( ((div_y - i)/(div_y)) * vMin->tex_x); | |
| 342 tmp_tex2 =( (i/(div_y)) * vMid->tex_x) + | |
| 343 ( ((div_y - i)/(div_y)) * vMin->tex_x); | |
| 344 | |
| 345 tmp_tey1 =( (i/(div_y)) * vMid10->tex_y) + | |
| 346 ( ((div_y - i)/(div_y)) * vMin->tex_y); | |
| 347 tmp_tey2 =( (i/(div_y)) * vMid->tex_y) + | |
| 348 ( ((div_y - i)/(div_y)) * vMin->tex_y); | |
| 349 | |
| 350 if (tmp_xpos > tmp_end) { | |
| 351 x = (int)tmp_end; | |
| 352 length = (int)(tmp_xpos)-(int)(tmp_end)+1; | |
| 353 start_z = tmp_zpos; | |
| 354 end_z = tmp_z; | |
| 355 start_tex_x = tmp_tex2; | |
| 356 end_tex_x = tmp_tex1; | |
| 357 start_tex_y = tmp_tey2; | |
| 358 end_tex_y = tmp_tey1; | |
| 359 } else { | |
| 360 x = (int)tmp_xpos; | |
| 361 length = (int)(tmp_end)-(int)(tmp_xpos)+1; | |
| 362 start_z = tmp_z; | |
| 363 end_z = tmp_zpos; | |
| 364 start_tex_x = tmp_tex1; | |
| 365 end_tex_x = tmp_tex2; | |
| 366 start_tex_y = tmp_tey1; | |
| 367 end_tex_y = tmp_tey2; | |
| 368 } | |
| 369 | |
| 370 smanager->dma_wait(SPAN_PACK_LOAD); | |
| 371 | |
| 372 Span *span = &spack->span[spack->info.size++]; | |
| 373 | |
| 374 span->x = x; | |
| 375 span->y = y; | |
| 376 span->length_x = length; | |
| 377 span->start_z = start_z; | |
| 378 span->end_z = end_z; | |
| 379 span->tex_x1 = start_tex_x; | |
| 380 span->tex_x2 = end_tex_x; | |
| 381 span->tex_y1 = start_tex_y; | |
| 382 span->tex_y2 = end_tex_y; | |
| 383 /*ここで頂点分法線ベクトルがあったんだけど、 | |
| 384 * 一つだけ取り出して、spanに一つの法線ベクトルを持たしている | |
| 385 *by yutaka | |
| 386 */ | |
| 387 span->normal_x = normal1->x; | |
| 388 span->normal_y = normal1->y; | |
| 389 span->normal_z = normal1->z; | |
| 390 | |
| 391 | |
| 392 float tex_x_len = span->tex_x2 - span->tex_x1; | |
| 393 | |
| 394 /** | |
| 395 * tex_x_len, tex_y_len を掛ける理由は | |
| 396 * Changelog の 2008-12-16 を参照 | |
| 397 */ | |
| 398 int scale = getScale(span->length_x, length_y, | |
| 399 (int)(span->tex_width*tex_x_len), | |
| 400 (int)(span->tex_height*tex_y_len), | |
| 401 tex_info->scale_max); | |
| 402 //scale = tex_info->scale_max; | |
| 403 | |
| 404 uint32 *tapestry = getTapestry(tex_info->width, | |
| 405 tex_info->height, scale, | |
| 406 tex_info->addr); | |
| 407 span->tex_addr = tapestry; | |
| 408 span->tex_width = tex_info->width/scale; | |
| 409 span->tex_height = tex_info->height/scale; | |
| 410 } | |
| 411 #else | |
| 412 | |
| 413 /** | |
| 414 * ここに SIMD 化した記述をしようとして断念 | |
| 415 */ | |
| 416 | |
| 417 #endif | |
| 418 | |
| 419 } | |
| 420 | |
| 421 | |
| 422 static int | |
| 423 run(SchedTask *smanager, void *rbuf, void *wbuf) | |
| 424 { | |
|
705
55159a5bf2c4
Redering on SIMPLE_TASK
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
625
diff
changeset
|
425 PolygonPack *pp = (PolygonPack*)smanager->get_input(rbuf, 0); |
| 507 | 426 PolygonPack *next_pp = |
| 427 (PolygonPack*)smanager->allocate(sizeof(PolygonPack)); | |
| 428 PolygonPack *free_pp = next_pp; | |
| 429 PolygonPack *tmp_pp; | |
| 430 | |
| 431 TrianglePackPtr triPack; | |
| 432 VertexPackPtr vMin, vMid, vMax; | |
| 433 VertexPackPtr vMid10 | |
| 434 = (VertexPackPtr)smanager->allocate(sizeof(VertexPack)); | |
| 435 NormalPackPtr normal1,normal2, normal3; | |
|
705
55159a5bf2c4
Redering on SIMPLE_TASK
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
625
diff
changeset
|
436 SpanPackPtr *spackList = (SpanPackPtr*)smanager->get_input(rbuf, 1); |
|
55159a5bf2c4
Redering on SIMPLE_TASK
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
625
diff
changeset
|
437 spack = (SpanPackPtr)smanager->get_input(rbuf, 2); |
| 507 | 438 send_spack = (SpanPackPtr)smanager->allocate(sizeof(SpanPack)); |
|
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
603
diff
changeset
|
439 prev_index = (long)smanager->get_param(0); |
| 507 | 440 |
| 441 // spack と send_spack は swap しながら DMA を繰り返すので | |
| 442 // 自分で allocate した send_spack を覚えてないといけない | |
| 443 SpanPackPtr free_spack = send_spack; | |
| 444 | |
|
625
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
603
diff
changeset
|
445 int charge_y_top = (long)smanager->get_param(1); |
|
60aa3f241b10
64bit mode worked on Mac OS X.
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
603
diff
changeset
|
446 int charge_y_end = (long)smanager->get_param(2); |
| 507 | 447 |
| 448 do { | |
| 449 if (pp->next != NULL) { | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
450 smanager->dma_load(next_pp, (memaddr)pp->next, |
| 507 | 451 sizeof(PolygonPack), POLYGON_PACK_LOAD); |
| 452 } else { | |
| 453 next_pp = NULL; | |
| 454 } | |
| 455 | |
| 456 for (int i = 0; i < pp->info.size; i++) { | |
| 457 triPack = &pp->tri[i]; | |
| 458 | |
| 459 TriangleTexInfoPtr tri_tex_info = &triPack->tex_info; | |
| 460 | |
| 461 make_vertex(triPack, &vMin, &vMid, &vMax, &normal1, &normal2, &normal3); | |
| 462 make_vMid10(vMid10, vMin, vMid, vMax); | |
| 463 | |
| 464 /** | |
| 465 * ポリゴンを、x軸に水平に分割して二つの三角形を作り、 | |
| 466 * それぞれから Span を求める | |
| 467 * | |
| 468 * vMax | |
| 469 * |\ | |
| 470 * | \ | |
| 471 * | \ | |
| 472 * | \ | |
| 473 * vMid10 ------ vMid | |
| 474 * | / | |
| 475 * | / | |
| 476 * | / | |
| 477 * |/ | |
| 478 * vMin | |
| 479 * | |
| 480 * (vMax, vMid, vMin) という triangle を | |
| 481 * (vMax, vMid, vMid10) (vMin, vMid, vMid10) という | |
| 482 * 二つの Triangle に分けている | |
| 483 */ | |
| 484 half_triangle(smanager, spackList, charge_y_top, charge_y_end, | |
| 485 tri_tex_info, vMin, vMid, vMid10, | |
| 486 normal1,normal2,normal3, | |
| 487 (int)(vMax->y - vMin->y), vMax->tex_y - vMin->tex_y); | |
| 488 half_triangle(smanager, spackList, charge_y_top, charge_y_end, | |
| 489 tri_tex_info, vMax, vMid, vMid10, | |
| 490 normal1,normal2,normal3, | |
| 491 (int)(vMax->y - vMin->y), vMax->tex_y - vMin->tex_y); | |
| 492 } | |
| 493 | |
| 494 smanager->dma_wait(POLYGON_PACK_LOAD); | |
| 495 | |
| 496 tmp_pp = pp; | |
| 497 pp = next_pp; | |
| 498 next_pp = tmp_pp; | |
| 499 } while (pp); | |
| 500 | |
| 501 smanager->dma_wait(SPAN_PACK_STORE); | |
|
603
42c94f85c779
long -> memaddr (64 or 32)
Shinji KONO <kono@ie.u-ryukyu.ac.jp>
parents:
602
diff
changeset
|
502 smanager->dma_store(spack, (memaddr)spackList[prev_index], |
| 507 | 503 sizeof(SpanPack), SPAN_PACK_STORE); |
| 504 smanager->dma_wait(SPAN_PACK_STORE); | |
| 505 | |
| 506 free(free_pp); | |
| 507 free(free_spack); | |
| 508 free(vMid10); | |
| 509 | |
| 510 return 0; | |
| 511 } |