libpsyc/src/parser.c

346 lines
8.8 KiB
C
Raw Normal View History

2010-02-20 16:40:09 +00:00
#include <stdint.h>
2010-02-20 19:31:22 +00:00
#include <stdlib.h>
2010-02-20 16:40:09 +00:00
#ifdef DEBUG
#include <stdio.h>
#endif
#include <psyc/parser.h>
2010-02-20 19:31:22 +00:00
2010-02-20 16:40:09 +00:00
/** @brief isGlyph
*
* @todo: document this function
*/
inline char isGlyph(uint8_t g)
{
switch(g)
{
case ':':
case '-':
case '+':
case '=':
return 1;
default:
return 0;
}
}
2010-02-20 19:31:22 +00:00
inline char isNumeric(uint8_t c)
{
return c >= '0' && c <= '9' ;
}
2010-02-20 16:40:09 +00:00
inline char isAlphaNumeric(uint8_t c)
{
return
(( c >= 'a' && c <= 'z' )||
( c >= 'A' && c <= 'Z' )||
2010-02-20 19:31:22 +00:00
isNumeric(c))
2010-02-20 16:40:09 +00:00
;
}
2010-02-20 19:31:22 +00:00
2010-02-20 16:40:09 +00:00
/** @brief generalized linebased parser */
2011-04-15 23:42:36 +00:00
inline int PSYC_parse(
PSYC_State* state,
PSYC_Array* name, PSYC_Array* value,
2011-04-15 23:42:36 +00:00
uint8_t* modifier, unsigned long* expectedBytes)
2010-02-20 16:40:09 +00:00
{
/* first we test if we can access the first char */
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=state->cursor) // cursor is not inside the length
2010-02-20 16:40:09 +00:00
return 1; // return insufficient data.
// in case we return insufficent, we rewind to the start.
2011-04-15 23:42:36 +00:00
unsigned int startc=state->cursor;
2010-02-20 16:40:09 +00:00
/* each line of the header starts with a glyph.
* iE :_name, -_name +_name etc, so just test if
* the first char is a glyph. */
2011-04-15 23:42:36 +00:00
if(1==state->inHeader)
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
if(!isGlyph(state->buffer.ptr[state->cursor])) // is the first char not a glyph?
2010-02-20 16:40:09 +00:00
{
// the only other possibility now is that the packet
// is complete(empty packet) or that the method started.
2011-04-15 23:42:36 +00:00
if(isAlphaNumeric(state->buffer.ptr[state->cursor]))
{
state->inHeader = 0;
2010-02-20 16:40:09 +00:00
return 2; // return header finished
2011-04-15 23:42:36 +00:00
}
2010-02-20 16:40:09 +00:00
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] == '|')
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 16:40:09 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor]=='\n')
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
++(state->cursor);
2010-02-20 16:40:09 +00:00
return 3; // return packet finished
}
}
return -6; // report error
}else // it is a glyph, so a variable name starts here
{
*modifier = *(state->buffer.ptr+state->cursor);
if (state->buffer.length <= ++(state->cursor))
{
state->cursor = startc; // rewind to start of line
return 1; // return insufficient
}
name->ptr = state->buffer.ptr + state->cursor;
2011-04-15 23:42:36 +00:00
name->length = 0;
2010-02-20 16:40:09 +00:00
}
}
2011-04-15 23:42:36 +00:00
2010-02-20 16:40:09 +00:00
char method=0;
/* in the body, the same applies, only that the
* method does not start with a glyph.*/
2011-04-15 23:42:36 +00:00
if(0==state->inHeader && !isGlyph(state->buffer.ptr[state->cursor]))
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
if(!isAlphaNumeric(state->buffer.ptr[state->cursor]) && state->buffer.ptr[state->cursor] != '_')
2010-02-20 16:40:09 +00:00
{
// the body rule is optional, which means
// that now also just |\n can follow.
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] == '|')
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 16:40:09 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor]=='\n')
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
++(state->cursor);
2010-02-20 16:40:09 +00:00
return 3; // return packet finished
}
}
return -5; // report error
}
else
{
2011-04-15 23:42:36 +00:00
name->ptr = state->buffer.ptr+state->cursor;
name->length=1;
2010-02-20 16:40:09 +00:00
method=1;
}
2010-02-20 16:40:09 +00:00
}
else
{
*modifier = *(state->buffer.ptr+state->cursor);
if (state->buffer.length <= ++(state->cursor))
{
state->cursor = startc; // rewind
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
name->ptr = state->buffer.ptr+state->cursor;
name->length=1;
2010-02-20 16:40:09 +00:00
}
/* validate the incremented cursor */
2011-04-15 23:42:36 +00:00
if(state->buffer.length <= ++(state->cursor))
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc;
2010-02-20 16:40:09 +00:00
return 1;
}
/* what follows is the name. At least one char.
* allowed is alphanumeric and _ */
// first char must exist.
2011-04-15 23:42:36 +00:00
if(!isAlphaNumeric(state->buffer.ptr[state->cursor]) // is it not alphanum
&& state->buffer.ptr[state->cursor] != '_') // AND not '_'. must be invalid then
2010-02-20 16:40:09 +00:00
return -1; // return parser error.
2011-04-15 23:42:36 +00:00
name->length+=1;
2010-02-20 16:40:09 +00:00
/* now checking how long the name of the variable is. */
unsigned int i=0;
while(1)
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<= ++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 16:40:09 +00:00
return 1; // return insufficient
}
// same as bevore
2011-04-15 23:42:36 +00:00
if(!isAlphaNumeric(state->buffer.ptr[state->cursor]) &&
state->buffer.ptr[state->cursor] != '_')
2010-02-20 16:40:09 +00:00
break; // not valid? then stop the loop right here
2011-04-15 23:42:36 +00:00
++(name->length); // was a valid char, increase length
2010-02-20 16:40:09 +00:00
}
/* we now parsed the variable name successfully
* after the name either a \n or a \t follows.
*
2011-04-15 23:42:36 +00:00
* for the method, the state->buffer.ptr starts after an \n
2010-02-20 16:40:09 +00:00
* so checking for \n too here
* We dont check if cursor inside length, because
2010-02-20 18:50:10 +00:00
* the last loop iteration did that already.
*/
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] == '\t' || state->buffer.ptr[state->cursor] == '\n') // && method==1))
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
/* after the \t the arg-state->buffer.ptr follows, which is
* anything but \n. arg-state->buffer.ptr can be of length 0
2010-02-20 16:40:09 +00:00
*
2011-04-15 23:42:36 +00:00
* for the method: after the \n state->buffer.ptr follows,
2010-02-20 16:40:09 +00:00
* which is anything but \n|\n
*
2011-04-15 23:42:36 +00:00
* but state->buffer.ptr is optional, so we first check
* here if state->buffer.ptr follows at all.
2010-02-20 22:06:33 +00:00
*
2011-04-15 23:42:36 +00:00
* arg-state->buffer.ptr=value->ptr. we set value here so it
2010-02-20 16:40:09 +00:00
* points to a valid range and so we point
2011-04-15 23:42:36 +00:00
* to the first potential arg-state->buffer.ptr byte.
* If there is no arg-state->buffer.ptr, we still have
2010-02-20 16:40:09 +00:00
* the length attribute on 0. */
2011-04-15 23:42:36 +00:00
if((method == 0 && state->buffer.ptr[state->cursor] == '\n') /* emptyvar */ ||
(method == 1 && state->cursor+2 < state->buffer.length &&
state->buffer.ptr[state->cursor+1] == '|' &&
state->buffer.ptr[state->cursor+2] == '\n') /*no state->buffer.ptr */ )
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
value->ptr=state->buffer.ptr+state->cursor;
value->length=0;
2010-02-20 22:06:33 +00:00
}
else
2010-02-20 18:50:10 +00:00
{
2011-04-15 23:42:36 +00:00
value->ptr=state->buffer.ptr+state->cursor+1;
if (1==state->length) // we know the length of the packet
{
2011-04-15 23:42:36 +00:00
value->length= state->buffer.length - state->cursor -3;
}
else // else search for the terminator
{
2011-04-15 23:42:36 +00:00
value->length=0;
while (1)
2010-02-20 18:50:10 +00:00
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 18:50:10 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 18:50:10 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(0 == method && state->buffer.ptr[state->cursor] == '\n')
2010-02-20 21:18:39 +00:00
break;
2011-04-15 23:42:36 +00:00
if(1 == method && state->buffer.ptr[state->cursor] == '\n')
2010-02-20 21:18:39 +00:00
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=(state->cursor)+2) // incremented cursor inside lenght?
2010-02-20 21:18:39 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 21:18:39 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor+1] == '|')
if(state->buffer.ptr[state->cursor+2] == '\n')
2010-02-20 22:06:33 +00:00
{
/* packet finishes here */
2011-04-15 23:42:36 +00:00
state->cursor+=3;
2010-02-20 22:06:33 +00:00
return 3;
}
2010-02-20 18:50:10 +00:00
}
2011-04-15 23:42:36 +00:00
++(value->length);
2010-02-20 22:06:33 +00:00
}
}
2010-02-20 16:40:09 +00:00
}
2011-04-15 23:42:36 +00:00
}else if(state->inHeader == 0 && method==0 && state->buffer.ptr[state->cursor] == ' ') // oi, its a binary var!
2010-02-20 19:31:22 +00:00
{ // after SP the length follows.
2011-04-15 23:42:36 +00:00
const uint8_t * bin_length_str = state->buffer.ptr + state->cursor+1;
2010-02-20 19:31:22 +00:00
int strln = 0;
do
{
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 19:31:22 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 19:31:22 +00:00
return 1; // return insufficient
}
++strln;
2011-04-15 23:42:36 +00:00
}
while(isNumeric(state->buffer.ptr[state->cursor]));
2010-02-20 19:31:22 +00:00
// after the length a TAB follows
2011-04-15 23:42:36 +00:00
if (state->buffer.ptr[state->cursor] != '\t')
2010-02-20 19:31:22 +00:00
return -8;
2010-02-20 21:18:39 +00:00
2010-02-20 19:31:22 +00:00
// now we have the length. convert it to int
int binLength = atoi(bin_length_str);
// is that still in this buffer?
2011-04-15 23:42:36 +00:00
if(state->buffer.length <= state->cursor+binLength+1 )
2010-02-20 19:31:22 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc;
2010-02-20 19:31:22 +00:00
return 1;
}
2011-04-15 23:42:36 +00:00
value->ptr = state->buffer.ptr + state->cursor+1;
value->length=binLength;
state->cursor += binLength+1;
2010-02-20 19:31:22 +00:00
}else
return -8;
2010-02-20 16:40:09 +00:00
/* if there was a \t, then we parsed up until the
2011-04-15 23:42:36 +00:00
* \n char from the simple-arg rule ( \t arg-state->buffer.ptr \n )
2010-02-20 16:40:09 +00:00
*
* Now, if there would be no \t, we still would be at
* the point where a \n must follow.
*
* So, just checking \n here will cover both cases of
* the alternative ( simple-arg / \n ) from rule
* routing-modifier
*
* again, the loop has already validated the cursors
* position*/
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] != '\n')
2010-02-20 16:40:09 +00:00
return -2; // return parser error.
/* if a \n follows now, the an body is attached.
* if not, a |\n must follow */
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 16:40:09 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(1 == state->inHeader && state->buffer.ptr[state->cursor] == '\n')
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor+=1;
state->inHeader = 0;
2010-02-20 16:40:09 +00:00
return 2; // line is complete, but body starts now.
}
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] != '|') // no pipe, then only line complete, not the packet.
2010-02-20 16:40:09 +00:00
return 0;
2011-04-15 23:42:36 +00:00
if(state->buffer.length<=++(state->cursor)) // incremented cursor inside lenght?
2010-02-20 16:40:09 +00:00
{
2011-04-15 23:42:36 +00:00
state->cursor=startc; // set to start value
2010-02-20 16:40:09 +00:00
return 1; // return insufficient
}
2011-04-15 23:42:36 +00:00
if(state->buffer.ptr[state->cursor] != '\n')
2010-02-20 16:40:09 +00:00
return -4;
2011-04-15 23:42:36 +00:00
state->cursor+=1;
2010-02-20 16:40:09 +00:00
return 3; // packet is complete
}