#include "stdafx.h"
#include <climits>
#include <algorithm>
#include "DebugTypes.h"
#include "ExpressionEvaluator.h"
#include "Console.h"
#include "Debugger.h"
#include "MemoryDumper.h"
#include "Disassembler.h"
#include "LabelManager.h"
#include "DebugUtilities.h"
#include "../Utilities/HexUtilities.h"

const vector<string> ExpressionEvaluator::_binaryOperators = { { "*", "/", "%", "+", "-", "<<", ">>", "<", "<=", ">", ">=", "==", "!=", "&", "^", "|", "&&", "||" } };
const vector<int> ExpressionEvaluator::_binaryPrecedence = { { 10,  10,  10,   9,   9,    8,    8,   7,   7,    7,    7,    6,    6,   5,   4,   3,    2,    1 } };
const vector<string> ExpressionEvaluator::_unaryOperators = { { "+", "-", "~", "!" } };
const vector<int> ExpressionEvaluator::_unaryPrecedence = { { 11,  11,  11,  11 } };
const std::unordered_set<string> ExpressionEvaluator::_operators = { { "*", "/", "%", "+", "-", "<<", ">>", "<", "<=", ">", ">=", "==", "!=", "&", "^", "|", "&&", "||", "~", "!", "(", ")", "{", "}", "[", "]" } };

bool ExpressionEvaluator::IsOperator(string token, int &precedence, bool unaryOperator)
{
	if(unaryOperator) {
		for(size_t i = 0, len = _unaryOperators.size(); i < len; i++) {
			if(token.compare(_unaryOperators[i]) == 0) {
				precedence = _unaryPrecedence[i];
				return true;
			}
		}
	} else {
		for(size_t i = 0, len = _binaryOperators.size(); i < len; i++) {
			if(token.compare(_binaryOperators[i]) == 0) {
				precedence = _binaryPrecedence[i];
				return true;
			}
		}
	}
	return false;
}

EvalOperators ExpressionEvaluator::GetOperator(string token, bool unaryOperator)
{
	if(unaryOperator) {
		for(size_t i = 0, len = _unaryOperators.size(); i < len; i++) {
			if(token.compare(_unaryOperators[i]) == 0) {
				return (EvalOperators)(EvalOperators::Plus + i);
			}
		}
	} else {
		for(size_t i = 0, len = _binaryOperators.size(); i < len; i++) {
			if(token.compare(_binaryOperators[i]) == 0) {
				return (EvalOperators)(EvalOperators::Multiplication + i);
			}
		}
	}
	return EvalOperators::Addition;
}

bool ExpressionEvaluator::CheckSpecialTokens(string expression, size_t &pos, string &output, ExpressionData &data)
{
	string token;
	size_t initialPos = pos;
	size_t len = expression.size();
	do {
		char c = std::tolower(expression[pos]);
		if((c >= 'a' && c <= 'z') || (c >= '0' && c <= '9') || c == '_' || c == '@') {
			//Only letters, numbers and underscore are allowed in code labels
			token += c;
			pos++;
		} else {
			break;
		}
	} while(pos < len);

	int64_t tokenValue = -1;
	if(_cpuType == CpuType::Gsu) {
		tokenValue = ProcessGsuTokens(token);
	} else if(_cpuType == CpuType::Gameboy) {
		tokenValue = ProcessGameboyTokens(token);
	} else if(_cpuType == CpuType::Spc) {
		tokenValue = ProcessCpuSpcTokens(token, true);
	} else { // Cpu or Sa1
		tokenValue = ProcessCpuSpcTokens(token, false);
	}

	if(tokenValue != -1) {
		output += std::to_string(tokenValue);
		return true;
	}

	int64_t sharedToken = ProcessSharedTokens(token);
	if(sharedToken != -1) {
		output += std::to_string(sharedToken);
		return true;
	}

	string originalExpression = expression.substr(initialPos, pos - initialPos);
	bool validLabel = _labelManager->ContainsLabel(originalExpression);
	if(!validLabel) {
		//Check if a multi-byte label exists for this name
		string label = originalExpression + "+0";
		validLabel = _labelManager->ContainsLabel(label);
	}

	if(validLabel) {
		data.Labels.push_back(originalExpression);
		output += std::to_string(EvalValues::FirstLabelIndex + data.Labels.size() - 1);
		return true;
	} else {
		return false;
	}
}

