1 /*
2
3 Copyright (C) 2015-2018 Night Dive Studios, LLC.
4
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation, either version 3 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>.
17
18 */
19 /*
20 * $Source: r:/prj/lib/src/2d/RCS/genll.c $
21 * $Revision: 1.3 $
22 * $Author: kevin $
23 * $Date: 1994/08/16 12:50:11 $
24 *
25 * Routines to linearly texture map a flat8 bitmap to a generic canvas.
26 *
27 * This file is part of the 2d library.
28 *
29 */
30
31 #include "cnvdat.h"
32 #include "fl8tf.h"
33 #include "fl8tmapdv.h"
34 #include "gente.h"
35 #include "poly.h"
36 #include "scrdat.h"
37 #include "tmapint.h"
38 #include "vtab.h"
39
40 int gri_lit_lin_umap_loop(grs_tmap_loop_info *tli);
41
42 // PPC specific optimized routines
43 /*extern "C"
44 {
45 int Handle_Lit_Lin_Loop_PPC(fix u, fix v, fix du, fix dv, fix dx,
46 grs_tmap_loop_info
47 *tli, uchar *start_pdest, uchar *t_bits, long gr_row, fix i, fix di, uchar *g_ltab, uchar t_wlog, ulong t_mask);
48
49 int Handle_TLit_Lin_Loop2_PPC(fix u, fix v, fix du, fix dv, fix dx,
50 grs_tmap_loop_info *tli, uchar *start_pdest, uchar *t_bits, long gr_row,
51 fix i, fix di, uchar *g_ltab, uchar t_wlog, ulong t_mask);
52 }*/
53
Handle_Lit_Lin_Loop_C(fix u,fix v,fix du,fix dv,fix dx,grs_tmap_loop_info * tli,uchar * start_pdest,uchar * t_bits,long gr_row,fix i,fix di,uchar * g_ltab,uchar t_wlog,ulong t_mask)54 int Handle_Lit_Lin_Loop_C(fix u, fix v, fix du, fix dv, fix dx, grs_tmap_loop_info *tli, uchar *start_pdest,
55 uchar *t_bits, long gr_row, fix i, fix di, uchar *g_ltab, uchar t_wlog, ulong t_mask) {
56 int x, t_xl, t_xr, inv;
57 uchar *p_dest;
58
59 tli->y += tli->n;
60
61 do {
62 if ((x = fix_ceil(tli->right.x) - fix_ceil(tli->left.x)) > 0) {
63 x = fix_div(fix_make(1, 0) << 8, dx);
64 di = fix_mul_asm_safe_light(di, x);
65 x >>= 8;
66 du = fix_mul_asm_safe(du, x);
67 dv = fix_mul_asm_safe(dv, x);
68
69 x = fix_ceil(tli->left.x) - tli->left.x;
70 u += fix_mul(du, x);
71 v += fix_mul(dv, x);
72 i += fix_mul(di, x);
73
74 // copy out tli-> stuff into locals
75 t_xl = fix_cint(tli->left.x);
76 t_xr = fix_cint(tli->right.x);
77 p_dest = start_pdest + t_xl;
78 x = t_xr - t_xl;
79
80 for (; x > 0; x--) {
81 *(p_dest++) = g_ltab[t_bits[((fix_fint(v) << t_wlog) + fix_fint(u)) & t_mask] + fix_light(i)];
82 u += du;
83 v += dv;
84 i += di;
85 }
86 } else if (x < 0)
87 return TRUE; // punt this tmap
88
89 u = (tli->left.u += tli->left.du);
90 tli->right.u += tli->right.du;
91 du = tli->right.u - u;
92 v = (tli->left.v += tli->left.dv);
93 tli->right.v += tli->right.dv;
94 dv = tli->right.v - v;
95 i = (tli->left.i += tli->left.di);
96 tli->right.i += tli->right.di;
97 di = tli->right.i - i;
98 tli->left.x += tli->left.dx;
99 tli->right.x += tli->right.dx;
100 dx = tli->right.x - tli->left.x;
101 start_pdest += gr_row;
102 } while (--(tli->n) > 0);
103 return FALSE; // tmap OK
104 }
105
Handle_TLit_Lin_Loop2_C(fix u,fix v,fix du,fix dv,fix dx,grs_tmap_loop_info * tli,uchar * start_pdest,uchar * t_bits,long gr_row,fix i,fix di,uchar * g_ltab,uchar t_wlog,ulong t_mask)106 int Handle_TLit_Lin_Loop2_C(fix u, fix v, fix du, fix dv, fix dx, grs_tmap_loop_info *tli, uchar *start_pdest,
107 uchar *t_bits, long gr_row, fix i, fix di, uchar *g_ltab, uchar t_wlog, ulong t_mask) {
108 int x, k;
109 uchar *p_dest;
110 int t_xl, t_xr;
111 int lx, rx;
112
113 lx = tli->left.x;
114 rx = tli->right.x;
115
116 tli->y += tli->n;
117 do {
118 if ((x = fix_ceil(rx) - fix_ceil(lx)) > 0) {
119 x = fix_ceil(lx) - lx;
120
121 k = fix_div(fix_make(1, 0) << 8, dx);
122 di = fix_mul_asm_safe_light(di, k);
123 k >>= 8;
124 du = fix_mul_asm_safe(du, k);
125 dv = fix_mul_asm_safe(dv, k);
126
127 u += fix_mul(du, x);
128 v += fix_mul(dv, x);
129 i += fix_mul(di, x);
130
131 // copy out tli-> stuff into locals
132 t_xl = fix_cint(lx);
133 t_xr = fix_cint(rx);
134 p_dest = start_pdest + t_xl;
135 x = t_xr - t_xl;
136
137 for (; x > 0; x--) {
138 // assume pixel in transparent first
139 k = ((fix_fint(v) << t_wlog) + fix_fint(u)) & t_mask;
140 k = t_bits[k];
141 if (k != 0) // not transparent, move to assuming opaque
142 *p_dest = g_ltab[k + fix_light(i)];
143
144 p_dest++;
145 u += du;
146 v += dv;
147 i += di;
148 }
149 } else if (x < 0)
150 return TRUE; // punt this tmap
151
152 u = (tli->left.u += tli->left.du);
153 tli->right.u += tli->right.du;
154 du = tli->right.u - u;
155 v = (tli->left.v += tli->left.dv);
156 tli->right.v += tli->right.dv;
157 dv = tli->right.v - v;
158 i = (tli->left.i += tli->left.di);
159 tli->right.i += tli->right.di;
160 di = tli->right.i - i;
161 lx += tli->left.dx;
162 rx += tli->right.dx;
163 dx = rx - lx;
164 start_pdest += gr_row;
165 } while (--(tli->n) > 0);
166
167 tli->left.x = lx;
168 tli->right.x = rx;
169
170 return FALSE; // tmap OK
171 }
172
gri_lit_lin_umap_loop(grs_tmap_loop_info * tli)173 int gri_lit_lin_umap_loop(grs_tmap_loop_info *tli) {
174 fix u, v, i, du, dv, di, dx, d;
175
176 // locals used to store copies of tli-> stuff, so its in registers on the PPC
177 register int x, k;
178 int t_xl, t_xr, inv;
179 int32_t *t_vtab;
180 uchar *t_bits;
181 uchar *p_dest;
182 uchar temp_pix;
183 uchar t_wlog;
184 ulong t_mask;
185 uchar *g_ltab;
186 long gr_row;
187 uchar *start_pdest;
188
189 u = tli->left.u;
190 du = tli->right.u - u;
191 v = tli->left.v;
192 dv = tli->right.v - v;
193 i = tli->left.i;
194 di = tli->right.i - i;
195 dx = tli->right.x - tli->left.x;
196
197 t_vtab = tli->vtab;
198 t_mask = tli->mask;
199 t_wlog = tli->bm.wlog;
200 g_ltab = grd_screen->ltab;
201
202 t_bits = tli->bm.bits;
203 gr_row = grd_bm.row;
204 start_pdest = grd_bm.bits + (gr_row * (tli->y));
205
206 // handle optimized cases first
207 if (tli->bm.hlog == (GRL_OPAQUE | GRL_LOG2))
208 return (
209 Handle_Lit_Lin_Loop_C(u, v, du, dv, dx, tli, start_pdest, t_bits, gr_row, i, di, g_ltab, t_wlog, t_mask));
210 if (tli->bm.hlog == (GRL_TRANS | GRL_LOG2))
211 return (
212 Handle_TLit_Lin_Loop2_C(u, v, du, dv, dx, tli, start_pdest, t_bits, gr_row, i, di, g_ltab, t_wlog, t_mask));
213
214 do {
215 if ((d = fix_ceil(tli->right.x) - fix_ceil(tli->left.x)) > 0) {
216 d = fix_ceil(tli->left.x) - tli->left.x;
217
218 #if InvDiv
219 k = fix_div(fix_make(1, 0) << 8, dx);
220 di = fix_mul_asm_safe_light(di, k);
221 k >>= 8;
222 du = fix_mul_asm_safe(du, k);
223 dv = fix_mul_asm_safe(dv, k);
224 #else
225 du = fix_div(du, dx);
226 dv = fix_div(dv, dx);
227 di = fix_div(di, dx);
228 #endif
229
230 u += fix_mul(du, d);
231 v += fix_mul(dv, d);
232 i += fix_mul(di, d);
233
234 // copy out tli-> stuff into locals
235 t_xl = fix_cint(tli->left.x);
236 t_xr = fix_cint(tli->right.x);
237 p_dest = start_pdest + t_xl;
238 x = t_xr - t_xl;
239
240 switch (tli->bm.hlog) {
241 case GRL_OPAQUE:
242 for (; x > 0; x--) {
243 k = t_vtab[fix_fint(v)] + fix_fint(u);
244 *(p_dest++) =
245 g_ltab[t_bits[k] + fix_light(i)]; // gr_fill_upixel(g_ltab[t_bits[k]+fix_light(i)],x,t_y);
246 u += du;
247 v += dv;
248 i += di;
249 }
250 break;
251 case GRL_TRANS:
252 for (; x > 0; x--) {
253 k = t_vtab[fix_fint(v)] + fix_fint(u);
254 k = t_bits[k];
255 if (k != 0)
256 *p_dest = g_ltab[k + fix_light(i)]; // gr_fill_upixel(g_ltab[k+fix_light(i)],x,t_y);
257 p_dest++;
258 u += du;
259 v += dv;
260 i += di;
261 }
262 break;
263 // handled in special case code
264 case GRL_OPAQUE | GRL_LOG2:
265 for (; x > 0; x--) {
266 k = ((fix_fint(v) << t_wlog) + fix_fint(u)) & t_mask;
267 *(p_dest++) =
268 g_ltab[t_bits[k] + fix_light(i)]; // gr_fill_upixel(g_ltab[t_bits[k]+fix_light(i)],x,t_y);
269 u += du;
270 v += dv;
271 i += di;
272 }
273 break;
274 case GRL_TRANS | GRL_LOG2:
275 for (; x > 0; x--) {
276 k = ((fix_fint(v) << t_wlog) + fix_fint(u)) & t_mask;
277 k = t_bits[k];
278 if (k != 0)
279 *p_dest = g_ltab[k + fix_light(i)]; // gr_fill_upixel(g_ltab[k+fix_light(i)],x,t_y);
280 p_dest++;
281 u += du;
282 v += dv;
283 i += di;
284 }
285 break;
286 }
287 } else if (d < 0)
288 return TRUE; /* punt this tmap */
289
290 u = (tli->left.u += tli->left.du);
291 tli->right.u += tli->right.du;
292 du = tli->right.u - u;
293 v = (tli->left.v += tli->left.dv);
294 tli->right.v += tli->right.dv;
295 dv = tli->right.v - v;
296 i = (tli->left.i += tli->left.di);
297 tli->right.i += tli->right.di;
298 di = tli->right.i - i;
299 tli->left.x += tli->left.dx;
300 tli->right.x += tli->right.dx;
301 dx = tli->right.x - tli->left.x;
302 tli->y++;
303 start_pdest += gr_row;
304 } while (--(tli->n) > 0);
305 return FALSE; /* tmap OK */
306 }
307
gri_trans_lit_lin_umap_init(grs_tmap_loop_info * tli)308 void gri_trans_lit_lin_umap_init(grs_tmap_loop_info *tli) {
309 if ((tli->bm.row == (1 << tli->bm.wlog)) && (tli->bm.h == (1 << tli->bm.hlog))) {
310 tli->mask = (1 << (tli->bm.hlog + tli->bm.wlog)) - 1;
311 tli->bm.hlog = GRL_TRANS | GRL_LOG2;
312 } else {
313 tli->vtab = gr_make_vtab(&(tli->bm));
314 tli->bm.hlog = GRL_TRANS;
315 }
316 tli->loop_func = (void (*)())gri_lit_lin_umap_loop;
317 tli->right_edge_func = (void (*)())gri_uvix_edge;
318 tli->left_edge_func = (void (*)())gri_uvix_edge;
319 }
320
gri_opaque_lit_lin_umap_init(grs_tmap_loop_info * tli)321 void gri_opaque_lit_lin_umap_init(grs_tmap_loop_info *tli) {
322 if ((tli->bm.row == (1 << tli->bm.wlog)) && (tli->bm.h == (1 << tli->bm.hlog))) {
323 tli->mask = (1 << (tli->bm.hlog + tli->bm.wlog)) - 1;
324 tli->bm.hlog = GRL_OPAQUE | GRL_LOG2;
325 } else {
326 tli->vtab = gr_make_vtab(&(tli->bm));
327 tli->bm.hlog = GRL_OPAQUE;
328 }
329
330 tli->loop_func = (void (*)())gri_lit_lin_umap_loop;
331 tli->right_edge_func = (void (*)())gri_uvix_edge;
332 tli->left_edge_func = (void (*)())gri_uvix_edge;
333 }
334