#include "stdafx.h" #include #include "ExpressionEvaluator.h" #include "Console.h" #include "Debugger.h" std::unordered_map, StringHasher> ExpressionEvaluator::_outputCache; SimpleLock ExpressionEvaluator::_cacheLock; 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)(2000000050 + i); } } } else { for(size_t i = 0, len = _binaryOperators.size(); i < len; i++) { if(token.compare(_binaryOperators[i]) == 0) { return (EvalOperators)(2000000000 + i); } } } return EvalOperators::Addition; } bool ExpressionEvaluator::CheckSpecialTokens(string expression, size_t &pos, string &output) { string token; size_t len = expression.size(); do { char c = std::tolower(expression[pos]); if(c >= 'a' && c <= 'z') { token += c; pos++; } else { break; } } while(pos < len); if(!token.compare("a")) { output += std::to_string(EvalValues::RegA); } else if(!token.compare("x")) { output += std::to_string(EvalValues::RegX); } else if(!token.compare("y")) { output += std::to_string(EvalValues::RegY); } else if(!token.compare("ps")) { output += std::to_string(EvalValues::RegPS); } else if(!token.compare("sp")) { output += std::to_string(EvalValues::RegSP); } else if(!token.compare("cycle")) { output += std::to_string(EvalValues::PpuCycle); } else if(!token.compare("scanline")) { output += std::to_string(EvalValues::PpuScanline); } else if(!token.compare("irq")) { output += std::to_string(EvalValues::Irq); } else if(!token.compare("nmi")) { output += std::to_string(EvalValues::Nmi); } else if(!token.compare("value")) { output += std::to_string(EvalValues::Value); } else if(!token.compare("address")) { output += std::to_string(EvalValues::Address); } else if(!token.compare("romaddress")) { output += std::to_string(EvalValues::AbsoluteAddress); } else { return false; } return true; } string ExpressionEvaluator::GetNextToken(string expression, size_t &pos) { string output; bool isOperator = false; bool isNumber = false; bool isHex = false; size_t initialPos = pos; for(size_t len = expression.size(); pos < len; pos++) { char c = std::tolower(expression[pos]); if(c == '$' && pos == initialPos) { isHex = true; } else if((c >= '0' && c <= '9') || (isHex && c >= 'a' && c <= 'f')) { if(isNumber || output.empty()) { output += c; isNumber = true; } else { //Just hit the start of a number, done reading current token break; } } else if(isNumber) { //First non-numeric character, done break; } else if(c == '(' || c == ')' || c == '[' || c == ']' || c == '-' || c == '+' || c == '~') { if(output.empty()) { output += c; pos++; } break; } else if(c == '!') { //Figure out if it's ! or != if(pos < len - 1) { if(expression[pos + 1] == '=') { output += "!="; pos+=2; } else { output += "!"; pos++; } } break; } else { if(c == '$') { break; } else if(c < 'a' || c > 'z') { //Not a number, not a letter, this is an operator isOperator = true; output += c; } else { if(isOperator) { break; } else { if(output.empty()) { if(CheckSpecialTokens(expression, pos, output)) { break; } } output += c; } } } } if(isHex) { unsigned int x; std::stringstream ss; ss << std::hex << output; ss >> x; output = std::to_string(x); } return output; } void ExpressionEvaluator::ToRpn(string expression, vector &outputQueue) { std::stack opStack = std::stack(); std::stack precedenceStack; size_t position = 0; bool previousTokenIsOp = true; while(true) { string token = GetNextToken(expression, position); if(token.empty()) { break; } bool unaryOperator = previousTokenIsOp; previousTokenIsOp = false; int precedence = 0; if(IsOperator(token, precedence, unaryOperator)) { EvalOperators op = GetOperator(token, unaryOperator); if(!opStack.empty()) { EvalOperators topOp = opStack.top(); if((unaryOperator && precedence < precedenceStack.top()) || (!unaryOperator && precedence <= precedenceStack.top())) { opStack.pop(); precedenceStack.pop(); outputQueue.push_back(topOp); } } opStack.push(op); precedenceStack.push(precedence); previousTokenIsOp = true; } else if(token[0] == '(') { opStack.push(EvalOperators::Parenthesis); precedenceStack.push(0); } else if(token[0] == ')') { while(opStack.top() != EvalOperators::Parenthesis) { outputQueue.push_back(opStack.top()); opStack.pop(); } opStack.pop(); } else if(token[0] == '[') { opStack.push(EvalOperators::Bracket); precedenceStack.push(0); } else if(token[0] == ']') { while(opStack.top() != EvalOperators::Bracket) { outputQueue.push_back(opStack.top()); opStack.pop(); } outputQueue.push_back(opStack.top()); opStack.pop(); } else { outputQueue.push_back(std::stoi(token)); } } while(!opStack.empty()) { outputQueue.push_back(opStack.top()); opStack.pop(); } } int32_t ExpressionEvaluator::EvaluateExpression(vector *outputQueue, DebugState &state, EvalResultType &resultType, int16_t memoryValue, uint32_t memoryAddr) { int pos = 0; int right = 0; int left = 0; int operandStack[1000]; resultType = EvalResultType::Numeric; shared_ptr debugger = Console::GetInstance()->GetDebugger(); for(size_t i = 0, len = outputQueue->size(); i < len; i++) { int token = (*outputQueue)[i]; if(token >= EvalValues::RegA) { //Replace value with a special value 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::RegPS: token = state.CPU.PS; break; case EvalValues::RegSP: token = state.CPU.SP; break; case EvalValues::Irq: token = state.CPU.IRQFlag; break; case EvalValues::Nmi: token = state.CPU.NMIFlag; break; case EvalValues::PpuCycle: token = state.PPU.Cycle; break; case EvalValues::PpuScanline: token = state.PPU.Scanline; break; case EvalValues::Value: token = memoryValue; break; case EvalValues::Address: token = memoryAddr; break; case EvalValues::AbsoluteAddress: token = debugger->GetAbsoluteAddress(memoryAddr); break; } } else if(token >= EvalOperators::Multiplication) { right = operandStack[--pos]; if(pos > 0) { left = operandStack[--pos]; } resultType = EvalResultType::Numeric; switch(token) { case EvalOperators::Multiplication: token = left * right; break; case EvalOperators::Division: token = left / right; break; case EvalOperators::Modulo: 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::Bracket: token = debugger->GetMemoryValue(right); break; case EvalOperators::Plus: token = right; break; case EvalOperators::Minus: token = -right; break; case EvalOperators::BinaryNot: token = ~right; break; case EvalOperators::LogicalNot: token = !right; break; default: throw std::runtime_error("Invalid operator"); } } operandStack[pos++] = token; } return operandStack[0]; } ExpressionEvaluator::ExpressionEvaluator() { } int32_t ExpressionEvaluator::PrivateEvaluate(string expression, DebugState &state, EvalResultType &resultType, int16_t memoryValue, uint32_t memoryAddr) { vector *outputQueue = nullptr; { LockHandler lock = _cacheLock.AcquireSafe(); auto cacheOutputQueue = _outputCache.find(expression); if(cacheOutputQueue != _outputCache.end()) { outputQueue = &(cacheOutputQueue->second); } } if(outputQueue == nullptr) { vector output; string fixedExp = expression; fixedExp.erase(std::remove(fixedExp.begin(), fixedExp.end(), ' '), fixedExp.end()); ToRpn(fixedExp, output); LockHandler lock = _cacheLock.AcquireSafe(); _outputCache[expression] = output; outputQueue = &_outputCache[expression]; } return EvaluateExpression(outputQueue, state, resultType, memoryValue, memoryAddr); } int32_t ExpressionEvaluator::Evaluate(string expression, DebugState &state, int16_t memoryValue, uint32_t memoryAddr) { EvalResultType resultType; return Evaluate(expression, state, resultType, memoryValue, memoryAddr); } int32_t ExpressionEvaluator::Evaluate(string expression, DebugState &state, EvalResultType &resultType, int16_t memoryValue, uint32_t memoryAddr) { try { return PrivateEvaluate(expression, state, resultType, memoryValue, memoryAddr); } catch(std::exception) { resultType = EvalResultType::Invalid; return 0; } } bool ExpressionEvaluator::Validate(string expression) { try { DebugState state; EvalResultType type; PrivateEvaluate(expression, state, type, 0, 0); return true; } catch(std::exception e) { return false; } }