int64_t ExpressionEvaluator::ProcessCpuSpcTokens(string token, bool spc700)
{
	if(token == "a") {
		return EvalValues::RegA;
	} else if(token == "x") {
		return EvalValues::RegX;
	} else if(token == "y") {
		return EvalValues::RegY;
	} else if(token == "ps") {
		return EvalValues::RegPS;
	} else if (token == "pscarry") {
		return EvalValues::RegPS_Carry;
	} else if (token == "pszero") {
		return EvalValues::RegPS_Zero;
	} else if (token == "psinterrupt") {
		return EvalValues::RegPS_Interrupt;
	} else if (token == "psdecimal") {
		return EvalValues::RegPS_Decimal;
	} else if (token == "psoverflow") {
		return EvalValues::RegPS_Overflow;
	} else if (token == "psnegative") {
		return EvalValues::RegPS_Negative;
	} else if (token == "ps8bit" && !spc700) {
		return EvalValues::RegPS_8bit;
	} else if (token == "ps8bitindex" && !spc700) {
		return EvalValues::RegPS_8bitIndex;
	} else if (token == "ps16bit" && !spc700) {
		return EvalValues::RegPS_16bit;
	} else if (token == "ps16bitindex" && !spc700) {
		return EvalValues::RegPS_16bitIndex;
	} else if (token == "pshalfcarry" && spc700) {
		return EvalValues::RegPS_HalfCarry;
	} else if (token == "psbreak" && spc700) {
		return EvalValues::RegPS_Break;
	} else if (token == "psstackzp" && spc700) {
		return EvalValues::RegPS_StackZeropage;
	} else if(token == "sp") {
		return EvalValues::RegSP;
	} else if(token == "pc") {
		return EvalValues::RegPC;
	} else if(token == "oppc") {
		return EvalValues::RegOpPC;
	} else if(token == "previousoppc") {
		return EvalValues::PreviousOpPC;
	} else if(token == "irq") {
		return EvalValues::Irq;
	} else if(token == "nmi") {
		return EvalValues::Nmi;
	}
	return -1;
}

int64_t ExpressionEvaluator::ProcessSharedTokens(string token) 
{
	if(token == "frame") {
		return EvalValues::PpuFrameCount;
	} else if(token == "cycle") {
		return EvalValues::PpuCycle;
	} else if(token == "scanline") {
		return EvalValues::PpuScanline;
	} else if(token == "value") {
		return EvalValues::Value;
	} else if(token == "address") {
		return EvalValues::Address;
	} else if(token == "romaddress") {
		return EvalValues::AbsoluteAddress;
	} else if(token == "iswrite") {
		return EvalValues::IsWrite;
	} else if(token == "isread") {
		return EvalValues::IsRead;
	}
	return -1;
}

int64_t ExpressionEvaluator::ProcessGsuTokens(string token)
{
	if(token == "r0") {
		return EvalValues::R0;
	} else if(token == "r1") {
		return EvalValues::R1;
	} else if(token == "r2") {
		return EvalValues::R2;
	} else if(token == "r3") {
		return EvalValues::R3;
	} else if(token == "r4") {
		return EvalValues::R4;
	} else if(token == "r5") {
		return EvalValues::R5;
	} else if(token == "r6") {
		return EvalValues::R6;
	} else if(token == "r7") {
		return EvalValues::R7;
	} else if(token == "r8") {
		return EvalValues::R8;
	} else if(token == "r9") {
		return EvalValues::R9;
	} else if(token == "r10") {
		return EvalValues::R10;
	} else if(token == "r11") {
		return EvalValues::R11;
	} else if(token == "r12") {
		return EvalValues::R12;
	} else if(token == "r13") {
		return EvalValues::R13;
	} else if(token == "r14") {
		return EvalValues::R14;
	} else if(token == "r15") {
		return EvalValues::R15;
	} else if(token == "srcreg") {
		return EvalValues::SrcReg;
	} else if(token == "dstreg") {
		return EvalValues::DstReg;
	} else if(token == "sfr") {
		return EvalValues::SFR;
	} else if(token == "pbr") {
		return EvalValues::PBR;
	} else if(token == "rombr") {
		return EvalValues::RomBR;
	} else if(token == "rambr") {
		return EvalValues::RamBR;
	}
	return -1;
}


