equal
deleted
inserted
replaced
249 |
249 |
250 static void DrawTile_Trees(TileInfo *ti) |
250 static void DrawTile_Trees(TileInfo *ti) |
251 { |
251 { |
252 uint16 m2; |
252 uint16 m2; |
253 const uint32 *s; |
253 const uint32 *s; |
254 const byte *d; |
254 const TreePos* d; |
255 byte z; |
255 byte z; |
256 |
256 |
257 m2 = _m[ti->tile].m2; |
257 m2 = _m[ti->tile].m2; |
258 |
258 |
259 if ((m2 & 0x30) == 0) { |
259 if ((m2 & 0x30) == 0) { |
306 i = (ti->map5 >> 6) + 1; |
306 i = (ti->map5 >> 6) + 1; |
307 do { |
307 do { |
308 uint32 image = s[0] + (--i == 0 ? GB(ti->map5, 0, 3) : 3); |
308 uint32 image = s[0] + (--i == 0 ? GB(ti->map5, 0, 3) : 3); |
309 if (_display_opt & DO_TRANS_BUILDINGS) MAKE_TRANSPARENT(image); |
309 if (_display_opt & DO_TRANS_BUILDINGS) MAKE_TRANSPARENT(image); |
310 te[i].image = image; |
310 te[i].image = image; |
311 te[i].x = d[0]; |
311 te[i].x = d->x; |
312 te[i].y = d[1]; |
312 te[i].y = d->y; |
313 s++; |
313 s++; |
314 d += 2; |
314 d++; |
315 } while (i); |
315 } while (i); |
316 |
316 |
317 /* draw them in a sorted way */ |
317 /* draw them in a sorted way */ |
318 for(;;) { |
318 for(;;) { |
319 byte min = 0xFF; |
319 byte min = 0xFF; |