| 268 | const int xA = r0x+r2xr0x*(y-r0y)/r2yr0y; |
| 269 | const int xB = r0x+r1xr0x*(y-r0y)/r1yr0y; |
| 270 | __attribute__((opencl_unroll_hint(1))) for(int x=min(xA, xB); x<max(xA, xB); x++) { |
| 271 | draw(x, y, z, color, bitmap, zbuffer, stereo); |
| 272 | } |
| 273 | } |
| 274 | __attribute__((opencl_unroll_hint(1))) for(int y=r1y; y<r2y; y++) { // Bresenham algorithm (upper triangle half) |
| 275 | const int xA = r0x+r2xr0x*(y-r0y)/r2yr0y; |
no test coverage detected