int64_t ExpressionEvaluator::ProcessGameboyTokens(string token)
{
	if(token == "a") {
		return EvalValues::RegA;
	} else if(token == "b") {
		return EvalValues::RegB;
	} else if(token == "c") {
		return EvalValues::RegC;
	} else if(token == "d") {
		return EvalValues::RegD;
	} else if(token == "e") {
		return EvalValues::RegE;
	} else if(token == "f") {
		return EvalValues::RegF;
	} else if(token == "h") {
		return EvalValues::RegH;
	} else if(token == "l") {
		return EvalValues::RegL;
	} else if(token == "af") {
		return EvalValues::RegAF;
	} else if(token == "bc") {
		return EvalValues::RegBC;
	} else if(token == "de") {
		return EvalValues::RegDE;
	} else if(token == "hl") {
		return EvalValues::RegHL;
	} else if(token == "sp") {
		return EvalValues::RegSP;
	} else if(token == "pc") {
		return EvalValues::RegPC;
	}
	return -1;
}

string ExpressionEvaluator::GetNextToken(string expression, size_t &pos, ExpressionData &data, bool &success, bool previousTokenIsOp)
{
	string output;
	success = true;

	char c = std::tolower(expression[pos]);
	if(c == '$') {
		//Hex numbers
		pos++;
		for(size_t len = expression.size(); pos < len; pos++) {
			c = std::tolower(expression[pos]);
			if((c >= '0' && c <= '9') || (c >= 'a' && c <= 'f')) {
				output += c;
			} else {
				break;
			}
		}
		if(output.empty()) {
			//No numbers followed the hex mark, this isn't a valid expression
			success = false;
		}
		output = std::to_string((uint32_t)HexUtilities::FromHex(output));
	} else if(c == '%' && previousTokenIsOp) {
		//Binary numbers
		pos++;
		for(size_t len = expression.size(); pos < len; pos++) {
			c = std::tolower(expression[pos]);
			if(c == '0' || c == '1') {
				output += c;
			} else {
				break;
			}
		}
		if(output.empty()) {
			//No numbers followed the binary mark, this isn't a valid expression
			success = false;
		}

		uint32_t value = 0;
		for(size_t i = 0; i < output.size(); i++) {
			value <<= 1;
			value |= output[i] == '1' ? 1 : 0;
		}
		output = std::to_string(value);
	} else if(c >= '0' && c <= '9') {
		//Regular numbers
		for(size_t len = expression.size(); pos < len; pos++) {
			c = std::tolower(expression[pos]);
			if(c >= '0' && c <= '9') {
				output += c;
			} else {
				break;
			}
		}
	} else if((c < 'a' || c > 'z') && c != '_' && c != '@') {
		//Operators
		string operatorToken;
		for(size_t len = expression.size(); pos < len; pos++) {
			c = std::tolower(expression[pos]);
			operatorToken += c;
			if(output.empty() || _operators.find(operatorToken) != _operators.end()) {
				//If appending the next char results in a valid operator, append it (or if this is the first character)
				output += c;
			} else {
				//Reached the end of the operator, return
				break;
			}
		}
	} else {
		//Special tokens and labels
		success = CheckSpecialTokens(expression, pos, output, data);
	}

	return output;
}
	
bool ExpressionEvaluator::ProcessSpecialOperator(EvalOperators evalOp, std::stack<EvalOperators> &opStack, std::stack<int> &precedenceStack, vector<int64_t> &outputQueue)
{
	if(opStack.empty()) {
		return false;
	}
	while(opStack.top() != evalOp) {
		outputQueue.push_back(opStack.top());
		opStack.pop();
		precedenceStack.pop();

		if(opStack.empty()) {
			return false;
		}
	}
	if(evalOp != EvalOperators::Parenthesis) {
		outputQueue.push_back(opStack.top());
	}
	opStack.pop();
	precedenceStack.pop();

	return true;
}

bool ExpressionEvaluator::ToRpn(string expression, ExpressionData &data)
{
	std::stack<EvalOperators> opStack = std::stack<EvalOperators>();	
	std::stack<int> precedenceStack;

	size_t position = 0;
	int parenthesisCount = 0;
	int bracketCount = 0;
	int braceCount = 0;

	bool previousTokenIsOp = true;
	bool operatorExpected = false;
	bool operatorOrEndTokenExpected = false;
	while(true) {
		bool success = true;
		string token = GetNextToken(expression, position, data, success, previousTokenIsOp);
		if(!success) {
			return false;
		}

		if(token.empty()) {
			break;
		}

		bool requireOperator = operatorExpected;
		bool requireOperatorOrEndToken = operatorOrEndTokenExpected;
		bool unaryOperator = previousTokenIsOp;
		
		operatorExpected = false;
		operatorOrEndTokenExpected = false;
		previousTokenIsOp = false;
		
		int precedence = 0;
		if(IsOperator(token, precedence, unaryOperator)) {
			EvalOperators op = GetOperator(token, unaryOperator);
			bool rightAssociative = unaryOperator;
			while(!opStack.empty() && ((rightAssociative && precedence < precedenceStack.top()) || (!rightAssociative && precedence <= precedenceStack.top()))) {
				//Pop operators from the stack until we find something with higher priority (or empty the stack)
				data.RpnQueue.push_back(opStack.top());
				opStack.pop();
				precedenceStack.pop();
			}
			opStack.push(op);
			precedenceStack.push(precedence);

			previousTokenIsOp = true;
		} else if(requireOperator) {
			//We needed an operator, and got something else, this isn't a valid expression (e.g "(3)4" or "[$00]22")
			return false;
		} else if(requireOperatorOrEndToken && token[0] != ')' && token[0] != ']' && token[0] != '}') {
			//We needed an operator or close token - this isn't a valid expression (e.g "%1134")
			return false;
		} else if(token[0] == '(') {
			parenthesisCount++;
			opStack.push(EvalOperators::Parenthesis);
			precedenceStack.push(0);
			previousTokenIsOp = true;
		} else if(token[0] == ')') {
			parenthesisCount--;
			if(!ProcessSpecialOperator(EvalOperators::Parenthesis, opStack, precedenceStack, data.RpnQueue)) {
				return false;
			}
			operatorOrEndTokenExpected = true;
		} else if(token[0] == '[') {
			bracketCount++;
			opStack.push(EvalOperators::Bracket);
			precedenceStack.push(0);
		} else if(token[0] == ']') {
			bracketCount--;
			if(!ProcessSpecialOperator(EvalOperators::Bracket, opStack, precedenceStack, data.RpnQueue)) {
				return false;
			}
			operatorOrEndTokenExpected = true;
		} else if(token[0] == '{') {
			braceCount++;
			opStack.push(EvalOperators::Braces);
			precedenceStack.push(0);
		} else if(token[0] == '}') {
			braceCount--;
			if(!ProcessSpecialOperator(EvalOperators::Braces, opStack, precedenceStack, data.RpnQueue)){
				return false;
			}
			operatorOrEndTokenExpected = true;
		} else {
			if(token[0] < '0' || token[0] > '9') {
				return false;
			} else {
				data.RpnQueue.push_back(std::stoll(token));
				operatorOrEndTokenExpected = true;
			}
		}
	}

	if(braceCount || bracketCount || parenthesisCount) {
		//Mismatching number of brackets/braces/parenthesis
		return false;
	}

	while(!opStack.empty()) {
		data.RpnQueue.push_back(opStack.top());
		opStack.pop();
	}

	return true;
}

