/* ScummVM - Graphic Adventure Engine
 *
 * ScummVM is the legal property of its developers, whose names
 * are too numerous to list here. Please refer to the COPYRIGHT
 * file distributed with this source distribution.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.

 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.

 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 *
 */

/*
 * This code is based on original Soltys source code
 * Copyright (c) 1994-1995 Janus B. Wisniewski and L.K. Avalon
 */

#include "cge/bitmap.h"
#include "cge/cfile.h"
#include "cge/jbw.h"
#include "cge/vol.h"
#include "cge/cfile.h"
#include "cge/vga13h.h"
#include "cge/cge_main.h"
#include "common/system.h"
#include "common/debug.h"
#include "common/debug-channels.h"

namespace CGE {

Dac *Bitmap::_pal = NULL;

void Bitmap::init() {
	_pal = NULL;
}

void Bitmap::deinit() {
}

#pragma argsused
Bitmap::Bitmap(const char *fname, bool rem) : _m(NULL), _v(NULL), _map(0) {
	debugC(1, kCGEDebugBitmap, "Bitmap::Bitmap(%s, %s)", fname, rem ? "true" : "false");

	char pat[kMaxPath];
	forceExt(pat, fname, ".VBM");

#if (BMP_MODE < 2)
	if (rem && PIC_FILE::exist(pat)) {
		PIC_FILE file(pat);
		if ((file._error == 0) && (!loadVBM(&file)))
			error("Bad VBM [%s]", fname);
	} else
#endif
	{
#if (BMP_MODE)
		ForceExt(pat, fname, ".BMP");
		PIC_FILE file(pat);
		if (file._error == 0) {
			if (loadBMP(&file)) {
				Code();
				if (rem) {
					free(_m);
					_m = NULL;
				}
			} else
				error("Bad BMP [%s]", fname);
		}
#else
		error("Bad VBM [%s]", fname);
#endif
	}
}


Bitmap::Bitmap(uint16 w, uint16 h, uint8 *map) : _w(w), _h(h), _m(map), _v(NULL), _map(0) {
	debugC(1, kCGEDebugBitmap, "Bitmap::Bitmap(%d, %d, map)", w, h);
	if (map)
		code();
}


// following routine creates filled rectangle
// immediately as VGA video chunks, in near memory as fast as possible,
// especially for text line real time display
Bitmap::Bitmap(uint16 w, uint16 h, uint8 fill)
	: _w((w + 3) & ~3),                              // only full uint32 allowed!
	  _h(h),
	  _m(NULL),
	  _map(0) {
	debugC(1, kCGEDebugBitmap, "Bitmap::Bitmap(%d, %d, %d)", w, h, fill);

	uint16 dsiz = _w >> 2;                           // data size (1 plane line size)
	uint16 lsiz = 2 + dsiz + 2;                     // uint16 for line header, uint16 for gap
	uint16 psiz = _h * lsiz;                         // - last gape, but + plane trailer
	uint8 *v = new uint8[4 * psiz + _h * sizeof(*_b)];// the same for 4 planes
	                                                // + room for wash table
	assert(v != NULL);

	*(uint16 *) v = kBmpCPY | dsiz;                 // data chunk hader
	memset(v + 2, fill, dsiz);                      // data bytes
	*(uint16 *)(v + lsiz - 2) = kBmpSKP | ((kScrWidth / 4) - dsiz);  // gap

	// Replicate lines
	byte *destP;
	for (destP = v + lsiz; destP < (v + psiz); destP += lsiz)
		Common::copy(v, v + lsiz, destP);

	*(uint16 *)(v + psiz - 2) = kBmpEOI;            // plane trailer uint16

	// Repliccate planes
	for (destP = v + psiz; destP < (v + 4 * psiz); destP += psiz)
		Common::copy(v, v + psiz, destP);

	HideDesc *b = (HideDesc *)(v + 4 * psiz);
	b->_skip = (kScrWidth - _w) >> 2;
	b->_hide = _w >> 2;

	// Replicate across the entire table
	for (HideDesc *hdP = b + 1; hdP < (b + _h); ++hdP)
		*hdP = *b;
	
	b->_skip = 0;                                    // fix the first entry
	_v = v;
	_b = b;
}


Bitmap::Bitmap(const Bitmap &bmp) : _w(bmp._w), _h(bmp._h), _m(NULL), _v(NULL), _map(0) {
	debugC(1, kCGEDebugBitmap, "Bitmap::Bitmap(bmp)");
	uint8 *v0 = bmp._v;
	if (v0) {
		uint16 vsiz = (uint8 *)(bmp._b) - (uint8 *)(v0);
		uint16 siz = vsiz + _h * sizeof(HideDesc);
		uint8 *v1 = (uint8 *) malloc(sizeof(uint8) * siz);
		assert(v1 != NULL);
		memcpy(v1, v0, siz);
		_b = (HideDesc *)((_v = v1) + vsiz);
	}
}


Bitmap::~Bitmap() {
	debugC(6, kCGEDebugBitmap, "Bitmap::~Bitmap()");

	free(_m);
	delete[] _v;
}


Bitmap &Bitmap::operator = (const Bitmap &bmp) {
	debugC(1, kCGEDebugBitmap, "&Bitmap::operator =");

	uint8 *v0 = bmp._v;
	_w = bmp._w;
	_h = bmp._h;
	_m = NULL;
	_map = 0;
	free(_v);
	if (v0 == NULL)
		_v = NULL;
	else {
		uint16 vsiz = (uint8 *)bmp._b - (uint8 *)v0;
		uint16 siz = vsiz + _h * sizeof(HideDesc);
		uint8 *v1 = (uint8 *) malloc(sizeof(uint8) * siz);
		assert(v1 != NULL);
		memcpy(v1, v0, siz);
		_b = (HideDesc *)((_v = v1) + vsiz);
	}
	return *this;
}


uint16 Bitmap::moveVmap(uint8 *buf) {
	debugC(1, kCGEDebugBitmap, "Bitmap::moveVmap(buf)");

	if (_v) {
		uint16 vsiz = (uint8 *)_b - (uint8 *)_v;
		uint16 siz = vsiz + _h * sizeof(HideDesc);
		memcpy(buf, _v, siz);
		delete[] _v;
		_b = (HideDesc *)((_v = buf) + vsiz);
		return siz;
	}
	return 0;
}


BMP_PTR Bitmap::code() {
	debugC(1, kCGEDebugBitmap, "Bitmap::code()");

	if (!_m)
		return false;

	uint16 i, cnt;

	if (_v) {                                        // old X-map exists, so remove it
		delete[] _v;
		_v = NULL;
	}

	while (true) {                                  // at most 2 times: for (V == NULL) & for allocated block;
		uint8 *im = _v + 2;
		uint16 *cp = (uint16 *) _v;
		int bpl;

		if (_v) {                                      // 2nd pass - fill the hide table
			for (i = 0; i < _h; i++) {
				_b[i]._skip = 0xFFFF;
				_b[i]._hide = 0x0000;
			}
		}
		for (bpl = 0; bpl < 4; bpl++) {              // once per each bitplane
			uint8 *bm = _m;
			bool skip = (bm[bpl] == kPixelTransp);
			uint16 j;

			cnt = 0;
			for (i = 0; i < _h; i++) {                  // once per each line
				uint8 pix;
				for (j = bpl; j < _w; j += 4) {
					pix = bm[j];
					if (_v && pix != kPixelTransp) {
						if (j < _b[i]._skip)
							_b[i]._skip = j;

						if (j >= _b[i]._hide)
							_b[i]._hide = j + 1;
					}
					if ((pix == kPixelTransp) != skip || cnt >= 0x3FF0) { // end of block
						cnt |= (skip) ? kBmpSKP : kBmpCPY;
						if (_v)
							*cp = cnt;                          // store block description uint16

						cp = (uint16 *) im;
						im += 2;
						skip = (pix == kPixelTransp);
						cnt = 0;
					}
					if (! skip) {
						if (_v)
							*im = pix;
						im++;
					}
					cnt++;
				}

				bm += _w;
				if (_w < kScrWidth) {
					if (skip) {
						cnt += (kScrWidth - j + 3) / 4;
					} else {
						cnt |= kBmpCPY;
						if (_v)
							*cp = cnt;

						cp = (uint16 *) im;
						im += 2;
						skip = true;
						cnt = (kScrWidth - j + 3) / 4;
					}
				}
			}
			if (cnt && ! skip) {
				cnt |= kBmpCPY;
				if (_v)
					*cp = cnt;

				cp = (uint16 *) im;
				im += 2;
			}
			if (_v)
				*cp = kBmpEOI;
			cp = (uint16 *) im;
			im += 2;
		}
		if (_v)
			break;

		uint16 sizV = (uint16)(im - 2 - _v);
		_v = new uint8[sizV + _h * sizeof(*_b)];
		assert(_v != NULL);

		_b = (HideDesc *)(_v + sizV);
	}
	cnt = 0;
	for (i = 0; i < _h; i++) {
		if (_b[i]._skip == 0xFFFF) {                    // whole line is skipped
			_b[i]._skip = (cnt + kScrWidth) >> 2;
			cnt = 0;
		} else {
			uint16 s = _b[i]._skip & ~3;
			uint16 h = (_b[i]._hide + 3) & ~3;
			_b[i]._skip = (cnt + s) >> 2;
			_b[i]._hide = (h - s) >> 2;
			cnt = kScrWidth - h;
		}
	}

	return this;
}


bool Bitmap::solidAt(int16 x, int16 y) {
	debugC(6, kCGEDebugBitmap, "Bitmap::solidAt(%d, %d)", x, y);

	uint8 *m;
	uint16 r, n, n0;

	if ((x >= _w) || (y >= _h))
		return false;

	m = _v;
	r = static_cast<uint16>(x) % 4;
	n0 = (kScrWidth * y + x) / 4, n = 0;

	while (r) {
		uint16 w, t;

		w = *(uint16 *) m;
		m += 2;
		t = w & 0xC000;
		w &= 0x3FFF;

		switch (t) {
		case kBmpEOI:
			r--;
		case kBmpSKP:
			w = 0;
			break;
		case kBmpREP:
			w = 1;
			break;
		}
		m += w;
	}

	while (true) {
		uint16 w, t;

		w = *(uint16 *) m;
		m += 2;
		t = w & 0xC000;
		w &= 0x3FFF;

		if (n > n0)
			return false;

		n += w;
		switch (t) {
		case kBmpEOI:
			return false;
		case kBmpSKP:
			w = 0;
			break;
		case kBmpREP:
		case kBmpCPY:
			if (n - w <= n0 && n > n0)
				return true;
			break;
		}
		m += ((t == kBmpREP) ? 1 : w);
	}
}


bool Bitmap::saveVBM(XFile *f) {
	debugC(1, kCGEDebugBitmap, "Bitmap::saveVBM(f)");

	uint16 p = (_pal != NULL),
	       n = ((uint16)(((uint8 *)_b) - _v)) + _h * sizeof(HideDesc);
	if (f->_error == 0)
		f->write((uint8 *)&p, sizeof(p));

	if (f->_error == 0)
		f->write((uint8 *)&n, sizeof(n));

	if (f->_error == 0)
		f->write((uint8 *)&_w, sizeof(_w));

	if (f->_error == 0)
		f->write((uint8 *)&_h, sizeof(_h));

	if (f->_error == 0)
		if (p)
			f->write((uint8 *)_pal, 256 * 3);

	if (f->_error == 0)
		f->write(_v, n);

	return (f->_error == 0);
}


bool Bitmap::loadVBM(XFile *f) {
	debugC(5, kCGEDebugBitmap, "Bitmap::loadVBM(f)");

	uint16 p = 0, n = 0;
	if (f->_error == 0)
		f->read((uint8 *)&p, sizeof(p));

	if (f->_error == 0)
		f->read((uint8 *)&n, sizeof(n));

	if (f->_error == 0)
		f->read((uint8 *)&_w, sizeof(_w));

	if (f->_error == 0)
		f->read((uint8 *)&_h, sizeof(_h));

	if (f->_error == 0) {
		if (p) {
			if (_pal) {
				// Read in the palette
				byte palData[PAL_SIZ];
				f->read(palData, PAL_SIZ);
				
				const byte *srcP = palData;
				for (int idx = 0; idx < PAL_CNT; ++idx, srcP += 3) {
					_pal[idx]._r = *srcP;
					_pal[idx]._g = *(srcP + 1);
					_pal[idx]._b = *(srcP + 2);
				}
			} else
				f->seek(f->mark() + PAL_SIZ);
		}
	}
	if ((_v = new uint8[n]) == NULL)
		return false;

	if (f->_error == 0)
		f->read(_v, n);

	_b = (HideDesc *)(_v + n - _h * sizeof(HideDesc));
	return (f->_error == 0);
}

bool Bitmap::loadBMP(XFile *f) {
	debugC(1, kCGEDebugBitmap, "Bitmap::loadBMP(f)");

	struct {
		char BM[2];
		union { int16 len; int32 len_; };
		union { int16 _06; int32 _06_; };
		union { int16 hdr; int32 hdr_; };
		union { int16 _0E; int32 _0E_; };
		union { int16 wid; int32 wid_; };
		union { int16 hig; int32 hig_; };
		union { int16 _1A; int32 _1A_; };
		union { int16 _1E; int32 _1E_; };
		union { int16 _22; int32 _22_; };
		union { int16 _26; int32 _26_; };
		union { int16 _2A; int32 _2A_; };
		union { int16 _2E; int32 _2E_; };
		union { int16 _32; int32 _32_; };
	} hea;

	Bgr4 bpal[256];

	f->read((byte *)&hea, sizeof(hea));
	if (f->_error == 0) {
		if (hea.hdr == 0x436L) {
			int16 i = (hea.hdr - sizeof(hea)) / sizeof(Bgr4);
			f->read((byte *)&bpal, sizeof(bpal));
			if (f->_error == 0) {
				if (_pal) {
					for (i = 0; i < 256; i ++) {
						_pal[i]._r = bpal[i]._R;
						_pal[i]._g = bpal[i]._G;
						_pal[i]._b = bpal[i]._B;
					}
					_pal = NULL;
				}
				_h = hea.hig;
				_w = hea.wid;
				if ((_m = (byte *) malloc(sizeof(byte) * (_h * _w))) != NULL) {
					int16 r = (4 - (hea.wid & 3)) % 4;
					byte buf[3];
					for (i = _h - 1; i >= 0; i--) {
						f->read(_m + (_w * i), _w);
						if (r && f->_error == 0)
							f->read(buf, r);
						if (f->_error)
							break;
					}
					if (i < 0)
						return true;
				}
			}
		}
	}
	return false;
}

} // End of namespace CGE