mirror of
https://github.com/markqvist/OpenModem.git
synced 2025-07-26 00:35:16 -04:00
Working
This commit is contained in:
Mark Qvist
commit
c898b090dd
1049 changed files with 288572 additions and 0 deletions
31
bertos/net/nmeap/src/Makefile
Normal file
31
bertos/net/nmeap/src/Makefile
Normal file
|
|
@ -0,0 +1,31 @@
|
|||
# specify compiler flags
|
||||
CFLAGS = -I $(INC) $(CDEFS) -g -O0 -Werror -Wall
|
||||
|
||||
# set library name
|
||||
LIBNAME = libnmeap.a
|
||||
|
||||
COBJ = nmeap01.o
|
||||
|
||||
INCLUDES= $(INC)/nmeap.h $(INC)/nmeap_def.h
|
||||
|
||||
# build everything
|
||||
all : $(LIB)/$(LIBNAME)
|
||||
|
||||
# build the library
|
||||
$(LIB)/$(LIBNAME) : $(COBJ)
|
||||
-$(RM) $(LIB)/$(LIBNAME)
|
||||
$(AR) -q $(LIB)/$(LIBNAME) $(COBJ)
|
||||
|
||||
# build all c files into .o files
|
||||
$(COBJ): %.o: %.c
|
||||
$(CC) -c $(CFLAGS) $(SRC)/$< -o $@
|
||||
|
||||
# erase all intermediate and output files
|
||||
clean :
|
||||
-$(RM) *.o
|
||||
-$(RM) *~
|
||||
-$(RM) $(LIB)/$(LIBNAME)
|
||||
|
||||
# include file dependencies
|
||||
$(COBJ) : $(INCLUDES)
|
||||
|
||||
20
bertos/net/nmeap/src/nmeap.mak
Normal file
20
bertos/net/nmeap/src/nmeap.mak
Normal file
|
|
@ -0,0 +1,20 @@
|
|||
INCLUDES= ..\inc\nmeap.h ..\inc\nmeap_def.h
|
||||
CSRC = nmeap01.c
|
||||
LIBNAME = ..\lib\libnmeap.lib
|
||||
|
||||
# build everything
|
||||
all : $(LIBNAME)
|
||||
|
||||
$(LIBNAME) : nmeap01.obj
|
||||
-erase $(LIBNAME)
|
||||
lib /OUT:$(LIBNAME) nmeap01.obj
|
||||
|
||||
nmeap01.obj : nmeap01.c $(INCLUDES)
|
||||
cl /DNDEBUG /c /I..\inc nmeap01.c
|
||||
|
||||
# erase all intermediate and output files
|
||||
clean :
|
||||
-erase *.obj
|
||||
-erase $(LIBNAME)
|
||||
|
||||
|
||||
634
bertos/net/nmeap/src/nmeap01.c
Normal file
634
bertos/net/nmeap/src/nmeap01.c
Normal file
|
|
@ -0,0 +1,634 @@
|
|||
/*
|
||||
Copyright (c) 2005, David M Howard (daveh at dmh2000.com)
|
||||
All rights reserved.
|
||||
|
||||
This product is licensed for use and distribution under the BSD Open Source License.
|
||||
see the file COPYING for more details.
|
||||
|
||||
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.
|
||||
|
||||
*/
|
||||
|
||||
/**
|
||||
* nmeap01.c
|
||||
* nmeap gps data parser
|
||||
*
|
||||
* see the file COPYING for terms of the licnese
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <ctype.h>
|
||||
|
||||
#include "../inc/nmeap.h"
|
||||
|
||||
#include <cfg/debug.h>
|
||||
|
||||
#define assert(x) ASSERT(x)
|
||||
|
||||
#include "cfg/cfg_nmea.h"
|
||||
|
||||
#define LOG_LEVEL NMEA_LOG_LEVEL
|
||||
#define LOG_FORMAT NMEA_LOG_FORMAT
|
||||
#include <cfg/log.h>
|
||||
|
||||
#ifdef _DEBUG
|
||||
#undef NDEBUG
|
||||
#define printf(str,...) LOG_INFO(str, ## __VA_ARGS__)
|
||||
#endif
|
||||
|
||||
/* this only works if you are sure you have an upper case hex digit */
|
||||
#define HEXTOBIN(ch) ((ch <= '9') ? ch - '0' : ch - ('A' - 10))
|
||||
|
||||
/* forward references */
|
||||
int nmeap_init(nmeap_context_t *context,void *user_data);
|
||||
int nmeap_addParser(nmeap_context_t *context,
|
||||
const char *sentence_name,
|
||||
nmeap_sentence_parser_t sentence_parser,
|
||||
nmeap_callout_t sentence_callout,
|
||||
void *sentence_data
|
||||
);
|
||||
int nmeap_tokenize(nmeap_context_t *context);
|
||||
int nmeap_process(nmeap_context_t *context);
|
||||
int nmeap_parse(nmeap_context_t *context,char ch);
|
||||
int nmeap_parseBuffer(nmeap_context_t *context,const char *buffer,int *length);
|
||||
|
||||
/**
|
||||
* get a latitude out of a pair of nmea tokens
|
||||
*/
|
||||
double nmeap_latitude(const char *plat,const char *phem)
|
||||
{
|
||||
double lat;
|
||||
int deg;
|
||||
double min;
|
||||
int ns;
|
||||
|
||||
assert(plat != 0);
|
||||
assert(phem != 0);
|
||||
|
||||
if (*plat == 0) {
|
||||
return 0.0;
|
||||
}
|
||||
if (*phem == 0) {
|
||||
return 0.0;
|
||||
}
|
||||
|
||||
/* north lat is +, south lat is - */
|
||||
if (*phem == 'N') {
|
||||
ns = 1;
|
||||
}
|
||||
else {
|
||||
ns = -1;
|
||||
}
|
||||
|
||||
/* latitude is degrees, minutes, fractional minutes */
|
||||
/* no validation is performed on the token. it better be good.*/
|
||||
/* if it comes back 0.0 then probably the token was bad */
|
||||
lat = atof(plat);
|
||||
|
||||
/* extract the degree part */
|
||||
deg = (int)(lat / 100.0);
|
||||
|
||||
/* mask out the degrees */
|
||||
min = lat - (deg * 100.0);
|
||||
|
||||
/* compute the actual latitude in degrees.decimal-degrees */
|
||||
lat = (deg + (min / 60.0)) * ns;
|
||||
|
||||
return lat;
|
||||
}
|
||||
|
||||
/**
|
||||
* get a longitude out of a pair of nmea tokens
|
||||
*/
|
||||
double nmeap_longitude(const char *plon,const char *phem)
|
||||
{
|
||||
double lon;
|
||||
int deg;
|
||||
double min;
|
||||
int ew;
|
||||
|
||||
assert(plon != 0);
|
||||
assert(phem != 0);
|
||||
|
||||
if (*plon == 0) {
|
||||
return 0.0;
|
||||
}
|
||||
if (*phem == 0) {
|
||||
return 0.0;
|
||||
}
|
||||
|
||||
/* west long is negative, east long is positive */
|
||||
if (*phem == 'E') {
|
||||
ew = 1;
|
||||
}
|
||||
else {
|
||||
ew = -1;
|
||||
}
|
||||
|
||||
/* longitude is degrees, minutes, fractional minutes */
|
||||
/* no validation is performed on the token. it better be good.*/
|
||||
/* if it comes back 0.0 then probably the token was bad */
|
||||
lon = atof(plon);
|
||||
|
||||
/* extract the degree part */
|
||||
deg = (int)(lon / 100.0);
|
||||
|
||||
/* mask out the degrees */
|
||||
min = lon - (deg * 100.0);
|
||||
|
||||
/* compute the actual lonitude in degrees.decimal-degrees */
|
||||
lon = (deg + (min / 60.0)) * ew;
|
||||
|
||||
|
||||
return lon;
|
||||
}
|
||||
|
||||
/**
|
||||
* get an altitude longitude out of a pair of nmea tokens
|
||||
* ALTITUDE is returned in METERS
|
||||
*/
|
||||
double nmeap_altitude(const char *palt,const char *punits)
|
||||
{
|
||||
double alt;
|
||||
|
||||
if (*palt == 0) {
|
||||
return 0.0;
|
||||
}
|
||||
|
||||
/* convert with no error checking */
|
||||
alt = atof(palt);
|
||||
|
||||
if (*punits == 'M') {
|
||||
/* already in meters */
|
||||
}
|
||||
else if (*punits == 'F') {
|
||||
/* convert to feet */
|
||||
alt = alt * 3.2808399;
|
||||
}
|
||||
|
||||
return alt;
|
||||
}
|
||||
|
||||
/**
|
||||
* initialize an NMEA parser
|
||||
*/
|
||||
int nmeap_init(nmeap_context_t *context,void *user_data)
|
||||
{
|
||||
assert(context != 0);
|
||||
|
||||
memset(context,0,sizeof(*context));
|
||||
|
||||
context->user_data = user_data;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* register an NMEA sentence parser
|
||||
*/
|
||||
int nmeap_addParser(nmeap_context_t *context,
|
||||
const char *sentence_name,
|
||||
nmeap_sentence_parser_t sentence_parser,
|
||||
nmeap_callout_t sentence_callout,
|
||||
void *sentence_data
|
||||
)
|
||||
{
|
||||
nmeap_sentence_t *s = 0;
|
||||
|
||||
/* runtime error */
|
||||
assert(context != 0);
|
||||
|
||||
/* sentence capacity overflow */
|
||||
if (context->sentence_count >= NMEAP_MAX_SENTENCES) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
/* point at next empty sentence buffer */
|
||||
s = &context->sentence[context->sentence_count];
|
||||
|
||||
/* advance sentence data count */
|
||||
context->sentence_count++;
|
||||
|
||||
/* clear the sentence data */
|
||||
memset(s,0,sizeof(*s));
|
||||
|
||||
/* name */
|
||||
strncpy(s->name,sentence_name,NMEAP_MAX_SENTENCE_NAME_LENGTH);
|
||||
|
||||
/* parser */
|
||||
s->parser = sentence_parser;
|
||||
|
||||
/* callout */
|
||||
s->callout = sentence_callout;
|
||||
|
||||
/* data */
|
||||
s->data = sentence_data;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
/**
|
||||
* tokenize a buffer
|
||||
*/
|
||||
int nmeap_tokenize(nmeap_context_t *context)
|
||||
{
|
||||
char *s;
|
||||
int tokens;
|
||||
int state;
|
||||
|
||||
/* first token is header. assume it is there */
|
||||
tokens = 0;
|
||||
s = context->input;
|
||||
context->token[tokens] = s;
|
||||
|
||||
/* get rest of tokens */
|
||||
tokens = 1;
|
||||
state = 0;
|
||||
while((*s != 0)&&(tokens < NMEAP_MAX_TOKENS)) {
|
||||
switch(state) {
|
||||
case 0:
|
||||
/* looking for end of a token */
|
||||
if (*s == ',') {
|
||||
/* delimit at the comma */
|
||||
*s = 0;
|
||||
/* new token */
|
||||
state = 1;
|
||||
}
|
||||
break;
|
||||
case 1:
|
||||
/* start of next token, might be another comma */
|
||||
context->token[tokens++] = s;
|
||||
if (*s == ',') {
|
||||
/* delimit at the comma */
|
||||
*s = 0;
|
||||
}
|
||||
else {
|
||||
/* not a comma */
|
||||
state = 0;
|
||||
}
|
||||
break;
|
||||
default:
|
||||
state = 0;
|
||||
break;
|
||||
}
|
||||
|
||||
// next character
|
||||
s++;
|
||||
}
|
||||
return tokens;
|
||||
}
|
||||
|
||||
/**
|
||||
* process a sentence
|
||||
*/
|
||||
int nmeap_process(nmeap_context_t *context)
|
||||
{
|
||||
int id = 0;
|
||||
int i;
|
||||
nmeap_sentence_t *s;
|
||||
|
||||
/* copy the input to a debug buffer */
|
||||
/* remove debug_input when everything is working. */
|
||||
strncpy(context->debug_input,context->input,sizeof(context->debug_input));
|
||||
|
||||
/* tokenize the input */
|
||||
context->tokens = nmeap_tokenize(context);
|
||||
|
||||
/* try to find a matching sentence parser */
|
||||
/* this search is O(n). it has a lot of potential for optimization, at the expense of complexity, if you have a lot of sentences */
|
||||
/* binary search instead of linear (have to keep sentences in sorted order) O(NlogN) */
|
||||
/* OR, when sentences are added, create a TRIE structure to find the names with a constant time search O(5) */
|
||||
for(i=0;i<context->sentence_count;i++) {
|
||||
s = &context->sentence[i];
|
||||
assert(s != 0);
|
||||
if (strncmp(context->input_name,s->name,5) == 0) {
|
||||
/* found a match, call its parser */
|
||||
id = (*context->sentence[i].parser)(context,s);
|
||||
if (id > 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return id;
|
||||
}
|
||||
|
||||
/**
|
||||
+-5-+ +---+
|
||||
v | v |
|
||||
+------+ +------+ +------+ +------+ +------+
|
||||
| 0 |--$--> |1-hdr |--alnum--> |2-data|----\r-->| 6-LF |---\n--->| done |--> 0
|
||||
+------+ +------+ +------+ +------+ +------+
|
||||
| ^
|
||||
* +--------\r-------+
|
||||
V |
|
||||
+------+ +------+ +------+
|
||||
|3-cks |--xdigit-->|4-cks |-xdigit->| 5-CR |
|
||||
+------+ +------+ +------+
|
||||
|
||||
return to start conditions:
|
||||
1. buffer overflow
|
||||
2. invalid character for state
|
||||
|
||||
checksum calculation
|
||||
two hex digits represent the XOR of all characters between, but not
|
||||
including, the "$" and "*". A checksum is required on some
|
||||
sentences.
|
||||
|
||||
*/
|
||||
int nmeap_parse(nmeap_context_t *context,char ch)
|
||||
{
|
||||
int status = 0;
|
||||
|
||||
/* check for input buffer overrun first to avoid duplicating code in the
|
||||
individual states
|
||||
*/
|
||||
if ((size_t)context->input_count >= (sizeof(context->input)-1)) {
|
||||
/* input buffer overrun, restart state machine */
|
||||
context->input_state = 0;
|
||||
/* reset input count */
|
||||
context->input_count = 0;
|
||||
}
|
||||
|
||||
/* store the byte */
|
||||
context->input[context->input_count] = ch;
|
||||
|
||||
/* next buffer position */
|
||||
context->input_count++;
|
||||
|
||||
/* run it through the lexical scanner */
|
||||
switch(context->input_state) {
|
||||
/* LOOKING FOR $ */
|
||||
case 0:
|
||||
if (ch == '$') {
|
||||
/*look for id */
|
||||
context->input_state = 1;
|
||||
context->ccks = 0;
|
||||
context->icks = 0;
|
||||
}
|
||||
else {
|
||||
/* header error, start over */
|
||||
context->err_hdr++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR 5 CHARACTER SENTENCE ID */
|
||||
case 1:
|
||||
/* allow numbers even though it isn't usually done */
|
||||
/* a proprietary id might have a numeral */
|
||||
if (isalnum((unsigned char)ch)) {
|
||||
/* store name separately */
|
||||
context->input_name[context->input_count - 2] = ch;
|
||||
/* checksum */
|
||||
context->ccks ^= ch;
|
||||
/* end of header? */
|
||||
if (context->input_count >= 6) {
|
||||
/* yes, get body */
|
||||
context->input_state = 2;
|
||||
}
|
||||
}
|
||||
else {
|
||||
/* bad character, start over */
|
||||
context->err_id++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR CR OR CHECKSUM INDICATOR */
|
||||
case 2:
|
||||
if (ch == '*') {
|
||||
/* this sentence has a checksum */
|
||||
context->input_state = 3;
|
||||
}
|
||||
else if (ch == '\r') {
|
||||
/* carriage return, no checksum, force a match */
|
||||
context->icks = 0;
|
||||
context->ccks = 0;
|
||||
context->input_state = 6;
|
||||
}
|
||||
else {
|
||||
/* continue accumulating data */
|
||||
/* checksum */
|
||||
context->ccks ^= ch;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR FIRST CHECKSUM CHARACTER */
|
||||
case 3:
|
||||
/* must be upper case hex digit */
|
||||
if (isxdigit((unsigned char)ch) && (ch <= 'F')) {
|
||||
/* got first checksum byte */
|
||||
context->input_state = 4;
|
||||
context->icks = HEXTOBIN(ch) << 4;
|
||||
}
|
||||
else {
|
||||
/* input error, restart */
|
||||
context->err_cks++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR SECOND CHECKSUM CHARACTER */
|
||||
case 4:
|
||||
/* must be upper case hex digit */
|
||||
if (isxdigit((unsigned char)ch) && (ch <= 'F')) {
|
||||
/* got second checksum byte */
|
||||
context->input_state = 5;
|
||||
context->icks += HEXTOBIN(ch);
|
||||
}
|
||||
else {
|
||||
/* input error, restart */
|
||||
context->err_cks++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR CR */
|
||||
case 5:
|
||||
if (ch == '\r') {
|
||||
/* carriage return */
|
||||
context->input_state = 6;
|
||||
}
|
||||
else {
|
||||
/* input error, restart */
|
||||
context->err_crl++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
/* LOOKING FOR LINE FEED */
|
||||
case 6:
|
||||
if (ch == '\n') {
|
||||
/* linefeed, line complete */
|
||||
|
||||
/* delimit buffer */
|
||||
context->input[context->input_count] = 0;
|
||||
|
||||
/* if the checksums match, process the sentence */
|
||||
if (context->ccks == context->icks) {
|
||||
/* process */
|
||||
status = nmeap_process(context);
|
||||
|
||||
/* count good messages */
|
||||
context->msgs++;
|
||||
}
|
||||
else {
|
||||
/* count checksum errors */
|
||||
context->err_cks++;
|
||||
}
|
||||
|
||||
/* restart next time */
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
else {
|
||||
/* input error, restart */
|
||||
context->err_crl++;
|
||||
context->input_state = 0;
|
||||
context->input_count = 0;
|
||||
}
|
||||
break;
|
||||
default:
|
||||
context->err_unk++;
|
||||
context->input_state = 0;
|
||||
break;
|
||||
}
|
||||
|
||||
return status;
|
||||
}
|
||||
|
||||
/**
|
||||
* parse a buffer of nmea data
|
||||
*/
|
||||
int nmeap_parseBuffer(nmeap_context_t *context,const char *buffer,int *length)
|
||||
{
|
||||
int i;
|
||||
int status;
|
||||
int rem;
|
||||
int tlen;
|
||||
|
||||
tlen = *length;
|
||||
rem = *length;
|
||||
status = 0;
|
||||
/* for each byte in the buffer */
|
||||
for(i=0;i<tlen;i++) {
|
||||
/* decrement remaining byte count */
|
||||
rem--;
|
||||
/* parse the byte */
|
||||
status = nmeap_parse(context,buffer[i]);
|
||||
if (status != 0) {
|
||||
/* message found or error */
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
/* return remaining byte count */
|
||||
*length = rem;
|
||||
|
||||
return status;
|
||||
}
|
||||
|
||||
/**
|
||||
* standard GPGGA sentence parser
|
||||
*/
|
||||
int nmeap_gpgga(nmeap_context_t *context,nmeap_sentence_t *sentence)
|
||||
{
|
||||
#ifndef NDEBUG
|
||||
int i;
|
||||
#endif
|
||||
|
||||
/* get pointer to sentence data */
|
||||
nmeap_gga_t *gga = (nmeap_gga_t *)sentence->data;
|
||||
|
||||
/* if there is a data element, extract data from the tokens */
|
||||
if (gga != 0) {
|
||||
gga->latitude = nmeap_latitude(context->token[2],context->token[3]);
|
||||
gga->longitude = nmeap_longitude(context->token[4],context->token[5]);
|
||||
gga->altitude = nmeap_altitude(context->token[9],context->token[10]);
|
||||
gga->time = atoi(context->token[1]);
|
||||
gga->satellites = atoi(context->token[7]);
|
||||
gga->quality = atoi(context->token[6]);
|
||||
gga->hdop = atof(context->token[8]);
|
||||
gga->geoid = nmeap_altitude(context->token[11],context->token[12]);
|
||||
}
|
||||
|
||||
#ifndef NDEBUG
|
||||
/* print raw input string */
|
||||
printf("%s",context->debug_input);
|
||||
|
||||
/* print some validation data */
|
||||
printf("%s==%s %02x==%02x\n",context->input_name,sentence->name,context->icks,context->ccks);
|
||||
|
||||
/* print the tokens */
|
||||
for(i=0;i<context->tokens;i++) {
|
||||
printf("%d:%s\n",i,context->token[i]);
|
||||
}
|
||||
#endif
|
||||
|
||||
/* if the sentence has a callout, call it */
|
||||
if (sentence->callout != 0) {
|
||||
(*sentence->callout)(context,gga,context->user_data);
|
||||
}
|
||||
|
||||
return NMEAP_GPGGA;
|
||||
}
|
||||
|
||||
/**
|
||||
* standard GPRMCntence parser
|
||||
*/
|
||||
int nmeap_gprmc(nmeap_context_t *context,nmeap_sentence_t *sentence)
|
||||
{
|
||||
#ifndef NDEBUG
|
||||
int i;
|
||||
#endif
|
||||
|
||||
/* get pointer to sentence data */
|
||||
nmeap_rmc_t *rmc = (nmeap_rmc_t *)sentence->data;
|
||||
|
||||
/* if there is a data element, use it */
|
||||
if (rmc != 0) {
|
||||
/* extract data from the tokens */
|
||||
rmc->time = atoi(context->token[1]);
|
||||
rmc->warn = *context->token[2];
|
||||
rmc->latitude = nmeap_latitude(context->token[3],context->token[4]);
|
||||
rmc->longitude = nmeap_longitude(context->token[5],context->token[6]);
|
||||
rmc->speed = atof(context->token[7]);
|
||||
rmc->course = atof(context->token[8]);
|
||||
rmc->date = atoi(context->token[9]);
|
||||
rmc->magvar = atof(context->token[10]);
|
||||
}
|
||||
|
||||
#ifndef NDEBUG
|
||||
/* print raw input string */
|
||||
printf("%s",context->debug_input);
|
||||
|
||||
/* print some validation data */
|
||||
printf("%s==%s %02x==%02x\n",context->input_name,sentence->name,context->icks,context->ccks);
|
||||
|
||||
/* print the tokens */
|
||||
for(i=0;i<context->tokens;i++) {
|
||||
printf("%d:%s\n",i,context->token[i]);
|
||||
}
|
||||
#endif
|
||||
|
||||
/* if the sentence has a callout, call it */
|
||||
if (sentence->callout != 0) {
|
||||
(*sentence->callout)(context,rmc,context->user_data);
|
||||
}
|
||||
|
||||
return NMEAP_GPRMC;
|
||||
}
|
||||
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue