/*
 * Copyright (c) 2016-2017, Adam <Adam@sigterm.info>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice, this
 *    list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package net.runelite.cache.definitions.loaders;

import java.util.HashMap;
import java.util.Map;
import net.runelite.cache.definitions.ScriptDefinition;
import net.runelite.cache.io.InputStream;
import static net.runelite.cache.script.Opcodes.SCONST;
import static net.runelite.cache.script.Opcodes.POP_INT;
import static net.runelite.cache.script.Opcodes.POP_STRING;
import static net.runelite.cache.script.Opcodes.RETURN;

public class ScriptLoader
{
	public ScriptDefinition load(int id, byte[] b)
	{
		ScriptDefinition def = new ScriptDefinition();
		def.setId(id);
		InputStream in = new InputStream(b);

		in.setOffset(in.getLength() - 2);
		int switchLength = in.readUnsignedShort();

		// 2 for switchLength + the switch data + 12 for the param/vars/stack data
		int endIdx = in.getLength() - 2 - switchLength - 12;
		in.setOffset(endIdx);
		int numOpcodes = in.readInt();
		int localIntCount = in.readUnsignedShort();
		int localStringCount = in.readUnsignedShort();
		int intStackCount = in.readUnsignedShort();
		int stringStackCount = in.readUnsignedShort();

		int numSwitches = in.readUnsignedByte();
		if (numSwitches > 0)
		{
			Map<Integer, Integer>[] switches = new Map[numSwitches];
			def.setSwitches(switches);

			for (int i = 0; i < numSwitches; ++i)
			{
				switches[i] = new HashMap<>();

				int count = in.readUnsignedShort();
				while (count-- > 0)
				{
					int key = in.readInt(); // int from stack is compared to this
					int pcOffset = in.readInt(); // pc jumps by this

					switches[i].put(key, pcOffset);
				}
			}
		}

		def.setLocalIntCount(localIntCount);
		def.setLocalStringCount(localStringCount);
		def.setIntStackCount(intStackCount);
		def.setStringStackCount(stringStackCount);

		in.setOffset(0);
		in.readStringOrNull();

		int[] instructions = new int[numOpcodes];
		int[] intOperands = new int[numOpcodes];
		String[] stringOperands = new String[numOpcodes];

		def.setInstructions(instructions);
		def.setIntOperands(intOperands);
		def.setStringOperands(stringOperands);

		int opcode;
		for (int i = 0; in.getOffset() < endIdx; instructions[i++] = opcode)
		{
			opcode = in.readUnsignedShort();
			if (opcode == SCONST)
			{
				stringOperands[i] = in.readString();
			}
			else if (opcode < 100 && opcode != RETURN && opcode != POP_INT && opcode != POP_STRING)
			{
				intOperands[i] = in.readInt();
			}
			else
			{
				intOperands[i] = in.readUnsignedByte();
			}
		}

		return def;
	}
}

@@ -1444,16 +1444,22 @@
 va.util.
+Linked
 HashMap;
@@ -2685,16 +2685,22 @@
 %5D = new 
+Linked
 HashMap%3C

use LinkedHashMap for switch jump tables