- clipper debugging
[dosdemo] / src / polytmpl.h
1 static uint32_t SCANEDGE(struct pvertex *v0, struct pvertex *v1, struct pvertex *edge)
2 {
3         int i;
4         int32_t x, dx, dy, slope;
5 #ifdef GOURAUD
6         int r, g, b, dr, dg, db;
7         int32_t rslope, gslope, bslope;
8 #endif
9 #ifdef TEXMAP
10         int32_t u, v, du, dv, uslope, vslope;
11 #endif
12         int32_t start_idx, end_idx;
13
14         if(v0->y > v1->y) {
15                 struct pvertex *tmp = v0;
16                 v0 = v1;
17                 v1 = tmp;
18         }
19
20         x = v0->x;
21         dy = v1->y - v0->y;
22         dx = v1->x - v0->x;
23         slope = (dx << 8) / dy;
24 #ifdef GOURAUD
25         r = (v0->r << COLOR_SHIFT);
26         g = (v0->g << COLOR_SHIFT);
27         b = (v0->b << COLOR_SHIFT);
28         dr = (v1->r << COLOR_SHIFT) - r;
29         dg = (v1->g << COLOR_SHIFT) - g;
30         db = (v1->b << COLOR_SHIFT) - b;
31         rslope = (dr << 8) / dy;
32         gslope = (dg << 8) / dy;
33         bslope = (db << 8) / dy;
34 #endif
35 #ifdef TEXMAP
36         u = v0->u;
37         v = v0->v;
38         du = v1->u - v0->u;
39         dv = v1->v - v0->v;
40         uslope = (du << 8) / dy;
41         vslope = (dv << 8) / dy;
42 #endif
43
44         start_idx = v0->y >> 8;
45         end_idx = v1->y >> 8;
46
47         for(i=start_idx; i<end_idx; i++) {
48                 edge[i].x = x;
49                 x += slope;
50 #ifdef GOURAUD
51                 /* we'll store the color in the edge tables with COLOR_SHIFT extra bits of precision */
52                 edge[i].r = r;
53                 edge[i].g = g;
54                 edge[i].b = b;
55                 r += rslope;
56                 g += gslope;
57                 b += bslope;
58 #endif
59 #ifdef TEXMAP
60                 edge[i].u = u;
61                 edge[i].v = v;
62                 u += uslope;
63                 v += vslope;
64 #endif
65         }
66
67         return (uint32_t)start_idx | ((uint32_t)(end_idx - 1) << 16);
68 }
69
70 void POLYFILL(struct pvertex *pv, int nverts)
71 {
72         int i;
73         int topidx = 0, botidx = 0, sltop = pfill_fb.height, slbot = 0;
74         struct pvertex *left, *right;
75         uint16_t color;
76         /* the following variables are used for interpolating horizontally accros scanlines */
77 #if defined(GOURAUD) || defined(TEXMAP)
78         int mid;
79         int32_t dx, tmp;
80 #else
81         /* flat version, just pack the color now */
82         color = PACK_RGB16(pv[0].r, pv[0].g, pv[0].b);
83 #endif
84 #ifdef GOURAUD
85         int32_t r, g, b, dr, dg, db, rslope, gslope, bslope;
86 #endif
87 #ifdef TEXMAP
88         int32_t u, v, du, dv, uslope, vslope;
89 #endif
90
91         for(i=1; i<nverts; i++) {
92                 if(pv[i].y < pv[topidx].y) topidx = i;
93                 if(pv[i].y > pv[botidx].y) botidx = i;
94         }
95
96         left = alloca(pfill_fb.height * sizeof *left);
97         right = alloca(pfill_fb.height * sizeof *right);
98
99         for(i=0; i<nverts; i++) {
100                 int next = NEXTIDX(i);
101                 int32_t y0 = pv[i].y;
102                 int32_t y1 = pv[next].y;
103
104                 if((y0 >> 8) == (y1 >> 8)) {
105                         /*if(y0 > y1) {*/
106                                 int i0, i1;
107                                 int idx = y0 >> 8;
108                                 if(pv[i].x < pv[next].x) {
109                                         i0 = i;
110                                         i1 = next;
111                                 } else {
112                                         i0 = next;
113                                         i1 = i;
114                                 }
115                                 left[idx].x = pv[i0].x;
116                                 right[idx].x = pv[i1].x;
117 #ifdef GOURAUD
118                                 left[idx].r = pv[i0].r << COLOR_SHIFT;
119                                 left[idx].g = pv[i0].g << COLOR_SHIFT;
120                                 left[idx].b = pv[i0].b << COLOR_SHIFT;
121                                 right[idx].r = pv[i1].r << COLOR_SHIFT;
122                                 right[idx].g = pv[i1].g << COLOR_SHIFT;
123                                 right[idx].b = pv[i1].b << COLOR_SHIFT;
124 #endif
125 #ifdef TEXMAP
126                                 left[idx].u = pv[i0].u;
127                                 left[idx].v = pv[i0].v;
128                                 right[idx].u = pv[i1].u;
129                                 right[idx].v = pv[i1].v;
130 #endif
131                                 if(idx > slbot) slbot = idx;
132                                 if(idx < sltop) sltop = idx;
133                         /*}*/
134                 } else {
135                         struct pvertex *edge = y0 > y1 ? left : right;
136                         uint32_t res = SCANEDGE(pv + i, pv + next, edge);
137                         uint32_t tmp = (res >> 16) & 0xffff;
138                         if(tmp > slbot) slbot = tmp;
139                         if((tmp = res & 0xffff) < sltop) {
140                                 sltop = tmp;
141                         }
142                 }
143         }
144
145         /* calculate the slopes of all attributes across the largest span out
146          * of the three: middle, top, or bottom.
147          */
148 #ifndef HIGH_QUALITY
149 #if defined(GOURAUD) || defined(TEXMAP)
150         mid = (sltop + slbot) >> 1;
151         dx = right[mid].x - left[mid].x;
152         if((tmp = right[sltop].x - left[sltop].x) > dx) {
153                 dx = tmp;
154                 mid = sltop;
155         }
156         if((tmp = right[slbot].x - left[slbot].x) > dx) {
157                 dx = tmp;
158                 mid = slbot;
159         }
160         if(!dx) dx = 256;       /* avoid division by zero */
161 #endif
162 #ifdef GOURAUD
163         dr = right[mid].r - left[mid].r;
164         dg = right[mid].g - left[mid].g;
165         db = right[mid].b - left[mid].b;
166         rslope = (dr << 8) / dx;
167         gslope = (dg << 8) / dx;
168         bslope = (db << 8) / dx;
169 #endif
170 #ifdef TEXMAP
171         du = right[mid].u - left[mid].u;
172         dv = right[mid].v - left[mid].v;
173         uslope = (du << 8) / dx;
174         vslope = (dv << 8) / dx;
175 #endif
176 #endif  /* !defined(HIGH_QUALITY) */
177
178         /* for each scanline ... */
179         for(i=sltop; i<=slbot; i++) {
180                 uint16_t *pixptr;
181                 int32_t x;
182
183                 x = left[i].x;
184                 pixptr = pfill_fb.pixels + i * pfill_fb.width + (x >> 8);
185
186 #ifdef GOURAUD
187                 r = left[i].r;
188                 g = left[i].g;
189                 b = left[i].b;
190 #endif
191 #ifdef TEXMAP
192                 u = left[i].u;
193                 v = left[i].v;
194 #endif
195
196 #if defined(HIGH_QUALITY) && (defined(GOURAUD) || defined(TEXMAP))
197                 if(!(dx = right[i].x - left[i].x)) dx = 256;
198
199 #ifdef GOURAUD
200                 dr = right[i].r - left[i].r;
201                 dg = right[i].g - left[i].g;
202                 db = right[i].b - left[i].b;
203                 rslope = (dr << 8) / dx;
204                 gslope = (dg << 8) / dx;
205                 bslope = (db << 8) / dx;
206 #endif
207 #ifdef TEXMAP
208                 du = right[i].u - left[i].u;
209                 dv = right[i].v - left[i].v;
210                 uslope = (du << 8) / dx;
211                 vslope = (dv << 8) / dx;
212 #endif
213 #endif  /* HIGH_QUALITY */
214
215                 /* go across the scanline interpolating if necessary */
216                 while(x <= right[i].x) {
217 #if defined(GOURAUD) || defined(TEXMAP)
218                         int cr, cg, cb;
219 #endif
220 #ifdef GOURAUD
221                         /* we upped the color precision to while interpolating the
222                          * edges, now drop the extra bits before packing
223                          */
224                         cr = r < 0 ? 0 : (r >> COLOR_SHIFT);
225                         cg = g < 0 ? 0 : (g >> COLOR_SHIFT);
226                         cb = b < 0 ? 0 : (b >> COLOR_SHIFT);
227                         if(cr > 255) cr = 255;
228                         if(cg > 255) cg = 255;
229                         if(cb > 255) cb = 255;
230                         r += rslope;
231                         g += gslope;
232                         b += bslope;
233 #endif
234 #ifdef TEXMAP
235                         {
236                                 int tx = (u >> (16 - pfill_tex.xshift)) & pfill_tex.xmask;
237                                 int ty = (v >> (16 - pfill_tex.yshift)) & pfill_tex.ymask;
238                                 uint16_t texel = pfill_tex.pixels[(ty << pfill_tex.xshift) + tx];
239 #ifdef GOURAUD
240                                 /* This is not correct, should be /255, but it's much faster
241                                  * to shift by 8 (/256), and won't make a huge difference
242                                  */
243                                 cr = (cr * UNPACK_R16(texel)) >> 8;
244                                 cg = (cg * UNPACK_G16(texel)) >> 8;
245                                 cb = (cb * UNPACK_B16(texel)) >> 8;
246 #else
247                                 cr = UNPACK_R16(texel);
248                                 cg = UNPACK_G16(texel);
249                                 cb = UNPACK_B16(texel);
250 #endif
251                         }
252                         u += uslope;
253                         v += vslope;
254 #endif
255 #if defined(GOURAUD) || defined(TEXMAP)
256                         color = PACK_RGB16(cr, cg, cb);
257 #endif
258
259 #ifdef DEBUG_OVERDRAW
260                         *pixptr++ += DEBUG_OVERDRAW;
261 #else
262                         *pixptr++ = color;
263 #endif
264                         x += 256;
265                 }
266         }
267 }
268