BITBLT.C 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998
  1. /*
  2. THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
  3. SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
  4. END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
  5. ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
  6. IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
  7. SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
  8. FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
  9. CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
  10. AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
  11. COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
  12. */
  13. /*
  14. * $Source: f:/miner/source/2d/rcs/bitblt.c $
  15. * $Revision: 1.29 $
  16. * $Author: john $
  17. * $Date: 1995/03/14 12:14:28 $
  18. *
  19. * Routines for bitblt's.
  20. *
  21. * $Log: bitblt.c $
  22. * Revision 1.29 1995/03/14 12:14:28 john
  23. * Added code to double horz/vert bitblts.
  24. *
  25. * Revision 1.28 1995/03/13 09:01:48 john
  26. * Fixed bug with VFX1 screen not tall enough.
  27. *
  28. * Revision 1.27 1995/03/01 15:38:10 john
  29. * Better ModeX support.
  30. *
  31. * Revision 1.26 1994/12/15 12:19:00 john
  32. * Added gr_bm_bitblt (clipped!) function.
  33. *
  34. * Revision 1.25 1994/12/09 18:58:42 matt
  35. * Took out include of 3d.h
  36. *
  37. * Revision 1.24 1994/11/28 17:08:32 john
  38. * Took out some unused functions in linear.asm, moved
  39. * gr_linear_movsd from linear.asm to bitblt.c, made sure that
  40. * the code in ibiblt.c sets the direction flags before rep movsing.
  41. *
  42. * Revision 1.22 1994/11/23 16:04:00 john
  43. * Fixed generic rle'ing to use new bit method.
  44. *
  45. * Revision 1.21 1994/11/18 22:51:03 john
  46. * Changed a bunch of shorts to ints in calls.
  47. *
  48. * Revision 1.20 1994/11/10 15:59:48 john
  49. * Fixed bugs with canvas's being created with bogus bm_flags.
  50. *
  51. * Revision 1.19 1994/11/09 21:03:35 john
  52. * Added RLE for svga gr_ubitmap.
  53. *
  54. * Revision 1.18 1994/11/09 17:41:29 john
  55. * Made a slow version of rle bitblt to svga, modex.
  56. *
  57. * Revision 1.17 1994/11/09 16:35:15 john
  58. * First version with working RLE bitmaps.
  59. *
  60. * Revision 1.16 1994/11/04 10:06:58 john
  61. * Added fade table for fading fonts. Made font that partially clips
  62. * not print a warning message.
  63. *
  64. * Revision 1.15 1994/09/22 16:08:38 john
  65. * Fixed some palette stuff.
  66. *
  67. * Revision 1.14 1994/09/19 11:44:27 john
  68. * Changed call to allocate selector to the dpmi module.
  69. *
  70. * Revision 1.13 1994/08/08 13:03:00 john
  71. * Fixed bug in gr_bitmap in modex
  72. *
  73. * Revision 1.12 1994/07/13 19:47:23 john
  74. * Fixed bug with modex bitblt to page 2 not working.
  75. *
  76. * Revision 1.11 1994/05/31 11:10:52 john
  77. * *** empty log message ***
  78. *
  79. * Revision 1.10 1994/03/18 15:24:34 matt
  80. * Removed interlace stuff
  81. *
  82. * Revision 1.9 1994/02/18 15:32:20 john
  83. * *** empty log message ***
  84. *
  85. * Revision 1.8 1994/02/01 13:22:54 john
  86. * *** empty log message ***
  87. *
  88. * Revision 1.7 1994/01/13 08:28:25 mike
  89. * Modify rect copy to copy alternate scanlines when in interlaced mode.
  90. *
  91. * Revision 1.6 1993/12/28 12:09:46 john
  92. * added lbitblt.asm
  93. *
  94. * Revision 1.5 1993/10/26 13:18:09 john
  95. * *** empty log message ***
  96. *
  97. * Revision 1.4 1993/10/15 16:23:30 john
  98. * y
  99. *
  100. * Revision 1.3 1993/09/13 17:52:58 john
  101. * Fixed bug in BitBlt linear to SVGA
  102. *
  103. * Revision 1.2 1993/09/08 14:47:00 john
  104. * Made bitmap00 add rowsize instead of bitmap width.
  105. * Other routines might have this problem too.
  106. *
  107. * Revision 1.1 1993/09/08 11:43:01 john
  108. * Initial revision
  109. *
  110. *
  111. */
  112. #include "mem.h"
  113. #include "gr.h"
  114. #include "grdef.h"
  115. #include "rle.h"
  116. #include "mono.h"
  117. int gr_bitblt_dest_step_shift = 0;
  118. int gr_bitblt_double = 0;
  119. ubyte *gr_bitblt_fade_table=NULL;
  120. extern void gr_vesa_bitmap( grs_bitmap * source, grs_bitmap * dest, int x, int y );
  121. // This code aligns edi so that the destination is aligned to a dword boundry before rep movsd
  122. void gr_linear_movsd(ubyte * src, ubyte * dest, int num_pixels );
  123. #pragma aux gr_linear_movsd parm [esi] [edi] [ecx] modify exact [ecx esi edi eax ebx] = \
  124. " cld " \
  125. " mov ebx, ecx " \
  126. " mov eax, edi" \
  127. " and eax, 011b" \
  128. " jz d_aligned" \
  129. " mov ecx, 4" \
  130. " sub ecx, eax" \
  131. " sub ebx, ecx" \
  132. " rep movsb" \
  133. " d_aligned: " \
  134. " mov ecx, ebx" \
  135. " shr ecx, 2" \
  136. " rep movsd" \
  137. " mov ecx, ebx" \
  138. " and ecx, 11b" \
  139. " rep movsb";
  140. void gr_linear_rep_movsdm(ubyte * src, ubyte * dest, int num_pixels );
  141. #pragma aux gr_linear_rep_movsdm parm [esi] [edi] [ecx] modify exact [ecx esi edi eax] = \
  142. "nextpixel:" \
  143. "mov al,[esi]" \
  144. "inc esi" \
  145. "cmp al, 255" \
  146. "je skip_it" \
  147. "mov [edi], al" \
  148. "skip_it:" \
  149. "inc edi" \
  150. "dec ecx" \
  151. "jne nextpixel";
  152. void gr_linear_rep_movsdm_faded(ubyte * src, ubyte * dest, int num_pixels, ubyte fade_value );
  153. #pragma aux gr_linear_rep_movsdm_faded parm [esi] [edi] [ecx] [ebx] modify exact [ecx esi edi eax ebx] = \
  154. " xor eax, eax" \
  155. " mov ah, bl" \
  156. "nextpixel:" \
  157. "mov al,[esi]" \
  158. "inc esi" \
  159. "cmp al, 255" \
  160. "je skip_it" \
  161. "mov al, gr_fade_table[eax]" \
  162. "mov [edi], al" \
  163. "skip_it:" \
  164. "inc edi" \
  165. "dec ecx" \
  166. "jne nextpixel";
  167. void gr_linear_rep_movsd_2x(ubyte * src, ubyte * dest, int num_dest_pixels );
  168. #pragma aux gr_linear_rep_movsd_2x parm [esi] [edi] [ecx] modify exact [ecx esi edi eax ebx] = \
  169. "shr ecx, 1" \
  170. "jnc nextpixel" \
  171. "mov al, [esi]" \
  172. "mov [edi], al" \
  173. "inc esi" \
  174. "inc edi" \
  175. "cmp ecx, 0" \
  176. "je done" \
  177. "nextpixel:" \
  178. "mov al,[esi]" \
  179. "mov ah, al" \
  180. "mov [edi], ax" \
  181. "inc esi" \
  182. "inc edi" \
  183. "inc edi" \
  184. "dec ecx" \
  185. "jne nextpixel" \
  186. "done:"
  187. void modex_copy_column(ubyte * src, ubyte * dest, int num_pixels, int src_rowsize, int dest_rowsize );
  188. #pragma aux modex_copy_column parm [esi] [edi] [ecx] [ebx] [edx] modify exact [ecx esi edi] = \
  189. "nextpixel:" \
  190. "mov al,[esi]" \
  191. "add esi, ebx" \
  192. "mov [edi], al" \
  193. "add edi, edx" \
  194. "dec ecx" \
  195. "jne nextpixel"
  196. void modex_copy_column_m(ubyte * src, ubyte * dest, int num_pixels, int src_rowsize, int dest_rowsize );
  197. #pragma aux modex_copy_column_m parm [esi] [edi] [ecx] [ebx] [edx] modify exact [ecx esi edi] = \
  198. "nextpixel:" \
  199. "mov al,[esi]" \
  200. "add esi, ebx" \
  201. "cmp al, 255" \
  202. "je skip_itx" \
  203. "mov [edi], al" \
  204. "skip_itx:" \
  205. "add edi, edx" \
  206. "dec ecx" \
  207. "jne nextpixel"
  208. void gr_ubitmap00( int x, int y, grs_bitmap *bm )
  209. {
  210. register int y1;
  211. int dest_rowsize;
  212. unsigned char * dest;
  213. unsigned char * src;
  214. dest_rowsize=grd_curcanv->cv_bitmap.bm_rowsize << gr_bitblt_dest_step_shift;
  215. dest = &(grd_curcanv->cv_bitmap.bm_data[ dest_rowsize*y+x ]);
  216. src = bm->bm_data;
  217. for (y1=0; y1 < bm->bm_h; y1++ ) {
  218. if (gr_bitblt_double)
  219. gr_linear_rep_movsd_2x( src, dest, bm->bm_w );
  220. else
  221. gr_linear_movsd( src, dest, bm->bm_w );
  222. src += bm->bm_rowsize;
  223. dest+= (int)(dest_rowsize);
  224. }
  225. }
  226. void gr_ubitmap00m( int x, int y, grs_bitmap *bm )
  227. {
  228. register int y1;
  229. int dest_rowsize;
  230. unsigned char * dest;
  231. unsigned char * src;
  232. dest_rowsize=grd_curcanv->cv_bitmap.bm_rowsize << gr_bitblt_dest_step_shift;
  233. dest = &(grd_curcanv->cv_bitmap.bm_data[ dest_rowsize*y+x ]);
  234. src = bm->bm_data;
  235. if (gr_bitblt_fade_table==NULL) {
  236. for (y1=0; y1 < bm->bm_h; y1++ ) {
  237. gr_linear_rep_movsdm( src, dest, bm->bm_w );
  238. src += bm->bm_rowsize;
  239. dest+= (int)(dest_rowsize);
  240. }
  241. } else {
  242. for (y1=0; y1 < bm->bm_h; y1++ ) {
  243. gr_linear_rep_movsdm_faded( src, dest, bm->bm_w, gr_bitblt_fade_table[y1+y] );
  244. src += bm->bm_rowsize;
  245. dest+= (int)(dest_rowsize);
  246. }
  247. }
  248. }
  249. //" jmp aligned4 " \
  250. //" mov eax, edi " \
  251. //" and eax, 11b " \
  252. //" jz aligned4 " \
  253. //" mov ebx, 4 " \
  254. //" sub ebx, eax " \
  255. //" sub ecx, ebx " \
  256. //"alignstart: " \
  257. //" mov al, [esi] " \
  258. //" add esi, 4 " \
  259. //" mov [edi], al " \
  260. //" inc edi " \
  261. //" dec ebx " \
  262. //" jne alignstart " \
  263. //"aligned4: " \
  264. void modex_copy_scanline( ubyte * src, ubyte * dest, int npixels );
  265. #pragma aux modex_copy_scanline parm [esi] [edi] [ecx] modify exact [ecx esi edi eax ebx edx] = \
  266. " mov ebx, ecx " \
  267. " and ebx, 11b " \
  268. " shr ecx, 2 " \
  269. " cmp ecx, 0 " \
  270. " je no2group " \
  271. "next4pixels: " \
  272. " mov al, [esi+8] " \
  273. " mov ah, [esi+12] " \
  274. " shl eax, 16 " \
  275. " mov al, [esi] " \
  276. " mov ah, [esi+4] " \
  277. " mov [edi], eax " \
  278. " add esi, 16 " \
  279. " add edi, 4 " \
  280. " dec ecx " \
  281. " jne next4pixels " \
  282. "no2group: " \
  283. " cmp ebx, 0 " \
  284. " je done2 " \
  285. "finishend: " \
  286. " mov al, [esi] " \
  287. " add esi, 4 " \
  288. " mov [edi], al " \
  289. " inc edi " \
  290. " dec ebx " \
  291. " jne finishend " \
  292. "done2: ";
  293. void modex_copy_scanline_2x( ubyte * src, ubyte * dest, int npixels );
  294. #pragma aux modex_copy_scanline_2x parm [esi] [edi] [ecx] modify exact [ecx esi edi eax ebx edx] = \
  295. " mov ebx, ecx " \
  296. " and ebx, 11b " \
  297. " shr ecx, 2 " \
  298. " cmp ecx, 0 " \
  299. " je no2group " \
  300. "next4pixels: " \
  301. " mov al, [esi+4] " \
  302. " mov ah, [esi+6] " \
  303. " shl eax, 16 " \
  304. " mov al, [esi] " \
  305. " mov ah, [esi+2] " \
  306. " mov [edi], eax " \
  307. " add esi, 8 " \
  308. " add edi, 4 " \
  309. " dec ecx " \
  310. " jne next4pixels " \
  311. "no2group: " \
  312. " cmp ebx, 0 " \
  313. " je done2 " \
  314. "finishend: " \
  315. " mov al, [esi] " \
  316. " add esi, 2 " \
  317. " mov [edi], al " \
  318. " inc edi " \
  319. " dec ebx " \
  320. " jne finishend " \
  321. "done2: ";
  322. // From Linear to ModeX
  323. void gr_bm_ubitblt01(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  324. {
  325. ubyte * dbits;
  326. ubyte * sbits;
  327. int sstep,dstep;
  328. int y,plane;
  329. int w1;
  330. if ( w < 4 ) return;
  331. sstep = src->bm_rowsize;
  332. dstep = dest->bm_rowsize << gr_bitblt_dest_step_shift;
  333. if (!gr_bitblt_double) {
  334. for (plane=0; plane<4; plane++ ) {
  335. gr_modex_setplane( (plane+dx)&3 );
  336. sbits = src->bm_data + (src->bm_rowsize * sy) + sx + plane;
  337. dbits = &gr_video_memory[(dest->bm_rowsize * dy) + ((plane+dx)/4) ];
  338. w1 = w >> 2;
  339. if ( (w&3) > plane ) w1++;
  340. for (y=dy; y < dy+h; y++ ) {
  341. modex_copy_scanline( sbits, dbits, w1 );
  342. dbits += dstep;
  343. sbits += sstep;
  344. }
  345. }
  346. } else {
  347. for (plane=0; plane<4; plane++ ) {
  348. gr_modex_setplane( (plane+dx)&3 );
  349. sbits = src->bm_data + (src->bm_rowsize * sy) + sx + plane/2;
  350. dbits = &gr_video_memory[(dest->bm_rowsize * dy) + ((plane+dx)/4) ];
  351. w1 = w >> 2;
  352. if ( (w&3) > plane ) w1++;
  353. for (y=dy; y < dy+h; y++ ) {
  354. modex_copy_scanline_2x( sbits, dbits, w1 );
  355. dbits += dstep;
  356. sbits += sstep;
  357. }
  358. }
  359. }
  360. }
  361. // From Linear to ModeX masked
  362. void gr_bm_ubitblt01m(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  363. {
  364. //ubyte * dbits1;
  365. //ubyte * sbits1;
  366. ubyte * dbits;
  367. ubyte * sbits;
  368. int x;
  369. // int y;
  370. sbits = src->bm_data + (src->bm_rowsize * sy) + sx;
  371. dbits = &gr_video_memory[(dest->bm_rowsize * dy) + dx/4];
  372. for (x=dx; x < dx+w; x++ ) {
  373. gr_modex_setplane( x&3 );
  374. //sbits1 = sbits;
  375. //dbits1 = dbits;
  376. //for (y=0; y < h; y++ ) {
  377. // *dbits1 = *sbits1;
  378. // sbits1 += src_bm_rowsize;
  379. // dbits1 += dest_bm_rowsize;
  380. // }
  381. modex_copy_column_m(sbits, dbits, h, src->bm_rowsize, dest->bm_rowsize << gr_bitblt_dest_step_shift );
  382. sbits++;
  383. if ( (x&3)==3 )
  384. dbits++;
  385. }
  386. }
  387. void gr_ubitmap012( int x, int y, grs_bitmap *bm )
  388. {
  389. register int x1, y1;
  390. unsigned char * src;
  391. src = bm->bm_data;
  392. for (y1=y; y1 < (y+bm->bm_h); y1++ ) {
  393. for (x1=x; x1 < (x+bm->bm_w); x1++ ) {
  394. gr_setcolor( *src++ );
  395. gr_upixel( x1, y1 );
  396. }
  397. }
  398. }
  399. void gr_ubitmap012m( int x, int y, grs_bitmap *bm )
  400. {
  401. register int x1, y1;
  402. unsigned char * src;
  403. src = bm->bm_data;
  404. for (y1=y; y1 < (y+bm->bm_h); y1++ ) {
  405. for (x1=x; x1 < (x+bm->bm_w); x1++ ) {
  406. if ( *src != 255 ) {
  407. gr_setcolor( *src );
  408. gr_upixel( x1, y1 );
  409. }
  410. src++;
  411. }
  412. }
  413. }
  414. void gr_ubitmapGENERIC(int x, int y, grs_bitmap * bm)
  415. {
  416. register int x1, y1;
  417. for (y1=0; y1 < bm->bm_h; y1++ ) {
  418. for (x1=0; x1 < bm->bm_w; x1++ ) {
  419. gr_setcolor( gr_gpixel(bm,x1,y1) );
  420. gr_upixel( x+x1, y+y1 );
  421. }
  422. }
  423. }
  424. void gr_ubitmapGENERICm(int x, int y, grs_bitmap * bm)
  425. {
  426. register int x1, y1;
  427. ubyte c;
  428. for (y1=0; y1 < bm->bm_h; y1++ ) {
  429. for (x1=0; x1 < bm->bm_w; x1++ ) {
  430. c = gr_gpixel(bm,x1,y1);
  431. if ( c != 255 ) {
  432. gr_setcolor( c );
  433. gr_upixel( x+x1, y+y1 );
  434. }
  435. }
  436. }
  437. }
  438. void gr_ubitmap( int x, int y, grs_bitmap *bm )
  439. { int source, dest;
  440. source = bm->bm_type;
  441. dest = TYPE;
  442. if (source==BM_LINEAR) {
  443. switch( dest )
  444. {
  445. case BM_LINEAR:
  446. if ( bm->bm_flags & BM_FLAG_RLE )
  447. gr_bm_ubitblt00_rle(bm->bm_w, bm->bm_h, x, y, 0, 0, bm, &grd_curcanv->cv_bitmap );
  448. else
  449. gr_ubitmap00( x, y, bm );
  450. return;
  451. case BM_SVGA:
  452. if ( bm->bm_flags & BM_FLAG_RLE )
  453. gr_bm_ubitblt0x_rle(bm->bm_w, bm->bm_h, x, y, 0, 0, bm, &grd_curcanv->cv_bitmap );
  454. else
  455. gr_vesa_bitmap( bm, &grd_curcanv->cv_bitmap, x, y );
  456. return;
  457. case BM_MODEX:
  458. gr_bm_ubitblt01(bm->bm_w, bm->bm_h, x+XOFFSET, y+YOFFSET, 0, 0, bm, &grd_curcanv->cv_bitmap);
  459. return;
  460. default:
  461. gr_ubitmap012( x, y, bm );
  462. return;
  463. }
  464. } else {
  465. gr_ubitmapGENERIC(x, y, bm);
  466. }
  467. }
  468. void gr_ubitmapm( int x, int y, grs_bitmap *bm )
  469. { int source, dest;
  470. source = bm->bm_type;
  471. dest = TYPE;
  472. if (source==BM_LINEAR) {
  473. switch( dest )
  474. {
  475. case BM_LINEAR:
  476. if ( bm->bm_flags & BM_FLAG_RLE )
  477. gr_bm_ubitblt00m_rle(bm->bm_w, bm->bm_h, x, y, 0, 0, bm, &grd_curcanv->cv_bitmap );
  478. else
  479. gr_ubitmap00m( x, y, bm );
  480. return;
  481. case BM_SVGA:
  482. gr_ubitmapGENERICm(x, y, bm);
  483. return;
  484. case BM_MODEX:
  485. gr_bm_ubitblt01m(bm->bm_w, bm->bm_h, x+XOFFSET, y+YOFFSET, 0, 0, bm, &grd_curcanv->cv_bitmap);
  486. return;
  487. default:
  488. gr_ubitmap012m( x, y, bm );
  489. return;
  490. }
  491. } else {
  492. gr_ubitmapGENERICm(x, y, bm);
  493. }
  494. }
  495. // From linear to SVGA
  496. void gr_bm_ubitblt02(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  497. {
  498. unsigned char * sbits;
  499. unsigned int offset, EndingOffset, VideoLocation;
  500. int sbpr, dbpr, y1, page, BytesToMove;
  501. sbpr = src->bm_rowsize;
  502. dbpr = dest->bm_rowsize << gr_bitblt_dest_step_shift;
  503. VideoLocation = (unsigned int)dest->bm_data + (dest->bm_rowsize * dy) + dx;
  504. sbits = src->bm_data + ( sbpr*sy ) + sx;
  505. for (y1=0; y1 < h; y1++ ) {
  506. page = VideoLocation >> 16;
  507. offset = VideoLocation & 0xFFFF;
  508. gr_vesa_setpage( page );
  509. EndingOffset = offset+w-1;
  510. if ( EndingOffset <= 0xFFFF )
  511. {
  512. if ( gr_bitblt_double )
  513. gr_linear_rep_movsd_2x( (void *)sbits, (void *)(offset+0xA0000), w );
  514. else
  515. gr_linear_movsd( (void *)sbits, (void *)(offset+0xA0000), w );
  516. VideoLocation += dbpr;
  517. sbits += sbpr;
  518. }
  519. else
  520. {
  521. BytesToMove = 0xFFFF-offset+1;
  522. if ( gr_bitblt_double )
  523. gr_linear_rep_movsd_2x( (void *)sbits, (void *)(offset+0xA0000), BytesToMove );
  524. else
  525. gr_linear_movsd( (void *)sbits, (void *)(offset+0xA0000), BytesToMove );
  526. page++;
  527. gr_vesa_setpage(page);
  528. if ( gr_bitblt_double )
  529. gr_linear_rep_movsd_2x( (void *)(sbits+BytesToMove/2), (void *)0xA0000, EndingOffset - 0xFFFF );
  530. else
  531. gr_linear_movsd( (void *)(sbits+BytesToMove), (void *)0xA0000, EndingOffset - 0xFFFF );
  532. VideoLocation += dbpr;
  533. sbits += sbpr;
  534. }
  535. }
  536. }
  537. // From SVGA to linear
  538. void gr_bm_ubitblt20(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  539. {
  540. unsigned char * dbits;
  541. unsigned int offset, offset1, offset2;
  542. int sbpr, dbpr, y1, page;
  543. dbpr = dest->bm_rowsize;
  544. sbpr = src->bm_rowsize;
  545. for (y1=0; y1 < h; y1++ ) {
  546. offset2 = (unsigned int)src->bm_data + (sbpr * (y1+sy)) + sx;
  547. dbits = dest->bm_data + (dbpr * (y1+dy)) + dx;
  548. page = offset2 >> 16;
  549. offset = offset2 & 0xFFFF;
  550. offset1 = offset+w-1;
  551. gr_vesa_setpage( page );
  552. if ( offset1 > 0xFFFF ) {
  553. // Overlaps two pages
  554. while( offset <= 0xFFFF )
  555. *dbits++ = gr_video_memory[offset++];
  556. offset1 -= (0xFFFF+1);
  557. offset = 0;
  558. page++;
  559. gr_vesa_setpage(page);
  560. }
  561. while( offset <= offset1 )
  562. *dbits++ = gr_video_memory[offset++];
  563. }
  564. }
  565. //@extern int Interlacing_on;
  566. // From Linear to Linear
  567. void gr_bm_ubitblt00(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  568. {
  569. unsigned char * dbits;
  570. unsigned char * sbits;
  571. //int src_bm_rowsize_2, dest_bm_rowsize_2;
  572. int dstep;
  573. int i;
  574. sbits = src->bm_data + (src->bm_rowsize * sy) + sx;
  575. dbits = dest->bm_data + (dest->bm_rowsize * dy) + dx;
  576. dstep = dest->bm_rowsize << gr_bitblt_dest_step_shift;
  577. // No interlacing, copy the whole buffer.
  578. for (i=0; i < h; i++ ) {
  579. if (gr_bitblt_double)
  580. gr_linear_rep_movsd_2x( sbits, dbits, w );
  581. else
  582. gr_linear_movsd( sbits, dbits, w );
  583. sbits += src->bm_rowsize;
  584. dbits += dstep;
  585. }
  586. }
  587. // From Linear to Linear Masked
  588. void gr_bm_ubitblt00m(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  589. {
  590. unsigned char * dbits;
  591. unsigned char * sbits;
  592. //int src_bm_rowsize_2, dest_bm_rowsize_2;
  593. int i;
  594. sbits = src->bm_data + (src->bm_rowsize * sy) + sx;
  595. dbits = dest->bm_data + (dest->bm_rowsize * dy) + dx;
  596. // No interlacing, copy the whole buffer.
  597. if (gr_bitblt_fade_table==NULL) {
  598. for (i=0; i < h; i++ ) {
  599. gr_linear_rep_movsdm( sbits, dbits, w );
  600. sbits += src->bm_rowsize;
  601. dbits += dest->bm_rowsize;
  602. }
  603. } else {
  604. for (i=0; i < h; i++ ) {
  605. gr_linear_rep_movsdm_faded( sbits, dbits, w, gr_bitblt_fade_table[dy+i] );
  606. sbits += src->bm_rowsize;
  607. dbits += dest->bm_rowsize;
  608. }
  609. }
  610. }
  611. extern void gr_lbitblt( grs_bitmap * source, grs_bitmap * dest, int height, int width );
  612. void gr_bm_bitblt(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  613. {
  614. int dx1=dx, dx2=dx+dest->bm_w-1;
  615. int dy1=dy, dy2=dy+dest->bm_h-1;
  616. int sx1=sx, sx2=sx+src->bm_w-1;
  617. int sy1=sy, sy2=sy+src->bm_h-1;
  618. if ((dx1 >= dest->bm_w ) || (dx2 < 0)) return;
  619. if ((dy1 >= dest->bm_h ) || (dy2 < 0)) return;
  620. if ( dx1 < 0 ) { sx1 += -dx1; dx1 = 0; }
  621. if ( dy1 < 0 ) { sy1 += -dy1; dy1 = 0; }
  622. if ( dx2 >= dest->bm_w ) { dx2 = dest->bm_w-1; }
  623. if ( dy2 >= dest->bm_h ) { dy2 = dest->bm_h-1; }
  624. if ((sx1 >= src->bm_w ) || (sx2 < 0)) return;
  625. if ((sy1 >= src->bm_h ) || (sy2 < 0)) return;
  626. if ( sx1 < 0 ) { dx1 += -sx1; sx1 = 0; }
  627. if ( sy1 < 0 ) { dy1 += -sy1; sy1 = 0; }
  628. if ( sx2 >= src->bm_w ) { sx2 = src->bm_w-1; }
  629. if ( sy2 >= src->bm_h ) { sy2 = src->bm_h-1; }
  630. // Draw bitmap bm[x,y] into (dx1,dy1)-(dx2,dy2)
  631. if ( dx2-dx1+1 < w )
  632. w = dx2-dx1+1;
  633. if ( dy2-dy1+1 < h )
  634. h = dy2-dy1+1;
  635. if ( sx2-sx1+1 < w )
  636. w = sx2-sx1+1;
  637. if ( sy2-sy1+1 < h )
  638. h = sy2-sy1+1;
  639. gr_bm_ubitblt(w,h, dx1, dy1, sx1, sy1, src, dest );
  640. }
  641. void gr_bm_ubitblt(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  642. {
  643. register int x1, y1;
  644. if ( (src->bm_type == BM_LINEAR) && (dest->bm_type == BM_LINEAR ))
  645. {
  646. if ( src->bm_flags & BM_FLAG_RLE )
  647. gr_bm_ubitblt00_rle( w, h, dx, dy, sx, sy, src, dest );
  648. else
  649. gr_bm_ubitblt00( w, h, dx, dy, sx, sy, src, dest );
  650. return;
  651. }
  652. if ( (src->bm_flags & BM_FLAG_RLE ) && (src->bm_type == BM_LINEAR) ) {
  653. gr_bm_ubitblt0x_rle(w, h, dx, dy, sx, sy, src, dest );
  654. return;
  655. }
  656. if ( (src->bm_type == BM_LINEAR) && (dest->bm_type == BM_SVGA ))
  657. {
  658. gr_bm_ubitblt02( w, h, dx, dy, sx, sy, src, dest );
  659. return;
  660. }
  661. if ( (src->bm_type == BM_SVGA) && (dest->bm_type == BM_LINEAR ))
  662. {
  663. gr_bm_ubitblt20( w, h, dx, dy, sx, sy, src, dest );
  664. return;
  665. }
  666. if ( (src->bm_type == BM_LINEAR) && (dest->bm_type == BM_MODEX ))
  667. {
  668. gr_bm_ubitblt01( w, h, dx+XOFFSET, dy+YOFFSET, sx, sy, src, dest );
  669. return;
  670. }
  671. for (y1=0; y1 < h; y1++ ) {
  672. for (x1=0; x1 < w; x1++ ) {
  673. gr_bm_pixel( dest, dx+x1, dy+y1, gr_gpixel(src,sx+x1,sy+y1) );
  674. }
  675. }
  676. }
  677. // Clipped bitmap ...
  678. void gr_bitmap( int x, int y, grs_bitmap *bm )
  679. {
  680. int dx1=x, dx2=x+bm->bm_w-1;
  681. int dy1=y, dy2=y+bm->bm_h-1;
  682. int sx=0, sy=0;
  683. if ((dx1 >= grd_curcanv->cv_bitmap.bm_w ) || (dx2 < 0)) return;
  684. if ((dy1 >= grd_curcanv->cv_bitmap.bm_h) || (dy2 < 0)) return;
  685. if ( dx1 < 0 ) { sx = -dx1; dx1 = 0; }
  686. if ( dy1 < 0 ) { sy = -dy1; dy1 = 0; }
  687. if ( dx2 >= grd_curcanv->cv_bitmap.bm_w ) { dx2 = grd_curcanv->cv_bitmap.bm_w-1; }
  688. if ( dy2 >= grd_curcanv->cv_bitmap.bm_h ) { dy2 = grd_curcanv->cv_bitmap.bm_h-1; }
  689. // Draw bitmap bm[x,y] into (dx1,dy1)-(dx2,dy2)
  690. gr_bm_ubitblt(dx2-dx1+1,dy2-dy1+1, dx1, dy1, sx, sy, bm, &grd_curcanv->cv_bitmap );
  691. }
  692. void gr_bitmapm( int x, int y, grs_bitmap *bm )
  693. {
  694. int dx1=x, dx2=x+bm->bm_w-1;
  695. int dy1=y, dy2=y+bm->bm_h-1;
  696. int sx=0, sy=0;
  697. if ((dx1 >= grd_curcanv->cv_bitmap.bm_w ) || (dx2 < 0)) return;
  698. if ((dy1 >= grd_curcanv->cv_bitmap.bm_h) || (dy2 < 0)) return;
  699. if ( dx1 < 0 ) { sx = -dx1; dx1 = 0; }
  700. if ( dy1 < 0 ) { sy = -dy1; dy1 = 0; }
  701. if ( dx2 >= grd_curcanv->cv_bitmap.bm_w ) { dx2 = grd_curcanv->cv_bitmap.bm_w-1; }
  702. if ( dy2 >= grd_curcanv->cv_bitmap.bm_h ) { dy2 = grd_curcanv->cv_bitmap.bm_h-1; }
  703. // Draw bitmap bm[x,y] into (dx1,dy1)-(dx2,dy2)
  704. if ( (bm->bm_type == BM_LINEAR) && (grd_curcanv->cv_bitmap.bm_type == BM_LINEAR ))
  705. {
  706. if ( bm->bm_flags & BM_FLAG_RLE )
  707. gr_bm_ubitblt00m_rle(dx2-dx1+1,dy2-dy1+1, dx1, dy1, sx, sy, bm, &grd_curcanv->cv_bitmap );
  708. else
  709. gr_bm_ubitblt00m(dx2-dx1+1,dy2-dy1+1, dx1, dy1, sx, sy, bm, &grd_curcanv->cv_bitmap );
  710. return;
  711. }
  712. gr_bm_ubitbltm(dx2-dx1+1,dy2-dy1+1, dx1, dy1, sx, sy, bm, &grd_curcanv->cv_bitmap );
  713. }
  714. void gr_bm_ubitbltm(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  715. {
  716. register int x1, y1;
  717. ubyte c;
  718. for (y1=0; y1 < h; y1++ ) {
  719. for (x1=0; x1 < w; x1++ ) {
  720. if ((c=gr_gpixel(src,sx+x1,sy+y1))!=255)
  721. gr_bm_pixel( dest, dx+x1, dy+y1,c );
  722. }
  723. }
  724. }
  725. //-NOT-used // From linear to SVGA
  726. //-NOT-used void gr_bm_ubitblt02_2x(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  727. //-NOT-used {
  728. //-NOT-used unsigned char * sbits;
  729. //-NOT-used
  730. //-NOT-used unsigned int offset, EndingOffset, VideoLocation;
  731. //-NOT-used
  732. //-NOT-used int sbpr, dbpr, y1, page, BytesToMove;
  733. //-NOT-used
  734. //-NOT-used sbpr = src->bm_rowsize;
  735. //-NOT-used
  736. //-NOT-used dbpr = dest->bm_rowsize << gr_bitblt_dest_step_shift;
  737. //-NOT-used
  738. //-NOT-used VideoLocation = (unsigned int)dest->bm_data + (dest->bm_rowsize * dy) + dx;
  739. //-NOT-used
  740. //-NOT-used sbits = src->bm_data + ( sbpr*sy ) + sx;
  741. //-NOT-used
  742. //-NOT-used for (y1=0; y1 < h; y1++ ) {
  743. //-NOT-used
  744. //-NOT-used page = VideoLocation >> 16;
  745. //-NOT-used offset = VideoLocation & 0xFFFF;
  746. //-NOT-used
  747. //-NOT-used gr_vesa_setpage( page );
  748. //-NOT-used
  749. //-NOT-used EndingOffset = offset+w-1;
  750. //-NOT-used
  751. //-NOT-used if ( EndingOffset <= 0xFFFF )
  752. //-NOT-used {
  753. //-NOT-used gr_linear_rep_movsd_2x( (void *)sbits, (void *)(offset+0xA0000), w );
  754. //-NOT-used
  755. //-NOT-used VideoLocation += dbpr;
  756. //-NOT-used sbits += sbpr;
  757. //-NOT-used }
  758. //-NOT-used else
  759. //-NOT-used {
  760. //-NOT-used BytesToMove = 0xFFFF-offset+1;
  761. //-NOT-used
  762. //-NOT-used gr_linear_rep_movsd_2x( (void *)sbits, (void *)(offset+0xA0000), BytesToMove );
  763. //-NOT-used
  764. //-NOT-used page++;
  765. //-NOT-used gr_vesa_setpage(page);
  766. //-NOT-used
  767. //-NOT-used gr_linear_rep_movsd_2x( (void *)(sbits+BytesToMove/2), (void *)0xA0000, EndingOffset - 0xFFFF );
  768. //-NOT-used
  769. //-NOT-used VideoLocation += dbpr;
  770. //-NOT-used sbits += sbpr;
  771. //-NOT-used }
  772. //-NOT-used
  773. //-NOT-used
  774. //-NOT-used }
  775. //-NOT-used }
  776. //-NOT-used // From Linear to Linear
  777. //-NOT-used void gr_bm_ubitblt00_2x(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  778. //-NOT-used {
  779. //-NOT-used unsigned char * dbits;
  780. //-NOT-used unsigned char * sbits;
  781. //-NOT-used //int src_bm_rowsize_2, dest_bm_rowsize_2;
  782. //-NOT-used
  783. //-NOT-used int i;
  784. //-NOT-used
  785. //-NOT-used sbits = src->bm_data + (src->bm_rowsize * sy) + sx;
  786. //-NOT-used dbits = dest->bm_data + (dest->bm_rowsize * dy) + dx;
  787. //-NOT-used
  788. //-NOT-used // No interlacing, copy the whole buffer.
  789. //-NOT-used for (i=0; i < h; i++ ) {
  790. //-NOT-used gr_linear_rep_movsd_2x( sbits, dbits, w );
  791. //-NOT-used
  792. //-NOT-used sbits += src->bm_rowsize;
  793. //-NOT-used dbits += dest->bm_rowsize << gr_bitblt_dest_step_shift;
  794. //-NOT-used }
  795. //-NOT-used }
  796. void gr_bm_ubitblt00_rle(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  797. {
  798. unsigned char * dbits;
  799. unsigned char * sbits;
  800. int i;
  801. sbits = &src->bm_data[4 + src->bm_h];
  802. for (i=0; i<sy; i++ )
  803. sbits += (int)src->bm_data[4+i];
  804. dbits = dest->bm_data + (dest->bm_rowsize * dy) + dx;
  805. // No interlacing, copy the whole buffer.
  806. for (i=0; i < h; i++ ) {
  807. gr_rle_expand_scanline( dbits, sbits, sx, sx+w-1 );
  808. sbits += (int)src->bm_data[4+i+sy];
  809. dbits += dest->bm_rowsize << gr_bitblt_dest_step_shift;
  810. }
  811. }
  812. void gr_bm_ubitblt00m_rle(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  813. {
  814. unsigned char * dbits;
  815. unsigned char * sbits;
  816. int i;
  817. sbits = &src->bm_data[4 + src->bm_h];
  818. for (i=0; i<sy; i++ )
  819. sbits += (int)src->bm_data[4+i];
  820. dbits = dest->bm_data + (dest->bm_rowsize * dy) + dx;
  821. // No interlacing, copy the whole buffer.
  822. for (i=0; i < h; i++ ) {
  823. gr_rle_expand_scanline_masked( dbits, sbits, sx, sx+w-1 );
  824. sbits += (int)src->bm_data[4+i+sy];
  825. dbits += dest->bm_rowsize << gr_bitblt_dest_step_shift;
  826. }
  827. }
  828. // in rle.c
  829. extern void gr_rle_expand_scanline_generic( grs_bitmap * dest, int dx, int dy, ubyte *src, int x1, int x2 );
  830. void gr_bm_ubitblt0x_rle(int w, int h, int dx, int dy, int sx, int sy, grs_bitmap * src, grs_bitmap * dest)
  831. {
  832. int i;
  833. register int y1;
  834. unsigned char * sbits;
  835. //mprintf( 0, "SVGA RLE!\n" );
  836. sbits = &src->bm_data[4 + src->bm_h];
  837. for (i=0; i<sy; i++ )
  838. sbits += (int)src->bm_data[4+i];
  839. for (y1=0; y1 < h; y1++ ) {
  840. gr_rle_expand_scanline_generic( dest, dx, dy+y1, sbits, sx, sx+w-1 );
  841. sbits += (int)src->bm_data[4+y1+sy];
  842. }
  843. }
  844.