int32_t ExpressionEvaluator::Evaluate(ExpressionData &data, DebugState &state, EvalResultType &resultType, MemoryOperationInfo &operationInfo)
{
	if(data.RpnQueue.empty()) {
		resultType = EvalResultType::Invalid;
		return 0;
	}

	int pos = 0;
	int64_t right = 0;
	int64_t left = 0;
	resultType = EvalResultType::Numeric;

	for(size_t i = 0, len = data.RpnQueue.size(); i < len; i++) {
		int64_t token = data.RpnQueue[i];

		if(token >= EvalValues::RegA) {
			//Replace value with a special value
			if(token >= EvalValues::FirstLabelIndex) {
				int64_t labelIndex = token - EvalValues::FirstLabelIndex;
				if((size_t)labelIndex < data.Labels.size()) {
					token = _labelManager->GetLabelRelativeAddress(data.Labels[(uint32_t)labelIndex], _cpuType);
					if(token < -1) {
						//Label doesn't exist, try to find a matching multi-byte label
						string label = data.Labels[(uint32_t)labelIndex] + "+0";
						token = _labelManager->GetLabelRelativeAddress(label, _cpuType);
					}
				} else {
					token = -2;
				}
				if(token < 0) {
					//Label is no longer valid
					resultType = token == -1 ? EvalResultType::OutOfScope : EvalResultType::Invalid;
					return 0;
				}
			} else {
				switch(token) {
					/*case EvalValues::RegOpPC: token = state.Cpu.DebugPC; break;*/
					case EvalValues::PpuFrameCount: token = _cpuType == CpuType::Gameboy ? state.Gameboy.Ppu.FrameCount : state.Ppu.FrameCount; break;
					case EvalValues::PpuCycle: token = _cpuType == CpuType::Gameboy ? state.Gameboy.Ppu.Cycle : state.Ppu.Cycle; break;
					case EvalValues::PpuScanline: token = _cpuType == CpuType::Gameboy ? state.Gameboy.Ppu.Scanline : state.Ppu.Scanline; break;
					case EvalValues::Value: token = operationInfo.Value; break;
					case EvalValues::Address: token = operationInfo.Address; break;
					//case EvalValues::AbsoluteAddress: token = _debugger->GetAbsoluteAddress(operationInfo.Address); break;
					case EvalValues::IsWrite: token = operationInfo.Type == MemoryOperationType::Write || operationInfo.Type == MemoryOperationType::DmaWrite; break;
					case EvalValues::IsRead: token = operationInfo.Type != MemoryOperationType::Write && operationInfo.Type != MemoryOperationType::DmaWrite; break;
					//case EvalValues::PreviousOpPC: token = state.CPU.PreviousDebugPC; break;

					default:
						switch(_cpuType) {
							case CpuType::Cpu:
							case CpuType::Sa1:
								switch(token) {
									case EvalValues::RegA: token = state.Cpu.A; break;
									case EvalValues::RegX: token = state.Cpu.X; break;
									case EvalValues::RegY: token = state.Cpu.Y; break;
									case EvalValues::RegSP: token = state.Cpu.SP; break;
									case EvalValues::RegPS: token = state.Cpu.PS; break;
									case EvalValues::RegPC: token = state.Cpu.PC; break;
									case EvalValues::Nmi: token = state.Cpu.NmiFlag; resultType = EvalResultType::Boolean; break;
									case EvalValues::Irq: token = state.Cpu.IrqSource != 0; resultType = EvalResultType::Boolean; break;
									case EvalValues::RegPS_Carry: token = (state.Cpu.PS & 1) != 0; break;
									case EvalValues::RegPS_Zero: token = (state.Cpu.PS & 2) != 0; break;
									case EvalValues::RegPS_Interrupt: token = (state.Cpu.PS & 4) != 0; break;
									case EvalValues::RegPS_Decimal: token = (state.Cpu.PS & 8) != 0; break;
									case EvalValues::RegPS_8bitIndex: token = (state.Cpu.PS & 16) != 0; break;
									case EvalValues::RegPS_8bit: token = (state.Cpu.PS & 32) != 0; break;
									case EvalValues::RegPS_16bitIndex: token = (state.Cpu.PS & 16) == 0; break;
									case EvalValues::RegPS_16bit: token = (state.Cpu.PS & 32) == 0; break;
									case EvalValues::RegPS_Overflow: token = (state.Cpu.PS & 64) != 0; break;
									case EvalValues::RegPS_Negative: token = (state.Cpu.PS & 128) != 0; break;
								}
								break;

							case CpuType::Spc:
								switch(token) {
									case EvalValues::RegA: token = state.Spc.A; break;
									case EvalValues::RegX: token = state.Spc.X; break;
									case EvalValues::RegY: token = state.Spc.Y; break;
									case EvalValues::RegSP: token = state.Spc.SP; break;
									case EvalValues::RegPS: token = state.Spc.PS; break;
									case EvalValues::RegPC: token = state.Spc.PC; break;
									case EvalValues::RegPS_Carry: token = (state.Cpu.PS & 1) != 0; break;
									case EvalValues::RegPS_Zero: token = (state.Cpu.PS & 2) != 0; break;
									case EvalValues::RegPS_Interrupt: (state.Cpu.PS & 4) != 0; break;
									case EvalValues::RegPS_HalfCarry: (state.Cpu.PS & 8) != 0; break;
									case EvalValues::RegPS_Break: (state.Cpu.PS & 16) != 0; break; 
									case EvalValues::RegPS_StackZeropage: (state.Cpu.PS & 32) != 0; break;
									case EvalValues::RegPS_Overflow: (state.Cpu.PS & 64) != 0; break;
									case EvalValues::RegPS_Negative: (state.Cpu.PS & 128) != 0; break;
								}
								break;

							case CpuType::Gameboy:
								switch(token) {
									case EvalValues::RegA: token = state.Gameboy.Cpu.A; break;
									case EvalValues::RegB: token = state.Gameboy.Cpu.B; break;
									case EvalValues::RegC: token = state.Gameboy.Cpu.C; break;
									case EvalValues::RegD: token = state.Gameboy.Cpu.D; break;
									case EvalValues::RegE: token = state.Gameboy.Cpu.E; break;
									case EvalValues::RegF: token = state.Gameboy.Cpu.Flags; break;
									case EvalValues::RegH: token = state.Gameboy.Cpu.H; break;
									case EvalValues::RegL: token = state.Gameboy.Cpu.L; break;
									case EvalValues::RegAF: token = (state.Gameboy.Cpu.A << 8) | state.Gameboy.Cpu.Flags; break;
									case EvalValues::RegBC: token = (state.Gameboy.Cpu.B << 8) | state.Gameboy.Cpu.C; break;
									case EvalValues::RegDE: token = (state.Gameboy.Cpu.D << 8) | state.Gameboy.Cpu.E; break;
									case EvalValues::RegHL: token = (state.Gameboy.Cpu.H << 8) | state.Gameboy.Cpu.L; break;
									case EvalValues::RegSP: token = state.Gameboy.Cpu.SP; break;
									case EvalValues::RegPC: token = state.Gameboy.Cpu.PC; break;
								}
								break;

							case CpuType::Gsu:
								switch(token) {
									case EvalValues::R0: token = state.Gsu.R[0]; break;
									case EvalValues::R1: token = state.Gsu.R[1]; break;
									case EvalValues::R2: token = state.Gsu.R[2]; break;
									case EvalValues::R3: token = state.Gsu.R[3]; break;
									case EvalValues::R4: token = state.Gsu.R[4]; break;
									case EvalValues::R5: token = state.Gsu.R[5]; break;
									case EvalValues::R6: token = state.Gsu.R[6]; break;
									case EvalValues::R7: token = state.Gsu.R[7]; break;
									case EvalValues::R8: token = state.Gsu.R[8]; break;
									case EvalValues::R9: token = state.Gsu.R[9]; break;
									case EvalValues::R10: token = state.Gsu.R[10]; break;
									case EvalValues::R11: token = state.Gsu.R[11]; break;
									case EvalValues::R12: token = state.Gsu.R[12]; break;
									case EvalValues::R13: token = state.Gsu.R[13]; break;
									case EvalValues::R14: token = state.Gsu.R[14]; break;
									case EvalValues::R15: token = state.Gsu.R[15]; break;

									case EvalValues::SrcReg: token = state.Gsu.SrcReg; break;
									case EvalValues::DstReg: token = state.Gsu.DestReg; break;
									
									case EvalValues::SFR: token = (state.Gsu.SFR.GetFlagsHigh() << 8) | state.Gsu.SFR.GetFlagsLow(); break;
									case EvalValues::PBR: token = state.Gsu.ProgramBank; break;
									case EvalValues::RomBR: token = state.Gsu.RomBank; break;
									case EvalValues::RamBR: token = state.Gsu.RamBank; break;
								}
								break;

							case CpuType::NecDsp:
							case CpuType::Cx4:
								throw std::runtime_error("Invalid CPU type");
						}
						break;
				}
			}
		} else if(token >= EvalOperators::Multiplication) {
			right = operandStack[--pos];
			if(pos > 0 && token <= EvalOperators::LogicalOr) {
				//Only do this for binary operators
				left = operandStack[--pos];
			}

			resultType = EvalResultType::Numeric;
			switch(token) {
				case EvalOperators::Multiplication: token = left * right; break;
				case EvalOperators::Division: 
					if(right == 0) {
						resultType = EvalResultType::DivideBy0;
						return 0;
					}
					token = left / right; break;
				case EvalOperators::Modulo:
					if(right == 0) {
						resultType = EvalResultType::DivideBy0;
						return 0;
					}
					token = left % right;
					break;
				case EvalOperators::Addition: token = left + right; break;
				case EvalOperators::Substration: token = left - right; break;
				case EvalOperators::ShiftLeft: token = left << right; break;
				case EvalOperators::ShiftRight: token = left >> right; break;
				case EvalOperators::SmallerThan: token = left < right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::SmallerOrEqual: token = left <= right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::GreaterThan: token = left > right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::GreaterOrEqual: token = left >= right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::Equal: token = left == right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::NotEqual: token = left != right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::BinaryAnd: token = left & right; break;
				case EvalOperators::BinaryXor: token = left ^ right; break;
				case EvalOperators::BinaryOr: token = left | right; break;
				case EvalOperators::LogicalAnd: token = left && right; resultType = EvalResultType::Boolean; break;
				case EvalOperators::LogicalOr: token = left || right; resultType = EvalResultType::Boolean; break;

				//Unary operators
				case EvalOperators::Plus: token = right; break;
				case EvalOperators::Minus: token = -right; break;
				case EvalOperators::BinaryNot: token = ~right; break;
				case EvalOperators::LogicalNot: token = !right; break;
				case EvalOperators::Bracket: token = _debugger->GetMemoryDumper()->GetMemoryValue(_cpuMemory, (uint32_t)right); break;
				case EvalOperators::Braces: token = _debugger->GetMemoryDumper()->GetMemoryValueWord(_cpuMemory, (uint32_t)right); break;
				default: throw std::runtime_error("Invalid operator");
			}
		}
		operandStack[pos++] = token;
	}
	return (int32_t)operandStack[0];
}

