// Copyright (C) 2010, 2011, 2012, 2013 GlavSoft LLC.
// All rights reserved.
//
//-------------------------------------------------------------------------
// This file is part of the TightVNC software.  Please visit our Web site:
//
//                       http://www.tightvnc.com/
//
// 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.
//-------------------------------------------------------------------------
//

package com.glavsoft.rfb.encoding.decoder;

import com.glavsoft.drawing.Renderer;
import com.glavsoft.exceptions.TransportException;
import com.glavsoft.rfb.encoding.EncodingType;
import com.glavsoft.transport.Reader;
import jp.ac.u_ryukyu.treevnc.CheckDelay;
import jp.ac.u_ryukyu.treevnc.TreeRFBProto;

import java.io.UnsupportedEncodingException;
import java.nio.ByteBuffer;
import java.util.LinkedList;
import java.util.zip.Deflater;

public class ZRLEDecoder extends ZlibDecoder {
	private static final int MAX_TILE_SIZE = 64;
	private int[] decodedBitmap;
	private int[] palette;

	class TileLoop {
		private final boolean blocking;
		private final int half;
		private int deflate_size = 55507;
		private ByteBuffer c1;
		private int width; // phase2 length
		private FramebufferUpdateRectangle c1rect;
		private int c1headerPos;
		private int prevLineOffset;
		private int prevC1Offset;
		private int prevoffset;
		private Deflater deflater;
		private int ztileInLine;
		private int hwidth;
		private int hc1width;
		private int hoffset;
		private int hc1offset;
		private int discard;

		/**
		 * Multicast framebufferUpdate to children.
		 * read FrameBuffferUpdate. If it is ZLE, make it ZLEE which is self contained compressed packet.
		 * put the packet to the multicastqueue. Then normal rendering engine read the same stream using is.reset().
		 * <p>
		 * Haeder
		 * messageID  ( FrameBuffer Update
		 * 1 byte padding
		 * 2 byte numberofrectangle
		 * 2 - U16 - x-position
		 * 2 - U16 - y-position
		 * 2 - U16 - width
		 * 2 - U16 - height
		 * 4 - S32 - encoding-type
		 * 4 byte datalengths
		 * datalengths databyte
		 *
		 * @throws TransportException
		 * @throws UnsupportedEncodingException
		 */

		public TileLoop(int offset) {
			prevoffset = prevLineOffset = offset;
			prevC1Offset = 0;
			if (offset < deflate_size + spanGap) {
				// packet size fit in broadcast send it all at once
				blocking = false;
			} else
				blocking = true;
			discard = 0;
			half = 0;
		}

		private void zrleeBlocking(TreeRFBProto rfb, ByteBuffer header, FramebufferUpdateRectangle rect, byte bytes[]) {
			// dump32(inputs);
			deflater = rfb.deflater;
			newMulticastPacket(rfb, rect);
			c1.put(header.get(0));
			c1rect = new FramebufferUpdateRectangle(rect.x, rect.y, 0, 0);
			if (!blocking) {
				deflater.setInput(bytes, 0, prevoffset);
				deflater.deflate(c1);
				flushMuticast(rfb);
			}
			return;
		}

		private void newMulticastPacket(TreeRFBProto rfb, FramebufferUpdateRectangle rect) {
			c1 = rfb.multicastqueue.allocate(deflate_size + 20);
			c1.limit(c1.limit() - 20);
			if (rfb.addSerialNum)
				c1.putLong(rfb.counter++);
			if (rfb.checkDelay)
				CheckDelay.checkDelay(c1, rect.x, rect.y, rect.width, rect.height, System.currentTimeMillis(), EncodingType.CHECK_DELAY);
			c1headerPos = c1.position();
			c1.put((byte) 0);
			c1.put((byte) 0);
			c1.putShort((short) 0);
			c1.position(c1.position() + 16);
			c1.putInt(0);     // should be data length
			prevC1Offset = c1.position();
			width = 0;
			ztileInLine = 0;
		}

