fome-fw/firmware/controllers/core/logic_expression.cpp

252 lines
4.8 KiB
C++
Raw Normal View History

2014-10-03 12:05:03 -07:00
/**
* @file logic_expression.cpp
*
* @date Oct 3, 2014
* @author Andrey Belomutskiy, (c) 2012-2014
*/
#include "main.h"
#include "logic_expression.h"
2014-10-05 11:03:00 -07:00
#include "le_functions.h"
2014-10-03 12:05:03 -07:00
2014-10-04 15:03:07 -07:00
LENameOrdinalPair * LE_FIRST = NULL;
/**
* the main point of these static fields is that their constructor would register
* them in the magic list of operator name/ordinal pairs
*/
static LENameOrdinalPair leAnd(LE_OPERATOR_AND, "and");
static LENameOrdinalPair leOr(LE_OPERATOR_OR, "or");
static LENameOrdinalPair leMore(LE_OPERATOR_MORE, ">");
static LENameOrdinalPair leMoreOrEqual(LE_OPERATOR_MORE_OR_EQUAL, ">=");
2014-10-05 07:03:00 -07:00
static LENameOrdinalPair leNot(LE_OPERATOR_NOT, "not");
2014-10-04 15:03:07 -07:00
LENameOrdinalPair::LENameOrdinalPair(le_action_e action, const char *name) {
this->action = action;
this->name = name;
2014-10-05 07:03:00 -07:00
this->next = LE_FIRST;
2014-10-04 15:03:07 -07:00
LE_FIRST = this;
}
2014-10-03 12:05:03 -07:00
LEElement::LEElement() {
action = LE_UNDEFINED;
next = NULL;
}
//void LEElement::init(le_action_e action, int iValue) {
// this->action = action;
// this->iValue = iValue;
//}
void LEElement::init(le_action_e action) {
this->action = action;
}
void LEElement::init(le_action_e action, float fValue) {
this->action = action;
this->fValue = fValue;
}
LECalculator::LECalculator() {
2014-10-03 15:03:01 -07:00
reset();
}
void LECalculator::reset() {
2014-10-03 12:05:03 -07:00
first = NULL;
2014-10-03 15:03:01 -07:00
stack.reset();
2014-10-03 12:05:03 -07:00
}
2014-10-06 02:03:01 -07:00
void LECalculator::reset(LEElement *element) {
first = NULL;
stack.reset();
add(element);
}
void LECalculator::add(LEElement *element) {
if (first == NULL) {
first = element;
} else {
LEElement *last = first;
while (last->next != NULL) {
last = last->next;
}
last->next = element;
}
}
2014-10-03 14:03:00 -07:00
static bool float2bool(float v) {
return v != 0;
}
2014-10-03 12:05:03 -07:00
2014-10-03 14:03:00 -07:00
void LECalculator::doJob(LEElement *element) {
switch (element->action) {
2014-10-03 12:05:03 -07:00
2014-10-03 14:03:00 -07:00
case LE_NUMERIC_VALUE:
2014-10-03 12:05:03 -07:00
stack.push(element->fValue);
2014-10-03 14:03:00 -07:00
break;
case LE_OPERATOR_AND: {
float v1 = stack.pop();
float v2 = stack.pop();
stack.push(float2bool(v1) && float2bool(v2));
}
break;
case LE_OPERATOR_OR: {
float v1 = stack.pop();
float v2 = stack.pop();
stack.push(float2bool(v1) || float2bool(v2));
}
break;
case LE_OPERATOR_LESS: {
2014-10-05 07:03:00 -07:00
// elements on stack are in reverse order
2014-10-03 14:03:00 -07:00
float v2 = stack.pop();
2014-10-05 07:03:00 -07:00
float v1 = stack.pop();
2014-10-03 14:03:00 -07:00
stack.push(v1 < v2);
}
break;
2014-10-05 07:03:00 -07:00
case LE_OPERATOR_NOT: {
float v = stack.pop();
stack.push(!float2bool(v));
}
break;
2014-10-03 14:03:00 -07:00
case LE_OPERATOR_MORE: {
2014-10-05 07:03:00 -07:00
// elements on stack are in reverse order
2014-10-03 14:03:00 -07:00
float v2 = stack.pop();
2014-10-05 07:03:00 -07:00
float v1 = stack.pop();
2014-10-03 14:03:00 -07:00
stack.push(v1 > v2);
}
break;
case LE_OPERATOR_LESS_OR_EQUAL: {
2014-10-05 07:03:00 -07:00
// elements on stack are in reverse order
2014-10-03 14:03:00 -07:00
float v2 = stack.pop();
2014-10-05 07:03:00 -07:00
float v1 = stack.pop();
2014-10-03 12:05:03 -07:00
2014-10-03 14:03:00 -07:00
stack.push(v1 <= v2);
}
break;
case LE_OPERATOR_MORE_OR_EQUAL: {
2014-10-05 07:03:00 -07:00
// elements on stack are in reverse order
2014-10-03 14:03:00 -07:00
float v2 = stack.pop();
2014-10-05 07:03:00 -07:00
float v1 = stack.pop();
2014-10-03 14:03:00 -07:00
stack.push(v1 >= v2);
}
break;
2014-10-05 07:03:00 -07:00
case LE_UNDEFINED:
firmwareError("Undefined not expected here");
break;
2014-10-03 14:03:00 -07:00
default:
2014-10-05 07:03:00 -07:00
stack.push(getLEValue(NULL, element->action));
2014-10-03 14:03:00 -07:00
}
}
2014-10-03 12:05:03 -07:00
2014-10-03 14:03:00 -07:00
float LECalculator::getValue() {
LEElement *element = first;
stack.reset();
while (element != NULL) {
doJob(element);
2014-10-03 12:05:03 -07:00
element = element->next;
}
return stack.pop();
}
2014-10-03 15:03:01 -07:00
LEElementPool::LEElementPool() {
reset();
}
void LEElementPool::reset() {
index = 0;
}
LEElement *LEElementPool::next() {
2014-10-06 02:03:01 -07:00
if (index == LE_ELEMENT_POOL_SIZE - 1) {
firmwareError("LE_ELEMENT_POOL_SIZE overflow");
return NULL;
}
2014-10-03 15:03:01 -07:00
return &pool[index++];
}
2014-10-04 08:03:38 -07:00
2014-10-04 11:02:53 -07:00
bool isNumeric(const char* line) {
return line[0] >= '0' && line[0] <= '9';
}
2014-10-04 08:03:38 -07:00
const char *processToken(const char *line, char *buffer) {
while (line[0] != 0 && line[0] == ' ') {
line++;
}
if (line[0] == 0) {
return NULL;
}
int tokenLen = indexOf(line, ' ');
if (tokenLen == -1) {
// no space - the whole remaining line is the token
strcpy(buffer, line);
return line + strlen(buffer);
}
strncpy(buffer, line, tokenLen);
buffer[tokenLen] = 0;
line += tokenLen;
return line;
}
2014-10-04 11:02:53 -07:00
le_action_e parseAction(const char * line) {
2014-10-04 15:03:07 -07:00
LENameOrdinalPair *pair = LE_FIRST;
while (pair != NULL) {
if (strEqualCaseInsensitive(pair->name, line)) {
2014-10-05 07:03:00 -07:00
return pair->action;
2014-10-04 15:03:07 -07:00
}
pair = pair->next;
2014-10-04 11:02:53 -07:00
}
return LE_UNDEFINED;
}
static char parsingBuffer[64];
LEElement * parseExpression(LEElementPool *pool, const char * line) {
LEElement *first = NULL;
LEElement *last = NULL;
while (true) {
line = processToken(line, parsingBuffer);
if (line == NULL) {
/**
* No more tokens in this line
*/
return first;
}
LEElement *n = pool->next();
if (isNumeric(parsingBuffer)) {
n->init(LE_NUMERIC_VALUE, atoff(parsingBuffer));
} else {
le_action_e action = parseAction(parsingBuffer);
2014-10-05 07:03:00 -07:00
if (action == LE_UNDEFINED) {
/**
* Cannot recognize token
*/
warning((obd_code_e) 0, "unrecognized [%s]", parsingBuffer);
return NULL;
}
2014-10-04 11:02:53 -07:00
n->init(action);
}
if (first == NULL) {
first = n;
last = n;
} else {
last->next = n;
last = last->next;
}
}
return first;
}