ExpressionEvaluator::ExpressionEvaluator(Debugger* debugger, CpuType cpuType)
{
	_debugger = debugger;
	_labelManager = debugger->GetLabelManager().get();
	_cpuType = cpuType;
	_cpuMemory = DebugUtilities::GetCpuMemoryType(cpuType);
}

ExpressionData ExpressionEvaluator::GetRpnList(string expression, bool &success)
{
	ExpressionData* cachedData = PrivateGetRpnList(expression, success);
	if(cachedData) {
		return *cachedData;
	} else {
		return ExpressionData();
	}
}

ExpressionData* ExpressionEvaluator::PrivateGetRpnList(string expression, bool& success)
{
	ExpressionData *cachedData = nullptr;
	{
		LockHandler lock = _cacheLock.AcquireSafe();

		auto result = _cache.find(expression);
		if(result != _cache.end()) {
			cachedData = &(result->second);
		}
	}

	if(cachedData == nullptr) {
		string fixedExp = expression;
		fixedExp.erase(std::remove(fixedExp.begin(), fixedExp.end(), ' '), fixedExp.end());
		ExpressionData data;
		success = ToRpn(fixedExp, data);
		if(success) {
			LockHandler lock = _cacheLock.AcquireSafe();
			_cache[expression] = data;
			cachedData = &_cache[expression];
		}
	} else {
		success = true;
	}

	return cachedData;
}