		int spanGap = 128;
		/**
		 * Series of tiles compose at most three rectangles. SYNC_FLUSH is necessary on
		 * rectangle boundaries.
		 * <p>
		 * +----+
		 * |  | |   phase 0
		 * +---------------+
		 * |       |       |   phase 1
		 * +----+----------+
		 * |  | |              phase 2
		 * +----+
		 * <p>
		 * Broadcast packet have to less than 64kbytes
		 * A tile 64x64x3 11288byte, a packet can contain 5 raw tiles, when these are
		 * compressed 10 to 100 tiles can be stored. It is impossible to predict the
		 * compression rate. To check the compressed capacity, Deflate.needsInputs() can
		 * be used. If needsInputs() is false on SYNC_FLUSH, smaller input is necessary.
		 * <p>
		 * We'll try 512 tiles before SYNC_FLUSH in a phase, if it fails try flush former 256 tiles.
		 * If it will failed again, flush the previous line and do flush 512 tiles in new Packet.
		 * If it failed again try former 256 tiles flushed, if this failes again dicard the former half.
		 * The last case cannot happen but former 256 tiles have to be flushed, because the next 256 lines
		 * may failed again and restart the from this point.
		 * The next packet start with later 256 tiles filled and unflushed.
		 *
		 * @param rfb
		 * @param last
		 * @param rect
		 * @param bytes
		 * @param offset
		 * @param tileW
		 * @param tileH
		 */

		int MAX_ZTILE = 512;

		public void multicastPut(TreeRFBProto rfb, boolean last, FramebufferUpdateRectangle rect, byte[] bytes, int offset, int tileW, int tileH) {
			if (!blocking) return;
			int span = offset - prevoffset;
			deflater.setInput(bytes, prevoffset, span);
			prevoffset = offset;
			c1rect.width += tileW;
			width += tileW;
			if (c1rect.x > rect.x) {  // phase 0
				if (c1rect.x + c1rect.width < rect.x + rect.width) {
					compressAndCheckFlush(rfb, rect, bytes, offset, false, last);
				} else {
					c1rect.width = rect.x + rect.width - c1rect.x;
					c1rect.height += tileH;
					compressAndCheckFlush(rfb, rect, bytes, offset, true, last);
				}
			} else {  // phase 1
				if (width >= rect.width) {
					c1rect.width = rect.width;
					width = 0;
					c1rect.height += tileH;
					prevLineOffset = offset;
					compressAndCheckFlush(rfb, rect, bytes, offset, true, last);
				} else {
					compressAndCheckFlush(rfb, rect, bytes, offset, false, last);
				}
			}
		}

		private void compressAndCheckFlush(TreeRFBProto rfb, FramebufferUpdateRectangle rect, byte[] bytes, int offset, boolean flush, boolean last) {
			ztileInLine++;

			deflater.deflate(c1, Deflater.NO_FLUSH);
			int headerLength = 20;
			if (!deflater.needsInput()) {
				deflater.finish();
				if (offset != prevLineOffset) {
					prevC1Offset++;
					// fix phase1 rectangle header
					c1.putShort(prevC1Offset + 0, (short) c1rect.x);
					c1.putShort(prevC1Offset + 2, (short) c1rect.y);
					c1.putShort(prevC1Offset + 4, (short) c1rect.width);
					c1.putShort(prevC1Offset + 6, (short) c1rect.height);
					c1.putInt(prevC1Offset + 8, EncodingType.ZRLEE.getId());
					c1.putInt(prevC1Offset + 12, c1.position() - prevC1Offset - 12); // data length
					c1.putShort(2, (short) (c1.getShort(2) + 1));    // increment rectangle count

					if (c1rect.x == rect.x) {  // phase0 needs no phase1
						// make header space for phase2
						c1.limit(c1.limit() + headerLength);
						// to make rectangle header shift last bytes
						for (int i = 0; i < c1.position() - prevC1Offset; i++) {
							c1.array()[prevC1Offset + headerLength - i] = c1.array()[prevC1Offset - i];
						}
					}
				}
				flushRectangle(rect);
				flushMuticast(rfb);
				newMulticastPacket(rfb, rect);
				deflater.deflate(c1, Deflater.NO_FLUSH);
			} else if (last) {
				flushRectangle(rect);
				flushMuticast(rfb);
				return;
			} else {
				nextBlock(rect);
			}
		}

		/**
		 * fix rectangle header
		 * create next rectangle header
		 * update position paramater
		 * send muticast pacate if nessesally
		 */
		private void flushRectangle(FramebufferUpdateRectangle rect) {
			c1.putShort(prevC1Offset + 0, (short) c1rect.x);
			c1.putShort(prevC1Offset + 2, (short) c1rect.y);
			c1.putShort(prevC1Offset + 4, (short) c1rect.width);
			c1.putShort(prevC1Offset + 6, (short) c1rect.height);
			c1.putInt(prevC1Offset + 8, EncodingType.ZRLEE.getId());
			c1.putInt(prevC1Offset + 12, c1.position() - prevC1Offset - 12); // data length
			c1.putShort(2, (short) (c1.getShort(2) + 1));    // increment rectangle count
			ztileInLine = 0;
			prevC1Offset = c1.position();
		}

		private void nextBlock(FramebufferUpdateRectangle rect) {
			if (c1rect.x + c1rect.width < rect.x + rect.width) {
				c1rect.x = c1rect.width;   // next rectangle is phase 1
			} else {
				c1rect.x = rect.x;
				c1rect.y += c1rect.height;
			}
			width = 0;
			c1rect.width = 0;
			c1rect.height = 0;
		}

		private void flushMuticast(TreeRFBProto rfb) {
			c1.flip();
			//System.out.println("multicastPut: " + c1rect + " length: " + (c1.remaining()-c1headerPos-header.limit()));
			try {
				deflater.reset();

				LinkedList<ByteBuffer> bufs = new LinkedList<ByteBuffer>();
				bufs.add(c1);
				if (rfb.isTreeManager() && rfb.connectionPresenter.isUseMulticast()) {
					for (ByteBuffer buf : bufs)
						rfb.getViewer().getRfbBroadcastListener().multicastUpdateRectangle(buf);
				} else {
					rfb.multicastqueue.waitput(bufs);
				}
			} catch (InterruptedException e) {
				e.printStackTrace();
			}
		}
	}

	@Override
	public void decode(Reader reader, Renderer renderer,
					   FramebufferUpdateRectangle rect) throws TransportException {
		int zippedLength = (int) reader.readUInt32();
		if (0 == zippedLength) return;
		int length = rect.width * rect.height * renderer.getBytesPerPixel();
		byte[] bytes = unzip(reader, zippedLength, length, rect.getEncodingType());
		decode1(renderer, null, rect, bytes, zippedLength, null);
	}


	public void multicastDecode(Reader reader, Renderer renderer,
								FramebufferUpdateRectangle rect, TreeRFBProto rfb) throws TransportException {
		ByteBuffer header = ByteBuffer.allocate(16);
		reader.read(header.array());
		int zippedLength = (int) reader.readUInt32();
		if (0 == zippedLength) return;
		int length = rect.width * rect.height * renderer.getBytesPerPixel();
		byte[] bytes = unzip(reader, zippedLength, length, rect.getEncodingType());
		decode1(renderer, header, rect, bytes, zippedLength, rfb);
	}

	public void decode1(Renderer renderer, ByteBuffer header, FramebufferUpdateRectangle rect, byte[] bytes, int zippedLength, TreeRFBProto rfbProto) throws TransportException {
		int offset = zippedLength;
		int maxX = rect.x + rect.width;
		int maxY = rect.y + rect.height;

		TileLoop tileloop = new TileLoop(zippedLength);
		//System.out.println("decode1: "+rect);
		if (null == palette) {
			palette = new int[128];
		}
		if (null == decodedBitmap) {
			decodedBitmap = new int[MAX_TILE_SIZE * MAX_TILE_SIZE];
		}

		if (rfbProto.multicastBlocking) {
			tileloop.zrleeBlocking(rfbProto, header, rect, bytes);
		}
		try {
			for (int tileY = rect.y; tileY < maxY; tileY += MAX_TILE_SIZE) {
				int tileHeight = Math.min(maxY - tileY, MAX_TILE_SIZE);

				for (int tileX = rect.x; tileX < maxX; tileX += MAX_TILE_SIZE) {
					int tileWidth = Math.min(maxX - tileX, MAX_TILE_SIZE);
					int subencoding = bytes[offset++] & 0x0ff;
					if (subencoding != 0)
						System.out.println("----------------" + subencoding);
					// 128 -plain RLE, 130-255 - Palette RLE
					boolean isRle = (subencoding & 128) != 0;
					// 2 to 16 for raw packed palette data, 130 to 255 for Palette RLE (subencoding - 128)
					int paletteSize = subencoding & 127;
					offset += readPalette(bytes, offset, renderer, paletteSize);
					if (1 == subencoding) { // A solid tile consisting of a single colour
						renderer.fillRect(palette[0], tileX, tileY, tileWidth, tileHeight);
					} else if (isRle) {
						if (0 == paletteSize) { // subencoding == 128 (or paletteSize == 0) - Plain RLE
							offset += decodePlainRle(bytes, offset, renderer, tileX, tileY, tileWidth, tileHeight);
						} else {
							offset += decodePaletteRle(bytes, offset, renderer, tileX, tileY, tileWidth, tileHeight);
						}
					} else {
						if (0 == paletteSize) { // subencoding == 0 (or paletteSize == 0) - raw CPIXEL data
							offset += decodeRaw(bytes, offset, renderer, tileX, tileY, tileWidth, tileHeight);
//						System.out.println("offset:"+offset);
						} else {
							offset += decodePacked(bytes, offset, renderer, paletteSize, tileX, tileY, tileWidth, tileHeight);
						}
					}
					if (rfbProto != null && rfbProto.multicastBlocking)
						tileloop.multicastPut(rfbProto, false, rect, bytes, offset, tileWidth, tileHeight);
				}
			}
			if (rfbProto != null && rfbProto.multicastBlocking)
				tileloop.multicastPut(rfbProto, true, rect, bytes, offset, 0, 0);
		} catch (Exception e) {
			if (rfbProto != null && rfbProto.multicastBlocking)
				tileloop.multicastPut(rfbProto, true, rect, bytes, offset, 0, 0);
			throw e;
		}
	}