int32_t ExpressionEvaluator::PrivateEvaluate(string expression, DebugState &state, EvalResultType &resultType, MemoryOperationInfo &operationInfo, bool& success)
{
	success = true;
	ExpressionData *cachedData = PrivateGetRpnList(expression, success);

	if(!success) {
		resultType = EvalResultType::Invalid;
		return 0;
	}

	return Evaluate(*cachedData, state, resultType, operationInfo);	
}

int32_t ExpressionEvaluator::Evaluate(string expression, DebugState &state, EvalResultType &resultType, MemoryOperationInfo &operationInfo)
{
	try {
		bool success;
		int32_t result = PrivateEvaluate(expression, state, resultType, operationInfo, success);
		if(success) {
			return result;
		}
	} catch(std::exception&) {
	}
	resultType = EvalResultType::Invalid;
	return 0;
}

bool ExpressionEvaluator::Validate(string expression)
{
	try {
		DebugState state;
		EvalResultType type;
		MemoryOperationInfo operationInfo;
		bool success;
		PrivateEvaluate(expression, state, type, operationInfo, success);
		return success;
	} catch(std::exception&) {
		return false;
	}
}

#if _DEBUG
#include <assert.h>
void ExpressionEvaluator::RunTests()
{
	//Some basic unit tests to run in debug mode
	auto test = [=](string expr, EvalResultType expectedType, int expectedResult) {
		DebugState state = { 0 };
		MemoryOperationInfo opInfo { 0, 0, MemoryOperationType::Read };
		EvalResultType type;
		int32_t result = Evaluate(expr, state, type, opInfo);

		assert(type == expectedType);
		assert(result == expectedResult);
	};
	
	test("1 - -1", EvalResultType::Numeric, 2);
	test("1 - (-1)", EvalResultType::Numeric, 2);
	test("1 - -(-1)", EvalResultType::Numeric, 0);
	test("(0 - 1) == -1 && 5 < 10", EvalResultType::Boolean, true);
	test("(0 - 1) == 0 || 5 < 10", EvalResultType::Boolean, true);
	test("(0 - 1) == 0 || 5 < -10", EvalResultType::Boolean, false);
	test("(0 - 1) == 0 || 15 < 10", EvalResultType::Boolean, false);

	test("10 != $10", EvalResultType::Boolean, true);
	test("10 == $A", EvalResultType::Boolean, true);
	test("10 == $0A", EvalResultType::Boolean, true);

	test("(0 - 1 == 0 || 15 < 10", EvalResultType::Invalid, 0);
	test("10 / 0", EvalResultType::DivideBy0, 0);

	test("x + 5", EvalResultType::Numeric, 5);
	test("x == 0", EvalResultType::Boolean, true);
	test("x == y", EvalResultType::Boolean, true);
	test("x == y == scanline", EvalResultType::Boolean, false); //because (x == y) is true, and true != scanline
	test("x == y && !(a == x)", EvalResultType::Boolean, false);

	test("(~0 & ~1) & $FFF == $FFE", EvalResultType::Numeric, 0); //because of operator priority (& is done after ==)
	test("((~0 & ~1) & $FFF) == $FFE", EvalResultType::Boolean, true);

	test("1+3*3+10/(3+4)", EvalResultType::Numeric, 11);
	test("(1+3*3+10)/(3+4)", EvalResultType::Numeric, 2);
	test("(1+3*3+10)/3+4", EvalResultType::Numeric, 10);

	test("{$4500}", EvalResultType::Numeric, 0x4545);
	test("[$4500]", EvalResultType::Numeric, 0x45);
	
	test("[$45]3", EvalResultType::Invalid, 0);
	test("($45)3", EvalResultType::Invalid, 0);
	test("($45]", EvalResultType::Invalid, 0);
	
	test("%11", EvalResultType::Numeric, 3);
	test("%011", EvalResultType::Numeric, 3);
	test("%1011", EvalResultType::Numeric, 11);
	test("%12", EvalResultType::Invalid, 0);

	test("10 % 5", EvalResultType::Numeric, 0);
	test("%100 % 5", EvalResultType::Numeric, 4);
	test("%100%5", EvalResultType::Numeric, 4);
	test("%10(10)", EvalResultType::Invalid, 0);
	test("10%4*10", EvalResultType::Numeric, 20);
	test("(5+5)%3", EvalResultType::Numeric, 1);
	test("11%%10", EvalResultType::Numeric, 1); //11 modulo of 2 in binary (%10)

	test("[$4500+[$4500]]", EvalResultType::Numeric, 0x45);
	test("-($10+[$4500])", EvalResultType::Numeric, -0x55);
}
#endif