	private int decodePlainRle(byte[] bytes, int offset, Renderer renderer,
			int tileX, int tileY, int tileWidth, int tileHeight) {
		int bytesPerCPixel = renderer.getBytesPerCPixel();
		int decodedOffset = 0;
		int decodedEnd = tileWidth * tileHeight;
		int index = offset;
		while (decodedOffset < decodedEnd) {
			int color = renderer.getCompactPixelColor(bytes, index);
			index += bytesPerCPixel;
			int rlength = 1;
			do {
				rlength += bytes[index] & 0x0ff;
			} while ((bytes[index++] & 0x0ff) == 255);
			assert rlength <= decodedEnd - decodedOffset;
			renderer.fillColorBitmapWithColor(decodedBitmap, decodedOffset, rlength, color);
			decodedOffset += rlength;
		}
		renderer.drawColoredBitmap(decodedBitmap, tileX, tileY, tileWidth, tileHeight);
		return index - offset;
	}

	private int decodePaletteRle(byte[] bytes, int offset, Renderer renderer,
                                 int tileX, int tileY, int tileWidth, int tileHeight) {
		int decodedOffset = 0;
		int decodedEnd = tileWidth * tileHeight;
		int index = offset;
		while (decodedOffset < decodedEnd) {
			int colorIndex = bytes[index++];
			int color = palette[colorIndex & 127];
			int rlength = 1;
			if ((colorIndex & 128) != 0) {
				do {
					rlength += bytes[index] & 0x0ff;
				} while (bytes[index++] == (byte) 255);
			}
			assert rlength <= decodedEnd - decodedOffset;
			renderer.fillColorBitmapWithColor(decodedBitmap, decodedOffset, rlength, color);
			decodedOffset += rlength;
		}
		renderer.drawColoredBitmap(decodedBitmap, tileX, tileY, tileWidth, tileHeight);
		return index - offset;
	}

	private int decodePacked(byte[] bytes, int offset, Renderer renderer,
                             int paletteSize, int tileX, int tileY, int tileWidth, int tileHeight) {
		int bitsPerPalletedPixel = paletteSize > 16 ? 8 : paletteSize > 4 ? 4
				: paletteSize > 2 ? 2 : 1;
		int packedOffset = offset;
		int decodedOffset = 0;
		for (int i = 0; i < tileHeight; ++i) {
			int decodedRowEnd = decodedOffset + tileWidth;
			int byteProcessed = 0;
			int bitsRemain = 0;

			while (decodedOffset < decodedRowEnd) {
				if (bitsRemain == 0) {
					byteProcessed = bytes[packedOffset++];
					bitsRemain = 8;
				}
				bitsRemain -= bitsPerPalletedPixel;
				int index = byteProcessed >> bitsRemain & (1 << bitsPerPalletedPixel) - 1 & 127;
				int color = palette[index];
				renderer.fillColorBitmapWithColor(decodedBitmap, decodedOffset, 1, color);
				++decodedOffset;
			}
		}
		renderer.drawColoredBitmap(decodedBitmap, tileX, tileY, tileWidth, tileHeight);
		return packedOffset - offset;
	}

	private int decodeRaw(byte[] bytes, int offset, Renderer renderer,
			int tileX, int tileY, int tileWidth, int tileHeight) throws TransportException {
		return renderer.drawCompactBytes(bytes, offset, tileX, tileY, tileWidth, tileHeight);
	}

	private int readPalette(byte[] bytes, int offset, Renderer renderer, int paletteSize) {
        final int bytesPerCPixel = renderer.getBytesPerCPixel();
		for (int i=0; i<paletteSize; ++i) {
            palette[i] = renderer.getCompactPixelColor(bytes, offset + i* bytesPerCPixel);
		}
		return paletteSize * bytesPerCPixel;
	}



}